43 static struct rb_node *hists__filter_entries(struct rb_node *nd,
53 	struct rb_node *nd;  in hist_browser__get_folding()  local
57 	for (nd = rb_first(&hists->entries);  in hist_browser__get_folding()
58 	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;  in hist_browser__get_folding()
59 	     nd = rb_next(nd)) {  in hist_browser__get_folding()
61 			rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__get_folding()
162 	struct rb_node *nd;  in callchain_node__count_rows_rb_tree()  local
164 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__count_rows_rb_tree()
165 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__count_rows_rb_tree()
203 	struct rb_node *nd;  in callchain__count_rows()  local
206 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__count_rows()
207 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__count_rows()
228 	struct rb_node *nd = rb_first(&node->rb_root);  in callchain_node__init_have_children_rb_tree()  local
230 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__init_have_children_rb_tree()
231 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__init_have_children_rb_tree()
267 	struct rb_node *nd = rb_first(root);  in callchain__init_have_children()  local
268 	bool has_sibling = nd && rb_next(nd);  in callchain__init_have_children()
270 	for (nd = rb_first(root); nd; nd = rb_next(nd)) {  in callchain__init_have_children()
271 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__init_have_children()
312 	struct rb_node *nd;  in callchain_node__set_folding_rb_tree()  local
314 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {  in callchain_node__set_folding_rb_tree()
315 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);  in callchain_node__set_folding_rb_tree()
352 	struct rb_node *nd;  in callchain__set_folding()  local
355 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {  in callchain__set_folding()
356 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);  in callchain__set_folding()
378 	struct rb_node *nd;  in __hist_browser__set_folding()  local
381 	for (nd = rb_first(&hists->entries);  in __hist_browser__set_folding()
382 	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;  in __hist_browser__set_folding()
383 	     nd = rb_next(nd)) {  in __hist_browser__set_folding()
384 		struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);  in __hist_browser__set_folding()
902 	struct rb_node *nd;  in hist_browser__refresh()  local
912 	for (nd = browser->top; nd; nd = rb_next(nd)) {  in hist_browser__refresh()
913 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__refresh()
931 static struct rb_node *hists__filter_entries(struct rb_node *nd,  in hists__filter_entries()  argument
934 	while (nd != NULL) {  in hists__filter_entries()
935 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_entries()
939 			return nd;  in hists__filter_entries()
941 		nd = rb_next(nd);  in hists__filter_entries()
947 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,  in hists__filter_prev_entries()  argument
950 	while (nd != NULL) {  in hists__filter_prev_entries()
951 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_prev_entries()
955 			return nd;  in hists__filter_prev_entries()
957 		nd = rb_prev(nd);  in hists__filter_prev_entries()
967 	struct rb_node *nd;  in ui_browser__hists_seek()  local
980 		nd = hists__filter_entries(rb_first(browser->entries),  in ui_browser__hists_seek()
984 		nd = browser->top;  in ui_browser__hists_seek()
987 		nd = hists__filter_prev_entries(rb_last(browser->entries),  in ui_browser__hists_seek()
1018 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1027 					browser->top = nd;  in ui_browser__hists_seek()
1031 			nd = hists__filter_entries(rb_next(nd), hb->min_pcnt);  in ui_browser__hists_seek()
1032 			if (nd == NULL)  in ui_browser__hists_seek()
1035 			browser->top = nd;  in ui_browser__hists_seek()
1039 			h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1048 						browser->top = nd;  in ui_browser__hists_seek()
1058 						browser->top = nd;  in ui_browser__hists_seek()
1064 			nd = hists__filter_prev_entries(rb_prev(nd),  in ui_browser__hists_seek()
1066 			if (nd == NULL)  in ui_browser__hists_seek()
1069 			browser->top = nd;  in ui_browser__hists_seek()
1076 				h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1084 		browser->top = nd;  in ui_browser__hists_seek()
1085 		h = rb_entry(nd, struct hist_entry, rb_node);  in ui_browser__hists_seek()
1150 	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),  in hist_browser__fprintf()  local
1154 	while (nd) {  in hist_browser__fprintf()
1155 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hist_browser__fprintf()
1158 		nd = hists__filter_entries(rb_next(nd), browser->min_pcnt);  in hist_browser__fprintf()
1401 	struct rb_node *nd = rb_first(&hb->hists->entries);  in hist_browser__update_nr_entries()  local
1408 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {  in hist_browser__update_nr_entries()
1410 		nd = rb_next(nd);  in hist_browser__update_nr_entries()