Commit | Line | Data |
---|---|---|
12869ecd | 1 | // SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause) |
1cade994 DG |
2 | /* |
3 | * libfdt - Flat Device Tree manipulation | |
4 | * Copyright (C) 2006 David Gibson, IBM Corporation. | |
1cade994 DG |
5 | */ |
6 | #include "libfdt_env.h" | |
7 | ||
8 | #include <fdt.h> | |
9 | #include <libfdt.h> | |
10 | ||
11 | #include "libfdt_internal.h" | |
12 | ||
9130ba88 | 13 | static int fdt_nodename_eq_(const void *fdt, int offset, |
ed95d745 | 14 | const char *s, int len) |
1cade994 | 15 | { |
9130ba88 RH |
16 | int olen; |
17 | const char *p = fdt_get_name(fdt, offset, &olen); | |
1cade994 | 18 | |
9130ba88 | 19 | if (!p || olen < len) |
1cade994 DG |
20 | /* short match */ |
21 | return 0; | |
22 | ||
23 | if (memcmp(p, s, len) != 0) | |
24 | return 0; | |
25 | ||
26 | if (p[len] == '\0') | |
27 | return 1; | |
28 | else if (!memchr(s, '@', len) && (p[len] == '@')) | |
29 | return 1; | |
30 | else | |
31 | return 0; | |
32 | } | |
33 | ||
f858927f RH |
34 | const char *fdt_get_string(const void *fdt, int stroffset, int *lenp) |
35 | { | |
36 | uint32_t absoffset = stroffset + fdt_off_dt_strings(fdt); | |
37 | size_t len; | |
38 | int err; | |
39 | const char *s, *n; | |
40 | ||
41 | err = fdt_ro_probe_(fdt); | |
42 | if (err != 0) | |
43 | goto fail; | |
44 | ||
45 | err = -FDT_ERR_BADOFFSET; | |
46 | if (absoffset >= fdt_totalsize(fdt)) | |
47 | goto fail; | |
48 | len = fdt_totalsize(fdt) - absoffset; | |
49 | ||
50 | if (fdt_magic(fdt) == FDT_MAGIC) { | |
51 | if (stroffset < 0) | |
52 | goto fail; | |
53 | if (fdt_version(fdt) >= 17) { | |
54 | if (stroffset >= fdt_size_dt_strings(fdt)) | |
55 | goto fail; | |
56 | if ((fdt_size_dt_strings(fdt) - stroffset) < len) | |
57 | len = fdt_size_dt_strings(fdt) - stroffset; | |
58 | } | |
59 | } else if (fdt_magic(fdt) == FDT_SW_MAGIC) { | |
60 | if ((stroffset >= 0) | |
61 | || (stroffset < -fdt_size_dt_strings(fdt))) | |
62 | goto fail; | |
63 | if ((-stroffset) < len) | |
64 | len = -stroffset; | |
65 | } else { | |
66 | err = -FDT_ERR_INTERNAL; | |
67 | goto fail; | |
68 | } | |
69 | ||
70 | s = (const char *)fdt + absoffset; | |
71 | n = memchr(s, '\0', len); | |
72 | if (!n) { | |
73 | /* missing terminating NULL */ | |
74 | err = -FDT_ERR_TRUNCATED; | |
75 | goto fail; | |
76 | } | |
77 | ||
78 | if (lenp) | |
79 | *lenp = n - s; | |
80 | return s; | |
81 | ||
82 | fail: | |
83 | if (lenp) | |
84 | *lenp = err; | |
85 | return NULL; | |
86 | } | |
87 | ||
1cade994 DG |
88 | const char *fdt_string(const void *fdt, int stroffset) |
89 | { | |
f858927f | 90 | return fdt_get_string(fdt, stroffset, NULL); |
1cade994 DG |
91 | } |
92 | ||
9130ba88 | 93 | static int fdt_string_eq_(const void *fdt, int stroffset, |
cd296721 SW |
94 | const char *s, int len) |
95 | { | |
f858927f RH |
96 | int slen; |
97 | const char *p = fdt_get_string(fdt, stroffset, &slen); | |
cd296721 | 98 | |
f858927f | 99 | return p && (slen == len) && (memcmp(p, s, len) == 0); |
cd296721 SW |
100 | } |
101 | ||
9bb9c6a1 | 102 | int fdt_find_max_phandle(const void *fdt, uint32_t *phandle) |
6f05afcb | 103 | { |
9bb9c6a1 RH |
104 | uint32_t max = 0; |
105 | int offset = -1; | |
6f05afcb | 106 | |
9bb9c6a1 RH |
107 | while (true) { |
108 | uint32_t value; | |
6f05afcb | 109 | |
9bb9c6a1 RH |
110 | offset = fdt_next_node(fdt, offset, NULL); |
111 | if (offset < 0) { | |
112 | if (offset == -FDT_ERR_NOTFOUND) | |
113 | break; | |
6f05afcb | 114 | |
9bb9c6a1 RH |
115 | return offset; |
116 | } | |
6f05afcb | 117 | |
9bb9c6a1 | 118 | value = fdt_get_phandle(fdt, offset); |
6f05afcb | 119 | |
9bb9c6a1 RH |
120 | if (value > max) |
121 | max = value; | |
6f05afcb RH |
122 | } |
123 | ||
9bb9c6a1 RH |
124 | if (phandle) |
125 | *phandle = max; | |
126 | ||
127 | return 0; | |
128 | } | |
129 | ||
130 | int fdt_generate_phandle(const void *fdt, uint32_t *phandle) | |
131 | { | |
132 | uint32_t max; | |
133 | int err; | |
134 | ||
135 | err = fdt_find_max_phandle(fdt, &max); | |
136 | if (err < 0) | |
137 | return err; | |
138 | ||
139 | if (max == FDT_MAX_PHANDLE) | |
140 | return -FDT_ERR_NOPHANDLES; | |
141 | ||
142 | if (phandle) | |
143 | *phandle = max + 1; | |
144 | ||
6f05afcb RH |
145 | return 0; |
146 | } | |
147 | ||
f858927f RH |
148 | static const struct fdt_reserve_entry *fdt_mem_rsv(const void *fdt, int n) |
149 | { | |
150 | int offset = n * sizeof(struct fdt_reserve_entry); | |
151 | int absoffset = fdt_off_mem_rsvmap(fdt) + offset; | |
152 | ||
153 | if (absoffset < fdt_off_mem_rsvmap(fdt)) | |
154 | return NULL; | |
155 | if (absoffset > fdt_totalsize(fdt) - sizeof(struct fdt_reserve_entry)) | |
156 | return NULL; | |
157 | return fdt_mem_rsv_(fdt, n); | |
158 | } | |
159 | ||
1cade994 DG |
160 | int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size) |
161 | { | |
f858927f RH |
162 | const struct fdt_reserve_entry *re; |
163 | ||
164 | FDT_RO_PROBE(fdt); | |
165 | re = fdt_mem_rsv(fdt, n); | |
166 | if (!re) | |
167 | return -FDT_ERR_BADOFFSET; | |
168 | ||
169 | *address = fdt64_ld(&re->address); | |
170 | *size = fdt64_ld(&re->size); | |
1cade994 DG |
171 | return 0; |
172 | } | |
173 | ||
174 | int fdt_num_mem_rsv(const void *fdt) | |
175 | { | |
f858927f RH |
176 | int i; |
177 | const struct fdt_reserve_entry *re; | |
1cade994 | 178 | |
f858927f RH |
179 | for (i = 0; (re = fdt_mem_rsv(fdt, i)) != NULL; i++) { |
180 | if (fdt64_ld(&re->size) == 0) | |
181 | return i; | |
182 | } | |
183 | return -FDT_ERR_TRUNCATED; | |
1cade994 DG |
184 | } |
185 | ||
9130ba88 | 186 | static int nextprop_(const void *fdt, int offset) |
cd296721 SW |
187 | { |
188 | uint32_t tag; | |
189 | int nextoffset; | |
190 | ||
191 | do { | |
192 | tag = fdt_next_tag(fdt, offset, &nextoffset); | |
193 | ||
194 | switch (tag) { | |
195 | case FDT_END: | |
196 | if (nextoffset >= 0) | |
197 | return -FDT_ERR_BADSTRUCTURE; | |
198 | else | |
199 | return nextoffset; | |
200 | ||
201 | case FDT_PROP: | |
202 | return offset; | |
203 | } | |
204 | offset = nextoffset; | |
205 | } while (tag == FDT_NOP); | |
206 | ||
207 | return -FDT_ERR_NOTFOUND; | |
208 | } | |
209 | ||
ed95d745 | 210 | int fdt_subnode_offset_namelen(const void *fdt, int offset, |
1cade994 DG |
211 | const char *name, int namelen) |
212 | { | |
ed95d745 | 213 | int depth; |
1cade994 | 214 | |
f858927f | 215 | FDT_RO_PROBE(fdt); |
1cade994 | 216 | |
cd296721 SW |
217 | for (depth = 0; |
218 | (offset >= 0) && (depth >= 0); | |
219 | offset = fdt_next_node(fdt, offset, &depth)) | |
220 | if ((depth == 1) | |
9130ba88 | 221 | && fdt_nodename_eq_(fdt, offset, name, namelen)) |
ed95d745 | 222 | return offset; |
1cade994 | 223 | |
cd296721 | 224 | if (depth < 0) |
2dccbf4e | 225 | return -FDT_ERR_NOTFOUND; |
cd296721 | 226 | return offset; /* error */ |
1cade994 DG |
227 | } |
228 | ||
229 | int fdt_subnode_offset(const void *fdt, int parentoffset, | |
230 | const char *name) | |
231 | { | |
232 | return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name)); | |
233 | } | |
234 | ||
47605971 | 235 | int fdt_path_offset_namelen(const void *fdt, const char *path, int namelen) |
1cade994 | 236 | { |
47605971 | 237 | const char *end = path + namelen; |
1cade994 DG |
238 | const char *p = path; |
239 | int offset = 0; | |
240 | ||
f858927f | 241 | FDT_RO_PROBE(fdt); |
1cade994 | 242 | |
cd296721 SW |
243 | /* see if we have an alias */ |
244 | if (*path != '/') { | |
47605971 | 245 | const char *q = memchr(path, '/', end - p); |
cd296721 SW |
246 | |
247 | if (!q) | |
248 | q = end; | |
249 | ||
250 | p = fdt_get_alias_namelen(fdt, p, q - p); | |
251 | if (!p) | |
252 | return -FDT_ERR_BADPATH; | |
253 | offset = fdt_path_offset(fdt, p); | |
254 | ||
255 | p = q; | |
256 | } | |
1cade994 | 257 | |
47605971 | 258 | while (p < end) { |
1cade994 DG |
259 | const char *q; |
260 | ||
47605971 | 261 | while (*p == '/') { |
1cade994 | 262 | p++; |
47605971 RH |
263 | if (p == end) |
264 | return offset; | |
265 | } | |
266 | q = memchr(p, '/', end - p); | |
1cade994 DG |
267 | if (! q) |
268 | q = end; | |
269 | ||
270 | offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p); | |
271 | if (offset < 0) | |
272 | return offset; | |
273 | ||
274 | p = q; | |
275 | } | |
276 | ||
277 | return offset; | |
278 | } | |
279 | ||
47605971 RH |
280 | int fdt_path_offset(const void *fdt, const char *path) |
281 | { | |
282 | return fdt_path_offset_namelen(fdt, path, strlen(path)); | |
283 | } | |
284 | ||
1cade994 DG |
285 | const char *fdt_get_name(const void *fdt, int nodeoffset, int *len) |
286 | { | |
9130ba88 RH |
287 | const struct fdt_node_header *nh = fdt_offset_ptr_(fdt, nodeoffset); |
288 | const char *nameptr; | |
1cade994 DG |
289 | int err; |
290 | ||
f858927f | 291 | if (((err = fdt_ro_probe_(fdt)) != 0) |
9130ba88 | 292 | || ((err = fdt_check_node_offset_(fdt, nodeoffset)) < 0)) |
ed95d745 | 293 | goto fail; |
1cade994 | 294 | |
9130ba88 RH |
295 | nameptr = nh->name; |
296 | ||
297 | if (fdt_version(fdt) < 0x10) { | |
298 | /* | |
299 | * For old FDT versions, match the naming conventions of V16: | |
300 | * give only the leaf name (after all /). The actual tree | |
301 | * contents are loosely checked. | |
302 | */ | |
303 | const char *leaf; | |
304 | leaf = strrchr(nameptr, '/'); | |
305 | if (leaf == NULL) { | |
306 | err = -FDT_ERR_BADSTRUCTURE; | |
307 | goto fail; | |
308 | } | |
309 | nameptr = leaf+1; | |
310 | } | |
311 | ||
1cade994 | 312 | if (len) |
9130ba88 | 313 | *len = strlen(nameptr); |
1cade994 | 314 | |
9130ba88 | 315 | return nameptr; |
1cade994 DG |
316 | |
317 | fail: | |
318 | if (len) | |
319 | *len = err; | |
320 | return NULL; | |
321 | } | |
322 | ||
cd296721 SW |
323 | int fdt_first_property_offset(const void *fdt, int nodeoffset) |
324 | { | |
325 | int offset; | |
326 | ||
9130ba88 | 327 | if ((offset = fdt_check_node_offset_(fdt, nodeoffset)) < 0) |
cd296721 SW |
328 | return offset; |
329 | ||
9130ba88 | 330 | return nextprop_(fdt, offset); |
cd296721 SW |
331 | } |
332 | ||
333 | int fdt_next_property_offset(const void *fdt, int offset) | |
334 | { | |
9130ba88 | 335 | if ((offset = fdt_check_prop_offset_(fdt, offset)) < 0) |
cd296721 SW |
336 | return offset; |
337 | ||
9130ba88 | 338 | return nextprop_(fdt, offset); |
cd296721 SW |
339 | } |
340 | ||
9130ba88 RH |
341 | static const struct fdt_property *fdt_get_property_by_offset_(const void *fdt, |
342 | int offset, | |
343 | int *lenp) | |
1cade994 | 344 | { |
1cade994 | 345 | int err; |
cd296721 | 346 | const struct fdt_property *prop; |
1cade994 | 347 | |
9130ba88 | 348 | if ((err = fdt_check_prop_offset_(fdt, offset)) < 0) { |
cd296721 SW |
349 | if (lenp) |
350 | *lenp = err; | |
351 | return NULL; | |
352 | } | |
1cade994 | 353 | |
9130ba88 | 354 | prop = fdt_offset_ptr_(fdt, offset); |
1cade994 | 355 | |
cd296721 | 356 | if (lenp) |
f858927f | 357 | *lenp = fdt32_ld(&prop->len); |
1cade994 | 358 | |
cd296721 SW |
359 | return prop; |
360 | } | |
1cade994 | 361 | |
9130ba88 RH |
362 | const struct fdt_property *fdt_get_property_by_offset(const void *fdt, |
363 | int offset, | |
364 | int *lenp) | |
365 | { | |
366 | /* Prior to version 16, properties may need realignment | |
367 | * and this API does not work. fdt_getprop_*() will, however. */ | |
368 | ||
369 | if (fdt_version(fdt) < 0x10) { | |
370 | if (lenp) | |
371 | *lenp = -FDT_ERR_BADVERSION; | |
372 | return NULL; | |
373 | } | |
374 | ||
375 | return fdt_get_property_by_offset_(fdt, offset, lenp); | |
376 | } | |
377 | ||
378 | static const struct fdt_property *fdt_get_property_namelen_(const void *fdt, | |
379 | int offset, | |
380 | const char *name, | |
381 | int namelen, | |
382 | int *lenp, | |
383 | int *poffset) | |
cd296721 SW |
384 | { |
385 | for (offset = fdt_first_property_offset(fdt, offset); | |
386 | (offset >= 0); | |
387 | (offset = fdt_next_property_offset(fdt, offset))) { | |
388 | const struct fdt_property *prop; | |
1cade994 | 389 | |
9130ba88 | 390 | if (!(prop = fdt_get_property_by_offset_(fdt, offset, lenp))) { |
cd296721 SW |
391 | offset = -FDT_ERR_INTERNAL; |
392 | break; | |
1cade994 | 393 | } |
f858927f | 394 | if (fdt_string_eq_(fdt, fdt32_ld(&prop->nameoff), |
9130ba88 RH |
395 | name, namelen)) { |
396 | if (poffset) | |
397 | *poffset = offset; | |
cd296721 | 398 | return prop; |
9130ba88 | 399 | } |
cd296721 | 400 | } |
1cade994 | 401 | |
1cade994 | 402 | if (lenp) |
cd296721 | 403 | *lenp = offset; |
1cade994 DG |
404 | return NULL; |
405 | } | |
406 | ||
9130ba88 RH |
407 | |
408 | const struct fdt_property *fdt_get_property_namelen(const void *fdt, | |
409 | int offset, | |
410 | const char *name, | |
411 | int namelen, int *lenp) | |
412 | { | |
413 | /* Prior to version 16, properties may need realignment | |
414 | * and this API does not work. fdt_getprop_*() will, however. */ | |
415 | if (fdt_version(fdt) < 0x10) { | |
416 | if (lenp) | |
417 | *lenp = -FDT_ERR_BADVERSION; | |
418 | return NULL; | |
419 | } | |
420 | ||
421 | return fdt_get_property_namelen_(fdt, offset, name, namelen, lenp, | |
422 | NULL); | |
423 | } | |
424 | ||
425 | ||
cd296721 SW |
426 | const struct fdt_property *fdt_get_property(const void *fdt, |
427 | int nodeoffset, | |
428 | const char *name, int *lenp) | |
429 | { | |
430 | return fdt_get_property_namelen(fdt, nodeoffset, name, | |
431 | strlen(name), lenp); | |
432 | } | |
433 | ||
434 | const void *fdt_getprop_namelen(const void *fdt, int nodeoffset, | |
435 | const char *name, int namelen, int *lenp) | |
1cade994 | 436 | { |
9130ba88 | 437 | int poffset; |
1cade994 DG |
438 | const struct fdt_property *prop; |
439 | ||
9130ba88 RH |
440 | prop = fdt_get_property_namelen_(fdt, nodeoffset, name, namelen, lenp, |
441 | &poffset); | |
4201d057 | 442 | if (!prop) |
1cade994 DG |
443 | return NULL; |
444 | ||
9130ba88 RH |
445 | /* Handle realignment */ |
446 | if (fdt_version(fdt) < 0x10 && (poffset + sizeof(*prop)) % 8 && | |
f858927f | 447 | fdt32_ld(&prop->len) >= 8) |
9130ba88 | 448 | return prop->data + 4; |
1cade994 DG |
449 | return prop->data; |
450 | } | |
451 | ||
cd296721 SW |
452 | const void *fdt_getprop_by_offset(const void *fdt, int offset, |
453 | const char **namep, int *lenp) | |
454 | { | |
455 | const struct fdt_property *prop; | |
456 | ||
9130ba88 | 457 | prop = fdt_get_property_by_offset_(fdt, offset, lenp); |
cd296721 SW |
458 | if (!prop) |
459 | return NULL; | |
f858927f RH |
460 | if (namep) { |
461 | const char *name; | |
462 | int namelen; | |
463 | name = fdt_get_string(fdt, fdt32_ld(&prop->nameoff), | |
464 | &namelen); | |
465 | if (!name) { | |
466 | if (lenp) | |
467 | *lenp = namelen; | |
468 | return NULL; | |
469 | } | |
470 | *namep = name; | |
471 | } | |
9130ba88 RH |
472 | |
473 | /* Handle realignment */ | |
474 | if (fdt_version(fdt) < 0x10 && (offset + sizeof(*prop)) % 8 && | |
f858927f | 475 | fdt32_ld(&prop->len) >= 8) |
9130ba88 | 476 | return prop->data + 4; |
cd296721 SW |
477 | return prop->data; |
478 | } | |
479 | ||
480 | const void *fdt_getprop(const void *fdt, int nodeoffset, | |
481 | const char *name, int *lenp) | |
482 | { | |
483 | return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp); | |
484 | } | |
485 | ||
1cade994 DG |
486 | uint32_t fdt_get_phandle(const void *fdt, int nodeoffset) |
487 | { | |
47605971 | 488 | const fdt32_t *php; |
1cade994 DG |
489 | int len; |
490 | ||
cd296721 SW |
491 | /* FIXME: This is a bit sub-optimal, since we potentially scan |
492 | * over all the properties twice. */ | |
493 | php = fdt_getprop(fdt, nodeoffset, "phandle", &len); | |
494 | if (!php || (len != sizeof(*php))) { | |
495 | php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len); | |
496 | if (!php || (len != sizeof(*php))) | |
497 | return 0; | |
498 | } | |
1cade994 | 499 | |
f858927f | 500 | return fdt32_ld(php); |
1cade994 DG |
501 | } |
502 | ||
cd296721 SW |
503 | const char *fdt_get_alias_namelen(const void *fdt, |
504 | const char *name, int namelen) | |
505 | { | |
506 | int aliasoffset; | |
507 | ||
508 | aliasoffset = fdt_path_offset(fdt, "/aliases"); | |
509 | if (aliasoffset < 0) | |
510 | return NULL; | |
511 | ||
512 | return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL); | |
513 | } | |
514 | ||
515 | const char *fdt_get_alias(const void *fdt, const char *name) | |
516 | { | |
517 | return fdt_get_alias_namelen(fdt, name, strlen(name)); | |
518 | } | |
519 | ||
1cade994 DG |
520 | int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen) |
521 | { | |
ed95d745 DG |
522 | int pdepth = 0, p = 0; |
523 | int offset, depth, namelen; | |
1cade994 DG |
524 | const char *name; |
525 | ||
f858927f | 526 | FDT_RO_PROBE(fdt); |
1cade994 DG |
527 | |
528 | if (buflen < 2) | |
529 | return -FDT_ERR_NOSPACE; | |
1cade994 | 530 | |
ed95d745 DG |
531 | for (offset = 0, depth = 0; |
532 | (offset >= 0) && (offset <= nodeoffset); | |
533 | offset = fdt_next_node(fdt, offset, &depth)) { | |
ed95d745 DG |
534 | while (pdepth > depth) { |
535 | do { | |
536 | p--; | |
537 | } while (buf[p-1] != '/'); | |
538 | pdepth--; | |
539 | } | |
540 | ||
cd296721 SW |
541 | if (pdepth >= depth) { |
542 | name = fdt_get_name(fdt, offset, &namelen); | |
543 | if (!name) | |
544 | return namelen; | |
545 | if ((p + namelen + 1) <= buflen) { | |
546 | memcpy(buf + p, name, namelen); | |
547 | p += namelen; | |
548 | buf[p++] = '/'; | |
549 | pdepth++; | |
550 | } | |
ed95d745 | 551 | } |
1cade994 | 552 | |
ed95d745 DG |
553 | if (offset == nodeoffset) { |
554 | if (pdepth < (depth + 1)) | |
555 | return -FDT_ERR_NOSPACE; | |
1cade994 | 556 | |
ed95d745 DG |
557 | if (p > 1) /* special case so that root path is "/", not "" */ |
558 | p--; | |
559 | buf[p] = '\0'; | |
cd296721 | 560 | return 0; |
1cade994 DG |
561 | } |
562 | } | |
563 | ||
ed95d745 DG |
564 | if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0)) |
565 | return -FDT_ERR_BADOFFSET; | |
566 | else if (offset == -FDT_ERR_BADOFFSET) | |
567 | return -FDT_ERR_BADSTRUCTURE; | |
1cade994 | 568 | |
ed95d745 | 569 | return offset; /* error from fdt_next_node() */ |
1cade994 DG |
570 | } |
571 | ||
572 | int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset, | |
573 | int supernodedepth, int *nodedepth) | |
574 | { | |
ed95d745 | 575 | int offset, depth; |
1cade994 DG |
576 | int supernodeoffset = -FDT_ERR_INTERNAL; |
577 | ||
f858927f | 578 | FDT_RO_PROBE(fdt); |
1cade994 DG |
579 | |
580 | if (supernodedepth < 0) | |
581 | return -FDT_ERR_NOTFOUND; | |
582 | ||
ed95d745 DG |
583 | for (offset = 0, depth = 0; |
584 | (offset >= 0) && (offset <= nodeoffset); | |
585 | offset = fdt_next_node(fdt, offset, &depth)) { | |
586 | if (depth == supernodedepth) | |
587 | supernodeoffset = offset; | |
1cade994 | 588 | |
ed95d745 DG |
589 | if (offset == nodeoffset) { |
590 | if (nodedepth) | |
591 | *nodedepth = depth; | |
1cade994 | 592 | |
ed95d745 DG |
593 | if (supernodedepth > depth) |
594 | return -FDT_ERR_NOTFOUND; | |
595 | else | |
596 | return supernodeoffset; | |
1cade994 | 597 | } |
ed95d745 | 598 | } |
1cade994 | 599 | |
ed95d745 DG |
600 | if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0)) |
601 | return -FDT_ERR_BADOFFSET; | |
602 | else if (offset == -FDT_ERR_BADOFFSET) | |
603 | return -FDT_ERR_BADSTRUCTURE; | |
1cade994 | 604 | |
ed95d745 | 605 | return offset; /* error from fdt_next_node() */ |
1cade994 DG |
606 | } |
607 | ||
608 | int fdt_node_depth(const void *fdt, int nodeoffset) | |
609 | { | |
610 | int nodedepth; | |
611 | int err; | |
612 | ||
613 | err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth); | |
614 | if (err) | |
615 | return (err < 0) ? err : -FDT_ERR_INTERNAL; | |
616 | return nodedepth; | |
617 | } | |
618 | ||
619 | int fdt_parent_offset(const void *fdt, int nodeoffset) | |
620 | { | |
621 | int nodedepth = fdt_node_depth(fdt, nodeoffset); | |
622 | ||
623 | if (nodedepth < 0) | |
624 | return nodedepth; | |
625 | return fdt_supernode_atdepth_offset(fdt, nodeoffset, | |
626 | nodedepth - 1, NULL); | |
627 | } | |
628 | ||
629 | int fdt_node_offset_by_prop_value(const void *fdt, int startoffset, | |
630 | const char *propname, | |
631 | const void *propval, int proplen) | |
632 | { | |
ed95d745 | 633 | int offset; |
1cade994 DG |
634 | const void *val; |
635 | int len; | |
636 | ||
f858927f | 637 | FDT_RO_PROBE(fdt); |
1cade994 DG |
638 | |
639 | /* FIXME: The algorithm here is pretty horrible: we scan each | |
640 | * property of a node in fdt_getprop(), then if that didn't | |
641 | * find what we want, we scan over them again making our way | |
642 | * to the next node. Still it's the easiest to implement | |
643 | * approach; performance can come later. */ | |
ed95d745 DG |
644 | for (offset = fdt_next_node(fdt, startoffset, NULL); |
645 | offset >= 0; | |
646 | offset = fdt_next_node(fdt, offset, NULL)) { | |
647 | val = fdt_getprop(fdt, offset, propname, &len); | |
648 | if (val && (len == proplen) | |
649 | && (memcmp(val, propval, len) == 0)) | |
650 | return offset; | |
651 | } | |
1cade994 | 652 | |
ed95d745 | 653 | return offset; /* error from fdt_next_node() */ |
1cade994 DG |
654 | } |
655 | ||
656 | int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle) | |
657 | { | |
cd296721 SW |
658 | int offset; |
659 | ||
1cade994 DG |
660 | if ((phandle == 0) || (phandle == -1)) |
661 | return -FDT_ERR_BADPHANDLE; | |
cd296721 | 662 | |
f858927f | 663 | FDT_RO_PROBE(fdt); |
cd296721 SW |
664 | |
665 | /* FIXME: The algorithm here is pretty horrible: we | |
666 | * potentially scan each property of a node in | |
667 | * fdt_get_phandle(), then if that didn't find what | |
668 | * we want, we scan over them again making our way to the next | |
669 | * node. Still it's the easiest to implement approach; | |
670 | * performance can come later. */ | |
671 | for (offset = fdt_next_node(fdt, -1, NULL); | |
672 | offset >= 0; | |
673 | offset = fdt_next_node(fdt, offset, NULL)) { | |
674 | if (fdt_get_phandle(fdt, offset) == phandle) | |
675 | return offset; | |
676 | } | |
677 | ||
678 | return offset; /* error from fdt_next_node() */ | |
1cade994 DG |
679 | } |
680 | ||
47605971 | 681 | int fdt_stringlist_contains(const char *strlist, int listlen, const char *str) |
1cade994 DG |
682 | { |
683 | int len = strlen(str); | |
ed95d745 | 684 | const char *p; |
1cade994 DG |
685 | |
686 | while (listlen >= len) { | |
687 | if (memcmp(str, strlist, len+1) == 0) | |
688 | return 1; | |
689 | p = memchr(strlist, '\0', listlen); | |
690 | if (!p) | |
691 | return 0; /* malformed strlist.. */ | |
692 | listlen -= (p-strlist) + 1; | |
693 | strlist = p + 1; | |
694 | } | |
695 | return 0; | |
696 | } | |
697 | ||
91feabc2 RH |
698 | int fdt_stringlist_count(const void *fdt, int nodeoffset, const char *property) |
699 | { | |
700 | const char *list, *end; | |
701 | int length, count = 0; | |
702 | ||
703 | list = fdt_getprop(fdt, nodeoffset, property, &length); | |
704 | if (!list) | |
6f05afcb | 705 | return length; |
91feabc2 RH |
706 | |
707 | end = list + length; | |
708 | ||
709 | while (list < end) { | |
710 | length = strnlen(list, end - list) + 1; | |
711 | ||
712 | /* Abort if the last string isn't properly NUL-terminated. */ | |
713 | if (list + length > end) | |
714 | return -FDT_ERR_BADVALUE; | |
715 | ||
716 | list += length; | |
717 | count++; | |
718 | } | |
719 | ||
720 | return count; | |
721 | } | |
722 | ||
723 | int fdt_stringlist_search(const void *fdt, int nodeoffset, const char *property, | |
724 | const char *string) | |
725 | { | |
726 | int length, len, idx = 0; | |
727 | const char *list, *end; | |
728 | ||
729 | list = fdt_getprop(fdt, nodeoffset, property, &length); | |
730 | if (!list) | |
6f05afcb | 731 | return length; |
91feabc2 RH |
732 | |
733 | len = strlen(string) + 1; | |
734 | end = list + length; | |
735 | ||
736 | while (list < end) { | |
737 | length = strnlen(list, end - list) + 1; | |
738 | ||
739 | /* Abort if the last string isn't properly NUL-terminated. */ | |
740 | if (list + length > end) | |
741 | return -FDT_ERR_BADVALUE; | |
742 | ||
743 | if (length == len && memcmp(list, string, length) == 0) | |
744 | return idx; | |
745 | ||
746 | list += length; | |
747 | idx++; | |
748 | } | |
749 | ||
750 | return -FDT_ERR_NOTFOUND; | |
751 | } | |
752 | ||
753 | const char *fdt_stringlist_get(const void *fdt, int nodeoffset, | |
754 | const char *property, int idx, | |
755 | int *lenp) | |
756 | { | |
757 | const char *list, *end; | |
758 | int length; | |
759 | ||
760 | list = fdt_getprop(fdt, nodeoffset, property, &length); | |
761 | if (!list) { | |
762 | if (lenp) | |
763 | *lenp = length; | |
764 | ||
765 | return NULL; | |
766 | } | |
767 | ||
768 | end = list + length; | |
769 | ||
770 | while (list < end) { | |
771 | length = strnlen(list, end - list) + 1; | |
772 | ||
773 | /* Abort if the last string isn't properly NUL-terminated. */ | |
774 | if (list + length > end) { | |
775 | if (lenp) | |
776 | *lenp = -FDT_ERR_BADVALUE; | |
777 | ||
778 | return NULL; | |
779 | } | |
780 | ||
781 | if (idx == 0) { | |
782 | if (lenp) | |
783 | *lenp = length - 1; | |
784 | ||
785 | return list; | |
786 | } | |
787 | ||
788 | list += length; | |
789 | idx--; | |
790 | } | |
791 | ||
792 | if (lenp) | |
793 | *lenp = -FDT_ERR_NOTFOUND; | |
794 | ||
795 | return NULL; | |
796 | } | |
797 | ||
1cade994 DG |
798 | int fdt_node_check_compatible(const void *fdt, int nodeoffset, |
799 | const char *compatible) | |
800 | { | |
801 | const void *prop; | |
802 | int len; | |
803 | ||
804 | prop = fdt_getprop(fdt, nodeoffset, "compatible", &len); | |
805 | if (!prop) | |
806 | return len; | |
b9937347 RH |
807 | |
808 | return !fdt_stringlist_contains(prop, len, compatible); | |
1cade994 DG |
809 | } |
810 | ||
811 | int fdt_node_offset_by_compatible(const void *fdt, int startoffset, | |
812 | const char *compatible) | |
813 | { | |
ed95d745 | 814 | int offset, err; |
1cade994 | 815 | |
f858927f | 816 | FDT_RO_PROBE(fdt); |
1cade994 DG |
817 | |
818 | /* FIXME: The algorithm here is pretty horrible: we scan each | |
819 | * property of a node in fdt_node_check_compatible(), then if | |
820 | * that didn't find what we want, we scan over them again | |
821 | * making our way to the next node. Still it's the easiest to | |
822 | * implement approach; performance can come later. */ | |
ed95d745 DG |
823 | for (offset = fdt_next_node(fdt, startoffset, NULL); |
824 | offset >= 0; | |
825 | offset = fdt_next_node(fdt, offset, NULL)) { | |
826 | err = fdt_node_check_compatible(fdt, offset, compatible); | |
827 | if ((err < 0) && (err != -FDT_ERR_NOTFOUND)) | |
828 | return err; | |
829 | else if (err == 0) | |
830 | return offset; | |
831 | } | |
1cade994 | 832 | |
ed95d745 | 833 | return offset; /* error from fdt_next_node() */ |
1cade994 | 834 | } |
f858927f RH |
835 | |
836 | int fdt_check_full(const void *fdt, size_t bufsize) | |
837 | { | |
838 | int err; | |
839 | int num_memrsv; | |
840 | int offset, nextoffset = 0; | |
841 | uint32_t tag; | |
842 | unsigned depth = 0; | |
843 | const void *prop; | |
844 | const char *propname; | |
845 | ||
846 | if (bufsize < FDT_V1_SIZE) | |
847 | return -FDT_ERR_TRUNCATED; | |
848 | err = fdt_check_header(fdt); | |
849 | if (err != 0) | |
850 | return err; | |
851 | if (bufsize < fdt_totalsize(fdt)) | |
852 | return -FDT_ERR_TRUNCATED; | |
853 | ||
854 | num_memrsv = fdt_num_mem_rsv(fdt); | |
855 | if (num_memrsv < 0) | |
856 | return num_memrsv; | |
857 | ||
858 | while (1) { | |
859 | offset = nextoffset; | |
860 | tag = fdt_next_tag(fdt, offset, &nextoffset); | |
861 | ||
862 | if (nextoffset < 0) | |
863 | return nextoffset; | |
864 | ||
865 | switch (tag) { | |
866 | case FDT_NOP: | |
867 | break; | |
868 | ||
869 | case FDT_END: | |
870 | if (depth != 0) | |
871 | return -FDT_ERR_BADSTRUCTURE; | |
872 | return 0; | |
873 | ||
874 | case FDT_BEGIN_NODE: | |
875 | depth++; | |
876 | if (depth > INT_MAX) | |
877 | return -FDT_ERR_BADSTRUCTURE; | |
878 | break; | |
879 | ||
880 | case FDT_END_NODE: | |
881 | if (depth == 0) | |
882 | return -FDT_ERR_BADSTRUCTURE; | |
883 | depth--; | |
884 | break; | |
885 | ||
886 | case FDT_PROP: | |
887 | prop = fdt_getprop_by_offset(fdt, offset, &propname, | |
888 | &err); | |
889 | if (!prop) | |
890 | return err; | |
891 | break; | |
892 | ||
893 | default: | |
894 | return -FDT_ERR_INTERNAL; | |
895 | } | |
896 | } | |
897 | } |