cmd_fdt.c 17 KB

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