xsk.c 27.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
// SPDX-License-Identifier: GPL-2.0
/* XDP sockets
 *
 * AF_XDP sockets allows a channel between XDP programs and userspace
 * applications.
 * Copyright(c) 2018 Intel Corporation.
 *
 * Author(s): Björn Töpel <bjorn.topel@intel.com>
 *	      Magnus Karlsson <magnus.karlsson@intel.com>
 */

#define pr_fmt(fmt) "AF_XDP: %s: " fmt, __func__

#include <linux/if_xdp.h>
#include <linux/init.h>
#include <linux/sched/mm.h>
#include <linux/sched/signal.h>
#include <linux/sched/task.h>
#include <linux/socket.h>
#include <linux/file.h>
#include <linux/uaccess.h>
#include <linux/net.h>
#include <linux/netdevice.h>
24
#include <linux/rculist.h>
25
#include <net/xdp_sock_drv.h>
26
#include <net/xdp.h>
27

28
#include "xsk_queue.h"
29
#include "xdp_umem.h"
30
#include "xsk.h"
31

M
Magnus Karlsson 已提交
32 33
#define TX_BATCH_SIZE 16

34 35
static DEFINE_PER_CPU(struct list_head, xskmap_flush_list);

36 37
bool xsk_is_setup_for_bpf_map(struct xdp_sock *xs)
{
38
	return READ_ONCE(xs->rx) &&  READ_ONCE(xs->umem) &&
39
		(xs->pool->fq || READ_ONCE(xs->fq_tmp));
40 41
}

42
void xsk_set_rx_need_wakeup(struct xsk_buff_pool *pool)
43
{
44
	if (pool->cached_need_wakeup & XDP_WAKEUP_RX)
45 46
		return;

47
	pool->fq->ring->flags |= XDP_RING_NEED_WAKEUP;
48
	pool->cached_need_wakeup |= XDP_WAKEUP_RX;
49 50 51
}
EXPORT_SYMBOL(xsk_set_rx_need_wakeup);

52
void xsk_set_tx_need_wakeup(struct xsk_buff_pool *pool)
53
{
54
	struct xdp_umem *umem = pool->umem;
55 56
	struct xdp_sock *xs;

57
	if (pool->cached_need_wakeup & XDP_WAKEUP_TX)
58 59 60
		return;

	rcu_read_lock();
61
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
62 63 64 65
		xs->tx->ring->flags |= XDP_RING_NEED_WAKEUP;
	}
	rcu_read_unlock();

66
	pool->cached_need_wakeup |= XDP_WAKEUP_TX;
67 68 69
}
EXPORT_SYMBOL(xsk_set_tx_need_wakeup);

70
void xsk_clear_rx_need_wakeup(struct xsk_buff_pool *pool)
71
{
72
	if (!(pool->cached_need_wakeup & XDP_WAKEUP_RX))
73 74
		return;

75
	pool->fq->ring->flags &= ~XDP_RING_NEED_WAKEUP;
76
	pool->cached_need_wakeup &= ~XDP_WAKEUP_RX;
77 78 79
}
EXPORT_SYMBOL(xsk_clear_rx_need_wakeup);

80
void xsk_clear_tx_need_wakeup(struct xsk_buff_pool *pool)
81
{
82
	struct xdp_umem *umem = pool->umem;
83 84
	struct xdp_sock *xs;

85
	if (!(pool->cached_need_wakeup & XDP_WAKEUP_TX))
86 87 88
		return;

	rcu_read_lock();
89
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
90 91 92 93
		xs->tx->ring->flags &= ~XDP_RING_NEED_WAKEUP;
	}
	rcu_read_unlock();

94
	pool->cached_need_wakeup &= ~XDP_WAKEUP_TX;
95 96 97
}
EXPORT_SYMBOL(xsk_clear_tx_need_wakeup);

98
bool xsk_uses_need_wakeup(struct xsk_buff_pool *pool)
99
{
100
	return pool->uses_need_wakeup;
101
}
102
EXPORT_SYMBOL(xsk_uses_need_wakeup);
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 133 134 135 136 137 138 139 140 141 142 143
struct xsk_buff_pool *xsk_get_pool_from_qid(struct net_device *dev,
					    u16 queue_id)
{
	if (queue_id < dev->real_num_rx_queues)
		return dev->_rx[queue_id].pool;
	if (queue_id < dev->real_num_tx_queues)
		return dev->_tx[queue_id].pool;

	return NULL;
}
EXPORT_SYMBOL(xsk_get_pool_from_qid);

void xsk_clear_pool_at_qid(struct net_device *dev, u16 queue_id)
{
	if (queue_id < dev->real_num_rx_queues)
		dev->_rx[queue_id].pool = NULL;
	if (queue_id < dev->real_num_tx_queues)
		dev->_tx[queue_id].pool = NULL;
}

/* The buffer pool is stored both in the _rx struct and the _tx struct as we do
 * not know if the device has more tx queues than rx, or the opposite.
 * This might also change during run time.
 */
int xsk_reg_pool_at_qid(struct net_device *dev, struct xsk_buff_pool *pool,
			u16 queue_id)
{
	if (queue_id >= max_t(unsigned int,
			      dev->real_num_rx_queues,
			      dev->real_num_tx_queues))
		return -EINVAL;

	if (queue_id < dev->real_num_rx_queues)
		dev->_rx[queue_id].pool = pool;
	if (queue_id < dev->real_num_tx_queues)
		dev->_tx[queue_id].pool = pool;

	return 0;
}

144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
void xp_release(struct xdp_buff_xsk *xskb)
{
	xskb->pool->free_heads[xskb->pool->free_heads_cnt++] = xskb;
}

