map.c 32 KB

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