123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963 |
- /*
- * libfdt - Flat Device Tree manipulation
- * Copyright (C) 2006 David Gibson, IBM Corporation.
- *
- * libfdt is dual licensed: you can use it either under the terms of
- * the GPL, or the BSD license, at your option.
- *
- * a) This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License as
- * published by the Free Software Foundation; either version 2 of the
- * License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public
- * License along with this library; if not, write to the Free
- * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
- * MA 02110-1301 USA
- *
- * Alternatively,
- *
- * b) Redistribution and use in source and binary forms, with or
- * without modification, are permitted provided that the following
- * conditions are met:
- *
- * 1. Redistributions of source code must retain the above
- * copyright notice, this list of conditions and the following
- * disclaimer.
- * 2. Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following
- * disclaimer in the documentation and/or other materials
- * provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
- * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
- * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
- * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
- * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
- * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
- * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
- #include "libfdt_env.h"
- #include <fdt.h>
- #include <libfdt.h>
- #include "libfdt_internal.h"
- static int
- _fdt_nodename_eq (
- const void *fdt,
- int offset,
- const char *s,
- int len
- )
- {
- const char *p = fdt_offset_ptr (fdt, offset + FDT_TAGSIZE, len+1);
- if (!p) {
- /* short match */
- return 0;
- }
- if (memcmp (p, s, len) != 0) {
- return 0;
- }
- if (p[len] == '\0') {
- return 1;
- } else if (!memchr (s, '@', len) && (p[len] == '@')) {
- return 1;
- } else {
- return 0;
- }
- }
- const char *
- fdt_string (
- const void *fdt,
- int stroffset
- )
- {
- return (const char *)fdt + fdt_off_dt_strings (fdt) + stroffset;
- }
- static int
- _fdt_string_eq (
- const void *fdt,
- int stroffset,
- const char *s,
- int len
- )
- {
- const char *p = fdt_string (fdt, stroffset);
- return (strlen (p) == len) && (memcmp (p, s, len) == 0);
- }
- uint32_t
- fdt_get_max_phandle (
- const void *fdt
- )
- {
- uint32_t max_phandle = 0;
- int offset;
- for (offset = fdt_next_node (fdt, -1, NULL); ;
- offset = fdt_next_node (fdt, offset, NULL))
- {
- uint32_t phandle;
- if (offset == -FDT_ERR_NOTFOUND) {
- return max_phandle;
- }
- if (offset < 0) {
- return (uint32_t)-1;
- }
- phandle = fdt_get_phandle (fdt, offset);
- if (phandle == (uint32_t)-1) {
- continue;
- }
- if (phandle > max_phandle) {
- max_phandle = phandle;
- }
- }
- return 0;
- }
- int
- fdt_get_mem_rsv (
- const void *fdt,
- int n,
- uint64_t *address,
- uint64_t *size
- )
- {
- FDT_CHECK_HEADER (fdt);
- *address = fdt64_to_cpu (_fdt_mem_rsv (fdt, n)->address);
- *size = fdt64_to_cpu (_fdt_mem_rsv (fdt, n)->size);
- return 0;
- }
- int
- fdt_num_mem_rsv (
- const void *fdt
- )
- {
- int i = 0;
- while (fdt64_to_cpu (_fdt_mem_rsv (fdt, i)->size) != 0) {
- i++;
- }
- return i;
- }
- static int
- _nextprop (
- const void *fdt,
- int offset
- )
- {
- uint32_t tag;
- int nextoffset;
- do {
- tag = fdt_next_tag (fdt, offset, &nextoffset);
- switch (tag) {
- case FDT_END:
- if (nextoffset >= 0) {
- return -FDT_ERR_BADSTRUCTURE;
- } else {
- return nextoffset;
- }
- case FDT_PROP:
- return offset;
- }
- offset = nextoffset;
- } while (tag == FDT_NOP);
- return -FDT_ERR_NOTFOUND;
- }
- int
- fdt_subnode_offset_namelen (
- const void *fdt,
- int offset,
- const char *name,
- int namelen
- )
- {
- int depth;
- FDT_CHECK_HEADER (fdt);
- for (depth = 0;
- (offset >= 0) && (depth >= 0);
- offset = fdt_next_node (fdt, offset, &depth))
- {
- if ( (depth == 1)
- && _fdt_nodename_eq (fdt, offset, name, namelen))
- {
- return offset;
- }
- }
- if (depth < 0) {
- return -FDT_ERR_NOTFOUND;
- }
- return offset; /* error */
- }
- int
- fdt_subnode_offset (
- const void *fdt,
- int parentoffset,
- const char *name
- )
- {
- return fdt_subnode_offset_namelen (fdt, parentoffset, name, strlen (name));
- }
- int
- fdt_path_offset_namelen (
- const void *fdt,
- const char *path,
- int namelen
- )
- {
- const char *end = path + namelen;
- const char *p = path;
- int offset = 0;
- FDT_CHECK_HEADER (fdt);
- /* see if we have an alias */
- if (*path != '/') {
- const char *q = memchr (path, '/', end - p);
- if (!q) {
- q = end;
- }
- p = fdt_get_alias_namelen (fdt, p, q - p);
- if (!p) {
- return -FDT_ERR_BADPATH;
- }
- offset = fdt_path_offset (fdt, p);
- p = q;
- }
- while (p < end) {
- const char *q;
- while (*p == '/') {
- p++;
- if (p == end) {
- return offset;
- }
- }
- q = memchr (p, '/', end - p);
- if (!q) {
- q = end;
- }
- offset = fdt_subnode_offset_namelen (fdt, offset, p, q-p);
- if (offset < 0) {
- return offset;
- }
- p = q;
- }
- return offset;
- }
- int
- fdt_path_offset (
- const void *fdt,
- const char *path
- )
- {
- return fdt_path_offset_namelen (fdt, path, strlen (path));
- }
- const char *
- fdt_get_name (
- const void *fdt,
- int nodeoffset,
- int *len
- )
- {
- const struct fdt_node_header *nh = _fdt_offset_ptr (fdt, nodeoffset);
- int err;
- if ( ((err = fdt_check_header (fdt)) != 0)
- || ((err = _fdt_check_node_offset (fdt, nodeoffset)) < 0))
- {
- goto fail;
- }
- if (len) {
- *len = strlen (nh->name);
- }
- return nh->name;
- fail:
- if (len) {
- *len = err;
- }
- return NULL;
- }
- int
- fdt_first_property_offset (
- const void *fdt,
- int nodeoffset
- )
- {
- int offset;
- if ((offset = _fdt_check_node_offset (fdt, nodeoffset)) < 0) {
- return offset;
- }
- return _nextprop (fdt, offset);
- }
- int
- fdt_next_property_offset (
- const void *fdt,
- int offset
- )
- {
- if ((offset = _fdt_check_prop_offset (fdt, offset)) < 0) {
- return offset;
- }
- return _nextprop (fdt, offset);
- }
- const struct fdt_property *
- fdt_get_property_by_offset (
- const void *fdt,
- int offset,
- int *lenp
- )
- {
- int err;
- const struct fdt_property *prop;
- if ((err = _fdt_check_prop_offset (fdt, offset)) < 0) {
- if (lenp) {
- *lenp = err;
- }
- return NULL;
- }
- prop = _fdt_offset_ptr (fdt, offset);
- if (lenp) {
- *lenp = fdt32_to_cpu (prop->len);
- }
- return prop;
- }
- const struct fdt_property *
- fdt_get_property_namelen (
- const void *fdt,
- int offset,
- const char *name,
- int namelen,
- int *lenp
- )
- {
- for (offset = fdt_first_property_offset (fdt, offset);
- (offset >= 0);
- (offset = fdt_next_property_offset (fdt, offset)))
- {
- const struct fdt_property *prop;
- if (!(prop = fdt_get_property_by_offset (fdt, offset, lenp))) {
- offset = -FDT_ERR_INTERNAL;
- break;
- }
- if (_fdt_string_eq (
- fdt,
- fdt32_to_cpu (prop->nameoff),
- name,
- namelen
- ))
- {
- return prop;
- }
- }
- if (lenp) {
- *lenp = offset;
- }
- return NULL;
- }
- const struct fdt_property *
- fdt_get_property (
- const void *fdt,
- int nodeoffset,
- const char *name,
- int *lenp
- )
- {
- return fdt_get_property_namelen (
- fdt,
- nodeoffset,
- name,
- strlen (name),
- lenp
- );
- }
- const void *
- fdt_getprop_namelen (
- const void *fdt,
- int nodeoffset,
- const char *name,
- int namelen,
- int *lenp
- )
- {
- const struct fdt_property *prop;
- prop = fdt_get_property_namelen (fdt, nodeoffset, name, namelen, lenp);
- if (!prop) {
- return NULL;
- }
- return prop->data;
- }
- const void *
- fdt_getprop_by_offset (
- const void *fdt,
- int offset,
- const char **namep,
- int *lenp
- )
- {
- const struct fdt_property *prop;
- prop = fdt_get_property_by_offset (fdt, offset, lenp);
- if (!prop) {
- return NULL;
- }
- if (namep) {
- *namep = fdt_string (fdt, fdt32_to_cpu (prop->nameoff));
- }
- return prop->data;
- }
- const void *
- fdt_getprop (
- const void *fdt,
- int nodeoffset,
- const char *name,
- int *lenp
- )
- {
- return fdt_getprop_namelen (fdt, nodeoffset, name, strlen (name), lenp);
- }
- uint32_t
- fdt_get_phandle (
- const void *fdt,
- int nodeoffset
- )
- {
- const fdt32_t *php;
- int len;
- /* FIXME: This is a bit sub-optimal, since we potentially scan
- * over all the properties twice. */
- php = fdt_getprop (fdt, nodeoffset, "phandle", &len);
- if (!php || (len != sizeof (*php))) {
- php = fdt_getprop (fdt, nodeoffset, "linux,phandle", &len);
- if (!php || (len != sizeof (*php))) {
- return 0;
- }
- }
- return fdt32_to_cpu (*php);
- }
- const char *
- fdt_get_alias_namelen (
- const void *fdt,
- const char *name,
- int namelen
- )
- {
- int aliasoffset;
- aliasoffset = fdt_path_offset (fdt, "/aliases");
- if (aliasoffset < 0) {
- return NULL;
- }
- return fdt_getprop_namelen (fdt, aliasoffset, name, namelen, NULL);
- }
- const char *
- fdt_get_alias (
- const void *fdt,
- const char *name
- )
- {
- return fdt_get_alias_namelen (fdt, name, strlen (name));
- }
- int
- fdt_get_path (
- const void *fdt,
- int nodeoffset,
- char *buf,
- int buflen
- )
- {
- int pdepth = 0, p = 0;
- int offset, depth, namelen;
- const char *name;
- FDT_CHECK_HEADER (fdt);
- if (buflen < 2) {
- return -FDT_ERR_NOSPACE;
- }
- for (offset = 0, depth = 0;
- (offset >= 0) && (offset <= nodeoffset);
- offset = fdt_next_node (fdt, offset, &depth))
- {
- while (pdepth > depth) {
- do {
- p--;
- } while (buf[p-1] != '/');
- pdepth--;
- }
- if (pdepth >= depth) {
- name = fdt_get_name (fdt, offset, &namelen);
- if (!name) {
- return namelen;
- }
- if ((p + namelen + 1) <= buflen) {
- memcpy (buf + p, name, namelen);
- p += namelen;
- buf[p++] = '/';
- pdepth++;
- }
- }
- if (offset == nodeoffset) {
- if (pdepth < (depth + 1)) {
- return -FDT_ERR_NOSPACE;
- }
- if (p > 1) {
- /* special case so that root path is "/", not "" */
- p--;
- }
- buf[p] = '\0';
- return 0;
- }
- }
- if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0)) {
- return -FDT_ERR_BADOFFSET;
- } else if (offset == -FDT_ERR_BADOFFSET) {
- return -FDT_ERR_BADSTRUCTURE;
- }
- return offset; /* error from fdt_next_node() */
- }
- int
- fdt_supernode_atdepth_offset (
- const void *fdt,
- int nodeoffset,
- int supernodedepth,
- int *nodedepth
- )
- {
- int offset, depth;
- int supernodeoffset = -FDT_ERR_INTERNAL;
- FDT_CHECK_HEADER (fdt);
- if (supernodedepth < 0) {
- return -FDT_ERR_NOTFOUND;
- }
- for (offset = 0, depth = 0;
- (offset >= 0) && (offset <= nodeoffset);
- offset = fdt_next_node (fdt, offset, &depth))
- {
- if (depth == supernodedepth) {
- supernodeoffset = offset;
- }
- if (offset == nodeoffset) {
- if (nodedepth) {
- *nodedepth = depth;
- }
- if (supernodedepth > depth) {
- return -FDT_ERR_NOTFOUND;
- } else {
- return supernodeoffset;
- }
- }
- }
- if ((offset == -FDT_ERR_NOTFOUND) || (offset >= 0)) {
- return -FDT_ERR_BADOFFSET;
- } else if (offset == -FDT_ERR_BADOFFSET) {
- return -FDT_ERR_BADSTRUCTURE;
- }
- return offset; /* error from fdt_next_node() */
- }
- int
- fdt_node_depth (
- const void *fdt,
- int nodeoffset
- )
- {
- int nodedepth;
- int err;
- err = fdt_supernode_atdepth_offset (fdt, nodeoffset, 0, &nodedepth);
- if (err) {
- return (err < 0) ? err : -FDT_ERR_INTERNAL;
- }
- return nodedepth;
- }
- int
- fdt_parent_offset (
- const void *fdt,
- int nodeoffset
- )
- {
- int nodedepth = fdt_node_depth (fdt, nodeoffset);
- if (nodedepth < 0) {
- return nodedepth;
- }
- return fdt_supernode_atdepth_offset (
- fdt,
- nodeoffset,
- nodedepth - 1,
- NULL
- );
- }
- int
- fdt_node_offset_by_prop_value (
- const void *fdt,
- int startoffset,
- const char *propname,
- const void *propval,
- int proplen
- )
- {
- int offset;
- const void *val;
- int len;
- FDT_CHECK_HEADER (fdt);
- /* FIXME: The algorithm here is pretty horrible: we scan each
- * property of a node in fdt_getprop(), then if that didn't
- * find what we want, we scan over them again making our way
- * to the next node. Still it's the easiest to implement
- * approach; performance can come later. */
- for (offset = fdt_next_node (fdt, startoffset, NULL);
- offset >= 0;
- offset = fdt_next_node (fdt, offset, NULL))
- {
- val = fdt_getprop (fdt, offset, propname, &len);
- if ( val && (len == proplen)
- && (memcmp (val, propval, len) == 0))
- {
- return offset;
- }
- }
- return offset; /* error from fdt_next_node() */
- }
- int
- fdt_node_offset_by_phandle (
- const void *fdt,
- uint32_t phandle
- )
- {
- int offset;
- if ((phandle == 0) || (phandle == -1)) {
- return -FDT_ERR_BADPHANDLE;
- }
- FDT_CHECK_HEADER (fdt);
- /* FIXME: The algorithm here is pretty horrible: we
- * potentially scan each property of a node in
- * fdt_get_phandle(), then if that didn't find what
- * we want, we scan over them again making our way to the next
- * node. Still it's the easiest to implement approach;
- * performance can come later. */
- for (offset = fdt_next_node (fdt, -1, NULL);
- offset >= 0;
- offset = fdt_next_node (fdt, offset, NULL))
- {
- if (fdt_get_phandle (fdt, offset) == phandle) {
- return offset;
- }
- }
- return offset; /* error from fdt_next_node() */
- }
- int
- fdt_stringlist_contains (
- const char *strlist,
- int listlen,
- const char *str
- )
- {
- int len = strlen (str);
- const char *p;
- while (listlen >= len) {
- if (memcmp (str, strlist, len+1) == 0) {
- return 1;
- }
- p = memchr (strlist, '\0', listlen);
- if (!p) {
- return 0; /* malformed strlist.. */
- }
- listlen -= (p-strlist) + 1;
- strlist = p + 1;
- }
- return 0;
- }
- int
- fdt_stringlist_count (
- const void *fdt,
- int nodeoffset,
- const char *property
- )
- {
- const char *list, *end;
- int length, count = 0;
- list = fdt_getprop (fdt, nodeoffset, property, &length);
- if (!list) {
- return length;
- }
- end = list + length;
- while (list < end) {
- length = strnlen (list, end - list) + 1;
- /* Abort if the last string isn't properly NUL-terminated. */
- if (list + length > end) {
- return -FDT_ERR_BADVALUE;
- }
- list += length;
- count++;
- }
- return count;
- }
- int
- fdt_stringlist_search (
- const void *fdt,
- int nodeoffset,
- const char *property,
- const char *string
- )
- {
- int length, len, idx = 0;
- const char *list, *end;
- list = fdt_getprop (fdt, nodeoffset, property, &length);
- if (!list) {
- return length;
- }
- len = strlen (string) + 1;
- end = list + length;
- while (list < end) {
- length = strnlen (list, end - list) + 1;
- /* Abort if the last string isn't properly NUL-terminated. */
- if (list + length > end) {
- return -FDT_ERR_BADVALUE;
- }
- if ((length == len) && (memcmp (list, string, length) == 0)) {
- return idx;
- }
- list += length;
- idx++;
- }
- return -FDT_ERR_NOTFOUND;
- }
- const char *
- fdt_stringlist_get (
- const void *fdt,
- int nodeoffset,
- const char *property,
- int idx,
- int *lenp
- )
- {
- const char *list, *end;
- int length;
- list = fdt_getprop (fdt, nodeoffset, property, &length);
- if (!list) {
- if (lenp) {
- *lenp = length;
- }
- return NULL;
- }
- end = list + length;
- while (list < end) {
- length = strnlen (list, end - list) + 1;
- /* Abort if the last string isn't properly NUL-terminated. */
- if (list + length > end) {
- if (lenp) {
- *lenp = -FDT_ERR_BADVALUE;
- }
- return NULL;
- }
- if (idx == 0) {
- if (lenp) {
- *lenp = length - 1;
- }
- return list;
- }
- list += length;
- idx--;
- }
- if (lenp) {
- *lenp = -FDT_ERR_NOTFOUND;
- }
- return NULL;
- }
- int
- fdt_node_check_compatible (
- const void *fdt,
- int nodeoffset,
- const char *compatible
- )
- {
- const void *prop;
- int len;
- prop = fdt_getprop (fdt, nodeoffset, "compatible", &len);
- if (!prop) {
- return len;
- }
- return !fdt_stringlist_contains (prop, len, compatible);
- }
- int
- fdt_node_offset_by_compatible (
- const void *fdt,
- int startoffset,
- const char *compatible
- )
- {
- int offset, err;
- FDT_CHECK_HEADER (fdt);
- /* FIXME: The algorithm here is pretty horrible: we scan each
- * property of a node in fdt_node_check_compatible(), then if
- * that didn't find what we want, we scan over them again
- * making our way to the next node. Still it's the easiest to
- * implement approach; performance can come later. */
- for (offset = fdt_next_node (fdt, startoffset, NULL);
- offset >= 0;
- offset = fdt_next_node (fdt, offset, NULL))
- {
- err = fdt_node_check_compatible (fdt, offset, compatible);
- if ((err < 0) && (err != -FDT_ERR_NOTFOUND)) {
- return err;
- } else if (err == 0) {
- return offset;
- }
- }
- return offset; /* error from fdt_next_node() */
- }
|