]>
git.proxmox.com Git - mirror_edk2.git/blob - EmbeddedPkg/Library/FdtLib/fdt_ro.c
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 static int _nextprop(const void *fdt
, int offset
)
114 tag
= fdt_next_tag(fdt
, offset
, &nextoffset
);
119 return -FDT_ERR_BADSTRUCTURE
;
127 } while (tag
== FDT_NOP
);
129 return -FDT_ERR_NOTFOUND
;
132 int fdt_subnode_offset_namelen(const void *fdt
, int offset
,
133 const char *name
, int namelen
)
137 FDT_CHECK_HEADER(fdt
);
140 (offset
>= 0) && (depth
>= 0);
141 offset
= fdt_next_node(fdt
, offset
, &depth
))
143 && _fdt_nodename_eq(fdt
, offset
, name
, namelen
))
147 return -FDT_ERR_NOTFOUND
;
148 return offset
; /* error */
151 int fdt_subnode_offset(const void *fdt
, int parentoffset
,
154 return fdt_subnode_offset_namelen(fdt
, parentoffset
, name
, strlen(name
));
157 int fdt_path_offset(const void *fdt
, const char *path
)
159 const char *end
= path
+ strlen(path
);
160 const char *p
= path
;
163 FDT_CHECK_HEADER(fdt
);
165 /* see if we have an alias */
167 const char *q
= strchr(path
, '/');
172 p
= fdt_get_alias_namelen(fdt
, p
, q
- p
);
174 return -FDT_ERR_BADPATH
;
175 offset
= fdt_path_offset(fdt
, p
);
191 offset
= fdt_subnode_offset_namelen(fdt
, offset
, p
, q
-p
);
201 const char *fdt_get_name(const void *fdt
, int nodeoffset
, int *len
)
203 const struct fdt_node_header
*nh
= _fdt_offset_ptr(fdt
, nodeoffset
);
206 if (((err
= fdt_check_header(fdt
)) != 0)
207 || ((err
= _fdt_check_node_offset(fdt
, nodeoffset
)) < 0))
211 *len
= strlen(nh
->name
);
221 int fdt_first_property_offset(const void *fdt
, int nodeoffset
)
225 if ((offset
= _fdt_check_node_offset(fdt
, nodeoffset
)) < 0)
228 return _nextprop(fdt
, offset
);
231 int fdt_next_property_offset(const void *fdt
, int offset
)
233 if ((offset
= _fdt_check_prop_offset(fdt
, offset
)) < 0)
236 return _nextprop(fdt
, offset
);
239 const struct fdt_property
*fdt_get_property_by_offset(const void *fdt
,
244 const struct fdt_property
*prop
;
246 if ((err
= _fdt_check_prop_offset(fdt
, offset
)) < 0) {
252 prop
= _fdt_offset_ptr(fdt
, offset
);
255 *lenp
= fdt32_to_cpu(prop
->len
);
260 const struct fdt_property
*fdt_get_property_namelen(const void *fdt
,
263 int namelen
, int *lenp
)
265 for (offset
= fdt_first_property_offset(fdt
, offset
);
267 (offset
= fdt_next_property_offset(fdt
, offset
))) {
268 const struct fdt_property
*prop
;
270 prop
= fdt_get_property_by_offset(fdt
, offset
, lenp
);
272 offset
= -FDT_ERR_INTERNAL
;
275 if (_fdt_string_eq(fdt
, fdt32_to_cpu(prop
->nameoff
),
285 const struct fdt_property
*fdt_get_property(const void *fdt
,
287 const char *name
, int *lenp
)
289 return fdt_get_property_namelen(fdt
, nodeoffset
, name
,
293 const void *fdt_getprop_namelen(const void *fdt
, int nodeoffset
,
294 const char *name
, int namelen
, int *lenp
)
296 const struct fdt_property
*prop
;
298 prop
= fdt_get_property_namelen(fdt
, nodeoffset
, name
, namelen
, lenp
);
305 const void *fdt_getprop_by_offset(const void *fdt
, int offset
,
306 const char **namep
, int *lenp
)
308 const struct fdt_property
*prop
;
310 prop
= fdt_get_property_by_offset(fdt
, offset
, lenp
);
314 *namep
= fdt_string(fdt
, fdt32_to_cpu(prop
->nameoff
));
318 const void *fdt_getprop(const void *fdt
, int nodeoffset
,
319 const char *name
, int *lenp
)
321 return fdt_getprop_namelen(fdt
, nodeoffset
, name
, strlen(name
), lenp
);
324 uint32_t fdt_get_phandle(const void *fdt
, int nodeoffset
)
329 /* FIXME: This is a bit sub-optimal, since we potentially scan
330 * over all the properties twice. */
331 php
= fdt_getprop(fdt
, nodeoffset
, "phandle", &len
);
332 if (!php
|| (len
!= sizeof(*php
))) {
333 php
= fdt_getprop(fdt
, nodeoffset
, "linux,phandle", &len
);
334 if (!php
|| (len
!= sizeof(*php
)))
338 return fdt32_to_cpu(*php
);
341 const char *fdt_get_alias_namelen(const void *fdt
,
342 const char *name
, int namelen
)
346 aliasoffset
= fdt_path_offset(fdt
, "/aliases");
350 return fdt_getprop_namelen(fdt
, aliasoffset
, name
, namelen
, NULL
);
353 const char *fdt_get_alias(const void *fdt
, const char *name
)
355 return fdt_get_alias_namelen(fdt
, name
, strlen(name
));
358 int fdt_get_path(const void *fdt
, int nodeoffset
, char *buf
, int buflen
)
360 int pdepth
= 0, p
= 0;
361 int offset
, depth
, namelen
;
364 FDT_CHECK_HEADER(fdt
);
367 return -FDT_ERR_NOSPACE
;
369 for (offset
= 0, depth
= 0;
370 (offset
>= 0) && (offset
<= nodeoffset
);
371 offset
= fdt_next_node(fdt
, offset
, &depth
)) {
372 while (pdepth
> depth
) {
375 } while (buf
[p
-1] != '/');
379 if (pdepth
>= depth
) {
380 name
= fdt_get_name(fdt
, offset
, &namelen
);
383 if ((p
+ namelen
+ 1) <= buflen
) {
384 memcpy(buf
+ p
, name
, namelen
);
391 if (offset
== nodeoffset
) {
392 if (pdepth
< (depth
+ 1))
393 return -FDT_ERR_NOSPACE
;
395 if (p
> 1) /* special case so that root path is "/", not "" */
402 if ((offset
== -FDT_ERR_NOTFOUND
) || (offset
>= 0))
403 return -FDT_ERR_BADOFFSET
;
404 else if (offset
== -FDT_ERR_BADOFFSET
)
405 return -FDT_ERR_BADSTRUCTURE
;
407 return offset
; /* error from fdt_next_node() */
410 int fdt_supernode_atdepth_offset(const void *fdt
, int nodeoffset
,
411 int supernodedepth
, int *nodedepth
)
414 int supernodeoffset
= -FDT_ERR_INTERNAL
;
416 FDT_CHECK_HEADER(fdt
);
418 if (supernodedepth
< 0)
419 return -FDT_ERR_NOTFOUND
;
421 for (offset
= 0, depth
= 0;
422 (offset
>= 0) && (offset
<= nodeoffset
);
423 offset
= fdt_next_node(fdt
, offset
, &depth
)) {
424 if (depth
== supernodedepth
)
425 supernodeoffset
= offset
;
427 if (offset
== nodeoffset
) {
431 if (supernodedepth
> depth
)
432 return -FDT_ERR_NOTFOUND
;
434 return supernodeoffset
;
438 if ((offset
== -FDT_ERR_NOTFOUND
) || (offset
>= 0))
439 return -FDT_ERR_BADOFFSET
;
440 else if (offset
== -FDT_ERR_BADOFFSET
)
441 return -FDT_ERR_BADSTRUCTURE
;
443 return offset
; /* error from fdt_next_node() */
446 int fdt_node_depth(const void *fdt
, int nodeoffset
)
451 err
= fdt_supernode_atdepth_offset(fdt
, nodeoffset
, 0, &nodedepth
);
453 return (err
< 0) ? err
: -FDT_ERR_INTERNAL
;
457 int fdt_parent_offset(const void *fdt
, int nodeoffset
)
459 int nodedepth
= fdt_node_depth(fdt
, nodeoffset
);
463 return fdt_supernode_atdepth_offset(fdt
, nodeoffset
,
464 nodedepth
- 1, NULL
);
467 int fdt_node_offset_by_prop_value(const void *fdt
, int startoffset
,
468 const char *propname
,
469 const void *propval
, int proplen
)
475 FDT_CHECK_HEADER(fdt
);
477 /* FIXME: The algorithm here is pretty horrible: we scan each
478 * property of a node in fdt_getprop(), then if that didn't
479 * find what we want, we scan over them again making our way
480 * to the next node. Still it's the easiest to implement
481 * approach; performance can come later. */
482 for (offset
= fdt_next_node(fdt
, startoffset
, NULL
);
484 offset
= fdt_next_node(fdt
, offset
, NULL
)) {
485 val
= fdt_getprop(fdt
, offset
, propname
, &len
);
486 if (val
&& (len
== proplen
)
487 && (memcmp(val
, propval
, len
) == 0))
491 return offset
; /* error from fdt_next_node() */
494 int fdt_node_offset_by_phandle(const void *fdt
, uint32_t phandle
)
498 if ((phandle
== 0) || (phandle
== (uint32_t)-1))
499 return -FDT_ERR_BADPHANDLE
;
501 FDT_CHECK_HEADER(fdt
);
503 /* FIXME: The algorithm here is pretty horrible: we
504 * potentially scan each property of a node in
505 * fdt_get_phandle(), then if that didn't find what
506 * we want, we scan over them again making our way to the next
507 * node. Still it's the easiest to implement approach;
508 * performance can come later. */
509 for (offset
= fdt_next_node(fdt
, -1, NULL
);
511 offset
= fdt_next_node(fdt
, offset
, NULL
)) {
512 if (fdt_get_phandle(fdt
, offset
) == phandle
)
516 return offset
; /* error from fdt_next_node() */
519 int fdt_stringlist_contains(const char *strlist
, int listlen
, const char *str
)
521 int len
= strlen(str
);
524 while (listlen
>= len
) {
525 if (memcmp(str
, strlist
, len
+1) == 0)
527 p
= memchr(strlist
, '\0', listlen
);
529 return 0; /* malformed strlist.. */
530 listlen
-= (p
-strlist
) + 1;
536 int fdt_node_check_compatible(const void *fdt
, int nodeoffset
,
537 const char *compatible
)
542 prop
= fdt_getprop(fdt
, nodeoffset
, "compatible", &len
);
545 if (fdt_stringlist_contains(prop
, len
, compatible
))
551 int fdt_node_offset_by_compatible(const void *fdt
, int startoffset
,
552 const char *compatible
)
556 FDT_CHECK_HEADER(fdt
);
558 /* FIXME: The algorithm here is pretty horrible: we scan each
559 * property of a node in fdt_node_check_compatible(), then if
560 * that didn't find what we want, we scan over them again
561 * making our way to the next node. Still it's the easiest to
562 * implement approach; performance can come later. */
563 for (offset
= fdt_next_node(fdt
, startoffset
, NULL
);
565 offset
= fdt_next_node(fdt
, offset
, NULL
)) {
566 err
= fdt_node_check_compatible(fdt
, offset
, compatible
);
567 if ((err
< 0) && (err
!= -FDT_ERR_NOTFOUND
))
573 return offset
; /* error from fdt_next_node() */