| /Linux-v5.4/security/selinux/ss/ |
| D | sidtab.c | 24 memset(s->roots, 0, sizeof(s->roots)); in sidtab_init()
74 if (!s->roots[0].ptr_leaf) { in sidtab_alloc_roots()
75 s->roots[0].ptr_leaf = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
77 if (!s->roots[0].ptr_leaf) in sidtab_alloc_roots()
81 if (!s->roots[l].ptr_inner) { in sidtab_alloc_roots()
82 s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
84 if (!s->roots[l].ptr_inner) in sidtab_alloc_roots()
86 s->roots[l].ptr_inner->entries[0] = s->roots[l - 1]; in sidtab_alloc_roots()
105 entry = &s->roots[level]; in sidtab_do_lookup()
260 rc = sidtab_find_context(s->roots[level], &pos, count, level, in sidtab_reverse_lookup()
[all …]
|
| D | sidtab.h | 76 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
|
| /Linux-v5.4/lib/ |
| D | bch.c | 520 unsigned int *roots) in find_affine4_roots() argument
549 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots()
556 unsigned int *roots) in find_poly_deg1_roots() argument
562 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
571 unsigned int *roots) in find_poly_deg2_roots() argument
600 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
602 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
613 unsigned int *roots) in find_poly_deg3_roots() argument
635 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots()
646 unsigned int *roots) in find_poly_deg4_roots() argument
[all …]
|
| /Linux-v5.4/drivers/gpu/drm/i915/ |
| D | i915_buddy.c | 125 mm->roots = kmalloc_array(mm->n_roots, in i915_buddy_init()
128 if (!mm->roots) in i915_buddy_init()
155 mm->roots[i] = root; in i915_buddy_init()
166 i915_block_free(mm->roots[i]); in i915_buddy_init()
167 kfree(mm->roots); in i915_buddy_init()
178 GEM_WARN_ON(!i915_buddy_block_is_free(mm->roots[i])); in i915_buddy_fini()
179 i915_block_free(mm->roots[i]); in i915_buddy_fini()
182 kfree(mm->roots); in i915_buddy_fini()
358 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
|
| /Linux-v5.4/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()
157 offset += v->fec->roots; in fec_decode_bufs()
259 if (neras && *neras <= v->fec->roots) in fec_read_bufs()
277 if (neras && *neras <= v->fec->roots && in fec_read_bufs()
539 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 | 43 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
|
| /Linux-v5.4/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 */
|
| /Linux-v5.4/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()
297 be->roots = RB_ROOT; in add_block_entry()
301 insert_root_entry(&be->roots, re); in add_block_entry()
338 re = lookup_root_entry(&be->roots, ref_root); in add_tree_block()
416 re = lookup_root_entry(&be->roots, ref_root); in add_extent_data_ref()
651 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
806 tmp = insert_root_entry(&be->roots, re); in btrfs_ref_tree_mod()
[all …]
|
| D | backref.h | 45 u64 time_seq, struct ulist **roots, bool ignore_offset);
61 struct ulist *roots, struct ulist *tmp_ulist);
|
| D | backref.c | 1116 struct ulist *roots, const u64 *extent_item_pos, argument
1266 if (roots && ref->count && ref->root_id && ref->parent == 0) {
1274 ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);
1401 u64 time_seq, struct ulist **roots, argument
1412 *roots = ulist_alloc(GFP_NOFS);
1413 if (!*roots) {
1421 tmp, *roots, NULL, NULL, ignore_offset);
1424 ulist_free(*roots);
1440 u64 time_seq, struct ulist **roots, argument
1448 time_seq, roots, ignore_offset);
[all …]
|
| D | qgroup.c | 2208 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt() argument
2218 if (!roots) in qgroup_update_refcnt()
2221 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2392 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2398 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2402 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3050 struct ulist *roots = NULL; in qgroup_rescan_leaf() local
3108 &roots, false); in qgroup_rescan_leaf()
3113 num_bytes, NULL, roots); in qgroup_rescan_leaf()
|
| D | extent_io.c | 4610 struct ulist *roots; in extent_fiemap() local
4625 roots = ulist_alloc(GFP_KERNEL); in extent_fiemap()
4627 if (!roots || !tmp_ulist) { in extent_fiemap()
4751 bytenr, roots, tmp_ulist); in extent_fiemap()
4799 ulist_free(roots); in extent_fiemap()
|
| /Linux-v5.4/Documentation/filesystems/ |
| D | btrfs.txt | 16 * Subvolumes (separate internal filesystem roots)
|
| D | path-lookup.txt | 299 lookups, and to assume dentry mount points and mount roots are stable up and
|
| /Linux-v5.4/Documentation/admin-guide/device-mapper/ |
| D | verity.rst | 104 Number of generator roots. This equals to the number of parity bytes in
105 the encoding data. For example, in RS(M, N) encoding, the number of roots
|
| /Linux-v5.4/drivers/gpu/drm/i915/selftests/ |
| D | i915_buddy.c | 206 root = mm->roots[i]; in igt_check_mm()
|
| /Linux-v5.4/Documentation/kbuild/ |
| D | kbuild.rst | 188 relocations required by build roots. This is not defined in the
|
| /Linux-v5.4/Documentation/filesystems/nfs/ |
| D | exporting.rst | 75 b. A primitive for creation of secondary roots - d_obtain_root(inode).
|
| /Linux-v5.4/Documentation/virt/kvm/ |
| D | mmu.txt | 327 - look up new shadow roots
332 - look up new shadow roots
|
| /Linux-v5.4/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.)
|
| /Linux-v5.4/Documentation/admin-guide/ |
| D | cgroup-v2.rst | 1929 partition roots themselves and their descendants. The root
|
| /Linux-v5.4/Documentation/virt/uml/ |
| D | UserModeLinux-HOWTO.txt | 2370 config ubd3=/home/jdike/incoming/roots/root_fs_debian22
|
