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 _fdt_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 (const char *)fdt + fdt_off_dt_strings(fdt) + stroffset;
83 static int _fdt_string_eq(const void *fdt, int stroffset,
84 const char *s, int len)
86 const char *p = fdt_string(fdt, stroffset);
88 return (strlen(p) == len) && (memcmp(p, s, len) == 0);
91 int fdt_get_mem_rsv(const void *fdt, int n, uint64_t *address, uint64_t *size)
93 FDT_CHECK_HEADER(fdt);
94 *address = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->address);
95 *size = fdt64_to_cpu(_fdt_mem_rsv(fdt, n)->size);
99 int fdt_num_mem_rsv(const void *fdt)
103 while (fdt64_to_cpu(_fdt_mem_rsv(fdt, i)->size) != 0)
108 int fdt_subnode_offset_namelen(const void *fdt, int offset,
109 const char *name, int namelen)
113 FDT_CHECK_HEADER(fdt);
116 (offset >= 0) && (depth >= 0);
117 offset = fdt_next_node(fdt, offset, &depth))
119 && _fdt_nodename_eq(fdt, offset, name, namelen))
123 return -FDT_ERR_NOTFOUND;
124 return offset; /* error */
127 int fdt_subnode_offset(const void *fdt, int parentoffset,
130 return fdt_subnode_offset_namelen(fdt, parentoffset, name, strlen(name));
133 int fdt_path_offset(const void *fdt, const char *path)
135 const char *end = path + strlen(path);
136 const char *p = path;
139 FDT_CHECK_HEADER(fdt);
141 /* see if we have an alias */
143 const char *q = strchr(path, '/');
148 p = fdt_get_alias_namelen(fdt, p, q - p);
150 return -FDT_ERR_BADPATH;
151 offset = fdt_path_offset(fdt, p);
167 offset = fdt_subnode_offset_namelen(fdt, offset, p, q-p);
177 const char *fdt_get_name(const void *fdt, int nodeoffset, int *len)
179 const struct fdt_node_header *nh = _fdt_offset_ptr(fdt, nodeoffset);
182 if (((err = fdt_check_header(fdt)) != 0)
183 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
187 *len = strlen(nh->name);
197 const struct fdt_property *fdt_get_property_namelen(const void *fdt,
200 int namelen, int *lenp)
203 const struct fdt_property *prop;
204 int offset, nextoffset;
207 if (((err = fdt_check_header(fdt)) != 0)
208 || ((err = _fdt_check_node_offset(fdt, nodeoffset)) < 0))
215 tag = fdt_next_tag(fdt, offset, &nextoffset);
221 /* FDT_END tag with unclosed nodes */
222 err = -FDT_ERR_BADSTRUCTURE;
226 prop = _fdt_offset_ptr(fdt, offset);
227 if (_fdt_string_eq(fdt, fdt32_to_cpu(prop->nameoff),
231 *lenp = fdt32_to_cpu(prop->len);
237 } while ((tag != FDT_BEGIN_NODE) && (tag != FDT_END_NODE));
239 err = -FDT_ERR_NOTFOUND;
246 const struct fdt_property *fdt_get_property(const void *fdt,
248 const char *name, int *lenp)
250 return fdt_get_property_namelen(fdt, nodeoffset, name,
254 const void *fdt_getprop_namelen(const void *fdt, int nodeoffset,
255 const char *name, int namelen, int *lenp)
257 const struct fdt_property *prop;
259 prop = fdt_get_property_namelen(fdt, nodeoffset, name, namelen, lenp);
266 const void *fdt_getprop(const void *fdt, int nodeoffset,
267 const char *name, int *lenp)
269 return fdt_getprop_namelen(fdt, nodeoffset, name, strlen(name), lenp);
272 uint32_t fdt_get_phandle(const void *fdt, int nodeoffset)
277 /* FIXME: This is a bit sub-optimal, since we potentially scan
278 * over all the properties twice. */
279 php = fdt_getprop(fdt, nodeoffset, "phandle", &len);
280 if (!php || (len != sizeof(*php))) {
281 php = fdt_getprop(fdt, nodeoffset, "linux,phandle", &len);
282 if (!php || (len != sizeof(*php)))
286 return fdt32_to_cpu(*php);
289 const char *fdt_get_alias_namelen(const void *fdt,
290 const char *name, int namelen)
294 aliasoffset = fdt_path_offset(fdt, "/aliases");
298 return fdt_getprop_namelen(fdt, aliasoffset, name, namelen, NULL);
301 const char *fdt_get_alias(const void *fdt, const char *name)
303 return fdt_get_alias_namelen(fdt, name, strlen(name));
306 int fdt_get_path(const void *fdt, int nodeoffset, char *buf, int buflen)
308 int pdepth = 0, p = 0;
309 int offset, depth, namelen;
312 FDT_CHECK_HEADER(fdt);
315 return -FDT_ERR_NOSPACE;
317 for (offset = 0, depth = 0;
318 (offset >= 0) && (offset <= nodeoffset);
319 offset = fdt_next_node(fdt, offset, &depth)) {
320 while (pdepth > depth) {
323 } while (buf[p-1] != '/');
327 if (pdepth >= depth) {
328 name = fdt_get_name(fdt, offset, &namelen);
331 if ((p + namelen + 1) <= buflen) {
332 memcpy(buf + p, name, namelen);
339 if (offset == nodeoffset) {
340 if (pdepth < (depth + 1))
341 return -FDT_ERR_NOSPACE;
343 if (p > 1) /* special case so that root path is "/", not "" */
350 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
351 return -FDT_ERR_BADOFFSET;
352 else if (offset == -FDT_ERR_BADOFFSET)
353 return -FDT_ERR_BADSTRUCTURE;
355 return offset; /* error from fdt_next_node() */
358 int fdt_supernode_atdepth_offset(const void *fdt, int nodeoffset,
359 int supernodedepth, int *nodedepth)
362 int supernodeoffset = -FDT_ERR_INTERNAL;
364 FDT_CHECK_HEADER(fdt);
366 if (supernodedepth < 0)
367 return -FDT_ERR_NOTFOUND;
369 for (offset = 0, depth = 0;
370 (offset >= 0) && (offset <= nodeoffset);
371 offset = fdt_next_node(fdt, offset, &depth)) {
372 if (depth == supernodedepth)
373 supernodeoffset = offset;
375 if (offset == nodeoffset) {
379 if (supernodedepth > depth)
380 return -FDT_ERR_NOTFOUND;
382 return supernodeoffset;
386 if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0))
387 return -FDT_ERR_BADOFFSET;
388 else if (offset == -FDT_ERR_BADOFFSET)
389 return -FDT_ERR_BADSTRUCTURE;
391 return offset; /* error from fdt_next_node() */
394 int fdt_node_depth(const void *fdt, int nodeoffset)
399 err = fdt_supernode_atdepth_offset(fdt, nodeoffset, 0, &nodedepth);
401 return (err < 0) ? err : -FDT_ERR_INTERNAL;
405 int fdt_parent_offset(const void *fdt, int nodeoffset)
407 int nodedepth = fdt_node_depth(fdt, nodeoffset);
411 return fdt_supernode_atdepth_offset(fdt, nodeoffset,
412 nodedepth - 1, NULL);
415 int fdt_node_offset_by_prop_value(const void *fdt, int startoffset,
416 const char *propname,
417 const void *propval, int proplen)
423 FDT_CHECK_HEADER(fdt);
425 /* FIXME: The algorithm here is pretty horrible: we scan each
426 * property of a node in fdt_getprop(), then if that didn't
427 * find what we want, we scan over them again making our way
428 * to the next node. Still it's the easiest to implement
429 * approach; performance can come later. */
430 for (offset = fdt_next_node(fdt, startoffset, NULL);
432 offset = fdt_next_node(fdt, offset, NULL)) {
433 val = fdt_getprop(fdt, offset, propname, &len);
434 if (val && (len == proplen)
435 && (memcmp(val, propval, len) == 0))
439 return offset; /* error from fdt_next_node() */
442 int fdt_node_offset_by_phandle(const void *fdt, uint32_t phandle)
446 if ((phandle == 0) || (phandle == -1))
447 return -FDT_ERR_BADPHANDLE;
449 FDT_CHECK_HEADER(fdt);
451 /* FIXME: The algorithm here is pretty horrible: we
452 * potentially scan each property of a node in
453 * fdt_get_phandle(), then if that didn't find what
454 * we want, we scan over them again making our way to the next
455 * node. Still it's the easiest to implement approach;
456 * performance can come later. */
457 for (offset = fdt_next_node(fdt, -1, NULL);
459 offset = fdt_next_node(fdt, offset, NULL)) {
460 if (fdt_get_phandle(fdt, offset) == phandle)
464 return offset; /* error from fdt_next_node() */
467 static int _fdt_stringlist_contains(const char *strlist, int listlen,
470 int len = strlen(str);
473 while (listlen >= len) {
474 if (memcmp(str, strlist, len+1) == 0)
476 p = memchr(strlist, '\0', listlen);
478 return 0; /* malformed strlist.. */
479 listlen -= (p-strlist) + 1;
485 int fdt_node_check_compatible(const void *fdt, int nodeoffset,
486 const char *compatible)
491 prop = fdt_getprop(fdt, nodeoffset, "compatible", &len);
494 if (_fdt_stringlist_contains(prop, len, compatible))
500 int fdt_node_offset_by_compatible(const void *fdt, int startoffset,
501 const char *compatible)
505 FDT_CHECK_HEADER(fdt);
507 /* FIXME: The algorithm here is pretty horrible: we scan each
508 * property of a node in fdt_node_check_compatible(), then if
509 * that didn't find what we want, we scan over them again
510 * making our way to the next node. Still it's the easiest to
511 * implement approach; performance can come later. */
512 for (offset = fdt_next_node(fdt, startoffset, NULL);
514 offset = fdt_next_node(fdt, offset, NULL)) {
515 err = fdt_node_check_compatible(fdt, offset, compatible);
516 if ((err < 0) && (err != -FDT_ERR_NOTFOUND))
522 return offset; /* error from fdt_next_node() */