2 * Testsuite for eBPF maps
4 * Copyright (c) 2014 PLUMgrid, http://plumgrid.com
5 * Copyright (c) 2016 Facebook
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of version 2 of the GNU General Public
9 * License as published by the Free Software Foundation.
20 #include <sys/resource.h>
22 #include <linux/bpf.h>
29 static void test_hashmap(int task, void *data)
31 long long key, next_key, first_key, value;
34 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
37 printf("Failed to create hashmap '%s'!\n", strerror(errno));
43 /* Insert key=1 element. */
44 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
47 /* BPF_NOEXIST means add new element if it doesn't exist. */
48 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
49 /* key=1 already exists. */
52 /* -1 is an invalid flag. */
53 assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 &&
56 /* Check that key=1 can be found. */
57 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
60 /* Check that key=2 is not found. */
61 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
63 /* BPF_EXIST means update existing element. */
64 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
65 /* key=2 is not there. */
68 /* Insert key=2 element. */
69 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
71 /* key=1 and key=2 were inserted, check that key=0 cannot be
72 * inserted due to max_entries limit.
75 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
78 /* Update existing element, though the map is full. */
80 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
82 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
84 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
87 /* Check that key = 0 doesn't exist. */
89 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
91 /* Iterate over two elements. */
92 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
93 (first_key == 1 || first_key == 2));
94 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
95 (next_key == first_key));
96 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
97 (next_key == 1 || next_key == 2) &&
98 (next_key != first_key));
99 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
102 /* Delete both elements. */
104 assert(bpf_map_delete_elem(fd, &key) == 0);
106 assert(bpf_map_delete_elem(fd, &key) == 0);
107 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
110 /* Check that map is empty. */
111 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
113 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
119 static void test_hashmap_sizes(int task, void *data)
123 for (i = 1; i <= 512; i <<= 1)
124 for (j = 1; j <= 1 << 18; j <<= 1) {
125 fd = bpf_create_map(BPF_MAP_TYPE_HASH, i, j,
128 printf("Failed to create hashmap key=%d value=%d '%s'\n",
129 i, j, strerror(errno));
133 usleep(10); /* give kernel time to destroy */
137 static void test_hashmap_percpu(int task, void *data)
139 unsigned int nr_cpus = bpf_num_possible_cpus();
140 long long value[nr_cpus];
141 long long key, next_key, first_key;
142 int expected_key_mask = 0;
145 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_HASH, sizeof(key),
146 sizeof(value[0]), 2, map_flags);
148 printf("Failed to create hashmap '%s'!\n", strerror(errno));
152 for (i = 0; i < nr_cpus; i++)
156 /* Insert key=1 element. */
157 assert(!(expected_key_mask & key));
158 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
159 expected_key_mask |= key;
161 /* BPF_NOEXIST means add new element if it doesn't exist. */
162 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
163 /* key=1 already exists. */
166 /* -1 is an invalid flag. */
167 assert(bpf_map_update_elem(fd, &key, value, -1) == -1 &&
170 /* Check that key=1 can be found. Value could be 0 if the lookup
171 * was run from a different CPU.
174 assert(bpf_map_lookup_elem(fd, &key, value) == 0 && value[0] == 100);
177 /* Check that key=2 is not found. */
178 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT);
180 /* BPF_EXIST means update existing element. */
181 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 &&
182 /* key=2 is not there. */
185 /* Insert key=2 element. */
186 assert(!(expected_key_mask & key));
187 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
188 expected_key_mask |= key;
190 /* key=1 and key=2 were inserted, check that key=0 cannot be
191 * inserted due to max_entries limit.
194 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
197 /* Check that key = 0 doesn't exist. */
198 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
200 /* Iterate over two elements. */
201 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
202 ((expected_key_mask & first_key) == first_key));
203 while (!bpf_map_get_next_key(fd, &key, &next_key)) {
205 assert(next_key == first_key);
208 assert((expected_key_mask & next_key) == next_key);
209 expected_key_mask &= ~next_key;
211 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
213 for (i = 0; i < nr_cpus; i++)
214 assert(value[i] == i + 100);
218 assert(errno == ENOENT);
220 /* Update with BPF_EXIST. */
222 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
224 /* Delete both elements. */
226 assert(bpf_map_delete_elem(fd, &key) == 0);
228 assert(bpf_map_delete_elem(fd, &key) == 0);
229 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
232 /* Check that map is empty. */
233 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
235 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
241 static void test_arraymap(int task, void *data)
243 int key, next_key, fd;
246 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value),
249 printf("Failed to create arraymap '%s'!\n", strerror(errno));
255 /* Insert key=1 element. */
256 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
259 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
262 /* Check that key=1 can be found. */
263 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
266 /* Check that key=0 is also found and zero initialized. */
267 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
269 /* key=0 and key=1 were inserted, check that key=2 cannot be inserted
270 * due to max_entries limit.
273 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
276 /* Check that key = 2 doesn't exist. */
277 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
279 /* Iterate over two elements. */
280 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
282 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
284 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
286 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
289 /* Delete shouldn't succeed. */
291 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
296 static void test_arraymap_percpu(int task, void *data)
298 unsigned int nr_cpus = bpf_num_possible_cpus();
299 int key, next_key, fd, i;
300 long long values[nr_cpus];
302 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
303 sizeof(values[0]), 2, 0);
305 printf("Failed to create arraymap '%s'!\n", strerror(errno));
309 for (i = 0; i < nr_cpus; i++)
313 /* Insert key=1 element. */
314 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
317 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&
320 /* Check that key=1 can be found. */
321 assert(bpf_map_lookup_elem(fd, &key, values) == 0 && values[0] == 100);
324 /* Check that key=0 is also found and zero initialized. */
325 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
326 values[0] == 0 && values[nr_cpus - 1] == 0);
328 /* Check that key=2 cannot be inserted due to max_entries limit. */
330 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 &&
333 /* Check that key = 2 doesn't exist. */
334 assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT);
336 /* Iterate over two elements. */
337 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
339 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
341 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
343 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
346 /* Delete shouldn't succeed. */
348 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
353 static void test_arraymap_percpu_many_keys(void)
355 unsigned int nr_cpus = bpf_num_possible_cpus();
356 /* nr_keys is not too large otherwise the test stresses percpu
357 * allocator more than anything else
359 unsigned int nr_keys = 2000;
360 long long values[nr_cpus];
363 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
364 sizeof(values[0]), nr_keys, 0);
366 printf("Failed to create per-cpu arraymap '%s'!\n",
371 for (i = 0; i < nr_cpus; i++)
374 for (key = 0; key < nr_keys; key++)
375 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
377 for (key = 0; key < nr_keys; key++) {
378 for (i = 0; i < nr_cpus; i++)
381 assert(bpf_map_lookup_elem(fd, &key, values) == 0);
383 for (i = 0; i < nr_cpus; i++)
384 assert(values[i] == i + 10);
390 #define MAP_SIZE (32 * 1024)
392 static void test_map_large(void)
401 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
402 MAP_SIZE, map_flags);
404 printf("Failed to create large map '%s'!\n", strerror(errno));
408 for (i = 0; i < MAP_SIZE; i++) {
409 key = (struct bigkey) { .c = i };
412 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
416 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
419 /* Iterate through all elements. */
420 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
422 for (i = 0; i < MAP_SIZE; i++)
423 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
424 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
427 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
429 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
434 static void run_parallel(int tasks, void (*fn)(int task, void *data),
440 for (i = 0; i < tasks; i++) {
445 } else if (pid[i] == -1) {
446 printf("Couldn't spawn #%d process!\n", i);
451 for (i = 0; i < tasks; i++) {
454 assert(waitpid(pid[i], &status, 0) == pid[i]);
459 static void test_map_stress(void)
461 run_parallel(100, test_hashmap, NULL);
462 run_parallel(100, test_hashmap_percpu, NULL);
463 run_parallel(100, test_hashmap_sizes, NULL);
465 run_parallel(100, test_arraymap, NULL);
466 run_parallel(100, test_arraymap_percpu, NULL);
474 static void do_work(int fn, void *data)
476 int do_update = ((int *)data)[1];
477 int fd = ((int *)data)[0];
480 for (i = fn; i < MAP_SIZE; i += TASKS) {
484 assert(bpf_map_update_elem(fd, &key, &value,
486 assert(bpf_map_update_elem(fd, &key, &value,
489 assert(bpf_map_delete_elem(fd, &key) == 0);
494 static void test_map_parallel(void)
496 int i, fd, key = 0, value = 0;
499 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
500 MAP_SIZE, map_flags);
502 printf("Failed to create map for parallel test '%s'!\n",
507 /* Use the same fd in children to add elements to this map:
508 * child_0 adds key=0, key=1024, key=2048, ...
509 * child_1 adds key=1, key=1025, key=2049, ...
510 * child_1023 adds key=1023, ...
514 run_parallel(TASKS, do_work, data);
516 /* Check that key=0 is already there. */
517 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
520 /* Check that all elements were inserted. */
521 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
523 for (i = 0; i < MAP_SIZE; i++)
524 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
525 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
527 /* Another check for all elements */
528 for (i = 0; i < MAP_SIZE; i++) {
529 key = MAP_SIZE - i - 1;
531 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
535 /* Now let's delete all elemenets in parallel. */
537 run_parallel(TASKS, do_work, data);
539 /* Nothing should be left. */
541 assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT);
542 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
545 static void run_all_tests(void)
547 test_hashmap(0, NULL);
548 test_hashmap_percpu(0, NULL);
550 test_arraymap(0, NULL);
551 test_arraymap_percpu(0, NULL);
553 test_arraymap_percpu_many_keys();
562 struct rlimit rinf = { RLIM_INFINITY, RLIM_INFINITY };
564 setrlimit(RLIMIT_MEMLOCK, &rinf);
569 map_flags = BPF_F_NO_PREALLOC;
572 printf("test_maps: OK\n");