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