fdtdec.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502
  1. /*
  2. * Copyright (c) 2011 The Chromium OS Authors.
  3. * See file CREDITS for list of people who contributed to this
  4. * project.
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License as
  8. * published by the Free Software Foundation; either version 2 of
  9. * the License, or (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
  19. * MA 02111-1307 USA
  20. */
  21. #include <common.h>
  22. #include <serial.h>
  23. #include <libfdt.h>
  24. #include <fdtdec.h>
  25. #include <asm/gpio.h>
  26. DECLARE_GLOBAL_DATA_PTR;
  27. /*
  28. * Here are the type we know about. One day we might allow drivers to
  29. * register. For now we just put them here. The COMPAT macro allows us to
  30. * turn this into a sparse list later, and keeps the ID with the name.
  31. */
  32. #define COMPAT(id, name) name
  33. static const char * const compat_names[COMPAT_COUNT] = {
  34. COMPAT(UNKNOWN, "<none>"),
  35. COMPAT(NVIDIA_TEGRA20_USB, "nvidia,tegra20-ehci"),
  36. COMPAT(NVIDIA_TEGRA20_I2C, "nvidia,tegra20-i2c"),
  37. COMPAT(NVIDIA_TEGRA20_DVC, "nvidia,tegra20-i2c-dvc"),
  38. COMPAT(NVIDIA_TEGRA20_EMC, "nvidia,tegra20-emc"),
  39. COMPAT(NVIDIA_TEGRA20_EMC_TABLE, "nvidia,tegra20-emc-table"),
  40. COMPAT(NVIDIA_TEGRA20_KBC, "nvidia,tegra20-kbc"),
  41. };
  42. const char *fdtdec_get_compatible(enum fdt_compat_id id)
  43. {
  44. /* We allow reading of the 'unknown' ID for testing purposes */
  45. assert(id >= 0 && id < COMPAT_COUNT);
  46. return compat_names[id];
  47. }
  48. /**
  49. * Look in the FDT for an alias with the given name and return its node.
  50. *
  51. * @param blob FDT blob
  52. * @param name alias name to look up
  53. * @return node offset if found, or an error code < 0 otherwise
  54. */
  55. static int find_alias_node(const void *blob, const char *name)
  56. {
  57. const char *path;
  58. int alias_node;
  59. debug("find_alias_node: %s\n", name);
  60. alias_node = fdt_path_offset(blob, "/aliases");
  61. if (alias_node < 0)
  62. return alias_node;
  63. path = fdt_getprop(blob, alias_node, name, NULL);
  64. if (!path)
  65. return -FDT_ERR_NOTFOUND;
  66. return fdt_path_offset(blob, path);
  67. }
  68. fdt_addr_t fdtdec_get_addr(const void *blob, int node,
  69. const char *prop_name)
  70. {
  71. const fdt_addr_t *cell;
  72. int len;
  73. debug("get_addr: %s\n", prop_name);
  74. cell = fdt_getprop(blob, node, prop_name, &len);
  75. if (cell && (len == sizeof(fdt_addr_t) ||
  76. len == sizeof(fdt_addr_t) * 2))
  77. return fdt_addr_to_cpu(*cell);
  78. return FDT_ADDR_T_NONE;
  79. }
  80. s32 fdtdec_get_int(const void *blob, int node, const char *prop_name,
  81. s32 default_val)
  82. {
  83. const s32 *cell;
  84. int len;
  85. debug("get_size: %s\n", prop_name);
  86. cell = fdt_getprop(blob, node, prop_name, &len);
  87. if (cell && len >= sizeof(s32))
  88. return fdt32_to_cpu(cell[0]);
  89. return default_val;
  90. }
  91. int fdtdec_get_is_enabled(const void *blob, int node)
  92. {
  93. const char *cell;
  94. /*
  95. * It should say "okay", so only allow that. Some fdts use "ok" but
  96. * this is a bug. Please fix your device tree source file. See here
  97. * for discussion:
  98. *
  99. * http://www.mail-archive.com/u-boot@lists.denx.de/msg71598.html
  100. */
  101. cell = fdt_getprop(blob, node, "status", NULL);
  102. if (cell)
  103. return 0 == strcmp(cell, "okay");
  104. return 1;
  105. }
  106. enum fdt_compat_id fd_dec_lookup(const void *blob, int node)
  107. {
  108. enum fdt_compat_id id;
  109. /* Search our drivers */
  110. for (id = COMPAT_UNKNOWN; id < COMPAT_COUNT; id++)
  111. if (0 == fdt_node_check_compatible(blob, node,
  112. compat_names[id]))
  113. return id;
  114. return COMPAT_UNKNOWN;
  115. }
  116. int fdtdec_next_compatible(const void *blob, int node,
  117. enum fdt_compat_id id)
  118. {
  119. return fdt_node_offset_by_compatible(blob, node, compat_names[id]);
  120. }
  121. int fdtdec_next_compatible_subnode(const void *blob, int node,
  122. enum fdt_compat_id id, int *depthp)
  123. {
  124. do {
  125. node = fdt_next_node(blob, node, depthp);
  126. } while (*depthp > 1);
  127. /* If this is a direct subnode, and compatible, return it */
  128. if (*depthp == 1 && 0 == fdt_node_check_compatible(
  129. blob, node, compat_names[id]))
  130. return node;
  131. return -FDT_ERR_NOTFOUND;
  132. }
  133. int fdtdec_next_alias(const void *blob, const char *name,
  134. enum fdt_compat_id id, int *upto)
  135. {
  136. #define MAX_STR_LEN 20
  137. char str[MAX_STR_LEN + 20];
  138. int node, err;
  139. /* snprintf() is not available */
  140. assert(strlen(name) < MAX_STR_LEN);
  141. sprintf(str, "%.*s%d", MAX_STR_LEN, name, *upto);
  142. node = find_alias_node(blob, str);
  143. if (node < 0)
  144. return node;
  145. err = fdt_node_check_compatible(blob, node, compat_names[id]);
  146. if (err < 0)
  147. return err;
  148. if (err)
  149. return -FDT_ERR_NOTFOUND;
  150. (*upto)++;
  151. return node;
  152. }
  153. int fdtdec_find_aliases_for_id(const void *blob, const char *name,
  154. enum fdt_compat_id id, int *node_list, int maxcount)
  155. {
  156. memset(node_list, '\0', sizeof(*node_list) * maxcount);
  157. return fdtdec_add_aliases_for_id(blob, name, id, node_list, maxcount);
  158. }
  159. /* TODO: Can we tighten this code up a little? */
  160. int fdtdec_add_aliases_for_id(const void *blob, const char *name,
  161. enum fdt_compat_id id, int *node_list, int maxcount)
  162. {
  163. int name_len = strlen(name);
  164. int nodes[maxcount];
  165. int num_found = 0;
  166. int offset, node;
  167. int alias_node;
  168. int count;
  169. int i, j;
  170. /* find the alias node if present */
  171. alias_node = fdt_path_offset(blob, "/aliases");
  172. /*
  173. * start with nothing, and we can assume that the root node can't
  174. * match
  175. */
  176. memset(nodes, '\0', sizeof(nodes));
  177. /* First find all the compatible nodes */
  178. for (node = count = 0; node >= 0 && count < maxcount;) {
  179. node = fdtdec_next_compatible(blob, node, id);
  180. if (node >= 0)
  181. nodes[count++] = node;
  182. }
  183. if (node >= 0)
  184. debug("%s: warning: maxcount exceeded with alias '%s'\n",
  185. __func__, name);
  186. /* Now find all the aliases */
  187. for (offset = fdt_first_property_offset(blob, alias_node);
  188. offset > 0;
  189. offset = fdt_next_property_offset(blob, offset)) {
  190. const struct fdt_property *prop;
  191. const char *path;
  192. int number;
  193. int found;
  194. node = 0;
  195. prop = fdt_get_property_by_offset(blob, offset, NULL);
  196. path = fdt_string(blob, fdt32_to_cpu(prop->nameoff));
  197. if (prop->len && 0 == strncmp(path, name, name_len))
  198. node = fdt_path_offset(blob, prop->data);
  199. if (node <= 0)
  200. continue;
  201. /* Get the alias number */
  202. number = simple_strtoul(path + name_len, NULL, 10);
  203. if (number < 0 || number >= maxcount) {
  204. debug("%s: warning: alias '%s' is out of range\n",
  205. __func__, path);
  206. continue;
  207. }
  208. /* Make sure the node we found is actually in our list! */
  209. found = -1;
  210. for (j = 0; j < count; j++)
  211. if (nodes[j] == node) {
  212. found = j;
  213. break;
  214. }
  215. if (found == -1) {
  216. debug("%s: warning: alias '%s' points to a node "
  217. "'%s' that is missing or is not compatible "
  218. " with '%s'\n", __func__, path,
  219. fdt_get_name(blob, node, NULL),
  220. compat_names[id]);
  221. continue;
  222. }
  223. /*
  224. * Add this node to our list in the right place, and mark
  225. * it as done.
  226. */
  227. if (fdtdec_get_is_enabled(blob, node)) {
  228. if (node_list[number]) {
  229. debug("%s: warning: alias '%s' requires that "
  230. "a node be placed in the list in a "
  231. "position which is already filled by "
  232. "node '%s'\n", __func__, path,
  233. fdt_get_name(blob, node, NULL));
  234. continue;
  235. }
  236. node_list[number] = node;
  237. if (number >= num_found)
  238. num_found = number + 1;
  239. }
  240. nodes[found] = 0;
  241. }
  242. /* Add any nodes not mentioned by an alias */
  243. for (i = j = 0; i < maxcount; i++) {
  244. if (!node_list[i]) {
  245. for (; j < maxcount; j++)
  246. if (nodes[j] &&
  247. fdtdec_get_is_enabled(blob, nodes[j]))
  248. break;
  249. /* Have we run out of nodes to add? */
  250. if (j == maxcount)
  251. break;
  252. assert(!node_list[i]);
  253. node_list[i] = nodes[j++];
  254. if (i >= num_found)
  255. num_found = i + 1;
  256. }
  257. }
  258. return num_found;
  259. }
  260. int fdtdec_check_fdt(void)
  261. {
  262. /*
  263. * We must have an FDT, but we cannot panic() yet since the console
  264. * is not ready. So for now, just assert(). Boards which need an early
  265. * FDT (prior to console ready) will need to make their own
  266. * arrangements and do their own checks.
  267. */
  268. assert(!fdtdec_prepare_fdt());
  269. return 0;
  270. }
  271. /*
  272. * This function is a little odd in that it accesses global data. At some
  273. * point if the architecture board.c files merge this will make more sense.
  274. * Even now, it is common code.
  275. */
  276. int fdtdec_prepare_fdt(void)
  277. {
  278. if (((uintptr_t)gd->fdt_blob & 3) || fdt_check_header(gd->fdt_blob)) {
  279. printf("No valid FDT found - please append one to U-Boot "
  280. "binary, use u-boot-dtb.bin or define "
  281. "CONFIG_OF_EMBED\n");
  282. return -1;
  283. }
  284. return 0;
  285. }
  286. int fdtdec_lookup_phandle(const void *blob, int node, const char *prop_name)
  287. {
  288. const u32 *phandle;
  289. int lookup;
  290. phandle = fdt_getprop(blob, node, prop_name, NULL);
  291. if (!phandle)
  292. return -FDT_ERR_NOTFOUND;
  293. lookup = fdt_node_offset_by_phandle(blob, fdt32_to_cpu(*phandle));
  294. return lookup;
  295. }
  296. /**
  297. * Look up a property in a node and check that it has a minimum length.
  298. *
  299. * @param blob FDT blob
  300. * @param node node to examine
  301. * @param prop_name name of property to find
  302. * @param min_len minimum property length in bytes
  303. * @param err 0 if ok, or -FDT_ERR_NOTFOUND if the property is not
  304. found, or -FDT_ERR_BADLAYOUT if not enough data
  305. * @return pointer to cell, which is only valid if err == 0
  306. */
  307. static const void *get_prop_check_min_len(const void *blob, int node,
  308. const char *prop_name, int min_len, int *err)
  309. {
  310. const void *cell;
  311. int len;
  312. debug("%s: %s\n", __func__, prop_name);
  313. cell = fdt_getprop(blob, node, prop_name, &len);
  314. if (!cell)
  315. *err = -FDT_ERR_NOTFOUND;
  316. else if (len < min_len)
  317. *err = -FDT_ERR_BADLAYOUT;
  318. else
  319. *err = 0;
  320. return cell;
  321. }
  322. int fdtdec_get_int_array(const void *blob, int node, const char *prop_name,
  323. u32 *array, int count)
  324. {
  325. const u32 *cell;
  326. int i, err = 0;
  327. debug("%s: %s\n", __func__, prop_name);
  328. cell = get_prop_check_min_len(blob, node, prop_name,
  329. sizeof(u32) * count, &err);
  330. if (!err) {
  331. for (i = 0; i < count; i++)
  332. array[i] = fdt32_to_cpu(cell[i]);
  333. }
  334. return err;
  335. }
  336. const u32 *fdtdec_locate_array(const void *blob, int node,
  337. const char *prop_name, int count)
  338. {
  339. const u32 *cell;
  340. int err;
  341. cell = get_prop_check_min_len(blob, node, prop_name,
  342. sizeof(u32) * count, &err);
  343. return err ? NULL : cell;
  344. }
  345. int fdtdec_get_bool(const void *blob, int node, const char *prop_name)
  346. {
  347. const s32 *cell;
  348. int len;
  349. debug("%s: %s\n", __func__, prop_name);
  350. cell = fdt_getprop(blob, node, prop_name, &len);
  351. return cell != NULL;
  352. }
  353. /**
  354. * Decode a list of GPIOs from an FDT. This creates a list of GPIOs with no
  355. * terminating item.
  356. *
  357. * @param blob FDT blob to use
  358. * @param node Node to look at
  359. * @param prop_name Node property name
  360. * @param gpio Array of gpio elements to fill from FDT. This will be
  361. * untouched if either 0 or an error is returned
  362. * @param max_count Maximum number of elements allowed
  363. * @return number of GPIOs read if ok, -FDT_ERR_BADLAYOUT if max_count would
  364. * be exceeded, or -FDT_ERR_NOTFOUND if the property is missing.
  365. */
  366. static int fdtdec_decode_gpios(const void *blob, int node,
  367. const char *prop_name, struct fdt_gpio_state *gpio,
  368. int max_count)
  369. {
  370. const struct fdt_property *prop;
  371. const u32 *cell;
  372. const char *name;
  373. int len, i;
  374. debug("%s: %s\n", __func__, prop_name);
  375. assert(max_count > 0);
  376. prop = fdt_get_property(blob, node, prop_name, &len);
  377. if (!prop) {
  378. debug("FDT: %s: property '%s' missing\n", __func__, prop_name);
  379. return -FDT_ERR_NOTFOUND;
  380. }
  381. /* We will use the name to tag the GPIO */
  382. name = fdt_string(blob, fdt32_to_cpu(prop->nameoff));
  383. cell = (u32 *)prop->data;
  384. len /= sizeof(u32) * 3; /* 3 cells per GPIO record */
  385. if (len > max_count) {
  386. debug("FDT: %s: too many GPIOs / cells for "
  387. "property '%s'\n", __func__, prop_name);
  388. return -FDT_ERR_BADLAYOUT;
  389. }
  390. /* Read out the GPIO data from the cells */
  391. for (i = 0; i < len; i++, cell += 3) {
  392. gpio[i].gpio = fdt32_to_cpu(cell[1]);
  393. gpio[i].flags = fdt32_to_cpu(cell[2]);
  394. gpio[i].name = name;
  395. }
  396. return len;
  397. }
  398. int fdtdec_decode_gpio(const void *blob, int node, const char *prop_name,
  399. struct fdt_gpio_state *gpio)
  400. {
  401. int err;
  402. debug("%s: %s\n", __func__, prop_name);
  403. gpio->gpio = FDT_GPIO_NONE;
  404. gpio->name = NULL;
  405. err = fdtdec_decode_gpios(blob, node, prop_name, gpio, 1);
  406. return err == 1 ? 0 : err;
  407. }
  408. int fdtdec_setup_gpio(struct fdt_gpio_state *gpio)
  409. {
  410. /*
  411. * Return success if there is no GPIO defined. This is used for
  412. * optional GPIOs)
  413. */
  414. if (!fdt_gpio_isvalid(gpio))
  415. return 0;
  416. if (gpio_request(gpio->gpio, gpio->name))
  417. return -1;
  418. return 0;
  419. }
  420. int fdtdec_get_byte_array(const void *blob, int node, const char *prop_name,
  421. u8 *array, int count)
  422. {
  423. const u8 *cell;
  424. int err;
  425. cell = get_prop_check_min_len(blob, node, prop_name, count, &err);
  426. if (!err)
  427. memcpy(array, cell, count);
  428. return err;
  429. }
  430. const u8 *fdtdec_locate_byte_array(const void *blob, int node,
  431. const char *prop_name, int count)
  432. {
  433. const u8 *cell;
  434. int err;
  435. cell = get_prop_check_min_len(blob, node, prop_name, count, &err);
  436. if (err)
  437. return NULL;
  438. return cell;
  439. }