cmd_fdt.c 17 KB

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