Home
last modified time | relevance | path

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

12

/kernel/linux/linux-6.6/fs/btrfs/tests/
H A Dqgroup-tests.c235 test_err("couldn't find old roots: %d", ret); in test_no_shared_qgroup()
238 old_roots = ctx.roots; in test_no_shared_qgroup()
239 ctx.roots = NULL; in test_no_shared_qgroup()
251 test_err("couldn't find old roots: %d", ret); in test_no_shared_qgroup()
254 new_roots = ctx.roots; in test_no_shared_qgroup()
255 ctx.roots = NULL; in test_no_shared_qgroup()
276 test_err("couldn't find old roots: %d", ret); in test_no_shared_qgroup()
279 old_roots = ctx.roots; in test_no_shared_qgroup()
280 ctx.roots = NULL; in test_no_shared_qgroup()
291 test_err("couldn't find old roots in test_no_shared_qgroup()
[all...]
/kernel/linux/linux-6.6/lib/
H A Dbch.c538 * this function builds and solves a linear system for finding roots of a degree
543 unsigned int *roots) in find_affine4_roots()
572 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots()
579 unsigned int *roots) in find_poly_deg1_roots()
585 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
591 * compute roots of a degree 2 polynomial over GF(2^m)
594 unsigned int *roots) in find_poly_deg2_roots()
611 * i.e. r and r+1 are roots iff Tr(u)=0 in find_poly_deg2_roots()
623 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
625 roots[ in find_poly_deg2_roots()
541 find_affine4_roots(struct bch_control *bch, unsigned int a, unsigned int b, unsigned int c, unsigned int *roots) find_affine4_roots() argument
578 find_poly_deg1_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg1_roots() argument
593 find_poly_deg2_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg2_roots() argument
635 find_poly_deg3_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg3_roots() argument
668 find_poly_deg4_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg4_roots() argument
907 find_poly_roots(struct bch_control *bch, unsigned int k, struct gf_poly *poly, unsigned int *roots) find_poly_roots() argument
947 chien_search(struct bch_control *bch, unsigned int len, struct gf_poly *p, unsigned int *roots) chien_search() argument
1204 unsigned int i, j, nbits, r, word, *roots; compute_generator_polynomial() local
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/
H A Di915_buddy.c126 mm->roots = kmalloc_array(mm->n_roots, in i915_buddy_init()
129 if (!mm->roots) in i915_buddy_init()
156 mm->roots[i] = root; in i915_buddy_init()
167 i915_block_free(mm->roots[i]); in i915_buddy_init()
168 kfree(mm->roots); in i915_buddy_init()
179 GEM_WARN_ON(!i915_buddy_block_is_free(mm->roots[i])); in i915_buddy_fini()
180 i915_block_free(mm->roots[i]); in i915_buddy_fini()
183 kfree(mm->roots); in i915_buddy_fini()
362 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in i915_buddy_alloc_range()
H A Di915_buddy.h56 struct i915_buddy_block **roots; member
/kernel/linux/linux-5.10/security/selinux/ss/
H 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()
171 s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, 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[ in sidtab_alloc_roots()
[all...]
H A Dsidtab.h81 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
/kernel/linux/linux-6.6/security/selinux/ss/
H A Dsidtab.c38 memset(s->roots, 0, sizeof(s->roots)); in sidtab_init()
164 if (!s->roots[0].ptr_leaf) { in sidtab_alloc_roots()
165 s->roots[0].ptr_leaf = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
167 if (!s->roots[0].ptr_leaf) in sidtab_alloc_roots()
171 if (!s->roots[l].ptr_inner) { in sidtab_alloc_roots()
172 s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, in sidtab_alloc_roots()
174 if (!s->roots[l].ptr_inner) in sidtab_alloc_roots()
176 s->roots[l].ptr_inner->entries[0] = s->roots[ in sidtab_alloc_roots()
[all...]
H A Dsidtab.h80 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
/kernel/linux/linux-5.10/drivers/md/
H A Ddm-verity-fec.c51 for (i = 0; i < v->fec->roots; i++) in fec_decode_rs8()
68 position = (index + rsb) * v->fec->roots; in fec_read_parity()
139 * one corrected target byte and consumes fec->roots parity bytes. in fec_decode_bufs()
157 offset += v->fec->roots; in fec_decode_bufs()
259 if (neras && *neras <= v->fec->roots) in fec_read_bufs()
275 * maximum number (i.e. fec->roots) of erasures in fec_read_bufs()
277 if (neras && *neras <= v->fec->roots && in fec_read_bufs()
539 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 in verity_fec_parse_opt_args()
[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
/kernel/linux/linux-6.6/drivers/md/
H A Ddm-verity-fec.c51 for (i = 0; i < v->fec->roots; i++) in fec_decode_rs8()
68 position = (index + rsb) * v->fec->roots; in fec_read_parity()
139 * one corrected target byte and consumes fec->roots parity bytes. in fec_decode_bufs()
157 offset += v->fec->roots; in fec_decode_bufs()
259 if (neras && *neras <= v->fec->roots) in fec_read_bufs()
275 * maximum number (i.e. fec->roots) of erasures in fec_read_bufs()
277 if (neras && *neras <= v->fec->roots && in fec_read_bufs()
539 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 in verity_fec_parse_opt_args()
[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
/kernel/linux/linux-5.10/lib/
H A Dbch.c572 * this function builds and solves a linear system for finding roots of a degree
577 unsigned int *roots) in find_affine4_roots()
606 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots()
613 unsigned int *roots) in find_poly_deg1_roots()
619 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
625 * compute roots of a degree 2 polynomial over GF(2^m)
628 unsigned int *roots) in find_poly_deg2_roots()
645 * i.e. r and r+1 are roots iff Tr(u)=0 in find_poly_deg2_roots()
657 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
659 roots[ in find_poly_deg2_roots()
575 find_affine4_roots(struct bch_control *bch, unsigned int a, unsigned int b, unsigned int c, unsigned int *roots) find_affine4_roots() argument
612 find_poly_deg1_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg1_roots() argument
627 find_poly_deg2_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg2_roots() argument
669 find_poly_deg3_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg3_roots() argument
702 find_poly_deg4_roots(struct bch_control *bch, struct gf_poly *poly, unsigned int *roots) find_poly_deg4_roots() argument
941 find_poly_roots(struct bch_control *bch, unsigned int k, struct gf_poly *poly, unsigned int *roots) find_poly_roots() argument
981 chien_search(struct bch_control *bch, unsigned int len, struct gf_poly *p, unsigned int *roots) chien_search() argument
1238 unsigned int i, j, nbits, r, word, *roots; compute_generator_polynomial() local
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/
H A Ddrm_buddy.c131 mm->roots = kmalloc_array(mm->n_roots, in drm_buddy_init()
134 if (!mm->roots) in drm_buddy_init()
161 mm->roots[i] = root; in drm_buddy_init()
172 drm_block_free(mm, mm->roots[i]); in drm_buddy_init()
173 kfree(mm->roots); in drm_buddy_init()
192 WARN_ON(!drm_buddy_block_is_free(mm->roots[i])); in drm_buddy_fini()
193 drm_block_free(mm, mm->roots[i]); in drm_buddy_fini()
198 kfree(mm->roots); in drm_buddy_fini()
345 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in alloc_range_bias()
577 list_add_tail(&mm->roots[ in __drm_buddy_alloc_range()
[all...]
/kernel/linux/linux-6.6/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
242 while ((n = rb_first(&be->roots))) { in free_block_entry()
244 rb_erase(&re->node, &be->roots); in free_block_entry()
289 exist_re = insert_root_entry(&exist->roots, re); in add_block_entry()
302 be->roots = RB_ROOT; in add_block_entry()
306 insert_root_entry(&be->roots, re); in add_block_entry()
343 re = lookup_root_entry(&be->roots, ref_root); in add_tree_block()
421 re = lookup_root_entry(&be->roots, ref_roo in add_extent_data_ref()
[all...]
H A Dbackref.c172 * the same root or different roots) that we could find. The sharedness
1377 * When roots are found, they're added to the roots list
1408 ASSERT(ctx->roots == NULL); in find_parent_nodes()
1585 * the list of found roots is updated. in find_parent_nodes()
1603 if (ctx->roots && ref->count && ref->root_id && ref->parent == 0) { in find_parent_nodes()
1605 ret = ulist_add(ctx->roots, ref->root_id, 0, GFP_NOFS); in find_parent_nodes()
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 Dqgroup.c1244 * root while we are deleting the root. This is like dropping fs roots in btrfs_quota_disable()
1859 * it would not use commit roots and would lock extent buffers, causing in btrfs_qgroup_trace_extent_post()
1891 qrecord->old_roots = ctx.roots; in btrfs_qgroup_trace_extent_post()
2484 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2487 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt()
2497 if (!roots) in qgroup_update_refcnt()
2500 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2665 * Check if the @roots potentially is a list of fs tree roots
2667 * Return 0 for definitely not a fs/subvol tree roots ulis
2486 qgroup_update_refcnt(struct btrfs_fs_info *fs_info, struct ulist *roots, struct ulist *tmp, struct ulist *qgroups, u64 seq, int update_old) qgroup_update_refcnt() argument
2671 maybe_fs_roots(struct ulist *roots) maybe_fs_roots() argument
[all...]
H A Dbackref.h82 * commit roots when searching b+trees - this is a special case for
92 * List used to collect the IDs of the roots from which the target
96 struct ulist *roots; member
/kernel/linux/linux-5.10/fs/btrfs/
H A Dref-verify.c15 * Used to keep track the roots and number of refs each root has for a given
58 * One of these for every block we reference, it holds the roots and references
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()
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_roo in add_extent_data_ref()
[all...]
H A Dbackref.c1184 * When roots are found, they're added to the roots list
1189 * The special case is for qgroup to search roots in commit_transaction().
1205 struct ulist *roots, const u64 *extent_item_pos,
1339 * the list of found roots is updated.
1357 if (roots && ref->count && ref->root_id && ref->parent == 0) {
1365 ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);
1482 * walk all backrefs for a given extent to find all roots that reference this
1490 * list. Found roots are added to the roots lis
1202 find_parent_nodes(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist *refs, struct ulist *roots, const u64 *extent_item_pos, struct share_check *sc, bool ignore_offset) global() argument
1494 btrfs_find_all_roots_safe(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **roots, bool ignore_offset) global() argument
1534 btrfs_find_all_roots(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **roots, bool ignore_offset) global() argument
1564 btrfs_check_shared(struct btrfs_root *root, u64 inum, u64 bytenr, struct ulist *roots, struct ulist *tmp) global() argument
2001 struct ulist *roots = NULL; global() local
[all...]
H A Dbackref.h49 u64 time_seq, struct ulist **roots, bool ignore_offset);
65 struct ulist *roots, struct ulist *tmp_ulist);
H A Dqgroup.c1213 * root while we are deleting the root. This is like dropping fs roots in btrfs_quota_disable()
2418 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2421 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt()
2431 if (!roots) in qgroup_update_refcnt()
2434 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2599 * Check if the @roots potentially is a list of fs tree roots
2601 * Return 0 for definitely not a fs/subvol tree roots ulist
2602 * Return 1 for possible fs/subvol tree roots in the list (considering an empty
2605 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2420 qgroup_update_refcnt(struct btrfs_fs_info *fs_info, struct ulist *roots, struct ulist *tmp, struct ulist *qgroups, u64 seq, int update_old) qgroup_update_refcnt() argument
3242 struct ulist *roots = NULL; qgroup_rescan_leaf() local
[all...]
/kernel/linux/linux-6.6/include/drm/
H A Ddrm_buddy.h75 struct drm_buddy_block **roots; member
/kernel/linux/linux-6.6/arch/x86/kvm/mmu/
H A Dmmu.c2590 * Already invalid pages (previously active roots) are not on in __kvm_mmu_prepare_zap_page()
2620 * Make the request to free obsolete roots after marking the root in __kvm_mmu_prepare_zap_page()
2720 * four pages, e.g. for PAE roots or for 5-level paging. Temporarily in make_mmu_pages_available()
3593 /* Nothing to cleanup for dummy roots. */ in kvm_mmu_free_roots()
3624 * _only_ its own roots, e.g. INVVPID unconditionally exits. in kvm_mmu_free_guest_mode_roots()
3909 * is allocated if the other roots are valid and pml5 is needed, as any in mmu_alloc_special_roots()
3916 * The special roots should always be allocated in concert. Yell and in mmu_alloc_special_roots()
3917 * bail if KVM ends up in a state where only one of the roots is valid. in mmu_alloc_special_roots()
3981 * PAE roots (somewhat arbitrarily) aren't backed by shadow pages, the in is_unsync_root()
4345 /* Special roots, in is_page_fault_stale()
5805 kvm_mmu_invalidate_addr(struct kvm_vcpu *vcpu, struct kvm_mmu *mmu, u64 addr, unsigned long roots) kvm_mmu_invalidate_addr() argument
5855 unsigned long roots = 0; kvm_mmu_invpcid_gva() local
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/selftests/
H A Di915_buddy.c204 root = mm->roots[i]; in igt_check_mm()

Completed in 34 milliseconds

12