Lines Matching refs:hist_entry
34 struct hist_entry *he);
36 struct hist_entry *he);
38 struct hist_entry *he);
40 struct hist_entry *he);
79 void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
242 struct hist_entry *n;
248 n = rb_entry(next, struct hist_entry, rb_node);
311 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
313 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
335 struct hist_entry *child;
338 child = rb_entry(node, struct hist_entry, rb_node);
349 static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
378 struct hist_entry *n;
381 n = rb_entry(next, struct hist_entry, rb_node);
394 struct hist_entry *n;
397 n = rb_entry(next, struct hist_entry, rb_node);
404 struct hist_entry *hists__get_entry(struct hists *hists, int idx)
407 struct hist_entry *n;
411 n = rb_entry(next, struct hist_entry, rb_node);
426 static int hist_entry__init(struct hist_entry *he,
427 struct hist_entry *template,
523 return zalloc(size + sizeof(struct hist_entry));
536 static struct hist_entry *hist_entry__new(struct hist_entry *template,
541 struct hist_entry *he;
569 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
579 static struct hist_entry *hists__findnew_entry(struct hists *hists,
580 struct hist_entry *entry,
586 struct hist_entry *he;
596 he = rb_entry(parent, struct hist_entry, rb_node_in);
622 /* If the map of an existing hist_entry has
671 static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample)
687 static struct hist_entry*
699 struct hist_entry entry = {
743 struct hist_entry *hists__add_entry(struct hists *hists,
755 struct hist_entry *hists__add_entry_ops(struct hists *hists,
768 struct hist_entry *hists__add_entry_block(struct hists *hists,
772 struct hist_entry entry = {
820 struct hist_entry *he;
853 struct hist_entry *he = iter->he;
925 struct hist_entry *he = NULL;
976 struct hist_entry *he;
991 struct hist_entry *he = iter->he;
1009 struct hist_entry **he_cache;
1035 struct hist_entry **he_cache = iter->priv;
1036 struct hist_entry *he;
1074 hist_entry__fast__sym_diff(struct hist_entry *left,
1075 struct hist_entry *right)
1093 struct hist_entry **he_cache = iter->priv;
1094 struct hist_entry *he;
1095 struct hist_entry he_tmp = {
1247 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
1267 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
1286 void hist_entry__delete(struct hist_entry *he)
1328 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
1346 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1347 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1357 static void hist_entry__check_and_remove_filter(struct hist_entry *he,
1363 struct hist_entry *parent = he->parent_he;
1427 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)
1441 static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
1443 struct hist_entry *he,
1444 struct hist_entry *parent_he,
1449 struct hist_entry *iter, *new;
1456 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1515 struct hist_entry *he)
1518 struct hist_entry *new_he = NULL;
1519 struct hist_entry *parent = NULL;
1562 struct hist_entry *he)
1566 struct hist_entry *iter;
1575 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1626 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1638 struct hist_entry *n;
1653 n = rb_entry(next, struct hist_entry, rb_node_in);
1675 static int64_t hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1707 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1713 void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1725 struct hist_entry *he;
1738 he = rb_entry(node, struct hist_entry, rb_node);
1748 struct hist_entry *he)
1752 struct hist_entry *iter;
1758 iter = rb_entry(parent, struct hist_entry, rb_node);
1786 struct hist_entry *he;
1792 he = rb_entry(node, struct hist_entry, rb_node_in);
1833 struct hist_entry *he,
1839 struct hist_entry *iter;
1858 iter = rb_entry(parent, struct hist_entry, rb_node);
1884 struct hist_entry *n;
1916 n = rb_entry(next, struct hist_entry, rb_node_in);
1964 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
1977 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1981 he = rb_entry(node, struct hist_entry, rb_node);
1988 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2007 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2020 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
2023 struct hist_entry *child;
2030 child = rb_entry(node, struct hist_entry, rb_node);
2034 child = rb_entry(node, struct hist_entry, rb_node);
2045 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
2051 struct hist_entry *parent = h->parent_he;
2088 struct hist_entry *he)
2100 struct hist_entry *he)
2112 struct hist_entry *he)
2125 struct hist_entry *he)
2136 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2148 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2158 struct hist_entry *he)
2162 struct hist_entry *iter;
2169 iter = rb_entry(parent, struct hist_entry, rb_node);
2187 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2210 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2254 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2323 static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
2324 struct hist_entry *pair)
2329 struct hist_entry *he;
2342 he = rb_entry(parent, struct hist_entry, rb_node_in);
2372 static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists,
2374 struct hist_entry *pair)
2378 struct hist_entry *he;
2387 he = rb_entry(parent, struct hist_entry, rb_node_in);
2419 static struct hist_entry *hists__find_entry(struct hists *hists,
2420 struct hist_entry *he)
2430 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
2444 static struct hist_entry *hists__find_hierarchy_entry(struct rb_root_cached *root,
2445 struct hist_entry *he)
2450 struct hist_entry *iter;
2454 iter = rb_entry(n, struct hist_entry, rb_node_in);
2476 struct hist_entry *pos, *pair;
2479 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2496 struct hist_entry *pos, *pair;
2510 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2519 struct hist_entry *parent,
2524 struct hist_entry *pos, *leader;
2527 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2571 struct hist_entry *pos, *pair;
2586 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2603 struct hist_entry *pos;
2611 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2800 struct hist_entry *he;
2806 he = rb_entry(node, struct hist_entry, rb_node_in);