static u64 xp_get_handle(struct xdp_buff_xsk *xskb)
{
	u64 offset = xskb->xdp.data - xskb->xdp.data_hard_start;

	offset += xskb->pool->headroom;
	if (!xskb->pool->unaligned)
		return xskb->orig_addr + offset;
	return xskb->orig_addr + (offset << XSK_UNALIGNED_BUF_OFFSET_SHIFT);
}

159
static int __xsk_rcv_zc(struct xdp_sock *xs, struct xdp_buff *xdp, u32 len)
160
{
161 162 163
	struct xdp_buff_xsk *xskb = container_of(xdp, struct xdp_buff_xsk, xdp);
	u64 addr;
	int err;
164

165 166 167
	addr = xp_get_handle(xskb);
	err = xskq_prod_reserve_desc(xs->rx, addr, len);
	if (err) {
C
Ciara Loftus 已提交
168
		xs->rx_queue_full++;
169
		return err;
170 171
	}

172 173
	xp_release(xskb);
	return 0;
174 175
}

176
static void xsk_copy_xdp(struct xdp_buff *to, struct xdp_buff *from, u32 len)
177
{
178
	void *from_buf, *to_buf;
179
	u32 metalen;
180

181 182 183
	if (unlikely(xdp_data_meta_unsupported(from))) {
		from_buf = from->data;
		to_buf = to->data;
184 185
		metalen = 0;
	} else {
186 187 188
		from_buf = from->data_meta;
		metalen = from->data - from->data_meta;
		to_buf = to->data - metalen;
189 190
	}

191
	memcpy(to_buf, from_buf, len + metalen);
192 193
}

194 195
static int __xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp, u32 len,
		     bool explicit_free)
196
{
197 198
	struct xdp_buff *xsk_xdp;
	int err;
199

200
	if (len > xsk_pool_get_rx_frame_size(xs->pool)) {
201 202 203 204
		xs->rx_dropped++;
		return -ENOSPC;
	}

205
	xsk_xdp = xsk_buff_alloc(xs->pool);
206
	if (!xsk_xdp) {
207
		xs->rx_dropped++;
208 209
		return -ENOSPC;
	}
210

211 212 213 214 215 216 217 218 219
	xsk_copy_xdp(xsk_xdp, xdp, len);
	err = __xsk_rcv_zc(xs, xsk_xdp, len);
	if (err) {
		xsk_buff_free(xsk_xdp);
		return err;
	}
	if (explicit_free)
		xdp_return_buff(xdp);
	return 0;
220 221
}

222 223 224 225 226 227 228 229 230 231
static bool xsk_is_bound(struct xdp_sock *xs)
{
	if (READ_ONCE(xs->state) == XSK_BOUND) {
		/* Matches smp_wmb() in bind(). */
		smp_rmb();
		return true;
	}
	return false;
}

232 233
static int xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp,
		   bool explicit_free)
234 235 236
{
	u32 len;

237 238 239
	if (!xsk_is_bound(xs))
		return -EINVAL;

240 241 242 243 244
	if (xs->dev != xdp->rxq->dev || xs->queue_id != xdp->rxq->queue_index)
		return -EINVAL;

	len = xdp->data_end - xdp->data;

245
	return xdp->rxq->mem.type == MEM_TYPE_XSK_BUFF_POOL ?
246 247
		__xsk_rcv_zc(xs, xdp, len) :
		__xsk_rcv(xs, xdp, len, explicit_free);
248 249
}

250
static void xsk_flush(struct xdp_sock *xs)
251
{
252
	xskq_prod_submit(xs->rx);
253
	__xskq_cons_release(xs->pool->fq);
254
	sock_def_readable(&xs->sk);
255 256 257 258 259 260
}

int xsk_generic_rcv(struct xdp_sock *xs, struct xdp_buff *xdp)
{
	int err;

261
	spin_lock_bh(&xs->rx_lock);
262 263
	err = xsk_rcv(xs, xdp, false);
	xsk_flush(xs);
264
	spin_unlock_bh(&xs->rx_lock);
265 266 267
	return err;
}

268
int __xsk_map_redirect(struct xdp_sock *xs, struct xdp_buff *xdp)
269
{
270
	struct list_head *flush_list = this_cpu_ptr(&xskmap_flush_list);
271 272
	int err;

273
	err = xsk_rcv(xs, xdp, true);
274 275 276 277 278 279 280 281 282
	if (err)
		return err;

	if (!xs->flush_node.prev)
		list_add(&xs->flush_node, flush_list);

	return 0;
}

283
void __xsk_map_flush(void)
284
{
285
	struct list_head *flush_list = this_cpu_ptr(&xskmap_flush_list);
286 287 288 289 290 291 292 293
	struct xdp_sock *xs, *tmp;

	list_for_each_entry_safe(xs, tmp, flush_list, flush_node) {
		xsk_flush(xs);
		__list_del_clearprev(&xs->flush_node);
	}
}

294
void xsk_tx_completed(struct xsk_buff_pool *pool, u32 nb_entries)
295
{
296
	xskq_prod_submit_n(pool->cq, nb_entries);
297
}
298
EXPORT_SYMBOL(xsk_tx_completed);
299

300
void xsk_tx_release(struct xsk_buff_pool *pool)
301 302 303 304
{
	struct xdp_sock *xs;

	rcu_read_lock();
305
	list_for_each_entry_rcu(xs, &pool->umem->xsk_tx_list, list) {
306
		__xskq_cons_release(xs->tx);
307 308 309 310
		xs->sk.sk_write_space(&xs->sk);
	}
	rcu_read_unlock();
}
311
EXPORT_SYMBOL(xsk_tx_release);
312

