[linux-block.git] / net / xdp / xsk_buff_pool.c

// SPDX-License-Identifier: GPL-2.0

#include <net/xsk_buff_pool.h>
#include <net/xdp_sock.h>
#include <net/xdp_sock_drv.h>

#include "xsk_queue.h"
#include "xdp_umem.h"
#include "xsk.h"

void xp_add_xsk(struct xsk_buff_pool *pool, struct xdp_sock *xs)
{
	unsigned long flags;

	if (!xs->tx)
		return;

	spin_lock_irqsave(&pool->xsk_tx_list_lock, flags);
	list_add_rcu(&xs->tx_list, &pool->xsk_tx_list);
	spin_unlock_irqrestore(&pool->xsk_tx_list_lock, flags);
}

void xp_del_xsk(struct xsk_buff_pool *pool, struct xdp_sock *xs)
{
	unsigned long flags;

	if (!xs->tx)
		return;

	spin_lock_irqsave(&pool->xsk_tx_list_lock, flags);
	list_del_rcu(&xs->tx_list);
	spin_unlock_irqrestore(&pool->xsk_tx_list_lock, flags);
}

void xp_destroy(struct xsk_buff_pool *pool)
{
	if (!pool)
		return;

	kvfree(pool->tx_descs);
	kvfree(pool->heads);
	kvfree(pool);
}

int xp_alloc_tx_descs(struct xsk_buff_pool *pool, struct xdp_sock *xs)
{
	pool->tx_descs = kvcalloc(xs->tx->nentries, sizeof(*pool->tx_descs),
				  GFP_KERNEL);
	if (!pool->tx_descs)
		return -ENOMEM;

	return 0;
}

struct xsk_buff_pool *xp_create_and_assign_umem(struct xdp_sock *xs,
						struct xdp_umem *umem)
{
	bool unaligned = umem->flags & XDP_UMEM_UNALIGNED_CHUNK_FLAG;
	struct xsk_buff_pool *pool;
	struct xdp_buff_xsk *xskb;
	u32 i, entries;

	entries = unaligned ? umem->chunks : 0;
	pool = kvzalloc(struct_size(pool, free_heads, entries),	GFP_KERNEL);
	if (!pool)
		goto out;

	pool->heads = kvcalloc(umem->chunks, sizeof(*pool->heads), GFP_KERNEL);
	if (!pool->heads)
		goto out;

	if (xs->tx)
		if (xp_alloc_tx_descs(pool, xs))
			goto out;

	pool->chunk_mask = ~((u64)umem->chunk_size - 1);
	pool->addrs_cnt = umem->size;
	pool->heads_cnt = umem->chunks;
	pool->free_heads_cnt = umem->chunks;
	pool->headroom = umem->headroom;
	pool->chunk_size = umem->chunk_size;
	pool->chunk_shift = ffs(umem->chunk_size) - 1;
	pool->unaligned = unaligned;
	pool->frame_len = umem->chunk_size - umem->headroom -
		XDP_PACKET_HEADROOM;
	pool->umem = umem;
	pool->addrs = umem->addrs;
	INIT_LIST_HEAD(&pool->free_list);
	INIT_LIST_HEAD(&pool->xsk_tx_list);
	spin_lock_init(&pool->xsk_tx_list_lock);
	spin_lock_init(&pool->cq_lock);
	refcount_set(&pool->users, 1);

	pool->fq = xs->fq_tmp;
	pool->cq = xs->cq_tmp;

	for (i = 0; i < pool->free_heads_cnt; i++) {
		xskb = &pool->heads[i];
		xskb->pool = pool;
		xskb->xdp.frame_sz = umem->chunk_size - umem->headroom;
		INIT_LIST_HEAD(&xskb->free_list_node);
		if (pool->unaligned)
			pool->free_heads[i] = xskb;
		else
			xp_init_xskb_addr(xskb, pool, i * pool->chunk_size);
	}

	return pool;

out:
	xp_destroy(pool);
	return NULL;
}

void xp_set_rxq_info(struct xsk_buff_pool *pool, struct xdp_rxq_info *rxq)
{
	u32 i;

	for (i = 0; i < pool->heads_cnt; i++)
		pool->heads[i].xdp.rxq = rxq;
}
EXPORT_SYMBOL(xp_set_rxq_info);

static void xp_disable_drv_zc(struct xsk_buff_pool *pool)
{
	struct netdev_bpf bpf;
	int err;

	ASSERT_RTNL();

	if (pool->umem->zc) {
		bpf.command = XDP_SETUP_XSK_POOL;
		bpf.xsk.pool = NULL;
		bpf.xsk.queue_id = pool->queue_id;

		err = pool->netdev->netdev_ops->ndo_bpf(pool->netdev, &bpf);

		if (err)
			WARN(1, "Failed to disable zero-copy!\n");
	}
}

int xp_assign_dev(struct xsk_buff_pool *pool,
		  struct net_device *netdev, u16 queue_id, u16 flags)
{
	bool force_zc, force_copy;
	struct netdev_bpf bpf;
	int err = 0;

	ASSERT_RTNL();

	force_zc = flags & XDP_ZEROCOPY;
	force_copy = flags & XDP_COPY;

	if (force_zc && force_copy)
		return -EINVAL;

	if (xsk_get_pool_from_qid(netdev, queue_id))
		return -EBUSY;

	pool->netdev = netdev;
	pool->queue_id = queue_id;
	err = xsk_reg_pool_at_qid(netdev, pool, queue_id);
	if (err)
		return err;

	if (flags & XDP_USE_NEED_WAKEUP)
		pool->uses_need_wakeup = true;
	/* Tx needs to be explicitly woken up the first time.  Also
	 * for supporting drivers that do not implement this
	 * feature. They will always have to call sendto() or poll().
	 */
	pool->cached_need_wakeup = XDP_WAKEUP_TX;

	dev_hold(netdev);

	if (force_copy)
		/* For copy-mode, we are done. */
		return 0;

	if (!netdev->netdev_ops->ndo_bpf ||
	    !netdev->netdev_ops->ndo_xsk_wakeup) {
		err = -EOPNOTSUPP;
		goto err_unreg_pool;
	}

	bpf.command = XDP_SETUP_XSK_POOL;
	bpf.xsk.pool = pool;
	bpf.xsk.queue_id = queue_id;

	err = netdev->netdev_ops->ndo_bpf(netdev, &bpf);
	if (err)
		goto err_unreg_pool;

