Home
last modified time | relevance | path

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

123456

/linux/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 …]
/linux/tools/perf/util/
A Dhist.c454 memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); in hist_entry__init()
460 he->ms.map = map__get(he->ms.map); in hist_entry__init()
491 he->raw_data = memdup(he->raw_data, he->raw_size); in hist_entry__init()
872 iter->he = he; in iter_add_single_mem_entry()
975 iter->he = he; in iter_add_next_branch_entry()
1020 iter->he = he; in iter_add_single_normal_entry()
1085 iter->he = he; in iter_add_single_cumulative_entry()
1188 iter->he = he; in iter_add_next_cumulative_entry()
2051 he = he->parent_he; in __rb_hierarchy_next()
2068 he = he->parent_he; in rb_hierarchy_prev()
[all …]
A Dsort.c400 return _hist_entry__sym_snprintf(&he->ms, he->ip, in hist_entry__sym_snprintf()
473 return map__srcline(he->ms.map, he->ip, he->ms.sym); in hist_entry__srcline()
509 he->srcline = hist_entry__srcline(he); in sort__srcline_init()
731 he->srcfile = hist_entry__get_srcfile(he); in sort__srcfile_init()
990 he->trace_output = get_trace_output(he); in hist_entry__trace_snprintf()
1669 he->weight * he->stat.nr_events); in hist_entry__global_weight_snprintf()
1702 he->ins_lat * he->stat.nr_events); in hist_entry__global_ins_lat_snprintf()
1722 he->p_stage_cyc * he->stat.nr_events); in hist_entry__global_p_stage_cyc_snprintf()
2203 he->mem_type = hist_entry__get_data_type(he); in sort__type_init()
2833 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.h138 struct hist_entry *he; member
292 return he->callchain_size != 0; in hist_entry__has_callchains()
297 return !list_empty(&he->pairs.node); in hist_entry__has_pairs()
302 if (hist_entry__has_pairs(he)) in hist_entry__next_pair()
308 struct hist_entry *he) in hist_entry__add_pair() argument
351 void hist_entry__delete(struct hist_entry *he);
405 u64 period = he->stat.period; in hist_entry__get_percent_limit()
412 period = he->stat_acc->period; in hist_entry__get_percent_limit()
460 struct hist_entry *he);
462 struct hist_entry *he);
[all …]
A Dsort.h117 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
119 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
120 void (*se_init)(struct hist_entry *he);
154 char *hist_entry__srcline(struct hist_entry *he);
/linux/net/netfilter/
A Dnft_set_hash.c95 if (he != NULL) in nft_rhash_lookup()
96 *ext = &he->ext; in nft_rhash_lookup()
98 return !!he; in nft_rhash_lookup()
115 if (he != NULL) in nft_rhash_get()
116 return &he->priv; in nft_rhash_get()
141 if (he != NULL) in nft_rhash_update()
158 he = prev; in nft_rhash_update()
162 *ext = &he->ext; in nft_rhash_update()
229 if (he) in nft_rhash_deactivate()
234 return &he->priv; in nft_rhash_deactivate()
[all …]
/linux/tools/perf/
A Dbuiltin-diff.c281 double old_percent = period_percent(he, he->stat.period); in compute_delta()
374 return &bh->he; in block_hist_zalloc()
381 bh = container_of(he, struct block_hist, he); in block_hist_free()
627 he->block_info->cycles_aggr / he->block_info->num_aggr; in compute_cycles_diff()
692 bh = container_of(he, struct block_hist, he); in hists__precompute()
719 bh = container_of(he, struct block_hist, he); in hists__precompute()
1332 if (!he->dummy) in hpp__entry_baseline()
1365 he->ms.sym); in cycles_printf()
1397 bh = container_of(he, struct block_hist, he); in __hpp__color_compare()
1416 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()
209 c2c_he = container_of(he, struct c2c_hist_entry, he); in he__get_c2c_hists()
329 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event()
363 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event()
527 c2c_he = container_of(he, struct c2c_hist_entry, he); in dcacheline_node_entry()
541 c2c_he = container_of(he, struct c2c_hist_entry, he); in dcacheline_node_count()
602 c2c_he = container_of(he, struct c2c_hist_entry, he); in tot_hitm_entry()
2199 he->srcline = hist_entry__srcline(he); in filter_cb()
2575 he = cl_browser->he; in perf_c2c_cacheline_browser__title()
2594 browser->he = he; in c2c_cacheline_browser__new()
[all …]
A Dbuiltin-annotate.c176 struct hist_entry *he = iter->he; in hist_iter__branch_callback() local
182 bi = he->branch_info; in hist_iter__branch_callback()
243 struct hist_entry *he; in evsel__add_sample() local
275 if (he == NULL) in evsel__add_sample()
328 return symbol__tty_annotate(&he->ms, evsel); in hist_entry__tty_annotate()
423 if (he->ms.sym == NULL || dso__annotate_warned(map__dso(he->ms.map))) in hists__find_annotations()
441 notes = symbol__annotation(he->ms.sym); in hists__find_annotations()
453 if (he->mem_type->histograms == NULL) in hists__find_annotations()
503 int (*annotate)(struct hist_entry *he, in hists__find_annotations()
514 ret = annotate(he, evsel, NULL); 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); \
716 event = container_of(he, struct kvm_event, he); in clear_events_cache_stats()
772 kvm_ev = container_of(he, struct kvm_event, he); in kvm_he_free()
800 if (he == NULL) { in find_create_kvm_event()
806 event = container_of(he, struct kvm_event, he); in find_create_kvm_event()
1054 event = container_of(he, struct kvm_event, he); in filter_cb()
1057 he->filtered = 1; in filter_cb()
1059 he->filtered = 0; in filter_cb()
[all …]
A Dbuiltin-top.c120 if (!he || !he->ms.sym) in perf_top__parse_source()
125 sym = he->ms.sym; in perf_top__parse_source()
126 map = he->ms.map; in perf_top__parse_source()
152 top->sym_filter_entry = he; in perf_top__parse_source()
165 struct symbol *sym = he->ms.sym; in __zero_source_counters()
198 struct hist_entry *he, in perf_top__record_precise_ip() argument
204 struct symbol *sym = he->ms.sym; in perf_top__record_precise_ip()
226 mutex_unlock(&he->hists->lock); in perf_top__record_precise_ip()
236 mutex_lock(&he->hists->lock); in perf_top__record_precise_ip()
248 if (!he) in perf_top__show_details()
[all …]
/linux/drivers/net/wireless/mediatek/mt76/
A Dmt76_connac3_mac.c17 struct ieee80211_radiotap_he *he, in mt76_connac3_mac_decode_he_radiotap_ru() argument
53 he->data1 |= HE_BITS(DATA1_BW_RU_ALLOC_KNOWN); in mt76_connac3_mac_decode_he_radiotap_ru()
54 he->data2 |= HE_BITS(DATA2_RU_OFFSET_KNOWN) | in mt76_connac3_mac_decode_he_radiotap_ru()
123 struct ieee80211_radiotap_he *he; in mt76_connac3_mac_decode_he_radiotap() local
127 he = skb_push(skb, sizeof(known)); in mt76_connac3_mac_decode_he_radiotap()
128 memcpy(he, &known, sizeof(known)); in mt76_connac3_mac_decode_he_radiotap()
137 he->data5 |= HE_BITS(DATA5_TXBF); in mt76_connac3_mac_decode_he_radiotap()
143 he->data1 |= HE_BITS(DATA1_FORMAT_SU) | in mt76_connac3_mac_decode_he_radiotap()
152 he->data1 |= HE_BITS(DATA1_FORMAT_EXT_SU) | in mt76_connac3_mac_decode_he_radiotap()
159 he->data1 |= HE_BITS(DATA1_FORMAT_MU) | in mt76_connac3_mac_decode_he_radiotap()
[all …]
/linux/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()
464 if (he->leaf) in hist_browser__toggle_fold()
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()
[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()
569 int hist_entry__annotate_data_tui(struct hist_entry *he, struct evsel *evsel, in hist_entry__annotate_data_tui() argument
[all …]
/linux/tools/perf/ui/stdio/
A Dhist.c441 ret = fmt->color(fmt, hpp, he); in __hist_entry__snprintf()
443 ret = fmt->entry(fmt, hpp, he); in __hist_entry__snprintf()
454 return __hist_entry__snprintf(he, hpp, he->hists->hpp_list); in hist_entry__snprintf()
515 fmt->color(fmt, hpp, he); in hist_entry__hierarchy_fprintf()
517 fmt->entry(fmt, hpp, he); in hist_entry__hierarchy_fprintf()
527 if (he->leaf && hist_entry__has_callchains(he) && symbol_conf.use_callchain) { in hist_entry__hierarchy_fprintf()
542 struct block_hist *bh = container_of(he, struct block_hist, he); in hist_entry__block_fprintf()
553 hist_entry__snprintf(he, &hpp); in hist_entry__block_fprintf()
574 hist_entry__snprintf(he, &hpp); in hist_entry__individual_block_fprintf()
591 struct hists *hists = he->hists; in hist_entry__fprintf()
[all …]
/linux/net/mac80211/
A Dspectmgmt.c153 } __packed he; in validate_chandef_by_6ghz_he_eht_oper() local
170 he._oper.he_oper_params = in validate_chandef_by_6ghz_he_eht_oper()
172 he._6ghz_oper.primary = in validate_chandef_by_6ghz_he_eht_oper()
175 he._6ghz_oper.ccfs1 = center_freq2 ? in validate_chandef_by_6ghz_he_eht_oper()
180 he._6ghz_oper.ccfs1 = he._6ghz_oper.ccfs0; in validate_chandef_by_6ghz_he_eht_oper()
185 he._6ghz_oper.ccfs1 = he._6ghz_oper.ccfs0; in validate_chandef_by_6ghz_he_eht_oper()
189 he._6ghz_oper.control = in validate_chandef_by_6ghz_he_eht_oper()
193 he._6ghz_oper.control = in validate_chandef_by_6ghz_he_eht_oper()
197 he._6ghz_oper.control = in validate_chandef_by_6ghz_he_eht_oper()
201 he._6ghz_oper.control = in validate_chandef_by_6ghz_he_eht_oper()
[all …]
/linux/kernel/locking/
A Dqspinlock_paravirt.h203 #define for_each_hash_entry(he, offset, hash) \ argument
211 struct pv_hash_entry *he; in pv_hash() local
214 for_each_hash_entry(he, offset, hash) { in pv_hash()
217 if (try_cmpxchg(&he->lock, &old, lock)) { in pv_hash()
218 WRITE_ONCE(he->node, node); in pv_hash()
220 return &he->lock; in pv_hash()
239 struct pv_hash_entry *he; in pv_unhash() local
242 for_each_hash_entry(he, offset, hash) { in pv_unhash()
243 if (READ_ONCE(he->lock) == lock) { in pv_unhash()
244 node = READ_ONCE(he->node); in pv_unhash()
[all …]
/linux/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 …]
/linux/tools/perf/ui/
A Dhist.c60 struct hists *hists = he->hists; in __hpp__fmt()
76 values[0].val = get_field(he); in __hpp__fmt()
77 values[0].samples = he->stat.nr_events; in __hpp__fmt()
120 struct hist_entry *he, hpp_field_fn get_field, in hpp__fmt() argument
127 return __hpp__fmt(hpp, he, get_field, fmtstr, 1, in hpp__fmt()
140 struct hist_entry *he, hpp_field_fn get_field, in hpp__fmt_acc() argument
360 static u64 he_get_##_field(struct hist_entry *he) \
362 return he->stat._field; \
390 return he->stat_acc->_field; \
418 return he->stat._field; \
[all …]
/linux/include/linux/
A Drhashtable.h114 const struct rhash_head *he) in rht_obj() argument
599 struct rhash_head *he; in __rhashtable_lookup() local
612 return he; in __rhashtable_lookup()
648 return he ? rht_obj(ht, he) : NULL; in rhashtable_lookup()
698 return he ? container_of(he, struct rhlist_head, rhead) : NULL; in rhltable_lookup()
1002 struct rhash_head *he; in __rhashtable_remove_fast_one() local
1019 if (he != obj) { in __rhashtable_remove_fast_one()
1022 pprev = &he->next; in __rhashtable_remove_fast_one()
1155 struct rhash_head *he; in __rhashtable_replace_fast() local
1175 if (he != obj_old) { in __rhashtable_replace_fast()
[all …]
/linux/Documentation/core-api/
A Derrseq.rst49 Let me tell you a story about a worker drone. Now, he's a good worker
52 from out of town and he's sure to test the poor fellow too.
54 They're all handing him work to do -- so much he can't keep track of who
57 far and whether he made any mistakes since they last asked.
60 but he can't keep track of things at that level of detail, all he can
61 remember is the most recent mistake that he made.
90 whether he made any mistakes on any of it::
100 glitches and he makes a mistake. He sighs a heavy sigh, and marks it
110 Note that the supervisors can't tell how many mistakes he made, only
116 full-time like the supervisors, but he does need to know whether a
[all …]

Completed in 113 milliseconds

123456