| /linux-6.12.1/tools/perf/tests/ |
| D | hists_output.c | 97 struct hist_entry *he; in del_hist_entries() local
112 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
114 rb_erase_cached(&he->rb_node_in, root_in); in del_hist_entries()
115 hist_entry__delete(he); in del_hist_entries()
131 #define COMM(he) (thread__comm_str(he->thread)) argument
132 #define DSO(he) (dso__short_name(map__dso(he->ms.map))) argument
133 #define SYM(he) (he->ms.sym->name) argument
134 #define CPU(he) (he->cpu) argument
135 #define PID(he) (thread__tid(he->thread)) argument
142 struct hist_entry *he; in test1() local
[all …]
|
| D | hists_common.c | 177 struct hist_entry *he; in print_hists_in() local
179 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
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
208 he = rb_entry(node, struct hist_entry, rb_node); in print_hists_out()
210 if (!he->filtered) { in print_hists_out()
211 struct dso *dso = map__dso(he->ms.map); in print_hists_out()
[all …]
|
| D | hists_link.c | 70 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()
112 he = hists__add_entry(hists, &al, NULL, in add_hist_entries()
114 if (he == NULL) { in add_hist_entries()
176 struct hist_entry *he; in __validate_match() local
178 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_match()
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
[all …]
|
| D | hists_cumulate.c | 132 struct hist_entry *he; in del_hist_entries() local
147 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
149 rb_erase_cached(&he->rb_node_in, root_in); in del_hist_entries()
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
[all …]
|
| /linux-6.12.1/tools/perf/util/ |
| D | hist.c | 36 struct hist_entry *he);
38 struct hist_entry *he);
40 struct hist_entry *he);
42 struct hist_entry *he);
327 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
329 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry() argument
331 u64 prev_period = he->stat.period; in hists__decay_entry()
337 he_stat__decay(&he->stat); in hists__decay_entry()
339 he_stat__decay(he->stat_acc); in hists__decay_entry()
340 decay_callchain(he->callchain); in hists__decay_entry()
[all …]
|
| D | sort.c | 116 static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf, in hist_entry__thread_snprintf() argument
119 const char *comm = thread__comm_str(he->thread); in hist_entry__thread_snprintf()
122 return repsep_snprintf(bf, size, "%7d:%-*.*s", thread__tid(he->thread), in hist_entry__thread_snprintf()
126 static int hist_entry__thread_filter(struct hist_entry *he, int type, const void *arg) in hist_entry__thread_filter() argument
133 return th && !RC_CHK_EQUAL(he->thread, th); in hist_entry__thread_filter()
165 static int hist_entry__simd_snprintf(struct hist_entry *he, char *bf, in hist_entry__simd_snprintf() argument
170 if (!he->simd_flags.arch) in hist_entry__simd_snprintf()
173 name = hist_entry__get_simd_name(&he->simd_flags); in hist_entry__simd_snprintf()
175 if (he->simd_flags.pred & SIMD_OP_FLAGS_PRED_EMPTY) in hist_entry__simd_snprintf()
177 else if (he->simd_flags.pred & SIMD_OP_FLAGS_PRED_PARTIAL) in hist_entry__simd_snprintf()
[all …]
|
| D | block-info.c | 128 int block_info__process_sym(struct hist_entry *he, struct block_hist *bh, in block_info__process_sym() argument
137 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()
144 notes = symbol__annotation(he->ms.sym); in block_info__process_sym()
148 for (unsigned int i = 0; i < symbol__size(he->ms.sym); i++) { in block_info__process_sym()
157 init_block_info(bi, he->ms.sym, &ch[i], i, in block_info__process_sym()
160 hists_to_evsel(he->hists)); in block_info__process_sym()
212 struct hist_entry *he) in block_total_cycles_pct_entry() argument
215 struct block_info *bi = he->block_info; in block_total_cycles_pct_entry()
[all …]
|
| D | hist.h | 138 struct hist_entry *he; member
290 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he) in hist_entry__has_callchains() argument
292 return he->callchain_size != 0; in hist_entry__has_callchains()
295 static inline bool hist_entry__has_pairs(struct hist_entry *he) in hist_entry__has_pairs() argument
297 return !list_empty(&he->pairs.node); in hist_entry__has_pairs()
300 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he) in hist_entry__next_pair() argument
302 if (hist_entry__has_pairs(he)) in hist_entry__next_pair()
303 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node); in hist_entry__next_pair()
308 struct hist_entry *he) in hist_entry__add_pair() argument
310 list_add_tail(&pair->pairs.node, &he->pairs.head); in hist_entry__add_pair()
[all …]
|
| D | sort.h | 117 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-6.12.1/net/netfilter/ |
| D | nft_set_hash.c | 51 const struct nft_rhash_elem *he = data; in nft_rhash_obj() local
53 return jhash(nft_set_ext_key(&he->ext), len, seed); in nft_rhash_obj()
60 const struct nft_rhash_elem *he = ptr; in nft_rhash_cmp() local
62 if (memcmp(nft_set_ext_key(&he->ext), x->key, x->set->klen)) in nft_rhash_cmp()
64 if (nft_set_elem_is_dead(&he->ext)) in nft_rhash_cmp()
66 if (__nft_set_elem_expired(&he->ext, x->tstamp)) in nft_rhash_cmp()
68 if (!nft_set_elem_active(&he->ext, x->genmask)) in nft_rhash_cmp()
86 const struct nft_rhash_elem *he; in nft_rhash_lookup() local
94 he = rhashtable_lookup(&priv->ht, &arg, nft_rhash_params); in nft_rhash_lookup()
95 if (he != NULL) in nft_rhash_lookup()
[all …]
|
| /linux-6.12.1/tools/perf/ |
| D | builtin-diff.c | 272 static double period_percent(struct hist_entry *he, u64 period) in period_percent() argument
274 u64 total = hists__total_period(he->hists); in period_percent()
279 static double compute_delta(struct hist_entry *he, struct hist_entry *pair) in compute_delta() argument
281 double old_percent = period_percent(he, he->stat.period); in compute_delta()
289 static double compute_ratio(struct hist_entry *he, struct hist_entry *pair) in compute_ratio() argument
291 double old_period = he->stat.period ?: 1; in compute_ratio()
299 static s64 compute_wdiff(struct hist_entry *he, struct hist_entry *pair) in compute_wdiff() argument
301 u64 old_period = he->stat.period; in compute_wdiff()
311 static int formula_delta(struct hist_entry *he, struct hist_entry *pair, in formula_delta() argument
314 u64 he_total = he->hists->stats.total_period; in formula_delta()
[all …]
|
| D | builtin-c2c.c | 82 struct hist_entry he; member
165 return &c2c_he->he; in c2c_he_zalloc()
174 static void c2c_he_free(void *he) in c2c_he_free() argument
178 c2c_he = container_of(he, struct c2c_hist_entry, he); in c2c_he_free()
201 he__get_c2c_hists(struct hist_entry *he, in he__get_c2c_hists() argument
209 c2c_he = container_of(he, struct c2c_hist_entry, he); in he__get_c2c_hists()
285 struct hist_entry *he; in process_sample_event() local
323 he = hists__add_entry_ops(&c2c_hists->hists, &c2c_entry_ops, in process_sample_event()
326 if (he == NULL) in process_sample_event()
329 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event()
[all …]
|
| D | builtin-annotate.c | 176 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
274 he = hists__add_entry(hists, al, NULL, NULL, NULL, NULL, sample, true); in evsel__add_sample()
275 if (he == NULL) in evsel__add_sample()
278 ret = hist_entry__inc_addr_samples(he, sample, evsel, al->addr); in evsel__add_sample()
323 static int hist_entry__tty_annotate(struct hist_entry *he, in hist_entry__tty_annotate() argument
328 return symbol__tty_annotate(&he->ms, evsel); in hist_entry__tty_annotate()
330 return symbol__tty_annotate2(&he->ms, evsel); in hist_entry__tty_annotate()
420 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations() local
[all …]
|
| D | builtin-kvm.c | 95 struct hist_entry *he);
118 struct hist_entry *he) in ev_name_entry() argument
120 int width = fmt_width(fmt, hpp, he->hists); in ev_name_entry()
122 return scnprintf(hpp->buf, hpp->size, "%*s", width, he->kvm_info->name); in ev_name_entry()
142 event_left = container_of(left, struct kvm_event, he); \
143 event_right = container_of(right, struct kvm_event, he); \
159 struct hist_entry *he) \
162 int width = fmt_width(fmt, hpp, he->hists); \
165 event = container_of(he, struct kvm_event, he); \
209 struct hist_entry *he) in ev_entry_mean() argument
[all …]
|
| D | builtin-top.c | 111 static int perf_top__parse_source(struct perf_top *top, struct hist_entry *he) in perf_top__parse_source() argument
120 if (!he || !he->ms.sym) in perf_top__parse_source()
123 evsel = hists_to_evsel(he->hists); 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()
150 err = symbol__annotate(&he->ms, evsel, NULL); in perf_top__parse_source()
152 top->sym_filter_entry = he; in perf_top__parse_source()
155 symbol__strerror_disassemble(&he->ms, err, msg, sizeof(msg)); in perf_top__parse_source()
163 static void __zero_source_counters(struct hist_entry *he) in __zero_source_counters() argument
165 struct symbol *sym = he->ms.sym; in __zero_source_counters()
[all …]
|
| /linux-6.12.1/drivers/net/wireless/mediatek/mt76/ |
| D | mt76_connac3_mac.c | 17 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()
130 he->data3 = HE_PREP(DATA3_BSS_COLOR, BSS_COLOR, rxv[9]) | in mt76_connac3_mac_decode_he_radiotap()
132 he->data4 = HE_PREP(DATA4_SU_MU_SPTL_REUSE, SR_MASK, rxv[13]); in mt76_connac3_mac_decode_he_radiotap()
133 he->data5 = HE_PREP(DATA5_PE_DISAMBIG, PE_DISAMBIG, rxv[5]) | in mt76_connac3_mac_decode_he_radiotap()
137 he->data5 |= HE_BITS(DATA5_TXBF); in mt76_connac3_mac_decode_he_radiotap()
[all …]
|
| /linux-6.12.1/tools/perf/ui/browsers/ |
| D | hists.c | 71 struct hist_entry *he = in hist_browser__get_folding() local
74 if (he->leaf && he->unfolded) in hist_browser__get_folding()
75 unfolded_rows += he->nr_rows; in hist_browser__get_folding()
162 static char hist_entry__folded(const struct hist_entry *he) in hist_entry__folded() argument
164 return he->has_children ? tree__folded_sign(he->unfolded) : ' '; in hist_entry__folded()
273 static int hierarchy_count_rows(struct hist_browser *hb, struct hist_entry *he, in hierarchy_count_rows() argument
280 if (he->leaf) in hierarchy_count_rows()
281 return callchain__count_rows(&he->sorted_chain); in hierarchy_count_rows()
283 if (he->has_no_entry) in hierarchy_count_rows()
286 node = rb_first_cached(&he->hroot_out); in hierarchy_count_rows()
[all …]
|
| D | annotate-data.c | 155 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-6.12.1/tools/perf/ui/stdio/ |
| D | hist.c | 381 static size_t hist_entry_callchain__fprintf(struct hist_entry *he, in hist_entry_callchain__fprintf() argument
385 u64 parent_samples = he->stat.period; in hist_entry_callchain__fprintf()
388 parent_samples = he->stat_acc->period; in hist_entry_callchain__fprintf()
392 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, in hist_entry_callchain__fprintf()
396 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, in hist_entry_callchain__fprintf()
400 return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples); in hist_entry_callchain__fprintf()
403 return callchain__fprintf_folded(fp, &he->sorted_chain, total_samples); in hist_entry_callchain__fprintf()
414 int __hist_entry__snprintf(struct hist_entry *he, struct perf_hpp *hpp, in __hist_entry__snprintf() argument
423 if (symbol_conf.exclude_other && !he->parent) in __hist_entry__snprintf()
427 if (perf_hpp__should_skip(fmt, he->hists)) in __hist_entry__snprintf()
[all …]
|
| /linux-6.12.1/net/mac80211/ |
| D | spectmgmt.c | 153 } __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()
174 he._6ghz_oper.ccfs0 = ieee80211_frequency_to_channel(center_freq1); 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()
181 he._6ghz_oper.ccfs0 += control_freq < center_freq1 ? -16 : 16; in validate_chandef_by_6ghz_he_eht_oper()
182 he._6ghz_oper.control = IEEE80211_EHT_OPER_CHAN_WIDTH_320MHZ; 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()
186 he._6ghz_oper.ccfs0 += control_freq < center_freq1 ? -8 : 8; in validate_chandef_by_6ghz_he_eht_oper()
[all …]
|
| /linux-6.12.1/kernel/locking/ |
| D | qspinlock_paravirt.h | 203 #define for_each_hash_entry(he, offset, hash) \ argument
204 for (hash &= ~(PV_HE_PER_LINE - 1), he = &pv_lock_hash[hash], offset = 0; \
206 offset++, he = &pv_lock_hash[(hash + offset) & ((1 << pv_lock_hash_bits) - 1)])
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()
[all …]
|
| /linux-6.12.1/tools/perf/ui/gtk/ |
| D | hists.c | 44 static u64 he_get_##_field(struct hist_entry *he) \
46 return he->stat._field; \
51 struct hist_entry *he) \
53 return hpp__fmt(fmt, hpp, he, he_get_##_field, " %*.2f%%", \
58 static u64 he_get_acc_##_field(struct hist_entry *he) \
60 return he->stat_acc->_field; \
65 struct hist_entry *he) \
67 return hpp__fmt_acc(fmt, hpp, he, he_get_acc_##_field, " %*.2f%%", \
414 struct hist_entry *he; in perf_gtk__add_hierarchy_entries() local
425 he = rb_entry(node, struct hist_entry, rb_node); in perf_gtk__add_hierarchy_entries()
[all …]
|
| /linux-6.12.1/tools/perf/ui/ |
| D | hist.c | 55 static int __hpp__fmt(struct perf_hpp *hpp, struct hist_entry *he, in __hpp__fmt() argument
60 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()
85 list_for_each_entry(pair, &he->pairs.head, pairs.node) { 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()
136 return __hpp__fmt(hpp, he, get_field, fmtstr, len, print_fn, fmtype); in hpp__fmt()
140 struct hist_entry *he, hpp_field_fn get_field, in hpp__fmt_acc() argument
149 return hpp__fmt(fmt, hpp, he, get_field, fmtstr, print_fn, fmtype); in hpp__fmt_acc()
[all …]
|
| /linux-6.12.1/include/linux/ |
| D | rhashtable.h | 114 const struct rhash_head *he) in rht_obj() argument
116 return (char *)he - ht->p.head_offset; in rht_obj()
166 const struct rhash_head *he, const struct rhashtable_params params) in rht_head_hashfn() argument
168 const char *ptr = rht_obj(ht, he); in rht_head_hashfn()
599 struct rhash_head *he; in __rhashtable_lookup() local
607 rht_for_each_rcu_from(he, rht_ptr_rcu(bkt), tbl, hash) { in __rhashtable_lookup()
609 params.obj_cmpfn(&arg, rht_obj(ht, he)) : in __rhashtable_lookup()
610 rhashtable_compare(&arg, rht_obj(ht, he))) in __rhashtable_lookup()
612 return he; in __rhashtable_lookup()
617 } while (he != RHT_NULLS_MARKER(bkt)); in __rhashtable_lookup()
[all …]
|
| /linux-6.12.1/Documentation/core-api/ |
| D | errseq.rst | 49 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
56 just want to know when he's finished all of the work they've handed him so
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
[all …]
|