Loading...
1#include <linux/bpf.h>
2#include <linux/btf.h>
3#include <linux/err.h>
4#include <linux/irq_work.h>
5#include <linux/slab.h>
6#include <linux/filter.h>
7#include <linux/mm.h>
8#include <linux/vmalloc.h>
9#include <linux/wait.h>
10#include <linux/poll.h>
11#include <linux/kmemleak.h>
12#include <uapi/linux/btf.h>
13
14#define RINGBUF_CREATE_FLAG_MASK (BPF_F_NUMA_NODE)
15
16/* non-mmap()'able part of bpf_ringbuf (everything up to consumer page) */
17#define RINGBUF_PGOFF \
18 (offsetof(struct bpf_ringbuf, consumer_pos) >> PAGE_SHIFT)
19/* consumer page and producer page */
20#define RINGBUF_POS_PAGES 2
21
22#define RINGBUF_MAX_RECORD_SZ (UINT_MAX/4)
23
24/* Maximum size of ring buffer area is limited by 32-bit page offset within
25 * record header, counted in pages. Reserve 8 bits for extensibility, and take
26 * into account few extra pages for consumer/producer pages and
27 * non-mmap()'able parts. This gives 64GB limit, which seems plenty for single
28 * ring buffer.
29 */
30#define RINGBUF_MAX_DATA_SZ \
31 (((1ULL << 24) - RINGBUF_POS_PAGES - RINGBUF_PGOFF) * PAGE_SIZE)
32
33struct bpf_ringbuf {
34 wait_queue_head_t waitq;
35 struct irq_work work;
36 u64 mask;
37 struct page **pages;
38 int nr_pages;
39 spinlock_t spinlock ____cacheline_aligned_in_smp;
40 /* Consumer and producer counters are put into separate pages to allow
41 * mapping consumer page as r/w, but restrict producer page to r/o.
42 * This protects producer position from being modified by user-space
43 * application and ruining in-kernel position tracking.
44 */
45 unsigned long consumer_pos __aligned(PAGE_SIZE);
46 unsigned long producer_pos __aligned(PAGE_SIZE);
47 char data[] __aligned(PAGE_SIZE);
48};
49
50struct bpf_ringbuf_map {
51 struct bpf_map map;
52 struct bpf_ringbuf *rb;
53};
54
55/* 8-byte ring buffer record header structure */
56struct bpf_ringbuf_hdr {
57 u32 len;
58 u32 pg_off;
59};
60
61static struct bpf_ringbuf *bpf_ringbuf_area_alloc(size_t data_sz, int numa_node)
62{
63 const gfp_t flags = GFP_KERNEL_ACCOUNT | __GFP_RETRY_MAYFAIL |
64 __GFP_NOWARN | __GFP_ZERO;
65 int nr_meta_pages = RINGBUF_PGOFF + RINGBUF_POS_PAGES;
66 int nr_data_pages = data_sz >> PAGE_SHIFT;
67 int nr_pages = nr_meta_pages + nr_data_pages;
68 struct page **pages, *page;
69 struct bpf_ringbuf *rb;
70 size_t array_size;
71 int i;
72
73 /* Each data page is mapped twice to allow "virtual"
74 * continuous read of samples wrapping around the end of ring
75 * buffer area:
76 * ------------------------------------------------------
77 * | meta pages | real data pages | same data pages |
78 * ------------------------------------------------------
79 * | | 1 2 3 4 5 6 7 8 9 | 1 2 3 4 5 6 7 8 9 |
80 * ------------------------------------------------------
81 * | | TA DA | TA DA |
82 * ------------------------------------------------------
83 * ^^^^^^^
84 * |
85 * Here, no need to worry about special handling of wrapped-around
86 * data due to double-mapped data pages. This works both in kernel and
87 * when mmap()'ed in user-space, simplifying both kernel and
88 * user-space implementations significantly.
89 */
90 array_size = (nr_meta_pages + 2 * nr_data_pages) * sizeof(*pages);
91 pages = bpf_map_area_alloc(array_size, numa_node);
92 if (!pages)
93 return NULL;
94
95 for (i = 0; i < nr_pages; i++) {
96 page = alloc_pages_node(numa_node, flags, 0);
97 if (!page) {
98 nr_pages = i;
99 goto err_free_pages;
100 }
101 pages[i] = page;
102 if (i >= nr_meta_pages)
103 pages[nr_data_pages + i] = page;
104 }
105
106 rb = vmap(pages, nr_meta_pages + 2 * nr_data_pages,
107 VM_ALLOC | VM_USERMAP, PAGE_KERNEL);
108 if (rb) {
109 kmemleak_not_leak(pages);
110 rb->pages = pages;
111 rb->nr_pages = nr_pages;
112 return rb;
113 }
114
115err_free_pages:
116 for (i = 0; i < nr_pages; i++)
117 __free_page(pages[i]);
118 kvfree(pages);
119 return NULL;
120}
121
122static void bpf_ringbuf_notify(struct irq_work *work)
123{
124 struct bpf_ringbuf *rb = container_of(work, struct bpf_ringbuf, work);
125
126 wake_up_all(&rb->waitq);
127}
128
129static struct bpf_ringbuf *bpf_ringbuf_alloc(size_t data_sz, int numa_node)
130{
131 struct bpf_ringbuf *rb;
132
133 rb = bpf_ringbuf_area_alloc(data_sz, numa_node);
134 if (!rb)
135 return NULL;
136
137 spin_lock_init(&rb->spinlock);
138 init_waitqueue_head(&rb->waitq);
139 init_irq_work(&rb->work, bpf_ringbuf_notify);
140
141 rb->mask = data_sz - 1;
142 rb->consumer_pos = 0;
143 rb->producer_pos = 0;
144
145 return rb;
146}
147
148static struct bpf_map *ringbuf_map_alloc(union bpf_attr *attr)
149{
150 struct bpf_ringbuf_map *rb_map;
151
152 if (attr->map_flags & ~RINGBUF_CREATE_FLAG_MASK)
153 return ERR_PTR(-EINVAL);
154
155 if (attr->key_size || attr->value_size ||
156 !is_power_of_2(attr->max_entries) ||
157 !PAGE_ALIGNED(attr->max_entries))
158 return ERR_PTR(-EINVAL);
159
160#ifdef CONFIG_64BIT
161 /* on 32-bit arch, it's impossible to overflow record's hdr->pgoff */
162 if (attr->max_entries > RINGBUF_MAX_DATA_SZ)
163 return ERR_PTR(-E2BIG);
164#endif
165
166 rb_map = kzalloc(sizeof(*rb_map), GFP_USER | __GFP_ACCOUNT);
167 if (!rb_map)
168 return ERR_PTR(-ENOMEM);
169
170 bpf_map_init_from_attr(&rb_map->map, attr);
171
172 rb_map->rb = bpf_ringbuf_alloc(attr->max_entries, rb_map->map.numa_node);
173 if (!rb_map->rb) {
174 kfree(rb_map);
175 return ERR_PTR(-ENOMEM);
176 }
177
178 return &rb_map->map;
179}
180
181static void bpf_ringbuf_free(struct bpf_ringbuf *rb)
182{
183 /* copy pages pointer and nr_pages to local variable, as we are going
184 * to unmap rb itself with vunmap() below
185 */
186 struct page **pages = rb->pages;
187 int i, nr_pages = rb->nr_pages;
188
189 vunmap(rb);
190 for (i = 0; i < nr_pages; i++)
191 __free_page(pages[i]);
192 kvfree(pages);
193}
194
195static void ringbuf_map_free(struct bpf_map *map)
196{
197 struct bpf_ringbuf_map *rb_map;
198
199 rb_map = container_of(map, struct bpf_ringbuf_map, map);
200 bpf_ringbuf_free(rb_map->rb);
201 kfree(rb_map);
202}
203
204static void *ringbuf_map_lookup_elem(struct bpf_map *map, void *key)
205{
206 return ERR_PTR(-ENOTSUPP);
207}
208
209static int ringbuf_map_update_elem(struct bpf_map *map, void *key, void *value,
210 u64 flags)
211{
212 return -ENOTSUPP;
213}
214
215static int ringbuf_map_delete_elem(struct bpf_map *map, void *key)
216{
217 return -ENOTSUPP;
218}
219
220static int ringbuf_map_get_next_key(struct bpf_map *map, void *key,
221 void *next_key)
222{
223 return -ENOTSUPP;
224}
225
226static int ringbuf_map_mmap(struct bpf_map *map, struct vm_area_struct *vma)
227{
228 struct bpf_ringbuf_map *rb_map;
229
230 rb_map = container_of(map, struct bpf_ringbuf_map, map);
231
232 if (vma->vm_flags & VM_WRITE) {
233 /* allow writable mapping for the consumer_pos only */
234 if (vma->vm_pgoff != 0 || vma->vm_end - vma->vm_start != PAGE_SIZE)
235 return -EPERM;
236 } else {
237 vma->vm_flags &= ~VM_MAYWRITE;
238 }
239 /* remap_vmalloc_range() checks size and offset constraints */
240 return remap_vmalloc_range(vma, rb_map->rb,
241 vma->vm_pgoff + RINGBUF_PGOFF);
242}
243
244static unsigned long ringbuf_avail_data_sz(struct bpf_ringbuf *rb)
245{
246 unsigned long cons_pos, prod_pos;
247
248 cons_pos = smp_load_acquire(&rb->consumer_pos);
249 prod_pos = smp_load_acquire(&rb->producer_pos);
250 return prod_pos - cons_pos;
251}
252
253static __poll_t ringbuf_map_poll(struct bpf_map *map, struct file *filp,
254 struct poll_table_struct *pts)
255{
256 struct bpf_ringbuf_map *rb_map;
257
258 rb_map = container_of(map, struct bpf_ringbuf_map, map);
259 poll_wait(filp, &rb_map->rb->waitq, pts);
260
261 if (ringbuf_avail_data_sz(rb_map->rb))
262 return EPOLLIN | EPOLLRDNORM;
263 return 0;
264}
265
266static int ringbuf_map_btf_id;
267const struct bpf_map_ops ringbuf_map_ops = {
268 .map_meta_equal = bpf_map_meta_equal,
269 .map_alloc = ringbuf_map_alloc,
270 .map_free = ringbuf_map_free,
271 .map_mmap = ringbuf_map_mmap,
272 .map_poll = ringbuf_map_poll,
273 .map_lookup_elem = ringbuf_map_lookup_elem,
274 .map_update_elem = ringbuf_map_update_elem,
275 .map_delete_elem = ringbuf_map_delete_elem,
276 .map_get_next_key = ringbuf_map_get_next_key,
277 .map_btf_name = "bpf_ringbuf_map",
278 .map_btf_id = &ringbuf_map_btf_id,
279};
280
281/* Given pointer to ring buffer record metadata and struct bpf_ringbuf itself,
282 * calculate offset from record metadata to ring buffer in pages, rounded
283 * down. This page offset is stored as part of record metadata and allows to
284 * restore struct bpf_ringbuf * from record pointer. This page offset is
285 * stored at offset 4 of record metadata header.
286 */
287static size_t bpf_ringbuf_rec_pg_off(struct bpf_ringbuf *rb,
288 struct bpf_ringbuf_hdr *hdr)
289{
290 return ((void *)hdr - (void *)rb) >> PAGE_SHIFT;
291}
292
293/* Given pointer to ring buffer record header, restore pointer to struct
294 * bpf_ringbuf itself by using page offset stored at offset 4
295 */
296static struct bpf_ringbuf *
297bpf_ringbuf_restore_from_rec(struct bpf_ringbuf_hdr *hdr)
298{
299 unsigned long addr = (unsigned long)(void *)hdr;
300 unsigned long off = (unsigned long)hdr->pg_off << PAGE_SHIFT;
301
302 return (void*)((addr & PAGE_MASK) - off);
303}
304
305static void *__bpf_ringbuf_reserve(struct bpf_ringbuf *rb, u64 size)
306{
307 unsigned long cons_pos, prod_pos, new_prod_pos, flags;
308 u32 len, pg_off;
309 struct bpf_ringbuf_hdr *hdr;
310
311 if (unlikely(size > RINGBUF_MAX_RECORD_SZ))
312 return NULL;
313
314 len = round_up(size + BPF_RINGBUF_HDR_SZ, 8);
315 if (len > rb->mask + 1)
316 return NULL;
317
318 cons_pos = smp_load_acquire(&rb->consumer_pos);
319
320 if (in_nmi()) {
321 if (!spin_trylock_irqsave(&rb->spinlock, flags))
322 return NULL;
323 } else {
324 spin_lock_irqsave(&rb->spinlock, flags);
325 }
326
327 prod_pos = rb->producer_pos;
328 new_prod_pos = prod_pos + len;
329
330 /* check for out of ringbuf space by ensuring producer position
331 * doesn't advance more than (ringbuf_size - 1) ahead
332 */
333 if (new_prod_pos - cons_pos > rb->mask) {
334 spin_unlock_irqrestore(&rb->spinlock, flags);
335 return NULL;
336 }
337
338 hdr = (void *)rb->data + (prod_pos & rb->mask);
339 pg_off = bpf_ringbuf_rec_pg_off(rb, hdr);
340 hdr->len = size | BPF_RINGBUF_BUSY_BIT;
341 hdr->pg_off = pg_off;
342
343 /* pairs with consumer's smp_load_acquire() */
344 smp_store_release(&rb->producer_pos, new_prod_pos);
345
346 spin_unlock_irqrestore(&rb->spinlock, flags);
347
348 return (void *)hdr + BPF_RINGBUF_HDR_SZ;
349}
350
351BPF_CALL_3(bpf_ringbuf_reserve, struct bpf_map *, map, u64, size, u64, flags)
352{
353 struct bpf_ringbuf_map *rb_map;
354
355 if (unlikely(flags))
356 return 0;
357
358 rb_map = container_of(map, struct bpf_ringbuf_map, map);
359 return (unsigned long)__bpf_ringbuf_reserve(rb_map->rb, size);
360}
361
362const struct bpf_func_proto bpf_ringbuf_reserve_proto = {
363 .func = bpf_ringbuf_reserve,
364 .ret_type = RET_PTR_TO_ALLOC_MEM_OR_NULL,
365 .arg1_type = ARG_CONST_MAP_PTR,
366 .arg2_type = ARG_CONST_ALLOC_SIZE_OR_ZERO,
367 .arg3_type = ARG_ANYTHING,
368};
369
370static void bpf_ringbuf_commit(void *sample, u64 flags, bool discard)
371{
372 unsigned long rec_pos, cons_pos;
373 struct bpf_ringbuf_hdr *hdr;
374 struct bpf_ringbuf *rb;
375 u32 new_len;
376
377 hdr = sample - BPF_RINGBUF_HDR_SZ;
378 rb = bpf_ringbuf_restore_from_rec(hdr);
379 new_len = hdr->len ^ BPF_RINGBUF_BUSY_BIT;
380 if (discard)
381 new_len |= BPF_RINGBUF_DISCARD_BIT;
382
383 /* update record header with correct final size prefix */
384 xchg(&hdr->len, new_len);
385
386 /* if consumer caught up and is waiting for our record, notify about
387 * new data availability
388 */
389 rec_pos = (void *)hdr - (void *)rb->data;
390 cons_pos = smp_load_acquire(&rb->consumer_pos) & rb->mask;
391
392 if (flags & BPF_RB_FORCE_WAKEUP)
393 irq_work_queue(&rb->work);
394 else if (cons_pos == rec_pos && !(flags & BPF_RB_NO_WAKEUP))
395 irq_work_queue(&rb->work);
396}
397
398BPF_CALL_2(bpf_ringbuf_submit, void *, sample, u64, flags)
399{
400 bpf_ringbuf_commit(sample, flags, false /* discard */);
401 return 0;
402}
403
404const struct bpf_func_proto bpf_ringbuf_submit_proto = {
405 .func = bpf_ringbuf_submit,
406 .ret_type = RET_VOID,
407 .arg1_type = ARG_PTR_TO_ALLOC_MEM,
408 .arg2_type = ARG_ANYTHING,
409};
410
411BPF_CALL_2(bpf_ringbuf_discard, void *, sample, u64, flags)
412{
413 bpf_ringbuf_commit(sample, flags, true /* discard */);
414 return 0;
415}
416
417const struct bpf_func_proto bpf_ringbuf_discard_proto = {
418 .func = bpf_ringbuf_discard,
419 .ret_type = RET_VOID,
420 .arg1_type = ARG_PTR_TO_ALLOC_MEM,
421 .arg2_type = ARG_ANYTHING,
422};
423
424BPF_CALL_4(bpf_ringbuf_output, struct bpf_map *, map, void *, data, u64, size,
425 u64, flags)
426{
427 struct bpf_ringbuf_map *rb_map;
428 void *rec;
429
430 if (unlikely(flags & ~(BPF_RB_NO_WAKEUP | BPF_RB_FORCE_WAKEUP)))
431 return -EINVAL;
432
433 rb_map = container_of(map, struct bpf_ringbuf_map, map);
434 rec = __bpf_ringbuf_reserve(rb_map->rb, size);
435 if (!rec)
436 return -EAGAIN;
437
438 memcpy(rec, data, size);
439 bpf_ringbuf_commit(rec, flags, false /* discard */);
440 return 0;
441}
442
443const struct bpf_func_proto bpf_ringbuf_output_proto = {
444 .func = bpf_ringbuf_output,
445 .ret_type = RET_INTEGER,
446 .arg1_type = ARG_CONST_MAP_PTR,
447 .arg2_type = ARG_PTR_TO_MEM,
448 .arg3_type = ARG_CONST_SIZE_OR_ZERO,
449 .arg4_type = ARG_ANYTHING,
450};
451
452BPF_CALL_2(bpf_ringbuf_query, struct bpf_map *, map, u64, flags)
453{
454 struct bpf_ringbuf *rb;
455
456 rb = container_of(map, struct bpf_ringbuf_map, map)->rb;
457
458 switch (flags) {
459 case BPF_RB_AVAIL_DATA:
460 return ringbuf_avail_data_sz(rb);
461 case BPF_RB_RING_SIZE:
462 return rb->mask + 1;
463 case BPF_RB_CONS_POS:
464 return smp_load_acquire(&rb->consumer_pos);
465 case BPF_RB_PROD_POS:
466 return smp_load_acquire(&rb->producer_pos);
467 default:
468 return 0;
469 }
470}
471
472const struct bpf_func_proto bpf_ringbuf_query_proto = {
473 .func = bpf_ringbuf_query,
474 .ret_type = RET_INTEGER,
475 .arg1_type = ARG_CONST_MAP_PTR,
476 .arg2_type = ARG_ANYTHING,
477};
1#include <linux/bpf.h>
2#include <linux/btf.h>
3#include <linux/err.h>
4#include <linux/irq_work.h>
5#include <linux/slab.h>
6#include <linux/filter.h>
7#include <linux/mm.h>
8#include <linux/vmalloc.h>
9#include <linux/wait.h>
10#include <linux/poll.h>
11#include <uapi/linux/btf.h>
12
13#define RINGBUF_CREATE_FLAG_MASK (BPF_F_NUMA_NODE)
14
15/* non-mmap()'able part of bpf_ringbuf (everything up to consumer page) */
16#define RINGBUF_PGOFF \
17 (offsetof(struct bpf_ringbuf, consumer_pos) >> PAGE_SHIFT)
18/* consumer page and producer page */
19#define RINGBUF_POS_PAGES 2
20
21#define RINGBUF_MAX_RECORD_SZ (UINT_MAX/4)
22
23/* Maximum size of ring buffer area is limited by 32-bit page offset within
24 * record header, counted in pages. Reserve 8 bits for extensibility, and take
25 * into account few extra pages for consumer/producer pages and
26 * non-mmap()'able parts. This gives 64GB limit, which seems plenty for single
27 * ring buffer.
28 */
29#define RINGBUF_MAX_DATA_SZ \
30 (((1ULL << 24) - RINGBUF_POS_PAGES - RINGBUF_PGOFF) * PAGE_SIZE)
31
32struct bpf_ringbuf {
33 wait_queue_head_t waitq;
34 struct irq_work work;
35 u64 mask;
36 struct page **pages;
37 int nr_pages;
38 spinlock_t spinlock ____cacheline_aligned_in_smp;
39 /* Consumer and producer counters are put into separate pages to allow
40 * mapping consumer page as r/w, but restrict producer page to r/o.
41 * This protects producer position from being modified by user-space
42 * application and ruining in-kernel position tracking.
43 */
44 unsigned long consumer_pos __aligned(PAGE_SIZE);
45 unsigned long producer_pos __aligned(PAGE_SIZE);
46 char data[] __aligned(PAGE_SIZE);
47};
48
49struct bpf_ringbuf_map {
50 struct bpf_map map;
51 struct bpf_map_memory memory;
52 struct bpf_ringbuf *rb;
53};
54
55/* 8-byte ring buffer record header structure */
56struct bpf_ringbuf_hdr {
57 u32 len;
58 u32 pg_off;
59};
60
61static struct bpf_ringbuf *bpf_ringbuf_area_alloc(size_t data_sz, int numa_node)
62{
63 const gfp_t flags = GFP_KERNEL | __GFP_RETRY_MAYFAIL | __GFP_NOWARN |
64 __GFP_ZERO;
65 int nr_meta_pages = RINGBUF_PGOFF + RINGBUF_POS_PAGES;
66 int nr_data_pages = data_sz >> PAGE_SHIFT;
67 int nr_pages = nr_meta_pages + nr_data_pages;
68 struct page **pages, *page;
69 struct bpf_ringbuf *rb;
70 size_t array_size;
71 int i;
72
73 /* Each data page is mapped twice to allow "virtual"
74 * continuous read of samples wrapping around the end of ring
75 * buffer area:
76 * ------------------------------------------------------
77 * | meta pages | real data pages | same data pages |
78 * ------------------------------------------------------
79 * | | 1 2 3 4 5 6 7 8 9 | 1 2 3 4 5 6 7 8 9 |
80 * ------------------------------------------------------
81 * | | TA DA | TA DA |
82 * ------------------------------------------------------
83 * ^^^^^^^
84 * |
85 * Here, no need to worry about special handling of wrapped-around
86 * data due to double-mapped data pages. This works both in kernel and
87 * when mmap()'ed in user-space, simplifying both kernel and
88 * user-space implementations significantly.
89 */
90 array_size = (nr_meta_pages + 2 * nr_data_pages) * sizeof(*pages);
91 if (array_size > PAGE_SIZE)
92 pages = vmalloc_node(array_size, numa_node);
93 else
94 pages = kmalloc_node(array_size, flags, numa_node);
95 if (!pages)
96 return NULL;
97
98 for (i = 0; i < nr_pages; i++) {
99 page = alloc_pages_node(numa_node, flags, 0);
100 if (!page) {
101 nr_pages = i;
102 goto err_free_pages;
103 }
104 pages[i] = page;
105 if (i >= nr_meta_pages)
106 pages[nr_data_pages + i] = page;
107 }
108
109 rb = vmap(pages, nr_meta_pages + 2 * nr_data_pages,
110 VM_ALLOC | VM_USERMAP, PAGE_KERNEL);
111 if (rb) {
112 rb->pages = pages;
113 rb->nr_pages = nr_pages;
114 return rb;
115 }
116
117err_free_pages:
118 for (i = 0; i < nr_pages; i++)
119 __free_page(pages[i]);
120 kvfree(pages);
121 return NULL;
122}
123
124static void bpf_ringbuf_notify(struct irq_work *work)
125{
126 struct bpf_ringbuf *rb = container_of(work, struct bpf_ringbuf, work);
127
128 wake_up_all(&rb->waitq);
129}
130
131static struct bpf_ringbuf *bpf_ringbuf_alloc(size_t data_sz, int numa_node)
132{
133 struct bpf_ringbuf *rb;
134
135 rb = bpf_ringbuf_area_alloc(data_sz, numa_node);
136 if (!rb)
137 return ERR_PTR(-ENOMEM);
138
139 spin_lock_init(&rb->spinlock);
140 init_waitqueue_head(&rb->waitq);
141 init_irq_work(&rb->work, bpf_ringbuf_notify);
142
143 rb->mask = data_sz - 1;
144 rb->consumer_pos = 0;
145 rb->producer_pos = 0;
146
147 return rb;
148}
149
150static struct bpf_map *ringbuf_map_alloc(union bpf_attr *attr)
151{
152 struct bpf_ringbuf_map *rb_map;
153 u64 cost;
154 int err;
155
156 if (attr->map_flags & ~RINGBUF_CREATE_FLAG_MASK)
157 return ERR_PTR(-EINVAL);
158
159 if (attr->key_size || attr->value_size ||
160 !is_power_of_2(attr->max_entries) ||
161 !PAGE_ALIGNED(attr->max_entries))
162 return ERR_PTR(-EINVAL);
163
164#ifdef CONFIG_64BIT
165 /* on 32-bit arch, it's impossible to overflow record's hdr->pgoff */
166 if (attr->max_entries > RINGBUF_MAX_DATA_SZ)
167 return ERR_PTR(-E2BIG);
168#endif
169
170 rb_map = kzalloc(sizeof(*rb_map), GFP_USER);
171 if (!rb_map)
172 return ERR_PTR(-ENOMEM);
173
174 bpf_map_init_from_attr(&rb_map->map, attr);
175
176 cost = sizeof(struct bpf_ringbuf_map) +
177 sizeof(struct bpf_ringbuf) +
178 attr->max_entries;
179 err = bpf_map_charge_init(&rb_map->map.memory, cost);
180 if (err)
181 goto err_free_map;
182
183 rb_map->rb = bpf_ringbuf_alloc(attr->max_entries, rb_map->map.numa_node);
184 if (IS_ERR(rb_map->rb)) {
185 err = PTR_ERR(rb_map->rb);
186 goto err_uncharge;
187 }
188
189 return &rb_map->map;
190
191err_uncharge:
192 bpf_map_charge_finish(&rb_map->map.memory);
193err_free_map:
194 kfree(rb_map);
195 return ERR_PTR(err);
196}
197
198static void bpf_ringbuf_free(struct bpf_ringbuf *rb)
199{
200 /* copy pages pointer and nr_pages to local variable, as we are going
201 * to unmap rb itself with vunmap() below
202 */
203 struct page **pages = rb->pages;
204 int i, nr_pages = rb->nr_pages;
205
206 vunmap(rb);
207 for (i = 0; i < nr_pages; i++)
208 __free_page(pages[i]);
209 kvfree(pages);
210}
211
212static void ringbuf_map_free(struct bpf_map *map)
213{
214 struct bpf_ringbuf_map *rb_map;
215
216 rb_map = container_of(map, struct bpf_ringbuf_map, map);
217 bpf_ringbuf_free(rb_map->rb);
218 kfree(rb_map);
219}
220
221static void *ringbuf_map_lookup_elem(struct bpf_map *map, void *key)
222{
223 return ERR_PTR(-ENOTSUPP);
224}
225
226static int ringbuf_map_update_elem(struct bpf_map *map, void *key, void *value,
227 u64 flags)
228{
229 return -ENOTSUPP;
230}
231
232static int ringbuf_map_delete_elem(struct bpf_map *map, void *key)
233{
234 return -ENOTSUPP;
235}
236
237static int ringbuf_map_get_next_key(struct bpf_map *map, void *key,
238 void *next_key)
239{
240 return -ENOTSUPP;
241}
242
243static size_t bpf_ringbuf_mmap_page_cnt(const struct bpf_ringbuf *rb)
244{
245 size_t data_pages = (rb->mask + 1) >> PAGE_SHIFT;
246
247 /* consumer page + producer page + 2 x data pages */
248 return RINGBUF_POS_PAGES + 2 * data_pages;
249}
250
251static int ringbuf_map_mmap(struct bpf_map *map, struct vm_area_struct *vma)
252{
253 struct bpf_ringbuf_map *rb_map;
254 size_t mmap_sz;
255
256 rb_map = container_of(map, struct bpf_ringbuf_map, map);
257 mmap_sz = bpf_ringbuf_mmap_page_cnt(rb_map->rb) << PAGE_SHIFT;
258
259 if (vma->vm_pgoff * PAGE_SIZE + (vma->vm_end - vma->vm_start) > mmap_sz)
260 return -EINVAL;
261
262 return remap_vmalloc_range(vma, rb_map->rb,
263 vma->vm_pgoff + RINGBUF_PGOFF);
264}
265
266static unsigned long ringbuf_avail_data_sz(struct bpf_ringbuf *rb)
267{
268 unsigned long cons_pos, prod_pos;
269
270 cons_pos = smp_load_acquire(&rb->consumer_pos);
271 prod_pos = smp_load_acquire(&rb->producer_pos);
272 return prod_pos - cons_pos;
273}
274
275static __poll_t ringbuf_map_poll(struct bpf_map *map, struct file *filp,
276 struct poll_table_struct *pts)
277{
278 struct bpf_ringbuf_map *rb_map;
279
280 rb_map = container_of(map, struct bpf_ringbuf_map, map);
281 poll_wait(filp, &rb_map->rb->waitq, pts);
282
283 if (ringbuf_avail_data_sz(rb_map->rb))
284 return EPOLLIN | EPOLLRDNORM;
285 return 0;
286}
287
288static int ringbuf_map_btf_id;
289const struct bpf_map_ops ringbuf_map_ops = {
290 .map_alloc = ringbuf_map_alloc,
291 .map_free = ringbuf_map_free,
292 .map_mmap = ringbuf_map_mmap,
293 .map_poll = ringbuf_map_poll,
294 .map_lookup_elem = ringbuf_map_lookup_elem,
295 .map_update_elem = ringbuf_map_update_elem,
296 .map_delete_elem = ringbuf_map_delete_elem,
297 .map_get_next_key = ringbuf_map_get_next_key,
298 .map_btf_name = "bpf_ringbuf_map",
299 .map_btf_id = &ringbuf_map_btf_id,
300};
301
302/* Given pointer to ring buffer record metadata and struct bpf_ringbuf itself,
303 * calculate offset from record metadata to ring buffer in pages, rounded
304 * down. This page offset is stored as part of record metadata and allows to
305 * restore struct bpf_ringbuf * from record pointer. This page offset is
306 * stored at offset 4 of record metadata header.
307 */
308static size_t bpf_ringbuf_rec_pg_off(struct bpf_ringbuf *rb,
309 struct bpf_ringbuf_hdr *hdr)
310{
311 return ((void *)hdr - (void *)rb) >> PAGE_SHIFT;
312}
313
314/* Given pointer to ring buffer record header, restore pointer to struct
315 * bpf_ringbuf itself by using page offset stored at offset 4
316 */
317static struct bpf_ringbuf *
318bpf_ringbuf_restore_from_rec(struct bpf_ringbuf_hdr *hdr)
319{
320 unsigned long addr = (unsigned long)(void *)hdr;
321 unsigned long off = (unsigned long)hdr->pg_off << PAGE_SHIFT;
322
323 return (void*)((addr & PAGE_MASK) - off);
324}
325
326static void *__bpf_ringbuf_reserve(struct bpf_ringbuf *rb, u64 size)
327{
328 unsigned long cons_pos, prod_pos, new_prod_pos, flags;
329 u32 len, pg_off;
330 struct bpf_ringbuf_hdr *hdr;
331
332 if (unlikely(size > RINGBUF_MAX_RECORD_SZ))
333 return NULL;
334
335 len = round_up(size + BPF_RINGBUF_HDR_SZ, 8);
336 cons_pos = smp_load_acquire(&rb->consumer_pos);
337
338 if (in_nmi()) {
339 if (!spin_trylock_irqsave(&rb->spinlock, flags))
340 return NULL;
341 } else {
342 spin_lock_irqsave(&rb->spinlock, flags);
343 }
344
345 prod_pos = rb->producer_pos;
346 new_prod_pos = prod_pos + len;
347
348 /* check for out of ringbuf space by ensuring producer position
349 * doesn't advance more than (ringbuf_size - 1) ahead
350 */
351 if (new_prod_pos - cons_pos > rb->mask) {
352 spin_unlock_irqrestore(&rb->spinlock, flags);
353 return NULL;
354 }
355
356 hdr = (void *)rb->data + (prod_pos & rb->mask);
357 pg_off = bpf_ringbuf_rec_pg_off(rb, hdr);
358 hdr->len = size | BPF_RINGBUF_BUSY_BIT;
359 hdr->pg_off = pg_off;
360
361 /* pairs with consumer's smp_load_acquire() */
362 smp_store_release(&rb->producer_pos, new_prod_pos);
363
364 spin_unlock_irqrestore(&rb->spinlock, flags);
365
366 return (void *)hdr + BPF_RINGBUF_HDR_SZ;
367}
368
369BPF_CALL_3(bpf_ringbuf_reserve, struct bpf_map *, map, u64, size, u64, flags)
370{
371 struct bpf_ringbuf_map *rb_map;
372
373 if (unlikely(flags))
374 return 0;
375
376 rb_map = container_of(map, struct bpf_ringbuf_map, map);
377 return (unsigned long)__bpf_ringbuf_reserve(rb_map->rb, size);
378}
379
380const struct bpf_func_proto bpf_ringbuf_reserve_proto = {
381 .func = bpf_ringbuf_reserve,
382 .ret_type = RET_PTR_TO_ALLOC_MEM_OR_NULL,
383 .arg1_type = ARG_CONST_MAP_PTR,
384 .arg2_type = ARG_CONST_ALLOC_SIZE_OR_ZERO,
385 .arg3_type = ARG_ANYTHING,
386};
387
388static void bpf_ringbuf_commit(void *sample, u64 flags, bool discard)
389{
390 unsigned long rec_pos, cons_pos;
391 struct bpf_ringbuf_hdr *hdr;
392 struct bpf_ringbuf *rb;
393 u32 new_len;
394
395 hdr = sample - BPF_RINGBUF_HDR_SZ;
396 rb = bpf_ringbuf_restore_from_rec(hdr);
397 new_len = hdr->len ^ BPF_RINGBUF_BUSY_BIT;
398 if (discard)
399 new_len |= BPF_RINGBUF_DISCARD_BIT;
400
401 /* update record header with correct final size prefix */
402 xchg(&hdr->len, new_len);
403
404 /* if consumer caught up and is waiting for our record, notify about
405 * new data availability
406 */
407 rec_pos = (void *)hdr - (void *)rb->data;
408 cons_pos = smp_load_acquire(&rb->consumer_pos) & rb->mask;
409
410 if (flags & BPF_RB_FORCE_WAKEUP)
411 irq_work_queue(&rb->work);
412 else if (cons_pos == rec_pos && !(flags & BPF_RB_NO_WAKEUP))
413 irq_work_queue(&rb->work);
414}
415
416BPF_CALL_2(bpf_ringbuf_submit, void *, sample, u64, flags)
417{
418 bpf_ringbuf_commit(sample, flags, false /* discard */);
419 return 0;
420}
421
422const struct bpf_func_proto bpf_ringbuf_submit_proto = {
423 .func = bpf_ringbuf_submit,
424 .ret_type = RET_VOID,
425 .arg1_type = ARG_PTR_TO_ALLOC_MEM,
426 .arg2_type = ARG_ANYTHING,
427};
428
429BPF_CALL_2(bpf_ringbuf_discard, void *, sample, u64, flags)
430{
431 bpf_ringbuf_commit(sample, flags, true /* discard */);
432 return 0;
433}
434
435const struct bpf_func_proto bpf_ringbuf_discard_proto = {
436 .func = bpf_ringbuf_discard,
437 .ret_type = RET_VOID,
438 .arg1_type = ARG_PTR_TO_ALLOC_MEM,
439 .arg2_type = ARG_ANYTHING,
440};
441
442BPF_CALL_4(bpf_ringbuf_output, struct bpf_map *, map, void *, data, u64, size,
443 u64, flags)
444{
445 struct bpf_ringbuf_map *rb_map;
446 void *rec;
447
448 if (unlikely(flags & ~(BPF_RB_NO_WAKEUP | BPF_RB_FORCE_WAKEUP)))
449 return -EINVAL;
450
451 rb_map = container_of(map, struct bpf_ringbuf_map, map);
452 rec = __bpf_ringbuf_reserve(rb_map->rb, size);
453 if (!rec)
454 return -EAGAIN;
455
456 memcpy(rec, data, size);
457 bpf_ringbuf_commit(rec, flags, false /* discard */);
458 return 0;
459}
460
461const struct bpf_func_proto bpf_ringbuf_output_proto = {
462 .func = bpf_ringbuf_output,
463 .ret_type = RET_INTEGER,
464 .arg1_type = ARG_CONST_MAP_PTR,
465 .arg2_type = ARG_PTR_TO_MEM,
466 .arg3_type = ARG_CONST_SIZE_OR_ZERO,
467 .arg4_type = ARG_ANYTHING,
468};
469
470BPF_CALL_2(bpf_ringbuf_query, struct bpf_map *, map, u64, flags)
471{
472 struct bpf_ringbuf *rb;
473
474 rb = container_of(map, struct bpf_ringbuf_map, map)->rb;
475
476 switch (flags) {
477 case BPF_RB_AVAIL_DATA:
478 return ringbuf_avail_data_sz(rb);
479 case BPF_RB_RING_SIZE:
480 return rb->mask + 1;
481 case BPF_RB_CONS_POS:
482 return smp_load_acquire(&rb->consumer_pos);
483 case BPF_RB_PROD_POS:
484 return smp_load_acquire(&rb->producer_pos);
485 default:
486 return 0;
487 }
488}
489
490const struct bpf_func_proto bpf_ringbuf_query_proto = {
491 .func = bpf_ringbuf_query,
492 .ret_type = RET_INTEGER,
493 .arg1_type = ARG_CONST_MAP_PTR,
494 .arg2_type = ARG_ANYTHING,
495};