Home
last modified time | relevance | path

Searched refs:roots (Results 1 – 18 of 18) 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/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.c72 v->fec->roots; in fec_decode_bufs()
96 to_copy = min(v->fec->block_size - parity_pos, v->fec->roots); in fec_decode_bufs()
99 if (to_copy < v->fec->roots) { in fec_decode_bufs()
113 for (; j < v->fec->roots; j++) in fec_decode_bufs()
223 if (neras && *neras < v->fec->roots) in fec_read_bufs()
241 if (neras && *neras < v->fec->roots && in fec_read_bufs()
453 v->fec->roots); in verity_fec_status_table()
487 return init_rs_gfp(8, 0x11d, 0, 1, v->fec->roots, gfp_mask); in fec_rs_alloc()
560 v->fec->roots = num_c; in verity_fec_parse_opt_args()
630 if (!f->roots) { in verity_fec_ctr()
[all …]
H A Ddm-verity-fec.h37 unsigned char roots; /* parity bytes per RS codeword, n-k of RS(n, k) */ member
/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.c1400 ASSERT(ctx->roots == NULL); in find_parent_nodes()
1598 if (ctx->roots && ref->count && ref->root_id && ref->parent == 0) { in find_parent_nodes()
1600 ret = ulist_add(ctx->roots, ref->root_id, 0, GFP_NOFS); in find_parent_nodes()
1748 if (!ctx->roots) { in btrfs_find_all_roots_safe()
1749 ctx->roots = ulist_alloc(GFP_NOFS); in btrfs_find_all_roots_safe()
1750 if (!ctx->roots) { in btrfs_find_all_roots_safe()
1767 ulist_free(ctx->roots); in btrfs_find_all_roots_safe()
1768 ctx->roots = NULL; in btrfs_find_all_roots_safe()
2424 ASSERT(ctx->roots == NULL); in iterate_extent_inodes()
2483 if (!ctx->roots) { in iterate_extent_inodes()
[all …]
H A Dqgroup.c2140 qrecord->old_roots = ctx.roots; in btrfs_qgroup_trace_extent_post()
2765 struct ulist *roots, struct list_head *qgroups, in qgroup_update_refcnt() argument
2772 if (!roots) in qgroup_update_refcnt()
2775 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2926 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots() argument
2932 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2936 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3073 record->old_roots = ctx.roots; in btrfs_qgroup_account_extents()
3074 ctx.roots = NULL; in btrfs_qgroup_account_extents()
3087 new_roots = ctx.roots; in btrfs_qgroup_account_extents()
[all …]
H A Drelocation.c5596 static void release_recovered_fs_roots(struct list_head *roots, bool drop_reloc_refs) in release_recovered_fs_roots() argument
5601 list_for_each_entry_safe(root, next, roots, reloc_dirty_list) { in release_recovered_fs_roots()
/linux/drivers/gpu/
H A Dbuddy.c430 mm->roots = kmalloc_objs(struct gpu_buddy_block *, mm->n_roots); in gpu_buddy_init()
431 if (!mm->roots) in gpu_buddy_init()
455 mm->roots[root_count] = root; in gpu_buddy_init()
469 gpu_block_free(mm, mm->roots[root_count]); in gpu_buddy_init()
470 kfree(mm->roots); in gpu_buddy_init()
500 start = gpu_buddy_block_offset(mm->roots[i]); in gpu_buddy_fini()
503 gpu_buddy_assert(gpu_buddy_block_is_free(mm->roots[i])); in gpu_buddy_fini()
505 gpu_block_free(mm, mm->roots[i]); in gpu_buddy_fini()
519 kfree(mm->roots); in gpu_buddy_fini()
579 start = gpu_buddy_block_offset(mm->roots[i]); in gpu_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/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/
H A DMakefile1318 # INSTALL_DTBS_PATH specifies a prefix for relocations required by build roots.
1326 # relocations required by build roots. This is not defined in the
2300 --roots-file "$(tmp-target)" \
/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/admin-guide/
H A Dcgroup-v2.rst2678 except those that are separate partition roots themselves and