	if (!pool->dma_pages) {
		WARN(1, "Driver did not DMA map zero-copy buffers");
		err = -EINVAL;
		goto err_unreg_xsk;
	}
	pool->umem->zc = true;
	return 0;

err_unreg_xsk:
	xp_disable_drv_zc(pool);
err_unreg_pool:
	if (!force_zc)
		err = 0; /* fallback to copy mode */
	if (err) {
		xsk_clear_pool_at_qid(netdev, queue_id);
		dev_put(netdev);
	}
	return err;
}

int xp_assign_dev_shared(struct xsk_buff_pool *pool, struct xdp_sock *umem_xs,
			 struct net_device *dev, u16 queue_id)
{
	u16 flags;
	struct xdp_umem *umem = umem_xs->umem;

	/* One fill and completion ring required for each queue id. */
	if (!pool->fq || !pool->cq)
		return -EINVAL;

	flags = umem->zc ? XDP_ZEROCOPY : XDP_COPY;
	if (umem_xs->pool->uses_need_wakeup)
		flags |= XDP_USE_NEED_WAKEUP;

	return xp_assign_dev(pool, dev, queue_id, flags);
}

void xp_clear_dev(struct xsk_buff_pool *pool)
{
	if (!pool->netdev)
		return;

	xp_disable_drv_zc(pool);
	xsk_clear_pool_at_qid(pool->netdev, pool->queue_id);
	dev_put(pool->netdev);
	pool->netdev = NULL;
}

static void xp_release_deferred(struct work_struct *work)
{
	struct xsk_buff_pool *pool = container_of(work, struct xsk_buff_pool,
						  work);

	rtnl_lock();
	xp_clear_dev(pool);
	rtnl_unlock();

	if (pool->fq) {
		xskq_destroy(pool->fq);
		pool->fq = NULL;
	}

	if (pool->cq) {
		xskq_destroy(pool->cq);
		pool->cq = NULL;
	}

	xdp_put_umem(pool->umem, false);
	xp_destroy(pool);
}

void xp_get_pool(struct xsk_buff_pool *pool)
{
	refcount_inc(&pool->users);
}

bool xp_put_pool(struct xsk_buff_pool *pool)
{
	if (!pool)
		return false;

	if (refcount_dec_and_test(&pool->users)) {
		INIT_WORK(&pool->work, xp_release_deferred);
		schedule_work(&pool->work);
		return true;
	}

	return false;
}

static struct xsk_dma_map *xp_find_dma_map(struct xsk_buff_pool *pool)
{
	struct xsk_dma_map *dma_map;

	list_for_each_entry(dma_map, &pool->umem->xsk_dma_list, list) {
		if (dma_map->netdev == pool->netdev)
			return dma_map;
	}

	return NULL;
}

static struct xsk_dma_map *xp_create_dma_map(struct device *dev, struct net_device *netdev,
					     u32 nr_pages, struct xdp_umem *umem)
{
	struct xsk_dma_map *dma_map;

	dma_map = kzalloc(sizeof(*dma_map), GFP_KERNEL);
	if (!dma_map)
		return NULL;

	dma_map->dma_pages = kvcalloc(nr_pages, sizeof(*dma_map->dma_pages), GFP_KERNEL);
	if (!dma_map->dma_pages) {
		kfree(dma_map);
		return NULL;
	}

	dma_map->netdev = netdev;
	dma_map->dev = dev;
	dma_map->dma_need_sync = false;
	dma_map->dma_pages_cnt = nr_pages;
	refcount_set(&dma_map->users, 1);
	list_add(&dma_map->list, &umem->xsk_dma_list);
	return dma_map;
}

static void xp_destroy_dma_map(struct xsk_dma_map *dma_map)
{
	list_del(&dma_map->list);
	kvfree(dma_map->dma_pages);
	kfree(dma_map);
}

static void __xp_dma_unmap(struct xsk_dma_map *dma_map, unsigned long attrs)
{
	dma_addr_t *dma;
	u32 i;

	for (i = 0; i < dma_map->dma_pages_cnt; i++) {
		dma = &dma_map->dma_pages[i];
		if (*dma) {
			*dma &= ~XSK_NEXT_PG_CONTIG_MASK;
			dma_unmap_page_attrs(dma_map->dev, *dma, PAGE_SIZE,
					     DMA_BIDIRECTIONAL, attrs);
			*dma = 0;
		}
	}

	xp_destroy_dma_map(dma_map);
}

void xp_dma_unmap(struct xsk_buff_pool *pool, unsigned long attrs)
{
	struct xsk_dma_map *dma_map;

	if (pool->dma_pages_cnt == 0)
		return;

	dma_map = xp_find_dma_map(pool);
	if (!dma_map) {
		WARN(1, "Could not find dma_map for device");
		return;
	}

	if (!refcount_dec_and_test(&dma_map->users))
		return;

	__xp_dma_unmap(dma_map, attrs);
	kvfree(pool->dma_pages);
	pool->dma_pages_cnt = 0;
	pool->dev = NULL;
}
EXPORT_SYMBOL(xp_dma_unmap);

static void xp_check_dma_contiguity(struct xsk_dma_map *dma_map)
{
	u32 i;

	for (i = 0; i < dma_map->dma_pages_cnt - 1; i++) {
		if (dma_map->dma_pages[i] + PAGE_SIZE == dma_map->dma_pages[i + 1])
			dma_map->dma_pages[i] |= XSK_NEXT_PG_CONTIG_MASK;
		else
			dma_map->dma_pages[i] &= ~XSK_NEXT_PG_CONTIG_MASK;
	}
}

static int xp_init_dma_info(struct xsk_buff_pool *pool, struct xsk_dma_map *dma_map)
{
	if (!pool->unaligned) {
		u32 i;

		for (i = 0; i < pool->heads_cnt; i++) {
			struct xdp_buff_xsk *xskb = &pool->heads[i];

			xp_init_xskb_dma(xskb, pool, dma_map->dma_pages, xskb->orig_addr);
		}
	}

	pool->dma_pages = kvcalloc(dma_map->dma_pages_cnt, sizeof(*pool->dma_pages), GFP_KERNEL);
	if (!pool->dma_pages)
		return -ENOMEM;

	pool->dev = dma_map->dev;
	pool->dma_pages_cnt = dma_map->dma_pages_cnt;
	pool->dma_need_sync = dma_map->dma_need_sync;
	memcpy(pool->dma_pages, dma_map->dma_pages,
	       pool->dma_pages_cnt * sizeof(*pool->dma_pages));

	return 0;
}

