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