| /kernel/linux/linux-5.10/security/selinux/ss/ |
| D | sidtab.c | 37 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(¶ms->target->roots[level], in sidtab_convert()
[all …]
|
| D | sidtab.h | 81 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
|
| /kernel/linux/linux-5.10/lib/ |
| D | bch.c | 577 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 …]
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/ |
| D | i915_buddy.c | 126 mm->roots = kmalloc_array(mm->n_roots, in i915_buddy_init()
129 if (!mm->roots) in i915_buddy_init()
156 mm->roots[i] = root; in i915_buddy_init()
167 i915_block_free(mm->roots[i]); in i915_buddy_init()
168 kfree(mm->roots); in i915_buddy_init()
179 GEM_WARN_ON(!i915_buddy_block_is_free(mm->roots[i])); in i915_buddy_fini()
180 i915_block_free(mm->roots[i]); in i915_buddy_fini()
183 kfree(mm->roots); in i915_buddy_fini()
362 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in i915_buddy_alloc_range()
|
| D | i915_buddy.h | 56 struct i915_buddy_block **roots; member
|
| /kernel/linux/linux-5.10/drivers/md/ |
| D | dm-verity-fec.c | 50 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 …]
|
| D | dm-verity-fec.h | 44 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
|
| /kernel/linux/linux-5.10/Documentation/core-api/ |
| D | librs.rst | 47 * 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 */
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| D | ref-verify.c | 69 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()
653 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
820 tmp = insert_root_entry(&be->roots, re); in btrfs_ref_tree_mod()
[all …]
|
| D | backref.c | 1205 struct ulist *roots, const u64 *extent_item_pos, argument
1357 if (roots && ref->count && ref->root_id && ref->parent == 0) {
1365 ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);
1496 u64 time_seq, struct ulist **roots, argument
1507 *roots = ulist_alloc(GFP_NOFS);
1508 if (!*roots) {
1516 tmp, *roots, NULL, NULL, ignore_offset);
1519 ulist_free(*roots);
1520 *roots = NULL;
1536 u64 time_seq, struct ulist **roots, argument
[all …]
|
| D | backref.h | 49 u64 time_seq, struct ulist **roots, bool ignore_offset);
65 struct ulist *roots, struct ulist *tmp_ulist);
|
| D | qgroup.c | 2393 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt() argument
2403 if (!roots) in qgroup_update_refcnt()
2406 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2577 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2583 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2587 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3214 struct ulist *roots = NULL; in qgroup_rescan_leaf() local
3272 &roots, false); in qgroup_rescan_leaf()
3277 num_bytes, NULL, roots); in qgroup_rescan_leaf()
|
| D | extent_io.c | 4685 struct ulist *roots; in extent_fiemap() local
4700 roots = ulist_alloc(GFP_KERNEL); in extent_fiemap()
4702 if (!roots || !tmp_ulist) { in extent_fiemap()
4830 bytenr, roots, tmp_ulist); in extent_fiemap()
4878 ulist_free(roots); in extent_fiemap()
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ |
| D | btrfs.rst | 19 * Subvolumes (separate internal filesystem roots)
|
| D | path-lookup.txt | 299 lookups, and to assume dentry mount points and mount roots are stable up and
|
| /kernel/linux/linux-5.10/Documentation/admin-guide/device-mapper/ |
| D | verity.rst | 108 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
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/selftests/ |
| D | i915_buddy.c | 204 root = mm->roots[i]; in igt_check_mm()
|
| /kernel/linux/linux-5.10/Documentation/kbuild/ |
| D | kbuild.rst | 188 relocations required by build roots. This is not defined in the
|
| /kernel/linux/linux-5.10/Documentation/filesystems/nfs/ |
| D | exporting.rst | 75 b. A primitive for creation of secondary roots - d_obtain_root(inode).
|
| /kernel/linux/linux-5.10/Documentation/virt/kvm/ |
| D | mmu.rst | 360 - look up new shadow roots
366 - look up new shadow roots
|
| /kernel/linux/linux-5.10/LICENSES/preferred/ |
| D | LGPL-2.1 | 191 (For example, a function in a library to compute square roots has a
196 function must still compute square roots.)
|
| D | LGPL-2.0 | 181 (For example, a function in a library to compute square roots has a
186 function must still compute square roots.)
|
| /kernel/linux/linux-5.10/Documentation/virt/uml/ |
| D | user_mode_linux_howto_v2.rst | 799 (mconsole) config ubd3=/home/jdike/incoming/roots/root_fs_debian22
|
| /kernel/linux/linux-5.10/Documentation/admin-guide/ |
| D | cgroup-v2.rst | 2000 partition roots themselves and their descendants. The root
|