xsk.c 24.9 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 39
	return READ_ONCE(xs->rx) &&  READ_ONCE(xs->umem) &&
		READ_ONCE(xs->umem->fq);
40 41
}

42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59
void xsk_set_rx_need_wakeup(struct xdp_umem *umem)
{
	if (umem->need_wakeup & XDP_WAKEUP_RX)
		return;

	umem->fq->ring->flags |= XDP_RING_NEED_WAKEUP;
	umem->need_wakeup |= XDP_WAKEUP_RX;
}
EXPORT_SYMBOL(xsk_set_rx_need_wakeup);

void xsk_set_tx_need_wakeup(struct xdp_umem *umem)
{
	struct xdp_sock *xs;

	if (umem->need_wakeup & XDP_WAKEUP_TX)
		return;

	rcu_read_lock();
60
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86
		xs->tx->ring->flags |= XDP_RING_NEED_WAKEUP;
	}
	rcu_read_unlock();

	umem->need_wakeup |= XDP_WAKEUP_TX;
}
EXPORT_SYMBOL(xsk_set_tx_need_wakeup);

void xsk_clear_rx_need_wakeup(struct xdp_umem *umem)
{
	if (!(umem->need_wakeup & XDP_WAKEUP_RX))
		return;

	umem->fq->ring->flags &= ~XDP_RING_NEED_WAKEUP;
	umem->need_wakeup &= ~XDP_WAKEUP_RX;
}
EXPORT_SYMBOL(xsk_clear_rx_need_wakeup);

void xsk_clear_tx_need_wakeup(struct xdp_umem *umem)
{
	struct xdp_sock *xs;

	if (!(umem->need_wakeup & XDP_WAKEUP_TX))
		return;

	rcu_read_lock();
87
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
88 89 90 91 92 93 94 95 96 97 98 99 100 101
		xs->tx->ring->flags &= ~XDP_RING_NEED_WAKEUP;
	}
	rcu_read_unlock();

	umem->need_wakeup &= ~XDP_WAKEUP_TX;
}
EXPORT_SYMBOL(xsk_clear_tx_need_wakeup);

bool xsk_umem_uses_need_wakeup(struct xdp_umem *umem)
{
	return umem->flags & XDP_UMEM_USES_NEED_WAKEUP;
}
EXPORT_SYMBOL(xsk_umem_uses_need_wakeup);

102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
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);
}

117
static int __xsk_rcv_zc(struct xdp_sock *xs, struct xdp_buff *xdp, u32 len)
118
{
119 120 121
	struct xdp_buff_xsk *xskb = container_of(xdp, struct xdp_buff_xsk, xdp);
	u64 addr;
	int err;
122

123 124 125 126 127
	addr = xp_get_handle(xskb);
	err = xskq_prod_reserve_desc(xs->rx, addr, len);
	if (err) {
		xs->rx_dropped++;
		return err;
128 129
	}

130 131
	xp_release(xskb);
	return 0;
132 133
}

134
static void xsk_copy_xdp(struct xdp_buff *to, struct xdp_buff *from, u32 len)
135
{
136
	void *from_buf, *to_buf;
137
	u32 metalen;
138

139 140 141
	if (unlikely(xdp_data_meta_unsupported(from))) {
		from_buf = from->data;
		to_buf = to->data;
142 143
		metalen = 0;
	} else {
144 145 146
		from_buf = from->data_meta;
		metalen = from->data - from->data_meta;
		to_buf = to->data - metalen;
147 148
	}

149
	memcpy(to_buf, from_buf, len + metalen);
150 151
}

152 153
static int __xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp, u32 len,
		     bool explicit_free)
154
{
155 156
	struct xdp_buff *xsk_xdp;
	int err;
157

158 159 160 161 162 163 164
	if (len > xsk_umem_get_rx_frame_size(xs->umem)) {
		xs->rx_dropped++;
		return -ENOSPC;
	}

	xsk_xdp = xsk_buff_alloc(xs->umem);
	if (!xsk_xdp) {
165
		xs->rx_dropped++;
166 167
		return -ENOSPC;
	}
168

169 170 171 172 173 174 175 176 177
	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;
178 179
}

