Home
last modified time | relevance | path

Searched refs:b (Results 1 – 25 of 439) sorted by relevance

12345678910>>...18

/tools/perf/tests/
A Dtime-utils-test.c162 .ptime = { {b, b + 1}, }, in test__time_utils()
164 .skip = { b - 1, b + 2, }, in test__time_utils()
165 .noskip = { b, b + 1, }, in test__time_utils()
194 .ptime = { {b, b + 9}, }, in test__time_utils()
196 .skip = { b - 1, b + 10, }, in test__time_utils()
197 .noskip = { b, b + 9, }, in test__time_utils()
224 .ptime = { {b, b + 9}, {b + 10, b + 19}, }, in test__time_utils()
227 .noskip = { b, b + 8, b + 9, b + 10, b + 11, b + 12, b + 19, }, in test__time_utils()
239 .ptime = { {b, b + 9}, {b + 20, b + 29}, { b + 90, b + 100}, }, in test__time_utils()
241 .skip = { b - 1, b + 10, b + 19, b + 30, b + 89, b + 101 }, in test__time_utils()
[all …]
/tools/include/linux/
A Djhash.h38 b -= a; b ^= rol32(a, 6); a += c; \
39 c -= b; c ^= rol32(b, 8); b += a; \
41 b -= a; b ^= rol32(a, 19); a += c; \
42 c -= b; c ^= rol32(b, 4); b += a; \
48 c ^= b; c -= rol32(b, 14); \
50 b ^= a; b -= rol32(a, 25); \
51 c ^= b; c -= rol32(b, 16); \
53 b ^= a; b -= rol32(a, 14); \
54 c ^= b; c -= rol32(b, 24); \
72 u32 a, b, c; in jhash() local
[all …]
A Dmath64.h8 static inline u64 mul_u64_u64_div64(u64 a, u64 b, u64 c) in mul_u64_u64_div64() argument
13 : "a" (a), "rm" (b), "rm" (c) in mul_u64_u64_div64()
24 return (u64)(((unsigned __int128)a * b) >> shift); in mul_u64_u32_shr()
30 static inline u64 mul_u32_u32(u32 a, u32 b) in mul_u32_u32() argument
35 : [a] "a" (a), [b] "rm" (b) ); in mul_u32_u32()
40 static inline u64 mul_u32_u32(u32 a, u32 b) in mul_u32_u32() argument
42 return (u64)a * b; in mul_u32_u32()
54 ret = mul_u32_u32(al, b) >> shift; in mul_u64_u32_shr()
56 ret += mul_u32_u32(ah, b) << (32 - shift); in mul_u64_u32_shr()
64 static inline u64 mul_u64_u64_div64(u64 a, u64 b, u64 c) in mul_u64_u64_div64() argument
[all …]
A Doverflow.h44 #define check_add_overflow(a, b, d) ({ \ argument
46 typeof(b) __b = (b); \
53 #define check_sub_overflow(a, b, d) ({ \ argument
55 typeof(b) __b = (b); \
62 #define check_mul_overflow(a, b, d) ({ \ argument
64 typeof(b) __b = (b); \
82 static inline __must_check size_t array_size(size_t a, size_t b) in array_size() argument
86 if (check_mul_overflow(a, b, &bytes)) in array_size()
104 static inline __must_check size_t array3_size(size_t a, size_t b, size_t c) in array3_size() argument
108 if (check_mul_overflow(a, b, &bytes)) in array3_size()
/tools/testing/selftests/bpf/benchs/
A Drun_bench_ringbufs.sh10 for b in rb-libbpf rb-custom pb-libbpf pb-custom; do
11 summarize $b "$($RUN_RB_BENCH $b)"
15 for b in rb-libbpf rb-custom pb-libbpf pb-custom; do
16 summarize $b "$($RUN_RB_BENCH --rb-sampled $b)"
20 for b in rb-libbpf rb-custom pb-libbpf pb-custom; do
21 summarize $b "$($RUN_RB_BENCH --rb-b2b $b)"
22 summarize $b-sampled "$($RUN_RB_BENCH --rb-sampled --rb-b2b $b)"
27 …summarize "rb-sampled-$b" "$($RUN_RB_BENCH --rb-b2b --rb-batch-cnt $b --rb-sampled --rb-sample-rat…
31 …summarize "pb-sampled-$b" "$($RUN_RB_BENCH --rb-b2b --rb-batch-cnt $b --rb-sampled --rb-sample-rat…
44 …summarize $b "$($RUN_RB_BENCH --rb-batch-cnt 1 --rb-sample-rate 1 --prod-affinity 0 --cons-affinit…
[all …]
/tools/testing/selftests/bpf/progs/
A Dtest_jhash.h15 b -= a; b ^= rol32(a, 6); a += c; \
16 c -= b; c ^= rol32(b, 8); b += a; \
18 b -= a; b ^= rol32(a, 19); a += c; \
19 c -= b; c ^= rol32(b, 4); b += a; \
24 c ^= b; c -= rol32(b, 14); \
26 b ^= a; b -= rol32(a, 25); \
27 c ^= b; c -= rol32(b, 16); \
29 b ^= a; b -= rol32(a, 14); \
30 c ^= b; c -= rol32(b, 24); \
38 u32 a, b, c; in jhash() local
[all …]
A Dtracing_struct.c13 long b; member
18 int b[]; member
33 t1_a_b = a.b; in BPF_PROG2()
34 t1_b = b; in BPF_PROG2()
62 t2_b_a = b.a; in BPF_PROG2()
63 t2_b_b = b.b; in BPF_PROG2()
79 t3_b = b; in BPF_PROG2()
81 t3_c_b = c.b; in BPF_PROG2()
97 t4_b = b; in BPF_PROG2()
101 t4_e_b = e.b; in BPF_PROG2()
[all …]
A Dcore_reloc_types.h41 int b; member
48 int b; member
61 int b; member
70 } b; member
84 } b; member
85 } b; member
104 } b; member
105 } b; member
151 } b; member
172 } b; member
[all …]
A Dtest_core_reloc_nesting.c21 int b; member
30 union core_reloc_nesting_subunion b; member
31 } b; member
44 if (CORE_READ(&out->b.b.b, &in->b.b.b)) in test_core_nesting()
A Dtest_siphash.h14 #define SIPHASH_PERMUTATION(a, b, c, d) ( \ argument
15 (a) += (b), (b) = rol64((b), 13), (b) ^= (a), (a) = rol64((a), 32), \
18 (c) += (b), (b) = rol64((b), 17), (b) ^= (c), (c) = rol64((c), 32))
33 u64 b = ((u64)(len)) << 56; \
40 v3 ^= b; \
43 v0 ^= b; \
A Dstruct_ops_module.c21 void BPF_PROG(test_2, int a, int b) in BPF_PROG() argument
23 test_2_result = a + b; in BPF_PROG()
27 int BPF_PROG(test_3, int a, int b) in BPF_PROG() argument
29 test_2_result = a + b + 3; in BPF_PROG()
30 return a + b + 3; in BPF_PROG()
41 void BPF_PROG(test_2_v2, int a, int b) in BPF_PROG() argument
43 test_2_result = a * b; in BPF_PROG()
48 void (*test_2)(int a, int b);
60 void (*test_2)(int a, int b);
62 void (*zeroed_op)(int a, int b);
A Dbtf_dump_test_case_packing.c11 short b; member
16 short b; member
21 int b; member
26 int b; member
32 long b; member
41 char b; member
48 int b; member
122 char b; member
127 struct nested_packed_struct b; member
132 struct nested_packed_struct b; member
A Dtracing_struct_many_args.c8 int b; member
13 short b; member
23 int BPF_PROG2(test_struct_many_args_1, __u64, a, void *, b, short, c, int, d, in BPF_PROG2() argument
27 t7_b = (long)b; in BPF_PROG2()
32 t7_f_b = f.b; in BPF_PROG2()
37 int BPF_PROG2(test_struct_many_args_2, __u64, a, void *, b, short, c, int, d, in BPF_PROG2() argument
45 int BPF_PROG2(test_struct_many_args_3, __u64, a, void *, b, short, c, int, d, in BPF_PROG2() argument
49 t8_b = (long)b; in BPF_PROG2()
54 t8_f_b = f.b; in BPF_PROG2()
73 t9_b = (long)b; in BPF_PROG2()
[all …]
A Dfentry_test.c19 int BPF_PROG(test2, int a, __u64 b) in BPF_PROG() argument
21 test2_result = a == 2 && b == 3; in BPF_PROG()
27 int BPF_PROG(test3, char a, int b, __u64 c) in BPF_PROG() argument
29 test3_result = a == 4 && b == 5 && c == 6; in BPF_PROG()
35 int BPF_PROG(test4, void *a, char b, int c, __u64 d) in BPF_PROG() argument
37 test4_result = a == (void *)7 && b == 8 && c == 9 && d == 10; in BPF_PROG()
43 int BPF_PROG(test5, __u64 a, void *b, short c, int d, __u64 e) in BPF_PROG() argument
45 test5_result = a == 11 && b == (void *)12 && c == 13 && d == 14 && in BPF_PROG()
52 int BPF_PROG(test6, __u64 a, void *b, short c, int d, void * e, __u64 f) in BPF_PROG() argument
54 test6_result = a == 16 && b == (void *)17 && c == 18 && d == 19 && in BPF_PROG()
A Dfexit_test.c19 int BPF_PROG(test2, int a, __u64 b, int ret) in BPF_PROG() argument
21 test2_result = a == 2 && b == 3 && ret == 5; in BPF_PROG()
27 int BPF_PROG(test3, char a, int b, __u64 c, int ret) in BPF_PROG() argument
29 test3_result = a == 4 && b == 5 && c == 6 && ret == 15; in BPF_PROG()
35 int BPF_PROG(test4, void *a, char b, int c, __u64 d, int ret) in BPF_PROG() argument
37 test4_result = a == (void *)7 && b == 8 && c == 9 && d == 10 && in BPF_PROG()
44 int BPF_PROG(test5, __u64 a, void *b, short c, int d, __u64 e, int ret) in BPF_PROG() argument
46 test5_result = a == 11 && b == (void *)12 && c == 13 && d == 14 && in BPF_PROG()
53 int BPF_PROG(test6, __u64 a, void *b, short c, int d, void *e, __u64 f, int ret) in BPF_PROG() argument
55 test6_result = a == 16 && b == (void *)17 && c == 18 && d == 19 && in BPF_PROG()
/tools/lib/
A Dlist_sort.c25 *tail = b; in merge()
29 *tail = b; in merge()
31 b = b->next; in merge()
32 if (!b) { in merge()
66 tail = b; in merge_final()
67 b = b->next; in merge_final()
68 if (!b) { in merge_final()
69 b = a; in merge_final()
79 tail = b; in merge_final()
80 b = b->next; in merge_final()
[all …]
/tools/testing/selftests/proc/
A Dproc-self-map-files-001.c31 snprintf(name, sizeof(name), fmt, a, b); in pass()
41 snprintf(name, sizeof(name), fmt, a, b); in fail()
52 unsigned long a, b; in main() local
63 b = (unsigned long)p + PAGE_SIZE; in main()
65 pass("/proc/self/map_files/%lx-%lx", a, b); in main()
66 fail("/proc/self/map_files/ %lx-%lx", a, b); in main()
67 fail("/proc/self/map_files/%lx -%lx", a, b); in main()
68 fail("/proc/self/map_files/%lx- %lx", a, b); in main()
69 fail("/proc/self/map_files/%lx-%lx ", a, b); in main()
70 fail("/proc/self/map_files/0%lx-%lx", a, b); in main()
[all …]
A Dproc-self-map-files-002.c31 snprintf(name, sizeof(name), fmt, a, b); in pass()
41 snprintf(name, sizeof(name), fmt, a, b); in fail()
58 unsigned long a, b; in main() local
75 b = (unsigned long)p + PAGE_SIZE; in main()
77 pass("/proc/self/map_files/%lx-%lx", a, b); in main()
78 fail("/proc/self/map_files/ %lx-%lx", a, b); in main()
79 fail("/proc/self/map_files/%lx -%lx", a, b); in main()
80 fail("/proc/self/map_files/%lx- %lx", a, b); in main()
81 fail("/proc/self/map_files/%lx-%lx ", a, b); in main()
82 fail("/proc/self/map_files/0%lx-%lx", a, b); in main()
[all …]
/tools/perf/util/intel-pt-decoder/
A Dintel-pt-log.c101 if (!b->buf) in log_buf__write()
105 size_t space = b->buf_sz - b->head; in log_buf__write()
108 memcpy(b->buf + b->head, buf, n); in log_buf__write()
111 b->head += n; in log_buf__write()
112 if (sz && b->head >= b->buf_sz) { in log_buf__write()
136 memset(b, 0, sizeof(*b)); in log_buf__open()
138 b->buf = malloc(b->buf_sz); in log_buf__open()
169 if (!b->buf) in log_buf__dump()
176 write_lines(b->buf + b->head, b->buf_sz - b->head, b->backend, &remove_first); in log_buf__dump()
178 write_lines(b->buf, b->head, b->backend, &remove_first); in log_buf__dump()
[all …]
/tools/perf/check-header_ignore_hunks/lib/
A Dlist_sort.c2 struct list_head *a, struct list_head *b)
11 tail->next = b;
21 + cmp(priv, b, b);
22 b->prev = tail;
23 tail = b;
24 b = b->next;
/tools/testing/selftests/turbostat/
A Ddefcolumns.py26 expected_columns_debug = proc_turbostat.stdout.replace(b',', b'\t').strip()
27 …ted_columns_debug.replace(b'usec\t', b'').replace(b'Time_Of_Day_Seconds\t', b'').replace(b'X2APIC\…
40 actual_columns = proc_turbostat.stdout.split(b'\n')[0]
56 actual_columns = proc_turbostat.stdout.split(b'\n')[0]
/tools/gpio/
A Dgpio-utils.h45 static inline void gpiotools_set_bit(__u64 *b, int n) in gpiotools_set_bit() argument
47 *b |= _BITULL(n); in gpiotools_set_bit()
50 static inline void gpiotools_change_bit(__u64 *b, int n) in gpiotools_change_bit() argument
52 *b ^= _BITULL(n); in gpiotools_change_bit()
55 static inline void gpiotools_clear_bit(__u64 *b, int n) in gpiotools_clear_bit() argument
57 *b &= ~_BITULL(n); in gpiotools_clear_bit()
60 static inline int gpiotools_test_bit(__u64 b, int n) in gpiotools_test_bit() argument
62 return !!(b & _BITULL(n)); in gpiotools_test_bit()
65 static inline void gpiotools_assign_bit(__u64 *b, int n, bool value) in gpiotools_assign_bit() argument
68 gpiotools_set_bit(b, n); in gpiotools_assign_bit()
[all …]
/tools/perf/util/
A Dsha1.c26 e += (b & (c ^ d)) ^ d; \
28 e += b ^ c ^ d; \
30 e += (c & d) ^ (b & (c ^ d)); \
31 b = rol32(b, 30); \
37 SHA1_ROUND((i) + 0, a, b, c, d, e); \
38 SHA1_ROUND((i) + 1, e, a, b, c, d); \
39 SHA1_ROUND((i) + 2, d, e, a, b, c); \
40 SHA1_ROUND((i) + 3, c, d, e, a, b); \
41 SHA1_ROUND((i) + 4, b, c, d, e, a); \
56 u32 b = h[1]; in sha1_blocks() local
[all …]
/tools/testing/selftests/net/lib/py/
A Dksft.py58 def ksft_eq(a, b, comment=""): argument
60 if a != b:
64 def ksft_ne(a, b, comment=""): argument
66 if a == b:
75 def ksft_in(a, b, comment=""): argument
76 if a not in b:
81 if a in b:
85 def ksft_is(a, b, comment=""): argument
86 if a is not b:
91 if a < b:
[all …]
/tools/perf/ui/browsers/
A Dmap.c20 struct ui_browser b; member
28 struct map_browser *mb = container_of(browser, struct map_browser, b); in map_browser__write()
67 browser->b.top = &sym->rb_node; in map_browser__search()
68 browser->b.index = browser->b.top_idx = *idx; in map_browser__search()
85 key = ui_browser__run(&browser->b, 0); in map_browser__run()
93 ui_browser__warn_unhandled_hotkey(&browser->b, key, 0, NULL); in map_browser__run()
103 ui_browser__hide(&browser->b); in map_browser__run()
110 .b = { in map__browse()
122 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) { in map__browse()
129 *idx = mb.b.nr_entries; in map__browse()
[all …]

Completed in 748 milliseconds

12345678910>>...18