blob: bfedcbdb4d84f191311825e87f45f9da191564dd [file] [log] [blame]
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -08001/* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
2 *
3 * This program is free software; you can redistribute it and/or
4 * modify it under the terms of version 2 of the GNU General Public
5 * License as published by the Free Software Foundation.
6 *
7 * This program is distributed in the hope that it will be useful, but
8 * WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
10 * General Public License for more details.
11 */
12#include <linux/bpf.h>
13#include <linux/err.h>
14#include <linux/vmalloc.h>
15#include <linux/slab.h>
16#include <linux/mm.h>
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -070017#include <linux/filter.h>
Daniel Borkmann0cdf56402015-10-02 18:42:00 +020018#include <linux/perf_event.h>
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080019
Alexei Starovoitova10423b2016-02-01 22:39:54 -080020static void bpf_array_free_percpu(struct bpf_array *array)
21{
22 int i;
23
24 for (i = 0; i < array->map.max_entries; i++)
25 free_percpu(array->pptrs[i]);
26}
27
28static int bpf_array_alloc_percpu(struct bpf_array *array)
29{
30 void __percpu *ptr;
31 int i;
32
33 for (i = 0; i < array->map.max_entries; i++) {
34 ptr = __alloc_percpu_gfp(array->elem_size, 8,
35 GFP_USER | __GFP_NOWARN);
36 if (!ptr) {
37 bpf_array_free_percpu(array);
38 return -ENOMEM;
39 }
40 array->pptrs[i] = ptr;
41 }
42
43 return 0;
44}
45
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080046/* Called from syscall */
47static struct bpf_map *array_map_alloc(union bpf_attr *attr)
48{
Alexei Starovoitova10423b2016-02-01 22:39:54 -080049 bool percpu = attr->map_type == BPF_MAP_TYPE_PERCPU_ARRAY;
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080050 struct bpf_array *array;
Alexei Starovoitova10423b2016-02-01 22:39:54 -080051 u64 array_size;
52 u32 elem_size;
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080053
54 /* check sanity of attributes */
55 if (attr->max_entries == 0 || attr->key_size != 4 ||
Alexei Starovoitov823707b2016-03-07 21:57:16 -080056 attr->value_size == 0 || attr->map_flags)
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080057 return ERR_PTR(-EINVAL);
58
Alexei Starovoitov01b3f522015-11-29 16:59:35 -080059 if (attr->value_size >= 1 << (KMALLOC_SHIFT_MAX - 1))
60 /* if value_size is bigger, the user space won't be able to
61 * access the elements.
62 */
63 return ERR_PTR(-E2BIG);
64
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080065 elem_size = round_up(attr->value_size, 8);
66
Alexei Starovoitova10423b2016-02-01 22:39:54 -080067 array_size = sizeof(*array);
68 if (percpu)
69 array_size += (u64) attr->max_entries * sizeof(void *);
70 else
71 array_size += (u64) attr->max_entries * elem_size;
72
73 /* make sure there is no u32 overflow later in round_up() */
74 if (array_size >= U32_MAX - PAGE_SIZE)
Alexei Starovoitovdaaf4272014-11-18 17:32:16 -080075 return ERR_PTR(-ENOMEM);
76
Alexei Starovoitovdaaf4272014-11-18 17:32:16 -080077
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080078 /* allocate all map elements and zero-initialize them */
Alexei Starovoitovdaaf4272014-11-18 17:32:16 -080079 array = kzalloc(array_size, GFP_USER | __GFP_NOWARN);
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080080 if (!array) {
Alexei Starovoitovdaaf4272014-11-18 17:32:16 -080081 array = vzalloc(array_size);
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080082 if (!array)
83 return ERR_PTR(-ENOMEM);
84 }
85
86 /* copy mandatory map attributes */
Alexei Starovoitova10423b2016-02-01 22:39:54 -080087 array->map.map_type = attr->map_type;
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080088 array->map.key_size = attr->key_size;
89 array->map.value_size = attr->value_size;
90 array->map.max_entries = attr->max_entries;
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -080091 array->elem_size = elem_size;
92
Alexei Starovoitova10423b2016-02-01 22:39:54 -080093 if (!percpu)
94 goto out;
95
96 array_size += (u64) attr->max_entries * elem_size * num_possible_cpus();
97
98 if (array_size >= U32_MAX - PAGE_SIZE ||
99 elem_size > PCPU_MIN_UNIT_SIZE || bpf_array_alloc_percpu(array)) {
100 kvfree(array);
101 return ERR_PTR(-ENOMEM);
102 }
103out:
104 array->map.pages = round_up(array_size, PAGE_SIZE) >> PAGE_SHIFT;
105
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800106 return &array->map;
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800107}
108
109/* Called from syscall or from eBPF program */
110static void *array_map_lookup_elem(struct bpf_map *map, void *key)
111{
112 struct bpf_array *array = container_of(map, struct bpf_array, map);
113 u32 index = *(u32 *)key;
114
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800115 if (unlikely(index >= array->map.max_entries))
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800116 return NULL;
117
118 return array->value + array->elem_size * index;
119}
120
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800121/* Called from eBPF program */
122static void *percpu_array_map_lookup_elem(struct bpf_map *map, void *key)
123{
124 struct bpf_array *array = container_of(map, struct bpf_array, map);
125 u32 index = *(u32 *)key;
126
127 if (unlikely(index >= array->map.max_entries))
128 return NULL;
129
130 return this_cpu_ptr(array->pptrs[index]);
131}
132
Alexei Starovoitov15a07b32016-02-01 22:39:55 -0800133int bpf_percpu_array_copy(struct bpf_map *map, void *key, void *value)
134{
135 struct bpf_array *array = container_of(map, struct bpf_array, map);
136 u32 index = *(u32 *)key;
137 void __percpu *pptr;
138 int cpu, off = 0;
139 u32 size;
140
141 if (unlikely(index >= array->map.max_entries))
142 return -ENOENT;
143
144 /* per_cpu areas are zero-filled and bpf programs can only
145 * access 'value_size' of them, so copying rounded areas
146 * will not leak any kernel data
147 */
148 size = round_up(map->value_size, 8);
149 rcu_read_lock();
150 pptr = array->pptrs[index];
151 for_each_possible_cpu(cpu) {
152 bpf_long_memcpy(value + off, per_cpu_ptr(pptr, cpu), size);
153 off += size;
154 }
155 rcu_read_unlock();
156 return 0;
157}
158
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800159/* Called from syscall */
160static int array_map_get_next_key(struct bpf_map *map, void *key, void *next_key)
161{
162 struct bpf_array *array = container_of(map, struct bpf_array, map);
163 u32 index = *(u32 *)key;
164 u32 *next = (u32 *)next_key;
165
166 if (index >= array->map.max_entries) {
167 *next = 0;
168 return 0;
169 }
170
171 if (index == array->map.max_entries - 1)
172 return -ENOENT;
173
174 *next = index + 1;
175 return 0;
176}
177
178/* Called from syscall or from eBPF program */
179static int array_map_update_elem(struct bpf_map *map, void *key, void *value,
180 u64 map_flags)
181{
182 struct bpf_array *array = container_of(map, struct bpf_array, map);
183 u32 index = *(u32 *)key;
184
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800185 if (unlikely(map_flags > BPF_EXIST))
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800186 /* unknown flags */
187 return -EINVAL;
188
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800189 if (unlikely(index >= array->map.max_entries))
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800190 /* all elements were pre-allocated, cannot insert a new one */
191 return -E2BIG;
192
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800193 if (unlikely(map_flags == BPF_NOEXIST))
Alexei Starovoitovdaaf4272014-11-18 17:32:16 -0800194 /* all elements already exist */
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800195 return -EEXIST;
196
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800197 if (array->map.map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
198 memcpy(this_cpu_ptr(array->pptrs[index]),
199 value, map->value_size);
200 else
201 memcpy(array->value + array->elem_size * index,
202 value, map->value_size);
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800203 return 0;
204}
205
Alexei Starovoitov15a07b32016-02-01 22:39:55 -0800206int bpf_percpu_array_update(struct bpf_map *map, void *key, void *value,
207 u64 map_flags)
208{
209 struct bpf_array *array = container_of(map, struct bpf_array, map);
210 u32 index = *(u32 *)key;
211 void __percpu *pptr;
212 int cpu, off = 0;
213 u32 size;
214
215 if (unlikely(map_flags > BPF_EXIST))
216 /* unknown flags */
217 return -EINVAL;
218
219 if (unlikely(index >= array->map.max_entries))
220 /* all elements were pre-allocated, cannot insert a new one */
221 return -E2BIG;
222
223 if (unlikely(map_flags == BPF_NOEXIST))
224 /* all elements already exist */
225 return -EEXIST;
226
227 /* the user space will provide round_up(value_size, 8) bytes that
228 * will be copied into per-cpu area. bpf programs can only access
229 * value_size of it. During lookup the same extra bytes will be
230 * returned or zeros which were zero-filled by percpu_alloc,
231 * so no kernel data leaks possible
232 */
233 size = round_up(map->value_size, 8);
234 rcu_read_lock();
235 pptr = array->pptrs[index];
236 for_each_possible_cpu(cpu) {
237 bpf_long_memcpy(per_cpu_ptr(pptr, cpu), value + off, size);
238 off += size;
239 }
240 rcu_read_unlock();
241 return 0;
242}
243
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800244/* Called from syscall or from eBPF program */
245static int array_map_delete_elem(struct bpf_map *map, void *key)
246{
247 return -EINVAL;
248}
249
250/* Called when map->refcnt goes to zero, either from workqueue or from syscall */
251static void array_map_free(struct bpf_map *map)
252{
253 struct bpf_array *array = container_of(map, struct bpf_array, map);
254
255 /* at this point bpf_prog->aux->refcnt == 0 and this map->refcnt == 0,
256 * so the programs (can be more than one that used this map) were
257 * disconnected from events. Wait for outstanding programs to complete
258 * and free the array
259 */
260 synchronize_rcu();
261
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800262 if (array->map.map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
263 bpf_array_free_percpu(array);
264
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800265 kvfree(array);
266}
267
Daniel Borkmanna2c83ff2015-03-01 12:31:42 +0100268static const struct bpf_map_ops array_ops = {
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800269 .map_alloc = array_map_alloc,
270 .map_free = array_map_free,
271 .map_get_next_key = array_map_get_next_key,
272 .map_lookup_elem = array_map_lookup_elem,
273 .map_update_elem = array_map_update_elem,
274 .map_delete_elem = array_map_delete_elem,
275};
276
Daniel Borkmanna2c83ff2015-03-01 12:31:42 +0100277static struct bpf_map_type_list array_type __read_mostly = {
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800278 .ops = &array_ops,
279 .type = BPF_MAP_TYPE_ARRAY,
280};
281
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800282static const struct bpf_map_ops percpu_array_ops = {
283 .map_alloc = array_map_alloc,
284 .map_free = array_map_free,
285 .map_get_next_key = array_map_get_next_key,
286 .map_lookup_elem = percpu_array_map_lookup_elem,
287 .map_update_elem = array_map_update_elem,
288 .map_delete_elem = array_map_delete_elem,
289};
290
291static struct bpf_map_type_list percpu_array_type __read_mostly = {
292 .ops = &percpu_array_ops,
293 .type = BPF_MAP_TYPE_PERCPU_ARRAY,
294};
295
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800296static int __init register_array_map(void)
297{
Daniel Borkmanna2c83ff2015-03-01 12:31:42 +0100298 bpf_register_map_type(&array_type);
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800299 bpf_register_map_type(&percpu_array_type);
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800300 return 0;
301}
302late_initcall(register_array_map);
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700303
Wang Nan2a36f0b2015-08-06 07:02:33 +0000304static struct bpf_map *fd_array_map_alloc(union bpf_attr *attr)
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700305{
Wang Nan2a36f0b2015-08-06 07:02:33 +0000306 /* only file descriptors can be stored in this type of map */
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700307 if (attr->value_size != sizeof(u32))
308 return ERR_PTR(-EINVAL);
309 return array_map_alloc(attr);
310}
311
Wang Nan2a36f0b2015-08-06 07:02:33 +0000312static void fd_array_map_free(struct bpf_map *map)
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700313{
314 struct bpf_array *array = container_of(map, struct bpf_array, map);
315 int i;
316
317 synchronize_rcu();
318
319 /* make sure it's empty */
320 for (i = 0; i < array->map.max_entries; i++)
Wang Nan2a36f0b2015-08-06 07:02:33 +0000321 BUG_ON(array->ptrs[i] != NULL);
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700322 kvfree(array);
323}
324
Wang Nan2a36f0b2015-08-06 07:02:33 +0000325static void *fd_array_map_lookup_elem(struct bpf_map *map, void *key)
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700326{
327 return NULL;
328}
329
330/* only called from syscall */
Daniel Borkmannd056a782016-06-15 22:47:13 +0200331int bpf_fd_array_map_update_elem(struct bpf_map *map, struct file *map_file,
332 void *key, void *value, u64 map_flags)
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700333{
334 struct bpf_array *array = container_of(map, struct bpf_array, map);
Wang Nan2a36f0b2015-08-06 07:02:33 +0000335 void *new_ptr, *old_ptr;
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700336 u32 index = *(u32 *)key, ufd;
337
338 if (map_flags != BPF_ANY)
339 return -EINVAL;
340
341 if (index >= array->map.max_entries)
342 return -E2BIG;
343
344 ufd = *(u32 *)value;
Daniel Borkmannd056a782016-06-15 22:47:13 +0200345 new_ptr = map->ops->map_fd_get_ptr(map, map_file, ufd);
Wang Nan2a36f0b2015-08-06 07:02:33 +0000346 if (IS_ERR(new_ptr))
347 return PTR_ERR(new_ptr);
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700348
Wang Nan2a36f0b2015-08-06 07:02:33 +0000349 old_ptr = xchg(array->ptrs + index, new_ptr);
350 if (old_ptr)
351 map->ops->map_fd_put_ptr(old_ptr);
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700352
353 return 0;
354}
355
Wang Nan2a36f0b2015-08-06 07:02:33 +0000356static int fd_array_map_delete_elem(struct bpf_map *map, void *key)
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700357{
358 struct bpf_array *array = container_of(map, struct bpf_array, map);
Wang Nan2a36f0b2015-08-06 07:02:33 +0000359 void *old_ptr;
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700360 u32 index = *(u32 *)key;
361
362 if (index >= array->map.max_entries)
363 return -E2BIG;
364
Wang Nan2a36f0b2015-08-06 07:02:33 +0000365 old_ptr = xchg(array->ptrs + index, NULL);
366 if (old_ptr) {
367 map->ops->map_fd_put_ptr(old_ptr);
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700368 return 0;
369 } else {
370 return -ENOENT;
371 }
372}
373
Daniel Borkmannd056a782016-06-15 22:47:13 +0200374static void *prog_fd_array_get_ptr(struct bpf_map *map,
375 struct file *map_file, int fd)
Wang Nan2a36f0b2015-08-06 07:02:33 +0000376{
377 struct bpf_array *array = container_of(map, struct bpf_array, map);
378 struct bpf_prog *prog = bpf_prog_get(fd);
Daniel Borkmannd056a782016-06-15 22:47:13 +0200379
Wang Nan2a36f0b2015-08-06 07:02:33 +0000380 if (IS_ERR(prog))
381 return prog;
382
383 if (!bpf_prog_array_compatible(array, prog)) {
384 bpf_prog_put(prog);
385 return ERR_PTR(-EINVAL);
386 }
Daniel Borkmannd056a782016-06-15 22:47:13 +0200387
Wang Nan2a36f0b2015-08-06 07:02:33 +0000388 return prog;
389}
390
391static void prog_fd_array_put_ptr(void *ptr)
392{
393 struct bpf_prog *prog = ptr;
394
395 bpf_prog_put_rcu(prog);
396}
397
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700398/* decrement refcnt of all bpf_progs that are stored in this map */
Wang Nan2a36f0b2015-08-06 07:02:33 +0000399void bpf_fd_array_map_clear(struct bpf_map *map)
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700400{
401 struct bpf_array *array = container_of(map, struct bpf_array, map);
402 int i;
403
404 for (i = 0; i < array->map.max_entries; i++)
Wang Nan2a36f0b2015-08-06 07:02:33 +0000405 fd_array_map_delete_elem(map, &i);
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700406}
407
408static const struct bpf_map_ops prog_array_ops = {
Wang Nan2a36f0b2015-08-06 07:02:33 +0000409 .map_alloc = fd_array_map_alloc,
410 .map_free = fd_array_map_free,
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700411 .map_get_next_key = array_map_get_next_key,
Wang Nan2a36f0b2015-08-06 07:02:33 +0000412 .map_lookup_elem = fd_array_map_lookup_elem,
Wang Nan2a36f0b2015-08-06 07:02:33 +0000413 .map_delete_elem = fd_array_map_delete_elem,
414 .map_fd_get_ptr = prog_fd_array_get_ptr,
415 .map_fd_put_ptr = prog_fd_array_put_ptr,
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700416};
417
418static struct bpf_map_type_list prog_array_type __read_mostly = {
419 .ops = &prog_array_ops,
420 .type = BPF_MAP_TYPE_PROG_ARRAY,
421};
422
423static int __init register_prog_array_map(void)
424{
425 bpf_register_map_type(&prog_array_type);
426 return 0;
427}
428late_initcall(register_prog_array_map);
Kaixu Xiaea317b22015-08-06 07:02:34 +0000429
430static void perf_event_array_map_free(struct bpf_map *map)
431{
432 bpf_fd_array_map_clear(map);
433 fd_array_map_free(map);
434}
435
Daniel Borkmannd056a782016-06-15 22:47:13 +0200436static void *perf_event_fd_array_get_ptr(struct bpf_map *map,
437 struct file *map_file, int fd)
Kaixu Xiaea317b22015-08-06 07:02:34 +0000438{
439 struct perf_event *event;
440 const struct perf_event_attr *attr;
Alexei Starovoitove03e7ee2016-01-25 20:59:49 -0800441 struct file *file;
Kaixu Xiaea317b22015-08-06 07:02:34 +0000442
Alexei Starovoitove03e7ee2016-01-25 20:59:49 -0800443 file = perf_event_get(fd);
444 if (IS_ERR(file))
445 return file;
446
447 event = file->private_data;
Kaixu Xiaea317b22015-08-06 07:02:34 +0000448
449 attr = perf_event_attrs(event);
450 if (IS_ERR(attr))
Alexei Starovoitov62544ce2015-10-22 17:10:14 -0700451 goto err;
Kaixu Xiaea317b22015-08-06 07:02:34 +0000452
Alexei Starovoitov62544ce2015-10-22 17:10:14 -0700453 if (attr->inherit)
454 goto err;
455
456 if (attr->type == PERF_TYPE_RAW)
Alexei Starovoitove03e7ee2016-01-25 20:59:49 -0800457 return file;
Alexei Starovoitov62544ce2015-10-22 17:10:14 -0700458
459 if (attr->type == PERF_TYPE_HARDWARE)
Alexei Starovoitove03e7ee2016-01-25 20:59:49 -0800460 return file;
Alexei Starovoitov62544ce2015-10-22 17:10:14 -0700461
462 if (attr->type == PERF_TYPE_SOFTWARE &&
463 attr->config == PERF_COUNT_SW_BPF_OUTPUT)
Alexei Starovoitove03e7ee2016-01-25 20:59:49 -0800464 return file;
Alexei Starovoitov62544ce2015-10-22 17:10:14 -0700465err:
Alexei Starovoitove03e7ee2016-01-25 20:59:49 -0800466 fput(file);
Alexei Starovoitov62544ce2015-10-22 17:10:14 -0700467 return ERR_PTR(-EINVAL);
Kaixu Xiaea317b22015-08-06 07:02:34 +0000468}
469
470static void perf_event_fd_array_put_ptr(void *ptr)
471{
Alexei Starovoitove03e7ee2016-01-25 20:59:49 -0800472 fput((struct file *)ptr);
Kaixu Xiaea317b22015-08-06 07:02:34 +0000473}
474
475static const struct bpf_map_ops perf_event_array_ops = {
476 .map_alloc = fd_array_map_alloc,
477 .map_free = perf_event_array_map_free,
478 .map_get_next_key = array_map_get_next_key,
479 .map_lookup_elem = fd_array_map_lookup_elem,
Kaixu Xiaea317b22015-08-06 07:02:34 +0000480 .map_delete_elem = fd_array_map_delete_elem,
481 .map_fd_get_ptr = perf_event_fd_array_get_ptr,
482 .map_fd_put_ptr = perf_event_fd_array_put_ptr,
483};
484
485static struct bpf_map_type_list perf_event_array_type __read_mostly = {
486 .ops = &perf_event_array_ops,
487 .type = BPF_MAP_TYPE_PERF_EVENT_ARRAY,
488};
489
490static int __init register_perf_event_array_map(void)
491{
492 bpf_register_map_type(&perf_event_array_type);
493 return 0;
494}
495late_initcall(register_perf_event_array_map);