180 181 182 183 184 185 186 187 188 189
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;
}

190 191
static int xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp,
		   bool explicit_free)
192 193 194
{
	u32 len;

195 196 197
	if (!xsk_is_bound(xs))
		return -EINVAL;

198 199 200 201 202
	if (xs->dev != xdp->rxq->dev || xs->queue_id != xdp->rxq->queue_index)
		return -EINVAL;

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

203
	return xdp->rxq->mem.type == MEM_TYPE_XSK_BUFF_POOL ?
204 205
		__xsk_rcv_zc(xs, xdp, len) :
		__xsk_rcv(xs, xdp, len, explicit_free);
206 207
}

208
static void xsk_flush(struct xdp_sock *xs)
209
{
210
	xskq_prod_submit(xs->rx);
211
	__xskq_cons_release(xs->umem->fq);
212
	sock_def_readable(&xs->sk);
213 214 215 216 217 218
}

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

219
	spin_lock_bh(&xs->rx_lock);
220 221
	err = xsk_rcv(xs, xdp, false);
	xsk_flush(xs);
222
	spin_unlock_bh(&xs->rx_lock);
223 224 225
	return err;
}

226
int __xsk_map_redirect(struct xdp_sock *xs, struct xdp_buff *xdp)
227
{
228
	struct list_head *flush_list = this_cpu_ptr(&xskmap_flush_list);
229 230
	int err;

231
	err = xsk_rcv(xs, xdp, true);
232 233 234 235 236 237 238 239 240
	if (err)
		return err;

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

	return 0;
}

241
void __xsk_map_flush(void)
242
{
243
	struct list_head *flush_list = this_cpu_ptr(&xskmap_flush_list);
244 245 246 247 248 249 250 251
	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);
	}
}

252 253
void xsk_umem_complete_tx(struct xdp_umem *umem, u32 nb_entries)
{
254
	xskq_prod_submit_n(umem->cq, nb_entries);
255 256 257 258 259 260 261 262
}
EXPORT_SYMBOL(xsk_umem_complete_tx);

void xsk_umem_consume_tx_done(struct xdp_umem *umem)
{
	struct xdp_sock *xs;

	rcu_read_lock();
263
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
264
		__xskq_cons_release(xs->tx);
265 266 267 268 269 270
		xs->sk.sk_write_space(&xs->sk);
	}
	rcu_read_unlock();
}
EXPORT_SYMBOL(xsk_umem_consume_tx_done);

271
bool xsk_umem_consume_tx(struct xdp_umem *umem, struct xdp_desc *desc)
272 273 274 275
{
	struct xdp_sock *xs;

	rcu_read_lock();
276
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
277
		if (!xskq_cons_peek_desc(xs->tx, desc, umem))
278 279
			continue;

280
		/* This is the backpressure mechanism for the Tx path.
281 282 283 284
		 * 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.
		 */
285
		if (xskq_prod_reserve_addr(umem->cq, desc->addr))
286 287
			goto out;

288
		xskq_cons_release(xs->tx);
289 290 291 292 293 294 295 296 297 298
		rcu_read_unlock();
		return true;
	}

out:
	rcu_read_unlock();
	return false;
}
EXPORT_SYMBOL(xsk_umem_consume_tx);

299
static int xsk_wakeup(struct xdp_sock *xs, u8 flags)
300 301
{
	struct net_device *dev = xs->dev;
302 303 304 305 306
	int err;

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

308 309 310 311 312 313
	return err;
}

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

