tree_32.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358
  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. */
  7. #include <linux/string.h>
  8. #include <linux/types.h>
  9. #include <linux/kernel.h>
  10. #include <linux/sched.h>
  11. #include <linux/ctype.h>
  12. #include <linux/module.h>
  13. #include <asm/openprom.h>
  14. #include <asm/oplib.h>
  15. extern void restore_current(void);
  16. static char promlib_buf[128];
  17. /* Internal version of prom_getchild that does not alter return values. */
  18. int __prom_getchild(int node)
  19. {
  20. unsigned long flags;
  21. int cnode;
  22. spin_lock_irqsave(&prom_lock, flags);
  23. cnode = prom_nodeops->no_child(node);
  24. restore_current();
  25. spin_unlock_irqrestore(&prom_lock, flags);
  26. return cnode;
  27. }
  28. /* Return the child of node 'node' or zero if no this node has no
  29. * direct descendent.
  30. */
  31. int prom_getchild(int node)
  32. {
  33. int cnode;
  34. if (node == -1)
  35. return 0;
  36. cnode = __prom_getchild(node);
  37. if (cnode == 0 || cnode == -1)
  38. return 0;
  39. return cnode;
  40. }
  41. EXPORT_SYMBOL(prom_getchild);
  42. /* Internal version of prom_getsibling that does not alter return values. */
  43. int __prom_getsibling(int node)
  44. {
  45. unsigned long flags;
  46. int cnode;
  47. spin_lock_irqsave(&prom_lock, flags);
  48. cnode = prom_nodeops->no_nextnode(node);
  49. restore_current();
  50. spin_unlock_irqrestore(&prom_lock, flags);
  51. return cnode;
  52. }
  53. /* Return the next sibling of node 'node' or zero if no more siblings
  54. * at this level of depth in the tree.
  55. */
  56. int prom_getsibling(int node)
  57. {
  58. int sibnode;
  59. if (node == -1)
  60. return 0;
  61. sibnode = __prom_getsibling(node);
  62. if (sibnode == 0 || sibnode == -1)
  63. return 0;
  64. return sibnode;
  65. }
  66. EXPORT_SYMBOL(prom_getsibling);
  67. /* Return the length in bytes of property 'prop' at node 'node'.
  68. * Return -1 on error.
  69. */
  70. int prom_getproplen(int node, const char *prop)
  71. {
  72. int ret;
  73. unsigned long flags;
  74. if((!node) || (!prop))
  75. return -1;
  76. spin_lock_irqsave(&prom_lock, flags);
  77. ret = prom_nodeops->no_proplen(node, prop);
  78. restore_current();
  79. spin_unlock_irqrestore(&prom_lock, flags);
  80. return ret;
  81. }
  82. EXPORT_SYMBOL(prom_getproplen);
  83. /* Acquire a property 'prop' at node 'node' and place it in
  84. * 'buffer' which has a size of 'bufsize'. If the acquisition
  85. * was successful the length will be returned, else -1 is returned.
  86. */
  87. int prom_getproperty(int node, const char *prop, char *buffer, int bufsize)
  88. {
  89. int plen, ret;
  90. unsigned long flags;
  91. plen = prom_getproplen(node, prop);
  92. if((plen > bufsize) || (plen == 0) || (plen == -1))
  93. return -1;
  94. /* Ok, things seem all right. */
  95. spin_lock_irqsave(&prom_lock, flags);
  96. ret = prom_nodeops->no_getprop(node, prop, buffer);
  97. restore_current();
  98. spin_unlock_irqrestore(&prom_lock, flags);
  99. return ret;
  100. }
  101. EXPORT_SYMBOL(prom_getproperty);
  102. /* Acquire an integer property and return its value. Returns -1
  103. * on failure.
  104. */
  105. int prom_getint(int node, char *prop)
  106. {
  107. static int intprop;
  108. if(prom_getproperty(node, prop, (char *) &intprop, sizeof(int)) != -1)
  109. return intprop;
  110. return -1;
  111. }
  112. EXPORT_SYMBOL(prom_getint);
  113. /* Acquire an integer property, upon error return the passed default
  114. * integer.
  115. */
  116. int prom_getintdefault(int node, char *property, int deflt)
  117. {
  118. int retval;
  119. retval = prom_getint(node, property);
  120. if(retval == -1) return deflt;
  121. return retval;
  122. }
  123. EXPORT_SYMBOL(prom_getintdefault);
  124. /* Acquire a boolean property, 1=TRUE 0=FALSE. */
  125. int prom_getbool(int node, char *prop)
  126. {
  127. int retval;
  128. retval = prom_getproplen(node, prop);
  129. if(retval == -1) return 0;
  130. return 1;
  131. }
  132. EXPORT_SYMBOL(prom_getbool);
  133. /* Acquire a property whose value is a string, returns a null
  134. * string on error. The char pointer is the user supplied string
  135. * buffer.
  136. */
  137. void prom_getstring(int node, char *prop, char *user_buf, int ubuf_size)
  138. {
  139. int len;
  140. len = prom_getproperty(node, prop, user_buf, ubuf_size);
  141. if(len != -1) return;
  142. user_buf[0] = 0;
  143. }
  144. EXPORT_SYMBOL(prom_getstring);
  145. /* Does the device at node 'node' have name 'name'?
  146. * YES = 1 NO = 0
  147. */
  148. int prom_nodematch(int node, char *name)
  149. {
  150. int error;
  151. static char namebuf[128];
  152. error = prom_getproperty(node, "name", namebuf, sizeof(namebuf));
  153. if (error == -1) return 0;
  154. if(strcmp(namebuf, name) == 0) return 1;
  155. return 0;
  156. }
  157. /* Search siblings at 'node_start' for a node with name
  158. * 'nodename'. Return node if successful, zero if not.
  159. */
  160. int prom_searchsiblings(int node_start, char *nodename)
  161. {
  162. int thisnode, error;
  163. for(thisnode = node_start; thisnode;
  164. thisnode=prom_getsibling(thisnode)) {
  165. error = prom_getproperty(thisnode, "name", promlib_buf,
  166. sizeof(promlib_buf));
  167. /* Should this ever happen? */
  168. if(error == -1) continue;
  169. if(strcmp(nodename, promlib_buf)==0) return thisnode;
  170. }
  171. return 0;
  172. }
  173. EXPORT_SYMBOL(prom_searchsiblings);
  174. /* Interal version of nextprop that does not alter return values. */
  175. char * __prom_nextprop(int node, char * oprop)
  176. {
  177. unsigned long flags;
  178. char *prop;
  179. spin_lock_irqsave(&prom_lock, flags);
  180. prop = prom_nodeops->no_nextprop(node, oprop);
  181. restore_current();
  182. spin_unlock_irqrestore(&prom_lock, flags);
  183. return prop;
  184. }
  185. /* Return the first property name for node 'node'. */
  186. /* buffer is unused argument, but as v9 uses it, we need to have the same interface */
  187. char * prom_firstprop(int node, char *bufer)
  188. {
  189. if (node == 0 || node == -1)
  190. return "";
  191. return __prom_nextprop(node, "");
  192. }
  193. EXPORT_SYMBOL(prom_firstprop);
  194. /* Return the property type string after property type 'oprop'
  195. * at node 'node' . Returns empty string if no more
  196. * property types for this node.
  197. */
  198. char * prom_nextprop(int node, char *oprop, char *buffer)
  199. {
  200. if (node == 0 || node == -1)
  201. return "";
  202. return __prom_nextprop(node, oprop);
  203. }
  204. EXPORT_SYMBOL(prom_nextprop);
  205. int prom_finddevice(char *name)
  206. {
  207. char nbuf[128];
  208. char *s = name, *d;
  209. int node = prom_root_node, node2;
  210. unsigned int which_io, phys_addr;
  211. struct linux_prom_registers reg[PROMREG_MAX];
  212. while (*s++) {
  213. if (!*s) return node; /* path '.../' is legal */
  214. node = prom_getchild(node);
  215. for (d = nbuf; *s != 0 && *s != '@' && *s != '/';)
  216. *d++ = *s++;
  217. *d = 0;
  218. node = prom_searchsiblings(node, nbuf);
  219. if (!node)
  220. return 0;
  221. if (*s == '@') {
  222. if (isxdigit(s[1]) && s[2] == ',') {
  223. which_io = simple_strtoul(s+1, NULL, 16);
  224. phys_addr = simple_strtoul(s+3, &d, 16);
  225. if (d != s + 3 && (!*d || *d == '/')
  226. && d <= s + 3 + 8) {
  227. node2 = node;
  228. while (node2 && node2 != -1) {
  229. if (prom_getproperty (node2, "reg", (char *)reg, sizeof (reg)) > 0) {
  230. if (which_io == reg[0].which_io && phys_addr == reg[0].phys_addr) {
  231. node = node2;
  232. break;
  233. }
  234. }
  235. node2 = prom_getsibling(node2);
  236. if (!node2 || node2 == -1)
  237. break;
  238. node2 = prom_searchsiblings(prom_getsibling(node2), nbuf);
  239. }
  240. }
  241. }
  242. while (*s != 0 && *s != '/') s++;
  243. }
  244. }
  245. return node;
  246. }
  247. EXPORT_SYMBOL(prom_finddevice);
  248. int prom_node_has_property(int node, char *prop)
  249. {
  250. char *current_property = "";
  251. do {
  252. current_property = prom_nextprop(node, current_property, NULL);
  253. if(!strcmp(current_property, prop))
  254. return 1;
  255. } while (*current_property);
  256. return 0;
  257. }
  258. EXPORT_SYMBOL(prom_node_has_property);
  259. /* Set property 'pname' at node 'node' to value 'value' which has a length
  260. * of 'size' bytes. Return the number of bytes the prom accepted.
  261. */
  262. int prom_setprop(int node, const char *pname, char *value, int size)
  263. {
  264. unsigned long flags;
  265. int ret;
  266. if(size == 0) return 0;
  267. if((pname == 0) || (value == 0)) return 0;
  268. spin_lock_irqsave(&prom_lock, flags);
  269. ret = prom_nodeops->no_setprop(node, pname, value, size);
  270. restore_current();
  271. spin_unlock_irqrestore(&prom_lock, flags);
  272. return ret;
  273. }
  274. EXPORT_SYMBOL(prom_setprop);
  275. int prom_inst2pkg(int inst)
  276. {
  277. int node;
  278. unsigned long flags;
  279. spin_lock_irqsave(&prom_lock, flags);
  280. node = (*romvec->pv_v2devops.v2_inst2pkg)(inst);
  281. restore_current();
  282. spin_unlock_irqrestore(&prom_lock, flags);
  283. if (node == -1) return 0;
  284. return node;
  285. }
  286. /* Return 'node' assigned to a particular prom 'path'
  287. * FIXME: Should work for v0 as well
  288. */
  289. int prom_pathtoinode(char *path)
  290. {
  291. int node, inst;
  292. inst = prom_devopen (path);
  293. if (inst == -1) return 0;
  294. node = prom_inst2pkg (inst);
  295. prom_devclose (inst);
  296. if (node == -1) return 0;
  297. return node;
  298. }