/linux-master/tools/testing/radix-tree/ |
H A D | regression1.c | 5 * Salman Qazi describes the following radix-tree bug: 9 * 0. The radix tree contains two items, one has the index 0. 13 * is moved to the root of the tree. The place where it used to be is queued 37 #include <linux/radix-tree.h>
|
/linux-master/drivers/gpu/drm/nouveau/include/nvkm/subdev/ |
H A D | mmu.h | 9 struct rb_node tree; member in struct:nvkm_vma
|
/linux-master/drivers/pinctrl/ |
H A D | core.h | 14 #include <linux/radix-tree.h> 35 * this radix tree 36 * @pin_group_tree: optionally each pin group can be stored in this radix tree 38 * @pin_function_tree: optionally each function can be stored in this radix tree 83 * @dt_maps: the mapping table chunks dynamically parsed from device tree for
|
/linux-master/include/linux/ |
H A D | backing-dev-defs.h | 6 #include <linux/radix-tree.h> 189 struct radix_tree_root cgwb_tree; /* radix tree of active cgroup wbs */
|
/linux-master/drivers/md/ |
H A D | dm-dust.c | 240 static bool __dust_clear_badblocks(struct rb_root *tree, argument 245 nnode = rb_first(tree); 254 rb_erase(node, tree); 259 BUG_ON(tree->rb_node != NULL);
|
/linux-master/tools/perf/util/ |
H A D | env.h | 124 struct rb_root tree; member in struct:perf_env::__anon1598
|
/linux-master/arch/s390/include/asm/ |
H A D | gmap.h | 12 #include <linux/radix-tree.h> 28 * @guest_to_host: radix tree with guest to host address translation 29 * @host_to_guest: radix tree with pointer to segment table entries 36 * @host_to_rmap: radix tree with gmap_rmap lists
|
/linux-master/drivers/gpu/drm/i915/gem/ |
H A D | i915_gem_object_types.h | 256 * @vma.lock: protect the list/tree of vmas 266 * themselves, use the @vma.tree (which has a defined order 272 * @vma.tree: Ordered tree of VMAs backed by this object 274 * All VMA created for this object are placed in the @vma.tree 279 struct rb_root tree; member in struct:drm_i915_gem_object::__anon666
|
/linux-master/drivers/of/ |
H A D | of_private.h | 93 int of_resolve_phandles(struct device_node *tree);
|
/linux-master/tools/testing/selftests/rcutorture/bin/ |
H A D | kvm-test-1-run.sh | 4 # Run a kvm-based test of the specified tree on the specified configs. 7 # Execute this in the source tree. Do not run it as a background task 176 echo " 1." Set your bare-metal build tree to the state shown in this file: >> $resdir/bare-metal 178 echo " 2." Update your bare-metal build tree"'"s .config based on this file: >> $resdir/bare-metal
|
/linux-master/tools/objtool/ |
H A D | elf.c | 169 struct rb_root_cached *tree = (struct rb_root_cached *)&sec->symbol_tree; local 172 __sym_for_each(iter, tree, offset, offset) { 182 struct rb_root_cached *tree = (struct rb_root_cached *)&sec->symbol_tree; local 185 __sym_for_each(iter, tree, offset, offset) { 195 struct rb_root_cached *tree = (struct rb_root_cached *)&sec->symbol_tree; local 198 __sym_for_each(iter, tree, offset, offset) { 243 struct rb_root_cached *tree = (struct rb_root_cached *)&sec->symbol_tree; local 246 __sym_for_each(iter, tree, offset, offset) {
|
/linux-master/drivers/gpu/drm/ |
H A D | drm_gpuvm.c | 47 * The GPU VA manager internally uses a rb-tree to manage the 1005 gpuvm->rb.tree = RB_ROOT_CACHED; 1048 drm_WARN(gpuvm->drm, !RB_EMPTY_ROOT(&gpuvm->rb.tree.rb_root), 1049 "GPUVA tree is not empty, potentially leaking memory.\n"); 1723 if (drm_gpuva_it_iter_first(&gpuvm->rb.tree, 1730 drm_gpuva_it_insert(va, &gpuvm->rb.tree); 1784 drm_gpuva_it_remove(va, &va->vm->rb.tree); 1792 * This removes the given &va from the underlaying tree. 1896 return drm_gpuva_it_iter_first(&gpuvm->rb.tree, addr, last); 1947 return drm_gpuva_it_iter_first(&gpuvm->rb.tree, star [all...] |
/linux-master/kernel/module/ |
H A D | internal.h | 305 struct module *mod_find(unsigned long addr, struct mod_tree_root *tree); 311 static inline struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) argument
|
/linux-master/fs/erofs/ |
H A D | super.c | 250 idr_for_each_entry(&sbi->devs->tree, dif, id) { 263 err = idr_alloc(&sbi->devs->tree, dif, 0, 0, GFP_KERNEL); 506 ret = idr_alloc(&sbi->devs->tree, dif, 0, 0, GFP_KERNEL); 741 idr_for_each(&devs->tree, &erofs_release_device_info, NULL); 742 idr_destroy(&devs->tree); 781 idr_init(&sbi->devs->tree);
|
H A D | data.c | 211 dif = idr_find(&devs->tree, map->m_deviceid - 1); 228 idr_for_each_entry(&devs->tree, dif, id) {
|
/linux-master/include/trace/events/ |
H A D | btrfs.h | 2070 TP_PROTO(const struct extent_io_tree *tree, 2073 TP_ARGS(tree, start, len, set_bits), 2084 TP_fast_assign_btrfs(extent_io_tree_to_fs_info(tree), 2085 const struct btrfs_inode *inode = extent_io_tree_to_inode_const(tree); 2087 __entry->owner = tree->owner; 2103 TP_PROTO(const struct extent_io_tree *tree, 2106 TP_ARGS(tree, start, len, clear_bits), 2117 TP_fast_assign_btrfs(extent_io_tree_to_fs_info(tree), 2118 const struct btrfs_inode *inode = extent_io_tree_to_inode_const(tree); 2120 __entry->owner = tree [all...] |
/linux-master/fs/bcachefs/ |
H A D | snapshot.c | 19 * Keys in BTREE_ID_snapshot_trees identify a whole tree of snapshot nodes; they 21 * tree. 208 prt_printf(out, "is_subvol %llu deleted %llu parent %10u children %10u %10u subvol %u tree %u", 215 le32_to_cpu(s.v->tree)); 323 t->tree = le32_to_cpu(s.v->tree); 551 st.k->p.offset != le32_to_cpu(s.tree), 553 "snapshot tree points to missing/incorrect snapshot:\n %s", 566 "snapshot tree points to missing subvolume:\n %s", 573 "snapshot tree point 1189 create_snapids(struct btree_trans *trans, u32 parent, u32 tree, u32 *new_snapids, u32 *snapshot_subvols, unsigned nr_snapids) argument [all...] |
/linux-master/fs/btrfs/ |
H A D | extent_io.c | 18 #include "extent-io-tree.h" 326 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; local 348 found = btrfs_find_delalloc_range(tree, &delalloc_start, &delalloc_end, 394 lock_extent(tree, delalloc_start, delalloc_end, &cached_state); 397 ret = test_range_bit(tree, delalloc_start, delalloc_end, 400 unlock_extent(tree, delalloc_start, delalloc_end, &cached_state); 456 * - clear the writeback bits in the extent tree for the range 459 * Scheduling is not allowed, so the extent state tree is expected 530 struct extent_io_tree *tree; local 553 tree 1039 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; local 2326 extent_invalidate_folio(struct extent_io_tree *tree, struct folio *folio, size_t offset) argument 2358 try_release_extent_state(struct extent_io_tree *tree, struct page *page, gfp_t mask) argument [all...] |
/linux-master/drivers/gpu/drm/nouveau/nvkm/subdev/mmu/ |
H A D | vmm.c | 148 /* Recurse up the tree, unreferencing/destroying unneeded PDs. */ 538 /* Walk down the tree, finding page tables for each level. */ 574 /* Walk back up the tree to the next position. */ 838 rb_erase(&vma->tree, &vmm->free); 856 struct nvkm_vma *this = rb_entry(*ptr, typeof(*this), tree); 873 rb_link_node(&vma->tree, parent, ptr); 874 rb_insert_color(&vma->tree, &vmm->free); 880 rb_erase(&vma->tree, &vmm->root); 898 struct nvkm_vma *this = rb_entry(*ptr, typeof(*this), tree); 909 rb_link_node(&vma->tree, paren [all...] |
/linux-master/scripts/ |
H A D | parse-maintainers.pl | 47 T: SCM tree type and location
|
/linux-master/net/tipc/ |
H A D | group.c | 199 struct rb_root *tree = &grp->members; local 204 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { 214 struct rb_root *tree = &grp->members; local 220 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) {
|
/linux-master/fs/jfs/ |
H A D | jfs_dmap.h | 11 #define TREESIZE (256+64+16+4+1) /* size of a dmap tree */ 12 #define LEAFIND (64+16+4+1) /* index of 1st leaf of a dmap tree */ 13 #define LPERDMAP 256 /* num leaves per dmap tree */ 14 #define L2LPERDMAP 8 /* l2 number of leaves per dmap tree */ 20 #define CTLTREESIZE (1024+256+64+16+4+1) /* size of a dmapctl tree */ 21 #define CTLLEAFIND (256+64+16+4+1) /* idx of 1st leaf of a dmapctl tree */ 22 #define LPERCTL 1024 /* num of leaves per dmapctl tree */ 23 #define L2LPERCTL 10 /* l2 num of leaves per dmapctl tree */ 24 #define ROOT 0 /* index of the root of a tree */ 49 * of the tree 151 struct dmaptree tree; /* 360: dmap tree */ member in struct:dmap [all...] |
/linux-master/arch/x86/crypto/ |
H A D | crct10dif-pcl-asm_64.S | 15 # COPYING in the main directory of this source tree, or the
|
/linux-master/drivers/infiniband/hw/mlx5/ |
H A D | qpc.c | 23 common = radix_tree_lookup(&table->tree, rsn); 167 err = radix_tree_insert(&table->tree, 188 radix_tree_delete(&table->tree, 505 INIT_RADIX_TREE(&table->tree, GFP_ATOMIC);
|
/linux-master/tools/perf/ui/stdio/ |
H A D | hist.c | 305 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, argument 311 struct rb_node *rb_node = rb_first(tree); 356 static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, argument 362 struct rb_node *rb_node = rb_first(tree);
|