int xp_dma_map(struct xsk_buff_pool *pool, struct device *dev,
	       unsigned long attrs, struct page **pages, u32 nr_pages)
{
	struct xsk_dma_map *dma_map;
	dma_addr_t dma;
	int err;
	u32 i;

	dma_map = xp_find_dma_map(pool);
	if (dma_map) {
		err = xp_init_dma_info(pool, dma_map);
		if (err)
			return err;

		refcount_inc(&dma_map->users);
		return 0;
	}

	dma_map = xp_create_dma_map(dev, pool->netdev, nr_pages, pool->umem);
	if (!dma_map)
		return -ENOMEM;

	for (i = 0; i < dma_map->dma_pages_cnt; i++) {
		dma = dma_map_page_attrs(dev, pages[i], 0, PAGE_SIZE,
					 DMA_BIDIRECTIONAL, attrs);
		if (dma_mapping_error(dev, dma)) {
			__xp_dma_unmap(dma_map, attrs);
			return -ENOMEM;
		}
		if (dma_need_sync(dev, dma))
			dma_map->dma_need_sync = true;
		dma_map->dma_pages[i] = dma;
	}

	if (pool->unaligned)
		xp_check_dma_contiguity(dma_map);

	err = xp_init_dma_info(pool, dma_map);
	if (err) {
		__xp_dma_unmap(dma_map, attrs);
		return err;
	}

	return 0;
}
EXPORT_SYMBOL(xp_dma_map);

static bool xp_addr_crosses_non_contig_pg(struct xsk_buff_pool *pool,
					  u64 addr)
{
	return xp_desc_crosses_non_contig_pg(pool, addr, pool->chunk_size);
}

static bool xp_check_unaligned(struct xsk_buff_pool *pool, u64 *addr)
{
	*addr = xp_unaligned_extract_addr(*addr);
	if (*addr >= pool->addrs_cnt ||
	    *addr + pool->chunk_size > pool->addrs_cnt ||
	    xp_addr_crosses_non_contig_pg(pool, *addr))
		return false;
	return true;
}

static bool xp_check_aligned(struct xsk_buff_pool *pool, u64 *addr)
{
	*addr = xp_aligned_extract_addr(pool, *addr);
	return *addr < pool->addrs_cnt;
}

static struct xdp_buff_xsk *__xp_alloc(struct xsk_buff_pool *pool)
{
	struct xdp_buff_xsk *xskb;
	u64 addr;
	bool ok;

	if (pool->free_heads_cnt == 0)
		return NULL;

	for (;;) {
		if (!xskq_cons_peek_addr_unchecked(pool->fq, &addr)) {
			pool->fq->queue_empty_descs++;
			return NULL;
		}

		ok = pool->unaligned ? xp_check_unaligned(pool, &addr) :
		     xp_check_aligned(pool, &addr);
		if (!ok) {
			pool->fq->invalid_descs++;
			xskq_cons_release(pool->fq);
			continue;
		}
		break;
	}

	if (pool->unaligned) {
		xskb = pool->free_heads[--pool->free_heads_cnt];
		xp_init_xskb_addr(xskb, pool, addr);
		if (pool->dma_pages_cnt)
			xp_init_xskb_dma(xskb, pool, pool->dma_pages, addr);
	} else {
		xskb = &pool->heads[xp_aligned_extract_idx(pool, addr)];
	}

	xskq_cons_release(pool->fq);
	return xskb;
}

struct xdp_buff *xp_alloc(struct xsk_buff_pool *pool)
{
	struct xdp_buff_xsk *xskb;

	if (!pool->free_list_cnt) {
		xskb = __xp_alloc(pool);
		if (!xskb)
			return NULL;
	} else {
		pool->free_list_cnt--;
		xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk,
					free_list_node);
		list_del_init(&xskb->free_list_node);
	}

	xskb->xdp.data = xskb->xdp.data_hard_start + XDP_PACKET_HEADROOM;
	xskb->xdp.data_meta = xskb->xdp.data;

	if (pool->dma_need_sync) {
		dma_sync_single_range_for_device(pool->dev, xskb->dma, 0,
						 pool->frame_len,
						 DMA_BIDIRECTIONAL);
	}
	return &xskb->xdp;
}
EXPORT_SYMBOL(xp_alloc);

static u32 xp_alloc_new_from_fq(struct xsk_buff_pool *pool, struct xdp_buff **xdp, u32 max)
{
	u32 i, cached_cons, nb_entries;

	if (max > pool->free_heads_cnt)
		max = pool->free_heads_cnt;
	max = xskq_cons_nb_entries(pool->fq, max);

	cached_cons = pool->fq->cached_cons;
	nb_entries = max;
	i = max;
	while (i--) {
		struct xdp_buff_xsk *xskb;
		u64 addr;
		bool ok;

		__xskq_cons_read_addr_unchecked(pool->fq, cached_cons++, &addr);

		ok = pool->unaligned ? xp_check_unaligned(pool, &addr) :
			xp_check_aligned(pool, &addr);
		if (unlikely(!ok)) {
			pool->fq->invalid_descs++;
			nb_entries--;
			continue;
		}

		if (pool->unaligned) {
			xskb = pool->free_heads[--pool->free_heads_cnt];
			xp_init_xskb_addr(xskb, pool, addr);
			if (pool->dma_pages_cnt)
				xp_init_xskb_dma(xskb, pool, pool->dma_pages, addr);
		} else {
			xskb = &pool->heads[xp_aligned_extract_idx(pool, addr)];
		}

		*xdp = &xskb->xdp;
		xdp++;
	}

	xskq_cons_release_n(pool->fq, max);
	return nb_entries;
}

static u32 xp_alloc_reused(struct xsk_buff_pool *pool, struct xdp_buff **xdp, u32 nb_entries)
{
	struct xdp_buff_xsk *xskb;
	u32 i;

	nb_entries = min_t(u32, nb_entries, pool->free_list_cnt);

	i = nb_entries;
	while (i--) {
		xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk, free_list_node);
		list_del_init(&xskb->free_list_node);

		*xdp = &xskb->xdp;
		xdp++;
	}
	pool->free_list_cnt -= nb_entries;

	return nb_entries;
}

