diff options
Diffstat (limited to 'arch/sparc64/prom/tree.c')
-rw-r--r-- | arch/sparc64/prom/tree.c | 49 |
1 files changed, 17 insertions, 32 deletions
diff --git a/arch/sparc64/prom/tree.c b/arch/sparc64/prom/tree.c index b2c5b12c9818..a99ccd7fb1b0 100644 --- a/arch/sparc64/prom/tree.c +++ b/arch/sparc64/prom/tree.c | |||
@@ -18,14 +18,12 @@ | |||
18 | /* Return the child of node 'node' or zero if no this node has no | 18 | /* Return the child of node 'node' or zero if no this node has no |
19 | * direct descendent. | 19 | * direct descendent. |
20 | */ | 20 | */ |
21 | __inline__ int | 21 | inline int __prom_getchild(int node) |
22 | __prom_getchild(int node) | ||
23 | { | 22 | { |
24 | return p1275_cmd ("child", P1275_INOUT(1, 1), node); | 23 | return p1275_cmd ("child", P1275_INOUT(1, 1), node); |
25 | } | 24 | } |
26 | 25 | ||
27 | __inline__ int | 26 | inline int prom_getchild(int node) |
28 | prom_getchild(int node) | ||
29 | { | 27 | { |
30 | int cnode; | 28 | int cnode; |
31 | 29 | ||
@@ -35,8 +33,7 @@ prom_getchild(int node) | |||
35 | return (int)cnode; | 33 | return (int)cnode; |
36 | } | 34 | } |
37 | 35 | ||
38 | __inline__ int | 36 | inline int prom_getparent(int node) |
39 | prom_getparent(int node) | ||
40 | { | 37 | { |
41 | int cnode; | 38 | int cnode; |
42 | 39 | ||
@@ -49,14 +46,12 @@ prom_getparent(int node) | |||
49 | /* Return the next sibling of node 'node' or zero if no more siblings | 46 | /* Return the next sibling of node 'node' or zero if no more siblings |
50 | * at this level of depth in the tree. | 47 | * at this level of depth in the tree. |
51 | */ | 48 | */ |
52 | __inline__ int | 49 | inline int __prom_getsibling(int node) |
53 | __prom_getsibling(int node) | ||
54 | { | 50 | { |
55 | return p1275_cmd(prom_peer_name, P1275_INOUT(1, 1), node); | 51 | return p1275_cmd(prom_peer_name, P1275_INOUT(1, 1), node); |
56 | } | 52 | } |
57 | 53 | ||
58 | __inline__ int | 54 | inline int prom_getsibling(int node) |
59 | prom_getsibling(int node) | ||
60 | { | 55 | { |
61 | int sibnode; | 56 | int sibnode; |
62 | 57 | ||
@@ -72,8 +67,7 @@ prom_getsibling(int node) | |||
72 | /* Return the length in bytes of property 'prop' at node 'node'. | 67 | /* Return the length in bytes of property 'prop' at node 'node'. |
73 | * Return -1 on error. | 68 | * Return -1 on error. |
74 | */ | 69 | */ |
75 | __inline__ int | 70 | inline int prom_getproplen(int node, const char *prop) |
76 | prom_getproplen(int node, const char *prop) | ||
77 | { | 71 | { |
78 | if((!node) || (!prop)) return -1; | 72 | if((!node) || (!prop)) return -1; |
79 | return p1275_cmd ("getproplen", | 73 | return p1275_cmd ("getproplen", |
@@ -86,8 +80,8 @@ prom_getproplen(int node, const char *prop) | |||
86 | * 'buffer' which has a size of 'bufsize'. If the acquisition | 80 | * 'buffer' which has a size of 'bufsize'. If the acquisition |
87 | * was successful the length will be returned, else -1 is returned. | 81 | * was successful the length will be returned, else -1 is returned. |
88 | */ | 82 | */ |
89 | __inline__ int | 83 | inline int prom_getproperty(int node, const char *prop, |
90 | prom_getproperty(int node, const char *prop, char *buffer, int bufsize) | 84 | char *buffer, int bufsize) |
91 | { | 85 | { |
92 | int plen; | 86 | int plen; |
93 | 87 | ||
@@ -107,8 +101,7 @@ prom_getproperty(int node, const char *prop, char *buffer, int bufsize) | |||
107 | /* Acquire an integer property and return its value. Returns -1 | 101 | /* Acquire an integer property and return its value. Returns -1 |
108 | * on failure. | 102 | * on failure. |
109 | */ | 103 | */ |
110 | __inline__ int | 104 | inline int prom_getint(int node, const char *prop) |
111 | prom_getint(int node, const char *prop) | ||
112 | { | 105 | { |
113 | int intprop; | 106 | int intprop; |
114 | 107 | ||
@@ -122,8 +115,7 @@ prom_getint(int node, const char *prop) | |||
122 | * integer. | 115 | * integer. |
123 | */ | 116 | */ |
124 | 117 | ||
125 | int | 118 | int prom_getintdefault(int node, const char *property, int deflt) |
126 | prom_getintdefault(int node, const char *property, int deflt) | ||
127 | { | 119 | { |
128 | int retval; | 120 | int retval; |
129 | 121 | ||
@@ -134,8 +126,7 @@ prom_getintdefault(int node, const char *property, int deflt) | |||
134 | } | 126 | } |
135 | 127 | ||
136 | /* Acquire a boolean property, 1=TRUE 0=FALSE. */ | 128 | /* Acquire a boolean property, 1=TRUE 0=FALSE. */ |
137 | int | 129 | int prom_getbool(int node, const char *prop) |
138 | prom_getbool(int node, const char *prop) | ||
139 | { | 130 | { |
140 | int retval; | 131 | int retval; |
141 | 132 | ||
@@ -148,8 +139,7 @@ prom_getbool(int node, const char *prop) | |||
148 | * string on error. The char pointer is the user supplied string | 139 | * string on error. The char pointer is the user supplied string |
149 | * buffer. | 140 | * buffer. |
150 | */ | 141 | */ |
151 | void | 142 | void prom_getstring(int node, const char *prop, char *user_buf, int ubuf_size) |
152 | prom_getstring(int node, const char *prop, char *user_buf, int ubuf_size) | ||
153 | { | 143 | { |
154 | int len; | 144 | int len; |
155 | 145 | ||
@@ -163,8 +153,7 @@ prom_getstring(int node, const char *prop, char *user_buf, int ubuf_size) | |||
163 | /* Does the device at node 'node' have name 'name'? | 153 | /* Does the device at node 'node' have name 'name'? |
164 | * YES = 1 NO = 0 | 154 | * YES = 1 NO = 0 |
165 | */ | 155 | */ |
166 | int | 156 | int prom_nodematch(int node, const char *name) |
167 | prom_nodematch(int node, const char *name) | ||
168 | { | 157 | { |
169 | char namebuf[128]; | 158 | char namebuf[128]; |
170 | prom_getproperty(node, "name", namebuf, sizeof(namebuf)); | 159 | prom_getproperty(node, "name", namebuf, sizeof(namebuf)); |
@@ -175,8 +164,7 @@ prom_nodematch(int node, const char *name) | |||
175 | /* Search siblings at 'node_start' for a node with name | 164 | /* Search siblings at 'node_start' for a node with name |
176 | * 'nodename'. Return node if successful, zero if not. | 165 | * 'nodename'. Return node if successful, zero if not. |
177 | */ | 166 | */ |
178 | int | 167 | int prom_searchsiblings(int node_start, const char *nodename) |
179 | prom_searchsiblings(int node_start, const char *nodename) | ||
180 | { | 168 | { |
181 | 169 | ||
182 | int thisnode, error; | 170 | int thisnode, error; |
@@ -197,8 +185,7 @@ prom_searchsiblings(int node_start, const char *nodename) | |||
197 | /* Return the first property type for node 'node'. | 185 | /* Return the first property type for node 'node'. |
198 | * buffer should be at least 32B in length | 186 | * buffer should be at least 32B in length |
199 | */ | 187 | */ |
200 | __inline__ char * | 188 | inline char *prom_firstprop(int node, char *buffer) |
201 | prom_firstprop(int node, char *buffer) | ||
202 | { | 189 | { |
203 | *buffer = 0; | 190 | *buffer = 0; |
204 | if(node == -1) return buffer; | 191 | if(node == -1) return buffer; |
@@ -212,8 +199,7 @@ prom_firstprop(int node, char *buffer) | |||
212 | * at node 'node' . Returns NULL string if no more | 199 | * at node 'node' . Returns NULL string if no more |
213 | * property types for this node. | 200 | * property types for this node. |
214 | */ | 201 | */ |
215 | __inline__ char * | 202 | inline char *prom_nextprop(int node, const char *oprop, char *buffer) |
216 | prom_nextprop(int node, const char *oprop, char *buffer) | ||
217 | { | 203 | { |
218 | char buf[32]; | 204 | char buf[32]; |
219 | 205 | ||
@@ -279,8 +265,7 @@ prom_setprop(int node, const char *pname, char *value, int size) | |||
279 | node, pname, value, P1275_SIZE(size)); | 265 | node, pname, value, P1275_SIZE(size)); |
280 | } | 266 | } |
281 | 267 | ||
282 | __inline__ int | 268 | inline int prom_inst2pkg(int inst) |
283 | prom_inst2pkg(int inst) | ||
284 | { | 269 | { |
285 | int node; | 270 | int node; |
286 | 271 | ||