blob: 8b2cb79b5de0e0ebf32a5c23916a79b00a1b48c9 [file] [log] [blame]
Jesper Dangaard Broueraecd67b2018-01-03 11:25:13 +01001/* net/core/xdp.c
2 *
3 * Copyright (c) 2017 Jesper Dangaard Brouer, Red Hat Inc.
4 * Released under terms in GPL version 2. See COPYING.
5 */
6#include <linux/types.h>
7#include <linux/mm.h>
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +02008#include <linux/slab.h>
9#include <linux/idr.h>
10#include <linux/rhashtable.h>
Jesper Dangaard Broueraecd67b2018-01-03 11:25:13 +010011
12#include <net/xdp.h>
13
14#define REG_STATE_NEW 0x0
15#define REG_STATE_REGISTERED 0x1
16#define REG_STATE_UNREGISTERED 0x2
17#define REG_STATE_UNUSED 0x3
18
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +020019static DEFINE_IDA(mem_id_pool);
20static DEFINE_MUTEX(mem_id_lock);
21#define MEM_ID_MAX 0xFFFE
22#define MEM_ID_MIN 1
23static int mem_id_next = MEM_ID_MIN;
24
25static bool mem_id_init; /* false */
26static struct rhashtable *mem_id_ht;
27
28struct xdp_mem_allocator {
29 struct xdp_mem_info mem;
30 void *allocator;
31 struct rhash_head node;
32 struct rcu_head rcu;
33};
34
35static u32 xdp_mem_id_hashfn(const void *data, u32 len, u32 seed)
36{
37 const u32 *k = data;
38 const u32 key = *k;
39
40 BUILD_BUG_ON(FIELD_SIZEOF(struct xdp_mem_allocator, mem.id)
41 != sizeof(u32));
42
43 /* Use cyclic increasing ID as direct hash key, see rht_bucket_index */
44 return key << RHT_HASH_RESERVED_SPACE;
45}
46
47static int xdp_mem_id_cmp(struct rhashtable_compare_arg *arg,
48 const void *ptr)
49{
50 const struct xdp_mem_allocator *xa = ptr;
51 u32 mem_id = *(u32 *)arg->key;
52
53 return xa->mem.id != mem_id;
54}
55
56static const struct rhashtable_params mem_id_rht_params = {
57 .nelem_hint = 64,
58 .head_offset = offsetof(struct xdp_mem_allocator, node),
59 .key_offset = offsetof(struct xdp_mem_allocator, mem.id),
60 .key_len = FIELD_SIZEOF(struct xdp_mem_allocator, mem.id),
61 .max_size = MEM_ID_MAX,
62 .min_size = 8,
63 .automatic_shrinking = true,
64 .hashfn = xdp_mem_id_hashfn,
65 .obj_cmpfn = xdp_mem_id_cmp,
66};
67
68static void __xdp_mem_allocator_rcu_free(struct rcu_head *rcu)
69{
70 struct xdp_mem_allocator *xa;
71
72 xa = container_of(rcu, struct xdp_mem_allocator, rcu);
73
74 /* Allow this ID to be reused */
75 ida_simple_remove(&mem_id_pool, xa->mem.id);
76
77 /* TODO: Depending on allocator type/pointer free resources */
78
79 /* Poison memory */
80 xa->mem.id = 0xFFFF;
81 xa->mem.type = 0xF0F0;
82 xa->allocator = (void *)0xDEAD9001;
83
84 kfree(xa);
85}
86
87static void __xdp_rxq_info_unreg_mem_model(struct xdp_rxq_info *xdp_rxq)
88{
89 struct xdp_mem_allocator *xa;
90 int id = xdp_rxq->mem.id;
91 int err;
92
93 if (id == 0)
94 return;
95
96 mutex_lock(&mem_id_lock);
97
98 xa = rhashtable_lookup(mem_id_ht, &id, mem_id_rht_params);
99 if (!xa) {
100 mutex_unlock(&mem_id_lock);
101 return;
102 }
103
104 err = rhashtable_remove_fast(mem_id_ht, &xa->node, mem_id_rht_params);
105 WARN_ON(err);
106
107 call_rcu(&xa->rcu, __xdp_mem_allocator_rcu_free);
108
109 mutex_unlock(&mem_id_lock);
110}
111
Jesper Dangaard Broueraecd67b2018-01-03 11:25:13 +0100112void xdp_rxq_info_unreg(struct xdp_rxq_info *xdp_rxq)
113{
114 /* Simplify driver cleanup code paths, allow unreg "unused" */
115 if (xdp_rxq->reg_state == REG_STATE_UNUSED)
116 return;
117
118 WARN(!(xdp_rxq->reg_state == REG_STATE_REGISTERED), "Driver BUG");
119
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +0200120 __xdp_rxq_info_unreg_mem_model(xdp_rxq);
121
Jesper Dangaard Broueraecd67b2018-01-03 11:25:13 +0100122 xdp_rxq->reg_state = REG_STATE_UNREGISTERED;
123 xdp_rxq->dev = NULL;
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +0200124
125 /* Reset mem info to defaults */
126 xdp_rxq->mem.id = 0;
127 xdp_rxq->mem.type = 0;
Jesper Dangaard Broueraecd67b2018-01-03 11:25:13 +0100128}
129EXPORT_SYMBOL_GPL(xdp_rxq_info_unreg);
130
131static void xdp_rxq_info_init(struct xdp_rxq_info *xdp_rxq)
132{
133 memset(xdp_rxq, 0, sizeof(*xdp_rxq));
134}
135
136/* Returns 0 on success, negative on failure */
137int xdp_rxq_info_reg(struct xdp_rxq_info *xdp_rxq,
138 struct net_device *dev, u32 queue_index)
139{
140 if (xdp_rxq->reg_state == REG_STATE_UNUSED) {
141 WARN(1, "Driver promised not to register this");
142 return -EINVAL;
143 }
144
145 if (xdp_rxq->reg_state == REG_STATE_REGISTERED) {
146 WARN(1, "Missing unregister, handled but fix driver");
147 xdp_rxq_info_unreg(xdp_rxq);
148 }
149
150 if (!dev) {
151 WARN(1, "Missing net_device from driver");
152 return -ENODEV;
153 }
154
155 /* State either UNREGISTERED or NEW */
156 xdp_rxq_info_init(xdp_rxq);
157 xdp_rxq->dev = dev;
158 xdp_rxq->queue_index = queue_index;
159
160 xdp_rxq->reg_state = REG_STATE_REGISTERED;
161 return 0;
162}
163EXPORT_SYMBOL_GPL(xdp_rxq_info_reg);
164
165void xdp_rxq_info_unused(struct xdp_rxq_info *xdp_rxq)
166{
167 xdp_rxq->reg_state = REG_STATE_UNUSED;
168}
169EXPORT_SYMBOL_GPL(xdp_rxq_info_unused);
Jesper Dangaard Brouerc0124f32018-01-03 11:25:34 +0100170
171bool xdp_rxq_info_is_reg(struct xdp_rxq_info *xdp_rxq)
172{
173 return (xdp_rxq->reg_state == REG_STATE_REGISTERED);
174}
175EXPORT_SYMBOL_GPL(xdp_rxq_info_is_reg);
Jesper Dangaard Brouer5ab073f2018-04-17 16:45:26 +0200176
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +0200177static int __mem_id_init_hash_table(void)
178{
179 struct rhashtable *rht;
180 int ret;
181
182 if (unlikely(mem_id_init))
183 return 0;
184
185 rht = kzalloc(sizeof(*rht), GFP_KERNEL);
186 if (!rht)
187 return -ENOMEM;
188
189 ret = rhashtable_init(rht, &mem_id_rht_params);
190 if (ret < 0) {
191 kfree(rht);
192 return ret;
193 }
194 mem_id_ht = rht;
195 smp_mb(); /* mutex lock should provide enough pairing */
196 mem_id_init = true;
197
198 return 0;
199}
200
201/* Allocate a cyclic ID that maps to allocator pointer.
202 * See: https://www.kernel.org/doc/html/latest/core-api/idr.html
203 *
204 * Caller must lock mem_id_lock.
205 */
206static int __mem_id_cyclic_get(gfp_t gfp)
207{
208 int retries = 1;
209 int id;
210
211again:
212 id = ida_simple_get(&mem_id_pool, mem_id_next, MEM_ID_MAX, gfp);
213 if (id < 0) {
214 if (id == -ENOSPC) {
215 /* Cyclic allocator, reset next id */
216 if (retries--) {
217 mem_id_next = MEM_ID_MIN;
218 goto again;
219 }
220 }
221 return id; /* errno */
222 }
223 mem_id_next = id + 1;
224
225 return id;
226}
227
Jesper Dangaard Brouer5ab073f2018-04-17 16:45:26 +0200228int xdp_rxq_info_reg_mem_model(struct xdp_rxq_info *xdp_rxq,
229 enum xdp_mem_type type, void *allocator)
230{
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +0200231 struct xdp_mem_allocator *xdp_alloc;
232 gfp_t gfp = GFP_KERNEL;
233 int id, errno, ret;
234 void *ptr;
235
236 if (xdp_rxq->reg_state != REG_STATE_REGISTERED) {
237 WARN(1, "Missing register, driver bug");
238 return -EFAULT;
239 }
240
Jesper Dangaard Brouer5ab073f2018-04-17 16:45:26 +0200241 if (type >= MEM_TYPE_MAX)
242 return -EINVAL;
243
244 xdp_rxq->mem.type = type;
245
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +0200246 if (!allocator)
247 return 0;
Jesper Dangaard Brouer5ab073f2018-04-17 16:45:26 +0200248
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +0200249 /* Delay init of rhashtable to save memory if feature isn't used */
250 if (!mem_id_init) {
251 mutex_lock(&mem_id_lock);
252 ret = __mem_id_init_hash_table();
253 mutex_unlock(&mem_id_lock);
254 if (ret < 0) {
255 WARN_ON(1);
256 return ret;
257 }
258 }
259
260 xdp_alloc = kzalloc(sizeof(*xdp_alloc), gfp);
261 if (!xdp_alloc)
262 return -ENOMEM;
263
264 mutex_lock(&mem_id_lock);
265 id = __mem_id_cyclic_get(gfp);
266 if (id < 0) {
267 errno = id;
268 goto err;
269 }
270 xdp_rxq->mem.id = id;
271 xdp_alloc->mem = xdp_rxq->mem;
272 xdp_alloc->allocator = allocator;
273
274 /* Insert allocator into ID lookup table */
275 ptr = rhashtable_insert_slow(mem_id_ht, &id, &xdp_alloc->node);
276 if (IS_ERR(ptr)) {
277 errno = PTR_ERR(ptr);
278 goto err;
279 }
280
281 mutex_unlock(&mem_id_lock);
282
Jesper Dangaard Brouer5ab073f2018-04-17 16:45:26 +0200283 return 0;
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +0200284err:
285 mutex_unlock(&mem_id_lock);
286 kfree(xdp_alloc);
287 return errno;
Jesper Dangaard Brouer5ab073f2018-04-17 16:45:26 +0200288}
289EXPORT_SYMBOL_GPL(xdp_rxq_info_reg_mem_model);
Jesper Dangaard Brouer8d5d8852018-04-17 16:46:12 +0200290
291void xdp_return_frame(void *data, struct xdp_mem_info *mem)
292{
293 if (mem->type == MEM_TYPE_PAGE_SHARED) {
294 page_frag_free(data);
295 return;
296 }
297
298 if (mem->type == MEM_TYPE_PAGE_ORDER0) {
299 struct page *page = virt_to_page(data); /* Assumes order0 page*/
300
301 put_page(page);
302 }
303}
304EXPORT_SYMBOL_GPL(xdp_return_frame);