u32 xp_alloc_batch(struct xsk_buff_pool *pool, struct xdp_buff **xdp, u32 max)
{
	u32 nb_entries1 = 0, nb_entries2;

	if (unlikely(pool->dma_need_sync)) {
		struct xdp_buff *buff;

		/* Slow path */
		buff = xp_alloc(pool);
		if (buff)
			*xdp = buff;
		return !!buff;
	}

	if (unlikely(pool->free_list_cnt)) {
		nb_entries1 = xp_alloc_reused(pool, xdp, max);
		if (nb_entries1 == max)
			return nb_entries1;

		max -= nb_entries1;
		xdp += nb_entries1;
	}

	nb_entries2 = xp_alloc_new_from_fq(pool, xdp, max);
	if (!nb_entries2)
		pool->fq->queue_empty_descs++;

	return nb_entries1 + nb_entries2;
}
EXPORT_SYMBOL(xp_alloc_batch);

bool xp_can_alloc(struct xsk_buff_pool *pool, u32 count)
{
	if (pool->free_list_cnt >= count)
		return true;
	return xskq_cons_has_entries(pool->fq, count - pool->free_list_cnt);
}
EXPORT_SYMBOL(xp_can_alloc);

void xp_free(struct xdp_buff_xsk *xskb)
{
	if (!list_empty(&xskb->free_list_node))
		return;

	xskb->pool->free_list_cnt++;
	list_add(&xskb->free_list_node, &xskb->pool->free_list);
}
EXPORT_SYMBOL(xp_free);

void *xp_raw_get_data(struct xsk_buff_pool *pool, u64 addr)
{
	addr = pool->unaligned ? xp_unaligned_add_offset_to_addr(addr) : addr;
	return pool->addrs + addr;
}
EXPORT_SYMBOL(xp_raw_get_data);

dma_addr_t xp_raw_get_dma(struct xsk_buff_pool *pool, u64 addr)
{
	addr = pool->unaligned ? xp_unaligned_add_offset_to_addr(addr) : addr;
	return (pool->dma_pages[addr >> PAGE_SHIFT] &
		~XSK_NEXT_PG_CONTIG_MASK) +
		(addr & ~PAGE_MASK);
}
EXPORT_SYMBOL(xp_raw_get_dma);

void xp_dma_sync_for_cpu_slow(struct xdp_buff_xsk *xskb)
{
	dma_sync_single_range_for_cpu(xskb->pool->dev, xskb->dma, 0,
				      xskb->pool->frame_len, DMA_BIDIRECTIONAL);
}
EXPORT_SYMBOL(xp_dma_sync_for_cpu_slow);

void xp_dma_sync_for_device_slow(struct xsk_buff_pool *pool, dma_addr_t dma,
				 size_t size)
{
	dma_sync_single_range_for_device(pool->dev, dma, 0,
					 size, DMA_BIDIRECTIONAL);
}
EXPORT_SYMBOL(xp_dma_sync_for_device_slow);
Commit	Line	Data
2b43470a BT	1	// SPDX-License-Identifier: GPL-2.0
	2
	3	#include <net/xsk_buff_pool.h>
	4	#include <net/xdp_sock.h>
1c1efc2a	5	#include <net/xdp_sock_drv.h>
2b43470a BT	6
2b43470a BT	7	#include "xsk_queue.h"
1c1efc2a MK	8	#include "xdp_umem.h"
1c1efc2a MK	9	#include "xsk.h"
2b43470a	10
a5aa8e52 MK	11	void xp_add_xsk(struct xsk_buff_pool pool, struct xdp_sock xs)
	12	{
	13	unsigned long flags;
	14
	15	if (!xs->tx)
	16	return;
	17
	18	spin_lock_irqsave(&pool->xsk_tx_list_lock, flags);
	19	list_add_rcu(&xs->tx_list, &pool->xsk_tx_list);
	20	spin_unlock_irqrestore(&pool->xsk_tx_list_lock, flags);
	21	}
	22
	23	void xp_del_xsk(struct xsk_buff_pool pool, struct xdp_sock xs)
	24	{
	25	unsigned long flags;
	26
	27	if (!xs->tx)
	28	return;
	29
	30	spin_lock_irqsave(&pool->xsk_tx_list_lock, flags);
	31	list_del_rcu(&xs->tx_list);
	32	spin_unlock_irqrestore(&pool->xsk_tx_list_lock, flags);
	33	}
	34
2b43470a BT	35	void xp_destroy(struct xsk_buff_pool *pool)
	36	{
	37	if (!pool)
	38	return;
	39
d1bc532e	40	kvfree(pool->tx_descs);
2b43470a BT	41	kvfree(pool->heads);
	42	kvfree(pool);
	43	}
	44
ba3beec2 MF	45	int xp_alloc_tx_descs(struct xsk_buff_pool pool, struct xdp_sock xs)
	46	{
	47	pool->tx_descs = kvcalloc(xs->tx->nentries, sizeof(*pool->tx_descs),
	48	GFP_KERNEL);
	49	if (!pool->tx_descs)
	50	return -ENOMEM;
	51
	52	return 0;
	53	}
	54
1c1efc2a MK	55	struct xsk_buff_pool xp_create_and_assign_umem(struct xdp_sock xs,
1c1efc2a MK	56	struct xdp_umem *umem)
2b43470a	57	{
94033cd8	58	bool unaligned = umem->flags & XDP_UMEM_UNALIGNED_CHUNK_FLAG;
2b43470a BT	59	struct xsk_buff_pool *pool;
2b43470a BT	60	struct xdp_buff_xsk *xskb;
94033cd8	61	u32 i, entries;
2b43470a	62
94033cd8 MK	63	entries = unaligned ? umem->chunks : 0;
94033cd8 MK	64	pool = kvzalloc(struct_size(pool, free_heads, entries), GFP_KERNEL);
2b43470a BT	65	if (!pool)
	66	goto out;
	67
1c1efc2a	68	pool->heads = kvcalloc(umem->chunks, sizeof(*pool->heads), GFP_KERNEL);
2b43470a BT	69	if (!pool->heads)
	70	goto out;
	71
ba3beec2 MF	72	if (xs->tx)
ba3beec2 MF	73	if (xp_alloc_tx_descs(pool, xs))
d1bc532e	74	goto out;
d1bc532e	75
1c1efc2a MK	76	pool->chunk_mask = ~((u64)umem->chunk_size - 1);
	77	pool->addrs_cnt = umem->size;
	78	pool->heads_cnt = umem->chunks;
	79	pool->free_heads_cnt = umem->chunks;
	80	pool->headroom = umem->headroom;
	81	pool->chunk_size = umem->chunk_size;
94033cd8 MK	82	pool->chunk_shift = ffs(umem->chunk_size) - 1;
94033cd8 MK	83	pool->unaligned = unaligned;
1c1efc2a MK	84	pool->frame_len = umem->chunk_size - umem->headroom -
1c1efc2a MK	85	XDP_PACKET_HEADROOM;
1742b3d5	86	pool->umem = umem;
7f7ffa4e	87	pool->addrs = umem->addrs;
2b43470a	88	INIT_LIST_HEAD(&pool->free_list);
a5aa8e52 MK	89	INIT_LIST_HEAD(&pool->xsk_tx_list);
a5aa8e52 MK	90	spin_lock_init(&pool->xsk_tx_list_lock);
f09ced40	91	spin_lock_init(&pool->cq_lock);
1c1efc2a	92	refcount_set(&pool->users, 1);
2b43470a	93
7361f9c3 MK	94	pool->fq = xs->fq_tmp;
7361f9c3 MK	95	pool->cq = xs->cq_tmp;
7361f9c3	96
2b43470a BT	97	for (i = 0; i < pool->free_heads_cnt; i++) {
	98	xskb = &pool->heads[i];
	99	xskb->pool = pool;
1c1efc2a	100	xskb->xdp.frame_sz = umem->chunk_size - umem->headroom;
5bec7ca2	101	INIT_LIST_HEAD(&xskb->free_list_node);
94033cd8 MK	102	if (pool->unaligned)
	103	pool->free_heads[i] = xskb;
	104	else
	105	xp_init_xskb_addr(xskb, pool, i * pool->chunk_size);
2b43470a BT	106	}
2b43470a BT	107
7f7ffa4e	108	return pool;
2b43470a BT	109
	110	out:
	111	xp_destroy(pool);
	112	return NULL;
	113	}
	114
