Lines Matching refs:hist_entry

70 		struct hist_entry *he =
71 rb_entry(nd, struct hist_entry, rb_node);
131 /* 3 == +/- toggle symbol before actual hist_entry rendering */
161 static char hist_entry__folded(const struct hist_entry *he)
272 static int hierarchy_count_rows(struct hist_browser *hb, struct hist_entry *he,
277 struct hist_entry *child;
289 child = rb_entry(node, struct hist_entry, rb_node);
304 static bool hist_entry__toggle_fold(struct hist_entry *he)
381 static void hist_entry__init_have_children(struct hist_entry *he)
398 struct hist_entry *he = browser->he_selection;
412 struct hist_entry *he = browser->he_selection;
426 struct hist_entry *he = browser->he_selection;
444 struct hist_entry *he = browser->he_selection;
564 static int hierarchy_set_folding(struct hist_browser *hb, struct hist_entry *he,
569 struct hist_entry *child;
573 child = rb_entry(nd, struct hist_entry, rb_node);
582 static void hist_entry__set_folding(struct hist_entry *he,
605 struct hist_entry *he;
610 he = rb_entry(nd, struct hist_entry, rb_node);
701 struct hist_entry *h = rb_entry(browser->b.top, struct hist_entry, rb_node);
1163 struct hist_entry *entry, int level,
1228 static u64 __hpp_get_##_field(struct hist_entry *he) \
1236 struct hist_entry *he) \
1243 static u64 __hpp_get_acc_##_field(struct hist_entry *he) \
1251 struct hist_entry *he) \
1295 struct hist_entry *entry,
1401 struct hist_entry *entry,
1827 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1869 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1892 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1907 struct hist_entry *h;
1940 h = rb_entry(browser->top, struct hist_entry, rb_node);
1945 * the next top level hist_entry, instead we must compute an offset of
1952 * structure, we need to always print the whole hist_entry callchain,
1962 h = rb_entry(nd, struct hist_entry, rb_node);
1984 h = rb_entry(nd, struct hist_entry, rb_node);
2017 * Last unfiltered hist_entry, check if it is
2021 h = rb_entry(nd, struct hist_entry, rb_node);
2030 h = rb_entry(nd, struct hist_entry, rb_node);
2036 struct hist_entry *he, FILE *fp,
2050 struct hist_entry *he, FILE *fp)
2092 struct hist_entry *he,
2156 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2271 static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
2431 struct hist_entry *he;
2710 struct hist_entry *he;
2751 struct hist_entry *he;
2900 struct hist_entry *he;
2908 he = rb_entry(nd, struct hist_entry, rb_node);