M
Magnus Karlsson 已提交
316 317
static void xsk_destruct_skb(struct sk_buff *skb)
{
318
	u64 addr = (u64)(long)skb_shinfo(skb)->destructor_arg;
M
Magnus Karlsson 已提交
319
	struct xdp_sock *xs = xdp_sk(skb->sk);
320
	unsigned long flags;
M
Magnus Karlsson 已提交
321

322
	spin_lock_irqsave(&xs->tx_completion_lock, flags);
323
	xskq_prod_submit_addr(xs->umem->cq, addr);
324
	spin_unlock_irqrestore(&xs->tx_completion_lock, flags);
M
Magnus Karlsson 已提交
325 326 327 328

	sock_wfree(skb);
}

329
static int xsk_generic_xmit(struct sock *sk)
M
Magnus Karlsson 已提交
330 331
{
	struct xdp_sock *xs = xdp_sk(sk);
332
	u32 max_batch = TX_BATCH_SIZE;
M
Magnus Karlsson 已提交
333 334 335 336 337 338 339
	bool sent_frame = false;
	struct xdp_desc desc;
	struct sk_buff *skb;
	int err = 0;

	mutex_lock(&xs->mutex);

I
Ilya Maximets 已提交
340 341 342
	if (xs->queue_id >= xs->dev->real_num_tx_queues)
		goto out;

343
	while (xskq_cons_peek_desc(xs->tx, &desc, xs->umem)) {
M
Magnus Karlsson 已提交
344
		char *buffer;
345 346
		u64 addr;
		u32 len;
M
Magnus Karlsson 已提交
347 348 349 350 351 352

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

353
		len = desc.len;
354
		skb = sock_alloc_send_skb(sk, len, 1, &err);
M
Magnus Karlsson 已提交
355 356 357 358 359 360
		if (unlikely(!skb)) {
			err = -EAGAIN;
			goto out;
		}

		skb_put(skb, len);
361
		addr = desc.addr;
362
		buffer = xsk_buff_raw_get_data(xs->umem, addr);
M
Magnus Karlsson 已提交
363
		err = skb_store_bits(skb, 0, buffer, len);
364
		/* This is the backpressure mechanism for the Tx path.
365 366 367 368
		 * 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.
		 */
369
		if (unlikely(err) || xskq_prod_reserve(xs->umem->cq)) {
M
Magnus Karlsson 已提交
370 371 372 373 374 375 376
			kfree_skb(skb);
			goto out;
		}

		skb->dev = xs->dev;
		skb->priority = sk->sk_priority;
		skb->mark = sk->sk_mark;
377
		skb_shinfo(skb)->destructor_arg = (void *)(long)desc.addr;
M
Magnus Karlsson 已提交
378 379 380
		skb->destructor = xsk_destruct_skb;

		err = dev_direct_xmit(skb, xs->queue_id);
381
		xskq_cons_release(xs->tx);
M
Magnus Karlsson 已提交
382 383
		/* Ignore NET_XMIT_CN as packet might have been sent */
		if (err == NET_XMIT_DROP || err == NETDEV_TX_BUSY) {
384 385
			/* SKB completed but not sent */
			err = -EBUSY;
M
Magnus Karlsson 已提交
386 387 388 389 390 391 392 393 394 395 396 397 398 399
			goto out;
		}

		sent_frame = true;
	}

out:
	if (sent_frame)
		sk->sk_write_space(sk);

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

400 401 402 403 404 405 406 407 408 409 410 411
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 已提交
412 413
static int xsk_sendmsg(struct socket *sock, struct msghdr *m, size_t total_len)
{
414
	bool need_wait = !(m->msg_flags & MSG_DONTWAIT);
M
Magnus Karlsson 已提交
415 416 417
	struct sock *sk = sock->sk;
	struct xdp_sock *xs = xdp_sk(sk);

418
	if (unlikely(!xsk_is_bound(xs)))
M
Magnus Karlsson 已提交
419
		return -ENXIO;
420
	if (unlikely(need_wait))
421
		return -EOPNOTSUPP;
M
Magnus Karlsson 已提交
422

423
	return __xsk_sendmsg(sk);
M
Magnus Karlsson 已提交
424 425
}

426
static __poll_t xsk_poll(struct file *file, struct socket *sock,
427
			     struct poll_table_struct *wait)
428
{
429
	__poll_t mask = datagram_poll(file, sock, wait);
430 431
	struct sock *sk = sock->sk;
	struct xdp_sock *xs = xdp_sk(sk);
432 433 434 435 436 437
	struct xdp_umem *umem;

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

	umem = xs->umem;
438

439
	if (umem->need_wakeup) {
440 441
		if (xs->zc)
			xsk_wakeup(xs, umem->need_wakeup);
442 443 444 445
		else
			/* Poll needs to drive Tx also in copy mode */
			__xsk_sendmsg(sk);
	}
446

447
	if (xs->rx && !xskq_prod_is_empty(xs->rx))
448
		mask |= EPOLLIN | EPOLLRDNORM;
449
	if (xs->tx && !xskq_cons_is_full(xs->tx))
450
		mask |= EPOLLOUT | EPOLLWRNORM;
451 452 453 454

	return mask;
}

455 456
static int xsk_init_queue(u32 entries, struct xsk_queue **queue,
			  bool umem_queue)
457 458 459 460 461 462
{
	struct xsk_queue *q;

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

463
	q = xskq_create(entries, umem_queue);
464 465 466
	if (!q)
		return -ENOMEM;

467 468
	/* Make sure queue is ready before it can be seen by others */
	smp_wmb();
469
	WRITE_ONCE(*queue, q);
470 471 472
	return 0;
}

473 474 475 476
static void xsk_unbind_dev(struct xdp_sock *xs)
{
	struct net_device *dev = xs->dev;

477
	if (xs->state != XSK_BOUND)
478
		return;
479
	WRITE_ONCE(xs->state, XSK_UNBOUND);
480 481 482 483 484 485 486 487

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

488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533
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);
	}
}

