Home
last modified time | relevance | path

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

1234

/linux/drivers/infiniband/hw/usnic/
H A 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,
H A 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/tools/perf/util/
H A Dsrcline.h23 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);
H A Dsymbol.h76 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 Dhist.c370 struct rb_root_cached *root_in; in hists__delete_entry()
371 struct rb_root_cached *root_out; in hists__delete_entry()
1491 struct rb_root_cached *root, in hierarchy_insert_entry()
1563 struct rb_root_cached *root, in hists__hierarchy_insert_entry()
1615 struct rb_root_cached *root, in hists__collapse_insert_entry()
1669 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists) in hists__get_rotate_entries_in()
1671 struct rb_root_cached *root; in hists__get_rotate_entries_in()
1694 struct rb_root_cached *root; in hists__collapse_resort()
1805 static void hierarchy_insert_output_entry(struct rb_root_cached *root, in hierarchy_insert_output_entry()
1838 struct rb_root_cached *root_i in hists__hierarchy_output_resort()
[all...]
H A Dhist.h100 struct rb_root_cached entries_in_array[2];
101 struct rb_root_cached *entries_in;
102 struct rb_root_cached entries;
103 struct rb_root_cached entries_collapsed;
285 struct rb_root_cached hroot_in;
286 struct rb_root_cached hroot_out;
445 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists);
H A Ddso.h174 struct rb_root_cached symbols; in DECLARE_RC_STRUCT()
177 struct rb_root_cached inlined_nodes; in DECLARE_RC_STRUCT()
178 struct rb_root_cached srclines; in DECLARE_RC_STRUCT()
403 static inline struct rb_root_cached *dso__inlined_nodes(struct dso *dso) in dso__inlined_nodes()
555 static inline struct rb_root_cached *dso__srclines(struct dso *dso) in dso__srclines()
570 static inline struct rb_root_cached *dso__symbols(struct dso *dso) in dso__symbols()
H A Dkwork.h150 struct rb_root_cached work_root;
206 struct rb_root_cached sorted_work_root;
/linux/include/linux/
H A Dinterval_tree.h16 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,
H A Drbtree_types.h26 struct rb_root_cached { struct
32 #define RB_ROOT_CACHED (struct rb_root_cached) { {NULL, }, NULL } argument
H A Dinterval_tree_generic.h39 struct rb_root_cached *root) \
66 struct rb_root_cached *root) \
119 ITPREFIX ## _iter_first(struct rb_root_cached *root, \
H A 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()
H A Drbtree_augmented.h55 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()
H A Dtimerqueue_types.h14 struct rb_root_cached rb_root;
/linux/drivers/iommu/iommufd/
H A Ddouble_span.h17 struct rb_root_cached *itrees[2];
35 struct rb_root_cached *itree1, struct rb_root_cached *itree2,
H A Diommufd_private.h52 struct rb_root_cached area_itree;
54 struct rb_root_cached allowed_itree;
56 struct rb_root_cached reserved_itree;
101 struct rb_root_cached *allowed_iova);
/linux/mm/
H A 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/tools/include/linux/
H A 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()
H A Dinterval_tree_generic.h39 struct rb_root_cached *root) \
66 struct rb_root_cached *root) \
119 ITPREFIX ## _iter_first(struct rb_root_cached *root, \
/linux/Documentation/translations/zh_CN/core-api/
H A 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/tools/testing/vma/
H A Dvma_internal.h136 struct rb_root_cached rb_root;
169 struct rb_root_cached i_mmap;
765 struct rb_root_cached *) in flush_dcache_mmap_unlock()
770 struct rb_root_cached *) in anon_vma_interval_tree_insert()
779 struct rb_root_cached *) in uprobe_mmap()
784 struct rb_root_cached *) in uprobe_munmap()
754 vma_interval_tree_insert(struct vm_area_struct *,struct rb_root_cached *) vma_interval_tree_insert() argument
759 vma_interval_tree_remove(struct vm_area_struct *,struct rb_root_cached *) vma_interval_tree_remove() argument
768 anon_vma_interval_tree_insert(struct anon_vma_chain *,struct rb_root_cached *) anon_vma_interval_tree_insert() argument
773 anon_vma_interval_tree_remove(struct anon_vma_chain *,struct rb_root_cached *) anon_vma_interval_tree_remove() argument
/linux/fs/xfs/scrub/
H A Dbitmap.h12 struct rb_root_cached xb_root;
40 struct rb_root_cached xb_root;
/linux/tools/perf/tests/
H A Dhists_output.c98 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/lib/
H A Dinterval_tree.c44 struct rb_root_cached *itree, in interval_tree_span_iter_first()
125 struct rb_root_cached *itree, in interval_tree_span_iter_advance()
/linux/Documentation/core-api/
H A 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