Lines Matching refs:rb_next
61 nd = rb_next(nd)) { in hist_browser__get_folding()
161 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
203 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__count_rows()
239 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__init_have_children_rb_tree()
277 bool has_sibling = nd && rb_next(nd); in callchain__init_have_children()
279 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in callchain__init_have_children()
334 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree()
375 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__set_folding()
403 nd = rb_next(nd)) { in __hist_browser__set_folding()
593 need_percent = node && rb_next(node); in hist_browser__show_callchain()
597 struct rb_node *next = rb_next(node); in hist_browser__show_callchain()
937 for (nd = browser->top; nd; nd = rb_next(nd)) { in hist_browser__refresh()
966 nd = rb_next(nd); in hists__filter_entries()
1059 nd = hists__filter_entries(rb_next(nd), hb->min_pcnt); in ui_browser__hists_seek()
1186 nd = hists__filter_entries(rb_next(nd), browser->min_pcnt); in hist_browser__fprintf()
1737 nd = rb_next(nd); in hist_browser__update_nr_entries()