Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 1283) sorted by relevance

12345678910>>...52

/linux/tools/testing/radix-tree/
H A Dtag_check.c14 __simple_checks(struct radix_tree_root *tree, unsigned long index, int tag) in __simple_checks() argument
19 item_check_absent(tree, index); in __simple_checks()
20 assert(item_tag_get(tree, index, tag) == 0); in __simple_checks()
22 item_insert(tree, index); in __simple_checks()
23 assert(item_tag_get(tree, index, tag) == 0); in __simple_checks()
24 item_tag_set(tree, index, tag); in __simple_checks()
25 ret = item_tag_get(tree, index, tag); in __simple_checks()
27 ret = tag_tagged_items(tree, first, ~0UL, 10, tag, !tag); in __simple_checks()
29 ret = item_tag_get(tree, index, !tag); in __simple_checks()
31 ret = item_delete(tree, index); in __simple_checks()
[all …]
H A Dmain.c18 RADIX_TREE(tree, GFP_KERNEL); in __gang_check()
23 item_insert(&tree, middle + idx); in __gang_check()
25 item_check_absent(&tree, middle - down - 1); in __gang_check()
27 item_check_present(&tree, middle + idx); in __gang_check()
28 item_check_absent(&tree, middle + up); in __gang_check()
31 item_gang_check_present(&tree, middle - down, up + down, in __gang_check()
33 item_full_scan(&tree, middle - down, down + up, chunk); in __gang_check()
35 item_kill_tree(&tree); in __gang_check()
81 RADIX_TREE(tree, GFP_KERNEL); in add_and_check()
83 item_insert(&tree, 44); in add_and_check()
[all …]
/linux/kernel/
H A Daudit_tree.c95 struct audit_tree *tree; in alloc_tree() local
99 tree = kmalloc(struct_size(tree, pathname, sz), GFP_KERNEL); in alloc_tree()
100 if (tree) { in alloc_tree()
101 refcount_set(&tree->count, 1); in alloc_tree()
102 tree->goner = 0; in alloc_tree()
103 INIT_LIST_HEAD(&tree->chunks); in alloc_tree()
104 INIT_LIST_HEAD(&tree->rules); in alloc_tree()
105 INIT_LIST_HEAD(&tree->list); in alloc_tree()
106 INIT_LIST_HEAD(&tree->same_root); in alloc_tree()
107 tree->root = NULL; in alloc_tree()
[all …]
/linux/fs/btrfs/
H A Dextent-io-tree.c8 #include "extent-io-tree.h"
47 "state leak: start %llu end %llu state %u in tree %d refs %d", in btrfs_extent_state_leak_debug_check()
57 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
58 __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end))
60 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range() argument
63 const struct btrfs_inode *inode = tree->inode; in __btrfs_debug_check_extent_io_range()
66 if (tree->owner != IO_TREE_INODE_IO) in __btrfs_debug_check_extent_io_range()
84 const struct btrfs_inode *btrfs_extent_io_tree_to_inode(const struct extent_io_tree *tree) in btrfs_extent_io_tree_to_inode() argument
86 if (tree->owner == IO_TREE_INODE_IO) in btrfs_extent_io_tree_to_inode()
87 return tree in btrfs_extent_io_tree_to_inode()
92 btrfs_extent_io_tree_to_fs_info(const struct extent_io_tree * tree) btrfs_extent_io_tree_to_fs_info() argument
100 btrfs_extent_io_tree_init(struct btrfs_fs_info * fs_info,struct extent_io_tree * tree,unsigned int owner) btrfs_extent_io_tree_init() argument
115 btrfs_extent_io_tree_release(struct extent_io_tree * tree) btrfs_extent_io_tree_release() argument
237 tree_search_for_insert(struct extent_io_tree * tree,u64 offset,struct rb_node *** node_ret,struct rb_node ** parent_ret) tree_search_for_insert() argument
287 tree_search_prev_next(struct extent_io_tree * tree,u64 offset,struct extent_state ** prev_ret,struct extent_state ** next_ret) tree_search_prev_next() argument
327 tree_search(struct extent_io_tree * tree,u64 offset) tree_search() argument
332 extent_io_tree_panic(const struct extent_io_tree * tree,const struct extent_state * state,const char * opname,int err) extent_io_tree_panic() argument
342 merge_prev_state(struct extent_io_tree * tree,struct extent_state * state) merge_prev_state() argument
357 merge_next_state(struct extent_io_tree * tree,struct extent_state * state) merge_next_state() argument
381 merge_state(struct extent_io_tree * tree,struct extent_state * state) merge_state() argument
390 set_state_bits(struct extent_io_tree * tree,struct extent_state * state,u32 bits,struct extent_changeset * changeset) set_state_bits() argument
420 insert_state(struct extent_io_tree * tree,struct extent_state * state,u32 bits,struct extent_changeset * changeset) insert_state() argument
478 insert_state_fast(struct extent_io_tree * tree,struct extent_state * state,struct rb_node ** node,struct rb_node * parent,unsigned bits,struct extent_changeset * changeset) insert_state_fast() argument
503 split_state(struct extent_io_tree * tree,struct extent_state * orig,struct extent_state * prealloc,u64 split) split_state() argument
560 clear_state_bit(struct extent_io_tree * tree,struct extent_state * state,u32 bits,int wake,u64 end,struct extent_changeset * changeset) clear_state_bit() argument
612 btrfs_clear_extent_bit_changeset(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached_state,struct extent_changeset * changeset) btrfs_clear_extent_bit_changeset() argument
776 wait_extent_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached_state) wait_extent_bit() argument
863 find_first_extent_bit_state(struct extent_io_tree * tree,u64 start,u32 bits) find_first_extent_bit_state() argument
889 btrfs_find_first_extent_bit(struct extent_io_tree * tree,u64 start,u64 * start_ret,u64 * end_ret,u32 bits,struct extent_state ** cached_state) btrfs_find_first_extent_bit() argument
953 btrfs_find_contiguous_extent_bit(struct extent_io_tree * tree,u64 start,u64 * start_ret,u64 * end_ret,u32 bits) btrfs_find_contiguous_extent_bit() argument
983 btrfs_find_delalloc_range(struct extent_io_tree * tree,u64 * start,u64 * end,u64 max_bytes,struct extent_state ** cached_state) btrfs_find_delalloc_range() argument
1046 set_extent_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,u64 * failed_start,struct extent_state ** failed_state,struct extent_state ** cached_state,struct extent_changeset * changeset) set_extent_bit() argument
1294 btrfs_set_extent_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached_state) btrfs_set_extent_bit() argument
1318 btrfs_convert_extent_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,u32 clear_bits,struct extent_state ** cached_state) btrfs_convert_extent_bit() argument
1547 btrfs_find_first_clear_extent_bit(struct extent_io_tree * tree,u64 start,u64 * start_ret,u64 * end_ret,u32 bits) btrfs_find_first_clear_extent_bit() argument
1665 btrfs_count_range_bits(struct extent_io_tree * tree,u64 * start,u64 search_end,u64 max_bytes,u32 bits,bool contig,struct extent_state ** cached_state) btrfs_count_range_bits() argument
1753 btrfs_test_range_bit_exists(struct extent_io_tree * tree,u64 start,u64 end,u32 bit) btrfs_test_range_bit_exists() argument
1779 btrfs_get_range_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 * bits,struct extent_state ** cached_state) btrfs_get_range_bits() argument
1816 btrfs_test_range_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bit,struct extent_state * cached) btrfs_test_range_bit() argument
1858 btrfs_set_record_extent_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_changeset * changeset) btrfs_set_record_extent_bits() argument
1871 btrfs_clear_record_extent_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_changeset * changeset) btrfs_clear_record_extent_bits() argument
1883 btrfs_try_lock_extent_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached) btrfs_try_lock_extent_bits() argument
1903 btrfs_lock_extent_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached_state) btrfs_lock_extent_bits() argument
1929 btrfs_next_extent_state(struct extent_io_tree * tree,struct extent_state * state) btrfs_next_extent_state() argument
[all...]
H A Dextent-io-tree.h138 const struct btrfs_inode *btrfs_extent_io_tree_to_inode(const struct extent_io_tree *tree);
139 const struct btrfs_fs_info *btrfs_extent_io_tree_to_fs_info(const struct extent_io_tree *tree);
142 struct extent_io_tree *tree, unsigned int owner);
143 void btrfs_extent_io_tree_release(struct extent_io_tree *tree);
144 int btrfs_lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits,
146 bool btrfs_try_lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
149 static inline int btrfs_lock_extent(struct extent_io_tree *tree, u64 start, u64 end, in btrfs_lock_extent() argument
152 return btrfs_lock_extent_bits(tree, start, end, EXTENT_LOCKED, cached); in btrfs_lock_extent()
155 static inline bool btrfs_try_lock_extent(struct extent_io_tree *tree, u64 start, in btrfs_try_lock_extent() argument
158 return btrfs_try_lock_extent_bits(tree, start, end, EXTENT_LOCKED, cached); in btrfs_try_lock_extent()
[all …]
H A DMakefile24 btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
29 export.o tree-log.o free-space-cache.o zlib.o lzo.o zstd.o \
32 uuid-tree.o props.o free-space-tree.o tree-checker.o space-info.o \
34 subpage.o tree-mod-log.o extent-io-tree.o fs.o messages.o bio.o \
35 lru_cache.o raid-stripe-tree
[all...]
H A Dextent_map.c31 * Initialize the extent tree @tree. Should be called for each new inode or
34 void btrfs_extent_map_tree_init(struct extent_map_tree *tree) in btrfs_extent_map_tree_init() argument
36 tree->root = RB_ROOT; in btrfs_extent_map_tree_init()
37 INIT_LIST_HEAD(&tree->modified_extents); in btrfs_extent_map_tree_init()
38 rwlock_init(&tree->lock); in btrfs_extent_map_tree_init()
136 * Search through the tree for an extent_map with a given offset. If it can't
259 * removed from the tree and likely freed. Note that @merged is one of @prev/@next
361 * We can't modify an extent map that is in the tree and that is being in try_merge_map()
364 * the tree an in try_merge_map()
415 struct extent_map_tree *tree = &inode->extent_tree; btrfs_unpin_extent_cache() local
491 struct extent_map_tree *tree = &inode->extent_tree; add_extent_mapping() local
511 lookup_extent_mapping(struct extent_map_tree * tree,u64 start,u64 len,bool strict) lookup_extent_mapping() argument
548 btrfs_lookup_extent_mapping(struct extent_map_tree * tree,u64 start,u64 len) btrfs_lookup_extent_mapping() argument
566 btrfs_search_extent_mapping(struct extent_map_tree * tree,u64 start,u64 len) btrfs_search_extent_mapping() argument
583 struct extent_map_tree *tree = &inode->extent_tree; btrfs_remove_extent_mapping() local
600 struct extent_map_tree *tree = &inode->extent_tree; replace_extent_mapping() local
763 struct extent_map_tree *tree = &inode->extent_tree; drop_all_extent_maps_fast() local
1006 struct extent_map_tree *tree = &inode->extent_tree; btrfs_replace_extent_map_range() local
1126 struct extent_map_tree *tree = &inode->extent_tree; btrfs_scan_inode() local
1202 struct extent_map_tree *tree; find_first_inode_to_shrink() local
[all...]
/linux/drivers/gpu/drm/xe/
H A Dxe_range_fence.c24 struct xe_range_fence_tree *tree = rfence->tree; in xe_range_fence_signal_notify() local
26 llist_add(&rfence->link, &tree->list); in xe_range_fence_signal_notify()
29 static bool __xe_range_fence_tree_cleanup(struct xe_range_fence_tree *tree) in __xe_range_fence_tree_cleanup() argument
31 struct llist_node *node = llist_del_all(&tree->list); in __xe_range_fence_tree_cleanup()
35 xe_range_fence_tree_remove(rfence, &tree->root); in __xe_range_fence_tree_cleanup()
54 int xe_range_fence_insert(struct xe_range_fence_tree *tree, in xe_range_fence_insert() argument
61 __xe_range_fence_tree_cleanup(tree); in xe_range_fence_insert()
69 rfence->tree = tree; in xe_range_fence_insert()
78 xe_range_fence_tree_insert(rfence, &tree->root); in xe_range_fence_insert()
89 static void xe_range_fence_tree_remove_all(struct xe_range_fence_tree *tree) in xe_range_fence_tree_remove_all() argument
[all …]
/linux/fs/unicode/
H A Dmkutf8data.c189 struct tree;
190 static utf8leaf_t *utf8nlookup(struct tree *, unsigned char *,
192 static utf8leaf_t *utf8lookup(struct tree *, unsigned char *, const char *);
345 struct tree { struct
350 struct tree *next; argument
355 int *(*leaf_index)(struct tree *, void *); argument
380 static void *lookup(struct tree *tree, const char *key) in lookup() argument
385 node = tree->root; in lookup()
417 static void tree_walk(struct tree *tree) in tree_walk() argument
428 printf("%s_%x root %p\n", tree->type, tree->maxage, tree->root); in tree_walk()
[all …]
/linux/sound/hda/core/
H A Dsysfs.c322 struct hdac_widget_tree *tree = codec->widgets; in widget_tree_free() local
325 if (!tree) in widget_tree_free()
327 free_widget_node(tree->afg, &widget_afg_group); in widget_tree_free()
328 if (tree->nodes) { in widget_tree_free()
329 for (p = tree->nodes; *p; p++) in widget_tree_free()
331 kfree(tree->nodes); in widget_tree_free()
333 kobject_put(tree->root); in widget_tree_free()
334 kfree(tree); in widget_tree_free()
365 struct hdac_widget_tree *tree; in widget_tree_create() local
369 tree = codec->widgets = kzalloc(sizeof(*tree), GFP_KERNEL); in widget_tree_create()
[all …]
/linux/rust/kernel/
H A Dmaple_tree.rs31 tree: Opaque<bindings::maple_tree>, field
42 tree: MapleTree<T>, field
51 &self.tree in deref()
86 tree <- Opaque::ffi_init(|slot| unsafe { bindings::mt_init_flags(slot, 0) }), in new()
184 bindings::mtree_insert_range(self.tree.get(), first, last, ptr, gfp.as_raw()) in insert_range()
229 let ret = unsafe { bindings::mtree_erase(self.tree.get(), index) }; in erase()
249 let lock_ptr = unsafe { &raw mut (*self.tree.get()).__bindgen_anon_1.ma_lock }; in ma_lock()
301 unsafe { bindings::mtree_destroy(self.tree.get()) }; in drop()
311 pub struct MapleGuard<'tree, T: ForeignOwnable>(&'tree MapleTree<T>);
313 impl<'tree, T: ForeignOwnable> Drop for MapleGuard<'tree, T> {
[all …]
/linux/lib/zlib_deflate/
H A Ddeftree.c133 static void pqdownheap (deflate_state *s, ct_data *tree, int k);
135 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
137 static void scan_tree (deflate_state *s, ct_data *tree, int max_code);
138 static void send_tree (deflate_state *s, ct_data *tree, int max_code);
150 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
154 # define send_code(s, c, tree) \ argument
156 send_bits(s, tree[c].Code, tree[c].Len); }
296 #define pqremove(s, tree, top) \ argument
300 pqdownheap(s, tree, SMALLEST); \
307 #define smaller(tree, n, m, depth) \ argument
[all …]
/linux/scripts/dtc/
H A Dfstree.c16 struct node *tree; in read_fstree() local
22 tree = build_node(NULL, NULL, NULL); in read_fstree()
50 add_property(tree, prop); in read_fstree()
58 add_child(tree, newchild); in read_fstree()
65 return tree; in read_fstree()
70 struct node *tree; in dt_from_fs() local
72 tree = read_fstree(dirname); in dt_from_fs()
73 tree = name_node(tree, ""); in dt_from_fs()
75 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree)); in dt_from_fs()
/linux/scripts/gcc-plugins/
H A Dlatent_entropy_plugin.c82 static GTY(()) tree latent_entropy_decl;
116 static tree tree_get_random_const(tree type) in tree_get_random_const()
128 static tree handle_latent_entropy_attribute(tree *node, tree name, in handle_latent_entropy_attribute()
129 tree args __unused, in handle_latent_entropy_attribute()
133 tree type; in handle_latent_entropy_attribute()
167 tree fld, lst = TYPE_FIELDS(type); in handle_latent_entropy_attribute()
171 tree fieldtype; in handle_latent_entropy_attribute()
189 tree random_const, fld_t = TREE_TYPE(fld); in handle_latent_entropy_attribute()
206 tree elt_type, array_size, elt_size; in handle_latent_entropy_attribute()
229 tree cst = size_int(i); in handle_latent_entropy_attribute()
[all …]
H A Drandomize_layout_plugin.c54 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_… in handle_randomize_layout_attr()
56 tree type; in handle_randomize_layout_attr()
100 static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_… in handle_randomize_considered_attr()
110 static tree handle_randomize_performed_attr(tree *node, tree name, tree args, int flags, bool *no_a… in handle_randomize_performed_attr()
150 tree tree_start;
155 static void partition_struct(tree *fields, unsigned long length, struct partition_group *size_group… in partition_struct()
191 static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in performance_shuffle()
211 tree tmp; in performance_shuffle()
228 static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in full_shuffle()
233 tree tmp; in full_shuffle()
[all …]
/linux/net/sched/
H A Dematch.c162 static inline struct tcf_ematch *tcf_em_get_match(struct tcf_ematch_tree *tree, in tcf_em_get_match() argument
165 return &tree->matches[index]; in tcf_em_get_match()
306 struct tcf_ematch_tree *tree) in tcf_em_tree_validate() argument
314 memset(tree, 0, sizeof(*tree)); in tcf_em_tree_validate()
331 memcpy(&tree->hdr, tree_hdr, sizeof(*tree_hdr)); in tcf_em_tree_validate()
337 tree->matches = kzalloc(matches_len, GFP_KERNEL); in tcf_em_tree_validate()
338 if (tree->matches == NULL) in tcf_em_tree_validate()
362 em = tcf_em_get_match(tree, idx); in tcf_em_tree_validate()
386 tcf_em_tree_destroy(tree); in tcf_em_tree_validate()
400 void tcf_em_tree_destroy(struct tcf_ematch_tree *tree) in tcf_em_tree_destroy() argument
[all …]
/linux/drivers/android/binder/range_alloc/
H A Dtree.rs25 tree: RBTree<usize, Descriptor<T>>, field
39 let mut tree = TreeRangeAllocator { in from_array() localVariable
40 tree: RBTree::new(), in from_array()
51 tree.free_tree in from_array()
53 let tree_node = alloc.tree.pop().unwrap(); in from_array()
54 tree.tree.insert( in from_array()
61 tree.free_oneway_space = tree.free_oneway_space.saturating_sub(range.size); in from_array()
65 let tree_node = alloc.tree.pop().unwrap(); in from_array()
68 tree.tree.insert(tree_node.into_node(range.offset, desc)); in from_array()
75 tree.free_tree in from_array()
[all …]
/linux/include/linux/
H A Drbtree.h193 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached() argument
196 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_cached()
211 rb_insert_color_cached(node, tree, leftmost); in rb_add_cached()
223 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add() argument
226 struct rb_node **link = &tree->rb_node; in rb_add()
238 rb_insert_color(node, tree); in rb_add()
251 rb_find_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_find_add_cached() argument
255 struct rb_node **link = &tree->rb_root.rb_node; in rb_find_add_cached()
274 rb_insert_color_cached(node, tree, leftmost); in rb_find_add_cached()
288 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add() argument
[all …]
H A Dgeneric-radix-tree.h115 .tree = { \
130 struct __genradix tree; \
156 #define genradix_free(_radix) __genradix_free(&(_radix)->tree)
206 __genradix_ptr_inlined(&(_radix)->tree, \
220 __genradix_ptr(&(_radix)->tree, \
228 (__genradix_ptr_inlined(&(_radix)->tree, \
230 __genradix_ptr_alloc(&(_radix)->tree, \
236 (__genradix_ptr_inlined(&(_radix)->tree, \
238 __genradix_ptr_alloc(&(_radix)->tree, \
253 __genradix_ptr_alloc(&(_radix)->tree, \
[all …]
/linux/lib/
H A Dtest_maple_tree.c557 MT_BUG_ON(mas.tree, entry == NULL); in check_find()
2092 newmas.tree = &newmt; in check_mas_store_gfp()
3678 static DEFINE_MTREE(tree);
3690 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE); in maple_tree_seed()
3691 bench_slot_store(&tree); in maple_tree_seed()
3692 mtree_destroy(&tree); in maple_tree_seed()
3697 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE); in maple_tree_seed()
3698 bench_node_store(&tree); in maple_tree_seed()
3699 mtree_destroy(&tree); in maple_tree_seed()
3704 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE); in maple_tree_seed()
[all …]
/linux/Documentation/core-api/
H A Dmaple_tree.rst14 non-overlapping ranges, including ranges of size 1. The tree was designed to
17 entry in a cache-efficient manner. The tree can also be put into an RCU-safe
24 use the normal API. An :ref:`maple-tree-advanced-api` exists for more complex
34 :ref:`maple-tree-advanced-api`, but are blocked by the normal API.
40 :ref:`maple-tree-advanced-api`. This is useful for users who must guarantee a
45 .. _maple-tree-normal-api:
50 Start by initialising a maple tree, either with DEFINE_MTREE() for statically
52 freshly-initialised maple tree contains a ``NULL`` pointer for the range ``0``
54 allocation tree and the regular tree. The regular tree has a higher branching
55 factor for internal nodes. The allocation tree has a lower branching factor
[all …]
/linux/scripts/
H A Dtags.sh30 tree=
32 tree=${srctree}/
37 # the kernel source tree, index all files in absolute-path form.
38 if [[ "$1" == "gtags" && -n "${tree}" ]]; then
39 tree=$(realpath "$tree")/
46 ALLSOURCE_ARCHS=$(find ${tree}arch/ -mindepth 1 -maxdepth 1 -type d -printf '%f ')
55 find ${tree}arch/$1 $ignore $prune -name "$2" -not -type l -print;
61 local include=$(find ${tree}arch/$1/ -name include -type d -print);
71 find ${tree}includ
[all...]
/linux/tools/include/linux/
H A Drbtree.h178 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached() argument
181 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_cached()
196 rb_insert_color_cached(node, tree, leftmost); in rb_add_cached()
206 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add() argument
209 struct rb_node **link = &tree->rb_node; in rb_add()
221 rb_insert_color(node, tree); in rb_add()
234 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add() argument
237 struct rb_node **link = &tree->rb_node; in rb_find_add()
254 rb_insert_color(node, tree); in rb_find_add()
267 rb_find(const void *key, const struct rb_root *tree, in rb_find() argument
[all …]
/linux/tools/perf/util/
H A Dsrcline.c263 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) in srcline__tree_insert() argument
265 struct rb_node **p = &tree->rb_root.rb_node; in srcline__tree_insert()
290 rb_insert_color_cached(&node->rb_node, tree, leftmost); in srcline__tree_insert()
293 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) in srcline__tree_find() argument
295 struct rb_node *n = tree->rb_root.rb_node; in srcline__tree_find()
312 void srcline__tree_delete(struct rb_root_cached *tree) in srcline__tree_delete() argument
315 struct rb_node *next = rb_first_cached(tree); in srcline__tree_delete()
320 rb_erase_cached(&pos->rb_node, tree); in srcline__tree_delete()
354 void inlines__tree_insert(struct rb_root_cached *tree, in inlines__tree_insert() argument
357 struct rb_node **p = &tree->rb_root.rb_node; in inlines__tree_insert()
[all …]
/linux/Documentation/ABI/testing/
H A Dsysfs-devices5 The /sys/devices tree contains a snapshot of the
6 internal state of the kernel device tree. Devices will
9 devices within this tree will change.
11 Please do not rely on the format of this tree because of
13 the tree, please use the /sys/class structure and rely
15 within the /sys/devices tree of the individual devices.
17 devices being added and removed from this tree to find

12345678910>>...52