28 static struct rb_node *hists__filter_entries(struct rb_node *nd,
38 	struct rb_node *nd;  in hist_browser__get_folding()  local
42 	for (nd = rb_first(&hists->entries);  in hist_browser__get_folding()
43 	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;  in hist_browser__get_folding()
44 	     nd = rb_hierarchy_next(nd)) {  in hist_browser__get_folding()
46 			rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__get_folding()
150 	struct rb_node *nd;  in callchain_node__count_rows_rb_tree()  local
152 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__count_rows_rb_tree()
153 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__count_rows_rb_tree()
230 	struct rb_node *nd;  in callchain__count_rows()  local
233 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__count_rows()
234 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__count_rows()
299 	struct rb_node *nd = rb_first(&node->rb_root);  in callchain_node__init_have_children_rb_tree()  local
301 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__init_have_children_rb_tree()
302 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__init_have_children_rb_tree()
338 	struct rb_node *nd = rb_first(root);  in callchain__init_have_children()  local
339 	bool has_sibling = nd && rb_next(nd);  in callchain__init_have_children()
341 	for (nd = rb_first(root); nd; nd = rb_next(nd)) {  in callchain__init_have_children()
342 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__init_have_children()
435 	struct rb_node *nd;  in callchain_node__set_folding_rb_tree()  local
437 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__set_folding_rb_tree()
438 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__set_folding_rb_tree()
475 	struct rb_node *nd;  in callchain__set_folding()  local
478 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__set_folding()
479 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__set_folding()
490 	struct rb_node *nd;  in hierarchy_set_folding()  local
494 	for (nd = rb_first(&he->hroot_out); nd; nd = rb_next(nd)) {  in hierarchy_set_folding()
495 		child = rb_entry(nd, struct hist_entry, rb_node);  in hierarchy_set_folding()
526 	struct rb_node *nd;  in __hist_browser__set_folding()  local
530 	nd = rb_first(&browser->hists->entries);  in __hist_browser__set_folding()
531 	while (nd) {  in __hist_browser__set_folding()
532 		he = rb_entry(nd, struct hist_entry, rb_node);  in __hist_browser__set_folding()
535 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);  in __hist_browser__set_folding()
1689 	struct rb_node *nd;  in hist_browser__refresh()  local
1704 	for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {  in hist_browser__refresh()
1705 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__refresh()
1739 static struct rb_node *hists__filter_entries(struct rb_node *nd,  in hists__filter_entries()  argument
1742 	while (nd != NULL) {  in hists__filter_entries()
1743 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_entries()
1747 			return nd;  in hists__filter_entries()
1753 		if (rb_next(nd))  in hists__filter_entries()
1754 			nd = rb_next(nd);  in hists__filter_entries()
1756 			nd = rb_hierarchy_next(nd);  in hists__filter_entries()
1762 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,  in hists__filter_prev_entries()  argument
1765 	while (nd != NULL) {  in hists__filter_prev_entries()
1766 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_prev_entries()
1770 			return nd;  in hists__filter_prev_entries()
1772 		nd = rb_hierarchy_prev(nd);  in hists__filter_prev_entries()
1782 	struct rb_node *nd;  in ui_browser__hists_seek()  local
1795 		nd = hists__filter_entries(rb_first(browser->entries),  in ui_browser__hists_seek()
1799 		nd = browser->top;  in ui_browser__hists_seek()
1802 		nd = rb_hierarchy_last(rb_last(browser->entries));  in ui_browser__hists_seek()
1803 		nd = hists__filter_prev_entries(nd, hb->min_pcnt);  in ui_browser__hists_seek()
1831 	if (!nd)  in ui_browser__hists_seek()
1836 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1845 					browser->top = nd;  in ui_browser__hists_seek()
1849 			nd = hists__filter_entries(rb_hierarchy_next(nd),  in ui_browser__hists_seek()
1851 			if (nd == NULL)  in ui_browser__hists_seek()
1854 			browser->top = nd;  in ui_browser__hists_seek()
1858 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1867 						browser->top = nd;  in ui_browser__hists_seek()
1877 						browser->top = nd;  in ui_browser__hists_seek()
1883 			nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),  in ui_browser__hists_seek()
1885 			if (nd == NULL)  in ui_browser__hists_seek()
1888 			browser->top = nd;  in ui_browser__hists_seek()
1895 				h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1903 		browser->top = nd;  in ui_browser__hists_seek()
1904 		h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
2024 	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),  in hist_browser__fprintf()  local
2028 	while (nd) {  in hist_browser__fprintf()
2029 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__fprintf()
2039 		nd = hists__filter_entries(rb_hierarchy_next(nd),  in hist_browser__fprintf()
2650 	struct rb_node *nd = rb_first(&hb->hists->entries);  in hist_browser__update_nr_entries()  local
2657 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_nr_entries()
2659 		nd = rb_hierarchy_next(nd);  in hist_browser__update_nr_entries()
2670 	struct rb_node *nd = rb_first(&hb->hists->entries);  in hist_browser__update_percent_limit()  local
2676 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_percent_limit()
2677 		he = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__update_percent_limit()
2700 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);  in hist_browser__update_percent_limit()