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 #define CHECK_HEADER(fdt) \
65 if ((err = fdt_check_header(fdt)) != 0) \
69 static int nodename_eq(const void *fdt, int offset,
70 const char *s, int len)
72 const char *p = fdt_offset_ptr(fdt, offset + FDT_TAGSIZE, len+1);
78 if (memcmp(p, s, len) != 0)
83 else if (!memchr(s, '@', len) && (p[len] == '@'))
89 const char *fdt_string(const void *fdt, int stroffset)
91 return (char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
94 int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
97 *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address);
98 *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size);
102 int fdt_num_mem_rsv(const void *fdt)
106 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0)
111 int fdt_subnode_offset_namelen(const void *fdt, int offset,
112 const char *name, int namelen)
120 offset = fdt_next_node(fdt, offset, &depth)) {
122 return -FDT_ERR_NOTFOUND;
123 else if ((depth == 1)
124 && nodename_eq(fdt, offset, name, namelen))
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;
146 return -FDT_ERR_BADPATH;
159 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
169 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
171 const struct fdt_node_header *nh;
174 if ((err = fdt_check_header(fdt)) != 0)
177 err = -FDT_ERR_BADOFFSET;
178 nh = fdt_offset_ptr(fdt, nodeoffset, sizeof(*nh));
179 if (!nh || (fdt32_to_cpu(nh->tag) != FDT_BEGIN_NODE))
183 *len = strlen(nh->name);
193 const struct fdt_property *fdt_get_property(const void *fdt,
195 const char *name, int *lenp)
198 const struct fdt_property *prop;
200 int offset, nextoffset;
203 if ((err = fdt_check_header(fdt)) != 0)
206 err = -FDT_ERR_BADOFFSET;
207 if (nodeoffset % FDT_TAGSIZE)
210 tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);
211 if (tag != FDT_BEGIN_NODE)
217 tag = fdt_next_tag(fdt, offset, &nextoffset);
220 err = -FDT_ERR_TRUNCATED;
229 err = -FDT_ERR_BADSTRUCTURE;
230 prop = fdt_offset_ptr(fdt, offset, sizeof(*prop));
233 namestroff = fdt32_to_cpu(prop->nameoff);
234 if (streq(fdt_string(fdt, namestroff), name)) {
236 int len = fdt32_to_cpu(prop->len);
237 prop = fdt_offset_ptr(fdt, offset,
250 err = -FDT_ERR_BADSTRUCTURE;
253 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
255 err = -FDT_ERR_NOTFOUND;
262 const void *fdt_getprop(const void *fdt, int nodeoffset,
263 const char *name, int *lenp)
265 const struct fdt_property *prop;
267 prop = fdt_get_property(fdt, nodeoffset, name, lenp);
274 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
279 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
280 if (!php || (len != sizeof(*php)))
283 return fdt32_to_cpu(*php);
286 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
288 int pdepth = 0, p = 0;
289 int offset, depth, namelen;
295 return -FDT_ERR_NOSPACE;
297 for (offset = 0, depth = 0;
298 (offset >= 0) && (offset <= nodeoffset);
299 offset = fdt_next_node(fdt, offset, &depth)) {
301 continue; /* overflowed buffer */
303 while (pdepth > depth) {
306 } while (buf[p-1] != '/');
310 name = fdt_get_name(fdt, offset, &namelen);
313 if ((p + namelen + 1) <= buflen) {
314 memcpy(buf + p, name, namelen);
320 if (offset == nodeoffset) {
321 if (pdepth < (depth + 1))
322 return -FDT_ERR_NOSPACE;
324 if (p > 1) /* special case so that root path is "/", not "" */
331 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
332 return -FDT_ERR_BADOFFSET;
333 else if (offset == -FDT_ERR_BADOFFSET)
334 return -FDT_ERR_BADSTRUCTURE;
336 return offset; /* error from fdt_next_node() */
339 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
340 int supernodedepth, int *nodedepth)
343 int supernodeoffset = -FDT_ERR_INTERNAL;
347 if (supernodedepth < 0)
348 return -FDT_ERR_NOTFOUND;
350 for (offset = 0, depth = 0;
351 (offset >= 0) && (offset <= nodeoffset);
352 offset = fdt_next_node(fdt, offset, &depth)) {
353 if (depth == supernodedepth)
354 supernodeoffset = offset;
356 if (offset == nodeoffset) {
360 if (supernodedepth > depth)
361 return -FDT_ERR_NOTFOUND;
363 return supernodeoffset;
367 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
368 return -FDT_ERR_BADOFFSET;
369 else if (offset == -FDT_ERR_BADOFFSET)
370 return -FDT_ERR_BADSTRUCTURE;
372 return offset; /* error from fdt_next_node() */
375 int fdt_node_depth(const void *fdt, int nodeoffset)
380 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
382 return (err < 0) ? err : -FDT_ERR_INTERNAL;
386 int fdt_parent_offset(const void *fdt, int nodeoffset)
388 int nodedepth = fdt_node_depth(fdt, nodeoffset);
392 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
393 nodedepth - 1, NULL);
396 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
397 const char *propname,
398 const void *propval, int proplen)
406 /* FIXME: The algorithm here is pretty horrible: we scan each
407 * property of a node in fdt_getprop(), then if that didn't
408 * find what we want, we scan over them again making our way
409 * to the next node. Still it's the easiest to implement
410 * approach; performance can come later. */
411 for (offset = fdt_next_node(fdt, startoffset, NULL);
413 offset = fdt_next_node(fdt, offset, NULL)) {
414 val = fdt_getprop(fdt, offset, propname, &len);
415 if (val && (len == proplen)
416 && (memcmp(val, propval, len) == 0))
420 return offset; /* error from fdt_next_node() */
423 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
425 if ((phandle == 0) || (phandle == -1))
426 return -FDT_ERR_BADPHANDLE;
427 phandle = cpu_to_fdt32(phandle);
428 return fdt_node_offset_by_prop_value(fdt, -1, "linux,phandle",
429 &phandle, sizeof(phandle));
432 int _stringlist_contains(const void *strlist, int listlen, const char *str)
434 int len = strlen(str);
437 while (listlen >= len) {
438 if (memcmp(str, strlist, len+1) == 0)
440 p = memchr(strlist, '\0', listlen);
442 return 0; /* malformed strlist.. */
443 listlen -= (p-strlist) + 1;
449 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
450 const char *compatible)
455 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
458 if (_stringlist_contains(prop, len, compatible))
464 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
465 const char *compatible)
468 int offset, nextoffset;
473 if (startoffset >= 0) {
474 tag = fdt_next_tag(fdt, startoffset, &nextoffset);
475 if (tag != FDT_BEGIN_NODE)
476 return -FDT_ERR_BADOFFSET;
481 /* FIXME: The algorithm here is pretty horrible: we scan each
482 * property of a node in fdt_node_check_compatible(), then if
483 * that didn't find what we want, we scan over them again
484 * making our way to the next node. Still it's the easiest to
485 * implement approach; performance can come later. */
486 for (offset = fdt_next_node(fdt, startoffset, NULL);
488 offset = fdt_next_node(fdt, offset, NULL)) {
489 err = fdt_node_check_compatible(fdt, offset, compatible);
490 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
496 return offset; /* error from fdt_next_node() */