1 /* Copyright (c) 2017 Facebook
3 * This program is free software; you can redistribute it and/or
4 * modify it under the terms of version 2 of the GNU General Public
5 * License as published by the Free Software Foundation.
8 #include <linux/slab.h>
9 #include <linux/vmalloc.h>
10 #include <linux/etherdevice.h>
11 #include <linux/filter.h>
12 #include <linux/sched/signal.h>
16 static __always_inline u32 bpf_test_run_one(struct bpf_prog *prog, void *ctx,
17 struct bpf_cgroup_storage *storage[MAX_BPF_CGROUP_STORAGE_TYPE])
23 bpf_cgroup_storage_set(storage);
24 ret = BPF_PROG_RUN(prog, ctx);
31 static u32 bpf_test_run(struct bpf_prog *prog, void *ctx, u32 repeat, u32 *time)
33 struct bpf_cgroup_storage *storage[MAX_BPF_CGROUP_STORAGE_TYPE] = { 0 };
34 enum bpf_cgroup_storage_type stype;
35 u64 time_start, time_spent = 0;
38 for_each_cgroup_storage_type(stype) {
39 storage[stype] = bpf_cgroup_storage_alloc(prog, stype);
40 if (IS_ERR(storage[stype])) {
41 storage[stype] = NULL;
42 for_each_cgroup_storage_type(stype)
43 bpf_cgroup_storage_free(storage[stype]);
50 time_start = ktime_get_ns();
51 for (i = 0; i < repeat; i++) {
52 ret = bpf_test_run_one(prog, ctx, storage);
54 if (signal_pending(current))
56 time_spent += ktime_get_ns() - time_start;
58 time_start = ktime_get_ns();
61 time_spent += ktime_get_ns() - time_start;
62 do_div(time_spent, repeat);
63 *time = time_spent > U32_MAX ? U32_MAX : (u32)time_spent;
65 for_each_cgroup_storage_type(stype)
66 bpf_cgroup_storage_free(storage[stype]);
71 static int bpf_test_finish(const union bpf_attr *kattr,
72 union bpf_attr __user *uattr, const void *data,
73 u32 size, u32 retval, u32 duration)
75 void __user *data_out = u64_to_user_ptr(kattr->test.data_out);
79 /* Clamp copy if the user has provided a size hint, but copy the full
80 * buffer if not to retain old behaviour.
82 if (kattr->test.data_size_out &&
83 copy_size > kattr->test.data_size_out) {
84 copy_size = kattr->test.data_size_out;
88 if (data_out && copy_to_user(data_out, data, copy_size))
90 if (copy_to_user(&uattr->test.data_size_out, &size, sizeof(size)))
92 if (copy_to_user(&uattr->test.retval, &retval, sizeof(retval)))
94 if (copy_to_user(&uattr->test.duration, &duration, sizeof(duration)))
102 static void *bpf_test_init(const union bpf_attr *kattr, u32 size,
103 u32 headroom, u32 tailroom)
105 void __user *data_in = u64_to_user_ptr(kattr->test.data_in);
108 if (size < ETH_HLEN || size > PAGE_SIZE - headroom - tailroom)
109 return ERR_PTR(-EINVAL);
111 data = kzalloc(size + headroom + tailroom, GFP_USER);
113 return ERR_PTR(-ENOMEM);
115 if (copy_from_user(data + headroom, data_in, size)) {
117 return ERR_PTR(-EFAULT);
122 int bpf_prog_test_run_skb(struct bpf_prog *prog, const union bpf_attr *kattr,
123 union bpf_attr __user *uattr)
125 bool is_l2 = false, is_direct_pkt_access = false;
126 u32 size = kattr->test.data_size_in;
127 u32 repeat = kattr->test.repeat;
128 u32 retval, duration;
129 int hh_len = ETH_HLEN;
135 data = bpf_test_init(kattr, size, NET_SKB_PAD + NET_IP_ALIGN,
136 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)));
138 return PTR_ERR(data);
140 switch (prog->type) {
141 case BPF_PROG_TYPE_SCHED_CLS:
142 case BPF_PROG_TYPE_SCHED_ACT:
145 case BPF_PROG_TYPE_LWT_IN:
146 case BPF_PROG_TYPE_LWT_OUT:
147 case BPF_PROG_TYPE_LWT_XMIT:
148 is_direct_pkt_access = true;
154 sk = kzalloc(sizeof(struct sock), GFP_USER);
159 sock_net_set(sk, current->nsproxy->net_ns);
160 sock_init_data(NULL, sk);
162 skb = build_skb(data, 0);
170 skb_reserve(skb, NET_SKB_PAD + NET_IP_ALIGN);
171 __skb_put(skb, size);
172 skb->protocol = eth_type_trans(skb, current->nsproxy->net_ns->loopback_dev);
173 skb_reset_network_header(skb);
176 __skb_push(skb, hh_len);
177 if (is_direct_pkt_access)
178 bpf_compute_data_pointers(skb);
179 retval = bpf_test_run(prog, skb, repeat, &duration);
181 if (skb_headroom(skb) < hh_len) {
182 int nhead = HH_DATA_ALIGN(hh_len - skb_headroom(skb));
184 if (pskb_expand_head(skb, nhead, 0, GFP_USER)) {
190 memset(__skb_push(skb, hh_len), 0, hh_len);
194 /* bpf program can never convert linear skb to non-linear */
195 if (WARN_ON_ONCE(skb_is_nonlinear(skb)))
196 size = skb_headlen(skb);
197 ret = bpf_test_finish(kattr, uattr, skb->data, size, retval, duration);
203 int bpf_prog_test_run_xdp(struct bpf_prog *prog, const union bpf_attr *kattr,
204 union bpf_attr __user *uattr)
206 u32 size = kattr->test.data_size_in;
207 u32 repeat = kattr->test.repeat;
208 struct netdev_rx_queue *rxqueue;
209 struct xdp_buff xdp = {};
210 u32 retval, duration;
214 data = bpf_test_init(kattr, size, XDP_PACKET_HEADROOM + NET_IP_ALIGN, 0);
216 return PTR_ERR(data);
218 xdp.data_hard_start = data;
219 xdp.data = data + XDP_PACKET_HEADROOM + NET_IP_ALIGN;
220 xdp.data_meta = xdp.data;
221 xdp.data_end = xdp.data + size;
223 rxqueue = __netif_get_rx_queue(current->nsproxy->net_ns->loopback_dev, 0);
224 xdp.rxq = &rxqueue->xdp_rxq;
226 retval = bpf_test_run(prog, &xdp, repeat, &duration);
227 if (xdp.data != data + XDP_PACKET_HEADROOM + NET_IP_ALIGN ||
228 xdp.data_end != xdp.data + size)
229 size = xdp.data_end - xdp.data;
230 ret = bpf_test_finish(kattr, uattr, xdp.data, size, retval, duration);