Searched refs:roots (Results 1 - 15 of 15) sorted by relevance

/linux-master/fs/btrfs/tests/
H A Dqgroup-tests.c235 test_err("couldn't find old roots: %d", ret);
238 old_roots = ctx.roots;
239 ctx.roots = NULL;
251 test_err("couldn't find old roots: %d", ret);
254 new_roots = ctx.roots;
255 ctx.roots = NULL;
276 test_err("couldn't find old roots: %d", ret);
279 old_roots = ctx.roots;
280 ctx.roots = NULL;
291 test_err("couldn't find old roots
[all...]
/linux-master/lib/
H A Dbch.c538 * this function builds and solves a linear system for finding roots of a degree
543 unsigned int *roots)
572 return solve_linear_system(bch, rows, roots, 4);
579 unsigned int *roots)
585 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+
591 * compute roots of a degree 2 polynomial over GF(2^m)
594 unsigned int *roots)
611 * i.e. r and r+1 are roots iff Tr(u)=0
623 roots[n++] = modulo(bch, 2*GF_N(bch)-l1-
625 roots[
541 find_affine4_roots(struct bch_control *bch, unsigned int a, unsigned int b, unsigned int c, unsigned int *roots) argument
578 find_poly_deg1_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) argument
593 find_poly_deg2_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) argument
635 find_poly_deg3_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) argument
668 find_poly_deg4_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) argument
907 find_poly_roots(struct bch_control *bch, unsigned int k, struct gf_poly *poly, unsigned int *roots) argument
947 chien_search(struct bch_control *bch, unsigned int len, struct gf_poly *p, unsigned int *roots) argument
1204 unsigned int i, j, nbits, r, word, *roots; local
[all...]
/linux-master/security/selinux/ss/
H A Dsidtab.c39 memset(s->roots, 0, sizeof(s->roots));
167 if (!s->roots[0].ptr_leaf) {
168 s->roots[0].ptr_leaf =
170 if (!s->roots[0].ptr_leaf)
174 if (!s->roots[l].ptr_inner) {
175 s->roots[l].ptr_inner =
177 if (!s->roots[l].ptr_inner)
179 s->roots[l].ptr_inner->entries[0] = s->roots[
[all...]
H A Dsidtab.h82 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member in struct:sidtab
/linux-master/drivers/md/
H A Ddm-verity-fec.c51 for (i = 0; i < v->fec->roots; i++)
69 position = (index + rsb) * v->fec->roots;
141 * one corrected target byte and consumes fec->roots parity bytes.
159 offset += v->fec->roots;
262 if (neras && *neras <= v->fec->roots)
278 * maximum number (i.e. fec->roots) of erasures
280 if (neras && *neras <= v->fec->roots &&
542 v->fec->roots);
576 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask);
645 v->fec->roots
[all...]
H A Ddm-verity-fec.h39 size_t io_size; /* IO size for roots */
44 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member in struct:dm_verity_fec
/linux-master/fs/btrfs/
H A Dref-verify.c18 * Used to keep track the roots and number of refs each root has for a given
61 * One of these for every block we reference, it holds the roots and references
72 struct rb_root roots; member in struct:block_entry
242 while ((n = rb_first(&be->roots))) {
244 rb_erase(&re->node, &be->roots);
289 exist_re = insert_root_entry(&exist->roots, re);
302 be->roots = RB_ROOT;
306 insert_root_entry(&be->roots, re);
343 re = lookup_root_entry(&be->roots, ref_root);
421 re = lookup_root_entry(&be->roots, ref_roo
[all...]
H A Dbackref.c172 * the same root or different roots) that we could find. The sharedness
1375 * When roots are found, they're added to the roots list
1406 ASSERT(ctx->roots == NULL);
1585 * the list of found roots is updated.
1603 if (ctx->roots && ref->count && ref->root_id && ref->parent == 0) {
1605 ret = ulist_add(ctx->roots, ref->root_id, 0, GFP_NOFS);
1726 * Walk all backrefs for a given extent to find all roots that reference this
1736 * Found roots are added to @ctx->roots, whic
[all...]
H A Dbackref.h94 * commit roots when searching b+trees - this is a special case for
104 * List used to collect the IDs of the roots from which the target
108 struct ulist *roots; member in struct:btrfs_backref_walk_ctx
H A Dqgroup.c1347 * root while we are deleting the root. This is like dropping fs roots
1943 * since we search commit roots to walk backref and result will always be
1973 * it would not use commit roots and would lock extent buffers, causing
2005 qrecord->old_roots = ctx.roots;
2015 * commit roots.
2644 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2647 struct ulist *roots, struct list_head *qgroups,
2654 if (!roots)
2657 while ((unode = ulist_next(roots, &uiter))) {
2802 * Check if the @roots potentiall
2646 qgroup_update_refcnt(struct btrfs_fs_info *fs_info, struct ulist *roots, struct list_head *qgroups, u64 seq, int update_old) argument
2808 maybe_fs_roots(struct ulist *roots) argument
[all...]
/linux-master/drivers/gpu/drm/
H A Ddrm_buddy.c131 mm->roots = kmalloc_array(mm->n_roots,
134 if (!mm->roots)
161 mm->roots[i] = root;
172 drm_block_free(mm, mm->roots[i]);
173 kfree(mm->roots);
192 WARN_ON(!drm_buddy_block_is_free(mm->roots[i]));
193 drm_block_free(mm, mm->roots[i]);
198 kfree(mm->roots);
345 list_add_tail(&mm->roots[i]->tmp_link, &dfs);
593 list_add_tail(&mm->roots[
[all...]
/linux-master/include/drm/
H A Ddrm_buddy.h76 struct drm_buddy_block **roots; member in struct:drm_buddy
/linux-master/arch/x86/kvm/mmu/
H A Dmmu.c2596 * Already invalid pages (previously active roots) are not on
2626 * Make the request to free obsolete roots after marking the root
2726 * four pages, e.g. for PAE roots or for 5-level paging. Temporarily
3629 /* Nothing to cleanup for dummy roots. */
3665 * _only_ its own roots, e.g. INVVPID unconditionally exits.
3950 * is allocated if the other roots are valid and pml5 is needed, as any
3957 * The special roots should always be allocated in concert. Yell and
3958 * bail if KVM ends up in a state where only one of the roots is valid.
4022 * PAE roots (somewhat arbitrarily) aren't backed by shadow pages, the
4480 /* Special roots,
5952 kvm_mmu_invalidate_addr(struct kvm_vcpu *vcpu, struct kvm_mmu *mmu, u64 addr, unsigned long roots) argument
6002 unsigned long roots = 0; local
[all...]
/linux-master/arch/x86/kvm/vmx/
H A Dnested.c390 unsigned long roots = 0; local
401 roots |= KVM_MMU_ROOT_PREVIOUS(i);
403 if (roots)
404 kvm_mmu_invalidate_addr(vcpu, vcpu->arch.mmu, addr, roots);
5745 * Nested EPT roots are always held through guest_mmu,
5862 * roots as VPIDs are not tracked in the MMU role.
/linux-master/arch/x86/include/asm/
H A Dkvm_host.h1427 /* The number of TDP MMU pages across all roots. */
1431 * List of struct kvm_mmu_pages being used as roots.
2148 u64 addr, unsigned long roots);

Completed in 284 milliseconds