53 static struct rb_node *hists__filter_entries(struct rb_node *nd,
63 	struct rb_node *nd;  in hist_browser__get_folding()  local
67 	for (nd = rb_first_cached(&hists->entries);  in hist_browser__get_folding()
68 	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;  in hist_browser__get_folding()
69 	     nd = rb_hierarchy_next(nd)) {  in hist_browser__get_folding()
71 			rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__get_folding()
179 	struct rb_node *nd;  in callchain_node__count_rows_rb_tree()  local
181 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__count_rows_rb_tree()
182 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__count_rows_rb_tree()
261 	struct rb_node *nd;  in callchain__count_rows()  local
264 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__count_rows()
265 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__count_rows()
330 	struct rb_node *nd = rb_first(&node->rb_root);  in callchain_node__init_have_children_rb_tree()  local
332 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__init_have_children_rb_tree()
333 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__init_have_children_rb_tree()
369 	struct rb_node *nd = rb_first(root);  in callchain__init_have_children()  local
370 	bool has_sibling = nd && rb_next(nd);  in callchain__init_have_children()
372 	for (nd = rb_first(root); nd; nd = rb_next(nd)) {  in callchain__init_have_children()
373 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__init_have_children()
513 	struct rb_node *nd;  in callchain_node__set_folding_rb_tree()  local
515 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__set_folding_rb_tree()
516 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__set_folding_rb_tree()
553 	struct rb_node *nd;  in callchain__set_folding()  local
556 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__set_folding()
557 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__set_folding()
568 	struct rb_node *nd;  in hierarchy_set_folding()  local
572 	for (nd = rb_first_cached(&he->hroot_out); nd; nd = rb_next(nd)) {  in hierarchy_set_folding()
573 		child = rb_entry(nd, struct hist_entry, rb_node);  in hierarchy_set_folding()
604 	struct rb_node *nd;  in __hist_browser__set_folding()  local
608 	nd = rb_first_cached(&browser->hists->entries);  in __hist_browser__set_folding()
609 	while (nd) {  in __hist_browser__set_folding()
610 		he = rb_entry(nd, struct hist_entry, rb_node);  in __hist_browser__set_folding()
613 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);  in __hist_browser__set_folding()
798 	width = browser->b.width - (offset + 2);  in hist_browser__show_callchain_entry()
1147 			const int new_level = level + (extra_offset ? 2 : 1);  in hist_browser__show_callchain_graph()
1238 	return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%",	\
1263 			" %*.2f%%", __hpp__slsmg_color_printf, true);	\
1350 					width -= 2;  in hist_browser__show_entry()
1355 				width -= 2;  in hist_browser__show_entry()
1418 	int hierarchy_indent = (entry->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;  in hist_browser__show_hierarchy_entry()
1469 			width -= 2;  in hist_browser__show_hierarchy_entry()
1473 			width -= 2;  in hist_browser__show_hierarchy_entry()
1518 				ui_browser__write_nstring(&browser->b, "", 2);  in hist_browser__show_hierarchy_entry()
1521 			width -= 2;  in hist_browser__show_hierarchy_entry()
1576 	int indent = browser->hists->nr_hpp_node - 2;  in hist_browser__show_no_entry()
1609 			ret += 2;  in hist_browser__show_no_entry()
1622 		ret = snprintf(buf, sizeof(buf), "no entry >= %.2f%%", browser->min_pcnt);  in hist_browser__show_no_entry()
1624 		width -= ret + 2;  in hist_browser__show_no_entry()
1691 	int indent = hists->nr_hpp_node - 2;  in hists_browser__scnprintf_hierarchy_headers()
1816 	struct rb_node *nd;  in hist_browser__refresh()  local
1826 	for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {  in hist_browser__refresh()
1827 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__refresh()
1865 static struct rb_node *hists__filter_entries(struct rb_node *nd,  in hists__filter_entries()  argument
1868 	while (nd != NULL) {  in hists__filter_entries()
1869 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_entries()
1873 			return nd;  in hists__filter_entries()
1879 		if (rb_next(nd))  in hists__filter_entries()
1880 			nd = rb_next(nd);  in hists__filter_entries()
1882 			nd = rb_hierarchy_next(nd);  in hists__filter_entries()
1888 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,  in hists__filter_prev_entries()  argument
1891 	while (nd != NULL) {  in hists__filter_prev_entries()
1892 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_prev_entries()
1896 			return nd;  in hists__filter_prev_entries()
1898 		nd = rb_hierarchy_prev(nd);  in hists__filter_prev_entries()
1908 	struct rb_node *nd;  in ui_browser__hists_seek()  local
1921 		nd = hists__filter_entries(rb_first(browser->entries),  in ui_browser__hists_seek()
1925 		nd = browser->top;  in ui_browser__hists_seek()
1928 		nd = rb_hierarchy_last(rb_last(browser->entries));  in ui_browser__hists_seek()
1929 		nd = hists__filter_prev_entries(nd, hb->min_pcnt);  in ui_browser__hists_seek()
1944 	 * Here we have to check if nd is expanded (+), if it is we can't go  in ui_browser__hists_seek()
1957 	if (!nd)  in ui_browser__hists_seek()
1962 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1971 					browser->top = nd;  in ui_browser__hists_seek()
1975 			nd = hists__filter_entries(rb_hierarchy_next(nd),  in ui_browser__hists_seek()
1977 			if (nd == NULL)  in ui_browser__hists_seek()
1980 			browser->top = nd;  in ui_browser__hists_seek()
1984 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1993 						browser->top = nd;  in ui_browser__hists_seek()
2003 						browser->top = nd;  in ui_browser__hists_seek()
2009 			nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),  in ui_browser__hists_seek()
2011 			if (nd == NULL)  in ui_browser__hists_seek()
2014 			browser->top = nd;  in ui_browser__hists_seek()
2021 				h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
2029 		browser->top = nd;  in ui_browser__hists_seek()
2030 		h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
2106 	int hierarchy_indent = (he->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;  in hist_browser__fprintf_hierarchy_entry()
2151 	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),  in hist_browser__fprintf()  local
2155 	while (nd) {  in hist_browser__fprintf()
2156 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__fprintf()
2166 		nd = hists__filter_entries(rb_hierarchy_next(nd),  in hist_browser__fprintf()
2881 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);  in hist_browser__update_nr_entries()  local
2888 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_nr_entries()
2890 		nd = rb_hierarchy_next(nd);  in hist_browser__update_nr_entries()
2901 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);  in hist_browser__update_percent_limit()  local
2907 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_percent_limit()
2908 		he = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__update_percent_limit()
2931 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);  in hist_browser__update_percent_limit()
3054 			    evsel->core.nr_members < 2) {  in perf_evsel__hists_browse()
3079 				ui_browser__warning(&browser->b, delay_secs * 2,  in perf_evsel__hists_browse()
3113 					ui_browser__warning(&browser->b, delay_secs * 2,  in perf_evsel__hists_browse()
3156 					delay_secs * 2) == K_ENTER) {  in perf_evsel__hists_browse()
3195 					delay_secs * 2) == K_ENTER) {  in perf_evsel__hists_browse()
3200 					ui_browser__warning(&browser->b, delay_secs * 2,  in perf_evsel__hists_browse()
3201 						"Invalid percent: %.2f", new_percent);  in perf_evsel__hists_browse()
3603 	if (nr_entries == 2) {  in perf_evlist__single_entry()