MAP_SIZE
const int MAP_SIZE = 32;
__u32 vals[MAP_SIZE], val;
for (i = 0; i < MAP_SIZE; i++)
for (i = 0; i < MAP_SIZE; i++) {
for (i = 0; i < MAP_SIZE; i++) {
val = vals[MAP_SIZE - 1 - i];
pkt_v4.iph.saddr = vals[MAP_SIZE - 1 - i] * 5;
for (i = 0; i < MAP_SIZE; i++) {
MAP_SIZE, &map_opts);
for (i = 0; i < MAP_SIZE; i++) {
for (i = 0; i < MAP_SIZE; i++)
for (i = fn; i < MAP_SIZE; i += TASKS) {
MAP_SIZE, &map_opts);
for (i = 0; i < MAP_SIZE; i++)
for (i = 0; i < MAP_SIZE; i++) {
key = MAP_SIZE - i - 1;
MAP_SIZE, &map_opts);
MAP_SIZE, &map_opts);
fd = bpf_map_create(map_type, NULL, 0, sizeof(value), MAP_SIZE, &map_opts);
const int MAP_SIZE = 32;
__u32 vals[MAP_SIZE + MAP_SIZE/2], val = 0;
for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++)
fd = bpf_map_create(BPF_MAP_TYPE_QUEUE, NULL, 4, sizeof(val), MAP_SIZE, &map_opts);
fd = bpf_map_create(BPF_MAP_TYPE_QUEUE, NULL, 0, sizeof(val), MAP_SIZE, &map_opts);
for (i = 0; i < MAP_SIZE; i++)
for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++)
for (i = MAP_SIZE/2; i < MAP_SIZE + MAP_SIZE/2; i++)
const int MAP_SIZE = 32;
__u32 vals[MAP_SIZE + MAP_SIZE/2], val = 0;
for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++)
fd = bpf_map_create(BPF_MAP_TYPE_STACK, NULL, 4, sizeof(val), MAP_SIZE, &map_opts);
fd = bpf_map_create(BPF_MAP_TYPE_STACK, NULL, 0, sizeof(val), MAP_SIZE, &map_opts);
for (i = 0; i < MAP_SIZE; i++)
for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++)
for (i = MAP_SIZE + MAP_SIZE/2 - 1; i >= MAP_SIZE/2; i--)
map = mmap(NULL, MAP_SIZE, PROT_READ | PROT_WRITE,
munmap(map, MAP_SIZE);
for (i = 0; i < MAP_SIZE; i += page_size)
munmap(entry->map, MAP_SIZE);
p = mmap(NULL, 4 * MAP_SIZE, PROT_READ | PROT_WRITE,
s1 = p + MAP_SIZE - alloc_size;
s2 = p + 3 * MAP_SIZE - alloc_size;
munmap(p + MAP_SIZE, MAP_SIZE);
munmap(p + 3 * MAP_SIZE, MAP_SIZE);