Home
last modified time | relevance | path

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

12

/linux/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/security/selinux/ss/
A 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()
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()
458 &s->roots[level], &pos, count, level, params); in sidtab_convert()
540 while (level && !s->roots[level].ptr_inner) in sidtab_destroy()
[all …]
A Dsidtab.h81 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
/linux/drivers/gpu/drm/i915/
A Di915_buddy.c103 mm->roots = kmalloc_array(mm->n_roots, in i915_buddy_init()
106 if (!mm->roots) in i915_buddy_init()
133 mm->roots[i] = root; in i915_buddy_init()
144 i915_block_free(mm, mm->roots[i]); in i915_buddy_init()
145 kfree(mm->roots); in i915_buddy_init()
156 GEM_WARN_ON(!i915_buddy_block_is_free(mm->roots[i])); in i915_buddy_fini()
157 i915_block_free(mm, mm->roots[i]); in i915_buddy_fini()
162 kfree(mm->roots); in i915_buddy_fini()
343 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in i915_buddy_alloc_range()
A Di915_buddy.h62 struct i915_buddy_block **roots; member
/linux/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/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/fs/btrfs/
A 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 …]
A Dbackref.c1461 *roots = ulist_alloc(GFP_NOFS);
1462 if (!*roots) {
1473 ulist_free(*roots);
1474 *roots = NULL;
1498 time_seq, roots, false);
1539 ulist_init(roots);
1557 roots, NULL, &shared, false);
1581 ulist_release(roots);
1954 struct ulist *roots = NULL; local
1988 seq_elem.seq, &roots,
[all …]
A Dbackref.h50 u64 time_seq, struct ulist **roots,
67 struct ulist *roots, struct ulist *tmp_ulist);
A Dqgroup.c2328 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt() argument
2338 if (!roots) in qgroup_update_refcnt()
2341 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2512 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2518 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2522 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3147 struct ulist *roots = NULL; in qgroup_rescan_leaf() local
3205 &roots, false); in qgroup_rescan_leaf()
3210 num_bytes, NULL, roots); in qgroup_rescan_leaf()
A Dextent_io.c5563 struct ulist *roots; in extent_fiemap() local
5577 roots = ulist_alloc(GFP_KERNEL); in extent_fiemap()
5579 if (!roots || !tmp_ulist) { in extent_fiemap()
5707 bytenr, roots, tmp_ulist); in extent_fiemap()
5755 ulist_free(roots); in extent_fiemap()
/linux/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/Documentation/trace/
A 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/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/drivers/gpu/drm/i915/selftests/
A Di915_buddy.c202 root = mm->roots[i]; in igt_check_mm()
/linux/Documentation/kbuild/
A Dkbuild.rst188 relocations required by build roots. This is not defined in the
/linux/Documentation/virt/kvm/
A Dmmu.rst357 - look up new shadow roots
363 - look up new shadow roots
/linux/Documentation/filesystems/nfs/
A Dexporting.rst75 b. A primitive for creation of secondary roots - d_obtain_root(inode).
/linux/LICENSES/preferred/
A DLGPL-2.1191 (For example, a function in a library to compute square roots has a
196 function must still compute square roots.)
A DLGPL-2.0181 (For example, a function in a library to compute square roots has a
186 function must still compute square roots.)
/linux/Documentation/virt/uml/
A Duser_mode_linux_howto_v2.rst804 (mconsole) config ubd3=/home/jdike/incoming/roots/root_fs_debian22
/linux/Documentation/admin-guide/
A Dcgroup-v2.rst2109 partition roots themselves and their descendants. The root

Completed in 84 milliseconds

12