39 	long long key, next_key, first_key, value;  in test_hashmap()  local
108 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_hashmap()
109 	       (next_key == first_key));  in test_hashmap()
110 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_hashmap()
111 	       (next_key == 1 || next_key == 2) &&  in test_hashmap()
112 	       (next_key != first_key));  in test_hashmap()
113 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  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()
156 	long long key, next_key, first_key;  in test_hashmap_percpu()  local
229 	while (!bpf_map_get_next_key(fd, &key, &next_key)) {  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()
235 		expected_key_mask &= ~next_key;  in test_hashmap_percpu()
237 		assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);  in test_hashmap_percpu()
242 		key = next_key;  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()
293 	long long key, value[VALUE_SIZE], next_key;  in test_hashmap_walk()  local
299 					 &next_key) == 0; i++) {  in test_hashmap_walk()
300 		key = next_key;  in test_hashmap_walk()
308 		next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0;  in test_hashmap_walk()
312 		key = next_key;  in test_hashmap_walk()
318 					 &next_key) == 0; i++) {  in test_hashmap_walk()
319 		key = next_key;  in test_hashmap_walk()
363 	int key, next_key, fd;  in test_arraymap()  local
399 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&  in test_arraymap()
400 	       next_key == 0);  in test_arraymap()
401 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_arraymap()
402 	       next_key == 0);  in test_arraymap()
403 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_arraymap()
404 	       next_key == 1);  in test_arraymap()
405 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  in test_arraymap()
419 	int key, next_key, fd, i;  in test_arraymap_percpu()  local
458 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&  in test_arraymap_percpu()
459 	       next_key == 0);  in test_arraymap_percpu()
460 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_arraymap_percpu()
461 	       next_key == 0);  in test_arraymap_percpu()
462 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_arraymap_percpu()
463 	       next_key == 1);  in test_arraymap_percpu()
464 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  in test_arraymap_percpu()