bpf: net: Set sk_bpf_storage back to NULL for cloned sk
[linux-block.git] / net / xdp / xdp_umem.c
CommitLineData
c0c77d8f
BT
1// SPDX-License-Identifier: GPL-2.0
2/* XDP user-space packet buffer
3 * Copyright(c) 2018 Intel Corporation.
c0c77d8f
BT
4 */
5
6#include <linux/init.h>
7#include <linux/sched/mm.h>
8#include <linux/sched/signal.h>
9#include <linux/sched/task.h>
10#include <linux/uaccess.h>
11#include <linux/slab.h>
12#include <linux/bpf.h>
13#include <linux/mm.h>
84c6b868
JK
14#include <linux/netdevice.h>
15#include <linux/rtnetlink.h>
50e74c01 16#include <linux/idr.h>
c0c77d8f
BT
17
18#include "xdp_umem.h"
e61e62b9 19#include "xsk_queue.h"
c0c77d8f 20
bbff2f32 21#define XDP_UMEM_MIN_CHUNK_SIZE 2048
c0c77d8f 22
50e74c01
BT
23static DEFINE_IDA(umem_ida);
24
ac98d8aa
MK
25void xdp_add_sk_umem(struct xdp_umem *umem, struct xdp_sock *xs)
26{
27 unsigned long flags;
28
29 spin_lock_irqsave(&umem->xsk_list_lock, flags);
30 list_add_rcu(&xs->list, &umem->xsk_list);
31 spin_unlock_irqrestore(&umem->xsk_list_lock, flags);
32}
33
34void xdp_del_sk_umem(struct xdp_umem *umem, struct xdp_sock *xs)
35{
36 unsigned long flags;
37
541d7fdd
BT
38 spin_lock_irqsave(&umem->xsk_list_lock, flags);
39 list_del_rcu(&xs->list);
40 spin_unlock_irqrestore(&umem->xsk_list_lock, flags);
ac98d8aa
MK
41}
42
c9b47cc1
MK
43/* The umem is stored both in the _rx struct and the _tx struct as we do
44 * not know if the device has more tx queues than rx, or the opposite.
45 * This might also change during run time.
46 */
cc5b5d35
KK
47static int xdp_reg_umem_at_qid(struct net_device *dev, struct xdp_umem *umem,
48 u16 queue_id)
84c6b868 49{
cc5b5d35
KK
50 if (queue_id >= max_t(unsigned int,
51 dev->real_num_rx_queues,
52 dev->real_num_tx_queues))
53 return -EINVAL;
54
c9b47cc1
MK
55 if (queue_id < dev->real_num_rx_queues)
56 dev->_rx[queue_id].umem = umem;
57 if (queue_id < dev->real_num_tx_queues)
58 dev->_tx[queue_id].umem = umem;
cc5b5d35
KK
59
60 return 0;
c9b47cc1 61}
84c6b868 62
1661d346
JK
63struct xdp_umem *xdp_get_umem_from_qid(struct net_device *dev,
64 u16 queue_id)
c9b47cc1
MK
65{
66 if (queue_id < dev->real_num_rx_queues)
67 return dev->_rx[queue_id].umem;
68 if (queue_id < dev->real_num_tx_queues)
69 return dev->_tx[queue_id].umem;
84c6b868 70
c9b47cc1
MK
71 return NULL;
72}
5f4f3b2d 73EXPORT_SYMBOL(xdp_get_umem_from_qid);
84c6b868 74
c9b47cc1
MK
75static void xdp_clear_umem_at_qid(struct net_device *dev, u16 queue_id)
76{
a41b4f3c 77 if (queue_id < dev->real_num_rx_queues)
c9b47cc1 78 dev->_rx[queue_id].umem = NULL;
a41b4f3c 79 if (queue_id < dev->real_num_tx_queues)
c9b47cc1 80 dev->_tx[queue_id].umem = NULL;
84c6b868
JK
81}
82
173d3adb 83int xdp_umem_assign_dev(struct xdp_umem *umem, struct net_device *dev,
c9b47cc1 84 u16 queue_id, u16 flags)
173d3adb
BT
85{
86 bool force_zc, force_copy;
87 struct netdev_bpf bpf;
c9b47cc1 88 int err = 0;
173d3adb
BT
89
90 force_zc = flags & XDP_ZEROCOPY;
91 force_copy = flags & XDP_COPY;
92
93 if (force_zc && force_copy)
94 return -EINVAL;
95
c9b47cc1
MK
96 rtnl_lock();
97 if (xdp_get_umem_from_qid(dev, queue_id)) {
98 err = -EBUSY;
99 goto out_rtnl_unlock;
100 }
173d3adb 101
cc5b5d35
KK
102 err = xdp_reg_umem_at_qid(dev, umem, queue_id);
103 if (err)
104 goto out_rtnl_unlock;
105
c9b47cc1
MK
106 umem->dev = dev;
107 umem->queue_id = queue_id;
108 if (force_copy)
109 /* For copy-mode, we are done. */
110 goto out_rtnl_unlock;
173d3adb 111
c9b47cc1
MK
112 if (!dev->netdev_ops->ndo_bpf ||
113 !dev->netdev_ops->ndo_xsk_async_xmit) {
114 err = -EOPNOTSUPP;
115 goto err_unreg_umem;
84c6b868 116 }
173d3adb 117
f734607e
JK
118 bpf.command = XDP_SETUP_XSK_UMEM;
119 bpf.xsk.umem = umem;
120 bpf.xsk.queue_id = queue_id;
173d3adb 121
f734607e 122 err = dev->netdev_ops->ndo_bpf(dev, &bpf);
f734607e 123 if (err)
c9b47cc1 124 goto err_unreg_umem;
84c6b868 125 rtnl_unlock();
173d3adb 126
f734607e 127 dev_hold(dev);
f734607e
JK
128 umem->zc = true;
129 return 0;
84c6b868 130
c9b47cc1 131err_unreg_umem:
c9b47cc1
MK
132 if (!force_zc)
133 err = 0; /* fallback to copy mode */
1e405c1a
BT
134 if (err)
135 xdp_clear_umem_at_qid(dev, queue_id);
c9b47cc1 136out_rtnl_unlock:
84c6b868 137 rtnl_unlock();
c9b47cc1 138 return err;
173d3adb
BT
139}
140
ac98d8aa 141static void xdp_umem_clear_dev(struct xdp_umem *umem)
173d3adb
BT
142{
143 struct netdev_bpf bpf;
144 int err;
145
c9b47cc1 146 if (umem->zc) {
173d3adb
BT
147 bpf.command = XDP_SETUP_XSK_UMEM;
148 bpf.xsk.umem = NULL;
149 bpf.xsk.queue_id = umem->queue_id;
150
151 rtnl_lock();
152 err = umem->dev->netdev_ops->ndo_bpf(umem->dev, &bpf);
153 rtnl_unlock();
154
155 if (err)
156 WARN(1, "failed to disable umem!\n");
c9b47cc1
MK
157 }
158
159 if (umem->dev) {
160 rtnl_lock();
161 xdp_clear_umem_at_qid(umem->dev, umem->queue_id);
162 rtnl_unlock();
163 }
173d3adb 164
c9b47cc1 165 if (umem->zc) {
173d3adb 166 dev_put(umem->dev);
c9b47cc1 167 umem->zc = false;
173d3adb
BT
168 }
169}
170
c0c77d8f
BT
171static void xdp_umem_unpin_pages(struct xdp_umem *umem)
172{
173 unsigned int i;
174
a49049ea
BT
175 for (i = 0; i < umem->npgs; i++) {
176 struct page *page = umem->pgs[i];
c0c77d8f 177
a49049ea
BT
178 set_page_dirty_lock(page);
179 put_page(page);
c0c77d8f 180 }
a49049ea
BT
181
182 kfree(umem->pgs);
183 umem->pgs = NULL;
c0c77d8f
BT
184}
185
186static void xdp_umem_unaccount_pages(struct xdp_umem *umem)
187{
c09290c5
DB
188 if (umem->user) {
189 atomic_long_sub(umem->npgs, &umem->user->locked_vm);
190 free_uid(umem->user);
191 }
c0c77d8f
BT
192}
193
194static void xdp_umem_release(struct xdp_umem *umem)
195{
173d3adb
BT
196 xdp_umem_clear_dev(umem);
197
50e74c01
BT
198 ida_simple_remove(&umem_ida, umem->id);
199
423f3832
MK
200 if (umem->fq) {
201 xskq_destroy(umem->fq);
202 umem->fq = NULL;
203 }
204
fe230832
MK
205 if (umem->cq) {
206 xskq_destroy(umem->cq);
207 umem->cq = NULL;
208 }
209
f5bd9138
JK
210 xsk_reuseq_destroy(umem);
211
a49049ea 212 xdp_umem_unpin_pages(umem);
c0c77d8f 213
8aef7340
BT
214 kfree(umem->pages);
215 umem->pages = NULL;
216
c0c77d8f 217 xdp_umem_unaccount_pages(umem);
c0c77d8f
BT
218 kfree(umem);
219}
220
221static void xdp_umem_release_deferred(struct work_struct *work)
222{
223 struct xdp_umem *umem = container_of(work, struct xdp_umem, work);
224
225 xdp_umem_release(umem);
226}
227
228void xdp_get_umem(struct xdp_umem *umem)
229{
d3b42f14 230 refcount_inc(&umem->users);
c0c77d8f
BT
231}
232
233void xdp_put_umem(struct xdp_umem *umem)
234{
235 if (!umem)
236 return;
237
d3b42f14 238 if (refcount_dec_and_test(&umem->users)) {
c0c77d8f
BT
239 INIT_WORK(&umem->work, xdp_umem_release_deferred);
240 schedule_work(&umem->work);
241 }
242}
243
244static int xdp_umem_pin_pages(struct xdp_umem *umem)
245{
246 unsigned int gup_flags = FOLL_WRITE;
247 long npgs;
248 int err;
249
a343993c
BT
250 umem->pgs = kcalloc(umem->npgs, sizeof(*umem->pgs),
251 GFP_KERNEL | __GFP_NOWARN);
c0c77d8f
BT
252 if (!umem->pgs)
253 return -ENOMEM;
254
e451eb51 255 down_read(&current->mm->mmap_sem);
932f4a63
IW
256 npgs = get_user_pages(umem->address, umem->npgs,
257 gup_flags | FOLL_LONGTERM, &umem->pgs[0], NULL);
e451eb51 258 up_read(&current->mm->mmap_sem);
c0c77d8f
BT
259
260 if (npgs != umem->npgs) {
261 if (npgs >= 0) {
262 umem->npgs = npgs;
263 err = -ENOMEM;
264 goto out_pin;
265 }
266 err = npgs;
267 goto out_pgs;
268 }
269 return 0;
270
271out_pin:
272 xdp_umem_unpin_pages(umem);
273out_pgs:
274 kfree(umem->pgs);
275 umem->pgs = NULL;
276 return err;
277}
278
279static int xdp_umem_account_pages(struct xdp_umem *umem)
280{
281 unsigned long lock_limit, new_npgs, old_npgs;
282
283 if (capable(CAP_IPC_LOCK))
284 return 0;
285
286 lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
287 umem->user = get_uid(current_user());
288
289 do {
290 old_npgs = atomic_long_read(&umem->user->locked_vm);
291 new_npgs = old_npgs + umem->npgs;
292 if (new_npgs > lock_limit) {
293 free_uid(umem->user);
294 umem->user = NULL;
295 return -ENOBUFS;
296 }
297 } while (atomic_long_cmpxchg(&umem->user->locked_vm, old_npgs,
298 new_npgs) != old_npgs);
299 return 0;
300}
301
a49049ea 302static int xdp_umem_reg(struct xdp_umem *umem, struct xdp_umem_reg *mr)
c0c77d8f 303{
bbff2f32
BT
304 u32 chunk_size = mr->chunk_size, headroom = mr->headroom;
305 unsigned int chunks, chunks_per_page;
c0c77d8f 306 u64 addr = mr->addr, size = mr->len;
8aef7340 307 int size_chk, err, i;
c0c77d8f 308
bbff2f32 309 if (chunk_size < XDP_UMEM_MIN_CHUNK_SIZE || chunk_size > PAGE_SIZE) {
c0c77d8f
BT
310 /* Strictly speaking we could support this, if:
311 * - huge pages, or*
312 * - using an IOMMU, or
313 * - making sure the memory area is consecutive
314 * but for now, we simply say "computer says no".
315 */
316 return -EINVAL;
317 }
318
bbff2f32 319 if (!is_power_of_2(chunk_size))
c0c77d8f
BT
320 return -EINVAL;
321
322 if (!PAGE_ALIGNED(addr)) {
323 /* Memory area has to be page size aligned. For
324 * simplicity, this might change.
325 */
326 return -EINVAL;
327 }
328
329 if ((addr + size) < addr)
330 return -EINVAL;
331
bbff2f32
BT
332 chunks = (unsigned int)div_u64(size, chunk_size);
333 if (chunks == 0)
c0c77d8f
BT
334 return -EINVAL;
335
bbff2f32
BT
336 chunks_per_page = PAGE_SIZE / chunk_size;
337 if (chunks < chunks_per_page || chunks % chunks_per_page)
c0c77d8f
BT
338 return -EINVAL;
339
bbff2f32 340 headroom = ALIGN(headroom, 64);
c0c77d8f 341
bbff2f32 342 size_chk = chunk_size - headroom - XDP_PACKET_HEADROOM;
c0c77d8f
BT
343 if (size_chk < 0)
344 return -EINVAL;
345
c0c77d8f 346 umem->address = (unsigned long)addr;
93ee30f3
MK
347 umem->chunk_mask = ~((u64)chunk_size - 1);
348 umem->size = size;
bbff2f32
BT
349 umem->headroom = headroom;
350 umem->chunk_size_nohr = chunk_size - headroom;
c0c77d8f
BT
351 umem->npgs = size / PAGE_SIZE;
352 umem->pgs = NULL;
353 umem->user = NULL;
ac98d8aa
MK
354 INIT_LIST_HEAD(&umem->xsk_list);
355 spin_lock_init(&umem->xsk_list_lock);
c0c77d8f 356
d3b42f14 357 refcount_set(&umem->users, 1);
c0c77d8f
BT
358
359 err = xdp_umem_account_pages(umem);
360 if (err)
044175a0 361 return err;
c0c77d8f
BT
362
363 err = xdp_umem_pin_pages(umem);
364 if (err)
365 goto out_account;
8aef7340
BT
366
367 umem->pages = kcalloc(umem->npgs, sizeof(*umem->pages), GFP_KERNEL);
368 if (!umem->pages) {
369 err = -ENOMEM;
370 goto out_account;
371 }
372
373 for (i = 0; i < umem->npgs; i++)
374 umem->pages[i].addr = page_address(umem->pgs[i]);
375
c0c77d8f
BT
376 return 0;
377
378out_account:
379 xdp_umem_unaccount_pages(umem);
c0c77d8f
BT
380 return err;
381}
965a9909 382
a49049ea
BT
383struct xdp_umem *xdp_umem_create(struct xdp_umem_reg *mr)
384{
385 struct xdp_umem *umem;
386 int err;
387
388 umem = kzalloc(sizeof(*umem), GFP_KERNEL);
389 if (!umem)
390 return ERR_PTR(-ENOMEM);
391
50e74c01
BT
392 err = ida_simple_get(&umem_ida, 0, 0, GFP_KERNEL);
393 if (err < 0) {
394 kfree(umem);
395 return ERR_PTR(err);
396 }
397 umem->id = err;
398
a49049ea
BT
399 err = xdp_umem_reg(umem, mr);
400 if (err) {
50e74c01 401 ida_simple_remove(&umem_ida, umem->id);
a49049ea
BT
402 kfree(umem);
403 return ERR_PTR(err);
404 }
405
406 return umem;
407}
408
965a9909
MK
409bool xdp_umem_validate_queues(struct xdp_umem *umem)
410{
da60cf00 411 return umem->fq && umem->cq;
965a9909 412}