54 static struct rb_node *hists__filter_entries(struct rb_node *nd,
64 	struct rb_node *nd;  in hist_browser__get_folding()  local
68 	for (nd = rb_first_cached(&hists->entries);  in hist_browser__get_folding()
69 	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;  in hist_browser__get_folding()
70 	     nd = rb_hierarchy_next(nd)) {  in hist_browser__get_folding()
72 			rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__get_folding()
180 	struct rb_node *nd;  in callchain_node__count_rows_rb_tree()  local
182 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__count_rows_rb_tree()
183 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__count_rows_rb_tree()
262 	struct rb_node *nd;  in callchain__count_rows()  local
265 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__count_rows()
266 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__count_rows()
331 	struct rb_node *nd = rb_first(&node->rb_root);  in callchain_node__init_have_children_rb_tree()  local
333 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__init_have_children_rb_tree()
334 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__init_have_children_rb_tree()
370 	struct rb_node *nd = rb_first(root);  in callchain__init_have_children()  local
371 	bool has_sibling = nd && rb_next(nd);  in callchain__init_have_children()
373 	for (nd = rb_first(root); nd; nd = rb_next(nd)) {  in callchain__init_have_children()
374 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__init_have_children()
514 	struct rb_node *nd;  in callchain_node__set_folding_rb_tree()  local
516 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__set_folding_rb_tree()
517 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__set_folding_rb_tree()
554 	struct rb_node *nd;  in callchain__set_folding()  local
557 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__set_folding()
558 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__set_folding()
569 	struct rb_node *nd;  in hierarchy_set_folding()  local
573 	for (nd = rb_first_cached(&he->hroot_out); nd; nd = rb_next(nd)) {  in hierarchy_set_folding()
574 		child = rb_entry(nd, struct hist_entry, rb_node);  in hierarchy_set_folding()
605 	struct rb_node *nd;  in __hist_browser__set_folding()  local
609 	nd = rb_first_cached(&browser->hists->entries);  in __hist_browser__set_folding()
610 	while (nd) {  in __hist_browser__set_folding()
611 		he = rb_entry(nd, struct hist_entry, rb_node);  in __hist_browser__set_folding()
614 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);  in __hist_browser__set_folding()
800 	width = browser->b.width - (offset + 2);  in hist_browser__show_callchain_entry()
1149 			const int new_level = level + (extra_offset ? 2 : 1);  in hist_browser__show_callchain_graph()
1240 	return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%",	\
1265 			" %*.2f%%", __hpp__slsmg_color_printf, true);	\
1352 					width -= 2;  in hist_browser__show_entry()
1357 				width -= 2;  in hist_browser__show_entry()
1420 	int hierarchy_indent = (entry->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;  in hist_browser__show_hierarchy_entry()
1471 			width -= 2;  in hist_browser__show_hierarchy_entry()
1475 			width -= 2;  in hist_browser__show_hierarchy_entry()
1520 				ui_browser__write_nstring(&browser->b, "", 2);  in hist_browser__show_hierarchy_entry()
1523 			width -= 2;  in hist_browser__show_hierarchy_entry()
1578 	int indent = browser->hists->nr_hpp_node - 2;  in hist_browser__show_no_entry()
1611 			ret += 2;  in hist_browser__show_no_entry()
1624 		ret = snprintf(buf, sizeof(buf), "no entry >= %.2f%%", browser->min_pcnt);  in hist_browser__show_no_entry()
1626 		width -= ret + 2;  in hist_browser__show_no_entry()
1693 	int indent = hists->nr_hpp_node - 2;  in hists_browser__scnprintf_hierarchy_headers()
1818 	struct rb_node *nd;  in hist_browser__refresh()  local
1828 	for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {  in hist_browser__refresh()
1829 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__refresh()
1867 static struct rb_node *hists__filter_entries(struct rb_node *nd,  in hists__filter_entries()  argument
1870 	while (nd != NULL) {  in hists__filter_entries()
1871 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_entries()
1875 			return nd;  in hists__filter_entries()
1881 		if (rb_next(nd))  in hists__filter_entries()
1882 			nd = rb_next(nd);  in hists__filter_entries()
1884 			nd = rb_hierarchy_next(nd);  in hists__filter_entries()
1890 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,  in hists__filter_prev_entries()  argument
1893 	while (nd != NULL) {  in hists__filter_prev_entries()
1894 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_prev_entries()
1898 			return nd;  in hists__filter_prev_entries()
1900 		nd = rb_hierarchy_prev(nd);  in hists__filter_prev_entries()
1910 	struct rb_node *nd;  in ui_browser__hists_seek()  local
1923 		nd = hists__filter_entries(rb_first(browser->entries),  in ui_browser__hists_seek()
1927 		nd = browser->top;  in ui_browser__hists_seek()
1930 		nd = rb_hierarchy_last(rb_last(browser->entries));  in ui_browser__hists_seek()
1931 		nd = hists__filter_prev_entries(nd, hb->min_pcnt);  in ui_browser__hists_seek()
1946 	 * Here we have to check if nd is expanded (+), if it is we can't go  in ui_browser__hists_seek()
1959 	if (!nd)  in ui_browser__hists_seek()
1964 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1973 					browser->top = nd;  in ui_browser__hists_seek()
1977 			nd = hists__filter_entries(rb_hierarchy_next(nd),  in ui_browser__hists_seek()
1979 			if (nd == NULL)  in ui_browser__hists_seek()
1982 			browser->top = nd;  in ui_browser__hists_seek()
1986 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1995 						browser->top = nd;  in ui_browser__hists_seek()
2005 						browser->top = nd;  in ui_browser__hists_seek()
2011 			nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),  in ui_browser__hists_seek()
2013 			if (nd == NULL)  in ui_browser__hists_seek()
2016 			browser->top = nd;  in ui_browser__hists_seek()
2023 				h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
2031 		browser->top = nd;  in ui_browser__hists_seek()
2032 		h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
2108 	int hierarchy_indent = (he->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;  in hist_browser__fprintf_hierarchy_entry()
2153 	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),  in hist_browser__fprintf()  local
2157 	while (nd) {  in hist_browser__fprintf()
2158 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__fprintf()
2168 		nd = hists__filter_entries(rb_hierarchy_next(nd),  in hist_browser__fprintf()
2910 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);  in hist_browser__update_nr_entries()  local
2917 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_nr_entries()
2919 		nd = rb_hierarchy_next(nd);  in hist_browser__update_nr_entries()
2930 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);  in hist_browser__update_percent_limit()  local
2936 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_percent_limit()
2937 		he = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__update_percent_limit()
2960 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);  in hist_browser__update_percent_limit()
3079 			    evsel->core.nr_members < 2) {  in evsel__hists_browse()
3104 				ui_browser__warning(&browser->b, delay_secs * 2,  in evsel__hists_browse()
3138 					ui_browser__warning(&browser->b, delay_secs * 2,  in evsel__hists_browse()
3182 					delay_secs * 2) == K_ENTER) {  in evsel__hists_browse()
3221 					delay_secs * 2) == K_ENTER) {  in evsel__hists_browse()
3226 					ui_browser__warning(&browser->b, delay_secs * 2,  in evsel__hists_browse()
3227 						"Invalid percent: %.2f", new_percent);  in evsel__hists_browse()
3624 	if (nr_entries == 2) {  in evlist__single_entry()