| /linux/drivers/infiniband/hw/usnic/ |
| A D | usnic_uiom_interval_tree.h | 51 struct rb_root_cached *root);
54 struct rb_root_cached *root);
56 usnic_uiom_interval_tree_iter_first(struct rb_root_cached *root,
66 int usnic_uiom_insert_interval(struct rb_root_cached *root,
74 void usnic_uiom_remove_interval(struct rb_root_cached *root,
84 struct rb_root_cached *root,
|
| A D | usnic_uiom_interval_tree.c | 104 find_intervals_intersection_sorted(struct rb_root_cached *root, in find_intervals_intersection_sorted()
122 struct rb_root_cached *root, in usnic_uiom_get_intervals_diff()
179 int usnic_uiom_insert_interval(struct rb_root_cached *root, unsigned long start, in usnic_uiom_insert_interval()
250 void usnic_uiom_remove_interval(struct rb_root_cached *root, in usnic_uiom_remove_interval()
|
| /linux/tools/perf/util/ |
| A D | srcline.h | 22 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline);
24 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr);
26 void srcline__tree_delete(struct rb_root_cached *tree);
49 void inlines__tree_insert(struct rb_root_cached *tree,
52 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr);
54 void inlines__tree_delete(struct rb_root_cached *tree);
|
| A D | symbol.h | 74 void symbols__delete(struct rb_root_cached *symbols);
202 void __symbols__insert(struct rb_root_cached *symbols, struct symbol *sym,
204 void symbols__insert(struct rb_root_cached *symbols, struct symbol *sym);
205 void symbols__fixup_duplicate(struct rb_root_cached *symbols);
206 void symbols__fixup_end(struct rb_root_cached *symbols);
|
| A D | hist.c | 355 struct rb_root_cached *root_in; in hists__delete_entry()
356 struct rb_root_cached *root_out; in hists__delete_entry()
1520 struct rb_root_cached *root, in hists__hierarchy_insert_entry()
1567 struct rb_root_cached *root, in hists__collapse_insert_entry()
1619 struct rb_root_cached *root; in hists__get_rotate_entries_in()
1642 struct rb_root_cached *root; in hists__collapse_resort()
1888 struct rb_root_cached *root; in output_resort()
2337 struct rb_root_cached *root; in hists__add_dummy_entry()
2505 struct rb_root_cached *root; in hists__match()
2580 struct rb_root_cached *root; in hists__link()
[all …]
|
| A D | dso.h | 152 struct rb_root_cached symbols;
153 struct rb_root_cached symbol_names;
154 struct rb_root_cached inlined_nodes;
155 struct rb_root_cached srclines;
|
| A D | symbol.c | 186 void symbols__fixup_duplicate(struct rb_root_cached *symbols) in symbols__fixup_duplicate()
220 void symbols__fixup_end(struct rb_root_cached *symbols) in symbols__fixup_end()
307 void symbols__delete(struct rb_root_cached *symbols) in symbols__delete()
320 void __symbols__insert(struct rb_root_cached *symbols, in __symbols__insert()
392 static struct symbol *symbols__last(struct rb_root_cached *symbols) in symbols__last()
435 static void symbols__sort_by_name(struct rb_root_cached *symbols, in symbols__sort_by_name()
436 struct rb_root_cached *source) in symbols__sort_by_name()
707 struct rb_root_cached *root = &dso->symbols; in map__process_kallsym_symbol()
748 struct rb_root_cached old_root = dso->symbols; in maps__split_kallsyms_for_kcore()
749 struct rb_root_cached *root = &dso->symbols; in maps__split_kallsyms_for_kcore()
[all …]
|
| A D | hist.h | 86 struct rb_root_cached entries_in_array[2];
87 struct rb_root_cached *entries_in;
88 struct rb_root_cached entries;
89 struct rb_root_cached entries_collapsed;
254 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists);
|
| A D | srcline.c | 776 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) in srcline__tree_insert()
806 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) in srcline__tree_find()
825 void srcline__tree_delete(struct rb_root_cached *tree) in srcline__tree_delete()
867 void inlines__tree_insert(struct rb_root_cached *tree, in inlines__tree_insert()
890 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr) in inlines__tree_find()
909 void inlines__tree_delete(struct rb_root_cached *tree) in inlines__tree_delete()
|
| A D | sort.h | 158 struct rb_root_cached hroot_in;
159 struct rb_root_cached hroot_out;
|
| /linux/include/linux/ |
| A D | interval_tree.h | 16 struct rb_root_cached *root);
20 struct rb_root_cached *root);
23 interval_tree_iter_first(struct rb_root_cached *root,
|
| A D | rbtree_types.h | 26 struct rb_root_cached { struct
32 #define RB_ROOT_CACHED (struct rb_root_cached) { {NULL, }, NULL } argument
|
| A D | interval_tree_generic.h | 39 struct rb_root_cached *root) \
66 struct rb_root_cached *root) \
119 ITPREFIX ## _iter_first(struct rb_root_cached *root, \
|
| A D | rbtree.h | 109 struct rb_root_cached *root, in rb_insert_color_cached()
119 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) in rb_erase_cached()
133 struct rb_root_cached *root) in rb_replace_node_cached()
165 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached()
|
| /linux/tools/include/linux/ |
| A D | rbtree.h | 119 struct rb_root_cached { struct
124 #define RB_ROOT_CACHED (struct rb_root_cached) { {NULL, }, NULL } argument
130 struct rb_root_cached *root, in rb_insert_color_cached()
139 struct rb_root_cached *root) in rb_erase_cached()
148 struct rb_root_cached *root) in rb_replace_node_cached()
178 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached()
|
| /linux/mm/ |
| A D | interval_tree.c | 30 struct rb_root_cached *root) in vma_interval_tree_insert_after()
76 struct rb_root_cached *root) in INTERVAL_TREE_DEFINE()
86 struct rb_root_cached *root) in anon_vma_interval_tree_remove()
92 anon_vma_interval_tree_iter_first(struct rb_root_cached *root, in anon_vma_interval_tree_iter_first()
|
| /linux/lib/ |
| A D | rbtree_test.c | 27 static struct rb_root_cached root = RB_ROOT_CACHED;
32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert()
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached()
69 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase()
74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached()
86 struct rb_root_cached *root) in RB_DECLARE_CALLBACKS_MAX()
110 struct rb_root_cached *root) in insert_augmented_cached()
138 static void erase_augmented(struct test_node *node, struct rb_root_cached *root) in erase_augmented()
144 struct rb_root_cached *root) in erase_augmented_cached()
|
| A D | interval_tree_test.c | 23 static struct rb_root_cached root = RB_ROOT_CACHED;
30 search(struct rb_root_cached *root, unsigned long start, unsigned long last) in search()
|
| /linux/tools/perf/tests/ |
| A D | hists_output.c | 95 struct rb_root_cached *root_in; in del_hist_entries()
96 struct rb_root_cached *root_out; in del_hist_entries()
130 struct rb_root_cached *root; in test1()
232 struct rb_root_cached *root; in test2()
288 struct rb_root_cached *root; in test3()
362 struct rb_root_cached *root; in test4()
464 struct rb_root_cached *root; in test5()
|
| A D | hists_common.c | 166 struct rb_root_cached *root; in print_hists_in()
196 struct rb_root_cached *root; in print_hists_out()
|
| /linux/fs/btrfs/ |
| A D | delayed-inode.h | 53 struct rb_root_cached ins_root;
54 struct rb_root_cached del_root;
|
| A D | delayed-ref.h | 82 struct rb_root_cached ref_tree;
145 struct rb_root_cached href_root;
|
| /linux/Documentation/core-api/ |
| A D | rbtree.rst | 201 order for their own logic. To this end, users can use 'struct rb_root_cached'
209 struct rb_root_cached mytree = RB_ROOT_CACHED;
212 leftmost node. This allows rb_root_cached to exist wherever rb_root does,
216 struct rb_node *rb_first_cached(struct rb_root_cached *tree);
217 void rb_insert_color_cached(struct rb_node *, struct rb_root_cached *, bool);
218 void rb_erase_cached(struct rb_node *node, struct rb_root_cached *);
223 void rb_insert_augmented_cached(struct rb_node *node, struct rb_root_cached *,
225 void rb_erase_augmented_cached(struct rb_node *, struct rb_root_cached *,
|
| /linux/fs/f2fs/ |
| A D | extent_cache.c | 30 static struct rb_entry *__lookup_rb_tree_slow(struct rb_root_cached *root, in __lookup_rb_tree_slow()
49 struct rb_entry *f2fs_lookup_rb_tree(struct rb_root_cached *root, in f2fs_lookup_rb_tree()
62 struct rb_root_cached *root, in f2fs_lookup_rb_tree_ext()
85 struct rb_root_cached *root, in f2fs_lookup_rb_tree_for_insert()
118 struct rb_entry *f2fs_lookup_rb_tree_ret(struct rb_root_cached *root, in f2fs_lookup_rb_tree_ret()
192 struct rb_root_cached *root, bool check_key) in f2fs_check_rb_tree_consistence()
|
| /linux/include/drm/ |
| A D | drm_mm.h | 209 struct rb_root_cached interval_tree;
210 struct rb_root_cached holes_size;
|