xdp_umem.c 8.5 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13
// SPDX-License-Identifier: GPL-2.0
/* XDP user-space packet buffer
 * Copyright(c) 2018 Intel Corporation.
 */

#include <linux/init.h>
#include <linux/sched/mm.h>
#include <linux/sched/signal.h>
#include <linux/sched/task.h>
#include <linux/uaccess.h>
#include <linux/slab.h>
#include <linux/bpf.h>
#include <linux/mm.h>
14 15
#include <linux/netdevice.h>
#include <linux/rtnetlink.h>
B
Björn Töpel 已提交
16
#include <linux/idr.h>
17
#include <linux/highmem.h>
18 19

#include "xdp_umem.h"
20
#include "xsk_queue.h"
21

22
#define XDP_UMEM_MIN_CHUNK_SIZE 2048
23

B
Björn Töpel 已提交
24 25
static DEFINE_IDA(umem_ida);

26 27 28 29 30 31 32 33 34 35 36 37 38
void xdp_add_sk_umem(struct xdp_umem *umem, struct xdp_sock *xs)
{
	unsigned long flags;

	spin_lock_irqsave(&umem->xsk_list_lock, flags);
	list_add_rcu(&xs->list, &umem->xsk_list);
	spin_unlock_irqrestore(&umem->xsk_list_lock, flags);
}

void xdp_del_sk_umem(struct xdp_umem *umem, struct xdp_sock *xs)
{
	unsigned long flags;

39 40 41
	spin_lock_irqsave(&umem->xsk_list_lock, flags);
	list_del_rcu(&xs->list);
	spin_unlock_irqrestore(&umem->xsk_list_lock, flags);
42 43
}

44 45 46 47
/* The umem is stored both in the _rx struct and the _tx struct as we do
 * not know if the device has more tx queues than rx, or the opposite.
 * This might also change during run time.
 */
48 49
static int xdp_reg_umem_at_qid(struct net_device *dev, struct xdp_umem *umem,
			       u16 queue_id)
50
{
51 52 53 54 55
	if (queue_id >= max_t(unsigned int,
			      dev->real_num_rx_queues,
			      dev->real_num_tx_queues))
		return -EINVAL;

56 57 58 59
	if (queue_id < dev->real_num_rx_queues)
		dev->_rx[queue_id].umem = umem;
	if (queue_id < dev->real_num_tx_queues)
		dev->_tx[queue_id].umem = umem;
60 61

	return 0;
62
}
63

64 65
struct xdp_umem *xdp_get_umem_from_qid(struct net_device *dev,
				       u16 queue_id)
66 67 68 69 70
{
	if (queue_id < dev->real_num_rx_queues)
		return dev->_rx[queue_id].umem;
	if (queue_id < dev->real_num_tx_queues)
		return dev->_tx[queue_id].umem;
71

72 73
	return NULL;
}
74
EXPORT_SYMBOL(xdp_get_umem_from_qid);
75

76 77
static void xdp_clear_umem_at_qid(struct net_device *dev, u16 queue_id)
{
78
	if (queue_id < dev->real_num_rx_queues)
79
		dev->_rx[queue_id].umem = NULL;
80
	if (queue_id < dev->real_num_tx_queues)
81
		dev->_tx[queue_id].umem = NULL;
82 83
}

84
int xdp_umem_assign_dev(struct xdp_umem *umem, struct net_device *dev,
85
			u16 queue_id, u16 flags)
86 87 88
{
	bool force_zc, force_copy;
	struct netdev_bpf bpf;
89
	int err = 0;
90

91 92
	ASSERT_RTNL();

93 94 95 96 97 98
	force_zc = flags & XDP_ZEROCOPY;
	force_copy = flags & XDP_COPY;

	if (force_zc && force_copy)
		return -EINVAL;

99 100
	if (xdp_get_umem_from_qid(dev, queue_id))
		return -EBUSY;
101

102 103
	err = xdp_reg_umem_at_qid(dev, umem, queue_id);
	if (err)
104
		return err;
105

106 107
	umem->dev = dev;
	umem->queue_id = queue_id;
108 109 110

	dev_hold(dev);

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

115
	if (!dev->netdev_ops->ndo_bpf || !dev->netdev_ops->ndo_xsk_wakeup) {
116 117
		err = -EOPNOTSUPP;
		goto err_unreg_umem;
118
	}
119

120 121 122
	bpf.command = XDP_SETUP_XSK_UMEM;
	bpf.xsk.umem = umem;
	bpf.xsk.queue_id = queue_id;
123

124 125
	err = dev->netdev_ops->ndo_bpf(dev, &bpf);
	if (err)
126
		goto err_unreg_umem;
127

128 129
	umem->zc = true;
	return 0;
130

131 132 133
err_unreg_umem:
	if (!force_zc)
		err = 0; /* fallback to copy mode */
134 135
	if (err)
		xdp_clear_umem_at_qid(dev, queue_id);
136
	return err;
137 138
}

