| /Linux-v4.19/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-v4.19/drivers/md/ |
| D | dm-verity-fec.c | 54 for (i = 0; i < v->fec->roots; i++) in fec_decode_rs8()
71 position = (index + rsb) * v->fec->roots; in fec_read_parity()
161 offset += v->fec->roots; in fec_decode_bufs()
260 if (neras && *neras <= v->fec->roots) in fec_read_bufs()
278 if (neras && *neras <= v->fec->roots && in fec_read_bufs()
540 v->fec->roots); in verity_fec_status_table()
573 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); in fec_rs_alloc()
642 v->fec->roots = num_c; in verity_fec_parse_opt_args()
711 if (!f->roots) { in verity_fec_ctr()
715 f->rsn = DM_VERITY_FEC_RSM - f->roots; in verity_fec_ctr()
[all …]
|
| D | dm-verity-fec.h | 47 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
|
| /Linux-v4.19/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-v4.19/fs/btrfs/ |
| D | ref-verify.c | 69 struct rb_root roots; member
250 while ((n = rb_first(&be->roots))) { in free_block_entry()
252 rb_erase(&re->node, &be->roots); in free_block_entry()
297 exist_re = insert_root_entry(&exist->roots, re); in add_block_entry()
308 be->roots = RB_ROOT; in add_block_entry()
312 insert_root_entry(&be->roots, re); in add_block_entry()
349 re = lookup_root_entry(&be->roots, ref_root); in add_tree_block()
427 re = lookup_root_entry(&be->roots, ref_root); in add_extent_data_ref()
661 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
809 tmp = insert_root_entry(&be->roots, re); in btrfs_ref_tree_mod()
[all …]
|
| D | backref.c | 1112 struct ulist *roots, const u64 *extent_item_pos, argument
1262 if (roots && ref->count && ref->root_id && ref->parent == 0) {
1270 ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);
1393 u64 time_seq, struct ulist **roots, argument
1404 *roots = ulist_alloc(GFP_NOFS);
1405 if (!*roots) {
1413 tmp, *roots, NULL, NULL, ignore_offset);
1416 ulist_free(*roots);
1432 u64 time_seq, struct ulist **roots, argument
1440 time_seq, roots, ignore_offset);
[all …]
|
| D | backref.h | 45 u64 time_seq, struct ulist **roots, bool ignore_offset);
|
| D | qgroup.c | 1834 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt() argument
1844 if (!roots) in qgroup_update_refcnt()
1847 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2018 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2024 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2028 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
2648 struct ulist *roots = NULL; in qgroup_rescan_leaf() local
2709 &roots, false); in qgroup_rescan_leaf()
2714 num_bytes, NULL, roots); in qgroup_rescan_leaf()
|
| /Linux-v4.19/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-v4.19/Documentation/device-mapper/ |
| D | verity.txt | 100 Number of generator roots. This equals to the number of parity bytes in
101 the encoding data. For example, in RS(M, N) encoding, the number of roots
|
| /Linux-v4.19/Documentation/kbuild/ |
| D | kbuild.txt | 163 relocations required by build roots. This is not defined in the
|
| /Linux-v4.19/Documentation/filesystems/nfs/ |
| D | Exporting | 74 b/ A primitive for creation of secondary roots - d_obtain_root(inode).
|
| /Linux-v4.19/Documentation/virtual/kvm/ |
| D | mmu.txt | 328 - look up new shadow roots
333 - look up new shadow roots
|
| /Linux-v4.19/LICENSES/preferred/ |
| 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.)
|
| 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.)
|
| /Linux-v4.19/Documentation/virtual/uml/ |
| D | UserModeLinux-HOWTO.txt | 2370 config ubd3=/home/jdike/incoming/roots/root_fs_debian22
|