534 535 536
static int xsk_release(struct socket *sock)
{
	struct sock *sk = sock->sk;
537
	struct xdp_sock *xs = xdp_sk(sk);
538 539 540 541 542 543 544
	struct net *net;

	if (!sk)
		return 0;

	net = sock_net(sk);

545 546 547 548
	mutex_lock(&net->xdp.lock);
	sk_del_node_init_rcu(sk);
	mutex_unlock(&net->xdp.lock);

549 550 551 552
	local_bh_disable();
	sock_prot_inuse_add(net, sk->sk_prot, -1);
	local_bh_enable();

553
	xsk_delete_from_maps(xs);
554
	mutex_lock(&xs->mutex);
555
	xsk_unbind_dev(xs);
556
	mutex_unlock(&xs->mutex);
557

558 559 560
	xskq_destroy(xs->rx);
	xskq_destroy(xs->tx);

561 562 563 564 565 566 567 568 569
	sock_orphan(sk);
	sock->sk = NULL;

	sk_refcnt_debug_release(sk);
	sock_put(sk);

	return 0;
}

570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591
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;
}

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 已提交
592
	struct net_device *dev;
593
	u32 flags, qid;
594 595 596 597 598 599 600
	int err = 0;

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

601
	flags = sxdp->sxdp_flags;
602 603
	if (flags & ~(XDP_SHARED_UMEM | XDP_COPY | XDP_ZEROCOPY |
		      XDP_USE_NEED_WAKEUP))
604 605
		return -EINVAL;

606
	rtnl_lock();
607
	mutex_lock(&xs->mutex);
608
	if (xs->state != XSK_READY) {
B
Björn Töpel 已提交
609 610 611 612
		err = -EBUSY;
		goto out_release;
	}

613 614 615 616 617 618
	dev = dev_get_by_index(sock_net(sk), sxdp->sxdp_ifindex);
	if (!dev) {
		err = -ENODEV;
		goto out_release;
	}

619
	if (!xs->rx && !xs->tx) {
620 621 622 623
		err = -EINVAL;
		goto out_unlock;
	}

