tree_64.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  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. inline int 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. EXPORT_SYMBOL(prom_getchild);
  32. inline int 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 __prom_getsibling(int node)
  44. {
  45. return p1275_cmd(prom_peer_name, P1275_INOUT(1, 1), node);
  46. }
  47. inline int prom_getsibling(int node)
  48. {
  49. int sibnode;
  50. if (node == -1)
  51. return 0;
  52. sibnode = __prom_getsibling(node);
  53. if (sibnode == -1)
  54. return 0;
  55. return sibnode;
  56. }
  57. EXPORT_SYMBOL(prom_getsibling);
  58. /* Return the length in bytes of property 'prop' at node 'node'.
  59. * Return -1 on error.
  60. */
  61. inline int prom_getproplen(int node, const 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. EXPORT_SYMBOL(prom_getproplen);
  70. /* Acquire a property 'prop' at node 'node' and place it in
  71. * 'buffer' which has a size of 'bufsize'. If the acquisition
  72. * was successful the length will be returned, else -1 is returned.
  73. */
  74. inline int prom_getproperty(int node, const char *prop,
  75. char *buffer, int bufsize)
  76. {
  77. int plen;
  78. plen = prom_getproplen(node, prop);
  79. if ((plen > bufsize) || (plen == 0) || (plen == -1)) {
  80. return -1;
  81. } else {
  82. /* Ok, things seem all right. */
  83. return p1275_cmd(prom_getprop_name,
  84. P1275_ARG(1,P1275_ARG_IN_STRING)|
  85. P1275_ARG(2,P1275_ARG_OUT_BUF)|
  86. P1275_INOUT(4, 1),
  87. node, prop, buffer, P1275_SIZE(plen));
  88. }
  89. }
  90. EXPORT_SYMBOL(prom_getproperty);
  91. /* Acquire an integer property and return its value. Returns -1
  92. * on failure.
  93. */
  94. inline int prom_getint(int node, const char *prop)
  95. {
  96. int intprop;
  97. if(prom_getproperty(node, prop, (char *) &intprop, sizeof(int)) != -1)
  98. return intprop;
  99. return -1;
  100. }
  101. EXPORT_SYMBOL(prom_getint);
  102. /* Acquire an integer property, upon error return the passed default
  103. * integer.
  104. */
  105. int prom_getintdefault(int node, const char *property, int deflt)
  106. {
  107. int retval;
  108. retval = prom_getint(node, property);
  109. if(retval == -1) return deflt;
  110. return retval;
  111. }
  112. EXPORT_SYMBOL(prom_getintdefault);
  113. /* Acquire a boolean property, 1=TRUE 0=FALSE. */
  114. int prom_getbool(int node, const char *prop)
  115. {
  116. int retval;
  117. retval = prom_getproplen(node, prop);
  118. if(retval == -1) return 0;
  119. return 1;
  120. }
  121. EXPORT_SYMBOL(prom_getbool);
  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 prom_getstring(int node, const char *prop, char *user_buf, int ubuf_size)
  127. {
  128. int len;
  129. len = prom_getproperty(node, prop, user_buf, ubuf_size);
  130. if(len != -1) return;
  131. user_buf[0] = 0;
  132. }
  133. EXPORT_SYMBOL(prom_getstring);
  134. /* Does the device at node 'node' have name 'name'?
  135. * YES = 1 NO = 0
  136. */
  137. int prom_nodematch(int node, const 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 prom_searchsiblings(int node_start, const char *nodename)
  148. {
  149. int thisnode, error;
  150. char promlib_buf[128];
  151. for(thisnode = node_start; thisnode;
  152. thisnode=prom_getsibling(thisnode)) {
  153. error = prom_getproperty(thisnode, "name", promlib_buf,
  154. sizeof(promlib_buf));
  155. /* Should this ever happen? */
  156. if(error == -1) continue;
  157. if(strcmp(nodename, promlib_buf)==0) return thisnode;
  158. }
  159. return 0;
  160. }
  161. EXPORT_SYMBOL(prom_searchsiblings);
  162. /* Return the first property type for node 'node'.
  163. * buffer should be at least 32B in length
  164. */
  165. inline char *prom_firstprop(int node, char *buffer)
  166. {
  167. *buffer = 0;
  168. if(node == -1) return buffer;
  169. p1275_cmd ("nextprop", P1275_ARG(2,P1275_ARG_OUT_32B)|
  170. P1275_INOUT(3, 0),
  171. node, (char *) 0x0, buffer);
  172. return buffer;
  173. }
  174. EXPORT_SYMBOL(prom_firstprop);
  175. /* Return the property type string after property type 'oprop'
  176. * at node 'node' . Returns NULL string if no more
  177. * property types for this node.
  178. */
  179. inline char *prom_nextprop(int node, const char *oprop, char *buffer)
  180. {
  181. char buf[32];
  182. if(node == -1) {
  183. *buffer = 0;
  184. return buffer;
  185. }
  186. if (oprop == buffer) {
  187. strcpy (buf, oprop);
  188. oprop = buf;
  189. }
  190. p1275_cmd ("nextprop", P1275_ARG(1,P1275_ARG_IN_STRING)|
  191. P1275_ARG(2,P1275_ARG_OUT_32B)|
  192. P1275_INOUT(3, 0),
  193. node, oprop, buffer);
  194. return buffer;
  195. }
  196. EXPORT_SYMBOL(prom_nextprop);
  197. int
  198. prom_finddevice(const char *name)
  199. {
  200. if (!name)
  201. return 0;
  202. return p1275_cmd(prom_finddev_name,
  203. P1275_ARG(0,P1275_ARG_IN_STRING)|
  204. P1275_INOUT(1, 1),
  205. name);
  206. }
  207. EXPORT_SYMBOL(prom_finddevice);
  208. int prom_node_has_property(int node, const char *prop)
  209. {
  210. char buf [32];
  211. *buf = 0;
  212. do {
  213. prom_nextprop(node, buf, buf);
  214. if(!strcmp(buf, prop))
  215. return 1;
  216. } while (*buf);
  217. return 0;
  218. }
  219. EXPORT_SYMBOL(prom_node_has_property);
  220. /* Set property 'pname' at node 'node' to value 'value' which has a length
  221. * of 'size' bytes. Return the number of bytes the prom accepted.
  222. */
  223. int
  224. prom_setprop(int node, const char *pname, char *value, int size)
  225. {
  226. if (size == 0)
  227. return 0;
  228. if ((pname == 0) || (value == 0))
  229. return 0;
  230. #ifdef CONFIG_SUN_LDOMS
  231. if (ldom_domaining_enabled) {
  232. ldom_set_var(pname, value);
  233. return 0;
  234. }
  235. #endif
  236. return p1275_cmd ("setprop", P1275_ARG(1,P1275_ARG_IN_STRING)|
  237. P1275_ARG(2,P1275_ARG_IN_BUF)|
  238. P1275_INOUT(4, 1),
  239. node, pname, value, P1275_SIZE(size));
  240. }
  241. EXPORT_SYMBOL(prom_setprop);
  242. inline int prom_inst2pkg(int inst)
  243. {
  244. int node;
  245. node = p1275_cmd ("instance-to-package", P1275_INOUT(1, 1), inst);
  246. if (node == -1) return 0;
  247. return node;
  248. }
  249. /* Return 'node' assigned to a particular prom 'path'
  250. * FIXME: Should work for v0 as well
  251. */
  252. int
  253. prom_pathtoinode(const char *path)
  254. {
  255. int node, inst;
  256. inst = prom_devopen (path);
  257. if (inst == 0) return 0;
  258. node = prom_inst2pkg (inst);
  259. prom_devclose (inst);
  260. if (node == -1) return 0;
  261. return node;
  262. }
  263. int prom_ihandle2path(int handle, char *buffer, int bufsize)
  264. {
  265. return p1275_cmd("instance-to-path",
  266. P1275_ARG(1,P1275_ARG_OUT_BUF)|
  267. P1275_INOUT(3, 1),
  268. handle, buffer, P1275_SIZE(bufsize));
  269. }