Lines Matching refs:i
129 int fd, i, j; in test_hashmap_sizes() local
131 for (i = 1; i <= 512; i <<= 1) in test_hashmap_sizes()
133 fd = bpf_create_map(BPF_MAP_TYPE_HASH, i, j, in test_hashmap_sizes()
139 i, j, strerror(errno)); in test_hashmap_sizes()
153 int fd, i; in test_hashmap_percpu() local
162 for (i = 0; i < nr_cpus; i++) in test_hashmap_percpu()
163 bpf_percpu(value, i) = i + 100; in test_hashmap_percpu()
224 for (i = 0; i < nr_cpus; i++) in test_hashmap_percpu()
225 assert(bpf_percpu(value, i) == i + 100); in test_hashmap_percpu()
254 int i, fd, ret; in helper_fill_hashmap() local
263 for (i = 0; i < max_entries; i++) { in helper_fill_hashmap()
264 key = i; value = key; in helper_fill_hashmap()
276 int fd, i, max_entries = 1000; in test_hashmap_walk() local
282 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key, in test_hashmap_walk()
283 &next_key) == 0; i++) { in test_hashmap_walk()
288 assert(i == max_entries); in test_hashmap_walk()
291 for (i = 0; next_key_valid; i++) { in test_hashmap_walk()
299 assert(i == max_entries); in test_hashmap_walk()
301 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key, in test_hashmap_walk()
302 &next_key) == 0; i++) { in test_hashmap_walk()
308 assert(i == max_entries); in test_hashmap_walk()
314 int i, first, second, old_flags; in test_hashmap_zero_seed() local
323 for (i = 0; ; i++) { in test_hashmap_zero_seed()
324 void *key_ptr = !i ? NULL : &key; in test_hashmap_zero_seed()
334 "i: %d first: %lld second: %lld\n", i, in test_hashmap_zero_seed()
404 int key, next_key, fd, i; in test_arraymap_percpu() local
413 for (i = 0; i < nr_cpus; i++) in test_arraymap_percpu()
414 bpf_percpu(values, i) = i + 100; in test_arraymap_percpu()
467 int key, fd, i; in test_arraymap_percpu_many_keys() local
477 for (i = 0; i < nr_cpus; i++) in test_arraymap_percpu_many_keys()
478 bpf_percpu(values, i) = i + 10; in test_arraymap_percpu_many_keys()
484 for (i = 0; i < nr_cpus; i++) in test_arraymap_percpu_many_keys()
485 bpf_percpu(values, i) = 0; in test_arraymap_percpu_many_keys()
489 for (i = 0; i < nr_cpus; i++) in test_arraymap_percpu_many_keys()
490 assert(bpf_percpu(values, i) == i + 10); in test_arraymap_percpu_many_keys()
530 int fd, i; in test_queuemap() local
533 for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++) in test_queuemap()
534 vals[i] = rand(); in test_queuemap()
554 for (i = 0; i < MAP_SIZE; i++) in test_queuemap()
555 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); in test_queuemap()
565 for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++) in test_queuemap()
566 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); in test_queuemap()
569 for (i = MAP_SIZE/2; i < MAP_SIZE + MAP_SIZE/2; i++) in test_queuemap()
571 val == vals[i]); in test_queuemap()
588 int fd, i; in test_stackmap() local
591 for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++) in test_stackmap()
592 vals[i] = rand(); in test_stackmap()
612 for (i = 0; i < MAP_SIZE; i++) in test_stackmap()
613 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); in test_stackmap()
620 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]); in test_stackmap()
623 for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++) in test_stackmap()
624 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); in test_stackmap()
627 for (i = MAP_SIZE + MAP_SIZE/2 - 1; i >= MAP_SIZE/2; i--) in test_stackmap()
629 val == vals[i]); in test_stackmap()
654 int err, i, fd, udp, sfd[6] = {0xdeadbeef}; in test_sockmap() local
666 for (i = 0; i < 2; i++) { in test_sockmap()
667 sfd[i] = socket(AF_INET, SOCK_STREAM, 0); in test_sockmap()
668 if (sfd[i] < 0) in test_sockmap()
670 err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR, in test_sockmap()
676 err = ioctl(sfd[i], FIONBIO, (char *)&one); in test_sockmap()
684 addr.sin_port = htons(ports[i]); in test_sockmap()
685 err = bind(sfd[i], (struct sockaddr *)&addr, sizeof(addr)); in test_sockmap()
688 err, i, sfd[i]); in test_sockmap()
691 err = listen(sfd[i], 32); in test_sockmap()
698 for (i = 2; i < 4; i++) { in test_sockmap()
699 sfd[i] = socket(AF_INET, SOCK_STREAM, 0); in test_sockmap()
700 if (sfd[i] < 0) in test_sockmap()
702 err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR, in test_sockmap()
711 addr.sin_port = htons(ports[i - 2]); in test_sockmap()
712 err = connect(sfd[i], (struct sockaddr *)&addr, sizeof(addr)); in test_sockmap()
720 for (i = 4; i < 6; i++) { in test_sockmap()
721 sfd[i] = accept(sfd[i - 4], NULL, NULL); in test_sockmap()
722 if (sfd[i] < 0) { in test_sockmap()
737 for (i = 0; i < 6; i++) in test_sockmap()
738 close(sfd[i]); in test_sockmap()
748 i = 0; in test_sockmap()
749 err = bpf_map_update_elem(fd, &i, &udp, BPF_ANY); in test_sockmap()
752 i, udp); in test_sockmap()
757 for (i = 0; i < 6; i++) { in test_sockmap()
758 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); in test_sockmap()
759 if (i < 2 && !err) { in test_sockmap()
761 i, sfd[i]); in test_sockmap()
763 } else if (i >= 2 && err) { in test_sockmap()
765 i, sfd[i]); in test_sockmap()
924 for (i = 2; i < 6; i++) { in test_sockmap()
925 err = bpf_map_update_elem(map_fd_rx, &i, &sfd[i], BPF_ANY); in test_sockmap()
928 err, i, sfd[i]); in test_sockmap()
931 err = bpf_map_update_elem(map_fd_tx, &i, &sfd[i], BPF_ANY); in test_sockmap()
934 err, i, sfd[i]); in test_sockmap()
940 for (i = 2; i < 4; i++) { in test_sockmap()
941 err = bpf_map_delete_elem(map_fd_rx, &i); in test_sockmap()
944 err, i, sfd[i]); in test_sockmap()
947 err = bpf_map_delete_elem(map_fd_tx, &i); in test_sockmap()
950 err, i, sfd[i]); in test_sockmap()
956 i = 0; in test_sockmap()
957 err = bpf_map_update_elem(map_fd_msg, &i, &sfd[2], BPF_ANY); in test_sockmap()
964 for (i = 0; i < 2; i++) { in test_sockmap()
965 buf[0] = i; in test_sockmap()
1008 i = 2; in test_sockmap()
1009 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST); in test_sockmap()
1015 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); in test_sockmap()
1021 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST); in test_sockmap()
1028 for (i = 2; i < 6; i++) { in test_sockmap()
1029 err = bpf_map_delete_elem(fd, &i); in test_sockmap()
1032 err, i, sfd[i]); in test_sockmap()
1050 for (i = 4; i < 6; i++) { in test_sockmap()
1051 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); in test_sockmap()
1054 err, i, sfd[i]); in test_sockmap()
1057 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST); in test_sockmap()
1060 err, i, sfd[i]); in test_sockmap()
1063 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST); in test_sockmap()
1066 err, i, sfd[i]); in test_sockmap()
1072 for (i = 0; i < tasks; i++) { in test_sockmap()
1073 pid[i] = fork(); in test_sockmap()
1074 if (pid[i] == 0) { in test_sockmap()
1075 for (i = 0; i < 6; i++) { in test_sockmap()
1076 bpf_map_delete_elem(map_fd_tx, &i); in test_sockmap()
1077 bpf_map_delete_elem(map_fd_rx, &i); in test_sockmap()
1078 bpf_map_update_elem(map_fd_tx, &i, in test_sockmap()
1079 &sfd[i], BPF_ANY); in test_sockmap()
1080 bpf_map_update_elem(map_fd_rx, &i, in test_sockmap()
1081 &sfd[i], BPF_ANY); in test_sockmap()
1084 } else if (pid[i] == -1) { in test_sockmap()
1085 printf("Couldn't spawn #%d process!\n", i); in test_sockmap()
1090 for (i = 0; i < tasks; i++) { in test_sockmap()
1093 assert(waitpid(pid[i], &status, 0) == pid[i]); in test_sockmap()
1116 for (i = 0; i < 6; i++) { in test_sockmap()
1117 bpf_map_delete_elem(map_fd_tx, &i); in test_sockmap()
1118 bpf_map_delete_elem(map_fd_rx, &i); in test_sockmap()
1119 close(sfd[i]); in test_sockmap()
1126 for (i = 0; i < 6; i++) in test_sockmap()
1127 close(sfd[i]); in test_sockmap()
1128 printf("Failed to create sockmap '%i:%s'!\n", i, strerror(errno)); in test_sockmap()
1131 for (i = 0; i < 6; i++) { in test_sockmap()
1133 bpf_map_delete_elem(map_fd_tx, &i); in test_sockmap()
1135 bpf_map_delete_elem(map_fd_rx, &i); in test_sockmap()
1136 close(sfd[i]); in test_sockmap()
1239 int fd, i, value; in test_map_large() local
1248 for (i = 0; i < MAP_SIZE; i++) { in test_map_large()
1249 key = (struct bigkey) { .c = i }; in test_map_large()
1250 value = i; in test_map_large()
1262 for (i = 0; i < MAP_SIZE; i++) in test_map_large()
1283 int i; in __run_parallel() local
1285 for (i = 0; i < tasks; i++) { in __run_parallel()
1286 pid[i] = fork(); in __run_parallel()
1287 if (pid[i] == 0) { in __run_parallel()
1288 fn(i, data); in __run_parallel()
1290 } else if (pid[i] == -1) { in __run_parallel()
1291 printf("Couldn't spawn #%d process!\n", i); in __run_parallel()
1296 for (i = 0; i < tasks; i++) { in __run_parallel()
1299 assert(waitpid(pid[i], &status, 0) == pid[i]); in __run_parallel()
1324 int i, key, value; in test_update_delete() local
1326 for (i = fn; i < MAP_SIZE; i += TASKS) { in test_update_delete()
1327 key = value = i; in test_update_delete()
1342 int i, fd, key = 0, value = 0; in test_map_parallel() local
1369 for (i = 0; i < MAP_SIZE; i++) in test_map_parallel()
1374 for (i = 0; i < MAP_SIZE; i++) { in test_map_parallel()
1375 key = MAP_SIZE - i - 1; in test_map_parallel()
1444 unsigned int i; in prepare_reuseport_grp() local
1457 for (i = 0; i < n; i++) { in prepare_reuseport_grp()
1486 if (i == 0) { in prepare_reuseport_grp()
1516 fds64[i] = fd64; in prepare_reuseport_grp()
1517 sk_cookies[i] = sk_cookie; in prepare_reuseport_grp()