139
void xdp_umem_clear_dev(struct xdp_umem *umem)
140 141 142 143
{
	struct netdev_bpf bpf;
	int err;

144 145
	ASSERT_RTNL();

146 147 148
	if (!umem->dev)
		return;

149
	if (umem->zc) {
150 151 152 153 154 155 156 157
		bpf.command = XDP_SETUP_XSK_UMEM;
		bpf.xsk.umem = NULL;
		bpf.xsk.queue_id = umem->queue_id;

		err = umem->dev->netdev_ops->ndo_bpf(umem->dev, &bpf);

		if (err)
			WARN(1, "failed to disable umem!\n");
158 159
	}

160
	xdp_clear_umem_at_qid(umem->dev, umem->queue_id);
161

162 163 164
	dev_put(umem->dev);
	umem->dev = NULL;
	umem->zc = false;
165 166
}

167 168 169 170 171 172 173 174
static void xdp_umem_unmap_pages(struct xdp_umem *umem)
{
	unsigned int i;

	for (i = 0; i < umem->npgs; i++)
		kunmap(umem->pgs[i]);
}

175 176 177 178
static void xdp_umem_unpin_pages(struct xdp_umem *umem)
{
	unsigned int i;

B
Björn Töpel 已提交
179 180
	for (i = 0; i < umem->npgs; i++) {
		struct page *page = umem->pgs[i];
181

B
Björn Töpel 已提交
182 183
		set_page_dirty_lock(page);
		put_page(page);
184
	}
B
Björn Töpel 已提交
185 186 187

	kfree(umem->pgs);
	umem->pgs = NULL;
188 189 190 191
}

static void xdp_umem_unaccount_pages(struct xdp_umem *umem)
{
192 193 194 195
	if (umem->user) {
		atomic_long_sub(umem->npgs, &umem->user->locked_vm);
		free_uid(umem->user);
	}
196 197 198 199
}

static void xdp_umem_release(struct xdp_umem *umem)
{
200
	rtnl_lock();
201
	xdp_umem_clear_dev(umem);
202
	rtnl_unlock();
203

B
Björn Töpel 已提交
204 205
	ida_simple_remove(&umem_ida, umem->id);

206 207 208 209 210
	if (umem->fq) {
		xskq_destroy(umem->fq);
		umem->fq = NULL;
	}

211 212 213 214 215
	if (umem->cq) {
		xskq_destroy(umem->cq);
		umem->cq = NULL;
	}

216 217
	xsk_reuseq_destroy(umem);

218
	xdp_umem_unmap_pages(umem);
B
Björn Töpel 已提交
219
	xdp_umem_unpin_pages(umem);
220

B
Björn Töpel 已提交
221 222 223
	kfree(umem->pages);
	umem->pages = NULL;

224 225 226 227 228 229 230 231 232 233 234 235 236
	xdp_umem_unaccount_pages(umem);
	kfree(umem);
}

static void xdp_umem_release_deferred(struct work_struct *work)
{
	struct xdp_umem *umem = container_of(work, struct xdp_umem, work);

	xdp_umem_release(umem);
}

void xdp_get_umem(struct xdp_umem *umem)
{
237
	refcount_inc(&umem->users);
238 239 240 241 242 243 244
}

void xdp_put_umem(struct xdp_umem *umem)
{
	if (!umem)
		return;

245
	if (refcount_dec_and_test(&umem->users)) {
246 247 248 249 250 251 252 253 254 255 256
		INIT_WORK(&umem->work, xdp_umem_release_deferred);
		schedule_work(&umem->work);
	}
}

static int xdp_umem_pin_pages(struct xdp_umem *umem)
{
	unsigned int gup_flags = FOLL_WRITE;
	long npgs;
	int err;

257 258
	umem->pgs = kcalloc(umem->npgs, sizeof(*umem->pgs),
			    GFP_KERNEL | __GFP_NOWARN);
259 260 261
	if (!umem->pgs)
		return -ENOMEM;

262
	down_read(&current->mm->mmap_sem);
263 264
	npgs = get_user_pages(umem->address, umem->npgs,
			      gup_flags | FOLL_LONGTERM, &umem->pgs[0], NULL);
265
	up_read(&current->mm->mmap_sem);
266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308

	if (npgs != umem->npgs) {
		if (npgs >= 0) {
			umem->npgs = npgs;
			err = -ENOMEM;
			goto out_pin;
		}
		err = npgs;
		goto out_pgs;
	}
	return 0;

out_pin:
	xdp_umem_unpin_pages(umem);
out_pgs:
	kfree(umem->pgs);
	umem->pgs = NULL;
	return err;
}