624 625 626
	qid = sxdp->sxdp_queue_id;

	if (flags & XDP_SHARED_UMEM) {
627 628 629
		struct xdp_sock *umem_xs;
		struct socket *sock;

630 631
		if ((flags & XDP_COPY) || (flags & XDP_ZEROCOPY) ||
		    (flags & XDP_USE_NEED_WAKEUP)) {
632 633 634 635 636
			/* Cannot specify flags for shared sockets. */
			err = -EINVAL;
			goto out_unlock;
		}

637 638 639 640 641 642 643 644 645 646 647 648 649
		if (xs->umem) {
			/* We have already our own. */
			err = -EINVAL;
			goto out_unlock;
		}

		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);
650
		if (!xsk_is_bound(umem_xs)) {
651 652 653
			err = -EBADF;
			sockfd_put(sock);
			goto out_unlock;
654 655
		}
		if (umem_xs->dev != dev || umem_xs->queue_id != qid) {
656 657 658 659 660 661
			err = -EINVAL;
			sockfd_put(sock);
			goto out_unlock;
		}

		xdp_get_umem(umem_xs->umem);
662
		WRITE_ONCE(xs->umem, umem_xs->umem);
663 664 665 666
		sockfd_put(sock);
	} else if (!xs->umem || !xdp_umem_validate_queues(xs->umem)) {
		err = -EINVAL;
		goto out_unlock;
667 668
	} else {
		/* This xsk has its own umem. */
669 670 671
		err = xdp_umem_assign_dev(xs->umem, dev, qid, flags);
		if (err)
			goto out_unlock;
672 673 674
	}

	xs->dev = dev;
675 676 677
	xs->zc = xs->umem->zc;
	xs->queue_id = qid;
	xdp_add_sk_umem(xs->umem, xs);
678 679

out_unlock:
680
	if (err) {
681
		dev_put(dev);
682 683 684 685 686 687 688
	} else {
		/* Matches smp_rmb() in bind() for shared umem
		 * sockets, and xsk_is_bound().
		 */
		smp_wmb();
		WRITE_ONCE(xs->state, XSK_BOUND);
	}
689 690
out_release:
	mutex_unlock(&xs->mutex);
691
	rtnl_unlock();
692 693 694
	return err;
}

695 696 697 698 699 700 701
struct xdp_umem_reg_v1 {
	__u64 addr; /* Start of packet data area */
	__u64 len; /* Length of packet data area */
	__u32 chunk_size;
	__u32 headroom;
};

