tree_64.c 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315
  1. /*
  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 <linux/module.h>
  13. #include <asm/openprom.h>
  14. #include <asm/oplib.h>
  15. #include <asm/ldc.h>
  16. /* Return the child of node 'node' or zero if no this node has no
  17. * direct descendent.
  18. */
  19. inline int __prom_getchild(int node)
  20. {
  21. return p1275_cmd ("child", P1275_INOUT(1, 1), node);
  22. }
  23. EXPORT_SYMBOL(__prom_getchild);
  24. inline int prom_getchild(int node)
  25. {
  26. int cnode;
  27. if(node == -1) return 0;
  28. cnode = __prom_getchild(node);
  29. if(cnode == -1) return 0;
  30. return (int)cnode;
  31. }
  32. EXPORT_SYMBOL(prom_getchild);
  33. inline int prom_getparent(int node)
  34. {
  35. int cnode;
  36. if(node == -1) return 0;
  37. cnode = p1275_cmd ("parent", P1275_INOUT(1, 1), node);
  38. if(cnode == -1) return 0;
  39. return (int)cnode;
  40. }
  41. /* Return the next sibling of node 'node' or zero if no more siblings
  42. * at this level of depth in the tree.
  43. */
  44. inline int __prom_getsibling(int node)
  45. {
  46. return p1275_cmd(prom_peer_name, P1275_INOUT(1, 1), node);
  47. }
  48. EXPORT_SYMBOL(__prom_getsibling);
  49. inline int 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. EXPORT_SYMBOL(prom_getsibling);
  60. /* Return the length in bytes of property 'prop' at node 'node'.
  61. * Return -1 on error.
  62. */
  63. inline int 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. EXPORT_SYMBOL(prom_getproplen);
  72. /* Acquire a property 'prop' at node 'node' and place it in
  73. * 'buffer' which has a size of 'bufsize'. If the acquisition
  74. * was successful the length will be returned, else -1 is returned.
  75. */
  76. inline int prom_getproperty(int node, const char *prop,
  77. char *buffer, int bufsize)
  78. {
  79. int plen;
  80. plen = prom_getproplen(node, prop);
  81. if ((plen > bufsize) || (plen == 0) || (plen == -1)) {
  82. return -1;
  83. } else {
  84. /* Ok, things seem all right. */
  85. return p1275_cmd(prom_getprop_name,
  86. P1275_ARG(1,P1275_ARG_IN_STRING)|
  87. P1275_ARG(2,P1275_ARG_OUT_BUF)|
  88. P1275_INOUT(4, 1),
  89. node, prop, buffer, P1275_SIZE(plen));
  90. }
  91. }
  92. EXPORT_SYMBOL(prom_getproperty);
  93. /* Acquire an integer property and return its value. Returns -1
  94. * on failure.
  95. */
  96. inline int prom_getint(int node, const char *prop)
  97. {
  98. int intprop;
  99. if(prom_getproperty(node, prop, (char *) &intprop, sizeof(int)) != -1)
  100. return intprop;
  101. return -1;
  102. }
  103. EXPORT_SYMBOL(prom_getint);
  104. /* Acquire an integer property, upon error return the passed default
  105. * integer.
  106. */
  107. int prom_getintdefault(int node, const char *property, int deflt)
  108. {
  109. int retval;
  110. retval = prom_getint(node, property);
  111. if(retval == -1) return deflt;
  112. return retval;
  113. }
  114. EXPORT_SYMBOL(prom_getintdefault);
  115. /* Acquire a boolean property, 1=TRUE 0=FALSE. */
  116. int prom_getbool(int node, const char *prop)
  117. {
  118. int retval;
  119. retval = prom_getproplen(node, prop);
  120. if(retval == -1) return 0;
  121. return 1;
  122. }
  123. EXPORT_SYMBOL(prom_getbool);
  124. /* Acquire a property whose value is a string, returns a null
  125. * string on error. The char pointer is the user supplied string
  126. * buffer.
  127. */
  128. void prom_getstring(int node, const char *prop, char *user_buf, int ubuf_size)
  129. {
  130. int len;
  131. len = prom_getproperty(node, prop, user_buf, ubuf_size);
  132. if(len != -1) return;
  133. user_buf[0] = 0;
  134. return;
  135. }
  136. EXPORT_SYMBOL(prom_getstring);
  137. /* Does the device at node 'node' have name 'name'?
  138. * YES = 1 NO = 0
  139. */
  140. int prom_nodematch(int node, const char *name)
  141. {
  142. char namebuf[128];
  143. prom_getproperty(node, "name", namebuf, sizeof(namebuf));
  144. if(strcmp(namebuf, name) == 0) return 1;
  145. return 0;
  146. }
  147. /* Search siblings at 'node_start' for a node with name
  148. * 'nodename'. Return node if successful, zero if not.
  149. */
  150. int 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. EXPORT_SYMBOL(prom_searchsiblings);
  165. /* Return the first property type for node 'node'.
  166. * buffer should be at least 32B in length
  167. */
  168. inline char *prom_firstprop(int node, char *buffer)
  169. {
  170. *buffer = 0;
  171. if(node == -1) return buffer;
  172. p1275_cmd ("nextprop", P1275_ARG(2,P1275_ARG_OUT_32B)|
  173. P1275_INOUT(3, 0),
  174. node, (char *) 0x0, buffer);
  175. return buffer;
  176. }
  177. EXPORT_SYMBOL(prom_firstprop);
  178. /* Return the property type string after property type 'oprop'
  179. * at node 'node' . Returns NULL string if no more
  180. * property types for this node.
  181. */
  182. inline char *prom_nextprop(int node, const char *oprop, char *buffer)
  183. {
  184. char buf[32];
  185. if(node == -1) {
  186. *buffer = 0;
  187. return buffer;
  188. }
  189. if (oprop == buffer) {
  190. strcpy (buf, oprop);
  191. oprop = buf;
  192. }
  193. p1275_cmd ("nextprop", P1275_ARG(1,P1275_ARG_IN_STRING)|
  194. P1275_ARG(2,P1275_ARG_OUT_32B)|
  195. P1275_INOUT(3, 0),
  196. node, oprop, buffer);
  197. return buffer;
  198. }
  199. EXPORT_SYMBOL(prom_nextprop);
  200. int
  201. prom_finddevice(const char *name)
  202. {
  203. if (!name)
  204. return 0;
  205. return p1275_cmd(prom_finddev_name,
  206. P1275_ARG(0,P1275_ARG_IN_STRING)|
  207. P1275_INOUT(1, 1),
  208. name);
  209. }
  210. EXPORT_SYMBOL(prom_finddevice);
  211. int prom_node_has_property(int node, const char *prop)
  212. {
  213. char buf [32];
  214. *buf = 0;
  215. do {
  216. prom_nextprop(node, buf, buf);
  217. if(!strcmp(buf, prop))
  218. return 1;
  219. } while (*buf);
  220. return 0;
  221. }
  222. EXPORT_SYMBOL(prom_node_has_property);
  223. /* Set property 'pname' at node 'node' to value 'value' which has a length
  224. * of 'size' bytes. Return the number of bytes the prom accepted.
  225. */
  226. int
  227. prom_setprop(int node, const char *pname, char *value, int size)
  228. {
  229. if (size == 0)
  230. return 0;
  231. if ((pname == 0) || (value == 0))
  232. return 0;
  233. #ifdef CONFIG_SUN_LDOMS
  234. if (ldom_domaining_enabled) {
  235. ldom_set_var(pname, value);
  236. return 0;
  237. }
  238. #endif
  239. return p1275_cmd ("setprop", P1275_ARG(1,P1275_ARG_IN_STRING)|
  240. P1275_ARG(2,P1275_ARG_IN_BUF)|
  241. P1275_INOUT(4, 1),
  242. node, pname, value, P1275_SIZE(size));
  243. }
  244. EXPORT_SYMBOL(prom_setprop);
  245. inline int prom_inst2pkg(int inst)
  246. {
  247. int node;
  248. node = p1275_cmd ("instance-to-package", P1275_INOUT(1, 1), inst);
  249. if (node == -1) return 0;
  250. return node;
  251. }
  252. /* Return 'node' assigned to a particular prom 'path'
  253. * FIXME: Should work for v0 as well
  254. */
  255. int
  256. prom_pathtoinode(const char *path)
  257. {
  258. int node, inst;
  259. inst = prom_devopen (path);
  260. if (inst == 0) return 0;
  261. node = prom_inst2pkg (inst);
  262. prom_devclose (inst);
  263. if (node == -1) return 0;
  264. return node;
  265. }
  266. int prom_ihandle2path(int handle, char *buffer, int bufsize)
  267. {
  268. return p1275_cmd("instance-to-path",
  269. P1275_ARG(1,P1275_ARG_OUT_BUF)|
  270. P1275_INOUT(3, 1),
  271. handle, buffer, P1275_SIZE(bufsize));
  272. }