Home
last modified time | relevance | path

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

12

/tools/perf/tests/
A Dhists_output.c112 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
180 he = rb_entry(node, struct hist_entry, rb_node); in test1()
186 he = rb_entry(node, struct hist_entry, rb_node); in test1()
192 he = rb_entry(node, struct hist_entry, rb_node); in test1()
198 he = rb_entry(node, struct hist_entry, rb_node); in test1()
204 he = rb_entry(node, struct hist_entry, rb_node); in test1()
210 he = rb_entry(node, struct hist_entry, rb_node); in test1()
216 he = rb_entry(node, struct hist_entry, rb_node); in test1()
222 he = rb_entry(node, struct hist_entry, rb_node); in test1()
228 he = rb_entry(node, struct hist_entry, rb_node); in test1()
[all …]
A Dhists_common.c179 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
208 he = rb_entry(node, struct hist_entry, rb_node); in print_hists_out()
A Dhists_cumulate.c147 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
217 node && (he = rb_entry(node, struct hist_entry, rb_node)); in do_test()
238 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
/tools/include/linux/
A Dinterval_tree_generic.h48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
108 node = rb_entry(node->ITRB.rb_right, \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
165 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
177 node = rb_entry(rb, ITSTRUCT, ITRB); \
A 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); \
A Drbtree.h37 #define rb_entry(ptr, type, member) container_of(ptr, type, member) macro
77 ____ptr ? rb_entry(____ptr, type, member) : NULL; \
/tools/testing/selftests/bpf/progs/
A Drbtree_search.c24 #define rb_entry(ptr, type, member) container_of(ptr, type, member) macro
34 node_a = rb_entry(a, struct node_data, r0); in less0()
35 node_b = rb_entry(b, struct node_data, r0); in less0()
45 node_a = rb_entry(a, struct node_data, r1); in less1()
46 node_b = rb_entry(b, struct node_data, r1); in less1()
88 n = rb_entry(rb_n, struct node_data, r0); in rbtree_search()
115 n = rb_entry(rb_n, struct node_data, r0); in rbtree_search()
129 bpf_obj_drop(rb_entry(rb_m, struct node_data, r1)); in rbtree_search()
168 n = rb_entry(rb_n, struct node_data, r0); \
/tools/perf/util/
A 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()
A 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()
A Dblock-range.c19 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug()
37 entry = rb_entry(parent, struct block_range, node); in block_range__find()
86 entry = rb_entry(parent, struct block_range, node); in block_range__create()
113 next = rb_entry(n, struct block_range, node); in block_range__create()
A Dhist.c272 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
434 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
477 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
493 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
507 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
1847 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1920 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
2101 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
2166 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2215 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
[all …]
A Dmem2node.c26 e = rb_entry(parent, struct phys_entry, rb_node); in phys_entry__insert()
127 entry = rb_entry(parent, struct phys_entry, rb_node); in mem2node__node()
A Dblock-range.h43 return rb_entry(n, struct block_range, node); in block_range__next()
A Denv.c50 node = rb_entry(parent, struct bpf_prog_info_node, rb_node); in __perf_env__insert_bpf_prog_info()
77 node = rb_entry(n, struct bpf_prog_info_node, rb_node); in perf_env__find_bpf_prog_info()
102 (*cb)(rb_entry(node, struct bpf_prog_info_node, rb_node), data); in perf_env__iterate_bpf_prog_info()
127 node = rb_entry(parent, struct btf_node, rb_node); in __perf_env__insert_btf()
162 node = rb_entry(n, struct btf_node, rb_node); in __perf_env__find_btf()
187 node = rb_entry(next, struct bpf_prog_info_node, rb_node); in perf_env__purge_bpf()
203 node = rb_entry(next, struct btf_node, rb_node); in perf_env__purge_bpf()
A Dsymbol.c220 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
226 next = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
255 curr = rb_entry(prevnd, struct symbol, rb_node); in symbols__fixup_end()
259 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_end()
355 pos = rb_entry(next, struct symbol, rb_node); in symbols__delete()
384 s = rb_entry(parent, struct symbol, rb_node); in __symbols__insert()
429 return rb_entry(n, struct symbol, rb_node); in symbols__first()
439 return rb_entry(n, struct symbol, rb_node); in symbols__last()
449 return rb_entry(n, struct symbol, rb_node); in symbols__next()
823 pos = rb_entry(next, struct symbol, rb_node); in maps__split_kallsyms_for_kcore()
[all …]
A Dsrcline.c995 i = rb_entry(parent, struct srcline_node, rb_node); in srcline__tree_insert()
1012 struct srcline_node *i = rb_entry(n, struct srcline_node, in srcline__tree_find()
1032 pos = rb_entry(next, struct srcline_node, rb_node); in srcline__tree_delete()
1079 i = rb_entry(parent, struct inline_node, rb_node); in inlines__tree_insert()
1096 struct inline_node *i = rb_entry(n, struct inline_node, in inlines__tree_find()
1116 pos = rb_entry(next, struct inline_node, rb_node); in inlines__tree_delete()
A Dannotate-data.c200 type = rb_entry(node, struct annotated_data_type, node); in data_type_cmp()
211 a = rb_entry(node_a, struct annotated_data_type, node); in data_type_less()
212 b = rb_entry(node_b, struct annotated_data_type, node); in data_type_less()
376 result = rb_entry(node, struct annotated_data_type, node); in dso__findnew_data_type()
635 gvar = rb_entry(node, struct global_var_entry, node); in global_var_cmp()
646 gvar_a = rb_entry(node_a, struct global_var_entry, node); in global_var_less()
647 gvar_b = rb_entry(node_b, struct global_var_entry, node); in global_var_less()
661 return rb_entry(node, struct global_var_entry, node); in global_var__find()
700 gvar = rb_entry(node, struct global_var_entry, node); in global_var_type__tree_delete()
1709 pos = rb_entry(node, struct annotated_data_type, node); in annotated_data_type__tree_delete()
A Dcallchain.c391 rnode = rb_entry(parent, struct callchain_node, rb_node); in rb_insert_callchain()
428 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat()
460 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs()
490 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel()
555 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child()
867 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child()
909 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children()
1297 child = rb_entry(n, struct callchain_node, rb_node_in); in callchain_node_branch_counts_cumul()
1760 node = rb_entry(rb_node, struct callchain_node, rb_node); in count_callchain_hits()
1774 struct hist_entry *he = rb_entry(next, struct hist_entry, in callchain_total_hits()
A Dcall-path.c95 cp = rb_entry(node_parent, struct call_path, rb_node); in call_path__findnew()
/tools/perf/ui/browsers/
A Dmap.c27 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
123 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
A Dhists.c72 rb_entry(nd, struct hist_entry, rb_node); in hist_browser__get_folding()
290 child = rb_entry(node, struct hist_entry, rb_node); in hierarchy_count_rows()
574 child = rb_entry(nd, struct hist_entry, rb_node); in hierarchy_set_folding()
611 he = rb_entry(nd, struct hist_entry, rb_node); in __hist_browser__set_folding()
905 child = rb_entry(node, struct callchain_node, rb_node); in check_percent_display()
1983 h = rb_entry(browser->top, struct hist_entry, rb_node); in ui_browser__hists_seek()
2005 h = rb_entry(nd, struct hist_entry, rb_node); in ui_browser__hists_seek()
2027 h = rb_entry(nd, struct hist_entry, rb_node); in ui_browser__hists_seek()
2064 h = rb_entry(nd, struct hist_entry, rb_node); in ui_browser__hists_seek()
2073 h = rb_entry(nd, struct hist_entry, rb_node); in ui_browser__hists_seek()
[all …]
/tools/perf/
A Dbuiltin-kmem.c96 data = rb_entry(*node, struct alloc_stat, node); in insert_alloc_stat()
141 data = rb_entry(*node, struct alloc_stat, node); in insert_caller_stat()
233 data = rb_entry(node, struct alloc_stat, node); in search_alloc_stat()
472 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_page()
522 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_alloc()
577 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_caller()
1087 data = rb_entry(next, struct page_stat, node); in __print_page_alloc_result()
1129 data = rb_entry(next, struct page_stat, node); in __print_page_caller_result()
1274 this = rb_entry(*new, struct alloc_stat, node); in sort_slab_insert()
1321 this = rb_entry(*new, struct page_stat, node); in sort_page_insert()
[all …]
/tools/perf/ui/stdio/
A Dhist.c134 child = rb_entry(node, struct callchain_node, rb_node); in __callchain__fprintf_graph()
217 cnode = rb_entry(node, struct callchain_node, rb_node); in need_percent_display()
236 cnode = rb_entry(node, struct callchain_node, rb_node); in callchain__fprintf_graph()
318 chain = rb_entry(rb_node, struct callchain_node, rb_node); in callchain__fprintf_flat()
370 chain = rb_entry(rb_node, struct callchain_node, rb_node); in callchain__fprintf_folded()
871 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__fprintf()
/tools/perf/ui/gtk/
A 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/bpf/resolve_btfids/
A Dmain.c185 id = rb_entry(p, struct btf_id, rb_node); in btf_id__find()
207 id = rb_entry(parent, struct btf_id, rb_node); in btf_id__add()
662 id = rb_entry(next, struct btf_id, rb_node); in __symbols_patch()
691 id = rb_entry(next, struct btf_id, rb_node); in sets_patch()

Completed in 708 milliseconds

12