Lines Matching refs:assert
13 #include <assert.h>
51 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
55 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
60 assert(bpf_map_update_elem(fd, &key, &value, -1) < 0 &&
64 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
69 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
72 assert(bpf_map_lookup_and_delete_elem(fd, &key, &value) == 0 && value == 1234);
75 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
78 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&
83 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
89 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
94 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
96 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
98 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
103 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);
106 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
108 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
110 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
113 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
118 assert(bpf_map_delete_elem(fd, &key) == 0);
120 assert(bpf_map_delete_elem(fd, &key) == 0);
121 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);
125 assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&
127 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&
172 assert(!(expected_key_mask & key));
173 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
176 assert(bpf_map_lookup_and_delete_elem(fd, &key, value) == 0 &&
183 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
187 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&
192 assert(bpf_map_update_elem(fd, &key, value, -1) < 0 &&
199 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
204 assert(bpf_map_lookup_elem(fd, &key, value) < 0 && errno == ENOENT);
207 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 0 &&
212 assert(!(expected_key_mask & key));
213 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
220 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&
224 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);
227 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
231 assert(next_key == first_key);
234 assert((expected_key_mask & next_key) == next_key);
237 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
240 assert(bpf_percpu(value, i) == i + 100);
244 assert(errno == ENOENT);
248 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
252 assert(bpf_map_delete_elem(fd, &key) == 0);
254 assert(bpf_map_delete_elem(fd, &key) == 0);
255 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);
259 assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&
261 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&
301 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
304 assert(i == max_entries);
306 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
309 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
311 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
315 assert(i == max_entries);
320 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
321 assert(value[0] - 1 == key);
324 assert(i == max_entries);
375 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
378 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
382 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
386 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
392 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&
396 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
399 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
401 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
403 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
405 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
410 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL);
433 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
436 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 &&
440 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
445 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
451 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) < 0 &&
455 assert(bpf_map_lookup_elem(fd, &key, values) < 0 && errno == ENOENT);
458 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
460 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
462 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
464 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
469 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL);
496 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
502 assert(bpf_map_lookup_elem(fd, &key, values) == 0);
505 assert(bpf_percpu(values, i) == i + 10);
551 assert(fd < 0 && errno == EINVAL);
556 assert(fd < 0 && errno == EINVAL);
566 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);
569 assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 &&
573 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]);
577 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);
581 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 &&
585 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 &&
589 assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL);
590 assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL);
607 assert(fd < 0 && errno == EINVAL);
612 assert(fd < 0 && errno == EINVAL);
622 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);
625 assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 &&
629 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]);
633 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);
637 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 &&
641 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 &&
645 assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL);
646 assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL);
1099 assert(waitpid(pid[i], &status, 0) == pid[i]);
1100 assert(status == 0);
1329 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
1333 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
1337 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1340 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1341 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);
1344 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
1346 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
1378 assert(waitpid(pid[i], &status, 0) == pid[i]);
1379 assert(status == 0);
1455 assert(err == 0);
1459 assert(err == 0);
1464 assert(err == 0);
1493 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
1497 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1500 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1501 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);
1507 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
1517 assert(bpf_map_get_next_key(fd, NULL, &key) < 0 && errno == ENOENT);
1518 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);
1546 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) < 0 &&
1550 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
1551 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == ENOENT);
1575 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
1578 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == EPERM);
1579 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == EPERM);
1590 assert(map_type == BPF_MAP_TYPE_QUEUE ||
1598 assert(fd < 0 && errno == EINVAL);
1607 assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0);
1610 assert(bpf_map_lookup_elem(fd, NULL, &value) < 0 && errno == EPERM);
1613 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) < 0 &&
1662 assert(map_elem_size == sizeof(__u32));