Home
last modified time | relevance | path

Searched refs:rb_next (Results 1 – 25 of 48) sorted by relevance

12

/tools/perf/tests/
A Dhists_output.c185 node = rb_next(node); in test1()
191 node = rb_next(node); in test1()
197 node = rb_next(node); in test1()
203 node = rb_next(node); in test1()
209 node = rb_next(node); in test1()
215 node = rb_next(node); in test1()
221 node = rb_next(node); in test1()
227 node = rb_next(node); in test1()
284 node = rb_next(node); in test2()
339 node = rb_next(node); in test3()
[all …]
A Dhists_common.c191 node = rb_next(node); in print_hists_in()
221 node = rb_next(node); in print_hists_out()
A Dhists_link.c191 node = rb_next(node); in __validate_match()
248 node = rb_next(node); in __validate_link()
A Dsymbols.c125 for (nd = rb_first_cached(dso__symbols(dso)); nd; nd = rb_next(nd)) { in test_dso()
/tools/perf/util/
A Drblist.c116 next = rb_next(pos); in rblist__exit()
134 node = rb_next(node)) { in rblist__entry()
A Dblock-range.h40 struct rb_node *n = rb_next(&br->node); in block_range__next()
A Dstrlist.h68 rn = rb_next(&sn->rb_node); in strlist__next()
A Dintlist.h56 rn = rb_next(&in->rb_node); in intlist__next()
A Dhist.c275 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
435 node = rb_next(node); in hists__decay_entry()
478 next = rb_next(&n->rb_node); in hists__decay_entries()
494 next = rb_next(&n->rb_node); in hists__delete_entries()
511 next = rb_next(&n->rb_node); in hists__get_entry()
1921 node = rb_next(node); in hierarchy_recalc_total_periods()
1978 node = rb_next(node); in hists__hierarchy_output_resort()
2178 node = rb_next(node); in __rb_hierarchy_next()
2218 node = rb_next(node); in hist_entry__has_hierarchy_children()
2384 nd = rb_next(nd); in resort_filtered_entry()
[all …]
A Dcallchain.c429 n = rb_next(n); in __sort_chain_flat()
461 n = rb_next(n); in __sort_chain_graph_abs()
491 n = rb_next(n); in __sort_chain_graph_rel()
557 n = rb_next(n); in create_child()
1055 n = rb_next(n); in merge_chain_branch()
1298 n = rb_next(n); in callchain_node_branch_counts_cumul()
1506 n = rb_next(n); in free_callchain_node()
1533 n = rb_next(n); in decay_callchain_node()
1574 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_node__make_parent_list()
1762 rb_node = rb_next(rb_node); in count_callchain_hits()
[all …]
A Dsymbol.c222 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
239 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
257 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
356 next = rb_next(&pos->rb_node); in symbols__delete()
446 struct rb_node *n = rb_next(&sym->rb_node); in symbols__next()
468 for (nd = rb_first_cached(source); nd; nd = rb_next(nd)) in symbols__sort_by_name()
824 next = rb_next(&pos->rb_node); in maps__split_kallsyms_for_kcore()
883 next = rb_next(&pos->rb_node); in maps__split_kallsyms()
1063 next = rb_next(&mi->rb_node); in delete_modules()
1155 from_node = rb_next(from_node); in compare_proc_modules()
[all …]
A Dblock-range.c18 for (rb = rb_first(&block_ranges.root); rb; rb = rb_next(rb)) { in block_range__debug()
109 n = rb_next(n); in block_range__create()
A Dstream.c108 rb_node = rb_next(rb_node); in update_hot_callchain()
121 next = rb_next(&he->rb_node); in init_hot_callchain()
A Denv.c101 for (struct rb_node *node = first; node != NULL; node = rb_next(node)) in perf_env__iterate_bpf_prog_info()
188 next = rb_next(&node->rb_node); in perf_env__purge_bpf()
204 next = rb_next(&node->rb_node); in perf_env__purge_bpf()
A Dbuild-id.c368 nd = rb_next(nd)) { in perf_session__write_buildid_table()
916 nd = rb_next(nd)) { in machines__for_each_dso()
952 nd = rb_next(nd)) { in perf_session__read_build_ids()
A Dsymbol.h87 nd = rb_next(nd))
/tools/include/linux/
A Drbtree.h53 extern struct rb_node *rb_next(const struct rb_node *);
142 root->rb_leftmost = rb_next(node); in rb_erase_cached()
328 node = rb_next(node); in rb_next_match()
A Drbtree_augmented.h304 root->rb_leftmost = rb_next(node); in rb_erase_augmented_cached()
/tools/perf/ui/gtk/
A Dhists.c103 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat()
165 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded()
226 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
358 for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) { in perf_gtk__show_hists()
420 for (node = rb_first_cached(root); node; node = rb_next(node)) { in perf_gtk__add_hierarchy_entries()
/tools/perf/
A Dbuiltin-annotate.c448 nd = rb_next(nd); in hists__find_annotations()
486 next = rb_next(nd); in hists__find_annotations()
520 nd = rb_next(nd); in hists__find_annotations()
531 next = rb_next(nd); in hists__find_annotations()
545 nd = rb_next(nd); in hists__find_annotations()
/tools/perf/ui/browsers/
A Dmap.c122 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) { in map__browse()
A Dhists.c265 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__count_rows()
300 node = rb_next(node); in hierarchy_count_rows()
371 bool has_sibling = nd && rb_next(nd); in callchain__init_have_children()
373 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in callchain__init_have_children()
557 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__set_folding()
902 if (rb_next(node)) in check_percent_display()
926 struct rb_node *next = rb_next(node); in hist_browser__show_callchain_flat()
1030 struct rb_node *next = rb_next(node); in hist_browser__show_callchain_folded()
1119 struct rb_node *next = rb_next(node); in hist_browser__show_callchain_graph()
1922 if (rb_next(nd)) in hists__filter_entries()
[all …]
/tools/perf/ui/stdio/
A Dhist.c146 next = rb_next(node); in __callchain__fprintf_graph()
214 if (rb_next(node)) in need_percent_display()
328 rb_node = rb_next(rb_node); in callchain__fprintf_flat()
379 rb_node = rb_next(rb_node); in callchain__fprintf_folded()
/tools/bpf/resolve_btfids/
A Dmain.c667 next = rb_next(next); in __symbols_patch()
736 next = rb_next(next); in sets_patch()
/tools/perf/ui/
A Dbrowser.c159 nd = rb_next(nd); in ui_browser__rb_tree_seek()
183 nd = rb_next(nd); in ui_browser__rb_tree_refresh()

Completed in 51 milliseconds

12