selftests/bpf/test_maps.c

39 	long long key, next_key, first_key, value;
108 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
109 	       (next_key == first_key));
110 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
111 	       (next_key == 1 || next_key == 2) &&
112 	       (next_key != first_key));
113 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
125 	assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&
127 	assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&
156 	long long key, next_key, first_key;
229 	while (!bpf_map_get_next_key(fd, &key, &next_key)) {
231 			assert(next_key == first_key);
234 		assert((expected_key_mask & next_key) == next_key);
235 		expected_key_mask &= ~next_key;
237 		assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
242 		key = next_key;
259 	assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&
261 	assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&
293 	long long key, value[VALUE_SIZE], next_key;
299 					 &next_key) == 0; i++) {
300 		key = next_key;
308 		next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0;
312 		key = next_key;
318 					 &next_key) == 0; i++) {
319 		key = next_key;
346 		      "next_key for second map must succeed",
363 	int key, next_key, fd;
399 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
400 	       next_key == 0);
401 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
402 	       next_key == 0);
403 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
404 	       next_key == 1);
405 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
419 	int key, next_key, fd, i;
458 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
459 	       next_key == 0);
460 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
461 	       next_key == 0);
462 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
463 	       next_key == 1);
464 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&