1/* 2 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005. 3 * 4 * 5 * This program is free software; you can redistribute it and/or 6 * modify it under the terms of the GNU General Public License as 7 * published by the Free Software Foundation; either version 2 of the 8 * License, or (at your option) any later version. 9 * 10 * This program is distributed in the hope that it will be useful, 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 13 * General Public License for more details. 14 * 15 * You should have received a copy of the GNU General Public License 16 * along with this program; if not, write to the Free Software 17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 18 * USA 19 */ 20 21#include "dtc.h" 22#include "srcpos.h" 23 24#define FTF_FULLPATH 0x1 25#define FTF_VARALIGN 0x2 26#define FTF_NAMEPROPS 0x4 27#define FTF_BOOTCPUID 0x8 28#define FTF_STRTABSIZE 0x10 29#define FTF_STRUCTSIZE 0x20 30#define FTF_NOPS 0x40 31 32static struct version_info { 33 int version; 34 int last_comp_version; 35 int hdr_size; 36 int flags; 37} version_table[] = { 38 {1, 1, FDT_V1_SIZE, 39 FTF_FULLPATH|FTF_VARALIGN|FTF_NAMEPROPS}, 40 {2, 1, FDT_V2_SIZE, 41 FTF_FULLPATH|FTF_VARALIGN|FTF_NAMEPROPS|FTF_BOOTCPUID}, 42 {3, 1, FDT_V3_SIZE, 43 FTF_FULLPATH|FTF_VARALIGN|FTF_NAMEPROPS|FTF_BOOTCPUID|FTF_STRTABSIZE}, 44 {16, 16, FDT_V3_SIZE, 45 FTF_BOOTCPUID|FTF_STRTABSIZE|FTF_NOPS}, 46 {17, 16, FDT_V17_SIZE, 47 FTF_BOOTCPUID|FTF_STRTABSIZE|FTF_STRUCTSIZE|FTF_NOPS}, 48}; 49 50struct emitter { 51 void (*cell)(void *, cell_t); 52 void (*string)(void *, char *, int); 53 void (*align)(void *, int); 54 void (*data)(void *, struct data); 55 void (*beginnode)(void *, const char *); 56 void (*endnode)(void *, const char *); 57 void (*property)(void *, const char *); 58}; 59 60static void bin_emit_cell(void *e, cell_t val) 61{ 62 struct data *dtbuf = e; 63 64 *dtbuf = data_append_cell(*dtbuf, val); 65} 66 67static void bin_emit_string(void *e, char *str, int len) 68{ 69 struct data *dtbuf = e; 70 71 if (len == 0) 72 len = strlen(str); 73 74 *dtbuf = data_append_data(*dtbuf, str, len); 75 *dtbuf = data_append_byte(*dtbuf, '\0'); 76} 77 78static void bin_emit_align(void *e, int a) 79{ 80 struct data *dtbuf = e; 81 82 *dtbuf = data_append_align(*dtbuf, a); 83} 84 85static void bin_emit_data(void *e, struct data d) 86{ 87 struct data *dtbuf = e; 88 89 *dtbuf = data_append_data(*dtbuf, d.val, d.len); 90} 91 92static void bin_emit_beginnode(void *e, const char *label) 93{ 94 bin_emit_cell(e, FDT_BEGIN_NODE); 95} 96 97static void bin_emit_endnode(void *e, const char *label) 98{ 99 bin_emit_cell(e, FDT_END_NODE); 100} 101 102static void bin_emit_property(void *e, const char *label) 103{ 104 bin_emit_cell(e, FDT_PROP); 105} 106 107static struct emitter bin_emitter = { 108 .cell = bin_emit_cell, 109 .string = bin_emit_string, 110 .align = bin_emit_align, 111 .data = bin_emit_data, 112 .beginnode = bin_emit_beginnode, 113 .endnode = bin_emit_endnode, 114 .property = bin_emit_property, 115}; 116 117static void emit_label(FILE *f, const char *prefix, const char *label) 118{ 119 fprintf(f, "\t.globl\t%s_%s\n", prefix, label); 120 fprintf(f, "%s_%s:\n", prefix, label); 121 fprintf(f, "_%s_%s:\n", prefix, label); 122} 123 124static void emit_offset_label(FILE *f, const char *label, int offset) 125{ 126 fprintf(f, "\t.globl\t%s\n", label); 127 fprintf(f, "%s\t= . + %d\n", label, offset); 128} 129 130static void asm_emit_cell(void *e, cell_t val) 131{ 132 FILE *f = e; 133 134 fprintf(f, "\t.long\t0x%x\n", val); 135} 136 137static void asm_emit_string(void *e, char *str, int len) 138{ 139 FILE *f = e; 140 char c = 0; 141 142 if (len != 0) { 143 c = str[len]; 144 str[len] = '\0'; 145 } 146 147 fprintf(f, "\t.string\t\"%s\"\n", str); 148 149 if (len != 0) { 150 str[len] = c; 151 } 152} 153 154static void asm_emit_align(void *e, int a) 155{ 156 FILE *f = e; 157 158 fprintf(f, "\t.balign\t%d\n", a); 159} 160 161static void asm_emit_data(void *e, struct data d) 162{ 163 FILE *f = e; 164 int off = 0; 165 struct marker *m = d.markers; 166 167 for_each_marker_of_type(m, LABEL) 168 emit_offset_label(f, m->ref, m->offset); 169 170 while ((d.len - off) >= sizeof(uint32_t)) { 171 fprintf(f, "\t.long\t0x%x\n", 172 fdt32_to_cpu(*((uint32_t *)(d.val+off)))); 173 off += sizeof(uint32_t); 174 } 175 176 while ((d.len - off) >= 1) { 177 fprintf(f, "\t.byte\t0x%hhx\n", d.val[off]); 178 off += 1; 179 } 180 181 assert(off == d.len); 182} 183 184static void asm_emit_beginnode(void *e, const char *label) 185{ 186 FILE *f = e; 187 188 if (label) { 189 fprintf(f, "\t.globl\t%s\n", label); 190 fprintf(f, "%s:\n", label); 191 } 192 fprintf(f, "\t.long\tFDT_BEGIN_NODE\n"); 193} 194 195static void asm_emit_endnode(void *e, const char *label) 196{ 197 FILE *f = e; 198 199 fprintf(f, "\t.long\tFDT_END_NODE\n"); 200 if (label) { 201 fprintf(f, "\t.globl\t%s_end\n", label); 202 fprintf(f, "%s_end:\n", label); 203 } 204} 205 206static void asm_emit_property(void *e, const char *label) 207{ 208 FILE *f = e; 209 210 if (label) { 211 fprintf(f, "\t.globl\t%s\n", label); 212 fprintf(f, "%s:\n", label); 213 } 214 fprintf(f, "\t.long\tFDT_PROP\n"); 215} 216 217static struct emitter asm_emitter = { 218 .cell = asm_emit_cell, 219 .string = asm_emit_string, 220 .align = asm_emit_align, 221 .data = asm_emit_data, 222 .beginnode = asm_emit_beginnode, 223 .endnode = asm_emit_endnode, 224 .property = asm_emit_property, 225}; 226 227static int stringtable_insert(struct data *d, const char *str) 228{ 229 int i; 230 231 232 for (i = 0; i < d->len; i++) { 233 if (streq(str, d->val + i)) 234 return i; 235 } 236 237 *d = data_append_data(*d, str, strlen(str)+1); 238 return i; 239} 240 241static void flatten_tree(struct node *tree, struct emitter *emit, 242 void *etarget, struct data *strbuf, 243 struct version_info *vi) 244{ 245 struct property *prop; 246 struct node *child; 247 int seen_name_prop = 0; 248 249 emit->beginnode(etarget, tree->label); 250 251 if (vi->flags & FTF_FULLPATH) 252 emit->string(etarget, tree->fullpath, 0); 253 else 254 emit->string(etarget, tree->name, 0); 255 256 emit->align(etarget, sizeof(cell_t)); 257 258 for_each_property(tree, prop) { 259 int nameoff; 260 261 if (streq(prop->name, "name")) 262 seen_name_prop = 1; 263 264 nameoff = stringtable_insert(strbuf, prop->name); 265 266 emit->property(etarget, prop->label); 267 emit->cell(etarget, prop->val.len); 268 emit->cell(etarget, nameoff); 269 270 if ((vi->flags & FTF_VARALIGN) && (prop->val.len >= 8)) 271 emit->align(etarget, 8); 272 273 emit->data(etarget, prop->val); 274 emit->align(etarget, sizeof(cell_t)); 275 } 276 277 if ((vi->flags & FTF_NAMEPROPS) && !seen_name_prop) { 278 emit->property(etarget, NULL); 279 emit->cell(etarget, tree->basenamelen+1); 280 emit->cell(etarget, stringtable_insert(strbuf, "name")); 281 282 if ((vi->flags & FTF_VARALIGN) && ((tree->basenamelen+1) >= 8)) 283 emit->align(etarget, 8); 284 285 emit->string(etarget, tree->name, tree->basenamelen); 286 emit->align(etarget, sizeof(cell_t)); 287 } 288 289 for_each_child(tree, child) { 290 flatten_tree(child, emit, etarget, strbuf, vi); 291 } 292 293 emit->endnode(etarget, tree->label); 294} 295 296static struct data flatten_reserve_list(struct reserve_info *reservelist, 297 struct version_info *vi) 298{ 299 struct reserve_info *re; 300 struct data d = empty_data; 301 static struct fdt_reserve_entry null_re = {0,0}; 302 int j; 303 304 for (re = reservelist; re; re = re->next) { 305 d = data_append_re(d, &re->re); 306 } 307 /* 308 * Add additional reserved slots if the user asked for them. 309 */ 310 for (j = 0; j < reservenum; j++) { 311 d = data_append_re(d, &null_re); 312 } 313 314 return d; 315} 316 317static void make_fdt_header(struct fdt_header *fdt, 318 struct version_info *vi, 319 int reservesize, int dtsize, int strsize, 320 int boot_cpuid_phys) 321{ 322 int reserve_off; 323 324 reservesize += sizeof(struct fdt_reserve_entry); 325 326 memset(fdt, 0xff, sizeof(*fdt)); 327 328 fdt->magic = cpu_to_fdt32(FDT_MAGIC); 329 fdt->version = cpu_to_fdt32(vi->version); 330 fdt->last_comp_version = cpu_to_fdt32(vi->last_comp_version); 331 332 /* Reserve map should be doubleword aligned */ 333 reserve_off = ALIGN(vi->hdr_size, 8); 334 335 fdt->off_mem_rsvmap = cpu_to_fdt32(reserve_off); 336 fdt->off_dt_struct = cpu_to_fdt32(reserve_off + reservesize); 337 fdt->off_dt_strings = cpu_to_fdt32(reserve_off + reservesize 338 + dtsize); 339 fdt->totalsize = cpu_to_fdt32(reserve_off + reservesize + dtsize + strsize); 340 341 if (vi->flags & FTF_BOOTCPUID) 342 fdt->boot_cpuid_phys = cpu_to_fdt32(boot_cpuid_phys); 343 if (vi->flags & FTF_STRTABSIZE) 344 fdt->size_dt_strings = cpu_to_fdt32(strsize); 345 if (vi->flags & FTF_STRUCTSIZE) 346 fdt->size_dt_struct = cpu_to_fdt32(dtsize); 347} 348 349void dt_to_blob(FILE *f, struct boot_info *bi, int version) 350{ 351 struct version_info *vi = NULL; 352 int i; 353 struct data blob = empty_data; 354 struct data reservebuf = empty_data; 355 struct data dtbuf = empty_data; 356 struct data strbuf = empty_data; 357 struct fdt_header fdt; 358 int padlen = 0; 359 360 for (i = 0; i < ARRAY_SIZE(version_table); i++) { 361 if (version_table[i].version == version) 362 vi = &version_table[i]; 363 } 364 if (!vi) 365 die("Unknown device tree blob version %d\n", version); 366 367 flatten_tree(bi->dt, &bin_emitter, &dtbuf, &strbuf, vi); 368 bin_emit_cell(&dtbuf, FDT_END); 369 370 reservebuf = flatten_reserve_list(bi->reservelist, vi); 371 372 /* Make header */ 373 make_fdt_header(&fdt, vi, reservebuf.len, dtbuf.len, strbuf.len, 374 bi->boot_cpuid_phys); 375 376 /* 377 * If the user asked for more space than is used, adjust the totalsize. 378 */ 379 if (minsize > 0) { 380 padlen = minsize - fdt32_to_cpu(fdt.totalsize); 381 if ((padlen < 0) && (quiet < 1)) 382 fprintf(stderr, 383 "Warning: blob size %d >= minimum size %d\n", 384 fdt32_to_cpu(fdt.totalsize), minsize); 385 } 386 387 if (padsize > 0) 388 padlen = padsize; 389 390 if (padlen > 0) { 391 int tsize = fdt32_to_cpu(fdt.totalsize); 392 tsize += padlen; 393 fdt.totalsize = cpu_to_fdt32(tsize); 394 } 395 396 /* 397 * Assemble the blob: start with the header, add with alignment 398 * the reserve buffer, add the reserve map terminating zeroes, 399 * the device tree itself, and finally the strings. 400 */ 401 blob = data_append_data(blob, &fdt, vi->hdr_size); 402 blob = data_append_align(blob, 8); 403 blob = data_merge(blob, reservebuf); 404 blob = data_append_zeroes(blob, sizeof(struct fdt_reserve_entry)); 405 blob = data_merge(blob, dtbuf); 406 blob = data_merge(blob, strbuf); 407 408 /* 409 * If the user asked for more space than is used, pad out the blob. 410 */ 411 if (padlen > 0) 412 blob = data_append_zeroes(blob, padlen); 413 414 fwrite(blob.val, blob.len, 1, f); 415 416 if (ferror(f)) 417 die("Error writing device tree blob: %s\n", strerror(errno)); 418 419 /* 420 * data_merge() frees the right-hand element so only the blob 421 * remains to be freed. 422 */ 423 data_free(blob); 424} 425 426static void dump_stringtable_asm(FILE *f, struct data strbuf) 427{ 428 const char *p; 429 int len; 430 431 p = strbuf.val; 432 433 while (p < (strbuf.val + strbuf.len)) { 434 len = strlen(p); 435 fprintf(f, "\t.string \"%s\"\n", p); 436 p += len+1; 437 } 438} 439 440void dt_to_asm(FILE *f, struct boot_info *bi, int version) 441{ 442 struct version_info *vi = NULL; 443 int i; 444 struct data strbuf = empty_data; 445 struct reserve_info *re; 446 const char *symprefix = "dt"; 447 448 for (i = 0; i < ARRAY_SIZE(version_table); i++) { 449 if (version_table[i].version == version) 450 vi = &version_table[i]; 451 } 452 if (!vi) 453 die("Unknown device tree blob version %d\n", version); 454 455 fprintf(f, "/* autogenerated by dtc, do not edit */\n\n"); 456 fprintf(f, "#define FDT_MAGIC 0x%x\n", FDT_MAGIC); 457 fprintf(f, "#define FDT_BEGIN_NODE 0x%x\n", FDT_BEGIN_NODE); 458 fprintf(f, "#define FDT_END_NODE 0x%x\n", FDT_END_NODE); 459 fprintf(f, "#define FDT_PROP 0x%x\n", FDT_PROP); 460 fprintf(f, "#define FDT_END 0x%x\n", FDT_END); 461 fprintf(f, "\n"); 462 463 emit_label(f, symprefix, "blob_start"); 464 emit_label(f, symprefix, "header"); 465 fprintf(f, "\t.long\tFDT_MAGIC\t\t\t\t/* magic */\n"); 466 fprintf(f, "\t.long\t_%s_blob_abs_end - _%s_blob_start\t/* totalsize */\n", 467 symprefix, symprefix); 468 fprintf(f, "\t.long\t_%s_struct_start - _%s_blob_start\t/* off_dt_struct */\n", 469 symprefix, symprefix); 470 fprintf(f, "\t.long\t_%s_strings_start - _%s_blob_start\t/* off_dt_strings */\n", 471 symprefix, symprefix); 472 fprintf(f, "\t.long\t_%s_reserve_map - _%s_blob_start\t/* off_dt_strings */\n", 473 symprefix, symprefix); 474 fprintf(f, "\t.long\t%d\t\t\t\t\t/* version */\n", vi->version); 475 fprintf(f, "\t.long\t%d\t\t\t\t\t/* last_comp_version */\n", 476 vi->last_comp_version); 477 478 if (vi->flags & FTF_BOOTCPUID) 479 fprintf(f, "\t.long\t%i\t\t\t\t\t/* boot_cpuid_phys */\n", 480 bi->boot_cpuid_phys); 481 482 if (vi->flags & FTF_STRTABSIZE) 483 fprintf(f, "\t.long\t_%s_strings_end - _%s_strings_start\t/* size_dt_strings */\n", 484 symprefix, symprefix); 485 486 if (vi->flags & FTF_STRUCTSIZE) 487 fprintf(f, "\t.long\t_%s_struct_end - _%s_struct_start\t/* size_dt_struct */\n", 488 symprefix, symprefix); 489 490 /* 491 * Reserve map entries. 492 * Align the reserve map to a doubleword boundary. 493 * Each entry is an (address, size) pair of u64 values. 494 * Always supply a zero-sized temination entry. 495 */ 496 asm_emit_align(f, 8); 497 emit_label(f, symprefix, "reserve_map"); 498 499 fprintf(f, "/* Memory reserve map from source file */\n"); 500 501 /* 502 * Use .long on high and low halfs of u64s to avoid .quad 503 * as it appears .quad isn't available in some assemblers. 504 */ 505 for (re = bi->reservelist; re; re = re->next) { 506 if (re->label) { 507 fprintf(f, "\t.globl\t%s\n", re->label); 508 fprintf(f, "%s:\n", re->label); 509 } 510 fprintf(f, "\t.long\t0x%08x, 0x%08x\n", 511 (unsigned int)(re->re.address >> 32), 512 (unsigned int)(re->re.address & 0xffffffff)); 513 fprintf(f, "\t.long\t0x%08x, 0x%08x\n", 514 (unsigned int)(re->re.size >> 32), 515 (unsigned int)(re->re.size & 0xffffffff)); 516 } 517 for (i = 0; i < reservenum; i++) { 518 fprintf(f, "\t.long\t0, 0\n\t.long\t0, 0\n"); 519 } 520 521 fprintf(f, "\t.long\t0, 0\n\t.long\t0, 0\n"); 522 523 emit_label(f, symprefix, "struct_start"); 524 flatten_tree(bi->dt, &asm_emitter, f, &strbuf, vi); 525 fprintf(f, "\t.long\tFDT_END\n"); 526 emit_label(f, symprefix, "struct_end"); 527 528 emit_label(f, symprefix, "strings_start"); 529 dump_stringtable_asm(f, strbuf); 530 emit_label(f, symprefix, "strings_end"); 531 532 emit_label(f, symprefix, "blob_end"); 533 534 /* 535 * If the user asked for more space than is used, pad it out. 536 */ 537 if (minsize > 0) { 538 fprintf(f, "\t.space\t%d - (_%s_blob_end - _%s_blob_start), 0\n", 539 minsize, symprefix, symprefix); 540 } 541 if (padsize > 0) { 542 fprintf(f, "\t.space\t%d, 0\n", padsize); 543 } 544 emit_label(f, symprefix, "blob_abs_end"); 545 546 data_free(strbuf); 547} 548 549struct inbuf { 550 char *base, *limit, *ptr; 551}; 552 553static void inbuf_init(struct inbuf *inb, void *base, void *limit) 554{ 555 inb->base = base; 556 inb->limit = limit; 557 inb->ptr = inb->base; 558} 559 560static void flat_read_chunk(struct inbuf *inb, void *p, int len) 561{ 562 if ((inb->ptr + len) > inb->limit) 563 die("Premature end of data parsing flat device tree\n"); 564 565 memcpy(p, inb->ptr, len); 566 567 inb->ptr += len; 568} 569 570static uint32_t flat_read_word(struct inbuf *inb) 571{ 572 uint32_t val; 573 574 assert(((inb->ptr - inb->base) % sizeof(val)) == 0); 575 576 flat_read_chunk(inb, &val, sizeof(val)); 577 578 return fdt32_to_cpu(val); 579} 580 581static void flat_realign(struct inbuf *inb, int align) 582{ 583 int off = inb->ptr - inb->base; 584 585 inb->ptr = inb->base + ALIGN(off, align); 586 if (inb->ptr > inb->limit) 587 die("Premature end of data parsing flat device tree\n"); 588} 589 590static char *flat_read_string(struct inbuf *inb) 591{ 592 int len = 0; 593 const char *p = inb->ptr; 594 char *str; 595 596 do { 597 if (p >= inb->limit) 598 die("Premature end of data parsing flat device tree\n"); 599 len++; 600 } while ((*p++) != '\0'); 601 602 str = strdup(inb->ptr); 603 604 inb->ptr += len; 605 606 flat_realign(inb, sizeof(uint32_t)); 607 608 return str; 609} 610 611static struct data flat_read_data(struct inbuf *inb, int len) 612{ 613 struct data d = empty_data; 614 615 if (len == 0) 616 return empty_data; 617 618 d = data_grow_for(d, len); 619 d.len = len; 620 621 flat_read_chunk(inb, d.val, len); 622 623 flat_realign(inb, sizeof(uint32_t)); 624 625 return d; 626} 627 628static char *flat_read_stringtable(struct inbuf *inb, int offset) 629{ 630 const char *p; 631 632 p = inb->base + offset; 633 while (1) { 634 if (p >= inb->limit || p < inb->base) 635 die("String offset %d overruns string table\n", 636 offset); 637 638 if (*p == '\0') 639 break; 640 641 p++; 642 } 643 644 return strdup(inb->base + offset); 645} 646 647static struct property *flat_read_property(struct inbuf *dtbuf, 648 struct inbuf *strbuf, int flags) 649{ 650 uint32_t proplen, stroff; 651 char *name; 652 struct data val; 653 654 proplen = flat_read_word(dtbuf); 655 stroff = flat_read_word(dtbuf); 656 657 name = flat_read_stringtable(strbuf, stroff); 658 659 if ((flags & FTF_VARALIGN) && (proplen >= 8)) 660 flat_realign(dtbuf, 8); 661 662 val = flat_read_data(dtbuf, proplen); 663 664 return build_property(name, val, NULL); 665} 666 667 668static struct reserve_info *flat_read_mem_reserve(struct inbuf *inb) 669{ 670 struct reserve_info *reservelist = NULL; 671 struct reserve_info *new; 672 const char *p; 673 struct fdt_reserve_entry re; 674 675 /* 676 * Each entry is a pair of u64 (addr, size) values for 4 cell_t's. 677 * List terminates at an entry with size equal to zero. 678 * 679 * First pass, count entries. 680 */ 681 p = inb->ptr; 682 while (1) { 683 flat_read_chunk(inb, &re, sizeof(re)); 684 re.address = fdt64_to_cpu(re.address); 685 re.size = fdt64_to_cpu(re.size); 686 if (re.size == 0) 687 break; 688 689 new = build_reserve_entry(re.address, re.size, NULL); 690 reservelist = add_reserve_entry(reservelist, new); 691 } 692 693 return reservelist; 694} 695 696 697static char *nodename_from_path(const char *ppath, const char *cpath) 698{ 699 int plen; 700 701 plen = strlen(ppath); 702 703 if (!strneq(ppath, cpath, plen)) 704 die("Path \"%s\" is not valid as a child of \"%s\"\n", 705 cpath, ppath); 706 707 /* root node is a special case */ 708 if (!streq(ppath, "/")) 709 plen++; 710 711 return strdup(cpath + plen); 712} 713 714static struct node *unflatten_tree(struct inbuf *dtbuf, 715 struct inbuf *strbuf, 716 const char *parent_flatname, int flags) 717{ 718 struct node *node; 719 char *flatname; 720 uint32_t val; 721 722 node = build_node(NULL, NULL); 723 724 flatname = flat_read_string(dtbuf); 725 726 if (flags & FTF_FULLPATH) 727 node->name = nodename_from_path(parent_flatname, flatname); 728 else 729 node->name = flatname; 730 731 do { 732 struct property *prop; 733 struct node *child; 734 735 val = flat_read_word(dtbuf); 736 switch (val) { 737 case FDT_PROP: 738 if (node->children) 739 fprintf(stderr, "Warning: Flat tree input has " 740 "subnodes preceding a property.\n"); 741 prop = flat_read_property(dtbuf, strbuf, flags); 742 add_property(node, prop); 743 break; 744 745 case FDT_BEGIN_NODE: 746 child = unflatten_tree(dtbuf,strbuf, flatname, flags); 747 add_child(node, child); 748 break; 749 750 case FDT_END_NODE: 751 break; 752 753 case FDT_END: 754 die("Premature FDT_END in device tree blob\n"); 755 break; 756 757 case FDT_NOP: 758 if (!(flags & FTF_NOPS)) 759 fprintf(stderr, "Warning: NOP tag found in flat tree" 760 " version <16\n"); 761 762 /* Ignore */ 763 break; 764 765 default: 766 die("Invalid opcode word %08x in device tree blob\n", 767 val); 768 } 769 } while (val != FDT_END_NODE); 770 771 return node; 772} 773 774 775struct boot_info *dt_from_blob(const char *fname) 776{ 777 struct dtc_file *dtcf; 778 uint32_t magic, totalsize, version, size_dt, boot_cpuid_phys; 779 uint32_t off_dt, off_str, off_mem_rsvmap; 780 int rc; 781 char *blob; 782 struct fdt_header *fdt; 783 char *p; 784 struct inbuf dtbuf, strbuf; 785 struct inbuf memresvbuf; 786 int sizeleft; 787 struct reserve_info *reservelist; 788 struct node *tree; 789 uint32_t val; 790 int flags = 0; 791 792 dtcf = dtc_open_file(fname, NULL); 793 794 rc = fread(&magic, sizeof(magic), 1, dtcf->file); 795 if (ferror(dtcf->file)) 796 die("Error reading DT blob magic number: %s\n", 797 strerror(errno)); 798 if (rc < 1) { 799 if (feof(dtcf->file)) 800 die("EOF reading DT blob magic number\n"); 801 else 802 die("Mysterious short read reading magic number\n"); 803 } 804 805 magic = fdt32_to_cpu(magic); 806 if (magic != FDT_MAGIC) 807 die("Blob has incorrect magic number\n"); 808 809 rc = fread(&totalsize, sizeof(totalsize), 1, dtcf->file); 810 if (ferror(dtcf->file)) 811 die("Error reading DT blob size: %s\n", strerror(errno)); 812 if (rc < 1) { 813 if (feof(dtcf->file)) 814 die("EOF reading DT blob size\n"); 815 else 816 die("Mysterious short read reading blob size\n"); 817 } 818 819 totalsize = fdt32_to_cpu(totalsize); 820 if (totalsize < FDT_V1_SIZE) 821 die("DT blob size (%d) is too small\n", totalsize); 822 823 blob = xmalloc(totalsize); 824 825 fdt = (struct fdt_header *)blob; 826 fdt->magic = cpu_to_fdt32(magic); 827 fdt->totalsize = cpu_to_fdt32(totalsize); 828 829 sizeleft = totalsize - sizeof(magic) - sizeof(totalsize); 830 p = blob + sizeof(magic) + sizeof(totalsize); 831 832 while (sizeleft) { 833 if (feof(dtcf->file)) 834 die("EOF before reading %d bytes of DT blob\n", 835 totalsize); 836 837 rc = fread(p, 1, sizeleft, dtcf->file); 838 if (ferror(dtcf->file)) 839 die("Error reading DT blob: %s\n", 840 strerror(errno)); 841 842 sizeleft -= rc; 843 p += rc; 844 } 845 846 off_dt = fdt32_to_cpu(fdt->off_dt_struct); 847 off_str = fdt32_to_cpu(fdt->off_dt_strings); 848 off_mem_rsvmap = fdt32_to_cpu(fdt->off_mem_rsvmap); 849 version = fdt32_to_cpu(fdt->version); 850 boot_cpuid_phys = fdt32_to_cpu(fdt->boot_cpuid_phys); 851 852 if (off_mem_rsvmap >= totalsize) 853 die("Mem Reserve structure offset exceeds total size\n"); 854 855 if (off_dt >= totalsize) 856 die("DT structure offset exceeds total size\n"); 857 858 if (off_str > totalsize) 859 die("String table offset exceeds total size\n"); 860 861 if (version >= 3) { 862 uint32_t size_str = fdt32_to_cpu(fdt->size_dt_strings); 863 if (off_str+size_str > totalsize) 864 die("String table extends past total size\n"); 865 inbuf_init(&strbuf, blob + off_str, blob + off_str + size_str); 866 } else { 867 inbuf_init(&strbuf, blob + off_str, blob + totalsize); 868 } 869 870 if (version >= 17) { 871 size_dt = fdt32_to_cpu(fdt->size_dt_struct); 872 if (off_dt+size_dt > totalsize) 873 die("Structure block extends past total size\n"); 874 } 875 876 if (version < 16) { 877 flags |= FTF_FULLPATH | FTF_NAMEPROPS | FTF_VARALIGN; 878 } else { 879 flags |= FTF_NOPS; 880 } 881 882 inbuf_init(&memresvbuf, 883 blob + off_mem_rsvmap, blob + totalsize); 884 inbuf_init(&dtbuf, blob + off_dt, blob + totalsize); 885 886 reservelist = flat_read_mem_reserve(&memresvbuf); 887 888 val = flat_read_word(&dtbuf); 889 890 if (val != FDT_BEGIN_NODE) 891 die("Device tree blob doesn't begin with FDT_BEGIN_NODE (begins with 0x%08x)\n", val); 892 893 tree = unflatten_tree(&dtbuf, &strbuf, "", flags); 894 895 val = flat_read_word(&dtbuf); 896 if (val != FDT_END) 897 die("Device tree blob doesn't end with FDT_END\n"); 898 899 free(blob); 900 901 dtc_close_file(dtcf); 902 903 return build_boot_info(reservelist, tree, boot_cpuid_phys); 904} 905