cmd_fdt.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701
  1. /*
  2. * (C) Copyright 2007
  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>
  7. *
  8. * See file CREDITS for list of people who contributed to this
  9. * project.
  10. *
  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.
  15. *
  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.
  20. *
  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,
  24. * MA 02111-1307 USA
  25. */
  26. #include <common.h>
  27. #include <command.h>
  28. #include <linux/ctype.h>
  29. #include <linux/types.h>
  30. #include <asm/global_data.h>
  31. #include <fdt.h>
  32. #include <libfdt.h>
  33. #include <fdt_support.h>
  34. #define MAX_LEVEL 32 /* how deeply nested we will go */
  35. #define SCRATCHPAD 1024 /* bytes of scratchpad memory */
  36. /*
  37. * Global data (for the gd->bd)
  38. */
  39. DECLARE_GLOBAL_DATA_PTR;
  40. static int fdt_valid(void);
  41. static int fdt_parse_prop(char *pathp, char *prop, char *newval,
  42. char *data, int *len);
  43. static int fdt_print(const char *pathp, char *prop, int depth);
  44. /*
  45. * Flattened Device Tree command, see the help for parameter definitions.
  46. */
  47. int do_fdt (cmd_tbl_t * cmdtp, int flag, int argc, char *argv[])
  48. {
  49. if (argc < 2) {
  50. printf ("Usage:\n%s\n", cmdtp->usage);
  51. return 1;
  52. }
  53. /********************************************************************
  54. * Set the address of the fdt
  55. ********************************************************************/
  56. if (argv[1][0] == 'a') {
  57. /*
  58. * Set the address [and length] of the fdt.
  59. */
  60. fdt = (struct fdt_header *)simple_strtoul(argv[2], NULL, 16);
  61. if (!fdt_valid()) {
  62. return 1;
  63. }
  64. if (argc >= 4) {
  65. int len;
  66. int err;
  67. /*
  68. * Optional new length
  69. */
  70. len = simple_strtoul(argv[3], NULL, 16);
  71. if (len < fdt_totalsize(fdt)) {
  72. printf ("New length %d < existing length %d, "
  73. "ignoring.\n",
  74. len, fdt_totalsize(fdt));
  75. } else {
  76. /*
  77. * Open in place with a new length.
  78. */
  79. err = fdt_open_into(fdt, fdt, len);
  80. if (err != 0) {
  81. printf ("libfdt fdt_open_into(): %s\n",
  82. fdt_strerror(err));
  83. }
  84. }
  85. }
  86. /********************************************************************
  87. * Move the fdt
  88. ********************************************************************/
  89. } else if ((argv[1][0] == 'm') && (argv[1][1] == 'o')) {
  90. struct fdt_header *newaddr;
  91. int len;
  92. int err;
  93. if (argc < 4) {
  94. printf ("Usage:\n%s\n", cmdtp->usage);
  95. return 1;
  96. }
  97. /*
  98. * Set the address and length of the fdt.
  99. */
  100. fdt = (struct fdt_header *)simple_strtoul(argv[2], NULL, 16);
  101. if (!fdt_valid()) {
  102. return 1;
  103. }
  104. newaddr = (struct fdt_header *)simple_strtoul(argv[3],NULL,16);
  105. /*
  106. * If the user specifies a length, use that. Otherwise use the
  107. * current length.
  108. */
  109. if (argc <= 4) {
  110. len = fdt_totalsize(fdt);
  111. } else {
  112. len = simple_strtoul(argv[4], NULL, 16);
  113. if (len < fdt_totalsize(fdt)) {
  114. printf ("New length 0x%X < existing length "
  115. "0x%X, aborting.\n",
  116. len, fdt_totalsize(fdt));
  117. return 1;
  118. }
  119. }
  120. /*
  121. * Copy to the new location.
  122. */
  123. err = fdt_open_into(fdt, newaddr, len);
  124. if (err != 0) {
  125. printf ("libfdt fdt_open_into(): %s\n",
  126. fdt_strerror(err));
  127. return 1;
  128. }
  129. fdt = newaddr;
  130. /********************************************************************
  131. * Make a new node
  132. ********************************************************************/
  133. } else if ((argv[1][0] == 'm') && (argv[1][1] == 'k')) {
  134. char *pathp; /* path */
  135. char *nodep; /* new node to add */
  136. int nodeoffset; /* node offset from libfdt */
  137. int err;
  138. /*
  139. * Parameters: Node path, new node to be appended to the path.
  140. */
  141. if (argc < 4) {
  142. printf ("Usage:\n%s\n", cmdtp->usage);
  143. return 1;
  144. }
  145. pathp = argv[2];
  146. nodep = argv[3];
  147. nodeoffset = fdt_path_offset (fdt, pathp);
  148. if (nodeoffset < 0) {
  149. /*
  150. * Not found or something else bad happened.
  151. */
  152. printf ("libfdt fdt_path_offset() returned %s\n",
  153. fdt_strerror(nodeoffset));
  154. return 1;
  155. }
  156. err = fdt_add_subnode(fdt, nodeoffset, nodep);
  157. if (err < 0) {
  158. printf ("libfdt fdt_add_subnode(): %s\n",
  159. fdt_strerror(err));
  160. return 1;
  161. }
  162. /********************************************************************
  163. * Set the value of a property in the fdt.
  164. ********************************************************************/
  165. } else if (argv[1][0] == 's') {
  166. char *pathp; /* path */
  167. char *prop; /* property */
  168. int nodeoffset; /* node offset from libfdt */
  169. static char data[SCRATCHPAD]; /* storage for the property */
  170. int len; /* new length of the property */
  171. int ret; /* return value */
  172. /*
  173. * Parameters: Node path, property, optional value.
  174. */
  175. if (argc < 4) {
  176. printf ("Usage:\n%s\n", cmdtp->usage);
  177. return 1;
  178. }
  179. pathp = argv[2];
  180. prop = argv[3];
  181. if (argc == 4) {
  182. len = 0;
  183. } else {
  184. ret = fdt_parse_prop(pathp, prop, argv[4], data, &len);
  185. if (ret != 0)
  186. return ret;
  187. }
  188. nodeoffset = fdt_path_offset (fdt, pathp);
  189. if (nodeoffset < 0) {
  190. /*
  191. * Not found or something else bad happened.
  192. */
  193. printf ("libfdt fdt_path_offset() returned %s\n",
  194. fdt_strerror(nodeoffset));
  195. return 1;
  196. }
  197. ret = fdt_setprop(fdt, nodeoffset, prop, data, len);
  198. if (ret < 0) {
  199. printf ("libfdt fdt_setprop(): %s\n", fdt_strerror(ret));
  200. return 1;
  201. }
  202. /********************************************************************
  203. * Print (recursive) / List (single level)
  204. ********************************************************************/
  205. } else if ((argv[1][0] == 'p') || (argv[1][0] == 'l')) {
  206. int depth = MAX_LEVEL; /* how deep to print */
  207. char *pathp; /* path */
  208. char *prop; /* property */
  209. int ret; /* return value */
  210. static char root[2] = "/";
  211. /*
  212. * list is an alias for print, but limited to 1 level
  213. */
  214. if (argv[1][0] == 'l') {
  215. depth = 1;
  216. }
  217. /*
  218. * Get the starting path. The root node is an oddball,
  219. * the offset is zero and has no name.
  220. */
  221. if (argc == 2)
  222. pathp = root;
  223. else
  224. pathp = argv[2];
  225. if (argc > 3)
  226. prop = argv[3];
  227. else
  228. prop = NULL;
  229. ret = fdt_print(pathp, prop, depth);
  230. if (ret != 0)
  231. return ret;
  232. /********************************************************************
  233. * Remove a property/node
  234. ********************************************************************/
  235. } else if (argv[1][0] == 'r') {
  236. int nodeoffset; /* node offset from libfdt */
  237. int err;
  238. /*
  239. * Get the path. The root node is an oddball, the offset
  240. * is zero and has no name.
  241. */
  242. nodeoffset = fdt_path_offset (fdt, argv[2]);
  243. if (nodeoffset < 0) {
  244. /*
  245. * Not found or something else bad happened.
  246. */
  247. printf ("libfdt fdt_path_offset() returned %s\n",
  248. fdt_strerror(nodeoffset));
  249. return 1;
  250. }
  251. /*
  252. * Do the delete. A fourth parameter means delete a property,
  253. * otherwise delete the node.
  254. */
  255. if (argc > 3) {
  256. err = fdt_delprop(fdt, nodeoffset, argv[3]);
  257. if (err < 0) {
  258. printf("libfdt fdt_delprop(): %s\n",
  259. fdt_strerror(err));
  260. return err;
  261. }
  262. } else {
  263. err = fdt_del_node(fdt, nodeoffset);
  264. if (err < 0) {
  265. printf("libfdt fdt_del_node(): %s\n",
  266. fdt_strerror(err));
  267. return err;
  268. }
  269. }
  270. }
  271. #ifdef CONFIG_OF_BOARD_SETUP
  272. /* Call the board-specific fixup routine */
  273. else if (argv[1][0] == 'b')
  274. ft_board_setup(fdt, gd->bd);
  275. #endif
  276. /* Create a chosen node */
  277. else if (argv[1][0] == 'c')
  278. fdt_chosen(fdt, 0, 0, 1);
  279. #ifdef CONFIG_OF_HAS_UBOOT_ENV
  280. /* Create a u-boot-env node */
  281. else if (argv[1][0] == 'e')
  282. fdt_env(fdt);
  283. #endif
  284. #ifdef CONFIG_OF_HAS_BD_T
  285. /* Create a bd_t node */
  286. else if (argv[1][0] == 'b')
  287. fdt_bd_t(fdt);
  288. #endif
  289. else {
  290. /* Unrecognized command */
  291. printf ("Usage:\n%s\n", cmdtp->usage);
  292. return 1;
  293. }
  294. return 0;
  295. }
  296. /****************************************************************************/
  297. static int fdt_valid(void)
  298. {
  299. int err;
  300. if (fdt == NULL) {
  301. printf ("The address of the fdt is invalid (NULL).\n");
  302. return 0;
  303. }
  304. err = fdt_check_header(fdt);
  305. if (err == 0)
  306. return 1; /* valid */
  307. if (err < 0) {
  308. printf("libfdt fdt_check_header(): %s", fdt_strerror(err));
  309. /*
  310. * Be more informative on bad version.
  311. */
  312. if (err == -FDT_ERR_BADVERSION) {
  313. if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION) {
  314. printf (" - too old, fdt $d < %d",
  315. fdt_version(fdt),
  316. FDT_FIRST_SUPPORTED_VERSION);
  317. fdt = NULL;
  318. }
  319. if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION) {
  320. printf (" - too new, fdt $d > %d",
  321. fdt_version(fdt),
  322. FDT_LAST_SUPPORTED_VERSION);
  323. fdt = NULL;
  324. }
  325. return 0;
  326. }
  327. printf("\n");
  328. return 0;
  329. }
  330. return 1;
  331. }
  332. /****************************************************************************/
  333. /*
  334. * Parse the user's input, partially heuristic. Valid formats:
  335. * <00> - hex byte
  336. * <0011> - hex half word (16 bits)
  337. * <00112233> - hex word (32 bits)
  338. * - hex double words (64 bits) are not supported, must use
  339. * a byte stream instead.
  340. * [00 11 22 .. nn] - byte stream
  341. * "string" - If the the value doesn't start with "<" or "[", it is
  342. * treated as a string. Note that the quotes are
  343. * stripped by the parser before we get the string.
  344. */
  345. static int fdt_parse_prop(char *pathp, char *prop, char *newval,
  346. char *data, int *len)
  347. {
  348. char *cp; /* temporary char pointer */
  349. unsigned long tmp; /* holds converted values */
  350. if (*newval == '<') {
  351. /*
  352. * Bigger values than bytes.
  353. */
  354. *len = 0;
  355. newval++;
  356. while ((*newval != '>') && (*newval != '\0')) {
  357. cp = newval;
  358. tmp = simple_strtoul(cp, &newval, 16);
  359. if ((newval - cp) <= 2) {
  360. *data = tmp & 0xFF;
  361. data += 1;
  362. *len += 1;
  363. } else if ((newval - cp) <= 4) {
  364. *(uint16_t *)data = __cpu_to_be16(tmp);
  365. data += 2;
  366. *len += 2;
  367. } else if ((newval - cp) <= 8) {
  368. *(uint32_t *)data = __cpu_to_be32(tmp);
  369. data += 4;
  370. *len += 4;
  371. } else {
  372. printf("Sorry, I could not convert \"%s\"\n",
  373. cp);
  374. return 1;
  375. }
  376. while (*newval == ' ')
  377. newval++;
  378. }
  379. if (*newval != '>') {
  380. printf("Unexpected character '%c'\n", *newval);
  381. return 1;
  382. }
  383. } else if (*newval == '[') {
  384. /*
  385. * Byte stream. Convert the values.
  386. */
  387. *len = 0;
  388. newval++;
  389. while ((*newval != ']') && (*newval != '\0')) {
  390. tmp = simple_strtoul(newval, &newval, 16);
  391. *data++ = tmp & 0xFF;
  392. *len = *len + 1;
  393. while (*newval == ' ')
  394. newval++;
  395. }
  396. if (*newval != ']') {
  397. printf("Unexpected character '%c'\n", *newval);
  398. return 1;
  399. }
  400. } else {
  401. /*
  402. * Assume it is a string. Copy it into our data area for
  403. * convenience (including the terminating '\0').
  404. */
  405. *len = strlen(newval) + 1;
  406. strcpy(data, newval);
  407. }
  408. return 0;
  409. }
  410. /****************************************************************************/
  411. /*
  412. * Heuristic to guess if this is a string or concatenated strings.
  413. */
  414. static int is_printable_string(const void *data, int len)
  415. {
  416. const char *s = data;
  417. /* zero length is not */
  418. if (len == 0)
  419. return 0;
  420. /* must terminate with zero */
  421. if (s[len - 1] != '\0')
  422. return 0;
  423. /* printable or a null byte (concatenated strings) */
  424. while (((*s == '\0') || isprint(*s)) && (len > 0)) {
  425. /*
  426. * If we see a null, there are three possibilities:
  427. * 1) If len == 1, it is the end of the string, printable
  428. * 2) Next character also a null, not printable.
  429. * 3) Next character not a null, continue to check.
  430. */
  431. if (s[0] == '\0') {
  432. if (len == 1)
  433. return 1;
  434. if (s[1] == '\0')
  435. return 0;
  436. }
  437. s++;
  438. len--;
  439. }
  440. /* Not the null termination, or not done yet: not printable */
  441. if (*s != '\0' || (len != 0))
  442. return 0;
  443. return 1;
  444. }
  445. /*
  446. * Print the property in the best format, a heuristic guess. Print as
  447. * a string, concatenated strings, a byte, word, double word, or (if all
  448. * else fails) it is printed as a stream of bytes.
  449. */
  450. static void print_data(const void *data, int len)
  451. {
  452. int j;
  453. const u8 *s;
  454. /* no data, don't print */
  455. if (len == 0)
  456. return;
  457. /*
  458. * It is a string, but it may have multiple strings (embedded '\0's).
  459. */
  460. if (is_printable_string(data, len)) {
  461. puts("\"");
  462. j = 0;
  463. while (j < len) {
  464. if (j > 0)
  465. puts("\", \"");
  466. puts(data);
  467. j += strlen(data) + 1;
  468. data += strlen(data) + 1;
  469. }
  470. puts("\"");
  471. return;
  472. }
  473. switch (len) {
  474. case 1: /* byte */
  475. printf("<0x%02x>", (*(u8 *) data) & 0xff);
  476. break;
  477. case 2: /* half-word */
  478. printf("<0x%04x>", be16_to_cpu(*(u16 *) data) & 0xffff);
  479. break;
  480. case 4: /* word */
  481. printf("<0x%08x>", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
  482. break;
  483. case 8: /* double-word */
  484. #if __WORDSIZE == 64
  485. printf("<0x%016llx>", be64_to_cpu(*(uint64_t *) data));
  486. #else
  487. printf("<0x%08x ", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
  488. data += 4;
  489. printf("0x%08x>", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
  490. #endif
  491. break;
  492. default: /* anything else... hexdump */
  493. printf("[");
  494. for (j = 0, s = data; j < len; j++)
  495. printf("%02x%s", s[j], j < len - 1 ? " " : "");
  496. printf("]");
  497. break;
  498. }
  499. }
  500. /****************************************************************************/
  501. /*
  502. * Recursively print (a portion of) the fdt. The depth parameter
  503. * determines how deeply nested the fdt is printed.
  504. */
  505. static int fdt_print(const char *pathp, char *prop, int depth)
  506. {
  507. static char tabs[MAX_LEVEL+1] =
  508. "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t"
  509. "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t";
  510. const void *nodep; /* property node pointer */
  511. int nodeoffset; /* node offset from libfdt */
  512. int nextoffset; /* next node offset from libfdt */
  513. uint32_t tag; /* tag */
  514. int len; /* length of the property */
  515. int level = 0; /* keep track of nesting level */
  516. const struct fdt_property *fdt_prop;
  517. nodeoffset = fdt_path_offset (fdt, pathp);
  518. if (nodeoffset < 0) {
  519. /*
  520. * Not found or something else bad happened.
  521. */
  522. printf ("libfdt fdt_path_offset() returned %s\n",
  523. fdt_strerror(nodeoffset));
  524. return 1;
  525. }
  526. /*
  527. * The user passed in a property as well as node path.
  528. * Print only the given property and then return.
  529. */
  530. if (prop) {
  531. nodep = fdt_getprop (fdt, nodeoffset, prop, &len);
  532. if (len == 0) {
  533. /* no property value */
  534. printf("%s %s\n", pathp, prop);
  535. return 0;
  536. } else if (len > 0) {
  537. printf("%s = ", prop);
  538. print_data (nodep, len);
  539. printf("\n");
  540. return 0;
  541. } else {
  542. printf ("libfdt fdt_getprop(): %s\n",
  543. fdt_strerror(len));
  544. return 1;
  545. }
  546. }
  547. /*
  548. * The user passed in a node path and no property,
  549. * print the node and all subnodes.
  550. */
  551. while(level >= 0) {
  552. tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);
  553. switch(tag) {
  554. case FDT_BEGIN_NODE:
  555. pathp = fdt_get_name(fdt, nodeoffset, NULL);
  556. if (level <= depth) {
  557. if (pathp == NULL)
  558. pathp = "/* NULL pointer error */";
  559. if (*pathp == '\0')
  560. pathp = "/"; /* root is nameless */
  561. printf("%s%s {\n",
  562. &tabs[MAX_LEVEL - level], pathp);
  563. }
  564. level++;
  565. if (level >= MAX_LEVEL) {
  566. printf("Nested too deep, aborting.\n");
  567. return 1;
  568. }
  569. break;
  570. case FDT_END_NODE:
  571. level--;
  572. if (level <= depth)
  573. printf("%s};\n", &tabs[MAX_LEVEL - level]);
  574. if (level == 0) {
  575. level = -1; /* exit the loop */
  576. }
  577. break;
  578. case FDT_PROP:
  579. fdt_prop = fdt_offset_ptr(fdt, nodeoffset,
  580. sizeof(*fdt_prop));
  581. pathp = fdt_string(fdt,
  582. fdt32_to_cpu(fdt_prop->nameoff));
  583. len = fdt32_to_cpu(fdt_prop->len);
  584. nodep = fdt_prop->data;
  585. if (len < 0) {
  586. printf ("libfdt fdt_getprop(): %s\n",
  587. fdt_strerror(len));
  588. return 1;
  589. } else if (len == 0) {
  590. /* the property has no value */
  591. if (level <= depth)
  592. printf("%s%s;\n",
  593. &tabs[MAX_LEVEL - level],
  594. pathp);
  595. } else {
  596. if (level <= depth) {
  597. printf("%s%s = ",
  598. &tabs[MAX_LEVEL - level],
  599. pathp);
  600. print_data (nodep, len);
  601. printf(";\n");
  602. }
  603. }
  604. break;
  605. case FDT_NOP:
  606. printf("/* NOP */\n", &tabs[MAX_LEVEL - level]);
  607. break;
  608. case FDT_END:
  609. return 1;
  610. default:
  611. if (level <= depth)
  612. printf("Unknown tag 0x%08X\n", tag);
  613. return 1;
  614. }
  615. nodeoffset = nextoffset;
  616. }
  617. return 0;
  618. }
  619. /********************************************************************/
  620. U_BOOT_CMD(
  621. fdt, 5, 0, do_fdt,
  622. "fdt - flattened device tree utility commands\n",
  623. "addr <addr> [<length>] - Set the fdt location to <addr>\n"
  624. #ifdef CONFIG_OF_BOARD_SETUP
  625. "fdt boardsetup - Do board-specific set up\n"
  626. #endif
  627. "fdt move <fdt> <newaddr> <length> - Copy the fdt to <addr> and make it active\n"
  628. "fdt print <path> [<prop>] - Recursive print starting at <path>\n"
  629. "fdt list <path> [<prop>] - Print one level starting at <path>\n"
  630. "fdt set <path> <prop> [<val>] - Set <property> [to <val>]\n"
  631. "fdt mknode <path> <node> - Create a new node after <path>\n"
  632. "fdt rm <path> [<prop>] - Delete the node or <property>\n"
  633. "fdt chosen - Add/update the /chosen branch in the tree\n"
  634. #ifdef CONFIG_OF_HAS_UBOOT_ENV
  635. "fdt env - Add/replace the /u-boot-env branch in the tree\n"
  636. #endif
  637. #ifdef CONFIG_OF_HAS_BD_T
  638. "fdt bd_t - Add/replace the /bd_t branch in the tree\n"
  639. #endif
  640. "NOTE: If the path or property you are setting/printing has a '#' character\n"
  641. " or spaces, you MUST escape it with a \\ character or quote it with \".\n"
  642. );