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 BPF_DECLARE_PERCPU(long, value);
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(bpf_percpu(value, 0)), 2, map_flags);
148 printf("Failed to create hashmap '%s'!\n", strerror(errno));
152 for (i = 0; i < nr_cpus; i++)
153 bpf_percpu(value, i) = i + 100;
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.
173 bpf_percpu(value, 0) = 1;
174 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
175 bpf_percpu(value, 0) == 100);
178 /* Check that key=2 is not found. */
179 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT);
181 /* BPF_EXIST means update existing element. */
182 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 &&
183 /* key=2 is not there. */
186 /* Insert key=2 element. */
187 assert(!(expected_key_mask & key));
188 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
189 expected_key_mask |= key;
191 /* key=1 and key=2 were inserted, check that key=0 cannot be
192 * inserted due to max_entries limit.
195 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
198 /* Check that key = 0 doesn't exist. */
199 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
201 /* Iterate over two elements. */
202 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
203 ((expected_key_mask & first_key) == first_key));
204 while (!bpf_map_get_next_key(fd, &key, &next_key)) {
206 assert(next_key == first_key);
209 assert((expected_key_mask & next_key) == next_key);
210 expected_key_mask &= ~next_key;
212 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
214 for (i = 0; i < nr_cpus; i++)
215 assert(bpf_percpu(value, i) == i + 100);
219 assert(errno == ENOENT);
221 /* Update with BPF_EXIST. */
223 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
225 /* Delete both elements. */
227 assert(bpf_map_delete_elem(fd, &key) == 0);
229 assert(bpf_map_delete_elem(fd, &key) == 0);
230 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
233 /* Check that map is empty. */
234 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
236 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
242 static void test_arraymap(int task, void *data)
244 int key, next_key, fd;
247 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value),
250 printf("Failed to create arraymap '%s'!\n", strerror(errno));
256 /* Insert key=1 element. */
257 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
260 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
263 /* Check that key=1 can be found. */
264 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
267 /* Check that key=0 is also found and zero initialized. */
268 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
270 /* key=0 and key=1 were inserted, check that key=2 cannot be inserted
271 * due to max_entries limit.
274 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
277 /* Check that key = 2 doesn't exist. */
278 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
280 /* Iterate over two elements. */
281 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
283 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
285 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
287 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
290 /* Delete shouldn't succeed. */
292 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
297 static void test_arraymap_percpu(int task, void *data)
299 unsigned int nr_cpus = bpf_num_possible_cpus();
300 BPF_DECLARE_PERCPU(long, values);
301 int key, next_key, fd, i;
303 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
304 sizeof(bpf_percpu(values, 0)), 2, 0);
306 printf("Failed to create arraymap '%s'!\n", strerror(errno));
310 for (i = 0; i < nr_cpus; i++)
311 bpf_percpu(values, i) = i + 100;
314 /* Insert key=1 element. */
315 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
317 bpf_percpu(values, 0) = 0;
318 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&
321 /* Check that key=1 can be found. */
322 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
323 bpf_percpu(values, 0) == 100);
326 /* Check that key=0 is also found and zero initialized. */
327 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
328 bpf_percpu(values, 0) == 0 &&
329 bpf_percpu(values, nr_cpus - 1) == 0);
331 /* Check that key=2 cannot be inserted due to max_entries limit. */
333 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 &&
336 /* Check that key = 2 doesn't exist. */
337 assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT);
339 /* Iterate over two elements. */
340 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
342 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
344 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
346 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
349 /* Delete shouldn't succeed. */
351 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
356 static void test_arraymap_percpu_many_keys(void)
358 unsigned int nr_cpus = bpf_num_possible_cpus();
359 BPF_DECLARE_PERCPU(long, values);
360 /* nr_keys is not too large otherwise the test stresses percpu
361 * allocator more than anything else
363 unsigned int nr_keys = 2000;
366 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
367 sizeof(bpf_percpu(values, 0)), nr_keys, 0);
369 printf("Failed to create per-cpu arraymap '%s'!\n",
374 for (i = 0; i < nr_cpus; i++)
375 bpf_percpu(values, i) = i + 10;
377 for (key = 0; key < nr_keys; key++)
378 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
380 for (key = 0; key < nr_keys; key++) {
381 for (i = 0; i < nr_cpus; i++)
382 bpf_percpu(values, i) = 0;
384 assert(bpf_map_lookup_elem(fd, &key, values) == 0);
386 for (i = 0; i < nr_cpus; i++)
387 assert(bpf_percpu(values, i) == i + 10);
393 #define MAP_SIZE (32 * 1024)
395 static void test_map_large(void)
404 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
405 MAP_SIZE, map_flags);
407 printf("Failed to create large map '%s'!\n", strerror(errno));
411 for (i = 0; i < MAP_SIZE; i++) {
412 key = (struct bigkey) { .c = i };
415 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
419 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
422 /* Iterate through all elements. */
423 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
425 for (i = 0; i < MAP_SIZE; i++)
426 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
427 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
430 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
432 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
437 static void run_parallel(int tasks, void (*fn)(int task, void *data),
443 for (i = 0; i < tasks; i++) {
448 } else if (pid[i] == -1) {
449 printf("Couldn't spawn #%d process!\n", i);
454 for (i = 0; i < tasks; i++) {
457 assert(waitpid(pid[i], &status, 0) == pid[i]);
462 static void test_map_stress(void)
464 run_parallel(100, test_hashmap, NULL);
465 run_parallel(100, test_hashmap_percpu, NULL);
466 run_parallel(100, test_hashmap_sizes, NULL);
468 run_parallel(100, test_arraymap, NULL);
469 run_parallel(100, test_arraymap_percpu, NULL);
477 static void do_work(int fn, void *data)
479 int do_update = ((int *)data)[1];
480 int fd = ((int *)data)[0];
483 for (i = fn; i < MAP_SIZE; i += TASKS) {
487 assert(bpf_map_update_elem(fd, &key, &value,
489 assert(bpf_map_update_elem(fd, &key, &value,
492 assert(bpf_map_delete_elem(fd, &key) == 0);
497 static void test_map_parallel(void)
499 int i, fd, key = 0, value = 0;
502 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
503 MAP_SIZE, map_flags);
505 printf("Failed to create map for parallel test '%s'!\n",
510 /* Use the same fd in children to add elements to this map:
511 * child_0 adds key=0, key=1024, key=2048, ...
512 * child_1 adds key=1, key=1025, key=2049, ...
513 * child_1023 adds key=1023, ...
517 run_parallel(TASKS, do_work, data);
519 /* Check that key=0 is already there. */
520 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
523 /* Check that all elements were inserted. */
524 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
526 for (i = 0; i < MAP_SIZE; i++)
527 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
528 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
530 /* Another check for all elements */
531 for (i = 0; i < MAP_SIZE; i++) {
532 key = MAP_SIZE - i - 1;
534 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
538 /* Now let's delete all elemenets in parallel. */
540 run_parallel(TASKS, do_work, data);
542 /* Nothing should be left. */
544 assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT);
545 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
548 static void run_all_tests(void)
550 test_hashmap(0, NULL);
551 test_hashmap_percpu(0, NULL);
553 test_arraymap(0, NULL);
554 test_arraymap_percpu(0, NULL);
556 test_arraymap_percpu_many_keys();
565 struct rlimit rinf = { RLIM_INFINITY, RLIM_INFINITY };
567 setrlimit(RLIMIT_MEMLOCK, &rinf);
572 map_flags = BPF_F_NO_PREALLOC;
575 printf("test_maps: OK\n");