xsk.c 27.1 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.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
bool xsk_umem_has_addrs(struct xdp_umem *umem, u32 cnt)
{
44
	return xskq_cons_has_entries(umem->fq, cnt);
45 46 47
}
EXPORT_SYMBOL(xsk_umem_has_addrs);

48
bool xsk_umem_peek_addr(struct xdp_umem *umem, u64 *addr)
49
{
50
	return xskq_cons_peek_addr(umem->fq, addr, umem);
51 52 53
}
EXPORT_SYMBOL(xsk_umem_peek_addr);

54
void xsk_umem_release_addr(struct xdp_umem *umem)
55
{
56
	xskq_cons_release(umem->fq);
57
}
58
EXPORT_SYMBOL(xsk_umem_release_addr);
59

60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77
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();
78
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104
		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();
105
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
106 107 108 109 110 111 112 113 114 115 116 117 118 119
		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);

120 121 122 123 124 125 126 127 128
/* If a buffer crosses a page boundary, we need to do 2 memcpy's, one for
 * each page. This is only required in copy mode.
 */
static void __xsk_rcv_memcpy(struct xdp_umem *umem, u64 addr, void *from_buf,
			     u32 len, u32 metalen)
{
	void *to_buf = xdp_umem_get_data(umem, addr);

	addr = xsk_umem_add_offset_to_addr(addr);
129
	if (xskq_cons_crosses_non_contig_pg(umem, addr, len + metalen)) {
130 131 132 133
		void *next_pg_addr = umem->pages[(addr >> PAGE_SHIFT) + 1].addr;
		u64 page_start = addr & ~(PAGE_SIZE - 1);
		u64 first_len = PAGE_SIZE - (addr - page_start);

134 135 136
		memcpy(to_buf, from_buf, first_len);
		memcpy(next_pg_addr, from_buf + first_len,
		       len + metalen - first_len);
137 138 139 140 141 142 143

		return;
	}

	memcpy(to_buf, from_buf, len + metalen);
}

144
static int __xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp, u32 len)
145
{
146 147 148
	u64 offset = xs->umem->headroom;
	u64 addr, memcpy_addr;
	void *from_buf;
149
	u32 metalen;
150
	int err;
151

152
	if (!xskq_cons_peek_addr(xs->umem->fq, &addr, xs->umem) ||
153
	    len > xs->umem->chunk_size_nohr - XDP_PACKET_HEADROOM) {
154
		xs->rx_dropped++;
155
		return -ENOSPC;
156
	}
157

158 159 160 161 162 163 164 165
	if (unlikely(xdp_data_meta_unsupported(xdp))) {
		from_buf = xdp->data;
		metalen = 0;
	} else {
		from_buf = xdp->data_meta;
		metalen = xdp->data - xdp->data_meta;
	}

166 167 168 169 170
	memcpy_addr = xsk_umem_adjust_offset(xs->umem, addr, offset);
	__xsk_rcv_memcpy(xs->umem, memcpy_addr, from_buf, len, metalen);

	offset += metalen;
	addr = xsk_umem_adjust_offset(xs->umem, addr, offset);
171
	err = xskq_prod_reserve_desc(xs->rx, addr, len);
172
	if (!err) {
173
		xskq_cons_release(xs->umem->fq);
174 175 176
		xdp_return_buff(xdp);
		return 0;
	}
177

178
	xs->rx_dropped++;
179 180 181
	return err;
}

182
static int __xsk_rcv_zc(struct xdp_sock *xs, struct xdp_buff *xdp, u32 len)
183
{
184
	int err = xskq_prod_reserve_desc(xs->rx, xdp->handle, len);
185

186
	if (err)
187
		xs->rx_dropped++;
188 189 190 191

	return err;
}

192 193 194 195 196 197 198 199 200 201
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;
}

