1 // SPDX-License-Identifier: GPL-2.0
2
3 #include <linux/netdevice.h>
4 #include <net/netdev_lock.h>
5 #include <net/xsk_buff_pool.h>
6 #include <net/xdp_sock.h>
7 #include <net/xdp_sock_drv.h>
8
9 #include "xsk_queue.h"
10 #include "xdp_umem.h"
11 #include "xsk.h"
12
13 #define ETH_PAD_LEN (ETH_HLEN + 2 * VLAN_HLEN + ETH_FCS_LEN)
14
xp_add_xsk(struct xsk_buff_pool * pool,struct xdp_sock * xs)15 void xp_add_xsk(struct xsk_buff_pool *pool, struct xdp_sock *xs)
16 {
17 if (!xs->tx)
18 return;
19
20 spin_lock(&pool->xsk_tx_list_lock);
21 list_add_rcu(&xs->tx_list, &pool->xsk_tx_list);
22 spin_unlock(&pool->xsk_tx_list_lock);
23 }
24
xp_del_xsk(struct xsk_buff_pool * pool,struct xdp_sock * xs)25 void xp_del_xsk(struct xsk_buff_pool *pool, struct xdp_sock *xs)
26 {
27 if (!xs->tx)
28 return;
29
30 spin_lock(&pool->xsk_tx_list_lock);
31 list_del_rcu(&xs->tx_list);
32 spin_unlock(&pool->xsk_tx_list_lock);
33 }
34
xp_destroy(struct xsk_buff_pool * pool)35 void xp_destroy(struct xsk_buff_pool *pool)
36 {
37 if (!pool)
38 return;
39
40 kvfree(pool->tx_descs);
41 kvfree(pool->heads);
42 kvfree(pool);
43 }
44
xp_alloc_tx_descs(struct xsk_buff_pool * pool,struct xdp_sock * xs)45 int xp_alloc_tx_descs(struct xsk_buff_pool *pool, struct xdp_sock *xs)
46 {
47 pool->tx_descs = kvzalloc_objs(*pool->tx_descs, xs->tx->nentries);
48 if (!pool->tx_descs)
49 return -ENOMEM;
50
51 return 0;
52 }
53
xp_create_and_assign_umem(struct xdp_sock * xs,struct xdp_umem * umem)54 struct xsk_buff_pool *xp_create_and_assign_umem(struct xdp_sock *xs,
55 struct xdp_umem *umem)
56 {
57 bool unaligned = umem->flags & XDP_UMEM_UNALIGNED_CHUNK_FLAG;
58 struct xsk_buff_pool *pool;
59 struct xdp_buff_xsk *xskb;
60 u32 i, entries;
61
62 entries = unaligned ? umem->chunks : 0;
63 pool = kvzalloc_flex(*pool, free_heads, entries);
64 if (!pool)
65 goto out;
66
67 pool->heads = kvzalloc_objs(*pool->heads, umem->chunks);
68 if (!pool->heads)
69 goto out;
70
71 if (xs->tx)
72 if (xp_alloc_tx_descs(pool, xs))
73 goto out;
74
75 pool->chunk_mask = ~((u64)umem->chunk_size - 1);
76 pool->addrs_cnt = umem->size;
77 pool->heads_cnt = umem->chunks;
78 pool->free_heads_cnt = umem->chunks;
79 pool->headroom = umem->headroom;
80 pool->chunk_size = umem->chunk_size;
81 pool->chunk_shift = ffs(umem->chunk_size) - 1;
82 pool->unaligned = unaligned;
83 pool->frame_len = umem->chunk_size - umem->headroom -
84 XDP_PACKET_HEADROOM;
85 pool->umem = umem;
86 pool->addrs = umem->addrs;
87 pool->tx_metadata_len = umem->tx_metadata_len;
88 pool->tx_sw_csum = umem->flags & XDP_UMEM_TX_SW_CSUM;
89 spin_lock_init(&pool->rx_lock);
90 INIT_LIST_HEAD(&pool->free_list);
91 INIT_LIST_HEAD(&pool->xskb_list);
92 INIT_LIST_HEAD(&pool->xsk_tx_list);
93 spin_lock_init(&pool->xsk_tx_list_lock);
94 spin_lock_init(&pool->cq_prod_lock);
95 spin_lock_init(&xs->cq_tmp->cq_cached_prod_lock);
96 refcount_set(&pool->users, 1);
97
98 pool->fq = xs->fq_tmp;
99 pool->cq = xs->cq_tmp;
100
101 for (i = 0; i < pool->free_heads_cnt; i++) {
102 xskb = &pool->heads[i];
103 xskb->pool = pool;
104 xskb->xdp.frame_sz = umem->chunk_size - umem->headroom;
105 INIT_LIST_HEAD(&xskb->list_node);
106 if (pool->unaligned)
107 pool->free_heads[i] = xskb;
108 else
109 xp_init_xskb_addr(xskb, pool, (u64)i * pool->chunk_size);
110 }
111
112 return pool;
113
114 out:
115 xp_destroy(pool);
116 return NULL;
117 }
118
xp_set_rxq_info(struct xsk_buff_pool * pool,struct xdp_rxq_info * rxq)119 void xp_set_rxq_info(struct xsk_buff_pool *pool, struct xdp_rxq_info *rxq)
120 {
121 u32 i;
122
123 for (i = 0; i < pool->heads_cnt; i++)
124 pool->heads[i].xdp.rxq = rxq;
125 }
126 EXPORT_SYMBOL(xp_set_rxq_info);
127
xp_fill_cb(struct xsk_buff_pool * pool,struct xsk_cb_desc * desc)128 void xp_fill_cb(struct xsk_buff_pool *pool, struct xsk_cb_desc *desc)
129 {
130 u32 i;
131
132 for (i = 0; i < pool->heads_cnt; i++) {
133 struct xdp_buff_xsk *xskb = &pool->heads[i];
134
135 memcpy(xskb->cb + desc->off, desc->src, desc->bytes);
136 }
137 }
138 EXPORT_SYMBOL(xp_fill_cb);
139
xp_disable_drv_zc(struct xsk_buff_pool * pool)140 static void xp_disable_drv_zc(struct xsk_buff_pool *pool)
141 {
142 struct netdev_bpf bpf;
143 int err;
144
145 ASSERT_RTNL();
146
147 if (pool->umem->zc) {
148 bpf.command = XDP_SETUP_XSK_POOL;
149 bpf.xsk.pool = NULL;
150 bpf.xsk.queue_id = pool->queue_id;
151
152 err = pool->netdev->netdev_ops->ndo_bpf(pool->netdev, &bpf);
153
154 if (err)
155 WARN(1, "Failed to disable zero-copy!\n");
156 }
157 }
158
xp_assign_dev(struct xsk_buff_pool * pool,struct net_device * netdev,u16 queue_id,u16 flags)159 int xp_assign_dev(struct xsk_buff_pool *pool,
160 struct net_device *netdev, u16 queue_id, u16 flags)
161 {
162 u32 needed = netdev->mtu + ETH_PAD_LEN;
163 u32 segs = netdev->xdp_zc_max_segs;
164 bool mbuf = flags & XDP_USE_SG;
165 bool force_zc, force_copy;
166 struct netdev_bpf bpf;
167 u32 frame_size;
168 int err = 0;
169
170 ASSERT_RTNL();
171
172 force_zc = flags & XDP_ZEROCOPY;
173 force_copy = flags & XDP_COPY;
174
175 if (force_zc && force_copy)
176 return -EINVAL;
177
178 if (xsk_get_pool_from_qid(netdev, queue_id))
179 return -EBUSY;
180
181 pool->netdev = netdev;
182 pool->queue_id = queue_id;
183 err = xsk_reg_pool_at_qid(netdev, pool, queue_id);
184 if (err)
185 return err;
186
187 if (mbuf)
188 pool->umem->flags |= XDP_UMEM_SG_FLAG;
189
190 if (flags & XDP_USE_NEED_WAKEUP)
191 pool->uses_need_wakeup = true;
192 /* Tx needs to be explicitly woken up the first time. Also
193 * for supporting drivers that do not implement this
194 * feature. They will always have to call sendto() or poll().
195 */
196 pool->cached_need_wakeup = XDP_WAKEUP_TX;
197
198 dev_hold(netdev);
199
200 if (force_copy)
201 /* For copy-mode, we are done. */
202 return 0;
203
204 if ((netdev->xdp_features & NETDEV_XDP_ACT_XSK) != NETDEV_XDP_ACT_XSK) {
205 err = -EOPNOTSUPP;
206 goto err_unreg_pool;
207 }
208
209 if (mbuf) {
210 if (segs == 1) {
211 err = -EOPNOTSUPP;
212 goto err_unreg_pool;
213 }
214 } else {
215 segs = 1;
216 }
217
218 /* open-code xsk_pool_get_rx_frame_size() as pool->dev is not
219 * set yet at this point; we are before getting down to driver
220 */
221 frame_size = __xsk_pool_get_rx_frame_size(pool) -
222 xsk_pool_get_tailroom(mbuf);
223 frame_size = ALIGN_DOWN(frame_size, 128);
224
225 if (needed > frame_size * segs) {
226 err = -EINVAL;
227 goto err_unreg_pool;
228 }
229
230 if (dev_get_min_mp_channel_count(netdev)) {
231 err = -EBUSY;
232 goto err_unreg_pool;
233 }
234
235 bpf.command = XDP_SETUP_XSK_POOL;
236 bpf.xsk.pool = pool;
237 bpf.xsk.queue_id = queue_id;
238
239 netdev_ops_assert_locked(netdev);
240 err = netdev->netdev_ops->ndo_bpf(netdev, &bpf);
241 if (err)
242 goto err_unreg_pool;
243
244 if (!pool->dma_pages) {
245 WARN(1, "Driver did not DMA map zero-copy buffers");
246 err = -EINVAL;
247 goto err_unreg_xsk;
248 }
249 pool->umem->zc = true;
250 pool->xdp_zc_max_segs = netdev->xdp_zc_max_segs;
251 return 0;
252
253 err_unreg_xsk:
254 xp_disable_drv_zc(pool);
255 err_unreg_pool:
256 if (!force_zc)
257 err = 0; /* fallback to copy mode */
258 if (err) {
259 xsk_clear_pool_at_qid(netdev, queue_id);
260 dev_put(netdev);
261 }
262 return err;
263 }
264
xp_assign_dev_shared(struct xsk_buff_pool * pool,struct xdp_sock * umem_xs,struct net_device * dev,u16 queue_id)265 int xp_assign_dev_shared(struct xsk_buff_pool *pool, struct xdp_sock *umem_xs,
266 struct net_device *dev, u16 queue_id)
267 {
268 u16 flags;
269 struct xdp_umem *umem = umem_xs->umem;
270
271 flags = umem->zc ? XDP_ZEROCOPY : XDP_COPY;
272
273 if (umem->flags & XDP_UMEM_SG_FLAG)
274 flags |= XDP_USE_SG;
275
276 if (umem_xs->pool->uses_need_wakeup)
277 flags |= XDP_USE_NEED_WAKEUP;
278
279 return xp_assign_dev(pool, dev, queue_id, flags);
280 }
281
xp_clear_dev(struct xsk_buff_pool * pool)282 void xp_clear_dev(struct xsk_buff_pool *pool)
283 {
284 struct net_device *netdev = pool->netdev;
285
286 if (!pool->netdev)
287 return;
288
289 netdev_lock_ops(netdev);
290 xp_disable_drv_zc(pool);
291 xsk_clear_pool_at_qid(pool->netdev, pool->queue_id);
292 pool->netdev = NULL;
293 netdev_unlock_ops(netdev);
294 dev_put(netdev);
295 }
296
xp_release_deferred(struct work_struct * work)297 static void xp_release_deferred(struct work_struct *work)
298 {
299 struct xsk_buff_pool *pool = container_of(work, struct xsk_buff_pool,
300 work);
301
302 rtnl_lock();
303 xp_clear_dev(pool);
304 rtnl_unlock();
305
306 if (pool->fq) {
307 xskq_destroy(pool->fq);
308 pool->fq = NULL;
309 }
310
311 if (pool->cq) {
312 xskq_destroy(pool->cq);
313 pool->cq = NULL;
314 }
315
316 xdp_put_umem(pool->umem, false);
317 xp_destroy(pool);
318 }
319
xp_get_pool(struct xsk_buff_pool * pool)320 void xp_get_pool(struct xsk_buff_pool *pool)
321 {
322 refcount_inc(&pool->users);
323 }
324
xp_put_pool(struct xsk_buff_pool * pool)325 bool xp_put_pool(struct xsk_buff_pool *pool)
326 {
327 if (!pool)
328 return false;
329
330 if (refcount_dec_and_test(&pool->users)) {
331 INIT_WORK(&pool->work, xp_release_deferred);
332 schedule_work(&pool->work);
333 return true;
334 }
335
336 return false;
337 }
338
xp_find_dma_map(struct xsk_buff_pool * pool)339 static struct xsk_dma_map *xp_find_dma_map(struct xsk_buff_pool *pool)
340 {
341 struct xsk_dma_map *dma_map;
342
343 list_for_each_entry(dma_map, &pool->umem->xsk_dma_list, list) {
344 if (dma_map->netdev == pool->netdev)
345 return dma_map;
346 }
347
348 return NULL;
349 }
350
xp_create_dma_map(struct device * dev,struct net_device * netdev,u32 nr_pages,struct xdp_umem * umem)351 static struct xsk_dma_map *xp_create_dma_map(struct device *dev, struct net_device *netdev,
352 u32 nr_pages, struct xdp_umem *umem)
353 {
354 struct xsk_dma_map *dma_map;
355
356 dma_map = kzalloc_obj(*dma_map);
357 if (!dma_map)
358 return NULL;
359
360 dma_map->dma_pages = kvzalloc_objs(*dma_map->dma_pages, nr_pages);
361 if (!dma_map->dma_pages) {
362 kfree(dma_map);
363 return NULL;
364 }
365
366 dma_map->netdev = netdev;
367 dma_map->dev = dev;
368 dma_map->dma_pages_cnt = nr_pages;
369 refcount_set(&dma_map->users, 1);
370 list_add(&dma_map->list, &umem->xsk_dma_list);
371 return dma_map;
372 }
373
xp_destroy_dma_map(struct xsk_dma_map * dma_map)374 static void xp_destroy_dma_map(struct xsk_dma_map *dma_map)
375 {
376 list_del(&dma_map->list);
377 kvfree(dma_map->dma_pages);
378 kfree(dma_map);
379 }
380
__xp_dma_unmap(struct xsk_dma_map * dma_map,unsigned long attrs)381 static void __xp_dma_unmap(struct xsk_dma_map *dma_map, unsigned long attrs)
382 {
383 dma_addr_t *dma;
384 u32 i;
385
386 for (i = 0; i < dma_map->dma_pages_cnt; i++) {
387 dma = &dma_map->dma_pages[i];
388 if (*dma) {
389 *dma &= ~XSK_NEXT_PG_CONTIG_MASK;
390 dma_unmap_page_attrs(dma_map->dev, *dma, PAGE_SIZE,
391 DMA_BIDIRECTIONAL, attrs);
392 *dma = 0;
393 }
394 }
395
396 xp_destroy_dma_map(dma_map);
397 }
398
xp_dma_unmap(struct xsk_buff_pool * pool,unsigned long attrs)399 void xp_dma_unmap(struct xsk_buff_pool *pool, unsigned long attrs)
400 {
401 struct xsk_dma_map *dma_map;
402
403 if (!pool->dma_pages)
404 return;
405
406 dma_map = xp_find_dma_map(pool);
407 if (!dma_map) {
408 WARN(1, "Could not find dma_map for device");
409 return;
410 }
411
412 if (refcount_dec_and_test(&dma_map->users))
413 __xp_dma_unmap(dma_map, attrs);
414
415 kvfree(pool->dma_pages);
416 pool->dma_pages = NULL;
417 pool->dma_pages_cnt = 0;
418 pool->dev = NULL;
419 }
420 EXPORT_SYMBOL(xp_dma_unmap);
421
xp_check_dma_contiguity(struct xsk_dma_map * dma_map)422 static void xp_check_dma_contiguity(struct xsk_dma_map *dma_map)
423 {
424 u32 i;
425
426 for (i = 0; i < dma_map->dma_pages_cnt - 1; i++) {
427 if (dma_map->dma_pages[i] + PAGE_SIZE == dma_map->dma_pages[i + 1])
428 dma_map->dma_pages[i] |= XSK_NEXT_PG_CONTIG_MASK;
429 else
430 dma_map->dma_pages[i] &= ~XSK_NEXT_PG_CONTIG_MASK;
431 }
432 }
433
xp_init_dma_info(struct xsk_buff_pool * pool,struct xsk_dma_map * dma_map)434 static int xp_init_dma_info(struct xsk_buff_pool *pool, struct xsk_dma_map *dma_map)
435 {
436 if (!pool->unaligned) {
437 u32 i;
438
439 for (i = 0; i < pool->heads_cnt; i++) {
440 struct xdp_buff_xsk *xskb = &pool->heads[i];
441 u64 orig_addr;
442
443 orig_addr = xskb->xdp.data_hard_start - pool->addrs - pool->headroom;
444 xp_init_xskb_dma(xskb, pool, dma_map->dma_pages, orig_addr);
445 }
446 }
447
448 pool->dma_pages = kvzalloc_objs(*pool->dma_pages,
449 dma_map->dma_pages_cnt);
450 if (!pool->dma_pages)
451 return -ENOMEM;
452
453 pool->dev = dma_map->dev;
454 pool->dma_pages_cnt = dma_map->dma_pages_cnt;
455 memcpy(pool->dma_pages, dma_map->dma_pages,
456 pool->dma_pages_cnt * sizeof(*pool->dma_pages));
457
458 return 0;
459 }
460
xp_dma_map(struct xsk_buff_pool * pool,struct device * dev,unsigned long attrs,struct page ** pages,u32 nr_pages)461 int xp_dma_map(struct xsk_buff_pool *pool, struct device *dev,
462 unsigned long attrs, struct page **pages, u32 nr_pages)
463 {
464 struct xsk_dma_map *dma_map;
465 dma_addr_t dma;
466 int err;
467 u32 i;
468
469 dma_map = xp_find_dma_map(pool);
470 if (dma_map) {
471 err = xp_init_dma_info(pool, dma_map);
472 if (err)
473 return err;
474
475 refcount_inc(&dma_map->users);
476 return 0;
477 }
478
479 dma_map = xp_create_dma_map(dev, pool->netdev, nr_pages, pool->umem);
480 if (!dma_map)
481 return -ENOMEM;
482
483 for (i = 0; i < dma_map->dma_pages_cnt; i++) {
484 dma = dma_map_page_attrs(dev, pages[i], 0, PAGE_SIZE,
485 DMA_BIDIRECTIONAL, attrs);
486 if (dma_mapping_error(dev, dma)) {
487 __xp_dma_unmap(dma_map, attrs);
488 return -ENOMEM;
489 }
490 dma_map->dma_pages[i] = dma;
491 }
492
493 if (pool->unaligned)
494 xp_check_dma_contiguity(dma_map);
495
496 err = xp_init_dma_info(pool, dma_map);
497 if (err) {
498 __xp_dma_unmap(dma_map, attrs);
499 return err;
500 }
501
502 return 0;
503 }
504 EXPORT_SYMBOL(xp_dma_map);
505
xp_addr_crosses_non_contig_pg(struct xsk_buff_pool * pool,u64 addr)506 static bool xp_addr_crosses_non_contig_pg(struct xsk_buff_pool *pool,
507 u64 addr)
508 {
509 return xp_desc_crosses_non_contig_pg(pool, addr, pool->chunk_size);
510 }
511
xp_check_unaligned(struct xsk_buff_pool * pool,u64 * addr)512 static bool xp_check_unaligned(struct xsk_buff_pool *pool, u64 *addr)
513 {
514 *addr = xp_unaligned_extract_addr(*addr);
515 if (*addr >= pool->addrs_cnt ||
516 *addr + pool->chunk_size > pool->addrs_cnt ||
517 xp_addr_crosses_non_contig_pg(pool, *addr))
518 return false;
519 return true;
520 }
521
xp_check_aligned(struct xsk_buff_pool * pool,u64 * addr)522 static bool xp_check_aligned(struct xsk_buff_pool *pool, u64 *addr)
523 {
524 *addr = xp_aligned_extract_addr(pool, *addr);
525 return *addr < pool->addrs_cnt;
526 }
527
xp_get_xskb(struct xsk_buff_pool * pool,u64 addr)528 static struct xdp_buff_xsk *xp_get_xskb(struct xsk_buff_pool *pool, u64 addr)
529 {
530 struct xdp_buff_xsk *xskb;
531
532 if (pool->unaligned) {
533 xskb = pool->free_heads[--pool->free_heads_cnt];
534 xp_init_xskb_addr(xskb, pool, addr);
535 if (pool->dma_pages)
536 xp_init_xskb_dma(xskb, pool, pool->dma_pages, addr);
537 } else {
538 xskb = &pool->heads[xp_aligned_extract_idx(pool, addr)];
539 }
540
541 return xskb;
542 }
543
__xp_alloc(struct xsk_buff_pool * pool)544 static struct xdp_buff_xsk *__xp_alloc(struct xsk_buff_pool *pool)
545 {
546 struct xdp_buff_xsk *xskb;
547 u64 addr;
548 bool ok;
549
550 if (pool->free_heads_cnt == 0)
551 return NULL;
552
553 for (;;) {
554 if (!xskq_cons_peek_addr_unchecked(pool->fq, &addr)) {
555 pool->fq->queue_empty_descs++;
556 return NULL;
557 }
558
559 ok = pool->unaligned ? xp_check_unaligned(pool, &addr) :
560 xp_check_aligned(pool, &addr);
561 if (!ok) {
562 pool->fq->invalid_descs++;
563 xskq_cons_release(pool->fq);
564 continue;
565 }
566 break;
567 }
568
569 xskb = xp_get_xskb(pool, addr);
570
571 xskq_cons_release(pool->fq);
572 return xskb;
573 }
574
xp_alloc(struct xsk_buff_pool * pool)575 struct xdp_buff *xp_alloc(struct xsk_buff_pool *pool)
576 {
577 struct xdp_buff_xsk *xskb;
578
579 if (!pool->free_list_cnt) {
580 xskb = __xp_alloc(pool);
581 if (!xskb)
582 return NULL;
583 } else {
584 pool->free_list_cnt--;
585 xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk,
586 list_node);
587 list_del_init(&xskb->list_node);
588 }
589
590 xskb->xdp.data = xskb->xdp.data_hard_start + XDP_PACKET_HEADROOM;
591 xskb->xdp.data_meta = xskb->xdp.data;
592 xskb->xdp.flags = 0;
593
594 if (pool->dev)
595 xp_dma_sync_for_device(pool, xskb->dma, pool->frame_len);
596
597 return &xskb->xdp;
598 }
599 EXPORT_SYMBOL(xp_alloc);
600
xp_alloc_new_from_fq(struct xsk_buff_pool * pool,struct xdp_buff ** xdp,u32 max)601 static u32 xp_alloc_new_from_fq(struct xsk_buff_pool *pool, struct xdp_buff **xdp, u32 max)
602 {
603 u32 i, cached_cons, nb_entries;
604
605 if (max > pool->free_heads_cnt)
606 max = pool->free_heads_cnt;
607 max = xskq_cons_nb_entries(pool->fq, max);
608
609 cached_cons = pool->fq->cached_cons;
610 nb_entries = max;
611 i = max;
612 while (i--) {
613 struct xdp_buff_xsk *xskb;
614 u64 addr;
615 bool ok;
616
617 __xskq_cons_read_addr_unchecked(pool->fq, cached_cons++, &addr);
618
619 ok = pool->unaligned ? xp_check_unaligned(pool, &addr) :
620 xp_check_aligned(pool, &addr);
621 if (unlikely(!ok)) {
622 pool->fq->invalid_descs++;
623 nb_entries--;
624 continue;
625 }
626
627 xskb = xp_get_xskb(pool, addr);
628
629 *xdp = &xskb->xdp;
630 xdp++;
631 }
632
633 xskq_cons_release_n(pool->fq, max);
634 return nb_entries;
635 }
636
xp_alloc_reused(struct xsk_buff_pool * pool,struct xdp_buff ** xdp,u32 nb_entries)637 static u32 xp_alloc_reused(struct xsk_buff_pool *pool, struct xdp_buff **xdp, u32 nb_entries)
638 {
639 struct xdp_buff_xsk *xskb;
640 u32 i;
641
642 nb_entries = min_t(u32, nb_entries, pool->free_list_cnt);
643
644 i = nb_entries;
645 while (i--) {
646 xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk, list_node);
647 list_del_init(&xskb->list_node);
648
649 *xdp = &xskb->xdp;
650 xdp++;
651 }
652 pool->free_list_cnt -= nb_entries;
653
654 return nb_entries;
655 }
656
xp_alloc_slow(struct xsk_buff_pool * pool,struct xdp_buff ** xdp,u32 max)657 static u32 xp_alloc_slow(struct xsk_buff_pool *pool, struct xdp_buff **xdp,
658 u32 max)
659 {
660 int i;
661
662 for (i = 0; i < max; i++) {
663 struct xdp_buff *buff;
664
665 buff = xp_alloc(pool);
666 if (unlikely(!buff))
667 return i;
668 *xdp = buff;
669 xdp++;
670 }
671
672 return max;
673 }
674
xp_alloc_batch(struct xsk_buff_pool * pool,struct xdp_buff ** xdp,u32 max)675 u32 xp_alloc_batch(struct xsk_buff_pool *pool, struct xdp_buff **xdp, u32 max)
676 {
677 u32 nb_entries1 = 0, nb_entries2;
678
679 if (unlikely(pool->dev && dma_dev_need_sync(pool->dev)))
680 return xp_alloc_slow(pool, xdp, max);
681
682 if (unlikely(pool->free_list_cnt)) {
683 nb_entries1 = xp_alloc_reused(pool, xdp, max);
684 if (nb_entries1 == max)
685 return nb_entries1;
686
687 max -= nb_entries1;
688 xdp += nb_entries1;
689 }
690
691 nb_entries2 = xp_alloc_new_from_fq(pool, xdp, max);
692 if (!nb_entries2)
693 pool->fq->queue_empty_descs++;
694
695 return nb_entries1 + nb_entries2;
696 }
697 EXPORT_SYMBOL(xp_alloc_batch);
698
xp_can_alloc(struct xsk_buff_pool * pool,u32 count)699 bool xp_can_alloc(struct xsk_buff_pool *pool, u32 count)
700 {
701 u32 req_count, avail_count;
702
703 if (pool->free_list_cnt >= count)
704 return true;
705
706 req_count = count - pool->free_list_cnt;
707 avail_count = xskq_cons_nb_entries(pool->fq, req_count);
708 if (!avail_count)
709 pool->fq->queue_empty_descs++;
710
711 return avail_count >= req_count;
712 }
713 EXPORT_SYMBOL(xp_can_alloc);
714
xp_free(struct xdp_buff_xsk * xskb)715 void xp_free(struct xdp_buff_xsk *xskb)
716 {
717 if (!list_empty(&xskb->list_node))
718 return;
719
720 xskb->pool->free_list_cnt++;
721 list_add(&xskb->list_node, &xskb->pool->free_list);
722 }
723 EXPORT_SYMBOL(xp_free);
724
__xp_raw_get_addr(const struct xsk_buff_pool * pool,u64 addr)725 static u64 __xp_raw_get_addr(const struct xsk_buff_pool *pool, u64 addr)
726 {
727 return pool->unaligned ? xp_unaligned_add_offset_to_addr(addr) : addr;
728 }
729
__xp_raw_get_data(const struct xsk_buff_pool * pool,u64 addr)730 static void *__xp_raw_get_data(const struct xsk_buff_pool *pool, u64 addr)
731 {
732 return pool->addrs + addr;
733 }
734
xp_raw_get_data(struct xsk_buff_pool * pool,u64 addr)735 void *xp_raw_get_data(struct xsk_buff_pool *pool, u64 addr)
736 {
737 return __xp_raw_get_data(pool, __xp_raw_get_addr(pool, addr));
738 }
739 EXPORT_SYMBOL(xp_raw_get_data);
740
__xp_raw_get_dma(const struct xsk_buff_pool * pool,u64 addr)741 static dma_addr_t __xp_raw_get_dma(const struct xsk_buff_pool *pool, u64 addr)
742 {
743 return (pool->dma_pages[addr >> PAGE_SHIFT] &
744 ~XSK_NEXT_PG_CONTIG_MASK) +
745 (addr & ~PAGE_MASK);
746 }
747
xp_raw_get_dma(struct xsk_buff_pool * pool,u64 addr)748 dma_addr_t xp_raw_get_dma(struct xsk_buff_pool *pool, u64 addr)
749 {
750 return __xp_raw_get_dma(pool, __xp_raw_get_addr(pool, addr));
751 }
752 EXPORT_SYMBOL(xp_raw_get_dma);
753
754 /**
755 * xp_raw_get_ctx - get &xdp_desc context
756 * @pool: XSk buff pool desc address belongs to
757 * @addr: desc address (from userspace)
758 *
759 * Helper for getting desc's DMA address and metadata pointer, if present.
760 * Saves one call on hotpath, double calculation of the actual address,
761 * and inline checks for metadata presence and sanity.
762 *
763 * Return: new &xdp_desc_ctx struct containing desc's DMA address and metadata
764 * pointer, if it is present and valid (initialized to %NULL otherwise).
765 */
xp_raw_get_ctx(const struct xsk_buff_pool * pool,u64 addr)766 struct xdp_desc_ctx xp_raw_get_ctx(const struct xsk_buff_pool *pool, u64 addr)
767 {
768 struct xdp_desc_ctx ret;
769
770 addr = __xp_raw_get_addr(pool, addr);
771
772 ret.dma = __xp_raw_get_dma(pool, addr);
773 ret.meta = __xsk_buff_get_metadata(pool, __xp_raw_get_data(pool, addr));
774
775 return ret;
776 }
777 EXPORT_SYMBOL(xp_raw_get_ctx);
778