Lines Matching refs:assert
52 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
56 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_hashmap()
61 assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 && in test_hashmap()
65 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
69 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); in test_hashmap()
72 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 && in test_hashmap()
77 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); in test_hashmap()
83 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_hashmap()
88 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); in test_hashmap()
90 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
92 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_hashmap()
97 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT); in test_hashmap()
100 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap()
102 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_hashmap()
104 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_hashmap()
107 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && in test_hashmap()
112 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap()
114 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap()
115 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT); in test_hashmap()
119 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 && in test_hashmap()
121 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 && in test_hashmap()
167 assert(!(expected_key_mask & key)); in test_hashmap_percpu()
168 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0); in test_hashmap_percpu()
172 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 && in test_hashmap_percpu()
177 assert(bpf_map_update_elem(fd, &key, value, -1) == -1 && in test_hashmap_percpu()
184 assert(bpf_map_lookup_elem(fd, &key, value) == 0 && in test_hashmap_percpu()
189 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT); in test_hashmap_percpu()
192 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 && in test_hashmap_percpu()
197 assert(!(expected_key_mask & key)); in test_hashmap_percpu()
198 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0); in test_hashmap_percpu()
205 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 && in test_hashmap_percpu()
209 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT); in test_hashmap_percpu()
212 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap_percpu()
216 assert(next_key == first_key); in test_hashmap_percpu()
219 assert((expected_key_mask & next_key) == next_key); in test_hashmap_percpu()
222 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0); in test_hashmap_percpu()
225 assert(bpf_percpu(value, i) == i + 100); in test_hashmap_percpu()
229 assert(errno == ENOENT); in test_hashmap_percpu()
233 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0); in test_hashmap_percpu()
237 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap_percpu()
239 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap_percpu()
240 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT); in test_hashmap_percpu()
244 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 && in test_hashmap_percpu()
246 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 && in test_hashmap_percpu()
285 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
288 assert(i == max_entries); in test_hashmap_walk()
290 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_hashmap_walk()
293 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
295 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); in test_hashmap_walk()
299 assert(i == max_entries); in test_hashmap_walk()
304 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
305 assert(value - 1 == key); in test_hashmap_walk()
308 assert(i == max_entries); in test_hashmap_walk()
360 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_arraymap()
363 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_arraymap()
367 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_arraymap()
371 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); in test_arraymap()
377 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 && in test_arraymap()
381 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); in test_arraymap()
384 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 && in test_arraymap()
386 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_arraymap()
388 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_arraymap()
390 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && in test_arraymap()
395 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL); in test_arraymap()
418 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); in test_arraymap_percpu()
421 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 && in test_arraymap_percpu()
425 assert(bpf_map_lookup_elem(fd, &key, values) == 0 && in test_arraymap_percpu()
430 assert(bpf_map_lookup_elem(fd, &key, values) == 0 && in test_arraymap_percpu()
436 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 && in test_arraymap_percpu()
440 assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT); in test_arraymap_percpu()
443 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 && in test_arraymap_percpu()
445 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_arraymap_percpu()
447 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_arraymap_percpu()
449 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && in test_arraymap_percpu()
454 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL); in test_arraymap_percpu()
481 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); in test_arraymap_percpu_many_keys()
487 assert(bpf_map_lookup_elem(fd, &key, values) == 0); in test_arraymap_percpu_many_keys()
490 assert(bpf_percpu(values, i) == i + 10); in test_arraymap_percpu_many_keys()
539 assert(fd < 0 && errno == EINVAL); in test_queuemap()
545 assert(fd < 0 && errno == EINVAL); in test_queuemap()
555 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); in test_queuemap()
558 assert(bpf_map_update_elem(fd, NULL, &val, 0) == -1 && in test_queuemap()
562 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]); in test_queuemap()
566 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); in test_queuemap()
570 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 && in test_queuemap()
574 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == -1 && in test_queuemap()
578 assert(bpf_map_delete_elem(fd, NULL) == -1 && errno == EINVAL); in test_queuemap()
579 assert(bpf_map_get_next_key(fd, NULL, NULL) == -1 && errno == EINVAL); in test_queuemap()
597 assert(fd < 0 && errno == EINVAL); in test_stackmap()
603 assert(fd < 0 && errno == EINVAL); in test_stackmap()
613 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); in test_stackmap()
616 assert(bpf_map_update_elem(fd, NULL, &val, 0) == -1 && in test_stackmap()
620 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]); in test_stackmap()
624 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); in test_stackmap()
628 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 && in test_stackmap()
632 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == -1 && in test_stackmap()
636 assert(bpf_map_delete_elem(fd, NULL) == -1 && errno == EINVAL); in test_stackmap()
637 assert(bpf_map_get_next_key(fd, NULL, NULL) == -1 && errno == EINVAL); in test_stackmap()
1089 assert(waitpid(pid[i], &status, 0) == pid[i]); in test_sockmap()
1090 assert(status == 0); in test_sockmap()
1244 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); in test_map_large()
1248 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_map_large()
1252 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_map_large()
1255 assert(bpf_map_get_next_key(fd, &key, &key) == 0); in test_map_large()
1256 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT); in test_map_large()
1259 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); in test_map_large()
1261 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); in test_map_large()
1293 assert(waitpid(pid[i], &status, 0) == pid[i]); in __run_parallel()
1294 assert(status == 0); in __run_parallel()
1324 assert(bpf_map_update_elem(fd, &key, &value, in test_update_delete()
1326 assert(bpf_map_update_elem(fd, &key, &value, in test_update_delete()
1329 assert(bpf_map_delete_elem(fd, &key) == 0); in test_update_delete()
1357 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_map_parallel()
1361 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_map_parallel()
1364 assert(bpf_map_get_next_key(fd, &key, &key) == 0); in test_map_parallel()
1365 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT); in test_map_parallel()
1371 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && in test_map_parallel()
1381 assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT); in test_map_parallel()
1382 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT); in test_map_parallel()
1400 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == -1 && in test_map_rdonly()
1404 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); in test_map_rdonly()
1405 assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == ENOENT); in test_map_rdonly()
1425 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_map_wronly_hash()
1428 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == EPERM); in test_map_wronly_hash()
1429 assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == EPERM); in test_map_wronly_hash()
1438 assert(map_type == BPF_MAP_TYPE_QUEUE || in test_map_wronly_stack_or_queue()
1444 assert(fd < 0 && errno == EINVAL); in test_map_wronly_stack_or_queue()
1453 assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0); in test_map_wronly_stack_or_queue()
1456 assert(bpf_map_lookup_elem(fd, NULL, &value) == -1 && errno == EPERM); in test_map_wronly_stack_or_queue()
1459 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) == -1 && in test_map_wronly_stack_or_queue()
1508 assert(map_elem_size == sizeof(__u32)); in prepare_reuseport_grp()