Lines Matching refs:MAP_SIZE
537 const int MAP_SIZE = 32; in test_queuemap() local
538 __u32 vals[MAP_SIZE + MAP_SIZE/2], val = 0; in test_queuemap()
542 for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++) in test_queuemap()
546 fd = bpf_map_create(BPF_MAP_TYPE_QUEUE, NULL, 4, sizeof(val), MAP_SIZE, &map_opts); in test_queuemap()
549 fd = bpf_map_create(BPF_MAP_TYPE_QUEUE, NULL, 0, sizeof(val), MAP_SIZE, &map_opts); in test_queuemap()
561 for (i = 0; i < MAP_SIZE; i++) in test_queuemap()
572 for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++) in test_queuemap()
576 for (i = MAP_SIZE/2; i < MAP_SIZE + MAP_SIZE/2; i++) in test_queuemap()
593 const int MAP_SIZE = 32; in test_stackmap() local
594 __u32 vals[MAP_SIZE + MAP_SIZE/2], val = 0; in test_stackmap()
598 for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++) in test_stackmap()
602 fd = bpf_map_create(BPF_MAP_TYPE_STACK, NULL, 4, sizeof(val), MAP_SIZE, &map_opts); in test_stackmap()
605 fd = bpf_map_create(BPF_MAP_TYPE_STACK, NULL, 0, sizeof(val), MAP_SIZE, &map_opts); in test_stackmap()
617 for (i = 0; i < MAP_SIZE; i++) in test_stackmap()
628 for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++) in test_stackmap()
632 for (i = MAP_SIZE + MAP_SIZE/2 - 1; i >= MAP_SIZE/2; i--) in test_stackmap()
1302 #define MAP_SIZE (32 * 1024) macro
1315 MAP_SIZE, &map_opts); in test_map_large()
1321 for (i = 0; i < MAP_SIZE; i++) { in test_map_large()
1335 for (i = 0; i < MAP_SIZE; i++) in test_map_large()
1450 for (i = fn; i < MAP_SIZE; i += TASKS) { in test_update_delete()
1479 MAP_SIZE, &map_opts); in test_map_parallel()
1503 for (i = 0; i < MAP_SIZE; i++) in test_map_parallel()
1508 for (i = 0; i < MAP_SIZE; i++) { in test_map_parallel()
1509 key = MAP_SIZE - i - 1; in test_map_parallel()
1539 MAP_SIZE, &map_opts); in test_map_rdonly()
1568 MAP_SIZE, &map_opts); in test_map_wronly_hash()
1598 fd = bpf_map_create(map_type, NULL, 0, sizeof(value), MAP_SIZE, &map_opts); in test_map_wronly_stack_or_queue()