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);
146 /* see if we have an alias */
148 const char *q = strchr(path, '/');
153 p = fdt_get_alias_namelen(fdt, p, q - p);
155 return -FDT_ERR_BADPATH;
156 offset = fdt_path_offset(fdt, p);
172 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
182 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
184 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
187 if (((err = fdt_check_header(fdt)) != 0)
188 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
192 *len = strlen(nh->name);
202 const struct fdt_property *fdt_get_property_namelen(const void *fdt,
205 int namelen, int *lenp)
208 const struct fdt_property *prop;
210 int offset, nextoffset;
213 if (((err = fdt_check_header(fdt)) != 0)
214 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
221 tag = fdt_next_tag(fdt, offset, &nextoffset);
224 err = -FDT_ERR_TRUNCATED;
233 err = -FDT_ERR_BADSTRUCTURE;
234 prop = fdt_offset_ptr(fdt, offset, sizeof(*prop));
237 namestroff = fdt32_to_cpu(prop->nameoff);
238 if (_fdt_string_eq(fdt, namestroff, name, namelen)) {
240 int len = fdt32_to_cpu(prop->len);
241 prop = fdt_offset_ptr(fdt, offset,
254 err = -FDT_ERR_BADSTRUCTURE;
257 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
259 err = -FDT_ERR_NOTFOUND;
266 const struct fdt_property *fdt_get_property(const void *fdt,
268 const char *name, int *lenp)
270 return fdt_get_property_namelen(fdt, nodeoffset, name,
274 const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
275 const char *name, int namelen, int *lenp)
277 const struct fdt_property *prop;
279 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
286 const void *fdt_getprop(const void *fdt, int nodeoffset,
287 const char *name, int *lenp)
289 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
292 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
297 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
298 if (!php || (len != sizeof(*php)))
301 return fdt32_to_cpu(*php);
304 const char *fdt_get_alias_namelen(const void *fdt,
305 const char *name, int namelen)
309 aliasoffset = fdt_path_offset(fdt, "/aliases");
313 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
316 const char *fdt_get_alias(const void *fdt, const char *name)
318 return fdt_get_alias_namelen(fdt, name, strlen(name));
321 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
323 int pdepth = 0, p = 0;
324 int offset, depth, namelen;
327 FDT_CHECK_HEADER(fdt);
330 return -FDT_ERR_NOSPACE;
332 for (offset = 0, depth = 0;
333 (offset >= 0) && (offset <= nodeoffset);
334 offset = fdt_next_node(fdt, offset, &depth)) {
335 while (pdepth > depth) {
338 } while (buf[p-1] != '/');
342 if (pdepth >= depth) {
343 name = fdt_get_name(fdt, offset, &namelen);
346 if ((p + namelen + 1) <= buflen) {
347 memcpy(buf + p, name, namelen);
354 if (offset == nodeoffset) {
355 if (pdepth < (depth + 1))
356 return -FDT_ERR_NOSPACE;
358 if (p > 1) /* special case so that root path is "/", not "" */
365 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
366 return -FDT_ERR_BADOFFSET;
367 else if (offset == -FDT_ERR_BADOFFSET)
368 return -FDT_ERR_BADSTRUCTURE;
370 return offset; /* error from fdt_next_node() */
373 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
374 int supernodedepth, int *nodedepth)
377 int supernodeoffset = -FDT_ERR_INTERNAL;
379 FDT_CHECK_HEADER(fdt);
381 if (supernodedepth < 0)
382 return -FDT_ERR_NOTFOUND;
384 for (offset = 0, depth = 0;
385 (offset >= 0) && (offset <= nodeoffset);
386 offset = fdt_next_node(fdt, offset, &depth)) {
387 if (depth == supernodedepth)
388 supernodeoffset = offset;
390 if (offset == nodeoffset) {
394 if (supernodedepth > depth)
395 return -FDT_ERR_NOTFOUND;
397 return supernodeoffset;
401 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
402 return -FDT_ERR_BADOFFSET;
403 else if (offset == -FDT_ERR_BADOFFSET)
404 return -FDT_ERR_BADSTRUCTURE;
406 return offset; /* error from fdt_next_node() */
409 int fdt_node_depth(const void *fdt, int nodeoffset)
414 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
416 return (err < 0) ? err : -FDT_ERR_INTERNAL;
420 int fdt_parent_offset(const void *fdt, int nodeoffset)
422 int nodedepth = fdt_node_depth(fdt, nodeoffset);
426 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
427 nodedepth - 1, NULL);
430 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
431 const char *propname,
432 const void *propval, int proplen)
438 FDT_CHECK_HEADER(fdt);
440 /* FIXME: The algorithm here is pretty horrible: we scan each
441 * property of a node in fdt_getprop(), then if that didn't
442 * find what we want, we scan over them again making our way
443 * to the next node. Still it's the easiest to implement
444 * approach; performance can come later. */
445 for (offset = fdt_next_node(fdt, startoffset, NULL);
447 offset = fdt_next_node(fdt, offset, NULL)) {
448 val = fdt_getprop(fdt, offset, propname, &len);
449 if (val && (len == proplen)
450 && (memcmp(val, propval, len) == 0))
454 return offset; /* error from fdt_next_node() */
457 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
459 if ((phandle == 0) || (phandle == -1))
460 return -FDT_ERR_BADPHANDLE;
461 phandle = cpu_to_fdt32(phandle);
462 return fdt_node_offset_by_prop_value(fdt, -1, "linux,phandle",
463 &phandle, sizeof(phandle));
466 static int _fdt_stringlist_contains(const char *strlist, int listlen,
469 int len = strlen(str);
472 while (listlen >= len) {
473 if (memcmp(str, strlist, len+1) == 0)
475 p = memchr(strlist, '\0', listlen);
477 return 0; /* malformed strlist.. */
478 listlen -= (p-strlist) + 1;
484 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
485 const char *compatible)
490 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
493 if (_fdt_stringlist_contains(prop, len, compatible))
499 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
500 const char *compatible)
504 FDT_CHECK_HEADER(fdt);
506 /* FIXME: The algorithm here is pretty horrible: we scan each
507 * property of a node in fdt_node_check_compatible(), then if
508 * that didn't find what we want, we scan over them again
509 * making our way to the next node. Still it's the easiest to
510 * implement approach; performance can come later. */
511 for (offset = fdt_next_node(fdt, startoffset, NULL);
513 offset = fdt_next_node(fdt, offset, NULL)) {
514 err = fdt_node_check_compatible(fdt, offset, compatible);
515 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
521 return offset; /* error from fdt_next_node() */