545 	const int MAP_SIZE = 32;  in test_queuemap()  local
546 	__u32 vals[MAP_SIZE + MAP_SIZE/2], val;  in test_queuemap()
550 	for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++)  in test_queuemap()
554 	fd = bpf_create_map(BPF_MAP_TYPE_QUEUE, 4, sizeof(val), MAP_SIZE,  in test_queuemap()
558 	fd = bpf_create_map(BPF_MAP_TYPE_QUEUE, 0, sizeof(val), MAP_SIZE,  in test_queuemap()
571 	for (i = 0; i < MAP_SIZE; i++)  in test_queuemap()
582 	for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++)  in test_queuemap()
586 	for (i = MAP_SIZE/2; i < MAP_SIZE + MAP_SIZE/2; i++)  in test_queuemap()
603 	const int MAP_SIZE = 32;  in test_stackmap()  local
604 	__u32 vals[MAP_SIZE + MAP_SIZE/2], val;  in test_stackmap()
608 	for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++)  in test_stackmap()
612 	fd = bpf_create_map(BPF_MAP_TYPE_STACK, 4, sizeof(val), MAP_SIZE,  in test_stackmap()
616 	fd = bpf_create_map(BPF_MAP_TYPE_STACK, 0, sizeof(val), MAP_SIZE,  in test_stackmap()
629 	for (i = 0; i < MAP_SIZE; i++)  in test_stackmap()
640 	for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++)  in test_stackmap()
644 	for (i = MAP_SIZE + MAP_SIZE/2 - 1; i >= MAP_SIZE/2; i--)  in test_stackmap()
1305 #define MAP_SIZE (32 * 1024)  macro
1318 			    MAP_SIZE, map_flags);  in test_map_large()
1324 	for (i = 0; i < MAP_SIZE; i++) {  in test_map_large()
1338 	for (i = 0; i < MAP_SIZE; i++)  in test_map_large()
1445 	for (i = fn; i < MAP_SIZE; i += TASKS) {  in test_update_delete()
1472 			    MAP_SIZE, map_flags);  in test_map_parallel()
1495 	for (i = 0; i < MAP_SIZE; i++)  in test_map_parallel()
1500 	for (i = 0; i < MAP_SIZE; i++) {  in test_map_parallel()
1501 		key = MAP_SIZE - i - 1;  in test_map_parallel()
1522 			    MAP_SIZE, map_flags | BPF_F_RDONLY);  in test_map_rdonly()
1547 			    MAP_SIZE, map_flags | BPF_F_WRONLY);  in test_map_wronly_hash()
1572 	fd = bpf_create_map(map_type, 0, sizeof(value), MAP_SIZE,  in test_map_wronly_stack_or_queue()