In this commit the base structure of the AF_XDP address family is set up. Further, we introduce the abilty register a window of user memory to the kernel via the XDP_UMEM_REG setsockopt syscall. The memory window is viewed by an AF_XDP socket as a set of equally large frames. After a user memory registration all frames are "owned" by the user application, and not the kernel. v2: More robust checks on umem creation and unaccount on error. Call set_page_dirty_lock on cleanup. Simplified xdp_umem_reg.
Unified · Split
| @@ -0,0 +1,31 @@ | ||
| 1 | +/* SPDX-License-Identifier: GPL-2.0 | |
| 2 | + * AF_XDP internal functions | |
| 3 | + * Copyright(c) 2018 Intel Corporation. | |
| 4 | + * | |
| 5 | + * This program is free software; you can redistribute it and/or modify it | |
| 6 | + * under the terms and conditions of the GNU General Public License, | |
| 7 | + * version 2, as published by the Free Software Foundation. | |
| 8 | + * | |
| 9 | + * This program is distributed in the hope it will be useful, but WITHOUT | |
| 10 | + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 | + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
| 12 | + * more details. | |
| 13 | + */ | |
| 14 | + | |
| 15 | +#ifndef _LINUX_XDP_SOCK_H | |
| 16 | +#define _LINUX_XDP_SOCK_H | |
| 17 | + | |
| 18 | +#include <linux/mutex.h> | |
| 19 | +#include <net/sock.h> | |
| 20 | + | |
| 21 | +struct xdp_umem; | |
| 22 | + | |
| 23 | +struct xdp_sock { | |
| 24 | + /* struct sock must be the first member of struct xdp_sock */ | |
| 25 | + struct sock sk; | |
| 26 | + struct xdp_umem *umem; | |
| 27 | + /* Protects multiple processes in the control path */ | |
| 28 | + struct mutex mutex; | |
| 29 | +}; | |
| 30 | + | |
| 31 | +#endif /* _LINUX_XDP_SOCK_H */ | |
| @@ -0,0 +1,34 @@ | ||
| 1 | +/* SPDX-License-Identifier: GPL-2.0 WITH Linux-syscall-note | |
| 2 | + * | |
| 3 | + * if_xdp: XDP socket user-space interface | |
| 4 | + * Copyright(c) 2018 Intel Corporation. | |
| 5 | + * | |
| 6 | + * This program is free software; you can redistribute it and/or modify it | |
| 7 | + * under the terms and conditions of the GNU General Public License, | |
| 8 | + * version 2, as published by the Free Software Foundation. | |
| 9 | + * | |
| 10 | + * This program is distributed in the hope it will be useful, but WITHOUT | |
| 11 | + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 12 | + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
| 13 | + * more details. | |
| 14 | + * | |
| 15 | + * Author(s): Björn Töpel <bjorn.topel@intel.com> | |
| 16 | + * Magnus Karlsson <magnus.karlsson@intel.com> | |
| 17 | + */ | |
| 18 | + | |
| 19 | +#ifndef _LINUX_IF_XDP_H | |
| 20 | +#define _LINUX_IF_XDP_H | |
| 21 | + | |
| 22 | +#include <linux/types.h> | |
| 23 | + | |
| 24 | +/* XDP socket options */ | |
| 25 | +#define XDP_UMEM_REG 3 | |
| 26 | + | |
| 27 | +struct xdp_umem_reg { | |
| 28 | + __u64 addr; /* Start of packet data area */ | |
| 29 | + __u64 len; /* Length of packet data area */ | |
| 30 | + __u32 frame_size; /* Frame size */ | |
| 31 | + __u32 frame_headroom; /* Frame head room */ | |
| 32 | +}; | |
| 33 | + | |
| 34 | +#endif /* _LINUX_IF_XDP_H */ | |
| @@ -85,3 +85,4 @@ obj-y += l3mdev/ · 84 unmodified lines | ||
| 85 | 85 | endif |
| 86 | 86 | obj-$(CONFIG_QRTR) += qrtr/ |
| 87 | 87 | obj-$(CONFIG_NET_NCSI) += ncsi/ |
| 88 | +obj-$(CONFIG_XDP_SOCKETS) += xdp/ | |
| @@ -0,0 +1,2 @@ | ||
| 1 | +obj-$(CONFIG_XDP_SOCKETS) += xsk.o xdp_umem.o | |
| 2 | + | |
| @@ -0,0 +1,245 @@ | ||
| 1 | +// SPDX-License-Identifier: GPL-2.0 | |
| 2 | +/* XDP user-space packet buffer | |
| 3 | + * Copyright(c) 2018 Intel Corporation. | |
| 4 | + * | |
| 5 | + * This program is free software; you can redistribute it and/or modify it | |
| 6 | + * under the terms and conditions of the GNU General Public License, | |
| 7 | + * version 2, as published by the Free Software Foundation. | |
| 8 | + * | |
| 9 | + * This program is distributed in the hope it will be useful, but WITHOUT | |
| 10 | + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 | + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
| 12 | + * more details. | |
| 13 | + */ | |
| 14 | + | |
| 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/uaccess.h> | |
| 20 | +#include <linux/slab.h> | |
| 21 | +#include <linux/bpf.h> | |
| 22 | +#include <linux/mm.h> | |
| 23 | + | |
| 24 | +#include "xdp_umem.h" | |
| 25 | + | |
| 26 | +#define XDP_UMEM_MIN_FRAME_SIZE 2048 | |
| 27 | + | |
| 28 | +int xdp_umem_create(struct xdp_umem **umem) | |
| 29 | +{ | |
| 30 | + *umem = kzalloc(sizeof(**umem), GFP_KERNEL); | |
| 31 | + | |
| 32 | + if (!(*umem)) | |
| 33 | + return -ENOMEM; | |
| 34 | + | |
| 35 | + return 0; | |
| 36 | +} | |
| 37 | + | |
| 38 | +static void xdp_umem_unpin_pages(struct xdp_umem *umem) | |
| 39 | +{ | |
| 40 | + unsigned int i; | |
| 41 | + | |
| 42 | + if (umem->pgs) { | |
| 43 | + for (i = 0; i < umem->npgs; i++) { | |
| 44 | + struct page *page = umem->pgs[i]; | |
| 45 | + | |
| 46 | + set_page_dirty_lock(page); | |
| 47 | + put_page(page); | |
| 48 | + } | |
| 49 | + | |
| 50 | + kfree(umem->pgs); | |
| 51 | + umem->pgs = NULL; | |
| 52 | + } | |
| 53 | +} | |
| 54 | + | |
| 55 | +static void xdp_umem_unaccount_pages(struct xdp_umem *umem) | |
| 56 | +{ | |
| 57 | + if (umem->user) { | |
| 58 | + atomic_long_sub(umem->npgs, &umem->user->locked_vm); | |
| 59 | + free_uid(umem->user); | |
| 60 | + } | |
| 61 | +} | |
| 62 | + | |
| 63 | +static void xdp_umem_release(struct xdp_umem *umem) | |
| 64 | +{ | |
| 65 | + struct task_struct *task; | |
| 66 | + struct mm_struct *mm; | |
| 67 | + | |
| 68 | + if (umem->pgs) { | |
| 69 | + xdp_umem_unpin_pages(umem); | |
| 70 | + | |
| 71 | + task = get_pid_task(umem->pid, PIDTYPE_PID); | |
| 72 | + put_pid(umem->pid); | |
| 73 | + if (!task) | |
| 74 | + goto out; | |
| 75 | + mm = get_task_mm(task); | |
| 76 | + put_task_struct(task); | |
| 77 | + if (!mm) | |
| 78 | + goto out; | |
| 79 | + | |
| 80 | + mmput(mm); | |
| 81 | + umem->pgs = NULL; | |
| 82 | + } | |
| 83 | + | |
| 84 | + xdp_umem_unaccount_pages(umem); | |
| 85 | +out: | |
| 86 | + kfree(umem); | |
| 87 | +} | |
| 88 | + | |
| 89 | +static void xdp_umem_release_deferred(struct work_struct *work) | |
| 90 | +{ | |
| 91 | + struct xdp_umem *umem = container_of(work, struct xdp_umem, work); | |
| 92 | + | |
| 93 | + xdp_umem_release(umem); | |
| 94 | +} | |
| 95 | + | |
| 96 | +void xdp_get_umem(struct xdp_umem *umem) | |
| 97 | +{ | |
| 98 | + atomic_inc(&umem->users); | |
| 99 | +} | |
| 100 | + | |
| 101 | +void xdp_put_umem(struct xdp_umem *umem) | |
| 102 | +{ | |
| 103 | + if (!umem) | |
| 104 | + return; | |
| 105 | + | |
| 106 | + if (atomic_dec_and_test(&umem->users)) { | |
| 107 | + INIT_WORK(&umem->work, xdp_umem_release_deferred); | |
| 108 | + schedule_work(&umem->work); | |
| 109 | + } | |
| 110 | +} | |
| 111 | + | |
| 112 | +static int xdp_umem_pin_pages(struct xdp_umem *umem) | |
| 113 | +{ | |
| 114 | + unsigned int gup_flags = FOLL_WRITE; | |
| 115 | + long npgs; | |
| 116 | + int err; | |
| 117 | + | |
| 118 | + umem->pgs = kcalloc(umem->npgs, sizeof(*umem->pgs), GFP_KERNEL); | |
| 119 | + if (!umem->pgs) | |
| 120 | + return -ENOMEM; | |
| 121 | + | |
| 122 | + down_write(¤t->mm->mmap_sem); | |
| 123 | + npgs = get_user_pages(umem->address, umem->npgs, | |
| 124 | + gup_flags, &umem->pgs[0], NULL); | |
| 125 | + up_write(¤t->mm->mmap_sem); | |
| 126 | + | |
| 127 | + if (npgs != umem->npgs) { | |
| 128 | + if (npgs >= 0) { | |
| 129 | + umem->npgs = npgs; | |
| 130 | + err = -ENOMEM; | |
| 131 | + goto out_pin; | |
| 132 | + } | |
| 133 | + err = npgs; | |
| 134 | + goto out_pgs; | |
| 135 | + } | |
| 136 | + return 0; | |
| 137 | + | |
| 138 | +out_pin: | |
| 139 | + xdp_umem_unpin_pages(umem); | |
| 140 | +out_pgs: | |
| 141 | + kfree(umem->pgs); | |
| 142 | + umem->pgs = NULL; | |
| 143 | + return err; | |
| 144 | +} | |
| 145 | + | |
| 146 | +static int xdp_umem_account_pages(struct xdp_umem *umem) | |
| 147 | +{ | |
| 148 | + unsigned long lock_limit, new_npgs, old_npgs; | |
| 149 | + | |
| 150 | + if (capable(CAP_IPC_LOCK)) | |
| 151 | + return 0; | |
| 152 | + | |
| 153 | + lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT; | |
| 154 | + umem->user = get_uid(current_user()); | |
| 155 | + | |
| 156 | + do { | |
| 157 | + old_npgs = atomic_long_read(&umem->user->locked_vm); | |
| 158 | + new_npgs = old_npgs + umem->npgs; | |
| 159 | + if (new_npgs > lock_limit) { | |
| 160 | + free_uid(umem->user); | |
| 161 | + umem->user = NULL; | |
| 162 | + return -ENOBUFS; | |
| 163 | + } | |
| 164 | + } while (atomic_long_cmpxchg(&umem->user->locked_vm, old_npgs, | |
| 165 | + new_npgs) != old_npgs); | |
| 166 | + return 0; | |
| 167 | +} | |
| 168 | + | |
| 169 | +int xdp_umem_reg(struct xdp_umem *umem, struct xdp_umem_reg *mr) | |
| 170 | +{ | |
| 171 | + u32 frame_size = mr->frame_size, frame_headroom = mr->frame_headroom; | |
| 172 | + u64 addr = mr->addr, size = mr->len; | |
| 173 | + unsigned int nframes, nfpp; | |
| 174 | + int size_chk, err; | |
| 175 | + | |
| 176 | + if (!umem) | |
| 177 | + return -EINVAL; | |
| 178 | + | |
| 179 | + if (frame_size < XDP_UMEM_MIN_FRAME_SIZE || frame_size > PAGE_SIZE) { | |
| 180 | + /* Strictly speaking we could support this, if: | |
| 181 | + * - huge pages, or* | |
| 182 | + * - using an IOMMU, or | |
| 183 | + * - making sure the memory area is consecutive | |
| 184 | + * but for now, we simply say "computer says no". | |
| 185 | + */ | |
| 186 | + return -EINVAL; | |
| 187 | + } | |
| 188 | + | |
| 189 | + if (!is_power_of_2(frame_size)) | |
| 190 | + return -EINVAL; | |
| 191 | + | |
| 192 | + if (!PAGE_ALIGNED(addr)) { | |
| 193 | + /* Memory area has to be page size aligned. For | |
| 194 | + * simplicity, this might change. | |
| 195 | + */ | |
| 196 | + return -EINVAL; | |
| 197 | + } | |
| 198 | + | |
| 199 | + if ((addr + size) < addr) | |
| 200 | + return -EINVAL; | |
| 201 | + | |
| 202 | + nframes = size / frame_size; | |
| 203 | + if (nframes == 0 || nframes > UINT_MAX) | |
| 204 | + return -EINVAL; | |
| 205 | + | |
| 206 | + nfpp = PAGE_SIZE / frame_size; | |
| 207 | + if (nframes < nfpp || nframes % nfpp) | |
| 208 | + return -EINVAL; | |
| 209 | + | |
| 210 | + frame_headroom = ALIGN(frame_headroom, 64); | |
| 211 | + | |
| 212 | + size_chk = frame_size - frame_headroom - XDP_PACKET_HEADROOM; | |
| 213 | + if (size_chk < 0) | |
| 214 | + return -EINVAL; | |
| 215 | + | |
| 216 | + umem->pid = get_task_pid(current, PIDTYPE_PID); | |
| 217 | + umem->size = (size_t)size; | |
| 218 | + umem->address = (unsigned long)addr; | |
| 219 | + umem->props.frame_size = frame_size; | |
| 220 | + umem->props.nframes = nframes; | |
| 221 | + umem->frame_headroom = frame_headroom; | |
| 222 | + umem->npgs = size / PAGE_SIZE; | |
| 223 | + umem->pgs = NULL; | |
| 224 | + umem->user = NULL; | |
| 225 | + | |
| 226 | + umem->frame_size_log2 = ilog2(frame_size); | |
| 227 | + umem->nfpp_mask = nfpp - 1; | |
| 228 | + umem->nfpplog2 = ilog2(nfpp); | |
| 229 | + atomic_set(&umem->users, 1); | |
| 230 | + | |
| 231 | + err = xdp_umem_account_pages(umem); | |
| 232 | + if (err) | |
| 233 | + goto out; | |
| 234 | + | |
| 235 | + err = xdp_umem_pin_pages(umem); | |
| 236 | + if (err) | |
| 237 | + goto out_account; | |
| 238 | + return 0; | |
| 239 | + | |
| 240 | +out_account: | |
| 241 | + xdp_umem_unaccount_pages(umem); | |
| 242 | +out: | |
| 243 | + put_pid(umem->pid); | |
| 244 | + return err; | |
| 245 | +} | |
| @@ -0,0 +1,45 @@ | ||
| 1 | +/* SPDX-License-Identifier: GPL-2.0 | |
| 2 | + * XDP user-space packet buffer | |
| 3 | + * Copyright(c) 2018 Intel Corporation. | |
| 4 | + * | |
| 5 | + * This program is free software; you can redistribute it and/or modify it | |
| 6 | + * under the terms and conditions of the GNU General Public License, | |
| 7 | + * version 2, as published by the Free Software Foundation. | |
| 8 | + * | |
| 9 | + * This program is distributed in the hope it will be useful, but WITHOUT | |
| 10 | + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 | + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
| 12 | + * more details. | |
| 13 | + */ | |
| 14 | + | |
| 15 | +#ifndef XDP_UMEM_H_ | |
| 16 | +#define XDP_UMEM_H_ | |
| 17 | + | |
| 18 | +#include <linux/mm.h> | |
| 19 | +#include <linux/if_xdp.h> | |
| 20 | +#include <linux/workqueue.h> | |
| 21 | + | |
| 22 | +#include "xdp_umem_props.h" | |
| 23 | + | |
| 24 | +struct xdp_umem { | |
| 25 | + struct page **pgs; | |
| 26 | + struct xdp_umem_props props; | |
| 27 | + u32 npgs; | |
| 28 | + u32 frame_headroom; | |
| 29 | + u32 nfpp_mask; | |
| 30 | + u32 nfpplog2; | |
| 31 | + u32 frame_size_log2; | |
| 32 | + struct user_struct *user; | |
| 33 | + struct pid *pid; | |
| 34 | + unsigned long address; | |
| 35 | + size_t size; | |
| 36 | + atomic_t users; | |
| 37 | + struct work_struct work; | |
| 38 | +}; | |
| 39 | + | |
| 40 | +int xdp_umem_reg(struct xdp_umem *umem, struct xdp_umem_reg *mr); | |
| 41 | +void xdp_get_umem(struct xdp_umem *umem); | |
| 42 | +void xdp_put_umem(struct xdp_umem *umem); | |
| 43 | +int xdp_umem_create(struct xdp_umem **umem); | |
| 44 | + | |
| 45 | +#endif /* XDP_UMEM_H_ */ | |
| @@ -0,0 +1,23 @@ | ||
| 1 | +/* SPDX-License-Identifier: GPL-2.0 | |
| 2 | + * XDP user-space packet buffer | |
| 3 | + * Copyright(c) 2018 Intel Corporation. | |
| 4 | + * | |
| 5 | + * This program is free software; you can redistribute it and/or modify it | |
| 6 | + * under the terms and conditions of the GNU General Public License, | |
| 7 | + * version 2, as published by the Free Software Foundation. | |
| 8 | + * | |
| 9 | + * This program is distributed in the hope it will be useful, but WITHOUT | |
| 10 | + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 | + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
| 12 | + * more details. | |
| 13 | + */ | |
| 14 | + | |
| 15 | +#ifndef XDP_UMEM_PROPS_H_ | |
| 16 | +#define XDP_UMEM_PROPS_H_ | |
| 17 | + | |
| 18 | +struct xdp_umem_props { | |
| 19 | + u32 frame_size; | |
| 20 | + u32 nframes; | |
| 21 | +}; | |
| 22 | + | |
| 23 | +#endif /* XDP_UMEM_PROPS_H_ */ | |
| @@ -0,0 +1,215 @@ | ||
| 1 | +// SPDX-License-Identifier: GPL-2.0 | |
| 2 | +/* XDP sockets | |
| 3 | + * | |
| 4 | + * AF_XDP sockets allows a channel between XDP programs and userspace | |
| 5 | + * applications. | |
| 6 | + * Copyright(c) 2018 Intel Corporation. | |
| 7 | + * | |
| 8 | + * This program is free software; you can redistribute it and/or modify it | |
| 9 | + * under the terms and conditions of the GNU General Public License, | |
| 10 | + * version 2, as published by the Free Software Foundation. | |
| 11 | + * | |
| 12 | + * This program is distributed in the hope it will be useful, but WITHOUT | |
| 13 | + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 14 | + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
| 15 | + * more details. | |
| 16 | + * | |
| 17 | + * Author(s): Björn Töpel <bjorn.topel@intel.com> | |
| 18 | + * Magnus Karlsson <magnus.karlsson@intel.com> | |
| 19 | + */ | |
| 20 | + | |
| 21 | +#define pr_fmt(fmt) "AF_XDP: %s: " fmt, __func__ | |
| 22 | + | |
| 23 | +#include <linux/if_xdp.h> | |
| 24 | +#include <linux/init.h> | |
| 25 | +#include <linux/sched/mm.h> | |
| 26 | +#include <linux/sched/signal.h> | |
| 27 | +#include <linux/sched/task.h> | |
| 28 | +#include <linux/socket.h> | |
| 29 | +#include <linux/file.h> | |
| 30 | +#include <linux/uaccess.h> | |
| 31 | +#include <linux/net.h> | |
| 32 | +#include <linux/netdevice.h> | |
| 33 | +#include <net/xdp_sock.h> | |
| 34 | + | |
| 35 | +#include "xdp_umem.h" | |
| 36 | + | |
| 37 | +static struct xdp_sock *xdp_sk(struct sock *sk) | |
| 38 | +{ | |
| 39 | + return (struct xdp_sock *)sk; | |
| 40 | +} | |
| 41 | + | |
| 42 | +static int xsk_release(struct socket *sock) | |
| 43 | +{ | |
| 44 | + struct sock *sk = sock->sk; | |
| 45 | + struct net *net; | |
| 46 | + | |
| 47 | + if (!sk) | |
| 48 | + return 0; | |
| 49 | + | |
| 50 | + net = sock_net(sk); | |
| 51 | + | |
| 52 | + local_bh_disable(); | |
| 53 | + sock_prot_inuse_add(net, sk->sk_prot, -1); | |
| 54 | + local_bh_enable(); | |
| 55 | + | |
| 56 | + sock_orphan(sk); | |
| 57 | + sock->sk = NULL; | |
| 58 | + | |
| 59 | + sk_refcnt_debug_release(sk); | |
| 60 | + sock_put(sk); | |
| 61 | + | |
| 62 | + return 0; | |
| 63 | +} | |
| 64 | + | |
| 65 | +static int xsk_setsockopt(struct socket *sock, int level, int optname, | |
| 66 | + char __user *optval, unsigned int optlen) | |
| 67 | +{ | |
| 68 | + struct sock *sk = sock->sk; | |
| 69 | + struct xdp_sock *xs = xdp_sk(sk); | |
| 70 | + int err; | |
| 71 | + | |
| 72 | + if (level != SOL_XDP) | |
| 73 | + return -ENOPROTOOPT; | |
| 74 | + | |
| 75 | + switch (optname) { | |
| 76 | + case XDP_UMEM_REG: | |
| 77 | + { | |
| 78 | + struct xdp_umem_reg mr; | |
| 79 | + struct xdp_umem *umem; | |
| 80 | + | |
| 81 | + if (xs->umem) | |
| 82 | + return -EBUSY; | |
| 83 | + | |
| 84 | + if (copy_from_user(&mr, optval, sizeof(mr))) | |
| 85 | + return -EFAULT; | |
| 86 | + | |
| 87 | + mutex_lock(&xs->mutex); | |
| 88 | + err = xdp_umem_create(&umem); | |
| 89 | + | |
| 90 | + err = xdp_umem_reg(umem, &mr); | |
| 91 | + if (err) { | |
| 92 | + kfree(umem); | |
| 93 | + mutex_unlock(&xs->mutex); | |
| 94 | + return err; | |
| 95 | + } | |
| 96 | + | |
| 97 | + /* Make sure umem is ready before it can be seen by others */ | |
| 98 | + smp_wmb(); | |
| 99 | + | |
| 100 | + xs->umem = umem; | |
| 101 | + mutex_unlock(&xs->mutex); | |
| 102 | + return 0; | |
| 103 | + } | |
| 104 | + default: | |
| 105 | + break; | |
| 106 | + } | |
| 107 | + | |
| 108 | + return -ENOPROTOOPT; | |
| 109 | +} | |
| 110 | + | |
| 111 | +static struct proto xsk_proto = { | |
| 112 | + .name = "XDP", | |
| 113 | + .owner = THIS_MODULE, | |
| 114 | + .obj_size = sizeof(struct xdp_sock), | |
| 115 | +}; | |
| 116 | + | |
| 117 | +static const struct proto_ops xsk_proto_ops = { | |
| 118 | + .family = PF_XDP, | |
| 119 | + .owner = THIS_MODULE, | |
| 120 | + .release = xsk_release, | |
| 121 | + .bind = sock_no_bind, | |
| 122 | + .connect = sock_no_connect, | |
| 123 | + .socketpair = sock_no_socketpair, | |
| 124 | + .accept = sock_no_accept, | |
| 125 | + .getname = sock_no_getname, | |
| 126 | + .poll = sock_no_poll, | |
| 127 | + .ioctl = sock_no_ioctl, | |
| 128 | + .listen = sock_no_listen, | |
| 129 | + .shutdown = sock_no_shutdown, | |
| 130 | + .setsockopt = xsk_setsockopt, | |
| 131 | + .getsockopt = sock_no_getsockopt, | |
| 132 | + .sendmsg = sock_no_sendmsg, | |
| 133 | + .recvmsg = sock_no_recvmsg, | |
| 134 | + .mmap = sock_no_mmap, | |
| 135 | + .sendpage = sock_no_sendpage, | |
| 136 | +}; | |
| 137 | + | |
| 138 | +static void xsk_destruct(struct sock *sk) | |
| 139 | +{ | |
| 140 | + struct xdp_sock *xs = xdp_sk(sk); | |
| 141 | + | |
| 142 | + if (!sock_flag(sk, SOCK_DEAD)) | |
| 143 | + return; | |
| 144 | + | |
| 145 | + xdp_put_umem(xs->umem); | |
| 146 | + | |
| 147 | + sk_refcnt_debug_dec(sk); | |
| 148 | +} | |
| 149 | + | |
| 150 | +static int xsk_create(struct net *net, struct socket *sock, int protocol, | |
| 151 | + int kern) | |
| 152 | +{ | |
| 153 | + struct sock *sk; | |
| 154 | + struct xdp_sock *xs; | |
| 155 | + | |
| 156 | + if (!ns_capable(net->user_ns, CAP_NET_RAW)) | |
| 157 | + return -EPERM; | |
| 158 | + if (sock->type != SOCK_RAW) | |
| 159 | + return -ESOCKTNOSUPPORT; | |
| 160 | + | |
| 161 | + if (protocol) | |
| 162 | + return -EPROTONOSUPPORT; | |
| 163 | + | |
| 164 | + sock->state = SS_UNCONNECTED; | |
| 165 | + | |
| 166 | + sk = sk_alloc(net, PF_XDP, GFP_KERNEL, &xsk_proto, kern); | |
| 167 | + if (!sk) | |
| 168 | + return -ENOBUFS; | |
| 169 | + | |
| 170 | + sock->ops = &xsk_proto_ops; | |
| 171 | + | |
| 172 | + sock_init_data(sock, sk); | |
| 173 | + | |
| 174 | + sk->sk_family = PF_XDP; | |
| 175 | + | |
| 176 | + sk->sk_destruct = xsk_destruct; | |
| 177 | + sk_refcnt_debug_inc(sk); | |
| 178 | + | |
| 179 | + xs = xdp_sk(sk); | |
| 180 | + mutex_init(&xs->mutex); | |
| 181 | + | |
| 182 | + local_bh_disable(); | |
| 183 | + sock_prot_inuse_add(net, &xsk_proto, 1); | |
| 184 | + local_bh_enable(); | |
| 185 | + | |
| 186 | + return 0; | |
| 187 | +} | |
| 188 | + | |
| 189 | +static const struct net_proto_family xsk_family_ops = { | |
| 190 | + .family = PF_XDP, | |
| 191 | + .create = xsk_create, | |
| 192 | + .owner = THIS_MODULE, | |
| 193 | +}; | |
| 194 | + | |
| 195 | +static int __init xsk_init(void) | |
| 196 | +{ | |
| 197 | + int err; | |
| 198 | + | |
| 199 | + err = proto_register(&xsk_proto, 0 /* no slab */); | |
| 200 | + if (err) | |
| 201 | + goto out; | |
| 202 | + | |
| 203 | + err = sock_register(&xsk_family_ops); | |
| 204 | + if (err) | |
| 205 | + goto out_proto; | |
| 206 | + | |
| 207 | + return 0; | |
| 208 | + | |
| 209 | +out_proto: | |
| 210 | + proto_unregister(&xsk_proto); | |
| 211 | +out: | |
| 212 | + return err; | |
| 213 | +} | |
| 214 | + | |
| 215 | +fs_initcall(xsk_init); | |