cmd_fdt.c 17 KB

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