/Linux-v6.1/tools/perf/tests/ |
D | hists_output.c | 94 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 …]
|
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() 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 …]
|
D | hists_link.c | 68 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 …]
|
D | hists_cumulate.c | 128 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-v6.1/tools/perf/util/ |
D | hist.c | 34 struct hist_entry *he); 36 struct hist_entry *he); 38 struct hist_entry *he); 40 struct hist_entry *he); 320 static void hists__delete_entry(struct hists *hists, struct hist_entry *he); 322 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry() argument 324 u64 prev_period = he->stat.period; in hists__decay_entry() 330 he_stat__decay(&he->stat); in hists__decay_entry() 332 he_stat__decay(he->stat_acc); in hists__decay_entry() 333 decay_callchain(he->callchain); in hists__decay_entry() [all …]
|
D | sort.c | 103 static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf, in hist_entry__thread_snprintf() argument 106 const char *comm = thread__comm_str(he->thread); in hist_entry__thread_snprintf() 109 return repsep_snprintf(bf, size, "%7d:%-*.*s", he->thread->tid, in hist_entry__thread_snprintf() 113 static int hist_entry__thread_filter(struct hist_entry *he, int type, const void *arg) in hist_entry__thread_filter() argument 120 return th && he->thread != th; in hist_entry__thread_filter() 156 static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf, in hist_entry__comm_snprintf() argument 159 return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm)); in hist_entry__comm_snprintf() 212 static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf, in hist_entry__dso_snprintf() argument 215 return _hist_entry__dso_snprintf(he->ms.map, bf, size, width); in hist_entry__dso_snprintf() 218 static int hist_entry__dso_filter(struct hist_entry *he, int type, const void *arg) in hist_entry__dso_filter() argument [all …]
|
D | sort.h | 165 static __pure inline bool hist_entry__has_callchains(struct hist_entry *he) in hist_entry__has_callchains() argument 167 return he->callchain_size != 0; in hist_entry__has_callchains() 170 int hist_entry__sym_snprintf(struct hist_entry *he, char *bf, size_t size, unsigned int width); 172 static inline bool hist_entry__has_pairs(struct hist_entry *he) in hist_entry__has_pairs() argument 174 return !list_empty(&he->pairs.node); in hist_entry__has_pairs() 177 static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he) in hist_entry__next_pair() argument 179 if (hist_entry__has_pairs(he)) in hist_entry__next_pair() 180 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node); in hist_entry__next_pair() 185 struct hist_entry *he) in hist_entry__add_pair() argument 187 list_add_tail(&pair->pairs.node, &he->pairs.head); in hist_entry__add_pair() [all …]
|
D | block-info.c | 116 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 …]
|
D | hist.h | 133 struct hist_entry *he; member 178 int hist_entry__sort_snprintf(struct hist_entry *he, char *bf, size_t size, 180 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp, 182 void hist_entry__delete(struct hist_entry *he); 184 typedef int (*hists__resort_cb_t)(struct hist_entry *he, void *arg); 228 void hists__calc_col_len(struct hists *hists, struct hist_entry *he); 276 struct hist_entry *he); 278 struct hist_entry *he); 398 int hist_entry__filter(struct hist_entry *he, int type, const void *arg); 418 typedef u64 (*hpp_field_fn)(struct hist_entry *he); [all …]
|
/Linux-v6.1/net/netfilter/ |
D | nft_set_hash.c | 49 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() 82 const struct nft_rhash_elem *he; in nft_rhash_lookup() local 89 he = rhashtable_lookup(&priv->ht, &arg, nft_rhash_params); in nft_rhash_lookup() 90 if (he != NULL) in nft_rhash_lookup() 91 *ext = &he->ext; in nft_rhash_lookup() [all …]
|
/Linux-v6.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 317 he = hists__add_entry_ops(&c2c_hists->hists, &c2c_entry_ops, in process_sample_event() 320 if (he == NULL) in process_sample_event() 323 c2c_he = container_of(he, struct c2c_hist_entry, he); in process_sample_event() [all …]
|
D | builtin-annotate.c | 167 struct hist_entry *he = iter->he; in hist_iter__branch_callback() local 173 bi = he->branch_info; in hist_iter__branch_callback() 225 struct hist_entry *he; in evsel__add_sample() local 255 he = hists__add_entry(hists, al, NULL, NULL, NULL, sample, true); in evsel__add_sample() 256 if (he == NULL) in evsel__add_sample() 259 ret = hist_entry__inc_addr_samples(he, sample, evsel, al->addr); in evsel__add_sample() 302 static int hist_entry__tty_annotate(struct hist_entry *he, in hist_entry__tty_annotate() argument 307 return symbol__tty_annotate(&he->ms, evsel, &ann->opts); in hist_entry__tty_annotate() 309 return symbol__tty_annotate2(&he->ms, evsel, &ann->opts); in hist_entry__tty_annotate() 320 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations() local [all …]
|
/Linux-v6.1/fs/reiserfs/ |
D | README | 20 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 22 makes his next sale. He makes no guarantees as to the amount if any, 23 though he feels motivated to motivate contributors, and you can surely 85 funding for the first 5.5 years, and one of the programmers. He owns 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. 98 Vladimir throughout the project's development. He wrote a quite 99 substantial portion of the total code. He realized that there was a [all …]
|
/Linux-v6.1/Documentation/core-api/ |
D | errseq.rst | 49 Let me tell you a story about a worker drone. Now, he's a good worker 50 overall, but the company is a little...management heavy. He has to 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. 59 He might have made the mistake on work they didn't actually hand him, 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:: [all …]
|
/Linux-v6.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-v6.1/tools/perf/ui/browsers/ |
D | hists.c | 70 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 …]
|
/Linux-v6.1/drivers/net/wireless/intel/iwlwifi/fw/api/ |
D | mac.h | 421 * The required PPE is set via HE Capabilities IE, per Nss x BW x MCS 445 * The required PPE is set via HE Capabilities IE, per Nss x BW x MCS 469 * enum iwl_he_sta_ctxt_flags - HE STA context flags 517 * enum iwl_he_htc_flags - HE HTC support flags 518 * @IWL_HE_HTC_SUPPORT: HE-HTC support 519 * @IWL_HE_HTC_UL_MU_RESP_SCHED: HE UL MU response schedule 534 * @IWL_HE_HTC_LINK_ADAP_NO_FEEDBACK: the STA does not provide HE MFB 535 * @IWL_HE_HTC_LINK_ADAP_UNSOLICITED: the STA provides only unsolicited HE MFB 536 * @IWL_HE_HTC_LINK_ADAP_BOTH: the STA is capable of providing HE MFB in 537 * response to HE MRQ and if the STA provides unsolicited HE MFB [all …]
|
D | rs.h | 13 * @IWL_TLC_MNG_CFG_FLAGS_STBC_MSK: enable STBC. For HE this enables STBC for 16 * @IWL_TLC_MNG_CFG_FLAGS_HE_STBC_160MHZ_MSK: enable STBC in HE at 160MHz 18 * @IWL_TLC_MNG_CFG_FLAGS_HE_DCM_NSS_1_MSK: enable HE Dual Carrier Modulation 21 * @IWL_TLC_MNG_CFG_FLAGS_HE_DCM_NSS_2_MSK: enable HE Dual Carrier Modulation 66 * @IWL_TLC_MNG_MODE_HE: enable HE 82 * enum iwl_tlc_mng_ht_rates - HT/VHT/HE rates 406 /* Bit 10 - OFDM HE */ 433 /* Bit 18: OFDM-HE dual carrier mode */ 442 * Bit 20-21: HE LTF type and guard interval 443 * HE (ext) SU: [all …]
|
/Linux-v6.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-v6.1/tools/perf/ui/ |
D | hist.c | 25 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-v6.1/drivers/net/wireless/mediatek/mt76/mt7915/ |
D | debugfs.c | 204 "HE SU", "HE EXT", "HE 2MU", "HE 3MU", "HE 4MU", in mt7915_muru_stats_show() 205 "HE 2RU", "HE 3RU", "HE 4RU", "HE 5-8RU", "HE 9-16RU", in mt7915_muru_stats_show() 206 "HE >16RU" in mt7915_muru_stats_show() 209 "HE 2MU", "HE 3MU", "HE 4MU", "HE SU", "HE 2RU", in mt7915_muru_stats_show() 210 "HE 3RU", "HE 4RU", "HE 5-8RU", "HE 9-16RU", "HE >16RU" in mt7915_muru_stats_show() 226 /* Non-HE Downlink*/ in mt7915_muru_stats_show() 227 seq_puts(file, "[Non-HE]\nDownlink\nData Type: "); in mt7915_muru_stats_show() 256 seq_printf(file, "\nTotal non-HE MU-MIMO DL PPDU count: %lld", in mt7915_muru_stats_show() 266 seq_printf(file, "\nAll non-HE DL PPDU count: %lld", total_ppdu_cnt); in mt7915_muru_stats_show() 268 /* HE Downlink */ in mt7915_muru_stats_show() [all …]
|
/Linux-v6.1/drivers/net/wireless/mediatek/mt76/ |
D | mt76_connac_mac.c | 699 struct ieee80211_radiotap_he *he, in mt76_connac2_mac_decode_he_radiotap_ru() argument 740 he->data1 |= HE_BITS(DATA1_BW_RU_ALLOC_KNOWN); in mt76_connac2_mac_decode_he_radiotap_ru() 741 he->data2 |= HE_BITS(DATA2_RU_OFFSET_KNOWN) | in mt76_connac2_mac_decode_he_radiotap_ru() 816 struct ieee80211_radiotap_he *he; in mt76_connac2_mac_decode_he_radiotap() local 820 he = skb_push(skb, sizeof(known)); in mt76_connac2_mac_decode_he_radiotap() 821 memcpy(he, &known, sizeof(known)); in mt76_connac2_mac_decode_he_radiotap() 823 he->data3 = HE_PREP(DATA3_BSS_COLOR, BSS_COLOR, rxv[14]) | in mt76_connac2_mac_decode_he_radiotap() 825 he->data4 = HE_PREP(DATA4_SU_MU_SPTL_REUSE, SR_MASK, rxv[11]); in mt76_connac2_mac_decode_he_radiotap() 826 he->data5 = HE_PREP(DATA5_PE_DISAMBIG, PE_DISAMBIG, rxv[2]) | in mt76_connac2_mac_decode_he_radiotap() 830 he->data5 |= HE_BITS(DATA5_TXBF); in mt76_connac2_mac_decode_he_radiotap() [all …]
|
/Linux-v6.1/drivers/net/wireless/intel/iwlwifi/cfg/ |
D | 22000.c | 416 * If the device doesn't support HE, no need to have that many buffers. 449 * HT size; mac80211 would otherwise pick the HE max (256) by default. 461 * HT size; mac80211 would otherwise pick the HE max (256) by default. 540 * HT size; mac80211 would otherwise pick the HE max (256) by default. 553 * HT size; mac80211 would otherwise pick the HE max (256) by default. 566 * HT size; mac80211 would otherwise pick the HE max (256) by default. 578 * HT size; mac80211 would otherwise pick the HE max (256) by default. 591 * HT size; mac80211 would otherwise pick the HE max (256) by default. 604 * HT size; mac80211 would otherwise pick the HE max (256) by default. 616 * HT size; mac80211 would otherwise pick the HE max (256) by default. [all …]
|
/Linux-v6.1/kernel/locking/ |
D | qspinlock_paravirt.h | 207 #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 …]
|