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, 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 parentoffset,
112 const char *name, int namelen)
116 int offset, nextoffset;
120 tag = fdt_next_tag(fdt, parentoffset, &nextoffset);
121 if (tag != FDT_BEGIN_NODE)
122 return -FDT_ERR_BADOFFSET;
126 tag = fdt_next_tag(fdt, offset, &nextoffset);
130 return -FDT_ERR_TRUNCATED;
136 if (nodename_eq(fdt, offset+FDT_TAGSIZE, name, namelen))
150 return -FDT_ERR_BADSTRUCTURE;
152 } while (level >= 0);
154 return -FDT_ERR_NOTFOUND;
157 int fdt_subnode_offset(const void *fdt, int parentoffset,
160 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
163 int fdt_path_offset(const void *fdt, const char *path)
165 const char *end = path + strlen(path);
166 const char *p = path;
172 return -FDT_ERR_BADPATH;
185 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
195 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
197 const struct fdt_node_header *nh;
200 if ((err = fdt_check_header(fdt)) != 0)
203 err = -FDT_ERR_BADOFFSET;
204 nh = fdt_offset_ptr(fdt, nodeoffset, sizeof(*nh));
205 if (!nh || (fdt32_to_cpu(nh->tag) != FDT_BEGIN_NODE))
209 *len = strlen(nh->name);
219 const struct fdt_property *fdt_get_property(const void *fdt,
221 const char *name, int *lenp)
224 const struct fdt_property *prop;
226 int offset, nextoffset;
229 if ((err = fdt_check_header(fdt)) != 0)
232 err = -FDT_ERR_BADOFFSET;
233 if (nodeoffset % FDT_TAGSIZE)
236 tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);
237 if (tag != FDT_BEGIN_NODE)
243 tag = fdt_next_tag(fdt, offset, &nextoffset);
246 err = -FDT_ERR_TRUNCATED;
255 err = -FDT_ERR_BADSTRUCTURE;
256 prop = fdt_offset_ptr(fdt, offset, sizeof(*prop));
259 namestroff = fdt32_to_cpu(prop->nameoff);
260 if (streq(fdt_string(fdt, namestroff), name)) {
262 int len = fdt32_to_cpu(prop->len);
263 prop = fdt_offset_ptr(fdt, offset,
276 err = -FDT_ERR_BADSTRUCTURE;
279 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
281 err = -FDT_ERR_NOTFOUND;
288 const void *fdt_getprop(const void *fdt, int nodeoffset,
289 const char *name, int *lenp)
291 const struct fdt_property *prop;
293 prop = fdt_get_property(fdt, nodeoffset, name, lenp);
300 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
305 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
306 if (!php || (len != sizeof(*php)))
309 return fdt32_to_cpu(*php);
312 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
315 int p = 0, overflow = 0;
316 int offset, nextoffset, namelen;
321 tag = fdt_next_tag(fdt, 0, &nextoffset);
322 if (tag != FDT_BEGIN_NODE)
323 return -FDT_ERR_BADSTRUCTURE;
326 return -FDT_ERR_NOSPACE;
330 while (nextoffset <= nodeoffset) {
332 tag = fdt_next_tag(fdt, offset, &nextoffset);
335 return -FDT_ERR_BADOFFSET;
338 name = fdt_get_name(fdt, offset, &namelen);
341 if (overflow || ((p + namelen + 1) > buflen)) {
345 memcpy(buf + p, name, namelen);
357 } while (buf[p-1] != '/');
365 return -FDT_ERR_BADSTRUCTURE;
370 return -FDT_ERR_NOSPACE;
372 if (p > 1) /* special case so that root path is "/", not "" */
378 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
379 int supernodedepth, int *nodedepth)
383 int offset, nextoffset = 0;
384 int supernodeoffset = -FDT_ERR_INTERNAL;
388 if (supernodedepth < 0)
389 return -FDT_ERR_NOTFOUND;
393 tag = fdt_next_tag(fdt, offset, &nextoffset);
396 return -FDT_ERR_BADOFFSET;
400 if (level == supernodedepth)
401 supernodeoffset = offset;
413 return -FDT_ERR_BADSTRUCTURE;
415 } while (offset < nodeoffset);
420 if (supernodedepth > level)
421 return -FDT_ERR_NOTFOUND;
422 return supernodeoffset;
425 int fdt_node_depth(const void *fdt, int nodeoffset)
430 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
432 return (err < 0) ? err : -FDT_ERR_INTERNAL;
436 int fdt_parent_offset(const void *fdt, int nodeoffset)
438 int nodedepth = fdt_node_depth(fdt, nodeoffset);
442 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
443 nodedepth - 1, NULL);
446 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
447 const char *propname,
448 const void *propval, int proplen)
451 int offset, nextoffset;
457 if (startoffset >= 0) {
458 tag = fdt_next_tag(fdt, startoffset, &nextoffset);
459 if (tag != FDT_BEGIN_NODE)
460 return -FDT_ERR_BADOFFSET;
465 /* FIXME: The algorithm here is pretty horrible: we scan each
466 * property of a node in fdt_getprop(), then if that didn't
467 * find what we want, we scan over them again making our way
468 * to the next node. Still it's the easiest to implement
469 * approach; performance can come later. */
472 tag = fdt_next_tag(fdt, offset, &nextoffset);
476 val = fdt_getprop(fdt, offset, propname, &len);
479 && (memcmp(val, propval, len) == 0))
490 return -FDT_ERR_BADSTRUCTURE;
492 } while (tag != FDT_END);
494 return -FDT_ERR_NOTFOUND;
497 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
499 if ((phandle == 0) || (phandle == -1))
500 return -FDT_ERR_BADPHANDLE;
501 phandle = cpu_to_fdt32(phandle);
502 return fdt_node_offset_by_prop_value(fdt, -1, "linux,phandle",
503 &phandle, sizeof(phandle));
506 int _stringlist_contains(const void *strlist, int listlen, const char *str)
508 int len = strlen(str);
511 while (listlen >= len) {
512 if (memcmp(str, strlist, len+1) == 0)
514 p = memchr(strlist, '\0', listlen);
516 return 0; /* malformed strlist.. */
517 listlen -= (p-strlist) + 1;
523 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
524 const char *compatible)
529 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
532 if (_stringlist_contains(prop, len, compatible))
538 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
539 const char *compatible)
542 int offset, nextoffset;
547 if (startoffset >= 0) {
548 tag = fdt_next_tag(fdt, startoffset, &nextoffset);
549 if (tag != FDT_BEGIN_NODE)
550 return -FDT_ERR_BADOFFSET;
555 /* FIXME: The algorithm here is pretty horrible: we scan each
556 * property of a node in fdt_node_check_compatible(), then if
557 * that didn't find what we want, we scan over them again
558 * making our way to the next node. Still it's the easiest to
559 * implement approach; performance can come later. */
562 tag = fdt_next_tag(fdt, offset, &nextoffset);
566 err = fdt_node_check_compatible(fdt, offset,
569 && (err != -FDT_ERR_NOTFOUND))
582 return -FDT_ERR_BADSTRUCTURE;
584 } while (tag != FDT_END);
586 return -FDT_ERR_NOTFOUND;