Lines Matching refs:hist_entry
35 struct hist_entry *he);
37 struct hist_entry *he);
39 struct hist_entry *he);
41 struct hist_entry *he);
80 void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
256 struct hist_entry *n;
262 n = rb_entry(next, struct hist_entry, rb_node);
321 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
323 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
345 struct hist_entry *child;
348 child = rb_entry(node, struct hist_entry, rb_node);
359 static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
388 struct hist_entry *n;
391 n = rb_entry(next, struct hist_entry, rb_node);
404 struct hist_entry *n;
407 n = rb_entry(next, struct hist_entry, rb_node);
414 struct hist_entry *hists__get_entry(struct hists *hists, int idx)
417 struct hist_entry *n;
421 n = rb_entry(next, struct hist_entry, rb_node);
436 static int hist_entry__init(struct hist_entry *he,
437 struct hist_entry *template,
535 return zalloc(size + sizeof(struct hist_entry));
548 static struct hist_entry *hist_entry__new(struct hist_entry *template,
553 struct hist_entry *he;
581 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
591 static struct hist_entry *hists__findnew_entry(struct hists *hists,
592 struct hist_entry *entry,
598 struct hist_entry *he;
607 he = rb_entry(parent, struct hist_entry, rb_node_in);
634 /* If the map of an existing hist_entry has
683 static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample)
699 static struct hist_entry*
712 struct hist_entry entry = {
761 struct hist_entry *hists__add_entry(struct hists *hists,
774 struct hist_entry *hists__add_entry_ops(struct hists *hists,
788 struct hist_entry *hists__add_entry_block(struct hists *hists,
792 struct hist_entry entry = {
840 struct hist_entry *he;
873 struct hist_entry *he = iter->he;
947 struct hist_entry *he = NULL;
998 struct hist_entry *he;
1013 struct hist_entry *he = iter->he;
1031 struct hist_entry **he_cache;
1061 struct hist_entry **he_cache = iter->priv;
1062 struct hist_entry *he;
1100 hist_entry__fast__sym_diff(struct hist_entry *left,
1101 struct hist_entry *right)
1119 struct hist_entry **he_cache = iter->priv;
1120 struct hist_entry *he;
1121 struct hist_entry he_tmp = {
1276 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
1296 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
1315 void hist_entry__delete(struct hist_entry *he)
1361 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
1379 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1380 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1390 static void hist_entry__check_and_remove_filter(struct hist_entry *he,
1396 struct hist_entry *parent = he->parent_he;
1460 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)
1474 static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
1476 struct hist_entry *he,
1477 struct hist_entry *parent_he,
1482 struct hist_entry *iter, *new;
1489 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1548 struct hist_entry *he)
1551 struct hist_entry *new_he = NULL;
1552 struct hist_entry *parent = NULL;
1600 struct hist_entry *he)
1604 struct hist_entry *iter;
1613 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1668 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1680 struct hist_entry *n;
1695 n = rb_entry(next, struct hist_entry, rb_node_in);
1717 static int64_t hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1749 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1755 void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1767 struct hist_entry *he;
1780 he = rb_entry(node, struct hist_entry, rb_node);
1790 struct hist_entry *he)
1794 struct hist_entry *iter;
1800 iter = rb_entry(parent, struct hist_entry, rb_node);
1828 struct hist_entry *he;
1834 he = rb_entry(node, struct hist_entry, rb_node_in);
1875 struct hist_entry *he,
1881 struct hist_entry *iter;
1900 iter = rb_entry(parent, struct hist_entry, rb_node);
1926 struct hist_entry *n;
1958 n = rb_entry(next, struct hist_entry, rb_node_in);
2006 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
2019 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2023 he = rb_entry(node, struct hist_entry, rb_node);
2030 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2049 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2062 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
2065 struct hist_entry *child;
2072 child = rb_entry(node, struct hist_entry, rb_node);
2076 child = rb_entry(node, struct hist_entry, rb_node);
2087 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
2093 struct hist_entry *parent = h->parent_he;
2130 struct hist_entry *he)
2142 struct hist_entry *he)
2154 struct hist_entry *he)
2167 struct hist_entry *he)
2178 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2190 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2200 struct hist_entry *he)
2204 struct hist_entry *iter;
2211 iter = rb_entry(parent, struct hist_entry, rb_node);
2229 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2252 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2296 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2375 static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
2376 struct hist_entry *pair)
2381 struct hist_entry *he;
2394 he = rb_entry(parent, struct hist_entry, rb_node_in);
2424 static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists,
2426 struct hist_entry *pair)
2430 struct hist_entry *he;
2439 he = rb_entry(parent, struct hist_entry, rb_node_in);
2471 static struct hist_entry *hists__find_entry(struct hists *hists,
2472 struct hist_entry *he)
2482 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
2496 static struct hist_entry *hists__find_hierarchy_entry(struct rb_root_cached *root,
2497 struct hist_entry *he)
2502 struct hist_entry *iter;
2506 iter = rb_entry(n, struct hist_entry, rb_node_in);
2528 struct hist_entry *pos, *pair;
2531 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2548 struct hist_entry *pos, *pair;
2562 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2571 struct hist_entry *parent,
2576 struct hist_entry *pos, *leader;
2579 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2623 struct hist_entry *pos, *pair;
2638 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2655 struct hist_entry *pos;
2663 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2863 struct hist_entry *he;
2869 he = rb_entry(node, struct hist_entry, rb_node_in);