Lines Matching refs:nd
79 struct rb_node *nd;
81 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
82 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
120 struct rb_node *nd;
123 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
124 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
145 struct rb_node *nd = rb_first(&node->rb_root);
147 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
148 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
178 struct rb_node *nd;
180 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
181 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
220 struct rb_node *nd;
222 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
223 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
260 struct rb_node *nd;
263 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
264 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
285 struct rb_node *nd;
289 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
290 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
568 struct rb_node *nd;
571 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
572 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
807 struct rb_node *nd;
812 for (nd = browser->top; nd; nd = rb_next(nd)) {
813 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
831 static struct rb_node *hists__filter_entries(struct rb_node *nd,
835 while (nd != NULL) {
836 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
844 return nd;
846 nd = rb_next(nd);
852 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
856 while (nd != NULL) {
857 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
862 return nd;
864 nd = rb_prev(nd);
874 struct rb_node *nd;
887 nd = hists__filter_entries(rb_first(browser->entries),
891 nd = browser->top;
894 nd = hists__filter_prev_entries(rb_last(browser->entries),
910 * Here we have to check if nd is expanded (+), if it is we can't go
925 h = rb_entry(nd, struct hist_entry, rb_node);
934 browser->top = nd;
938 nd = hists__filter_entries(rb_next(nd), hb->hists,
940 if (nd == NULL)
943 browser->top = nd;
947 h = rb_entry(nd, struct hist_entry, rb_node);
956 browser->top = nd;
966 browser->top = nd;
972 nd = hists__filter_prev_entries(rb_prev(nd), hb->hists,
974 if (nd == NULL)
977 browser->top = nd;
984 h = rb_entry(nd, struct hist_entry, rb_node);
992 browser->top = nd;
993 h = rb_entry(nd, struct hist_entry, rb_node);
1095 struct rb_node *nd;
1098 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
1099 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
1142 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
1147 while (nd) {
1148 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1151 nd = hists__filter_entries(rb_next(nd), browser->hists,
1374 struct rb_node *nd = rb_first(&hb->hists->entries);
1376 while (nd) {
1378 nd = hists__filter_entries(rb_next(nd), hb->hists,
