ofw_subr.c revision 1.42 1 1.42 thorpej /* $NetBSD: ofw_subr.c,v 1.42 2021/01/18 02:35:49 thorpej Exp $ */
2 1.1 cgd
3 1.1 cgd /*
4 1.1 cgd * Copyright 1998
5 1.1 cgd * Digital Equipment Corporation. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This software is furnished under license and may be used and
8 1.1 cgd * copied only in accordance with the following terms and conditions.
9 1.1 cgd * Subject to these conditions, you may download, copy, install,
10 1.1 cgd * use, modify and distribute this software in source and/or binary
11 1.1 cgd * form. No title or ownership is transferred hereby.
12 1.1 cgd *
13 1.1 cgd * 1) Any source code used, modified or distributed must reproduce
14 1.1 cgd * and retain this copyright notice and list of conditions as
15 1.1 cgd * they appear in the source file.
16 1.1 cgd *
17 1.1 cgd * 2) No right is granted to use any trade name, trademark, or logo of
18 1.1 cgd * Digital Equipment Corporation. Neither the "Digital Equipment
19 1.1 cgd * Corporation" name nor any trademark or logo of Digital Equipment
20 1.1 cgd * Corporation may be used to endorse or promote products derived
21 1.1 cgd * from this software without the prior written permission of
22 1.1 cgd * Digital Equipment Corporation.
23 1.1 cgd *
24 1.1 cgd * 3) This software is provided "AS-IS" and any express or implied
25 1.1 cgd * warranties, including but not limited to, any implied warranties
26 1.1 cgd * of merchantability, fitness for a particular purpose, or
27 1.1 cgd * non-infringement are disclaimed. In no event shall DIGITAL be
28 1.1 cgd * liable for any damages whatsoever, and in particular, DIGITAL
29 1.1 cgd * shall not be liable for special, indirect, consequential, or
30 1.1 cgd * incidental damages or damages for lost profits, loss of
31 1.1 cgd * revenue or loss of use, whether such damages arise in contract,
32 1.1 cgd * negligence, tort, under statute, in equity, at law or otherwise,
33 1.1 cgd * even if advised of the possibility of such damage.
34 1.1 cgd */
35 1.7 lukem
36 1.7 lukem #include <sys/cdefs.h>
37 1.42 thorpej __KERNEL_RCSID(0, "$NetBSD: ofw_subr.c,v 1.42 2021/01/18 02:35:49 thorpej Exp $");
38 1.1 cgd
39 1.2 cgd #include <sys/param.h>
40 1.42 thorpej #include <sys/device.h>
41 1.2 cgd #include <sys/systm.h>
42 1.2 cgd #include <sys/malloc.h>
43 1.2 cgd #include <dev/ofw/openfirm.h>
44 1.2 cgd
45 1.3 cgd #define OFW_MAX_STACK_BUF_SIZE 256
46 1.3 cgd #define OFW_PATH_BUF_SIZE 512
47 1.3 cgd
48 1.1 cgd /*
49 1.3 cgd * int of_decode_int(p)
50 1.3 cgd *
51 1.3 cgd * This routine converts OFW encoded-int datums
52 1.3 cgd * into the integer format of the host machine.
53 1.1 cgd *
54 1.3 cgd * It is primarily used to convert integer properties
55 1.3 cgd * returned by the OF_getprop routine.
56 1.2 cgd *
57 1.2 cgd * Arguments:
58 1.2 cgd * p pointer to unsigned char array which is an
59 1.2 cgd * OFW-encoded integer.
60 1.2 cgd *
61 1.2 cgd * Return Value:
62 1.2 cgd * Decoded integer value of argument p.
63 1.3 cgd *
64 1.3 cgd * Side Effects:
65 1.3 cgd * None.
66 1.1 cgd */
67 1.1 cgd int
68 1.14 dsl of_decode_int(const unsigned char *p)
69 1.1 cgd {
70 1.1 cgd unsigned int i = *p++ << 8;
71 1.1 cgd i = (i + *p++) << 8;
72 1.1 cgd i = (i + *p++) << 8;
73 1.1 cgd return (i + *p);
74 1.2 cgd }
75 1.2 cgd
76 1.2 cgd /*
77 1.3 cgd * int of_compatible(phandle, strings)
78 1.3 cgd *
79 1.2 cgd * This routine checks an OFW node's "compatible" entry to see if
80 1.2 cgd * it matches any of the provided strings.
81 1.2 cgd *
82 1.2 cgd * It should be used when determining whether a driver can drive
83 1.24 jmcneill * a particular device.
84 1.2 cgd *
85 1.2 cgd * Arguments:
86 1.2 cgd * phandle OFW phandle of device to be checked for
87 1.2 cgd * compatibility.
88 1.2 cgd * strings Array of containing expected "compatibility"
89 1.2 cgd * property values, presence of any of which
90 1.2 cgd * indicates compatibility.
91 1.2 cgd *
92 1.2 cgd * Return Value:
93 1.8 wiz * -1 if none of the strings are found in phandle's "compatibility"
94 1.24 jmcneill * property, or the reverse index of the matching string in the
95 1.24 jmcneill * phandle's "compatibility" property.
96 1.3 cgd *
97 1.3 cgd * Side Effects:
98 1.3 cgd * None.
99 1.2 cgd */
100 1.2 cgd int
101 1.12 garbled of_compatible(int phandle, const char * const *strings)
102 1.2 cgd {
103 1.24 jmcneill
104 1.38 rin int len, olen, allocated, nstr, cstr, rv;
105 1.38 rin char *buf, sbuf[OFW_MAX_STACK_BUF_SIZE];
106 1.2 cgd const char *sp, *nsp;
107 1.2 cgd
108 1.2 cgd len = OF_getproplen(phandle, "compatible");
109 1.2 cgd if (len <= 0)
110 1.2 cgd return (-1);
111 1.2 cgd
112 1.38 rin if (len > sizeof(sbuf)) {
113 1.38 rin buf = malloc(len, M_TEMP, M_WAITOK);
114 1.38 rin allocated = 1;
115 1.38 rin } else {
116 1.38 rin buf = sbuf;
117 1.38 rin allocated = 0;
118 1.38 rin }
119 1.2 cgd
120 1.2 cgd /* 'compatible' size should not change. */
121 1.2 cgd if (OF_getprop(phandle, "compatible", buf, len) != len) {
122 1.2 cgd rv = -1;
123 1.2 cgd goto out;
124 1.2 cgd }
125 1.2 cgd
126 1.24 jmcneill /* count 'compatible' strings */
127 1.24 jmcneill sp = buf;
128 1.24 jmcneill nstr = 0;
129 1.24 jmcneill olen = len;
130 1.24 jmcneill while (len && (nsp = memchr(sp, 0, len)) != NULL) {
131 1.24 jmcneill nsp++; /* skip over NUL char */
132 1.24 jmcneill len -= (nsp - sp);
133 1.24 jmcneill sp = nsp;
134 1.24 jmcneill nstr++;
135 1.24 jmcneill }
136 1.24 jmcneill len = olen;
137 1.24 jmcneill
138 1.2 cgd sp = buf;
139 1.24 jmcneill rv = nstr;
140 1.2 cgd while (len && (nsp = memchr(sp, 0, len)) != NULL) {
141 1.24 jmcneill rv--;
142 1.2 cgd /* look for a match among the strings provided */
143 1.24 jmcneill for (cstr = 0; strings[cstr] != NULL; cstr++)
144 1.24 jmcneill if (strcmp(sp, strings[cstr]) == 0)
145 1.2 cgd goto out;
146 1.2 cgd
147 1.2 cgd nsp++; /* skip over NUL char */
148 1.2 cgd len -= (nsp - sp);
149 1.2 cgd sp = nsp;
150 1.2 cgd }
151 1.2 cgd rv = -1;
152 1.2 cgd
153 1.2 cgd out:
154 1.38 rin if (allocated)
155 1.38 rin free(buf, M_TEMP);
156 1.2 cgd return (rv);
157 1.24 jmcneill }
158 1.10 perry
159 1.24 jmcneill /*
160 1.24 jmcneill * int of_match_compatible(phandle, strings)
161 1.24 jmcneill *
162 1.24 jmcneill * This routine checks an OFW node's "compatible" entry to see if
163 1.24 jmcneill * it matches any of the provided strings.
164 1.24 jmcneill *
165 1.24 jmcneill * It should be used when determining whether a driver can drive
166 1.24 jmcneill * a particular device.
167 1.24 jmcneill *
168 1.24 jmcneill * Arguments:
169 1.24 jmcneill * phandle OFW phandle of device to be checked for
170 1.24 jmcneill * compatibility.
171 1.24 jmcneill * strings Array of containing expected "compatibility"
172 1.24 jmcneill * property values, presence of any of which
173 1.24 jmcneill * indicates compatibility.
174 1.24 jmcneill *
175 1.24 jmcneill * Return Value:
176 1.24 jmcneill * 0 if none of the strings are found in phandle's "compatibility"
177 1.24 jmcneill * property, or a positive number based on the reverse index of the
178 1.24 jmcneill * matching string in the phandle's "compatibility" property, plus 1.
179 1.24 jmcneill *
180 1.24 jmcneill * Side Effects:
181 1.24 jmcneill * None.
182 1.24 jmcneill */
183 1.24 jmcneill int
184 1.24 jmcneill of_match_compatible(int phandle, const char * const *strings)
185 1.24 jmcneill {
186 1.24 jmcneill return of_compatible(phandle, strings) + 1;
187 1.3 cgd }
188 1.3 cgd
189 1.3 cgd /*
190 1.30 jmcneill * int of_match_compat_data(phandle, compat_data)
191 1.30 jmcneill *
192 1.30 jmcneill * This routine searches an array of compat_data structures for a
193 1.30 jmcneill * matching "compatible" entry matching the supplied OFW node.
194 1.30 jmcneill *
195 1.30 jmcneill * It should be used when determining whether a driver can drive
196 1.30 jmcneill * a particular device.
197 1.30 jmcneill *
198 1.30 jmcneill * Arguments:
199 1.30 jmcneill * phandle OFW phandle of device to be checked for
200 1.30 jmcneill * compatibility.
201 1.30 jmcneill * compat_data Array of possible compat entry strings and
202 1.30 jmcneill * associated metadata. The last entry in the
203 1.30 jmcneill * list should have a "compat" of NULL to terminate
204 1.30 jmcneill * the list.
205 1.30 jmcneill *
206 1.30 jmcneill * Return Value:
207 1.30 jmcneill * 0 if none of the strings are found in phandle's "compatibility"
208 1.30 jmcneill * property, or a positive number based on the reverse index of the
209 1.30 jmcneill * matching string in the phandle's "compatibility" property, plus 1.
210 1.30 jmcneill *
211 1.30 jmcneill * Side Effects:
212 1.30 jmcneill * None.
213 1.30 jmcneill */
214 1.30 jmcneill int
215 1.42 thorpej of_match_compat_data(int phandle,
216 1.42 thorpej const struct device_compatible_entry *compat_data)
217 1.30 jmcneill {
218 1.30 jmcneill for (; compat_data->compat != NULL; compat_data++) {
219 1.30 jmcneill const char *compat[] = { compat_data->compat, NULL };
220 1.30 jmcneill const int match = of_match_compatible(phandle, compat);
221 1.30 jmcneill if (match)
222 1.30 jmcneill return match;
223 1.30 jmcneill }
224 1.30 jmcneill return 0;
225 1.30 jmcneill }
226 1.30 jmcneill
227 1.30 jmcneill /*
228 1.29 jmcneill * const struct of_compat_data *of_search_compatible(phandle, compat_data)
229 1.29 jmcneill *
230 1.29 jmcneill * This routine searches an array of compat_data structures for a
231 1.29 jmcneill * matching "compatible" entry matching the supplied OFW node.
232 1.29 jmcneill *
233 1.29 jmcneill * Arguments:
234 1.29 jmcneill * phandle OFW phandle of device to be checked for
235 1.29 jmcneill * compatibility.
236 1.29 jmcneill * compat_data Array of possible compat entry strings and
237 1.29 jmcneill * associated metadata. The last entry in the
238 1.29 jmcneill * list should have a "compat" of NULL to terminate
239 1.29 jmcneill * the list.
240 1.29 jmcneill *
241 1.29 jmcneill * Return Value:
242 1.29 jmcneill * The first matching compat_data entry in the array. If no matches
243 1.29 jmcneill * are found, the terminating ("compat" of NULL) record is returned.
244 1.29 jmcneill *
245 1.29 jmcneill * Side Effects:
246 1.29 jmcneill * None.
247 1.29 jmcneill */
248 1.42 thorpej const struct device_compatible_entry *
249 1.42 thorpej of_search_compatible(int phandle,
250 1.42 thorpej const struct device_compatible_entry *compat_data)
251 1.29 jmcneill {
252 1.29 jmcneill for (; compat_data->compat != NULL; compat_data++) {
253 1.29 jmcneill const char *compat[] = { compat_data->compat, NULL };
254 1.29 jmcneill if (of_match_compatible(phandle, compat))
255 1.29 jmcneill break;
256 1.29 jmcneill }
257 1.29 jmcneill return compat_data;
258 1.29 jmcneill }
259 1.29 jmcneill
260 1.29 jmcneill /*
261 1.4 cgd * int of_packagename(phandle, buf, bufsize)
262 1.3 cgd *
263 1.3 cgd * This routine places the last component of an OFW node's name
264 1.3 cgd * into a user-provided buffer.
265 1.3 cgd *
266 1.3 cgd * It can be used during autoconfiguration to make printing of
267 1.3 cgd * device names more informative.
268 1.3 cgd *
269 1.3 cgd * Arguments:
270 1.3 cgd * phandle OFW phandle of device whose name name is
271 1.3 cgd * desired.
272 1.3 cgd * buf Buffer to contain device name, provided by
273 1.3 cgd * caller. (For now, must be at least 4
274 1.3 cgd * bytes long.)
275 1.3 cgd * bufsize Length of buffer referenced by 'buf', in
276 1.3 cgd * bytes.
277 1.3 cgd *
278 1.3 cgd * Return Value:
279 1.3 cgd * -1 if the device path name could not be obtained or would
280 1.3 cgd * not fit in the allocated temporary buffer, or zero otherwise
281 1.6 soren * (meaning that the leaf node name was successfully extracted).
282 1.3 cgd *
283 1.3 cgd * Side Effects:
284 1.3 cgd * If the leaf node name was successfully extracted, 'buf' is
285 1.3 cgd * filled in with at most 'bufsize' bytes of the leaf node
286 1.3 cgd * name. If the leaf node was not successfully extracted, a
287 1.3 cgd * somewhat meaningful string is placed in the buffer. In
288 1.3 cgd * either case, the contents of 'buf' will be NUL-terminated.
289 1.3 cgd */
290 1.3 cgd int
291 1.12 garbled of_packagename(int phandle, char *buf, int bufsize)
292 1.3 cgd {
293 1.3 cgd char *pbuf;
294 1.3 cgd const char *lastslash;
295 1.3 cgd int l, rv;
296 1.3 cgd
297 1.3 cgd pbuf = malloc(OFW_PATH_BUF_SIZE, M_TEMP, M_WAITOK);
298 1.3 cgd l = OF_package_to_path(phandle, pbuf, OFW_PATH_BUF_SIZE);
299 1.3 cgd
300 1.3 cgd /* check that we could get the name, and that it's not too long. */
301 1.3 cgd if (l < 0 ||
302 1.3 cgd (l == OFW_PATH_BUF_SIZE && pbuf[OFW_PATH_BUF_SIZE - 1] != '\0')) {
303 1.3 cgd if (bufsize >= 25)
304 1.9 itojun snprintf(buf, bufsize, "??? (phandle 0x%x)", phandle);
305 1.3 cgd else if (bufsize >= 4)
306 1.9 itojun strlcpy(buf, "???", bufsize);
307 1.3 cgd else
308 1.4 cgd panic("of_packagename: bufsize = %d is silly",
309 1.4 cgd bufsize);
310 1.3 cgd rv = -1;
311 1.3 cgd } else {
312 1.5 mycroft pbuf[l] = '\0';
313 1.3 cgd lastslash = strrchr(pbuf, '/');
314 1.9 itojun strlcpy(buf, (lastslash == NULL) ? pbuf : (lastslash + 1),
315 1.3 cgd bufsize);
316 1.3 cgd rv = 0;
317 1.3 cgd }
318 1.3 cgd
319 1.3 cgd free(pbuf, M_TEMP);
320 1.3 cgd return (rv);
321 1.1 cgd }
322 1.12 garbled
323 1.12 garbled /*
324 1.13 garbled * Find the first child of a given node that matches name. Does not recurse.
325 1.12 garbled */
326 1.12 garbled int
327 1.12 garbled of_find_firstchild_byname(int node, const char *name)
328 1.12 garbled {
329 1.12 garbled char namex[32];
330 1.12 garbled int nn;
331 1.12 garbled
332 1.12 garbled for (nn = OF_child(node); nn; nn = OF_peer(nn)) {
333 1.12 garbled memset(namex, 0, sizeof(namex));
334 1.12 garbled if (OF_getprop(nn, "name", namex, sizeof(namex)) == -1)
335 1.12 garbled continue;
336 1.12 garbled if (strcmp(name, namex) == 0)
337 1.12 garbled return nn;
338 1.12 garbled }
339 1.12 garbled return -1;
340 1.12 garbled }
341 1.13 garbled
342 1.13 garbled /*
343 1.40 jmcneill * Find a child node that is compatible with str. Recurses, starting at node.
344 1.40 jmcneill */
345 1.40 jmcneill int
346 1.40 jmcneill of_find_bycompat(int node, const char *str)
347 1.40 jmcneill {
348 1.40 jmcneill const char * compatible[] = { str, NULL };
349 1.40 jmcneill int child, ret;
350 1.40 jmcneill
351 1.40 jmcneill for (child = OF_child(node); child; child = OF_peer(child)) {
352 1.40 jmcneill if (of_match_compatible(child, compatible) != 0)
353 1.40 jmcneill return child;
354 1.40 jmcneill ret = of_find_bycompat(child, str);
355 1.40 jmcneill if (ret != -1)
356 1.40 jmcneill return ret;
357 1.40 jmcneill }
358 1.40 jmcneill
359 1.40 jmcneill return -1;
360 1.40 jmcneill }
361 1.40 jmcneill
362 1.40 jmcneill /*
363 1.13 garbled * Find a give node by name. Recurses, and seems to walk upwards too.
364 1.13 garbled */
365 1.13 garbled
366 1.13 garbled int
367 1.13 garbled of_getnode_byname(int start, const char *target)
368 1.13 garbled {
369 1.13 garbled int node, next;
370 1.13 garbled char name[64];
371 1.13 garbled
372 1.13 garbled if (start == 0)
373 1.13 garbled start = OF_peer(0);
374 1.13 garbled
375 1.13 garbled for (node = start; node; node = next) {
376 1.13 garbled memset(name, 0, sizeof name);
377 1.13 garbled OF_getprop(node, "name", name, sizeof name - 1);
378 1.13 garbled if (strcmp(name, target) == 0)
379 1.13 garbled break;
380 1.13 garbled
381 1.13 garbled if ((next = OF_child(node)) != 0)
382 1.13 garbled continue;
383 1.13 garbled
384 1.13 garbled while (node) {
385 1.13 garbled if ((next = OF_peer(node)) != 0)
386 1.13 garbled break;
387 1.13 garbled node = OF_parent(node);
388 1.13 garbled }
389 1.13 garbled }
390 1.13 garbled
391 1.13 garbled /* XXX is this correct? */
392 1.13 garbled return node;
393 1.13 garbled }
394 1.13 garbled
395 1.13 garbled /*
396 1.13 garbled * Create a uint32_t integer property from an OFW node property.
397 1.13 garbled */
398 1.13 garbled
399 1.13 garbled boolean_t
400 1.13 garbled of_to_uint32_prop(prop_dictionary_t dict, int node, const char *ofname,
401 1.13 garbled const char *propname)
402 1.13 garbled {
403 1.13 garbled uint32_t prop;
404 1.13 garbled
405 1.13 garbled if (OF_getprop(node, ofname, &prop, sizeof(prop)) != sizeof(prop))
406 1.13 garbled return FALSE;
407 1.13 garbled
408 1.13 garbled return(prop_dictionary_set_uint32(dict, propname, prop));
409 1.13 garbled }
410 1.13 garbled
411 1.13 garbled /*
412 1.13 garbled * Create a data property from an OFW node property. Max size of 256bytes.
413 1.13 garbled */
414 1.13 garbled
415 1.13 garbled boolean_t
416 1.13 garbled of_to_dataprop(prop_dictionary_t dict, int node, const char *ofname,
417 1.13 garbled const char *propname)
418 1.13 garbled {
419 1.13 garbled int len;
420 1.13 garbled uint8_t prop[256];
421 1.13 garbled
422 1.13 garbled len = OF_getprop(node, ofname, prop, 256);
423 1.13 garbled if (len < 1)
424 1.13 garbled return FALSE;
425 1.13 garbled
426 1.36 thorpej return prop_dictionary_set_data(dict, propname, prop, len);
427 1.13 garbled }
428 1.15 macallan
429 1.15 macallan /*
430 1.15 macallan * look at output-device, see if there's a Sun-typical video mode specifier as
431 1.15 macallan * in screen:r1024x768x60 attached. If found copy it into *buffer, otherwise
432 1.15 macallan * return NULL
433 1.15 macallan */
434 1.15 macallan
435 1.15 macallan char *
436 1.15 macallan of_get_mode_string(char *buffer, int len)
437 1.15 macallan {
438 1.15 macallan int options;
439 1.15 macallan char *pos, output_device[256];
440 1.15 macallan
441 1.15 macallan /*
442 1.15 macallan * finally, let's see if there's a video mode specified in
443 1.15 macallan * output-device and pass it on so there's at least some way
444 1.15 macallan * to program video modes
445 1.15 macallan */
446 1.15 macallan options = OF_finddevice("/options");
447 1.15 macallan if ((options == 0) || (options == -1))
448 1.15 macallan return NULL;
449 1.15 macallan if (OF_getprop(options, "output-device", output_device, 256) == 0)
450 1.15 macallan return NULL;
451 1.15 macallan
452 1.15 macallan /* find the mode string if there is one */
453 1.15 macallan pos = strstr(output_device, ":r");
454 1.15 macallan if (pos == NULL)
455 1.15 macallan return NULL;
456 1.15 macallan strncpy(buffer, pos + 2, len);
457 1.15 macallan return buffer;
458 1.15 macallan }
459 1.17 martin
460 1.17 martin /*
461 1.17 martin * Iterate over the subtree of a i2c controller node.
462 1.17 martin * Add all sub-devices into an array as part of the controller's
463 1.17 martin * device properties.
464 1.17 martin * This is used by the i2c bus attach code to do direct configuration.
465 1.17 martin */
466 1.17 martin void
467 1.26 jmcneill of_enter_i2c_devs(prop_dictionary_t props, int ofnode, size_t cell_size,
468 1.26 jmcneill int addr_shift)
469 1.17 martin {
470 1.17 martin int node, len;
471 1.31 thorpej char name[32];
472 1.18 martin uint64_t reg64;
473 1.18 martin uint32_t reg32;
474 1.18 martin uint64_t addr;
475 1.19 jdc prop_array_t array = NULL;
476 1.17 martin prop_dictionary_t dev;
477 1.17 martin
478 1.17 martin for (node = OF_child(ofnode); node; node = OF_peer(node)) {
479 1.17 martin if (OF_getprop(node, "name", name, sizeof(name)) <= 0)
480 1.17 martin continue;
481 1.17 martin len = OF_getproplen(node, "reg");
482 1.18 martin addr = 0;
483 1.18 martin if (cell_size == 8 && len >= sizeof(reg64)) {
484 1.18 martin if (OF_getprop(node, "reg", ®64, sizeof(reg64))
485 1.18 martin < sizeof(reg64))
486 1.17 martin continue;
487 1.25 jmcneill addr = be64toh(reg64);
488 1.20 jdc /*
489 1.20 jdc * The i2c bus number (0 or 1) is encoded in bit 33
490 1.20 jdc * of the register, but we encode it in bit 8 of
491 1.20 jdc * i2c_addr_t.
492 1.20 jdc */
493 1.20 jdc if (addr & 0x100000000)
494 1.20 jdc addr = (addr & 0xff) | 0x100;
495 1.18 martin } else if (cell_size == 4 && len >= sizeof(reg32)) {
496 1.18 martin if (OF_getprop(node, "reg", ®32, sizeof(reg32))
497 1.18 martin < sizeof(reg32))
498 1.17 martin continue;
499 1.25 jmcneill addr = be32toh(reg32);
500 1.17 martin } else {
501 1.18 martin continue;
502 1.17 martin }
503 1.26 jmcneill addr >>= addr_shift;
504 1.18 martin if (addr == 0) continue;
505 1.17 martin
506 1.19 jdc if (array == NULL)
507 1.19 jdc array = prop_array_create();
508 1.19 jdc
509 1.17 martin dev = prop_dictionary_create();
510 1.35 thorpej prop_dictionary_set_string(dev, "name", name);
511 1.18 martin prop_dictionary_set_uint32(dev, "addr", addr);
512 1.17 martin prop_dictionary_set_uint64(dev, "cookie", node);
513 1.17 martin of_to_dataprop(dev, node, "compatible", "compatible");
514 1.17 martin prop_array_add(array, dev);
515 1.17 martin prop_object_release(dev);
516 1.17 martin }
517 1.17 martin
518 1.19 jdc if (array != NULL) {
519 1.19 jdc prop_dictionary_set(props, "i2c-child-devices", array);
520 1.19 jdc prop_object_release(array);
521 1.19 jdc }
522 1.17 martin }
523 1.27 jmcneill
524 1.34 tnn void
525 1.34 tnn of_enter_spi_devs(prop_dictionary_t props, int ofnode, size_t cell_size)
526 1.34 tnn {
527 1.34 tnn int node, len;
528 1.34 tnn char name[32];
529 1.34 tnn uint64_t reg64;
530 1.34 tnn uint32_t reg32;
531 1.34 tnn uint32_t slave;
532 1.34 tnn u_int32_t maxfreq;
533 1.34 tnn prop_array_t array = NULL;
534 1.34 tnn prop_dictionary_t dev;
535 1.34 tnn int mode;
536 1.34 tnn
537 1.34 tnn for (node = OF_child(ofnode); node; node = OF_peer(node)) {
538 1.34 tnn if (OF_getprop(node, "name", name, sizeof(name)) <= 0)
539 1.34 tnn continue;
540 1.34 tnn len = OF_getproplen(node, "reg");
541 1.34 tnn slave = 0;
542 1.34 tnn if (cell_size == 8 && len >= sizeof(reg64)) {
543 1.34 tnn if (OF_getprop(node, "reg", ®64, sizeof(reg64))
544 1.34 tnn < sizeof(reg64))
545 1.34 tnn continue;
546 1.34 tnn slave = be64toh(reg64);
547 1.34 tnn } else if (cell_size == 4 && len >= sizeof(reg32)) {
548 1.34 tnn if (OF_getprop(node, "reg", ®32, sizeof(reg32))
549 1.34 tnn < sizeof(reg32))
550 1.34 tnn continue;
551 1.34 tnn slave = be32toh(reg32);
552 1.34 tnn } else {
553 1.34 tnn continue;
554 1.34 tnn }
555 1.34 tnn if (of_getprop_uint32(node, "spi-max-frequency", &maxfreq)) {
556 1.34 tnn maxfreq = 0;
557 1.34 tnn }
558 1.34 tnn mode = ((int)of_hasprop(node, "cpol") << 1) | (int)of_hasprop(node, "cpha");
559 1.34 tnn
560 1.34 tnn if (array == NULL)
561 1.34 tnn array = prop_array_create();
562 1.34 tnn
563 1.34 tnn dev = prop_dictionary_create();
564 1.35 thorpej prop_dictionary_set_string(dev, "name", name);
565 1.34 tnn prop_dictionary_set_uint32(dev, "slave", slave);
566 1.34 tnn prop_dictionary_set_uint32(dev, "mode", mode);
567 1.34 tnn if (maxfreq > 0)
568 1.34 tnn prop_dictionary_set_uint32(dev, "spi-max-frequency", maxfreq);
569 1.34 tnn prop_dictionary_set_uint64(dev, "cookie", node);
570 1.34 tnn of_to_dataprop(dev, node, "compatible", "compatible");
571 1.34 tnn prop_array_add(array, dev);
572 1.34 tnn prop_object_release(dev);
573 1.34 tnn }
574 1.34 tnn
575 1.34 tnn if (array != NULL) {
576 1.34 tnn prop_dictionary_set(props, "spi-child-devices", array);
577 1.34 tnn prop_object_release(array);
578 1.34 tnn }
579 1.34 tnn }
580 1.34 tnn
581 1.34 tnn
582 1.27 jmcneill /*
583 1.28 jmcneill * Returns true if the specified property is present.
584 1.27 jmcneill */
585 1.27 jmcneill bool
586 1.28 jmcneill of_hasprop(int node, const char *prop)
587 1.27 jmcneill {
588 1.27 jmcneill return OF_getproplen(node, prop) >= 0;
589 1.27 jmcneill }
590 1.27 jmcneill
591 1.27 jmcneill /*
592 1.27 jmcneill * Get the value of a uint32 property, compensating for host byte order.
593 1.27 jmcneill * Returns 0 on success, non-zero on failure.
594 1.27 jmcneill */
595 1.27 jmcneill int
596 1.27 jmcneill of_getprop_uint32(int node, const char *prop, uint32_t *val)
597 1.27 jmcneill {
598 1.27 jmcneill uint32_t v;
599 1.27 jmcneill int len;
600 1.27 jmcneill
601 1.27 jmcneill len = OF_getprop(node, prop, &v, sizeof(v));
602 1.27 jmcneill if (len != sizeof(v))
603 1.27 jmcneill return -1;
604 1.27 jmcneill
605 1.27 jmcneill *val = be32toh(v);
606 1.27 jmcneill return 0;
607 1.27 jmcneill }
608 1.32 jmcneill
609 1.41 ryo int
610 1.41 ryo of_getprop_uint32_array(int node, const char *prop, uint32_t *array, int n)
611 1.41 ryo {
612 1.41 ryo uint32_t *v = array;
613 1.41 ryo int len;
614 1.41 ryo
615 1.41 ryo len = OF_getprop(node, prop, array, n * sizeof(*v));
616 1.41 ryo if (len < (int)(n * sizeof(*v)))
617 1.41 ryo return -1;
618 1.41 ryo
619 1.41 ryo for (; n > 0; n--) {
620 1.41 ryo BE32TOH(*v);
621 1.41 ryo v++;
622 1.41 ryo }
623 1.41 ryo
624 1.41 ryo return 0;
625 1.41 ryo }
626 1.32 jmcneill /*
627 1.32 jmcneill * Get the value of a uint64 property, compensating for host byte order.
628 1.32 jmcneill * Returns 0 on success, non-zero on failure.
629 1.32 jmcneill */
630 1.32 jmcneill int
631 1.32 jmcneill of_getprop_uint64(int node, const char *prop, uint64_t *val)
632 1.32 jmcneill {
633 1.32 jmcneill uint64_t v;
634 1.32 jmcneill int len;
635 1.32 jmcneill
636 1.32 jmcneill len = OF_getprop(node, prop, &v, sizeof(v));
637 1.32 jmcneill if (len != sizeof(v))
638 1.32 jmcneill return -1;
639 1.32 jmcneill
640 1.32 jmcneill *val = be64toh(v);
641 1.32 jmcneill return 0;
642 1.32 jmcneill }
643