313
bool xsk_tx_peek_desc(struct xsk_buff_pool *pool, struct xdp_desc *desc)
314
{
315
	struct xdp_umem *umem = pool->umem;
316 317 318
	struct xdp_sock *xs;

	rcu_read_lock();
319
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
320
		if (!xskq_cons_peek_desc(xs->tx, desc, pool)) {
C
Ciara Loftus 已提交
321
			xs->tx->queue_empty_descs++;
322
			continue;
C
Ciara Loftus 已提交
323
		}
324

325
		/* This is the backpressure mechanism for the Tx path.
326 327 328 329
		 * Reserve space in the completion queue and only proceed
		 * if there is space in it. This avoids having to implement
		 * any buffering in the Tx path.
		 */
330
		if (xskq_prod_reserve_addr(pool->cq, desc->addr))
331 332
			goto out;

333
		xskq_cons_release(xs->tx);
334 335 336 337 338 339 340 341
		rcu_read_unlock();
		return true;
	}

out:
	rcu_read_unlock();
	return false;
}
342
EXPORT_SYMBOL(xsk_tx_peek_desc);
343

344
static int xsk_wakeup(struct xdp_sock *xs, u8 flags)
345 346
{
	struct net_device *dev = xs->dev;
347 348 349 350 351
	int err;

	rcu_read_lock();
	err = dev->netdev_ops->ndo_xsk_wakeup(dev, xs->queue_id, flags);
	rcu_read_unlock();
352

353 354 355 356 357 358
	return err;
}

static int xsk_zc_xmit(struct xdp_sock *xs)
{
	return xsk_wakeup(xs, XDP_WAKEUP_TX);
359 360
}

M
Magnus Karlsson 已提交
361 362
static void xsk_destruct_skb(struct sk_buff *skb)
{
363
	u64 addr = (u64)(long)skb_shinfo(skb)->destructor_arg;
M
Magnus Karlsson 已提交
364
	struct xdp_sock *xs = xdp_sk(skb->sk);
365
	unsigned long flags;
M
Magnus Karlsson 已提交
366

367
	spin_lock_irqsave(&xs->tx_completion_lock, flags);
368
	xskq_prod_submit_addr(xs->pool->cq, addr);
369
	spin_unlock_irqrestore(&xs->tx_completion_lock, flags);
M
Magnus Karlsson 已提交
370 371 372 373

	sock_wfree(skb);
}

374
static int xsk_generic_xmit(struct sock *sk)
M
Magnus Karlsson 已提交
375 376
{
	struct xdp_sock *xs = xdp_sk(sk);
377
	u32 max_batch = TX_BATCH_SIZE;
M
Magnus Karlsson 已提交
378 379 380 381 382 383 384
	bool sent_frame = false;
	struct xdp_desc desc;
	struct sk_buff *skb;
	int err = 0;

	mutex_lock(&xs->mutex);

I
Ilya Maximets 已提交
385 386 387
	if (xs->queue_id >= xs->dev->real_num_tx_queues)
		goto out;

388
	while (xskq_cons_peek_desc(xs->tx, &desc, xs->pool)) {
M
Magnus Karlsson 已提交
389
		char *buffer;
390 391
		u64 addr;
		u32 len;
M
Magnus Karlsson 已提交
392 393 394 395 396 397

		if (max_batch-- == 0) {
			err = -EAGAIN;
			goto out;
		}

398
		len = desc.len;
399
		skb = sock_alloc_send_skb(sk, len, 1, &err);
L
Li RongQing 已提交
400
		if (unlikely(!skb))
M
Magnus Karlsson 已提交
401 402 403
			goto out;

		skb_put(skb, len);
404
		addr = desc.addr;
405
		buffer = xsk_buff_raw_get_data(xs->pool, addr);
M
Magnus Karlsson 已提交
406
		err = skb_store_bits(skb, 0, buffer, len);
407
		/* This is the backpressure mechanism for the Tx path.
408 409 410 411
		 * Reserve space in the completion queue and only proceed
		 * if there is space in it. This avoids having to implement
		 * any buffering in the Tx path.
		 */
412
		if (unlikely(err) || xskq_prod_reserve(xs->pool->cq)) {
M
Magnus Karlsson 已提交
413 414 415 416 417 418 419
			kfree_skb(skb);
			goto out;
		}

		skb->dev = xs->dev;
		skb->priority = sk->sk_priority;
		skb->mark = sk->sk_mark;
420
		skb_shinfo(skb)->destructor_arg = (void *)(long)desc.addr;
M
Magnus Karlsson 已提交
421 422 423
		skb->destructor = xsk_destruct_skb;

		err = dev_direct_xmit(skb, xs->queue_id);
424
		xskq_cons_release(xs->tx);
M
Magnus Karlsson 已提交
425 426
		/* Ignore NET_XMIT_CN as packet might have been sent */
		if (err == NET_XMIT_DROP || err == NETDEV_TX_BUSY) {
427 428
			/* SKB completed but not sent */
			err = -EBUSY;
M
Magnus Karlsson 已提交
429 430 431 432 433 434
			goto out;
		}

		sent_frame = true;
	}

C
Ciara Loftus 已提交
435 436
	xs->tx->queue_empty_descs++;

M
Magnus Karlsson 已提交
437 438 439 440 441 442 443 444
out:
	if (sent_frame)
		sk->sk_write_space(sk);

	mutex_unlock(&xs->mutex);
	return err;
}

445 446 447 448 449 450 451 452 453 454 455 456
static int __xsk_sendmsg(struct sock *sk)
{
	struct xdp_sock *xs = xdp_sk(sk);

	if (unlikely(!(xs->dev->flags & IFF_UP)))
		return -ENETDOWN;
	if (unlikely(!xs->tx))
		return -ENOBUFS;

	return xs->zc ? xsk_zc_xmit(xs) : xsk_generic_xmit(sk);
}

