Lines Matching refs:key
52 printf("key:%llu not found from map. %s(%d)\n",
57 printf("key:%llu value0:%llu != value1:%llu\n",
90 * Add key=1 (+1 key)
91 * Add key=2 (+1 key)
92 * Lookup Key=1
93 * Add Key=3
94 * => Key=2 will be removed by LRU
95 * Iterate map. Only found key=1 and key=3
99 unsigned long long key, value[nr_cpus];
119 /* insert key=1 element */
121 key = 1;
122 assert(!bpf_map_update_elem(lru_map_fd, &key, value, BPF_NOEXIST));
123 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
127 assert(bpf_map_update_elem(lru_map_fd, &key, value, BPF_NOEXIST) == -1
128 /* key=1 already exists */
131 assert(bpf_map_update_elem(lru_map_fd, &key, value, -1) == -1 &&
134 /* insert key=2 element */
136 /* check that key=2 is not found */
137 key = 2;
138 assert(bpf_map_lookup_elem(lru_map_fd, &key, value) == -1 &&
142 assert(bpf_map_update_elem(lru_map_fd, &key, value, BPF_EXIST) == -1 &&
143 /* key=2 is not there */
146 assert(!bpf_map_update_elem(lru_map_fd, &key, value, BPF_NOEXIST));
148 /* insert key=3 element */
150 /* check that key=3 is not found */
151 key = 3;
152 assert(bpf_map_lookup_elem(lru_map_fd, &key, value) == -1 &&
155 /* check that key=1 can be found and mark the ref bit to
156 * stop LRU from removing key=1
158 key = 1;
159 assert(!bpf_map_lookup_elem(lru_map_fd, &key, value));
162 key = 3;
163 assert(!bpf_map_update_elem(lru_map_fd, &key, value, BPF_NOEXIST));
164 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
167 /* key=2 has been removed from the LRU */
168 key = 2;
169 assert(bpf_map_lookup_elem(lru_map_fd, &key, value) == -1);
187 unsigned long long key, end_key, value[nr_cpus];
216 for (key = 1; key < end_key; key++)
217 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
222 for (key = 1; key < end_key; key++) {
223 assert(!bpf_map_lookup_elem(lru_map_fd, &key, value));
224 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
232 key = 1 + tgt_free;
233 end_key = key + tgt_free;
234 for (; key < end_key; key++) {
235 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
237 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
257 * => Key 1+tgt_free to tgt_free*3/2
263 unsigned long long key, value[nr_cpus];
293 for (key = 1; key < end_key; key++)
294 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
305 * Hence, the oldest key 1 to tgt_free/2
308 key = 1;
310 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
312 assert(!bpf_map_delete_elem(lru_map_fd, &key));
314 assert(bpf_map_update_elem(lru_map_fd, &key, value,
323 for (key = 1; key < end_key; key++) {
324 assert(bpf_map_lookup_elem(lru_map_fd, &key, value));
325 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
327 assert(!bpf_map_lookup_elem(lru_map_fd, &key, value));
329 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
337 for (key = 1 + tgt_free; key < end_key; key++)
341 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
345 end_key = key + tgt_free;
346 for (; key < end_key; key++) {
347 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
349 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
364 * Lookup key 1 to tgt_free*3/2
366 * => key 1+tgt_free*3/2 to 2*tgt_free are removed from LRU
370 unsigned long long key, end_key, value[nr_cpus];
399 for (key = 1; key < end_key; key++)
400 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
403 /* Lookup key 1 to tgt_free*3/2 */
405 for (key = 1; key < end_key; key++) {
406 assert(!bpf_map_lookup_elem(lru_map_fd, &key, value));
407 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
414 key = 2 * tgt_free + 1;
415 end_key = key + batch_size;
416 for (; key < end_key; key++) {
417 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
419 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
435 unsigned long long key, value[nr_cpus];
457 for (key = 1; key <= 2 * tgt_free; key++)
458 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
461 key = 1;
462 assert(bpf_map_update_elem(lru_map_fd, &key, value, BPF_NOEXIST));
464 for (key = 1; key <= tgt_free; key++) {
465 assert(!bpf_map_lookup_elem(lru_map_fd, &key, value));
466 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
470 for (; key <= 2 * tgt_free; key++) {
471 assert(!bpf_map_delete_elem(lru_map_fd, &key));
472 assert(bpf_map_delete_elem(lru_map_fd, &key));
475 end_key = key + 2 * tgt_free;
476 for (; key < end_key; key++) {
477 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
479 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
493 unsigned long long key, value[nr_cpus];
495 /* Ensure the last key inserted by previous CPU can be found */
500 key = last_key + 1;
501 assert(!bpf_map_update_elem(map_fd, &key, value, BPF_NOEXIST));
502 assert(!bpf_map_lookup_elem(map_fd, &key, value));
504 /* Cannot find the last key because it was removed by LRU */
511 unsigned long long key, value[nr_cpus];
525 key = 0;
526 assert(!bpf_map_update_elem(map_fd, &key, value, BPF_NOEXIST));
533 do_test_lru_sanity5(key, map_fd);
536 printf("couldn't spawn process to test key:%llu\n",
537 key);
544 key++;
549 /* At least one key should be tested */
550 assert(key > 0);
559 unsigned long long key, value[nr_cpus];
579 for (key = 1; key <= tgt_free; key++) {
580 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
582 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
586 for (; key <= tgt_free * 2; key++) {
589 /* Make ref bit sticky for key: [1, tgt_free] */
595 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
599 for (; key <= tgt_free * 3; key++) {
600 assert(!bpf_map_update_elem(lru_map_fd, &key, value,
602 assert(!bpf_map_update_elem(expected_map_fd, &key, value,
