Lines Matching refs:assert
13 #include <assert.h>
47 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
51 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
56 assert(bpf_map_update_elem(fd, &key, &value, -1) < 0 &&
60 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
65 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
68 assert(bpf_map_lookup_and_delete_elem(fd, &key, &value) == 0 && value == 1234);
71 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
74 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&
79 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
85 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
90 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
92 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
94 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
99 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);
102 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
104 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
106 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
109 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
114 assert(bpf_map_delete_elem(fd, &key) == 0);
116 assert(bpf_map_delete_elem(fd, &key) == 0);
117 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);
121 assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&
123 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&
168 assert(!(expected_key_mask & key));
169 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
172 assert(bpf_map_lookup_and_delete_elem(fd, &key, value) == 0 &&
179 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
183 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&
188 assert(bpf_map_update_elem(fd, &key, value, -1) < 0 &&
195 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
200 assert(bpf_map_lookup_elem(fd, &key, value) < 0 && errno == ENOENT);
203 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 0 &&
208 assert(!(expected_key_mask & key));
209 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
216 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&
220 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);
223 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
227 assert(next_key == first_key);
230 assert((expected_key_mask & next_key) == next_key);
233 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
236 assert(bpf_percpu(value, i) == i + 100);
240 assert(errno == ENOENT);
244 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
248 assert(bpf_map_delete_elem(fd, &key) == 0);
250 assert(bpf_map_delete_elem(fd, &key) == 0);
251 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);
255 assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&
257 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&
297 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
300 assert(i == max_entries);
302 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
305 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
307 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
311 assert(i == max_entries);
316 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
317 assert(value[0] - 1 == key);
320 assert(i == max_entries);
371 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
374 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
378 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
382 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
388 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&
392 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
395 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
397 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
399 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
401 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
406 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL);
429 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
432 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 &&
436 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
441 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
447 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) < 0 &&
451 assert(bpf_map_lookup_elem(fd, &key, values) < 0 && errno == ENOENT);
454 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
456 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
458 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
460 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
465 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL);
492 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
498 assert(bpf_map_lookup_elem(fd, &key, values) == 0);
501 assert(bpf_percpu(values, i) == i + 10);
547 assert(fd < 0 && errno == EINVAL);
552 assert(fd < 0 && errno == EINVAL);
562 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);
565 assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 &&
569 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]);
573 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);
577 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 &&
581 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 &&
585 assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL);
586 assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL);
603 assert(fd < 0 && errno == EINVAL);
608 assert(fd < 0 && errno == EINVAL);
618 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);
621 assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 &&
625 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]);
629 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);
633 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 &&
637 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 &&
641 assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL);
642 assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL);
1095 assert(waitpid(pid[i], &status, 0) == pid[i]);
1096 assert(status == 0);
1325 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
1329 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
1333 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1336 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1337 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);
1340 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
1342 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
1374 assert(waitpid(pid[i], &status, 0) == pid[i]);
1375 assert(status == 0);
1458 assert(err == 0);
1463 assert(err == 0);
1468 assert(err == 0);
1497 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
1501 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1504 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1505 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);
1511 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
1521 assert(bpf_map_get_next_key(fd, NULL, &key) < 0 && errno == ENOENT);
1522 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);
1550 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) < 0 &&
1554 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
1555 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == ENOENT);
1579 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
1582 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == EPERM);
1583 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == EPERM);
1594 assert(map_type == BPF_MAP_TYPE_QUEUE ||
1602 assert(fd < 0 && errno == EINVAL);
1611 assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0);
1614 assert(bpf_map_lookup_elem(fd, NULL, &value) < 0 && errno == EPERM);
1617 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) < 0 &&
1666 assert(map_elem_size == sizeof(__u32));