2b43470a BT	115	void xp_set_rxq_info(struct xsk_buff_pool pool, struct xdp_rxq_info rxq)
	116	{
	117	u32 i;
	118
	119	for (i = 0; i < pool->heads_cnt; i++)
	120	pool->heads[i].xdp.rxq = rxq;
	121	}
	122	EXPORT_SYMBOL(xp_set_rxq_info);
	123
921b6869 MK	124	static void xp_disable_drv_zc(struct xsk_buff_pool *pool)
	125	{
	126	struct netdev_bpf bpf;
	127	int err;
	128
	129	ASSERT_RTNL();
	130
	131	if (pool->umem->zc) {
	132	bpf.command = XDP_SETUP_XSK_POOL;
	133	bpf.xsk.pool = NULL;
	134	bpf.xsk.queue_id = pool->queue_id;
	135
	136	err = pool->netdev->netdev_ops->ndo_bpf(pool->netdev, &bpf);
	137
	138	if (err)
	139	WARN(1, "Failed to disable zero-copy!\n");
	140	}
	141	}
	142
f0863eab BT	143	int xp_assign_dev(struct xsk_buff_pool *pool,
f0863eab BT	144	struct net_device *netdev, u16 queue_id, u16 flags)
1c1efc2a	145	{
1c1efc2a MK	146	bool force_zc, force_copy;
	147	struct netdev_bpf bpf;
	148	int err = 0;
	149
	150	ASSERT_RTNL();
	151
	152	force_zc = flags & XDP_ZEROCOPY;
	153	force_copy = flags & XDP_COPY;
	154
	155	if (force_zc && force_copy)
	156	return -EINVAL;
	157
c2d3d6a4	158	if (xsk_get_pool_from_qid(netdev, queue_id))
1c1efc2a MK	159	return -EBUSY;
1c1efc2a MK	160
921b6869 MK	161	pool->netdev = netdev;
921b6869 MK	162	pool->queue_id = queue_id;
c2d3d6a4	163	err = xsk_reg_pool_at_qid(netdev, pool, queue_id);
1c1efc2a MK	164	if (err)
	165	return err;
	166
e3920818	167	if (flags & XDP_USE_NEED_WAKEUP)
c2d3d6a4	168	pool->uses_need_wakeup = true;
e3920818 BT	169	/* Tx needs to be explicitly woken up the first time. Also
	170	* for supporting drivers that do not implement this
	171	* feature. They will always have to call sendto() or poll().
	172	*/
	173	pool->cached_need_wakeup = XDP_WAKEUP_TX;
1c1efc2a	174
c2d3d6a4 MK	175	dev_hold(netdev);
c2d3d6a4 MK	176
1c1efc2a MK	177	if (force_copy)
	178	/* For copy-mode, we are done. */
	179	return 0;
	180
c2d3d6a4 MK	181	if (!netdev->netdev_ops->ndo_bpf \|\|
c2d3d6a4 MK	182	!netdev->netdev_ops->ndo_xsk_wakeup) {
1c1efc2a MK	183	err = -EOPNOTSUPP;
	184	goto err_unreg_pool;
	185	}
	186
	187	bpf.command = XDP_SETUP_XSK_POOL;
	188	bpf.xsk.pool = pool;
	189	bpf.xsk.queue_id = queue_id;
	190
c2d3d6a4	191	err = netdev->netdev_ops->ndo_bpf(netdev, &bpf);
1c1efc2a MK	192	if (err)
	193	goto err_unreg_pool;
	194
921b6869 MK	195	if (!pool->dma_pages) {
921b6869 MK	196	WARN(1, "Driver did not DMA map zero-copy buffers");
12c8a8ca	197	err = -EINVAL;
921b6869 MK	198	goto err_unreg_xsk;
921b6869 MK	199	}
c2d3d6a4	200	pool->umem->zc = true;
1c1efc2a MK	201	return 0;
1c1efc2a MK	202
921b6869 MK	203	err_unreg_xsk:
921b6869 MK	204	xp_disable_drv_zc(pool);
1c1efc2a MK	205	err_unreg_pool:
	206	if (!force_zc)
	207	err = 0; /* fallback to copy mode */
17864891	208	if (err) {
c2d3d6a4	209	xsk_clear_pool_at_qid(netdev, queue_id);
17864891 MM	210	dev_put(netdev);
17864891 MM	211	}
1c1efc2a MK	212	return err;
	213	}
	214
