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 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 (char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
83 int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
86 *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address);
87 *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size);
91 int fdt_num_mem_rsv(const void *fdt)
95 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0)
100 int fdt_subnode_offset_namelen(const void *fdt, int offset,
101 const char *name, int namelen)
109 offset = fdt_next_node(fdt, offset, &depth)) {
111 return -FDT_ERR_NOTFOUND;
112 else if ((depth == 1)
113 && nodename_eq(fdt, offset, name, namelen))
117 return offset; /* error */
120 int fdt_subnode_offset(const void *fdt, int parentoffset,
123 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
126 int fdt_path_offset(const void *fdt, const char *path)
128 const char *end = path + strlen(path);
129 const char *p = path;
135 return -FDT_ERR_BADPATH;
148 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
158 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
160 const struct fdt_node_header *nh;
163 if ((err = fdt_check_header(fdt)) != 0)
166 err = -FDT_ERR_BADOFFSET;
167 nh = fdt_offset_ptr(fdt, nodeoffset, sizeof(*nh));
168 if (!nh || (fdt32_to_cpu(nh->tag) != FDT_BEGIN_NODE))
172 *len = strlen(nh->name);
182 const struct fdt_property *fdt_get_property(const void *fdt,
184 const char *name, int *lenp)
187 const struct fdt_property *prop;
189 int offset, nextoffset;
192 if ((err = fdt_check_header(fdt)) != 0)
195 err = -FDT_ERR_BADOFFSET;
196 if (nodeoffset % FDT_TAGSIZE)
199 tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);
200 if (tag != FDT_BEGIN_NODE)
206 tag = fdt_next_tag(fdt, offset, &nextoffset);
209 err = -FDT_ERR_TRUNCATED;
218 err = -FDT_ERR_BADSTRUCTURE;
219 prop = fdt_offset_ptr(fdt, offset, sizeof(*prop));
222 namestroff = fdt32_to_cpu(prop->nameoff);
223 if (streq(fdt_string(fdt, namestroff), name)) {
225 int len = fdt32_to_cpu(prop->len);
226 prop = fdt_offset_ptr(fdt, offset,
239 err = -FDT_ERR_BADSTRUCTURE;
242 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
244 err = -FDT_ERR_NOTFOUND;
251 const void *fdt_getprop(const void *fdt, int nodeoffset,
252 const char *name, int *lenp)
254 const struct fdt_property *prop;
256 prop = fdt_get_property(fdt, nodeoffset, name, lenp);
263 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
268 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
269 if (!php || (len != sizeof(*php)))
272 return fdt32_to_cpu(*php);
275 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
277 int pdepth = 0, p = 0;
278 int offset, depth, namelen;
284 return -FDT_ERR_NOSPACE;
286 for (offset = 0, depth = 0;
287 (offset >= 0) && (offset <= nodeoffset);
288 offset = fdt_next_node(fdt, offset, &depth)) {
290 continue; /* overflowed buffer */
292 while (pdepth > depth) {
295 } while (buf[p-1] != '/');
299 name = fdt_get_name(fdt, offset, &namelen);
302 if ((p + namelen + 1) <= buflen) {
303 memcpy(buf + p, name, namelen);
309 if (offset == nodeoffset) {
310 if (pdepth < (depth + 1))
311 return -FDT_ERR_NOSPACE;
313 if (p > 1) /* special case so that root path is "/", not "" */
320 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
321 return -FDT_ERR_BADOFFSET;
322 else if (offset == -FDT_ERR_BADOFFSET)
323 return -FDT_ERR_BADSTRUCTURE;
325 return offset; /* error from fdt_next_node() */
328 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
329 int supernodedepth, int *nodedepth)
332 int supernodeoffset = -FDT_ERR_INTERNAL;
336 if (supernodedepth < 0)
337 return -FDT_ERR_NOTFOUND;
339 for (offset = 0, depth = 0;
340 (offset >= 0) && (offset <= nodeoffset);
341 offset = fdt_next_node(fdt, offset, &depth)) {
342 if (depth == supernodedepth)
343 supernodeoffset = offset;
345 if (offset == nodeoffset) {
349 if (supernodedepth > depth)
350 return -FDT_ERR_NOTFOUND;
352 return supernodeoffset;
356 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
357 return -FDT_ERR_BADOFFSET;
358 else if (offset == -FDT_ERR_BADOFFSET)
359 return -FDT_ERR_BADSTRUCTURE;
361 return offset; /* error from fdt_next_node() */
364 int fdt_node_depth(const void *fdt, int nodeoffset)
369 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
371 return (err < 0) ? err : -FDT_ERR_INTERNAL;
375 int fdt_parent_offset(const void *fdt, int nodeoffset)
377 int nodedepth = fdt_node_depth(fdt, nodeoffset);
381 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
382 nodedepth - 1, NULL);
385 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
386 const char *propname,
387 const void *propval, int proplen)
395 /* FIXME: The algorithm here is pretty horrible: we scan each
396 * property of a node in fdt_getprop(), then if that didn't
397 * find what we want, we scan over them again making our way
398 * to the next node. Still it's the easiest to implement
399 * approach; performance can come later. */
400 for (offset = fdt_next_node(fdt, startoffset, NULL);
402 offset = fdt_next_node(fdt, offset, NULL)) {
403 val = fdt_getprop(fdt, offset, propname, &len);
404 if (val && (len == proplen)
405 && (memcmp(val, propval, len) == 0))
409 return offset; /* error from fdt_next_node() */
412 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
414 if ((phandle == 0) || (phandle == -1))
415 return -FDT_ERR_BADPHANDLE;
416 phandle = cpu_to_fdt32(phandle);
417 return fdt_node_offset_by_prop_value(fdt, -1, "linux,phandle",
418 &phandle, sizeof(phandle));
421 int _stringlist_contains(const void *strlist, int listlen, const char *str)
423 int len = strlen(str);
426 while (listlen >= len) {
427 if (memcmp(str, strlist, len+1) == 0)
429 p = memchr(strlist, '\0', listlen);
431 return 0; /* malformed strlist.. */
432 listlen -= (p-strlist) + 1;
438 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
439 const char *compatible)
444 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
447 if (_stringlist_contains(prop, len, compatible))
453 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
454 const char *compatible)
460 /* FIXME: The algorithm here is pretty horrible: we scan each
461 * property of a node in fdt_node_check_compatible(), then if
462 * that didn't find what we want, we scan over them again
463 * making our way to the next node. Still it's the easiest to
464 * implement approach; performance can come later. */
465 for (offset = fdt_next_node(fdt, startoffset, NULL);
467 offset = fdt_next_node(fdt, offset, NULL)) {
468 err = fdt_node_check_compatible(fdt, offset, compatible);
469 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
475 return offset; /* error from fdt_next_node() */