2 * Copyright (c) 2013, Google Inc.
3 * Written by Simon Glass <sjg@chromium.org>
5 * SPDX-License-Identifier: GPL-2.0+
7 * Perform a grep of an FDT either displaying the source subset or producing
8 * a new .dtb subset which can be used as required.
19 #include <../include/libfdt.h>
20 #include <libfdt_internal.h>
22 /* Define DEBUG to get some debugging output on stderr */
24 #define debug(a, b...) fprintf(stderr, a, ## b)
26 #define debug(a, b...)
29 /* A linked list of values we are grepping for */
31 int type; /* Types this value matches (FDT_IS... mask) */
32 int include; /* 1 to include matches, 0 to exclude */
33 const char *string; /* String to match */
34 struct value_node *next; /* Pointer to next node, or NULL */
37 /* Output formats we support */
39 OUT_DTS, /* Device tree source */
40 OUT_DTB, /* Valid device tree binary */
41 OUT_BIN, /* Fragment of .dtb, for hashing */
44 /* Holds information which controls our output and options */
46 enum output_t output; /* Output format */
47 int add_aliases; /* Add aliases node to output */
48 int all; /* Display all properties/nodes */
49 int colour; /* Display output in ANSI colour */
50 int region_list; /* Output a region list */
51 int flags; /* Flags (FDT_REG_...) */
52 int list_strings; /* List strings in string table */
53 int show_offset; /* Show offset */
54 int show_addr; /* Show address */
55 int header; /* Output an FDT header */
56 int diff; /* Show +/- diff markers */
57 int include_root; /* Include the root node and all properties */
58 int remove_strings; /* Remove unused strings */
59 int show_dts_version; /* Put '/dts-v1/;' on the first line */
60 int types_inc; /* Mask of types that we include (FDT_IS...) */
61 int types_exc; /* Mask of types that we exclude (FDT_IS...) */
62 int invert; /* Invert polarity of match */
63 struct value_node *value_head; /* List of values to match */
64 const char *output_fname; /* Output filename */
65 FILE *fout; /* File to write dts/dtb output */
68 static void report_error(const char *where, int err)
70 fprintf(stderr, "Error at '%s': %s\n", where, fdt_strerror(err));
73 /* Supported ANSI colours */
88 * print_ansi_colour() - Print out the ANSI sequence for a colour
91 * @col: Colour to output (COL_...), or COL_NONE to reset colour
93 static void print_ansi_colour(FILE *fout, int col)
96 fprintf(fout, "\033[0m");
98 fprintf(fout, "\033[1;%dm", col + 30);
103 * value_add() - Add a new value to our list of things to grep for
105 * @disp: Display structure, holding info about our options
106 * @headp: Pointer to header pointer of list
107 * @type: Type of this value (FDT_IS_...)
108 * @include: 1 if we want to include matches, 0 to exclude
109 * @str: String value to match
111 static int value_add(struct display_info *disp, struct value_node **headp,
112 int type, int include, const char *str)
114 struct value_node *node;
117 * Keep track of which types we are excluding/including. We don't
118 * allow both including and excluding things, because it doesn't make
119 * sense. 'Including' means that everything not mentioned is
120 * excluded. 'Excluding' means that everything not mentioned is
121 * included. So using the two together would be meaningless.
124 disp->types_inc |= type;
126 disp->types_exc |= type;
127 if (disp->types_inc & disp->types_exc & type) {
129 "Cannot use both include and exclude for '%s'\n", str);
134 node = malloc(sizeof(*node));
136 fprintf(stderr, "Out of memory\n");
141 node->include = include;
148 static bool util_is_printable_string(const void *data, int len)
150 const char *s = data;
153 /* zero length is not */
157 /* must terminate with zero */
158 if (s[len - 1] != '\0')
165 while (s < se && *s && isprint((unsigned char)*s))
168 /* not zero, or not done yet */
169 if (*s != '\0' || s == ss)
178 static void utilfdt_print_data(const char *data, int len)
181 const char *p = data;
184 /* no data, don't print */
188 if (util_is_printable_string(data, len)) {
197 } while (s < data + len);
199 } else if ((len % 4) == 0) {
200 const uint32_t *cell = (const uint32_t *)data;
203 for (i = 0, len /= 4; i < len; i++)
204 printf("0x%08x%s", fdt32_to_cpu(cell[i]),
205 i < (len - 1) ? " " : "");
209 for (i = 0; i < len; i++)
210 printf("%02x%s", *p++, i < len - 1 ? " " : "");
216 * display_fdt_by_regions() - Display regions of an FDT source
218 * This dumps an FDT as source, but only certain regions of it. This is the
219 * final stage of the grep - we have a list of regions we want to display,
220 * and this function displays them.
222 * @disp: Display structure, holding info about our options
223 * @blob: FDT blob to display
224 * @region: List of regions to display
225 * @count: Number of regions
227 static int display_fdt_by_regions(struct display_info *disp, const void *blob,
228 struct fdt_region region[], int count)
230 struct fdt_region *reg = region, *reg_end = region + count;
231 uint32_t off_mem_rsvmap = fdt_off_mem_rsvmap(blob);
232 int base = fdt_off_dt_struct(blob);
233 int version = fdt_version(blob);
234 int offset, nextoffset;
235 int tag, depth, shift;
236 FILE *f = disp->fout;
242 if (disp->show_dts_version)
243 fprintf(f, "/dts-v1/;\n");
246 fprintf(f, "// magic:\t\t0x%x\n", fdt_magic(blob));
247 fprintf(f, "// totalsize:\t\t0x%x (%d)\n", fdt_totalsize(blob),
248 fdt_totalsize(blob));
249 fprintf(f, "// off_dt_struct:\t0x%x\n",
250 fdt_off_dt_struct(blob));
251 fprintf(f, "// off_dt_strings:\t0x%x\n",
252 fdt_off_dt_strings(blob));
253 fprintf(f, "// off_mem_rsvmap:\t0x%x\n", off_mem_rsvmap);
254 fprintf(f, "// version:\t\t%d\n", version);
255 fprintf(f, "// last_comp_version:\t%d\n",
256 fdt_last_comp_version(blob));
258 fprintf(f, "// boot_cpuid_phys:\t0x%x\n",
259 fdt_boot_cpuid_phys(blob));
262 fprintf(f, "// size_dt_strings:\t0x%x\n",
263 fdt_size_dt_strings(blob));
266 fprintf(f, "// size_dt_struct:\t0x%x\n",
267 fdt_size_dt_struct(blob));
272 if (disp->flags & FDT_REG_ADD_MEM_RSVMAP) {
273 const struct fdt_reserve_entry *p_rsvmap;
275 p_rsvmap = (const struct fdt_reserve_entry *)
276 ((const char *)blob + off_mem_rsvmap);
278 addr = fdt64_to_cpu(p_rsvmap[i].address);
279 size = fdt64_to_cpu(p_rsvmap[i].size);
280 if (addr == 0 && size == 0)
283 fprintf(f, "/memreserve/ %llx %llx;\n",
284 (unsigned long long)addr,
285 (unsigned long long)size);
291 shift = 4; /* 4 spaces per indent */
293 const struct fdt_property *prop;
301 * Work out the file offset of this offset, and decide
302 * whether it is in the region list or not
304 file_ofs = base + offset;
305 if (reg < reg_end && file_ofs >= reg->offset + reg->size)
307 in_region = reg < reg_end && file_ofs >= reg->offset &&
308 file_ofs < reg->offset + reg->size;
309 tag = fdt_next_tag(blob, offset, &nextoffset);
313 show = in_region || disp->all;
314 if (show && disp->diff)
315 fprintf(f, "%c", in_region ? '+' : '-');
318 /* Do this here to avoid 'if (show)' in every 'case' */
319 if (tag == FDT_BEGIN_NODE)
321 else if (tag == FDT_END_NODE)
325 if (tag != FDT_END) {
327 fprintf(f, "%4x: ", file_ofs);
328 if (disp->show_offset)
329 fprintf(f, "%4x: ", file_ofs - base);
332 /* Green means included, red means excluded */
334 print_ansi_colour(f, in_region ? COL_GREEN : COL_RED);
338 prop = fdt_get_property_by_offset(blob, offset, NULL);
339 name = fdt_string(blob, fdt32_to_cpu(prop->nameoff));
340 fprintf(f, "%*s%s", depth * shift, "", name);
341 utilfdt_print_data(prop->data,
342 fdt32_to_cpu(prop->len));
347 fprintf(f, "%*s// [NOP]", depth * shift, "");
351 name = fdt_get_name(blob, offset, &len);
352 fprintf(f, "%*s%s {", depth++ * shift, "",
357 fprintf(f, "%*s};", --depth * shift, "");
361 /* Reset colour back to normal before end of line */
363 print_ansi_colour(f, COL_NONE);
367 /* Print a list of strings if requested */
368 if (disp->list_strings) {
370 int str_base = fdt_off_dt_strings(blob);
372 for (offset = 0; offset < fdt_size_dt_strings(blob);
373 offset += strlen(str) + 1) {
374 str = fdt_string(blob, offset);
375 int len = strlen(str) + 1;
378 /* Only print strings that are in the region */
379 file_ofs = str_base + offset;
380 in_region = reg < reg_end &&
381 file_ofs >= reg->offset &&
382 file_ofs + len < reg->offset +
384 show = in_region || disp->all;
385 if (show && disp->diff)
386 printf("%c", in_region ? '+' : '-');
388 printf("%4x: ", file_ofs);
389 if (disp->show_offset)
390 printf("%4x: ", offset);
399 * dump_fdt_regions() - Dump regions of an FDT as binary data
401 * This dumps an FDT as binary, but only certain regions of it. This is the
402 * final stage of the grep - we have a list of regions we want to dump,
403 * and this function dumps them.
405 * The output of this function may or may not be a valid FDT. To ensure it
406 * is, these disp->flags must be set:
408 * FDT_REG_SUPERNODES: ensures that subnodes are preceeded by their
409 * parents. Without this option, fragments of subnode data may be
410 * output without the supernodes above them. This is useful for
411 * hashing but cannot produce a valid FDT.
412 * FDT_REG_ADD_STRING_TAB: Adds a string table to the end of the FDT.
413 * Without this none of the properties will have names
414 * FDT_REG_ADD_MEM_RSVMAP: Adds a mem_rsvmap table - an FDT is invalid
417 * @disp: Display structure, holding info about our options
418 * @blob: FDT blob to display
419 * @region: List of regions to display
420 * @count: Number of regions
421 * @out: Output destination
423 static int dump_fdt_regions(struct display_info *disp, const void *blob,
424 struct fdt_region region[], int count, char *out)
426 struct fdt_header *fdt;
427 int size, struct_start;
431 /* Set up a basic header (even if we don't actually write it) */
432 fdt = (struct fdt_header *)out;
433 memset(fdt, '\0', sizeof(*fdt));
434 fdt_set_magic(fdt, FDT_MAGIC);
435 struct_start = FDT_ALIGN(sizeof(struct fdt_header),
436 sizeof(struct fdt_reserve_entry));
437 fdt_set_off_mem_rsvmap(fdt, struct_start);
438 fdt_set_version(fdt, FDT_LAST_SUPPORTED_VERSION);
439 fdt_set_last_comp_version(fdt, FDT_FIRST_SUPPORTED_VERSION);
442 * Calculate the total size of the regions we are writing out. The
443 * first will be the mem_rsvmap if the FDT_REG_ADD_MEM_RSVMAP flag
444 * is set. The last will be the string table if FDT_REG_ADD_STRING_TAB
447 for (i = size = 0; i < count; i++)
448 size += region[i].size;
450 /* Bring in the mem_rsvmap section from the old file if requested */
451 if (count > 0 && (disp->flags & FDT_REG_ADD_MEM_RSVMAP)) {
452 struct_start += region[0].size;
453 size -= region[0].size;
455 fdt_set_off_dt_struct(fdt, struct_start);
457 /* Update the header to have the correct offsets/sizes */
458 if (count >= 2 && (disp->flags & FDT_REG_ADD_STRING_TAB)) {
461 str_size = region[count - 1].size;
462 fdt_set_size_dt_struct(fdt, size - str_size);
463 fdt_set_off_dt_strings(fdt, struct_start + size - str_size);
464 fdt_set_size_dt_strings(fdt, str_size);
465 fdt_set_totalsize(fdt, struct_start + size);
468 /* Write the header if required */
472 while (ptr < fdt_off_mem_rsvmap(fdt))
476 /* Output all the nodes including any mem_rsvmap/string table */
477 for (i = 0; i < count; i++) {
478 struct fdt_region *reg = ®ion[i];
480 memcpy(out + ptr, (const char *)blob + reg->offset, reg->size);
488 * show_region_list() - Print out a list of regions
490 * The list includes the region offset (absolute offset from start of FDT
491 * blob in bytes) and size
493 * @reg: List of regions to print
494 * @count: Number of regions
496 static void show_region_list(struct fdt_region *reg, int count)
500 printf("Regions: %d\n", count);
501 for (i = 0; i < count; i++, reg++) {
502 printf("%d: %-10x %-10x\n", i, reg->offset,
503 reg->offset + reg->size);
507 static int check_type_include(void *priv, int type, const char *data, int size)
509 struct display_info *disp = priv;
510 struct value_node *val;
511 int match, none_match = FDT_IS_ANY;
513 /* If none of our conditions mention this type, we know nothing */
514 debug("type=%x, data=%s\n", type, data ? data : "(null)");
515 if (!((disp->types_inc | disp->types_exc) & type)) {
516 debug(" - not in any condition\n");
521 * Go through the list of conditions. For inclusive conditions, we
522 * return 1 at the first match. For exclusive conditions, we must
523 * check that there are no matches.
525 for (val = disp->value_head; val; val = val->next) {
526 if (!(type & val->type))
528 match = fdt_stringlist_contains(data, size, val->string);
529 debug(" - val->type=%x, str='%s', match=%d\n",
530 val->type, val->string, match);
531 if (match && val->include) {
532 debug(" - match inc %s\n", val->string);
536 none_match &= ~val->type;
540 * If this is an exclusive condition, and nothing matches, then we
543 if ((type & disp->types_exc) && (none_match & type)) {
544 debug(" - match exc\n");
546 * Allow FDT_IS_COMPAT to make the final decision in the
547 * case where there is no specific type
549 if (type == FDT_IS_NODE && disp->types_exc == FDT_ANY_GLOBAL) {
550 debug(" - supressed exc node\n");
557 * Allow FDT_IS_COMPAT to make the final decision in the
558 * case where there is no specific type (inclusive)
560 if (type == FDT_IS_NODE && disp->types_inc == FDT_ANY_GLOBAL)
563 debug(" - no match, types_inc=%x, types_exc=%x, none_match=%x\n",
564 disp->types_inc, disp->types_exc, none_match);
570 * h_include() - Include handler function for fdt_find_regions()
572 * This function decides whether to include or exclude a node, property or
573 * compatible string. The function is defined by fdt_find_regions().
575 * The algorithm is documented in the code - disp->invert is 0 for normal
576 * operation, and 1 to invert the sense of all matches.
580 static int h_include(void *priv, const void *fdt, int offset, int type,
581 const char *data, int size)
583 struct display_info *disp = priv;
586 inc = check_type_include(priv, type, data, size);
587 if (disp->include_root && type == FDT_IS_PROP && offset == 0 && inc)
591 * If the node name does not tell us anything, check the
594 if (inc == -1 && type == FDT_IS_NODE) {
595 debug(" - checking compatible2\n");
596 data = fdt_getprop(fdt, offset, "compatible", &len);
597 inc = check_type_include(priv, FDT_IS_COMPAT, data, len);
600 /* If we still have no idea, check for properties in the node */
601 if (inc != 1 && type == FDT_IS_NODE &&
602 (disp->types_inc & FDT_NODE_HAS_PROP)) {
603 debug(" - checking node '%s'\n",
604 fdt_get_name(fdt, offset, NULL));
605 for (offset = fdt_first_property_offset(fdt, offset);
606 offset > 0 && inc != 1;
607 offset = fdt_next_property_offset(fdt, offset)) {
608 const struct fdt_property *prop;
611 prop = fdt_get_property_by_offset(fdt, offset, NULL);
614 str = fdt_string(fdt, fdt32_to_cpu(prop->nameoff));
615 inc = check_type_include(priv, FDT_NODE_HAS_PROP, str,
630 debug(" - returning %d\n", inc);
635 static int h_cmp_region(const void *v1, const void *v2)
637 const struct fdt_region *region1 = v1, *region2 = v2;
639 return region1->offset - region2->offset;
642 static int fdtgrep_find_regions(const void *fdt,
643 int (*include_func)(void *priv, const void *fdt, int offset,
644 int type, const char *data, int size),
645 struct display_info *disp, struct fdt_region *region,
646 int max_regions, char *path, int path_len, int flags)
648 struct fdt_region_state state;
653 ret = fdt_first_region(fdt, include_func, disp,
654 ®ion[count++], path, path_len,
655 disp->flags, &state);
657 ret = fdt_next_region(fdt, include_func, disp,
658 count < max_regions ? ®ion[count] : NULL,
659 path, path_len, disp->flags, &state);
664 /* Find all the aliases and add those regions back in */
665 if (disp->add_aliases && count < max_regions) {
668 new_count = fdt_add_alias_regions(fdt, region, count,
669 max_regions, &state);
670 if (new_count <= max_regions) {
672 * The alias regions will now be at the end of the list.
673 * Sort the regions by offset to get things into the
677 qsort(region, count, sizeof(struct fdt_region),
682 if (ret != -FDT_ERR_NOTFOUND)
688 int utilfdt_read_err_len(const char *filename, char **buffp, off_t *len)
690 int fd = 0; /* assume stdin */
692 off_t bufsize = 1024, offset = 0;
696 if (strcmp(filename, "-") != 0) {
697 fd = open(filename, O_RDONLY);
702 /* Loop until we have read everything */
703 buf = malloc(bufsize);
707 /* Expand the buffer to hold the next chunk */
708 if (offset == bufsize) {
710 buf = realloc(buf, bufsize);
715 ret = read(fd, &buf[offset], bufsize - offset);
723 /* Clean up, including closing stdin; return errno on error */
733 int utilfdt_read_err(const char *filename, char **buffp)
736 return utilfdt_read_err_len(filename, buffp, &len);
739 char *utilfdt_read_len(const char *filename, off_t *len)
742 int ret = utilfdt_read_err_len(filename, &buff, len);
745 fprintf(stderr, "Couldn't open blob from '%s': %s\n", filename,
749 /* Successful read */
753 char *utilfdt_read(const char *filename)
756 return utilfdt_read_len(filename, &len);
760 * Run the main fdtgrep operation, given a filename and valid arguments
762 * @param disp Display information / options
763 * @param filename Filename of blob file
764 * @param return 0 if ok, -ve on error
766 static int do_fdtgrep(struct display_info *disp, const char *filename)
768 struct fdt_region *region;
775 blob = utilfdt_read(filename);
778 ret = fdt_check_header(blob);
780 fprintf(stderr, "Error: %s\n", fdt_strerror(ret));
784 /* Allow old files, but they are untested */
785 if (fdt_version(blob) < 17 && disp->value_head) {
787 "Warning: fdtgrep does not fully support version %d files\n",
792 * We do two passes, since we don't know how many regions we need.
793 * The first pass will count the regions, but if it is too many,
794 * we do another pass to actually record them.
796 for (i = 0; i < 3; i++) {
797 region = malloc(count * sizeof(struct fdt_region));
799 fprintf(stderr, "Out of memory for %d regions\n",
804 count = fdtgrep_find_regions(blob,
806 region, max_regions, path, sizeof(path),
809 report_error("fdt_find_regions", count);
812 if (count <= max_regions)
817 /* Optionally print a list of regions */
818 if (disp->region_list)
819 show_region_list(region, count);
821 /* Output either source .dts or binary .dtb */
822 if (disp->output == OUT_DTS) {
823 ret = display_fdt_by_regions(disp, blob, region, count);
826 /* Allow reserved memory section to expand slightly */
827 int size = fdt_totalsize(blob) + 16;
831 fprintf(stderr, "Out_of_memory\n");
835 size = dump_fdt_regions(disp, blob, region, count, fdt);
836 if (disp->remove_strings) {
841 fprintf(stderr, "Out_of_memory\n");
845 ret = fdt_remove_unused_strings(fdt, out);
848 "Failed to remove unused strings: err=%d\n",
856 fprintf(stderr, "Failed to pack: err=%d\n",
860 size = fdt_totalsize(fdt);
863 if (size != fwrite(fdt, 1, size, disp->fout)) {
864 fprintf(stderr, "Write failure, %d bytes\n", size);
878 static const char usage_synopsis[] =
879 "fdtgrep - extract portions from device tree\n"
882 " fdtgrep <options> <dt file>|-\n\n"
883 "Output formats are:\n"
884 "\tdts - device tree soure text\n"
885 "\tdtb - device tree blob (sets -Hmt automatically)\n"
886 "\tbin - device tree fragment (may not be a valid .dtb)";
888 /* Helper for usage_short_opts string constant */
889 #define USAGE_COMMON_SHORT_OPTS "hV"
891 /* Helper for aligning long_opts array */
892 #define a_argument required_argument
894 /* Helper for usage_long_opts option array */
895 #define USAGE_COMMON_LONG_OPTS \
896 {"help", no_argument, NULL, 'h'}, \
897 {"version", no_argument, NULL, 'V'}, \
898 {NULL, no_argument, NULL, 0x0}
900 /* Helper for usage_opts_help array */
901 #define USAGE_COMMON_OPTS_HELP \
902 "Print this help and exit", \
903 "Print version and exit", \
906 /* Helper for getopt case statements */
907 #define case_USAGE_COMMON_FLAGS \
908 case 'h': usage(NULL); \
909 case 'V': util_version(); \
910 case '?': usage("unknown option");
912 static const char usage_short_opts[] =
913 "haAc:b:C:defg:G:HIlLmn:N:o:O:p:P:rRsStTv"
914 USAGE_COMMON_SHORT_OPTS;
915 static struct option const usage_long_opts[] = {
916 {"show-address", no_argument, NULL, 'a'},
917 {"colour", no_argument, NULL, 'A'},
918 {"include-node-with-prop", a_argument, NULL, 'b'},
919 {"include-compat", a_argument, NULL, 'c'},
920 {"exclude-compat", a_argument, NULL, 'C'},
921 {"diff", no_argument, NULL, 'd'},
922 {"enter-node", no_argument, NULL, 'e'},
923 {"show-offset", no_argument, NULL, 'f'},
924 {"include-match", a_argument, NULL, 'g'},
925 {"exclude-match", a_argument, NULL, 'G'},
926 {"show-header", no_argument, NULL, 'H'},
927 {"show-version", no_argument, NULL, 'I'},
928 {"list-regions", no_argument, NULL, 'l'},
929 {"list-strings", no_argument, NULL, 'L'},
930 {"include-mem", no_argument, NULL, 'm'},
931 {"include-node", a_argument, NULL, 'n'},
932 {"exclude-node", a_argument, NULL, 'N'},
933 {"include-prop", a_argument, NULL, 'p'},
934 {"exclude-prop", a_argument, NULL, 'P'},
935 {"remove-strings", no_argument, NULL, 'r'},
936 {"include-root", no_argument, NULL, 'R'},
937 {"show-subnodes", no_argument, NULL, 's'},
938 {"skip-supernodes", no_argument, NULL, 'S'},
939 {"show-stringtab", no_argument, NULL, 't'},
940 {"show-aliases", no_argument, NULL, 'T'},
941 {"out", a_argument, NULL, 'o'},
942 {"out-format", a_argument, NULL, 'O'},
943 {"invert-match", no_argument, NULL, 'v'},
944 USAGE_COMMON_LONG_OPTS,
946 static const char * const usage_opts_help[] = {
948 "Show all nodes/tags, colour those that match",
949 "Include contains containing property",
950 "Compatible nodes to include in grep",
951 "Compatible nodes to exclude in grep",
952 "Diff: Mark matching nodes with +, others with -",
953 "Enter direct subnode names of matching nodes",
955 "Node/property/compatible string to include in grep",
956 "Node/property/compatible string to exclude in grep",
958 "Put \"/dts-v1/;\" on first line of dts output",
959 "Output a region list",
960 "List strings in string table",
961 "Include mem_rsvmap section in binary output",
962 "Node to include in grep",
963 "Node to exclude in grep",
964 "Property to include in grep",
965 "Property to exclude in grep",
966 "Remove unused strings from string table",
967 "Include root node and all properties",
968 "Show all subnodes matching nodes",
969 "Don't include supernodes of matching nodes",
970 "Include string table in binary output",
971 "Include matching aliases in output",
973 "-O <output format>",
974 "Invert the sense of matching (select non-matching lines)",
975 USAGE_COMMON_OPTS_HELP
979 * Call getopt_long() with standard options
981 * Since all util code runs getopt in the same way, provide a helper.
983 #define util_getopt_long() getopt_long(argc, argv, usage_short_opts, \
984 usage_long_opts, NULL)
986 void util_usage(const char *errmsg, const char *synopsis,
987 const char *short_opts, struct option const long_opts[],
988 const char * const opts_help[])
990 FILE *fp = errmsg ? stderr : stdout;
991 const char a_arg[] = "<arg>";
992 size_t a_arg_len = strlen(a_arg) + 1;
999 "Options: -[%s]\n", synopsis, short_opts);
1001 /* prescan the --long opt length to auto-align */
1003 for (i = 0; long_opts[i].name; ++i) {
1004 /* +1 is for space between --opt and help text */
1005 int l = strlen(long_opts[i].name) + 1;
1006 if (long_opts[i].has_arg == a_argument)
1012 for (i = 0; long_opts[i].name; ++i) {
1013 /* helps when adding new applets or options */
1014 assert(opts_help[i] != NULL);
1016 /* first output the short flag if it has one */
1017 if (long_opts[i].val > '~')
1020 fprintf(fp, " -%c, ", long_opts[i].val);
1022 /* then the long flag */
1023 if (long_opts[i].has_arg == no_argument) {
1024 fprintf(fp, "--%-*s", optlen, long_opts[i].name);
1026 fprintf(fp, "--%s %s%*s", long_opts[i].name, a_arg,
1027 (int)(optlen - strlen(long_opts[i].name) -
1031 /* finally the help text */
1032 fprintf(fp, "%s\n", opts_help[i]);
1036 fprintf(fp, "\nError: %s\n", errmsg);
1044 * Show usage and exit
1046 * If you name all your usage variables with usage_xxx, then you can call this
1047 * help macro rather than expanding all arguments yourself.
1049 * @param errmsg If non-NULL, an error message to display
1051 #define usage(errmsg) \
1052 util_usage(errmsg, usage_synopsis, usage_short_opts, \
1053 usage_long_opts, usage_opts_help)
1055 void util_version(void)
1057 printf("Version: %s\n", "(U-Boot)");
1061 static void scan_args(struct display_info *disp, int argc, char *argv[])
1065 while ((opt = util_getopt_long()) != EOF) {
1070 case_USAGE_COMMON_FLAGS
1072 disp->show_addr = 1;
1078 type = FDT_NODE_HAS_PROP;
1084 type = FDT_IS_COMPAT;
1090 disp->flags |= FDT_REG_DIRECT_SUBNODES;
1093 disp->show_offset = 1;
1099 type = FDT_ANY_GLOBAL;
1105 disp->region_list = 1;
1108 disp->list_strings = 1;
1111 disp->flags |= FDT_REG_ADD_MEM_RSVMAP;
1120 disp->output_fname = optarg;
1123 if (!strcmp(optarg, "dtb"))
1124 disp->output = OUT_DTB;
1125 else if (!strcmp(optarg, "dts"))
1126 disp->output = OUT_DTS;
1127 else if (!strcmp(optarg, "bin"))
1128 disp->output = OUT_BIN;
1130 usage("Unknown output format");
1139 disp->remove_strings = 1;
1142 disp->include_root = 1;
1145 disp->flags |= FDT_REG_ALL_SUBNODES;
1148 disp->flags &= ~FDT_REG_SUPERNODES;
1151 disp->flags |= FDT_REG_ADD_STRING_TAB;
1154 disp->add_aliases = 1;
1160 disp->show_dts_version = 1;
1164 if (type && value_add(disp, &disp->value_head, type, inc,
1166 usage("Cannot add value");
1169 if (disp->invert && disp->types_exc)
1170 usage("-v has no meaning when used with 'exclude' conditions");
1173 int main(int argc, char *argv[])
1175 char *filename = NULL;
1176 struct display_info disp;
1180 memset(&disp, '\0', sizeof(disp));
1181 disp.flags = FDT_REG_SUPERNODES; /* Default flags */
1183 scan_args(&disp, argc, argv);
1185 /* Show matched lines in colour if we can */
1186 disp.colour = disp.all && isatty(0);
1188 /* Any additional arguments can match anything, just like -g */
1189 while (optind < argc - 1) {
1190 if (value_add(&disp, &disp.value_head, FDT_IS_ANY, 1,
1192 usage("Cannot add value");
1196 filename = argv[optind++];
1198 usage("Missing filename");
1200 /* If a valid .dtb is required, set flags to ensure we get one */
1201 if (disp.output == OUT_DTB) {
1203 disp.flags |= FDT_REG_ADD_MEM_RSVMAP | FDT_REG_ADD_STRING_TAB;
1206 if (disp.output_fname) {
1207 disp.fout = fopen(disp.output_fname, "w");
1209 usage("Cannot open output file");
1214 /* Run the grep and output the results */
1215 ret = do_fdtgrep(&disp, filename);
1216 if (disp.output_fname)