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);
120 (offset >= 0) && (depth >= 0);
121 offset = fdt_next_node(fdt, offset, &depth))
123 && _fdt_nodename_eq(fdt, offset, name, namelen))
127 return -FDT_ERR_NOTFOUND;
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;
143 FDT_CHECK_HEADER(fdt);
145 /* see if we have an alias */
147 const char *q = strchr(path, '/');
152 p = fdt_get_alias_namelen(fdt, p, q - p);
154 return -FDT_ERR_BADPATH;
155 offset = fdt_path_offset(fdt, p);
171 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
181 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
183 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
186 if (((err = fdt_check_header(fdt)) != 0)
187 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
191 *len = strlen(nh->name);
201 const struct fdt_property *fdt_get_property_namelen(const void *fdt,
204 int namelen, int *lenp)
207 const struct fdt_property *prop;
209 int offset, nextoffset;
212 if (((err = fdt_check_header(fdt)) != 0)
213 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
220 tag = fdt_next_tag(fdt, offset, &nextoffset);
223 err = -FDT_ERR_TRUNCATED;
232 err = -FDT_ERR_BADSTRUCTURE;
233 prop = fdt_offset_ptr(fdt, offset, sizeof(*prop));
236 namestroff = fdt32_to_cpu(prop->nameoff);
237 if (_fdt_string_eq(fdt, namestroff, name, namelen)) {
239 int len = fdt32_to_cpu(prop->len);
240 prop = fdt_offset_ptr(fdt, offset,
253 err = -FDT_ERR_BADSTRUCTURE;
256 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
258 err = -FDT_ERR_NOTFOUND;
265 const struct fdt_property *fdt_get_property(const void *fdt,
267 const char *name, int *lenp)
269 return fdt_get_property_namelen(fdt, nodeoffset, name,
273 const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
274 const char *name, int namelen, int *lenp)
276 const struct fdt_property *prop;
278 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
285 const void *fdt_getprop(const void *fdt, int nodeoffset,
286 const char *name, int *lenp)
288 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
291 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
296 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
297 if (!php || (len != sizeof(*php)))
300 return fdt32_to_cpu(*php);
303 const char *fdt_get_alias_namelen(const void *fdt,
304 const char *name, int namelen)
308 aliasoffset = fdt_path_offset(fdt, "/aliases");
312 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
315 const char *fdt_get_alias(const void *fdt, const char *name)
317 return fdt_get_alias_namelen(fdt, name, strlen(name));
320 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
322 int pdepth = 0, p = 0;
323 int offset, depth, namelen;
326 FDT_CHECK_HEADER(fdt);
329 return -FDT_ERR_NOSPACE;
331 for (offset = 0, depth = 0;
332 (offset >= 0) && (offset <= nodeoffset);
333 offset = fdt_next_node(fdt, offset, &depth)) {
334 while (pdepth > depth) {
337 } while (buf[p-1] != '/');
341 if (pdepth >= depth) {
342 name = fdt_get_name(fdt, offset, &namelen);
345 if ((p + namelen + 1) <= buflen) {
346 memcpy(buf + p, name, namelen);
353 if (offset == nodeoffset) {
354 if (pdepth < (depth + 1))
355 return -FDT_ERR_NOSPACE;
357 if (p > 1) /* special case so that root path is "/", not "" */
364 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
365 return -FDT_ERR_BADOFFSET;
366 else if (offset == -FDT_ERR_BADOFFSET)
367 return -FDT_ERR_BADSTRUCTURE;
369 return offset; /* error from fdt_next_node() */
372 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
373 int supernodedepth, int *nodedepth)
376 int supernodeoffset = -FDT_ERR_INTERNAL;
378 FDT_CHECK_HEADER(fdt);
380 if (supernodedepth < 0)
381 return -FDT_ERR_NOTFOUND;
383 for (offset = 0, depth = 0;
384 (offset >= 0) && (offset <= nodeoffset);
385 offset = fdt_next_node(fdt, offset, &depth)) {
386 if (depth == supernodedepth)
387 supernodeoffset = offset;
389 if (offset == nodeoffset) {
393 if (supernodedepth > depth)
394 return -FDT_ERR_NOTFOUND;
396 return supernodeoffset;
400 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
401 return -FDT_ERR_BADOFFSET;
402 else if (offset == -FDT_ERR_BADOFFSET)
403 return -FDT_ERR_BADSTRUCTURE;
405 return offset; /* error from fdt_next_node() */
408 int fdt_node_depth(const void *fdt, int nodeoffset)
413 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
415 return (err < 0) ? err : -FDT_ERR_INTERNAL;
419 int fdt_parent_offset(const void *fdt, int nodeoffset)
421 int nodedepth = fdt_node_depth(fdt, nodeoffset);
425 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
426 nodedepth - 1, NULL);
429 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
430 const char *propname,
431 const void *propval, int proplen)
437 FDT_CHECK_HEADER(fdt);
439 /* FIXME: The algorithm here is pretty horrible: we scan each
440 * property of a node in fdt_getprop(), then if that didn't
441 * find what we want, we scan over them again making our way
442 * to the next node. Still it's the easiest to implement
443 * approach; performance can come later. */
444 for (offset = fdt_next_node(fdt, startoffset, NULL);
446 offset = fdt_next_node(fdt, offset, NULL)) {
447 val = fdt_getprop(fdt, offset, propname, &len);
448 if (val && (len == proplen)
449 && (memcmp(val, propval, len) == 0))
453 return offset; /* error from fdt_next_node() */
456 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
458 if ((phandle == 0) || (phandle == -1))
459 return -FDT_ERR_BADPHANDLE;
460 phandle = cpu_to_fdt32(phandle);
461 return fdt_node_offset_by_prop_value(fdt, -1, "linux,phandle",
462 &phandle, sizeof(phandle));
465 static int _fdt_stringlist_contains(const char *strlist, int listlen,
468 int len = strlen(str);
471 while (listlen >= len) {
472 if (memcmp(str, strlist, len+1) == 0)
474 p = memchr(strlist, '\0', listlen);
476 return 0; /* malformed strlist.. */
477 listlen -= (p-strlist) + 1;
483 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
484 const char *compatible)
489 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
492 if (_fdt_stringlist_contains(prop, len, compatible))
498 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
499 const char *compatible)
503 FDT_CHECK_HEADER(fdt);
505 /* FIXME: The algorithm here is pretty horrible: we scan each
506 * property of a node in fdt_node_check_compatible(), then if
507 * that didn't find what we want, we scan over them again
508 * making our way to the next node. Still it's the easiest to
509 * implement approach; performance can come later. */
510 for (offset = fdt_next_node(fdt, startoffset, NULL);
512 offset = fdt_next_node(fdt, offset, NULL)) {
513 err = fdt_node_check_compatible(fdt, offset, compatible);
514 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
520 return offset; /* error from fdt_next_node() */