50 static struct rb_node *hists__filter_entries(struct rb_node *nd,
60 	struct rb_node *nd;  in hist_browser__get_folding()  local
64 	for (nd = rb_first_cached(&hists->entries);  in hist_browser__get_folding()
65 	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;  in hist_browser__get_folding()
66 	     nd = rb_hierarchy_next(nd)) {  in hist_browser__get_folding()
68 			rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__get_folding()
176 	struct rb_node *nd;  in callchain_node__count_rows_rb_tree()  local
178 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__count_rows_rb_tree()
179 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__count_rows_rb_tree()
258 	struct rb_node *nd;  in callchain__count_rows()  local
261 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__count_rows()
262 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__count_rows()
327 	struct rb_node *nd = rb_first(&node->rb_root);  in callchain_node__init_have_children_rb_tree()  local
329 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__init_have_children_rb_tree()
330 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__init_have_children_rb_tree()
366 	struct rb_node *nd = rb_first(root);  in callchain__init_have_children()  local
367 	bool has_sibling = nd && rb_next(nd);  in callchain__init_have_children()
369 	for (nd = rb_first(root); nd; nd = rb_next(nd)) {  in callchain__init_have_children()
370 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__init_have_children()
464 	struct rb_node *nd;  in callchain_node__set_folding_rb_tree()  local
466 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__set_folding_rb_tree()
467 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__set_folding_rb_tree()
504 	struct rb_node *nd;  in callchain__set_folding()  local
507 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__set_folding()
508 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__set_folding()
519 	struct rb_node *nd;  in hierarchy_set_folding()  local
523 	for (nd = rb_first_cached(&he->hroot_out); nd; nd = rb_next(nd)) {  in hierarchy_set_folding()
524 		child = rb_entry(nd, struct hist_entry, rb_node);  in hierarchy_set_folding()
578 	struct rb_node *nd;  in __hist_browser__set_folding()  local
581 	nd = rb_first_cached(&browser->hists->entries);  in __hist_browser__set_folding()
582 	while (nd) {  in __hist_browser__set_folding()
583 		he = rb_entry(nd, struct hist_entry, rb_node);  in __hist_browser__set_folding()
586 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);  in __hist_browser__set_folding()
1766 	struct rb_node *nd;  in hist_browser__refresh()  local
1776 	for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {  in hist_browser__refresh()
1777 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__refresh()
1811 static struct rb_node *hists__filter_entries(struct rb_node *nd,  in hists__filter_entries()  argument
1814 	while (nd != NULL) {  in hists__filter_entries()
1815 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_entries()
1819 			return nd;  in hists__filter_entries()
1825 		if (rb_next(nd))  in hists__filter_entries()
1826 			nd = rb_next(nd);  in hists__filter_entries()
1828 			nd = rb_hierarchy_next(nd);  in hists__filter_entries()
1834 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,  in hists__filter_prev_entries()  argument
1837 	while (nd != NULL) {  in hists__filter_prev_entries()
1838 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_prev_entries()
1842 			return nd;  in hists__filter_prev_entries()
1844 		nd = rb_hierarchy_prev(nd);  in hists__filter_prev_entries()
1854 	struct rb_node *nd;  in ui_browser__hists_seek()  local
1867 		nd = hists__filter_entries(rb_first(browser->entries),  in ui_browser__hists_seek()
1871 		nd = browser->top;  in ui_browser__hists_seek()
1874 		nd = rb_hierarchy_last(rb_last(browser->entries));  in ui_browser__hists_seek()
1875 		nd = hists__filter_prev_entries(nd, hb->min_pcnt);  in ui_browser__hists_seek()
1903 	if (!nd)  in ui_browser__hists_seek()
1908 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1917 					browser->top = nd;  in ui_browser__hists_seek()
1921 			nd = hists__filter_entries(rb_hierarchy_next(nd),  in ui_browser__hists_seek()
1923 			if (nd == NULL)  in ui_browser__hists_seek()
1926 			browser->top = nd;  in ui_browser__hists_seek()
1930 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1939 						browser->top = nd;  in ui_browser__hists_seek()
1949 						browser->top = nd;  in ui_browser__hists_seek()
1955 			nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),  in ui_browser__hists_seek()
1957 			if (nd == NULL)  in ui_browser__hists_seek()
1960 			browser->top = nd;  in ui_browser__hists_seek()
1967 				h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1975 		browser->top = nd;  in ui_browser__hists_seek()
1976 		h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
2097 	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),  in hist_browser__fprintf()  local
2101 	while (nd) {  in hist_browser__fprintf()
2102 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__fprintf()
2112 		nd = hists__filter_entries(rb_hierarchy_next(nd),  in hist_browser__fprintf()
2770 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);  in hist_browser__update_nr_entries()  local
2777 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_nr_entries()
2779 		nd = rb_hierarchy_next(nd);  in hist_browser__update_nr_entries()
2790 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);  in hist_browser__update_percent_limit()  local
2796 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_percent_limit()
2797 		he = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__update_percent_limit()
2820 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);  in hist_browser__update_percent_limit()