Home
last modified time | relevance | path

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

123456789

/openbmc/linux/tools/perf/tests/
H A Dhists_output.c97 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) (map__dso(he->ms.map)->short_name) 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 …]
H A 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()
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 …]
H 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()
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 …]
H A Dhists_cumulate.c132 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) (map__dso(he->ms.map)->short_name) 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 …]
/openbmc/linux/tools/perf/util/
H A Dhist.c35 struct hist_entry *he);
37 struct hist_entry *he);
39 struct hist_entry *he);
41 struct hist_entry *he);
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) in hists__decay_entry() argument
325 u64 prev_period = he->stat.period; in hists__decay_entry()
331 he_stat__decay(&he->stat); in hists__decay_entry()
333 he_stat__decay(he->stat_acc); in hists__decay_entry()
334 decay_callchain(he->callchain); in hists__decay_entry()
[all …]
H A Dsort.c114 static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf, in hist_entry__thread_snprintf() argument
117 const char *comm = thread__comm_str(he->thread); in hist_entry__thread_snprintf()
120 return repsep_snprintf(bf, size, "%7d:%-*.*s", thread__tid(he->thread), in hist_entry__thread_snprintf()
124 static int hist_entry__thread_filter(struct hist_entry *he, int type, const void *arg) in hist_entry__thread_filter() argument
131 return th && RC_CHK_ACCESS(he->thread) != RC_CHK_ACCESS(th); in hist_entry__thread_filter()
163 static int hist_entry__simd_snprintf(struct hist_entry *he, char *bf, in hist_entry__simd_snprintf() argument
168 if (!he->simd_flags.arch) in hist_entry__simd_snprintf()
171 name = hist_entry__get_simd_name(&he->simd_flags); in hist_entry__simd_snprintf()
173 if (he->simd_flags.pred & SIMD_OP_FLAGS_PRED_EMPTY) in hist_entry__simd_snprintf()
175 else if (he->simd_flags.pred & SIMD_OP_FLAGS_PRED_PARTIAL) in hist_entry__simd_snprintf()
[all …]
H A Dsort.h168 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he) in hist_entry__has_callchains() argument
170 return he->callchain_size != 0; in hist_entry__has_callchains()
173 int hist_entry__sym_snprintf(struct hist_entry *he, char *bf, size_t size, unsigned int width);
175 static inline bool hist_entry__has_pairs(struct hist_entry *he) in hist_entry__has_pairs() argument
177 return !list_empty(&he->pairs.node); in hist_entry__has_pairs()
180 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he) in hist_entry__next_pair() argument
182 if (hist_entry__has_pairs(he)) in hist_entry__next_pair()
183 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node); in hist_entry__next_pair()
188 struct hist_entry *he) in hist_entry__add_pair() argument
190 list_add_tail(&pair->pairs.node, &he->pairs.head); in hist_entry__add_pair()
[all …]
H A Dblock-info.c116 int block_info__process_sym(struct hist_entry *he, struct block_hist *bh, in block_info__process_sym() argument
124 if (!he->ms.map || !he->ms.sym) in block_info__process_sym()
128 al.map = he->ms.map; in block_info__process_sym()
129 al.sym = he->ms.sym; in block_info__process_sym()
131 notes = symbol__annotation(he->ms.sym); in block_info__process_sym()
135 for (unsigned int i = 0; i < symbol__size(he->ms.sym); i++) { in block_info__process_sym()
144 init_block_info(bi, he->ms.sym, &ch[i], i, in block_info__process_sym()
197 struct hist_entry *he) in block_total_cycles_pct_entry() argument
200 struct block_info *bi = he->block_info; in block_total_cycles_pct_entry()
240 struct perf_hpp *hpp, struct hist_entry *he) in block_cycles_lbr_entry() argument
[all …]
H A Dhist.h135 struct hist_entry *he; member
182 int hist_entry__sort_snprintf(struct hist_entry *he, char *bf, size_t size,
184 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
186 void hist_entry__delete(struct hist_entry *he);
188 typedef int (*hists__resort_cb_t)(struct hist_entry *he, void *arg);
232 void hists__calc_col_len(struct hists *hists, struct hist_entry *he);
279 void (*init)(struct perf_hpp_fmt *fmt, struct hist_entry *he);
281 struct hist_entry *he);
283 struct hist_entry *he);
403 int hist_entry__filter(struct hist_entry *he, int type, const void *arg);
[all …]
/openbmc/linux/net/netfilter/
H A Dnft_set_hash.c51 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)) 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
93 he = rhashtable_lookup(&priv->ht, &arg, nft_rhash_params); in nft_rhash_lookup()
94 if (he != NULL) in nft_rhash_lookup()
[all …]
/openbmc/linux/tools/perf/
H A Dbuiltin-diff.c272 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 …]
H A Dbuiltin-c2c.c81 struct hist_entry he; member
164 return &c2c_he->he; in c2c_he_zalloc()
173 static void c2c_he_free(void *he) in c2c_he_free() argument
177 c2c_he = container_of(he, struct c2c_hist_entry, he); in c2c_he_free()
200 he__get_c2c_hists(struct hist_entry *he, in he__get_c2c_hists() argument
208 c2c_he = container_of(he, struct c2c_hist_entry, he); in he__get_c2c_hists()
284 struct hist_entry *he; in process_sample_event() local
322 he = hists__add_entry_ops(&c2c_hists->hists, &c2c_entry_ops, in process_sample_event()
325 if (he == NULL) in process_sample_event()
328 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event()
[all …]
H A Dbuiltin-annotate.c166 struct hist_entry *he = iter->he; in hist_iter__branch_callback() local
172 bi = he->branch_info; in hist_iter__branch_callback()
232 struct hist_entry *he; in evsel__add_sample() local
263 he = hists__add_entry(hists, al, NULL, NULL, NULL, NULL, sample, true); in evsel__add_sample()
264 if (he == NULL) in evsel__add_sample()
267 ret = hist_entry__inc_addr_samples(he, sample, evsel, al->addr); in evsel__add_sample()
312 static int hist_entry__tty_annotate(struct hist_entry *he, in hist_entry__tty_annotate() argument
317 return symbol__tty_annotate(&he->ms, evsel); in hist_entry__tty_annotate()
319 return symbol__tty_annotate2(&he->ms, evsel); in hist_entry__tty_annotate()
330 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations() local
[all …]
H A Dbuiltin-kvm.c95 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 …]
H A Dbuiltin-top.c111 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 …]
/openbmc/linux/drivers/net/wireless/mediatek/mt76/
H A Dmt76_connac3_mac.c14 struct ieee80211_radiotap_he *he, in mt76_connac3_mac_decode_he_radiotap_ru() argument
50 he->data1 |= HE_BITS(DATA1_BW_RU_ALLOC_KNOWN); in mt76_connac3_mac_decode_he_radiotap_ru()
51 he->data2 |= HE_BITS(DATA2_RU_OFFSET_KNOWN) | in mt76_connac3_mac_decode_he_radiotap_ru()
120 struct ieee80211_radiotap_he *he; in mt76_connac3_mac_decode_he_radiotap() local
124 he = skb_push(skb, sizeof(known)); in mt76_connac3_mac_decode_he_radiotap()
125 memcpy(he, &known, sizeof(known)); in mt76_connac3_mac_decode_he_radiotap()
127 he->data3 = HE_PREP(DATA3_BSS_COLOR, BSS_COLOR, rxv[9]) | in mt76_connac3_mac_decode_he_radiotap()
129 he->data4 = HE_PREP(DATA4_SU_MU_SPTL_REUSE, SR_MASK, rxv[13]); in mt76_connac3_mac_decode_he_radiotap()
130 he->data5 = HE_PREP(DATA5_PE_DISAMBIG, PE_DISAMBIG, rxv[5]) | in mt76_connac3_mac_decode_he_radiotap()
134 he->data5 |= HE_BITS(DATA5_TXBF); in mt76_connac3_mac_decode_he_radiotap()
[all …]
H A Dmt76_connac_mac.c740 struct ieee80211_radiotap_he *he, in mt76_connac2_mac_decode_he_radiotap_ru() argument
781 he->data1 |= HE_BITS(DATA1_BW_RU_ALLOC_KNOWN); in mt76_connac2_mac_decode_he_radiotap_ru()
782 he->data2 |= HE_BITS(DATA2_RU_OFFSET_KNOWN) | in mt76_connac2_mac_decode_he_radiotap_ru()
857 struct ieee80211_radiotap_he *he; in mt76_connac2_mac_decode_he_radiotap() local
861 he = skb_push(skb, sizeof(known)); in mt76_connac2_mac_decode_he_radiotap()
862 memcpy(he, &known, sizeof(known)); in mt76_connac2_mac_decode_he_radiotap()
864 he->data3 = HE_PREP(DATA3_BSS_COLOR, BSS_COLOR, rxv[14]) | in mt76_connac2_mac_decode_he_radiotap()
866 he->data4 = HE_PREP(DATA4_SU_MU_SPTL_REUSE, SR_MASK, rxv[11]); in mt76_connac2_mac_decode_he_radiotap()
867 he->data5 = HE_PREP(DATA5_PE_DISAMBIG, PE_DISAMBIG, rxv[2]) | in mt76_connac2_mac_decode_he_radiotap()
871 he->data5 |= HE_BITS(DATA5_TXBF); in mt76_connac2_mac_decode_he_radiotap()
[all …]
/openbmc/linux/tools/perf/ui/stdio/
H A Dhist.c381 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 …]
/openbmc/linux/tools/perf/ui/browsers/
H A Dhists.c70 struct hist_entry *he = in hist_browser__get_folding() local
73 if (he->leaf && he->unfolded) in hist_browser__get_folding()
74 unfolded_rows += he->nr_rows; in hist_browser__get_folding()
161 static char hist_entry__folded(const struct hist_entry *he) in hist_entry__folded() argument
163 return he->has_children ? tree__folded_sign(he->unfolded) : ' '; in hist_entry__folded()
272 static int hierarchy_count_rows(struct hist_browser *hb, struct hist_entry *he, in hierarchy_count_rows() argument
279 if (he->leaf) in hierarchy_count_rows()
280 return callchain__count_rows(&he->sorted_chain); in hierarchy_count_rows()
282 if (he->has_no_entry) in hierarchy_count_rows()
285 node = rb_first_cached(&he->hroot_out); in hierarchy_count_rows()
[all …]
/openbmc/linux/kernel/locking/
H A 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 …]
/openbmc/linux/tools/perf/ui/gtk/
H A 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 …]
/openbmc/linux/tools/perf/ui/
H A Dhist.c26 static int __hpp__fmt(struct perf_hpp *hpp, struct hist_entry *he, in __hpp__fmt() argument
31 struct hists *hists = he->hists; in __hpp__fmt()
41 percent = 100.0 * get_field(he) / total; in __hpp__fmt()
45 ret = hpp__call_print_fn(hpp, print_fn, fmt, len, get_field(he)); in __hpp__fmt()
54 list_for_each_entry(pair, &he->pairs.head, pairs.node) { in __hpp__fmt()
116 struct hist_entry *he, hpp_field_fn get_field, in hpp__fmt() argument
122 return __hpp__fmt(hpp, he, get_field, fmtstr, 1, in hpp__fmt()
131 return __hpp__fmt(hpp, he, get_field, fmtstr, len, print_fn, fmt_percent); in hpp__fmt()
135 struct hist_entry *he, hpp_field_fn get_field, in hpp__fmt_acc() argument
143 return hpp__fmt(fmt, hpp, he, get_field, fmtstr, print_fn, fmt_percent); in hpp__fmt_acc()
[all …]
/openbmc/linux/include/linux/
H A 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()
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 …]
/openbmc/linux/Documentation/core-api/
H 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
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 …]
/openbmc/linux/fs/reiserfs/
H A 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 …]

123456789