ui/browsers/hists.c

53 static struct rb_node *hists__filter_entries(struct rb_node *nd,
63 	struct rb_node *nd;
67 	for (nd = rb_first_cached(&hists->entries);
68 	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
69 	     nd = rb_hierarchy_next(nd)) {
71 			rb_entry(nd, struct hist_entry, rb_node);
179 	struct rb_node *nd;
181 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
182 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
261 	struct rb_node *nd;
264 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
265 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
330 	struct rb_node *nd = rb_first(&node->rb_root);
332 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
333 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
369 	struct rb_node *nd = rb_first(root);
370 	bool has_sibling = nd && rb_next(nd);
372 	for (nd = rb_first(root); nd; nd = rb_next(nd)) {
373 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
513 	struct rb_node *nd;
515 	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
516 		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
553 	struct rb_node *nd;
556 	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
557 		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
568 	struct rb_node *nd;
572 	for (nd = rb_first_cached(&he->hroot_out); nd; nd = rb_next(nd)) {
573 		child = rb_entry(nd, struct hist_entry, rb_node);
604 	struct rb_node *nd;
608 	nd = rb_first_cached(&browser->hists->entries);
609 	while (nd) {
610 		he = rb_entry(nd, struct hist_entry, rb_node);
613 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
1817 	struct rb_node *nd;
1827 	for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {
1828 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1866 static struct rb_node *hists__filter_entries(struct rb_node *nd,
1869 	while (nd != NULL) {
1870 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1874 			return nd;
1880 		if (rb_next(nd))
1881 			nd = rb_next(nd);
1883 			nd = rb_hierarchy_next(nd);
1889 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
1892 	while (nd != NULL) {
1893 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1897 			return nd;
1899 		nd = rb_hierarchy_prev(nd);
1909 	struct rb_node *nd;
1922 		nd = hists__filter_entries(rb_first(browser->entries),
1926 		nd = browser->top;
1929 		nd = rb_hierarchy_last(rb_last(browser->entries));
1930 		nd = hists__filter_prev_entries(nd, hb->min_pcnt);
1945 	 * Here we have to check if nd is expanded (+), if it is we can't go
1958 	if (!nd)
1963 			h = rb_entry(nd, struct hist_entry, rb_node);
1972 					browser->top = nd;
1976 			nd = hists__filter_entries(rb_hierarchy_next(nd),
1978 			if (nd == NULL)
1981 			browser->top = nd;
1985 			h = rb_entry(nd, struct hist_entry, rb_node);
1994 						browser->top = nd;
2004 						browser->top = nd;
2010 			nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),
2012 			if (nd == NULL)
2015 			browser->top = nd;
2022 				h = rb_entry(nd, struct hist_entry, rb_node);
2030 		browser->top = nd;
2031 		h = rb_entry(nd, struct hist_entry, rb_node);
2152 	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
2156 	while (nd) {
2157 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2167 		nd = hists__filter_entries(rb_hierarchy_next(nd),
2883 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);
2890 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2892 		nd = rb_hierarchy_next(nd);
2903 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);
2909 	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2910 		he = rb_entry(nd, struct hist_entry, rb_node);
2933 		nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);