Home
last modified time | relevance | path

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

12

/Linux-v6.1/security/selinux/ss/
Dsidtab.c37 memset(s->roots, 0, sizeof(s->roots)); in sidtab_init()
163 if (!s->roots[0].ptr_leaf) { in sidtab_alloc_roots()
164 s->roots[0].ptr_leaf = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
166 if (!s->roots[0].ptr_leaf) in sidtab_alloc_roots()
170 if (!s->roots[l].ptr_inner) { in sidtab_alloc_roots()
171 s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
173 if (!s->roots[l].ptr_inner) in sidtab_alloc_roots()
175 s->roots[l].ptr_inner->entries[0] = s->roots[l - 1]; in sidtab_alloc_roots()
195 entry = &s->roots[level]; in sidtab_do_lookup()
457 rc = sidtab_convert_tree(&params->target->roots[level], in sidtab_convert()
[all …]
Dsidtab.h81 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
/Linux-v6.1/lib/
Dbch.c577 unsigned int *roots) in find_affine4_roots() argument
606 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots()
613 unsigned int *roots) in find_poly_deg1_roots() argument
619 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
628 unsigned int *roots) in find_poly_deg2_roots() argument
657 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
659 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
670 unsigned int *roots) in find_poly_deg3_roots() argument
692 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots()
703 unsigned int *roots) in find_poly_deg4_roots() argument
[all …]
/Linux-v6.1/drivers/md/
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()
572 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); in fec_rs_alloc()
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()
[all …]
Ddm-verity-fec.h44 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
/Linux-v6.1/drivers/gpu/drm/
Ddrm_buddy.c113 mm->roots = kmalloc_array(mm->n_roots, in drm_buddy_init()
116 if (!mm->roots) in drm_buddy_init()
143 mm->roots[i] = root; in drm_buddy_init()
154 drm_block_free(mm, mm->roots[i]); in drm_buddy_init()
155 kfree(mm->roots); in drm_buddy_init()
174 WARN_ON(!drm_buddy_block_is_free(mm->roots[i])); in drm_buddy_fini()
175 drm_block_free(mm, mm->roots[i]); in drm_buddy_fini()
180 kfree(mm->roots); in drm_buddy_fini()
326 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in alloc_range_bias()
540 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in __drm_buddy_alloc_range()
/Linux-v6.1/Documentation/core-api/
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-v6.1/fs/btrfs/
Dref-verify.c69 struct rb_root roots; member
239 while ((n = rb_first(&be->roots))) { in free_block_entry()
241 rb_erase(&re->node, &be->roots); in free_block_entry()
286 exist_re = insert_root_entry(&exist->roots, re); in add_block_entry()
299 be->roots = RB_ROOT; in add_block_entry()
303 insert_root_entry(&be->roots, re); in add_block_entry()
340 re = lookup_root_entry(&be->roots, ref_root); in add_tree_block()
418 re = lookup_root_entry(&be->roots, ref_root); in add_extent_data_ref()
641 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
804 tmp = insert_root_entry(&be->roots, re); in btrfs_ref_tree_mod()
[all …]
Dbackref.c1204 struct ulist *roots, const u64 *extent_item_pos, in find_parent_nodes() argument
1350 if (roots && ref->count && ref->root_id && ref->parent == 0) { in find_parent_nodes()
1358 ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS); in find_parent_nodes()
1488 u64 time_seq, struct ulist **roots, in btrfs_find_all_roots_safe() argument
1499 *roots = ulist_alloc(GFP_NOFS); in btrfs_find_all_roots_safe()
1500 if (!*roots) { in btrfs_find_all_roots_safe()
1508 tmp, *roots, NULL, NULL, ignore_offset); in btrfs_find_all_roots_safe()
1511 ulist_free(*roots); in btrfs_find_all_roots_safe()
1512 *roots = NULL; in btrfs_find_all_roots_safe()
1528 u64 time_seq, struct ulist **roots, in btrfs_find_all_roots() argument
[all …]
Dbackref.h64 u64 time_seq, struct ulist **roots,
82 struct ulist *roots, struct ulist *tmp,
Dqgroup.c2431 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt() argument
2441 if (!roots) in qgroup_update_refcnt()
2444 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2615 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2621 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2625 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3244 struct ulist *roots = NULL; in qgroup_rescan_leaf() local
3304 &roots, false); in qgroup_rescan_leaf()
3309 num_bytes, NULL, roots); in qgroup_rescan_leaf()
Dextent_io.c3711 struct ulist *roots, struct ulist *tmp_ulist, in fiemap_process_hole() argument
3757 extent_gen, roots, in fiemap_process_hole()
3807 extent_gen, roots, in fiemap_process_hole()
3910 struct ulist *roots; in extent_fiemap() local
3921 roots = ulist_alloc(GFP_KERNEL); in extent_fiemap()
3923 if (!backref_cache || !path || !roots || !tmp_ulist) { in extent_fiemap()
3984 roots, tmp_ulist, in extent_fiemap()
4026 extent_gen, roots, tmp_ulist, in extent_fiemap()
4032 roots, tmp_ulist, in extent_fiemap()
4040 roots, in extent_fiemap()
[all …]
/Linux-v6.1/include/drm/
Ddrm_buddy.h75 struct drm_buddy_block **roots; member
/Linux-v6.1/Documentation/filesystems/
Dbtrfs.rst19 * Subvolumes (separate internal filesystem roots)
Dpath-lookup.txt299 lookups, and to assume dentry mount points and mount roots are stable up and
/Linux-v6.1/Documentation/trace/
Dosnoise-tracer.rst20 cause of any gap between two different reads of the time roots either on
150 The reason roots in the overhead of the entry and exit code that happens
/Linux-v6.1/Documentation/admin-guide/device-mapper/
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-v6.1/Documentation/kbuild/
Dkbuild.rst216 relocations required by build roots. This is not defined in the
/Linux-v6.1/drivers/gpu/drm/tests/
Ddrm_buddy_test.c229 root = mm->roots[i]; in check_mm()
/Linux-v6.1/Documentation/virt/kvm/x86/
Dmmu.rst361 - look up new shadow roots
367 - look up new shadow roots
/Linux-v6.1/Documentation/filesystems/nfs/
Dexporting.rst75 b. A primitive for creation of secondary roots - d_obtain_root(inode).
/Linux-v6.1/LICENSES/preferred/
DLGPL-2.0181 (For example, a function in a library to compute square roots has a
186 function must still compute square roots.)
DLGPL-2.1193 (For example, a function in a library to compute square roots has a
198 function must still compute square roots.)
/Linux-v6.1/Documentation/virt/uml/
Duser_mode_linux_howto_v2.rst808 (mconsole) config ubd3=/home/jdike/incoming/roots/root_fs_debian22
/Linux-v6.1/Documentation/admin-guide/
Dreporting-issues.rst1673 for the subsystem where the issue seems to have its roots; CC the mailing list

12