flattree.c 21 KB

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