blob: 940cee8b126b259b40c5aa34e592bcbb8191b7f0 [file] [log] [blame]
Gerald Van Barenc0577a62007-03-31 11:59:59 -04001/*
2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
4 *
Kumar Galac8ab7052007-10-24 11:04:22 -05005 * libfdt is dual licensed: you can use it either under the terms of
6 * the GPL, or the BSD license, at your option.
Gerald Van Barenc0577a62007-03-31 11:59:59 -04007 *
Kumar Galac8ab7052007-10-24 11:04:22 -05008 * 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.
Gerald Van Barenc0577a62007-03-31 11:59:59 -040012 *
Kumar Galac8ab7052007-10-24 11:04:22 -050013 * 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.
17 *
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,
21 * MA 02110-1301 USA
22 *
23 * Alternatively,
24 *
25 * b) Redistribution and use in source and binary forms, with or
26 * without modification, are permitted provided that the following
27 * conditions are met:
28 *
29 * 1. Redistributions of source code must retain the above
30 * copyright notice, this list of conditions and the following
31 * disclaimer.
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.
36 *
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.
Gerald Van Barenc0577a62007-03-31 11:59:59 -040050 */
51#include "libfdt_env.h"
52
Bartlomiej Sieka61250862008-02-29 16:00:24 +010053#ifndef USE_HOSTCC
Gerald Van Barenc0577a62007-03-31 11:59:59 -040054#include <fdt.h>
55#include <libfdt.h>
Bartlomiej Sieka61250862008-02-29 16:00:24 +010056#else
57#include "fdt_host.h"
58#endif
Gerald Van Barenc0577a62007-03-31 11:59:59 -040059
60#include "libfdt_internal.h"
61
Gerald Van Baren9f0f3582007-04-06 14:17:14 -040062int fdt_check_header(const void *fdt)
Gerald Van Barenc0577a62007-03-31 11:59:59 -040063{
64 if (fdt_magic(fdt) == FDT_MAGIC) {
65 /* Complete tree */
66 if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION)
67 return -FDT_ERR_BADVERSION;
68 if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION)
69 return -FDT_ERR_BADVERSION;
David Gibson9457d9d2008-07-09 14:10:24 +100070 } else if (fdt_magic(fdt) == FDT_SW_MAGIC) {
Gerald Van Barenc0577a62007-03-31 11:59:59 -040071 /* Unfinished sequential-write blob */
72 if (fdt_size_dt_struct(fdt) == 0)
73 return -FDT_ERR_BADSTATE;
74 } else {
75 return -FDT_ERR_BADMAGIC;
76 }
77
78 return 0;
79}
80
Jon Loeligerd94d0f12008-09-25 11:02:17 -050081const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int len)
Gerald Van Barenc0577a62007-03-31 11:59:59 -040082{
David Gibsonb4141b82008-07-07 10:10:48 +100083 const char *p;
Gerald Van Barenc0577a62007-03-31 11:59:59 -040084
85 if (fdt_version(fdt) >= 0x11)
86 if (((offset + len) < offset)
87 || ((offset + len) > fdt_size_dt_struct(fdt)))
88 return NULL;
89
90 p = _fdt_offset_ptr(fdt, offset);
91
92 if (p + len < p)
93 return NULL;
94 return p;
95}
96
Kumar Galac8ab7052007-10-24 11:04:22 -050097uint32_t fdt_next_tag(const void *fdt, int offset, int *nextoffset)
98{
99 const uint32_t *tagp, *lenp;
100 uint32_t tag;
101 const char *p;
102
103 if (offset % FDT_TAGSIZE)
104 return -1;
105
106 tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE);
107 if (! tagp)
108 return FDT_END; /* premature end */
109 tag = fdt32_to_cpu(*tagp);
110 offset += FDT_TAGSIZE;
111
112 switch (tag) {
113 case FDT_BEGIN_NODE:
114 /* skip name */
115 do {
116 p = fdt_offset_ptr(fdt, offset++, 1);
117 } while (p && (*p != '\0'));
118 if (! p)
119 return FDT_END;
120 break;
121 case FDT_PROP:
122 lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp));
123 if (! lenp)
124 return FDT_END;
125 /* skip name offset, length and value */
126 offset += 2*FDT_TAGSIZE + fdt32_to_cpu(*lenp);
127 break;
128 }
129
130 if (nextoffset)
David Gibson9457d9d2008-07-09 14:10:24 +1000131 *nextoffset = FDT_TAGALIGN(offset);
Kumar Galac8ab7052007-10-24 11:04:22 -0500132
133 return tag;
134}
135
David Gibson148a49b2008-05-20 17:19:11 +1000136int _fdt_check_node_offset(const void *fdt, int offset)
137{
138 if ((offset < 0) || (offset % FDT_TAGSIZE)
139 || (fdt_next_tag(fdt, offset, &offset) != FDT_BEGIN_NODE))
140 return -FDT_ERR_BADOFFSET;
141
142 return offset;
143}
144
David Gibsond9d793c2008-02-12 11:58:31 +1100145int fdt_next_node(const void *fdt, int offset, int *depth)
146{
147 int nextoffset = 0;
148 uint32_t tag;
149
David Gibson148a49b2008-05-20 17:19:11 +1000150 if (offset >= 0)
151 if ((nextoffset = _fdt_check_node_offset(fdt, offset)) < 0)
152 return nextoffset;
David Gibsond9d793c2008-02-12 11:58:31 +1100153
154 do {
155 offset = nextoffset;
156 tag = fdt_next_tag(fdt, offset, &nextoffset);
157
158 switch (tag) {
159 case FDT_PROP:
160 case FDT_NOP:
161 break;
162
163 case FDT_BEGIN_NODE:
164 if (depth)
165 (*depth)++;
166 break;
167
168 case FDT_END_NODE:
David Gibson954914a2009-02-06 14:01:56 +1100169 if (depth && ((--(*depth)) < 0))
170 return nextoffset;
David Gibsond9d793c2008-02-12 11:58:31 +1100171 break;
172
173 case FDT_END:
174 return -FDT_ERR_NOTFOUND;
175
176 default:
177 return -FDT_ERR_BADSTRUCTURE;
178 }
179 } while (tag != FDT_BEGIN_NODE);
180
181 return offset;
182}
183
Gerald Van Barenc0577a62007-03-31 11:59:59 -0400184const char *_fdt_find_string(const char *strtab, int tabsize, const char *s)
185{
186 int len = strlen(s) + 1;
187 const char *last = strtab + tabsize - len;
188 const char *p;
189
190 for (p = strtab; p <= last; p++)
David Gibson9457d9d2008-07-09 14:10:24 +1000191 if (memcmp(p, s, len) == 0)
Gerald Van Barenc0577a62007-03-31 11:59:59 -0400192 return p;
193 return NULL;
194}
195
196int fdt_move(const void *fdt, void *buf, int bufsize)
197{
David Gibson9457d9d2008-07-09 14:10:24 +1000198 FDT_CHECK_HEADER(fdt);
Gerald Van Barenc0577a62007-03-31 11:59:59 -0400199
200 if (fdt_totalsize(fdt) > bufsize)
201 return -FDT_ERR_NOSPACE;
202
203 memmove(buf, fdt, fdt_totalsize(fdt));
204 return 0;
205}