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