test_run.c 7.9 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12
/* 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 <linux/bpf.h>
#include <linux/slab.h>
#include <linux/vmalloc.h>
#include <linux/etherdevice.h>
#include <linux/filter.h>
#include <linux/sched/signal.h>
13 14
#include <net/sock.h>
#include <net/tcp.h>
15

16 17
static int bpf_test_run(struct bpf_prog *prog, void *ctx, u32 repeat,
			u32 *retval, u32 *time)
18
{
19
	struct bpf_cgroup_storage *storage[MAX_BPF_CGROUP_STORAGE_TYPE] = { NULL };
20
	enum bpf_cgroup_storage_type stype;
21
	u64 time_start, time_spent = 0;
22
	int ret = 0;
23
	u32 i;
24

25 26 27 28 29 30 31 32 33
	for_each_cgroup_storage_type(stype) {
		storage[stype] = bpf_cgroup_storage_alloc(prog, stype);
		if (IS_ERR(storage[stype])) {
			storage[stype] = NULL;
			for_each_cgroup_storage_type(stype)
				bpf_cgroup_storage_free(storage[stype]);
			return -ENOMEM;
		}
	}
34

35 36
	if (!repeat)
		repeat = 1;
37 38 39

	rcu_read_lock();
	preempt_disable();
40 41
	time_start = ktime_get_ns();
	for (i = 0; i < repeat; i++) {
42 43 44 45 46 47 48 49
		bpf_cgroup_storage_set(storage);
		*retval = BPF_PROG_RUN(prog, ctx);

		if (signal_pending(current)) {
			ret = -EINTR;
			break;
		}

50 51
		if (need_resched()) {
			time_spent += ktime_get_ns() - time_start;
52 53 54
			preempt_enable();
			rcu_read_unlock();

55
			cond_resched();
56 57 58

			rcu_read_lock();
			preempt_disable();
59 60 61 62
			time_start = ktime_get_ns();
		}
	}
	time_spent += ktime_get_ns() - time_start;
63 64 65
	preempt_enable();
	rcu_read_unlock();

66 67 68
	do_div(time_spent, repeat);
	*time = time_spent > U32_MAX ? U32_MAX : (u32)time_spent;

69 70
	for_each_cgroup_storage_type(stype)
		bpf_cgroup_storage_free(storage[stype]);
71

72
	return ret;
73 74
}

75 76
static int bpf_test_finish(const union bpf_attr *kattr,
			   union bpf_attr __user *uattr, const void *data,
77 78
			   u32 size, u32 retval, u32 duration)
{
79
	void __user *data_out = u64_to_user_ptr(kattr->test.data_out);
80
	int err = -EFAULT;
81
	u32 copy_size = size;
82

83 84 85 86 87 88 89 90 91 92
	/* Clamp copy if the user has provided a size hint, but copy the full
	 * buffer if not to retain old behaviour.
	 */
	if (kattr->test.data_size_out &&
	    copy_size > kattr->test.data_size_out) {
		copy_size = kattr->test.data_size_out;
		err = -ENOSPC;
	}

	if (data_out && copy_to_user(data_out, data, copy_size))
93 94 95 96 97 98 99
		goto out;
	if (copy_to_user(&uattr->test.data_size_out, &size, sizeof(size)))
		goto out;
	if (copy_to_user(&uattr->test.retval, &retval, sizeof(retval)))
		goto out;
	if (copy_to_user(&uattr->test.duration, &duration, sizeof(duration)))
		goto out;
100 101
	if (err != -ENOSPC)
		err = 0;
102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132
out:
	return err;
}

static void *bpf_test_init(const union bpf_attr *kattr, u32 size,
			   u32 headroom, u32 tailroom)
{
	void __user *data_in = u64_to_user_ptr(kattr->test.data_in);
	void *data;

	if (size < ETH_HLEN || size > PAGE_SIZE - headroom - tailroom)
		return ERR_PTR(-EINVAL);

	data = kzalloc(size + headroom + tailroom, GFP_USER);
	if (!data)
		return ERR_PTR(-ENOMEM);

	if (copy_from_user(data + headroom, data_in, size)) {
		kfree(data);
		return ERR_PTR(-EFAULT);
	}
	return data;
}