60240bc2	215	int xp_assign_dev_shared(struct xsk_buff_pool pool, struct xdp_sock umem_xs,
b5aea28d MK	216	struct net_device *dev, u16 queue_id)
	217	{
	218	u16 flags;
60240bc2	219	struct xdp_umem *umem = umem_xs->umem;
b5aea28d MK	220
	221	/* One fill and completion ring required for each queue id. */
	222	if (!pool->fq \|\| !pool->cq)
	223	return -EINVAL;
	224
	225	flags = umem->zc ? XDP_ZEROCOPY : XDP_COPY;
60240bc2	226	if (umem_xs->pool->uses_need_wakeup)
b5aea28d MK	227	flags \|= XDP_USE_NEED_WAKEUP;
b5aea28d MK	228
f0863eab	229	return xp_assign_dev(pool, dev, queue_id, flags);
b5aea28d MK	230	}
b5aea28d MK	231
1c1efc2a MK	232	void xp_clear_dev(struct xsk_buff_pool *pool)
1c1efc2a MK	233	{
c2d3d6a4	234	if (!pool->netdev)
1c1efc2a MK	235	return;
1c1efc2a MK	236
921b6869	237	xp_disable_drv_zc(pool);
c2d3d6a4 MK	238	xsk_clear_pool_at_qid(pool->netdev, pool->queue_id);
	239	dev_put(pool->netdev);
	240	pool->netdev = NULL;
1c1efc2a MK	241	}
	242
	243	static void xp_release_deferred(struct work_struct *work)
	244	{
	245	struct xsk_buff_pool *pool = container_of(work, struct xsk_buff_pool,
	246	work);
	247
	248	rtnl_lock();
	249	xp_clear_dev(pool);
	250	rtnl_unlock();
	251
7361f9c3 MK	252	if (pool->fq) {
	253	xskq_destroy(pool->fq);
	254	pool->fq = NULL;
	255	}
	256
	257	if (pool->cq) {
	258	xskq_destroy(pool->cq);
	259	pool->cq = NULL;
	260	}
	261
537cf4e3	262	xdp_put_umem(pool->umem, false);
1c1efc2a MK	263	xp_destroy(pool);
	264	}
	265
	266	void xp_get_pool(struct xsk_buff_pool *pool)
	267	{
	268	refcount_inc(&pool->users);
	269	}
	270
e5e1a4bc	271	bool xp_put_pool(struct xsk_buff_pool *pool)
1c1efc2a MK	272	{
1c1efc2a MK	273	if (!pool)
e5e1a4bc	274	return false;
1c1efc2a MK	275
	276	if (refcount_dec_and_test(&pool->users)) {
	277	INIT_WORK(&pool->work, xp_release_deferred);
	278	schedule_work(&pool->work);
e5e1a4bc	279	return true;
1c1efc2a	280	}
e5e1a4bc MK	281
e5e1a4bc MK	282	return false;
1c1efc2a MK	283	}
1c1efc2a MK	284
921b6869 MK	285	static struct xsk_dma_map xp_find_dma_map(struct xsk_buff_pool pool)
	286	{
	287	struct xsk_dma_map *dma_map;
	288
	289	list_for_each_entry(dma_map, &pool->umem->xsk_dma_list, list) {
	290	if (dma_map->netdev == pool->netdev)
	291	return dma_map;
	292	}
	293
	294	return NULL;
	295	}
	296
	297	static struct xsk_dma_map xp_create_dma_map(struct device dev, struct net_device *netdev,
	298	u32 nr_pages, struct xdp_umem *umem)
	299	{
	300	struct xsk_dma_map *dma_map;
	301
	302	dma_map = kzalloc(sizeof(*dma_map), GFP_KERNEL);
	303	if (!dma_map)
	304	return NULL;
	305
	306	dma_map->dma_pages = kvcalloc(nr_pages, sizeof(*dma_map->dma_pages), GFP_KERNEL);
1d6fd78a	307	if (!dma_map->dma_pages) {
921b6869 MK	308	kfree(dma_map);
	309	return NULL;
	310	}
	311
	312	dma_map->netdev = netdev;
	313	dma_map->dev = dev;
	314	dma_map->dma_need_sync = false;
	315	dma_map->dma_pages_cnt = nr_pages;
bf74a370	316	refcount_set(&dma_map->users, 1);
921b6869 MK	317	list_add(&dma_map->list, &umem->xsk_dma_list);
	318	return dma_map;
	319	}
	320
	321	static void xp_destroy_dma_map(struct xsk_dma_map *dma_map)
	322	{
	323	list_del(&dma_map->list);
	324	kvfree(dma_map->dma_pages);
	325	kfree(dma_map);
	326	}
	327
	328	static void __xp_dma_unmap(struct xsk_dma_map *dma_map, unsigned long attrs)
2b43470a BT	329	{
	330	dma_addr_t *dma;
	331	u32 i;
	332
921b6869 MK	333	for (i = 0; i < dma_map->dma_pages_cnt; i++) {
921b6869 MK	334	dma = &dma_map->dma_pages[i];
2b43470a	335	if (*dma) {
512d1999	336	*dma &= ~XSK_NEXT_PG_CONTIG_MASK;
921b6869	337	dma_unmap_page_attrs(dma_map->dev, *dma, PAGE_SIZE,
2b43470a BT	338	DMA_BIDIRECTIONAL, attrs);
	339	*dma = 0;
	340	}
	341	}
	342
921b6869 MK	343	xp_destroy_dma_map(dma_map);
	344	}
	345
	346	void xp_dma_unmap(struct xsk_buff_pool *pool, unsigned long attrs)
	347	{
	348	struct xsk_dma_map *dma_map;
	349
	350	if (pool->dma_pages_cnt == 0)
	351	return;
	352
	353	dma_map = xp_find_dma_map(pool);
	354	if (!dma_map) {
	355	WARN(1, "Could not find dma_map for device");
	356	return;
	357	}
	358
	359	if (!refcount_dec_and_test(&dma_map->users))
	360	return;
	361
	362	__xp_dma_unmap(dma_map, attrs);
2b43470a BT	363	kvfree(pool->dma_pages);
	364	pool->dma_pages_cnt = 0;
	365	pool->dev = NULL;
	366	}
	367	EXPORT_SYMBOL(xp_dma_unmap);
	368
921b6869	369	static void xp_check_dma_contiguity(struct xsk_dma_map *dma_map)
2b43470a BT	370	{
	371	u32 i;
	372
921b6869 MK	373	for (i = 0; i < dma_map->dma_pages_cnt - 1; i++) {
	374	if (dma_map->dma_pages[i] + PAGE_SIZE == dma_map->dma_pages[i + 1])
	375	dma_map->dma_pages[i] \|= XSK_NEXT_PG_CONTIG_MASK;
2b43470a	376	else
921b6869	377	dma_map->dma_pages[i] &= ~XSK_NEXT_PG_CONTIG_MASK;
2b43470a BT	378	}
	379	}
	380
