Home
last modified time | relevance | path

Searched refs:roots (Results 1 – 25 of 26) sorted by relevance

12

/linux-6.3-rc2/fs/btrfs/tests/
A Dqgroup-tests.c238 old_roots = ctx.roots; in test_no_shared_qgroup()
239 ctx.roots = NULL; in test_no_shared_qgroup()
255 ctx.roots = NULL; in test_no_shared_qgroup()
280 ctx.roots = NULL; in test_no_shared_qgroup()
295 ctx.roots = NULL; in test_no_shared_qgroup()
351 ctx.roots = NULL; in test_multiple_refs()
367 ctx.roots = NULL; in test_multiple_refs()
388 ctx.roots = NULL; in test_multiple_refs()
404 ctx.roots = NULL; in test_multiple_refs()
431 ctx.roots = NULL; in test_multiple_refs()
[all …]
/linux-6.3-rc2/security/selinux/ss/
A Dsidtab.c38 memset(s->roots, 0, sizeof(s->roots)); in sidtab_init()
164 if (!s->roots[0].ptr_leaf) { in sidtab_alloc_roots()
165 s->roots[0].ptr_leaf = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
167 if (!s->roots[0].ptr_leaf) in sidtab_alloc_roots()
171 if (!s->roots[l].ptr_inner) { in sidtab_alloc_roots()
174 if (!s->roots[l].ptr_inner) in sidtab_alloc_roots()
176 s->roots[l].ptr_inner->entries[0] = s->roots[l - 1]; in sidtab_alloc_roots()
196 entry = &s->roots[level]; in sidtab_do_lookup()
463 &s->roots[level], &pos, count, level, params); in sidtab_convert()
545 while (level && !s->roots[level].ptr_inner) in sidtab_destroy()
[all …]
A Dsidtab.h80 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
/linux-6.3-rc2/lib/
A Dbch.c577 unsigned int *roots) in find_affine4_roots() argument
613 unsigned int *roots) in find_poly_deg1_roots() argument
628 unsigned int *roots) in find_poly_deg2_roots() argument
670 unsigned int *roots) in find_poly_deg3_roots() argument
703 unsigned int *roots) in find_poly_deg4_roots() argument
755 f = a ? gf_inv(bch, roots[i]) : roots[i]; in find_poly_deg4_roots()
1243 roots = bch_alloc((bch->n+1)*sizeof(*roots), &err); in compute_generator_polynomial()
1253 memset(roots , 0, (bch->n+1)*sizeof(*roots)); in compute_generator_polynomial()
1256 roots[r] = 1; in compute_generator_polynomial()
1264 if (roots[i]) { in compute_generator_polynomial()
[all …]
/linux-6.3-rc2/drivers/md/
A Ddm-verity-fec.c50 for (i = 0; i < v->fec->roots; i++) in fec_decode_rs8()
67 position = (index + rsb) * v->fec->roots; in fec_read_parity()
156 offset += v->fec->roots; in fec_decode_bufs()
258 if (neras && *neras <= v->fec->roots) in fec_read_bufs()
276 if (neras && *neras <= v->fec->roots && in fec_read_bufs()
538 v->fec->roots); in verity_fec_status_table()
641 v->fec->roots = num_c; in verity_fec_parse_opt_args()
710 if (!f->roots) { in verity_fec_ctr()
714 f->rsn = DM_VERITY_FEC_RSM - f->roots; in verity_fec_ctr()
748 f->io_size = v->fec->roots << SECTOR_SHIFT; in verity_fec_ctr()
[all …]
A Ddm-verity-fec.h44 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
/linux-6.3-rc2/drivers/gpu/drm/
A Ddrm_buddy.c131 mm->roots = kmalloc_array(mm->n_roots, in drm_buddy_init()
134 if (!mm->roots) in drm_buddy_init()
161 mm->roots[i] = root; in drm_buddy_init()
172 drm_block_free(mm, mm->roots[i]); in drm_buddy_init()
173 kfree(mm->roots); in drm_buddy_init()
192 WARN_ON(!drm_buddy_block_is_free(mm->roots[i])); in drm_buddy_fini()
193 drm_block_free(mm, mm->roots[i]); in drm_buddy_fini()
198 kfree(mm->roots); in drm_buddy_fini()
344 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in alloc_range_bias()
567 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in __drm_buddy_alloc_range()
/linux-6.3-rc2/Documentation/core-api/
A Dlibrs.rst47 * primitive element to generate roots = 1
48 * generator polynomial degree (number of roots) = 6
74 /* Parity buffer. Size = number of roots */
107 /* Parity buffer. Size = number of roots */
124 /* Parity buffer. Size = number of roots */
146 /* Parity buffer. Size = number of roots */
/linux-6.3-rc2/fs/btrfs/
A Dref-verify.c72 struct rb_root roots; member
242 while ((n = rb_first(&be->roots))) { in free_block_entry()
244 rb_erase(&re->node, &be->roots); in free_block_entry()
289 exist_re = insert_root_entry(&exist->roots, re); in add_block_entry()
302 be->roots = RB_ROOT; in add_block_entry()
306 insert_root_entry(&be->roots, re); in add_block_entry()
343 re = lookup_root_entry(&be->roots, ref_root); in add_tree_block()
421 re = lookup_root_entry(&be->roots, ref_root); in add_extent_data_ref()
644 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
807 tmp = insert_root_entry(&be->roots, re); in btrfs_ref_tree_mod()
[all …]
A Dbackref.c1407 ASSERT(ctx->roots == NULL); in find_parent_nodes()
1757 if (!ctx->roots) { in btrfs_find_all_roots_safe()
1759 if (!ctx->roots) { in btrfs_find_all_roots_safe()
1776 ulist_free(ctx->roots); in btrfs_find_all_roots_safe()
1777 ctx->roots = NULL; in btrfs_find_all_roots_safe()
2381 ASSERT(ctx->roots == NULL); in iterate_extent_inodes()
2440 if (!ctx->roots) { in iterate_extent_inodes()
2442 if (!ctx->roots) { in iterate_extent_inodes()
2466 ulist_reinit(ctx->roots); in iterate_extent_inodes()
2479 ulist_free(ctx->roots); in iterate_extent_inodes()
[all …]
A Dqgroup.c1844 qrecord->old_roots = ctx.roots; in btrfs_qgroup_trace_extent_post()
2440 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt() argument
2450 if (!roots) in qgroup_update_refcnt()
2453 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2624 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2630 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2634 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
2785 record->old_roots = ctx.roots; in btrfs_qgroup_account_extents()
2786 ctx.roots = NULL; in btrfs_qgroup_account_extents()
2804 new_roots = ctx.roots; in btrfs_qgroup_account_extents()
[all …]
A Dbackref.h90 struct ulist *roots; member
/linux-6.3-rc2/include/drm/
A Ddrm_buddy.h75 struct drm_buddy_block **roots; member
/linux-6.3-rc2/Documentation/filesystems/
A Dbtrfs.rst19 * Subvolumes (separate internal filesystem roots)
A Dpath-lookup.txt299 lookups, and to assume dentry mount points and mount roots are stable up and
/linux-6.3-rc2/Documentation/trace/
A Dosnoise-tracer.rst20 cause of any gap between two different reads of the time roots either on
171 The reason roots in the overhead of the entry and exit code that happens
/linux-6.3-rc2/Documentation/admin-guide/device-mapper/
A Dverity.rst108 Number of generator roots. This equals to the number of parity bytes in
109 the encoding data. For example, in RS(M, N) encoding, the number of roots
/linux-6.3-rc2/Documentation/kbuild/
A Dkbuild.rst216 relocations required by build roots. This is not defined in the
/linux-6.3-rc2/drivers/gpu/drm/tests/
A Ddrm_buddy_test.c229 root = mm->roots[i]; in check_mm()
/linux-6.3-rc2/Documentation/virt/kvm/x86/
A Dmmu.rst361 - look up new shadow roots
367 - look up new shadow roots
/linux-6.3-rc2/Documentation/filesystems/nfs/
A Dexporting.rst75 b. A primitive for creation of secondary roots - d_obtain_root(inode).
/linux-6.3-rc2/LICENSES/preferred/
A DLGPL-2.0181 (For example, a function in a library to compute square roots has a
186 function must still compute square roots.)
A DLGPL-2.1193 (For example, a function in a library to compute square roots has a
198 function must still compute square roots.)
/linux-6.3-rc2/Documentation/virt/uml/
A Duser_mode_linux_howto_v2.rst808 (mconsole) config ubd3=/home/jdike/incoming/roots/root_fs_debian22
/linux-6.3-rc2/Documentation/admin-guide/
A Dreporting-issues.rst1673 for the subsystem where the issue seems to have its roots; CC the mailing list

Completed in 92 milliseconds

12