Home
last modified time | relevance | path

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

12345678910>>...14

/OK3568_Linux_fs/kernel/tools/perf/tests/
H A 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 …]
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()
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 …]
H A 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 …]
H A 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 …]
/OK3568_Linux_fs/kernel/tools/perf/util/
H A Dhist.c34 struct hist_entry *he);
36 struct hist_entry *he);
38 struct hist_entry *he);
40 struct hist_entry *he);
311 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
313 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry() argument
315 u64 prev_period = he->stat.period; in hists__decay_entry()
321 he_stat__decay(&he->stat); in hists__decay_entry()
323 he_stat__decay(he->stat_acc); in hists__decay_entry()
324 decay_callchain(he->callchain); in hists__decay_entry()
[all …]
H A Dsort.c100 static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf, in hist_entry__thread_snprintf() argument
103 const char *comm = thread__comm_str(he->thread); in hist_entry__thread_snprintf()
106 return repsep_snprintf(bf, size, "%7d:%-*.*s", he->thread->tid, in hist_entry__thread_snprintf()
110 static int hist_entry__thread_filter(struct hist_entry *he, int type, const void *arg) in hist_entry__thread_filter() argument
117 return th && he->thread != th; in hist_entry__thread_filter()
153 static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf, in hist_entry__comm_snprintf() argument
156 return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm)); in hist_entry__comm_snprintf()
209 static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf, in hist_entry__dso_snprintf() argument
212 return _hist_entry__dso_snprintf(he->ms.map, bf, size, width); in hist_entry__dso_snprintf()
215 static int hist_entry__dso_filter(struct hist_entry *he, int type, const void *arg) in hist_entry__dso_filter() argument
[all …]
H A Dsort.h163 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he) in hist_entry__has_callchains() argument
165 return he->callchain_size != 0; in hist_entry__has_callchains()
168 int hist_entry__sym_snprintf(struct hist_entry *he, char *bf, size_t size, unsigned int width);
170 static inline bool hist_entry__has_pairs(struct hist_entry *he) in hist_entry__has_pairs() argument
172 return !list_empty(&he->pairs.node); in hist_entry__has_pairs()
175 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he) in hist_entry__next_pair() argument
177 if (hist_entry__has_pairs(he)) in hist_entry__next_pair()
178 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node); in hist_entry__next_pair()
183 struct hist_entry *he) in hist_entry__add_pair() argument
185 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.h123 struct hist_entry *he; member
168 int hist_entry__sort_snprintf(struct hist_entry *he, char *bf, size_t size,
170 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
172 void hist_entry__delete(struct hist_entry *he);
174 typedef int (*hists__resort_cb_t)(struct hist_entry *he, void *arg);
216 void hists__calc_col_len(struct hists *hists, struct hist_entry *he);
264 struct hist_entry *he);
266 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 …]
/OK3568_Linux_fs/kernel/net/netfilter/
H A 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 …]
/OK3568_Linux_fs/kernel/tools/perf/
H A Dbuiltin-c2c.c77 struct hist_entry he; member
156 return &c2c_he->he; in c2c_he_zalloc()
159 static void c2c_he_free(void *he) in c2c_he_free() argument
163 c2c_he = container_of(he, struct c2c_hist_entry, he); in c2c_he_free()
186 he__get_c2c_hists(struct hist_entry *he, in he__get_c2c_hists() argument
194 c2c_he = container_of(he, struct c2c_hist_entry, he); in he__get_c2c_hists()
266 struct hist_entry *he; in process_sample_event() local
298 he = hists__add_entry_ops(&c2c_hists->hists, &c2c_entry_ops, in process_sample_event()
301 if (he == NULL) in process_sample_event()
304 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event()
[all …]
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-annotate.c160 struct hist_entry *he = iter->he; in hist_iter__branch_callback() local
166 bi = he->branch_info; in hist_iter__branch_callback()
220 struct hist_entry *he; in evsel__add_sample() local
250 he = hists__add_entry(hists, al, NULL, NULL, NULL, sample, true); in evsel__add_sample()
251 if (he == NULL) in evsel__add_sample()
254 ret = hist_entry__inc_addr_samples(he, sample, evsel, al->addr); in evsel__add_sample()
297 static int hist_entry__tty_annotate(struct hist_entry *he, in hist_entry__tty_annotate() argument
302 return symbol__tty_annotate(&he->ms, evsel, &ann->opts); in hist_entry__tty_annotate()
304 return symbol__tty_annotate2(&he->ms, evsel, &ann->opts); in hist_entry__tty_annotate()
315 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations() local
[all …]
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/kernel/tools/perf/ui/
H A 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 …]
/OK3568_Linux_fs/kernel/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()
591 struct rhash_head *he; in __rhashtable_lookup() local
599 rht_for_each_rcu_from(he, rht_ptr_rcu(bkt), tbl, hash) { in __rhashtable_lookup()
601 params.obj_cmpfn(&arg, rht_obj(ht, he)) : in __rhashtable_lookup()
602 rhashtable_compare(&arg, rht_obj(ht, he))) in __rhashtable_lookup()
604 return he; in __rhashtable_lookup()
609 } while (he != RHT_NULLS_MARKER(bkt)); in __rhashtable_lookup()
[all …]
/OK3568_Linux_fs/kernel/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 …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8723ds/os_dep/linux/
H A Drhashtable.h200 const struct rhash_head *he) in rht_obj() argument
202 return (char *)he - ht->p.head_offset; in rht_obj()
244 const struct rhash_head *he, const struct rhashtable_params params) in rht_head_hashfn() argument
246 const char *ptr = rht_obj(ht, he); in rht_head_hashfn()
537 struct rhash_head *he; in rhashtable_lookup_fast() local
545 rht_for_each_rcu(he, tbl, hash) { in rhashtable_lookup_fast()
547 params.obj_cmpfn(&arg, rht_obj(ht, he)) : in rhashtable_lookup_fast()
548 rhashtable_compare(&arg, rht_obj(ht, he))) in rhashtable_lookup_fast()
551 return rht_obj(ht, he); in rhashtable_lookup_fast()
750 struct rhash_head *he; in __rhashtable_remove_fast() local
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8822bs/os_dep/linux/
H A Drhashtable.h200 const struct rhash_head *he) in rht_obj() argument
202 return (char *)he - ht->p.head_offset; in rht_obj()
244 const struct rhash_head *he, const struct rhashtable_params params) in rht_head_hashfn() argument
246 const char *ptr = rht_obj(ht, he); in rht_head_hashfn()
537 struct rhash_head *he; in rhashtable_lookup_fast() local
545 rht_for_each_rcu(he, tbl, hash) { in rhashtable_lookup_fast()
547 params.obj_cmpfn(&arg, rht_obj(ht, he)) : in rhashtable_lookup_fast()
548 rhashtable_compare(&arg, rht_obj(ht, he))) in rhashtable_lookup_fast()
551 return rht_obj(ht, he); in rhashtable_lookup_fast()
750 struct rhash_head *he; in __rhashtable_remove_fast() local
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8189fs/os_dep/linux/
H A Drhashtable.h200 const struct rhash_head *he) in rht_obj() argument
202 return (char *)he - ht->p.head_offset; in rht_obj()
244 const struct rhash_head *he, const struct rhashtable_params params) in rht_head_hashfn() argument
246 const char *ptr = rht_obj(ht, he); in rht_head_hashfn()
537 struct rhash_head *he; in rhashtable_lookup_fast() local
545 rht_for_each_rcu(he, tbl, hash) { in rhashtable_lookup_fast()
547 params.obj_cmpfn(&arg, rht_obj(ht, he)) : in rhashtable_lookup_fast()
548 rhashtable_compare(&arg, rht_obj(ht, he))) in rhashtable_lookup_fast()
551 return rht_obj(ht, he); in rhashtable_lookup_fast()
750 struct rhash_head *he; in __rhashtable_remove_fast() local
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8189fs/os_dep/linux/
H A Drhashtable.h201 const struct rhash_head *he) in rht_obj() argument
203 return (char *)he - ht->p.head_offset; in rht_obj()
245 const struct rhash_head *he, const struct rhashtable_params params) in rht_head_hashfn() argument
247 const char *ptr = rht_obj(ht, he); in rht_head_hashfn()
538 struct rhash_head *he; in rhashtable_lookup_fast() local
546 rht_for_each_rcu(he, tbl, hash) { in rhashtable_lookup_fast()
548 params.obj_cmpfn(&arg, rht_obj(ht, he)) : in rhashtable_lookup_fast()
549 rhashtable_compare(&arg, rht_obj(ht, he))) in rhashtable_lookup_fast()
552 return rht_obj(ht, he); in rhashtable_lookup_fast()
751 struct rhash_head *he; in __rhashtable_remove_fast() local
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8822cs/os_dep/linux/
H A Drhashtable.h200 const struct rhash_head *he) in rht_obj() argument
202 return (char *)he - ht->p.head_offset; in rht_obj()
244 const struct rhash_head *he, const struct rhashtable_params params) in rht_head_hashfn() argument
246 const char *ptr = rht_obj(ht, he); in rht_head_hashfn()
537 struct rhash_head *he; in rhashtable_lookup_fast() local
545 rht_for_each_rcu(he, tbl, hash) { in rhashtable_lookup_fast()
547 params.obj_cmpfn(&arg, rht_obj(ht, he)) : in rhashtable_lookup_fast()
548 rhashtable_compare(&arg, rht_obj(ht, he))) in rhashtable_lookup_fast()
551 return rht_obj(ht, he); in rhashtable_lookup_fast()
750 struct rhash_head *he; in __rhashtable_remove_fast() local
[all …]

12345678910>>...14