202
static int xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp)
203 204 205
{
	u32 len;

206 207 208
	if (!xsk_is_bound(xs))
		return -EINVAL;

209 210 211 212 213 214 215 216 217
	if (xs->dev != xdp->rxq->dev || xs->queue_id != xdp->rxq->queue_index)
		return -EINVAL;

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

	return (xdp->rxq->mem.type == MEM_TYPE_ZERO_COPY) ?
		__xsk_rcv_zc(xs, xdp, len) : __xsk_rcv(xs, xdp, len);
}

218
static void xsk_flush(struct xdp_sock *xs)
219
{
220
	xskq_prod_submit(xs->rx);
221
	__xskq_cons_release(xs->umem->fq);
222
	sock_def_readable(&xs->sk);
223 224 225 226
}

int xsk_generic_rcv(struct xdp_sock *xs, struct xdp_buff *xdp)
{
227
	u32 metalen = xdp->data - xdp->data_meta;
228
	u32 len = xdp->data_end - xdp->data;
229
	u64 offset = xs->umem->headroom;
230 231
	void *buffer;
	u64 addr;
232 233
	int err;

234 235 236 237 238 239
	spin_lock_bh(&xs->rx_lock);

	if (xs->dev != xdp->rxq->dev || xs->queue_id != xdp->rxq->queue_index) {
		err = -EINVAL;
		goto out_unlock;
	}
240

241
	if (!xskq_cons_peek_addr(xs->umem->fq, &addr, xs->umem) ||
242
	    len > xs->umem->chunk_size_nohr - XDP_PACKET_HEADROOM) {
243 244
		err = -ENOSPC;
		goto out_drop;
245 246
	}

247
	addr = xsk_umem_adjust_offset(xs->umem, addr, offset);
248
	buffer = xdp_umem_get_data(xs->umem, addr);
249
	memcpy(buffer, xdp->data_meta, len + metalen);
250 251

	addr = xsk_umem_adjust_offset(xs->umem, addr, metalen);
252
	err = xskq_prod_reserve_desc(xs->rx, addr, len);
253 254 255
	if (err)
		goto out_drop;

256
	xskq_cons_release(xs->umem->fq);
257
	xskq_prod_submit(xs->rx);
258

259 260 261 262 263 264
	spin_unlock_bh(&xs->rx_lock);

	xs->sk.sk_data_ready(&xs->sk);
	return 0;

out_drop:
265
	xs->rx_dropped++;
266 267
out_unlock:
	spin_unlock_bh(&xs->rx_lock);
268 269 270
	return err;
}

271
int __xsk_map_redirect(struct xdp_sock *xs, struct xdp_buff *xdp)
272
{
273
	struct list_head *flush_list = this_cpu_ptr(&xskmap_flush_list);
274 275 276 277 278 279 280 281 282 283 284 285
	int err;

	err = xsk_rcv(xs, xdp);
	if (err)
		return err;

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

	return 0;
}

286
void __xsk_map_flush(void)
287
{
288
	struct list_head *flush_list = this_cpu_ptr(&xskmap_flush_list);
289 290 291 292 293 294 295 296
	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);
	}
}

297 298
void xsk_umem_complete_tx(struct xdp_umem *umem, u32 nb_entries)
{
299
	xskq_prod_submit_n(umem->cq, nb_entries);
300 301 302 303 304 305 306 307
}
EXPORT_SYMBOL(xsk_umem_complete_tx);

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

	rcu_read_lock();
308
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
309
		__xskq_cons_release(xs->tx);
310 311 312 313 314 315
		xs->sk.sk_write_space(&xs->sk);
	}
	rcu_read_unlock();
}
EXPORT_SYMBOL(xsk_umem_consume_tx_done);

