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