Home
last modified time | relevance | path

Searched refs:rb_root_cached (Results 1 – 25 of 85) sorted by relevance

1234

/linux-6.1.9/drivers/infiniband/hw/usnic/
Dusnic_uiom_interval_tree.h51 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,
Dusnic_uiom_interval_tree.c104 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-6.1.9/tools/perf/util/
Dsrcline.h22 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);
Dsymbol.h74 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, bool is_kallsyms);
Dhist.c360 struct rb_root_cached *root_in; in hists__delete_entry()
361 struct rb_root_cached *root_out; in hists__delete_entry()
1453 struct rb_root_cached *root, in hierarchy_insert_entry()
1525 struct rb_root_cached *root, in hists__hierarchy_insert_entry()
1572 struct rb_root_cached *root, in hists__collapse_insert_entry()
1622 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists) in hists__get_rotate_entries_in()
1624 struct rb_root_cached *root; in hists__get_rotate_entries_in()
1647 struct rb_root_cached *root; in hists__collapse_resort()
1758 static void hierarchy_insert_output_entry(struct rb_root_cached *root, in hierarchy_insert_output_entry()
1791 struct rb_root_cached *root_in, in hists__hierarchy_output_resort()
[all …]
Ddso.h152 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;
Dkwork.h140 struct rb_root_cached work_root;
178 struct rb_root_cached sorted_work_root;
Dsymbol.c181 void symbols__fixup_duplicate(struct rb_root_cached *symbols) in symbols__fixup_duplicate()
216 void symbols__fixup_end(struct rb_root_cached *symbols, bool is_kallsyms) in symbols__fixup_end()
324 void symbols__delete(struct rb_root_cached *symbols) in symbols__delete()
337 void __symbols__insert(struct rb_root_cached *symbols, in __symbols__insert()
371 void symbols__insert(struct rb_root_cached *symbols, struct symbol *sym) in symbols__insert()
376 static struct symbol *symbols__find(struct rb_root_cached *symbols, u64 ip) in symbols__find()
399 static struct symbol *symbols__first(struct rb_root_cached *symbols) in symbols__first()
409 static struct symbol *symbols__last(struct rb_root_cached *symbols) in symbols__last()
429 static void symbols__insert_by_name(struct rb_root_cached *symbols, struct symbol *sym) in symbols__insert_by_name()
452 static void symbols__sort_by_name(struct rb_root_cached *symbols, in symbols__sort_by_name()
[all …]
Dhist.h90 struct rb_root_cached entries_in_array[2];
91 struct rb_root_cached *entries_in;
92 struct rb_root_cached entries;
93 struct rb_root_cached entries_collapsed;
259 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists);
Dsrcline.c776 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()
Drblist.h23 struct rb_root_cached entries;
/linux-6.1.9/include/linux/
Dinterval_tree.h16 struct rb_root_cached *root);
20 struct rb_root_cached *root);
23 interval_tree_iter_first(struct rb_root_cached *root,
Drbtree_types.h26 struct rb_root_cached { struct
32 #define RB_ROOT_CACHED (struct rb_root_cached) { {NULL, }, NULL } argument
Dinterval_tree_generic.h39 struct rb_root_cached *root) \
66 struct rb_root_cached *root) \
119 ITPREFIX ## _iter_first(struct rb_root_cached *root, \
Drbtree.h109 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()
Dtimerqueue.h15 struct rb_root_cached rb_root;
/linux-6.1.9/mm/
Dinterval_tree.c30 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-6.1.9/tools/include/linux/
Drbtree.h119 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-6.1.9/lib/
Drbtree_test.c27 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()
Dinterval_tree_test.c23 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-6.1.9/Documentation/translations/zh_CN/core-api/
Drbtree.rst188 他们自己的逻辑依赖一个特定的顺序。为此，用户可以使用'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-6.1.9/tools/perf/tests/
Dhists_output.c95 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()
Dhists_common.c166 struct rb_root_cached *root; in print_hists_in()
196 struct rb_root_cached *root; in print_hists_out()
/linux-6.1.9/fs/btrfs/
Ddelayed-inode.h54 struct rb_root_cached ins_root;
55 struct rb_root_cached del_root;
/linux-6.1.9/Documentation/core-api/
Drbtree.rst201 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 *,

1234