2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
5 * libfdt is dual licensed: you can use it either under the terms of
6 * the GPL, or the BSD license, at your option.
8 * a) This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as
10 * published by the Free Software Foundation; either version 2 of the
11 * License, or (at your option) any later version.
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public
19 * License along with this library; if not, write to the Free
20 * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
25 * b) Redistribution and use in source and binary forms, with or
26 * without modification, are permitted provided that the following
29 * 1. Redistributions of source code must retain the above
30 * copyright notice, this list of conditions and the following
32 * 2. Redistributions in binary form must reproduce the above
33 * copyright notice, this list of conditions and the following
34 * disclaimer in the documentation and/or other materials
35 * provided with the distribution.
37 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
38 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
39 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
40 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
41 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
42 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
43 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
44 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
45 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
46 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
47 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
48 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
49 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
51 #include "libfdt_env.h"
56 #include "libfdt_internal.h"
58 static int _fdt_nodename_eq(const void *fdt, int offset,
59 const char *s, int len)
61 const char *p = fdt_offset_ptr(fdt, offset + FDT_TAGSIZE, len+1);
67 if (memcmp(p, s, len) != 0)
72 else if (!memchr(s, '@', len) && (p[len] == '@'))
78 const char *fdt_string(const void *fdt, int stroffset)
80 return (const char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
83 static int _fdt_string_eq(const void *fdt, int stroffset,
84 const char *s, int len)
86 const char *p = fdt_string(fdt, stroffset);
88 return (strlen(p) == len) && (memcmp(p, s, len) == 0);
91 int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
93 FDT_CHECK_HEADER(fdt);
94 *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address);
95 *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size);
99 int fdt_num_mem_rsv(const void *fdt)
103 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0)
108 static int _nextprop(const void *fdt, int offset)
114 tag = fdt_next_tag(fdt, offset, &nextoffset);
119 return -FDT_ERR_BADSTRUCTURE;
127 } while (tag == FDT_NOP);
129 return -FDT_ERR_NOTFOUND;
132 int fdt_subnode_offset_namelen(const void *fdt, int offset,
133 const char *name, int namelen)
137 FDT_CHECK_HEADER(fdt);
140 (offset >= 0) && (depth >= 0);
141 offset = fdt_next_node(fdt, offset, &depth))
143 && _fdt_nodename_eq(fdt, offset, name, namelen))
147 return -FDT_ERR_NOTFOUND;
148 return offset; /* error */
151 int fdt_subnode_offset(const void *fdt, int parentoffset,
154 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
157 int fdt_path_offset(const void *fdt, const char *path)
159 const char *end = path + strlen(path);
160 const char *p = path;
163 FDT_CHECK_HEADER(fdt);
165 /* see if we have an alias */
167 const char *q = strchr(path, '/');
172 p = fdt_get_alias_namelen(fdt, p, q - p);
174 return -FDT_ERR_BADPATH;
175 offset = fdt_path_offset(fdt, p);
191 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
201 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
203 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
206 if (((err = fdt_check_header(fdt)) != 0)
207 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
211 *len = strlen(nh->name);
221 int fdt_first_property_offset(const void *fdt, int nodeoffset)
225 if ((offset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
228 return _nextprop(fdt, offset);
231 int fdt_next_property_offset(const void *fdt, int offset)
233 if ((offset = _fdt_check_prop_offset(fdt, offset)) < 0)
236 return _nextprop(fdt, offset);
239 const struct fdt_property *fdt_get_property_by_offset(const void *fdt,
244 const struct fdt_property *prop;
246 if ((err = _fdt_check_prop_offset(fdt, offset)) < 0) {
252 prop = _fdt_offset_ptr(fdt, offset);
255 *lenp = fdt32_to_cpu(prop->len);
260 const struct fdt_property *fdt_get_property_namelen(const void *fdt,
263 int namelen, int *lenp)
265 for (offset = fdt_first_property_offset(fdt, offset);
267 (offset = fdt_next_property_offset(fdt, offset))) {
268 const struct fdt_property *prop;
270 if (!(prop = fdt_get_property_by_offset(fdt, offset, lenp))) {
271 offset = -FDT_ERR_INTERNAL;
274 if (_fdt_string_eq(fdt, fdt32_to_cpu(prop->nameoff),
284 const struct fdt_property *fdt_get_property(const void *fdt,
286 const char *name, int *lenp)
288 return fdt_get_property_namelen(fdt, nodeoffset, name,
292 const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
293 const char *name, int namelen, int *lenp)
295 const struct fdt_property *prop;
297 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
304 const void *fdt_getprop_by_offset(const void *fdt, int offset,
305 const char **namep, int *lenp)
307 const struct fdt_property *prop;
309 prop = fdt_get_property_by_offset(fdt, offset, lenp);
313 *namep = fdt_string(fdt, fdt32_to_cpu(prop->nameoff));
317 const void *fdt_getprop(const void *fdt, int nodeoffset,
318 const char *name, int *lenp)
320 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
323 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
328 /* FIXME: This is a bit sub-optimal, since we potentially scan
329 * over all the properties twice. */
330 php = fdt_getprop(fdt, nodeoffset, "phandle", &len);
331 if (!php || (len != sizeof(*php))) {
332 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
333 if (!php || (len != sizeof(*php)))
337 return fdt32_to_cpu(*php);
340 const char *fdt_get_alias_namelen(const void *fdt,
341 const char *name, int namelen)
345 aliasoffset = fdt_path_offset(fdt, "/aliases");
349 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
352 const char *fdt_get_alias(const void *fdt, const char *name)
354 return fdt_get_alias_namelen(fdt, name, strlen(name));
357 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
359 int pdepth = 0, p = 0;
360 int offset, depth, namelen;
363 FDT_CHECK_HEADER(fdt);
366 return -FDT_ERR_NOSPACE;
368 for (offset = 0, depth = 0;
369 (offset >= 0) && (offset <= nodeoffset);
370 offset = fdt_next_node(fdt, offset, &depth)) {
371 while (pdepth > depth) {
374 } while (buf[p-1] != '/');
378 if (pdepth >= depth) {
379 name = fdt_get_name(fdt, offset, &namelen);
382 if ((p + namelen + 1) <= buflen) {
383 memcpy(buf + p, name, namelen);
390 if (offset == nodeoffset) {
391 if (pdepth < (depth + 1))
392 return -FDT_ERR_NOSPACE;
394 if (p > 1) /* special case so that root path is "/", not "" */
401 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
402 return -FDT_ERR_BADOFFSET;
403 else if (offset == -FDT_ERR_BADOFFSET)
404 return -FDT_ERR_BADSTRUCTURE;
406 return offset; /* error from fdt_next_node() */
409 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
410 int supernodedepth, int *nodedepth)
413 int supernodeoffset = -FDT_ERR_INTERNAL;
415 FDT_CHECK_HEADER(fdt);
417 if (supernodedepth < 0)
418 return -FDT_ERR_NOTFOUND;
420 for (offset = 0, depth = 0;
421 (offset >= 0) && (offset <= nodeoffset);
422 offset = fdt_next_node(fdt, offset, &depth)) {
423 if (depth == supernodedepth)
424 supernodeoffset = offset;
426 if (offset == nodeoffset) {
430 if (supernodedepth > depth)
431 return -FDT_ERR_NOTFOUND;
433 return supernodeoffset;
437 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
438 return -FDT_ERR_BADOFFSET;
439 else if (offset == -FDT_ERR_BADOFFSET)
440 return -FDT_ERR_BADSTRUCTURE;
442 return offset; /* error from fdt_next_node() */
445 int fdt_node_depth(const void *fdt, int nodeoffset)
450 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
452 return (err < 0) ? err : -FDT_ERR_INTERNAL;
456 int fdt_parent_offset(const void *fdt, int nodeoffset)
458 int nodedepth = fdt_node_depth(fdt, nodeoffset);
462 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
463 nodedepth - 1, NULL);
466 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
467 const char *propname,
468 const void *propval, int proplen)
474 FDT_CHECK_HEADER(fdt);
476 /* FIXME: The algorithm here is pretty horrible: we scan each
477 * property of a node in fdt_getprop(), then if that didn't
478 * find what we want, we scan over them again making our way
479 * to the next node. Still it's the easiest to implement
480 * approach; performance can come later. */
481 for (offset = fdt_next_node(fdt, startoffset, NULL);
483 offset = fdt_next_node(fdt, offset, NULL)) {
484 val = fdt_getprop(fdt, offset, propname, &len);
485 if (val && (len == proplen)
486 && (memcmp(val, propval, len) == 0))
490 return offset; /* error from fdt_next_node() */
493 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
497 if ((phandle == 0) || (phandle == -1))
498 return -FDT_ERR_BADPHANDLE;
500 FDT_CHECK_HEADER(fdt);
502 /* FIXME: The algorithm here is pretty horrible: we
503 * potentially scan each property of a node in
504 * fdt_get_phandle(), then if that didn't find what
505 * we want, we scan over them again making our way to the next
506 * node. Still it's the easiest to implement approach;
507 * performance can come later. */
508 for (offset = fdt_next_node(fdt, -1, NULL);
510 offset = fdt_next_node(fdt, offset, NULL)) {
511 if (fdt_get_phandle(fdt, offset) == phandle)
515 return offset; /* error from fdt_next_node() */
518 static int _fdt_stringlist_contains(const char *strlist, int listlen,
521 int len = strlen(str);
524 while (listlen >= len) {
525 if (memcmp(str, strlist, len+1) == 0)
527 p = memchr(strlist, '\0', listlen);
529 return 0; /* malformed strlist.. */
530 listlen -= (p-strlist) + 1;
536 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
537 const char *compatible)
542 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
545 if (_fdt_stringlist_contains(prop, len, compatible))
551 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
552 const char *compatible)
556 FDT_CHECK_HEADER(fdt);
558 /* FIXME: The algorithm here is pretty horrible: we scan each
559 * property of a node in fdt_node_check_compatible(), then if
560 * that didn't find what we want, we scan over them again
561 * making our way to the next node. Still it's the easiest to
562 * implement approach; performance can come later. */
563 for (offset = fdt_next_node(fdt, startoffset, NULL);
565 offset = fdt_next_node(fdt, offset, NULL)) {
566 err = fdt_node_check_compatible(fdt, offset, compatible);
567 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
573 return offset; /* error from fdt_next_node() */