M
Magnus Karlsson 已提交
457 458
static int xsk_sendmsg(struct socket *sock, struct msghdr *m, size_t total_len)
{
459
	bool need_wait = !(m->msg_flags & MSG_DONTWAIT);
M
Magnus Karlsson 已提交
460 461 462
	struct sock *sk = sock->sk;
	struct xdp_sock *xs = xdp_sk(sk);

463
	if (unlikely(!xsk_is_bound(xs)))
M
Magnus Karlsson 已提交
464
		return -ENXIO;
465
	if (unlikely(need_wait))
466
		return -EOPNOTSUPP;
M
Magnus Karlsson 已提交
467

468
	return __xsk_sendmsg(sk);
M
Magnus Karlsson 已提交
469 470
}

471
static __poll_t xsk_poll(struct file *file, struct socket *sock,
472
			     struct poll_table_struct *wait)
473
{
474
	__poll_t mask = datagram_poll(file, sock, wait);
475 476
	struct sock *sk = sock->sk;
	struct xdp_sock *xs = xdp_sk(sk);
477
	struct xsk_buff_pool *pool;
478 479 480 481

	if (unlikely(!xsk_is_bound(xs)))
		return mask;

482
	pool = xs->pool;
483

484
	if (pool->cached_need_wakeup) {
485
		if (xs->zc)
486
			xsk_wakeup(xs, pool->cached_need_wakeup);
487 488 489 490
		else
			/* Poll needs to drive Tx also in copy mode */
			__xsk_sendmsg(sk);
	}
491

492
	if (xs->rx && !xskq_prod_is_empty(xs->rx))
493
		mask |= EPOLLIN | EPOLLRDNORM;
494
	if (xs->tx && !xskq_cons_is_full(xs->tx))
495
		mask |= EPOLLOUT | EPOLLWRNORM;
496 497 498 499

	return mask;
}

500 501
static int xsk_init_queue(u32 entries, struct xsk_queue **queue,
			  bool umem_queue)
502 503 504 505 506 507
{
	struct xsk_queue *q;

	if (entries == 0 || *queue || !is_power_of_2(entries))
		return -EINVAL;

508
	q = xskq_create(entries, umem_queue);
509 510 511
	if (!q)
		return -ENOMEM;

512 513
	/* Make sure queue is ready before it can be seen by others */
	smp_wmb();
514
	WRITE_ONCE(*queue, q);
515 516 517
	return 0;
}

518 519 520 521
static void xsk_unbind_dev(struct xdp_sock *xs)
{
	struct net_device *dev = xs->dev;

522
	if (xs->state != XSK_BOUND)
523
		return;
524
	WRITE_ONCE(xs->state, XSK_UNBOUND);
525 526 527 528 529 530 531 532

	/* Wait for driver to stop using the xdp socket. */
	xdp_del_sk_umem(xs->umem, xs);
	xs->dev = NULL;
	synchronize_net();
	dev_put(dev);
}

533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578
static struct xsk_map *xsk_get_map_list_entry(struct xdp_sock *xs,
					      struct xdp_sock ***map_entry)
{
	struct xsk_map *map = NULL;
	struct xsk_map_node *node;

	*map_entry = NULL;

	spin_lock_bh(&xs->map_list_lock);
	node = list_first_entry_or_null(&xs->map_list, struct xsk_map_node,
					node);
	if (node) {
		WARN_ON(xsk_map_inc(node->map));
		map = node->map;
		*map_entry = node->map_entry;
	}
	spin_unlock_bh(&xs->map_list_lock);
	return map;
}

static void xsk_delete_from_maps(struct xdp_sock *xs)
{
	/* This function removes the current XDP socket from all the
	 * maps it resides in. We need to take extra care here, due to
	 * the two locks involved. Each map has a lock synchronizing
	 * updates to the entries, and each socket has a lock that
	 * synchronizes access to the list of maps (map_list). For
	 * deadlock avoidance the locks need to be taken in the order
	 * "map lock"->"socket map list lock". We start off by
	 * accessing the socket map list, and take a reference to the
	 * map to guarantee existence between the
	 * xsk_get_map_list_entry() and xsk_map_try_sock_delete()
	 * calls. Then we ask the map to remove the socket, which
	 * tries to remove the socket from the map. Note that there
	 * might be updates to the map between
	 * xsk_get_map_list_entry() and xsk_map_try_sock_delete().
	 */
	struct xdp_sock **map_entry = NULL;
	struct xsk_map *map;

	while ((map = xsk_get_map_list_entry(xs, &map_entry))) {
		xsk_map_try_sock_delete(map, xs, map_entry);
		xsk_map_put(map);
	}
}

579 580 581
static int xsk_release(struct socket *sock)
{
	struct sock *sk = sock->sk;
582
	struct xdp_sock *xs = xdp_sk(sk);
583 584 585 586 587 588 589
	struct net *net;

	if (!sk)
		return 0;

	net = sock_net(sk);

590 591 592 593
	mutex_lock(&net->xdp.lock);
	sk_del_node_init_rcu(sk);
	mutex_unlock(&net->xdp.lock);

594 595 596 597
	local_bh_disable();
	sock_prot_inuse_add(net, sk->sk_prot, -1);
	local_bh_enable();

598
	xsk_delete_from_maps(xs);
599
	mutex_lock(&xs->mutex);
600
	xsk_unbind_dev(xs);
601
	mutex_unlock(&xs->mutex);
602

603 604
	xskq_destroy(xs->rx);
	xskq_destroy(xs->tx);
605 606
	xskq_destroy(xs->fq_tmp);
	xskq_destroy(xs->cq_tmp);
607

608 609 610 611 612 613 614 615 616
	sock_orphan(sk);
	sock->sk = NULL;

	sk_refcnt_debug_release(sk);
	sock_put(sk);

	return 0;
}

617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633
static struct socket *xsk_lookup_xsk_from_fd(int fd)
{
	struct socket *sock;
	int err;