316
bool xsk_umem_consume_tx(struct xdp_umem *umem, struct xdp_desc *desc)
317 318 319 320
{
	struct xdp_sock *xs;

	rcu_read_lock();
321
	list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
322
		if (!xskq_cons_peek_desc(xs->tx, desc, umem))
323 324
			continue;

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(umem->cq, desc->addr))
331 332
			goto out;

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

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

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->umem->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->umem)) {
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);
M
Magnus Karlsson 已提交
400 401 402 403 404 405
		if (unlikely(!skb)) {
			err = -EAGAIN;
			goto out;
		}

		skb_put(skb, len);
406 407
		addr = desc.addr;
		buffer = xdp_umem_get_data(xs->umem, addr);
M
Magnus Karlsson 已提交
408
		err = skb_store_bits(skb, 0, buffer, len);
409
		/* This is the backpressure mechanism for the Tx path.
410 411 412 413
		 * 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.
		 */
414
		if (unlikely(err) || xskq_prod_reserve(xs->umem->cq)) {
M
Magnus Karlsson 已提交
415 416 417 418 419 420 421
			kfree_skb(skb);
			goto out;
		}

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

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

		sent_frame = true;
	}

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 478 479 480 481 482
	struct xdp_umem *umem;

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

	umem = xs->umem;
483

484
	if (umem->need_wakeup) {
485 486
		if (xs->zc)
			xsk_wakeup(xs, umem->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 605
	xskq_destroy(xs->rx);
	xskq_destroy(xs->tx);

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

	sk_refcnt_debug_release(sk);
	sock_put(sk);

	return 0;
}

615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631
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;
}

632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649
/* Check if umem pages are contiguous.
 * If zero-copy mode, use the DMA address to do the page contiguity check
 * For all other modes we use addr (kernel virtual address)
 * Store the result in the low bits of addr.
 */
static void xsk_check_page_contiguity(struct xdp_umem *umem, u32 flags)
{
	struct xdp_umem_page *pgs = umem->pages;
	int i, is_contig;

	for (i = 0; i < umem->npgs - 1; i++) {
		is_contig = (flags & XDP_ZEROCOPY) ?
			(pgs[i].dma + PAGE_SIZE == pgs[i + 1].dma) :
			(pgs[i].addr + PAGE_SIZE == pgs[i + 1].addr);
		pgs[i].addr += is_contig << XSK_NEXT_PG_CONTIG_SHIFT;
	}
}

650 651 652 653 654
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 已提交
655
	struct net_device *dev;
656
	u32 flags, qid;
657 658 659 660 661 662 663
	int err = 0;

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

664
	flags = sxdp->sxdp_flags;
665 666
	if (flags & ~(XDP_SHARED_UMEM | XDP_COPY | XDP_ZEROCOPY |
		      XDP_USE_NEED_WAKEUP))
667 668
		return -EINVAL;

669
	rtnl_lock();
670
	mutex_lock(&xs->mutex);
671
	if (xs->state != XSK_READY) {
B
Björn Töpel 已提交
672 673 674 675
		err = -EBUSY;
		goto out_release;
	}

676 677 678 679 680 681
	dev = dev_get_by_index(sock_net(sk), sxdp->sxdp_ifindex);
	if (!dev) {
		err = -ENODEV;
		goto out_release;
	}

682
	if (!xs->rx && !xs->tx) {
683 684 685 686
		err = -EINVAL;
		goto out_unlock;
	}

687 688 689
	qid = sxdp->sxdp_queue_id;

	if (flags & XDP_SHARED_UMEM) {
690 691 692
		struct xdp_sock *umem_xs;
		struct socket *sock;

693 694
		if ((flags & XDP_COPY) || (flags & XDP_ZEROCOPY) ||
		    (flags & XDP_USE_NEED_WAKEUP)) {
695 696 697 698 699
			/* Cannot specify flags for shared sockets. */
			err = -EINVAL;
			goto out_unlock;
		}

700 701 702 703 704 705 706 707 708 709 710 711 712
		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);
