Searched refs:roots (Results 1 – 11 of 11) sorted by relevance
| /linux-4.1.27/lib/ |
| D | bch.c | 510 unsigned int *roots) in find_affine4_roots() argument
539 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots()
546 unsigned int *roots) in find_poly_deg1_roots() argument
552 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
561 unsigned int *roots) in find_poly_deg2_roots() argument
590 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
592 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
603 unsigned int *roots) in find_poly_deg3_roots() argument
625 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots()
636 unsigned int *roots) in find_poly_deg4_roots() argument
[all …]
|
| /linux-4.1.27/fs/btrfs/ |
| D | backref.c | 890 struct ulist *roots, const u64 *extent_item_pos, argument
1019 if (roots && ref->count && ref->root_id && ref->parent == 0) {
1026 ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);
1153 u64 time_seq, struct ulist **roots) argument
1163 *roots = ulist_alloc(GFP_NOFS);
1164 if (!*roots) {
1172 time_seq, tmp, *roots, NULL, 0, 0);
1175 ulist_free(*roots);
1191 u64 time_seq, struct ulist **roots) argument
1197 ret = __btrfs_find_all_roots(trans, fs_info, bytenr, time_seq, roots);
[all …]
|
| D | qgroup.c | 1564 struct ulist *roots, struct ulist *qgroups, in qgroup_calc_old_refcnt() argument
1575 while ((unode = ulist_next(roots, &uiter))) { in qgroup_calc_old_refcnt()
1881 struct ulist *roots = NULL; in check_existing_refs() local
1887 oper->elem.seq, &roots); in check_existing_refs()
1893 while ((unode = ulist_next(roots, &uiter))) { in check_existing_refs()
1899 ulist_free(roots); in check_existing_refs()
1949 struct ulist *roots = NULL; in qgroup_shared_accounting() local
1978 &roots); in qgroup_shared_accounting()
1999 ret = qgroup_calc_old_refcnt(fs_info, oper->ref_root, tmp, roots, qgroups, in qgroup_shared_accounting()
2051 ulist_free(roots); in qgroup_shared_accounting()
[all …]
|
| D | backref.h | 56 u64 time_seq, struct ulist **roots);
|
| D | ioctl.c | 3058 struct ulist *roots; in check_ref() local
3068 tree_mod_seq_elem.seq, &roots); in check_ref()
3073 while ((root_node = ulist_next(roots, &uiter))) { in check_ref()
3079 ulist_free(roots); in check_ref()
|
| /linux-4.1.27/Documentation/filesystems/ |
| D | btrfs.txt | 26 * Subvolumes (separate internal filesystem roots)
173 Currently this scans a list of several previous tree roots and tries to
|
| D | path-lookup.txt | 299 lookups, and to assume dentry mount points and mount roots are stable up and
|
| /linux-4.1.27/Documentation/kbuild/ |
| D | kbuild.txt | 145 relocations required by build roots. This is not defined in the
|
| /linux-4.1.27/Documentation/filesystems/nfs/ |
| D | Exporting | 61 b/ A per-superblock list "s_anon" of dentries which are the roots of
|
| /linux-4.1.27/Documentation/virtual/kvm/ |
| D | mmu.txt | 318 - look up new shadow roots
323 - look up new shadow roots
|
| /linux-4.1.27/Documentation/virtual/uml/ |
| D | UserModeLinux-HOWTO.txt | 2370 config ubd3=/home/jdike/incoming/roots/root_fs_debian22
|