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 _blocks_misordered(const void *fdt,
63 int mem_rsv_size, int struct_size)
65 return (fdt_off_mem_rsvmap(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 rw_check_header(void *fdt)
78 if (fdt_version(fdt) < 17)
79 return -FDT_ERR_BADVERSION;
80 if (_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 RW_CHECK_HEADER(fdt) \
92 if ((err = rw_check_header(fdt)) != 0) \
96 static inline int _blob_data_size(void *fdt)
98 return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
101 static int _blob_splice(void *fdt, void *splicepoint, int oldlen, int newlen)
103 char *p = splicepoint;
104 char *end = (char *)fdt + _blob_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 _blob_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p,
117 int delta = (newn - oldn) * sizeof(*p);
119 err = _blob_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 _blob_splice_struct(void *fdt, void *p,
128 int oldlen, int newlen)
130 int delta = newlen - oldlen;
133 if ((err = _blob_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 _blob_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 = _blob_splice(fdt, p, 0, newlen)))
150 fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
154 static int _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 = _blob_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 RW_CHECK_HEADER(fdt);
183 re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt));
184 err = _blob_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 RW_CHECK_HEADER(fdt);
200 if (n >= fdt_num_mem_rsv(fdt))
201 return -FDT_ERR_NOTFOUND;
203 err = _blob_splice_mem_rsv(fdt, re, 1, 0);
209 static int _resize_property(void *fdt, int nodeoffset, const char *name, int len,
210 struct fdt_property **prop)
215 *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
219 if ((err = _blob_splice_struct(fdt, (*prop)->data,
220 ALIGN(oldlen, FDT_TAGSIZE),
221 ALIGN(len, FDT_TAGSIZE))))
224 (*prop)->len = cpu_to_fdt32(len);
228 static int _add_property(void *fdt, int nodeoffset, const char *name, int len,
229 struct fdt_property **prop)
236 if ((nextoffset = _fdt_check_node_offset(fdt, nodeoffset)) < 0)
239 namestroff = _find_add_string(fdt, name);
243 *prop = _fdt_offset_ptr_w(fdt, nextoffset);
244 proplen = sizeof(**prop) + ALIGN(len, FDT_TAGSIZE);
246 err = _blob_splice_struct(fdt, *prop, 0, proplen);
250 (*prop)->tag = cpu_to_fdt32(FDT_PROP);
251 (*prop)->nameoff = cpu_to_fdt32(namestroff);
252 (*prop)->len = cpu_to_fdt32(len);
256 int fdt_set_name(void *fdt, int nodeoffset, const char *name)
262 RW_CHECK_HEADER(fdt);
264 namep = (char *)fdt_get_name(fdt, nodeoffset, &oldlen);
268 newlen = strlen(name);
270 err = _blob_splice_struct(fdt, namep, ALIGN(oldlen+1, FDT_TAGSIZE),
271 ALIGN(newlen+1, FDT_TAGSIZE));
275 memcpy(namep, name, newlen+1);
279 int fdt_setprop(void *fdt, int nodeoffset, const char *name,
280 const void *val, int len)
282 struct fdt_property *prop;
285 RW_CHECK_HEADER(fdt);
287 err = _resize_property(fdt, nodeoffset, name, len, &prop);
288 if (err == -FDT_ERR_NOTFOUND)
289 err = _add_property(fdt, nodeoffset, name, len, &prop);
293 memcpy(prop->data, val, len);
297 int fdt_delprop(void *fdt, int nodeoffset, const char *name)
299 struct fdt_property *prop;
302 RW_CHECK_HEADER(fdt);
304 prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
308 proplen = sizeof(*prop) + ALIGN(len, FDT_TAGSIZE);
309 return _blob_splice_struct(fdt, prop, proplen, 0);
312 int fdt_add_subnode_namelen(void *fdt, int parentoffset,
313 const char *name, int namelen)
315 struct fdt_node_header *nh;
316 int offset, nextoffset;
322 RW_CHECK_HEADER(fdt);
324 offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
326 return -FDT_ERR_EXISTS;
327 else if (offset != -FDT_ERR_NOTFOUND)
330 /* Try to place the new node after the parent's properties */
331 fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
334 tag = fdt_next_tag(fdt, offset, &nextoffset);
335 } while ((tag == FDT_PROP) || (tag == FDT_NOP));
337 nh = _fdt_offset_ptr_w(fdt, offset);
338 nodelen = sizeof(*nh) + ALIGN(namelen+1, FDT_TAGSIZE) + FDT_TAGSIZE;
340 err = _blob_splice_struct(fdt, nh, 0, nodelen);
344 nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
345 memset(nh->name, 0, ALIGN(namelen+1, FDT_TAGSIZE));
346 memcpy(nh->name, name, namelen);
347 endtag = (uint32_t *)((char *)nh + nodelen - FDT_TAGSIZE);
348 *endtag = cpu_to_fdt32(FDT_END_NODE);
353 int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
355 return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
358 int fdt_del_node(void *fdt, int nodeoffset)
362 RW_CHECK_HEADER(fdt);
364 endoffset = _fdt_node_end_offset(fdt, nodeoffset);
368 return _blob_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset),
369 endoffset - nodeoffset, 0);
372 static void _packblocks(const char *old, char *new,
373 int mem_rsv_size, int struct_size)
375 int mem_rsv_off, struct_off, strings_off;
377 mem_rsv_off = ALIGN(sizeof(struct fdt_header), 8);
378 struct_off = mem_rsv_off + mem_rsv_size;
379 strings_off = struct_off + struct_size;
381 memmove(new + mem_rsv_off, old + fdt_off_mem_rsvmap(old), mem_rsv_size);
382 fdt_set_off_mem_rsvmap(new, mem_rsv_off);
384 memmove(new + struct_off, old + fdt_off_dt_struct(old), struct_size);
385 fdt_set_off_dt_struct(new, struct_off);
386 fdt_set_size_dt_struct(new, struct_size);
388 memmove(new + strings_off, old + fdt_off_dt_strings(old),
389 fdt_size_dt_strings(old));
390 fdt_set_off_dt_strings(new, strings_off);
391 fdt_set_size_dt_strings(new, fdt_size_dt_strings(old));
394 int fdt_open_into(const void *fdt, void *buf, int bufsize)
397 int mem_rsv_size, struct_size;
399 const char *fdtstart = fdt;
400 const char *fdtend = fdtstart + fdt_totalsize(fdt);
405 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
406 * sizeof(struct fdt_reserve_entry);
408 if (fdt_version(fdt) >= 17) {
409 struct_size = fdt_size_dt_struct(fdt);
412 while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
416 if (!_blocks_misordered(fdt, mem_rsv_size, struct_size)) {
417 /* no further work necessary */
418 err = fdt_move(fdt, buf, bufsize);
421 fdt_set_version(buf, 17);
422 fdt_set_size_dt_struct(buf, struct_size);
423 fdt_set_totalsize(buf, bufsize);
427 /* Need to reorder */
428 newsize = ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
429 + struct_size + fdt_size_dt_strings(fdt);
431 if (bufsize < newsize)
432 return -FDT_ERR_NOSPACE;
434 /* First attempt to build converted tree at beginning of buffer */
436 /* But if that overlaps with the old tree... */
437 if (((tmp + newsize) > fdtstart) && (tmp < fdtend)) {
438 /* Try right after the old tree instead */
439 tmp = (char *)fdtend;
440 if ((tmp + newsize) > ((char *)buf + bufsize))
441 return -FDT_ERR_NOSPACE;
444 _packblocks(fdt, tmp, mem_rsv_size, struct_size);
445 memmove(buf, tmp, newsize);
447 fdt_set_magic(buf, FDT_MAGIC);
448 fdt_set_totalsize(buf, bufsize);
449 fdt_set_version(buf, 17);
450 fdt_set_last_comp_version(buf, 16);
451 fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
456 int fdt_pack(void *fdt)
460 RW_CHECK_HEADER(fdt);
462 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
463 * sizeof(struct fdt_reserve_entry);
464 _packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));
465 fdt_set_totalsize(fdt, _blob_data_size(fdt));