921b6869 MK	381	static int xp_init_dma_info(struct xsk_buff_pool pool, struct xsk_dma_map dma_map)
921b6869 MK	382	{
58ca14ed MK	383	if (!pool->unaligned) {
	384	u32 i;
	385
	386	for (i = 0; i < pool->heads_cnt; i++) {
	387	struct xdp_buff_xsk *xskb = &pool->heads[i];
	388
	389	xp_init_xskb_dma(xskb, pool, dma_map->dma_pages, xskb->orig_addr);
	390	}
	391	}
	392
921b6869 MK	393	pool->dma_pages = kvcalloc(dma_map->dma_pages_cnt, sizeof(*pool->dma_pages), GFP_KERNEL);
	394	if (!pool->dma_pages)
	395	return -ENOMEM;
	396
	397	pool->dev = dma_map->dev;
	398	pool->dma_pages_cnt = dma_map->dma_pages_cnt;
	399	pool->dma_need_sync = dma_map->dma_need_sync;
921b6869 MK	400	memcpy(pool->dma_pages, dma_map->dma_pages,
	401	pool->dma_pages_cnt * sizeof(*pool->dma_pages));
	402
	403	return 0;
	404	}
	405
2b43470a BT	406	int xp_dma_map(struct xsk_buff_pool pool, struct device dev,
	407	unsigned long attrs, struct page **pages, u32 nr_pages)
	408	{
921b6869	409	struct xsk_dma_map *dma_map;
2b43470a	410	dma_addr_t dma;
921b6869	411	int err;
2b43470a BT	412	u32 i;
2b43470a BT	413
921b6869 MK	414	dma_map = xp_find_dma_map(pool);
	415	if (dma_map) {
	416	err = xp_init_dma_info(pool, dma_map);
	417	if (err)
	418	return err;
2b43470a	419
bf74a370	420	refcount_inc(&dma_map->users);
921b6869 MK	421	return 0;
921b6869 MK	422	}
2b43470a	423
921b6869 MK	424	dma_map = xp_create_dma_map(dev, pool->netdev, nr_pages, pool->umem);
	425	if (!dma_map)
	426	return -ENOMEM;
	427
	428	for (i = 0; i < dma_map->dma_pages_cnt; i++) {
2b43470a BT	429	dma = dma_map_page_attrs(dev, pages[i], 0, PAGE_SIZE,
	430	DMA_BIDIRECTIONAL, attrs);
	431	if (dma_mapping_error(dev, dma)) {
921b6869	432	__xp_dma_unmap(dma_map, attrs);
2b43470a BT	433	return -ENOMEM;
2b43470a BT	434	}
7e024575	435	if (dma_need_sync(dev, dma))
921b6869 MK	436	dma_map->dma_need_sync = true;
921b6869 MK	437	dma_map->dma_pages[i] = dma;
2b43470a BT	438	}
	439
	440	if (pool->unaligned)
921b6869 MK	441	xp_check_dma_contiguity(dma_map);
	442
	443	err = xp_init_dma_info(pool, dma_map);
	444	if (err) {
	445	__xp_dma_unmap(dma_map, attrs);
	446	return err;
	447	}
	448
2b43470a BT	449	return 0;
	450	}
	451	EXPORT_SYMBOL(xp_dma_map);
	452
2b43470a BT	453	static bool xp_addr_crosses_non_contig_pg(struct xsk_buff_pool *pool,
	454	u64 addr)
	455	{
	456	return xp_desc_crosses_non_contig_pg(pool, addr, pool->chunk_size);
	457	}
	458
2b43470a BT	459	static bool xp_check_unaligned(struct xsk_buff_pool pool, u64 addr)
	460	{
	461	addr = xp_unaligned_extract_addr(addr);
	462	if (*addr >= pool->addrs_cnt \|\|
	463	*addr + pool->chunk_size > pool->addrs_cnt \|\|
	464	xp_addr_crosses_non_contig_pg(pool, *addr))
	465	return false;
	466	return true;
	467	}
	468
	469	static bool xp_check_aligned(struct xsk_buff_pool pool, u64 addr)
	470	{
	471	addr = xp_aligned_extract_addr(pool, addr);
	472	return *addr < pool->addrs_cnt;
	473	}
	474
	475	static struct xdp_buff_xsk __xp_alloc(struct xsk_buff_pool pool)
	476	{
	477	struct xdp_buff_xsk *xskb;
	478	u64 addr;
	479	bool ok;
	480
	481	if (pool->free_heads_cnt == 0)
	482	return NULL;
	483
2b43470a BT	484	for (;;) {
2b43470a BT	485	if (!xskq_cons_peek_addr_unchecked(pool->fq, &addr)) {
8aa5a335	486	pool->fq->queue_empty_descs++;
2b43470a BT	487	return NULL;
	488	}
	489
	490	ok = pool->unaligned ? xp_check_unaligned(pool, &addr) :
	491	xp_check_aligned(pool, &addr);
	492	if (!ok) {
	493	pool->fq->invalid_descs++;
	494	xskq_cons_release(pool->fq);
	495	continue;
	496	}
	497	break;
	498	}
2b43470a	499
94033cd8 MK	500	if (pool->unaligned) {
	501	xskb = pool->free_heads[--pool->free_heads_cnt];
	502	xp_init_xskb_addr(xskb, pool, addr);
	503	if (pool->dma_pages_cnt)
	504	xp_init_xskb_dma(xskb, pool, pool->dma_pages, addr);
	505	} else {
	506	xskb = &pool->heads[xp_aligned_extract_idx(pool, addr)];
2b43470a	507	}
94033cd8 MK	508
94033cd8 MK	509	xskq_cons_release(pool->fq);
2b43470a BT	510	return xskb;
	511	}
	512
	513	struct xdp_buff xp_alloc(struct xsk_buff_pool pool)
	514	{
	515	struct xdp_buff_xsk *xskb;
	516
	517	if (!pool->free_list_cnt) {
	518	xskb = __xp_alloc(pool);
	519	if (!xskb)
	520	return NULL;
	521	} else {
	522	pool->free_list_cnt--;
	523	xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk,
	524	free_list_node);
199d983b	525	list_del_init(&xskb->free_list_node);
2b43470a BT	526	}
	527
	528	xskb->xdp.data = xskb->xdp.data_hard_start + XDP_PACKET_HEADROOM;
	529	xskb->xdp.data_meta = xskb->xdp.data;
	530
