52 	for (nd = rb_first(&hists->entries);  in hist_browser__get_folding()
166 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__count_rows_rb_tree()
249 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__count_rows()
270 	node = rb_first(&he->hroot_out);  in hierarchy_count_rows()
315 	struct rb_node *nd = rb_first(&node->rb_root);  in callchain_node__init_have_children_rb_tree()
317 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__init_have_children_rb_tree()
354 	struct rb_node *nd = rb_first(root);  in callchain__init_have_children()
357 	for (nd = rb_first(root); nd; nd = rb_next(nd)) {  in callchain__init_have_children()
454 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__set_folding_rb_tree()
495 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__set_folding()
511 	for (nd = rb_first(&he->hroot_out); nd; nd = rb_next(nd)) {  in hierarchy_set_folding()
569 	nd = rb_first(&browser->hists->entries);  in __hist_browser__set_folding()
853 	node = rb_first(root);  in hist_browser__show_callchain_flat()
957 	node = rb_first(root);  in hist_browser__show_callchain_folded()
1046 	node = rb_first(root);  in hist_browser__show_callchain_graph()
1741 		browser->top = rb_first(&hb->hists->entries);  in ui_browser__hists_init_top()
1849 		nd = hists__filter_entries(rb_first(browser->entries),  in ui_browser__hists_seek()
2078 	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),  in hist_browser__fprintf()
2641 	struct rb_node *nd = rb_first(&hb->hists->entries);  in hist_browser__update_nr_entries()
2661 	struct rb_node *nd = rb_first(&hb->hists->entries);  in hist_browser__update_percent_limit()