Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 149) sorted by relevance

123456

/tools/lib/
A Dbitmap.c12 for (k = 0; k < lim; k++) in __bitmap_weight()
24 int k; in __bitmap_or() local
27 for (k = 0; k < nr; k++) in __bitmap_or()
28 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
67 for (k = 0; k < lim; k++) in __bitmap_and()
68 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
70 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
79 for (k = 0; k < lim; ++k) in __bitmap_equal()
80 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
94 for (k = 0; k < lim; ++k) in __bitmap_intersects()
[all …]
/tools/testing/selftests/bpf/progs/
A Dtest_jhash.h49 k += 12; in jhash()
55 case 9: c += k[8]; in jhash()
59 case 5: b += k[4]; in jhash()
63 case 1: a += k[0]; in jhash()
82 a += k[0]; in jhash2()
83 b += k[1]; in jhash2()
84 c += k[2]; in jhash2()
87 k += 3; in jhash2()
92 case 3: c += k[2]; in jhash2()
93 case 2: b += k[1]; in jhash2()
[all …]
A Dfentry_many_args.c22 int g, unsigned int h, long i, __u64 j, unsigned long k) in BPF_PROG() argument
26 i == 24 && j == 25 && k == 26; in BPF_PROG()
33 __u64 g, __u64 h, __u64 i, __u64 j, __u64 k) in BPF_PROG() argument
37 i == 24 && j == 25 && k == 26; in BPF_PROG()
A Dfexit_many_args.c22 int g, unsigned int h, long i, __u64 j, unsigned long k, in BPF_PROG() argument
27 i == 24 && j == 25 && k == 26 && ret == 231; in BPF_PROG()
34 __u64 g, __u64 h, __u64 i, __u64 j, __u64 k, __u64 ret) in BPF_PROG() argument
38 i == 24 && j == 25 && k == 26 && ret == 231; in BPF_PROG()
A Dtest_l4lb.c65 a += *(u32 *)(k); in jhash()
66 b += *(u32 *)(k + 4); in jhash()
67 c += *(u32 *)(k + 8); in jhash()
70 k += 12; in jhash()
75 case 10: c += (u32)k[9]<<8; in jhash()
76 case 9: c += k[8]; in jhash()
77 case 8: b += (u32)k[7]<<24; in jhash()
79 case 6: b += (u32)k[5]<<8; in jhash()
80 case 5: b += k[4]; in jhash()
83 case 2: a += (u32)k[1]<<8; in jhash()
[all …]
A Dtest_l4lb_noinline.c61 a += *(u32 *)(k); in jhash()
62 b += *(u32 *)(k + 4); in jhash()
63 c += *(u32 *)(k + 8); in jhash()
66 k += 12; in jhash()
71 case 10: c += (u32)k[9]<<8; in jhash()
72 case 9: c += k[8]; in jhash()
73 case 8: b += (u32)k[7]<<24; in jhash()
75 case 6: b += (u32)k[5]<<8; in jhash()
76 case 5: b += k[4]; in jhash()
79 case 2: a += (u32)k[1]<<8; in jhash()
[all …]
A Dtest_l4lb_noinline_dynptr.c63 a += *(u32 *)(k); in jhash()
64 b += *(u32 *)(k + 4); in jhash()
65 c += *(u32 *)(k + 8); in jhash()
68 k += 12; in jhash()
73 case 10: c += (u32)k[9]<<8; in jhash()
74 case 9: c += k[8]; in jhash()
75 case 8: b += (u32)k[7]<<24; in jhash()
77 case 6: b += (u32)k[5]<<8; in jhash()
78 case 5: b += k[4]; in jhash()
81 case 2: a += (u32)k[1]<<8; in jhash()
[all …]
/tools/testing/selftests/ptrace/
A Dvmaccess.c48 int s, k, pid = fork(); in TEST() local
61 ASSERT_EQ(k, -1); in TEST()
63 ASSERT_NE(k, -1); in TEST()
64 ASSERT_NE(k, 0); in TEST()
65 ASSERT_NE(k, pid); in TEST()
70 ASSERT_EQ(k, 0); in TEST()
71 k = waitpid(-1, &s, 0); in TEST()
72 ASSERT_EQ(k, pid); in TEST()
76 ASSERT_EQ(k, 0); in TEST()
78 ASSERT_EQ(k, pid); in TEST()
[all …]
/tools/include/linux/
A Djhash.h73 const u8 *k = key; in jhash() local
85 k += 12; in jhash()
93 case 9: c += k[8]; in jhash()
97 case 5: b += k[4]; in jhash()
126 a += k[0]; in jhash2()
127 b += k[1]; in jhash2()
128 c += k[2]; in jhash2()
131 k += 3; in jhash2()
136 case 3: c += k[2]; in jhash2()
137 case 2: b += k[1]; in jhash2()
[all …]
/tools/perf/tests/
A Devent_groups.c82 static int run_test(int i, int j, int k) in run_test() argument
84 int erroneous = ((((1 << i) | (1 << j) | (1 << k)) & 5) == 5); in run_test()
105 if (!i && !j && !k) in run_test()
106 sibling_fd2 = event_open(types[k], configs_hw[k], group_fd); in run_test()
108 sibling_fd2 = event_open(types[k], configs[k], group_fd); in run_test()
123 int i, j, k; in test__event_groups() local
134 for (k = 0; k < 3; k++) { in test__event_groups()
135 r = run_test(i, j, k); in test__event_groups()
143 if (!i && !j && !k) in test__event_groups()
146 types[k], configs_hw[k], r ? "Fail" : "Pass"); in test__event_groups()
[all …]
A Dhists_link.c72 size_t i = 0, k; in add_hist_entries() local
83 for (k = 0; k < ARRAY_SIZE(fake_common_samples); k++) { in add_hist_entries()
87 sample.ip = fake_common_samples[k].ip; in add_hist_entries()
100 map__put(fake_common_samples[k].map); in add_hist_entries()
102 fake_common_samples[k].sym = al.sym; in add_hist_entries()
105 for (k = 0; k < ARRAY_SIZE(fake_samples[i]); k++) { in add_hist_entries()
106 sample.pid = fake_samples[i][k].pid; in add_hist_entries()
107 sample.tid = fake_samples[i][k].pid; in add_hist_entries()
108 sample.ip = fake_samples[i][k].ip; in add_hist_entries()
120 map__put(fake_samples[i][k].map); in add_hist_entries()
[all …]
/tools/testing/selftests/bpf/prog_tests/
A Dhashmap.c16 return k; in hash_fn()
56 long oldk, k = i; in test_hashmap_generic() local
93 long k = entry->key; in test_hashmap_generic() local
106 long oldk, k = i; in test_hashmap_generic() local
121 k, v, err)) in test_hashmap_generic()
141 long k = entry->key; in test_hashmap_generic() local
164 long oldk, k; in test_hashmap_generic() local
167 k = entry->key; in test_hashmap_generic()
198 long oldk, k; in test_hashmap_generic() local
201 k = entry->key; in test_hashmap_generic()
[all …]
/tools/testing/selftests/tc-testing/
A Dtdc_helper.py64 for k in tcase.keys():
65 if (isinstance(tcase[k], list)):
66 print(k + ":")
67 print_list(tcase[k])
69 if not ((k == 'id') or (k == 'name')):
70 print(k + ": " + str(tcase[k]))
/tools/testing/radix-tree/
A Dmultiorder.c98 int k; in multiorder_tagged_iteration() local
101 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
103 if (j <= (index[k] | ((1 << order[k]) - 1))) in multiorder_tagged_iteration()
110 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
112 mask = (1UL << order[k]) - 1; in multiorder_tagged_iteration()
117 assert(item->order == order[k]); in multiorder_tagged_iteration()
126 int mask, k; in multiorder_tagged_iteration() local
129 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
131 if (j <= (index[k] | ((1 << order[k]) - 1))) in multiorder_tagged_iteration()
137 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
[all …]
/tools/include/uapi/linux/
A Dfilter.h28 __u32 k; /* Generic multiuse field */ member
49 #define BPF_STMT(code, k) { (unsigned short)(code), 0, 0, k } argument
52 #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k } argument
/tools/testing/selftests/drivers/net/hw/
A Ddevlink_port_split.py107 def split(k, port, should_fail=False): argument
121 return create_split_group(port, k)
124 return create_split_group(port, k)
183 def create_split_group(port, k): argument
189 return list(port.name + "s" + str(i) for i in range(k))
192 def split_unsplittable_port(port, k): argument
198 new_split_group = split(k, port, should_fail=True)
204 def split_splittable_port(port, k, lanes, dev): argument
209 new_split_group = split(k, port)
219 test(exists_and_lanes(new_split_group, lanes/k, dev),
[all …]
/tools/testing/selftests/net/netfilter/
A Daudit_logread.c99 char *k, *v; in readlog() local
110 while ((k = strtok(NULL, "="))) { in readlog()
114 if (!strcmp(k, "pid") || in readlog()
115 !strcmp(k, "comm") || in readlog()
116 !strcmp(k, "subj")) in readlog()
120 if (!strcmp(k, "table")) in readlog()
123 printf("%s%s=%s", sep, k, v); in readlog()
/tools/testing/selftests/net/tcp_ao/lib/
A Dkconfig.c145 bool kernel_config_has(enum test_needs_kconfig k) in kernel_config_has() argument
150 if (kconfig[k]._error == KCONFIG_UNKNOWN) { in kernel_config_has()
151 if (kconfig[k].check_kconfig(&kconfig[k]._error)) in kernel_config_has()
152 test_error("Failed to initialize kconfig %u", k); in kernel_config_has()
154 ret = kconfig[k]._error == 0; in kernel_config_has()
/tools/thermal/tmon/
A Dsysfs.c285 int i, j, n, k = 0; in scan_tzones() local
305 ptdata.tzi[k].instance = i; in scan_tzones()
308 ptdata.tzi[k].nr_cdev = 0; in scan_tzones()
309 ptdata.tzi[k].nr_trip_pts = 0; in scan_tzones()
314 &ptdata.tzi[k], k)) in scan_tzones()
322 &ptdata.tzi[k], i, j)) in scan_tzones()
331 ptdata.tzi[k].nr_cdev); in scan_tzones()
332 k++; in scan_tzones()
343 int i, n, k = 0; in scan_cdevs() local
367 ptdata.cdi[k].instance = i; in scan_cdevs()
[all …]
/tools/lib/perf/
A Dcpumap.c412 int i, j, k; in perf_cpu_map__merge() local
429 i = j = k = 0; in perf_cpu_map__merge()
440 tmp_cpus[k++] = __perf_cpu_map__cpu(*orig, i++); in perf_cpu_map__merge()
443 tmp_cpus[k++] = __perf_cpu_map__cpu(other, j++); in perf_cpu_map__merge()
444 assert(k <= tmp_len); in perf_cpu_map__merge()
446 merged = cpu_map__trim_new(k, tmp_cpus); in perf_cpu_map__merge()
458 int i, j, k; in perf_cpu_map__intersect() local
471 i = j = k = 0; in perf_cpu_map__intersect()
479 tmp_cpus[k++] = __perf_cpu_map__cpu(orig, i++); in perf_cpu_map__intersect()
482 if (k) in perf_cpu_map__intersect()
[all …]
/tools/perf/tests/shell/
A Damd-ibs-swfilt.sh35 perf record -B -e ibs_op/swfilt=1/k -o /dev/null true
49 perf record -aB --synth=no -e ibs_op/swfilt/k -o /dev/null true
63 user_sample=$(perf record -e ibs_fetch/swfilt/k -o- true | perf script -i- -F misc | grep -c ^U)
/tools/testing/selftests/tc-testing/plugin-lib/
A DscapyPlugin.py40 for k in scapy_keys:
41 if k not in scapyinfo:
43 missing_keys.append(k)
/tools/testing/selftests/kvm/x86/
A Dpmu_counters_test.c570 uint32_t k; in test_intel_counters() local
621 for (k = 1; k < (BIT(NR_INTEL_ARCH_EVENTS) - 1); k++) in test_intel_counters()
622 test_arch_events(v, perf_caps[i], NR_INTEL_ARCH_EVENTS, k); in test_intel_counters()
635 for (k = 0; k < NR_INTEL_ARCH_EVENTS; k++) in test_intel_counters()
636 test_arch_events(v, perf_caps[i], j, BIT(k)); in test_intel_counters()
647 for (k = 0; k <= (BIT(nr_fixed_counters) - 1); k++) in test_intel_counters()
648 test_fixed_counters(v, perf_caps[i], j, k); in test_intel_counters()
/tools/net/ynl/pyynl/
A Dynl_gen_rst.py243 for k in definition.keys():
244 if k in preprocessed + ignored:
246 lines.append(rst_fields(k, sanitize(definition[k]), 0))
278 for k in attr.keys():
279 if k in preprocessed + ignored:
281 if k in linkable:
282 value = rst_ref(namespace, k, attr[k])
284 value = sanitize(attr[k])
285 lines.append(rst_fields(k, value, 0))
/tools/testing/selftests/drivers/net/
A Dstats.py185 for k in qstat:
186 ksft_ge(qstat2[k], qstat[k], comment=f"{k} went backwards on device down")
203 for k in old.keys():
204 ksft_ge(new[k], old[k])
205 ksft_lt(new[k] - old[k], 1 << 31, comment="likely wrapping error")

Completed in 36 milliseconds

123456