Home
last modified time | relevance | path

Searched refs:NUM_BUCKET (Results 1 – 4 of 4) sorted by relevance

/linux/tools/perf/util/bpf_skel/
H A Dfunc_latency.bpf.c8 #define NUM_BUCKET 22 macro
35 __uint(max_entries, NUM_BUCKET);
127 if (key >= NUM_BUCKET ||
129 key = NUM_BUCKET - 1;
136 for (key = 0; key < (NUM_BUCKET - 1); key++) {
/linux/tools/perf/
H A Dbuiltin-ftrace.c800 i = NUM_BUCKET -1; in display_histogram()
802 if (i >= NUM_BUCKET) in display_histogram()
803 i = NUM_BUCKET - 1; in display_histogram()
829 for (i = 0; i < NUM_BUCKET; i++) in display_histogram()
846 for (i = 1; i < NUM_BUCKET - 1; i++) { in prepare_func_latency()
884 bar_len = buckets[NUM_BUCKET - 1] * bar_total / total; in start_func_latency()
888 unsigned int upper_outlier = (NUM_BUCKET - 2) * ftrace->bucket_range + min_latency; in start_func_latency()
900 printf(" | %10d | %.*s%*s |\n", buckets[NUM_BUCKET - 1], in stop_func_latency()
1000 int buckets[NUM_BUCKET] = { }; in prepare_func_profile()
1756 ftrace.max_latency = (NUM_BUCKET
[all...]
/linux/tools/perf/util/
H A Dftrace.h42 #define NUM_BUCKET 22 /* 20 + 2 (for outliers in both direction) */
38 #define NUM_BUCKET global() macro
H A Dbpf_ftrace.c141 for (idx = 0; idx < NUM_BUCKET; idx++) { in perf_ftrace__latency_read_bpf()