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);
121 offset = fdt_next_node(fdt, offset, &depth)) {
123 return -FDT_ERR_NOTFOUND;
124 else if ((depth == 1)
125 && _fdt_nodename_eq(fdt, offset, name, namelen))
129 return offset; /* error */
132 int fdt_subnode_offset(const void *fdt, int parentoffset,
135 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
138 int fdt_path_offset(const void *fdt, const char *path)
140 const char *end = path + strlen(path);
141 const char *p = path;
144 FDT_CHECK_HEADER(fdt);
147 return -FDT_ERR_BADPATH;
160 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
170 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
172 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
175 if (((err = fdt_check_header(fdt)) != 0)
176 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
180 *len = strlen(nh->name);
190 const struct fdt_property *fdt_get_property_namelen(const void *fdt,
193 int namelen, int *lenp)
196 const struct fdt_property *prop;
198 int offset, nextoffset;
201 if (((err = fdt_check_header(fdt)) != 0)
202 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
209 tag = fdt_next_tag(fdt, offset, &nextoffset);
212 err = -FDT_ERR_TRUNCATED;
221 err = -FDT_ERR_BADSTRUCTURE;
222 prop = fdt_offset_ptr(fdt, offset, sizeof(*prop));
225 namestroff = fdt32_to_cpu(prop->nameoff);
226 if (_fdt_string_eq(fdt, namestroff, name, namelen)) {
228 int len = fdt32_to_cpu(prop->len);
229 prop = fdt_offset_ptr(fdt, offset,
242 err = -FDT_ERR_BADSTRUCTURE;
245 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
247 err = -FDT_ERR_NOTFOUND;
254 const struct fdt_property *fdt_get_property(const void *fdt,
256 const char *name, int *lenp)
258 return fdt_get_property_namelen(fdt, nodeoffset, name,
262 const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
263 const char *name, int namelen, int *lenp)
265 const struct fdt_property *prop;
267 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
274 const void *fdt_getprop(const void *fdt, int nodeoffset,
275 const char *name, int *lenp)
277 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
280 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
285 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
286 if (!php || (len != sizeof(*php)))
289 return fdt32_to_cpu(*php);
292 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
294 int pdepth = 0, p = 0;
295 int offset, depth, namelen;
298 FDT_CHECK_HEADER(fdt);
301 return -FDT_ERR_NOSPACE;
303 for (offset = 0, depth = 0;
304 (offset >= 0) && (offset <= nodeoffset);
305 offset = fdt_next_node(fdt, offset, &depth)) {
307 continue; /* overflowed buffer */
309 while (pdepth > depth) {
312 } while (buf[p-1] != '/');
316 name = fdt_get_name(fdt, offset, &namelen);
319 if ((p + namelen + 1) <= buflen) {
320 memcpy(buf + p, name, namelen);
326 if (offset == nodeoffset) {
327 if (pdepth < (depth + 1))
328 return -FDT_ERR_NOSPACE;
330 if (p > 1) /* special case so that root path is "/", not "" */
337 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
338 return -FDT_ERR_BADOFFSET;
339 else if (offset == -FDT_ERR_BADOFFSET)
340 return -FDT_ERR_BADSTRUCTURE;
342 return offset; /* error from fdt_next_node() */
345 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
346 int supernodedepth, int *nodedepth)
349 int supernodeoffset = -FDT_ERR_INTERNAL;
351 FDT_CHECK_HEADER(fdt);
353 if (supernodedepth < 0)
354 return -FDT_ERR_NOTFOUND;
356 for (offset = 0, depth = 0;
357 (offset >= 0) && (offset <= nodeoffset);
358 offset = fdt_next_node(fdt, offset, &depth)) {
359 if (depth == supernodedepth)
360 supernodeoffset = offset;
362 if (offset == nodeoffset) {
366 if (supernodedepth > depth)
367 return -FDT_ERR_NOTFOUND;
369 return supernodeoffset;
373 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
374 return -FDT_ERR_BADOFFSET;
375 else if (offset == -FDT_ERR_BADOFFSET)
376 return -FDT_ERR_BADSTRUCTURE;
378 return offset; /* error from fdt_next_node() */
381 int fdt_node_depth(const void *fdt, int nodeoffset)
386 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
388 return (err < 0) ? err : -FDT_ERR_INTERNAL;
392 int fdt_parent_offset(const void *fdt, int nodeoffset)
394 int nodedepth = fdt_node_depth(fdt, nodeoffset);
398 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
399 nodedepth - 1, NULL);
402 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
403 const char *propname,
404 const void *propval, int proplen)
410 FDT_CHECK_HEADER(fdt);
412 /* FIXME: The algorithm here is pretty horrible: we scan each
413 * property of a node in fdt_getprop(), then if that didn't
414 * find what we want, we scan over them again making our way
415 * to the next node. Still it's the easiest to implement
416 * approach; performance can come later. */
417 for (offset = fdt_next_node(fdt, startoffset, NULL);
419 offset = fdt_next_node(fdt, offset, NULL)) {
420 val = fdt_getprop(fdt, offset, propname, &len);
421 if (val && (len == proplen)
422 && (memcmp(val, propval, len) == 0))
426 return offset; /* error from fdt_next_node() */
429 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
431 if ((phandle == 0) || (phandle == -1))
432 return -FDT_ERR_BADPHANDLE;
433 phandle = cpu_to_fdt32(phandle);
434 return fdt_node_offset_by_prop_value(fdt, -1, "linux,phandle",
435 &phandle, sizeof(phandle));
438 static int _fdt_stringlist_contains(const char *strlist, int listlen,
441 int len = strlen(str);
444 while (listlen >= len) {
445 if (memcmp(str, strlist, len+1) == 0)
447 p = memchr(strlist, '\0', listlen);
449 return 0; /* malformed strlist.. */
450 listlen -= (p-strlist) + 1;
456 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
457 const char *compatible)
462 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
465 if (_fdt_stringlist_contains(prop, len, compatible))
471 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
472 const char *compatible)
476 FDT_CHECK_HEADER(fdt);
478 /* FIXME: The algorithm here is pretty horrible: we scan each
479 * property of a node in fdt_node_check_compatible(), then if
480 * that didn't find what we want, we scan over them again
481 * making our way to the next node. Still it's the easiest to
482 * implement approach; performance can come later. */
483 for (offset = fdt_next_node(fdt, startoffset, NULL);
485 offset = fdt_next_node(fdt, offset, NULL)) {
486 err = fdt_node_check_compatible(fdt, offset, compatible);
487 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
493 return offset; /* error from fdt_next_node() */