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
13static int fdt_blocks_misordered_(const void *fdt,
14 int mem_rsv_size, int struct_size)
15{
16 return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8))
17 || (fdt_off_dt_struct(fdt) <
18 (fdt_off_mem_rsvmap(fdt) + mem_rsv_size))
19 || (fdt_off_dt_strings(fdt) <
20 (fdt_off_dt_struct(fdt) + struct_size))
21 || (fdt_totalsize(fdt) <
22 (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)));
23}
24
25static int fdt_rw_probe_(void *fdt)
26{
27 if (can_assume(VALID_DTB))
28 return 0;
29 FDT_RO_PROBE(fdt);
30
31 if (!can_assume(LATEST) && fdt_version(fdt) < 17)
32 return -FDT_ERR_BADVERSION;
33 if (fdt_blocks_misordered_(fdt, sizeof(struct fdt_reserve_entry),
34 fdt_size_dt_struct(fdt)))
35 return -FDT_ERR_BADLAYOUT;
36 if (!can_assume(LATEST) && fdt_version(fdt) > 17)
37 fdt_set_version(fdt, 17);
38
39 return 0;
40}
41
42#define FDT_RW_PROBE(fdt) \
43 { \
44 int err_; \
45 if ((err_ = fdt_rw_probe_(fdt)) != 0) \
46 return err_; \
47 }
48
49static inline unsigned int fdt_data_size_(void *fdt)
50{
51 return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
52}
53
54static int fdt_splice_(void *fdt, void *splicepoint, int oldlen, int newlen)
55{
56 char *p = splicepoint;
57 unsigned int dsize = fdt_data_size_(fdt);
58 size_t soff = p - (char *)fdt;
59
60 if ((oldlen < 0) || (soff + oldlen < soff) || (soff + oldlen > dsize))
61 return -FDT_ERR_BADOFFSET;
62 if ((p < (char *)fdt) || (dsize + newlen < (unsigned)oldlen))
63 return -FDT_ERR_BADOFFSET;
64 if (dsize - oldlen + newlen > fdt_totalsize(fdt))
65 return -FDT_ERR_NOSPACE;
66 memmove(p + newlen, p + oldlen, ((char *)fdt + dsize) - (p + oldlen));
67 return 0;
68}
69
70static int fdt_splice_mem_rsv_(void *fdt, struct fdt_reserve_entry *p,
71 int oldn, int newn)
72{
73 int delta = (newn - oldn) * sizeof(*p);
74 int err;
75 err = fdt_splice_(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));
76 if (err)
77 return err;
78 fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);
79 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
80 return 0;
81}
82
83static int fdt_splice_struct_(void *fdt, void *p,
84 int oldlen, int newlen)
85{
86 int delta = newlen - oldlen;
87 int err;
88
89 if ((err = fdt_splice_(fdt, p, oldlen, newlen)))
90 return err;
91
92 fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);
93 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
94 return 0;
95}
96
97/* Must only be used to roll back in case of error */
98static void fdt_del_last_string_(void *fdt, const char *s)
99{
100 int newlen = strlen(s) + 1;
101
102 fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) - newlen);
103}
104
105static int fdt_splice_string_(void *fdt, int newlen)
106{
107 void *p = (char *)fdt
108 + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
109 int err;
110
111 if ((err = fdt_splice_(fdt, p, 0, newlen)))
112 return err;
113
114 fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
115 return 0;
116}
117
118/**
119 * fdt_find_add_string_() - Find or allocate a string
120 *
121 * @fdt: pointer to the device tree to check/adjust
122 * @s: string to find/add
123 * @allocated: Set to 0 if the string was found, 1 if not found and so
124 * allocated. Ignored if can_assume(NO_ROLLBACK)
125 * @return offset of string in the string table (whether found or added)
126 */
127static int fdt_find_add_string_(void *fdt, const char *s, int *allocated)
128{
129 char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
130 const char *p;
131 char *new;
132 int len = strlen(s) + 1;
133 int err;
134
135 if (!can_assume(NO_ROLLBACK))
136 *allocated = 0;
137
138 p = fdt_find_string_(strtab, fdt_size_dt_strings(fdt), s);
139 if (p)
140 /* found it */
141 return (p - strtab);
142
143 new = strtab + fdt_size_dt_strings(fdt);
144 err = fdt_splice_string_(fdt, len);
145 if (err)
146 return err;
147
148 if (!can_assume(NO_ROLLBACK))
149 *allocated = 1;
150
151 memcpy(new, s, len);
152 return (new - strtab);
153}
154
155int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size)
156{
157 struct fdt_reserve_entry *re;
158 int err;
159
160 FDT_RW_PROBE(fdt);
161
162 re = fdt_mem_rsv_w_(fdt, fdt_num_mem_rsv(fdt));
163 err = fdt_splice_mem_rsv_(fdt, re, 0, 1);
164 if (err)
165 return err;
166
167 re->address = cpu_to_fdt64(address);
168 re->size = cpu_to_fdt64(size);
169 return 0;
170}
171
172int fdt_del_mem_rsv(void *fdt, int n)
173{
174 struct fdt_reserve_entry *re = fdt_mem_rsv_w_(fdt, n);
175
176 FDT_RW_PROBE(fdt);
177
178 if (n >= fdt_num_mem_rsv(fdt))
179 return -FDT_ERR_NOTFOUND;
180
181 return fdt_splice_mem_rsv_(fdt, re, 1, 0);
182}
183
184static int fdt_resize_property_(void *fdt, int nodeoffset, const char *name,
185 int len, struct fdt_property **prop)
186{
187 int oldlen;
188 int err;
189
190 *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
191 if (!*prop)
192 return oldlen;
193
194 if ((err = fdt_splice_struct_(fdt, (*prop)->data, FDT_TAGALIGN(oldlen),
195 FDT_TAGALIGN(len))))
196 return err;
197
198 (*prop)->len = cpu_to_fdt32(len);
199 return 0;
200}
201
202static int fdt_add_property_(void *fdt, int nodeoffset, const char *name,
203 int len, struct fdt_property **prop)
204{
205 int proplen;
206 int nextoffset;
207 int namestroff;
208 int err;
209 int allocated;
210
211 if ((nextoffset = fdt_check_node_offset_(fdt, nodeoffset)) < 0)
212 return nextoffset;
213
214 namestroff = fdt_find_add_string_(fdt, name, &allocated);
215 if (namestroff < 0)
216 return namestroff;
217
218 *prop = fdt_offset_ptr_w_(fdt, nextoffset);
219 proplen = sizeof(**prop) + FDT_TAGALIGN(len);
220
221 err = fdt_splice_struct_(fdt, *prop, 0, proplen);
222 if (err) {
223 /* Delete the string if we failed to add it */
224 if (!can_assume(NO_ROLLBACK) && allocated)
225 fdt_del_last_string_(fdt, name);
226 return err;
227 }
228
229 (*prop)->tag = cpu_to_fdt32(FDT_PROP);
230 (*prop)->nameoff = cpu_to_fdt32(namestroff);
231 (*prop)->len = cpu_to_fdt32(len);
232 return 0;
233}
234
235int fdt_set_name(void *fdt, int nodeoffset, const char *name)
236{
237 char *namep;
238 int oldlen, newlen;
239 int err;
240
241 FDT_RW_PROBE(fdt);
242
243 namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen);
244 if (!namep)
245 return oldlen;
246
247 newlen = strlen(name);
248
249 err = fdt_splice_struct_(fdt, namep, FDT_TAGALIGN(oldlen+1),
250 FDT_TAGALIGN(newlen+1));
251 if (err)
252 return err;
253
254 memcpy(namep, name, newlen+1);
255 return 0;
256}
257
258int fdt_setprop_placeholder(void *fdt, int nodeoffset, const char *name,
259 int len, void **prop_data)
260{
261 struct fdt_property *prop;
262 int err;
263
264 FDT_RW_PROBE(fdt);
265
266 err = fdt_resize_property_(fdt, nodeoffset, name, len, &prop);
267 if (err == -FDT_ERR_NOTFOUND)
268 err = fdt_add_property_(fdt, nodeoffset, name, len, &prop);
269 if (err)
270 return err;
271
272 *prop_data = prop->data;
273 return 0;
274}
275
276int fdt_setprop(void *fdt, int nodeoffset, const char *name,
277 const void *val, int len)
278{
279 void *prop_data;
280 int err;
281
282 err = fdt_setprop_placeholder(fdt, nodeoffset, name, len, &prop_data);
283 if (err)
284 return err;
285
286 if (len)
287 memcpy(prop_data, val, len);
288 return 0;
289}
290
291int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
292 const void *val, int len)
293{
294 struct fdt_property *prop;
295 int err, oldlen, newlen;
296
297 FDT_RW_PROBE(fdt);
298
299 prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
300 if (prop) {
301 newlen = len + oldlen;
302 err = fdt_splice_struct_(fdt, prop->data,
303 FDT_TAGALIGN(oldlen),
304 FDT_TAGALIGN(newlen));
305 if (err)
306 return err;
307 prop->len = cpu_to_fdt32(newlen);
308 memcpy(prop->data + oldlen, val, len);
309 } else {
310 err = fdt_add_property_(fdt, nodeoffset, name, len, &prop);
311 if (err)
312 return err;
313 memcpy(prop->data, val, len);
314 }
315 return 0;
316}
317
318int fdt_delprop(void *fdt, int nodeoffset, const char *name)
319{
320 struct fdt_property *prop;
321 int len, proplen;
322
323 FDT_RW_PROBE(fdt);
324
325 prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
326 if (!prop)
327 return len;
328
329 proplen = sizeof(*prop) + FDT_TAGALIGN(len);
330 return fdt_splice_struct_(fdt, prop, proplen, 0);
331}
332
333int fdt_add_subnode_namelen(void *fdt, int parentoffset,
334 const char *name, int namelen)
335{
336 struct fdt_node_header *nh;
337 int offset, nextoffset;
338 int nodelen;
339 int err;
340 uint32_t tag;
341 fdt32_t *endtag;
342
343 FDT_RW_PROBE(fdt);
344
345 offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
346 if (offset >= 0)
347 return -FDT_ERR_EXISTS;
348 else if (offset != -FDT_ERR_NOTFOUND)
349 return offset;
350
351 /* Try to place the new node after the parent's properties */
352 tag = fdt_next_tag(fdt, parentoffset, &nextoffset);
353 /* the fdt_subnode_offset_namelen() should ensure this never hits */
354 if (!can_assume(LIBFDT_FLAWLESS) && (tag != FDT_BEGIN_NODE))
355 return -FDT_ERR_INTERNAL;
356 do {
357 offset = nextoffset;
358 tag = fdt_next_tag(fdt, offset, &nextoffset);
359 } while ((tag == FDT_PROP) || (tag == FDT_NOP));
360
361 nh = fdt_offset_ptr_w_(fdt, offset);
362 nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE;
363
364 err = fdt_splice_struct_(fdt, nh, 0, nodelen);
365 if (err)
366 return err;
367
368 nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
369 memset(nh->name, 0, FDT_TAGALIGN(namelen+1));
370 memcpy(nh->name, name, namelen);
371 endtag = (fdt32_t *)((char *)nh + nodelen - FDT_TAGSIZE);
372 *endtag = cpu_to_fdt32(FDT_END_NODE);
373
374 return offset;
375}
376
377int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
378{
379 return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
380}
381
382int fdt_del_node(void *fdt, int nodeoffset)
383{
384 int endoffset;
385
386 FDT_RW_PROBE(fdt);
387
388 endoffset = fdt_node_end_offset_(fdt, nodeoffset);
389 if (endoffset < 0)
390 return endoffset;
391
392 return fdt_splice_struct_(fdt, fdt_offset_ptr_w_(fdt, nodeoffset),
393 endoffset - nodeoffset, 0);
394}
395
396static void fdt_packblocks_(const char *old, char *new,
397 int mem_rsv_size,
398 int struct_size,
399 int strings_size)
400{
401 int mem_rsv_off, struct_off, strings_off;
402
403 mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8);
404 struct_off = mem_rsv_off + mem_rsv_size;
405 strings_off = struct_off + struct_size;
406
407 memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size);
408 fdt_set_off_mem_rsvmap(new, mem_rsv_off);
409
410 memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size);
411 fdt_set_off_dt_struct(new, struct_off);
412 fdt_set_size_dt_struct(new, struct_size);
413
414 memmove(new + strings_off, old + fdt_off_dt_strings(old), strings_size);
415 fdt_set_off_dt_strings(new, strings_off);
416 fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));
417}
418
419int fdt_open_into(const void *fdt, void *buf, int bufsize)
420{
421 int err;
422 int mem_rsv_size, struct_size;
423 int newsize;
424 const char *fdtstart = fdt;
425 const char *fdtend = fdtstart + fdt_totalsize(fdt);
426 char *tmp;
427
428 FDT_RO_PROBE(fdt);
429
430 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
431 * sizeof(struct fdt_reserve_entry);
432
433 if (can_assume(LATEST) || fdt_version(fdt) >= 17) {
434 struct_size = fdt_size_dt_struct(fdt);
435 } else if (fdt_version(fdt) == 16) {
436 struct_size = 0;
437 while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
438 ;
439 if (struct_size < 0)
440 return struct_size;
441 } else {
442 return -FDT_ERR_BADVERSION;
443 }
444
445 if (can_assume(LIBFDT_ORDER) ||
446 !fdt_blocks_misordered_(fdt, mem_rsv_size, struct_size)) {
447 /* no further work necessary */
448 err = fdt_move(fdt, buf, bufsize);
449 if (err)
450 return err;
451 fdt_set_version(buf, 17);
452 fdt_set_size_dt_struct(buf, struct_size);
453 fdt_set_totalsize(buf, bufsize);
454 return 0;
455 }
456
457 /* Need to reorder */
458 newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
459 + struct_size + fdt_size_dt_strings(fdt);
460
461 if (bufsize < newsize)
462 return -FDT_ERR_NOSPACE;
463
464 /* First attempt to build converted tree at beginning of buffer */
465 tmp = buf;
466 /* But if that overlaps with the old tree... */
467 if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {
468 /* Try right after the old tree instead */
469 tmp = (char *)(uintptr_t)fdtend;
470 if ((tmp + newsize) > ((char *)buf + bufsize))
471 return -FDT_ERR_NOSPACE;
472 }
473
474 fdt_packblocks_(fdt, tmp, mem_rsv_size, struct_size,
475 fdt_size_dt_strings(fdt));
476 memmove(buf, tmp, newsize);
477
478 fdt_set_magic(buf, FDT_MAGIC);
479 fdt_set_totalsize(buf, bufsize);
480 fdt_set_version(buf, 17);
481 fdt_set_last_comp_version(buf, 16);
482 fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
483
484 return 0;
485}
486
487int fdt_pack(void *fdt)
488{
489 int mem_rsv_size;
490
491 FDT_RW_PROBE(fdt);
492
493 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
494 * sizeof(struct fdt_reserve_entry);
495 fdt_packblocks_(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt),
496 fdt_size_dt_strings(fdt));
497 fdt_set_totalsize(fdt, fdt_data_size_(fdt));
498
499 return 0;
500}
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
58static int fdt_blocks_misordered_(const void *fdt,
59 int mem_rsv_size, int struct_size)
60{
61 return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8))
62 || (fdt_off_dt_struct(fdt) <
63 (fdt_off_mem_rsvmap(fdt) + mem_rsv_size))
64 || (fdt_off_dt_strings(fdt) <
65 (fdt_off_dt_struct(fdt) + struct_size))
66 || (fdt_totalsize(fdt) <
67 (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)));
68}
69
70static int fdt_rw_check_header_(void *fdt)
71{
72 FDT_CHECK_HEADER(fdt);
73
74 if (fdt_version(fdt) < 17)
75 return -FDT_ERR_BADVERSION;
76 if (fdt_blocks_misordered_(fdt, sizeof(struct fdt_reserve_entry),
77 fdt_size_dt_struct(fdt)))
78 return -FDT_ERR_BADLAYOUT;
79 if (fdt_version(fdt) > 17)
80 fdt_set_version(fdt, 17);
81
82 return 0;
83}
84
85#define FDT_RW_CHECK_HEADER(fdt) \
86 { \
87 int err_; \
88 if ((err_ = fdt_rw_check_header_(fdt)) != 0) \
89 return err_; \
90 }
91
92static inline int fdt_data_size_(void *fdt)
93{
94 return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
95}
96
97static int fdt_splice_(void *fdt, void *splicepoint, int oldlen, int newlen)
98{
99 char *p = splicepoint;
100 char *end = (char *)fdt + fdt_data_size_(fdt);
101
102 if (((p + oldlen) < p) || ((p + oldlen) > end))
103 return -FDT_ERR_BADOFFSET;
104 if ((p < (char *)fdt) || ((end - oldlen + newlen) < (char *)fdt))
105 return -FDT_ERR_BADOFFSET;
106 if ((end - oldlen + newlen) > ((char *)fdt + fdt_totalsize(fdt)))
107 return -FDT_ERR_NOSPACE;
108 memmove(p + newlen, p + oldlen, end - p - oldlen);
109 return 0;
110}
111
112static int fdt_splice_mem_rsv_(void *fdt, struct fdt_reserve_entry *p,
113 int oldn, int newn)
114{
115 int delta = (newn - oldn) * sizeof(*p);
116 int err;
117 err = fdt_splice_(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));
118 if (err)
119 return err;
120 fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);
121 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
122 return 0;
123}
124
125static int fdt_splice_struct_(void *fdt, void *p,
126 int oldlen, int newlen)
127{
128 int delta = newlen - oldlen;
129 int err;
130
131 if ((err = fdt_splice_(fdt, p, oldlen, newlen)))
132 return err;
133
134 fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);
135 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
136 return 0;
137}
138
139static int fdt_splice_string_(void *fdt, int newlen)
140{
141 void *p = (char *)fdt
142 + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
143 int err;
144
145 if ((err = fdt_splice_(fdt, p, 0, newlen)))
146 return err;
147
148 fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
149 return 0;
150}
151
152static int fdt_find_add_string_(void *fdt, const char *s)
153{
154 char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
155 const char *p;
156 char *new;
157 int len = strlen(s) + 1;
158 int err;
159
160 p = fdt_find_string_(strtab, fdt_size_dt_strings(fdt), s);
161 if (p)
162 /* found it */
163 return (p - strtab);
164
165 new = strtab + fdt_size_dt_strings(fdt);
166 err = fdt_splice_string_(fdt, len);
167 if (err)
168 return err;
169
170 memcpy(new, s, len);
171 return (new - strtab);
172}
173
174int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size)
175{
176 struct fdt_reserve_entry *re;
177 int err;
178
179 FDT_RW_CHECK_HEADER(fdt);
180
181 re = fdt_mem_rsv_w_(fdt, fdt_num_mem_rsv(fdt));
182 err = fdt_splice_mem_rsv_(fdt, re, 0, 1);
183 if (err)
184 return err;
185
186 re->address = cpu_to_fdt64(address);
187 re->size = cpu_to_fdt64(size);
188 return 0;
189}
190
191int fdt_del_mem_rsv(void *fdt, int n)
192{
193 struct fdt_reserve_entry *re = fdt_mem_rsv_w_(fdt, n);
194
195 FDT_RW_CHECK_HEADER(fdt);
196
197 if (n >= fdt_num_mem_rsv(fdt))
198 return -FDT_ERR_NOTFOUND;
199
200 return fdt_splice_mem_rsv_(fdt, re, 1, 0);
201}
202
203static int fdt_resize_property_(void *fdt, int nodeoffset, const char *name,
204 int len, struct fdt_property **prop)
205{
206 int oldlen;
207 int err;
208
209 *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
210 if (!*prop)
211 return oldlen;
212
213 if ((err = fdt_splice_struct_(fdt, (*prop)->data, FDT_TAGALIGN(oldlen),
214 FDT_TAGALIGN(len))))
215 return err;
216
217 (*prop)->len = cpu_to_fdt32(len);
218 return 0;
219}
220
221static int fdt_add_property_(void *fdt, int nodeoffset, const char *name,
222 int len, struct fdt_property **prop)
223{
224 int proplen;
225 int nextoffset;
226 int namestroff;
227 int err;
228
229 if ((nextoffset = fdt_check_node_offset_(fdt, nodeoffset)) < 0)
230 return nextoffset;
231
232 namestroff = fdt_find_add_string_(fdt, name);
233 if (namestroff < 0)
234 return namestroff;
235
236 *prop = fdt_offset_ptr_w_(fdt, nextoffset);
237 proplen = sizeof(**prop) + FDT_TAGALIGN(len);
238
239 err = fdt_splice_struct_(fdt, *prop, 0, proplen);
240 if (err)
241 return err;
242
243 (*prop)->tag = cpu_to_fdt32(FDT_PROP);
244 (*prop)->nameoff = cpu_to_fdt32(namestroff);
245 (*prop)->len = cpu_to_fdt32(len);
246 return 0;
247}
248
249int fdt_set_name(void *fdt, int nodeoffset, const char *name)
250{
251 char *namep;
252 int oldlen, newlen;
253 int err;
254
255 FDT_RW_CHECK_HEADER(fdt);
256
257 namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen);
258 if (!namep)
259 return oldlen;
260
261 newlen = strlen(name);
262
263 err = fdt_splice_struct_(fdt, namep, FDT_TAGALIGN(oldlen+1),
264 FDT_TAGALIGN(newlen+1));
265 if (err)
266 return err;
267
268 memcpy(namep, name, newlen+1);
269 return 0;
270}
271
272int fdt_setprop_placeholder(void *fdt, int nodeoffset, const char *name,
273 int len, void **prop_data)
274{
275 struct fdt_property *prop;
276 int err;
277
278 FDT_RW_CHECK_HEADER(fdt);
279
280 err = fdt_resize_property_(fdt, nodeoffset, name, len, &prop);
281 if (err == -FDT_ERR_NOTFOUND)
282 err = fdt_add_property_(fdt, nodeoffset, name, len, &prop);
283 if (err)
284 return err;
285
286 *prop_data = prop->data;
287 return 0;
288}
289
290int fdt_setprop(void *fdt, int nodeoffset, const char *name,
291 const void *val, int len)
292{
293 void *prop_data;
294 int err;
295
296 err = fdt_setprop_placeholder(fdt, nodeoffset, name, len, &prop_data);
297 if (err)
298 return err;
299
300 if (len)
301 memcpy(prop_data, val, len);
302 return 0;
303}
304
305int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
306 const void *val, int len)
307{
308 struct fdt_property *prop;
309 int err, oldlen, newlen;
310
311 FDT_RW_CHECK_HEADER(fdt);
312
313 prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
314 if (prop) {
315 newlen = len + oldlen;
316 err = fdt_splice_struct_(fdt, prop->data,
317 FDT_TAGALIGN(oldlen),
318 FDT_TAGALIGN(newlen));
319 if (err)
320 return err;
321 prop->len = cpu_to_fdt32(newlen);
322 memcpy(prop->data + oldlen, val, len);
323 } else {
324 err = fdt_add_property_(fdt, nodeoffset, name, len, &prop);
325 if (err)
326 return err;
327 memcpy(prop->data, val, len);
328 }
329 return 0;
330}
331
332int fdt_delprop(void *fdt, int nodeoffset, const char *name)
333{
334 struct fdt_property *prop;
335 int len, proplen;
336
337 FDT_RW_CHECK_HEADER(fdt);
338
339 prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
340 if (!prop)
341 return len;
342
343 proplen = sizeof(*prop) + FDT_TAGALIGN(len);
344 return fdt_splice_struct_(fdt, prop, proplen, 0);
345}
346
347int fdt_add_subnode_namelen(void *fdt, int parentoffset,
348 const char *name, int namelen)
349{
350 struct fdt_node_header *nh;
351 int offset, nextoffset;
352 int nodelen;
353 int err;
354 uint32_t tag;
355 fdt32_t *endtag;
356
357 FDT_RW_CHECK_HEADER(fdt);
358
359 offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
360 if (offset >= 0)
361 return -FDT_ERR_EXISTS;
362 else if (offset != -FDT_ERR_NOTFOUND)
363 return offset;
364
365 /* Try to place the new node after the parent's properties */
366 fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
367 do {
368 offset = nextoffset;
369 tag = fdt_next_tag(fdt, offset, &nextoffset);
370 } while ((tag == FDT_PROP) || (tag == FDT_NOP));
371
372 nh = fdt_offset_ptr_w_(fdt, offset);
373 nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE;
374
375 err = fdt_splice_struct_(fdt, nh, 0, nodelen);
376 if (err)
377 return err;
378
379 nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
380 memset(nh->name, 0, FDT_TAGALIGN(namelen+1));
381 memcpy(nh->name, name, namelen);
382 endtag = (fdt32_t *)((char *)nh + nodelen - FDT_TAGSIZE);
383 *endtag = cpu_to_fdt32(FDT_END_NODE);
384
385 return offset;
386}
387
388int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
389{
390 return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
391}
392
393int fdt_del_node(void *fdt, int nodeoffset)
394{
395 int endoffset;
396
397 FDT_RW_CHECK_HEADER(fdt);
398
399 endoffset = fdt_node_end_offset_(fdt, nodeoffset);
400 if (endoffset < 0)
401 return endoffset;
402
403 return fdt_splice_struct_(fdt, fdt_offset_ptr_w_(fdt, nodeoffset),
404 endoffset - nodeoffset, 0);
405}
406
407static void fdt_packblocks_(const char *old, char *new,
408 int mem_rsv_size, int struct_size)
409{
410 int mem_rsv_off, struct_off, strings_off;
411
412 mem_rsv_off = FDT_ALIGN(sizeof(struct fdt_header), 8);
413 struct_off = mem_rsv_off + mem_rsv_size;
414 strings_off = struct_off + struct_size;
415
416 memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size);
417 fdt_set_off_mem_rsvmap(new, mem_rsv_off);
418
419 memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size);
420 fdt_set_off_dt_struct(new, struct_off);
421 fdt_set_size_dt_struct(new, struct_size);
422
423 memmove(new + strings_off, old + fdt_off_dt_strings(old),
424 fdt_size_dt_strings(old));
425 fdt_set_off_dt_strings(new, strings_off);
426 fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));
427}
428
429int fdt_open_into(const void *fdt, void *buf, int bufsize)
430{
431 int err;
432 int mem_rsv_size, struct_size;
433 int newsize;
434 const char *fdtstart = fdt;
435 const char *fdtend = fdtstart + fdt_totalsize(fdt);
436 char *tmp;
437
438 FDT_CHECK_HEADER(fdt);
439
440 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
441 * sizeof(struct fdt_reserve_entry);
442
443 if (fdt_version(fdt) >= 17) {
444 struct_size = fdt_size_dt_struct(fdt);
445 } else {
446 struct_size = 0;
447 while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
448 ;
449 if (struct_size < 0)
450 return struct_size;
451 }
452
453 if (!fdt_blocks_misordered_(fdt, mem_rsv_size, struct_size)) {
454 /* no further work necessary */
455 err = fdt_move(fdt, buf, bufsize);
456 if (err)
457 return err;
458 fdt_set_version(buf, 17);
459 fdt_set_size_dt_struct(buf, struct_size);
460 fdt_set_totalsize(buf, bufsize);
461 return 0;
462 }
463
464 /* Need to reorder */
465 newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
466 + struct_size + fdt_size_dt_strings(fdt);
467
468 if (bufsize < newsize)
469 return -FDT_ERR_NOSPACE;
470
471 /* First attempt to build converted tree at beginning of buffer */
472 tmp = buf;
473 /* But if that overlaps with the old tree... */
474 if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {
475 /* Try right after the old tree instead */
476 tmp = (char *)(uintptr_t)fdtend;
477 if ((tmp + newsize) > ((char *)buf + bufsize))
478 return -FDT_ERR_NOSPACE;
479 }
480
481 fdt_packblocks_(fdt, tmp, mem_rsv_size, struct_size);
482 memmove(buf, tmp, newsize);
483
484 fdt_set_magic(buf, FDT_MAGIC);
485 fdt_set_totalsize(buf, bufsize);
486 fdt_set_version(buf, 17);
487 fdt_set_last_comp_version(buf, 16);
488 fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
489
490 return 0;
491}
492
493int fdt_pack(void *fdt)
494{
495 int mem_rsv_size;
496
497 FDT_RW_CHECK_HEADER(fdt);
498
499 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
500 * sizeof(struct fdt_reserve_entry);
501 fdt_packblocks_(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));
502 fdt_set_totalsize(fdt, fdt_data_size_(fdt));
503
504 return 0;
505}