	sock = sockfd_lookup(fd, &err);
	if (!sock)
		return ERR_PTR(-ENOTSOCK);

	if (sock->sk->sk_family != PF_XDP) {
		sockfd_put(sock);
		return ERR_PTR(-ENOPROTOOPT);
	}

	return sock;
}

634 635 636 637 638
static bool xsk_validate_queues(struct xdp_sock *xs)
{
	return xs->fq_tmp && xs->cq_tmp;
}

639 640 641 642 643
static int xsk_bind(struct socket *sock, struct sockaddr *addr, int addr_len)
{
	struct sockaddr_xdp *sxdp = (struct sockaddr_xdp *)addr;
	struct sock *sk = sock->sk;
	struct xdp_sock *xs = xdp_sk(sk);
B
Björn Töpel 已提交
644
	struct net_device *dev;
645
	u32 flags, qid;
646 647 648 649 650 651 652
	int err = 0;

	if (addr_len < sizeof(struct sockaddr_xdp))
		return -EINVAL;
	if (sxdp->sxdp_family != AF_XDP)
		return -EINVAL;

653
	flags = sxdp->sxdp_flags;
654 655
	if (flags & ~(XDP_SHARED_UMEM | XDP_COPY | XDP_ZEROCOPY |
		      XDP_USE_NEED_WAKEUP))
656 657
		return -EINVAL;

658
	rtnl_lock();
659
	mutex_lock(&xs->mutex);
660
	if (xs->state != XSK_READY) {
B
Björn Töpel 已提交
661 662 663 664
		err = -EBUSY;
		goto out_release;
	}

665 666 667 668 669 670
	dev = dev_get_by_index(sock_net(sk), sxdp->sxdp_ifindex);
	if (!dev) {
		err = -ENODEV;
		goto out_release;
	}

671
	if (!xs->rx && !xs->tx) {
672 673 674 675
		err = -EINVAL;
		goto out_unlock;
	}

676 677 678
	qid = sxdp->sxdp_queue_id;

	if (flags & XDP_SHARED_UMEM) {
679 680 681
		struct xdp_sock *umem_xs;
		struct socket *sock;

682 683
		if ((flags & XDP_COPY) || (flags & XDP_ZEROCOPY) ||
		    (flags & XDP_USE_NEED_WAKEUP)) {
684 685 686 687 688
			/* Cannot specify flags for shared sockets. */
			err = -EINVAL;
			goto out_unlock;
		}

689 690 691 692 693 694
		if (xs->umem) {
			/* We have already our own. */
			err = -EINVAL;
			goto out_unlock;
		}

695 696 697 698 699 700
		if (xs->fq_tmp || xs->cq_tmp) {
			/* Do not allow setting your own fq or cq. */
			err = -EINVAL;
			goto out_unlock;
		}

701 702 703 704 705 706 707
		sock = xsk_lookup_xsk_from_fd(sxdp->sxdp_shared_umem_fd);
		if (IS_ERR(sock)) {
			err = PTR_ERR(sock);
			goto out_unlock;
		}

		umem_xs = xdp_sk(sock->sk);
708
		if (!xsk_is_bound(umem_xs)) {
709 710 711
			err = -EBADF;
			sockfd_put(sock);
			goto out_unlock;
712 713
		}
		if (umem_xs->dev != dev || umem_xs->queue_id != qid) {
714 715 716 717 718
			err = -EINVAL;
			sockfd_put(sock);
			goto out_unlock;
		}

719 720 721
		/* Share the buffer pool with the other socket. */
		xp_get_pool(umem_xs->pool);
		xs->pool = umem_xs->pool;
722
		xdp_get_umem(umem_xs->umem);
723
		WRITE_ONCE(xs->umem, umem_xs->umem);
724
		sockfd_put(sock);
725
	} else if (!xs->umem || !xsk_validate_queues(xs)) {
726 727
		err = -EINVAL;
		goto out_unlock;
728 729
	} else {
		/* This xsk has its own umem. */
730 731 732
		xs->pool = xp_create_and_assign_umem(xs, xs->umem);
		if (!xs->pool) {
			err = -ENOMEM;
733
			goto out_unlock;
734 735 736 737 738 739 740 741
		}

		err = xp_assign_dev(xs->pool, dev, qid, flags);
		if (err) {
			xp_destroy(xs->pool);
			xs->pool = NULL;
			goto out_unlock;
		}
742 743 744
	}

	xs->dev = dev;
745 746 747
	xs->zc = xs->umem->zc;
	xs->queue_id = qid;
	xdp_add_sk_umem(xs->umem, xs);
748 749

out_unlock:
750
	if (err) {
751
		dev_put(dev);
752 753 754 755 756 757 758
	} else {
		/* Matches smp_rmb() in bind() for shared umem
		 * sockets, and xsk_is_bound().
		 */
		smp_wmb();
		WRITE_ONCE(xs->state, XSK_BOUND);
	}
759 760
out_release:
	mutex_unlock(&xs->mutex);
761
	rtnl_unlock();
762 763 764
	return err;
}

765 766 767 768 769 770 771
struct xdp_umem_reg_v1 {
	__u64 addr; /* Start of packet data area */
	__u64 len; /* Length of packet data area */
	__u32 chunk_size;
	__u32 headroom;
};

772
static int xsk_setsockopt(struct socket *sock, int level, int optname,
773
			  sockptr_t optval, unsigned int optlen)
