samples/bpf/test_lru_dist.c

96 	int map_fd;
102 	lru->map_fd = bpf_map_create(BPF_MAP_TYPE_HASH, NULL,
106 	assert(lru->map_fd != -1);
119 	close(lru->map_fd);
130 	if (!bpf_map_lookup_elem(lru->map_fd, &key, &node)) {
147 		bpf_map_update_elem(lru->map_fd, &node->key, &null_node, BPF_EXIST);
155 		assert(!bpf_map_update_elem(lru->map_fd, &key, &node, BPF_EXIST));
158 		assert(!bpf_map_update_elem(lru->map_fd, &key, &node, BPF_NOEXIST));
207 	int map_fd;
209 	map_fd = bpf_map_create(map_type, NULL, sizeof(unsigned long long),
212 	if (map_fd == -1)
215 	return map_fd;
338 	int map_fd;
346 		map_fd = create_map(map_type, map_flags, 900 * nr_cpus);
348 		map_fd = create_map(map_type, map_flags, 900);
350 	assert(map_fd != -1);
357 		assert(bpf_map_update_elem(map_fd, &key, value, BPF_NOEXIST) == 0);
363 			bpf_map_lookup_elem(map_fd, &start_key, value);
369 		if (bpf_map_lookup_elem(map_fd, &key, value)) {
379 	close(map_fd);
389 	int map_fd;
398 		map_fd = create_map(map_type, map_flags, 1000 * nr_cpus);
400 		map_fd = create_map(map_type, map_flags, 1000);
402 	assert(map_fd != -1);
407 		assert(!bpf_map_update_elem(map_fd, &key, value, BPF_NOEXIST));
410 		if (bpf_map_lookup_elem(map_fd, &key, value))
414 	close(map_fd);
424 	int map_fd = *(int *)data;
435 		assert(bpf_map_update_elem(map_fd, &next_ins_key, value,
447 			bpf_map_lookup_elem(map_fd, &key, value);
449 			bpf_map_update_elem(map_fd, &next_ins_key, value,
457 		if (bpf_map_lookup_elem(map_fd, &key, value))
467 	int map_fd;
474 		map_fd = create_map(map_type, map_flags,
477 		map_fd = create_map(map_type, map_flags,
480 	assert(map_fd != -1);
482 	run_parallel(nr_tasks, do_test_parallel_lru_loss, &map_fd);
484 	close(map_fd);