devtree.c 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333
  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_addresses(u32 startindex, ...)
  77. {
  78. va_list ap;
  79. u32 index = startindex;
  80. void *devp;
  81. const u8 *addr;
  82. va_start(ap, startindex);
  83. while ((addr = va_arg(ap, const u8 *))) {
  84. devp = find_node_by_prop_value(NULL, "linux,network-index",
  85. (void*)&index, sizeof(index));
  86. printf("ENET%d: local-mac-address <-"
  87. " %02x:%02x:%02x:%02x:%02x:%02x\n\r", index,
  88. addr[0], addr[1], addr[2], addr[3], addr[4], addr[5]);
  89. if (devp)
  90. setprop(devp, "local-mac-address", addr, 6);
  91. index++;
  92. }
  93. va_end(ap);
  94. }
  95. #define MAX_ADDR_CELLS 4
  96. static void get_reg_format(void *node, u32 *naddr, u32 *nsize)
  97. {
  98. if (getprop(node, "#address-cells", naddr, 4) != 4)
  99. *naddr = 2;
  100. if (getprop(node, "#size-cells", nsize, 4) != 4)
  101. *nsize = 1;
  102. }
  103. static void copy_val(u32 *dest, u32 *src, int naddr)
  104. {
  105. int pad = MAX_ADDR_CELLS - naddr;
  106. memset(dest, 0, pad * 4);
  107. memcpy(dest + pad, src, naddr * 4);
  108. }
  109. static int sub_reg(u32 *reg, u32 *sub)
  110. {
  111. int i, borrow = 0;
  112. for (i = MAX_ADDR_CELLS - 1; i >= 0; i--) {
  113. int prev_borrow = borrow;
  114. borrow = reg[i] < sub[i] + prev_borrow;
  115. reg[i] -= sub[i] + prev_borrow;
  116. }
  117. return !borrow;
  118. }
  119. static int add_reg(u32 *reg, u32 *add, int naddr)
  120. {
  121. int i, carry = 0;
  122. for (i = MAX_ADDR_CELLS - 1; i >= MAX_ADDR_CELLS - naddr; i--) {
  123. u64 tmp = (u64)reg[i] + add[i] + carry;
  124. carry = tmp >> 32;
  125. reg[i] = (u32)tmp;
  126. }
  127. return !carry;
  128. }
  129. /* It is assumed that if the first byte of reg fits in a
  130. * range, then the whole reg block fits.
  131. */
  132. static int compare_reg(u32 *reg, u32 *range, u32 *rangesize)
  133. {
  134. int i;
  135. u32 end;
  136. for (i = 0; i < MAX_ADDR_CELLS; i++) {
  137. if (reg[i] < range[i])
  138. return 0;
  139. if (reg[i] > range[i])
  140. break;
  141. }
  142. for (i = 0; i < MAX_ADDR_CELLS; i++) {
  143. end = range[i] + rangesize[i];
  144. if (reg[i] < end)
  145. break;
  146. if (reg[i] > end)
  147. return 0;
  148. }
  149. return reg[i] != end;
  150. }
  151. /* reg must be MAX_ADDR_CELLS */
  152. static int find_range(u32 *reg, u32 *ranges, int nregaddr,
  153. int naddr, int nsize, int buflen)
  154. {
  155. int nrange = nregaddr + naddr + nsize;
  156. int i;
  157. for (i = 0; i + nrange <= buflen; i += nrange) {
  158. u32 range_addr[MAX_ADDR_CELLS];
  159. u32 range_size[MAX_ADDR_CELLS];
  160. copy_val(range_addr, ranges + i, naddr);
  161. copy_val(range_size, ranges + i + nregaddr + naddr, nsize);
  162. if (compare_reg(reg, range_addr, range_size))
  163. return i;
  164. }
  165. return -1;
  166. }
  167. /* Currently only generic buses without special encodings are supported.
  168. * In particular, PCI is not supported. Also, only the beginning of the
  169. * reg block is tracked; size is ignored except in ranges.
  170. */
  171. static u32 prop_buf[MAX_PROP_LEN / 4];
  172. static int dt_xlate(void *node, int res, int reglen, unsigned long *addr,
  173. unsigned long *size)
  174. {
  175. u32 last_addr[MAX_ADDR_CELLS];
  176. u32 this_addr[MAX_ADDR_CELLS];
  177. void *parent;
  178. u64 ret_addr, ret_size;
  179. u32 naddr, nsize, prev_naddr, prev_nsize;
  180. int buflen, offset;
  181. parent = get_parent(node);
  182. if (!parent)
  183. return 0;
  184. get_reg_format(parent, &naddr, &nsize);
  185. if (nsize > 2)
  186. return 0;
  187. offset = (naddr + nsize) * res;
  188. if (reglen < offset + naddr + nsize ||
  189. MAX_PROP_LEN < (offset + naddr + nsize) * 4)
  190. return 0;
  191. copy_val(last_addr, prop_buf + offset, naddr);
  192. ret_size = prop_buf[offset + naddr];
  193. if (nsize == 2) {
  194. ret_size <<= 32;
  195. ret_size |= prop_buf[offset + naddr + 1];
  196. }
  197. for (;;) {
  198. prev_naddr = naddr;
  199. prev_nsize = nsize;
  200. node = parent;
  201. parent = get_parent(node);
  202. if (!parent)
  203. break;
  204. get_reg_format(parent, &naddr, &nsize);
  205. buflen = getprop(node, "ranges", prop_buf,
  206. sizeof(prop_buf));
  207. if (buflen == 0)
  208. continue;
  209. if (buflen < 0 || buflen > sizeof(prop_buf))
  210. return 0;
  211. offset = find_range(last_addr, prop_buf, prev_naddr,
  212. naddr, prev_nsize, buflen / 4);
  213. if (offset < 0)
  214. return 0;
  215. copy_val(this_addr, prop_buf + offset, prev_naddr);
  216. if (!sub_reg(last_addr, this_addr))
  217. return 0;
  218. copy_val(this_addr, prop_buf + offset + prev_naddr, naddr);
  219. if (!add_reg(last_addr, this_addr, naddr))
  220. return 0;
  221. }
  222. if (naddr > 2)
  223. return 0;
  224. ret_addr = ((u64)last_addr[2] << 32) | last_addr[3];
  225. if (sizeof(void *) == 4 &&
  226. (ret_addr >= 0x100000000ULL || ret_size > 0x100000000ULL ||
  227. ret_addr + ret_size > 0x100000000ULL))
  228. return 0;
  229. *addr = ret_addr;
  230. if (size)
  231. *size = ret_size;
  232. return 1;
  233. }
  234. int dt_xlate_reg(void *node, int res, unsigned long *addr, unsigned long *size)
  235. {
  236. int reglen;
  237. reglen = getprop(node, "reg", prop_buf, sizeof(prop_buf)) / 4;
  238. return dt_xlate(node, res, reglen, addr, size);
  239. }
  240. int dt_xlate_addr(void *node, u32 *buf, int buflen, unsigned long *xlated_addr)
  241. {
  242. if (buflen > sizeof(prop_buf))
  243. return 0;
  244. memcpy(prop_buf, buf, buflen);
  245. return dt_xlate(node, 0, buflen / 4, xlated_addr, NULL);
  246. }
  247. int dt_is_compatible(void *node, const char *compat)
  248. {
  249. char *buf = (char *)prop_buf;
  250. int len, pos;
  251. len = getprop(node, "compatible", buf, MAX_PROP_LEN);
  252. if (len < 0)
  253. return 0;
  254. for (pos = 0; pos < len; pos++) {
  255. if (!strcmp(buf + pos, compat))
  256. return 1;
  257. pos += strnlen(&buf[pos], len - pos);
  258. }
  259. return 0;
  260. }