774 775 776 777 778 779 780 781 782
{
	struct sock *sk = sock->sk;
	struct xdp_sock *xs = xdp_sk(sk);
	int err;

	if (level != SOL_XDP)
		return -ENOPROTOOPT;

	switch (optname) {
783
	case XDP_RX_RING:
784
	case XDP_TX_RING:
785 786 787 788 789 790
	{
		struct xsk_queue **q;
		int entries;

		if (optlen < sizeof(entries))
			return -EINVAL;
791
		if (copy_from_sockptr(&entries, optval, sizeof(entries)))
792 793 794
			return -EFAULT;

		mutex_lock(&xs->mutex);
795 796 797 798
		if (xs->state != XSK_READY) {
			mutex_unlock(&xs->mutex);
			return -EBUSY;
		}
799
		q = (optname == XDP_TX_RING) ? &xs->tx : &xs->rx;
800
		err = xsk_init_queue(entries, q, false);
801 802 803
		if (!err && optname == XDP_TX_RING)
			/* Tx needs to be explicitly woken up the first time */
			xs->tx->ring->flags |= XDP_RING_NEED_WAKEUP;
804 805 806
		mutex_unlock(&xs->mutex);
		return err;
	}
807 808
	case XDP_UMEM_REG:
	{
809 810
		size_t mr_size = sizeof(struct xdp_umem_reg);
		struct xdp_umem_reg mr = {};
811 812
		struct xdp_umem *umem;

813 814 815 816 817
		if (optlen < sizeof(struct xdp_umem_reg_v1))
			return -EINVAL;
		else if (optlen < sizeof(mr))
			mr_size = sizeof(struct xdp_umem_reg_v1);

818
		if (copy_from_sockptr(&mr, optval, mr_size))
819 820 821
			return -EFAULT;

		mutex_lock(&xs->mutex);
822
		if (xs->state != XSK_READY || xs->umem) {
B
Björn Töpel 已提交
823 824 825
			mutex_unlock(&xs->mutex);
			return -EBUSY;
		}
826

B
Björn Töpel 已提交
827 828
		umem = xdp_umem_create(&mr);
		if (IS_ERR(umem)) {
829
			mutex_unlock(&xs->mutex);
B
Björn Töpel 已提交
830
			return PTR_ERR(umem);
831 832 833 834
		}

		/* Make sure umem is ready before it can be seen by others */
		smp_wmb();
835
		WRITE_ONCE(xs->umem, umem);
836 837 838
		mutex_unlock(&xs->mutex);
		return 0;
	}
839
	case XDP_UMEM_FILL_RING:
840
	case XDP_UMEM_COMPLETION_RING:
841 842 843 844
	{
		struct xsk_queue **q;
		int entries;

845
		if (copy_from_sockptr(&entries, optval, sizeof(entries)))
846 847 848
			return -EFAULT;

		mutex_lock(&xs->mutex);
849 850 851 852
		if (xs->state != XSK_READY) {
			mutex_unlock(&xs->mutex);
			return -EBUSY;
		}
B
Björn Töpel 已提交
853 854 855 856 857
		if (!xs->umem) {
			mutex_unlock(&xs->mutex);
			return -EINVAL;
		}

858 859
		q = (optname == XDP_UMEM_FILL_RING) ? &xs->fq_tmp :
			&xs->cq_tmp;
860
		err = xsk_init_queue(entries, q, true);
861 862 863
		mutex_unlock(&xs->mutex);
		return err;
	}
864 865 866 867 868 869 870
	default:
		break;
	}

	return -ENOPROTOOPT;
}

871 872 873 874 875 876 877 878 879 880 881 882 883 884
static void xsk_enter_rxtx_offsets(struct xdp_ring_offset_v1 *ring)
{
	ring->producer = offsetof(struct xdp_rxtx_ring, ptrs.producer);
	ring->consumer = offsetof(struct xdp_rxtx_ring, ptrs.consumer);
	ring->desc = offsetof(struct xdp_rxtx_ring, desc);
}

static void xsk_enter_umem_offsets(struct xdp_ring_offset_v1 *ring)
{
	ring->producer = offsetof(struct xdp_umem_ring, ptrs.producer);
	ring->consumer = offsetof(struct xdp_umem_ring, ptrs.consumer);
	ring->desc = offsetof(struct xdp_umem_ring, desc);
}

C
Ciara Loftus 已提交
885 886 887 888 889 890
struct xdp_statistics_v1 {
	__u64 rx_dropped;
	__u64 rx_invalid_descs;
	__u64 tx_invalid_descs;
};