91d5b702	531	if (pool->dma_need_sync) {
2b43470a BT	532	dma_sync_single_range_for_device(pool->dev, xskb->dma, 0,
	533	pool->frame_len,
	534	DMA_BIDIRECTIONAL);
	535	}
	536	return &xskb->xdp;
	537	}
	538	EXPORT_SYMBOL(xp_alloc);
	539
47e4075d MK	540	static u32 xp_alloc_new_from_fq(struct xsk_buff_pool pool, struct xdp_buff *xdp, u32 max)
	541	{
	542	u32 i, cached_cons, nb_entries;
	543
	544	if (max > pool->free_heads_cnt)
	545	max = pool->free_heads_cnt;
	546	max = xskq_cons_nb_entries(pool->fq, max);
	547
	548	cached_cons = pool->fq->cached_cons;
	549	nb_entries = max;
	550	i = max;
	551	while (i--) {
	552	struct xdp_buff_xsk *xskb;
	553	u64 addr;
	554	bool ok;
	555
	556	__xskq_cons_read_addr_unchecked(pool->fq, cached_cons++, &addr);
	557
	558	ok = pool->unaligned ? xp_check_unaligned(pool, &addr) :
	559	xp_check_aligned(pool, &addr);
	560	if (unlikely(!ok)) {
	561	pool->fq->invalid_descs++;
	562	nb_entries--;
	563	continue;
	564	}
	565
94033cd8 MK	566	if (pool->unaligned) {
	567	xskb = pool->free_heads[--pool->free_heads_cnt];
	568	xp_init_xskb_addr(xskb, pool, addr);
	569	if (pool->dma_pages_cnt)
	570	xp_init_xskb_dma(xskb, pool, pool->dma_pages, addr);
	571	} else {
	572	xskb = &pool->heads[xp_aligned_extract_idx(pool, addr)];
	573	}
	574
47e4075d	575	*xdp = &xskb->xdp;
47e4075d MK	576	xdp++;
	577	}
	578
	579	xskq_cons_release_n(pool->fq, max);
	580	return nb_entries;
	581	}
	582
	583	static u32 xp_alloc_reused(struct xsk_buff_pool pool, struct xdp_buff *xdp, u32 nb_entries)
	584	{
	585	struct xdp_buff_xsk *xskb;
	586	u32 i;
	587
	588	nb_entries = min_t(u32, nb_entries, pool->free_list_cnt);
	589
	590	i = nb_entries;
	591	while (i--) {
	592	xskb = list_first_entry(&pool->free_list, struct xdp_buff_xsk, free_list_node);
199d983b	593	list_del_init(&xskb->free_list_node);
47e4075d MK	594
	595	*xdp = &xskb->xdp;
	596	xdp++;
	597	}
	598	pool->free_list_cnt -= nb_entries;
	599
	600	return nb_entries;
	601	}
	602
	603	u32 xp_alloc_batch(struct xsk_buff_pool pool, struct xdp_buff *xdp, u32 max)
	604	{
	605	u32 nb_entries1 = 0, nb_entries2;
	606
	607	if (unlikely(pool->dma_need_sync)) {
a95a4d9b MK	608	struct xdp_buff *buff;
a95a4d9b MK	609
47e4075d	610	/* Slow path */
a95a4d9b MK	611	buff = xp_alloc(pool);
	612	if (buff)
	613	*xdp = buff;
	614	return !!buff;
47e4075d MK	615	}
	616
	617	if (unlikely(pool->free_list_cnt)) {
	618	nb_entries1 = xp_alloc_reused(pool, xdp, max);
	619	if (nb_entries1 == max)
	620	return nb_entries1;
	621
	622	max -= nb_entries1;
	623	xdp += nb_entries1;
	624	}
	625
	626	nb_entries2 = xp_alloc_new_from_fq(pool, xdp, max);
	627	if (!nb_entries2)
	628	pool->fq->queue_empty_descs++;
	629
	630	return nb_entries1 + nb_entries2;
	631	}
	632	EXPORT_SYMBOL(xp_alloc_batch);
	633
2b43470a BT	634	bool xp_can_alloc(struct xsk_buff_pool *pool, u32 count)
	635	{
	636	if (pool->free_list_cnt >= count)
	637	return true;
	638	return xskq_cons_has_entries(pool->fq, count - pool->free_list_cnt);
	639	}
	640	EXPORT_SYMBOL(xp_can_alloc);
	641
	642	void xp_free(struct xdp_buff_xsk *xskb)
	643	{
199d983b MK	644	if (!list_empty(&xskb->free_list_node))
	645	return;
	646
2b43470a BT	647	xskb->pool->free_list_cnt++;
	648	list_add(&xskb->free_list_node, &xskb->pool->free_list);
	649	}
	650	EXPORT_SYMBOL(xp_free);
	651
2b43470a BT	652	void xp_raw_get_data(struct xsk_buff_pool pool, u64 addr)
	653	{
	654	addr = pool->unaligned ? xp_unaligned_add_offset_to_addr(addr) : addr;
	655	return pool->addrs + addr;
	656	}
	657	EXPORT_SYMBOL(xp_raw_get_data);
	658
	659	dma_addr_t xp_raw_get_dma(struct xsk_buff_pool *pool, u64 addr)
	660	{
	661	addr = pool->unaligned ? xp_unaligned_add_offset_to_addr(addr) : addr;
	662	return (pool->dma_pages[addr >> PAGE_SHIFT] &
	663	~XSK_NEXT_PG_CONTIG_MASK) +
	664	(addr & ~PAGE_MASK);
	665	}
	666	EXPORT_SYMBOL(xp_raw_get_dma);
	667
26062b18	668	void xp_dma_sync_for_cpu_slow(struct xdp_buff_xsk *xskb)
2b43470a	669	{
2b43470a BT	670	dma_sync_single_range_for_cpu(xskb->pool->dev, xskb->dma, 0,
	671	xskb->pool->frame_len, DMA_BIDIRECTIONAL);
	672	}
26062b18	673	EXPORT_SYMBOL(xp_dma_sync_for_cpu_slow);
2b43470a	674
26062b18 BT	675	void xp_dma_sync_for_device_slow(struct xsk_buff_pool *pool, dma_addr_t dma,
26062b18 BT	676	size_t size)
2b43470a	677	{
2b43470a BT	678	dma_sync_single_range_for_device(pool->dev, dma, 0,
	679	size, DMA_BIDIRECTIONAL);
	680	}
26062b18	681	EXPORT_SYMBOL(xp_dma_sync_for_device_slow);