98 	uint32_t key;  in pre_test_lru_hash_lookup()  local
112 	for (key = 0; key < lru_hash_lookup_test_entries; key++) {  in pre_test_lru_hash_lookup()
113 		ret = bpf_map_update_elem(fd, &key, &val, BPF_NOEXIST);  in pre_test_lru_hash_lookup()
371 	struct bpf_lpm_trie_key *key;  in fill_lpm_trie()  local
376 	key = alloca(sizeof(*key) + 4);  in fill_lpm_trie()
377 	key->prefixlen = 32;  in fill_lpm_trie()
380 		key->prefixlen = rand() % 33;  in fill_lpm_trie()
381 		key->data[0] = rand() & 0xff;  in fill_lpm_trie()
382 		key->data[1] = rand() & 0xff;  in fill_lpm_trie()
383 		key->data[2] = rand() & 0xff;  in fill_lpm_trie()
384 		key->data[3] = rand() & 0xff;  in fill_lpm_trie()
386 					key, &value, 0);  in fill_lpm_trie()
390 	key->prefixlen = 32;  in fill_lpm_trie()
391 	key->data[0] = 192;  in fill_lpm_trie()
392 	key->data[1] = 168;  in fill_lpm_trie()
393 	key->data[2] = 0;  in fill_lpm_trie()
394 	key->data[3] = 1;  in fill_lpm_trie()
397 	r = bpf_map_update_elem(map_fd[hash_map_alloc_idx], key, &value, 0);  in fill_lpm_trie()