/Linux-v6.6/fs/btrfs/tests/ |
D | qgroup-tests.c | 238 old_roots = ctx.roots; in test_no_shared_qgroup() 239 ctx.roots = NULL; in test_no_shared_qgroup() 254 new_roots = ctx.roots; in test_no_shared_qgroup() 255 ctx.roots = NULL; in test_no_shared_qgroup() 279 old_roots = ctx.roots; in test_no_shared_qgroup() 280 ctx.roots = NULL; in test_no_shared_qgroup() 294 new_roots = ctx.roots; in test_no_shared_qgroup() 295 ctx.roots = NULL; in test_no_shared_qgroup() 350 old_roots = ctx.roots; in test_multiple_refs() 351 ctx.roots = NULL; in test_multiple_refs() [all …]
|
/Linux-v6.6/security/selinux/ss/ |
D | sidtab.c | 38 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[l - 1]; in sidtab_alloc_roots() 196 entry = &s->roots[level]; in sidtab_do_lookup() 462 rc = sidtab_convert_tree(¶ms->target->roots[level], in sidtab_convert() [all …]
|
D | sidtab.h | 80 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
|
/Linux-v6.6/lib/ |
D | bch.c | 543 unsigned int *roots) in find_affine4_roots() argument 572 return solve_linear_system(bch, rows, roots, 4); in find_affine4_roots() 579 unsigned int *roots) in find_poly_deg1_roots() argument 585 roots[n++] = mod_s(bch, GF_N(bch)-bch->a_log_tab[poly->c[0]]+ in find_poly_deg1_roots() 594 unsigned int *roots) in find_poly_deg2_roots() argument 623 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots() 625 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots() 636 unsigned int *roots) in find_poly_deg3_roots() argument 658 roots[n++] = a_ilog(bch, tmp[i]); in find_poly_deg3_roots() 669 unsigned int *roots) in find_poly_deg4_roots() argument [all …]
|
/Linux-v6.6/drivers/md/ |
D | dm-verity-fec.c | 50 for (i = 0; i < v->fec->roots; i++) in fec_decode_rs8() 67 position = (index + rsb) * v->fec->roots; in fec_read_parity() 156 offset += v->fec->roots; in fec_decode_bufs() 258 if (neras && *neras <= v->fec->roots) in fec_read_bufs() 276 if (neras && *neras <= v->fec->roots && in fec_read_bufs() 538 v->fec->roots); in verity_fec_status_table() 572 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); in fec_rs_alloc() 641 v->fec->roots = num_c; in verity_fec_parse_opt_args() 710 if (!f->roots) { in verity_fec_ctr() 714 f->rsn = DM_VERITY_FEC_RSM - f->roots; in verity_fec_ctr() [all …]
|
D | dm-verity-fec.h | 44 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
|
/Linux-v6.6/drivers/gpu/drm/ |
D | drm_buddy.c | 131 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() 344 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in alloc_range_bias() 567 list_add_tail(&mm->roots[i]->tmp_link, &dfs); in __drm_buddy_alloc_range()
|
/Linux-v6.6/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-v6.6/fs/btrfs/ |
D | ref-verify.c | 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_root); in add_extent_data_ref() 644 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry() 807 tmp = insert_root_entry(&be->roots, re); in btrfs_ref_tree_mod() [all …]
|
D | backref.c | 1408 ASSERT(ctx->roots == NULL); 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() 1758 if (!ctx->roots) { in btrfs_find_all_roots_safe() 1759 ctx->roots = ulist_alloc(GFP_NOFS); in btrfs_find_all_roots_safe() 1760 if (!ctx->roots) { in btrfs_find_all_roots_safe() 1777 ulist_free(ctx->roots); in btrfs_find_all_roots_safe() 1778 ctx->roots = NULL; in btrfs_find_all_roots_safe() 2423 ASSERT(ctx->roots == NULL); in iterate_extent_inodes() 2482 if (!ctx->roots) { in iterate_extent_inodes() [all …]
|
D | qgroup.c | 1858 qrecord->old_roots = ctx.roots; in btrfs_qgroup_trace_extent_post() 2454 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt() argument 2464 if (!roots) in qgroup_update_refcnt() 2467 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt() 2638 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument 2644 if (!roots || roots->nnodes == 0) in maybe_fs_roots() 2648 unode = ulist_next(roots, &uiter); in maybe_fs_roots() 2799 record->old_roots = ctx.roots; in btrfs_qgroup_account_extents() 2800 ctx.roots = NULL; in btrfs_qgroup_account_extents() 2818 new_roots = ctx.roots; in btrfs_qgroup_account_extents() [all …]
|
D | backref.h | 96 struct ulist *roots; member
|
/Linux-v6.6/Documentation/filesystems/ |
D | btrfs.rst | 19 * Subvolumes (separate internal filesystem roots)
|
/Linux-v6.6/include/drm/ |
D | drm_buddy.h | 75 struct drm_buddy_block **roots; member
|
/Linux-v6.6/Documentation/trace/ |
D | osnoise-tracer.rst | 20 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-v6.6/Documentation/admin-guide/device-mapper/ |
D | verity.rst | 108 Number of generator roots. This equals to the number of parity bytes in 109 the encoding data. For example, in RS(M, N) encoding, the number of roots
|
/Linux-v6.6/arch/x86/kvm/mmu/ |
D | mmu.c | 5806 u64 addr, unsigned long roots) in kvm_mmu_invalidate_addr() argument 5810 WARN_ON_ONCE(roots & ~KVM_MMU_ROOTS_ALL); in kvm_mmu_invalidate_addr() 5824 if (roots & KVM_MMU_ROOT_CURRENT) in kvm_mmu_invalidate_addr() 5828 if (roots & KVM_MMU_ROOT_PREVIOUS(i)) in kvm_mmu_invalidate_addr() 5855 unsigned long roots = 0; in kvm_mmu_invpcid_gva() local 5859 roots |= KVM_MMU_ROOT_CURRENT; in kvm_mmu_invpcid_gva() 5864 roots |= KVM_MMU_ROOT_PREVIOUS(i); in kvm_mmu_invpcid_gva() 5867 if (roots) in kvm_mmu_invpcid_gva() 5868 kvm_mmu_invalidate_addr(vcpu, mmu, gva, roots); in kvm_mmu_invpcid_gva()
|
/Linux-v6.6/Documentation/kbuild/ |
D | kbuild.rst | 222 relocations required by build roots. This is not defined in the
|
/Linux-v6.6/drivers/gpu/drm/tests/ |
D | drm_buddy_test.c | 230 root = mm->roots[i]; in check_mm()
|
/Linux-v6.6/Documentation/virt/kvm/x86/ |
D | mmu.rst | 361 - look up new shadow roots 367 - look up new shadow roots
|
/Linux-v6.6/Documentation/filesystems/nfs/ |
D | exporting.rst | 75 b. A primitive for creation of secondary roots - d_obtain_root(inode).
|
/Linux-v6.6/LICENSES/preferred/ |
D | LGPL-2.1 | 193 (For example, a function in a library to compute square roots has a 198 function must still compute square roots.)
|
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.)
|
/Linux-v6.6/arch/x86/kvm/vmx/ |
D | nested.c | 361 unsigned long roots = 0; in nested_ept_invalidate_addr() local 372 roots |= KVM_MMU_ROOT_PREVIOUS(i); in nested_ept_invalidate_addr() 374 if (roots) in nested_ept_invalidate_addr() 375 kvm_mmu_invalidate_addr(vcpu, vcpu->arch.mmu, addr, roots); in nested_ept_invalidate_addr()
|
/Linux-v6.6/arch/x86/include/asm/ |
D | kvm_host.h | 2070 u64 addr, unsigned long roots);
|