Home
last modified time | relevance | path

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

/linux/fs/btrfs/tests/
H A Dqgroup-tests.c229 old_roots = ctx.roots; in test_no_shared_qgroup()
230 ctx.roots = NULL; in test_no_shared_qgroup()
245 new_roots = ctx.roots; in test_no_shared_qgroup()
246 ctx.roots = NULL; in test_no_shared_qgroup()
270 old_roots = ctx.roots; in test_no_shared_qgroup()
271 ctx.roots = NULL; in test_no_shared_qgroup()
285 new_roots = ctx.roots; in test_no_shared_qgroup()
286 ctx.roots = NULL; in test_no_shared_qgroup()
341 old_roots = ctx.roots; in test_multiple_refs()
342 ctx.roots = NULL; in test_multiple_refs()
[all …]
/linux/lib/
H A Dbch.c540 unsigned int *roots) in find_affine4_roots() argument
569 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots()
576 unsigned int *roots) in find_poly_deg1_roots() argument
582 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots()
591 unsigned int *roots) in find_poly_deg2_roots() argument
620 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
622 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
633 unsigned int *roots) in find_poly_deg3_roots() argument
655 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots()
666 unsigned int *roots) in find_poly_deg4_roots() argument
[all …]
/linux/security/selinux/ss/
H A Dsidtab.c39 memset(s->roots, 0, sizeof(s->roots)); in sidtab_init()
167 if (!s->roots[0].ptr_leaf) { in sidtab_alloc_roots()
168 s->roots[0].ptr_leaf = in sidtab_alloc_roots()
170 if (!s->roots[0].ptr_leaf) in sidtab_alloc_roots()
174 if (!s->roots[l].ptr_inner) { in sidtab_alloc_roots()
175 s->roots[l].ptr_inner = in sidtab_alloc_roots()
177 if (!s->roots[l].ptr_inner) in sidtab_alloc_roots()
179 s->roots[l].ptr_inner->entries[0] = s->roots[l - 1]; in sidtab_alloc_roots()
199 entry = &s->roots[level]; in sidtab_do_lookup()
465 rc = sidtab_convert_tree(&params->target->roots[level], in sidtab_convert()
[all …]
H A Dsidtab.h82 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
/linux/drivers/md/
H A Ddm-verity-fec.c51 position = (index + rsb) * v->fec->roots; in fec_read_parity()
121 for (j = 0; j < v->fec->roots - par_buf_offset; j++) in fec_decode_bufs()
139 offset += (v->fec->roots - par_buf_offset); in fec_decode_bufs()
141 if (offset < v->fec->io_size && (offset + v->fec->roots) > v->fec->io_size) { in fec_decode_bufs()
252 if (neras && *neras <= v->fec->roots) in fec_read_bufs()
270 if (neras && *neras <= v->fec->roots && in fec_read_bufs()
486 v->fec->roots); in verity_fec_status_table()
520 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); in fec_rs_alloc()
593 v->fec->roots = num_c; in verity_fec_parse_opt_args()
662 if (!f->roots) { in verity_fec_ctr()
[all …]
/linux/Documentation/core-api/
H 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/
H A Dref-verify.c72 struct rb_root roots; member
224 while ((n = rb_first(&be->roots))) { in free_block_entry()
226 rb_erase(&re->node, &be->roots); in free_block_entry()
271 exist_re = insert_root_entry(&exist->roots, re); in add_block_entry()
284 be->roots = RB_ROOT; in add_block_entry()
288 insert_root_entry(&be->roots, re); in add_block_entry()
325 re = lookup_root_entry(&be->roots, ref_root); in add_tree_block()
403 re = lookup_root_entry(&be->roots, ref_root); in add_extent_data_ref()
634 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
799 tmp = insert_root_entry(&be->roots, re); in btrfs_ref_tree_mod()
[all …]
H A Dbackref.c1398 ASSERT(ctx->roots == NULL); in find_parent_nodes()
1596 if (ctx->roots && ref->count && ref->root_id && ref->parent == 0) { in find_parent_nodes()
1598 ret = ulist_add(ctx->roots, ref->root_id, 0, GFP_NOFS); in find_parent_nodes()
1751 if (!ctx->roots) { in btrfs_find_all_roots_safe()
1752 ctx->roots = ulist_alloc(GFP_NOFS); in btrfs_find_all_roots_safe()
1753 if (!ctx->roots) { in btrfs_find_all_roots_safe()
1770 ulist_free(ctx->roots); in btrfs_find_all_roots_safe()
1771 ctx->roots = NULL; in btrfs_find_all_roots_safe()
2420 ASSERT(ctx->roots == NULL); in iterate_extent_inodes()
2479 if (!ctx->roots) { in iterate_extent_inodes()
[all …]
H A Dqgroup.c2122 qrecord->old_roots = ctx.roots; in btrfs_qgroup_trace_extent_post()
2749 struct ulist *roots, struct list_head *qgroups, in qgroup_update_refcnt() argument
2756 if (!roots) in qgroup_update_refcnt()
2759 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2910 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2916 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2920 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3057 record->old_roots = ctx.roots; in btrfs_qgroup_account_extents()
3058 ctx.roots = NULL; in btrfs_qgroup_account_extents()
3071 new_roots = ctx.roots; in btrfs_qgroup_account_extents()
[all …]
/linux/drivers/gpu/drm/
H A Ddrm_buddy.c339 mm->roots = kmalloc_objs(struct drm_buddy_block *, mm->n_roots); in drm_buddy_init()
340 if (!mm->roots) in drm_buddy_init()
364 mm->roots[root_count] = root; in drm_buddy_init()
375 drm_block_free(mm, mm->roots[root_count]); in drm_buddy_init()
376 kfree(mm->roots); in drm_buddy_init()
402 start = drm_buddy_block_offset(mm->roots[i]); in drm_buddy_fini()
405 if (WARN_ON(!drm_buddy_block_is_free(mm->roots[i]))) in drm_buddy_fini()
408 drm_block_free(mm, mm->roots[i]); in drm_buddy_fini()
419 kfree(mm->roots); in drm_buddy_fini()
493 start = drm_buddy_block_offset(mm->roots[i]); in drm_buddy_reset_clear()
[all …]
/linux/Documentation/filesystems/
H A Dbtrfs.rst19 * Subvolumes (separate internal filesystem roots)
/linux/Documentation/trace/
H A Dosnoise-tracer.rst20 cause of any gap between two different reads of the time roots either on
171 The reason roots in the overhead of the entry and exit code that happens
/linux/Documentation/admin-guide/device-mapper/
H A Dverity.rst117 Number of generator roots. This equals to the number of parity bytes in
118 the encoding data. For example, in RS(M, N) encoding, the number of roots
/linux/arch/x86/kvm/mmu/
H A Dmmu.c6522 u64 addr, unsigned long roots) in kvm_mmu_invalidate_addr() argument
6526 WARN_ON_ONCE(roots & ~KVM_MMU_ROOTS_ALL); in kvm_mmu_invalidate_addr()
6540 if (roots & KVM_MMU_ROOT_CURRENT) in kvm_mmu_invalidate_addr()
6544 if (roots & KVM_MMU_ROOT_PREVIOUS(i)) in kvm_mmu_invalidate_addr()
6571 unsigned long roots = 0; in kvm_mmu_invpcid_gva() local
6575 roots |= KVM_MMU_ROOT_CURRENT; in kvm_mmu_invpcid_gva()
6580 roots |= KVM_MMU_ROOT_PREVIOUS(i); in kvm_mmu_invpcid_gva()
6583 if (roots) in kvm_mmu_invpcid_gva()
6584 kvm_mmu_invalidate_addr(vcpu, mmu, gva, roots); in kvm_mmu_invpcid_gva()
/linux/Documentation/virt/kvm/x86/
H A Dmmu.rst386 - look up new shadow roots
392 - look up new shadow roots
/linux/LICENSES/preferred/
H A DLGPL-2.0181 (For example, a function in a library to compute square roots has a
186 function must still compute square roots.)
H A DLGPL-2.1197 (For example, a function in a library to compute square roots has a
202 function must still compute square roots.)
/linux/arch/x86/kvm/vmx/
H A Dnested.c396 unsigned long roots = 0; in nested_ept_invalidate_addr() local
407 roots |= KVM_MMU_ROOT_PREVIOUS(i); in nested_ept_invalidate_addr()
409 if (roots) in nested_ept_invalidate_addr()
410 kvm_mmu_invalidate_addr(vcpu, vcpu->arch.mmu, addr, roots); in nested_ept_invalidate_addr()
/linux/arch/x86/include/asm/
H A Dkvm_host.h2324 u64 addr, unsigned long roots);
/linux/Documentation/admin-guide/LSM/
H A Dipe.rst814 on top of kernel read. The trust model is also different; Loadpin roots its
/linux/Documentation/virt/uml/
H A Duser_mode_linux_howto_v2.rst810 (mconsole) config ubd3=/home/jdike/incoming/roots/root_fs_debian22