Lines Matching refs:rb_next
59 nd = rb_next(nd)) { in hist_browser__get_folding()
164 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
206 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__count_rows()
230 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree()
268 bool has_sibling = nd && rb_next(nd); in callchain__init_have_children()
270 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in callchain__init_have_children()
314 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree()
355 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__set_folding()
383 nd = rb_next(nd)) { in __hist_browser__set_folding()
574 need_percent = node && rb_next(node); in hist_browser__show_callchain()
578 struct rb_node *next = rb_next(node); in hist_browser__show_callchain()
912 for (nd = browser->top; nd; nd = rb_next(nd)) { in hist_browser__refresh()
941 nd = rb_next(nd); in hists__filter_entries()
1031 nd = hists__filter_entries(rb_next(nd), hb->min_pcnt); in ui_browser__hists_seek()
1158 nd = hists__filter_entries(rb_next(nd), browser->min_pcnt); in hist_browser__fprintf()
1410 nd = rb_next(nd); in hist_browser__update_nr_entries()