702 703 704 705 706 707 708 709 710 711 712
static int xsk_setsockopt(struct socket *sock, int level, int optname,
			  char __user *optval, unsigned int optlen)
{
	struct sock *sk = sock->sk;
	struct xdp_sock *xs = xdp_sk(sk);
	int err;

	if (level != SOL_XDP)
		return -ENOPROTOOPT;

	switch (optname) {
713
	case XDP_RX_RING:
714
	case XDP_TX_RING:
715 716 717 718 719 720 721 722 723 724
	{
		struct xsk_queue **q;
		int entries;

		if (optlen < sizeof(entries))
			return -EINVAL;
		if (copy_from_user(&entries, optval, sizeof(entries)))
			return -EFAULT;

		mutex_lock(&xs->mutex);
725 726 727 728
		if (xs->state != XSK_READY) {
			mutex_unlock(&xs->mutex);
			return -EBUSY;
		}
729
		q = (optname == XDP_TX_RING) ? &xs->tx : &xs->rx;
730
		err = xsk_init_queue(entries, q, false);
731 732 733
		if (!err && optname == XDP_TX_RING)
			/* Tx needs to be explicitly woken up the first time */
			xs->tx->ring->flags |= XDP_RING_NEED_WAKEUP;
734 735 736
		mutex_unlock(&xs->mutex);
		return err;
	}
737 738
	case XDP_UMEM_REG:
	{
739 740
		size_t mr_size = sizeof(struct xdp_umem_reg);
		struct xdp_umem_reg mr = {};
741 742
		struct xdp_umem *umem;

743 744 745 746 747 748
		if (optlen < sizeof(struct xdp_umem_reg_v1))
			return -EINVAL;
		else if (optlen < sizeof(mr))
			mr_size = sizeof(struct xdp_umem_reg_v1);

		if (copy_from_user(&mr, optval, mr_size))
749 750 751
			return -EFAULT;

		mutex_lock(&xs->mutex);
752
		if (xs->state != XSK_READY || xs->umem) {
B
Björn Töpel 已提交
753 754 755
			mutex_unlock(&xs->mutex);
			return -EBUSY;
		}
756

B
Björn Töpel 已提交
757 758
		umem = xdp_umem_create(&mr);
		if (IS_ERR(umem)) {
759
			mutex_unlock(&xs->mutex);
B
Björn Töpel 已提交
760
			return PTR_ERR(umem);
761 762 763 764
		}

		/* Make sure umem is ready before it can be seen by others */
		smp_wmb();
765
		WRITE_ONCE(xs->umem, umem);
766 767 768
		mutex_unlock(&xs->mutex);
		return 0;
	}
769
	case XDP_UMEM_FILL_RING:
770
	case XDP_UMEM_COMPLETION_RING:
771 772 773 774 775 776 777 778
	{
		struct xsk_queue **q;
		int entries;

		if (copy_from_user(&entries, optval, sizeof(entries)))
			return -EFAULT;

		mutex_lock(&xs->mutex);
779 780 781 782
		if (xs->state != XSK_READY) {
			mutex_unlock(&xs->mutex);
			return -EBUSY;
		}
B
Björn Töpel 已提交
783 784 785 786 787
		if (!xs->umem) {
			mutex_unlock(&xs->mutex);
			return -EINVAL;
		}

788 789
		q = (optname == XDP_UMEM_FILL_RING) ? &xs->umem->fq :
			&xs->umem->cq;
790
		err = xsk_init_queue(entries, q, true);
791 792
		if (optname == XDP_UMEM_FILL_RING)
			xp_set_fq(xs->umem->pool, *q);
793 794 795
		mutex_unlock(&xs->mutex);
		return err;
	}
796 797 798 799 800 801 802
	default:
		break;
	}

	return -ENOPROTOOPT;
}

803 804 805 806 807 808 809 810 811 812 813 814 815 816
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);
}

M
Magnus Karlsson 已提交
817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852
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:
	{
		struct xdp_statistics stats;

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

		mutex_lock(&xs->mutex);
		stats.rx_dropped = xs->rx_dropped;
		stats.rx_invalid_descs = xskq_nb_invalid_descs(xs->rx);
		stats.tx_invalid_descs = xskq_nb_invalid_descs(xs->tx);
		mutex_unlock(&xs->mutex);

		if (copy_to_user(optval, &stats, sizeof(stats)))
			return -EFAULT;
		if (put_user(sizeof(stats), optlen))
			return -EFAULT;

		return 0;
	}
853 854 855
	case XDP_MMAP_OFFSETS:
	{
		struct xdp_mmap_offsets off;
856 857 858
		struct xdp_mmap_offsets_v1 off_v1;
		bool flags_supported = true;
		void *to_copy;
859

860
		if (len < sizeof(off_v1))
861
			return -EINVAL;
862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896
		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;
		}
897

898
		if (copy_to_user(optval, to_copy, len))
899 900 901 902 903 904
			return -EFAULT;
		if (put_user(len, optlen))
			return -EFAULT;

		return 0;
	}
905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924
	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 已提交
925 926 927 928 929 930 931
	default:
		break;
	}

	return -EOPNOTSUPP;
}