int bpf_prog_test_run_skb(struct bpf_prog *prog, const union bpf_attr *kattr,
			  union bpf_attr __user *uattr)
{
	bool is_l2 = false, is_direct_pkt_access = false;
	u32 size = kattr->test.data_size_in;
	u32 repeat = kattr->test.repeat;
	u32 retval, duration;
133
	int hh_len = ETH_HLEN;
134
	struct sk_buff *skb;
135
	struct sock *sk;
136 137 138
	void *data;
	int ret;

139
	data = bpf_test_init(kattr, size, NET_SKB_PAD + NET_IP_ALIGN,
140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157
			     SKB_DATA_ALIGN(sizeof(struct skb_shared_info)));
	if (IS_ERR(data))
		return PTR_ERR(data);

	switch (prog->type) {
	case BPF_PROG_TYPE_SCHED_CLS:
	case BPF_PROG_TYPE_SCHED_ACT:
		is_l2 = true;
		/* fall through */
	case BPF_PROG_TYPE_LWT_IN:
	case BPF_PROG_TYPE_LWT_OUT:
	case BPF_PROG_TYPE_LWT_XMIT:
		is_direct_pkt_access = true;
		break;
	default:
		break;
	}

158 159 160 161 162 163 164 165
	sk = kzalloc(sizeof(struct sock), GFP_USER);
	if (!sk) {
		kfree(data);
		return -ENOMEM;
	}
	sock_net_set(sk, current->nsproxy->net_ns);
	sock_init_data(NULL, sk);

166 167 168
	skb = build_skb(data, 0);
	if (!skb) {
		kfree(data);
169
		kfree(sk);
170 171
		return -ENOMEM;
	}
172
	skb->sk = sk;
173

174
	skb_reserve(skb, NET_SKB_PAD + NET_IP_ALIGN);
175 176 177 178 179
	__skb_put(skb, size);
	skb->protocol = eth_type_trans(skb, current->nsproxy->net_ns->loopback_dev);
	skb_reset_network_header(skb);

	if (is_l2)
180
		__skb_push(skb, hh_len);
181
	if (is_direct_pkt_access)
182
		bpf_compute_data_pointers(skb);
183 184 185 186 187 188
	ret = bpf_test_run(prog, skb, repeat, &retval, &duration);
	if (ret) {
		kfree_skb(skb);
		kfree(sk);
		return ret;
	}
189 190 191 192 193 194
	if (!is_l2) {
		if (skb_headroom(skb) < hh_len) {
			int nhead = HH_DATA_ALIGN(hh_len - skb_headroom(skb));

			if (pskb_expand_head(skb, nhead, 0, GFP_USER)) {
				kfree_skb(skb);
195
				kfree(sk);
196 197 198 199 200 201
				return -ENOMEM;
			}
		}
		memset(__skb_push(skb, hh_len), 0, hh_len);
	}

202 203 204 205
	size = skb->len;
	/* bpf program can never convert linear skb to non-linear */
	if (WARN_ON_ONCE(skb_is_nonlinear(skb)))
		size = skb_headlen(skb);
206
	ret = bpf_test_finish(kattr, uattr, skb->data, size, retval, duration);
207
	kfree_skb(skb);
208
	kfree(sk);
209 210 211 212 213 214 215 216
	return ret;
}

int bpf_prog_test_run_xdp(struct bpf_prog *prog, const union bpf_attr *kattr,
			  union bpf_attr __user *uattr)
{
	u32 size = kattr->test.data_size_in;
	u32 repeat = kattr->test.repeat;
217
	struct netdev_rx_queue *rxqueue;
218 219 220 221 222
	struct xdp_buff xdp = {};
	u32 retval, duration;
	void *data;
	int ret;

223
	data = bpf_test_init(kattr, size, XDP_PACKET_HEADROOM + NET_IP_ALIGN, 0);
224 225 226 227
	if (IS_ERR(data))
		return PTR_ERR(data);

