Loading...
1// SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
2/* Copyright (C) 2017-2018 Netronome Systems, Inc. */
3
4#include <assert.h>
5#include <errno.h>
6#include <fcntl.h>
7#include <linux/err.h>
8#include <linux/kernel.h>
9#include <net/if.h>
10#include <stdbool.h>
11#include <stdio.h>
12#include <stdlib.h>
13#include <string.h>
14#include <unistd.h>
15#include <sys/types.h>
16#include <sys/stat.h>
17
18#include <bpf/bpf.h>
19#include <bpf/btf.h>
20
21#include "json_writer.h"
22#include "main.h"
23
24const char * const map_type_name[] = {
25 [BPF_MAP_TYPE_UNSPEC] = "unspec",
26 [BPF_MAP_TYPE_HASH] = "hash",
27 [BPF_MAP_TYPE_ARRAY] = "array",
28 [BPF_MAP_TYPE_PROG_ARRAY] = "prog_array",
29 [BPF_MAP_TYPE_PERF_EVENT_ARRAY] = "perf_event_array",
30 [BPF_MAP_TYPE_PERCPU_HASH] = "percpu_hash",
31 [BPF_MAP_TYPE_PERCPU_ARRAY] = "percpu_array",
32 [BPF_MAP_TYPE_STACK_TRACE] = "stack_trace",
33 [BPF_MAP_TYPE_CGROUP_ARRAY] = "cgroup_array",
34 [BPF_MAP_TYPE_LRU_HASH] = "lru_hash",
35 [BPF_MAP_TYPE_LRU_PERCPU_HASH] = "lru_percpu_hash",
36 [BPF_MAP_TYPE_LPM_TRIE] = "lpm_trie",
37 [BPF_MAP_TYPE_ARRAY_OF_MAPS] = "array_of_maps",
38 [BPF_MAP_TYPE_HASH_OF_MAPS] = "hash_of_maps",
39 [BPF_MAP_TYPE_DEVMAP] = "devmap",
40 [BPF_MAP_TYPE_DEVMAP_HASH] = "devmap_hash",
41 [BPF_MAP_TYPE_SOCKMAP] = "sockmap",
42 [BPF_MAP_TYPE_CPUMAP] = "cpumap",
43 [BPF_MAP_TYPE_XSKMAP] = "xskmap",
44 [BPF_MAP_TYPE_SOCKHASH] = "sockhash",
45 [BPF_MAP_TYPE_CGROUP_STORAGE] = "cgroup_storage",
46 [BPF_MAP_TYPE_REUSEPORT_SOCKARRAY] = "reuseport_sockarray",
47 [BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE] = "percpu_cgroup_storage",
48 [BPF_MAP_TYPE_QUEUE] = "queue",
49 [BPF_MAP_TYPE_STACK] = "stack",
50 [BPF_MAP_TYPE_SK_STORAGE] = "sk_storage",
51 [BPF_MAP_TYPE_STRUCT_OPS] = "struct_ops",
52 [BPF_MAP_TYPE_RINGBUF] = "ringbuf",
53 [BPF_MAP_TYPE_INODE_STORAGE] = "inode_storage",
54 [BPF_MAP_TYPE_TASK_STORAGE] = "task_storage",
55};
56
57const size_t map_type_name_size = ARRAY_SIZE(map_type_name);
58
59static bool map_is_per_cpu(__u32 type)
60{
61 return type == BPF_MAP_TYPE_PERCPU_HASH ||
62 type == BPF_MAP_TYPE_PERCPU_ARRAY ||
63 type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
64 type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE;
65}
66
67static bool map_is_map_of_maps(__u32 type)
68{
69 return type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
70 type == BPF_MAP_TYPE_HASH_OF_MAPS;
71}
72
73static bool map_is_map_of_progs(__u32 type)
74{
75 return type == BPF_MAP_TYPE_PROG_ARRAY;
76}
77
78static int map_type_from_str(const char *type)
79{
80 unsigned int i;
81
82 for (i = 0; i < ARRAY_SIZE(map_type_name); i++)
83 /* Don't allow prefixing in case of possible future shadowing */
84 if (map_type_name[i] && !strcmp(map_type_name[i], type))
85 return i;
86 return -1;
87}
88
89static void *alloc_value(struct bpf_map_info *info)
90{
91 if (map_is_per_cpu(info->type))
92 return malloc(round_up(info->value_size, 8) *
93 get_possible_cpus());
94 else
95 return malloc(info->value_size);
96}
97
98static int do_dump_btf(const struct btf_dumper *d,
99 struct bpf_map_info *map_info, void *key,
100 void *value)
101{
102 __u32 value_id;
103 int ret = 0;
104
105 /* start of key-value pair */
106 jsonw_start_object(d->jw);
107
108 if (map_info->btf_key_type_id) {
109 jsonw_name(d->jw, "key");
110
111 ret = btf_dumper_type(d, map_info->btf_key_type_id, key);
112 if (ret)
113 goto err_end_obj;
114 }
115
116 value_id = map_info->btf_vmlinux_value_type_id ?
117 : map_info->btf_value_type_id;
118
119 if (!map_is_per_cpu(map_info->type)) {
120 jsonw_name(d->jw, "value");
121 ret = btf_dumper_type(d, value_id, value);
122 } else {
123 unsigned int i, n, step;
124
125 jsonw_name(d->jw, "values");
126 jsonw_start_array(d->jw);
127 n = get_possible_cpus();
128 step = round_up(map_info->value_size, 8);
129 for (i = 0; i < n; i++) {
130 jsonw_start_object(d->jw);
131 jsonw_int_field(d->jw, "cpu", i);
132 jsonw_name(d->jw, "value");
133 ret = btf_dumper_type(d, value_id, value + i * step);
134 jsonw_end_object(d->jw);
135 if (ret)
136 break;
137 }
138 jsonw_end_array(d->jw);
139 }
140
141err_end_obj:
142 /* end of key-value pair */
143 jsonw_end_object(d->jw);
144
145 return ret;
146}
147
148static json_writer_t *get_btf_writer(void)
149{
150 json_writer_t *jw = jsonw_new(stdout);
151
152 if (!jw)
153 return NULL;
154 jsonw_pretty(jw, true);
155
156 return jw;
157}
158
159static void print_entry_json(struct bpf_map_info *info, unsigned char *key,
160 unsigned char *value, struct btf *btf)
161{
162 jsonw_start_object(json_wtr);
163
164 if (!map_is_per_cpu(info->type)) {
165 jsonw_name(json_wtr, "key");
166 print_hex_data_json(key, info->key_size);
167 jsonw_name(json_wtr, "value");
168 print_hex_data_json(value, info->value_size);
169 if (btf) {
170 struct btf_dumper d = {
171 .btf = btf,
172 .jw = json_wtr,
173 .is_plain_text = false,
174 };
175
176 jsonw_name(json_wtr, "formatted");
177 do_dump_btf(&d, info, key, value);
178 }
179 } else {
180 unsigned int i, n, step;
181
182 n = get_possible_cpus();
183 step = round_up(info->value_size, 8);
184
185 jsonw_name(json_wtr, "key");
186 print_hex_data_json(key, info->key_size);
187
188 jsonw_name(json_wtr, "values");
189 jsonw_start_array(json_wtr);
190 for (i = 0; i < n; i++) {
191 jsonw_start_object(json_wtr);
192
193 jsonw_int_field(json_wtr, "cpu", i);
194
195 jsonw_name(json_wtr, "value");
196 print_hex_data_json(value + i * step,
197 info->value_size);
198
199 jsonw_end_object(json_wtr);
200 }
201 jsonw_end_array(json_wtr);
202 if (btf) {
203 struct btf_dumper d = {
204 .btf = btf,
205 .jw = json_wtr,
206 .is_plain_text = false,
207 };
208
209 jsonw_name(json_wtr, "formatted");
210 do_dump_btf(&d, info, key, value);
211 }
212 }
213
214 jsonw_end_object(json_wtr);
215}
216
217static void
218print_entry_error_msg(struct bpf_map_info *info, unsigned char *key,
219 const char *error_msg)
220{
221 int msg_size = strlen(error_msg);
222 bool single_line, break_names;
223
224 break_names = info->key_size > 16 || msg_size > 16;
225 single_line = info->key_size + msg_size <= 24 && !break_names;
226
227 printf("key:%c", break_names ? '\n' : ' ');
228 fprint_hex(stdout, key, info->key_size, " ");
229
230 printf(single_line ? " " : "\n");
231
232 printf("value:%c%s", break_names ? '\n' : ' ', error_msg);
233
234 printf("\n");
235}
236
237static void
238print_entry_error(struct bpf_map_info *map_info, void *key, int lookup_errno)
239{
240 /* For prog_array maps or arrays of maps, failure to lookup the value
241 * means there is no entry for that key. Do not print an error message
242 * in that case.
243 */
244 if ((map_is_map_of_maps(map_info->type) ||
245 map_is_map_of_progs(map_info->type)) && lookup_errno == ENOENT)
246 return;
247
248 if (json_output) {
249 jsonw_start_object(json_wtr); /* entry */
250 jsonw_name(json_wtr, "key");
251 print_hex_data_json(key, map_info->key_size);
252 jsonw_name(json_wtr, "value");
253 jsonw_start_object(json_wtr); /* error */
254 jsonw_string_field(json_wtr, "error", strerror(lookup_errno));
255 jsonw_end_object(json_wtr); /* error */
256 jsonw_end_object(json_wtr); /* entry */
257 } else {
258 const char *msg = NULL;
259
260 if (lookup_errno == ENOENT)
261 msg = "<no entry>";
262 else if (lookup_errno == ENOSPC &&
263 map_info->type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY)
264 msg = "<cannot read>";
265
266 print_entry_error_msg(map_info, key,
267 msg ? : strerror(lookup_errno));
268 }
269}
270
271static void print_entry_plain(struct bpf_map_info *info, unsigned char *key,
272 unsigned char *value)
273{
274 if (!map_is_per_cpu(info->type)) {
275 bool single_line, break_names;
276
277 break_names = info->key_size > 16 || info->value_size > 16;
278 single_line = info->key_size + info->value_size <= 24 &&
279 !break_names;
280
281 if (info->key_size) {
282 printf("key:%c", break_names ? '\n' : ' ');
283 fprint_hex(stdout, key, info->key_size, " ");
284
285 printf(single_line ? " " : "\n");
286 }
287
288 if (info->value_size) {
289 printf("value:%c", break_names ? '\n' : ' ');
290 fprint_hex(stdout, value, info->value_size, " ");
291 }
292
293 printf("\n");
294 } else {
295 unsigned int i, n, step;
296
297 n = get_possible_cpus();
298 step = round_up(info->value_size, 8);
299
300 if (info->key_size) {
301 printf("key:\n");
302 fprint_hex(stdout, key, info->key_size, " ");
303 printf("\n");
304 }
305 if (info->value_size) {
306 for (i = 0; i < n; i++) {
307 printf("value (CPU %02d):%c",
308 i, info->value_size > 16 ? '\n' : ' ');
309 fprint_hex(stdout, value + i * step,
310 info->value_size, " ");
311 printf("\n");
312 }
313 }
314 }
315}
316
317static char **parse_bytes(char **argv, const char *name, unsigned char *val,
318 unsigned int n)
319{
320 unsigned int i = 0, base = 0;
321 char *endptr;
322
323 if (is_prefix(*argv, "hex")) {
324 base = 16;
325 argv++;
326 }
327
328 while (i < n && argv[i]) {
329 val[i] = strtoul(argv[i], &endptr, base);
330 if (*endptr) {
331 p_err("error parsing byte: %s", argv[i]);
332 return NULL;
333 }
334 i++;
335 }
336
337 if (i != n) {
338 p_err("%s expected %d bytes got %d", name, n, i);
339 return NULL;
340 }
341
342 return argv + i;
343}
344
345/* on per cpu maps we must copy the provided value on all value instances */
346static void fill_per_cpu_value(struct bpf_map_info *info, void *value)
347{
348 unsigned int i, n, step;
349
350 if (!map_is_per_cpu(info->type))
351 return;
352
353 n = get_possible_cpus();
354 step = round_up(info->value_size, 8);
355 for (i = 1; i < n; i++)
356 memcpy(value + i * step, value, info->value_size);
357}
358
359static int parse_elem(char **argv, struct bpf_map_info *info,
360 void *key, void *value, __u32 key_size, __u32 value_size,
361 __u32 *flags, __u32 **value_fd)
362{
363 if (!*argv) {
364 if (!key && !value)
365 return 0;
366 p_err("did not find %s", key ? "key" : "value");
367 return -1;
368 }
369
370 if (is_prefix(*argv, "key")) {
371 if (!key) {
372 if (key_size)
373 p_err("duplicate key");
374 else
375 p_err("unnecessary key");
376 return -1;
377 }
378
379 argv = parse_bytes(argv + 1, "key", key, key_size);
380 if (!argv)
381 return -1;
382
383 return parse_elem(argv, info, NULL, value, key_size, value_size,
384 flags, value_fd);
385 } else if (is_prefix(*argv, "value")) {
386 int fd;
387
388 if (!value) {
389 if (value_size)
390 p_err("duplicate value");
391 else
392 p_err("unnecessary value");
393 return -1;
394 }
395
396 argv++;
397
398 if (map_is_map_of_maps(info->type)) {
399 int argc = 2;
400
401 if (value_size != 4) {
402 p_err("value smaller than 4B for map in map?");
403 return -1;
404 }
405 if (!argv[0] || !argv[1]) {
406 p_err("not enough value arguments for map in map");
407 return -1;
408 }
409
410 fd = map_parse_fd(&argc, &argv);
411 if (fd < 0)
412 return -1;
413
414 *value_fd = value;
415 **value_fd = fd;
416 } else if (map_is_map_of_progs(info->type)) {
417 int argc = 2;
418
419 if (value_size != 4) {
420 p_err("value smaller than 4B for map of progs?");
421 return -1;
422 }
423 if (!argv[0] || !argv[1]) {
424 p_err("not enough value arguments for map of progs");
425 return -1;
426 }
427 if (is_prefix(*argv, "id"))
428 p_info("Warning: updating program array via MAP_ID, make sure this map is kept open\n"
429 " by some process or pinned otherwise update will be lost");
430
431 fd = prog_parse_fd(&argc, &argv);
432 if (fd < 0)
433 return -1;
434
435 *value_fd = value;
436 **value_fd = fd;
437 } else {
438 argv = parse_bytes(argv, "value", value, value_size);
439 if (!argv)
440 return -1;
441
442 fill_per_cpu_value(info, value);
443 }
444
445 return parse_elem(argv, info, key, NULL, key_size, value_size,
446 flags, NULL);
447 } else if (is_prefix(*argv, "any") || is_prefix(*argv, "noexist") ||
448 is_prefix(*argv, "exist")) {
449 if (!flags) {
450 p_err("flags specified multiple times: %s", *argv);
451 return -1;
452 }
453
454 if (is_prefix(*argv, "any"))
455 *flags = BPF_ANY;
456 else if (is_prefix(*argv, "noexist"))
457 *flags = BPF_NOEXIST;
458 else if (is_prefix(*argv, "exist"))
459 *flags = BPF_EXIST;
460
461 return parse_elem(argv + 1, info, key, value, key_size,
462 value_size, NULL, value_fd);
463 }
464
465 p_err("expected key or value, got: %s", *argv);
466 return -1;
467}
468
469static void show_map_header_json(struct bpf_map_info *info, json_writer_t *wtr)
470{
471 jsonw_uint_field(wtr, "id", info->id);
472 if (info->type < ARRAY_SIZE(map_type_name))
473 jsonw_string_field(wtr, "type", map_type_name[info->type]);
474 else
475 jsonw_uint_field(wtr, "type", info->type);
476
477 if (*info->name)
478 jsonw_string_field(wtr, "name", info->name);
479
480 jsonw_name(wtr, "flags");
481 jsonw_printf(wtr, "%d", info->map_flags);
482}
483
484static int show_map_close_json(int fd, struct bpf_map_info *info)
485{
486 char *memlock, *frozen_str;
487 int frozen = 0;
488
489 memlock = get_fdinfo(fd, "memlock");
490 frozen_str = get_fdinfo(fd, "frozen");
491
492 jsonw_start_object(json_wtr);
493
494 show_map_header_json(info, json_wtr);
495
496 print_dev_json(info->ifindex, info->netns_dev, info->netns_ino);
497
498 jsonw_uint_field(json_wtr, "bytes_key", info->key_size);
499 jsonw_uint_field(json_wtr, "bytes_value", info->value_size);
500 jsonw_uint_field(json_wtr, "max_entries", info->max_entries);
501
502 if (memlock)
503 jsonw_int_field(json_wtr, "bytes_memlock", atoi(memlock));
504 free(memlock);
505
506 if (info->type == BPF_MAP_TYPE_PROG_ARRAY) {
507 char *owner_prog_type = get_fdinfo(fd, "owner_prog_type");
508 char *owner_jited = get_fdinfo(fd, "owner_jited");
509
510 if (owner_prog_type) {
511 unsigned int prog_type = atoi(owner_prog_type);
512
513 if (prog_type < prog_type_name_size)
514 jsonw_string_field(json_wtr, "owner_prog_type",
515 prog_type_name[prog_type]);
516 else
517 jsonw_uint_field(json_wtr, "owner_prog_type",
518 prog_type);
519 }
520 if (owner_jited)
521 jsonw_bool_field(json_wtr, "owner_jited",
522 !!atoi(owner_jited));
523
524 free(owner_prog_type);
525 free(owner_jited);
526 }
527 close(fd);
528
529 if (frozen_str) {
530 frozen = atoi(frozen_str);
531 free(frozen_str);
532 }
533 jsonw_int_field(json_wtr, "frozen", frozen);
534
535 if (info->btf_id)
536 jsonw_int_field(json_wtr, "btf_id", info->btf_id);
537
538 if (!hash_empty(map_table.table)) {
539 struct pinned_obj *obj;
540
541 jsonw_name(json_wtr, "pinned");
542 jsonw_start_array(json_wtr);
543 hash_for_each_possible(map_table.table, obj, hash, info->id) {
544 if (obj->id == info->id)
545 jsonw_string(json_wtr, obj->path);
546 }
547 jsonw_end_array(json_wtr);
548 }
549
550 emit_obj_refs_json(&refs_table, info->id, json_wtr);
551
552 jsonw_end_object(json_wtr);
553
554 return 0;
555}
556
557static void show_map_header_plain(struct bpf_map_info *info)
558{
559 printf("%u: ", info->id);
560 if (info->type < ARRAY_SIZE(map_type_name))
561 printf("%s ", map_type_name[info->type]);
562 else
563 printf("type %u ", info->type);
564
565 if (*info->name)
566 printf("name %s ", info->name);
567
568 printf("flags 0x%x", info->map_flags);
569 print_dev_plain(info->ifindex, info->netns_dev, info->netns_ino);
570 printf("\n");
571}
572
573static int show_map_close_plain(int fd, struct bpf_map_info *info)
574{
575 char *memlock, *frozen_str;
576 int frozen = 0;
577
578 memlock = get_fdinfo(fd, "memlock");
579 frozen_str = get_fdinfo(fd, "frozen");
580
581 show_map_header_plain(info);
582 printf("\tkey %uB value %uB max_entries %u",
583 info->key_size, info->value_size, info->max_entries);
584
585 if (memlock)
586 printf(" memlock %sB", memlock);
587 free(memlock);
588
589 if (info->type == BPF_MAP_TYPE_PROG_ARRAY) {
590 char *owner_prog_type = get_fdinfo(fd, "owner_prog_type");
591 char *owner_jited = get_fdinfo(fd, "owner_jited");
592
593 if (owner_prog_type || owner_jited)
594 printf("\n\t");
595 if (owner_prog_type) {
596 unsigned int prog_type = atoi(owner_prog_type);
597
598 if (prog_type < prog_type_name_size)
599 printf("owner_prog_type %s ",
600 prog_type_name[prog_type]);
601 else
602 printf("owner_prog_type %d ", prog_type);
603 }
604 if (owner_jited)
605 printf("owner%s jited",
606 atoi(owner_jited) ? "" : " not");
607
608 free(owner_prog_type);
609 free(owner_jited);
610 }
611 close(fd);
612
613 if (!hash_empty(map_table.table)) {
614 struct pinned_obj *obj;
615
616 hash_for_each_possible(map_table.table, obj, hash, info->id) {
617 if (obj->id == info->id)
618 printf("\n\tpinned %s", obj->path);
619 }
620 }
621 printf("\n");
622
623 if (frozen_str) {
624 frozen = atoi(frozen_str);
625 free(frozen_str);
626 }
627
628 if (!info->btf_id && !frozen)
629 return 0;
630
631 printf("\t");
632
633 if (info->btf_id)
634 printf("btf_id %d", info->btf_id);
635
636 if (frozen)
637 printf("%sfrozen", info->btf_id ? " " : "");
638
639 emit_obj_refs_plain(&refs_table, info->id, "\n\tpids ");
640
641 printf("\n");
642 return 0;
643}
644
645static int do_show_subset(int argc, char **argv)
646{
647 struct bpf_map_info info = {};
648 __u32 len = sizeof(info);
649 int *fds = NULL;
650 int nb_fds, i;
651 int err = -1;
652
653 fds = malloc(sizeof(int));
654 if (!fds) {
655 p_err("mem alloc failed");
656 return -1;
657 }
658 nb_fds = map_parse_fds(&argc, &argv, &fds);
659 if (nb_fds < 1)
660 goto exit_free;
661
662 if (json_output && nb_fds > 1)
663 jsonw_start_array(json_wtr); /* root array */
664 for (i = 0; i < nb_fds; i++) {
665 err = bpf_obj_get_info_by_fd(fds[i], &info, &len);
666 if (err) {
667 p_err("can't get map info: %s",
668 strerror(errno));
669 for (; i < nb_fds; i++)
670 close(fds[i]);
671 break;
672 }
673
674 if (json_output)
675 show_map_close_json(fds[i], &info);
676 else
677 show_map_close_plain(fds[i], &info);
678
679 close(fds[i]);
680 }
681 if (json_output && nb_fds > 1)
682 jsonw_end_array(json_wtr); /* root array */
683
684exit_free:
685 free(fds);
686 return err;
687}
688
689static int do_show(int argc, char **argv)
690{
691 struct bpf_map_info info = {};
692 __u32 len = sizeof(info);
693 __u32 id = 0;
694 int err;
695 int fd;
696
697 if (show_pinned)
698 build_pinned_obj_table(&map_table, BPF_OBJ_MAP);
699 build_obj_refs_table(&refs_table, BPF_OBJ_MAP);
700
701 if (argc == 2)
702 return do_show_subset(argc, argv);
703
704 if (argc)
705 return BAD_ARG();
706
707 if (json_output)
708 jsonw_start_array(json_wtr);
709 while (true) {
710 err = bpf_map_get_next_id(id, &id);
711 if (err) {
712 if (errno == ENOENT)
713 break;
714 p_err("can't get next map: %s%s", strerror(errno),
715 errno == EINVAL ? " -- kernel too old?" : "");
716 break;
717 }
718
719 fd = bpf_map_get_fd_by_id(id);
720 if (fd < 0) {
721 if (errno == ENOENT)
722 continue;
723 p_err("can't get map by id (%u): %s",
724 id, strerror(errno));
725 break;
726 }
727
728 err = bpf_obj_get_info_by_fd(fd, &info, &len);
729 if (err) {
730 p_err("can't get map info: %s", strerror(errno));
731 close(fd);
732 break;
733 }
734
735 if (json_output)
736 show_map_close_json(fd, &info);
737 else
738 show_map_close_plain(fd, &info);
739 }
740 if (json_output)
741 jsonw_end_array(json_wtr);
742
743 delete_obj_refs_table(&refs_table);
744
745 return errno == ENOENT ? 0 : -1;
746}
747
748static int dump_map_elem(int fd, void *key, void *value,
749 struct bpf_map_info *map_info, struct btf *btf,
750 json_writer_t *btf_wtr)
751{
752 if (bpf_map_lookup_elem(fd, key, value)) {
753 print_entry_error(map_info, key, errno);
754 return -1;
755 }
756
757 if (json_output) {
758 print_entry_json(map_info, key, value, btf);
759 } else if (btf) {
760 struct btf_dumper d = {
761 .btf = btf,
762 .jw = btf_wtr,
763 .is_plain_text = true,
764 };
765
766 do_dump_btf(&d, map_info, key, value);
767 } else {
768 print_entry_plain(map_info, key, value);
769 }
770
771 return 0;
772}
773
774static int maps_have_btf(int *fds, int nb_fds)
775{
776 struct bpf_map_info info = {};
777 __u32 len = sizeof(info);
778 int err, i;
779
780 for (i = 0; i < nb_fds; i++) {
781 err = bpf_obj_get_info_by_fd(fds[i], &info, &len);
782 if (err) {
783 p_err("can't get map info: %s", strerror(errno));
784 return -1;
785 }
786
787 if (!info.btf_id)
788 return 0;
789 }
790
791 return 1;
792}
793
794static struct btf *btf_vmlinux;
795
796static struct btf *get_map_kv_btf(const struct bpf_map_info *info)
797{
798 struct btf *btf = NULL;
799
800 if (info->btf_vmlinux_value_type_id) {
801 if (!btf_vmlinux) {
802 btf_vmlinux = libbpf_find_kernel_btf();
803 if (IS_ERR(btf_vmlinux))
804 p_err("failed to get kernel btf");
805 }
806 return btf_vmlinux;
807 } else if (info->btf_value_type_id) {
808 int err;
809
810 err = btf__get_from_id(info->btf_id, &btf);
811 if (err || !btf) {
812 p_err("failed to get btf");
813 btf = err ? ERR_PTR(err) : ERR_PTR(-ESRCH);
814 }
815 }
816
817 return btf;
818}
819
820static void free_map_kv_btf(struct btf *btf)
821{
822 if (!IS_ERR(btf) && btf != btf_vmlinux)
823 btf__free(btf);
824}
825
826static void free_btf_vmlinux(void)
827{
828 if (!IS_ERR(btf_vmlinux))
829 btf__free(btf_vmlinux);
830}
831
832static int
833map_dump(int fd, struct bpf_map_info *info, json_writer_t *wtr,
834 bool show_header)
835{
836 void *key, *value, *prev_key;
837 unsigned int num_elems = 0;
838 struct btf *btf = NULL;
839 int err;
840
841 key = malloc(info->key_size);
842 value = alloc_value(info);
843 if (!key || !value) {
844 p_err("mem alloc failed");
845 err = -1;
846 goto exit_free;
847 }
848
849 prev_key = NULL;
850
851 if (wtr) {
852 btf = get_map_kv_btf(info);
853 if (IS_ERR(btf)) {
854 err = PTR_ERR(btf);
855 goto exit_free;
856 }
857
858 if (show_header) {
859 jsonw_start_object(wtr); /* map object */
860 show_map_header_json(info, wtr);
861 jsonw_name(wtr, "elements");
862 }
863 jsonw_start_array(wtr); /* elements */
864 } else if (show_header) {
865 show_map_header_plain(info);
866 }
867
868 if (info->type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY &&
869 info->value_size != 8)
870 p_info("Warning: cannot read values from %s map with value_size != 8",
871 map_type_name[info->type]);
872 while (true) {
873 err = bpf_map_get_next_key(fd, prev_key, key);
874 if (err) {
875 if (errno == ENOENT)
876 err = 0;
877 break;
878 }
879 if (!dump_map_elem(fd, key, value, info, btf, wtr))
880 num_elems++;
881 prev_key = key;
882 }
883
884 if (wtr) {
885 jsonw_end_array(wtr); /* elements */
886 if (show_header)
887 jsonw_end_object(wtr); /* map object */
888 } else {
889 printf("Found %u element%s\n", num_elems,
890 num_elems != 1 ? "s" : "");
891 }
892
893exit_free:
894 free(key);
895 free(value);
896 close(fd);
897 free_map_kv_btf(btf);
898
899 return err;
900}
901
902static int do_dump(int argc, char **argv)
903{
904 json_writer_t *wtr = NULL, *btf_wtr = NULL;
905 struct bpf_map_info info = {};
906 int nb_fds, i = 0;
907 __u32 len = sizeof(info);
908 int *fds = NULL;
909 int err = -1;
910
911 if (argc != 2)
912 usage();
913
914 fds = malloc(sizeof(int));
915 if (!fds) {
916 p_err("mem alloc failed");
917 return -1;
918 }
919 nb_fds = map_parse_fds(&argc, &argv, &fds);
920 if (nb_fds < 1)
921 goto exit_free;
922
923 if (json_output) {
924 wtr = json_wtr;
925 } else {
926 int do_plain_btf;
927
928 do_plain_btf = maps_have_btf(fds, nb_fds);
929 if (do_plain_btf < 0)
930 goto exit_close;
931
932 if (do_plain_btf) {
933 btf_wtr = get_btf_writer();
934 wtr = btf_wtr;
935 if (!btf_wtr)
936 p_info("failed to create json writer for btf. falling back to plain output");
937 }
938 }
939
940 if (wtr && nb_fds > 1)
941 jsonw_start_array(wtr); /* root array */
942 for (i = 0; i < nb_fds; i++) {
943 if (bpf_obj_get_info_by_fd(fds[i], &info, &len)) {
944 p_err("can't get map info: %s", strerror(errno));
945 break;
946 }
947 err = map_dump(fds[i], &info, wtr, nb_fds > 1);
948 if (!wtr && i != nb_fds - 1)
949 printf("\n");
950
951 if (err)
952 break;
953 close(fds[i]);
954 }
955 if (wtr && nb_fds > 1)
956 jsonw_end_array(wtr); /* root array */
957
958 if (btf_wtr)
959 jsonw_destroy(&btf_wtr);
960exit_close:
961 for (; i < nb_fds; i++)
962 close(fds[i]);
963exit_free:
964 free(fds);
965 free_btf_vmlinux();
966 return err;
967}
968
969static int alloc_key_value(struct bpf_map_info *info, void **key, void **value)
970{
971 *key = NULL;
972 *value = NULL;
973
974 if (info->key_size) {
975 *key = malloc(info->key_size);
976 if (!*key) {
977 p_err("key mem alloc failed");
978 return -1;
979 }
980 }
981
982 if (info->value_size) {
983 *value = alloc_value(info);
984 if (!*value) {
985 p_err("value mem alloc failed");
986 free(*key);
987 *key = NULL;
988 return -1;
989 }
990 }
991
992 return 0;
993}
994
995static int do_update(int argc, char **argv)
996{
997 struct bpf_map_info info = {};
998 __u32 len = sizeof(info);
999 __u32 *value_fd = NULL;
1000 __u32 flags = BPF_ANY;
1001 void *key, *value;
1002 int fd, err;
1003
1004 if (argc < 2)
1005 usage();
1006
1007 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1008 if (fd < 0)
1009 return -1;
1010
1011 err = alloc_key_value(&info, &key, &value);
1012 if (err)
1013 goto exit_free;
1014
1015 err = parse_elem(argv, &info, key, value, info.key_size,
1016 info.value_size, &flags, &value_fd);
1017 if (err)
1018 goto exit_free;
1019
1020 err = bpf_map_update_elem(fd, key, value, flags);
1021 if (err) {
1022 p_err("update failed: %s", strerror(errno));
1023 goto exit_free;
1024 }
1025
1026exit_free:
1027 if (value_fd)
1028 close(*value_fd);
1029 free(key);
1030 free(value);
1031 close(fd);
1032
1033 if (!err && json_output)
1034 jsonw_null(json_wtr);
1035 return err;
1036}
1037
1038static void print_key_value(struct bpf_map_info *info, void *key,
1039 void *value)
1040{
1041 json_writer_t *btf_wtr;
1042 struct btf *btf = NULL;
1043 int err;
1044
1045 err = btf__get_from_id(info->btf_id, &btf);
1046 if (err) {
1047 p_err("failed to get btf");
1048 return;
1049 }
1050
1051 if (json_output) {
1052 print_entry_json(info, key, value, btf);
1053 } else if (btf) {
1054 /* if here json_wtr wouldn't have been initialised,
1055 * so let's create separate writer for btf
1056 */
1057 btf_wtr = get_btf_writer();
1058 if (!btf_wtr) {
1059 p_info("failed to create json writer for btf. falling back to plain output");
1060 btf__free(btf);
1061 btf = NULL;
1062 print_entry_plain(info, key, value);
1063 } else {
1064 struct btf_dumper d = {
1065 .btf = btf,
1066 .jw = btf_wtr,
1067 .is_plain_text = true,
1068 };
1069
1070 do_dump_btf(&d, info, key, value);
1071 jsonw_destroy(&btf_wtr);
1072 }
1073 } else {
1074 print_entry_plain(info, key, value);
1075 }
1076 btf__free(btf);
1077}
1078
1079static int do_lookup(int argc, char **argv)
1080{
1081 struct bpf_map_info info = {};
1082 __u32 len = sizeof(info);
1083 void *key, *value;
1084 int err;
1085 int fd;
1086
1087 if (argc < 2)
1088 usage();
1089
1090 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1091 if (fd < 0)
1092 return -1;
1093
1094 err = alloc_key_value(&info, &key, &value);
1095 if (err)
1096 goto exit_free;
1097
1098 err = parse_elem(argv, &info, key, NULL, info.key_size, 0, NULL, NULL);
1099 if (err)
1100 goto exit_free;
1101
1102 err = bpf_map_lookup_elem(fd, key, value);
1103 if (err) {
1104 if (errno == ENOENT) {
1105 if (json_output) {
1106 jsonw_null(json_wtr);
1107 } else {
1108 printf("key:\n");
1109 fprint_hex(stdout, key, info.key_size, " ");
1110 printf("\n\nNot found\n");
1111 }
1112 } else {
1113 p_err("lookup failed: %s", strerror(errno));
1114 }
1115
1116 goto exit_free;
1117 }
1118
1119 /* here means bpf_map_lookup_elem() succeeded */
1120 print_key_value(&info, key, value);
1121
1122exit_free:
1123 free(key);
1124 free(value);
1125 close(fd);
1126
1127 return err;
1128}
1129
1130static int do_getnext(int argc, char **argv)
1131{
1132 struct bpf_map_info info = {};
1133 __u32 len = sizeof(info);
1134 void *key, *nextkey;
1135 int err;
1136 int fd;
1137
1138 if (argc < 2)
1139 usage();
1140
1141 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1142 if (fd < 0)
1143 return -1;
1144
1145 key = malloc(info.key_size);
1146 nextkey = malloc(info.key_size);
1147 if (!key || !nextkey) {
1148 p_err("mem alloc failed");
1149 err = -1;
1150 goto exit_free;
1151 }
1152
1153 if (argc) {
1154 err = parse_elem(argv, &info, key, NULL, info.key_size, 0,
1155 NULL, NULL);
1156 if (err)
1157 goto exit_free;
1158 } else {
1159 free(key);
1160 key = NULL;
1161 }
1162
1163 err = bpf_map_get_next_key(fd, key, nextkey);
1164 if (err) {
1165 p_err("can't get next key: %s", strerror(errno));
1166 goto exit_free;
1167 }
1168
1169 if (json_output) {
1170 jsonw_start_object(json_wtr);
1171 if (key) {
1172 jsonw_name(json_wtr, "key");
1173 print_hex_data_json(key, info.key_size);
1174 } else {
1175 jsonw_null_field(json_wtr, "key");
1176 }
1177 jsonw_name(json_wtr, "next_key");
1178 print_hex_data_json(nextkey, info.key_size);
1179 jsonw_end_object(json_wtr);
1180 } else {
1181 if (key) {
1182 printf("key:\n");
1183 fprint_hex(stdout, key, info.key_size, " ");
1184 printf("\n");
1185 } else {
1186 printf("key: None\n");
1187 }
1188 printf("next key:\n");
1189 fprint_hex(stdout, nextkey, info.key_size, " ");
1190 printf("\n");
1191 }
1192
1193exit_free:
1194 free(nextkey);
1195 free(key);
1196 close(fd);
1197
1198 return err;
1199}
1200
1201static int do_delete(int argc, char **argv)
1202{
1203 struct bpf_map_info info = {};
1204 __u32 len = sizeof(info);
1205 void *key;
1206 int err;
1207 int fd;
1208
1209 if (argc < 2)
1210 usage();
1211
1212 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1213 if (fd < 0)
1214 return -1;
1215
1216 key = malloc(info.key_size);
1217 if (!key) {
1218 p_err("mem alloc failed");
1219 err = -1;
1220 goto exit_free;
1221 }
1222
1223 err = parse_elem(argv, &info, key, NULL, info.key_size, 0, NULL, NULL);
1224 if (err)
1225 goto exit_free;
1226
1227 err = bpf_map_delete_elem(fd, key);
1228 if (err)
1229 p_err("delete failed: %s", strerror(errno));
1230
1231exit_free:
1232 free(key);
1233 close(fd);
1234
1235 if (!err && json_output)
1236 jsonw_null(json_wtr);
1237 return err;
1238}
1239
1240static int do_pin(int argc, char **argv)
1241{
1242 int err;
1243
1244 err = do_pin_any(argc, argv, map_parse_fd);
1245 if (!err && json_output)
1246 jsonw_null(json_wtr);
1247 return err;
1248}
1249
1250static int do_create(int argc, char **argv)
1251{
1252 struct bpf_create_map_attr attr = { NULL, };
1253 const char *pinfile;
1254 int err = -1, fd;
1255
1256 if (!REQ_ARGS(7))
1257 return -1;
1258 pinfile = GET_ARG();
1259
1260 while (argc) {
1261 if (!REQ_ARGS(2))
1262 return -1;
1263
1264 if (is_prefix(*argv, "type")) {
1265 NEXT_ARG();
1266
1267 if (attr.map_type) {
1268 p_err("map type already specified");
1269 goto exit;
1270 }
1271
1272 attr.map_type = map_type_from_str(*argv);
1273 if ((int)attr.map_type < 0) {
1274 p_err("unrecognized map type: %s", *argv);
1275 goto exit;
1276 }
1277 NEXT_ARG();
1278 } else if (is_prefix(*argv, "name")) {
1279 NEXT_ARG();
1280 attr.name = GET_ARG();
1281 } else if (is_prefix(*argv, "key")) {
1282 if (parse_u32_arg(&argc, &argv, &attr.key_size,
1283 "key size"))
1284 goto exit;
1285 } else if (is_prefix(*argv, "value")) {
1286 if (parse_u32_arg(&argc, &argv, &attr.value_size,
1287 "value size"))
1288 goto exit;
1289 } else if (is_prefix(*argv, "entries")) {
1290 if (parse_u32_arg(&argc, &argv, &attr.max_entries,
1291 "max entries"))
1292 goto exit;
1293 } else if (is_prefix(*argv, "flags")) {
1294 if (parse_u32_arg(&argc, &argv, &attr.map_flags,
1295 "flags"))
1296 goto exit;
1297 } else if (is_prefix(*argv, "dev")) {
1298 NEXT_ARG();
1299
1300 if (attr.map_ifindex) {
1301 p_err("offload device already specified");
1302 goto exit;
1303 }
1304
1305 attr.map_ifindex = if_nametoindex(*argv);
1306 if (!attr.map_ifindex) {
1307 p_err("unrecognized netdevice '%s': %s",
1308 *argv, strerror(errno));
1309 goto exit;
1310 }
1311 NEXT_ARG();
1312 } else if (is_prefix(*argv, "inner_map")) {
1313 struct bpf_map_info info = {};
1314 __u32 len = sizeof(info);
1315 int inner_map_fd;
1316
1317 NEXT_ARG();
1318 if (!REQ_ARGS(2))
1319 usage();
1320 inner_map_fd = map_parse_fd_and_info(&argc, &argv,
1321 &info, &len);
1322 if (inner_map_fd < 0)
1323 return -1;
1324 attr.inner_map_fd = inner_map_fd;
1325 } else {
1326 p_err("unknown arg %s", *argv);
1327 goto exit;
1328 }
1329 }
1330
1331 if (!attr.name) {
1332 p_err("map name not specified");
1333 goto exit;
1334 }
1335
1336 set_max_rlimit();
1337
1338 fd = bpf_create_map_xattr(&attr);
1339 if (fd < 0) {
1340 p_err("map create failed: %s", strerror(errno));
1341 goto exit;
1342 }
1343
1344 err = do_pin_fd(fd, pinfile);
1345 close(fd);
1346 if (err)
1347 goto exit;
1348
1349 if (json_output)
1350 jsonw_null(json_wtr);
1351
1352exit:
1353 if (attr.inner_map_fd > 0)
1354 close(attr.inner_map_fd);
1355
1356 return err;
1357}
1358
1359static int do_pop_dequeue(int argc, char **argv)
1360{
1361 struct bpf_map_info info = {};
1362 __u32 len = sizeof(info);
1363 void *key, *value;
1364 int err;
1365 int fd;
1366
1367 if (argc < 2)
1368 usage();
1369
1370 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1371 if (fd < 0)
1372 return -1;
1373
1374 err = alloc_key_value(&info, &key, &value);
1375 if (err)
1376 goto exit_free;
1377
1378 err = bpf_map_lookup_and_delete_elem(fd, key, value);
1379 if (err) {
1380 if (errno == ENOENT) {
1381 if (json_output)
1382 jsonw_null(json_wtr);
1383 else
1384 printf("Error: empty map\n");
1385 } else {
1386 p_err("pop failed: %s", strerror(errno));
1387 }
1388
1389 goto exit_free;
1390 }
1391
1392 print_key_value(&info, key, value);
1393
1394exit_free:
1395 free(key);
1396 free(value);
1397 close(fd);
1398
1399 return err;
1400}
1401
1402static int do_freeze(int argc, char **argv)
1403{
1404 int err, fd;
1405
1406 if (!REQ_ARGS(2))
1407 return -1;
1408
1409 fd = map_parse_fd(&argc, &argv);
1410 if (fd < 0)
1411 return -1;
1412
1413 if (argc) {
1414 close(fd);
1415 return BAD_ARG();
1416 }
1417
1418 err = bpf_map_freeze(fd);
1419 close(fd);
1420 if (err) {
1421 p_err("failed to freeze map: %s", strerror(errno));
1422 return err;
1423 }
1424
1425 if (json_output)
1426 jsonw_null(json_wtr);
1427
1428 return 0;
1429}
1430
1431static int do_help(int argc, char **argv)
1432{
1433 if (json_output) {
1434 jsonw_null(json_wtr);
1435 return 0;
1436 }
1437
1438 fprintf(stderr,
1439 "Usage: %1$s %2$s { show | list } [MAP]\n"
1440 " %1$s %2$s create FILE type TYPE key KEY_SIZE value VALUE_SIZE \\\n"
1441 " entries MAX_ENTRIES name NAME [flags FLAGS] \\\n"
1442 " [inner_map MAP] [dev NAME]\n"
1443 " %1$s %2$s dump MAP\n"
1444 " %1$s %2$s update MAP [key DATA] [value VALUE] [UPDATE_FLAGS]\n"
1445 " %1$s %2$s lookup MAP [key DATA]\n"
1446 " %1$s %2$s getnext MAP [key DATA]\n"
1447 " %1$s %2$s delete MAP key DATA\n"
1448 " %1$s %2$s pin MAP FILE\n"
1449 " %1$s %2$s event_pipe MAP [cpu N index M]\n"
1450 " %1$s %2$s peek MAP\n"
1451 " %1$s %2$s push MAP value VALUE\n"
1452 " %1$s %2$s pop MAP\n"
1453 " %1$s %2$s enqueue MAP value VALUE\n"
1454 " %1$s %2$s dequeue MAP\n"
1455 " %1$s %2$s freeze MAP\n"
1456 " %1$s %2$s help\n"
1457 "\n"
1458 " " HELP_SPEC_MAP "\n"
1459 " DATA := { [hex] BYTES }\n"
1460 " " HELP_SPEC_PROGRAM "\n"
1461 " VALUE := { DATA | MAP | PROG }\n"
1462 " UPDATE_FLAGS := { any | exist | noexist }\n"
1463 " TYPE := { hash | array | prog_array | perf_event_array | percpu_hash |\n"
1464 " percpu_array | stack_trace | cgroup_array | lru_hash |\n"
1465 " lru_percpu_hash | lpm_trie | array_of_maps | hash_of_maps |\n"
1466 " devmap | devmap_hash | sockmap | cpumap | xskmap | sockhash |\n"
1467 " cgroup_storage | reuseport_sockarray | percpu_cgroup_storage |\n"
1468 " queue | stack | sk_storage | struct_ops | ringbuf | inode_storage |\n"
1469 " task_storage }\n"
1470 " " HELP_SPEC_OPTIONS "\n"
1471 "",
1472 bin_name, argv[-2]);
1473
1474 return 0;
1475}
1476
1477static const struct cmd cmds[] = {
1478 { "show", do_show },
1479 { "list", do_show },
1480 { "help", do_help },
1481 { "dump", do_dump },
1482 { "update", do_update },
1483 { "lookup", do_lookup },
1484 { "getnext", do_getnext },
1485 { "delete", do_delete },
1486 { "pin", do_pin },
1487 { "event_pipe", do_event_pipe },
1488 { "create", do_create },
1489 { "peek", do_lookup },
1490 { "push", do_update },
1491 { "enqueue", do_update },
1492 { "pop", do_pop_dequeue },
1493 { "dequeue", do_pop_dequeue },
1494 { "freeze", do_freeze },
1495 { 0 }
1496};
1497
1498int do_map(int argc, char **argv)
1499{
1500 return cmd_select(cmds, argc, argv, do_help);
1501}
1// SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
2/* Copyright (C) 2017-2018 Netronome Systems, Inc. */
3
4#include <errno.h>
5#include <fcntl.h>
6#include <linux/err.h>
7#include <linux/kernel.h>
8#include <net/if.h>
9#include <stdbool.h>
10#include <stdio.h>
11#include <stdlib.h>
12#include <string.h>
13#include <unistd.h>
14#include <sys/types.h>
15#include <sys/stat.h>
16
17#include <bpf/bpf.h>
18#include <bpf/btf.h>
19#include <bpf/hashmap.h>
20
21#include "json_writer.h"
22#include "main.h"
23
24static struct hashmap *map_table;
25
26static bool map_is_per_cpu(__u32 type)
27{
28 return type == BPF_MAP_TYPE_PERCPU_HASH ||
29 type == BPF_MAP_TYPE_PERCPU_ARRAY ||
30 type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
31 type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE;
32}
33
34static bool map_is_map_of_maps(__u32 type)
35{
36 return type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
37 type == BPF_MAP_TYPE_HASH_OF_MAPS;
38}
39
40static bool map_is_map_of_progs(__u32 type)
41{
42 return type == BPF_MAP_TYPE_PROG_ARRAY;
43}
44
45static int map_type_from_str(const char *type)
46{
47 const char *map_type_str;
48 unsigned int i;
49
50 for (i = 0; ; i++) {
51 map_type_str = libbpf_bpf_map_type_str(i);
52 if (!map_type_str)
53 break;
54
55 /* Don't allow prefixing in case of possible future shadowing */
56 if (!strcmp(map_type_str, type))
57 return i;
58 }
59 return -1;
60}
61
62static void *alloc_value(struct bpf_map_info *info)
63{
64 if (map_is_per_cpu(info->type))
65 return malloc(round_up(info->value_size, 8) *
66 get_possible_cpus());
67 else
68 return malloc(info->value_size);
69}
70
71static int do_dump_btf(const struct btf_dumper *d,
72 struct bpf_map_info *map_info, void *key,
73 void *value)
74{
75 __u32 value_id;
76 int ret = 0;
77
78 /* start of key-value pair */
79 jsonw_start_object(d->jw);
80
81 if (map_info->btf_key_type_id) {
82 jsonw_name(d->jw, "key");
83
84 ret = btf_dumper_type(d, map_info->btf_key_type_id, key);
85 if (ret)
86 goto err_end_obj;
87 }
88
89 value_id = map_info->btf_vmlinux_value_type_id ?
90 : map_info->btf_value_type_id;
91
92 if (!map_is_per_cpu(map_info->type)) {
93 jsonw_name(d->jw, "value");
94 ret = btf_dumper_type(d, value_id, value);
95 } else {
96 unsigned int i, n, step;
97
98 jsonw_name(d->jw, "values");
99 jsonw_start_array(d->jw);
100 n = get_possible_cpus();
101 step = round_up(map_info->value_size, 8);
102 for (i = 0; i < n; i++) {
103 jsonw_start_object(d->jw);
104 jsonw_int_field(d->jw, "cpu", i);
105 jsonw_name(d->jw, "value");
106 ret = btf_dumper_type(d, value_id, value + i * step);
107 jsonw_end_object(d->jw);
108 if (ret)
109 break;
110 }
111 jsonw_end_array(d->jw);
112 }
113
114err_end_obj:
115 /* end of key-value pair */
116 jsonw_end_object(d->jw);
117
118 return ret;
119}
120
121static json_writer_t *get_btf_writer(void)
122{
123 json_writer_t *jw = jsonw_new(stdout);
124
125 if (!jw)
126 return NULL;
127 jsonw_pretty(jw, true);
128
129 return jw;
130}
131
132static void print_entry_json(struct bpf_map_info *info, unsigned char *key,
133 unsigned char *value, struct btf *btf)
134{
135 jsonw_start_object(json_wtr);
136
137 if (!map_is_per_cpu(info->type)) {
138 jsonw_name(json_wtr, "key");
139 print_hex_data_json(key, info->key_size);
140 jsonw_name(json_wtr, "value");
141 print_hex_data_json(value, info->value_size);
142 if (btf) {
143 struct btf_dumper d = {
144 .btf = btf,
145 .jw = json_wtr,
146 .is_plain_text = false,
147 };
148
149 jsonw_name(json_wtr, "formatted");
150 do_dump_btf(&d, info, key, value);
151 }
152 } else {
153 unsigned int i, n, step;
154
155 n = get_possible_cpus();
156 step = round_up(info->value_size, 8);
157
158 jsonw_name(json_wtr, "key");
159 print_hex_data_json(key, info->key_size);
160
161 jsonw_name(json_wtr, "values");
162 jsonw_start_array(json_wtr);
163 for (i = 0; i < n; i++) {
164 jsonw_start_object(json_wtr);
165
166 jsonw_int_field(json_wtr, "cpu", i);
167
168 jsonw_name(json_wtr, "value");
169 print_hex_data_json(value + i * step,
170 info->value_size);
171
172 jsonw_end_object(json_wtr);
173 }
174 jsonw_end_array(json_wtr);
175 if (btf) {
176 struct btf_dumper d = {
177 .btf = btf,
178 .jw = json_wtr,
179 .is_plain_text = false,
180 };
181
182 jsonw_name(json_wtr, "formatted");
183 do_dump_btf(&d, info, key, value);
184 }
185 }
186
187 jsonw_end_object(json_wtr);
188}
189
190static void
191print_entry_error_msg(struct bpf_map_info *info, unsigned char *key,
192 const char *error_msg)
193{
194 int msg_size = strlen(error_msg);
195 bool single_line, break_names;
196
197 break_names = info->key_size > 16 || msg_size > 16;
198 single_line = info->key_size + msg_size <= 24 && !break_names;
199
200 printf("key:%c", break_names ? '\n' : ' ');
201 fprint_hex(stdout, key, info->key_size, " ");
202
203 printf(single_line ? " " : "\n");
204
205 printf("value:%c%s", break_names ? '\n' : ' ', error_msg);
206
207 printf("\n");
208}
209
210static void
211print_entry_error(struct bpf_map_info *map_info, void *key, int lookup_errno)
212{
213 /* For prog_array maps or arrays of maps, failure to lookup the value
214 * means there is no entry for that key. Do not print an error message
215 * in that case.
216 */
217 if ((map_is_map_of_maps(map_info->type) ||
218 map_is_map_of_progs(map_info->type)) && lookup_errno == ENOENT)
219 return;
220
221 if (json_output) {
222 jsonw_start_object(json_wtr); /* entry */
223 jsonw_name(json_wtr, "key");
224 print_hex_data_json(key, map_info->key_size);
225 jsonw_name(json_wtr, "value");
226 jsonw_start_object(json_wtr); /* error */
227 jsonw_string_field(json_wtr, "error", strerror(lookup_errno));
228 jsonw_end_object(json_wtr); /* error */
229 jsonw_end_object(json_wtr); /* entry */
230 } else {
231 const char *msg = NULL;
232
233 if (lookup_errno == ENOENT)
234 msg = "<no entry>";
235 else if (lookup_errno == ENOSPC &&
236 map_info->type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY)
237 msg = "<cannot read>";
238
239 print_entry_error_msg(map_info, key,
240 msg ? : strerror(lookup_errno));
241 }
242}
243
244static void print_entry_plain(struct bpf_map_info *info, unsigned char *key,
245 unsigned char *value)
246{
247 if (!map_is_per_cpu(info->type)) {
248 bool single_line, break_names;
249
250 break_names = info->key_size > 16 || info->value_size > 16;
251 single_line = info->key_size + info->value_size <= 24 &&
252 !break_names;
253
254 if (info->key_size) {
255 printf("key:%c", break_names ? '\n' : ' ');
256 fprint_hex(stdout, key, info->key_size, " ");
257
258 printf(single_line ? " " : "\n");
259 }
260
261 if (info->value_size) {
262 printf("value:%c", break_names ? '\n' : ' ');
263 fprint_hex(stdout, value, info->value_size, " ");
264 }
265
266 printf("\n");
267 } else {
268 unsigned int i, n, step;
269
270 n = get_possible_cpus();
271 step = round_up(info->value_size, 8);
272
273 if (info->key_size) {
274 printf("key:\n");
275 fprint_hex(stdout, key, info->key_size, " ");
276 printf("\n");
277 }
278 if (info->value_size) {
279 for (i = 0; i < n; i++) {
280 printf("value (CPU %02d):%c",
281 i, info->value_size > 16 ? '\n' : ' ');
282 fprint_hex(stdout, value + i * step,
283 info->value_size, " ");
284 printf("\n");
285 }
286 }
287 }
288}
289
290static char **parse_bytes(char **argv, const char *name, unsigned char *val,
291 unsigned int n)
292{
293 unsigned int i = 0, base = 0;
294 char *endptr;
295
296 if (is_prefix(*argv, "hex")) {
297 base = 16;
298 argv++;
299 }
300
301 while (i < n && argv[i]) {
302 val[i] = strtoul(argv[i], &endptr, base);
303 if (*endptr) {
304 p_err("error parsing byte: %s", argv[i]);
305 return NULL;
306 }
307 i++;
308 }
309
310 if (i != n) {
311 p_err("%s expected %d bytes got %d", name, n, i);
312 return NULL;
313 }
314
315 return argv + i;
316}
317
318/* on per cpu maps we must copy the provided value on all value instances */
319static void fill_per_cpu_value(struct bpf_map_info *info, void *value)
320{
321 unsigned int i, n, step;
322
323 if (!map_is_per_cpu(info->type))
324 return;
325
326 n = get_possible_cpus();
327 step = round_up(info->value_size, 8);
328 for (i = 1; i < n; i++)
329 memcpy(value + i * step, value, info->value_size);
330}
331
332static int parse_elem(char **argv, struct bpf_map_info *info,
333 void *key, void *value, __u32 key_size, __u32 value_size,
334 __u32 *flags, __u32 **value_fd)
335{
336 if (!*argv) {
337 if (!key && !value)
338 return 0;
339 p_err("did not find %s", key ? "key" : "value");
340 return -1;
341 }
342
343 if (is_prefix(*argv, "key")) {
344 if (!key) {
345 if (key_size)
346 p_err("duplicate key");
347 else
348 p_err("unnecessary key");
349 return -1;
350 }
351
352 argv = parse_bytes(argv + 1, "key", key, key_size);
353 if (!argv)
354 return -1;
355
356 return parse_elem(argv, info, NULL, value, key_size, value_size,
357 flags, value_fd);
358 } else if (is_prefix(*argv, "value")) {
359 int fd;
360
361 if (!value) {
362 if (value_size)
363 p_err("duplicate value");
364 else
365 p_err("unnecessary value");
366 return -1;
367 }
368
369 argv++;
370
371 if (map_is_map_of_maps(info->type)) {
372 int argc = 2;
373
374 if (value_size != 4) {
375 p_err("value smaller than 4B for map in map?");
376 return -1;
377 }
378 if (!argv[0] || !argv[1]) {
379 p_err("not enough value arguments for map in map");
380 return -1;
381 }
382
383 fd = map_parse_fd(&argc, &argv);
384 if (fd < 0)
385 return -1;
386
387 *value_fd = value;
388 **value_fd = fd;
389 } else if (map_is_map_of_progs(info->type)) {
390 int argc = 2;
391
392 if (value_size != 4) {
393 p_err("value smaller than 4B for map of progs?");
394 return -1;
395 }
396 if (!argv[0] || !argv[1]) {
397 p_err("not enough value arguments for map of progs");
398 return -1;
399 }
400 if (is_prefix(*argv, "id"))
401 p_info("Warning: updating program array via MAP_ID, make sure this map is kept open\n"
402 " by some process or pinned otherwise update will be lost");
403
404 fd = prog_parse_fd(&argc, &argv);
405 if (fd < 0)
406 return -1;
407
408 *value_fd = value;
409 **value_fd = fd;
410 } else {
411 argv = parse_bytes(argv, "value", value, value_size);
412 if (!argv)
413 return -1;
414
415 fill_per_cpu_value(info, value);
416 }
417
418 return parse_elem(argv, info, key, NULL, key_size, value_size,
419 flags, NULL);
420 } else if (is_prefix(*argv, "any") || is_prefix(*argv, "noexist") ||
421 is_prefix(*argv, "exist")) {
422 if (!flags) {
423 p_err("flags specified multiple times: %s", *argv);
424 return -1;
425 }
426
427 if (is_prefix(*argv, "any"))
428 *flags = BPF_ANY;
429 else if (is_prefix(*argv, "noexist"))
430 *flags = BPF_NOEXIST;
431 else if (is_prefix(*argv, "exist"))
432 *flags = BPF_EXIST;
433
434 return parse_elem(argv + 1, info, key, value, key_size,
435 value_size, NULL, value_fd);
436 }
437
438 p_err("expected key or value, got: %s", *argv);
439 return -1;
440}
441
442static void show_map_header_json(struct bpf_map_info *info, json_writer_t *wtr)
443{
444 const char *map_type_str;
445
446 jsonw_uint_field(wtr, "id", info->id);
447 map_type_str = libbpf_bpf_map_type_str(info->type);
448 if (map_type_str)
449 jsonw_string_field(wtr, "type", map_type_str);
450 else
451 jsonw_uint_field(wtr, "type", info->type);
452
453 if (*info->name)
454 jsonw_string_field(wtr, "name", info->name);
455
456 jsonw_name(wtr, "flags");
457 jsonw_printf(wtr, "%d", info->map_flags);
458}
459
460static int show_map_close_json(int fd, struct bpf_map_info *info)
461{
462 char *memlock, *frozen_str;
463 int frozen = 0;
464
465 memlock = get_fdinfo(fd, "memlock");
466 frozen_str = get_fdinfo(fd, "frozen");
467
468 jsonw_start_object(json_wtr);
469
470 show_map_header_json(info, json_wtr);
471
472 print_dev_json(info->ifindex, info->netns_dev, info->netns_ino);
473
474 jsonw_uint_field(json_wtr, "bytes_key", info->key_size);
475 jsonw_uint_field(json_wtr, "bytes_value", info->value_size);
476 jsonw_uint_field(json_wtr, "max_entries", info->max_entries);
477
478 if (memlock)
479 jsonw_int_field(json_wtr, "bytes_memlock", atoll(memlock));
480 free(memlock);
481
482 if (info->type == BPF_MAP_TYPE_PROG_ARRAY) {
483 char *owner_prog_type = get_fdinfo(fd, "owner_prog_type");
484 char *owner_jited = get_fdinfo(fd, "owner_jited");
485
486 if (owner_prog_type) {
487 unsigned int prog_type = atoi(owner_prog_type);
488 const char *prog_type_str;
489
490 prog_type_str = libbpf_bpf_prog_type_str(prog_type);
491 if (prog_type_str)
492 jsonw_string_field(json_wtr, "owner_prog_type",
493 prog_type_str);
494 else
495 jsonw_uint_field(json_wtr, "owner_prog_type",
496 prog_type);
497 }
498 if (owner_jited)
499 jsonw_bool_field(json_wtr, "owner_jited",
500 !!atoi(owner_jited));
501
502 free(owner_prog_type);
503 free(owner_jited);
504 }
505 close(fd);
506
507 if (frozen_str) {
508 frozen = atoi(frozen_str);
509 free(frozen_str);
510 }
511 jsonw_int_field(json_wtr, "frozen", frozen);
512
513 if (info->btf_id)
514 jsonw_int_field(json_wtr, "btf_id", info->btf_id);
515
516 if (!hashmap__empty(map_table)) {
517 struct hashmap_entry *entry;
518
519 jsonw_name(json_wtr, "pinned");
520 jsonw_start_array(json_wtr);
521 hashmap__for_each_key_entry(map_table, entry, info->id)
522 jsonw_string(json_wtr, entry->pvalue);
523 jsonw_end_array(json_wtr);
524 }
525
526 emit_obj_refs_json(refs_table, info->id, json_wtr);
527
528 jsonw_end_object(json_wtr);
529
530 return 0;
531}
532
533static void show_map_header_plain(struct bpf_map_info *info)
534{
535 const char *map_type_str;
536
537 printf("%u: ", info->id);
538
539 map_type_str = libbpf_bpf_map_type_str(info->type);
540 if (map_type_str)
541 printf("%s ", map_type_str);
542 else
543 printf("type %u ", info->type);
544
545 if (*info->name)
546 printf("name %s ", info->name);
547
548 printf("flags 0x%x", info->map_flags);
549 print_dev_plain(info->ifindex, info->netns_dev, info->netns_ino);
550 printf("\n");
551}
552
553static int show_map_close_plain(int fd, struct bpf_map_info *info)
554{
555 char *memlock, *frozen_str;
556 int frozen = 0;
557
558 memlock = get_fdinfo(fd, "memlock");
559 frozen_str = get_fdinfo(fd, "frozen");
560
561 show_map_header_plain(info);
562 printf("\tkey %uB value %uB max_entries %u",
563 info->key_size, info->value_size, info->max_entries);
564
565 if (memlock)
566 printf(" memlock %sB", memlock);
567 free(memlock);
568
569 if (info->type == BPF_MAP_TYPE_PROG_ARRAY) {
570 char *owner_prog_type = get_fdinfo(fd, "owner_prog_type");
571 char *owner_jited = get_fdinfo(fd, "owner_jited");
572
573 if (owner_prog_type || owner_jited)
574 printf("\n\t");
575 if (owner_prog_type) {
576 unsigned int prog_type = atoi(owner_prog_type);
577 const char *prog_type_str;
578
579 prog_type_str = libbpf_bpf_prog_type_str(prog_type);
580 if (prog_type_str)
581 printf("owner_prog_type %s ", prog_type_str);
582 else
583 printf("owner_prog_type %d ", prog_type);
584 }
585 if (owner_jited)
586 printf("owner%s jited",
587 atoi(owner_jited) ? "" : " not");
588
589 free(owner_prog_type);
590 free(owner_jited);
591 }
592 close(fd);
593
594 if (!hashmap__empty(map_table)) {
595 struct hashmap_entry *entry;
596
597 hashmap__for_each_key_entry(map_table, entry, info->id)
598 printf("\n\tpinned %s", (char *)entry->pvalue);
599 }
600
601 if (frozen_str) {
602 frozen = atoi(frozen_str);
603 free(frozen_str);
604 }
605
606 if (info->btf_id || frozen)
607 printf("\n\t");
608
609 if (info->btf_id)
610 printf("btf_id %d", info->btf_id);
611
612 if (frozen)
613 printf("%sfrozen", info->btf_id ? " " : "");
614
615 emit_obj_refs_plain(refs_table, info->id, "\n\tpids ");
616
617 printf("\n");
618 return 0;
619}
620
621static int do_show_subset(int argc, char **argv)
622{
623 struct bpf_map_info info = {};
624 __u32 len = sizeof(info);
625 int *fds = NULL;
626 int nb_fds, i;
627 int err = -1;
628
629 fds = malloc(sizeof(int));
630 if (!fds) {
631 p_err("mem alloc failed");
632 return -1;
633 }
634 nb_fds = map_parse_fds(&argc, &argv, &fds);
635 if (nb_fds < 1)
636 goto exit_free;
637
638 if (json_output && nb_fds > 1)
639 jsonw_start_array(json_wtr); /* root array */
640 for (i = 0; i < nb_fds; i++) {
641 err = bpf_obj_get_info_by_fd(fds[i], &info, &len);
642 if (err) {
643 p_err("can't get map info: %s",
644 strerror(errno));
645 for (; i < nb_fds; i++)
646 close(fds[i]);
647 break;
648 }
649
650 if (json_output)
651 show_map_close_json(fds[i], &info);
652 else
653 show_map_close_plain(fds[i], &info);
654
655 close(fds[i]);
656 }
657 if (json_output && nb_fds > 1)
658 jsonw_end_array(json_wtr); /* root array */
659
660exit_free:
661 free(fds);
662 return err;
663}
664
665static int do_show(int argc, char **argv)
666{
667 struct bpf_map_info info = {};
668 __u32 len = sizeof(info);
669 __u32 id = 0;
670 int err;
671 int fd;
672
673 if (show_pinned) {
674 map_table = hashmap__new(hash_fn_for_key_as_id,
675 equal_fn_for_key_as_id, NULL);
676 if (IS_ERR(map_table)) {
677 p_err("failed to create hashmap for pinned paths");
678 return -1;
679 }
680 build_pinned_obj_table(map_table, BPF_OBJ_MAP);
681 }
682 build_obj_refs_table(&refs_table, BPF_OBJ_MAP);
683
684 if (argc == 2)
685 return do_show_subset(argc, argv);
686
687 if (argc)
688 return BAD_ARG();
689
690 if (json_output)
691 jsonw_start_array(json_wtr);
692 while (true) {
693 err = bpf_map_get_next_id(id, &id);
694 if (err) {
695 if (errno == ENOENT)
696 break;
697 p_err("can't get next map: %s%s", strerror(errno),
698 errno == EINVAL ? " -- kernel too old?" : "");
699 break;
700 }
701
702 fd = bpf_map_get_fd_by_id(id);
703 if (fd < 0) {
704 if (errno == ENOENT)
705 continue;
706 p_err("can't get map by id (%u): %s",
707 id, strerror(errno));
708 break;
709 }
710
711 err = bpf_obj_get_info_by_fd(fd, &info, &len);
712 if (err) {
713 p_err("can't get map info: %s", strerror(errno));
714 close(fd);
715 break;
716 }
717
718 if (json_output)
719 show_map_close_json(fd, &info);
720 else
721 show_map_close_plain(fd, &info);
722 }
723 if (json_output)
724 jsonw_end_array(json_wtr);
725
726 delete_obj_refs_table(refs_table);
727
728 if (show_pinned)
729 delete_pinned_obj_table(map_table);
730
731 return errno == ENOENT ? 0 : -1;
732}
733
734static int dump_map_elem(int fd, void *key, void *value,
735 struct bpf_map_info *map_info, struct btf *btf,
736 json_writer_t *btf_wtr)
737{
738 if (bpf_map_lookup_elem(fd, key, value)) {
739 print_entry_error(map_info, key, errno);
740 return -1;
741 }
742
743 if (json_output) {
744 print_entry_json(map_info, key, value, btf);
745 } else if (btf) {
746 struct btf_dumper d = {
747 .btf = btf,
748 .jw = btf_wtr,
749 .is_plain_text = true,
750 };
751
752 do_dump_btf(&d, map_info, key, value);
753 } else {
754 print_entry_plain(map_info, key, value);
755 }
756
757 return 0;
758}
759
760static int maps_have_btf(int *fds, int nb_fds)
761{
762 struct bpf_map_info info = {};
763 __u32 len = sizeof(info);
764 int err, i;
765
766 for (i = 0; i < nb_fds; i++) {
767 err = bpf_obj_get_info_by_fd(fds[i], &info, &len);
768 if (err) {
769 p_err("can't get map info: %s", strerror(errno));
770 return -1;
771 }
772
773 if (!info.btf_id)
774 return 0;
775 }
776
777 return 1;
778}
779
780static struct btf *btf_vmlinux;
781
782static int get_map_kv_btf(const struct bpf_map_info *info, struct btf **btf)
783{
784 int err = 0;
785
786 if (info->btf_vmlinux_value_type_id) {
787 if (!btf_vmlinux) {
788 btf_vmlinux = libbpf_find_kernel_btf();
789 if (!btf_vmlinux) {
790 p_err("failed to get kernel btf");
791 return -errno;
792 }
793 }
794 *btf = btf_vmlinux;
795 } else if (info->btf_value_type_id) {
796 *btf = btf__load_from_kernel_by_id(info->btf_id);
797 if (!*btf) {
798 err = -errno;
799 p_err("failed to get btf");
800 }
801 } else {
802 *btf = NULL;
803 }
804
805 return err;
806}
807
808static void free_map_kv_btf(struct btf *btf)
809{
810 if (btf != btf_vmlinux)
811 btf__free(btf);
812}
813
814static int
815map_dump(int fd, struct bpf_map_info *info, json_writer_t *wtr,
816 bool show_header)
817{
818 void *key, *value, *prev_key;
819 unsigned int num_elems = 0;
820 struct btf *btf = NULL;
821 int err;
822
823 key = malloc(info->key_size);
824 value = alloc_value(info);
825 if (!key || !value) {
826 p_err("mem alloc failed");
827 err = -1;
828 goto exit_free;
829 }
830
831 prev_key = NULL;
832
833 if (wtr) {
834 err = get_map_kv_btf(info, &btf);
835 if (err) {
836 goto exit_free;
837 }
838
839 if (show_header) {
840 jsonw_start_object(wtr); /* map object */
841 show_map_header_json(info, wtr);
842 jsonw_name(wtr, "elements");
843 }
844 jsonw_start_array(wtr); /* elements */
845 } else if (show_header) {
846 show_map_header_plain(info);
847 }
848
849 if (info->type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY &&
850 info->value_size != 8) {
851 const char *map_type_str;
852
853 map_type_str = libbpf_bpf_map_type_str(info->type);
854 p_info("Warning: cannot read values from %s map with value_size != 8",
855 map_type_str);
856 }
857 while (true) {
858 err = bpf_map_get_next_key(fd, prev_key, key);
859 if (err) {
860 if (errno == ENOENT)
861 err = 0;
862 break;
863 }
864 if (!dump_map_elem(fd, key, value, info, btf, wtr))
865 num_elems++;
866 prev_key = key;
867 }
868
869 if (wtr) {
870 jsonw_end_array(wtr); /* elements */
871 if (show_header)
872 jsonw_end_object(wtr); /* map object */
873 } else {
874 printf("Found %u element%s\n", num_elems,
875 num_elems != 1 ? "s" : "");
876 }
877
878exit_free:
879 free(key);
880 free(value);
881 close(fd);
882 free_map_kv_btf(btf);
883
884 return err;
885}
886
887static int do_dump(int argc, char **argv)
888{
889 json_writer_t *wtr = NULL, *btf_wtr = NULL;
890 struct bpf_map_info info = {};
891 int nb_fds, i = 0;
892 __u32 len = sizeof(info);
893 int *fds = NULL;
894 int err = -1;
895
896 if (argc != 2)
897 usage();
898
899 fds = malloc(sizeof(int));
900 if (!fds) {
901 p_err("mem alloc failed");
902 return -1;
903 }
904 nb_fds = map_parse_fds(&argc, &argv, &fds);
905 if (nb_fds < 1)
906 goto exit_free;
907
908 if (json_output) {
909 wtr = json_wtr;
910 } else {
911 int do_plain_btf;
912
913 do_plain_btf = maps_have_btf(fds, nb_fds);
914 if (do_plain_btf < 0)
915 goto exit_close;
916
917 if (do_plain_btf) {
918 btf_wtr = get_btf_writer();
919 wtr = btf_wtr;
920 if (!btf_wtr)
921 p_info("failed to create json writer for btf. falling back to plain output");
922 }
923 }
924
925 if (wtr && nb_fds > 1)
926 jsonw_start_array(wtr); /* root array */
927 for (i = 0; i < nb_fds; i++) {
928 if (bpf_obj_get_info_by_fd(fds[i], &info, &len)) {
929 p_err("can't get map info: %s", strerror(errno));
930 break;
931 }
932 err = map_dump(fds[i], &info, wtr, nb_fds > 1);
933 if (!wtr && i != nb_fds - 1)
934 printf("\n");
935
936 if (err)
937 break;
938 close(fds[i]);
939 }
940 if (wtr && nb_fds > 1)
941 jsonw_end_array(wtr); /* root array */
942
943 if (btf_wtr)
944 jsonw_destroy(&btf_wtr);
945exit_close:
946 for (; i < nb_fds; i++)
947 close(fds[i]);
948exit_free:
949 free(fds);
950 btf__free(btf_vmlinux);
951 return err;
952}
953
954static int alloc_key_value(struct bpf_map_info *info, void **key, void **value)
955{
956 *key = NULL;
957 *value = NULL;
958
959 if (info->key_size) {
960 *key = malloc(info->key_size);
961 if (!*key) {
962 p_err("key mem alloc failed");
963 return -1;
964 }
965 }
966
967 if (info->value_size) {
968 *value = alloc_value(info);
969 if (!*value) {
970 p_err("value mem alloc failed");
971 free(*key);
972 *key = NULL;
973 return -1;
974 }
975 }
976
977 return 0;
978}
979
980static int do_update(int argc, char **argv)
981{
982 struct bpf_map_info info = {};
983 __u32 len = sizeof(info);
984 __u32 *value_fd = NULL;
985 __u32 flags = BPF_ANY;
986 void *key, *value;
987 int fd, err;
988
989 if (argc < 2)
990 usage();
991
992 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
993 if (fd < 0)
994 return -1;
995
996 err = alloc_key_value(&info, &key, &value);
997 if (err)
998 goto exit_free;
999
1000 err = parse_elem(argv, &info, key, value, info.key_size,
1001 info.value_size, &flags, &value_fd);
1002 if (err)
1003 goto exit_free;
1004
1005 err = bpf_map_update_elem(fd, key, value, flags);
1006 if (err) {
1007 p_err("update failed: %s", strerror(errno));
1008 goto exit_free;
1009 }
1010
1011exit_free:
1012 if (value_fd)
1013 close(*value_fd);
1014 free(key);
1015 free(value);
1016 close(fd);
1017
1018 if (!err && json_output)
1019 jsonw_null(json_wtr);
1020 return err;
1021}
1022
1023static void print_key_value(struct bpf_map_info *info, void *key,
1024 void *value)
1025{
1026 json_writer_t *btf_wtr;
1027 struct btf *btf;
1028
1029 if (get_map_kv_btf(info, &btf))
1030 return;
1031
1032 if (json_output) {
1033 print_entry_json(info, key, value, btf);
1034 } else if (btf) {
1035 /* if here json_wtr wouldn't have been initialised,
1036 * so let's create separate writer for btf
1037 */
1038 btf_wtr = get_btf_writer();
1039 if (!btf_wtr) {
1040 p_info("failed to create json writer for btf. falling back to plain output");
1041 btf__free(btf);
1042 btf = NULL;
1043 print_entry_plain(info, key, value);
1044 } else {
1045 struct btf_dumper d = {
1046 .btf = btf,
1047 .jw = btf_wtr,
1048 .is_plain_text = true,
1049 };
1050
1051 do_dump_btf(&d, info, key, value);
1052 jsonw_destroy(&btf_wtr);
1053 }
1054 } else {
1055 print_entry_plain(info, key, value);
1056 }
1057 btf__free(btf);
1058}
1059
1060static int do_lookup(int argc, char **argv)
1061{
1062 struct bpf_map_info info = {};
1063 __u32 len = sizeof(info);
1064 void *key, *value;
1065 int err;
1066 int fd;
1067
1068 if (argc < 2)
1069 usage();
1070
1071 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1072 if (fd < 0)
1073 return -1;
1074
1075 err = alloc_key_value(&info, &key, &value);
1076 if (err)
1077 goto exit_free;
1078
1079 err = parse_elem(argv, &info, key, NULL, info.key_size, 0, NULL, NULL);
1080 if (err)
1081 goto exit_free;
1082
1083 err = bpf_map_lookup_elem(fd, key, value);
1084 if (err) {
1085 if (errno == ENOENT) {
1086 if (json_output) {
1087 jsonw_null(json_wtr);
1088 } else {
1089 printf("key:\n");
1090 fprint_hex(stdout, key, info.key_size, " ");
1091 printf("\n\nNot found\n");
1092 }
1093 } else {
1094 p_err("lookup failed: %s", strerror(errno));
1095 }
1096
1097 goto exit_free;
1098 }
1099
1100 /* here means bpf_map_lookup_elem() succeeded */
1101 print_key_value(&info, key, value);
1102
1103exit_free:
1104 free(key);
1105 free(value);
1106 close(fd);
1107
1108 return err;
1109}
1110
1111static int do_getnext(int argc, char **argv)
1112{
1113 struct bpf_map_info info = {};
1114 __u32 len = sizeof(info);
1115 void *key, *nextkey;
1116 int err;
1117 int fd;
1118
1119 if (argc < 2)
1120 usage();
1121
1122 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1123 if (fd < 0)
1124 return -1;
1125
1126 key = malloc(info.key_size);
1127 nextkey = malloc(info.key_size);
1128 if (!key || !nextkey) {
1129 p_err("mem alloc failed");
1130 err = -1;
1131 goto exit_free;
1132 }
1133
1134 if (argc) {
1135 err = parse_elem(argv, &info, key, NULL, info.key_size, 0,
1136 NULL, NULL);
1137 if (err)
1138 goto exit_free;
1139 } else {
1140 free(key);
1141 key = NULL;
1142 }
1143
1144 err = bpf_map_get_next_key(fd, key, nextkey);
1145 if (err) {
1146 p_err("can't get next key: %s", strerror(errno));
1147 goto exit_free;
1148 }
1149
1150 if (json_output) {
1151 jsonw_start_object(json_wtr);
1152 if (key) {
1153 jsonw_name(json_wtr, "key");
1154 print_hex_data_json(key, info.key_size);
1155 } else {
1156 jsonw_null_field(json_wtr, "key");
1157 }
1158 jsonw_name(json_wtr, "next_key");
1159 print_hex_data_json(nextkey, info.key_size);
1160 jsonw_end_object(json_wtr);
1161 } else {
1162 if (key) {
1163 printf("key:\n");
1164 fprint_hex(stdout, key, info.key_size, " ");
1165 printf("\n");
1166 } else {
1167 printf("key: None\n");
1168 }
1169 printf("next key:\n");
1170 fprint_hex(stdout, nextkey, info.key_size, " ");
1171 printf("\n");
1172 }
1173
1174exit_free:
1175 free(nextkey);
1176 free(key);
1177 close(fd);
1178
1179 return err;
1180}
1181
1182static int do_delete(int argc, char **argv)
1183{
1184 struct bpf_map_info info = {};
1185 __u32 len = sizeof(info);
1186 void *key;
1187 int err;
1188 int fd;
1189
1190 if (argc < 2)
1191 usage();
1192
1193 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1194 if (fd < 0)
1195 return -1;
1196
1197 key = malloc(info.key_size);
1198 if (!key) {
1199 p_err("mem alloc failed");
1200 err = -1;
1201 goto exit_free;
1202 }
1203
1204 err = parse_elem(argv, &info, key, NULL, info.key_size, 0, NULL, NULL);
1205 if (err)
1206 goto exit_free;
1207
1208 err = bpf_map_delete_elem(fd, key);
1209 if (err)
1210 p_err("delete failed: %s", strerror(errno));
1211
1212exit_free:
1213 free(key);
1214 close(fd);
1215
1216 if (!err && json_output)
1217 jsonw_null(json_wtr);
1218 return err;
1219}
1220
1221static int do_pin(int argc, char **argv)
1222{
1223 int err;
1224
1225 err = do_pin_any(argc, argv, map_parse_fd);
1226 if (!err && json_output)
1227 jsonw_null(json_wtr);
1228 return err;
1229}
1230
1231static int do_create(int argc, char **argv)
1232{
1233 LIBBPF_OPTS(bpf_map_create_opts, attr);
1234 enum bpf_map_type map_type = BPF_MAP_TYPE_UNSPEC;
1235 __u32 key_size = 0, value_size = 0, max_entries = 0;
1236 const char *map_name = NULL;
1237 const char *pinfile;
1238 int err = -1, fd;
1239
1240 if (!REQ_ARGS(7))
1241 return -1;
1242 pinfile = GET_ARG();
1243
1244 while (argc) {
1245 if (!REQ_ARGS(2))
1246 return -1;
1247
1248 if (is_prefix(*argv, "type")) {
1249 NEXT_ARG();
1250
1251 if (map_type) {
1252 p_err("map type already specified");
1253 goto exit;
1254 }
1255
1256 map_type = map_type_from_str(*argv);
1257 if ((int)map_type < 0) {
1258 p_err("unrecognized map type: %s", *argv);
1259 goto exit;
1260 }
1261 NEXT_ARG();
1262 } else if (is_prefix(*argv, "name")) {
1263 NEXT_ARG();
1264 map_name = GET_ARG();
1265 } else if (is_prefix(*argv, "key")) {
1266 if (parse_u32_arg(&argc, &argv, &key_size,
1267 "key size"))
1268 goto exit;
1269 } else if (is_prefix(*argv, "value")) {
1270 if (parse_u32_arg(&argc, &argv, &value_size,
1271 "value size"))
1272 goto exit;
1273 } else if (is_prefix(*argv, "entries")) {
1274 if (parse_u32_arg(&argc, &argv, &max_entries,
1275 "max entries"))
1276 goto exit;
1277 } else if (is_prefix(*argv, "flags")) {
1278 if (parse_u32_arg(&argc, &argv, &attr.map_flags,
1279 "flags"))
1280 goto exit;
1281 } else if (is_prefix(*argv, "dev")) {
1282 NEXT_ARG();
1283
1284 if (attr.map_ifindex) {
1285 p_err("offload device already specified");
1286 goto exit;
1287 }
1288
1289 attr.map_ifindex = if_nametoindex(*argv);
1290 if (!attr.map_ifindex) {
1291 p_err("unrecognized netdevice '%s': %s",
1292 *argv, strerror(errno));
1293 goto exit;
1294 }
1295 NEXT_ARG();
1296 } else if (is_prefix(*argv, "inner_map")) {
1297 struct bpf_map_info info = {};
1298 __u32 len = sizeof(info);
1299 int inner_map_fd;
1300
1301 NEXT_ARG();
1302 if (!REQ_ARGS(2))
1303 usage();
1304 inner_map_fd = map_parse_fd_and_info(&argc, &argv,
1305 &info, &len);
1306 if (inner_map_fd < 0)
1307 return -1;
1308 attr.inner_map_fd = inner_map_fd;
1309 } else {
1310 p_err("unknown arg %s", *argv);
1311 goto exit;
1312 }
1313 }
1314
1315 if (!map_name) {
1316 p_err("map name not specified");
1317 goto exit;
1318 }
1319
1320 set_max_rlimit();
1321
1322 fd = bpf_map_create(map_type, map_name, key_size, value_size, max_entries, &attr);
1323 if (fd < 0) {
1324 p_err("map create failed: %s", strerror(errno));
1325 goto exit;
1326 }
1327
1328 err = do_pin_fd(fd, pinfile);
1329 close(fd);
1330 if (err)
1331 goto exit;
1332
1333 if (json_output)
1334 jsonw_null(json_wtr);
1335
1336exit:
1337 if (attr.inner_map_fd > 0)
1338 close(attr.inner_map_fd);
1339
1340 return err;
1341}
1342
1343static int do_pop_dequeue(int argc, char **argv)
1344{
1345 struct bpf_map_info info = {};
1346 __u32 len = sizeof(info);
1347 void *key, *value;
1348 int err;
1349 int fd;
1350
1351 if (argc < 2)
1352 usage();
1353
1354 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
1355 if (fd < 0)
1356 return -1;
1357
1358 err = alloc_key_value(&info, &key, &value);
1359 if (err)
1360 goto exit_free;
1361
1362 err = bpf_map_lookup_and_delete_elem(fd, key, value);
1363 if (err) {
1364 if (errno == ENOENT) {
1365 if (json_output)
1366 jsonw_null(json_wtr);
1367 else
1368 printf("Error: empty map\n");
1369 } else {
1370 p_err("pop failed: %s", strerror(errno));
1371 }
1372
1373 goto exit_free;
1374 }
1375
1376 print_key_value(&info, key, value);
1377
1378exit_free:
1379 free(key);
1380 free(value);
1381 close(fd);
1382
1383 return err;
1384}
1385
1386static int do_freeze(int argc, char **argv)
1387{
1388 int err, fd;
1389
1390 if (!REQ_ARGS(2))
1391 return -1;
1392
1393 fd = map_parse_fd(&argc, &argv);
1394 if (fd < 0)
1395 return -1;
1396
1397 if (argc) {
1398 close(fd);
1399 return BAD_ARG();
1400 }
1401
1402 err = bpf_map_freeze(fd);
1403 close(fd);
1404 if (err) {
1405 p_err("failed to freeze map: %s", strerror(errno));
1406 return err;
1407 }
1408
1409 if (json_output)
1410 jsonw_null(json_wtr);
1411
1412 return 0;
1413}
1414
1415static int do_help(int argc, char **argv)
1416{
1417 if (json_output) {
1418 jsonw_null(json_wtr);
1419 return 0;
1420 }
1421
1422 fprintf(stderr,
1423 "Usage: %1$s %2$s { show | list } [MAP]\n"
1424 " %1$s %2$s create FILE type TYPE key KEY_SIZE value VALUE_SIZE \\\n"
1425 " entries MAX_ENTRIES name NAME [flags FLAGS] \\\n"
1426 " [inner_map MAP] [dev NAME]\n"
1427 " %1$s %2$s dump MAP\n"
1428 " %1$s %2$s update MAP [key DATA] [value VALUE] [UPDATE_FLAGS]\n"
1429 " %1$s %2$s lookup MAP [key DATA]\n"
1430 " %1$s %2$s getnext MAP [key DATA]\n"
1431 " %1$s %2$s delete MAP key DATA\n"
1432 " %1$s %2$s pin MAP FILE\n"
1433 " %1$s %2$s event_pipe MAP [cpu N index M]\n"
1434 " %1$s %2$s peek MAP\n"
1435 " %1$s %2$s push MAP value VALUE\n"
1436 " %1$s %2$s pop MAP\n"
1437 " %1$s %2$s enqueue MAP value VALUE\n"
1438 " %1$s %2$s dequeue MAP\n"
1439 " %1$s %2$s freeze MAP\n"
1440 " %1$s %2$s help\n"
1441 "\n"
1442 " " HELP_SPEC_MAP "\n"
1443 " DATA := { [hex] BYTES }\n"
1444 " " HELP_SPEC_PROGRAM "\n"
1445 " VALUE := { DATA | MAP | PROG }\n"
1446 " UPDATE_FLAGS := { any | exist | noexist }\n"
1447 " TYPE := { hash | array | prog_array | perf_event_array | percpu_hash |\n"
1448 " percpu_array | stack_trace | cgroup_array | lru_hash |\n"
1449 " lru_percpu_hash | lpm_trie | array_of_maps | hash_of_maps |\n"
1450 " devmap | devmap_hash | sockmap | cpumap | xskmap | sockhash |\n"
1451 " cgroup_storage | reuseport_sockarray | percpu_cgroup_storage |\n"
1452 " queue | stack | sk_storage | struct_ops | ringbuf | inode_storage |\n"
1453 " task_storage | bloom_filter | user_ringbuf | cgrp_storage }\n"
1454 " " HELP_SPEC_OPTIONS " |\n"
1455 " {-f|--bpffs} | {-n|--nomount} }\n"
1456 "",
1457 bin_name, argv[-2]);
1458
1459 return 0;
1460}
1461
1462static const struct cmd cmds[] = {
1463 { "show", do_show },
1464 { "list", do_show },
1465 { "help", do_help },
1466 { "dump", do_dump },
1467 { "update", do_update },
1468 { "lookup", do_lookup },
1469 { "getnext", do_getnext },
1470 { "delete", do_delete },
1471 { "pin", do_pin },
1472 { "event_pipe", do_event_pipe },
1473 { "create", do_create },
1474 { "peek", do_lookup },
1475 { "push", do_update },
1476 { "enqueue", do_update },
1477 { "pop", do_pop_dequeue },
1478 { "dequeue", do_pop_dequeue },
1479 { "freeze", do_freeze },
1480 { 0 }
1481};
1482
1483int do_map(int argc, char **argv)
1484{
1485 return cmd_select(cmds, argc, argv, do_help);
1486}