| /linux/tools/perf/util/ |
| H 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);
52 void inlines__tree_insert(struct rb_root_cached *tree,
55 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr);
57 void inlines__tree_delete(struct rb_root_cached *tree);
|
| H A D | symbol.h | 76 void symbols__delete(struct rb_root_cached *symbols);
187 void __symbols__insert(struct rb_root_cached *symbols, struct symbol *sym,
189 void symbols__insert(struct rb_root_cached *symbols, struct symbol *sym);
190 void symbols__fixup_duplicate(struct rb_root_cached *symbols);
191 void symbols__fixup_end(struct rb_root_cached *symbols, bool is_kallsyms);
|
| H A D | srcline.c | 263 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) in srcline__tree_insert()
293 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) in srcline__tree_find()
312 void srcline__tree_delete(struct rb_root_cached *tree) in srcline__tree_delete()
354 void inlines__tree_insert(struct rb_root_cached *tree, in inlines__tree_insert()
377 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr) in inlines__tree_find()
396 void inlines__tree_delete(struct rb_root_cached *tree) in inlines__tree_delete()
|
| H A D | hist.c | 447 struct rb_root_cached *root_in; in hists__delete_entry()
448 struct rb_root_cached *root_out; in hists__delete_entry()
1624 struct rb_root_cached *root, in hierarchy_insert_entry()
1695 struct rb_root_cached *root, in hists__hierarchy_insert_entry()
1747 struct rb_root_cached *root, in hists__collapse_insert_entry()
1802 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists) in hists__get_rotate_entries_in()
1804 struct rb_root_cached *root; in hists__get_rotate_entries_in()
1828 struct rb_root_cached *root; in hists__collapse_resort()
1930 static void hierarchy_insert_output_entry(struct rb_root_cached *root, in hierarchy_insert_output_entry()
1963 struct rb_root_cached *root_in, in hists__hierarchy_output_resort()
[all …]
|
| H A D | hist.h | 113 struct rb_root_cached entries_in_array[2];
114 struct rb_root_cached *entries_in;
115 struct rb_root_cached entries;
116 struct rb_root_cached entries_collapsed;
313 struct rb_root_cached hroot_in;
314 struct rb_root_cached hroot_out;
474 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists);
|
| H A D | dso.h | 254 struct rb_root_cached symbols; in DECLARE_RC_STRUCT()
257 struct rb_root_cached inlined_nodes; in DECLARE_RC_STRUCT()
258 struct rb_root_cached srclines; in DECLARE_RC_STRUCT()
487 static inline struct rb_root_cached *dso__inlined_nodes(struct dso *dso) in dso__inlined_nodes()
639 static inline struct rb_root_cached *dso__srclines(struct dso *dso) in dso__srclines()
654 static inline struct rb_root_cached *dso__symbols(struct dso *dso) in dso__symbols()
|
| H A D | rblist.h | 23 struct rb_root_cached entries;
|
| H A D | symbol.c | 218 void symbols__fixup_duplicate(struct rb_root_cached *symbols) in symbols__fixup_duplicate()
256 void symbols__fixup_end(struct rb_root_cached *symbols, bool is_kallsyms) in symbols__fixup_end()
358 void symbols__delete(struct rb_root_cached *symbols) in symbols__delete()
371 void __symbols__insert(struct rb_root_cached *symbols, in __symbols__insert()
405 void symbols__insert(struct rb_root_cached *symbols, struct symbol *sym) in symbols__insert()
410 static struct symbol *symbols__find(struct rb_root_cached *symbols, u64 ip) in symbols__find()
433 static struct symbol *symbols__first(struct rb_root_cached *symbols) in symbols__first()
443 static struct symbol *symbols__last(struct rb_root_cached *symbols) in symbols__last()
471 static struct symbol **symbols__sort_by_name(struct rb_root_cached *source, size_t *len) in symbols__sort_by_name()
778 struct rb_root_cached *root = dso__symbols(dso); in map__process_kallsym_symbol()
[all …]
|
| /linux/drivers/iommu/iommufd/ |
| H A D | double_span.h | 17 struct rb_root_cached *itrees[2];
35 struct rb_root_cached *itree1, struct rb_root_cached *itree2,
|
| /linux/mm/ |
| H 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/tools/include/linux/ |
| H 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/Documentation/translations/zh_CN/core-api/ |
| H A D | rbtree.rst | 188 他们自己的逻辑依赖一个特定的顺序。为此，用户可以使用'struct rb_root_cached'来优化
194 struct rb_root_cached mytree = RB_ROOT_CACHED;
197 rb_root_cached可以存在于rb_root存在的任何地方，并且只需增加几个接口来支持带缓存的
200 struct rb_node *rb_first_cached(struct rb_root_cached *tree);
201 void rb_insert_color_cached(struct rb_node *, struct rb_root_cached *, bool);
202 void rb_erase_cached(struct rb_node *node, struct rb_root_cached *);
206 void rb_insert_augmented_cached(struct rb_node *node, struct rb_root_cached *,
208 void rb_erase_augmented_cached(struct rb_node *, struct rb_root_cached *,
|
| /linux/include/linux/ |
| H A D | rbtree_types.h | 26 struct rb_root_cached { struct
32 #define RB_ROOT_CACHED (struct rb_root_cached) { {NULL, }, NULL } argument
|
| H A D | rbtree.h | 137 struct rb_root_cached *root, in rb_insert_color_cached()
147 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) in rb_erase_cached()
161 struct rb_root_cached *root) in rb_replace_node_cached()
193 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached()
251 rb_find_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_find_add_cached()
|
| H A D | timerqueue_types.h | 14 struct rb_root_cached rb_root;
|
| H A D | rbtree_augmented.h | 55 struct rb_root_cached *root, bool newleft, in rb_insert_augmented_cached()
64 rb_add_augmented_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_augmented_cached()
335 rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root, in rb_erase_augmented_cached()
|
| /linux/drivers/infiniband/hw/usnic/ |
| H 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()
|
| H A D | usnic_uiom.h | 60 struct rb_root_cached root;
|
| /linux/fs/xfs/scrub/ |
| H A D | bitmap.h | 12 struct rb_root_cached xb_root;
40 struct rb_root_cached xb_root;
|
| /linux/tools/perf/tests/ |
| H A D | hists_output.c | 98 struct rb_root_cached *root_in; in del_hist_entries()
99 struct rb_root_cached *root_out; in del_hist_entries()
143 struct rb_root_cached *root; in test1()
245 struct rb_root_cached *root; in test2()
301 struct rb_root_cached *root; in test3()
375 struct rb_root_cached *root; in test4()
477 struct rb_root_cached *root; in test5()
|
| H A D | hists_common.c | 166 struct rb_root_cached *root; in print_hists_in()
198 struct rb_root_cached *root; in print_hists_out()
|
| /linux/fs/btrfs/ |
| H A D | delayed-inode.h | 79 struct rb_root_cached ins_root;
80 struct rb_root_cached del_root;
|
| /linux/Documentation/core-api/ |
| H 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/drivers/vfio/pci/pds/ |
| H A D | dirty.h | 38 struct rb_root_cached *ranges, u32 nnodes,
|
| /linux/drivers/infiniband/hw/hfi1/ |
| H A D | mmu_rb.h | 43 struct rb_root_cached root ____cacheline_aligned_in_smp;
|