2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
4 * SPDX-License-Identifier: GPL-2.0+ BSD-2-Clause
6 #include <libfdt_env.h>
15 #include "libfdt_internal.h"
17 static int _fdt_nodename_eq(const void *fdt, int offset,
18 const char *s, int len)
20 const char *p = fdt_offset_ptr(fdt, offset + FDT_TAGSIZE, len+1);
26 if (memcmp(p, s, len) != 0)
31 else if (!memchr(s, '@', len) && (p[len] == '@'))
37 const char *fdt_string(const void *fdt, int stroffset)
39 return (const char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
42 static int _fdt_string_eq(const void *fdt, int stroffset,
43 const char *s, int len)
45 const char *p = fdt_string(fdt, stroffset);
47 return (strnlen(p, len + 1) == len) && (memcmp(p, s, len) == 0);
50 uint32_t fdt_get_max_phandle(const void *fdt)
52 uint32_t max_phandle = 0;
55 for (offset = fdt_next_node(fdt, -1, NULL);;
56 offset = fdt_next_node(fdt, offset, NULL)) {
59 if (offset == -FDT_ERR_NOTFOUND)
65 phandle = fdt_get_phandle(fdt, offset);
66 if (phandle == (uint32_t)-1)
69 if (phandle > max_phandle)
70 max_phandle = phandle;
76 int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
78 FDT_CHECK_HEADER(fdt);
79 *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address);
80 *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size);
84 int fdt_num_mem_rsv(const void *fdt)
88 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0)
93 static int _nextprop(const void *fdt, int offset)
99 tag = fdt_next_tag(fdt, offset, &nextoffset);
104 return -FDT_ERR_BADSTRUCTURE;
112 } while (tag == FDT_NOP);
114 return -FDT_ERR_NOTFOUND;
117 int fdt_subnode_offset_namelen(const void *fdt, int offset,
118 const char *name, int namelen)
122 FDT_CHECK_HEADER(fdt);
125 (offset >= 0) && (depth >= 0);
126 offset = fdt_next_node(fdt, offset, &depth))
128 && _fdt_nodename_eq(fdt, offset, name, namelen))
132 return -FDT_ERR_NOTFOUND;
133 return offset; /* error */
136 int fdt_subnode_offset(const void *fdt, int parentoffset,
139 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
143 * Find the next of path seperator, note we need to search for both '/' and ':'
144 * and then take the first one so that we do the right thing for e.g.
145 * "foo/bar:option" and "bar:option/otheroption", both of which happen, so
146 * first searching for either ':' or '/' does not work.
148 static const char *fdt_path_next_seperator(const char *path)
150 const char *sep1 = strchr(path, '/');
151 const char *sep2 = strchr(path, ':');
154 return (sep1 < sep2) ? sep1 : sep2;
161 int fdt_path_offset(const void *fdt, const char *path)
163 const char *end = path + strlen(path);
164 const char *p = path;
167 FDT_CHECK_HEADER(fdt);
169 /* see if we have an alias */
171 const char *q = fdt_path_next_seperator(path);
176 p = fdt_get_alias_namelen(fdt, p, q - p);
178 return -FDT_ERR_BADPATH;
179 offset = fdt_path_offset(fdt, p);
189 if (*p == '\0' || *p == ':')
191 q = fdt_path_next_seperator(p);
195 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
205 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
207 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
210 if (((err = fdt_check_header(fdt)) != 0)
211 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
215 *len = strlen(nh->name);
225 int fdt_first_property_offset(const void *fdt, int nodeoffset)
229 if ((offset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
232 return _nextprop(fdt, offset);
235 int fdt_next_property_offset(const void *fdt, int offset)
237 if ((offset = _fdt_check_prop_offset(fdt, offset)) < 0)
240 return _nextprop(fdt, offset);
243 const struct fdt_property *fdt_get_property_by_offset(const void *fdt,
248 const struct fdt_property *prop;
250 if ((err = _fdt_check_prop_offset(fdt, offset)) < 0) {
256 prop = _fdt_offset_ptr(fdt, offset);
259 *lenp = fdt32_to_cpu(prop->len);
264 const struct fdt_property *fdt_get_property_namelen(const void *fdt,
267 int namelen, int *lenp)
269 for (offset = fdt_first_property_offset(fdt, offset);
271 (offset = fdt_next_property_offset(fdt, offset))) {
272 const struct fdt_property *prop;
274 if (!(prop = fdt_get_property_by_offset(fdt, offset, lenp))) {
275 offset = -FDT_ERR_INTERNAL;
278 if (_fdt_string_eq(fdt, fdt32_to_cpu(prop->nameoff),
288 const struct fdt_property *fdt_get_property(const void *fdt,
290 const char *name, int *lenp)
292 return fdt_get_property_namelen(fdt, nodeoffset, name,
296 const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
297 const char *name, int namelen, int *lenp)
299 const struct fdt_property *prop;
301 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
308 const void *fdt_getprop_by_offset(const void *fdt, int offset,
309 const char **namep, int *lenp)
311 const struct fdt_property *prop;
313 prop = fdt_get_property_by_offset(fdt, offset, lenp);
317 *namep = fdt_string(fdt, fdt32_to_cpu(prop->nameoff));
321 const void *fdt_getprop(const void *fdt, int nodeoffset,
322 const char *name, int *lenp)
324 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
327 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
332 /* FIXME: This is a bit sub-optimal, since we potentially scan
333 * over all the properties twice. */
334 php = fdt_getprop(fdt, nodeoffset, "phandle", &len);
335 if (!php || (len != sizeof(*php))) {
336 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
337 if (!php || (len != sizeof(*php)))
341 return fdt32_to_cpu(*php);
344 const char *fdt_get_alias_namelen(const void *fdt,
345 const char *name, int namelen)
349 aliasoffset = fdt_path_offset(fdt, "/aliases");
353 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
356 const char *fdt_get_alias(const void *fdt, const char *name)
358 return fdt_get_alias_namelen(fdt, name, strlen(name));
361 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
363 int pdepth = 0, p = 0;
364 int offset, depth, namelen;
367 FDT_CHECK_HEADER(fdt);
370 return -FDT_ERR_NOSPACE;
372 for (offset = 0, depth = 0;
373 (offset >= 0) && (offset <= nodeoffset);
374 offset = fdt_next_node(fdt, offset, &depth)) {
375 while (pdepth > depth) {
378 } while (buf[p-1] != '/');
382 if (pdepth >= depth) {
383 name = fdt_get_name(fdt, offset, &namelen);
386 if ((p + namelen + 1) <= buflen) {
387 memcpy(buf + p, name, namelen);
394 if (offset == nodeoffset) {
395 if (pdepth < (depth + 1))
396 return -FDT_ERR_NOSPACE;
398 if (p > 1) /* special case so that root path is "/", not "" */
405 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
406 return -FDT_ERR_BADOFFSET;
407 else if (offset == -FDT_ERR_BADOFFSET)
408 return -FDT_ERR_BADSTRUCTURE;
410 return offset; /* error from fdt_next_node() */
413 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
414 int supernodedepth, int *nodedepth)
417 int supernodeoffset = -FDT_ERR_INTERNAL;
419 FDT_CHECK_HEADER(fdt);
421 if (supernodedepth < 0)
422 return -FDT_ERR_NOTFOUND;
424 for (offset = 0, depth = 0;
425 (offset >= 0) && (offset <= nodeoffset);
426 offset = fdt_next_node(fdt, offset, &depth)) {
427 if (depth == supernodedepth)
428 supernodeoffset = offset;
430 if (offset == nodeoffset) {
434 if (supernodedepth > depth)
435 return -FDT_ERR_NOTFOUND;
437 return supernodeoffset;
441 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
442 return -FDT_ERR_BADOFFSET;
443 else if (offset == -FDT_ERR_BADOFFSET)
444 return -FDT_ERR_BADSTRUCTURE;
446 return offset; /* error from fdt_next_node() */
449 int fdt_node_depth(const void *fdt, int nodeoffset)
454 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
456 return (err < 0) ? err : -FDT_ERR_INTERNAL;
460 int fdt_parent_offset(const void *fdt, int nodeoffset)
462 int nodedepth = fdt_node_depth(fdt, nodeoffset);
466 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
467 nodedepth - 1, NULL);
470 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
471 const char *propname,
472 const void *propval, int proplen)
478 FDT_CHECK_HEADER(fdt);
480 /* FIXME: The algorithm here is pretty horrible: we scan each
481 * property of a node in fdt_getprop(), then if that didn't
482 * find what we want, we scan over them again making our way
483 * to the next node. Still it's the easiest to implement
484 * approach; performance can come later. */
485 for (offset = fdt_next_node(fdt, startoffset, NULL);
487 offset = fdt_next_node(fdt, offset, NULL)) {
488 val = fdt_getprop(fdt, offset, propname, &len);
489 if (val && (len == proplen)
490 && (memcmp(val, propval, len) == 0))
494 return offset; /* error from fdt_next_node() */
497 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
501 if ((phandle == 0) || (phandle == -1))
502 return -FDT_ERR_BADPHANDLE;
504 FDT_CHECK_HEADER(fdt);
506 /* FIXME: The algorithm here is pretty horrible: we
507 * potentially scan each property of a node in
508 * fdt_get_phandle(), then if that didn't find what
509 * we want, we scan over them again making our way to the next
510 * node. Still it's the easiest to implement approach;
511 * performance can come later. */
512 for (offset = fdt_next_node(fdt, -1, NULL);
514 offset = fdt_next_node(fdt, offset, NULL)) {
515 if (fdt_get_phandle(fdt, offset) == phandle)
519 return offset; /* error from fdt_next_node() */
522 int fdt_stringlist_contains(const char *strlist, int listlen, const char *str)
524 int len = strlen(str);
527 while (listlen >= len) {
528 if (memcmp(str, strlist, len+1) == 0)
530 p = memchr(strlist, '\0', listlen);
532 return 0; /* malformed strlist.. */
533 listlen -= (p-strlist) + 1;
539 int fdt_count_strings(const void *fdt, int node, const char *property)
541 int length, i, count = 0;
544 list = fdt_getprop(fdt, node, property, &length);
548 for (i = 0; i < length; i++) {
549 int len = strlen(list);
559 int fdt_find_string(const void *fdt, int node, const char *property,
562 const char *list, *end;
565 list = fdt_getprop(fdt, node, property, &len);
570 len = strlen(string);
573 int l = strlen(list);
575 if (l == len && memcmp(list, string, len) == 0)
582 return -FDT_ERR_NOTFOUND;
585 int fdt_get_string_index(const void *fdt, int node, const char *property,
586 int index, const char **output)
591 list = fdt_getprop(fdt, node, property, &length);
593 for (i = 0; i < length; i++) {
594 int len = strlen(list);
606 return -FDT_ERR_NOTFOUND;
609 int fdt_get_string(const void *fdt, int node, const char *property,
612 return fdt_get_string_index(fdt, node, property, 0, output);
615 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
616 const char *compatible)
621 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
624 if (fdt_stringlist_contains(prop, len, compatible))
630 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
631 const char *compatible)
635 FDT_CHECK_HEADER(fdt);
637 /* FIXME: The algorithm here is pretty horrible: we scan each
638 * property of a node in fdt_node_check_compatible(), then if
639 * that didn't find what we want, we scan over them again
640 * making our way to the next node. Still it's the easiest to
641 * implement approach; performance can come later. */
642 for (offset = fdt_next_node(fdt, startoffset, NULL);
644 offset = fdt_next_node(fdt, offset, NULL)) {
645 err = fdt_node_check_compatible(fdt, offset, compatible);
646 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
652 return offset; /* error from fdt_next_node() */