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"
60 #include "libfdt_internal.h"
62 static int _fdt_nodename_eq(const void *fdt, int offset,
63 const char *s, int len)
65 const char *p = fdt_offset_ptr(fdt, offset + FDT_TAGSIZE, len+1);
71 if (memcmp(p, s, len) != 0)
76 else if (!memchr(s, '@', len) && (p[len] == '@'))
82 const char *fdt_string(const void *fdt, int stroffset)
84 return (const char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
87 static int _fdt_string_eq(const void *fdt, int stroffset,
88 const char *s, int len)
90 const char *p = fdt_string(fdt, stroffset);
92 return (strlen(p) == len) && (memcmp(p, s, len) == 0);
95 int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
97 FDT_CHECK_HEADER(fdt);
98 *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address);
99 *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size);
103 int fdt_num_mem_rsv(const void *fdt)
107 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0)
112 int fdt_subnode_offset_namelen(const void *fdt, int offset,
113 const char *name, int namelen)
117 FDT_CHECK_HEADER(fdt);
120 (offset >= 0) && (depth >= 0);
121 offset = fdt_next_node(fdt, offset, &depth))
123 && _fdt_nodename_eq(fdt, offset, name, namelen))
127 return -FDT_ERR_NOTFOUND;
128 return offset; /* error */
131 int fdt_subnode_offset(const void *fdt, int parentoffset,
134 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
137 int fdt_path_offset(const void *fdt, const char *path)
139 const char *end = path + strlen(path);
140 const char *p = path;
143 FDT_CHECK_HEADER(fdt);
145 /* see if we have an alias */
147 const char *q = strchr(path, '/');
152 p = fdt_get_alias_namelen(fdt, p, q - p);
154 return -FDT_ERR_BADPATH;
155 offset = fdt_path_offset(fdt, p);
171 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
181 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
183 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
186 if (((err = fdt_check_header(fdt)) != 0)
187 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
191 *len = strlen(nh->name);
201 const struct fdt_property *fdt_get_property_namelen(const void *fdt,
204 int namelen, int *lenp)
207 const struct fdt_property *prop;
208 int offset, nextoffset;
211 if (((err = fdt_check_header(fdt)) != 0)
212 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
219 tag = fdt_next_tag(fdt, offset, &nextoffset);
225 /* FDT_END tag with unclosed nodes */
226 err = -FDT_ERR_BADSTRUCTURE;
230 prop = _fdt_offset_ptr(fdt, offset);
231 if (_fdt_string_eq(fdt, fdt32_to_cpu(prop->nameoff),
235 *lenp = fdt32_to_cpu(prop->len);
241 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
243 err = -FDT_ERR_NOTFOUND;
250 const struct fdt_property *fdt_get_property(const void *fdt,
252 const char *name, int *lenp)
254 return fdt_get_property_namelen(fdt, nodeoffset, name,
258 const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
259 const char *name, int namelen, int *lenp)
261 const struct fdt_property *prop;
263 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
270 const void *fdt_getprop(const void *fdt, int nodeoffset,
271 const char *name, int *lenp)
273 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
276 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
281 /* FIXME: This is a bit sub-optimal, since we potentially scan
282 * over all the properties twice. */
283 php = fdt_getprop(fdt, nodeoffset, "phandle", &len);
284 if (!php || (len != sizeof(*php))) {
285 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
286 if (!php || (len != sizeof(*php)))
290 return fdt32_to_cpu(*php);
293 const char *fdt_get_alias_namelen(const void *fdt,
294 const char *name, int namelen)
298 aliasoffset = fdt_path_offset(fdt, "/aliases");
302 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
305 const char *fdt_get_alias(const void *fdt, const char *name)
307 return fdt_get_alias_namelen(fdt, name, strlen(name));
310 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
312 int pdepth = 0, p = 0;
313 int offset, depth, namelen;
316 FDT_CHECK_HEADER(fdt);
319 return -FDT_ERR_NOSPACE;
321 for (offset = 0, depth = 0;
322 (offset >= 0) && (offset <= nodeoffset);
323 offset = fdt_next_node(fdt, offset, &depth)) {
324 while (pdepth > depth) {
327 } while (buf[p-1] != '/');
331 if (pdepth >= depth) {
332 name = fdt_get_name(fdt, offset, &namelen);
335 if ((p + namelen + 1) <= buflen) {
336 memcpy(buf + p, name, namelen);
343 if (offset == nodeoffset) {
344 if (pdepth < (depth + 1))
345 return -FDT_ERR_NOSPACE;
347 if (p > 1) /* special case so that root path is "/", not "" */
354 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
355 return -FDT_ERR_BADOFFSET;
356 else if (offset == -FDT_ERR_BADOFFSET)
357 return -FDT_ERR_BADSTRUCTURE;
359 return offset; /* error from fdt_next_node() */
362 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
363 int supernodedepth, int *nodedepth)
366 int supernodeoffset = -FDT_ERR_INTERNAL;
368 FDT_CHECK_HEADER(fdt);
370 if (supernodedepth < 0)
371 return -FDT_ERR_NOTFOUND;
373 for (offset = 0, depth = 0;
374 (offset >= 0) && (offset <= nodeoffset);
375 offset = fdt_next_node(fdt, offset, &depth)) {
376 if (depth == supernodedepth)
377 supernodeoffset = offset;
379 if (offset == nodeoffset) {
383 if (supernodedepth > depth)
384 return -FDT_ERR_NOTFOUND;
386 return supernodeoffset;
390 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
391 return -FDT_ERR_BADOFFSET;
392 else if (offset == -FDT_ERR_BADOFFSET)
393 return -FDT_ERR_BADSTRUCTURE;
395 return offset; /* error from fdt_next_node() */
398 int fdt_node_depth(const void *fdt, int nodeoffset)
403 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
405 return (err < 0) ? err : -FDT_ERR_INTERNAL;
409 int fdt_parent_offset(const void *fdt, int nodeoffset)
411 int nodedepth = fdt_node_depth(fdt, nodeoffset);
415 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
416 nodedepth - 1, NULL);
419 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
420 const char *propname,
421 const void *propval, int proplen)
427 FDT_CHECK_HEADER(fdt);
429 /* FIXME: The algorithm here is pretty horrible: we scan each
430 * property of a node in fdt_getprop(), then if that didn't
431 * find what we want, we scan over them again making our way
432 * to the next node. Still it's the easiest to implement
433 * approach; performance can come later. */
434 for (offset = fdt_next_node(fdt, startoffset, NULL);
436 offset = fdt_next_node(fdt, offset, NULL)) {
437 val = fdt_getprop(fdt, offset, propname, &len);
438 if (val && (len == proplen)
439 && (memcmp(val, propval, len) == 0))
443 return offset; /* error from fdt_next_node() */
446 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
450 if ((phandle == 0) || (phandle == -1))
451 return -FDT_ERR_BADPHANDLE;
453 FDT_CHECK_HEADER(fdt);
455 /* FIXME: The algorithm here is pretty horrible: we
456 * potentially scan each property of a node in
457 * fdt_get_phandle(), then if that didn't find what
458 * we want, we scan over them again making our way to the next
459 * node. Still it's the easiest to implement approach;
460 * performance can come later. */
461 for (offset = fdt_next_node(fdt, -1, NULL);
463 offset = fdt_next_node(fdt, offset, NULL)) {
464 if (fdt_get_phandle(fdt, offset) == phandle)
468 return offset; /* error from fdt_next_node() */
471 static int _fdt_stringlist_contains(const char *strlist, int listlen,
474 int len = strlen(str);
477 while (listlen >= len) {
478 if (memcmp(str, strlist, len+1) == 0)
480 p = memchr(strlist, '\0', listlen);
482 return 0; /* malformed strlist.. */
483 listlen -= (p-strlist) + 1;
489 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
490 const char *compatible)
495 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
498 if (_fdt_stringlist_contains(prop, len, compatible))
504 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
505 const char *compatible)
509 FDT_CHECK_HEADER(fdt);
511 /* FIXME: The algorithm here is pretty horrible: we scan each
512 * property of a node in fdt_node_check_compatible(), then if
513 * that didn't find what we want, we scan over them again
514 * making our way to the next node. Still it's the easiest to
515 * implement approach; performance can come later. */
516 for (offset = fdt_next_node(fdt, startoffset, NULL);
518 offset = fdt_next_node(fdt, offset, NULL)) {
519 err = fdt_node_check_compatible(fdt, offset, compatible);
520 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
526 return offset; /* error from fdt_next_node() */