Lines Matching refs:hist_entry
25 struct hist_entry *he_selection;
31 /* 3 == +/- toggle symbol before actual hist_entry rendering */
53 static char hist_entry__folded(const struct hist_entry *self)
175 static void hist_entry__init_have_children(struct hist_entry *self)
187 struct hist_entry *he = self->he_selection;
260 static void hist_entry__set_folding(struct hist_entry *self, bool unfold)
279 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
317 struct hist_entry *h = rb_entry(self->b.top,
318 struct hist_entry, rb_node);
529 struct hist_entry *entry,
598 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
614 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
627 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
640 struct hist_entry *h;
666 h = rb_entry(self->top, struct hist_entry, rb_node);
671 * the next top level hist_entry, instead we must compute an offset of
678 * structure, we need to always print the whole hist_entry callchain,
685 h = rb_entry(nd, struct hist_entry, rb_node);
706 h = rb_entry(nd, struct hist_entry, rb_node);
738 * Last unfiltered hist_entry, check if it is
742 h = rb_entry(nd, struct hist_entry, rb_node);
751 h = rb_entry(nd, struct hist_entry, rb_node);
774 static struct hist_entry *hist_browser__selected_entry(struct hist_browser *self)
946 struct hist_entry *he;