	xdp.data_hard_start = data;
228
	xdp.data = data + XDP_PACKET_HEADROOM + NET_IP_ALIGN;
229
	xdp.data_meta = xdp.data;
230 231
	xdp.data_end = xdp.data + size;

232 233 234
	rxqueue = __netif_get_rx_queue(current->nsproxy->net_ns->loopback_dev, 0);
	xdp.rxq = &rxqueue->xdp_rxq;

235 236 237
	ret = bpf_test_run(prog, &xdp, repeat, &retval, &duration);
	if (ret)
		goto out;
238 239
	if (xdp.data != data + XDP_PACKET_HEADROOM + NET_IP_ALIGN ||
	    xdp.data_end != xdp.data + size)
240
		size = xdp.data_end - xdp.data;
241
	ret = bpf_test_finish(kattr, uattr, xdp.data, size, retval, duration);
242
out:
243 244 245
	kfree(data);
	return ret;
}
246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298

int bpf_prog_test_run_flow_dissector(struct bpf_prog *prog,
				     const union bpf_attr *kattr,
				     union bpf_attr __user *uattr)
{
	u32 size = kattr->test.data_size_in;
	u32 repeat = kattr->test.repeat;
	struct bpf_flow_keys flow_keys;
	u64 time_start, time_spent = 0;
	struct bpf_skb_data_end *cb;
	u32 retval, duration;
	struct sk_buff *skb;
	struct sock *sk;
	void *data;
	int ret;
	u32 i;

	if (prog->type != BPF_PROG_TYPE_FLOW_DISSECTOR)
		return -EINVAL;

	data = bpf_test_init(kattr, size, NET_SKB_PAD + NET_IP_ALIGN,
			     SKB_DATA_ALIGN(sizeof(struct skb_shared_info)));
	if (IS_ERR(data))
		return PTR_ERR(data);

	sk = kzalloc(sizeof(*sk), GFP_USER);
	if (!sk) {
		kfree(data);
		return -ENOMEM;
	}
	sock_net_set(sk, current->nsproxy->net_ns);
	sock_init_data(NULL, sk);

	skb = build_skb(data, 0);
	if (!skb) {
		kfree(data);
		kfree(sk);
		return -ENOMEM;
	}
	skb->sk = sk;

	skb_reserve(skb, NET_SKB_PAD + NET_IP_ALIGN);
	__skb_put(skb, size);
	skb->protocol = eth_type_trans(skb,
				       current->nsproxy->net_ns->loopback_dev);
	skb_reset_network_header(skb);

	cb = (struct bpf_skb_data_end *)skb->cb;
	cb->qdisc_cb.flow_keys = &flow_keys;

	if (!repeat)
		repeat = 1;

299 300
	rcu_read_lock();
	preempt_disable();
301 302 303 304 305
	time_start = ktime_get_ns();
	for (i = 0; i < repeat; i++) {
		retval = __skb_flow_bpf_dissect(prog, skb,
						&flow_keys_dissector,
						&flow_keys);
306 307 308 309 310 311 312 313

		if (signal_pending(current)) {
			preempt_enable();
			rcu_read_unlock();

			ret = -EINTR;
			goto out;
		}
314 315 316

		if (need_resched()) {
			time_spent += ktime_get_ns() - time_start;
317 318 319
			preempt_enable();
			rcu_read_unlock();

320
			cond_resched();
321 322 323

			rcu_read_lock();
			preempt_disable();
324 325 326 327
			time_start = ktime_get_ns();
		}
	}
	time_spent += ktime_get_ns() - time_start;
328 329 330
	preempt_enable();
	rcu_read_unlock();

331 332 333 334 335 336
	do_div(time_spent, repeat);
	duration = time_spent > U32_MAX ? U32_MAX : (u32)time_spent;

	ret = bpf_test_finish(kattr, uattr, &flow_keys, sizeof(flow_keys),
			      retval, duration);

337
out:
338 339 340 341
	kfree_skb(skb);
	kfree(sk);
	return ret;
}