Lines Matching defs:nd
64 struct rb_node *nd;
66 for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) {
67 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
105 struct rb_node *nd;
108 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
109 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
127 struct rb_node *nd = rb_first(&self->rb_root);
129 for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) {
130 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
160 struct rb_node *nd;
162 for (nd = rb_first(self); nd; nd = rb_next(nd)) {
163 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
429 struct rb_node *nd;
432 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
433 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
508 struct rb_node *nd;
514 for (nd = self->top; nd; nd = rb_next(nd)) {
515 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
528 static struct rb_node *hists__filter_entries(struct rb_node *nd)
530 while (nd != NULL) {
531 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
533 return nd;
535 nd = rb_next(nd);
541 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd)
543 while (nd != NULL) {
544 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
546 return nd;
548 nd = rb_prev(nd);
558 struct rb_node *nd;
563 nd = hists__filter_entries(rb_first(self->entries));
566 nd = self->top;
569 nd = hists__filter_prev_entries(rb_last(self->entries));
584 * Here we have to check if nd is expanded (+), if it is we can't go
599 h = rb_entry(nd, struct hist_entry, rb_node);
608 self->top = nd;
612 nd = hists__filter_entries(rb_next(nd));
613 if (nd == NULL)
616 self->top = nd;
620 h = rb_entry(nd, struct hist_entry, rb_node);
629 self->top = nd;
639 self->top = nd;
645 nd = hists__filter_prev_entries(rb_prev(nd));
646 if (nd == NULL)
649 self->top = nd;
656 h = rb_entry(nd, struct hist_entry, rb_node);
664 self->top = nd;
665 h = rb_entry(nd, struct hist_entry, rb_node);
915 struct rb_node *first = rb_first(self), *nd = first, *next;
918 while (nd) {
919 struct hists *hists = rb_entry(nd, struct hists, rb_node);
929 next = rb_next(nd);
931 nd = next;
934 if (nd == first)
936 nd = rb_prev(nd);