Lines Matching refs:hist_entry

22 				       struct hist_entry *he);
24 struct hist_entry *he);
26 struct hist_entry *he);
28 struct hist_entry *he);
67 void hists__calc_col_len(struct hists *hists, struct hist_entry *h) in hists__calc_col_len()
213 struct hist_entry *n; in hists__output_recalc_col_len()
219 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
274 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
276 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry()
298 struct hist_entry *child; in hists__decay_entry()
301 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
312 static void hists__delete_entry(struct hists *hists, struct hist_entry *he) in hists__delete_entry()
341 struct hist_entry *n; in hists__decay_entries()
344 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
357 struct hist_entry *n; in hists__delete_entries()
360 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
371 static int hist_entry__init(struct hist_entry *he, in hist_entry__init()
372 struct hist_entry *template, in hist_entry__init()
449 return zalloc(size + sizeof(struct hist_entry)); in hist_entry__zalloc()
462 static struct hist_entry *hist_entry__new(struct hist_entry *template, in hist_entry__new()
467 struct hist_entry *he; in hist_entry__new()
495 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period) in hist_entry__add_callchain_period()
505 static struct hist_entry *hists__findnew_entry(struct hists *hists, in hists__findnew_entry()
506 struct hist_entry *entry, in hists__findnew_entry()
512 struct hist_entry *he; in hists__findnew_entry()
521 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
582 static struct hist_entry*
593 struct hist_entry entry = { in __hists__add_entry()
631 struct hist_entry *hists__add_entry(struct hists *hists, in hists__add_entry()
643 struct hist_entry *hists__add_entry_ops(struct hists *hists, in hists__add_entry_ops()
691 struct hist_entry *he; in iter_add_single_mem_entry()
724 struct hist_entry *he = iter->he; in iter_finish_mem_entry()
795 struct hist_entry *he = NULL; in iter_add_next_branch_entry()
846 struct hist_entry *he; in iter_add_single_normal_entry()
861 struct hist_entry *he = iter->he; in iter_finish_normal_entry()
879 struct hist_entry **he_cache; in iter_prepare_cumulative_entry()
905 struct hist_entry **he_cache = iter->priv; in iter_add_single_cumulative_entry()
906 struct hist_entry *he; in iter_add_single_cumulative_entry()
949 struct hist_entry **he_cache = iter->priv; in iter_add_next_cumulative_entry()
950 struct hist_entry *he; in iter_add_next_cumulative_entry()
951 struct hist_entry he_tmp = { in iter_add_next_cumulative_entry()
1091 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) in hist_entry__cmp()
1111 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) in hist_entry__collapse()
1130 void hist_entry__delete(struct hist_entry *he) in hist_entry__delete()
1168 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp, in hist_entry__snprintf_alignment()
1186 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1187 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1197 static void hist_entry__check_and_remove_filter(struct hist_entry *he, in hist_entry__check_and_remove_filter()
1203 struct hist_entry *parent = he->parent_he; in hist_entry__check_and_remove_filter()
1267 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he) in hist_entry__apply_hierarchy_filters()
1281 static struct hist_entry *hierarchy_insert_entry(struct hists *hists, in hierarchy_insert_entry()
1283 struct hist_entry *he, in hierarchy_insert_entry()
1284 struct hist_entry *parent_he, in hierarchy_insert_entry()
1289 struct hist_entry *iter, *new; in hierarchy_insert_entry()
1295 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1352 struct hist_entry *he) in hists__hierarchy_insert_entry()
1355 struct hist_entry *new_he = NULL; in hists__hierarchy_insert_entry()
1356 struct hist_entry *parent = NULL; in hists__hierarchy_insert_entry()
1399 struct hist_entry *he) in hists__collapse_insert_entry()
1403 struct hist_entry *iter; in hists__collapse_insert_entry()
1411 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1460 static void hists__apply_filters(struct hists *hists, struct hist_entry *he) in hists__apply_filters()
1472 struct hist_entry *n; in hists__collapse_resort()
1487 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1509 static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b) in hist_entry__sort()
1541 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h) in hists__inc_filter_stats()
1547 void hists__inc_stats(struct hists *hists, struct hist_entry *h) in hists__inc_stats()
1559 struct hist_entry *he; in hierarchy_recalc_total_periods()
1572 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1582 struct hist_entry *he) in hierarchy_insert_output_entry()
1586 struct hist_entry *iter; in hierarchy_insert_output_entry()
1591 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1617 struct hist_entry *he; in hists__hierarchy_output_resort()
1623 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1664 struct hist_entry *he, in __hists__insert_output_entry()
1670 struct hist_entry *iter; in __hists__insert_output_entry()
1688 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1711 struct hist_entry *n; in output_resort()
1743 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
1785 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd) in can_goto_child()
1798 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1802 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1809 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
1828 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
1841 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit) in hist_entry__has_hierarchy_children()
1844 struct hist_entry *child; in hist_entry__has_hierarchy_children()
1851 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
1855 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
1866 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h, in hists__remove_entry_filter()
1872 struct hist_entry *parent = h->parent_he; in hists__remove_entry_filter()
1909 struct hist_entry *he) in hists__filter_entry_by_dso()
1921 struct hist_entry *he) in hists__filter_entry_by_thread()
1933 struct hist_entry *he) in hists__filter_entry_by_symbol()
1946 struct hist_entry *he) in hists__filter_entry_by_socket()
1957 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
1969 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
1978 static void resort_filtered_entry(struct rb_root *root, struct hist_entry *he) in resort_filtered_entry()
1982 struct hist_entry *iter; in resort_filtered_entry()
1988 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2004 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2027 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2071 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2140 static struct hist_entry *hists__add_dummy_entry(struct hists *hists, in hists__add_dummy_entry()
2141 struct hist_entry *pair) in hists__add_dummy_entry()
2146 struct hist_entry *he; in hists__add_dummy_entry()
2158 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2186 static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists, in add_dummy_hierarchy_entry()
2188 struct hist_entry *pair) in add_dummy_hierarchy_entry()
2192 struct hist_entry *he; in add_dummy_hierarchy_entry()
2200 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2230 static struct hist_entry *hists__find_entry(struct hists *hists, in hists__find_entry()
2231 struct hist_entry *he) in hists__find_entry()
2241 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2255 static struct hist_entry *hists__find_hierarchy_entry(struct rb_root *root, in hists__find_hierarchy_entry()
2256 struct hist_entry *he) in hists__find_hierarchy_entry()
2261 struct hist_entry *iter; in hists__find_hierarchy_entry()
2265 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2287 struct hist_entry *pos, *pair; in hists__match_hierarchy()
2290 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2307 struct hist_entry *pos, *pair; in hists__match()
2321 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2330 struct hist_entry *parent, in hists__link_hierarchy()
2335 struct hist_entry *pos, *leader; in hists__link_hierarchy()
2338 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2382 struct hist_entry *pos, *pair; in hists__link()
2397 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2583 struct hist_entry *he; in hists__delete_remaining_entries()
2589 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()