Lines Matching refs:nd
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()
518 struct rb_node *nd; in callchain_node__set_folding_rb_tree() local
520 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__set_folding_rb_tree()
521 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__set_folding_rb_tree()
558 struct rb_node *nd; in callchain__set_folding() local
561 for (nd = rb_first(chain); nd; nd = rb_next(nd)) { in callchain__set_folding()
562 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__set_folding()
573 struct rb_node *nd; in hierarchy_set_folding() local
577 for (nd = rb_first_cached(&he->hroot_out); nd; nd = rb_next(nd)) { in hierarchy_set_folding()
578 child = rb_entry(nd, struct hist_entry, rb_node); in hierarchy_set_folding()
632 struct rb_node *nd; in __hist_browser__set_folding() local
635 nd = rb_first_cached(&browser->hists->entries); in __hist_browser__set_folding()
636 while (nd) { in __hist_browser__set_folding()
637 he = rb_entry(nd, struct hist_entry, rb_node); in __hist_browser__set_folding()
640 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD); in __hist_browser__set_folding()
1827 struct rb_node *nd; in hist_browser__refresh() local
1837 for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) { in hist_browser__refresh()
1838 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hist_browser__refresh()
1876 static struct rb_node *hists__filter_entries(struct rb_node *nd, in hists__filter_entries() argument
1879 while (nd != NULL) { in hists__filter_entries()
1880 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_entries()
1884 return nd; in hists__filter_entries()
1890 if (rb_next(nd)) in hists__filter_entries()
1891 nd = rb_next(nd); in hists__filter_entries()
1893 nd = rb_hierarchy_next(nd); in hists__filter_entries()
1899 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd, in hists__filter_prev_entries() argument
1902 while (nd != NULL) { in hists__filter_prev_entries()
1903 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_prev_entries()
1907 return nd; in hists__filter_prev_entries()
1909 nd = rb_hierarchy_prev(nd); in hists__filter_prev_entries()
1919 struct rb_node *nd; in ui_browser__hists_seek() local
1932 nd = hists__filter_entries(rb_first(browser->entries), in ui_browser__hists_seek()
1936 nd = browser->top; in ui_browser__hists_seek()
1939 nd = rb_hierarchy_last(rb_last(browser->entries)); in ui_browser__hists_seek()
1940 nd = hists__filter_prev_entries(nd, hb->min_pcnt); in ui_browser__hists_seek()
1968 if (!nd) in ui_browser__hists_seek()
1973 h = rb_entry(nd, struct hist_entry, rb_node); in ui_browser__hists_seek()
1982 browser->top = nd; in ui_browser__hists_seek()
1986 nd = hists__filter_entries(rb_hierarchy_next(nd), in ui_browser__hists_seek()
1988 if (nd == NULL) in ui_browser__hists_seek()
1991 browser->top = nd; in ui_browser__hists_seek()
1995 h = rb_entry(nd, struct hist_entry, rb_node); in ui_browser__hists_seek()
2004 browser->top = nd; in ui_browser__hists_seek()
2014 browser->top = nd; in ui_browser__hists_seek()
2020 nd = hists__filter_prev_entries(rb_hierarchy_prev(nd), in ui_browser__hists_seek()
2022 if (nd == NULL) in ui_browser__hists_seek()
2025 browser->top = nd; in ui_browser__hists_seek()
2032 h = rb_entry(nd, struct hist_entry, rb_node); in ui_browser__hists_seek()
2040 browser->top = nd; in ui_browser__hists_seek()
2041 h = rb_entry(nd, struct hist_entry, rb_node); in ui_browser__hists_seek()
2162 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries), in hist_browser__fprintf() local
2166 while (nd) { in hist_browser__fprintf()
2167 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hist_browser__fprintf()
2177 nd = hists__filter_entries(rb_hierarchy_next(nd), in hist_browser__fprintf()
2892 struct rb_node *nd = rb_first_cached(&hb->hists->entries); in hist_browser__update_nr_entries() local
2899 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) { in hist_browser__update_nr_entries()
2901 nd = rb_hierarchy_next(nd); in hist_browser__update_nr_entries()
2912 struct rb_node *nd = rb_first_cached(&hb->hists->entries); in hist_browser__update_percent_limit() local
2918 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) { in hist_browser__update_percent_limit()
2919 he = rb_entry(nd, struct hist_entry, rb_node); in hist_browser__update_percent_limit()
2942 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD); in hist_browser__update_percent_limit()