1 // SPDX-License-Identifier: GPL-2.0
4 * AF_XDP sockets allows a channel between XDP programs and userspace
6 * Copyright(c) 2018 Intel Corporation.
12 #define pr_fmt(fmt) "AF_XDP: %s: " fmt, __func__
14 #include <linux/if_xdp.h>
15 #include <linux/init.h>
16 #include <linux/sched/mm.h>
17 #include <linux/sched/signal.h>
18 #include <linux/sched/task.h>
19 #include <linux/socket.h>
20 #include <linux/file.h>
21 #include <linux/uaccess.h>
22 #include <linux/net.h>
23 #include <linux/netdevice.h>
24 #include <linux/rculist.h>
25 #include <net/xdp_sock_drv.h>
28 #include "xsk_queue.h"
32 #define TX_BATCH_SIZE 16
34 static DEFINE_PER_CPU(struct list_head, xskmap_flush_list);
36 bool xsk_is_setup_for_bpf_map(struct xdp_sock *xs)
38 return READ_ONCE(xs->rx) && READ_ONCE(xs->umem) &&
39 READ_ONCE(xs->umem->fq);
42 void xsk_set_rx_need_wakeup(struct xdp_umem *umem)
44 if (umem->need_wakeup & XDP_WAKEUP_RX)
47 umem->fq->ring->flags |= XDP_RING_NEED_WAKEUP;
48 umem->need_wakeup |= XDP_WAKEUP_RX;
50 EXPORT_SYMBOL(xsk_set_rx_need_wakeup);
52 void xsk_set_tx_need_wakeup(struct xdp_umem *umem)
56 if (umem->need_wakeup & XDP_WAKEUP_TX)
60 list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
61 xs->tx->ring->flags |= XDP_RING_NEED_WAKEUP;
65 umem->need_wakeup |= XDP_WAKEUP_TX;
67 EXPORT_SYMBOL(xsk_set_tx_need_wakeup);
69 void xsk_clear_rx_need_wakeup(struct xdp_umem *umem)
71 if (!(umem->need_wakeup & XDP_WAKEUP_RX))
74 umem->fq->ring->flags &= ~XDP_RING_NEED_WAKEUP;
75 umem->need_wakeup &= ~XDP_WAKEUP_RX;
77 EXPORT_SYMBOL(xsk_clear_rx_need_wakeup);
79 void xsk_clear_tx_need_wakeup(struct xdp_umem *umem)
83 if (!(umem->need_wakeup & XDP_WAKEUP_TX))
87 list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
88 xs->tx->ring->flags &= ~XDP_RING_NEED_WAKEUP;
92 umem->need_wakeup &= ~XDP_WAKEUP_TX;
94 EXPORT_SYMBOL(xsk_clear_tx_need_wakeup);
96 bool xsk_umem_uses_need_wakeup(struct xdp_umem *umem)
98 return umem->flags & XDP_UMEM_USES_NEED_WAKEUP;
100 EXPORT_SYMBOL(xsk_umem_uses_need_wakeup);
102 void xp_release(struct xdp_buff_xsk *xskb)
104 xskb->pool->free_heads[xskb->pool->free_heads_cnt++] = xskb;
107 static u64 xp_get_handle(struct xdp_buff_xsk *xskb)
109 u64 offset = xskb->xdp.data - xskb->xdp.data_hard_start;
111 offset += xskb->pool->headroom;
112 if (!xskb->pool->unaligned)
113 return xskb->orig_addr + offset;
114 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)
119 struct xdp_buff_xsk *xskb = container_of(xdp, struct xdp_buff_xsk, xdp);
123 addr = xp_get_handle(xskb);
124 err = xskq_prod_reserve_desc(xs->rx, addr, len);
134 static void xsk_copy_xdp(struct xdp_buff *to, struct xdp_buff *from, u32 len)
136 void *from_buf, *to_buf;
139 if (unlikely(xdp_data_meta_unsupported(from))) {
140 from_buf = from->data;
144 from_buf = from->data_meta;
145 metalen = from->data - from->data_meta;
146 to_buf = to->data - metalen;
149 memcpy(to_buf, from_buf, len + metalen);
152 static int __xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp, u32 len,
155 struct xdp_buff *xsk_xdp;
158 if (len > xsk_umem_get_rx_frame_size(xs->umem)) {
163 xsk_xdp = xsk_buff_alloc(xs->umem);
169 xsk_copy_xdp(xsk_xdp, xdp, len);
170 err = __xsk_rcv_zc(xs, xsk_xdp, len);
172 xsk_buff_free(xsk_xdp);
176 xdp_return_buff(xdp);
180 static bool xsk_is_bound(struct xdp_sock *xs)
182 if (READ_ONCE(xs->state) == XSK_BOUND) {
183 /* Matches smp_wmb() in bind(). */
190 static int xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp,
195 if (!xsk_is_bound(xs))
198 if (xs->dev != xdp->rxq->dev || xs->queue_id != xdp->rxq->queue_index)
201 len = xdp->data_end - xdp->data;
203 return xdp->rxq->mem.type == MEM_TYPE_XSK_BUFF_POOL ?
204 __xsk_rcv_zc(xs, xdp, len) :
205 __xsk_rcv(xs, xdp, len, explicit_free);
208 static void xsk_flush(struct xdp_sock *xs)
210 xskq_prod_submit(xs->rx);
211 __xskq_cons_release(xs->umem->fq);
212 sock_def_readable(&xs->sk);
215 int xsk_generic_rcv(struct xdp_sock *xs, struct xdp_buff *xdp)
219 spin_lock_bh(&xs->rx_lock);
220 err = xsk_rcv(xs, xdp, false);
222 spin_unlock_bh(&xs->rx_lock);
226 int __xsk_map_redirect(struct xdp_sock *xs, struct xdp_buff *xdp)
228 struct list_head *flush_list = this_cpu_ptr(&xskmap_flush_list);
231 err = xsk_rcv(xs, xdp, true);
235 if (!xs->flush_node.prev)
236 list_add(&xs->flush_node, flush_list);
241 void __xsk_map_flush(void)
243 struct list_head *flush_list = this_cpu_ptr(&xskmap_flush_list);
244 struct xdp_sock *xs, *tmp;
246 list_for_each_entry_safe(xs, tmp, flush_list, flush_node) {
248 __list_del_clearprev(&xs->flush_node);
252 void xsk_umem_complete_tx(struct xdp_umem *umem, u32 nb_entries)
254 xskq_prod_submit_n(umem->cq, nb_entries);
256 EXPORT_SYMBOL(xsk_umem_complete_tx);
258 void xsk_umem_consume_tx_done(struct xdp_umem *umem)
263 list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
264 __xskq_cons_release(xs->tx);
265 xs->sk.sk_write_space(&xs->sk);
269 EXPORT_SYMBOL(xsk_umem_consume_tx_done);
271 bool xsk_umem_consume_tx(struct xdp_umem *umem, struct xdp_desc *desc)
276 list_for_each_entry_rcu(xs, &umem->xsk_tx_list, list) {
277 if (!xskq_cons_peek_desc(xs->tx, desc, umem)) {
278 xs->tx->queue_empty_descs++;
282 /* This is the backpressure mechanism for the Tx path.
283 * Reserve space in the completion queue and only proceed
284 * if there is space in it. This avoids having to implement
285 * any buffering in the Tx path.
287 if (xskq_prod_reserve_addr(umem->cq, desc->addr))
290 xskq_cons_release(xs->tx);
299 EXPORT_SYMBOL(xsk_umem_consume_tx);
301 static int xsk_wakeup(struct xdp_sock *xs, u8 flags)
303 struct net_device *dev = xs->dev;
307 err = dev->netdev_ops->ndo_xsk_wakeup(dev, xs->queue_id, flags);
313 static int xsk_zc_xmit(struct xdp_sock *xs)
315 return xsk_wakeup(xs, XDP_WAKEUP_TX);
318 static void xsk_destruct_skb(struct sk_buff *skb)
320 u64 addr = (u64)(long)skb_shinfo(skb)->destructor_arg;
321 struct xdp_sock *xs = xdp_sk(skb->sk);
324 spin_lock_irqsave(&xs->tx_completion_lock, flags);
325 xskq_prod_submit_addr(xs->umem->cq, addr);
326 spin_unlock_irqrestore(&xs->tx_completion_lock, flags);
331 static int xsk_generic_xmit(struct sock *sk)
333 struct xdp_sock *xs = xdp_sk(sk);
334 u32 max_batch = TX_BATCH_SIZE;
335 bool sent_frame = false;
336 struct xdp_desc desc;
340 mutex_lock(&xs->mutex);
342 if (xs->queue_id >= xs->dev->real_num_tx_queues)
345 while (xskq_cons_peek_desc(xs->tx, &desc, xs->umem)) {
350 if (max_batch-- == 0) {
356 skb = sock_alloc_send_skb(sk, len, 1, &err);
362 buffer = xsk_buff_raw_get_data(xs->umem, addr);
363 err = skb_store_bits(skb, 0, buffer, len);
364 /* This is the backpressure mechanism for the Tx path.
365 * Reserve space in the completion queue and only proceed
366 * if there is space in it. This avoids having to implement
367 * any buffering in the Tx path.
369 if (unlikely(err) || xskq_prod_reserve(xs->umem->cq)) {
375 skb->priority = sk->sk_priority;
376 skb->mark = sk->sk_mark;
377 skb_shinfo(skb)->destructor_arg = (void *)(long)desc.addr;
378 skb->destructor = xsk_destruct_skb;
380 /* Hinder dev_direct_xmit from freeing the packet and
381 * therefore completing it in the destructor
383 refcount_inc(&skb->users);
384 err = dev_direct_xmit(skb, xs->queue_id);
385 if (err == NETDEV_TX_BUSY) {
386 /* Tell user-space to retry the send */
387 skb->destructor = sock_wfree;
388 /* Free skb without triggering the perf drop trace */
394 xskq_cons_release(xs->tx);
395 /* Ignore NET_XMIT_CN as packet might have been sent */
396 if (err == NET_XMIT_DROP) {
397 /* SKB completed but not sent */
407 xs->tx->queue_empty_descs++;
411 sk->sk_write_space(sk);
413 mutex_unlock(&xs->mutex);
417 static int __xsk_sendmsg(struct sock *sk)
419 struct xdp_sock *xs = xdp_sk(sk);
421 if (unlikely(!(xs->dev->flags & IFF_UP)))
423 if (unlikely(!xs->tx))
426 return xs->zc ? xsk_zc_xmit(xs) : xsk_generic_xmit(sk);
429 static int xsk_sendmsg(struct socket *sock, struct msghdr *m, size_t total_len)
431 bool need_wait = !(m->msg_flags & MSG_DONTWAIT);
432 struct sock *sk = sock->sk;
433 struct xdp_sock *xs = xdp_sk(sk);
435 if (unlikely(!xsk_is_bound(xs)))
437 if (unlikely(need_wait))
440 return __xsk_sendmsg(sk);
443 static __poll_t xsk_poll(struct file *file, struct socket *sock,
444 struct poll_table_struct *wait)
446 __poll_t mask = datagram_poll(file, sock, wait);
447 struct sock *sk = sock->sk;
448 struct xdp_sock *xs = xdp_sk(sk);
449 struct xdp_umem *umem;
451 if (unlikely(!xsk_is_bound(xs)))
456 if (umem->need_wakeup) {
458 xsk_wakeup(xs, umem->need_wakeup);
460 /* Poll needs to drive Tx also in copy mode */
464 if (xs->rx && !xskq_prod_is_empty(xs->rx))
465 mask |= EPOLLIN | EPOLLRDNORM;
466 if (xs->tx && !xskq_cons_is_full(xs->tx))
467 mask |= EPOLLOUT | EPOLLWRNORM;
472 static int xsk_init_queue(u32 entries, struct xsk_queue **queue,
477 if (entries == 0 || *queue || !is_power_of_2(entries))
480 q = xskq_create(entries, umem_queue);
484 /* Make sure queue is ready before it can be seen by others */
486 WRITE_ONCE(*queue, q);
490 static void xsk_unbind_dev(struct xdp_sock *xs)
492 struct net_device *dev = xs->dev;
494 if (xs->state != XSK_BOUND)
496 WRITE_ONCE(xs->state, XSK_UNBOUND);
498 /* Wait for driver to stop using the xdp socket. */
499 xdp_del_sk_umem(xs->umem, xs);
505 static struct xsk_map *xsk_get_map_list_entry(struct xdp_sock *xs,
506 struct xdp_sock ***map_entry)
508 struct xsk_map *map = NULL;
509 struct xsk_map_node *node;
513 spin_lock_bh(&xs->map_list_lock);
514 node = list_first_entry_or_null(&xs->map_list, struct xsk_map_node,
517 WARN_ON(xsk_map_inc(node->map));
519 *map_entry = node->map_entry;
521 spin_unlock_bh(&xs->map_list_lock);
525 static void xsk_delete_from_maps(struct xdp_sock *xs)
527 /* This function removes the current XDP socket from all the
528 * maps it resides in. We need to take extra care here, due to
529 * the two locks involved. Each map has a lock synchronizing
530 * updates to the entries, and each socket has a lock that
531 * synchronizes access to the list of maps (map_list). For
532 * deadlock avoidance the locks need to be taken in the order
533 * "map lock"->"socket map list lock". We start off by
534 * accessing the socket map list, and take a reference to the
535 * map to guarantee existence between the
536 * xsk_get_map_list_entry() and xsk_map_try_sock_delete()
537 * calls. Then we ask the map to remove the socket, which
538 * tries to remove the socket from the map. Note that there
539 * might be updates to the map between
540 * xsk_get_map_list_entry() and xsk_map_try_sock_delete().
542 struct xdp_sock **map_entry = NULL;
545 while ((map = xsk_get_map_list_entry(xs, &map_entry))) {
546 xsk_map_try_sock_delete(map, xs, map_entry);
551 static int xsk_release(struct socket *sock)
553 struct sock *sk = sock->sk;
554 struct xdp_sock *xs = xdp_sk(sk);
562 mutex_lock(&net->xdp.lock);
563 sk_del_node_init_rcu(sk);
564 mutex_unlock(&net->xdp.lock);
567 sock_prot_inuse_add(net, sk->sk_prot, -1);
570 xsk_delete_from_maps(xs);
571 mutex_lock(&xs->mutex);
573 mutex_unlock(&xs->mutex);
575 xskq_destroy(xs->rx);
576 xskq_destroy(xs->tx);
581 sk_refcnt_debug_release(sk);
587 static struct socket *xsk_lookup_xsk_from_fd(int fd)
592 sock = sockfd_lookup(fd, &err);
594 return ERR_PTR(-ENOTSOCK);
596 if (sock->sk->sk_family != PF_XDP) {
598 return ERR_PTR(-ENOPROTOOPT);
604 static int xsk_bind(struct socket *sock, struct sockaddr *addr, int addr_len)
606 struct sockaddr_xdp *sxdp = (struct sockaddr_xdp *)addr;
607 struct sock *sk = sock->sk;
608 struct xdp_sock *xs = xdp_sk(sk);
609 struct net_device *dev;
613 if (addr_len < sizeof(struct sockaddr_xdp))
615 if (sxdp->sxdp_family != AF_XDP)
618 flags = sxdp->sxdp_flags;
619 if (flags & ~(XDP_SHARED_UMEM | XDP_COPY | XDP_ZEROCOPY |
620 XDP_USE_NEED_WAKEUP))
624 mutex_lock(&xs->mutex);
625 if (xs->state != XSK_READY) {
630 dev = dev_get_by_index(sock_net(sk), sxdp->sxdp_ifindex);
636 if (!xs->rx && !xs->tx) {
641 qid = sxdp->sxdp_queue_id;
643 if (flags & XDP_SHARED_UMEM) {
644 struct xdp_sock *umem_xs;
647 if ((flags & XDP_COPY) || (flags & XDP_ZEROCOPY) ||
648 (flags & XDP_USE_NEED_WAKEUP)) {
649 /* Cannot specify flags for shared sockets. */
655 /* We have already our own. */
660 sock = xsk_lookup_xsk_from_fd(sxdp->sxdp_shared_umem_fd);
666 umem_xs = xdp_sk(sock->sk);
667 if (!xsk_is_bound(umem_xs)) {
672 if (umem_xs->dev != dev || umem_xs->queue_id != qid) {
678 xdp_get_umem(umem_xs->umem);
679 WRITE_ONCE(xs->umem, umem_xs->umem);
681 } else if (!xs->umem || !xdp_umem_validate_queues(xs->umem)) {
685 /* This xsk has its own umem. */
686 err = xdp_umem_assign_dev(xs->umem, dev, qid, flags);
692 xs->zc = xs->umem->zc;
694 xdp_add_sk_umem(xs->umem, xs);
700 /* Matches smp_rmb() in bind() for shared umem
701 * sockets, and xsk_is_bound().
704 WRITE_ONCE(xs->state, XSK_BOUND);
707 mutex_unlock(&xs->mutex);
712 struct xdp_umem_reg_v1 {
713 __u64 addr; /* Start of packet data area */
714 __u64 len; /* Length of packet data area */
719 static int xsk_setsockopt(struct socket *sock, int level, int optname,
720 sockptr_t optval, unsigned int optlen)
722 struct sock *sk = sock->sk;
723 struct xdp_sock *xs = xdp_sk(sk);
726 if (level != SOL_XDP)
733 struct xsk_queue **q;
736 if (optlen < sizeof(entries))
738 if (copy_from_sockptr(&entries, optval, sizeof(entries)))
741 mutex_lock(&xs->mutex);
742 if (xs->state != XSK_READY) {
743 mutex_unlock(&xs->mutex);
746 q = (optname == XDP_TX_RING) ? &xs->tx : &xs->rx;
747 err = xsk_init_queue(entries, q, false);
748 if (!err && optname == XDP_TX_RING)
749 /* Tx needs to be explicitly woken up the first time */
750 xs->tx->ring->flags |= XDP_RING_NEED_WAKEUP;
751 mutex_unlock(&xs->mutex);
756 size_t mr_size = sizeof(struct xdp_umem_reg);
757 struct xdp_umem_reg mr = {};
758 struct xdp_umem *umem;
760 if (optlen < sizeof(struct xdp_umem_reg_v1))
762 else if (optlen < sizeof(mr))
763 mr_size = sizeof(struct xdp_umem_reg_v1);
765 if (copy_from_sockptr(&mr, optval, mr_size))
768 mutex_lock(&xs->mutex);
769 if (xs->state != XSK_READY || xs->umem) {
770 mutex_unlock(&xs->mutex);
774 umem = xdp_umem_create(&mr);
776 mutex_unlock(&xs->mutex);
777 return PTR_ERR(umem);
780 /* Make sure umem is ready before it can be seen by others */
782 WRITE_ONCE(xs->umem, umem);
783 mutex_unlock(&xs->mutex);
786 case XDP_UMEM_FILL_RING:
787 case XDP_UMEM_COMPLETION_RING:
789 struct xsk_queue **q;
792 if (copy_from_sockptr(&entries, optval, sizeof(entries)))
795 mutex_lock(&xs->mutex);
796 if (xs->state != XSK_READY) {
797 mutex_unlock(&xs->mutex);
801 mutex_unlock(&xs->mutex);
805 q = (optname == XDP_UMEM_FILL_RING) ? &xs->umem->fq :
807 err = xsk_init_queue(entries, q, true);
808 if (optname == XDP_UMEM_FILL_RING)
809 xp_set_fq(xs->umem->pool, *q);
810 mutex_unlock(&xs->mutex);
820 static void xsk_enter_rxtx_offsets(struct xdp_ring_offset_v1 *ring)
822 ring->producer = offsetof(struct xdp_rxtx_ring, ptrs.producer);
823 ring->consumer = offsetof(struct xdp_rxtx_ring, ptrs.consumer);
824 ring->desc = offsetof(struct xdp_rxtx_ring, desc);
827 static void xsk_enter_umem_offsets(struct xdp_ring_offset_v1 *ring)
829 ring->producer = offsetof(struct xdp_umem_ring, ptrs.producer);
830 ring->consumer = offsetof(struct xdp_umem_ring, ptrs.consumer);
831 ring->desc = offsetof(struct xdp_umem_ring, desc);
834 struct xdp_statistics_v1 {
836 __u64 rx_invalid_descs;
837 __u64 tx_invalid_descs;
840 static int xsk_getsockopt(struct socket *sock, int level, int optname,
841 char __user *optval, int __user *optlen)
843 struct sock *sk = sock->sk;
844 struct xdp_sock *xs = xdp_sk(sk);
847 if (level != SOL_XDP)
850 if (get_user(len, optlen))
858 struct xdp_statistics stats = {};
859 bool extra_stats = true;
862 if (len < sizeof(struct xdp_statistics_v1)) {
864 } else if (len < sizeof(stats)) {
866 stats_size = sizeof(struct xdp_statistics_v1);
868 stats_size = sizeof(stats);
871 mutex_lock(&xs->mutex);
872 stats.rx_dropped = xs->rx_dropped;
874 stats.rx_ring_full = xs->rx_queue_full;
875 stats.rx_fill_ring_empty_descs =
876 xs->umem ? xskq_nb_queue_empty_descs(xs->umem->fq) : 0;
877 stats.tx_ring_empty_descs = xskq_nb_queue_empty_descs(xs->tx);
879 stats.rx_dropped += xs->rx_queue_full;
881 stats.rx_invalid_descs = xskq_nb_invalid_descs(xs->rx);
882 stats.tx_invalid_descs = xskq_nb_invalid_descs(xs->tx);
883 mutex_unlock(&xs->mutex);
885 if (copy_to_user(optval, &stats, stats_size))
887 if (put_user(stats_size, optlen))
892 case XDP_MMAP_OFFSETS:
894 struct xdp_mmap_offsets off;
895 struct xdp_mmap_offsets_v1 off_v1;
896 bool flags_supported = true;
899 if (len < sizeof(off_v1))
901 else if (len < sizeof(off))
902 flags_supported = false;
904 if (flags_supported) {
905 /* xdp_ring_offset is identical to xdp_ring_offset_v1
906 * except for the flags field added to the end.
908 xsk_enter_rxtx_offsets((struct xdp_ring_offset_v1 *)
910 xsk_enter_rxtx_offsets((struct xdp_ring_offset_v1 *)
912 xsk_enter_umem_offsets((struct xdp_ring_offset_v1 *)
914 xsk_enter_umem_offsets((struct xdp_ring_offset_v1 *)
916 off.rx.flags = offsetof(struct xdp_rxtx_ring,
918 off.tx.flags = offsetof(struct xdp_rxtx_ring,
920 off.fr.flags = offsetof(struct xdp_umem_ring,
922 off.cr.flags = offsetof(struct xdp_umem_ring,
928 xsk_enter_rxtx_offsets(&off_v1.rx);
929 xsk_enter_rxtx_offsets(&off_v1.tx);
930 xsk_enter_umem_offsets(&off_v1.fr);
931 xsk_enter_umem_offsets(&off_v1.cr);
933 len = sizeof(off_v1);
937 if (copy_to_user(optval, to_copy, len))
939 if (put_user(len, optlen))
946 struct xdp_options opts = {};
948 if (len < sizeof(opts))
951 mutex_lock(&xs->mutex);
953 opts.flags |= XDP_OPTIONS_ZEROCOPY;
954 mutex_unlock(&xs->mutex);
957 if (copy_to_user(optval, &opts, len))
959 if (put_user(len, optlen))
971 static int xsk_mmap(struct file *file, struct socket *sock,
972 struct vm_area_struct *vma)
974 loff_t offset = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
975 unsigned long size = vma->vm_end - vma->vm_start;
976 struct xdp_sock *xs = xdp_sk(sock->sk);
977 struct xsk_queue *q = NULL;
978 struct xdp_umem *umem;
982 if (READ_ONCE(xs->state) != XSK_READY)
985 if (offset == XDP_PGOFF_RX_RING) {
986 q = READ_ONCE(xs->rx);
987 } else if (offset == XDP_PGOFF_TX_RING) {
988 q = READ_ONCE(xs->tx);
990 umem = READ_ONCE(xs->umem);
994 /* Matches the smp_wmb() in XDP_UMEM_REG */
996 if (offset == XDP_UMEM_PGOFF_FILL_RING)
997 q = READ_ONCE(umem->fq);
998 else if (offset == XDP_UMEM_PGOFF_COMPLETION_RING)
999 q = READ_ONCE(umem->cq);
1005 /* Matches the smp_wmb() in xsk_init_queue */
1007 qpg = virt_to_head_page(q->ring);
1008 if (size > page_size(qpg))
1011 pfn = virt_to_phys(q->ring) >> PAGE_SHIFT;
1012 return remap_pfn_range(vma, vma->vm_start, pfn,
1013 size, vma->vm_page_prot);
1016 static int xsk_notifier(struct notifier_block *this,
1017 unsigned long msg, void *ptr)
1019 struct net_device *dev = netdev_notifier_info_to_dev(ptr);
1020 struct net *net = dev_net(dev);
1024 case NETDEV_UNREGISTER:
1025 mutex_lock(&net->xdp.lock);
1026 sk_for_each(sk, &net->xdp.list) {
1027 struct xdp_sock *xs = xdp_sk(sk);
1029 mutex_lock(&xs->mutex);
1030 if (xs->dev == dev) {
1031 sk->sk_err = ENETDOWN;
1032 if (!sock_flag(sk, SOCK_DEAD))
1033 sk->sk_error_report(sk);
1037 /* Clear device references in umem. */
1038 xdp_umem_clear_dev(xs->umem);
1040 mutex_unlock(&xs->mutex);
1042 mutex_unlock(&net->xdp.lock);
1048 static struct proto xsk_proto = {
1050 .owner = THIS_MODULE,
1051 .obj_size = sizeof(struct xdp_sock),
1054 static const struct proto_ops xsk_proto_ops = {
1056 .owner = THIS_MODULE,
1057 .release = xsk_release,
1059 .connect = sock_no_connect,
1060 .socketpair = sock_no_socketpair,
1061 .accept = sock_no_accept,
1062 .getname = sock_no_getname,
1064 .ioctl = sock_no_ioctl,
1065 .listen = sock_no_listen,
1066 .shutdown = sock_no_shutdown,
1067 .setsockopt = xsk_setsockopt,
1068 .getsockopt = xsk_getsockopt,
1069 .sendmsg = xsk_sendmsg,
1070 .recvmsg = sock_no_recvmsg,
1072 .sendpage = sock_no_sendpage,
1075 static void xsk_destruct(struct sock *sk)
1077 struct xdp_sock *xs = xdp_sk(sk);
1079 if (!sock_flag(sk, SOCK_DEAD))
1082 xdp_put_umem(xs->umem);
1084 sk_refcnt_debug_dec(sk);
1087 static int xsk_create(struct net *net, struct socket *sock, int protocol,
1091 struct xdp_sock *xs;
1093 if (!ns_capable(net->user_ns, CAP_NET_RAW))
1095 if (sock->type != SOCK_RAW)
1096 return -ESOCKTNOSUPPORT;
1099 return -EPROTONOSUPPORT;
1101 sock->state = SS_UNCONNECTED;
1103 sk = sk_alloc(net, PF_XDP, GFP_KERNEL, &xsk_proto, kern);
1107 sock->ops = &xsk_proto_ops;
1109 sock_init_data(sock, sk);
1111 sk->sk_family = PF_XDP;
1113 sk->sk_destruct = xsk_destruct;
1114 sk_refcnt_debug_inc(sk);
1116 sock_set_flag(sk, SOCK_RCU_FREE);
1119 xs->state = XSK_READY;
1120 mutex_init(&xs->mutex);
1121 spin_lock_init(&xs->rx_lock);
1122 spin_lock_init(&xs->tx_completion_lock);
1124 INIT_LIST_HEAD(&xs->map_list);
1125 spin_lock_init(&xs->map_list_lock);
1127 mutex_lock(&net->xdp.lock);
1128 sk_add_node_rcu(sk, &net->xdp.list);
1129 mutex_unlock(&net->xdp.lock);
1132 sock_prot_inuse_add(net, &xsk_proto, 1);
1138 static const struct net_proto_family xsk_family_ops = {
1140 .create = xsk_create,
1141 .owner = THIS_MODULE,
1144 static struct notifier_block xsk_netdev_notifier = {
1145 .notifier_call = xsk_notifier,
1148 static int __net_init xsk_net_init(struct net *net)
1150 mutex_init(&net->xdp.lock);
1151 INIT_HLIST_HEAD(&net->xdp.list);
1155 static void __net_exit xsk_net_exit(struct net *net)
1157 WARN_ON_ONCE(!hlist_empty(&net->xdp.list));
1160 static struct pernet_operations xsk_net_ops = {
1161 .init = xsk_net_init,
1162 .exit = xsk_net_exit,
1165 static int __init xsk_init(void)
1169 err = proto_register(&xsk_proto, 0 /* no slab */);
1173 err = sock_register(&xsk_family_ops);
1177 err = register_pernet_subsys(&xsk_net_ops);
1181 err = register_netdevice_notifier(&xsk_netdev_notifier);
1185 for_each_possible_cpu(cpu)
1186 INIT_LIST_HEAD(&per_cpu(xskmap_flush_list, cpu));
1190 unregister_pernet_subsys(&xsk_net_ops);
1192 sock_unregister(PF_XDP);
1194 proto_unregister(&xsk_proto);
1199 fs_initcall(xsk_init);