Home
last modified time | relevance | path

Searched refs:rb_entry (Results 1 – 25 of 49) sorted by relevance

12

/tools/perf/tests/
Dhists_output.c109 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
167 he = rb_entry(node, struct hist_entry, rb_node); in test1()
173 he = rb_entry(node, struct hist_entry, rb_node); in test1()
179 he = rb_entry(node, struct hist_entry, rb_node); in test1()
185 he = rb_entry(node, struct hist_entry, rb_node); in test1()
191 he = rb_entry(node, struct hist_entry, rb_node); in test1()
197 he = rb_entry(node, struct hist_entry, rb_node); in test1()
203 he = rb_entry(node, struct hist_entry, rb_node); in test1()
209 he = rb_entry(node, struct hist_entry, rb_node); in test1()
215 he = rb_entry(node, struct hist_entry, rb_node); in test1()
[all …]
Dhists_common.c179 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
206 he = rb_entry(node, struct hist_entry, rb_node); in print_hists_out()
Dhists_cumulate.c143 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
204 node && (he = rb_entry(node, struct hist_entry, rb_node)); in do_test()
225 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
/tools/include/linux/
Drbtree_augmented.h82 RBSTRUCT *node = rb_entry(rb, RBSTRUCT, RBFIELD); \
91 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
92 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
98 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
99 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
129 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
134 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
Drbtree.h37 #define rb_entry(ptr, type, member) container_of(ptr, type, member) macro
77 ____ptr ? rb_entry(____ptr, type, member) : NULL; \
/tools/perf/util/
Drb_resort.h66 a = rb_entry(nda, struct __name##_sorted_entry, rb_node); \
67 b = rb_entry(ndb, struct __name##_sorted_entry, rb_node); \
129 __name##_entry = rb_entry(__nd, struct __name##_sorted_entry, \
Dstrlist.h61 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__first()
69 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__next()
Dintlist.h49 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__first()
57 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__next()
Dhist.c248 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
338 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
381 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
397 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
411 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
596 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1456 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1575 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1653 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1738 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
[all …]
Dblock-range.c23 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug()
41 entry = rb_entry(parent, struct block_range, node); in block_range__find()
90 entry = rb_entry(parent, struct block_range, node); in block_range__create()
117 next = rb_entry(n, struct block_range, node); in block_range__create()
Denv.c37 node = rb_entry(parent, struct bpf_prog_info_node, rb_node); in __perf_env__insert_bpf_prog_info()
63 node = rb_entry(n, struct bpf_prog_info_node, rb_node); in perf_env__find_bpf_prog_info()
99 node = rb_entry(parent, struct btf_node, rb_node); in __perf_env__insert_btf()
134 node = rb_entry(n, struct btf_node, rb_node); in __perf_env__find_btf()
159 node = rb_entry(next, struct bpf_prog_info_node, rb_node); in perf_env__purge_bpf()
174 node = rb_entry(next, struct btf_node, rb_node); in perf_env__purge_bpf()
Dsymbol.c192 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
195 next = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
224 curr = rb_entry(prevnd, struct symbol, rb_node); in symbols__fixup_end()
228 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_end()
323 pos = rb_entry(next, struct symbol, rb_node); in symbols__delete()
352 s = rb_entry(parent, struct symbol, rb_node); in __symbols__insert()
379 struct symbol *s = rb_entry(n, struct symbol, rb_node); in symbols__find()
397 return rb_entry(n, struct symbol, rb_node); in symbols__first()
407 return rb_entry(n, struct symbol, rb_node); in symbols__last()
417 return rb_entry(n, struct symbol, rb_node); in symbols__next()
[all …]
Dmem2node.c26 e = rb_entry(parent, struct phys_entry, rb_node); in phys_entry__insert()
126 entry = rb_entry(parent, struct phys_entry, rb_node); in mem2node__node()
Dblock-range.h43 return rb_entry(n, struct block_range, node); in block_range__next()
Dsrcline.c632 i = rb_entry(parent, struct srcline_node, rb_node); in srcline__tree_insert()
649 struct srcline_node *i = rb_entry(n, struct srcline_node, in srcline__tree_find()
669 pos = rb_entry(next, struct srcline_node, rb_node); in srcline__tree_delete()
716 i = rb_entry(parent, struct inline_node, rb_node); in inlines__tree_insert()
733 struct inline_node *i = rb_entry(n, struct inline_node, in inlines__tree_find()
753 pos = rb_entry(next, struct inline_node, rb_node); in inlines__tree_delete()
Dmap.c303 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start()
313 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end()
749 struct map *pos = rb_entry(next, struct map, rb_node); in maps__fixup_overlappings()
762 struct map *pos = rb_entry(next, struct map, rb_node); in maps__fixup_overlappings()
875 m = rb_entry(parent, struct map, rb_node); in __maps__insert()
896 m = rb_entry(p, struct map, rb_node); in maps__find()
916 return rb_entry(first, struct map, rb_node); in maps__first()
925 return rb_entry(next, struct map, rb_node); in __map__next()
Dsymbol_fprintf.c70 pos = rb_entry(nd, struct symbol_name_rb_node, rb_node); in dso__fprintf_symbols_by_name()
Dcallchain.c384 rnode = rb_entry(parent, struct callchain_node, rb_node); in rb_insert_callchain()
421 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat()
453 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs()
483 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel()
548 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child()
843 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child()
885 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children()
1263 child = rb_entry(n, struct callchain_node, rb_node_in); in callchain_node_branch_counts_cumul()
1679 node = rb_entry(rb_node, struct callchain_node, rb_node); in count_callchain_hits()
1693 struct hist_entry *he = rb_entry(next, struct hist_entry, in callchain_total_hits()
/tools/perf/ui/browsers/
Dmap.c27 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
121 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
Dhists.c71 rb_entry(nd, struct hist_entry, rb_node); in hist_browser__get_folding()
182 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__count_rows_rb_tree()
265 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows()
289 child = rb_entry(node, struct hist_entry, rb_node); in hierarchy_count_rows()
333 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__init_have_children_rb_tree()
373 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__init_have_children()
516 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__set_folding_rb_tree()
557 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__set_folding()
573 child = rb_entry(nd, struct hist_entry, rb_node); in hierarchy_set_folding()
610 he = rb_entry(nd, struct hist_entry, rb_node); in __hist_browser__set_folding()
[all …]
/tools/perf/
Dbuiltin-kmem.c94 data = rb_entry(*node, struct alloc_stat, node); in insert_alloc_stat()
139 data = rb_entry(*node, struct alloc_stat, node); in insert_caller_stat()
220 data = rb_entry(node, struct alloc_stat, node); in search_alloc_stat()
449 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_page()
499 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_alloc()
554 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_caller()
999 struct alloc_stat *data = rb_entry(next, struct alloc_stat, in __print_slab_result()
1072 data = rb_entry(next, struct page_stat, node); in __print_page_alloc_result()
1114 data = rb_entry(next, struct page_stat, node); in __print_page_caller_result()
1259 this = rb_entry(*new, struct alloc_stat, node); in sort_slab_insert()
[all …]
/tools/bpf/resolve_btfids/
Dmain.c155 id = rb_entry(p, struct btf_id, rb_node); in btf_id__find()
177 id = rb_entry(parent, struct btf_id, rb_node); in btf_id__add()
583 id = rb_entry(next, struct btf_id, rb_node); in __symbols_patch()
613 id = rb_entry(next, struct btf_id, rb_node); in sets_patch()
/tools/perf/ui/gtk/
Dhists.c109 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_flat()
173 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_folded()
233 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_graph()
359 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in perf_gtk__show_hists()
425 he = rb_entry(node, struct hist_entry, rb_node); in perf_gtk__add_hierarchy_entries()
/tools/perf/ui/stdio/
Dhist.c130 child = rb_entry(node, struct callchain_node, rb_node); in __callchain__fprintf_graph()
213 cnode = rb_entry(node, struct callchain_node, rb_node); in need_percent_display()
232 cnode = rb_entry(node, struct callchain_node, rb_node); in callchain__fprintf_graph()
314 chain = rb_entry(rb_node, struct callchain_node, rb_node); in callchain__fprintf_flat()
366 chain = rb_entry(rb_node, struct callchain_node, rb_node); in callchain__fprintf_folded()
854 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__fprintf()
/tools/objtool/
Delf.c99 struct symbol *sa = rb_entry(a, struct symbol, node); in symbol_to_offset()
100 struct symbol *sb = rb_entry(b, struct symbol, node); in symbol_to_offset()
119 const struct symbol *s = rb_entry(node, struct symbol, node); in symbol_by_offset()
169 struct symbol *s = rb_entry(node, struct symbol, node); in find_symbol_by_offset()
183 struct symbol *s = rb_entry(node, struct symbol, node); in find_func_by_offset()
197 struct symbol *s = rb_entry(node, struct symbol, node); in find_symbol_containing()
211 struct symbol *s = rb_entry(node, struct symbol, node); in find_func_containing()
360 entry = &rb_entry(pnode, struct symbol, node)->list; in elf_add_symbol()

12