fdt.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792
  1. /*
  2. * Functions for working with the Flattened Device Tree data format
  3. *
  4. * Copyright 2009 Benjamin Herrenschmidt, IBM Corp
  5. * benh@kernel.crashing.org
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License
  9. * version 2 as published by the Free Software Foundation.
  10. */
  11. #include <linux/kernel.h>
  12. #include <linux/initrd.h>
  13. #include <linux/module.h>
  14. #include <linux/of.h>
  15. #include <linux/of_fdt.h>
  16. #include <linux/string.h>
  17. #include <linux/errno.h>
  18. #include <linux/slab.h>
  19. #include <asm/setup.h> /* for COMMAND_LINE_SIZE */
  20. #ifdef CONFIG_PPC
  21. #include <asm/machdep.h>
  22. #endif /* CONFIG_PPC */
  23. #include <asm/page.h>
  24. char *of_fdt_get_string(struct boot_param_header *blob, u32 offset)
  25. {
  26. return ((char *)blob) +
  27. be32_to_cpu(blob->off_dt_strings) + offset;
  28. }
  29. /**
  30. * of_fdt_get_property - Given a node in the given flat blob, return
  31. * the property ptr
  32. */
  33. void *of_fdt_get_property(struct boot_param_header *blob,
  34. unsigned long node, const char *name,
  35. unsigned long *size)
  36. {
  37. unsigned long p = node;
  38. do {
  39. u32 tag = be32_to_cpup((__be32 *)p);
  40. u32 sz, noff;
  41. const char *nstr;
  42. p += 4;
  43. if (tag == OF_DT_NOP)
  44. continue;
  45. if (tag != OF_DT_PROP)
  46. return NULL;
  47. sz = be32_to_cpup((__be32 *)p);
  48. noff = be32_to_cpup((__be32 *)(p + 4));
  49. p += 8;
  50. if (be32_to_cpu(blob->version) < 0x10)
  51. p = ALIGN(p, sz >= 8 ? 8 : 4);
  52. nstr = of_fdt_get_string(blob, noff);
  53. if (nstr == NULL) {
  54. pr_warning("Can't find property index name !\n");
  55. return NULL;
  56. }
  57. if (strcmp(name, nstr) == 0) {
  58. if (size)
  59. *size = sz;
  60. return (void *)p;
  61. }
  62. p += sz;
  63. p = ALIGN(p, 4);
  64. } while (1);
  65. }
  66. /**
  67. * of_fdt_is_compatible - Return true if given node from the given blob has
  68. * compat in its compatible list
  69. * @blob: A device tree blob
  70. * @node: node to test
  71. * @compat: compatible string to compare with compatible list.
  72. *
  73. * On match, returns a non-zero value with smaller values returned for more
  74. * specific compatible values.
  75. */
  76. int of_fdt_is_compatible(struct boot_param_header *blob,
  77. unsigned long node, const char *compat)
  78. {
  79. const char *cp;
  80. unsigned long cplen, l, score = 0;
  81. cp = of_fdt_get_property(blob, node, "compatible", &cplen);
  82. if (cp == NULL)
  83. return 0;
  84. while (cplen > 0) {
  85. score++;
  86. if (of_compat_cmp(cp, compat, strlen(compat)) == 0)
  87. return score;
  88. l = strlen(cp) + 1;
  89. cp += l;
  90. cplen -= l;
  91. }
  92. return 0;
  93. }
  94. /**
  95. * of_fdt_match - Return true if node matches a list of compatible values
  96. */
  97. int of_fdt_match(struct boot_param_header *blob, unsigned long node,
  98. const char *const *compat)
  99. {
  100. unsigned int tmp, score = 0;
  101. if (!compat)
  102. return 0;
  103. while (*compat) {
  104. tmp = of_fdt_is_compatible(blob, node, *compat);
  105. if (tmp && (score == 0 || (tmp < score)))
  106. score = tmp;
  107. compat++;
  108. }
  109. return score;
  110. }
  111. static void *unflatten_dt_alloc(unsigned long *mem, unsigned long size,
  112. unsigned long align)
  113. {
  114. void *res;
  115. *mem = ALIGN(*mem, align);
  116. res = (void *)*mem;
  117. *mem += size;
  118. return res;
  119. }
  120. /**
  121. * unflatten_dt_node - Alloc and populate a device_node from the flat tree
  122. * @blob: The parent device tree blob
  123. * @mem: Memory chunk to use for allocating device nodes and properties
  124. * @p: pointer to node in flat tree
  125. * @dad: Parent struct device_node
  126. * @allnextpp: pointer to ->allnext from last allocated device_node
  127. * @fpsize: Size of the node path up at the current depth.
  128. */
  129. static unsigned long unflatten_dt_node(struct boot_param_header *blob,
  130. unsigned long mem,
  131. unsigned long *p,
  132. struct device_node *dad,
  133. struct device_node ***allnextpp,
  134. unsigned long fpsize)
  135. {
  136. struct device_node *np;
  137. struct property *pp, **prev_pp = NULL;
  138. char *pathp;
  139. u32 tag;
  140. unsigned int l, allocl;
  141. int has_name = 0;
  142. int new_format = 0;
  143. tag = be32_to_cpup((__be32 *)(*p));
  144. if (tag != OF_DT_BEGIN_NODE) {
  145. pr_err("Weird tag at start of node: %x\n", tag);
  146. return mem;
  147. }
  148. *p += 4;
  149. pathp = (char *)*p;
  150. l = allocl = strlen(pathp) + 1;
  151. *p = ALIGN(*p + l, 4);
  152. /* version 0x10 has a more compact unit name here instead of the full
  153. * path. we accumulate the full path size using "fpsize", we'll rebuild
  154. * it later. We detect this because the first character of the name is
  155. * not '/'.
  156. */
  157. if ((*pathp) != '/') {
  158. new_format = 1;
  159. if (fpsize == 0) {
  160. /* root node: special case. fpsize accounts for path
  161. * plus terminating zero. root node only has '/', so
  162. * fpsize should be 2, but we want to avoid the first
  163. * level nodes to have two '/' so we use fpsize 1 here
  164. */
  165. fpsize = 1;
  166. allocl = 2;
  167. l = 1;
  168. *pathp = '\0';
  169. } else {
  170. /* account for '/' and path size minus terminal 0
  171. * already in 'l'
  172. */
  173. fpsize += l;
  174. allocl = fpsize;
  175. }
  176. }
  177. np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl,
  178. __alignof__(struct device_node));
  179. if (allnextpp) {
  180. char *fn;
  181. memset(np, 0, sizeof(*np));
  182. np->full_name = fn = ((char *)np) + sizeof(*np);
  183. if (new_format) {
  184. /* rebuild full path for new format */
  185. if (dad && dad->parent) {
  186. strcpy(fn, dad->full_name);
  187. #ifdef DEBUG
  188. if ((strlen(fn) + l + 1) != allocl) {
  189. pr_debug("%s: p: %d, l: %d, a: %d\n",
  190. pathp, (int)strlen(fn),
  191. l, allocl);
  192. }
  193. #endif
  194. fn += strlen(fn);
  195. }
  196. *(fn++) = '/';
  197. }
  198. memcpy(fn, pathp, l);
  199. prev_pp = &np->properties;
  200. **allnextpp = np;
  201. *allnextpp = &np->allnext;
  202. if (dad != NULL) {
  203. np->parent = dad;
  204. /* we temporarily use the next field as `last_child'*/
  205. if (dad->next == NULL)
  206. dad->child = np;
  207. else
  208. dad->next->sibling = np;
  209. dad->next = np;
  210. }
  211. kref_init(&np->kref);
  212. }
  213. /* process properties */
  214. while (1) {
  215. u32 sz, noff;
  216. char *pname;
  217. tag = be32_to_cpup((__be32 *)(*p));
  218. if (tag == OF_DT_NOP) {
  219. *p += 4;
  220. continue;
  221. }
  222. if (tag != OF_DT_PROP)
  223. break;
  224. *p += 4;
  225. sz = be32_to_cpup((__be32 *)(*p));
  226. noff = be32_to_cpup((__be32 *)((*p) + 4));
  227. *p += 8;
  228. if (be32_to_cpu(blob->version) < 0x10)
  229. *p = ALIGN(*p, sz >= 8 ? 8 : 4);
  230. pname = of_fdt_get_string(blob, noff);
  231. if (pname == NULL) {
  232. pr_info("Can't find property name in list !\n");
  233. break;
  234. }
  235. if (strcmp(pname, "name") == 0)
  236. has_name = 1;
  237. l = strlen(pname) + 1;
  238. pp = unflatten_dt_alloc(&mem, sizeof(struct property),
  239. __alignof__(struct property));
  240. if (allnextpp) {
  241. /* We accept flattened tree phandles either in
  242. * ePAPR-style "phandle" properties, or the
  243. * legacy "linux,phandle" properties. If both
  244. * appear and have different values, things
  245. * will get weird. Don't do that. */
  246. if ((strcmp(pname, "phandle") == 0) ||
  247. (strcmp(pname, "linux,phandle") == 0)) {
  248. if (np->phandle == 0)
  249. np->phandle = be32_to_cpup((__be32*)*p);
  250. }
  251. /* And we process the "ibm,phandle" property
  252. * used in pSeries dynamic device tree
  253. * stuff */
  254. if (strcmp(pname, "ibm,phandle") == 0)
  255. np->phandle = be32_to_cpup((__be32 *)*p);
  256. pp->name = pname;
  257. pp->length = sz;
  258. pp->value = (void *)*p;
  259. *prev_pp = pp;
  260. prev_pp = &pp->next;
  261. }
  262. *p = ALIGN((*p) + sz, 4);
  263. }
  264. /* with version 0x10 we may not have the name property, recreate
  265. * it here from the unit name if absent
  266. */
  267. if (!has_name) {
  268. char *p1 = pathp, *ps = pathp, *pa = NULL;
  269. int sz;
  270. while (*p1) {
  271. if ((*p1) == '@')
  272. pa = p1;
  273. if ((*p1) == '/')
  274. ps = p1 + 1;
  275. p1++;
  276. }
  277. if (pa < ps)
  278. pa = p1;
  279. sz = (pa - ps) + 1;
  280. pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz,
  281. __alignof__(struct property));
  282. if (allnextpp) {
  283. pp->name = "name";
  284. pp->length = sz;
  285. pp->value = pp + 1;
  286. *prev_pp = pp;
  287. prev_pp = &pp->next;
  288. memcpy(pp->value, ps, sz - 1);
  289. ((char *)pp->value)[sz - 1] = 0;
  290. pr_debug("fixed up name for %s -> %s\n", pathp,
  291. (char *)pp->value);
  292. }
  293. }
  294. if (allnextpp) {
  295. *prev_pp = NULL;
  296. np->name = of_get_property(np, "name", NULL);
  297. np->type = of_get_property(np, "device_type", NULL);
  298. if (!np->name)
  299. np->name = "<NULL>";
  300. if (!np->type)
  301. np->type = "<NULL>";
  302. }
  303. while (tag == OF_DT_BEGIN_NODE || tag == OF_DT_NOP) {
  304. if (tag == OF_DT_NOP)
  305. *p += 4;
  306. else
  307. mem = unflatten_dt_node(blob, mem, p, np, allnextpp,
  308. fpsize);
  309. tag = be32_to_cpup((__be32 *)(*p));
  310. }
  311. if (tag != OF_DT_END_NODE) {
  312. pr_err("Weird tag at end of node: %x\n", tag);
  313. return mem;
  314. }
  315. *p += 4;
  316. return mem;
  317. }
  318. /**
  319. * __unflatten_device_tree - create tree of device_nodes from flat blob
  320. *
  321. * unflattens a device-tree, creating the
  322. * tree of struct device_node. It also fills the "name" and "type"
  323. * pointers of the nodes so the normal device-tree walking functions
  324. * can be used.
  325. * @blob: The blob to expand
  326. * @mynodes: The device_node tree created by the call
  327. * @dt_alloc: An allocator that provides a virtual address to memory
  328. * for the resulting tree
  329. */
  330. static void __unflatten_device_tree(struct boot_param_header *blob,
  331. struct device_node **mynodes,
  332. void * (*dt_alloc)(u64 size, u64 align))
  333. {
  334. unsigned long start, mem, size;
  335. struct device_node **allnextp = mynodes;
  336. pr_debug(" -> unflatten_device_tree()\n");
  337. if (!blob) {
  338. pr_debug("No device tree pointer\n");
  339. return;
  340. }
  341. pr_debug("Unflattening device tree:\n");
  342. pr_debug("magic: %08x\n", be32_to_cpu(blob->magic));
  343. pr_debug("size: %08x\n", be32_to_cpu(blob->totalsize));
  344. pr_debug("version: %08x\n", be32_to_cpu(blob->version));
  345. if (be32_to_cpu(blob->magic) != OF_DT_HEADER) {
  346. pr_err("Invalid device tree blob header\n");
  347. return;
  348. }
  349. /* First pass, scan for size */
  350. start = ((unsigned long)blob) +
  351. be32_to_cpu(blob->off_dt_struct);
  352. size = unflatten_dt_node(blob, 0, &start, NULL, NULL, 0);
  353. size = (size | 3) + 1;
  354. pr_debug(" size is %lx, allocating...\n", size);
  355. /* Allocate memory for the expanded device tree */
  356. mem = (unsigned long)
  357. dt_alloc(size + 4, __alignof__(struct device_node));
  358. ((__be32 *)mem)[size / 4] = cpu_to_be32(0xdeadbeef);
  359. pr_debug(" unflattening %lx...\n", mem);
  360. /* Second pass, do actual unflattening */
  361. start = ((unsigned long)blob) +
  362. be32_to_cpu(blob->off_dt_struct);
  363. unflatten_dt_node(blob, mem, &start, NULL, &allnextp, 0);
  364. if (be32_to_cpup((__be32 *)start) != OF_DT_END)
  365. pr_warning("Weird tag at end of tree: %08x\n", *((u32 *)start));
  366. if (be32_to_cpu(((__be32 *)mem)[size / 4]) != 0xdeadbeef)
  367. pr_warning("End of tree marker overwritten: %08x\n",
  368. be32_to_cpu(((__be32 *)mem)[size / 4]));
  369. *allnextp = NULL;
  370. pr_debug(" <- unflatten_device_tree()\n");
  371. }
  372. static void *kernel_tree_alloc(u64 size, u64 align)
  373. {
  374. return kzalloc(size, GFP_KERNEL);
  375. }
  376. /**
  377. * of_fdt_unflatten_tree - create tree of device_nodes from flat blob
  378. *
  379. * unflattens the device-tree passed by the firmware, creating the
  380. * tree of struct device_node. It also fills the "name" and "type"
  381. * pointers of the nodes so the normal device-tree walking functions
  382. * can be used.
  383. */
  384. void of_fdt_unflatten_tree(unsigned long *blob,
  385. struct device_node **mynodes)
  386. {
  387. struct boot_param_header *device_tree =
  388. (struct boot_param_header *)blob;
  389. __unflatten_device_tree(device_tree, mynodes, &kernel_tree_alloc);
  390. }
  391. EXPORT_SYMBOL_GPL(of_fdt_unflatten_tree);
  392. /* Everything below here references initial_boot_params directly. */
  393. int __initdata dt_root_addr_cells;
  394. int __initdata dt_root_size_cells;
  395. struct boot_param_header *initial_boot_params;
  396. #ifdef CONFIG_OF_EARLY_FLATTREE
  397. /**
  398. * of_scan_flat_dt - scan flattened tree blob and call callback on each.
  399. * @it: callback function
  400. * @data: context data pointer
  401. *
  402. * This function is used to scan the flattened device-tree, it is
  403. * used to extract the memory information at boot before we can
  404. * unflatten the tree
  405. */
  406. int __init of_scan_flat_dt(int (*it)(unsigned long node,
  407. const char *uname, int depth,
  408. void *data),
  409. void *data)
  410. {
  411. unsigned long p = ((unsigned long)initial_boot_params) +
  412. be32_to_cpu(initial_boot_params->off_dt_struct);
  413. int rc = 0;
  414. int depth = -1;
  415. do {
  416. u32 tag = be32_to_cpup((__be32 *)p);
  417. const char *pathp;
  418. p += 4;
  419. if (tag == OF_DT_END_NODE) {
  420. depth--;
  421. continue;
  422. }
  423. if (tag == OF_DT_NOP)
  424. continue;
  425. if (tag == OF_DT_END)
  426. break;
  427. if (tag == OF_DT_PROP) {
  428. u32 sz = be32_to_cpup((__be32 *)p);
  429. p += 8;
  430. if (be32_to_cpu(initial_boot_params->version) < 0x10)
  431. p = ALIGN(p, sz >= 8 ? 8 : 4);
  432. p += sz;
  433. p = ALIGN(p, 4);
  434. continue;
  435. }
  436. if (tag != OF_DT_BEGIN_NODE) {
  437. pr_err("Invalid tag %x in flat device tree!\n", tag);
  438. return -EINVAL;
  439. }
  440. depth++;
  441. pathp = (char *)p;
  442. p = ALIGN(p + strlen(pathp) + 1, 4);
  443. if (*pathp == '/')
  444. pathp = kbasename(pathp);
  445. rc = it(p, pathp, depth, data);
  446. if (rc != 0)
  447. break;
  448. } while (1);
  449. return rc;
  450. }
  451. /**
  452. * of_get_flat_dt_root - find the root node in the flat blob
  453. */
  454. unsigned long __init of_get_flat_dt_root(void)
  455. {
  456. unsigned long p = ((unsigned long)initial_boot_params) +
  457. be32_to_cpu(initial_boot_params->off_dt_struct);
  458. while (be32_to_cpup((__be32 *)p) == OF_DT_NOP)
  459. p += 4;
  460. BUG_ON(be32_to_cpup((__be32 *)p) != OF_DT_BEGIN_NODE);
  461. p += 4;
  462. return ALIGN(p + strlen((char *)p) + 1, 4);
  463. }
  464. /**
  465. * of_get_flat_dt_prop - Given a node in the flat blob, return the property ptr
  466. *
  467. * This function can be used within scan_flattened_dt callback to get
  468. * access to properties
  469. */
  470. void *__init of_get_flat_dt_prop(unsigned long node, const char *name,
  471. unsigned long *size)
  472. {
  473. return of_fdt_get_property(initial_boot_params, node, name, size);
  474. }
  475. /**
  476. * of_flat_dt_is_compatible - Return true if given node has compat in compatible list
  477. * @node: node to test
  478. * @compat: compatible string to compare with compatible list.
  479. */
  480. int __init of_flat_dt_is_compatible(unsigned long node, const char *compat)
  481. {
  482. return of_fdt_is_compatible(initial_boot_params, node, compat);
  483. }
  484. /**
  485. * of_flat_dt_match - Return true if node matches a list of compatible values
  486. */
  487. int __init of_flat_dt_match(unsigned long node, const char *const *compat)
  488. {
  489. return of_fdt_match(initial_boot_params, node, compat);
  490. }
  491. struct fdt_scan_status {
  492. const char *name;
  493. int namelen;
  494. int depth;
  495. int found;
  496. int (*iterator)(unsigned long node, const char *uname, int depth, void *data);
  497. void *data;
  498. };
  499. /**
  500. * fdt_scan_node_by_path - iterator for of_scan_flat_dt_by_path function
  501. */
  502. static int __init fdt_scan_node_by_path(unsigned long node, const char *uname,
  503. int depth, void *data)
  504. {
  505. struct fdt_scan_status *st = data;
  506. /*
  507. * if scan at the requested fdt node has been completed,
  508. * return -ENXIO to abort further scanning
  509. */
  510. if (depth <= st->depth)
  511. return -ENXIO;
  512. /* requested fdt node has been found, so call iterator function */
  513. if (st->found)
  514. return st->iterator(node, uname, depth, st->data);
  515. /* check if scanning automata is entering next level of fdt nodes */
  516. if (depth == st->depth + 1 &&
  517. strncmp(st->name, uname, st->namelen) == 0 &&
  518. uname[st->namelen] == 0) {
  519. st->depth += 1;
  520. if (st->name[st->namelen] == 0) {
  521. st->found = 1;
  522. } else {
  523. const char *next = st->name + st->namelen + 1;
  524. st->name = next;
  525. st->namelen = strcspn(next, "/");
  526. }
  527. return 0;
  528. }
  529. /* scan next fdt node */
  530. return 0;
  531. }
  532. /**
  533. * of_scan_flat_dt_by_path - scan flattened tree blob and call callback on each
  534. * child of the given path.
  535. * @path: path to start searching for children
  536. * @it: callback function
  537. * @data: context data pointer
  538. *
  539. * This function is used to scan the flattened device-tree starting from the
  540. * node given by path. It is used to extract information (like reserved
  541. * memory), which is required on ealy boot before we can unflatten the tree.
  542. */
  543. int __init of_scan_flat_dt_by_path(const char *path,
  544. int (*it)(unsigned long node, const char *name, int depth, void *data),
  545. void *data)
  546. {
  547. struct fdt_scan_status st = {path, 0, -1, 0, it, data};
  548. int ret = 0;
  549. if (initial_boot_params)
  550. ret = of_scan_flat_dt(fdt_scan_node_by_path, &st);
  551. if (!st.found)
  552. return -ENOENT;
  553. else if (ret == -ENXIO) /* scan has been completed */
  554. return 0;
  555. else
  556. return ret;
  557. }
  558. #ifdef CONFIG_BLK_DEV_INITRD
  559. /**
  560. * early_init_dt_check_for_initrd - Decode initrd location from flat tree
  561. * @node: reference to node containing initrd location ('chosen')
  562. */
  563. void __init early_init_dt_check_for_initrd(unsigned long node)
  564. {
  565. unsigned long start, end, len;
  566. __be32 *prop;
  567. pr_debug("Looking for initrd properties... ");
  568. prop = of_get_flat_dt_prop(node, "linux,initrd-start", &len);
  569. if (!prop)
  570. return;
  571. start = of_read_ulong(prop, len/4);
  572. prop = of_get_flat_dt_prop(node, "linux,initrd-end", &len);
  573. if (!prop)
  574. return;
  575. end = of_read_ulong(prop, len/4);
  576. early_init_dt_setup_initrd_arch(start, end);
  577. pr_debug("initrd_start=0x%lx initrd_end=0x%lx\n", start, end);
  578. }
  579. #else
  580. inline void early_init_dt_check_for_initrd(unsigned long node)
  581. {
  582. }
  583. #endif /* CONFIG_BLK_DEV_INITRD */
  584. /**
  585. * early_init_dt_scan_root - fetch the top level address and size cells
  586. */
  587. int __init early_init_dt_scan_root(unsigned long node, const char *uname,
  588. int depth, void *data)
  589. {
  590. __be32 *prop;
  591. if (depth != 0)
  592. return 0;
  593. dt_root_size_cells = OF_ROOT_NODE_SIZE_CELLS_DEFAULT;
  594. dt_root_addr_cells = OF_ROOT_NODE_ADDR_CELLS_DEFAULT;
  595. prop = of_get_flat_dt_prop(node, "#size-cells", NULL);
  596. if (prop)
  597. dt_root_size_cells = be32_to_cpup(prop);
  598. pr_debug("dt_root_size_cells = %x\n", dt_root_size_cells);
  599. prop = of_get_flat_dt_prop(node, "#address-cells", NULL);
  600. if (prop)
  601. dt_root_addr_cells = be32_to_cpup(prop);
  602. pr_debug("dt_root_addr_cells = %x\n", dt_root_addr_cells);
  603. /* break now */
  604. return 1;
  605. }
  606. u64 __init dt_mem_next_cell(int s, __be32 **cellp)
  607. {
  608. __be32 *p = *cellp;
  609. *cellp = p + s;
  610. return of_read_number(p, s);
  611. }
  612. /**
  613. * early_init_dt_scan_memory - Look for an parse memory nodes
  614. */
  615. int __init early_init_dt_scan_memory(unsigned long node, const char *uname,
  616. int depth, void *data)
  617. {
  618. char *type = of_get_flat_dt_prop(node, "device_type", NULL);
  619. __be32 *reg, *endp;
  620. unsigned long l;
  621. /* We are scanning "memory" nodes only */
  622. if (type == NULL) {
  623. /*
  624. * The longtrail doesn't have a device_type on the
  625. * /memory node, so look for the node called /memory@0.
  626. */
  627. if (depth != 1 || strcmp(uname, "memory@0") != 0)
  628. return 0;
  629. } else if (strcmp(type, "memory") != 0)
  630. return 0;
  631. reg = of_get_flat_dt_prop(node, "linux,usable-memory", &l);
  632. if (reg == NULL)
  633. reg = of_get_flat_dt_prop(node, "reg", &l);
  634. if (reg == NULL)
  635. return 0;
  636. endp = reg + (l / sizeof(__be32));
  637. pr_debug("memory scan node %s, reg size %ld, data: %x %x %x %x,\n",
  638. uname, l, reg[0], reg[1], reg[2], reg[3]);
  639. while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) {
  640. u64 base, size;
  641. base = dt_mem_next_cell(dt_root_addr_cells, &reg);
  642. size = dt_mem_next_cell(dt_root_size_cells, &reg);
  643. if (size == 0)
  644. continue;
  645. pr_debug(" - %llx , %llx\n", (unsigned long long)base,
  646. (unsigned long long)size);
  647. early_init_dt_add_memory_arch(base, size);
  648. }
  649. return 0;
  650. }
  651. int __init early_init_dt_scan_chosen(unsigned long node, const char *uname,
  652. int depth, void *data)
  653. {
  654. unsigned long l;
  655. char *p;
  656. pr_debug("search \"chosen\", depth: %d, uname: %s\n", depth, uname);
  657. if (depth != 1 || !data ||
  658. (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0))
  659. return 0;
  660. early_init_dt_check_for_initrd(node);
  661. /* Retrieve command line */
  662. p = of_get_flat_dt_prop(node, "bootargs", &l);
  663. if (p != NULL && l > 0)
  664. strlcpy(data, p, min((int)l, COMMAND_LINE_SIZE));
  665. /*
  666. * CONFIG_CMDLINE is meant to be a default in case nothing else
  667. * managed to set the command line, unless CONFIG_CMDLINE_FORCE
  668. * is set in which case we override whatever was found earlier.
  669. */
  670. #ifdef CONFIG_CMDLINE
  671. #ifndef CONFIG_CMDLINE_FORCE
  672. if (!((char *)data)[0])
  673. #endif
  674. strlcpy(data, CONFIG_CMDLINE, COMMAND_LINE_SIZE);
  675. #endif /* CONFIG_CMDLINE */
  676. pr_debug("Command line is: %s\n", (char*)data);
  677. /* break now */
  678. return 1;
  679. }
  680. /**
  681. * unflatten_device_tree - create tree of device_nodes from flat blob
  682. *
  683. * unflattens the device-tree passed by the firmware, creating the
  684. * tree of struct device_node. It also fills the "name" and "type"
  685. * pointers of the nodes so the normal device-tree walking functions
  686. * can be used.
  687. */
  688. void __init unflatten_device_tree(void)
  689. {
  690. __unflatten_device_tree(initial_boot_params, &of_allnodes,
  691. early_init_dt_alloc_memory_arch);
  692. /* Get pointer to "/chosen" and "/aliases" nodes for use everywhere */
  693. of_alias_scan(early_init_dt_alloc_memory_arch);
  694. }
  695. #endif /* CONFIG_OF_EARLY_FLATTREE */