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"
60 #include "libfdt_internal.h"
62 static int _fdt_blocks_misordered(const void *fdt,
63 int mem_rsv_size, int struct_size)
65 return (fdt_off_mem_rsvmap(fdt) < FDT_ALIGN(sizeof(struct fdt_header), 8))
66 || (fdt_off_dt_struct(fdt) <
67 (fdt_off_mem_rsvmap(fdt) + mem_rsv_size))
68 || (fdt_off_dt_strings(fdt) <
69 (fdt_off_dt_struct(fdt) + struct_size))
70 || (fdt_totalsize(fdt) <
71 (fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt)));
74 static int _fdt_rw_check_header(void *fdt)
76 FDT_CHECK_HEADER(fdt);
78 if (fdt_version(fdt) < 17)
79 return -FDT_ERR_BADVERSION;
80 if (_fdt_blocks_misordered(fdt, sizeof(struct fdt_reserve_entry),
81 fdt_size_dt_struct(fdt)))
82 return -FDT_ERR_BADLAYOUT;
83 if (fdt_version(fdt) > 17)
84 fdt_set_version(fdt, 17);
89 #define FDT_RW_CHECK_HEADER(fdt) \
92 if ((err = _fdt_rw_check_header(fdt)) != 0) \
96 static inline int _fdt_data_size(void *fdt)
98 return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
101 static int _fdt_splice(void *fdt, void *splicepoint, int oldlen, int newlen)
103 char *p = splicepoint;
104 char *end = (char *)fdt + _fdt_data_size(fdt);
106 if (((p + oldlen) < p) || ((p + oldlen) > end))
107 return -FDT_ERR_BADOFFSET;
108 if ((end - oldlen + newlen) > ((char *)fdt + fdt_totalsize(fdt)))
109 return -FDT_ERR_NOSPACE;
110 memmove(p + newlen, p + oldlen, end - p - oldlen);
114 static int _fdt_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p,
117 int delta = (newn - oldn) * sizeof(*p);
119 err = _fdt_splice(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));
122 fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);
123 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
127 static int _fdt_splice_struct(void *fdt, void *p,
128 int oldlen, int newlen)
130 int delta = newlen - oldlen;
133 if ((err = _fdt_splice(fdt, p, oldlen, newlen)))
136 fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);
137 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
141 static int _fdt_splice_string(void *fdt, int newlen)
143 void *p = (char *)fdt
144 + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
147 if ((err = _fdt_splice(fdt, p, 0, newlen)))
150 fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
154 static int _fdt_find_add_string(void *fdt, const char *s)
156 char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
159 int len = strlen(s) + 1;
162 p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s);
167 new = strtab + fdt_size_dt_strings(fdt);
168 err = _fdt_splice_string(fdt, len);
173 return (new - strtab);
176 int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size)
178 struct fdt_reserve_entry *re;
181 FDT_RW_CHECK_HEADER(fdt);
183 re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt));
184 err = _fdt_splice_mem_rsv(fdt, re, 0, 1);
188 re->address = cpu_to_fdt64(address);
189 re->size = cpu_to_fdt64(size);
193 int fdt_del_mem_rsv(void *fdt, int n)
195 struct fdt_reserve_entry *re = _fdt_mem_rsv_w(fdt, n);
198 FDT_RW_CHECK_HEADER(fdt);
200 if (n >= fdt_num_mem_rsv(fdt))
201 return -FDT_ERR_NOTFOUND;
203 err = _fdt_splice_mem_rsv(fdt, re, 1, 0);
209 static int _fdt_resize_property(void *fdt, int nodeoffset, const char *name,
210 int len, struct fdt_property **prop)
215 *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
219 if ((err = _fdt_splice_struct(fdt, (*prop)->data, FDT_TAGALIGN(oldlen),
223 (*prop)->len = cpu_to_fdt32(len);
227 static int _fdt_add_property(void *fdt, int nodeoffset, const char *name,
228 int len, struct fdt_property **prop)
235 if ((nextoffset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
238 namestroff = _fdt_find_add_string(fdt, name);
242 *prop = _fdt_offset_ptr_w(fdt, nextoffset);
243 proplen = sizeof(**prop) + FDT_TAGALIGN(len);
245 err = _fdt_splice_struct(fdt, *prop, 0, proplen);
249 (*prop)->tag = cpu_to_fdt32(FDT_PROP);
250 (*prop)->nameoff = cpu_to_fdt32(namestroff);
251 (*prop)->len = cpu_to_fdt32(len);
255 int fdt_set_name(void *fdt, int nodeoffset, const char *name)
261 FDT_RW_CHECK_HEADER(fdt);
263 namep = (char *)(uintptr_t)fdt_get_name(fdt, nodeoffset, &oldlen);
267 newlen = strlen(name);
269 err = _fdt_splice_struct(fdt, namep, FDT_TAGALIGN(oldlen+1),
270 FDT_TAGALIGN(newlen+1));
274 memcpy(namep, name, newlen+1);
278 int fdt_setprop(void *fdt, int nodeoffset, const char *name,
279 const void *val, int len)
281 struct fdt_property *prop;
284 FDT_RW_CHECK_HEADER(fdt);
286 err = _fdt_resize_property(fdt, nodeoffset, name, len, &prop);
287 if (err == -FDT_ERR_NOTFOUND)
288 err = _fdt_add_property(fdt, nodeoffset, name, len, &prop);
292 memcpy(prop->data, val, len);
296 int fdt_appendprop(void *fdt, int nodeoffset, const char *name,
297 const void *val, int len)
299 struct fdt_property *prop;
300 int err, oldlen, newlen;
302 FDT_RW_CHECK_HEADER(fdt);
304 prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
306 newlen = len + oldlen;
307 err = _fdt_splice_struct(fdt, prop->data,
308 FDT_TAGALIGN(oldlen),
309 FDT_TAGALIGN(newlen));
312 prop->len = cpu_to_fdt32(newlen);
313 memcpy(prop->data + oldlen, val, len);
315 err = _fdt_add_property(fdt, nodeoffset, name, len, &prop);
318 memcpy(prop->data, val, len);
323 int fdt_delprop(void *fdt, int nodeoffset, const char *name)
325 struct fdt_property *prop;
328 FDT_RW_CHECK_HEADER(fdt);
330 prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
334 proplen = sizeof(*prop) + FDT_TAGALIGN(len);
335 return _fdt_splice_struct(fdt, prop, proplen, 0);
338 int fdt_add_subnode_namelen(void *fdt, int parentoffset,
339 const char *name, int namelen)
341 struct fdt_node_header *nh;
342 int offset, nextoffset;
348 FDT_RW_CHECK_HEADER(fdt);
350 offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
352 return -FDT_ERR_EXISTS;
353 else if (offset != -FDT_ERR_NOTFOUND)
356 /* Try to place the new node after the parent's properties */
357 fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
360 tag = fdt_next_tag(fdt, offset, &nextoffset);
361 } while ((tag == FDT_PROP) || (tag == FDT_NOP));
363 nh = _fdt_offset_ptr_w(fdt, offset);
364 nodelen = sizeof(*nh) + FDT_TAGALIGN(namelen+1) + FDT_TAGSIZE;
366 err = _fdt_splice_struct(fdt, nh, 0, nodelen);
370 nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
371 memset(nh->name, 0, FDT_TAGALIGN(namelen+1));
372 memcpy(nh->name, name, namelen);
373 endtag = (uint32_t *)((char *)nh + nodelen - FDT_TAGSIZE);
374 *endtag = cpu_to_fdt32(FDT_END_NODE);
379 int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
381 return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
384 int fdt_del_node(void *fdt, int nodeoffset)
388 FDT_RW_CHECK_HEADER(fdt);
390 endoffset = _fdt_node_end_offset(fdt, nodeoffset);
394 return _fdt_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset),
395 endoffset - nodeoffset, 0);
398 static void _fdt_packblocks(const char *old, char *new,
399 int mem_rsv_size, int struct_size)
401 int mem_rsv_off, struct_off, strings_off;
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;
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);
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);
414 memmove(new + strings_off, old + fdt_off_dt_strings(old),
415 fdt_size_dt_strings(old));
416 fdt_set_off_dt_strings(new, strings_off);
417 fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));
420 int fdt_open_into(const void *fdt, void *buf, int bufsize)
423 int mem_rsv_size, struct_size;
425 const char *fdtstart = fdt;
426 const char *fdtend = fdtstart + fdt_totalsize(fdt);
429 FDT_CHECK_HEADER(fdt);
431 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
432 * sizeof(struct fdt_reserve_entry);
434 if (fdt_version(fdt) >= 17) {
435 struct_size = fdt_size_dt_struct(fdt);
438 while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
444 if (!_fdt_blocks_misordered(fdt, mem_rsv_size, struct_size)) {
445 /* no further work necessary */
446 err = fdt_move(fdt, buf, bufsize);
449 fdt_set_version(buf, 17);
450 fdt_set_size_dt_struct(buf, struct_size);
451 fdt_set_totalsize(buf, bufsize);
455 /* Need to reorder */
456 newsize = FDT_ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
457 + struct_size + fdt_size_dt_strings(fdt);
459 if (bufsize < newsize)
460 return -FDT_ERR_NOSPACE;
462 /* First attempt to build converted tree at beginning of buffer */
464 /* But if that overlaps with the old tree... */
465 if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {
466 /* Try right after the old tree instead */
467 tmp = (char *)(uintptr_t)fdtend;
468 if ((tmp + newsize) > ((char *)buf + bufsize))
469 return -FDT_ERR_NOSPACE;
472 _fdt_packblocks(fdt, tmp, mem_rsv_size, struct_size);
473 memmove(buf, tmp, newsize);
475 fdt_set_magic(buf, FDT_MAGIC);
476 fdt_set_totalsize(buf, bufsize);
477 fdt_set_version(buf, 17);
478 fdt_set_last_comp_version(buf, 16);
479 fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
484 int fdt_pack(void *fdt)
488 FDT_RW_CHECK_HEADER(fdt);
490 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
491 * sizeof(struct fdt_reserve_entry);
492 _fdt_packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));
493 fdt_set_totalsize(fdt, _fdt_data_size(fdt));