59 	for (nd = rb_first(&hists->entries);  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()
237 	struct rb_node *nd = rb_first(&node->rb_root);  in callchain_node__init_have_children_rb_tree()
239 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__init_have_children_rb_tree()
276 	struct rb_node *nd = rb_first(root);  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()
401 	for (nd = rb_first(&hists->entries);  in __hist_browser__set_folding()
592 	node = rb_first(root);  in hist_browser__show_callchain()
917 		browser->top = rb_first(&hb->hists->entries);  in ui_browser__hists_init_top()
1005 		nd = hists__filter_entries(rb_first(browser->entries),  in ui_browser__hists_seek()
1178 	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),  in hist_browser__fprintf()
1728 	struct rb_node *nd = rb_first(&hb->hists->entries);  in hist_browser__update_nr_entries()