Home
last modified time | relevance | path

Searched refs:he (Results 1 – 25 of 34) sorted by relevance

12

/tools/perf/tests/
A Dhists_output.c133 #define SYM(he) (he->ms.sym->name) argument
134 #define CPU(he) (he->cpu) argument
282 CPU(he) == 1 && PID(he) == 100 && he->stat.period == 300); in test2()
287 CPU(he) == 0 && PID(he) == 100 && he->stat.period == 100); in test2()
518 CPU(he) == 0 && PID(he) == 100 && in test5()
525 CPU(he) == 2 && PID(he) == 200 && in test5()
532 CPU(he) == 1 && PID(he) == 300 && in test5()
539 CPU(he) == 0 && PID(he) == 300 && in test5()
546 CPU(he) == 3 && PID(he) == 300 && in test5()
553 CPU(he) == 1 && PID(he) == 100 && in test5()
[all …]
A Dhists_common.c177 struct hist_entry *he; in print_hists_in() local
181 if (!he->filtered) { in print_hists_in()
182 struct dso *dso = map__dso(he->ms.map); in print_hists_in()
185 i, thread__comm_str(he->thread), in print_hists_in()
187 he->ms.sym->name, he->stat.period); in print_hists_in()
206 struct hist_entry *he; in print_hists_out() local
210 if (!he->filtered) { in print_hists_out()
211 struct dso *dso = map__dso(he->ms.map); in print_hists_out()
214 i, thread__comm_str(he->thread), thread__tid(he->thread), in print_hists_out()
216 he->ms.sym->name, he->stat.period, in print_hists_out()
[all …]
A Dhists_link.c70 struct hist_entry *he; in add_hist_entries() local
92 he = hists__add_entry(hists, &al, NULL, in add_hist_entries()
94 if (he == NULL) { in add_hist_entries()
114 if (he == NULL) { in add_hist_entries()
176 struct hist_entry *he; in __validate_match() local
180 if (hist_entry__has_pairs(he)) { in __validate_match()
183 he->thread, he->ms.map, he->ms.sym)) { in __validate_match()
228 struct hist_entry *he; in __validate_link() local
232 if (hist_entry__has_pairs(he)) { in __validate_link()
235 he->thread, he->ms.map, he->ms.sym) && in __validate_link()
[all …]
A Dhists_cumulate.c132 struct hist_entry *he; in del_hist_entries() local
150 hist_entry__delete(he); in del_hist_entries()
166 #define COMM(he) (thread__comm_str(he->thread)) argument
167 #define DSO(he) (dso__short_name(map__dso(he->ms.map))) argument
168 #define SYM(he) (he->ms.sym->name) argument
169 #define CPU(he) (he->cpu) argument
170 #define DEPTH(he) (he->callchain->max_depth) argument
195 struct hist_entry *he; in do_test() local
225 !strcmp(DSO(he), expected[i].dso) && in do_test()
226 !strcmp(SYM(he), expected[i].sym)); in do_test()
[all …]
/tools/perf/util/
A Dhist.c534 memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); in hist_entry__init()
540 he->ms.map = map__get(he->ms.map); in hist_entry__init()
571 he->raw_data = memdup(he->raw_data, he->raw_size); in hist_entry__init()
962 iter->he = he; in iter_add_single_mem_entry()
1063 iter->he = he; in iter_add_next_branch_entry()
1114 iter->he = he; in iter_add_single_normal_entry()
1179 iter->he = he; in iter_add_single_cumulative_entry()
1282 iter->he = he; in iter_add_next_cumulative_entry()
2181 he = he->parent_he; in __rb_hierarchy_next()
2198 he = he->parent_he; in rb_hierarchy_prev()
[all …]
A Dsort.c437 return _hist_entry__sym_snprintf(&he->ms, he->ip, in hist_entry__sym_snprintf()
510 return map__srcline(he->ms.map, he->ip, he->ms.sym); in hist_entry__srcline()
546 he->srcline = hist_entry__srcline(he); in sort__srcline_init()
864 he->srcfile = hist_entry__get_srcfile(he); in sort__srcfile_init()
901 he->parent ? he->parent->name : "[other]"); in hist_entry__parent_snprintf()
1157 he->trace_output = get_trace_output(he); in hist_entry__trace_snprintf()
1841 he->weight * he->stat.nr_events); in hist_entry__global_weight_snprintf()
1874 he->ins_lat * he->stat.nr_events); in hist_entry__global_ins_lat_snprintf()
2374 he->mem_type = hist_entry__get_data_type(he); in sort__type_init()
3033 he->trace_output = get_trace_output(he); in update_dynamic_len()
[all …]
A Dblock-info.c137 if (!he->ms.map || !he->ms.sym) in block_info__process_sym()
141 al.map = he->ms.map; in block_info__process_sym()
142 al.sym = he->ms.sym; in block_info__process_sym()
212 struct hist_entry *he) in block_total_cycles_pct_entry() argument
285 struct hist_entry *he) in block_avg_cycles_entry() argument
299 struct hist_entry *he) in block_range_entry() argument
309 he->ms.sym); in block_range_entry()
312 he->ms.sym); in block_range_entry()
330 struct hist_entry *he) in block_dso_entry() argument
333 struct map *map = he->ms.map; in block_dso_entry()
[all …]
A Dhist.h160 struct hist_entry *he; member
323 return he->callchain_size != 0; in hist_entry__has_callchains()
328 return !list_empty(&he->pairs.node); in hist_entry__has_pairs()
333 if (hist_entry__has_pairs(he)) in hist_entry__next_pair()
339 struct hist_entry *he) in hist_entry__add_pair() argument
380 void hist_entry__delete(struct hist_entry *he);
437 u64 period = he->stat.period; in hist_entry__get_percent_limit()
444 period = he->stat_acc->period; in hist_entry__get_percent_limit()
495 struct hist_entry *he);
497 struct hist_entry *he);
[all …]
A Dsort.h123 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
125 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
126 void (*se_init)(struct hist_entry *he);
160 char *hist_entry__srcline(struct hist_entry *he);
A Dannotate-data.h231 int hist_entry__annotate_data_tty(struct hist_entry *he, struct evsel *evsel);
278 static inline int hist_entry__annotate_data_tty(struct hist_entry *he __maybe_unused, in hist_entry__annotate_data_tty()
295 int hist_entry__annotate_data_tui(struct hist_entry *he, struct evsel *evsel,
298 static inline int hist_entry__annotate_data_tui(struct hist_entry *he __maybe_unused, in hist_entry__annotate_data_tui()
A Dblock-info.h60 int block_info__process_sym(struct hist_entry *he, struct block_hist *bh,
74 float block_info__total_cycles_percent(struct hist_entry *he);
A Dstream.c98 static void update_hot_callchain(struct hist_entry *he, in update_hot_callchain() argument
101 struct rb_root *root = &he->sorted_chain; in update_hot_callchain()
117 struct hist_entry *he; in init_hot_callchain() local
119 he = rb_entry(next, struct hist_entry, rb_node); in init_hot_callchain()
120 update_hot_callchain(he, es); in init_hot_callchain()
121 next = rb_next(&he->rb_node); in init_hot_callchain()
A Dannotate.h102 struct sym_hist_entry he; member
424 int hist_entry__inc_addr_samples(struct hist_entry *he, struct perf_sample *sample,
470 int hist_entry__annotate_printf(struct hist_entry *he, struct evsel *evsel);
471 int hist_entry__tty_annotate(struct hist_entry *he, struct evsel *evsel);
472 int hist_entry__tty_annotate2(struct hist_entry *he, struct evsel *evsel);
552 struct annotated_data_type *hist_entry__get_data_type(struct hist_entry *he);
A Dannotate.c769 struct hist_entry *he; member
838 data->he.period); in annotation_line__print()
841 data->he.nr_samples); in annotation_line__print()
927 data->he.period = period; in calc_percent()
928 data->he.nr_samples = hits; in calc_percent()
1231 .he = he, in hist_entry__annotate_printf()
2735 .thread = he->thread, in __hist_entry__get_data_type()
2738 .cpumode = he->cpumode, in __hist_entry__get_data_type()
2777 he->stat.nr_events, in __hist_entry__get_data_type()
2778 he->stat.period); in __hist_entry__get_data_type()
[all …]
/tools/perf/
A Dbuiltin-diff.c282 double old_percent = period_percent(he, he->stat.period); in compute_delta()
375 return &bh->he; in block_hist_zalloc()
382 bh = container_of(he, struct block_hist, he); in block_hist_free()
628 he->block_info->cycles_aggr / he->block_info->num_aggr; in compute_cycles_diff()
693 bh = container_of(he, struct block_hist, he); in hists__precompute()
720 bh = container_of(he, struct block_hist, he); in hists__precompute()
1333 if (!he->dummy) in hpp__entry_baseline()
1366 he->ms.sym); in cycles_printf()
1398 bh = container_of(he, struct block_hist, he); in __hpp__color_compare()
1417 if (he->dummy) in __hpp__color_compare()
[all …]
A Dbuiltin-c2c.c178 c2c_he = container_of(he, struct c2c_hist_entry, he); in c2c_he_free()
211 c2c_he = container_of(he, struct c2c_hist_entry, he); in he__get_c2c_hists()
331 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event()
365 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event()
529 c2c_he = container_of(he, struct c2c_hist_entry, he); in dcacheline_node_entry()
543 c2c_he = container_of(he, struct c2c_hist_entry, he); in dcacheline_node_count()
604 c2c_he = container_of(he, struct c2c_hist_entry, he); in tot_hitm_entry()
2206 he->srcline = hist_entry__srcline(he); in filter_cb()
2584 he = cl_browser->he; in perf_c2c_cacheline_browser__title()
2603 browser->he = he; in c2c_cacheline_browser__new()
[all …]
A Dbuiltin-annotate.c177 struct hist_entry *he = iter->he; in hist_iter__branch_callback() local
183 bi = he->branch_info; in hist_iter__branch_callback()
244 struct hist_entry *he; in evsel__add_sample() local
276 if (he == NULL) in evsel__add_sample()
329 return hist_entry__tty_annotate2(he, evsel); in hist_entry__stdio_annotate()
331 return hist_entry__tty_annotate(he, evsel); in hist_entry__stdio_annotate()
424 if (he->ms.sym == NULL || dso__annotate_warned(map__dso(he->ms.map))) in hists__find_annotations()
442 notes = symbol__annotation(he->ms.sym); in hists__find_annotations()
454 if (he->mem_type->histograms == NULL) in hists__find_annotations()
504 int (*annotate)(struct hist_entry *he, in hists__find_annotations()
[all …]
A Dbuiltin-kvm.c165 event = container_of(he, struct kvm_event, he); \
215 event = container_of(he, struct kvm_event, he); in ev_entry_mean()
246 event = container_of(he, struct kvm_event, he); \
655 event = container_of(he, struct kvm_event, he); in clear_events_cache_stats()
711 kvm_ev = container_of(he, struct kvm_event, he); in kvm_he_free()
739 if (he == NULL) { in find_create_kvm_event()
745 event = container_of(he, struct kvm_event, he); in find_create_kvm_event()
993 event = container_of(he, struct kvm_event, he); in filter_cb()
996 he->filtered = 1; in filter_cb()
998 he->filtered = 0; in filter_cb()
[all …]
A Dbuiltin-top.c121 if (!he || !he->ms.sym) in perf_top__parse_source()
126 sym = he->ms.sym; in perf_top__parse_source()
127 map = he->ms.map; in perf_top__parse_source()
153 top->sym_filter_entry = he; in perf_top__parse_source()
166 struct symbol *sym = he->ms.sym; in __zero_source_counters()
199 struct hist_entry *he, in perf_top__record_precise_ip() argument
205 struct symbol *sym = he->ms.sym; in perf_top__record_precise_ip()
227 mutex_unlock(&he->hists->lock); in perf_top__record_precise_ip()
237 mutex_lock(&he->hists->lock); in perf_top__record_precise_ip()
249 if (!he) in perf_top__show_details()
[all …]
/tools/perf/ui/stdio/
A Dhist.c445 ret = fmt->color(fmt, hpp, he); in __hist_entry__snprintf()
447 ret = fmt->entry(fmt, hpp, he); in __hist_entry__snprintf()
458 return __hist_entry__snprintf(he, hpp, he->hists->hpp_list); in hist_entry__snprintf()
519 fmt->color(fmt, hpp, he); in hist_entry__hierarchy_fprintf()
521 fmt->entry(fmt, hpp, he); in hist_entry__hierarchy_fprintf()
531 if (he->leaf && hist_entry__has_callchains(he) && symbol_conf.use_callchain) { in hist_entry__hierarchy_fprintf()
546 struct block_hist *bh = container_of(he, struct block_hist, he); in hist_entry__block_fprintf()
557 hist_entry__snprintf(he, &hpp); in hist_entry__block_fprintf()
578 hist_entry__snprintf(he, &hpp); in hist_entry__individual_block_fprintf()
595 struct hists *hists = he->hists; in hist_entry__fprintf()
[all …]
/tools/perf/ui/browsers/
A Dhists.c74 if (he->leaf && he->unfolded) in hist_browser__get_folding()
280 if (he->leaf) in hierarchy_count_rows()
307 if (!he) in hist_entry__toggle_fold()
313 he->unfolded = !he->unfolded; in hist_entry__toggle_fold()
388 he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain); in hist_entry__init_have_children()
391 he->has_children = !RB_EMPTY_ROOT(&he->hroot_out.rb_root); in hist_entry__init_have_children()
477 he->nr_rows = hierarchy_count_rows(browser, he, false); in hist_browser__toggle_fold()
483 if (!he->leaf && he->nr_rows == 0) { in hist_browser__toggle_fold()
587 he->unfolded = unfold ? he->has_children : false; in hist_entry__set_folding()
2562 if (he == NULL || he->mem_type == NULL || he->mem_type->histograms == NULL) in add_annotate_type_opt()
[all …]
A Dannotate-data.c155 struct hist_entry *he = browser->b.priv; in annotated_data_browser__collect_entries() local
156 struct annotated_data_type *adt = he->mem_type; in annotated_data_browser__collect_entries()
157 struct evsel *evsel = hists_to_evsel(he->hists); in annotated_data_browser__collect_entries()
336 struct hist_entry *he = uib->priv; in browser__show() local
337 struct annotated_data_type *adt = he->mem_type; in browser__show()
343 adt->self.type_name, he->stat.nr_events); in browser__show()
392 struct hist_entry *he = uib->priv; in browser__write() local
393 struct annotated_data_type *adt = he->mem_type; in browser__write()
394 struct evsel *leader = hists_to_evsel(he->hists); in browser__write()
570 int hist_entry__annotate_data_tui(struct hist_entry *he, struct evsel *evsel, in hist_entry__annotate_data_tui() argument
[all …]
/tools/perf/ui/gtk/
A Dhists.c46 return he->stat._field; \
51 struct hist_entry *he) \
60 return he->stat_acc->_field; \
65 struct hist_entry *he) \
414 struct hist_entry *he; in perf_gtk__add_hierarchy_entries() local
426 if (he->filtered) in perf_gtk__add_hierarchy_entries()
442 fmt->color(fmt, hpp, he); in perf_gtk__add_hierarchy_entries()
444 fmt->entry(fmt, hpp, he); in perf_gtk__add_hierarchy_entries()
465 if (!he->leaf) { in perf_gtk__add_hierarchy_entries()
485 if (he->leaf && hist_entry__has_callchains(he) && symbol_conf.use_callchain) { in perf_gtk__add_hierarchy_entries()
[all …]
A Dgtk.h62 int hist_entry__gtk_annotate(struct hist_entry *he,
/tools/perf/ui/
A Dhist.c63 struct hists *hists = he->hists; in __hpp__fmt()
79 values[0].val = get_field(he); in __hpp__fmt()
80 values[0].samples = he->stat.nr_events; in __hpp__fmt()
143 struct hist_entry *he, hpp_field_fn get_field, in hpp__fmt_acc() argument
159 struct hists *hists = he->hists; in hpp__fmt_mem_stat()
505 return he->stat._field; \
533 return he->stat_acc->_field; \
561 return he->stat._field; \
581 return he->stat._field; \
601 struct hist_entry *he) \
[all …]

Completed in 895 milliseconds

12