tree.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382
  1. /* $Id: tree.c,v 1.10 1998/01/10 22:39:00 ecd Exp $
  2. * tree.c: Basic device tree traversal/scanning for the Linux
  3. * prom library.
  4. *
  5. * Copyright (C) 1995 David S. Miller (davem@caip.rutgers.edu)
  6. * Copyright (C) 1996,1997 Jakub Jelinek (jj@sunsite.mff.cuni.cz)
  7. */
  8. #include <linux/string.h>
  9. #include <linux/types.h>
  10. #include <linux/kernel.h>
  11. #include <linux/sched.h>
  12. #include <asm/openprom.h>
  13. #include <asm/oplib.h>
  14. /* Return the child of node 'node' or zero if no this node has no
  15. * direct descendent.
  16. */
  17. __inline__ int
  18. __prom_getchild(int node)
  19. {
  20. return p1275_cmd ("child", P1275_INOUT(1, 1), node);
  21. }
  22. __inline__ int
  23. prom_getchild(int node)
  24. {
  25. int cnode;
  26. if(node == -1) return 0;
  27. cnode = __prom_getchild(node);
  28. if(cnode == -1) return 0;
  29. return (int)cnode;
  30. }
  31. __inline__ int
  32. prom_getparent(int node)
  33. {
  34. int cnode;
  35. if(node == -1) return 0;
  36. cnode = p1275_cmd ("parent", P1275_INOUT(1, 1), node);
  37. if(cnode == -1) return 0;
  38. return (int)cnode;
  39. }
  40. /* Return the next sibling of node 'node' or zero if no more siblings
  41. * at this level of depth in the tree.
  42. */
  43. __inline__ int
  44. __prom_getsibling(int node)
  45. {
  46. return p1275_cmd(prom_peer_name, P1275_INOUT(1, 1), node);
  47. }
  48. __inline__ int
  49. prom_getsibling(int node)
  50. {
  51. int sibnode;
  52. if (node == -1)
  53. return 0;
  54. sibnode = __prom_getsibling(node);
  55. if (sibnode == -1)
  56. return 0;
  57. return sibnode;
  58. }
  59. /* Return the length in bytes of property 'prop' at node 'node'.
  60. * Return -1 on error.
  61. */
  62. __inline__ int
  63. prom_getproplen(int node, const char *prop)
  64. {
  65. if((!node) || (!prop)) return -1;
  66. return p1275_cmd ("getproplen",
  67. P1275_ARG(1,P1275_ARG_IN_STRING)|
  68. P1275_INOUT(2, 1),
  69. node, prop);
  70. }
  71. /* Acquire a property 'prop' at node 'node' and place it in
  72. * 'buffer' which has a size of 'bufsize'. If the acquisition
  73. * was successful the length will be returned, else -1 is returned.
  74. */
  75. __inline__ int
  76. prom_getproperty(int node, const char *prop, char *buffer, int bufsize)
  77. {
  78. int plen;
  79. plen = prom_getproplen(node, prop);
  80. if ((plen > bufsize) || (plen == 0) || (plen == -1)) {
  81. return -1;
  82. } else {
  83. /* Ok, things seem all right. */
  84. return p1275_cmd(prom_getprop_name,
  85. P1275_ARG(1,P1275_ARG_IN_STRING)|
  86. P1275_ARG(2,P1275_ARG_OUT_BUF)|
  87. P1275_INOUT(4, 1),
  88. node, prop, buffer, P1275_SIZE(plen));
  89. }
  90. }
  91. /* Acquire an integer property and return its value. Returns -1
  92. * on failure.
  93. */
  94. __inline__ int
  95. prom_getint(int node, const char *prop)
  96. {
  97. int intprop;
  98. if(prom_getproperty(node, prop, (char *) &intprop, sizeof(int)) != -1)
  99. return intprop;
  100. return -1;
  101. }
  102. /* Acquire an integer property, upon error return the passed default
  103. * integer.
  104. */
  105. int
  106. prom_getintdefault(int node, const char *property, int deflt)
  107. {
  108. int retval;
  109. retval = prom_getint(node, property);
  110. if(retval == -1) return deflt;
  111. return retval;
  112. }
  113. /* Acquire a boolean property, 1=TRUE 0=FALSE. */
  114. int
  115. prom_getbool(int node, const char *prop)
  116. {
  117. int retval;
  118. retval = prom_getproplen(node, prop);
  119. if(retval == -1) return 0;
  120. return 1;
  121. }
  122. /* Acquire a property whose value is a string, returns a null
  123. * string on error. The char pointer is the user supplied string
  124. * buffer.
  125. */
  126. void
  127. prom_getstring(int node, const char *prop, char *user_buf, int ubuf_size)
  128. {
  129. int len;
  130. len = prom_getproperty(node, prop, user_buf, ubuf_size);
  131. if(len != -1) return;
  132. user_buf[0] = 0;
  133. return;
  134. }
  135. /* Does the device at node 'node' have name 'name'?
  136. * YES = 1 NO = 0
  137. */
  138. int
  139. prom_nodematch(int node, const char *name)
  140. {
  141. char namebuf[128];
  142. prom_getproperty(node, "name", namebuf, sizeof(namebuf));
  143. if(strcmp(namebuf, name) == 0) return 1;
  144. return 0;
  145. }
  146. /* Search siblings at 'node_start' for a node with name
  147. * 'nodename'. Return node if successful, zero if not.
  148. */
  149. int
  150. prom_searchsiblings(int node_start, const char *nodename)
  151. {
  152. int thisnode, error;
  153. char promlib_buf[128];
  154. for(thisnode = node_start; thisnode;
  155. thisnode=prom_getsibling(thisnode)) {
  156. error = prom_getproperty(thisnode, "name", promlib_buf,
  157. sizeof(promlib_buf));
  158. /* Should this ever happen? */
  159. if(error == -1) continue;
  160. if(strcmp(nodename, promlib_buf)==0) return thisnode;
  161. }
  162. return 0;
  163. }
  164. /* Gets name in the {name@x,yyyyy|name (if no reg)} form */
  165. int
  166. prom_getname (int node, char *buffer, int len)
  167. {
  168. int i, sbus = 0;
  169. int pci = 0, ebus = 0, ide = 0;
  170. struct linux_prom_registers *reg;
  171. struct linux_prom64_registers reg64[PROMREG_MAX];
  172. for (sbus = prom_getparent (node); sbus; sbus = prom_getparent (sbus)) {
  173. i = prom_getproperty (sbus, "name", buffer, len);
  174. if (i > 0) {
  175. buffer [i] = 0;
  176. if (!strcmp (buffer, "sbus"))
  177. goto getit;
  178. }
  179. }
  180. if ((pci = prom_getparent (node))) {
  181. i = prom_getproperty (pci, "name", buffer, len);
  182. if (i > 0) {
  183. buffer [i] = 0;
  184. if (!strcmp (buffer, "pci"))
  185. goto getit;
  186. }
  187. pci = 0;
  188. }
  189. if ((ebus = prom_getparent (node))) {
  190. i = prom_getproperty (ebus, "name", buffer, len);
  191. if (i > 0) {
  192. buffer[i] = 0;
  193. if (!strcmp (buffer, "ebus"))
  194. goto getit;
  195. }
  196. ebus = 0;
  197. }
  198. if ((ide = prom_getparent (node))) {
  199. i = prom_getproperty (ide, "name", buffer, len);
  200. if (i > 0) {
  201. buffer [i] = 0;
  202. if (!strcmp (buffer, "ide"))
  203. goto getit;
  204. }
  205. ide = 0;
  206. }
  207. getit:
  208. i = prom_getproperty (node, "name", buffer, len);
  209. if (i <= 0) {
  210. buffer [0] = 0;
  211. return -1;
  212. }
  213. buffer [i] = 0;
  214. len -= i;
  215. i = prom_getproperty (node, "reg", (char *)reg64, sizeof (reg64));
  216. if (i <= 0) return 0;
  217. if (len < 16) return -1;
  218. buffer = strchr (buffer, 0);
  219. if (sbus) {
  220. reg = (struct linux_prom_registers *)reg64;
  221. sprintf (buffer, "@%x,%x", reg[0].which_io, (uint)reg[0].phys_addr);
  222. } else if (pci) {
  223. int dev, fn;
  224. reg = (struct linux_prom_registers *)reg64;
  225. fn = (reg[0].which_io >> 8) & 0x07;
  226. dev = (reg[0].which_io >> 11) & 0x1f;
  227. if (fn)
  228. sprintf (buffer, "@%x,%x", dev, fn);
  229. else
  230. sprintf (buffer, "@%x", dev);
  231. } else if (ebus) {
  232. reg = (struct linux_prom_registers *)reg64;
  233. sprintf (buffer, "@%x,%x", reg[0].which_io, reg[0].phys_addr);
  234. } else if (ide) {
  235. reg = (struct linux_prom_registers *)reg64;
  236. sprintf (buffer, "@%x,%x", reg[0].which_io, reg[0].phys_addr);
  237. } else if (i == 4) { /* Happens on 8042's children on Ultra/PCI. */
  238. reg = (struct linux_prom_registers *)reg64;
  239. sprintf (buffer, "@%x", reg[0].which_io);
  240. } else {
  241. sprintf (buffer, "@%x,%x",
  242. (unsigned int)(reg64[0].phys_addr >> 36),
  243. (unsigned int)(reg64[0].phys_addr));
  244. }
  245. return 0;
  246. }
  247. /* Return the first property type for node 'node'.
  248. * buffer should be at least 32B in length
  249. */
  250. __inline__ char *
  251. prom_firstprop(int node, char *buffer)
  252. {
  253. *buffer = 0;
  254. if(node == -1) return buffer;
  255. p1275_cmd ("nextprop", P1275_ARG(2,P1275_ARG_OUT_32B)|
  256. P1275_INOUT(3, 0),
  257. node, (char *) 0x0, buffer);
  258. return buffer;
  259. }
  260. /* Return the property type string after property type 'oprop'
  261. * at node 'node' . Returns NULL string if no more
  262. * property types for this node.
  263. */
  264. __inline__ char *
  265. prom_nextprop(int node, const char *oprop, char *buffer)
  266. {
  267. char buf[32];
  268. if(node == -1) {
  269. *buffer = 0;
  270. return buffer;
  271. }
  272. if (oprop == buffer) {
  273. strcpy (buf, oprop);
  274. oprop = buf;
  275. }
  276. p1275_cmd ("nextprop", P1275_ARG(1,P1275_ARG_IN_STRING)|
  277. P1275_ARG(2,P1275_ARG_OUT_32B)|
  278. P1275_INOUT(3, 0),
  279. node, oprop, buffer);
  280. return buffer;
  281. }
  282. int
  283. prom_finddevice(const char *name)
  284. {
  285. if (!name)
  286. return 0;
  287. return p1275_cmd(prom_finddev_name,
  288. P1275_ARG(0,P1275_ARG_IN_STRING)|
  289. P1275_INOUT(1, 1),
  290. name);
  291. }
  292. int prom_node_has_property(int node, const char *prop)
  293. {
  294. char buf [32];
  295. *buf = 0;
  296. do {
  297. prom_nextprop(node, buf, buf);
  298. if(!strcmp(buf, prop))
  299. return 1;
  300. } while (*buf);
  301. return 0;
  302. }
  303. /* Set property 'pname' at node 'node' to value 'value' which has a length
  304. * of 'size' bytes. Return the number of bytes the prom accepted.
  305. */
  306. int
  307. prom_setprop(int node, const char *pname, char *value, int size)
  308. {
  309. if(size == 0) return 0;
  310. if((pname == 0) || (value == 0)) return 0;
  311. return p1275_cmd ("setprop", P1275_ARG(1,P1275_ARG_IN_STRING)|
  312. P1275_ARG(2,P1275_ARG_IN_BUF)|
  313. P1275_INOUT(4, 1),
  314. node, pname, value, P1275_SIZE(size));
  315. }
  316. __inline__ int
  317. prom_inst2pkg(int inst)
  318. {
  319. int node;
  320. node = p1275_cmd ("instance-to-package", P1275_INOUT(1, 1), inst);
  321. if (node == -1) return 0;
  322. return node;
  323. }
  324. /* Return 'node' assigned to a particular prom 'path'
  325. * FIXME: Should work for v0 as well
  326. */
  327. int
  328. prom_pathtoinode(const char *path)
  329. {
  330. int node, inst;
  331. inst = prom_devopen (path);
  332. if (inst == 0) return 0;
  333. node = prom_inst2pkg (inst);
  334. prom_devclose (inst);
  335. if (node == -1) return 0;
  336. return node;
  337. }