3 * Gerald Van Baren, Custom IDEAS, vanbaren@cideas.com
4 * Based on code written by:
5 * Pantelis Antoniou <pantelis.antoniou@gmail.com> and
6 * Matthew McClintock <msm@freescale.com>
8 * See file CREDITS for list of people who contributed to this
11 * This program is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU General Public License as
13 * published by the Free Software Foundation; either version 2 of
14 * the License, or (at your option) any later version.
16 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 * GNU General Public License for more details.
21 * You should have received a copy of the GNU General Public License
22 * along with this program; if not, write to the Free Software
23 * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
29 #include <linux/ctype.h>
30 #include <linux/types.h>
32 #ifdef CONFIG_OF_LIBFDT
34 #include <asm/global_data.h>
37 #include <fdt_support.h>
39 #define MAX_LEVEL 32 /* how deeply nested we will go */
40 #define SCRATCHPAD 1024 /* bytes of scratchpad memory */
43 * Global data (for the gd->bd)
45 DECLARE_GLOBAL_DATA_PTR;
47 static int fdt_valid(void);
48 static int fdt_parse_prop(char *pathp, char *prop, char *newval,
49 char *data, int *len);
50 static int fdt_print(char *pathp, char *prop, int depth);
53 * Flattened Device Tree command, see the help for parameter definitions.
55 int do_fdt (cmd_tbl_t * cmdtp, int flag, int argc, char *argv[])
58 printf ("Usage:\n%s\n", cmdtp->usage);
62 /********************************************************************
63 * Set the address of the fdt
64 ********************************************************************/
65 if (argv[1][0] == 'a') {
67 * Set the address [and length] of the fdt.
69 fdt = (struct fdt_header *)simple_strtoul(argv[2], NULL, 16);
81 len = simple_strtoul(argv[3], NULL, 16);
82 if (len < fdt_totalsize(fdt)) {
83 printf ("New length %d < existing length %d, "
85 len, fdt_totalsize(fdt));
88 * Open in place with a new length.
90 err = fdt_open_into(fdt, fdt, len);
92 printf ("libfdt fdt_open_into(): %s\n",
98 /********************************************************************
100 ********************************************************************/
101 } else if ((argv[1][0] == 'm') && (argv[1][1] == 'o')) {
102 struct fdt_header *newaddr;
107 printf ("Usage:\n%s\n", cmdtp->usage);
112 * Set the address and length of the fdt.
114 fdt = (struct fdt_header *)simple_strtoul(argv[2], NULL, 16);
119 newaddr = (struct fdt_header *)simple_strtoul(argv[3],NULL,16);
122 * If the user specifies a length, use that. Otherwise use the
126 len = fdt_totalsize(fdt);
128 len = simple_strtoul(argv[4], NULL, 16);
129 if (len < fdt_totalsize(fdt)) {
130 printf ("New length 0x%X < existing length "
132 len, fdt_totalsize(fdt));
138 * Copy to the new location.
140 err = fdt_open_into(fdt, newaddr, len);
142 printf ("libfdt fdt_open_into(): %s\n",
148 /********************************************************************
150 ********************************************************************/
151 } else if ((argv[1][0] == 'm') && (argv[1][1] == 'k')) {
152 char *pathp; /* path */
153 char *nodep; /* new node to add */
154 int nodeoffset; /* node offset from libfdt */
158 * Parameters: Node path, new node to be appended to the path.
161 printf ("Usage:\n%s\n", cmdtp->usage);
168 nodeoffset = fdt_find_node_by_path (fdt, pathp);
169 if (nodeoffset < 0) {
171 * Not found or something else bad happened.
173 printf ("libfdt fdt_find_node_by_path() returned %s\n",
174 fdt_strerror(nodeoffset));
177 err = fdt_add_subnode(fdt, nodeoffset, nodep);
179 printf ("libfdt fdt_add_subnode(): %s\n",
184 /********************************************************************
185 * Set the value of a property in the fdt.
186 ********************************************************************/
187 } else if (argv[1][0] == 's') {
188 char *pathp; /* path */
189 char *prop; /* property */
190 char *newval; /* value from the user (as a string) */
191 int nodeoffset; /* node offset from libfdt */
192 static char data[SCRATCHPAD]; /* storage for the property */
193 int len; /* new length of the property */
194 int ret; /* return value */
197 * Parameters: Node path, property, value.
200 printf ("Usage:\n%s\n", cmdtp->usage);
208 nodeoffset = fdt_find_node_by_path (fdt, pathp);
209 if (nodeoffset < 0) {
211 * Not found or something else bad happened.
213 printf ("libfdt fdt_find_node_by_path() returned %s\n",
214 fdt_strerror(nodeoffset));
217 ret = fdt_parse_prop(pathp, prop, newval, data, &len);
221 ret = fdt_setprop(fdt, nodeoffset, prop, data, len);
223 printf ("libfdt fdt_setprop(): %s\n", fdt_strerror(ret));
227 /********************************************************************
228 * Print (recursive) / List (single level)
229 ********************************************************************/
230 } else if ((argv[1][0] == 'p') || (argv[1][0] == 'l')) {
231 int depth = MAX_LEVEL; /* how deep to print */
232 char *pathp; /* path */
233 char *prop; /* property */
234 int ret; /* return value */
237 * list is an alias for print, but limited to 1 level
239 if (argv[1][0] == 'l') {
244 * Get the starting path. The root node is an oddball,
245 * the offset is zero and has no name.
253 ret = fdt_print(pathp, prop, depth);
257 /********************************************************************
258 * Remove a property/node
259 ********************************************************************/
260 } else if (argv[1][0] == 'r') {
261 int nodeoffset; /* node offset from libfdt */
265 * Get the path. The root node is an oddball, the offset
266 * is zero and has no name.
268 nodeoffset = fdt_find_node_by_path (fdt, argv[2]);
269 if (nodeoffset < 0) {
271 * Not found or something else bad happened.
273 printf ("libfdt fdt_find_node_by_path() returned %s\n",
274 fdt_strerror(nodeoffset));
278 * Do the delete. A fourth parameter means delete a property,
279 * otherwise delete the node.
282 err = fdt_delprop(fdt, nodeoffset, argv[3]);
284 printf("libfdt fdt_delprop(): %s\n",
289 err = fdt_del_node(fdt, nodeoffset);
291 printf("libfdt fdt_del_node(): %s\n",
297 #ifdef CONFIG_OF_BOARD_SETUP
298 /* Call the board-specific fixup routine */
299 else if (argv[1][0] == 'b')
300 ft_board_setup(fdt, gd->bd);
302 /* Create a chosen node */
303 else if (argv[1][0] == 'c')
304 fdt_chosen(fdt, 0, 0, 1);
306 #ifdef CONFIG_OF_HAS_UBOOT_ENV
307 /* Create a u-boot-env node */
308 else if (argv[1][0] == 'e')
311 #ifdef CONFIG_OF_HAS_BD_T
312 /* Create a bd_t node */
313 else if (argv[1][0] == 'b')
317 /* Unrecognized command */
318 printf ("Usage:\n%s\n", cmdtp->usage);
325 /****************************************************************************/
327 static int fdt_valid(void)
332 printf ("The address of the fdt is invalid (NULL).\n");
336 err = fdt_check_header(fdt);
338 return 1; /* valid */
341 printf("libfdt fdt_check_header(): %s", fdt_strerror(err));
343 * Be more informative on bad version.
345 if (err == -FDT_ERR_BADVERSION) {
346 if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION) {
347 printf (" - too old, fdt $d < %d",
349 FDT_FIRST_SUPPORTED_VERSION);
352 if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION) {
353 printf (" - too new, fdt $d > %d",
355 FDT_LAST_SUPPORTED_VERSION);
366 /****************************************************************************/
369 * Parse the user's input, partially heuristic. Valid formats:
371 * <0011> - hex half word (16 bits)
372 * <00112233> - hex word (32 bits)
373 * - hex double words (64 bits) are not supported, must use
374 * a byte stream instead.
375 * [00 11 22 .. nn] - byte stream
376 * "string" - If the the value doesn't start with "<" or "[", it is
377 * treated as a string. Note that the quotes are
378 * stripped by the parser before we get the string.
380 static int fdt_parse_prop(char *pathp, char *prop, char *newval,
381 char *data, int *len)
383 char *cp; /* temporary char pointer */
384 unsigned long tmp; /* holds converted values */
386 if (*newval == '<') {
388 * Bigger values than bytes.
392 while ((*newval != '>') && (*newval != '\0')) {
394 tmp = simple_strtoul(cp, &newval, 16);
395 if ((newval - cp) <= 2) {
399 } else if ((newval - cp) <= 4) {
400 *(uint16_t *)data = __cpu_to_be16(tmp);
403 } else if ((newval - cp) <= 8) {
404 *(uint32_t *)data = __cpu_to_be32(tmp);
408 printf("Sorry, I could not convert \"%s\"\n",
412 while (*newval == ' ')
415 if (*newval != '>') {
416 printf("Unexpected character '%c'\n", *newval);
419 } else if (*newval == '[') {
421 * Byte stream. Convert the values.
425 while ((*newval != ']') && (*newval != '\0')) {
426 tmp = simple_strtoul(newval, &newval, 16);
427 *data++ = tmp & 0xFF;
429 while (*newval == ' ')
432 if (*newval != ']') {
433 printf("Unexpected character '%c'\n", *newval);
438 * Assume it is a string. Copy it into our data area for
439 * convenience (including the terminating '\0').
441 *len = strlen(newval) + 1;
442 strcpy(data, newval);
447 /****************************************************************************/
450 * Heuristic to guess if this is a string or concatenated strings.
453 static int is_printable_string(const void *data, int len)
455 const char *s = data;
457 /* zero length is not */
461 /* must terminate with zero */
462 if (s[len - 1] != '\0')
465 /* printable or a null byte (concatenated strings) */
466 while (((*s == '\0') || isprint(*s)) && (len > 0)) {
468 * If we see a null, there are three possibilities:
469 * 1) If len == 1, it is the end of the string, printable
470 * 2) Next character also a null, not printable.
471 * 3) Next character not a null, continue to check.
483 /* Not the null termination, or not done yet: not printable */
484 if (*s != '\0' || (len != 0))
492 * Print the property in the best format, a heuristic guess. Print as
493 * a string, concatenated strings, a byte, word, double word, or (if all
494 * else fails) it is printed as a stream of bytes.
496 static void print_data(const void *data, int len)
501 /* no data, don't print */
506 * It is a string, but it may have multiple strings (embedded '\0's).
508 if (is_printable_string(data, len)) {
515 j += strlen(data) + 1;
516 data += strlen(data) + 1;
524 printf("<%02x>", (*(u8 *) data) & 0xff);
526 case 2: /* half-word */
527 printf("<%04x>", be16_to_cpu(*(u16 *) data) & 0xffff);
530 printf("<%08x>", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
532 case 8: /* double-word */
534 printf("<%016llx>", be64_to_cpu(*(uint64_t *) data));
536 printf("<%08x ", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
538 printf("%08x>", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
541 default: /* anything else... hexdump */
543 for (j = 0, s = data; j < len; j++)
544 printf("%02x%s", s[j], j < len - 1 ? " " : "");
551 /****************************************************************************/
554 * Recursively print (a portion of) the fdt. The depth parameter
555 * determines how deeply nested the fdt is printed.
557 static int fdt_print(char *pathp, char *prop, int depth)
559 static int offstack[MAX_LEVEL];
560 static char tabs[MAX_LEVEL+1] =
561 "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t"
562 "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t";
563 void *nodep; /* property node pointer */
564 int nodeoffset; /* node offset from libfdt */
565 int nextoffset; /* next node offset from libfdt */
566 uint32_t tag; /* tag */
567 int len; /* length of the property */
568 int level = 0; /* keep track of nesting level */
570 nodeoffset = fdt_find_node_by_path (fdt, pathp);
571 if (nodeoffset < 0) {
573 * Not found or something else bad happened.
575 printf ("libfdt fdt_find_node_by_path() returned %s\n",
576 fdt_strerror(nodeoffset));
580 * The user passed in a property as well as node path.
581 * Print only the given property and then return.
584 nodep = fdt_getprop (fdt, nodeoffset, prop, &len);
586 /* no property value */
587 printf("%s %s\n", pathp, prop);
589 } else if (len > 0) {
591 print_data (nodep, len);
595 printf ("libfdt fdt_getprop(): %s\n",
602 * The user passed in a node path and no property,
603 * print the node and all subnodes.
605 offstack[0] = nodeoffset;
608 tag = fdt_next_tag(fdt, nodeoffset, &nextoffset, &pathp);
613 &tabs[MAX_LEVEL - level], pathp);
615 offstack[level] = nodeoffset;
616 if (level >= MAX_LEVEL) {
617 printf("Aaaiii <splat> nested too deep. "
625 printf("%s};\n", &tabs[MAX_LEVEL - level]);
627 level = -1; /* exit the loop */
631 nodep = fdt_getprop (fdt, offstack[level], pathp, &len);
633 printf ("libfdt fdt_getprop(): %s\n",
636 } else if (len == 0) {
637 /* the property has no value */
640 &tabs[MAX_LEVEL - level],
645 &tabs[MAX_LEVEL - level],
647 print_data (nodep, len);
658 printf("Unknown tag 0x%08X\n", tag);
661 nodeoffset = nextoffset;
666 /********************************************************************/
670 "fdt - flattened device tree utility commands\n",
671 "addr <addr> [<length>] - Set the fdt location to <addr>\n"
672 #ifdef CONFIG_OF_BOARD_SETUP
673 "fdt boardsetup - Do board-specific set up\n"
675 "fdt move <fdt> <newaddr> <length> - Copy the fdt to <addr>\n"
676 "fdt print <path> [<prop>] - Recursive print starting at <path>\n"
677 "fdt list <path> [<prop>] - Print one level starting at <path>\n"
678 "fdt set <path> <prop> [<val>] - Set <property> [to <val>]\n"
679 "fdt mknode <path> <node> - Create a new node after <path>\n"
680 "fdt rm <path> [<prop>] - Delete the node or <property>\n"
681 "fdt chosen - Add/update the /chosen branch in the tree\n"
682 #ifdef CONFIG_OF_HAS_UBOOT_ENV
683 "fdt env - Add/replace the /u-boot-env branch in the tree\n"
685 #ifdef CONFIG_OF_HAS_BD_T
686 "fdt bd_t - Add/replace the /bd_t branch in the tree\n"
689 " If the property you are setting/printing has a '#' character or spaces,\n"
690 " you MUST escape it with a \\ character or quote it with \".\n"
691 "Examples: fdt print / # print the whole tree\n"
692 " fdt print /cpus \"#address-cells\"\n"
693 " fdt set /cpus \"#address-cells\" \"[00 00 00 01]\"\n"
696 #endif /* CONFIG_OF_LIBFDT */