Lines Matching refs:hist_entry
14 struct hist_entry *he);
16 struct hist_entry *he);
18 struct hist_entry *he);
20 struct hist_entry *he);
59 void hists__calc_col_len(struct hists *hists, struct hist_entry *h) in hists__calc_col_len()
200 struct hist_entry *n; in hists__output_recalc_col_len()
206 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
261 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
263 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry()
285 struct hist_entry *child; in hists__decay_entry()
288 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
299 static void hists__delete_entry(struct hists *hists, struct hist_entry *he) in hists__delete_entry()
328 struct hist_entry *n; in hists__decay_entries()
331 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
344 struct hist_entry *n; in hists__delete_entries()
347 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
358 static int hist_entry__init(struct hist_entry *he, in hist_entry__init()
359 struct hist_entry *template, in hist_entry__init()
434 return zalloc(size + sizeof(struct hist_entry)); in hist_entry__zalloc()
447 static struct hist_entry *hist_entry__new(struct hist_entry *template, in hist_entry__new()
452 struct hist_entry *he; in hist_entry__new()
480 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period) in hist_entry__add_callchain_period()
490 static struct hist_entry *hists__findnew_entry(struct hists *hists, in hists__findnew_entry()
491 struct hist_entry *entry, in hists__findnew_entry()
497 struct hist_entry *he; in hists__findnew_entry()
506 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
567 static struct hist_entry*
577 struct hist_entry entry = { in __hists__add_entry()
608 struct hist_entry *hists__add_entry(struct hists *hists, in hists__add_entry()
620 struct hist_entry *hists__add_entry_ops(struct hists *hists, in hists__add_entry_ops()
668 struct hist_entry *he; in iter_add_single_mem_entry()
701 struct hist_entry *he = iter->he; in iter_finish_mem_entry()
775 struct hist_entry *he = NULL; in iter_add_next_branch_entry()
826 struct hist_entry *he; in iter_add_single_normal_entry()
841 struct hist_entry *he = iter->he; in iter_finish_normal_entry()
859 struct hist_entry **he_cache; in iter_prepare_cumulative_entry()
885 struct hist_entry **he_cache = iter->priv; in iter_add_single_cumulative_entry()
886 struct hist_entry *he; in iter_add_single_cumulative_entry()
929 struct hist_entry **he_cache = iter->priv; in iter_add_next_cumulative_entry()
930 struct hist_entry *he; in iter_add_next_cumulative_entry()
931 struct hist_entry he_tmp = { in iter_add_next_cumulative_entry()
1072 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) in hist_entry__cmp()
1092 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) in hist_entry__collapse()
1111 void hist_entry__delete(struct hist_entry *he) in hist_entry__delete()
1149 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp, in hist_entry__snprintf_alignment()
1167 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1168 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1178 static void hist_entry__check_and_remove_filter(struct hist_entry *he, in hist_entry__check_and_remove_filter()
1184 struct hist_entry *parent = he->parent_he; in hist_entry__check_and_remove_filter()
1247 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he) in hist_entry__apply_hierarchy_filters()
1261 static struct hist_entry *hierarchy_insert_entry(struct hists *hists, in hierarchy_insert_entry()
1263 struct hist_entry *he, in hierarchy_insert_entry()
1264 struct hist_entry *parent_he, in hierarchy_insert_entry()
1269 struct hist_entry *iter, *new; in hierarchy_insert_entry()
1275 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1332 struct hist_entry *he) in hists__hierarchy_insert_entry()
1335 struct hist_entry *new_he = NULL; in hists__hierarchy_insert_entry()
1336 struct hist_entry *parent = NULL; in hists__hierarchy_insert_entry()
1378 struct hist_entry *he) in hists__collapse_insert_entry()
1382 struct hist_entry *iter; in hists__collapse_insert_entry()
1390 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1439 static void hists__apply_filters(struct hists *hists, struct hist_entry *he) in hists__apply_filters()
1451 struct hist_entry *n; in hists__collapse_resort()
1466 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1488 static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b) in hist_entry__sort()
1520 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h) in hists__inc_filter_stats()
1526 void hists__inc_stats(struct hists *hists, struct hist_entry *h) in hists__inc_stats()
1538 struct hist_entry *he; in hierarchy_recalc_total_periods()
1551 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1561 struct hist_entry *he) in hierarchy_insert_output_entry()
1565 struct hist_entry *iter; in hierarchy_insert_output_entry()
1570 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1596 struct hist_entry *he; in hists__hierarchy_output_resort()
1602 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1643 struct hist_entry *he, in __hists__insert_output_entry()
1649 struct hist_entry *iter; in __hists__insert_output_entry()
1667 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1690 struct hist_entry *n; in output_resort()
1722 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
1762 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd) in can_goto_child()
1775 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1779 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1786 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
1805 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
1818 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit) in hist_entry__has_hierarchy_children()
1821 struct hist_entry *child; in hist_entry__has_hierarchy_children()
1828 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
1832 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
1843 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, in hists__remove_entry_filter()
1849 struct hist_entry *parent = h->parent_he; in hists__remove_entry_filter()
1886 struct hist_entry *he) in hists__filter_entry_by_dso()
1898 struct hist_entry *he) in hists__filter_entry_by_thread()
1910 struct hist_entry *he) in hists__filter_entry_by_symbol()
1923 struct hist_entry *he) in hists__filter_entry_by_socket()
1934 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
1946 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
1955 static void resort_filtered_entry(struct rb_root *root, struct hist_entry *he) in resort_filtered_entry()
1959 struct hist_entry *iter; in resort_filtered_entry()
1965 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
1981 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2004 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2048 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2117 static struct hist_entry *hists__add_dummy_entry(struct hists *hists, in hists__add_dummy_entry()
2118 struct hist_entry *pair) in hists__add_dummy_entry()
2123 struct hist_entry *he; in hists__add_dummy_entry()
2135 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2163 static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists, in add_dummy_hierarchy_entry()
2165 struct hist_entry *pair) in add_dummy_hierarchy_entry()
2169 struct hist_entry *he; in add_dummy_hierarchy_entry()
2177 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2207 static struct hist_entry *hists__find_entry(struct hists *hists, in hists__find_entry()
2208 struct hist_entry *he) in hists__find_entry()
2218 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2232 static struct hist_entry *hists__find_hierarchy_entry(struct rb_root *root, in hists__find_hierarchy_entry()
2233 struct hist_entry *he) in hists__find_hierarchy_entry()
2238 struct hist_entry *iter; in hists__find_hierarchy_entry()
2242 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2264 struct hist_entry *pos, *pair; in hists__match_hierarchy()
2267 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2284 struct hist_entry *pos, *pair; in hists__match()
2298 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2307 struct hist_entry *parent, in hists__link_hierarchy()
2312 struct hist_entry *pos, *leader; in hists__link_hierarchy()
2315 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2359 struct hist_entry *pos, *pair; in hists__link()
2374 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2479 struct hist_entry *he; in hists__delete_remaining_entries()
2485 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()