| /Linux-v6.6/drivers/infiniband/hw/usnic/ |
| 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,
|
| 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-v6.6/tools/perf/util/ |
| D | srcline.h | 23 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline);
25 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr);
27 void srcline__tree_delete(struct rb_root_cached *tree);
51 void inlines__tree_insert(struct rb_root_cached *tree,
54 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr);
56 void inlines__tree_delete(struct rb_root_cached *tree);
|
| 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);
|
| D | hist.c | 361 struct rb_root_cached *root_in; in hists__delete_entry()
362 struct rb_root_cached *root_out; in hists__delete_entry()
1475 struct rb_root_cached *root, in hierarchy_insert_entry()
1547 struct rb_root_cached *root, in hists__hierarchy_insert_entry()
1599 struct rb_root_cached *root, in hists__collapse_insert_entry()
1653 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists) in hists__get_rotate_entries_in()
1655 struct rb_root_cached *root; in hists__get_rotate_entries_in()
1678 struct rb_root_cached *root; in hists__collapse_resort()
1789 static void hierarchy_insert_output_entry(struct rb_root_cached *root, in hierarchy_insert_output_entry()
1822 struct rb_root_cached *root_in, in hists__hierarchy_output_resort()
[all …]
|
| D | kwork.h | 140 struct rb_root_cached work_root;
178 struct rb_root_cached sorted_work_root;
|
| D | hist.h | 92 struct rb_root_cached entries_in_array[2];
93 struct rb_root_cached *entries_in;
94 struct rb_root_cached entries;
95 struct rb_root_cached entries_collapsed;
263 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists);
|
| D | dso.h | 152 struct rb_root_cached symbols;
155 struct rb_root_cached inlined_nodes;
156 struct rb_root_cached srclines;
|
| /Linux-v6.6/include/linux/ |
| 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,
68 struct rb_root_cached *itree,
72 struct rb_root_cached *itree,
|
| D | rbtree_types.h | 26 struct rb_root_cached { struct
32 #define RB_ROOT_CACHED (struct rb_root_cached) { {NULL, }, NULL } argument
|
| 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, \
|
| 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-v6.6/drivers/iommu/iommufd/ |
| D | double_span.h | 17 struct rb_root_cached *itrees[2];
35 struct rb_root_cached *itree1, struct rb_root_cached *itree2,
|
| D | iommufd_private.h | 45 struct rb_root_cached area_itree;
47 struct rb_root_cached allowed_itree;
49 struct rb_root_cached reserved_itree;
83 struct rb_root_cached *allowed_iova);
|
| D | io_pagetable.h | 204 struct rb_root_cached access_itree;
206 struct rb_root_cached domains_itree;
|
| /Linux-v6.6/mm/ |
| 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-v6.6/tools/include/linux/ |
| 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()
|
| 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, \
|
| /Linux-v6.6/lib/ |
| 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()
|
| 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()
|
| D | interval_tree.c | 44 struct rb_root_cached *itree, in interval_tree_span_iter_first()
125 struct rb_root_cached *itree, in interval_tree_span_iter_advance()
|
| /Linux-v6.6/Documentation/translations/zh_CN/core-api/ |
| 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-v6.6/tools/perf/tests/ |
| 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()
|
| /Linux-v6.6/fs/btrfs/ |
| D | delayed-inode.h | 54 struct rb_root_cached ins_root;
55 struct rb_root_cached del_root;
|
| /Linux-v6.6/fs/xfs/scrub/ |
| D | bitmap.c | 42 xbitmap_tree_insert(struct xbitmap_node *node, struct rb_root_cached *root);
45 xbitmap_tree_remove(struct xbitmap_node *node, struct rb_root_cached *root);
48 xbitmap_tree_iter_first(struct rb_root_cached *root, uint64_t start,
|