M
Magnus Karlsson 已提交
891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908
static int xsk_getsockopt(struct socket *sock, int level, int optname,
			  char __user *optval, int __user *optlen)
{
	struct sock *sk = sock->sk;
	struct xdp_sock *xs = xdp_sk(sk);
	int len;

	if (level != SOL_XDP)
		return -ENOPROTOOPT;

	if (get_user(len, optlen))
		return -EFAULT;
	if (len < 0)
		return -EINVAL;

	switch (optname) {
	case XDP_STATISTICS:
	{
909
		struct xdp_statistics stats = {};
C
Ciara Loftus 已提交
910 911
		bool extra_stats = true;
		size_t stats_size;
M
Magnus Karlsson 已提交
912

C
Ciara Loftus 已提交
913
		if (len < sizeof(struct xdp_statistics_v1)) {
M
Magnus Karlsson 已提交
914
			return -EINVAL;
C
Ciara Loftus 已提交
915 916 917 918 919 920
		} else if (len < sizeof(stats)) {
			extra_stats = false;
			stats_size = sizeof(struct xdp_statistics_v1);
		} else {
			stats_size = sizeof(stats);
		}
M
Magnus Karlsson 已提交
921 922 923

		mutex_lock(&xs->mutex);
		stats.rx_dropped = xs->rx_dropped;
C
Ciara Loftus 已提交
924 925 926
		if (extra_stats) {
			stats.rx_ring_full = xs->rx_queue_full;
			stats.rx_fill_ring_empty_descs =
927
				xs->pool ? xskq_nb_queue_empty_descs(xs->pool->fq) : 0;
C
Ciara Loftus 已提交
928 929 930 931
			stats.tx_ring_empty_descs = xskq_nb_queue_empty_descs(xs->tx);
		} else {
			stats.rx_dropped += xs->rx_queue_full;
		}
M
Magnus Karlsson 已提交
932 933 934 935
		stats.rx_invalid_descs = xskq_nb_invalid_descs(xs->rx);
		stats.tx_invalid_descs = xskq_nb_invalid_descs(xs->tx);
		mutex_unlock(&xs->mutex);

C
Ciara Loftus 已提交
936
		if (copy_to_user(optval, &stats, stats_size))
M
Magnus Karlsson 已提交
937
			return -EFAULT;
C
Ciara Loftus 已提交
938
		if (put_user(stats_size, optlen))
M
Magnus Karlsson 已提交
939 940 941 942
			return -EFAULT;

		return 0;
	}
943 944 945
	case XDP_MMAP_OFFSETS:
	{
		struct xdp_mmap_offsets off;
946 947 948
		struct xdp_mmap_offsets_v1 off_v1;
		bool flags_supported = true;
		void *to_copy;
949

950
		if (len < sizeof(off_v1))
951
			return -EINVAL;
952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986
		else if (len < sizeof(off))
			flags_supported = false;

		if (flags_supported) {
			/* xdp_ring_offset is identical to xdp_ring_offset_v1
			 * except for the flags field added to the end.
			 */
			xsk_enter_rxtx_offsets((struct xdp_ring_offset_v1 *)
					       &off.rx);
			xsk_enter_rxtx_offsets((struct xdp_ring_offset_v1 *)
					       &off.tx);
			xsk_enter_umem_offsets((struct xdp_ring_offset_v1 *)
					       &off.fr);
			xsk_enter_umem_offsets((struct xdp_ring_offset_v1 *)
					       &off.cr);
			off.rx.flags = offsetof(struct xdp_rxtx_ring,
						ptrs.flags);
			off.tx.flags = offsetof(struct xdp_rxtx_ring,
						ptrs.flags);
			off.fr.flags = offsetof(struct xdp_umem_ring,
						ptrs.flags);
			off.cr.flags = offsetof(struct xdp_umem_ring,
						ptrs.flags);

			len = sizeof(off);
			to_copy = &off;
		} else {
			xsk_enter_rxtx_offsets(&off_v1.rx);
			xsk_enter_rxtx_offsets(&off_v1.tx);
			xsk_enter_umem_offsets(&off_v1.fr);
			xsk_enter_umem_offsets(&off_v1.cr);

			len = sizeof(off_v1);
			to_copy = &off_v1;
		}
987

988
		if (copy_to_user(optval, to_copy, len))
989 990 991 992 993 994
			return -EFAULT;
		if (put_user(len, optlen))
			return -EFAULT;

		return 0;
	}
995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014
	case XDP_OPTIONS:
	{
		struct xdp_options opts = {};

		if (len < sizeof(opts))
			return -EINVAL;

		mutex_lock(&xs->mutex);
		if (xs->zc)
			opts.flags |= XDP_OPTIONS_ZEROCOPY;
		mutex_unlock(&xs->mutex);

		len = sizeof(opts);
		if (copy_to_user(optval, &opts, len))
			return -EFAULT;
		if (put_user(len, optlen))
			return -EFAULT;

		return 0;
	}
M
Magnus Karlsson 已提交
1015 1016 1017 1018 1019 1020 1021
	default:
		break;
	}

	return -EOPNOTSUPP;
}

1022 1023 1024
static int xsk_mmap(struct file *file, struct socket *sock,
		    struct vm_area_struct *vma)
{
1025
	loff_t offset = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
1026 1027 1028 1029 1030 1031
	unsigned long size = vma->vm_end - vma->vm_start;
	struct xdp_sock *xs = xdp_sk(sock->sk);
	struct xsk_queue *q = NULL;
	unsigned long pfn;
	struct page *qpg;

1032
	if (READ_ONCE(xs->state) != XSK_READY)
1033 1034
		return -EBUSY;

1035
	if (offset == XDP_PGOFF_RX_RING) {
1036
		q = READ_ONCE(xs->rx);
1037
	} else if (offset == XDP_PGOFF_TX_RING) {
1038
		q = READ_ONCE(xs->tx);
1039
	} else {
1040 1041
		/* Matches the smp_wmb() in XDP_UMEM_REG */
		smp_rmb();
1042
		if (offset == XDP_UMEM_PGOFF_FILL_RING)
1043
			q = READ_ONCE(xs->fq_tmp);
1044
		else if (offset == XDP_UMEM_PGOFF_COMPLETION_RING)
1045
			q = READ_ONCE(xs->cq_tmp);
1046
	}
1047 1048 1049 1050

	if (!q)
		return -EINVAL;

1051 1052
	/* Matches the smp_wmb() in xsk_init_queue */
	smp_rmb();
1053
	qpg = virt_to_head_page(q->ring);
1054
	if (size > page_size(qpg))
1055 1056 1057 1058 1059 1060 1061
		return -EINVAL;

	pfn = virt_to_phys(q->ring) >> PAGE_SHIFT;
	return remap_pfn_range(vma, vma->vm_start, pfn,
			       size, vma->vm_page_prot);
}

