Loading...
1// SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause)
2/*
3 * libfdt - Flat Device Tree manipulation
4 * Copyright (C) 2006 David Gibson, IBM Corporation.
5 */
6#include "libfdt_env.h"
7
8#include <fdt.h>
9#include <libfdt.h>
10
11#include "libfdt_internal.h"
12
13/*
14 * Minimal sanity check for a read-only tree. fdt_ro_probe_() checks
15 * that the given buffer contains what appears to be a flattened
16 * device tree with sane information in its header.
17 */
18int32_t fdt_ro_probe_(const void *fdt)
19{
20 uint32_t totalsize = fdt_totalsize(fdt);
21
22 if (can_assume(VALID_DTB))
23 return totalsize;
24
25 /* The device tree must be at an 8-byte aligned address */
26 if ((uintptr_t)fdt & 7)
27 return -FDT_ERR_ALIGNMENT;
28
29 if (fdt_magic(fdt) == FDT_MAGIC) {
30 /* Complete tree */
31 if (!can_assume(LATEST)) {
32 if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION)
33 return -FDT_ERR_BADVERSION;
34 if (fdt_last_comp_version(fdt) >
35 FDT_LAST_SUPPORTED_VERSION)
36 return -FDT_ERR_BADVERSION;
37 }
38 } else if (fdt_magic(fdt) == FDT_SW_MAGIC) {
39 /* Unfinished sequential-write blob */
40 if (!can_assume(VALID_INPUT) && fdt_size_dt_struct(fdt) == 0)
41 return -FDT_ERR_BADSTATE;
42 } else {
43 return -FDT_ERR_BADMAGIC;
44 }
45
46 if (totalsize < INT32_MAX)
47 return totalsize;
48 else
49 return -FDT_ERR_TRUNCATED;
50}
51
52static int check_off_(uint32_t hdrsize, uint32_t totalsize, uint32_t off)
53{
54 return (off >= hdrsize) && (off <= totalsize);
55}
56
57static int check_block_(uint32_t hdrsize, uint32_t totalsize,
58 uint32_t base, uint32_t size)
59{
60 if (!check_off_(hdrsize, totalsize, base))
61 return 0; /* block start out of bounds */
62 if ((base + size) < base)
63 return 0; /* overflow */
64 if (!check_off_(hdrsize, totalsize, base + size))
65 return 0; /* block end out of bounds */
66 return 1;
67}
68
69size_t fdt_header_size_(uint32_t version)
70{
71 if (version <= 1)
72 return FDT_V1_SIZE;
73 else if (version <= 2)
74 return FDT_V2_SIZE;
75 else if (version <= 3)
76 return FDT_V3_SIZE;
77 else if (version <= 16)
78 return FDT_V16_SIZE;
79 else
80 return FDT_V17_SIZE;
81}
82
83size_t fdt_header_size(const void *fdt)
84{
85 return can_assume(LATEST) ? FDT_V17_SIZE :
86 fdt_header_size_(fdt_version(fdt));
87}
88
89int fdt_check_header(const void *fdt)
90{
91 size_t hdrsize;
92
93 /* The device tree must be at an 8-byte aligned address */
94 if ((uintptr_t)fdt & 7)
95 return -FDT_ERR_ALIGNMENT;
96
97 if (fdt_magic(fdt) != FDT_MAGIC)
98 return -FDT_ERR_BADMAGIC;
99 if (!can_assume(LATEST)) {
100 if ((fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION)
101 || (fdt_last_comp_version(fdt) >
102 FDT_LAST_SUPPORTED_VERSION))
103 return -FDT_ERR_BADVERSION;
104 if (fdt_version(fdt) < fdt_last_comp_version(fdt))
105 return -FDT_ERR_BADVERSION;
106 }
107 hdrsize = fdt_header_size(fdt);
108 if (!can_assume(VALID_DTB)) {
109 if ((fdt_totalsize(fdt) < hdrsize)
110 || (fdt_totalsize(fdt) > INT_MAX))
111 return -FDT_ERR_TRUNCATED;
112
113 /* Bounds check memrsv block */
114 if (!check_off_(hdrsize, fdt_totalsize(fdt),
115 fdt_off_mem_rsvmap(fdt)))
116 return -FDT_ERR_TRUNCATED;
117
118 /* Bounds check structure block */
119 if (!can_assume(LATEST) && fdt_version(fdt) < 17) {
120 if (!check_off_(hdrsize, fdt_totalsize(fdt),
121 fdt_off_dt_struct(fdt)))
122 return -FDT_ERR_TRUNCATED;
123 } else {
124 if (!check_block_(hdrsize, fdt_totalsize(fdt),
125 fdt_off_dt_struct(fdt),
126 fdt_size_dt_struct(fdt)))
127 return -FDT_ERR_TRUNCATED;
128 }
129
130 /* Bounds check strings block */
131 if (!check_block_(hdrsize, fdt_totalsize(fdt),
132 fdt_off_dt_strings(fdt),
133 fdt_size_dt_strings(fdt)))
134 return -FDT_ERR_TRUNCATED;
135 }
136
137 return 0;
138}
139
140const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int len)
141{
142 unsigned int uoffset = offset;
143 unsigned int absoffset = offset + fdt_off_dt_struct(fdt);
144
145 if (offset < 0)
146 return NULL;
147
148 if (!can_assume(VALID_INPUT))
149 if ((absoffset < uoffset)
150 || ((absoffset + len) < absoffset)
151 || (absoffset + len) > fdt_totalsize(fdt))
152 return NULL;
153
154 if (can_assume(LATEST) || fdt_version(fdt) >= 0x11)
155 if (((uoffset + len) < uoffset)
156 || ((offset + len) > fdt_size_dt_struct(fdt)))
157 return NULL;
158
159 return fdt_offset_ptr_(fdt, offset);
160}
161
162uint32_t fdt_next_tag(const void *fdt, int startoffset, int *nextoffset)
163{
164 const fdt32_t *tagp, *lenp;
165 uint32_t tag, len, sum;
166 int offset = startoffset;
167 const char *p;
168
169 *nextoffset = -FDT_ERR_TRUNCATED;
170 tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE);
171 if (!can_assume(VALID_DTB) && !tagp)
172 return FDT_END; /* premature end */
173 tag = fdt32_to_cpu(*tagp);
174 offset += FDT_TAGSIZE;
175
176 *nextoffset = -FDT_ERR_BADSTRUCTURE;
177 switch (tag) {
178 case FDT_BEGIN_NODE:
179 /* skip name */
180 do {
181 p = fdt_offset_ptr(fdt, offset++, 1);
182 } while (p && (*p != '\0'));
183 if (!can_assume(VALID_DTB) && !p)
184 return FDT_END; /* premature end */
185 break;
186
187 case FDT_PROP:
188 lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp));
189 if (!can_assume(VALID_DTB) && !lenp)
190 return FDT_END; /* premature end */
191
192 len = fdt32_to_cpu(*lenp);
193 sum = len + offset;
194 if (!can_assume(VALID_DTB) &&
195 (INT_MAX <= sum || sum < (uint32_t) offset))
196 return FDT_END; /* premature end */
197
198 /* skip-name offset, length and value */
199 offset += sizeof(struct fdt_property) - FDT_TAGSIZE + len;
200
201 if (!can_assume(LATEST) &&
202 fdt_version(fdt) < 0x10 && len >= 8 &&
203 ((offset - len) % 8) != 0)
204 offset += 4;
205 break;
206
207 case FDT_END:
208 case FDT_END_NODE:
209 case FDT_NOP:
210 break;
211
212 default:
213 return FDT_END;
214 }
215
216 if (!fdt_offset_ptr(fdt, startoffset, offset - startoffset))
217 return FDT_END; /* premature end */
218
219 *nextoffset = FDT_TAGALIGN(offset);
220 return tag;
221}
222
223int fdt_check_node_offset_(const void *fdt, int offset)
224{
225 if (!can_assume(VALID_INPUT)
226 && ((offset < 0) || (offset % FDT_TAGSIZE)))
227 return -FDT_ERR_BADOFFSET;
228
229 if (fdt_next_tag(fdt, offset, &offset) != FDT_BEGIN_NODE)
230 return -FDT_ERR_BADOFFSET;
231
232 return offset;
233}
234
235int fdt_check_prop_offset_(const void *fdt, int offset)
236{
237 if (!can_assume(VALID_INPUT)
238 && ((offset < 0) || (offset % FDT_TAGSIZE)))
239 return -FDT_ERR_BADOFFSET;
240
241 if (fdt_next_tag(fdt, offset, &offset) != FDT_PROP)
242 return -FDT_ERR_BADOFFSET;
243
244 return offset;
245}
246
247int fdt_next_node(const void *fdt, int offset, int *depth)
248{
249 int nextoffset = 0;
250 uint32_t tag;
251
252 if (offset >= 0)
253 if ((nextoffset = fdt_check_node_offset_(fdt, offset)) < 0)
254 return nextoffset;
255
256 do {
257 offset = nextoffset;
258 tag = fdt_next_tag(fdt, offset, &nextoffset);
259
260 switch (tag) {
261 case FDT_PROP:
262 case FDT_NOP:
263 break;
264
265 case FDT_BEGIN_NODE:
266 if (depth)
267 (*depth)++;
268 break;
269
270 case FDT_END_NODE:
271 if (depth && ((--(*depth)) < 0))
272 return nextoffset;
273 break;
274
275 case FDT_END:
276 if ((nextoffset >= 0)
277 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))
278 return -FDT_ERR_NOTFOUND;
279 else
280 return nextoffset;
281 }
282 } while (tag != FDT_BEGIN_NODE);
283
284 return offset;
285}
286
287int fdt_first_subnode(const void *fdt, int offset)
288{
289 int depth = 0;
290
291 offset = fdt_next_node(fdt, offset, &depth);
292 if (offset < 0 || depth != 1)
293 return -FDT_ERR_NOTFOUND;
294
295 return offset;
296}
297
298int fdt_next_subnode(const void *fdt, int offset)
299{
300 int depth = 1;
301
302 /*
303 * With respect to the parent, the depth of the next subnode will be
304 * the same as the last.
305 */
306 do {
307 offset = fdt_next_node(fdt, offset, &depth);
308 if (offset < 0 || depth < 1)
309 return -FDT_ERR_NOTFOUND;
310 } while (depth > 1);
311
312 return offset;
313}
314
315const char *fdt_find_string_(const char *strtab, int tabsize, const char *s)
316{
317 int len = strlen(s) + 1;
318 const char *last = strtab + tabsize - len;
319 const char *p;
320
321 for (p = strtab; p <= last; p++)
322 if (memcmp(p, s, len) == 0)
323 return p;
324 return NULL;
325}
326
327int fdt_move(const void *fdt, void *buf, int bufsize)
328{
329 if (!can_assume(VALID_INPUT) && bufsize < 0)
330 return -FDT_ERR_NOSPACE;
331
332 FDT_RO_PROBE(fdt);
333
334 if (fdt_totalsize(fdt) > (unsigned int)bufsize)
335 return -FDT_ERR_NOSPACE;
336
337 memmove(buf, fdt, fdt_totalsize(fdt));
338 return 0;
339}
1/*
2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
4 *
5 * libfdt is dual licensed: you can use it either under the terms of
6 * the GPL, or the BSD license, at your option.
7 *
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.
12 *
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.
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.
50 */
51#include "libfdt_env.h"
52
53#include <fdt.h>
54#include <libfdt.h>
55
56#include "libfdt_internal.h"
57
58int fdt_check_header(const void *fdt)
59{
60 if (fdt_magic(fdt) == FDT_MAGIC) {
61 /* Complete tree */
62 if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION)
63 return -FDT_ERR_BADVERSION;
64 if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION)
65 return -FDT_ERR_BADVERSION;
66 } else if (fdt_magic(fdt) == FDT_SW_MAGIC) {
67 /* Unfinished sequential-write blob */
68 if (fdt_size_dt_struct(fdt) == 0)
69 return -FDT_ERR_BADSTATE;
70 } else {
71 return -FDT_ERR_BADMAGIC;
72 }
73
74 return 0;
75}
76
77const void *fdt_offset_ptr(const void *fdt, int offset, int len)
78{
79 const char *p;
80
81 if (fdt_version(fdt) >= 0x11)
82 if (((offset + len) < offset)
83 || ((offset + len) > fdt_size_dt_struct(fdt)))
84 return NULL;
85
86 p = _fdt_offset_ptr(fdt, offset);
87
88 if (p + len < p)
89 return NULL;
90 return p;
91}
92
93uint32_t fdt_next_tag(const void *fdt, int offset, int *nextoffset)
94{
95 const uint32_t *tagp, *lenp;
96 uint32_t tag;
97 const char *p;
98
99 if (offset % FDT_TAGSIZE)
100 return -1;
101
102 tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE);
103 if (! tagp)
104 return FDT_END; /* premature end */
105 tag = fdt32_to_cpu(*tagp);
106 offset += FDT_TAGSIZE;
107
108 switch (tag) {
109 case FDT_BEGIN_NODE:
110 /* skip name */
111 do {
112 p = fdt_offset_ptr(fdt, offset++, 1);
113 } while (p && (*p != '\0'));
114 if (! p)
115 return FDT_END;
116 break;
117 case FDT_PROP:
118 lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp));
119 if (! lenp)
120 return FDT_END;
121 /* skip name offset, length and value */
122 offset += 2*FDT_TAGSIZE + fdt32_to_cpu(*lenp);
123 break;
124 }
125
126 if (nextoffset)
127 *nextoffset = FDT_TAGALIGN(offset);
128
129 return tag;
130}
131
132int _fdt_check_node_offset(const void *fdt, int offset)
133{
134 if ((offset < 0) || (offset % FDT_TAGSIZE)
135 || (fdt_next_tag(fdt, offset, &offset) != FDT_BEGIN_NODE))
136 return -FDT_ERR_BADOFFSET;
137
138 return offset;
139}
140
141int fdt_next_node(const void *fdt, int offset, int *depth)
142{
143 int nextoffset = 0;
144 uint32_t tag;
145
146 if (offset >= 0)
147 if ((nextoffset = _fdt_check_node_offset(fdt, offset)) < 0)
148 return nextoffset;
149
150 do {
151 offset = nextoffset;
152 tag = fdt_next_tag(fdt, offset, &nextoffset);
153
154 switch (tag) {
155 case FDT_PROP:
156 case FDT_NOP:
157 break;
158
159 case FDT_BEGIN_NODE:
160 if (depth)
161 (*depth)++;
162 break;
163
164 case FDT_END_NODE:
165 if (depth)
166 (*depth)--;
167 break;
168
169 case FDT_END:
170 return -FDT_ERR_NOTFOUND;
171
172 default:
173 return -FDT_ERR_BADSTRUCTURE;
174 }
175 } while (tag != FDT_BEGIN_NODE);
176
177 return offset;
178}
179
180const char *_fdt_find_string(const char *strtab, int tabsize, const char *s)
181{
182 int len = strlen(s) + 1;
183 const char *last = strtab + tabsize - len;
184 const char *p;
185
186 for (p = strtab; p <= last; p++)
187 if (memcmp(p, s, len) == 0)
188 return p;
189 return NULL;
190}
191
192int fdt_move(const void *fdt, void *buf, int bufsize)
193{
194 FDT_CHECK_HEADER(fdt);
195
196 if (fdt_totalsize(fdt) > bufsize)
197 return -FDT_ERR_NOSPACE;
198
199 memmove(buf, fdt, fdt_totalsize(fdt));
200 return 0;
201}