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_namelen(const void *fdt, const char *path, int namelen)
159 const char *end = path + namelen;
160 const char *p = path;
163 FDT_CHECK_HEADER(fdt);
165 /* see if we have an alias */
167 const char *q = memchr(path, '/', end - p);
172 p = fdt_get_alias_namelen(fdt, p, q - p);
174 return -FDT_ERR_BADPATH;
175 offset = fdt_path_offset(fdt, p);
188 q = memchr(p, '/', end - p);
192 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
202 int fdt_path_offset(const void *fdt, const char *path)
204 return fdt_path_offset_namelen(fdt, path, strlen(path));
207 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
209 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
212 if (((err = fdt_check_header(fdt)) != 0)
213 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
217 *len = strlen(nh->name);
227 int fdt_first_property_offset(const void *fdt, int nodeoffset)
231 if ((offset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
234 return _nextprop(fdt, offset);
237 int fdt_next_property_offset(const void *fdt, int offset)
239 if ((offset = _fdt_check_prop_offset(fdt, offset)) < 0)
242 return _nextprop(fdt, offset);
245 const struct fdt_property *fdt_get_property_by_offset(const void *fdt,
250 const struct fdt_property *prop;
252 if ((err = _fdt_check_prop_offset(fdt, offset)) < 0) {
258 prop = _fdt_offset_ptr(fdt, offset);
261 *lenp = fdt32_to_cpu(prop->len);
266 const struct fdt_property *fdt_get_property_namelen(const void *fdt,
269 int namelen, int *lenp)
271 for (offset = fdt_first_property_offset(fdt, offset);
273 (offset = fdt_next_property_offset(fdt, offset))) {
274 const struct fdt_property *prop;
276 if (!(prop = fdt_get_property_by_offset(fdt, offset, lenp))) {
277 offset = -FDT_ERR_INTERNAL;
280 if (_fdt_string_eq(fdt, fdt32_to_cpu(prop->nameoff),
290 const struct fdt_property *fdt_get_property(const void *fdt,
292 const char *name, int *lenp)
294 return fdt_get_property_namelen(fdt, nodeoffset, name,
298 const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
299 const char *name, int namelen, int *lenp)
301 const struct fdt_property *prop;
303 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
310 const void *fdt_getprop_by_offset(const void *fdt, int offset,
311 const char **namep, int *lenp)
313 const struct fdt_property *prop;
315 prop = fdt_get_property_by_offset(fdt, offset, lenp);
319 *namep = fdt_string(fdt, fdt32_to_cpu(prop->nameoff));
323 const void *fdt_getprop(const void *fdt, int nodeoffset,
324 const char *name, int *lenp)
326 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
329 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
334 /* FIXME: This is a bit sub-optimal, since we potentially scan
335 * over all the properties twice. */
336 php = fdt_getprop(fdt, nodeoffset, "phandle", &len);
337 if (!php || (len != sizeof(*php))) {
338 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
339 if (!php || (len != sizeof(*php)))
343 return fdt32_to_cpu(*php);
346 const char *fdt_get_alias_namelen(const void *fdt,
347 const char *name, int namelen)
351 aliasoffset = fdt_path_offset(fdt, "/aliases");
355 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
358 const char *fdt_get_alias(const void *fdt, const char *name)
360 return fdt_get_alias_namelen(fdt, name, strlen(name));
363 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
365 int pdepth = 0, p = 0;
366 int offset, depth, namelen;
369 FDT_CHECK_HEADER(fdt);
372 return -FDT_ERR_NOSPACE;
374 for (offset = 0, depth = 0;
375 (offset >= 0) && (offset <= nodeoffset);
376 offset = fdt_next_node(fdt, offset, &depth)) {
377 while (pdepth > depth) {
380 } while (buf[p-1] != '/');
384 if (pdepth >= depth) {
385 name = fdt_get_name(fdt, offset, &namelen);
388 if ((p + namelen + 1) <= buflen) {
389 memcpy(buf + p, name, namelen);
396 if (offset == nodeoffset) {
397 if (pdepth < (depth + 1))
398 return -FDT_ERR_NOSPACE;
400 if (p > 1) /* special case so that root path is "/", not "" */
407 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
408 return -FDT_ERR_BADOFFSET;
409 else if (offset == -FDT_ERR_BADOFFSET)
410 return -FDT_ERR_BADSTRUCTURE;
412 return offset; /* error from fdt_next_node() */
415 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
416 int supernodedepth, int *nodedepth)
419 int supernodeoffset = -FDT_ERR_INTERNAL;
421 FDT_CHECK_HEADER(fdt);
423 if (supernodedepth < 0)
424 return -FDT_ERR_NOTFOUND;
426 for (offset = 0, depth = 0;
427 (offset >= 0) && (offset <= nodeoffset);
428 offset = fdt_next_node(fdt, offset, &depth)) {
429 if (depth == supernodedepth)
430 supernodeoffset = offset;
432 if (offset == nodeoffset) {
436 if (supernodedepth > depth)
437 return -FDT_ERR_NOTFOUND;
439 return supernodeoffset;
443 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
444 return -FDT_ERR_BADOFFSET;
445 else if (offset == -FDT_ERR_BADOFFSET)
446 return -FDT_ERR_BADSTRUCTURE;
448 return offset; /* error from fdt_next_node() */
451 int fdt_node_depth(const void *fdt, int nodeoffset)
456 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
458 return (err < 0) ? err : -FDT_ERR_INTERNAL;
462 int fdt_parent_offset(const void *fdt, int nodeoffset)
464 int nodedepth = fdt_node_depth(fdt, nodeoffset);
468 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
469 nodedepth - 1, NULL);
472 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
473 const char *propname,
474 const void *propval, int proplen)
480 FDT_CHECK_HEADER(fdt);
482 /* FIXME: The algorithm here is pretty horrible: we scan each
483 * property of a node in fdt_getprop(), then if that didn't
484 * find what we want, we scan over them again making our way
485 * to the next node. Still it's the easiest to implement
486 * approach; performance can come later. */
487 for (offset = fdt_next_node(fdt, startoffset, NULL);
489 offset = fdt_next_node(fdt, offset, NULL)) {
490 val = fdt_getprop(fdt, offset, propname, &len);
491 if (val && (len == proplen)
492 && (memcmp(val, propval, len) == 0))
496 return offset; /* error from fdt_next_node() */
499 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
503 if ((phandle == 0) || (phandle == -1))
504 return -FDT_ERR_BADPHANDLE;
506 FDT_CHECK_HEADER(fdt);
508 /* FIXME: The algorithm here is pretty horrible: we
509 * potentially scan each property of a node in
510 * fdt_get_phandle(), then if that didn't find what
511 * we want, we scan over them again making our way to the next
512 * node. Still it's the easiest to implement approach;
513 * performance can come later. */
514 for (offset = fdt_next_node(fdt, -1, NULL);
516 offset = fdt_next_node(fdt, offset, NULL)) {
517 if (fdt_get_phandle(fdt, offset) == phandle)
521 return offset; /* error from fdt_next_node() */
524 int fdt_stringlist_contains(const char *strlist, int listlen, const char *str)
526 int len = strlen(str);
529 while (listlen >= len) {
530 if (memcmp(str, strlist, len+1) == 0)
532 p = memchr(strlist, '\0', listlen);
534 return 0; /* malformed strlist.. */
535 listlen -= (p-strlist) + 1;
541 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
542 const char *compatible)
547 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
550 if (fdt_stringlist_contains(prop, len, compatible))
556 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
557 const char *compatible)
561 FDT_CHECK_HEADER(fdt);
563 /* FIXME: The algorithm here is pretty horrible: we scan each
564 * property of a node in fdt_node_check_compatible(), then if
565 * that didn't find what we want, we scan over them again
566 * making our way to the next node. Still it's the easiest to
567 * implement approach; performance can come later. */
568 for (offset = fdt_next_node(fdt, startoffset, NULL);
570 offset = fdt_next_node(fdt, offset, NULL)) {
571 err = fdt_node_check_compatible(fdt, offset, compatible);
572 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
578 return offset; /* error from fdt_next_node() */