2 * Copyright (C) 2017 Netronome Systems, Inc.
4 * This software is dual licensed under the GNU General License Version 2,
5 * June 1991 as shown in the file COPYING in the top-level directory of this
6 * source tree or the BSD 2-Clause License provided below. You have the
7 * option to license this software under the complete terms of either license.
9 * The BSD 2-Clause License:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
15 * 1. Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
19 * 2. Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials
22 * provided with the distribution.
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
30 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
34 /* Author: Jakub Kicinski <kubakici@wp.pl> */
45 #include <sys/types.h>
52 static const char * const map_type_name[] = {
53 [BPF_MAP_TYPE_UNSPEC] = "unspec",
54 [BPF_MAP_TYPE_HASH] = "hash",
55 [BPF_MAP_TYPE_ARRAY] = "array",
56 [BPF_MAP_TYPE_PROG_ARRAY] = "prog_array",
57 [BPF_MAP_TYPE_PERF_EVENT_ARRAY] = "perf_event_array",
58 [BPF_MAP_TYPE_PERCPU_HASH] = "percpu_hash",
59 [BPF_MAP_TYPE_PERCPU_ARRAY] = "percpu_array",
60 [BPF_MAP_TYPE_STACK_TRACE] = "stack_trace",
61 [BPF_MAP_TYPE_CGROUP_ARRAY] = "cgroup_array",
62 [BPF_MAP_TYPE_LRU_HASH] = "lru_hash",
63 [BPF_MAP_TYPE_LRU_PERCPU_HASH] = "lru_percpu_hash",
64 [BPF_MAP_TYPE_LPM_TRIE] = "lpm_trie",
65 [BPF_MAP_TYPE_ARRAY_OF_MAPS] = "array_of_maps",
66 [BPF_MAP_TYPE_HASH_OF_MAPS] = "hash_of_maps",
67 [BPF_MAP_TYPE_DEVMAP] = "devmap",
68 [BPF_MAP_TYPE_SOCKMAP] = "sockmap",
71 static unsigned int get_possible_cpus(void)
73 static unsigned int result;
82 fd = open("/sys/devices/system/cpu/possible", O_RDONLY);
84 err("can't open sysfs possible cpus\n");
88 n = read(fd, buf, sizeof(buf));
90 err("can't read sysfs possible cpus\n");
95 if (n == sizeof(buf)) {
96 err("read sysfs possible cpus overflow\n");
102 while (*ptr && *ptr != '\n') {
105 if (sscanf(ptr, "%u-%u", &a, &b) == 2) {
108 ptr = strchr(ptr, '-') + 1;
109 } else if (sscanf(ptr, "%u", &a) == 1) {
115 while (isdigit(*ptr))
126 static bool map_is_per_cpu(__u32 type)
128 return type == BPF_MAP_TYPE_PERCPU_HASH ||
129 type == BPF_MAP_TYPE_PERCPU_ARRAY ||
130 type == BPF_MAP_TYPE_LRU_PERCPU_HASH;
133 static bool map_is_map_of_maps(__u32 type)
135 return type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
136 type == BPF_MAP_TYPE_HASH_OF_MAPS;
139 static bool map_is_map_of_progs(__u32 type)
141 return type == BPF_MAP_TYPE_PROG_ARRAY;
144 static void *alloc_value(struct bpf_map_info *info)
146 if (map_is_per_cpu(info->type))
147 return malloc(info->value_size * get_possible_cpus());
149 return malloc(info->value_size);
152 static int map_parse_fd(int *argc, char ***argv)
156 if (is_prefix(**argv, "id")) {
162 id = strtoul(**argv, &endptr, 0);
164 err("can't parse %s as ID\n", **argv);
169 fd = bpf_map_get_fd_by_id(id);
171 err("get map by id (%u): %s\n", id, strerror(errno));
173 } else if (is_prefix(**argv, "pinned")) {
181 return open_obj_pinned_any(path, BPF_OBJ_MAP);
184 err("expected 'id' or 'pinned', got: '%s'?\n", **argv);
189 map_parse_fd_and_info(int *argc, char ***argv, void *info, __u32 *info_len)
194 fd = map_parse_fd(argc, argv);
198 err = bpf_obj_get_info_by_fd(fd, info, info_len);
200 err("can't get map info: %s\n", strerror(errno));
208 static void print_entry(struct bpf_map_info *info, unsigned char *key,
209 unsigned char *value)
211 if (!map_is_per_cpu(info->type)) {
212 bool single_line, break_names;
214 break_names = info->key_size > 16 || info->value_size > 16;
215 single_line = info->key_size + info->value_size <= 24 &&
218 printf("key:%c", break_names ? '\n' : ' ');
219 print_hex(key, info->key_size, " ");
221 printf(single_line ? " " : "\n");
223 printf("value:%c", break_names ? '\n' : ' ');
224 print_hex(value, info->value_size, " ");
230 n = get_possible_cpus();
233 print_hex(key, info->key_size, " ");
235 for (i = 0; i < n; i++) {
236 printf("value (CPU %02d):%c",
237 i, info->value_size > 16 ? '\n' : ' ');
238 print_hex(value + i * info->value_size,
239 info->value_size, " ");
245 static char **parse_bytes(char **argv, const char *name, unsigned char *val,
251 while (i < n && argv[i]) {
252 val[i] = strtoul(argv[i], &endptr, 0);
254 err("error parsing byte: %s\n", argv[i]);
261 err("%s expected %d bytes got %d\n", name, n, i);
268 static int parse_elem(char **argv, struct bpf_map_info *info,
269 void *key, void *value, __u32 key_size, __u32 value_size,
270 __u32 *flags, __u32 **value_fd)
275 err("did not find %s\n", key ? "key" : "value");
279 if (is_prefix(*argv, "key")) {
282 err("duplicate key\n");
284 err("unnecessary key\n");
288 argv = parse_bytes(argv + 1, "key", key, key_size);
292 return parse_elem(argv, info, NULL, value, key_size, value_size,
294 } else if (is_prefix(*argv, "value")) {
299 err("duplicate value\n");
301 err("unnecessary value\n");
307 if (map_is_map_of_maps(info->type)) {
310 if (value_size != 4) {
311 err("value smaller than 4B for map in map?\n");
314 if (!argv[0] || !argv[1]) {
315 err("not enough value arguments for map in map\n");
319 fd = map_parse_fd(&argc, &argv);
325 } else if (map_is_map_of_progs(info->type)) {
328 if (value_size != 4) {
329 err("value smaller than 4B for map of progs?\n");
332 if (!argv[0] || !argv[1]) {
333 err("not enough value arguments for map of progs\n");
337 fd = prog_parse_fd(&argc, &argv);
344 argv = parse_bytes(argv, "value", value, value_size);
349 return parse_elem(argv, info, key, NULL, key_size, value_size,
351 } else if (is_prefix(*argv, "any") || is_prefix(*argv, "noexist") ||
352 is_prefix(*argv, "exist")) {
354 err("flags specified multiple times: %s\n", *argv);
358 if (is_prefix(*argv, "any"))
360 else if (is_prefix(*argv, "noexist"))
361 *flags = BPF_NOEXIST;
362 else if (is_prefix(*argv, "exist"))
365 return parse_elem(argv + 1, info, key, value, key_size,
366 value_size, NULL, value_fd);
369 err("expected key or value, got: %s\n", *argv);
373 static int show_map_close(int fd, struct bpf_map_info *info)
377 memlock = get_fdinfo(fd, "memlock");
380 printf("%u: ", info->id);
381 if (info->type < ARRAY_SIZE(map_type_name))
382 printf("%s ", map_type_name[info->type]);
384 printf("type %u ", info->type);
387 printf("name %s ", info->name);
389 printf("flags 0x%x\n", info->map_flags);
390 printf("\tkey %uB value %uB max_entries %u",
391 info->key_size, info->value_size, info->max_entries);
394 printf(" memlock %sB", memlock);
402 static int do_show(int argc, char **argv)
404 struct bpf_map_info info = {};
405 __u32 len = sizeof(info);
411 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
415 return show_map_close(fd, &info);
422 err = bpf_map_get_next_id(id, &id);
426 err("can't get next map: %s\n", strerror(errno));
428 err("kernel too old?\n");
432 fd = bpf_map_get_fd_by_id(id);
434 err("can't get map by id (%u): %s\n",
435 id, strerror(errno));
439 err = bpf_obj_get_info_by_fd(fd, &info, &len);
441 err("can't get map info: %s\n", strerror(errno));
446 show_map_close(fd, &info);
449 return errno == ENOENT ? 0 : -1;
452 static int do_dump(int argc, char **argv)
454 void *key, *value, *prev_key;
455 unsigned int num_elems = 0;
456 struct bpf_map_info info = {};
457 __u32 len = sizeof(info);
464 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
468 if (map_is_map_of_maps(info.type) || map_is_map_of_progs(info.type)) {
469 err("Dumping maps of maps and program maps not supported\n");
474 key = malloc(info.key_size);
475 value = alloc_value(&info);
476 if (!key || !value) {
477 err("mem alloc failed\n");
484 err = bpf_map_get_next_key(fd, prev_key, key);
491 if (!bpf_map_lookup_elem(fd, key, value)) {
492 print_entry(&info, key, value);
494 info("can't lookup element with key: ");
495 print_hex(key, info.key_size, " ");
503 printf("Found %u element%s\n", num_elems, num_elems != 1 ? "s" : "");
513 static int do_update(int argc, char **argv)
515 struct bpf_map_info info = {};
516 __u32 len = sizeof(info);
517 __u32 *value_fd = NULL;
518 __u32 flags = BPF_ANY;
525 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
529 key = malloc(info.key_size);
530 value = alloc_value(&info);
531 if (!key || !value) {
532 err("mem alloc failed");
537 err = parse_elem(argv, &info, key, value, info.key_size,
538 info.value_size, &flags, &value_fd);
542 err = bpf_map_update_elem(fd, key, value, flags);
544 err("update failed: %s\n", strerror(errno));
558 static int do_lookup(int argc, char **argv)
560 struct bpf_map_info info = {};
561 __u32 len = sizeof(info);
569 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
573 key = malloc(info.key_size);
574 value = alloc_value(&info);
575 if (!key || !value) {
576 err("mem alloc failed");
581 err = parse_elem(argv, &info, key, NULL, info.key_size, 0, NULL, NULL);
585 err = bpf_map_lookup_elem(fd, key, value);
587 print_entry(&info, key, value);
588 } else if (errno == ENOENT) {
590 print_hex(key, info.key_size, " ");
591 printf("\n\nNot found\n");
593 err("lookup failed: %s\n", strerror(errno));
604 static int do_getnext(int argc, char **argv)
606 struct bpf_map_info info = {};
607 __u32 len = sizeof(info);
615 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
619 key = malloc(info.key_size);
620 nextkey = malloc(info.key_size);
621 if (!key || !nextkey) {
622 err("mem alloc failed");
628 err = parse_elem(argv, &info, key, NULL, info.key_size, 0,
637 err = bpf_map_get_next_key(fd, key, nextkey);
639 err("can't get next key: %s\n", strerror(errno));
645 print_hex(key, info.key_size, " ");
648 printf("key: None\n");
651 printf("next key:\n");
652 print_hex(nextkey, info.key_size, " ");
663 static int do_delete(int argc, char **argv)
665 struct bpf_map_info info = {};
666 __u32 len = sizeof(info);
674 fd = map_parse_fd_and_info(&argc, &argv, &info, &len);
678 key = malloc(info.key_size);
680 err("mem alloc failed");
685 err = parse_elem(argv, &info, key, NULL, info.key_size, 0, NULL, NULL);
689 err = bpf_map_delete_elem(fd, key);
691 err("delete failed: %s\n", strerror(errno));
700 static int do_pin(int argc, char **argv)
702 return do_pin_any(argc, argv, bpf_map_get_fd_by_id);
705 static int do_help(int argc, char **argv)
708 "Usage: %s %s show [MAP]\n"
710 " %s %s update MAP key BYTES value VALUE [UPDATE_FLAGS]\n"
711 " %s %s lookup MAP key BYTES\n"
712 " %s %s getnext MAP [key BYTES]\n"
713 " %s %s delete MAP key BYTES\n"
714 " %s %s pin MAP FILE\n"
717 " MAP := { id MAP_ID | pinned FILE }\n"
718 " " HELP_SPEC_PROGRAM "\n"
719 " VALUE := { BYTES | MAP | PROG }\n"
720 " UPDATE_FLAGS := { any | exist | noexist }\n"
722 bin_name, argv[-2], bin_name, argv[-2], bin_name, argv[-2],
723 bin_name, argv[-2], bin_name, argv[-2], bin_name, argv[-2],
724 bin_name, argv[-2], bin_name, argv[-2]);
729 static const struct cmd cmds[] = {
733 { "update", do_update },
734 { "lookup", do_lookup },
735 { "getnext", do_getnext },
736 { "delete", do_delete },
741 int do_map(int argc, char **argv)
743 return cmd_select(cmds, argc, argv, do_help);