Lines Matching refs:next_key

35 	long long key, next_key, first_key, value;
104 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
105 	       (next_key == first_key));
106 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
107 	       (next_key == 1 || next_key == 2) &&
108 	       (next_key != first_key));
109 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
121 	assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&
123 	assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&
152 	long long key, next_key, first_key;
225 	while (!bpf_map_get_next_key(fd, &key, &next_key)) {
227 			assert(next_key == first_key);
230 		assert((expected_key_mask & next_key) == next_key);
231 		expected_key_mask &= ~next_key;
233 		assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
238 		key = next_key;
255 	assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&
257 	assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&
289 	long long key, value[VALUE_SIZE], next_key;
295 					 &next_key) == 0; i++) {
296 		key = next_key;
304 		next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0;
308 		key = next_key;
314 					 &next_key) == 0; i++) {
315 		key = next_key;
342 		      "next_key for second map must succeed",
359 	int key, next_key, fd;
395 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
396 	       next_key == 0);
397 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
398 	       next_key == 0);
399 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
400 	       next_key == 1);
401 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&
415 	int key, next_key, fd, i;
454 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
455 	       next_key == 0);
456 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
457 	       next_key == 0);
458 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
459 	       next_key == 1);
460 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&