tree.c 8.4 KB

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