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