932 933 934
static int xsk_mmap(struct file *file, struct socket *sock,
		    struct vm_area_struct *vma)
{
935
	loff_t offset = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
936 937 938
	unsigned long size = vma->vm_end - vma->vm_start;
	struct xdp_sock *xs = xdp_sk(sock->sk);
	struct xsk_queue *q = NULL;
939
	struct xdp_umem *umem;
940 941 942
	unsigned long pfn;
	struct page *qpg;

943
	if (READ_ONCE(xs->state) != XSK_READY)
944 945
		return -EBUSY;

946
	if (offset == XDP_PGOFF_RX_RING) {
947
		q = READ_ONCE(xs->rx);
948
	} else if (offset == XDP_PGOFF_TX_RING) {
949
		q = READ_ONCE(xs->tx);
950
	} else {
951 952
		umem = READ_ONCE(xs->umem);
		if (!umem)
953
			return -EINVAL;
954

955 956
		/* Matches the smp_wmb() in XDP_UMEM_REG */
		smp_rmb();
957
		if (offset == XDP_UMEM_PGOFF_FILL_RING)
958
			q = READ_ONCE(umem->fq);
959
		else if (offset == XDP_UMEM_PGOFF_COMPLETION_RING)
960
			q = READ_ONCE(umem->cq);
961
	}
962 963 964 965

	if (!q)
		return -EINVAL;

966 967
	/* Matches the smp_wmb() in xsk_init_queue */
	smp_rmb();
968
	qpg = virt_to_head_page(q->ring);
969
	if (size > page_size(qpg))
970 971 972 973 974 975 976
		return -EINVAL;

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

977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008
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);

				/* Clear device references in umem. */
				xdp_umem_clear_dev(xs->umem);
			}
			mutex_unlock(&xs->mutex);
		}
		mutex_unlock(&net->xdp.lock);
		break;
	}
	return NOTIFY_DONE;
}

1009 1010 1011 1012 1013 1014 1015
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 已提交
1016 1017 1018 1019 1020 1021 1022 1023
	.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,
1024
	.poll		= xsk_poll,
B
Björn Töpel 已提交
1025 1026 1027 1028 1029 1030 1031 1032 1033
	.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,
1034 1035
};

1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047
static void xsk_destruct(struct sock *sk)
{
	struct xdp_sock *xs = xdp_sk(sk);

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

	xdp_put_umem(xs->umem);

	sk_refcnt_debug_dec(sk);
}

1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073
static int xsk_create(struct net *net, struct socket *sock, int protocol,
		      int kern)
{
	struct sock *sk;
	struct xdp_sock *xs;

	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;

1074 1075 1076
	sk->sk_destruct = xsk_destruct;
	sk_refcnt_debug_inc(sk);

1077 1078
	sock_set_flag(sk, SOCK_RCU_FREE);

1079
	xs = xdp_sk(sk);
1080
	xs->state = XSK_READY;
1081
	mutex_init(&xs->mutex);
1082
	spin_lock_init(&xs->rx_lock);
1083
	spin_lock_init(&xs->tx_completion_lock);
1084

1085 1086 1087
	INIT_LIST_HEAD(&xs->map_list);
	spin_lock_init(&xs->map_list_lock);

1088 1089 1090 1091
	mutex_lock(&net->xdp.lock);
	sk_add_node_rcu(sk, &net->xdp.list);
	mutex_unlock(&net->xdp.lock);

1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104
	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,
};

1105 1106 1107 1108
static struct notifier_block xsk_netdev_notifier = {
	.notifier_call	= xsk_notifier,
};

1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125
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,
};

1126 1127
static int __init xsk_init(void)
{
1128
	int err, cpu;
1129 1130 1131 1132 1133 1134 1135 1136 1137

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

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

1138 1139 1140
	err = register_pernet_subsys(&xsk_net_ops);
	if (err)
		goto out_sk;
1141 1142 1143 1144 1145

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

1146 1147
	for_each_possible_cpu(cpu)
		INIT_LIST_HEAD(&per_cpu(xskmap_flush_list, cpu));
1148 1149
	return 0;

1150 1151
out_pernet:
	unregister_pernet_subsys(&xsk_net_ops);
1152 1153
out_sk:
	sock_unregister(PF_XDP);
1154 1155 1156 1157 1158 1159 1160
out_proto:
	proto_unregister(&xsk_proto);
out:
	return err;
}

fs_initcall(xsk_init);