Home
last modified time | relevance | path

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

1234

/Linux-v5.4/tools/perf/tests/
Dhists_output.c94 struct hist_entry *he; in del_hist_entries() local
109 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
111 rb_erase_cached(&he->rb_node_in, root_in); in del_hist_entries()
112 hist_entry__delete(he); in del_hist_entries()
118 #define COMM(he) (thread__comm_str(he->thread)) argument
119 #define DSO(he) (he->ms.map->dso->short_name) argument
120 #define SYM(he) (he->ms.sym->name) argument
121 #define CPU(he) (he->cpu) argument
122 #define PID(he) (he->thread->tid) argument
129 struct hist_entry *he; in test1() local
[all …]
Dhists_common.c177 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()
183 i, thread__comm_str(he->thread), in print_hists_in()
184 he->ms.map->dso->short_name, in print_hists_in()
185 he->ms.sym->name, he->stat.period); in print_hists_in()
204 struct hist_entry *he; in print_hists_out() local
206 he = rb_entry(node, struct hist_entry, rb_node); in print_hists_out()
208 if (!he->filtered) { in print_hists_out()
210 i, thread__comm_str(he->thread), he->thread->tid, in print_hists_out()
[all …]
Dhists_link.c68 struct hist_entry *he; in add_hist_entries() local
89 he = hists__add_entry(hists, &al, NULL, in add_hist_entries()
91 if (he == NULL) { in add_hist_entries()
108 he = hists__add_entry(hists, &al, NULL, in add_hist_entries()
110 if (he == NULL) { in add_hist_entries()
157 struct hist_entry *he; in __validate_match() local
159 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_match()
161 if (hist_entry__has_pairs(he)) { in __validate_match()
164 he->thread, he->ms.map, he->ms.sym)) { in __validate_match()
209 struct hist_entry *he; in __validate_link() local
[all …]
Dhists_cumulate.c128 struct hist_entry *he; in del_hist_entries() local
143 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
145 rb_erase_cached(&he->rb_node_in, root_in); in del_hist_entries()
146 hist_entry__delete(he); in del_hist_entries()
152 #define COMM(he) (thread__comm_str(he->thread)) argument
153 #define DSO(he) (he->ms.map->dso->short_name) argument
154 #define SYM(he) (he->ms.sym->name) argument
155 #define CPU(he) (he->cpu) argument
156 #define PID(he) (he->thread->tid) argument
157 #define DEPTH(he) (he->callchain->max_depth) argument
[all …]
/Linux-v5.4/tools/perf/util/
Dhist.c32 struct hist_entry *he);
34 struct hist_entry *he);
36 struct hist_entry *he);
38 struct hist_entry *he);
296 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
298 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry() argument
300 u64 prev_period = he->stat.period; in hists__decay_entry()
306 he_stat__decay(&he->stat); in hists__decay_entry()
308 he_stat__decay(he->stat_acc); in hists__decay_entry()
309 decay_callchain(he->callchain); in hists__decay_entry()
[all …]
Dsort.c97 static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf, in hist_entry__thread_snprintf() argument
100 const char *comm = thread__comm_str(he->thread); in hist_entry__thread_snprintf()
103 return repsep_snprintf(bf, size, "%7d:%-*.*s", he->thread->tid, in hist_entry__thread_snprintf()
107 static int hist_entry__thread_filter(struct hist_entry *he, int type, const void *arg) in hist_entry__thread_filter() argument
114 return th && he->thread != th; in hist_entry__thread_filter()
150 static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf, in hist_entry__comm_snprintf() argument
153 return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm)); in hist_entry__comm_snprintf()
206 static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf, in hist_entry__dso_snprintf() argument
209 return _hist_entry__dso_snprintf(he->ms.map, bf, size, width); in hist_entry__dso_snprintf()
212 static int hist_entry__dso_filter(struct hist_entry *he, int type, const void *arg) in hist_entry__dso_filter() argument
[all …]
Dsort.h158 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he) in hist_entry__has_callchains() argument
160 return he->callchain_size != 0; in hist_entry__has_callchains()
163 static inline bool hist_entry__has_pairs(struct hist_entry *he) in hist_entry__has_pairs() argument
165 return !list_empty(&he->pairs.node); in hist_entry__has_pairs()
168 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he) in hist_entry__next_pair() argument
170 if (hist_entry__has_pairs(he)) in hist_entry__next_pair()
171 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node); in hist_entry__next_pair()
176 struct hist_entry *he) in hist_entry__add_pair() argument
178 list_add_tail(&pair->pairs.node, &he->pairs.head); in hist_entry__add_pair()
181 static inline float hist_entry__get_percent_limit(struct hist_entry *he) in hist_entry__get_percent_limit() argument
[all …]
Dhist.h122 struct hist_entry *he; member
167 int hist_entry__sort_snprintf(struct hist_entry *he, char *bf, size_t size,
169 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
171 void hist_entry__delete(struct hist_entry *he);
173 typedef int (*hists__resort_cb_t)(struct hist_entry *he, void *arg);
215 void hists__calc_col_len(struct hists *hists, struct hist_entry *he);
263 struct hist_entry *he);
265 struct hist_entry *he);
386 int hist_entry__filter(struct hist_entry *he, int type, const void *arg);
406 typedef u64 (*hpp_field_fn)(struct hist_entry *he);
[all …]
/Linux-v5.4/net/netfilter/
Dnft_set_hash.c49 const struct nft_rhash_elem *he = data; in nft_rhash_obj() local
51 return jhash(nft_set_ext_key(&he->ext), len, seed); in nft_rhash_obj()
58 const struct nft_rhash_elem *he = ptr; in nft_rhash_cmp() local
60 if (memcmp(nft_set_ext_key(&he->ext), x->key, x->set->klen)) in nft_rhash_cmp()
62 if (nft_set_elem_expired(&he->ext)) in nft_rhash_cmp()
64 if (!nft_set_elem_active(&he->ext, x->genmask)) in nft_rhash_cmp()
81 const struct nft_rhash_elem *he; in nft_rhash_lookup() local
88 he = rhashtable_lookup(&priv->ht, &arg, nft_rhash_params); in nft_rhash_lookup()
89 if (he != NULL) in nft_rhash_lookup()
90 *ext = &he->ext; in nft_rhash_lookup()
[all …]
/Linux-v5.4/tools/perf/
Dbuiltin-c2c.c77 struct hist_entry he; member
155 return &c2c_he->he; in c2c_he_zalloc()
158 static void c2c_he_free(void *he) in c2c_he_free() argument
162 c2c_he = container_of(he, struct c2c_hist_entry, he); in c2c_he_free()
185 he__get_c2c_hists(struct hist_entry *he, in he__get_c2c_hists() argument
193 c2c_he = container_of(he, struct c2c_hist_entry, he); in he__get_c2c_hists()
265 struct hist_entry *he; in process_sample_event() local
294 he = hists__add_entry_ops(&c2c_hists->hists, &c2c_entry_ops, in process_sample_event()
297 if (he == NULL) in process_sample_event()
300 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event()
[all …]
Dbuiltin-diff.c262 static double period_percent(struct hist_entry *he, u64 period) in period_percent() argument
264 u64 total = hists__total_period(he->hists); in period_percent()
269 static double compute_delta(struct hist_entry *he, struct hist_entry *pair) in compute_delta() argument
271 double old_percent = period_percent(he, he->stat.period); in compute_delta()
279 static double compute_ratio(struct hist_entry *he, struct hist_entry *pair) in compute_ratio() argument
281 double old_period = he->stat.period ?: 1; in compute_ratio()
289 static s64 compute_wdiff(struct hist_entry *he, struct hist_entry *pair) in compute_wdiff() argument
291 u64 old_period = he->stat.period; in compute_wdiff()
301 static int formula_delta(struct hist_entry *he, struct hist_entry *pair, in formula_delta() argument
304 u64 he_total = he->hists->stats.total_period; in formula_delta()
[all …]
Dbuiltin-annotate.c160 struct hist_entry *he = iter->he; in hist_iter__branch_callback() local
166 bi = he->branch_info; in hist_iter__branch_callback()
222 struct hist_entry *he; in perf_evsel__add_sample() local
252 he = hists__add_entry(hists, al, NULL, NULL, NULL, sample, true); in perf_evsel__add_sample()
253 if (he == NULL) in perf_evsel__add_sample()
256 ret = hist_entry__inc_addr_samples(he, sample, evsel, al->addr); in perf_evsel__add_sample()
299 static int hist_entry__tty_annotate(struct hist_entry *he, in hist_entry__tty_annotate() argument
304 return symbol__tty_annotate(he->ms.sym, he->ms.map, evsel, &ann->opts); in hist_entry__tty_annotate()
306 return symbol__tty_annotate2(he->ms.sym, he->ms.map, evsel, &ann->opts); in hist_entry__tty_annotate()
317 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations() local
[all …]
Dbuiltin-top.c107 static int perf_top__parse_source(struct perf_top *top, struct hist_entry *he) in perf_top__parse_source() argument
115 if (!he || !he->ms.sym) in perf_top__parse_source()
118 evsel = hists_to_evsel(he->hists); in perf_top__parse_source()
120 sym = he->ms.sym; in perf_top__parse_source()
121 map = he->ms.map; in perf_top__parse_source()
147 top->sym_filter_entry = he; in perf_top__parse_source()
158 static void __zero_source_counters(struct hist_entry *he) in __zero_source_counters() argument
160 struct symbol *sym = he->ms.sym; in __zero_source_counters()
192 struct hist_entry *he, in perf_top__record_precise_ip() argument
197 struct symbol *sym = he->ms.sym; in perf_top__record_precise_ip()
[all …]
Dbuiltin-report.c141 struct hist_entry *he = iter->he; in hist_iter__report_callback() local
151 bi = he->branch_info; in hist_iter__report_callback()
159 mi = he->mem_info; in hist_iter__report_callback()
164 err = hist_entry__inc_addr_samples(he, sample, evsel, al->addr); in hist_iter__report_callback()
168 err = hist_entry__inc_addr_samples(he, sample, evsel, al->addr); in hist_iter__report_callback()
170 err = hist_entry__inc_addr_samples(he, sample, evsel, al->addr); in hist_iter__report_callback()
182 struct hist_entry *he = iter->he; in hist_iter__branch_callback() local
192 bi = he->branch_info; in hist_iter__branch_callback()
634 static int hists__resort_cb(struct hist_entry *he, void *arg) in hists__resort_cb() argument
637 struct symbol *sym = he->ms.sym; in hists__resort_cb()
[all …]
/Linux-v5.4/tools/perf/ui/browsers/
Dhists.c67 struct hist_entry *he = in hist_browser__get_folding() local
70 if (he->leaf && he->unfolded) in hist_browser__get_folding()
71 unfolded_rows += he->nr_rows; in hist_browser__get_folding()
158 static char hist_entry__folded(const struct hist_entry *he) in hist_entry__folded() argument
160 return he->has_children ? tree__folded_sign(he->unfolded) : ' '; in hist_entry__folded()
269 static int hierarchy_count_rows(struct hist_browser *hb, struct hist_entry *he, in hierarchy_count_rows() argument
276 if (he->leaf) in hierarchy_count_rows()
277 return callchain__count_rows(&he->sorted_chain); in hierarchy_count_rows()
279 if (he->has_no_entry) in hierarchy_count_rows()
282 node = rb_first_cached(&he->hroot_out); in hierarchy_count_rows()
[all …]
/Linux-v5.4/tools/perf/ui/stdio/
Dhist.c380 static size_t hist_entry_callchain__fprintf(struct hist_entry *he, in hist_entry_callchain__fprintf() argument
384 u64 parent_samples = he->stat.period; in hist_entry_callchain__fprintf()
387 parent_samples = he->stat_acc->period; in hist_entry_callchain__fprintf()
391 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, in hist_entry_callchain__fprintf()
395 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, in hist_entry_callchain__fprintf()
399 return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples); in hist_entry_callchain__fprintf()
402 return callchain__fprintf_folded(fp, &he->sorted_chain, total_samples); in hist_entry_callchain__fprintf()
413 int __hist_entry__snprintf(struct hist_entry *he, struct perf_hpp *hpp, in __hist_entry__snprintf() argument
422 if (symbol_conf.exclude_other && !he->parent) in __hist_entry__snprintf()
426 if (perf_hpp__should_skip(fmt, he->hists)) in __hist_entry__snprintf()
[all …]
/Linux-v5.4/kernel/locking/
Dqspinlock_paravirt.h207 #define for_each_hash_entry(he, offset, hash) \ argument
208 for (hash &= ~(PV_HE_PER_LINE - 1), he = &pv_lock_hash[hash], offset = 0; \
210 offset++, he = &pv_lock_hash[(hash + offset) & ((1 << pv_lock_hash_bits) - 1)])
215 struct pv_hash_entry *he; in pv_hash() local
218 for_each_hash_entry(he, offset, hash) { in pv_hash()
220 if (!cmpxchg(&he->lock, NULL, lock)) { in pv_hash()
221 WRITE_ONCE(he->node, node); in pv_hash()
223 return &he->lock; in pv_hash()
242 struct pv_hash_entry *he; in pv_unhash() local
245 for_each_hash_entry(he, offset, hash) { in pv_unhash()
[all …]
/Linux-v5.4/tools/perf/ui/gtk/
Dhists.c44 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-v5.4/tools/perf/ui/
Dhist.c25 static int __hpp__fmt(struct perf_hpp *hpp, struct hist_entry *he, in __hpp__fmt() argument
30 struct hists *hists = he->hists; in __hpp__fmt()
40 percent = 100.0 * get_field(he) / total; in __hpp__fmt()
44 ret = hpp__call_print_fn(hpp, print_fn, fmt, len, get_field(he)); in __hpp__fmt()
53 list_for_each_entry(pair, &he->pairs.head, pairs.node) { in __hpp__fmt()
115 struct hist_entry *he, hpp_field_fn get_field, in hpp__fmt() argument
121 return __hpp__fmt(hpp, he, get_field, fmtstr, 1, in hpp__fmt()
130 return __hpp__fmt(hpp, he, get_field, fmtstr, len, print_fn, fmt_percent); in hpp__fmt()
134 struct hist_entry *he, hpp_field_fn get_field, in hpp__fmt_acc() argument
142 return hpp__fmt(fmt, hpp, he, get_field, fmtstr, print_fn, fmt_percent); in hpp__fmt_acc()
[all …]
/Linux-v5.4/include/linux/
Drhashtable.h114 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()
598 struct rhash_head *he; in __rhashtable_lookup() local
606 rht_for_each_rcu_from(he, rht_ptr_rcu(bkt), tbl, hash) { in __rhashtable_lookup()
608 params.obj_cmpfn(&arg, rht_obj(ht, he)) : in __rhashtable_lookup()
609 rhashtable_compare(&arg, rht_obj(ht, he))) in __rhashtable_lookup()
611 return he; in __rhashtable_lookup()
616 } while (he != RHT_NULLS_MARKER(bkt)); in __rhashtable_lookup()
[all …]
/Linux-v5.4/Documentation/core-api/
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
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 …]
/Linux-v5.4/drivers/net/wireless/intel/iwlwifi/mvm/
Drxmq.c1164 struct ieee80211_radiotap_he *he, in iwl_mvm_decode_he_phy_ru_alloc() argument
1182 he->data1 |= cpu_to_le16(IEEE80211_RADIOTAP_HE_DATA1_BW_RU_ALLOC_KNOWN); in iwl_mvm_decode_he_phy_ru_alloc()
1212 he->data2 |= le16_encode_bits(offs, in iwl_mvm_decode_he_phy_ru_alloc()
1214 he->data2 |= cpu_to_le16(IEEE80211_RADIOTAP_HE_DATA2_PRISEC_80_KNOWN | in iwl_mvm_decode_he_phy_ru_alloc()
1217 he->data2 |= in iwl_mvm_decode_he_phy_ru_alloc()
1236 he->data6 |= in iwl_mvm_decode_he_phy_ru_alloc()
1245 struct ieee80211_radiotap_he *he, in iwl_mvm_decode_he_phy_data() argument
1259 he->data1 |= cpu_to_le16(IEEE80211_RADIOTAP_HE_DATA1_SPTL_REUSE_KNOWN | in iwl_mvm_decode_he_phy_data()
1263 he->data4 |= le16_encode_bits(le32_get_bits(phy_data->d2, in iwl_mvm_decode_he_phy_data()
1266 he->data4 |= le16_encode_bits(le32_get_bits(phy_data->d2, in iwl_mvm_decode_he_phy_data()
[all …]
/Linux-v5.4/fs/reiserfs/
DREADME20 under the GPL, because he wants to know if it is okay to do so and put
21 a check in the mail to you (for non-trivial improvements) when he
23 though he feels motivated to motivate contributors, and you can surely
88 Vladimir Saveljev was one of the programmers, and he worked long hours
89 writing the cleanest code. He always made the effort to be the best he
92 to work the way he did, he is one of the most selfless men I know.
102 align files), and he invented and implemented indirect items and
110 curious, because he never really understood the value of our project,
112 general, but he was sure that he ought to be controlling it. Every
113 innovation had to be forced past him while he was with us. He added
[all …]
/Linux-v5.4/net/mac80211/
Dstatus.c431 struct ieee80211_radiotap_he *he; in ieee80211_add_tx_radiotap_header() local
437 he = (struct ieee80211_radiotap_he *)pos; in ieee80211_add_tx_radiotap_header()
439 he->data1 = cpu_to_le16(IEEE80211_RADIOTAP_HE_DATA1_FORMAT_SU | in ieee80211_add_tx_radiotap_header()
444 he->data2 = cpu_to_le16(IEEE80211_RADIOTAP_HE_DATA2_GI_KNOWN); in ieee80211_add_tx_radiotap_header()
448 he->data6 |= HE_PREP(DATA6_NSTS, status->rate->nss); in ieee80211_add_tx_radiotap_header()
458 he->data3 |= HE_PREP(DATA3_DATA_MCS, status->rate->mcs); in ieee80211_add_tx_radiotap_header()
459 he->data3 |= HE_PREP(DATA3_DATA_DCM, status->rate->he_dcm); in ieee80211_add_tx_radiotap_header()
461 he->data5 |= HE_PREP(DATA5_GI, status->rate->he_gi); in ieee80211_add_tx_radiotap_header()
465 he->data5 |= HE_PREP(DATA5_DATA_BW_RU_ALLOC, in ieee80211_add_tx_radiotap_header()
469 he->data5 |= HE_PREP(DATA5_DATA_BW_RU_ALLOC, in ieee80211_add_tx_radiotap_header()
[all …]
/Linux-v5.4/lib/
Dtest_hexdump.c167 int ae, he, e, f, r; in test_hexdump_overflow() local
181 he = (gs * 2 /* hex */ + 1 /* space */) * len / gs - 1 /* no trailing space */; in test_hexdump_overflow()
186 e = he; in test_hexdump_overflow()

1234