xdp_sock.h 4.67 KB
Newer Older
Björn Töpel's avatar
Björn Töpel committed
1 2
/* SPDX-License-Identifier: GPL-2.0 */
/* AF_XDP internal functions
3 4 5 6 7 8
 * Copyright(c) 2018 Intel Corporation.
 */

#ifndef _LINUX_XDP_SOCK_H
#define _LINUX_XDP_SOCK_H

9 10
#include <linux/workqueue.h>
#include <linux/if_xdp.h>
11
#include <linux/mutex.h>
12
#include <linux/spinlock.h>
13
#include <linux/mm.h>
14 15
#include <net/sock.h>

16 17
struct net_device;
struct xsk_queue;
18

19 20
struct xdp_umem_page {
	void *addr;
21
	dma_addr_t dma;
22 23
};

24 25 26 27 28 29
struct xdp_umem_fq_reuse {
	u32 nentries;
	u32 length;
	u64 handles[];
};

30 31 32
struct xdp_umem {
	struct xsk_queue *fq;
	struct xsk_queue *cq;
33
	struct xdp_umem_page *pages;
34 35
	u64 chunk_mask;
	u64 size;
36 37 38 39 40 41 42
	u32 headroom;
	u32 chunk_size_nohr;
	struct user_struct *user;
	struct pid *pid;
	unsigned long address;
	refcount_t users;
	struct work_struct work;
43
	struct page **pgs;
44
	u32 npgs;
45
	struct net_device *dev;
46
	struct xdp_umem_fq_reuse *fq_reuse;
47 48
	u16 queue_id;
	bool zc;
49 50
	spinlock_t xsk_list_lock;
	struct list_head xsk_list;
51
};
52 53 54 55

struct xdp_sock {
	/* struct sock must be the first member of struct xdp_sock */
	struct sock sk;
56 57
	struct xsk_queue *rx;
	struct net_device *dev;
58
	struct xdp_umem *umem;
59
	struct list_head flush_node;
60
	u16 queue_id;
61
	struct xsk_queue *tx ____cacheline_aligned_in_smp;
62 63
	struct list_head list;
	bool zc;
64 65
	/* Protects multiple processes in the control path */
	struct mutex mutex;
66 67 68 69
	/* Mutual exclusion of NAPI TX thread and sendmsg error paths
	 * in the SKB destructor callback.
	 */
	spinlock_t tx_completion_lock;
70
	u64 rx_dropped;
71 72
};

73 74 75 76 77
struct xdp_buff;
#ifdef CONFIG_XDP_SOCKETS
int xsk_generic_rcv(struct xdp_sock *xs, struct xdp_buff *xdp);
int xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp);
void xsk_flush(struct xdp_sock *xs);
78
bool xsk_is_setup_for_bpf_map(struct xdp_sock *xs);
79
/* Used from netdev driver */
80 81
u64 *xsk_umem_peek_addr(struct xdp_umem *umem, u64 *addr);
void xsk_umem_discard_addr(struct xdp_umem *umem);
82 83 84
void xsk_umem_complete_tx(struct xdp_umem *umem, u32 nb_entries);
bool xsk_umem_consume_tx(struct xdp_umem *umem, dma_addr_t *dma, u32 *len);
void xsk_umem_consume_tx_done(struct xdp_umem *umem);
85 86 87 88
struct xdp_umem_fq_reuse *xsk_reuseq_prepare(u32 nentries);
struct xdp_umem_fq_reuse *xsk_reuseq_swap(struct xdp_umem *umem,
					  struct xdp_umem_fq_reuse *newq);
void xsk_reuseq_free(struct xdp_umem_fq_reuse *rq);
89 90 91 92 93 94 95 96 97 98

static inline char *xdp_umem_get_data(struct xdp_umem *umem, u64 addr)
{
	return umem->pages[addr >> PAGE_SHIFT].addr + (addr & (PAGE_SIZE - 1));
}

static inline dma_addr_t xdp_umem_get_dma(struct xdp_umem *umem, u64 addr)
{
	return umem->pages[addr >> PAGE_SHIFT].dma + (addr & (PAGE_SIZE - 1));
}
99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127

/* Reuse-queue aware version of FILL queue helpers */
static inline u64 *xsk_umem_peek_addr_rq(struct xdp_umem *umem, u64 *addr)
{
	struct xdp_umem_fq_reuse *rq = umem->fq_reuse;

	if (!rq->length)
		return xsk_umem_peek_addr(umem, addr);

	*addr = rq->handles[rq->length - 1];
	return addr;
}

static inline void xsk_umem_discard_addr_rq(struct xdp_umem *umem)
{
	struct xdp_umem_fq_reuse *rq = umem->fq_reuse;

	if (!rq->length)
		xsk_umem_discard_addr(umem);
	else
		rq->length--;
}

static inline void xsk_umem_fq_reuse(struct xdp_umem *umem, u64 addr)
{
	struct xdp_umem_fq_reuse *rq = umem->fq_reuse;

	rq->handles[rq->length++] = addr;
}
128 129 130 131 132 133 134 135 136 137 138 139 140 141
#else
static inline int xsk_generic_rcv(struct xdp_sock *xs, struct xdp_buff *xdp)
{
	return -ENOTSUPP;
}

static inline int xsk_rcv(struct xdp_sock *xs, struct xdp_buff *xdp)
{
	return -ENOTSUPP;
}

static inline void xsk_flush(struct xdp_sock *xs)
{
}
142 143 144 145 146

static inline bool xsk_is_setup_for_bpf_map(struct xdp_sock *xs)
{
	return false;
}
147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170

static inline u64 *xsk_umem_peek_addr(struct xdp_umem *umem, u64 *addr)
{
	return NULL;
}

static inline void xsk_umem_discard_addr(struct xdp_umem *umem)
{
}

static inline void xsk_umem_complete_tx(struct xdp_umem *umem, u32 nb_entries)
{
}

static inline bool xsk_umem_consume_tx(struct xdp_umem *umem, dma_addr_t *dma,
				       u32 *len)
{
	return false;
}

static inline void xsk_umem_consume_tx_done(struct xdp_umem *umem)
{
}

171 172 173 174 175 176 177 178 179 180 181 182 183 184 185
static inline struct xdp_umem_fq_reuse *xsk_reuseq_prepare(u32 nentries)
{
	return NULL;
}

static inline struct xdp_umem_fq_reuse *xsk_reuseq_swap(
	struct xdp_umem *umem,
	struct xdp_umem_fq_reuse *newq)
{
	return NULL;
}
static inline void xsk_reuseq_free(struct xdp_umem_fq_reuse *rq)
{
}

186 187 188 189 190 191 192 193 194
static inline char *xdp_umem_get_data(struct xdp_umem *umem, u64 addr)
{
	return NULL;
}

static inline dma_addr_t xdp_umem_get_dma(struct xdp_umem *umem, u64 addr)
{
	return 0;
}
195 196 197 198 199 200 201 202 203 204 205 206 207 208

static inline u64 *xsk_umem_peek_addr_rq(struct xdp_umem *umem, u64 *addr)
{
	return NULL;
}

static inline void xsk_umem_discard_addr_rq(struct xdp_umem *umem)
{
}

static inline void xsk_umem_fq_reuse(struct xdp_umem *umem, u64 addr)
{
}

209 210
#endif /* CONFIG_XDP_SOCKETS */

211
#endif /* _LINUX_XDP_SOCK_H */