Lines Matching refs:nd
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);
1816 struct rb_node *nd;
1826 for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {
1827 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1865 static struct rb_node *hists__filter_entries(struct rb_node *nd,
1868 while (nd != NULL) {
1869 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1873 return nd;
1879 if (rb_next(nd))
1880 nd = rb_next(nd);
1882 nd = rb_hierarchy_next(nd);
1888 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
1891 while (nd != NULL) {
1892 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1896 return nd;
1898 nd = rb_hierarchy_prev(nd);
1908 struct rb_node *nd;
1921 nd = hists__filter_entries(rb_first(browser->entries),
1925 nd = browser->top;
1928 nd = rb_hierarchy_last(rb_last(browser->entries));
1929 nd = hists__filter_prev_entries(nd, hb->min_pcnt);
1944 * Here we have to check if nd is expanded (+), if it is we can't go
1957 if (!nd)
1962 h = rb_entry(nd, struct hist_entry, rb_node);
1971 browser->top = nd;
1975 nd = hists__filter_entries(rb_hierarchy_next(nd),
1977 if (nd == NULL)
1980 browser->top = nd;
1984 h = rb_entry(nd, struct hist_entry, rb_node);
1993 browser->top = nd;
2003 browser->top = nd;
2009 nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),
2011 if (nd == NULL)
2014 browser->top = nd;
2021 h = rb_entry(nd, struct hist_entry, rb_node);
2029 browser->top = nd;
2030 h = rb_entry(nd, struct hist_entry, rb_node);
2151 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
2155 while (nd) {
2156 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2166 nd = hists__filter_entries(rb_hierarchy_next(nd),
2881 struct rb_node *nd = rb_first_cached(&hb->hists->entries);
2888 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2890 nd = rb_hierarchy_next(nd);
2901 struct rb_node *nd = rb_first_cached(&hb->hists->entries);
2907 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2908 he = rb_entry(nd, struct hist_entry, rb_node);
2931 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);