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