]>
Commit | Line | Data |
---|---|---|
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 | ||
27 | #include <common.h> | |
28 | #include <command.h> | |
29 | #include <linux/ctype.h> | |
30 | #include <linux/types.h> | |
31 | #include <asm/global_data.h> | |
32 | #include <fdt.h> | |
33 | #include <libfdt.h> | |
34 | #include <fdt_support.h> | |
35 | ||
36 | #define MAX_LEVEL 32 /* how deeply nested we will go */ | |
37 | #define SCRATCHPAD 1024 /* bytes of scratchpad memory */ | |
38 | ||
39 | /* | |
40 | * Global data (for the gd->bd) | |
41 | */ | |
42 | DECLARE_GLOBAL_DATA_PTR; | |
43 | ||
44 | static int fdt_valid(void); | |
45 | static int fdt_parse_prop(char *const*newval, int count, char *data, int *len); | |
46 | static int fdt_print(const char *pathp, char *prop, int depth); | |
47 | ||
48 | /* | |
49 | * The working_fdt points to our working flattened device tree. | |
50 | */ | |
51 | struct fdt_header *working_fdt; | |
52 | ||
53 | void set_working_fdt_addr(void *addr) | |
54 | { | |
55 | char buf[17]; | |
56 | ||
57 | working_fdt = addr; | |
58 | ||
59 | sprintf(buf, "%lx", (unsigned long)addr); | |
60 | setenv("fdtaddr", buf); | |
61 | } | |
62 | ||
63 | /* | |
64 | * Flattened Device Tree command, see the help for parameter definitions. | |
65 | */ | |
66 | int do_fdt (cmd_tbl_t * cmdtp, int flag, int argc, char * const argv[]) | |
67 | { | |
68 | if (argc < 2) { | |
69 | cmd_usage(cmdtp); | |
70 | return 1; | |
71 | } | |
72 | ||
73 | /******************************************************************** | |
74 | * Set the address of the fdt | |
75 | ********************************************************************/ | |
76 | if (argv[1][0] == 'a') { | |
77 | unsigned long addr; | |
78 | /* | |
79 | * Set the address [and length] of the fdt. | |
80 | */ | |
81 | if (argc == 2) { | |
82 | if (!fdt_valid()) { | |
83 | return 1; | |
84 | } | |
85 | printf("The address of the fdt is %p\n", working_fdt); | |
86 | return 0; | |
87 | } | |
88 | ||
89 | addr = simple_strtoul(argv[2], NULL, 16); | |
90 | set_working_fdt_addr((void *)addr); | |
91 | ||
92 | if (!fdt_valid()) { | |
93 | return 1; | |
94 | } | |
95 | ||
96 | if (argc >= 4) { | |
97 | int len; | |
98 | int err; | |
99 | /* | |
100 | * Optional new length | |
101 | */ | |
102 | len = simple_strtoul(argv[3], NULL, 16); | |
103 | if (len < fdt_totalsize(working_fdt)) { | |
104 | printf ("New length %d < existing length %d, " | |
105 | "ignoring.\n", | |
106 | len, fdt_totalsize(working_fdt)); | |
107 | } else { | |
108 | /* | |
109 | * Open in place with a new length. | |
110 | */ | |
111 | err = fdt_open_into(working_fdt, working_fdt, len); | |
112 | if (err != 0) { | |
113 | printf ("libfdt fdt_open_into(): %s\n", | |
114 | fdt_strerror(err)); | |
115 | } | |
116 | } | |
117 | } | |
118 | ||
119 | /******************************************************************** | |
120 | * Move the working_fdt | |
121 | ********************************************************************/ | |
122 | } else if (strncmp(argv[1], "mo", 2) == 0) { | |
123 | struct fdt_header *newaddr; | |
124 | int len; | |
125 | int err; | |
126 | ||
127 | if (argc < 4) { | |
128 | cmd_usage(cmdtp); | |
129 | return 1; | |
130 | } | |
131 | ||
132 | /* | |
133 | * Set the address and length of the fdt. | |
134 | */ | |
135 | working_fdt = (struct fdt_header *)simple_strtoul(argv[2], NULL, 16); | |
136 | if (!fdt_valid()) { | |
137 | return 1; | |
138 | } | |
139 | ||
140 | newaddr = (struct fdt_header *)simple_strtoul(argv[3],NULL,16); | |
141 | ||
142 | /* | |
143 | * If the user specifies a length, use that. Otherwise use the | |
144 | * current length. | |
145 | */ | |
146 | if (argc <= 4) { | |
147 | len = fdt_totalsize(working_fdt); | |
148 | } else { | |
149 | len = simple_strtoul(argv[4], NULL, 16); | |
150 | if (len < fdt_totalsize(working_fdt)) { | |
151 | printf ("New length 0x%X < existing length " | |
152 | "0x%X, aborting.\n", | |
153 | len, fdt_totalsize(working_fdt)); | |
154 | return 1; | |
155 | } | |
156 | } | |
157 | ||
158 | /* | |
159 | * Copy to the new location. | |
160 | */ | |
161 | err = fdt_open_into(working_fdt, newaddr, len); | |
162 | if (err != 0) { | |
163 | printf ("libfdt fdt_open_into(): %s\n", | |
164 | fdt_strerror(err)); | |
165 | return 1; | |
166 | } | |
167 | working_fdt = newaddr; | |
168 | ||
169 | /******************************************************************** | |
170 | * Make a new node | |
171 | ********************************************************************/ | |
172 | } else if (strncmp(argv[1], "mk", 2) == 0) { | |
173 | char *pathp; /* path */ | |
174 | char *nodep; /* new node to add */ | |
175 | int nodeoffset; /* node offset from libfdt */ | |
176 | int err; | |
177 | ||
178 | /* | |
179 | * Parameters: Node path, new node to be appended to the path. | |
180 | */ | |
181 | if (argc < 4) { | |
182 | cmd_usage(cmdtp); | |
183 | return 1; | |
184 | } | |
185 | ||
186 | pathp = argv[2]; | |
187 | nodep = argv[3]; | |
188 | ||
189 | nodeoffset = fdt_path_offset (working_fdt, pathp); | |
190 | if (nodeoffset < 0) { | |
191 | /* | |
192 | * Not found or something else bad happened. | |
193 | */ | |
194 | printf ("libfdt fdt_path_offset() returned %s\n", | |
195 | fdt_strerror(nodeoffset)); | |
196 | return 1; | |
197 | } | |
198 | err = fdt_add_subnode(working_fdt, nodeoffset, nodep); | |
199 | if (err < 0) { | |
200 | printf ("libfdt fdt_add_subnode(): %s\n", | |
201 | fdt_strerror(err)); | |
202 | return 1; | |
203 | } | |
204 | ||
205 | /******************************************************************** | |
206 | * Set the value of a property in the working_fdt. | |
207 | ********************************************************************/ | |
208 | } else if (argv[1][0] == 's') { | |
209 | char *pathp; /* path */ | |
210 | char *prop; /* property */ | |
211 | int nodeoffset; /* node offset from libfdt */ | |
212 | static char data[SCRATCHPAD]; /* storage for the property */ | |
213 | int len; /* new length of the property */ | |
214 | int ret; /* return value */ | |
215 | ||
216 | /* | |
217 | * Parameters: Node path, property, optional value. | |
218 | */ | |
219 | if (argc < 4) { | |
220 | cmd_usage(cmdtp); | |
221 | return 1; | |
222 | } | |
223 | ||
224 | pathp = argv[2]; | |
225 | prop = argv[3]; | |
226 | if (argc == 4) { | |
227 | len = 0; | |
228 | } else { | |
229 | ret = fdt_parse_prop(&argv[4], argc - 4, data, &len); | |
230 | if (ret != 0) | |
231 | return ret; | |
232 | } | |
233 | ||
234 | nodeoffset = fdt_path_offset (working_fdt, pathp); | |
235 | if (nodeoffset < 0) { | |
236 | /* | |
237 | * Not found or something else bad happened. | |
238 | */ | |
239 | printf ("libfdt fdt_path_offset() returned %s\n", | |
240 | fdt_strerror(nodeoffset)); | |
241 | return 1; | |
242 | } | |
243 | ||
244 | ret = fdt_setprop(working_fdt, nodeoffset, prop, data, len); | |
245 | if (ret < 0) { | |
246 | printf ("libfdt fdt_setprop(): %s\n", fdt_strerror(ret)); | |
247 | return 1; | |
248 | } | |
249 | ||
250 | /******************************************************************** | |
251 | * Print (recursive) / List (single level) | |
252 | ********************************************************************/ | |
253 | } else if ((argv[1][0] == 'p') || (argv[1][0] == 'l')) { | |
254 | int depth = MAX_LEVEL; /* how deep to print */ | |
255 | char *pathp; /* path */ | |
256 | char *prop; /* property */ | |
257 | int ret; /* return value */ | |
258 | static char root[2] = "/"; | |
259 | ||
260 | /* | |
261 | * list is an alias for print, but limited to 1 level | |
262 | */ | |
263 | if (argv[1][0] == 'l') { | |
264 | depth = 1; | |
265 | } | |
266 | ||
267 | /* | |
268 | * Get the starting path. The root node is an oddball, | |
269 | * the offset is zero and has no name. | |
270 | */ | |
271 | if (argc == 2) | |
272 | pathp = root; | |
273 | else | |
274 | pathp = argv[2]; | |
275 | if (argc > 3) | |
276 | prop = argv[3]; | |
277 | else | |
278 | prop = NULL; | |
279 | ||
280 | ret = fdt_print(pathp, prop, depth); | |
281 | if (ret != 0) | |
282 | return ret; | |
283 | ||
284 | /******************************************************************** | |
285 | * Remove a property/node | |
286 | ********************************************************************/ | |
287 | } else if (strncmp(argv[1], "rm", 2) == 0) { | |
288 | int nodeoffset; /* node offset from libfdt */ | |
289 | int err; | |
290 | ||
291 | /* | |
292 | * Get the path. The root node is an oddball, the offset | |
293 | * is zero and has no name. | |
294 | */ | |
295 | nodeoffset = fdt_path_offset (working_fdt, argv[2]); | |
296 | if (nodeoffset < 0) { | |
297 | /* | |
298 | * Not found or something else bad happened. | |
299 | */ | |
300 | printf ("libfdt fdt_path_offset() returned %s\n", | |
301 | fdt_strerror(nodeoffset)); | |
302 | return 1; | |
303 | } | |
304 | /* | |
305 | * Do the delete. A fourth parameter means delete a property, | |
306 | * otherwise delete the node. | |
307 | */ | |
308 | if (argc > 3) { | |
309 | err = fdt_delprop(working_fdt, nodeoffset, argv[3]); | |
310 | if (err < 0) { | |
311 | printf("libfdt fdt_delprop(): %s\n", | |
312 | fdt_strerror(err)); | |
313 | return err; | |
314 | } | |
315 | } else { | |
316 | err = fdt_del_node(working_fdt, nodeoffset); | |
317 | if (err < 0) { | |
318 | printf("libfdt fdt_del_node(): %s\n", | |
319 | fdt_strerror(err)); | |
320 | return err; | |
321 | } | |
322 | } | |
323 | ||
324 | /******************************************************************** | |
325 | * Display header info | |
326 | ********************************************************************/ | |
327 | } else if (argv[1][0] == 'h') { | |
328 | u32 version = fdt_version(working_fdt); | |
329 | printf("magic:\t\t\t0x%x\n", fdt_magic(working_fdt)); | |
330 | printf("totalsize:\t\t0x%x (%d)\n", fdt_totalsize(working_fdt), | |
331 | fdt_totalsize(working_fdt)); | |
332 | printf("off_dt_struct:\t\t0x%x\n", | |
333 | fdt_off_dt_struct(working_fdt)); | |
334 | printf("off_dt_strings:\t\t0x%x\n", | |
335 | fdt_off_dt_strings(working_fdt)); | |
336 | printf("off_mem_rsvmap:\t\t0x%x\n", | |
337 | fdt_off_mem_rsvmap(working_fdt)); | |
338 | printf("version:\t\t%d\n", version); | |
339 | printf("last_comp_version:\t%d\n", | |
340 | fdt_last_comp_version(working_fdt)); | |
341 | if (version >= 2) | |
342 | printf("boot_cpuid_phys:\t0x%x\n", | |
343 | fdt_boot_cpuid_phys(working_fdt)); | |
344 | if (version >= 3) | |
345 | printf("size_dt_strings:\t0x%x\n", | |
346 | fdt_size_dt_strings(working_fdt)); | |
347 | if (version >= 17) | |
348 | printf("size_dt_struct:\t\t0x%x\n", | |
349 | fdt_size_dt_struct(working_fdt)); | |
350 | printf("number mem_rsv:\t\t0x%x\n", | |
351 | fdt_num_mem_rsv(working_fdt)); | |
352 | printf("\n"); | |
353 | ||
354 | /******************************************************************** | |
355 | * Set boot cpu id | |
356 | ********************************************************************/ | |
357 | } else if (strncmp(argv[1], "boo", 3) == 0) { | |
358 | unsigned long tmp = simple_strtoul(argv[2], NULL, 16); | |
359 | fdt_set_boot_cpuid_phys(working_fdt, tmp); | |
360 | ||
361 | /******************************************************************** | |
362 | * memory command | |
363 | ********************************************************************/ | |
364 | } else if (strncmp(argv[1], "me", 2) == 0) { | |
365 | uint64_t addr, size; | |
366 | int err; | |
367 | addr = simple_strtoull(argv[2], NULL, 16); | |
368 | size = simple_strtoull(argv[3], NULL, 16); | |
369 | err = fdt_fixup_memory(working_fdt, addr, size); | |
370 | if (err < 0) | |
371 | return err; | |
372 | ||
373 | /******************************************************************** | |
374 | * mem reserve commands | |
375 | ********************************************************************/ | |
376 | } else if (strncmp(argv[1], "rs", 2) == 0) { | |
377 | if (argv[2][0] == 'p') { | |
378 | uint64_t addr, size; | |
379 | int total = fdt_num_mem_rsv(working_fdt); | |
380 | int j, err; | |
381 | printf("index\t\t start\t\t size\n"); | |
382 | printf("-------------------------------" | |
383 | "-----------------\n"); | |
384 | for (j = 0; j < total; j++) { | |
385 | err = fdt_get_mem_rsv(working_fdt, j, &addr, &size); | |
386 | if (err < 0) { | |
387 | printf("libfdt fdt_get_mem_rsv(): %s\n", | |
388 | fdt_strerror(err)); | |
389 | return err; | |
390 | } | |
391 | printf(" %x\t%08x%08x\t%08x%08x\n", j, | |
392 | (u32)(addr >> 32), | |
393 | (u32)(addr & 0xffffffff), | |
394 | (u32)(size >> 32), | |
395 | (u32)(size & 0xffffffff)); | |
396 | } | |
397 | } else if (argv[2][0] == 'a') { | |
398 | uint64_t addr, size; | |
399 | int err; | |
400 | addr = simple_strtoull(argv[3], NULL, 16); | |
401 | size = simple_strtoull(argv[4], NULL, 16); | |
402 | err = fdt_add_mem_rsv(working_fdt, addr, size); | |
403 | ||
404 | if (err < 0) { | |
405 | printf("libfdt fdt_add_mem_rsv(): %s\n", | |
406 | fdt_strerror(err)); | |
407 | return err; | |
408 | } | |
409 | } else if (argv[2][0] == 'd') { | |
410 | unsigned long idx = simple_strtoul(argv[3], NULL, 16); | |
411 | int err = fdt_del_mem_rsv(working_fdt, idx); | |
412 | ||
413 | if (err < 0) { | |
414 | printf("libfdt fdt_del_mem_rsv(): %s\n", | |
415 | fdt_strerror(err)); | |
416 | return err; | |
417 | } | |
418 | } else { | |
419 | /* Unrecognized command */ | |
420 | cmd_usage(cmdtp); | |
421 | return 1; | |
422 | } | |
423 | } | |
424 | #ifdef CONFIG_OF_BOARD_SETUP | |
425 | /* Call the board-specific fixup routine */ | |
426 | else if (strncmp(argv[1], "boa", 3) == 0) | |
427 | ft_board_setup(working_fdt, gd->bd); | |
428 | #endif | |
429 | /* Create a chosen node */ | |
430 | else if (argv[1][0] == 'c') { | |
431 | unsigned long initrd_start = 0, initrd_end = 0; | |
432 | ||
433 | if ((argc != 2) && (argc != 4)) { | |
434 | cmd_usage(cmdtp); | |
435 | return 1; | |
436 | } | |
437 | ||
438 | if (argc == 4) { | |
439 | initrd_start = simple_strtoul(argv[2], NULL, 16); | |
440 | initrd_end = simple_strtoul(argv[3], NULL, 16); | |
441 | } | |
442 | ||
443 | fdt_chosen(working_fdt, 1); | |
444 | fdt_initrd(working_fdt, initrd_start, initrd_end, 1); | |
445 | } | |
446 | /* resize the fdt */ | |
447 | else if (strncmp(argv[1], "re", 2) == 0) { | |
448 | fdt_resize(working_fdt); | |
449 | } | |
450 | else { | |
451 | /* Unrecognized command */ | |
452 | cmd_usage(cmdtp); | |
453 | return 1; | |
454 | } | |
455 | ||
456 | return 0; | |
457 | } | |
458 | ||
459 | /****************************************************************************/ | |
460 | ||
461 | static int fdt_valid(void) | |
462 | { | |
463 | int err; | |
464 | ||
465 | if (working_fdt == NULL) { | |
466 | printf ("The address of the fdt is invalid (NULL).\n"); | |
467 | return 0; | |
468 | } | |
469 | ||
470 | err = fdt_check_header(working_fdt); | |
471 | if (err == 0) | |
472 | return 1; /* valid */ | |
473 | ||
474 | if (err < 0) { | |
475 | printf("libfdt fdt_check_header(): %s", fdt_strerror(err)); | |
476 | /* | |
477 | * Be more informative on bad version. | |
478 | */ | |
479 | if (err == -FDT_ERR_BADVERSION) { | |
480 | if (fdt_version(working_fdt) < | |
481 | FDT_FIRST_SUPPORTED_VERSION) { | |
482 | printf (" - too old, fdt %d < %d", | |
483 | fdt_version(working_fdt), | |
484 | FDT_FIRST_SUPPORTED_VERSION); | |
485 | working_fdt = NULL; | |
486 | } | |
487 | if (fdt_last_comp_version(working_fdt) > | |
488 | FDT_LAST_SUPPORTED_VERSION) { | |
489 | printf (" - too new, fdt %d > %d", | |
490 | fdt_version(working_fdt), | |
491 | FDT_LAST_SUPPORTED_VERSION); | |
492 | working_fdt = NULL; | |
493 | } | |
494 | return 0; | |
495 | } | |
496 | printf("\n"); | |
497 | return 0; | |
498 | } | |
499 | return 1; | |
500 | } | |
501 | ||
502 | /****************************************************************************/ | |
503 | ||
504 | /* | |
505 | * Parse the user's input, partially heuristic. Valid formats: | |
506 | * <0x00112233 4 05> - an array of cells. Numbers follow standard | |
507 | * C conventions. | |
508 | * [00 11 22 .. nn] - byte stream | |
509 | * "string" - If the the value doesn't start with "<" or "[", it is | |
510 | * treated as a string. Note that the quotes are | |
511 | * stripped by the parser before we get the string. | |
512 | * newval: An array of strings containing the new property as specified | |
513 | * on the command line | |
514 | * count: The number of strings in the array | |
515 | * data: A bytestream to be placed in the property | |
516 | * len: The length of the resulting bytestream | |
517 | */ | |
518 | static int fdt_parse_prop(char * const *newval, int count, char *data, int *len) | |
519 | { | |
520 | char *cp; /* temporary char pointer */ | |
521 | char *newp; /* temporary newval char pointer */ | |
522 | unsigned long tmp; /* holds converted values */ | |
523 | int stridx = 0; | |
524 | ||
525 | *len = 0; | |
526 | newp = newval[0]; | |
527 | ||
528 | /* An array of cells */ | |
529 | if (*newp == '<') { | |
530 | newp++; | |
531 | while ((*newp != '>') && (stridx < count)) { | |
532 | /* | |
533 | * Keep searching until we find that last ">" | |
534 | * That way users don't have to escape the spaces | |
535 | */ | |
536 | if (*newp == '\0') { | |
537 | newp = newval[++stridx]; | |
538 | continue; | |
539 | } | |
540 | ||
541 | cp = newp; | |
542 | tmp = simple_strtoul(cp, &newp, 0); | |
543 | *(uint32_t *)data = __cpu_to_be32(tmp); | |
544 | data += 4; | |
545 | *len += 4; | |
546 | ||
547 | /* If the ptr didn't advance, something went wrong */ | |
548 | if ((newp - cp) <= 0) { | |
549 | printf("Sorry, I could not convert \"%s\"\n", | |
550 | cp); | |
551 | return 1; | |
552 | } | |
553 | ||
554 | while (*newp == ' ') | |
555 | newp++; | |
556 | } | |
557 | ||
558 | if (*newp != '>') { | |
559 | printf("Unexpected character '%c'\n", *newp); | |
560 | return 1; | |
561 | } | |
562 | } else if (*newp == '[') { | |
563 | /* | |
564 | * Byte stream. Convert the values. | |
565 | */ | |
566 | newp++; | |
567 | while ((stridx < count) && (*newp != ']')) { | |
568 | while (*newp == ' ') | |
569 | newp++; | |
570 | if (*newp == '\0') { | |
571 | newp = newval[++stridx]; | |
572 | continue; | |
573 | } | |
574 | if (!isxdigit(*newp)) | |
575 | break; | |
576 | tmp = simple_strtoul(newp, &newp, 16); | |
577 | *data++ = tmp & 0xFF; | |
578 | *len = *len + 1; | |
579 | } | |
580 | if (*newp != ']') { | |
581 | printf("Unexpected character '%c'\n", *newp); | |
582 | return 1; | |
583 | } | |
584 | } else { | |
585 | /* | |
586 | * Assume it is one or more strings. Copy it into our | |
587 | * data area for convenience (including the | |
588 | * terminating '\0's). | |
589 | */ | |
590 | while (stridx < count) { | |
591 | size_t length = strlen(newp) + 1; | |
592 | strcpy(data, newp); | |
593 | data += length; | |
594 | *len += length; | |
595 | newp = newval[++stridx]; | |
596 | } | |
597 | } | |
598 | return 0; | |
599 | } | |
600 | ||
601 | /****************************************************************************/ | |
602 | ||
603 | /* | |
604 | * Heuristic to guess if this is a string or concatenated strings. | |
605 | */ | |
606 | ||
607 | static int is_printable_string(const void *data, int len) | |
608 | { | |
609 | const char *s = data; | |
610 | ||
611 | /* zero length is not */ | |
612 | if (len == 0) | |
613 | return 0; | |
614 | ||
615 | /* must terminate with zero */ | |
616 | if (s[len - 1] != '\0') | |
617 | return 0; | |
618 | ||
619 | /* printable or a null byte (concatenated strings) */ | |
620 | while (((*s == '\0') || isprint(*s)) && (len > 0)) { | |
621 | /* | |
622 | * If we see a null, there are three possibilities: | |
623 | * 1) If len == 1, it is the end of the string, printable | |
624 | * 2) Next character also a null, not printable. | |
625 | * 3) Next character not a null, continue to check. | |
626 | */ | |
627 | if (s[0] == '\0') { | |
628 | if (len == 1) | |
629 | return 1; | |
630 | if (s[1] == '\0') | |
631 | return 0; | |
632 | } | |
633 | s++; | |
634 | len--; | |
635 | } | |
636 | ||
637 | /* Not the null termination, or not done yet: not printable */ | |
638 | if (*s != '\0' || (len != 0)) | |
639 | return 0; | |
640 | ||
641 | return 1; | |
642 | } | |
643 | ||
644 | ||
645 | /* | |
646 | * Print the property in the best format, a heuristic guess. Print as | |
647 | * a string, concatenated strings, a byte, word, double word, or (if all | |
648 | * else fails) it is printed as a stream of bytes. | |
649 | */ | |
650 | static void print_data(const void *data, int len) | |
651 | { | |
652 | int j; | |
653 | ||
654 | /* no data, don't print */ | |
655 | if (len == 0) | |
656 | return; | |
657 | ||
658 | /* | |
659 | * It is a string, but it may have multiple strings (embedded '\0's). | |
660 | */ | |
661 | if (is_printable_string(data, len)) { | |
662 | puts("\""); | |
663 | j = 0; | |
664 | while (j < len) { | |
665 | if (j > 0) | |
666 | puts("\", \""); | |
667 | puts(data); | |
668 | j += strlen(data) + 1; | |
669 | data += strlen(data) + 1; | |
670 | } | |
671 | puts("\""); | |
672 | return; | |
673 | } | |
674 | ||
675 | if ((len %4) == 0) { | |
676 | const u32 *p; | |
677 | ||
678 | printf("<"); | |
679 | for (j = 0, p = data; j < len/4; j ++) | |
680 | printf("0x%x%s", p[j], j < (len/4 - 1) ? " " : ""); | |
681 | printf(">"); | |
682 | } else { /* anything else... hexdump */ | |
683 | const u8 *s; | |
684 | ||
685 | printf("["); | |
686 | for (j = 0, s = data; j < len; j++) | |
687 | printf("%02x%s", s[j], j < len - 1 ? " " : ""); | |
688 | printf("]"); | |
689 | } | |
690 | } | |
691 | ||
692 | /****************************************************************************/ | |
693 | ||
694 | /* | |
695 | * Recursively print (a portion of) the working_fdt. The depth parameter | |
696 | * determines how deeply nested the fdt is printed. | |
697 | */ | |
698 | static int fdt_print(const char *pathp, char *prop, int depth) | |
699 | { | |
700 | static char tabs[MAX_LEVEL+1] = | |
701 | "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t" | |
702 | "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t"; | |
703 | const void *nodep; /* property node pointer */ | |
704 | int nodeoffset; /* node offset from libfdt */ | |
705 | int nextoffset; /* next node offset from libfdt */ | |
706 | uint32_t tag; /* tag */ | |
707 | int len; /* length of the property */ | |
708 | int level = 0; /* keep track of nesting level */ | |
709 | const struct fdt_property *fdt_prop; | |
710 | ||
711 | nodeoffset = fdt_path_offset (working_fdt, pathp); | |
712 | if (nodeoffset < 0) { | |
713 | /* | |
714 | * Not found or something else bad happened. | |
715 | */ | |
716 | printf ("libfdt fdt_path_offset() returned %s\n", | |
717 | fdt_strerror(nodeoffset)); | |
718 | return 1; | |
719 | } | |
720 | /* | |
721 | * The user passed in a property as well as node path. | |
722 | * Print only the given property and then return. | |
723 | */ | |
724 | if (prop) { | |
725 | nodep = fdt_getprop (working_fdt, nodeoffset, prop, &len); | |
726 | if (len == 0) { | |
727 | /* no property value */ | |
728 | printf("%s %s\n", pathp, prop); | |
729 | return 0; | |
730 | } else if (len > 0) { | |
731 | printf("%s = ", prop); | |
732 | print_data (nodep, len); | |
733 | printf("\n"); | |
734 | return 0; | |
735 | } else { | |
736 | printf ("libfdt fdt_getprop(): %s\n", | |
737 | fdt_strerror(len)); | |
738 | return 1; | |
739 | } | |
740 | } | |
741 | ||
742 | /* | |
743 | * The user passed in a node path and no property, | |
744 | * print the node and all subnodes. | |
745 | */ | |
746 | while(level >= 0) { | |
747 | tag = fdt_next_tag(working_fdt, nodeoffset, &nextoffset); | |
748 | switch(tag) { | |
749 | case FDT_BEGIN_NODE: | |
750 | pathp = fdt_get_name(working_fdt, nodeoffset, NULL); | |
751 | if (level <= depth) { | |
752 | if (pathp == NULL) | |
753 | pathp = "/* NULL pointer error */"; | |
754 | if (*pathp == '\0') | |
755 | pathp = "/"; /* root is nameless */ | |
756 | printf("%s%s {\n", | |
757 | &tabs[MAX_LEVEL - level], pathp); | |
758 | } | |
759 | level++; | |
760 | if (level >= MAX_LEVEL) { | |
761 | printf("Nested too deep, aborting.\n"); | |
762 | return 1; | |
763 | } | |
764 | break; | |
765 | case FDT_END_NODE: | |
766 | level--; | |
767 | if (level <= depth) | |
768 | printf("%s};\n", &tabs[MAX_LEVEL - level]); | |
769 | if (level == 0) { | |
770 | level = -1; /* exit the loop */ | |
771 | } | |
772 | break; | |
773 | case FDT_PROP: | |
774 | fdt_prop = fdt_offset_ptr(working_fdt, nodeoffset, | |
775 | sizeof(*fdt_prop)); | |
776 | pathp = fdt_string(working_fdt, | |
777 | fdt32_to_cpu(fdt_prop->nameoff)); | |
778 | len = fdt32_to_cpu(fdt_prop->len); | |
779 | nodep = fdt_prop->data; | |
780 | if (len < 0) { | |
781 | printf ("libfdt fdt_getprop(): %s\n", | |
782 | fdt_strerror(len)); | |
783 | return 1; | |
784 | } else if (len == 0) { | |
785 | /* the property has no value */ | |
786 | if (level <= depth) | |
787 | printf("%s%s;\n", | |
788 | &tabs[MAX_LEVEL - level], | |
789 | pathp); | |
790 | } else { | |
791 | if (level <= depth) { | |
792 | printf("%s%s = ", | |
793 | &tabs[MAX_LEVEL - level], | |
794 | pathp); | |
795 | print_data (nodep, len); | |
796 | printf(";\n"); | |
797 | } | |
798 | } | |
799 | break; | |
800 | case FDT_NOP: | |
801 | printf("%s/* NOP */\n", &tabs[MAX_LEVEL - level]); | |
802 | break; | |
803 | case FDT_END: | |
804 | return 1; | |
805 | default: | |
806 | if (level <= depth) | |
807 | printf("Unknown tag 0x%08X\n", tag); | |
808 | return 1; | |
809 | } | |
810 | nodeoffset = nextoffset; | |
811 | } | |
812 | return 0; | |
813 | } | |
814 | ||
815 | /********************************************************************/ | |
816 | ||
817 | U_BOOT_CMD( | |
818 | fdt, 255, 0, do_fdt, | |
819 | "flattened device tree utility commands", | |
820 | "addr <addr> [<length>] - Set the fdt location to <addr>\n" | |
821 | #ifdef CONFIG_OF_BOARD_SETUP | |
822 | "fdt boardsetup - Do board-specific set up\n" | |
823 | #endif | |
824 | "fdt move <fdt> <newaddr> <length> - Copy the fdt to <addr> and make it active\n" | |
825 | "fdt resize - Resize fdt to size + padding to 4k addr\n" | |
826 | "fdt print <path> [<prop>] - Recursive print starting at <path>\n" | |
827 | "fdt list <path> [<prop>] - Print one level starting at <path>\n" | |
828 | "fdt set <path> <prop> [<val>] - Set <property> [to <val>]\n" | |
829 | "fdt mknode <path> <node> - Create a new node after <path>\n" | |
830 | "fdt rm <path> [<prop>] - Delete the node or <property>\n" | |
831 | "fdt header - Display header info\n" | |
832 | "fdt bootcpu <id> - Set boot cpuid\n" | |
833 | "fdt memory <addr> <size> - Add/Update memory node\n" | |
834 | "fdt rsvmem print - Show current mem reserves\n" | |
835 | "fdt rsvmem add <addr> <size> - Add a mem reserve\n" | |
836 | "fdt rsvmem delete <index> - Delete a mem reserves\n" | |
837 | "fdt chosen [<start> <end>] - Add/update the /chosen branch in the tree\n" | |
838 | " <start>/<end> - initrd start/end addr\n" | |
839 | "NOTE: Dereference aliases by omiting the leading '/', " | |
840 | "e.g. fdt print ethernet0." | |
841 | ); |