1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082
static int xsk_notifier(struct notifier_block *this,
			unsigned long msg, void *ptr)
{
	struct net_device *dev = netdev_notifier_info_to_dev(ptr);
	struct net *net = dev_net(dev);
	struct sock *sk;

	switch (msg) {
	case NETDEV_UNREGISTER:
		mutex_lock(&net->xdp.lock);
		sk_for_each(sk, &net->xdp.list) {
			struct xdp_sock *xs = xdp_sk(sk);

			mutex_lock(&xs->mutex);
			if (xs->dev == dev) {
				sk->sk_err = ENETDOWN;
				if (!sock_flag(sk, SOCK_DEAD))
					sk->sk_error_report(sk);

				xsk_unbind_dev(xs);

1083 1084
				/* Clear device references. */
				xp_clear_dev(xs->pool);
1085 1086 1087 1088 1089 1090 1091 1092 1093
			}
			mutex_unlock(&xs->mutex);
		}
		mutex_unlock(&net->xdp.lock);
		break;
	}
	return NOTIFY_DONE;
}

1094 1095 1096 1097 1098 1099 1100
static struct proto xsk_proto = {
	.name =		"XDP",
	.owner =	THIS_MODULE,
	.obj_size =	sizeof(struct xdp_sock),
};

static const struct proto_ops xsk_proto_ops = {
B
Björn Töpel 已提交
1101 1102 1103 1104 1105 1106 1107 1108
	.family		= PF_XDP,
	.owner		= THIS_MODULE,
	.release	= xsk_release,
	.bind		= xsk_bind,
	.connect	= sock_no_connect,
	.socketpair	= sock_no_socketpair,
	.accept		= sock_no_accept,
	.getname	= sock_no_getname,
1109
	.poll		= xsk_poll,
B
Björn Töpel 已提交
1110 1111 1112 1113 1114 1115 1116 1117 1118
	.ioctl		= sock_no_ioctl,
	.listen		= sock_no_listen,
	.shutdown	= sock_no_shutdown,
	.setsockopt	= xsk_setsockopt,
	.getsockopt	= xsk_getsockopt,
	.sendmsg	= xsk_sendmsg,
	.recvmsg	= sock_no_recvmsg,
	.mmap		= xsk_mmap,
	.sendpage	= sock_no_sendpage,
1119 1120
};

1121 1122 1123 1124 1125 1126 1127
static void xsk_destruct(struct sock *sk)
{
	struct xdp_sock *xs = xdp_sk(sk);

	if (!sock_flag(sk, SOCK_DEAD))
		return;

1128
	xp_put_pool(xs->pool);
1129 1130 1131 1132

	sk_refcnt_debug_dec(sk);
}

1133 1134 1135 1136
static int xsk_create(struct net *net, struct socket *sock, int protocol,
		      int kern)
{
	struct xdp_sock *xs;
1137
	struct sock *sk;
1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158

	if (!ns_capable(net->user_ns, CAP_NET_RAW))
		return -EPERM;
	if (sock->type != SOCK_RAW)
		return -ESOCKTNOSUPPORT;

	if (protocol)
		return -EPROTONOSUPPORT;

	sock->state = SS_UNCONNECTED;

	sk = sk_alloc(net, PF_XDP, GFP_KERNEL, &xsk_proto, kern);
	if (!sk)
		return -ENOBUFS;

	sock->ops = &xsk_proto_ops;

	sock_init_data(sock, sk);

	sk->sk_family = PF_XDP;

1159 1160 1161
	sk->sk_destruct = xsk_destruct;
	sk_refcnt_debug_inc(sk);

1162 1163
	sock_set_flag(sk, SOCK_RCU_FREE);

1164
	xs = xdp_sk(sk);
1165
	xs->state = XSK_READY;
1166
	mutex_init(&xs->mutex);
1167
	spin_lock_init(&xs->rx_lock);
1168
	spin_lock_init(&xs->tx_completion_lock);
1169

1170 1171 1172
	INIT_LIST_HEAD(&xs->map_list);
	spin_lock_init(&xs->map_list_lock);

1173 1174 1175 1176
	mutex_lock(&net->xdp.lock);
	sk_add_node_rcu(sk, &net->xdp.list);
	mutex_unlock(&net->xdp.lock);

1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189
	local_bh_disable();
	sock_prot_inuse_add(net, &xsk_proto, 1);
	local_bh_enable();

	return 0;
}

static const struct net_proto_family xsk_family_ops = {
	.family = PF_XDP,
	.create = xsk_create,
	.owner	= THIS_MODULE,
};

1190 1191 1192 1193
static struct notifier_block xsk_netdev_notifier = {
	.notifier_call	= xsk_notifier,
};

1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210
static int __net_init xsk_net_init(struct net *net)
{
	mutex_init(&net->xdp.lock);
	INIT_HLIST_HEAD(&net->xdp.list);
	return 0;
}

static void __net_exit xsk_net_exit(struct net *net)
{
	WARN_ON_ONCE(!hlist_empty(&net->xdp.list));
}

static struct pernet_operations xsk_net_ops = {
	.init = xsk_net_init,
	.exit = xsk_net_exit,
};

1211 1212
static int __init xsk_init(void)
{
1213
	int err, cpu;
1214 1215 1216 1217 1218 1219 1220 1221 1222

	err = proto_register(&xsk_proto, 0 /* no slab */);
	if (err)
		goto out;

	err = sock_register(&xsk_family_ops);
	if (err)
		goto out_proto;

1223 1224 1225
	err = register_pernet_subsys(&xsk_net_ops);
	if (err)
		goto out_sk;
1226 1227 1228 1229 1230

	err = register_netdevice_notifier(&xsk_netdev_notifier);
	if (err)
		goto out_pernet;

1231 1232
	for_each_possible_cpu(cpu)
		INIT_LIST_HEAD(&per_cpu(xskmap_flush_list, cpu));
1233 1234
	return 0;

1235 1236
out_pernet:
	unregister_pernet_subsys(&xsk_net_ops);
1237 1238
out_sk:
	sock_unregister(PF_XDP);
1239 1240 1241 1242 1243 1244 1245
out_proto:
	proto_unregister(&xsk_proto);
out:
	return err;
}

fs_initcall(xsk_init);