Lines Matching full:assert
13 #include <assert.h>
51 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
55 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
60 assert(bpf_map_update_elem(fd, &key, &value, -1) < 0 && in test_hashmap()
64 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
69 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
72 assert(bpf_map_lookup_and_delete_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
75 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT); in test_hashmap()
78 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 && in test_hashmap()
83 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); in test_hashmap()
89 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
94 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); in test_hashmap()
96 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
98 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
103 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT); in test_hashmap()
106 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap()
108 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_hashmap()
110 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_hashmap()
113 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 && in test_hashmap()
118 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap()
120 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap()
121 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT); in test_hashmap()
125 assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 && in test_hashmap()
127 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 && in test_hashmap()
172 assert(!(expected_key_mask & key)); in test_hashmap_percpu()
173 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0); in test_hashmap_percpu()
176 assert(bpf_map_lookup_and_delete_elem(fd, &key, value) == 0 && in test_hashmap_percpu()
183 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0); in test_hashmap_percpu()
187 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 && in test_hashmap_percpu()
192 assert(bpf_map_update_elem(fd, &key, value, -1) < 0 && in test_hashmap_percpu()
199 assert(bpf_map_lookup_elem(fd, &key, value) == 0 && in test_hashmap_percpu()
204 assert(bpf_map_lookup_elem(fd, &key, value) < 0 && errno == ENOENT); in test_hashmap_percpu()
207 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 0 && in test_hashmap_percpu()
212 assert(!(expected_key_mask & key)); in test_hashmap_percpu()
213 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0); in test_hashmap_percpu()
220 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 && in test_hashmap_percpu()
224 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT); in test_hashmap_percpu()
227 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap_percpu()
231 assert(next_key == first_key); in test_hashmap_percpu()
234 assert((expected_key_mask & next_key) == next_key); in test_hashmap_percpu()
237 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0); in test_hashmap_percpu()
240 assert(bpf_percpu(value, i) == i + 100); in test_hashmap_percpu()
244 assert(errno == ENOENT); in test_hashmap_percpu()
248 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0); in test_hashmap_percpu()
252 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap_percpu()
254 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap_percpu()
255 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT); in test_hashmap_percpu()
259 assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 && in test_hashmap_percpu()
261 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 && in test_hashmap_percpu()
301 assert(bpf_map_lookup_elem(fd, &key, value) == 0); in test_hashmap_walk()
304 assert(i == max_entries); in test_hashmap_walk()
306 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_hashmap_walk()
309 assert(bpf_map_lookup_elem(fd, &key, value) == 0); in test_hashmap_walk()
311 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0); in test_hashmap_walk()
315 assert(i == max_entries); in test_hashmap_walk()
320 assert(bpf_map_lookup_elem(fd, &key, value) == 0); in test_hashmap_walk()
321 assert(value[0] - 1 == key); in test_hashmap_walk()
324 assert(i == max_entries); in test_hashmap_walk()
375 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_arraymap()
378 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_arraymap()
382 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_arraymap()
386 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); in test_arraymap()
392 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 && in test_arraymap()
396 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT); in test_arraymap()
399 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 && in test_arraymap()
401 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_arraymap()
403 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_arraymap()
405 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 && in test_arraymap()
410 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL); in test_arraymap()
433 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); in test_arraymap_percpu()
436 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 && in test_arraymap_percpu()
440 assert(bpf_map_lookup_elem(fd, &key, values) == 0 && in test_arraymap_percpu()
445 assert(bpf_map_lookup_elem(fd, &key, values) == 0 && in test_arraymap_percpu()
451 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) < 0 && in test_arraymap_percpu()
455 assert(bpf_map_lookup_elem(fd, &key, values) < 0 && errno == ENOENT); in test_arraymap_percpu()
458 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 && in test_arraymap_percpu()
460 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_arraymap_percpu()
462 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_arraymap_percpu()
464 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 && in test_arraymap_percpu()
469 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL); in test_arraymap_percpu()
496 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); in test_arraymap_percpu_many_keys()
502 assert(bpf_map_lookup_elem(fd, &key, values) == 0); in test_arraymap_percpu_many_keys()
505 assert(bpf_percpu(values, i) == i + 10); in test_arraymap_percpu_many_keys()
551 assert(fd < 0 && errno == EINVAL); in test_queuemap()
556 assert(fd < 0 && errno == EINVAL); in test_queuemap()
566 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); in test_queuemap()
569 assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 && in test_queuemap()
573 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]); in test_queuemap()
577 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); in test_queuemap()
581 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 && in test_queuemap()
585 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 && in test_queuemap()
589 assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL); in test_queuemap()
590 assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL); in test_queuemap()
607 assert(fd < 0 && errno == EINVAL); in test_stackmap()
612 assert(fd < 0 && errno == EINVAL); in test_stackmap()
622 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); in test_stackmap()
625 assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 && in test_stackmap()
629 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]); in test_stackmap()
633 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); in test_stackmap()
637 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 && in test_stackmap()
641 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 && in test_stackmap()
645 assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL); in test_stackmap()
646 assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL); in test_stackmap()
1099 assert(waitpid(pid[i], &status, 0) == pid[i]); in test_sockmap()
1100 assert(status == 0); in test_sockmap()
1325 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); in test_map_large()
1329 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_map_large()
1333 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_map_large()
1336 assert(bpf_map_get_next_key(fd, &key, &key) == 0); in test_map_large()
1337 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT); in test_map_large()
1340 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); in test_map_large()
1342 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT); in test_map_large()
1374 assert(waitpid(pid[i], &status, 0) == pid[i]); in __run_parallel()
1375 assert(status == 0); in __run_parallel()
1451 assert(err == 0); in test_update_delete()
1455 assert(err == 0); in test_update_delete()
1460 assert(err == 0); in test_update_delete()
1489 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_map_parallel()
1493 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_map_parallel()
1496 assert(bpf_map_get_next_key(fd, &key, &key) == 0); in test_map_parallel()
1497 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT); in test_map_parallel()
1503 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && in test_map_parallel()
1513 assert(bpf_map_get_next_key(fd, NULL, &key) < 0 && errno == ENOENT); in test_map_parallel()
1514 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT); in test_map_parallel()
1542 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) < 0 && in test_map_rdonly()
1546 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT); in test_map_rdonly()
1547 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == ENOENT); in test_map_rdonly()
1571 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_map_wronly_hash()
1574 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == EPERM); in test_map_wronly_hash()
1575 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == EPERM); in test_map_wronly_hash()
1586 assert(map_type == BPF_MAP_TYPE_QUEUE || in test_map_wronly_stack_or_queue()
1594 assert(fd < 0 && errno == EINVAL); in test_map_wronly_stack_or_queue()
1603 assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0); in test_map_wronly_stack_or_queue()
1606 assert(bpf_map_lookup_elem(fd, NULL, &value) < 0 && errno == EPERM); in test_map_wronly_stack_or_queue()
1609 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) < 0 && in test_map_wronly_stack_or_queue()
1658 assert(map_elem_size == sizeof(__u32)); in prepare_reuseport_grp()