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