Lines Matching refs:map_fd
102 int map_fd;
108 lru->map_fd = bpf_create_map(BPF_MAP_TYPE_HASH,
112 assert(lru->map_fd != -1);
125 close(lru->map_fd);
136 if (!bpf_map_lookup_elem(lru->map_fd, &key, &node)) {
153 bpf_map_update_elem(lru->map_fd, &node->key, &null_node, BPF_EXIST);
161 assert(!bpf_map_update_elem(lru->map_fd, &key, &node, BPF_EXIST));
164 assert(!bpf_map_update_elem(lru->map_fd, &key, &node, BPF_NOEXIST));
210 int map_fd;
212 map_fd = bpf_create_map(map_type, sizeof(unsigned long long),
215 if (map_fd == -1)
218 return map_fd;
341 int map_fd;
349 map_fd = create_map(map_type, map_flags, 900 * nr_cpus);
351 map_fd = create_map(map_type, map_flags, 900);
353 assert(map_fd != -1);
360 assert(bpf_map_update_elem(map_fd, &key, value, BPF_NOEXIST) == 0);
366 bpf_map_lookup_elem(map_fd, &start_key, value);
372 if (bpf_map_lookup_elem(map_fd, &key, value)) {
382 close(map_fd);
392 int map_fd;
401 map_fd = create_map(map_type, map_flags, 1000 * nr_cpus);
403 map_fd = create_map(map_type, map_flags, 1000);
405 assert(map_fd != -1);
410 assert(!bpf_map_update_elem(map_fd, &key, value, BPF_NOEXIST));
413 if (bpf_map_lookup_elem(map_fd, &key, value))
417 close(map_fd);
427 int map_fd = *(int *)data;
438 assert(bpf_map_update_elem(map_fd, &next_ins_key, value,
450 bpf_map_lookup_elem(map_fd, &key, value);
452 bpf_map_update_elem(map_fd, &next_ins_key, value,
460 if (bpf_map_lookup_elem(map_fd, &key, value))
470 int map_fd;
477 map_fd = create_map(map_type, map_flags,
480 map_fd = create_map(map_type, map_flags,
483 assert(map_fd != -1);
485 run_parallel(nr_tasks, do_test_parallel_lru_loss, &map_fd);
487 close(map_fd);