of.h 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238
  1. #ifndef _LINUX_OF_H
  2. #define _LINUX_OF_H
  3. /*
  4. * Definitions for talking to the Open Firmware PROM on
  5. * Power Macintosh and other computers.
  6. *
  7. * Copyright (C) 1996-2005 Paul Mackerras.
  8. *
  9. * Updates for PPC64 by Peter Bergner & David Engebretsen, IBM Corp.
  10. * Updates for SPARC64 by David S. Miller
  11. * Derived from PowerPC and Sparc prom.h files by Stephen Rothwell, IBM Corp.
  12. *
  13. * This program is free software; you can redistribute it and/or
  14. * modify it under the terms of the GNU General Public License
  15. * as published by the Free Software Foundation; either version
  16. * 2 of the License, or (at your option) any later version.
  17. */
  18. #include <linux/types.h>
  19. #include <linux/bitops.h>
  20. #include <linux/kref.h>
  21. #include <linux/mod_devicetable.h>
  22. #include <linux/spinlock.h>
  23. #include <asm/byteorder.h>
  24. typedef u32 phandle;
  25. typedef u32 ihandle;
  26. struct property {
  27. char *name;
  28. int length;
  29. void *value;
  30. struct property *next;
  31. unsigned long _flags;
  32. unsigned int unique_id;
  33. };
  34. #if defined(CONFIG_SPARC)
  35. struct of_irq_controller;
  36. #endif
  37. struct device_node {
  38. const char *name;
  39. const char *type;
  40. phandle phandle;
  41. char *full_name;
  42. struct property *properties;
  43. struct property *deadprops; /* removed properties */
  44. struct device_node *parent;
  45. struct device_node *child;
  46. struct device_node *sibling;
  47. struct device_node *next; /* next device of same type */
  48. struct device_node *allnext; /* next in list of all nodes */
  49. struct proc_dir_entry *pde; /* this node's proc directory */
  50. struct kref kref;
  51. unsigned long _flags;
  52. void *data;
  53. #if defined(CONFIG_SPARC)
  54. char *path_component_name;
  55. unsigned int unique_id;
  56. struct of_irq_controller *irq_trans;
  57. #endif
  58. };
  59. #ifdef CONFIG_OF
  60. /* Pointer for first entry in chain of all nodes. */
  61. extern struct device_node *allnodes;
  62. extern struct device_node *of_chosen;
  63. extern rwlock_t devtree_lock;
  64. static inline bool of_have_populated_dt(void)
  65. {
  66. return allnodes != NULL;
  67. }
  68. static inline bool of_node_is_root(const struct device_node *node)
  69. {
  70. return node && (node->parent == NULL);
  71. }
  72. static inline int of_node_check_flag(struct device_node *n, unsigned long flag)
  73. {
  74. return test_bit(flag, &n->_flags);
  75. }
  76. static inline void of_node_set_flag(struct device_node *n, unsigned long flag)
  77. {
  78. set_bit(flag, &n->_flags);
  79. }
  80. extern struct device_node *of_find_all_nodes(struct device_node *prev);
  81. #if defined(CONFIG_SPARC)
  82. /* Dummy ref counting routines - to be implemented later */
  83. static inline struct device_node *of_node_get(struct device_node *node)
  84. {
  85. return node;
  86. }
  87. static inline void of_node_put(struct device_node *node)
  88. {
  89. }
  90. #else
  91. extern struct device_node *of_node_get(struct device_node *node);
  92. extern void of_node_put(struct device_node *node);
  93. #endif
  94. /*
  95. * OF address retreival & translation
  96. */
  97. /* Helper to read a big number; size is in cells (not bytes) */
  98. static inline u64 of_read_number(const __be32 *cell, int size)
  99. {
  100. u64 r = 0;
  101. while (size--)
  102. r = (r << 32) | be32_to_cpu(*(cell++));
  103. return r;
  104. }
  105. /* Like of_read_number, but we want an unsigned long result */
  106. static inline unsigned long of_read_ulong(const __be32 *cell, int size)
  107. {
  108. /* toss away upper bits if unsigned long is smaller than u64 */
  109. return of_read_number(cell, size);
  110. }
  111. #include <asm/prom.h>
  112. /* Default #address and #size cells. Allow arch asm/prom.h to override */
  113. #if !defined(OF_ROOT_NODE_ADDR_CELLS_DEFAULT)
  114. #define OF_ROOT_NODE_ADDR_CELLS_DEFAULT 1
  115. #define OF_ROOT_NODE_SIZE_CELLS_DEFAULT 1
  116. #endif
  117. /* Default string compare functions, Allow arch asm/prom.h to override */
  118. #if !defined(of_compat_cmp)
  119. #define of_compat_cmp(s1, s2, l) strcasecmp((s1), (s2))
  120. #define of_prop_cmp(s1, s2) strcmp((s1), (s2))
  121. #define of_node_cmp(s1, s2) strcasecmp((s1), (s2))
  122. #endif
  123. /* flag descriptions */
  124. #define OF_DYNAMIC 1 /* node and properties were allocated via kmalloc */
  125. #define OF_DETACHED 2 /* node has been detached from the device tree */
  126. #define OF_IS_DYNAMIC(x) test_bit(OF_DYNAMIC, &x->_flags)
  127. #define OF_MARK_DYNAMIC(x) set_bit(OF_DYNAMIC, &x->_flags)
  128. #define OF_BAD_ADDR ((u64)-1)
  129. #ifndef of_node_to_nid
  130. static inline int of_node_to_nid(struct device_node *np) { return -1; }
  131. #define of_node_to_nid of_node_to_nid
  132. #endif
  133. extern struct device_node *of_find_node_by_name(struct device_node *from,
  134. const char *name);
  135. #define for_each_node_by_name(dn, name) \
  136. for (dn = of_find_node_by_name(NULL, name); dn; \
  137. dn = of_find_node_by_name(dn, name))
  138. extern struct device_node *of_find_node_by_type(struct device_node *from,
  139. const char *type);
  140. #define for_each_node_by_type(dn, type) \
  141. for (dn = of_find_node_by_type(NULL, type); dn; \
  142. dn = of_find_node_by_type(dn, type))
  143. extern struct device_node *of_find_compatible_node(struct device_node *from,
  144. const char *type, const char *compat);
  145. #define for_each_compatible_node(dn, type, compatible) \
  146. for (dn = of_find_compatible_node(NULL, type, compatible); dn; \
  147. dn = of_find_compatible_node(dn, type, compatible))
  148. extern struct device_node *of_find_matching_node(struct device_node *from,
  149. const struct of_device_id *matches);
  150. #define for_each_matching_node(dn, matches) \
  151. for (dn = of_find_matching_node(NULL, matches); dn; \
  152. dn = of_find_matching_node(dn, matches))
  153. extern struct device_node *of_find_node_by_path(const char *path);
  154. extern struct device_node *of_find_node_by_phandle(phandle handle);
  155. extern struct device_node *of_get_parent(const struct device_node *node);
  156. extern struct device_node *of_get_next_parent(struct device_node *node);
  157. extern struct device_node *of_get_next_child(const struct device_node *node,
  158. struct device_node *prev);
  159. #define for_each_child_of_node(parent, child) \
  160. for (child = of_get_next_child(parent, NULL); child != NULL; \
  161. child = of_get_next_child(parent, child))
  162. extern struct device_node *of_find_node_with_property(
  163. struct device_node *from, const char *prop_name);
  164. #define for_each_node_with_property(dn, prop_name) \
  165. for (dn = of_find_node_with_property(NULL, prop_name); dn; \
  166. dn = of_find_node_with_property(dn, prop_name))
  167. extern struct property *of_find_property(const struct device_node *np,
  168. const char *name,
  169. int *lenp);
  170. extern int of_device_is_compatible(const struct device_node *device,
  171. const char *);
  172. extern int of_device_is_available(const struct device_node *device);
  173. extern const void *of_get_property(const struct device_node *node,
  174. const char *name,
  175. int *lenp);
  176. extern int of_n_addr_cells(struct device_node *np);
  177. extern int of_n_size_cells(struct device_node *np);
  178. extern const struct of_device_id *of_match_node(
  179. const struct of_device_id *matches, const struct device_node *node);
  180. extern int of_modalias_node(struct device_node *node, char *modalias, int len);
  181. extern struct device_node *of_parse_phandle(struct device_node *np,
  182. const char *phandle_name,
  183. int index);
  184. extern int of_parse_phandles_with_args(struct device_node *np,
  185. const char *list_name, const char *cells_name, int index,
  186. struct device_node **out_node, const void **out_args);
  187. extern int of_machine_is_compatible(const char *compat);
  188. extern int prom_add_property(struct device_node* np, struct property* prop);
  189. extern int prom_remove_property(struct device_node *np, struct property *prop);
  190. extern int prom_update_property(struct device_node *np,
  191. struct property *newprop,
  192. struct property *oldprop);
  193. #if defined(CONFIG_OF_DYNAMIC)
  194. /* For updating the device tree at runtime */
  195. extern void of_attach_node(struct device_node *);
  196. extern void of_detach_node(struct device_node *);
  197. #endif
  198. #else
  199. static inline bool of_have_populated_dt(void)
  200. {
  201. return false;
  202. }
  203. #endif /* CONFIG_OF */
  204. #endif /* _LINUX_OF_H */