| /linux/fs/btrfs/tests/ |
| H A D | qgroup-tests.c | 229 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 D | bch.c | 540 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/drivers/md/ |
| H A D | dm-verity-fec.c | 57 position = (index + rsb) * v->fec->roots; in fec_read_parity() 135 for (j = 0; j < v->fec->roots - par_buf_offset; j++) in fec_decode_bufs() 153 offset += (v->fec->roots - par_buf_offset); in fec_decode_bufs() 155 if (offset < v->fec->io_size && (offset + v->fec->roots) > v->fec->io_size) { in fec_decode_bufs() 266 if (neras && *neras <= v->fec->roots) in fec_read_bufs() 284 if (neras && *neras <= v->fec->roots && in fec_read_bufs() 520 v->fec->roots); in verity_fec_status_table() 553 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); in fec_rs_alloc() 626 v->fec->roots = num_c; in verity_fec_parse_opt_args() 695 if (!f->roots) { in verity_fec_ctr() [all …]
|
| H A D | dm-verity-fec.h | 41 unsigned char roots; /* number of parity bytes, M-N of RS(M, N) */ member
|
| /linux/Documentation/core-api/ |
| H A 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/fs/btrfs/ |
| H A D | ref-verify.c | 72 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 D | qgroup.c | 2066 qrecord->old_roots = ctx.roots; in btrfs_qgroup_trace_extent_post() 2697 struct ulist *roots, struct list_head *qgroups, in qgroup_update_refcnt() argument 2704 if (!roots) in qgroup_update_refcnt() 2707 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt() 2858 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument 2864 if (!roots || roots->nnodes == 0) in maybe_fs_roots() 2868 unode = ulist_next(roots, &uiter); in maybe_fs_roots() 3005 record->old_roots = ctx.roots; in btrfs_qgroup_account_extents() 3006 ctx.roots = NULL; in btrfs_qgroup_account_extents() 3019 new_roots = ctx.roots; in btrfs_qgroup_account_extents() [all …]
|
| /linux/Documentation/translations/zh_CN/kbuild/ |
| H A D | kbuild.rst | 238 (build roots)所需。它没有在 makefile 中定义,但如果需要,可以作为 262 INSTALL_DTBS_PATH 指定了设备树二进制文件的安装位置,通常由构建根(build roots)所需。
|
| /linux/Documentation/filesystems/ |
| H A D | btrfs.rst | 19 * Subvolumes (separate internal filesystem roots)
|
| H A D | porting.rst | 1257 that would be roots of the cloned mounts.
|
| /linux/security/selinux/ss/ |
| H A D | sidtab.h | 82 union sidtab_entry_inner roots[SIDTAB_MAX_LEVEL + 1]; member
|
| /linux/Documentation/trace/ |
| H A 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/Documentation/kbuild/ |
| H A D | kbuild.rst | 249 relocations required by build roots. This is not defined in the 276 relocations required by build roots. This is not defined in the
|
| H A D | makefiles.rst | 1661 roots. It defines a place for installing the device tree blobs. Like
|
| /linux/Documentation/admin-guide/device-mapper/ |
| H A D | verity.rst | 117 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 D | mmu.c | 6523 u64 addr, unsigned long roots) in kvm_mmu_invalidate_addr() argument 6527 WARN_ON_ONCE(roots & ~KVM_MMU_ROOTS_ALL); in kvm_mmu_invalidate_addr() 6541 if (roots & KVM_MMU_ROOT_CURRENT) in kvm_mmu_invalidate_addr() 6545 if (roots & KVM_MMU_ROOT_PREVIOUS(i)) in kvm_mmu_invalidate_addr() 6572 unsigned long roots = 0; in kvm_mmu_invpcid_gva() local 6576 roots |= KVM_MMU_ROOT_CURRENT; in kvm_mmu_invpcid_gva() 6581 roots |= KVM_MMU_ROOT_PREVIOUS(i); in kvm_mmu_invpcid_gva() 6584 if (roots) in kvm_mmu_invpcid_gva() 6585 kvm_mmu_invalidate_addr(vcpu, mmu, gva, roots); in kvm_mmu_invpcid_gva()
|
| /linux/Documentation/virt/kvm/x86/ |
| H A D | mmu.rst | 386 - look up new shadow roots 392 - look up new shadow roots
|
| /linux/LICENSES/preferred/ |
| H A 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.)
|
| H A D | LGPL-2.1 | 197 (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 D | nested.c | 393 unsigned long roots = 0; in nested_ept_invalidate_addr() local 404 roots |= KVM_MMU_ROOT_PREVIOUS(i); in nested_ept_invalidate_addr() 406 if (roots) in nested_ept_invalidate_addr() 407 kvm_mmu_invalidate_addr(vcpu, vcpu->arch.mmu, addr, roots); in nested_ept_invalidate_addr()
|
| /linux/arch/x86/include/asm/ |
| H A D | kvm_host.h | 2302 u64 addr, unsigned long roots);
|
| /linux/Documentation/admin-guide/LSM/ |
| H A D | ipe.rst | 814 on top of kernel read. The trust model is also different; Loadpin roots its
|
| /linux/Documentation/virt/uml/ |
| H A D | user_mode_linux_howto_v2.rst | 810 (mconsole) config ubd3=/home/jdike/incoming/roots/root_fs_debian22
|
| /linux/Documentation/admin-guide/ |
| H A D | cgroup-v2.rst | 2613 except those that are separate partition roots themselves and
|