Lines Matching refs:nd
71 struct rb_node *nd;
73 for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) {
74 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
112 struct rb_node *nd;
115 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
116 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
134 struct rb_node *nd = rb_first(&self->rb_root);
136 for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) {
137 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
167 struct rb_node *nd;
169 for (nd = rb_first(self); nd; nd = rb_next(nd)) {
170 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
209 struct rb_node *nd;
211 for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) {
212 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
249 struct rb_node *nd;
252 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
253 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
274 struct rb_node *nd;
278 for (nd = rb_first(&self->entries); nd; nd = rb_next(nd)) {
279 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
512 struct rb_node *nd;
515 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
516 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
591 struct rb_node *nd;
597 for (nd = self->top; nd; nd = rb_next(nd)) {
598 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
611 static struct rb_node *hists__filter_entries(struct rb_node *nd)
613 while (nd != NULL) {
614 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
616 return nd;
618 nd = rb_next(nd);
624 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd)
626 while (nd != NULL) {
627 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
629 return nd;
631 nd = rb_prev(nd);
641 struct rb_node *nd;
649 nd = hists__filter_entries(rb_first(self->entries));
652 nd = self->top;
655 nd = hists__filter_prev_entries(rb_last(self->entries));
670 * Here we have to check if nd is expanded (+), if it is we can't go
685 h = rb_entry(nd, struct hist_entry, rb_node);
694 self->top = nd;
698 nd = hists__filter_entries(rb_next(nd));
699 if (nd == NULL)
702 self->top = nd;
706 h = rb_entry(nd, struct hist_entry, rb_node);
715 self->top = nd;
725 self->top = nd;
731 nd = hists__filter_prev_entries(rb_prev(nd));
732 if (nd == NULL)
735 self->top = nd;
742 h = rb_entry(nd, struct hist_entry, rb_node);
750 self->top = nd;
751 h = rb_entry(nd, struct hist_entry, rb_node);
