]>
Commit | Line | Data |
---|---|---|
35748177 GVB |
1 | /* |
2 | * libfdt - Flat Device Tree manipulation | |
3 | * Copyright (C) 2006 David Gibson, IBM Corporation. | |
35084760 | 4 | * SPDX-License-Identifier: GPL-2.0+ BSD-2-Clause |
35748177 | 5 | */ |
6feed2a5 | 6 | #include <libfdt_env.h> |
35748177 | 7 | |
8cf30809 | 8 | #ifndef USE_HOSTCC |
35748177 GVB |
9 | #include <fdt.h> |
10 | #include <libfdt.h> | |
8cf30809 BS |
11 | #else |
12 | #include "fdt_host.h" | |
13 | #endif | |
35748177 GVB |
14 | |
15 | #include "libfdt_internal.h" | |
16 | ||
fc7758ee DG |
17 | static int _fdt_nodename_eq(const void *fdt, int offset, |
18 | const char *s, int len) | |
35748177 | 19 | { |
ae0b5908 | 20 | const char *p = fdt_offset_ptr(fdt, offset + FDT_TAGSIZE, len+1); |
35748177 | 21 | |
6feed2a5 | 22 | if (!p) |
35748177 GVB |
23 | /* short match */ |
24 | return 0; | |
25 | ||
26 | if (memcmp(p, s, len) != 0) | |
27 | return 0; | |
28 | ||
8d04f02f KG |
29 | if (p[len] == '\0') |
30 | return 1; | |
31 | else if (!memchr(s, '@', len) && (p[len] == '@')) | |
32 | return 1; | |
33 | else | |
35748177 | 34 | return 0; |
35748177 GVB |
35 | } |
36 | ||
8d04f02f | 37 | const char *fdt_string(const void *fdt, int stroffset) |
9675ee72 | 38 | { |
c6683026 | 39 | return (const char *)fdt + fdt_off_dt_strings(fdt) + stroffset; |
8d04f02f | 40 | } |
9675ee72 | 41 | |
0219399a DG |
42 | static int _fdt_string_eq(const void *fdt, int stroffset, |
43 | const char *s, int len) | |
44 | { | |
45 | const char *p = fdt_string(fdt, stroffset); | |
46 | ||
af67b252 | 47 | return (strnlen(p, len + 1) == len) && (memcmp(p, s, len) == 0); |
0219399a DG |
48 | } |
49 | ||
57c7809a MR |
50 | uint32_t fdt_get_max_phandle(const void *fdt) |
51 | { | |
52 | uint32_t max_phandle = 0; | |
53 | int offset; | |
54 | ||
55 | for (offset = fdt_next_node(fdt, -1, NULL);; | |
56 | offset = fdt_next_node(fdt, offset, NULL)) { | |
57 | uint32_t phandle; | |
58 | ||
59 | if (offset == -FDT_ERR_NOTFOUND) | |
60 | return max_phandle; | |
61 | ||
62 | if (offset < 0) | |
63 | return 0; | |
64 | ||
65 | phandle = fdt_get_phandle(fdt, offset); | |
66 | if (phandle == (uint32_t)-1) | |
67 | return 0; | |
68 | ||
69 | if (phandle > max_phandle) | |
70 | max_phandle = phandle; | |
71 | } | |
72 | ||
73 | return 0; | |
74 | } | |
75 | ||
8d04f02f KG |
76 | int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size) |
77 | { | |
fc7758ee | 78 | FDT_CHECK_HEADER(fdt); |
8d04f02f KG |
79 | *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address); |
80 | *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size); | |
9675ee72 GVB |
81 | return 0; |
82 | } | |
83 | ||
8d04f02f | 84 | int fdt_num_mem_rsv(const void *fdt) |
35748177 | 85 | { |
8d04f02f KG |
86 | int i = 0; |
87 | ||
88 | while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0) | |
89 | i++; | |
90 | return i; | |
35748177 GVB |
91 | } |
92 | ||
d1c63148 DG |
93 | static int _nextprop(const void *fdt, int offset) |
94 | { | |
95 | uint32_t tag; | |
96 | int nextoffset; | |
97 | ||
98 | do { | |
99 | tag = fdt_next_tag(fdt, offset, &nextoffset); | |
100 | ||
101 | switch (tag) { | |
102 | case FDT_END: | |
103 | if (nextoffset >= 0) | |
104 | return -FDT_ERR_BADSTRUCTURE; | |
105 | else | |
106 | return nextoffset; | |
107 | ||
108 | case FDT_PROP: | |
109 | return offset; | |
110 | } | |
111 | offset = nextoffset; | |
112 | } while (tag == FDT_NOP); | |
113 | ||
114 | return -FDT_ERR_NOTFOUND; | |
115 | } | |
116 | ||
ae0b5908 | 117 | int fdt_subnode_offset_namelen(const void *fdt, int offset, |
35748177 GVB |
118 | const char *name, int namelen) |
119 | { | |
2c0b843e | 120 | int depth; |
35748177 | 121 | |
fc7758ee | 122 | FDT_CHECK_HEADER(fdt); |
35748177 | 123 | |
2c0b843e DG |
124 | for (depth = 0; |
125 | (offset >= 0) && (depth >= 0); | |
126 | offset = fdt_next_node(fdt, offset, &depth)) | |
127 | if ((depth == 1) | |
128 | && _fdt_nodename_eq(fdt, offset, name, namelen)) | |
ae0b5908 | 129 | return offset; |
35748177 | 130 | |
2c0b843e | 131 | if (depth < 0) |
4bc7deee | 132 | return -FDT_ERR_NOTFOUND; |
2c0b843e | 133 | return offset; /* error */ |
35748177 GVB |
134 | } |
135 | ||
136 | int fdt_subnode_offset(const void *fdt, int parentoffset, | |
137 | const char *name) | |
138 | { | |
139 | return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name)); | |
140 | } | |
141 | ||
77d7fff8 | 142 | /* |
6f5f92c6 | 143 | * Find the next of path separator, note we need to search for both '/' and ':' |
6feed2a5 | 144 | * and then take the first one so that we do the right thing for e.g. |
77d7fff8 HG |
145 | * "foo/bar:option" and "bar:option/otheroption", both of which happen, so |
146 | * first searching for either ':' or '/' does not work. | |
147 | */ | |
8e968571 | 148 | static const char *fdt_path_next_separator(const char *path, int len) |
77d7fff8 | 149 | { |
8e968571 MR |
150 | const void *sep1 = memchr(path, '/', len); |
151 | const void *sep2 = memchr(path, ':', len); | |
77d7fff8 HG |
152 | |
153 | if (sep1 && sep2) | |
154 | return (sep1 < sep2) ? sep1 : sep2; | |
155 | else if (sep1) | |
156 | return sep1; | |
157 | else | |
158 | return sep2; | |
159 | } | |
160 | ||
8e968571 | 161 | int fdt_path_offset_namelen(const void *fdt, const char *path, int namelen) |
35748177 | 162 | { |
8e968571 | 163 | const char *end = path + namelen; |
35748177 GVB |
164 | const char *p = path; |
165 | int offset = 0; | |
166 | ||
fc7758ee | 167 | FDT_CHECK_HEADER(fdt); |
35748177 | 168 | |
feeca3f5 KG |
169 | /* see if we have an alias */ |
170 | if (*path != '/') { | |
8e968571 | 171 | const char *q = fdt_path_next_separator(path, namelen); |
feeca3f5 | 172 | |
feeca3f5 KG |
173 | if (!q) |
174 | q = end; | |
175 | ||
9a6cf73a | 176 | p = fdt_get_alias_namelen(fdt, p, q - p); |
feeca3f5 KG |
177 | if (!p) |
178 | return -FDT_ERR_BADPATH; | |
179 | offset = fdt_path_offset(fdt, p); | |
180 | ||
181 | p = q; | |
182 | } | |
35748177 | 183 | |
8e968571 | 184 | while (*p && (p < end)) { |
35748177 GVB |
185 | const char *q; |
186 | ||
187 | while (*p == '/') | |
188 | p++; | |
8e968571 | 189 | |
77d7fff8 | 190 | if (*p == '\0' || *p == ':') |
8d04f02f | 191 | return offset; |
8e968571 MR |
192 | |
193 | q = fdt_path_next_separator(p, end - p); | |
6feed2a5 | 194 | if (!q) |
35748177 GVB |
195 | q = end; |
196 | ||
197 | offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p); | |
198 | if (offset < 0) | |
199 | return offset; | |
200 | ||
201 | p = q; | |
202 | } | |
203 | ||
aea03c4e | 204 | return offset; |
35748177 GVB |
205 | } |
206 | ||
8d04f02f KG |
207 | const char *fdt_get_name(const void *fdt, int nodeoffset, int *len) |
208 | { | |
2f08bfa9 | 209 | const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset); |
8d04f02f KG |
210 | int err; |
211 | ||
2f08bfa9 DG |
212 | if (((err = fdt_check_header(fdt)) != 0) |
213 | || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0)) | |
214 | goto fail; | |
8d04f02f KG |
215 | |
216 | if (len) | |
217 | *len = strlen(nh->name); | |
218 | ||
219 | return nh->name; | |
220 | ||
221 | fail: | |
222 | if (len) | |
223 | *len = err; | |
224 | return NULL; | |
225 | } | |
226 | ||
d1c63148 DG |
227 | int fdt_first_property_offset(const void *fdt, int nodeoffset) |
228 | { | |
229 | int offset; | |
230 | ||
231 | if ((offset = _fdt_check_node_offset(fdt, nodeoffset)) < 0) | |
232 | return offset; | |
233 | ||
234 | return _nextprop(fdt, offset); | |
235 | } | |
236 | ||
237 | int fdt_next_property_offset(const void *fdt, int offset) | |
238 | { | |
239 | if ((offset = _fdt_check_prop_offset(fdt, offset)) < 0) | |
240 | return offset; | |
241 | ||
242 | return _nextprop(fdt, offset); | |
243 | } | |
244 | ||
245 | const struct fdt_property *fdt_get_property_by_offset(const void *fdt, | |
246 | int offset, | |
247 | int *lenp) | |
35748177 | 248 | { |
35748177 | 249 | int err; |
d1c63148 | 250 | const struct fdt_property *prop; |
35748177 | 251 | |
d1c63148 DG |
252 | if ((err = _fdt_check_prop_offset(fdt, offset)) < 0) { |
253 | if (lenp) | |
254 | *lenp = err; | |
255 | return NULL; | |
256 | } | |
35748177 | 257 | |
d1c63148 | 258 | prop = _fdt_offset_ptr(fdt, offset); |
35748177 | 259 | |
d1c63148 DG |
260 | if (lenp) |
261 | *lenp = fdt32_to_cpu(prop->len); | |
35748177 | 262 | |
d1c63148 DG |
263 | return prop; |
264 | } | |
265 | ||
266 | const struct fdt_property *fdt_get_property_namelen(const void *fdt, | |
267 | int offset, | |
268 | const char *name, | |
269 | int namelen, int *lenp) | |
270 | { | |
271 | for (offset = fdt_first_property_offset(fdt, offset); | |
272 | (offset >= 0); | |
273 | (offset = fdt_next_property_offset(fdt, offset))) { | |
274 | const struct fdt_property *prop; | |
275 | ||
276 | if (!(prop = fdt_get_property_by_offset(fdt, offset, lenp))) { | |
277 | offset = -FDT_ERR_INTERNAL; | |
35748177 | 278 | break; |
35748177 | 279 | } |
d1c63148 DG |
280 | if (_fdt_string_eq(fdt, fdt32_to_cpu(prop->nameoff), |
281 | name, namelen)) | |
282 | return prop; | |
283 | } | |
35748177 | 284 | |
35748177 | 285 | if (lenp) |
d1c63148 | 286 | *lenp = offset; |
35748177 GVB |
287 | return NULL; |
288 | } | |
289 | ||
0219399a DG |
290 | const struct fdt_property *fdt_get_property(const void *fdt, |
291 | int nodeoffset, | |
292 | const char *name, int *lenp) | |
293 | { | |
294 | return fdt_get_property_namelen(fdt, nodeoffset, name, | |
295 | strlen(name), lenp); | |
296 | } | |
297 | ||
298 | const void *fdt_getprop_namelen(const void *fdt, int nodeoffset, | |
299 | const char *name, int namelen, int *lenp) | |
35748177 GVB |
300 | { |
301 | const struct fdt_property *prop; | |
302 | ||
0219399a | 303 | prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp); |
6feed2a5 | 304 | if (!prop) |
35748177 GVB |
305 | return NULL; |
306 | ||
8d04f02f | 307 | return prop->data; |
3af0d587 GVB |
308 | } |
309 | ||
d1c63148 DG |
310 | const void *fdt_getprop_by_offset(const void *fdt, int offset, |
311 | const char **namep, int *lenp) | |
312 | { | |
313 | const struct fdt_property *prop; | |
314 | ||
315 | prop = fdt_get_property_by_offset(fdt, offset, lenp); | |
316 | if (!prop) | |
317 | return NULL; | |
318 | if (namep) | |
319 | *namep = fdt_string(fdt, fdt32_to_cpu(prop->nameoff)); | |
320 | return prop->data; | |
321 | } | |
322 | ||
0219399a DG |
323 | const void *fdt_getprop(const void *fdt, int nodeoffset, |
324 | const char *name, int *lenp) | |
325 | { | |
326 | return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp); | |
327 | } | |
328 | ||
8d04f02f KG |
329 | uint32_t fdt_get_phandle(const void *fdt, int nodeoffset) |
330 | { | |
b2ba62a1 | 331 | const fdt32_t *php; |
8d04f02f | 332 | int len; |
3af0d587 | 333 | |
05a22ba0 DG |
334 | /* FIXME: This is a bit sub-optimal, since we potentially scan |
335 | * over all the properties twice. */ | |
336 | php = fdt_getprop(fdt, nodeoffset, "phandle", &len); | |
337 | if (!php || (len != sizeof(*php))) { | |
338 | php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len); | |
339 | if (!php || (len != sizeof(*php))) | |
340 | return 0; | |
341 | } | |
8d04f02f KG |
342 | |
343 | return fdt32_to_cpu(*php); | |
344 | } | |
345 | ||
9a6cf73a DG |
346 | const char *fdt_get_alias_namelen(const void *fdt, |
347 | const char *name, int namelen) | |
348 | { | |
349 | int aliasoffset; | |
350 | ||
351 | aliasoffset = fdt_path_offset(fdt, "/aliases"); | |
352 | if (aliasoffset < 0) | |
353 | return NULL; | |
354 | ||
355 | return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL); | |
356 | } | |
357 | ||
358 | const char *fdt_get_alias(const void *fdt, const char *name) | |
359 | { | |
360 | return fdt_get_alias_namelen(fdt, name, strlen(name)); | |
361 | } | |
362 | ||
8d04f02f | 363 | int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen) |
3af0d587 | 364 | { |
ae0b5908 DG |
365 | int pdepth = 0, p = 0; |
366 | int offset, depth, namelen; | |
8d04f02f KG |
367 | const char *name; |
368 | ||
fc7758ee | 369 | FDT_CHECK_HEADER(fdt); |
8d04f02f | 370 | |
8d04f02f KG |
371 | if (buflen < 2) |
372 | return -FDT_ERR_NOSPACE; | |
8d04f02f | 373 | |
ae0b5908 DG |
374 | for (offset = 0, depth = 0; |
375 | (offset >= 0) && (offset <= nodeoffset); | |
376 | offset = fdt_next_node(fdt, offset, &depth)) { | |
ae0b5908 DG |
377 | while (pdepth > depth) { |
378 | do { | |
379 | p--; | |
380 | } while (buf[p-1] != '/'); | |
381 | pdepth--; | |
382 | } | |
383 | ||
bbdbc7cb DG |
384 | if (pdepth >= depth) { |
385 | name = fdt_get_name(fdt, offset, &namelen); | |
386 | if (!name) | |
387 | return namelen; | |
388 | if ((p + namelen + 1) <= buflen) { | |
389 | memcpy(buf + p, name, namelen); | |
390 | p += namelen; | |
391 | buf[p++] = '/'; | |
392 | pdepth++; | |
393 | } | |
ae0b5908 | 394 | } |
8d04f02f | 395 | |
ae0b5908 DG |
396 | if (offset == nodeoffset) { |
397 | if (pdepth < (depth + 1)) | |
398 | return -FDT_ERR_NOSPACE; | |
8d04f02f | 399 | |
ae0b5908 DG |
400 | if (p > 1) /* special case so that root path is "/", not "" */ |
401 | p--; | |
402 | buf[p] = '\0'; | |
bbdbc7cb | 403 | return 0; |
3af0d587 | 404 | } |
3af0d587 GVB |
405 | } |
406 | ||
ae0b5908 DG |
407 | if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0)) |
408 | return -FDT_ERR_BADOFFSET; | |
409 | else if (offset == -FDT_ERR_BADOFFSET) | |
410 | return -FDT_ERR_BADSTRUCTURE; | |
3af0d587 | 411 | |
ae0b5908 | 412 | return offset; /* error from fdt_next_node() */ |
35748177 | 413 | } |
3f9f08cf | 414 | |
8d04f02f KG |
415 | int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset, |
416 | int supernodedepth, int *nodedepth) | |
417 | { | |
ae0b5908 | 418 | int offset, depth; |
8d04f02f KG |
419 | int supernodeoffset = -FDT_ERR_INTERNAL; |
420 | ||
fc7758ee | 421 | FDT_CHECK_HEADER(fdt); |
8d04f02f KG |
422 | |
423 | if (supernodedepth < 0) | |
424 | return -FDT_ERR_NOTFOUND; | |
425 | ||
ae0b5908 DG |
426 | for (offset = 0, depth = 0; |
427 | (offset >= 0) && (offset <= nodeoffset); | |
428 | offset = fdt_next_node(fdt, offset, &depth)) { | |
429 | if (depth == supernodedepth) | |
430 | supernodeoffset = offset; | |
8d04f02f | 431 | |
ae0b5908 DG |
432 | if (offset == nodeoffset) { |
433 | if (nodedepth) | |
434 | *nodedepth = depth; | |
8d04f02f | 435 | |
ae0b5908 DG |
436 | if (supernodedepth > depth) |
437 | return -FDT_ERR_NOTFOUND; | |
438 | else | |
439 | return supernodeoffset; | |
8d04f02f | 440 | } |
ae0b5908 | 441 | } |
8d04f02f | 442 | |
ae0b5908 DG |
443 | if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0)) |
444 | return -FDT_ERR_BADOFFSET; | |
445 | else if (offset == -FDT_ERR_BADOFFSET) | |
446 | return -FDT_ERR_BADSTRUCTURE; | |
8d04f02f | 447 | |
ae0b5908 | 448 | return offset; /* error from fdt_next_node() */ |
8d04f02f KG |
449 | } |
450 | ||
451 | int fdt_node_depth(const void *fdt, int nodeoffset) | |
3f9f08cf | 452 | { |
8d04f02f KG |
453 | int nodedepth; |
454 | int err; | |
455 | ||
456 | err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth); | |
457 | if (err) | |
458 | return (err < 0) ? err : -FDT_ERR_INTERNAL; | |
459 | return nodedepth; | |
460 | } | |
461 | ||
462 | int fdt_parent_offset(const void *fdt, int nodeoffset) | |
463 | { | |
464 | int nodedepth = fdt_node_depth(fdt, nodeoffset); | |
465 | ||
466 | if (nodedepth < 0) | |
467 | return nodedepth; | |
468 | return fdt_supernode_atdepth_offset(fdt, nodeoffset, | |
469 | nodedepth - 1, NULL); | |
470 | } | |
471 | ||
472 | int fdt_node_offset_by_prop_value(const void *fdt, int startoffset, | |
473 | const char *propname, | |
474 | const void *propval, int proplen) | |
475 | { | |
ae0b5908 | 476 | int offset; |
8d04f02f KG |
477 | const void *val; |
478 | int len; | |
479 | ||
fc7758ee | 480 | FDT_CHECK_HEADER(fdt); |
8d04f02f | 481 | |
8d04f02f KG |
482 | /* FIXME: The algorithm here is pretty horrible: we scan each |
483 | * property of a node in fdt_getprop(), then if that didn't | |
484 | * find what we want, we scan over them again making our way | |
485 | * to the next node. Still it's the easiest to implement | |
486 | * approach; performance can come later. */ | |
ae0b5908 DG |
487 | for (offset = fdt_next_node(fdt, startoffset, NULL); |
488 | offset >= 0; | |
489 | offset = fdt_next_node(fdt, offset, NULL)) { | |
490 | val = fdt_getprop(fdt, offset, propname, &len); | |
491 | if (val && (len == proplen) | |
492 | && (memcmp(val, propval, len) == 0)) | |
493 | return offset; | |
494 | } | |
8d04f02f | 495 | |
ae0b5908 | 496 | return offset; /* error from fdt_next_node() */ |
8d04f02f KG |
497 | } |
498 | ||
499 | int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle) | |
500 | { | |
05a22ba0 DG |
501 | int offset; |
502 | ||
8d04f02f KG |
503 | if ((phandle == 0) || (phandle == -1)) |
504 | return -FDT_ERR_BADPHANDLE; | |
05a22ba0 DG |
505 | |
506 | FDT_CHECK_HEADER(fdt); | |
507 | ||
508 | /* FIXME: The algorithm here is pretty horrible: we | |
509 | * potentially scan each property of a node in | |
510 | * fdt_get_phandle(), then if that didn't find what | |
511 | * we want, we scan over them again making our way to the next | |
512 | * node. Still it's the easiest to implement approach; | |
513 | * performance can come later. */ | |
514 | for (offset = fdt_next_node(fdt, -1, NULL); | |
515 | offset >= 0; | |
516 | offset = fdt_next_node(fdt, offset, NULL)) { | |
517 | if (fdt_get_phandle(fdt, offset) == phandle) | |
518 | return offset; | |
519 | } | |
520 | ||
521 | return offset; /* error from fdt_next_node() */ | |
8d04f02f KG |
522 | } |
523 | ||
e853b324 | 524 | int fdt_stringlist_contains(const char *strlist, int listlen, const char *str) |
8d04f02f KG |
525 | { |
526 | int len = strlen(str); | |
ef4e8ce1 | 527 | const char *p; |
8d04f02f KG |
528 | |
529 | while (listlen >= len) { | |
530 | if (memcmp(str, strlist, len+1) == 0) | |
531 | return 1; | |
532 | p = memchr(strlist, '\0', listlen); | |
533 | if (!p) | |
534 | return 0; /* malformed strlist.. */ | |
535 | listlen -= (p-strlist) + 1; | |
536 | strlist = p + 1; | |
3f9f08cf GVB |
537 | } |
538 | return 0; | |
539 | } | |
540 | ||
bc4147ab TR |
541 | int fdt_count_strings(const void *fdt, int node, const char *property) |
542 | { | |
543 | int length, i, count = 0; | |
544 | const char *list; | |
545 | ||
546 | list = fdt_getprop(fdt, node, property, &length); | |
547 | if (!list) | |
73e1e795 | 548 | return length; |
bc4147ab TR |
549 | |
550 | for (i = 0; i < length; i++) { | |
551 | int len = strlen(list); | |
552 | ||
553 | list += len + 1; | |
554 | i += len; | |
555 | count++; | |
556 | } | |
557 | ||
558 | return count; | |
559 | } | |
560 | ||
fc503c17 TR |
561 | int fdt_find_string(const void *fdt, int node, const char *property, |
562 | const char *string) | |
563 | { | |
564 | const char *list, *end; | |
565 | int len, index = 0; | |
566 | ||
567 | list = fdt_getprop(fdt, node, property, &len); | |
568 | if (!list) | |
569 | return len; | |
570 | ||
571 | end = list + len; | |
572 | len = strlen(string); | |
573 | ||
574 | while (list < end) { | |
575 | int l = strlen(list); | |
576 | ||
577 | if (l == len && memcmp(list, string, len) == 0) | |
578 | return index; | |
579 | ||
580 | list += l + 1; | |
581 | index++; | |
582 | } | |
583 | ||
584 | return -FDT_ERR_NOTFOUND; | |
585 | } | |
586 | ||
5094eb40 TR |
587 | int fdt_get_string_index(const void *fdt, int node, const char *property, |
588 | int index, const char **output) | |
589 | { | |
590 | const char *list; | |
591 | int length, i; | |
592 | ||
593 | list = fdt_getprop(fdt, node, property, &length); | |
594 | ||
595 | for (i = 0; i < length; i++) { | |
596 | int len = strlen(list); | |
597 | ||
598 | if (index == 0) { | |
599 | *output = list; | |
600 | return 0; | |
601 | } | |
602 | ||
603 | list += len + 1; | |
604 | i += len; | |
605 | index--; | |
606 | } | |
607 | ||
31f334ab | 608 | return -FDT_ERR_NOTFOUND; |
5094eb40 TR |
609 | } |
610 | ||
611 | int fdt_get_string(const void *fdt, int node, const char *property, | |
612 | const char **output) | |
613 | { | |
614 | return fdt_get_string_index(fdt, node, property, 0, output); | |
615 | } | |
616 | ||
8d04f02f KG |
617 | int fdt_node_check_compatible(const void *fdt, int nodeoffset, |
618 | const char *compatible) | |
3f9f08cf | 619 | { |
8d04f02f KG |
620 | const void *prop; |
621 | int len; | |
3f9f08cf | 622 | |
8d04f02f KG |
623 | prop = fdt_getprop(fdt, nodeoffset, "compatible", &len); |
624 | if (!prop) | |
625 | return len; | |
e853b324 | 626 | if (fdt_stringlist_contains(prop, len, compatible)) |
8d04f02f KG |
627 | return 0; |
628 | else | |
629 | return 1; | |
630 | } | |
3f9f08cf | 631 | |
8d04f02f KG |
632 | int fdt_node_offset_by_compatible(const void *fdt, int startoffset, |
633 | const char *compatible) | |
634 | { | |
11abe45c | 635 | int offset, err; |
8d04f02f | 636 | |
fc7758ee | 637 | FDT_CHECK_HEADER(fdt); |
8d04f02f | 638 | |
8d04f02f KG |
639 | /* FIXME: The algorithm here is pretty horrible: we scan each |
640 | * property of a node in fdt_node_check_compatible(), then if | |
641 | * that didn't find what we want, we scan over them again | |
642 | * making our way to the next node. Still it's the easiest to | |
643 | * implement approach; performance can come later. */ | |
ae0b5908 DG |
644 | for (offset = fdt_next_node(fdt, startoffset, NULL); |
645 | offset >= 0; | |
646 | offset = fdt_next_node(fdt, offset, NULL)) { | |
647 | err = fdt_node_check_compatible(fdt, offset, compatible); | |
648 | if ((err < 0) && (err != -FDT_ERR_NOTFOUND)) | |
649 | return err; | |
650 | else if (err == 0) | |
651 | return offset; | |
652 | } | |
8d04f02f | 653 | |
ae0b5908 | 654 | return offset; /* error from fdt_next_node() */ |
3f9f08cf | 655 | } |