713
		if (!xsk_is_bound(umem_xs)) {
714 715 716
			err = -EBADF;
			sockfd_put(sock);
			goto out_unlock;
717 718
		}
		if (umem_xs->dev != dev || umem_xs->queue_id != qid) {
719 720 721 722 723 724
			err = -EINVAL;
			sockfd_put(sock);
			goto out_unlock;
		}

		xdp_get_umem(umem_xs->umem);
725
		WRITE_ONCE(xs->umem, umem_xs->umem);
726 727 728 729
		sockfd_put(sock);
	} else if (!xs->umem || !xdp_umem_validate_queues(xs->umem)) {
		err = -EINVAL;
		goto out_unlock;
730 731
	} else {
		/* This xsk has its own umem. */
732 733 734 735
		xskq_set_umem(xs->umem->fq, xs->umem->size,
			      xs->umem->chunk_mask);
		xskq_set_umem(xs->umem->cq, xs->umem->size,
			      xs->umem->chunk_mask);
736 737 738 739

		err = xdp_umem_assign_dev(xs->umem, dev, qid, flags);
		if (err)
			goto out_unlock;
740 741

		xsk_check_page_contiguity(xs->umem, flags);
742 743 744
	}

	xs->dev = dev;
745 746
	xs->zc = xs->umem->zc;
	xs->queue_id = qid;
747 748
	xskq_set_umem(xs->rx, xs->umem->size, xs->umem->chunk_mask);
	xskq_set_umem(xs->tx, xs->umem->size, xs->umem->chunk_mask);
749
	xdp_add_sk_umem(xs->umem, xs);
750 751

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

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

774 775 776 777 778 779 780 781 782 783 784
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) {
785
	case XDP_RX_RING:
786
	case XDP_TX_RING:
787 788 789 790 791 792 793 794 795 796
	{
		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);
797 798 799 800
		if (xs->state != XSK_READY) {
			mutex_unlock(&xs->mutex);
			return -EBUSY;
		}
801
		q = (optname == XDP_TX_RING) ? &xs->tx : &xs->rx;
802
		err = xsk_init_queue(entries, q, false);
803 804 805
		if (!err && optname == XDP_TX_RING)
			/* Tx needs to be explicitly woken up the first time */
			xs->tx->ring->flags |= XDP_RING_NEED_WAKEUP;
806 807 808
		mutex_unlock(&xs->mutex);
		return err;
	}
809 810
	case XDP_UMEM_REG:
	{
811 812
		size_t mr_size = sizeof(struct xdp_umem_reg);
		struct xdp_umem_reg mr = {};
813 814
		struct xdp_umem *umem;

815 816 817 818 819 820
		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))
821 822 823
			return -EFAULT;

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

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

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

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

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

860 861
		q = (optname == XDP_UMEM_FILL_RING) ? &xs->umem->fq :
			&xs->umem->cq;
862
		err = xsk_init_queue(entries, q, true);
863 864 865
		mutex_unlock(&xs->mutex);
		return err;
	}
866 867 868 869 870 871 872
	default:
		break;
	}

	return -ENOPROTOOPT;
}

873 874 875 876 877 878 879 880 881 882 883 884 885 886
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 已提交
887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922
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;
	}
923 924 925
	case XDP_MMAP_OFFSETS:
	{
		struct xdp_mmap_offsets off;
926 927 928
		struct xdp_mmap_offsets_v1 off_v1;
		bool flags_supported = true;
		void *to_copy;
929

930
		if (len < sizeof(off_v1))
931
			return -EINVAL;
932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966
		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;
		}
967

968
		if (copy_to_user(optval, to_copy, len))
969 970 971 972 973 974
			return -EFAULT;
		if (put_user(len, optlen))
			return -EFAULT;

		return 0;
	}
975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994
	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 已提交
995 996 997 998 999 1000 1001
	default:
		break;
	}

	return -EOPNOTSUPP;
}

