cmd_fdt.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812
  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') && (argv[1][1] == 'm')) {
  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. * Display header info
  272. ********************************************************************/
  273. } else if (argv[1][0] == 'h') {
  274. u32 version = fdt_version(fdt);
  275. printf("magic:\t\t\t0x%x\n", fdt_magic(fdt));
  276. printf("totalsize:\t\t0x%x (%d)\n", fdt_totalsize(fdt), fdt_totalsize(fdt));
  277. printf("off_dt_struct:\t\t0x%x\n", fdt_off_dt_struct(fdt));
  278. printf("off_dt_strings:\t\t0x%x\n", fdt_off_dt_strings(fdt));
  279. printf("off_mem_rsvmap:\t\t0x%x\n", fdt_off_mem_rsvmap(fdt));
  280. printf("version:\t\t%d\n", version);
  281. printf("last_comp_version:\t%d\n", fdt_last_comp_version(fdt));
  282. if (version >= 2)
  283. printf("boot_cpuid_phys:\t0x%x\n",
  284. fdt_boot_cpuid_phys(fdt));
  285. if (version >= 3)
  286. printf("size_dt_strings:\t0x%x\n",
  287. fdt_size_dt_strings(fdt));
  288. if (version >= 17)
  289. printf("size_dt_struct:\t\t0x%x\n",
  290. fdt_size_dt_struct(fdt));
  291. printf("number mem_rsv:\t\t0x%x\n", fdt_num_mem_rsv(fdt));
  292. printf("\n");
  293. /********************************************************************
  294. * Set boot cpu id
  295. ********************************************************************/
  296. } else if ((argv[1][0] == 'b') && (argv[1][1] == 'o') &&
  297. (argv[1][2] == 'o')) {
  298. unsigned long tmp = simple_strtoul(argv[2], NULL, 16);
  299. fdt_set_boot_cpuid_phys(fdt, tmp);
  300. /********************************************************************
  301. * memory command
  302. ********************************************************************/
  303. } else if ((argv[1][0] == 'm') && (argv[1][1] == 'e')) {
  304. uint64_t addr, size;
  305. int err;
  306. #ifdef CFG_64BIT_STRTOUL
  307. addr = simple_strtoull(argv[2], NULL, 16);
  308. size = simple_strtoull(argv[3], NULL, 16);
  309. #else
  310. addr = simple_strtoul(argv[2], NULL, 16);
  311. size = simple_strtoul(argv[3], NULL, 16);
  312. #endif
  313. err = fdt_fixup_memory(fdt, addr, size);
  314. if (err < 0)
  315. return err;
  316. /********************************************************************
  317. * mem reserve commands
  318. ********************************************************************/
  319. } else if ((argv[1][0] == 'r') && (argv[1][1] == 's')) {
  320. if (argv[2][0] == 'p') {
  321. uint64_t addr, size;
  322. int total = fdt_num_mem_rsv(fdt);
  323. int j, err;
  324. printf("index\t\t start\t\t size\n");
  325. printf("-------------------------------"
  326. "-----------------\n");
  327. for (j = 0; j < total; j++) {
  328. err = fdt_get_mem_rsv(fdt, j, &addr, &size);
  329. if (err < 0) {
  330. printf("libfdt fdt_get_mem_rsv(): %s\n",
  331. fdt_strerror(err));
  332. return err;
  333. }
  334. printf(" %x\t%08x%08x\t%08x%08x\n", j,
  335. (u32)(addr >> 32),
  336. (u32)(addr & 0xffffffff),
  337. (u32)(size >> 32),
  338. (u32)(size & 0xffffffff));
  339. }
  340. } else if (argv[2][0] == 'a') {
  341. uint64_t addr, size;
  342. int err;
  343. #ifdef CFG_64BIT_STRTOUL
  344. addr = simple_strtoull(argv[3], NULL, 16);
  345. size = simple_strtoull(argv[4], NULL, 16);
  346. #else
  347. addr = simple_strtoul(argv[3], NULL, 16);
  348. size = simple_strtoul(argv[4], NULL, 16);
  349. #endif
  350. err = fdt_add_mem_rsv(fdt, addr, size);
  351. if (err < 0) {
  352. printf("libfdt fdt_add_mem_rsv(): %s\n",
  353. fdt_strerror(err));
  354. return err;
  355. }
  356. } else if (argv[2][0] == 'd') {
  357. unsigned long idx = simple_strtoul(argv[3], NULL, 16);
  358. int err = fdt_del_mem_rsv(fdt, idx);
  359. if (err < 0) {
  360. printf("libfdt fdt_del_mem_rsv(): %s\n",
  361. fdt_strerror(err));
  362. return err;
  363. }
  364. } else {
  365. /* Unrecognized command */
  366. printf ("Usage:\n%s\n", cmdtp->usage);
  367. return 1;
  368. }
  369. }
  370. #ifdef CONFIG_OF_BOARD_SETUP
  371. /* Call the board-specific fixup routine */
  372. else if (argv[1][0] == 'b')
  373. ft_board_setup(fdt, gd->bd);
  374. #endif
  375. /* Create a chosen node */
  376. else if (argv[1][0] == 'c')
  377. fdt_chosen(fdt, 0, 0, 1);
  378. #ifdef CONFIG_OF_HAS_UBOOT_ENV
  379. /* Create a u-boot-env node */
  380. else if (argv[1][0] == 'e')
  381. fdt_env(fdt);
  382. #endif
  383. #ifdef CONFIG_OF_HAS_BD_T
  384. /* Create a bd_t node */
  385. else if (argv[1][0] == 'b')
  386. fdt_bd_t(fdt);
  387. #endif
  388. else {
  389. /* Unrecognized command */
  390. printf ("Usage:\n%s\n", cmdtp->usage);
  391. return 1;
  392. }
  393. return 0;
  394. }
  395. /****************************************************************************/
  396. static int fdt_valid(void)
  397. {
  398. int err;
  399. if (fdt == NULL) {
  400. printf ("The address of the fdt is invalid (NULL).\n");
  401. return 0;
  402. }
  403. err = fdt_check_header(fdt);
  404. if (err == 0)
  405. return 1; /* valid */
  406. if (err < 0) {
  407. printf("libfdt fdt_check_header(): %s", fdt_strerror(err));
  408. /*
  409. * Be more informative on bad version.
  410. */
  411. if (err == -FDT_ERR_BADVERSION) {
  412. if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION) {
  413. printf (" - too old, fdt $d < %d",
  414. fdt_version(fdt),
  415. FDT_FIRST_SUPPORTED_VERSION);
  416. fdt = NULL;
  417. }
  418. if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION) {
  419. printf (" - too new, fdt $d > %d",
  420. fdt_version(fdt),
  421. FDT_LAST_SUPPORTED_VERSION);
  422. fdt = NULL;
  423. }
  424. return 0;
  425. }
  426. printf("\n");
  427. return 0;
  428. }
  429. return 1;
  430. }
  431. /****************************************************************************/
  432. /*
  433. * Parse the user's input, partially heuristic. Valid formats:
  434. * <00> - hex byte
  435. * <0011> - hex half word (16 bits)
  436. * <00112233> - hex word (32 bits)
  437. * - hex double words (64 bits) are not supported, must use
  438. * a byte stream instead.
  439. * [00 11 22 .. nn] - byte stream
  440. * "string" - If the the value doesn't start with "<" or "[", it is
  441. * treated as a string. Note that the quotes are
  442. * stripped by the parser before we get the string.
  443. */
  444. static int fdt_parse_prop(char *pathp, char *prop, char *newval,
  445. char *data, int *len)
  446. {
  447. char *cp; /* temporary char pointer */
  448. unsigned long tmp; /* holds converted values */
  449. if (*newval == '<') {
  450. /*
  451. * Bigger values than bytes.
  452. */
  453. *len = 0;
  454. newval++;
  455. while ((*newval != '>') && (*newval != '\0')) {
  456. cp = newval;
  457. tmp = simple_strtoul(cp, &newval, 16);
  458. if ((newval - cp) <= 2) {
  459. *data = tmp & 0xFF;
  460. data += 1;
  461. *len += 1;
  462. } else if ((newval - cp) <= 4) {
  463. *(uint16_t *)data = __cpu_to_be16(tmp);
  464. data += 2;
  465. *len += 2;
  466. } else if ((newval - cp) <= 8) {
  467. *(uint32_t *)data = __cpu_to_be32(tmp);
  468. data += 4;
  469. *len += 4;
  470. } else {
  471. printf("Sorry, I could not convert \"%s\"\n",
  472. cp);
  473. return 1;
  474. }
  475. while (*newval == ' ')
  476. newval++;
  477. }
  478. if (*newval != '>') {
  479. printf("Unexpected character '%c'\n", *newval);
  480. return 1;
  481. }
  482. } else if (*newval == '[') {
  483. /*
  484. * Byte stream. Convert the values.
  485. */
  486. *len = 0;
  487. newval++;
  488. while ((*newval != ']') && (*newval != '\0')) {
  489. tmp = simple_strtoul(newval, &newval, 16);
  490. *data++ = tmp & 0xFF;
  491. *len = *len + 1;
  492. while (*newval == ' ')
  493. newval++;
  494. }
  495. if (*newval != ']') {
  496. printf("Unexpected character '%c'\n", *newval);
  497. return 1;
  498. }
  499. } else {
  500. /*
  501. * Assume it is a string. Copy it into our data area for
  502. * convenience (including the terminating '\0').
  503. */
  504. *len = strlen(newval) + 1;
  505. strcpy(data, newval);
  506. }
  507. return 0;
  508. }
  509. /****************************************************************************/
  510. /*
  511. * Heuristic to guess if this is a string or concatenated strings.
  512. */
  513. static int is_printable_string(const void *data, int len)
  514. {
  515. const char *s = data;
  516. /* zero length is not */
  517. if (len == 0)
  518. return 0;
  519. /* must terminate with zero */
  520. if (s[len - 1] != '\0')
  521. return 0;
  522. /* printable or a null byte (concatenated strings) */
  523. while (((*s == '\0') || isprint(*s)) && (len > 0)) {
  524. /*
  525. * If we see a null, there are three possibilities:
  526. * 1) If len == 1, it is the end of the string, printable
  527. * 2) Next character also a null, not printable.
  528. * 3) Next character not a null, continue to check.
  529. */
  530. if (s[0] == '\0') {
  531. if (len == 1)
  532. return 1;
  533. if (s[1] == '\0')
  534. return 0;
  535. }
  536. s++;
  537. len--;
  538. }
  539. /* Not the null termination, or not done yet: not printable */
  540. if (*s != '\0' || (len != 0))
  541. return 0;
  542. return 1;
  543. }
  544. /*
  545. * Print the property in the best format, a heuristic guess. Print as
  546. * a string, concatenated strings, a byte, word, double word, or (if all
  547. * else fails) it is printed as a stream of bytes.
  548. */
  549. static void print_data(const void *data, int len)
  550. {
  551. int j;
  552. const u8 *s;
  553. /* no data, don't print */
  554. if (len == 0)
  555. return;
  556. /*
  557. * It is a string, but it may have multiple strings (embedded '\0's).
  558. */
  559. if (is_printable_string(data, len)) {
  560. puts("\"");
  561. j = 0;
  562. while (j < len) {
  563. if (j > 0)
  564. puts("\", \"");
  565. puts(data);
  566. j += strlen(data) + 1;
  567. data += strlen(data) + 1;
  568. }
  569. puts("\"");
  570. return;
  571. }
  572. switch (len) {
  573. case 1: /* byte */
  574. printf("<0x%02x>", (*(u8 *) data) & 0xff);
  575. break;
  576. case 2: /* half-word */
  577. printf("<0x%04x>", be16_to_cpu(*(u16 *) data) & 0xffff);
  578. break;
  579. case 4: /* word */
  580. printf("<0x%08x>", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
  581. break;
  582. case 8: /* double-word */
  583. #if __WORDSIZE == 64
  584. printf("<0x%016llx>", be64_to_cpu(*(uint64_t *) data));
  585. #else
  586. printf("<0x%08x ", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
  587. data += 4;
  588. printf("0x%08x>", be32_to_cpu(*(u32 *) data) & 0xffffffffU);
  589. #endif
  590. break;
  591. default: /* anything else... hexdump */
  592. printf("[");
  593. for (j = 0, s = data; j < len; j++)
  594. printf("%02x%s", s[j], j < len - 1 ? " " : "");
  595. printf("]");
  596. break;
  597. }
  598. }
  599. /****************************************************************************/
  600. /*
  601. * Recursively print (a portion of) the fdt. The depth parameter
  602. * determines how deeply nested the fdt is printed.
  603. */
  604. static int fdt_print(const char *pathp, char *prop, int depth)
  605. {
  606. static char tabs[MAX_LEVEL+1] =
  607. "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t"
  608. "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t";
  609. const void *nodep; /* property node pointer */
  610. int nodeoffset; /* node offset from libfdt */
  611. int nextoffset; /* next node offset from libfdt */
  612. uint32_t tag; /* tag */
  613. int len; /* length of the property */
  614. int level = 0; /* keep track of nesting level */
  615. const struct fdt_property *fdt_prop;
  616. nodeoffset = fdt_path_offset (fdt, pathp);
  617. if (nodeoffset < 0) {
  618. /*
  619. * Not found or something else bad happened.
  620. */
  621. printf ("libfdt fdt_path_offset() returned %s\n",
  622. fdt_strerror(nodeoffset));
  623. return 1;
  624. }
  625. /*
  626. * The user passed in a property as well as node path.
  627. * Print only the given property and then return.
  628. */
  629. if (prop) {
  630. nodep = fdt_getprop (fdt, nodeoffset, prop, &len);
  631. if (len == 0) {
  632. /* no property value */
  633. printf("%s %s\n", pathp, prop);
  634. return 0;
  635. } else if (len > 0) {
  636. printf("%s = ", prop);
  637. print_data (nodep, len);
  638. printf("\n");
  639. return 0;
  640. } else {
  641. printf ("libfdt fdt_getprop(): %s\n",
  642. fdt_strerror(len));
  643. return 1;
  644. }
  645. }
  646. /*
  647. * The user passed in a node path and no property,
  648. * print the node and all subnodes.
  649. */
  650. while(level >= 0) {
  651. tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);
  652. switch(tag) {
  653. case FDT_BEGIN_NODE:
  654. pathp = fdt_get_name(fdt, nodeoffset, NULL);
  655. if (level <= depth) {
  656. if (pathp == NULL)
  657. pathp = "/* NULL pointer error */";
  658. if (*pathp == '\0')
  659. pathp = "/"; /* root is nameless */
  660. printf("%s%s {\n",
  661. &tabs[MAX_LEVEL - level], pathp);
  662. }
  663. level++;
  664. if (level >= MAX_LEVEL) {
  665. printf("Nested too deep, aborting.\n");
  666. return 1;
  667. }
  668. break;
  669. case FDT_END_NODE:
  670. level--;
  671. if (level <= depth)
  672. printf("%s};\n", &tabs[MAX_LEVEL - level]);
  673. if (level == 0) {
  674. level = -1; /* exit the loop */
  675. }
  676. break;
  677. case FDT_PROP:
  678. fdt_prop = fdt_offset_ptr(fdt, nodeoffset,
  679. sizeof(*fdt_prop));
  680. pathp = fdt_string(fdt,
  681. fdt32_to_cpu(fdt_prop->nameoff));
  682. len = fdt32_to_cpu(fdt_prop->len);
  683. nodep = fdt_prop->data;
  684. if (len < 0) {
  685. printf ("libfdt fdt_getprop(): %s\n",
  686. fdt_strerror(len));
  687. return 1;
  688. } else if (len == 0) {
  689. /* the property has no value */
  690. if (level <= depth)
  691. printf("%s%s;\n",
  692. &tabs[MAX_LEVEL - level],
  693. pathp);
  694. } else {
  695. if (level <= depth) {
  696. printf("%s%s = ",
  697. &tabs[MAX_LEVEL - level],
  698. pathp);
  699. print_data (nodep, len);
  700. printf(";\n");
  701. }
  702. }
  703. break;
  704. case FDT_NOP:
  705. printf("/* NOP */\n", &tabs[MAX_LEVEL - level]);
  706. break;
  707. case FDT_END:
  708. return 1;
  709. default:
  710. if (level <= depth)
  711. printf("Unknown tag 0x%08X\n", tag);
  712. return 1;
  713. }
  714. nodeoffset = nextoffset;
  715. }
  716. return 0;
  717. }
  718. /********************************************************************/
  719. U_BOOT_CMD(
  720. fdt, 5, 0, do_fdt,
  721. "fdt - flattened device tree utility commands\n",
  722. "addr <addr> [<length>] - Set the fdt location to <addr>\n"
  723. #ifdef CONFIG_OF_BOARD_SETUP
  724. "fdt boardsetup - Do board-specific set up\n"
  725. #endif
  726. "fdt move <fdt> <newaddr> <length> - Copy the fdt to <addr> and make it active\n"
  727. "fdt print <path> [<prop>] - Recursive print starting at <path>\n"
  728. "fdt list <path> [<prop>] - Print one level starting at <path>\n"
  729. "fdt set <path> <prop> [<val>] - Set <property> [to <val>]\n"
  730. "fdt mknode <path> <node> - Create a new node after <path>\n"
  731. "fdt rm <path> [<prop>] - Delete the node or <property>\n"
  732. "fdt header - Display header info\n"
  733. "fdt bootcpu <id> - Set boot cpuid\n"
  734. "fdt memory <addr> <size> - Add/Update memory node\n"
  735. "fdt rsvmem print - Show current mem reserves\n"
  736. "fdt rsvmem add <addr> <size> - Add a mem reserve\n"
  737. "fdt rsvmem delete <index> - Delete a mem reserves\n"
  738. "fdt chosen - Add/update the /chosen branch in the tree\n"
  739. #ifdef CONFIG_OF_HAS_UBOOT_ENV
  740. "fdt env - Add/replace the /u-boot-env branch in the tree\n"
  741. #endif
  742. #ifdef CONFIG_OF_HAS_BD_T
  743. "fdt bd_t - Add/replace the /bd_t branch in the tree\n"
  744. #endif
  745. "NOTE: If the path or property you are setting/printing has a '#' character\n"
  746. " or spaces, you MUST escape it with a \\ character or quote it with \".\n"
  747. );