1 // SPDX-License-Identifier: GPL-2.0+
3 * Copyright (c) 2013, Google Inc.
4 * Written by Simon Glass <sjg@chromium.org>
6 * Perform a grep of an FDT either displaying the source subset or producing
7 * a new .dtb subset which can be used as required.
22 #include "libfdt_internal.h"
24 /* Define DEBUG to get some debugging output on stderr */
26 #define debug(a, b...) fprintf(stderr, a, ## b)
28 #define debug(a, b...)
31 /* A linked list of values we are grepping for */
33 int type; /* Types this value matches (FDT_IS... mask) */
34 int include; /* 1 to include matches, 0 to exclude */
35 const char *string; /* String to match */
36 struct value_node *next; /* Pointer to next node, or NULL */
39 /* Output formats we support */
41 OUT_DTS, /* Device tree source */
42 OUT_DTB, /* Valid device tree binary */
43 OUT_BIN, /* Fragment of .dtb, for hashing */
46 /* Holds information which controls our output and options */
48 enum output_t output; /* Output format */
49 int add_aliases; /* Add aliases node to output */
50 int all; /* Display all properties/nodes */
51 int colour; /* Display output in ANSI colour */
52 int region_list; /* Output a region list */
53 int flags; /* Flags (FDT_REG_...) */
54 int list_strings; /* List strings in string table */
55 int show_offset; /* Show offset */
56 int show_addr; /* Show address */
57 int header; /* Output an FDT header */
58 int diff; /* Show +/- diff markers */
59 int include_root; /* Include the root node and all properties */
60 int remove_strings; /* Remove unused strings */
61 int show_dts_version; /* Put '/dts-v1/;' on the first line */
62 int types_inc; /* Mask of types that we include (FDT_IS...) */
63 int types_exc; /* Mask of types that we exclude (FDT_IS...) */
64 int invert; /* Invert polarity of match */
65 struct value_node *value_head; /* List of values to match */
66 const char *output_fname; /* Output filename */
67 FILE *fout; /* File to write dts/dtb output */
70 static void report_error(const char *where, int err)
72 fprintf(stderr, "Error at '%s': %s\n", where, fdt_strerror(err));
75 /* Supported ANSI colours */
90 * print_ansi_colour() - Print out the ANSI sequence for a colour
93 * @col: Colour to output (COL_...), or COL_NONE to reset colour
95 static void print_ansi_colour(FILE *fout, int col)
98 fprintf(fout, "\033[0m");
100 fprintf(fout, "\033[1;%dm", col + 30);
105 * value_add() - Add a new value to our list of things to grep for
107 * @disp: Display structure, holding info about our options
108 * @headp: Pointer to header pointer of list
109 * @type: Type of this value (FDT_IS_...)
110 * @include: 1 if we want to include matches, 0 to exclude
111 * @str: String value to match
113 static int value_add(struct display_info *disp, struct value_node **headp,
114 int type, int include, const char *str)
116 struct value_node *node;
119 * Keep track of which types we are excluding/including. We don't
120 * allow both including and excluding things, because it doesn't make
121 * sense. 'Including' means that everything not mentioned is
122 * excluded. 'Excluding' means that everything not mentioned is
123 * included. So using the two together would be meaningless.
126 disp->types_inc |= type;
128 disp->types_exc |= type;
129 if (disp->types_inc & disp->types_exc & type) {
131 "Cannot use both include and exclude for '%s'\n", str);
138 node = malloc(sizeof(*node));
143 node->include = include;
149 fprintf(stderr, "Out of memory\n");
153 static bool util_is_printable_string(const void *data, int len)
155 const char *s = data;
158 /* zero length is not */
162 /* must terminate with zero */
163 if (s[len - 1] != '\0')
170 while (s < se && *s && isprint((unsigned char)*s))
173 /* not zero, or not done yet */
174 if (*s != '\0' || s == ss)
183 static void utilfdt_print_data(const char *data, int len)
186 const char *p = data;
189 /* no data, don't print */
193 if (util_is_printable_string(data, len)) {
202 } while (s < data + len);
204 } else if ((len % 4) == 0) {
205 const uint32_t *cell = (const uint32_t *)data;
208 for (i = 0, len /= 4; i < len; i++)
209 printf("0x%08x%s", fdt32_to_cpu(cell[i]),
210 i < (len - 1) ? " " : "");
214 for (i = 0; i < len; i++)
215 printf("%02x%s", *p++, i < len - 1 ? " " : "");
221 * display_fdt_by_regions() - Display regions of an FDT source
223 * This dumps an FDT as source, but only certain regions of it. This is the
224 * final stage of the grep - we have a list of regions we want to display,
225 * and this function displays them.
227 * @disp: Display structure, holding info about our options
228 * @blob: FDT blob to display
229 * @region: List of regions to display
230 * @count: Number of regions
232 static int display_fdt_by_regions(struct display_info *disp, const void *blob,
233 struct fdt_region region[], int count)
235 struct fdt_region *reg = region, *reg_end = region + count;
236 uint32_t off_mem_rsvmap = fdt_off_mem_rsvmap(blob);
237 int base = fdt_off_dt_struct(blob);
238 int version = fdt_version(blob);
239 int offset, nextoffset;
240 int tag, depth, shift;
241 FILE *f = disp->fout;
247 if (disp->show_dts_version)
248 fprintf(f, "/dts-v1/;\n");
251 fprintf(f, "// magic:\t\t0x%x\n", fdt_magic(blob));
252 fprintf(f, "// totalsize:\t\t0x%x (%d)\n", fdt_totalsize(blob),
253 fdt_totalsize(blob));
254 fprintf(f, "// off_dt_struct:\t0x%x\n",
255 fdt_off_dt_struct(blob));
256 fprintf(f, "// off_dt_strings:\t0x%x\n",
257 fdt_off_dt_strings(blob));
258 fprintf(f, "// off_mem_rsvmap:\t0x%x\n", off_mem_rsvmap);
259 fprintf(f, "// version:\t\t%d\n", version);
260 fprintf(f, "// last_comp_version:\t%d\n",
261 fdt_last_comp_version(blob));
263 fprintf(f, "// boot_cpuid_phys:\t0x%x\n",
264 fdt_boot_cpuid_phys(blob));
267 fprintf(f, "// size_dt_strings:\t0x%x\n",
268 fdt_size_dt_strings(blob));
271 fprintf(f, "// size_dt_struct:\t0x%x\n",
272 fdt_size_dt_struct(blob));
277 if (disp->flags & FDT_REG_ADD_MEM_RSVMAP) {
278 const struct fdt_reserve_entry *p_rsvmap;
280 p_rsvmap = (const struct fdt_reserve_entry *)
281 ((const char *)blob + off_mem_rsvmap);
283 addr = fdt64_to_cpu(p_rsvmap[i].address);
284 size = fdt64_to_cpu(p_rsvmap[i].size);
285 if (addr == 0 && size == 0)
288 fprintf(f, "/memreserve/ %llx %llx;\n",
289 (unsigned long long)addr,
290 (unsigned long long)size);
296 shift = 4; /* 4 spaces per indent */
298 const struct fdt_property *prop;
306 * Work out the file offset of this offset, and decide
307 * whether it is in the region list or not
309 file_ofs = base + offset;
310 if (reg < reg_end && file_ofs >= reg->offset + reg->size)
312 in_region = reg < reg_end && file_ofs >= reg->offset &&
313 file_ofs < reg->offset + reg->size;
314 tag = fdt_next_tag(blob, offset, &nextoffset);
318 show = in_region || disp->all;
319 if (show && disp->diff)
320 fprintf(f, "%c", in_region ? '+' : '-');
323 /* Do this here to avoid 'if (show)' in every 'case' */
324 if (tag == FDT_BEGIN_NODE)
326 else if (tag == FDT_END_NODE)
330 if (tag != FDT_END) {
332 fprintf(f, "%4x: ", file_ofs);
333 if (disp->show_offset)
334 fprintf(f, "%4x: ", file_ofs - base);
337 /* Green means included, red means excluded */
339 print_ansi_colour(f, in_region ? COL_GREEN : COL_RED);
343 prop = fdt_get_property_by_offset(blob, offset, NULL);
344 name = fdt_string(blob, fdt32_to_cpu(prop->nameoff));
345 fprintf(f, "%*s%s", depth * shift, "", name);
346 utilfdt_print_data(prop->data,
347 fdt32_to_cpu(prop->len));
352 fprintf(f, "%*s// [NOP]", depth * shift, "");
356 name = fdt_get_name(blob, offset, &len);
357 fprintf(f, "%*s%s {", depth++ * shift, "",
362 fprintf(f, "%*s};", --depth * shift, "");
366 /* Reset colour back to normal before end of line */
368 print_ansi_colour(f, COL_NONE);
372 /* Print a list of strings if requested */
373 if (disp->list_strings) {
375 int str_base = fdt_off_dt_strings(blob);
377 for (offset = 0; offset < fdt_size_dt_strings(blob);
378 offset += strlen(str) + 1) {
379 str = fdt_string(blob, offset);
380 int len = strlen(str) + 1;
383 /* Only print strings that are in the region */
384 file_ofs = str_base + offset;
385 in_region = reg < reg_end &&
386 file_ofs >= reg->offset &&
387 file_ofs + len < reg->offset +
389 show = in_region || disp->all;
390 if (show && disp->diff)
391 printf("%c", in_region ? '+' : '-');
393 printf("%4x: ", file_ofs);
394 if (disp->show_offset)
395 printf("%4x: ", offset);
404 * dump_fdt_regions() - Dump regions of an FDT as binary data
406 * This dumps an FDT as binary, but only certain regions of it. This is the
407 * final stage of the grep - we have a list of regions we want to dump,
408 * and this function dumps them.
410 * The output of this function may or may not be a valid FDT. To ensure it
411 * is, these disp->flags must be set:
413 * FDT_REG_SUPERNODES: ensures that subnodes are preceded by their
414 * parents. Without this option, fragments of subnode data may be
415 * output without the supernodes above them. This is useful for
416 * hashing but cannot produce a valid FDT.
417 * FDT_REG_ADD_STRING_TAB: Adds a string table to the end of the FDT.
418 * Without this none of the properties will have names
419 * FDT_REG_ADD_MEM_RSVMAP: Adds a mem_rsvmap table - an FDT is invalid
422 * @disp: Display structure, holding info about our options
423 * @blob: FDT blob to display
424 * @region: List of regions to display
425 * @count: Number of regions
426 * @out: Output destination
428 static int dump_fdt_regions(struct display_info *disp, const void *blob,
429 struct fdt_region region[], int count, char *out)
431 struct fdt_header *fdt;
432 int size, struct_start;
436 /* Set up a basic header (even if we don't actually write it) */
437 fdt = (struct fdt_header *)out;
438 memset(fdt, '\0', sizeof(*fdt));
439 fdt_set_magic(fdt, FDT_MAGIC);
440 struct_start = FDT_ALIGN(sizeof(struct fdt_header),
441 sizeof(struct fdt_reserve_entry));
442 fdt_set_off_mem_rsvmap(fdt, struct_start);
443 fdt_set_version(fdt, FDT_LAST_SUPPORTED_VERSION);
444 fdt_set_last_comp_version(fdt, FDT_FIRST_SUPPORTED_VERSION);
447 * Calculate the total size of the regions we are writing out. The
448 * first will be the mem_rsvmap if the FDT_REG_ADD_MEM_RSVMAP flag
449 * is set. The last will be the string table if FDT_REG_ADD_STRING_TAB
452 for (i = size = 0; i < count; i++)
453 size += region[i].size;
455 /* Bring in the mem_rsvmap section from the old file if requested */
456 if (count > 0 && (disp->flags & FDT_REG_ADD_MEM_RSVMAP)) {
457 struct_start += region[0].size;
458 size -= region[0].size;
460 fdt_set_off_dt_struct(fdt, struct_start);
462 /* Update the header to have the correct offsets/sizes */
463 if (count >= 2 && (disp->flags & FDT_REG_ADD_STRING_TAB)) {
466 str_size = region[count - 1].size;
467 fdt_set_size_dt_struct(fdt, size - str_size);
468 fdt_set_off_dt_strings(fdt, struct_start + size - str_size);
469 fdt_set_size_dt_strings(fdt, str_size);
470 fdt_set_totalsize(fdt, struct_start + size);
473 /* Write the header if required */
477 while (ptr < fdt_off_mem_rsvmap(fdt))
481 /* Output all the nodes including any mem_rsvmap/string table */
482 for (i = 0; i < count; i++) {
483 struct fdt_region *reg = ®ion[i];
485 memcpy(out + ptr, (const char *)blob + reg->offset, reg->size);
493 * show_region_list() - Print out a list of regions
495 * The list includes the region offset (absolute offset from start of FDT
496 * blob in bytes) and size
498 * @reg: List of regions to print
499 * @count: Number of regions
501 static void show_region_list(struct fdt_region *reg, int count)
505 printf("Regions: %d\n", count);
506 for (i = 0; i < count; i++, reg++) {
507 printf("%d: %-10x %-10x\n", i, reg->offset,
508 reg->offset + reg->size);
512 static int check_type_include(void *priv, int type, const char *data, int size)
514 struct display_info *disp = priv;
515 struct value_node *val;
516 int match, none_match = FDT_IS_ANY;
518 /* If none of our conditions mention this type, we know nothing */
519 debug("type=%x, data=%s\n", type, data ? data : "(null)");
520 if (!((disp->types_inc | disp->types_exc) & type)) {
521 debug(" - not in any condition\n");
526 * Go through the list of conditions. For inclusive conditions, we
527 * return 1 at the first match. For exclusive conditions, we must
528 * check that there are no matches.
531 for (val = disp->value_head; val; val = val->next) {
532 if (!(type & val->type))
534 match = fdt_stringlist_contains(data, size,
536 debug(" - val->type=%x, str='%s', match=%d\n",
537 val->type, val->string, match);
538 if (match && val->include) {
539 debug(" - match inc %s\n", val->string);
543 none_match &= ~val->type;
548 * If this is an exclusive condition, and nothing matches, then we
551 if ((type & disp->types_exc) && (none_match & type)) {
552 debug(" - match exc\n");
554 * Allow FDT_IS_COMPAT to make the final decision in the
555 * case where there is no specific type
557 if (type == FDT_IS_NODE && disp->types_exc == FDT_ANY_GLOBAL) {
558 debug(" - supressed exc node\n");
565 * Allow FDT_IS_COMPAT to make the final decision in the
566 * case where there is no specific type (inclusive)
568 if (type == FDT_IS_NODE && disp->types_inc == FDT_ANY_GLOBAL)
571 debug(" - no match, types_inc=%x, types_exc=%x, none_match=%x\n",
572 disp->types_inc, disp->types_exc, none_match);
578 * h_include() - Include handler function for fdt_find_regions()
580 * This function decides whether to include or exclude a node, property or
581 * compatible string. The function is defined by fdt_find_regions().
583 * The algorithm is documented in the code - disp->invert is 0 for normal
584 * operation, and 1 to invert the sense of all matches.
588 static int h_include(void *priv, const void *fdt, int offset, int type,
589 const char *data, int size)
591 struct display_info *disp = priv;
594 inc = check_type_include(priv, type, data, size);
595 if (disp->include_root && type == FDT_IS_PROP && offset == 0 && inc)
599 * If the node name does not tell us anything, check the
602 if (inc == -1 && type == FDT_IS_NODE) {
603 debug(" - checking compatible2\n");
604 data = fdt_getprop(fdt, offset, "compatible", &len);
605 inc = check_type_include(priv, FDT_IS_COMPAT, data, len);
608 /* If we still have no idea, check for properties in the node */
609 if (inc != 1 && type == FDT_IS_NODE &&
610 (disp->types_inc & FDT_NODE_HAS_PROP)) {
611 debug(" - checking node '%s'\n",
612 fdt_get_name(fdt, offset, NULL));
613 for (offset = fdt_first_property_offset(fdt, offset);
614 offset > 0 && inc != 1;
615 offset = fdt_next_property_offset(fdt, offset)) {
616 const struct fdt_property *prop;
619 prop = fdt_get_property_by_offset(fdt, offset, NULL);
622 str = fdt_string(fdt, fdt32_to_cpu(prop->nameoff));
623 inc = check_type_include(priv, FDT_NODE_HAS_PROP, str,
638 debug(" - returning %d\n", inc);
643 static int h_cmp_region(const void *v1, const void *v2)
645 const struct fdt_region *region1 = v1, *region2 = v2;
647 return region1->offset - region2->offset;
650 static int fdtgrep_find_regions(const void *fdt,
651 int (*include_func)(void *priv, const void *fdt, int offset,
652 int type, const char *data, int size),
653 struct display_info *disp, struct fdt_region *region,
654 int max_regions, char *path, int path_len, int flags)
656 struct fdt_region_state state;
661 ret = fdt_first_region(fdt, include_func, disp,
662 ®ion[count++], path, path_len,
663 disp->flags, &state);
665 ret = fdt_next_region(fdt, include_func, disp,
666 count < max_regions ? ®ion[count] : NULL,
667 path, path_len, disp->flags, &state);
671 if (ret && ret != -FDT_ERR_NOTFOUND)
674 /* Find all the aliases and add those regions back in */
675 if (disp->add_aliases && count < max_regions) {
678 new_count = fdt_add_alias_regions(fdt, region, count,
679 max_regions, &state);
680 if (new_count == -FDT_ERR_NOTFOUND) {
681 /* No alias node found */
682 } else if (new_count < 0) {
684 } else if (new_count <= max_regions) {
686 * The alias regions will now be at the end of the list.
687 * Sort the regions by offset to get things into the
691 qsort(region, count, sizeof(struct fdt_region),
699 int utilfdt_read_err_len(const char *filename, char **buffp, off_t *len)
701 int fd = 0; /* assume stdin */
703 off_t bufsize = 1024, offset = 0;
707 if (strcmp(filename, "-") != 0) {
708 fd = open(filename, O_RDONLY);
713 /* Loop until we have read everything */
714 buf = malloc(bufsize);
718 /* Expand the buffer to hold the next chunk */
719 if (offset == bufsize) {
721 buf = realloc(buf, bufsize);
726 ret = read(fd, &buf[offset], bufsize - offset);
734 /* Clean up, including closing stdin; return errno on error */
744 int utilfdt_read_err(const char *filename, char **buffp)
747 return utilfdt_read_err_len(filename, buffp, &len);
750 char *utilfdt_read_len(const char *filename, off_t *len)
753 int ret = utilfdt_read_err_len(filename, &buff, len);
756 fprintf(stderr, "Couldn't open blob from '%s': %s\n", filename,
760 /* Successful read */
764 char *utilfdt_read(const char *filename)
767 return utilfdt_read_len(filename, &len);
771 * Run the main fdtgrep operation, given a filename and valid arguments
773 * @param disp Display information / options
774 * @param filename Filename of blob file
775 * @param return 0 if ok, -ve on error
777 static int do_fdtgrep(struct display_info *disp, const char *filename)
779 struct fdt_region *region = NULL;
786 blob = utilfdt_read(filename);
789 ret = fdt_check_header(blob);
791 fprintf(stderr, "Error: %s\n", fdt_strerror(ret));
795 /* Allow old files, but they are untested */
796 if (fdt_version(blob) < 17 && disp->value_head) {
798 "Warning: fdtgrep does not fully support version %d files\n",
803 * We do two passes, since we don't know how many regions we need.
804 * The first pass will count the regions, but if it is too many,
805 * we do another pass to actually record them.
807 for (i = 0; i < 2; i++) {
808 region = malloc(count * sizeof(struct fdt_region));
810 fprintf(stderr, "Out of memory for %d regions\n",
815 count = fdtgrep_find_regions(blob,
817 region, max_regions, path, sizeof(path),
820 report_error("fdt_find_regions", count);
824 if (count <= max_regions)
827 fprintf(stderr, "Internal error with fdtgrep_find_region)(\n");
831 /* Optionally print a list of regions */
832 if (disp->region_list)
833 show_region_list(region, count);
835 /* Output either source .dts or binary .dtb */
836 if (disp->output == OUT_DTS) {
837 ret = display_fdt_by_regions(disp, blob, region, count);
840 /* Allow reserved memory section to expand slightly */
841 int size = fdt_totalsize(blob) + 16;
845 fprintf(stderr, "Out_of_memory\n");
849 size = dump_fdt_regions(disp, blob, region, count, fdt);
850 if (disp->remove_strings) {
855 fprintf(stderr, "Out_of_memory\n");
859 ret = fdt_remove_unused_strings(fdt, out);
862 "Failed to remove unused strings: err=%d\n",
870 fprintf(stderr, "Failed to pack: err=%d\n",
874 size = fdt_totalsize(fdt);
877 if (size != fwrite(fdt, 1, size, disp->fout)) {
878 fprintf(stderr, "Write failure, %d bytes\n", size);
892 static const char usage_synopsis[] =
893 "fdtgrep - extract portions from device tree\n"
896 " fdtgrep <options> <dt file>|-\n\n"
897 "Output formats are:\n"
898 "\tdts - device tree soure text\n"
899 "\tdtb - device tree blob (sets -Hmt automatically)\n"
900 "\tbin - device tree fragment (may not be a valid .dtb)";
902 /* Helper for usage_short_opts string constant */
903 #define USAGE_COMMON_SHORT_OPTS "hV"
905 /* Helper for aligning long_opts array */
906 #define a_argument required_argument
908 /* Helper for usage_long_opts option array */
909 #define USAGE_COMMON_LONG_OPTS \
910 {"help", no_argument, NULL, 'h'}, \
911 {"version", no_argument, NULL, 'V'}, \
912 {NULL, no_argument, NULL, 0x0}
914 /* Helper for usage_opts_help array */
915 #define USAGE_COMMON_OPTS_HELP \
916 "Print this help and exit", \
917 "Print version and exit", \
920 /* Helper for getopt case statements */
921 #define case_USAGE_COMMON_FLAGS \
922 case 'h': usage(NULL); \
923 case 'V': util_version(); \
924 case '?': usage("unknown option");
926 static const char usage_short_opts[] =
927 "haAc:b:C:defg:G:HIlLmn:N:o:O:p:P:rRsStTv"
928 USAGE_COMMON_SHORT_OPTS;
929 static struct option const usage_long_opts[] = {
930 {"show-address", no_argument, NULL, 'a'},
931 {"colour", no_argument, NULL, 'A'},
932 {"include-node-with-prop", a_argument, NULL, 'b'},
933 {"include-compat", a_argument, NULL, 'c'},
934 {"exclude-compat", a_argument, NULL, 'C'},
935 {"diff", no_argument, NULL, 'd'},
936 {"enter-node", no_argument, NULL, 'e'},
937 {"show-offset", no_argument, NULL, 'f'},
938 {"include-match", a_argument, NULL, 'g'},
939 {"exclude-match", a_argument, NULL, 'G'},
940 {"show-header", no_argument, NULL, 'H'},
941 {"show-version", no_argument, NULL, 'I'},
942 {"list-regions", no_argument, NULL, 'l'},
943 {"list-strings", no_argument, NULL, 'L'},
944 {"include-mem", no_argument, NULL, 'm'},
945 {"include-node", a_argument, NULL, 'n'},
946 {"exclude-node", a_argument, NULL, 'N'},
947 {"include-prop", a_argument, NULL, 'p'},
948 {"exclude-prop", a_argument, NULL, 'P'},
949 {"remove-strings", no_argument, NULL, 'r'},
950 {"include-root", no_argument, NULL, 'R'},
951 {"show-subnodes", no_argument, NULL, 's'},
952 {"skip-supernodes", no_argument, NULL, 'S'},
953 {"show-stringtab", no_argument, NULL, 't'},
954 {"show-aliases", no_argument, NULL, 'T'},
955 {"out", a_argument, NULL, 'o'},
956 {"out-format", a_argument, NULL, 'O'},
957 {"invert-match", no_argument, NULL, 'v'},
958 USAGE_COMMON_LONG_OPTS,
960 static const char * const usage_opts_help[] = {
962 "Show all nodes/tags, colour those that match",
963 "Include contains containing property",
964 "Compatible nodes to include in grep",
965 "Compatible nodes to exclude in grep",
966 "Diff: Mark matching nodes with +, others with -",
967 "Enter direct subnode names of matching nodes",
969 "Node/property/compatible string to include in grep",
970 "Node/property/compatible string to exclude in grep",
972 "Put \"/dts-v1/;\" on first line of dts output",
973 "Output a region list",
974 "List strings in string table",
975 "Include mem_rsvmap section in binary output",
976 "Node to include in grep",
977 "Node to exclude in grep",
978 "Property to include in grep",
979 "Property to exclude in grep",
980 "Remove unused strings from string table",
981 "Include root node and all properties",
982 "Show all subnodes matching nodes",
983 "Don't include supernodes of matching nodes",
984 "Include string table in binary output",
985 "Include matching aliases in output",
987 "-O <output format>",
988 "Invert the sense of matching (select non-matching lines)",
989 USAGE_COMMON_OPTS_HELP
993 * Call getopt_long() with standard options
995 * Since all util code runs getopt in the same way, provide a helper.
997 #define util_getopt_long() getopt_long(argc, argv, usage_short_opts, \
998 usage_long_opts, NULL)
1000 void util_usage(const char *errmsg, const char *synopsis,
1001 const char *short_opts, struct option const long_opts[],
1002 const char * const opts_help[])
1004 FILE *fp = errmsg ? stderr : stdout;
1005 const char a_arg[] = "<arg>";
1006 size_t a_arg_len = strlen(a_arg) + 1;
1013 "Options: -[%s]\n", synopsis, short_opts);
1015 /* prescan the --long opt length to auto-align */
1017 for (i = 0; long_opts[i].name; ++i) {
1018 /* +1 is for space between --opt and help text */
1019 int l = strlen(long_opts[i].name) + 1;
1020 if (long_opts[i].has_arg == a_argument)
1026 for (i = 0; long_opts[i].name; ++i) {
1027 /* helps when adding new applets or options */
1028 assert(opts_help[i] != NULL);
1030 /* first output the short flag if it has one */
1031 if (long_opts[i].val > '~')
1034 fprintf(fp, " -%c, ", long_opts[i].val);
1036 /* then the long flag */
1037 if (long_opts[i].has_arg == no_argument) {
1038 fprintf(fp, "--%-*s", optlen, long_opts[i].name);
1040 fprintf(fp, "--%s %s%*s", long_opts[i].name, a_arg,
1041 (int)(optlen - strlen(long_opts[i].name) -
1045 /* finally the help text */
1046 fprintf(fp, "%s\n", opts_help[i]);
1050 fprintf(fp, "\nError: %s\n", errmsg);
1058 * Show usage and exit
1060 * If you name all your usage variables with usage_xxx, then you can call this
1061 * help macro rather than expanding all arguments yourself.
1063 * @param errmsg If non-NULL, an error message to display
1065 #define usage(errmsg) \
1066 util_usage(errmsg, usage_synopsis, usage_short_opts, \
1067 usage_long_opts, usage_opts_help)
1069 void util_version(void)
1071 printf("Version: %s\n", "(U-Boot)");
1075 static void scan_args(struct display_info *disp, int argc, char *argv[])
1079 while ((opt = util_getopt_long()) != EOF) {
1084 case_USAGE_COMMON_FLAGS
1086 disp->show_addr = 1;
1092 type = FDT_NODE_HAS_PROP;
1098 type = FDT_IS_COMPAT;
1104 disp->flags |= FDT_REG_DIRECT_SUBNODES;
1107 disp->show_offset = 1;
1113 type = FDT_ANY_GLOBAL;
1119 disp->region_list = 1;
1122 disp->list_strings = 1;
1125 disp->flags |= FDT_REG_ADD_MEM_RSVMAP;
1134 disp->output_fname = optarg;
1137 if (!strcmp(optarg, "dtb"))
1138 disp->output = OUT_DTB;
1139 else if (!strcmp(optarg, "dts"))
1140 disp->output = OUT_DTS;
1141 else if (!strcmp(optarg, "bin"))
1142 disp->output = OUT_BIN;
1144 usage("Unknown output format");
1153 disp->remove_strings = 1;
1156 disp->include_root = 1;
1159 disp->flags |= FDT_REG_ALL_SUBNODES;
1162 disp->flags &= ~FDT_REG_SUPERNODES;
1165 disp->flags |= FDT_REG_ADD_STRING_TAB;
1168 disp->add_aliases = 1;
1174 disp->show_dts_version = 1;
1178 if (type && value_add(disp, &disp->value_head, type, inc,
1180 usage("Cannot add value");
1183 if (disp->invert && disp->types_exc)
1184 usage("-v has no meaning when used with 'exclude' conditions");
1187 int main(int argc, char *argv[])
1189 char *filename = NULL;
1190 struct display_info disp;
1194 memset(&disp, '\0', sizeof(disp));
1195 disp.flags = FDT_REG_SUPERNODES; /* Default flags */
1197 scan_args(&disp, argc, argv);
1199 /* Show matched lines in colour if we can */
1200 disp.colour = disp.all && isatty(0);
1202 /* Any additional arguments can match anything, just like -g */
1203 while (optind < argc - 1) {
1204 if (value_add(&disp, &disp.value_head, FDT_IS_ANY, 1,
1206 usage("Cannot add value");
1210 filename = argv[optind++];
1212 usage("Missing filename");
1214 /* If a valid .dtb is required, set flags to ensure we get one */
1215 if (disp.output == OUT_DTB) {
1217 disp.flags |= FDT_REG_ADD_MEM_RSVMAP | FDT_REG_ADD_STRING_TAB;
1220 if (disp.output_fname) {
1221 disp.fout = fopen(disp.output_fname, "w");
1223 usage("Cannot open output file");
1228 /* Run the grep and output the results */
1229 ret = do_fdtgrep(&disp, filename);
1230 if (disp.output_fname)