1002 1003 1004
static int xsk_mmap(struct file *file, struct socket *sock,
		    struct vm_area_struct *vma)
{
1005
	loff_t offset = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
1006 1007 1008
	unsigned long size = vma->vm_end - vma->vm_start;
	struct xdp_sock *xs = xdp_sk(sock->sk);
	struct xsk_queue *q = NULL;
1009
	struct xdp_umem *umem;
1010 1011 1012
	unsigned long pfn;
	struct page *qpg;

1013
	if (READ_ONCE(xs->state) != XSK_READY)
1014 1015
		return -EBUSY;

1016
	if (offset == XDP_PGOFF_RX_RING) {
1017
		q = READ_ONCE(xs->rx);
1018
	} else if (offset == XDP_PGOFF_TX_RING) {
1019
		q = READ_ONCE(xs->tx);
1020
	} else {
1021 1022
		umem = READ_ONCE(xs->umem);
		if (!umem)
1023
			return -EINVAL;
1024

1025 1026
		/* Matches the smp_wmb() in XDP_UMEM_REG */
		smp_rmb();
1027
		if (offset == XDP_UMEM_PGOFF_FILL_RING)
1028
			q = READ_ONCE(umem->fq);
1029
		else if (offset == XDP_UMEM_PGOFF_COMPLETION_RING)
1030
			q = READ_ONCE(umem->cq);
1031
	}
1032 1033 1034 1035

	if (!q)
		return -EINVAL;

1036 1037
	/* Matches the smp_wmb() in xsk_init_queue */
	smp_rmb();
1038
	qpg = virt_to_head_page(q->ring);
1039
	if (size > page_size(qpg))
1040 1041 1042 1043 1044 1045 1046
		return -EINVAL;

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

1047 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 1074 1075 1076 1077 1078
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;
}

1079 1080 1081 1082 1083 1084 1085
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 已提交
1086 1087 1088 1089 1090 1091 1092 1093
	.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,
1094
	.poll		= xsk_poll,
B
Björn Töpel 已提交
1095 1096 1097 1098 1099 1100 1101 1102 1103
	.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,
1104 1105
};

1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117
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);
}

1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143
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;

1144 1145 1146
	sk->sk_destruct = xsk_destruct;
	sk_refcnt_debug_inc(sk);

1147 1148
	sock_set_flag(sk, SOCK_RCU_FREE);

1149
	xs = xdp_sk(sk);
1150
	xs->state = XSK_READY;
1151
	mutex_init(&xs->mutex);
1152
	spin_lock_init(&xs->rx_lock);
1153
	spin_lock_init(&xs->tx_completion_lock);
1154

1155 1156 1157
	INIT_LIST_HEAD(&xs->map_list);
	spin_lock_init(&xs->map_list_lock);

1158 1159 1160 1161
	mutex_lock(&net->xdp.lock);
	sk_add_node_rcu(sk, &net->xdp.list);
	mutex_unlock(&net->xdp.lock);

1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174
	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,
};

1175 1176 1177 1178
static struct notifier_block xsk_netdev_notifier = {
	.notifier_call	= xsk_notifier,
};

1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195
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,
};

1196 1197
static int __init xsk_init(void)
{
1198
	int err, cpu;
1199 1200 1201 1202 1203 1204 1205 1206 1207

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

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

1208 1209 1210
	err = register_pernet_subsys(&xsk_net_ops);
	if (err)
		goto out_sk;
1211 1212 1213 1214 1215

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

1216 1217
	for_each_possible_cpu(cpu)
		INIT_LIST_HEAD(&per_cpu(xskmap_flush_list, cpu));
1218 1219
	return 0;

1220 1221
out_pernet:
	unregister_pernet_subsys(&xsk_net_ops);
1222 1223
out_sk:
	sock_unregister(PF_XDP);
1224 1225 1226 1227 1228 1229 1230
out_proto:
	proto_unregister(&xsk_proto);
out:
	return err;
}

fs_initcall(xsk_init);