devtree.c 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338
  1. /*
  2. * devtree.c - convenience functions for device tree manipulation
  3. * Copyright 2007 David Gibson, IBM Corporation.
  4. * Copyright (c) 2007 Freescale Semiconductor, Inc.
  5. *
  6. * Authors: David Gibson <david@gibson.dropbear.id.au>
  7. * Scott Wood <scottwood@freescale.com>
  8. *
  9. * This program is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU General Public License
  11. * as published by the Free Software Foundation; either version
  12. * 2 of the License, or (at your option) any later version.
  13. */
  14. #include <stdarg.h>
  15. #include <stddef.h>
  16. #include "types.h"
  17. #include "string.h"
  18. #include "stdio.h"
  19. #include "ops.h"
  20. void dt_fixup_memory(u64 start, u64 size)
  21. {
  22. void *root, *memory;
  23. int naddr, nsize, i;
  24. u32 memreg[4];
  25. root = finddevice("/");
  26. if (getprop(root, "#address-cells", &naddr, sizeof(naddr)) < 0)
  27. naddr = 2;
  28. if (naddr < 1 || naddr > 2)
  29. fatal("Can't cope with #address-cells == %d in /\n\r", naddr);
  30. if (getprop(root, "#size-cells", &nsize, sizeof(nsize)) < 0)
  31. nsize = 1;
  32. if (nsize < 1 || nsize > 2)
  33. fatal("Can't cope with #size-cells == %d in /\n\r", nsize);
  34. i = 0;
  35. if (naddr == 2)
  36. memreg[i++] = start >> 32;
  37. memreg[i++] = start & 0xffffffff;
  38. if (nsize == 2)
  39. memreg[i++] = size >> 32;
  40. memreg[i++] = size & 0xffffffff;
  41. memory = finddevice("/memory");
  42. if (! memory) {
  43. memory = create_node(NULL, "memory");
  44. setprop_str(memory, "device_type", "memory");
  45. }
  46. printf("Memory <- <0x%x", memreg[0]);
  47. for (i = 1; i < (naddr + nsize); i++)
  48. printf(" 0x%x", memreg[i]);
  49. printf("> (%ldMB)\n\r", (unsigned long)(size >> 20));
  50. setprop(memory, "reg", memreg, (naddr + nsize)*sizeof(u32));
  51. }
  52. #define MHZ(x) ((x + 500000) / 1000000)
  53. void dt_fixup_cpu_clocks(u32 cpu, u32 tb, u32 bus)
  54. {
  55. void *devp = NULL;
  56. printf("CPU clock-frequency <- 0x%x (%dMHz)\n\r", cpu, MHZ(cpu));
  57. printf("CPU timebase-frequency <- 0x%x (%dMHz)\n\r", tb, MHZ(tb));
  58. if (bus > 0)
  59. printf("CPU bus-frequency <- 0x%x (%dMHz)\n\r", bus, MHZ(bus));
  60. while ((devp = find_node_by_devtype(devp, "cpu"))) {
  61. setprop_val(devp, "clock-frequency", cpu);
  62. setprop_val(devp, "timebase-frequency", tb);
  63. if (bus > 0)
  64. setprop_val(devp, "bus-frequency", bus);
  65. }
  66. timebase_period_ns = 1000000000 / tb;
  67. }
  68. void dt_fixup_clock(const char *path, u32 freq)
  69. {
  70. void *devp = finddevice(path);
  71. if (devp) {
  72. printf("%s: clock-frequency <- %x (%dMHz)\n\r", path, freq, MHZ(freq));
  73. setprop_val(devp, "clock-frequency", freq);
  74. }
  75. }
  76. void dt_fixup_mac_address(u32 index, const u8 *addr)
  77. {
  78. void *devp = find_node_by_prop_value(NULL, "linux,network-index",
  79. (void*)&index, sizeof(index));
  80. if (devp) {
  81. printf("ENET%d: local-mac-address <-"
  82. " %02x:%02x:%02x:%02x:%02x:%02x\n\r", index,
  83. addr[0], addr[1], addr[2],
  84. addr[3], addr[4], addr[5]);
  85. setprop(devp, "local-mac-address", addr, 6);
  86. }
  87. }
  88. void __dt_fixup_mac_addresses(u32 startindex, ...)
  89. {
  90. va_list ap;
  91. u32 index = startindex;
  92. const u8 *addr;
  93. va_start(ap, startindex);
  94. while ((addr = va_arg(ap, const u8 *)))
  95. dt_fixup_mac_address(index++, addr);
  96. va_end(ap);
  97. }
  98. #define MAX_ADDR_CELLS 4
  99. void dt_get_reg_format(void *node, u32 *naddr, u32 *nsize)
  100. {
  101. if (getprop(node, "#address-cells", naddr, 4) != 4)
  102. *naddr = 2;
  103. if (getprop(node, "#size-cells", nsize, 4) != 4)
  104. *nsize = 1;
  105. }
  106. static void copy_val(u32 *dest, u32 *src, int naddr)
  107. {
  108. int pad = MAX_ADDR_CELLS - naddr;
  109. memset(dest, 0, pad * 4);
  110. memcpy(dest + pad, src, naddr * 4);
  111. }
  112. static int sub_reg(u32 *reg, u32 *sub)
  113. {
  114. int i, borrow = 0;
  115. for (i = MAX_ADDR_CELLS - 1; i >= 0; i--) {
  116. int prev_borrow = borrow;
  117. borrow = reg[i] < sub[i] + prev_borrow;
  118. reg[i] -= sub[i] + prev_borrow;
  119. }
  120. return !borrow;
  121. }
  122. static int add_reg(u32 *reg, u32 *add, int naddr)
  123. {
  124. int i, carry = 0;
  125. for (i = MAX_ADDR_CELLS - 1; i >= MAX_ADDR_CELLS - naddr; i--) {
  126. u64 tmp = (u64)reg[i] + add[i] + carry;
  127. carry = tmp >> 32;
  128. reg[i] = (u32)tmp;
  129. }
  130. return !carry;
  131. }
  132. /* It is assumed that if the first byte of reg fits in a
  133. * range, then the whole reg block fits.
  134. */
  135. static int compare_reg(u32 *reg, u32 *range, u32 *rangesize)
  136. {
  137. int i;
  138. u32 end;
  139. for (i = 0; i < MAX_ADDR_CELLS; i++) {
  140. if (reg[i] < range[i])
  141. return 0;
  142. if (reg[i] > range[i])
  143. break;
  144. }
  145. for (i = 0; i < MAX_ADDR_CELLS; i++) {
  146. end = range[i] + rangesize[i];
  147. if (reg[i] < end)
  148. break;
  149. if (reg[i] > end)
  150. return 0;
  151. }
  152. return reg[i] != end;
  153. }
  154. /* reg must be MAX_ADDR_CELLS */
  155. static int find_range(u32 *reg, u32 *ranges, int nregaddr,
  156. int naddr, int nsize, int buflen)
  157. {
  158. int nrange = nregaddr + naddr + nsize;
  159. int i;
  160. for (i = 0; i + nrange <= buflen; i += nrange) {
  161. u32 range_addr[MAX_ADDR_CELLS];
  162. u32 range_size[MAX_ADDR_CELLS];
  163. copy_val(range_addr, ranges + i, naddr);
  164. copy_val(range_size, ranges + i + nregaddr + naddr, nsize);
  165. if (compare_reg(reg, range_addr, range_size))
  166. return i;
  167. }
  168. return -1;
  169. }
  170. /* Currently only generic buses without special encodings are supported.
  171. * In particular, PCI is not supported. Also, only the beginning of the
  172. * reg block is tracked; size is ignored except in ranges.
  173. */
  174. static u32 prop_buf[MAX_PROP_LEN / 4];
  175. static int dt_xlate(void *node, int res, int reglen, unsigned long *addr,
  176. unsigned long *size)
  177. {
  178. u32 last_addr[MAX_ADDR_CELLS];
  179. u32 this_addr[MAX_ADDR_CELLS];
  180. void *parent;
  181. u64 ret_addr, ret_size;
  182. u32 naddr, nsize, prev_naddr, prev_nsize;
  183. int buflen, offset;
  184. parent = get_parent(node);
  185. if (!parent)
  186. return 0;
  187. dt_get_reg_format(parent, &naddr, &nsize);
  188. if (nsize > 2)
  189. return 0;
  190. offset = (naddr + nsize) * res;
  191. if (reglen < offset + naddr + nsize ||
  192. MAX_PROP_LEN < (offset + naddr + nsize) * 4)
  193. return 0;
  194. copy_val(last_addr, prop_buf + offset, naddr);
  195. ret_size = prop_buf[offset + naddr];
  196. if (nsize == 2) {
  197. ret_size <<= 32;
  198. ret_size |= prop_buf[offset + naddr + 1];
  199. }
  200. for (;;) {
  201. prev_naddr = naddr;
  202. prev_nsize = nsize;
  203. node = parent;
  204. parent = get_parent(node);
  205. if (!parent)
  206. break;
  207. dt_get_reg_format(parent, &naddr, &nsize);
  208. buflen = getprop(node, "ranges", prop_buf,
  209. sizeof(prop_buf));
  210. if (buflen == 0)
  211. continue;
  212. if (buflen < 0 || buflen > sizeof(prop_buf))
  213. return 0;
  214. offset = find_range(last_addr, prop_buf, prev_naddr,
  215. naddr, prev_nsize, buflen / 4);
  216. if (offset < 0)
  217. return 0;
  218. copy_val(this_addr, prop_buf + offset, prev_naddr);
  219. if (!sub_reg(last_addr, this_addr))
  220. return 0;
  221. copy_val(this_addr, prop_buf + offset + prev_naddr, naddr);
  222. if (!add_reg(last_addr, this_addr, naddr))
  223. return 0;
  224. }
  225. if (naddr > 2)
  226. return 0;
  227. ret_addr = ((u64)last_addr[2] << 32) | last_addr[3];
  228. if (sizeof(void *) == 4 &&
  229. (ret_addr >= 0x100000000ULL || ret_size > 0x100000000ULL ||
  230. ret_addr + ret_size > 0x100000000ULL))
  231. return 0;
  232. *addr = ret_addr;
  233. if (size)
  234. *size = ret_size;
  235. return 1;
  236. }
  237. int dt_xlate_reg(void *node, int res, unsigned long *addr, unsigned long *size)
  238. {
  239. int reglen;
  240. reglen = getprop(node, "reg", prop_buf, sizeof(prop_buf)) / 4;
  241. return dt_xlate(node, res, reglen, addr, size);
  242. }
  243. int dt_xlate_addr(void *node, u32 *buf, int buflen, unsigned long *xlated_addr)
  244. {
  245. if (buflen > sizeof(prop_buf))
  246. return 0;
  247. memcpy(prop_buf, buf, buflen);
  248. return dt_xlate(node, 0, buflen / 4, xlated_addr, NULL);
  249. }
  250. int dt_is_compatible(void *node, const char *compat)
  251. {
  252. char *buf = (char *)prop_buf;
  253. int len, pos;
  254. len = getprop(node, "compatible", buf, MAX_PROP_LEN);
  255. if (len < 0)
  256. return 0;
  257. for (pos = 0; pos < len; pos++) {
  258. if (!strcmp(buf + pos, compat))
  259. return 1;
  260. pos += strnlen(&buf[pos], len - pos);
  261. }
  262. return 0;
  263. }