| /* Copyright (c) 2017 Facebook |
| * |
| * This program is free software; you can redistribute it and/or |
| * modify it under the terms of version 2 of the GNU General Public |
| * License as published by the Free Software Foundation. |
| */ |
| #include <stdio.h> |
| #include <unistd.h> |
| #include <errno.h> |
| #include <string.h> |
| #include <assert.h> |
| #include <stdlib.h> |
| |
| #include <linux/types.h> |
| typedef __u16 __sum16; |
| #include <arpa/inet.h> |
| #include <linux/if_ether.h> |
| #include <linux/if_packet.h> |
| #include <linux/ip.h> |
| #include <linux/ipv6.h> |
| #include <linux/tcp.h> |
| |
| #include <sys/wait.h> |
| #include <sys/resource.h> |
| #include <sys/types.h> |
| #include <fcntl.h> |
| |
| #include <linux/bpf.h> |
| #include <linux/err.h> |
| #include <bpf/bpf.h> |
| #include <bpf/libbpf.h> |
| #include "test_iptunnel_common.h" |
| #include "bpf_util.h" |
| #include "bpf_endian.h" |
| |
| static int error_cnt, pass_cnt; |
| |
| #define MAGIC_BYTES 123 |
| |
| /* ipv4 test vector */ |
| static struct { |
| struct ethhdr eth; |
| struct iphdr iph; |
| struct tcphdr tcp; |
| } __packed pkt_v4 = { |
| .eth.h_proto = bpf_htons(ETH_P_IP), |
| .iph.ihl = 5, |
| .iph.protocol = 6, |
| .iph.tot_len = bpf_htons(MAGIC_BYTES), |
| .tcp.urg_ptr = 123, |
| }; |
| |
| /* ipv6 test vector */ |
| static struct { |
| struct ethhdr eth; |
| struct ipv6hdr iph; |
| struct tcphdr tcp; |
| } __packed pkt_v6 = { |
| .eth.h_proto = bpf_htons(ETH_P_IPV6), |
| .iph.nexthdr = 6, |
| .iph.payload_len = bpf_htons(MAGIC_BYTES), |
| .tcp.urg_ptr = 123, |
| }; |
| |
| #define CHECK(condition, tag, format...) ({ \ |
| int __ret = !!(condition); \ |
| if (__ret) { \ |
| error_cnt++; \ |
| printf("%s:FAIL:%s ", __func__, tag); \ |
| printf(format); \ |
| } else { \ |
| pass_cnt++; \ |
| printf("%s:PASS:%s %d nsec\n", __func__, tag, duration);\ |
| } \ |
| __ret; \ |
| }) |
| |
| static int bpf_find_map(const char *test, struct bpf_object *obj, |
| const char *name) |
| { |
| struct bpf_map *map; |
| |
| map = bpf_object__find_map_by_name(obj, name); |
| if (!map) { |
| printf("%s:FAIL:map '%s' not found\n", test, name); |
| error_cnt++; |
| return -1; |
| } |
| return bpf_map__fd(map); |
| } |
| |
| static void test_pkt_access(void) |
| { |
| const char *file = "./test_pkt_access.o"; |
| struct bpf_object *obj; |
| __u32 duration, retval; |
| int err, prog_fd; |
| |
| err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd); |
| if (err) { |
| error_cnt++; |
| return; |
| } |
| |
| err = bpf_prog_test_run(prog_fd, 100000, &pkt_v4, sizeof(pkt_v4), |
| NULL, NULL, &retval, &duration); |
| CHECK(err || errno || retval, "ipv4", |
| "err %d errno %d retval %d duration %d\n", |
| err, errno, retval, duration); |
| |
| err = bpf_prog_test_run(prog_fd, 100000, &pkt_v6, sizeof(pkt_v6), |
| NULL, NULL, &retval, &duration); |
| CHECK(err || errno || retval, "ipv6", |
| "err %d errno %d retval %d duration %d\n", |
| err, errno, retval, duration); |
| bpf_object__close(obj); |
| } |
| |
| static void test_xdp(void) |
| { |
| struct vip key4 = {.protocol = 6, .family = AF_INET}; |
| struct vip key6 = {.protocol = 6, .family = AF_INET6}; |
| struct iptnl_info value4 = {.family = AF_INET}; |
| struct iptnl_info value6 = {.family = AF_INET6}; |
| const char *file = "./test_xdp.o"; |
| struct bpf_object *obj; |
| char buf[128]; |
| struct ipv6hdr *iph6 = (void *)buf + sizeof(struct ethhdr); |
| struct iphdr *iph = (void *)buf + sizeof(struct ethhdr); |
| __u32 duration, retval, size; |
| int err, prog_fd, map_fd; |
| |
| err = bpf_prog_load(file, BPF_PROG_TYPE_XDP, &obj, &prog_fd); |
| if (err) { |
| error_cnt++; |
| return; |
| } |
| |
| map_fd = bpf_find_map(__func__, obj, "vip2tnl"); |
| if (map_fd < 0) |
| goto out; |
| bpf_map_update_elem(map_fd, &key4, &value4, 0); |
| bpf_map_update_elem(map_fd, &key6, &value6, 0); |
| |
| err = bpf_prog_test_run(prog_fd, 1, &pkt_v4, sizeof(pkt_v4), |
| buf, &size, &retval, &duration); |
| |
| CHECK(err || errno || retval != XDP_TX || size != 74 || |
| iph->protocol != IPPROTO_IPIP, "ipv4", |
| "err %d errno %d retval %d size %d\n", |
| err, errno, retval, size); |
| |
| err = bpf_prog_test_run(prog_fd, 1, &pkt_v6, sizeof(pkt_v6), |
| buf, &size, &retval, &duration); |
| CHECK(err || errno || retval != XDP_TX || size != 114 || |
| iph6->nexthdr != IPPROTO_IPV6, "ipv6", |
| "err %d errno %d retval %d size %d\n", |
| err, errno, retval, size); |
| out: |
| bpf_object__close(obj); |
| } |
| |
| #define MAGIC_VAL 0x1234 |
| #define NUM_ITER 100000 |
| #define VIP_NUM 5 |
| |
| static void test_l4lb(void) |
| { |
| unsigned int nr_cpus = bpf_num_possible_cpus(); |
| const char *file = "./test_l4lb.o"; |
| struct vip key = {.protocol = 6}; |
| struct vip_meta { |
| __u32 flags; |
| __u32 vip_num; |
| } value = {.vip_num = VIP_NUM}; |
| __u32 stats_key = VIP_NUM; |
| struct vip_stats { |
| __u64 bytes; |
| __u64 pkts; |
| } stats[nr_cpus]; |
| struct real_definition { |
| union { |
| __be32 dst; |
| __be32 dstv6[4]; |
| }; |
| __u8 flags; |
| } real_def = {.dst = MAGIC_VAL}; |
| __u32 ch_key = 11, real_num = 3; |
| __u32 duration, retval, size; |
| int err, i, prog_fd, map_fd; |
| __u64 bytes = 0, pkts = 0; |
| struct bpf_object *obj; |
| char buf[128]; |
| u32 *magic = (u32 *)buf; |
| |
| err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd); |
| if (err) { |
| error_cnt++; |
| return; |
| } |
| |
| map_fd = bpf_find_map(__func__, obj, "vip_map"); |
| if (map_fd < 0) |
| goto out; |
| bpf_map_update_elem(map_fd, &key, &value, 0); |
| |
| map_fd = bpf_find_map(__func__, obj, "ch_rings"); |
| if (map_fd < 0) |
| goto out; |
| bpf_map_update_elem(map_fd, &ch_key, &real_num, 0); |
| |
| map_fd = bpf_find_map(__func__, obj, "reals"); |
| if (map_fd < 0) |
| goto out; |
| bpf_map_update_elem(map_fd, &real_num, &real_def, 0); |
| |
| err = bpf_prog_test_run(prog_fd, NUM_ITER, &pkt_v4, sizeof(pkt_v4), |
| buf, &size, &retval, &duration); |
| CHECK(err || errno || retval != 7/*TC_ACT_REDIRECT*/ || size != 54 || |
| *magic != MAGIC_VAL, "ipv4", |
| "err %d errno %d retval %d size %d magic %x\n", |
| err, errno, retval, size, *magic); |
| |
| err = bpf_prog_test_run(prog_fd, NUM_ITER, &pkt_v6, sizeof(pkt_v6), |
| buf, &size, &retval, &duration); |
| CHECK(err || errno || retval != 7/*TC_ACT_REDIRECT*/ || size != 74 || |
| *magic != MAGIC_VAL, "ipv6", |
| "err %d errno %d retval %d size %d magic %x\n", |
| err, errno, retval, size, *magic); |
| |
| map_fd = bpf_find_map(__func__, obj, "stats"); |
| if (map_fd < 0) |
| goto out; |
| bpf_map_lookup_elem(map_fd, &stats_key, stats); |
| for (i = 0; i < nr_cpus; i++) { |
| bytes += stats[i].bytes; |
| pkts += stats[i].pkts; |
| } |
| if (bytes != MAGIC_BYTES * NUM_ITER * 2 || pkts != NUM_ITER * 2) { |
| error_cnt++; |
| printf("test_l4lb:FAIL:stats %lld %lld\n", bytes, pkts); |
| } |
| out: |
| bpf_object__close(obj); |
| } |
| |
| static void test_tcp_estats(void) |
| { |
| const char *file = "./test_tcp_estats.o"; |
| int err, prog_fd; |
| struct bpf_object *obj; |
| __u32 duration = 0; |
| |
| err = bpf_prog_load(file, BPF_PROG_TYPE_TRACEPOINT, &obj, &prog_fd); |
| CHECK(err, "", "err %d errno %d\n", err, errno); |
| if (err) { |
| error_cnt++; |
| return; |
| } |
| |
| bpf_object__close(obj); |
| } |
| |
| static inline __u64 ptr_to_u64(const void *ptr) |
| { |
| return (__u64) (unsigned long) ptr; |
| } |
| |
| static void test_bpf_obj_id(void) |
| { |
| const __u64 array_magic_value = 0xfaceb00c; |
| const __u32 array_key = 0; |
| const int nr_iters = 2; |
| const char *file = "./test_obj_id.o"; |
| const char *jit_sysctl = "/proc/sys/net/core/bpf_jit_enable"; |
| |
| struct bpf_object *objs[nr_iters]; |
| int prog_fds[nr_iters], map_fds[nr_iters]; |
| /* +1 to test for the info_len returned by kernel */ |
| struct bpf_prog_info prog_infos[nr_iters + 1]; |
| struct bpf_map_info map_infos[nr_iters + 1]; |
| char jited_insns[128], xlated_insns[128], zeros[128]; |
| __u32 i, next_id, info_len, nr_id_found, duration = 0; |
| int sysctl_fd, jit_enabled = 0, err = 0; |
| __u64 array_value; |
| |
| sysctl_fd = open(jit_sysctl, 0, O_RDONLY); |
| if (sysctl_fd != -1) { |
| char tmpc; |
| |
| if (read(sysctl_fd, &tmpc, sizeof(tmpc)) == 1) |
| jit_enabled = (tmpc != '0'); |
| close(sysctl_fd); |
| } |
| |
| err = bpf_prog_get_fd_by_id(0); |
| CHECK(err >= 0 || errno != ENOENT, |
| "get-fd-by-notexist-prog-id", "err %d errno %d\n", err, errno); |
| |
| err = bpf_map_get_fd_by_id(0); |
| CHECK(err >= 0 || errno != ENOENT, |
| "get-fd-by-notexist-map-id", "err %d errno %d\n", err, errno); |
| |
| for (i = 0; i < nr_iters; i++) |
| objs[i] = NULL; |
| |
| /* Check bpf_obj_get_info_by_fd() */ |
| bzero(zeros, sizeof(zeros)); |
| for (i = 0; i < nr_iters; i++) { |
| err = bpf_prog_load(file, BPF_PROG_TYPE_SOCKET_FILTER, |
| &objs[i], &prog_fds[i]); |
| /* test_obj_id.o is a dumb prog. It should never fail |
| * to load. |
| */ |
| if (err) |
| error_cnt++; |
| assert(!err); |
| |
| /* Check getting prog info */ |
| info_len = sizeof(struct bpf_prog_info) * 2; |
| bzero(&prog_infos[i], info_len); |
| bzero(jited_insns, sizeof(jited_insns)); |
| bzero(xlated_insns, sizeof(xlated_insns)); |
| prog_infos[i].jited_prog_insns = ptr_to_u64(jited_insns); |
| prog_infos[i].jited_prog_len = sizeof(jited_insns); |
| prog_infos[i].xlated_prog_insns = ptr_to_u64(xlated_insns); |
| prog_infos[i].xlated_prog_len = sizeof(xlated_insns); |
| err = bpf_obj_get_info_by_fd(prog_fds[i], &prog_infos[i], |
| &info_len); |
| if (CHECK(err || |
| prog_infos[i].type != BPF_PROG_TYPE_SOCKET_FILTER || |
| info_len != sizeof(struct bpf_prog_info) || |
| (jit_enabled && !prog_infos[i].jited_prog_len) || |
| (jit_enabled && |
| !memcmp(jited_insns, zeros, sizeof(zeros))) || |
| !prog_infos[i].xlated_prog_len || |
| !memcmp(xlated_insns, zeros, sizeof(zeros)), |
| "get-prog-info(fd)", |
| "err %d errno %d i %d type %d(%d) info_len %u(%lu) jit_enabled %d jited_prog_len %u xlated_prog_len %u jited_prog %d xlated_prog %d\n", |
| err, errno, i, |
| prog_infos[i].type, BPF_PROG_TYPE_SOCKET_FILTER, |
| info_len, sizeof(struct bpf_prog_info), |
| jit_enabled, |
| prog_infos[i].jited_prog_len, |
| prog_infos[i].xlated_prog_len, |
| !!memcmp(jited_insns, zeros, sizeof(zeros)), |
| !!memcmp(xlated_insns, zeros, sizeof(zeros)))) |
| goto done; |
| |
| map_fds[i] = bpf_find_map(__func__, objs[i], "test_map_id"); |
| assert(map_fds[i] >= 0); |
| err = bpf_map_update_elem(map_fds[i], &array_key, |
| &array_magic_value, 0); |
| assert(!err); |
| |
| /* Check getting map info */ |
| info_len = sizeof(struct bpf_map_info) * 2; |
| bzero(&map_infos[i], info_len); |
| err = bpf_obj_get_info_by_fd(map_fds[i], &map_infos[i], |
| &info_len); |
| if (CHECK(err || |
| map_infos[i].type != BPF_MAP_TYPE_ARRAY || |
| map_infos[i].key_size != sizeof(__u32) || |
| map_infos[i].value_size != sizeof(__u64) || |
| map_infos[i].max_entries != 1 || |
| map_infos[i].map_flags != 0 || |
| info_len != sizeof(struct bpf_map_info), |
| "get-map-info(fd)", |
| "err %d errno %d type %d(%d) info_len %u(%lu) key_size %u value_size %u max_entries %u map_flags %X\n", |
| err, errno, |
| map_infos[i].type, BPF_MAP_TYPE_ARRAY, |
| info_len, sizeof(struct bpf_map_info), |
| map_infos[i].key_size, |
| map_infos[i].value_size, |
| map_infos[i].max_entries, |
| map_infos[i].map_flags)) |
| goto done; |
| } |
| |
| /* Check bpf_prog_get_next_id() */ |
| nr_id_found = 0; |
| next_id = 0; |
| while (!bpf_prog_get_next_id(next_id, &next_id)) { |
| struct bpf_prog_info prog_info = {}; |
| int prog_fd; |
| |
| info_len = sizeof(prog_info); |
| |
| prog_fd = bpf_prog_get_fd_by_id(next_id); |
| if (prog_fd < 0 && errno == ENOENT) |
| /* The bpf_prog is in the dead row */ |
| continue; |
| if (CHECK(prog_fd < 0, "get-prog-fd(next_id)", |
| "prog_fd %d next_id %d errno %d\n", |
| prog_fd, next_id, errno)) |
| break; |
| |
| for (i = 0; i < nr_iters; i++) |
| if (prog_infos[i].id == next_id) |
| break; |
| |
| if (i == nr_iters) |
| continue; |
| |
| nr_id_found++; |
| |
| err = bpf_obj_get_info_by_fd(prog_fd, &prog_info, &info_len); |
| prog_infos[i].jited_prog_insns = 0; |
| prog_infos[i].xlated_prog_insns = 0; |
| CHECK(err || info_len != sizeof(struct bpf_prog_info) || |
| memcmp(&prog_info, &prog_infos[i], info_len), |
| "get-prog-info(next_id->fd)", |
| "err %d errno %d info_len %u(%lu) memcmp %d\n", |
| err, errno, info_len, sizeof(struct bpf_prog_info), |
| memcmp(&prog_info, &prog_infos[i], info_len)); |
| |
| close(prog_fd); |
| } |
| CHECK(nr_id_found != nr_iters, |
| "check total prog id found by get_next_id", |
| "nr_id_found %u(%u)\n", |
| nr_id_found, nr_iters); |
| |
| /* Check bpf_map_get_next_id() */ |
| nr_id_found = 0; |
| next_id = 0; |
| while (!bpf_map_get_next_id(next_id, &next_id)) { |
| struct bpf_map_info map_info = {}; |
| int map_fd; |
| |
| info_len = sizeof(map_info); |
| |
| map_fd = bpf_map_get_fd_by_id(next_id); |
| if (map_fd < 0 && errno == ENOENT) |
| /* The bpf_map is in the dead row */ |
| continue; |
| if (CHECK(map_fd < 0, "get-map-fd(next_id)", |
| "map_fd %d next_id %u errno %d\n", |
| map_fd, next_id, errno)) |
| break; |
| |
| for (i = 0; i < nr_iters; i++) |
| if (map_infos[i].id == next_id) |
| break; |
| |
| if (i == nr_iters) |
| continue; |
| |
| nr_id_found++; |
| |
| err = bpf_map_lookup_elem(map_fd, &array_key, &array_value); |
| assert(!err); |
| |
| err = bpf_obj_get_info_by_fd(map_fd, &map_info, &info_len); |
| CHECK(err || info_len != sizeof(struct bpf_map_info) || |
| memcmp(&map_info, &map_infos[i], info_len) || |
| array_value != array_magic_value, |
| "check get-map-info(next_id->fd)", |
| "err %d errno %d info_len %u(%lu) memcmp %d array_value %llu(%llu)\n", |
| err, errno, info_len, sizeof(struct bpf_map_info), |
| memcmp(&map_info, &map_infos[i], info_len), |
| array_value, array_magic_value); |
| |
| close(map_fd); |
| } |
| CHECK(nr_id_found != nr_iters, |
| "check total map id found by get_next_id", |
| "nr_id_found %u(%u)\n", |
| nr_id_found, nr_iters); |
| |
| done: |
| for (i = 0; i < nr_iters; i++) |
| bpf_object__close(objs[i]); |
| } |
| |
| static void test_pkt_md_access(void) |
| { |
| const char *file = "./test_pkt_md_access.o"; |
| struct bpf_object *obj; |
| __u32 duration, retval; |
| int err, prog_fd; |
| |
| err = bpf_prog_load(file, BPF_PROG_TYPE_SCHED_CLS, &obj, &prog_fd); |
| if (err) { |
| error_cnt++; |
| return; |
| } |
| |
| err = bpf_prog_test_run(prog_fd, 10, &pkt_v4, sizeof(pkt_v4), |
| NULL, NULL, &retval, &duration); |
| CHECK(err || retval, "", |
| "err %d errno %d retval %d duration %d\n", |
| err, errno, retval, duration); |
| |
| bpf_object__close(obj); |
| } |
| |
| int main(void) |
| { |
| struct rlimit rinf = { RLIM_INFINITY, RLIM_INFINITY }; |
| |
| setrlimit(RLIMIT_MEMLOCK, &rinf); |
| |
| test_pkt_access(); |
| test_xdp(); |
| test_l4lb(); |
| test_tcp_estats(); |
| test_bpf_obj_id(); |
| test_pkt_md_access(); |
| |
| printf("Summary: %d PASSED, %d FAILED\n", pass_cnt, error_cnt); |
| return error_cnt ? EXIT_FAILURE : EXIT_SUCCESS; |
| } |