static int xdp_umem_account_pages(struct xdp_umem *umem)
{
	unsigned long lock_limit, new_npgs, old_npgs;

	if (capable(CAP_IPC_LOCK))
		return 0;

	lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
	umem->user = get_uid(current_user());

	do {
		old_npgs = atomic_long_read(&umem->user->locked_vm);
		new_npgs = old_npgs + umem->npgs;
		if (new_npgs > lock_limit) {
			free_uid(umem->user);
			umem->user = NULL;
			return -ENOBUFS;
		}
	} while (atomic_long_cmpxchg(&umem->user->locked_vm, old_npgs,
				     new_npgs) != old_npgs);
	return 0;
}

B
Björn Töpel 已提交
309
static int xdp_umem_reg(struct xdp_umem *umem, struct xdp_umem_reg *mr)
310
{
311 312
	u32 chunk_size = mr->chunk_size, headroom = mr->headroom;
	unsigned int chunks, chunks_per_page;
313
	u64 addr = mr->addr, size = mr->len;
B
Björn Töpel 已提交
314
	int size_chk, err, i;
315

316
	if (chunk_size < XDP_UMEM_MIN_CHUNK_SIZE || chunk_size > PAGE_SIZE) {
317 318 319 320 321 322 323 324 325
		/* Strictly speaking we could support this, if:
		 * - huge pages, or*
		 * - using an IOMMU, or
		 * - making sure the memory area is consecutive
		 * but for now, we simply say "computer says no".
		 */
		return -EINVAL;
	}

326
	if (!is_power_of_2(chunk_size))
327 328 329 330 331 332 333 334 335 336 337 338
		return -EINVAL;

	if (!PAGE_ALIGNED(addr)) {
		/* Memory area has to be page size aligned. For
		 * simplicity, this might change.
		 */
		return -EINVAL;
	}

	if ((addr + size) < addr)
		return -EINVAL;

339 340
	chunks = (unsigned int)div_u64(size, chunk_size);
	if (chunks == 0)
341 342
		return -EINVAL;

343 344
	chunks_per_page = PAGE_SIZE / chunk_size;
	if (chunks < chunks_per_page || chunks % chunks_per_page)
345 346
		return -EINVAL;

347
	headroom = ALIGN(headroom, 64);
348

349
	size_chk = chunk_size - headroom - XDP_PACKET_HEADROOM;
350 351 352 353
	if (size_chk < 0)
		return -EINVAL;

	umem->address = (unsigned long)addr;
354 355
	umem->chunk_mask = ~((u64)chunk_size - 1);
	umem->size = size;
356 357
	umem->headroom = headroom;
	umem->chunk_size_nohr = chunk_size - headroom;
358 359 360
	umem->npgs = size / PAGE_SIZE;
	umem->pgs = NULL;
	umem->user = NULL;
361 362
	INIT_LIST_HEAD(&umem->xsk_list);
	spin_lock_init(&umem->xsk_list_lock);
363

364
	refcount_set(&umem->users, 1);
365 366 367

	err = xdp_umem_account_pages(umem);
	if (err)
368
		return err;
369 370 371 372

	err = xdp_umem_pin_pages(umem);
	if (err)
		goto out_account;
B
Björn Töpel 已提交
373 374 375 376 377 378 379 380

	umem->pages = kcalloc(umem->npgs, sizeof(*umem->pages), GFP_KERNEL);
	if (!umem->pages) {
		err = -ENOMEM;
		goto out_account;
	}

	for (i = 0; i < umem->npgs; i++)
381
		umem->pages[i].addr = kmap(umem->pgs[i]);
B
Björn Töpel 已提交
382

383 384 385 386 387 388
	return 0;

out_account:
	xdp_umem_unaccount_pages(umem);
	return err;
}
389

B
Björn Töpel 已提交
390 391 392 393 394 395 396 397 398
struct xdp_umem *xdp_umem_create(struct xdp_umem_reg *mr)
{
	struct xdp_umem *umem;
	int err;

	umem = kzalloc(sizeof(*umem), GFP_KERNEL);
	if (!umem)
		return ERR_PTR(-ENOMEM);

B
Björn Töpel 已提交
399 400 401 402 403 404 405
	err = ida_simple_get(&umem_ida, 0, 0, GFP_KERNEL);
	if (err < 0) {
		kfree(umem);
		return ERR_PTR(err);
	}
	umem->id = err;

B
Björn Töpel 已提交
406 407
	err = xdp_umem_reg(umem, mr);
	if (err) {
B
Björn Töpel 已提交
408
		ida_simple_remove(&umem_ida, umem->id);
B
Björn Töpel 已提交
409 410 411 412 413 414 415
		kfree(umem);
		return ERR_PTR(err);
	}

	return umem;
}

416 417
bool xdp_umem_validate_queues(struct xdp_umem *umem)
{
418
	return umem->fq && umem->cq;
419
}