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"
56 #include "libfdt_internal.h"
58 static int _blocks_misordered(const void *fdt,
59 int mem_rsv_size, int struct_size)
61 return (fdt_off_mem_rsvmap(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)));
70 static int rw_check_header(void *fdt)
74 if (fdt_version(fdt) < 17)
75 return -FDT_ERR_BADVERSION;
76 if (_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);
85 #define RW_CHECK_HEADER(fdt) \
88 if ((err = rw_check_header(fdt)) != 0) \
92 static inline int _blob_data_size(void *fdt)
94 return fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
97 static int _blob_splice(void *fdt, void *p, int oldlen, int newlen)
99 void *end = fdt + _blob_data_size(fdt);
101 if (((p + oldlen) < p) || ((p + oldlen) > end))
102 return -FDT_ERR_BADOFFSET;
103 if ((end - oldlen + newlen) > (fdt + fdt_totalsize(fdt)))
104 return -FDT_ERR_NOSPACE;
105 memmove(p + newlen, p + oldlen, end - p - oldlen);
109 static int _blob_splice_mem_rsv(void *fdt, struct fdt_reserve_entry *p,
112 int delta = (newn - oldn) * sizeof(*p);
114 err = _blob_splice(fdt, p, oldn * sizeof(*p), newn * sizeof(*p));
117 fdt_set_off_dt_struct(fdt, fdt_off_dt_struct(fdt) + delta);
118 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
122 static int _blob_splice_struct(void *fdt, void *p,
123 int oldlen, int newlen)
125 int delta = newlen - oldlen;
128 if ((err = _blob_splice(fdt, p, oldlen, newlen)))
131 fdt_set_size_dt_struct(fdt, fdt_size_dt_struct(fdt) + delta);
132 fdt_set_off_dt_strings(fdt, fdt_off_dt_strings(fdt) + delta);
136 static int _blob_splice_string(void *fdt, int newlen)
138 void *p = fdt + fdt_off_dt_strings(fdt) + fdt_size_dt_strings(fdt);
141 if ((err = _blob_splice(fdt, p, 0, newlen)))
144 fdt_set_size_dt_strings(fdt, fdt_size_dt_strings(fdt) + newlen);
148 static int _find_add_string(void *fdt, const char *s)
150 char *strtab = (char *)fdt + fdt_off_dt_strings(fdt);
153 int len = strlen(s) + 1;
156 p = _fdt_find_string(strtab, fdt_size_dt_strings(fdt), s);
161 new = strtab + fdt_size_dt_strings(fdt);
162 err = _blob_splice_string(fdt, len);
167 return (new - strtab);
170 int fdt_add_mem_rsv(void *fdt, uint64_t address, uint64_t size)
172 struct fdt_reserve_entry *re;
175 if ((err = rw_check_header(fdt)))
178 re = _fdt_mem_rsv_w(fdt, fdt_num_mem_rsv(fdt));
179 err = _blob_splice_mem_rsv(fdt, re, 0, 1);
183 re->address = cpu_to_fdt64(address);
184 re->size = cpu_to_fdt64(size);
188 int fdt_del_mem_rsv(void *fdt, int n)
190 struct fdt_reserve_entry *re = _fdt_mem_rsv_w(fdt, n);
193 if ((err = rw_check_header(fdt)))
195 if (n >= fdt_num_mem_rsv(fdt))
196 return -FDT_ERR_NOTFOUND;
198 err = _blob_splice_mem_rsv(fdt, re, 1, 0);
204 static int _resize_property(void *fdt, int nodeoffset, const char *name, int len,
205 struct fdt_property **prop)
210 *prop = fdt_get_property_w(fdt, nodeoffset, name, &oldlen);
214 if ((err = _blob_splice_struct(fdt, (*prop)->data,
215 ALIGN(oldlen, FDT_TAGSIZE),
216 ALIGN(len, FDT_TAGSIZE))))
219 (*prop)->len = cpu_to_fdt32(len);
223 static int _add_property(void *fdt, int nodeoffset, const char *name, int len,
224 struct fdt_property **prop)
232 tag = fdt_next_tag(fdt, nodeoffset, &nextoffset);
233 if (tag != FDT_BEGIN_NODE)
234 return -FDT_ERR_BADOFFSET;
236 namestroff = _find_add_string(fdt, name);
240 *prop = _fdt_offset_ptr_w(fdt, nextoffset);
241 proplen = sizeof(**prop) + ALIGN(len, FDT_TAGSIZE);
243 err = _blob_splice_struct(fdt, *prop, 0, proplen);
247 (*prop)->tag = cpu_to_fdt32(FDT_PROP);
248 (*prop)->nameoff = cpu_to_fdt32(namestroff);
249 (*prop)->len = cpu_to_fdt32(len);
253 int fdt_set_name(void *fdt, int nodeoffset, const char *name)
259 if ((err = rw_check_header(fdt)))
262 namep = (char *)fdt_get_name(fdt, nodeoffset, &oldlen);
266 newlen = strlen(name);
268 err = _blob_splice_struct(fdt, namep, ALIGN(oldlen+1, FDT_TAGSIZE),
269 ALIGN(newlen+1, FDT_TAGSIZE));
273 memcpy(namep, name, newlen+1);
277 int fdt_setprop(void *fdt, int nodeoffset, const char *name,
278 const void *val, int len)
280 struct fdt_property *prop;
283 if ((err = rw_check_header(fdt)))
286 err = _resize_property(fdt, nodeoffset, name, len, &prop);
287 if (err == -FDT_ERR_NOTFOUND)
288 err = _add_property(fdt, nodeoffset, name, len, &prop);
292 memcpy(prop->data, val, len);
296 int fdt_delprop(void *fdt, int nodeoffset, const char *name)
298 struct fdt_property *prop;
301 RW_CHECK_HEADER(fdt);
303 prop = fdt_get_property_w(fdt, nodeoffset, name, &len);
307 proplen = sizeof(*prop) + ALIGN(len, FDT_TAGSIZE);
308 return _blob_splice_struct(fdt, prop, proplen, 0);
311 int fdt_add_subnode_namelen(void *fdt, int parentoffset,
312 const char *name, int namelen)
314 struct fdt_node_header *nh;
315 int offset, nextoffset;
321 RW_CHECK_HEADER(fdt);
323 offset = fdt_subnode_offset_namelen(fdt, parentoffset, name, namelen);
325 return -FDT_ERR_EXISTS;
326 else if (offset != -FDT_ERR_NOTFOUND)
329 /* Try to place the new node after the parent's properties */
330 fdt_next_tag(fdt, parentoffset, &nextoffset); /* skip the BEGIN_NODE */
333 tag = fdt_next_tag(fdt, offset, &nextoffset);
334 } while ((tag == FDT_PROP) || (tag == FDT_NOP));
336 nh = _fdt_offset_ptr_w(fdt, offset);
337 nodelen = sizeof(*nh) + ALIGN(namelen+1, FDT_TAGSIZE) + FDT_TAGSIZE;
339 err = _blob_splice_struct(fdt, nh, 0, nodelen);
343 nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
344 memset(nh->name, 0, ALIGN(namelen+1, FDT_TAGSIZE));
345 memcpy(nh->name, name, namelen);
346 endtag = (uint32_t *)((void *)nh + nodelen - FDT_TAGSIZE);
347 *endtag = cpu_to_fdt32(FDT_END_NODE);
352 int fdt_add_subnode(void *fdt, int parentoffset, const char *name)
354 return fdt_add_subnode_namelen(fdt, parentoffset, name, strlen(name));
357 int fdt_del_node(void *fdt, int nodeoffset)
361 RW_CHECK_HEADER(fdt);
363 endoffset = _fdt_node_end_offset(fdt, nodeoffset);
367 return _blob_splice_struct(fdt, _fdt_offset_ptr_w(fdt, nodeoffset),
368 endoffset - nodeoffset, 0);
371 static void _packblocks(const void *fdt, void *buf,
372 int mem_rsv_size, int struct_size)
374 int mem_rsv_off, struct_off, strings_off;
376 mem_rsv_off = ALIGN(sizeof(struct fdt_header), 8);
377 struct_off = mem_rsv_off + mem_rsv_size;
378 strings_off = struct_off + struct_size;
380 memmove(buf + mem_rsv_off, fdt + fdt_off_mem_rsvmap(fdt), mem_rsv_size);
381 fdt_set_off_mem_rsvmap(buf, mem_rsv_off);
383 memmove(buf + struct_off, fdt + fdt_off_dt_struct(fdt), struct_size);
384 fdt_set_off_dt_struct(buf, struct_off);
385 fdt_set_size_dt_struct(buf, struct_size);
387 memmove(buf + strings_off, fdt + fdt_off_dt_strings(fdt),
388 fdt_size_dt_strings(fdt));
389 fdt_set_off_dt_strings(buf, strings_off);
390 fdt_set_size_dt_strings(buf, fdt_size_dt_strings(fdt));
393 int fdt_open_into(const void *fdt, void *buf, int bufsize)
396 int mem_rsv_size, struct_size;
402 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
403 * sizeof(struct fdt_reserve_entry);
405 if (fdt_version(fdt) >= 17) {
406 struct_size = fdt_size_dt_struct(fdt);
409 while (fdt_next_tag(fdt, struct_size, &struct_size) != FDT_END)
413 if (!_blocks_misordered(fdt, mem_rsv_size, struct_size)) {
414 /* no further work necessary */
415 err = fdt_move(fdt, buf, bufsize);
418 fdt_set_version(buf, 17);
419 fdt_set_size_dt_struct(buf, struct_size);
420 fdt_set_totalsize(buf, bufsize);
424 /* Need to reorder */
425 newsize = ALIGN(sizeof(struct fdt_header), 8) + mem_rsv_size
426 + struct_size + fdt_size_dt_strings(fdt);
428 if (bufsize < newsize)
429 return -FDT_ERR_NOSPACE;
431 if (((buf + newsize) <= fdt)
432 || (buf >= (fdt + fdt_totalsize(fdt)))) {
435 tmp = (void *)fdt + fdt_totalsize(fdt);
436 if ((tmp + newsize) > (buf + bufsize))
437 return -FDT_ERR_NOSPACE;
440 _packblocks(fdt, tmp, mem_rsv_size, struct_size);
441 memmove(buf, tmp, newsize);
443 fdt_set_magic(buf, FDT_MAGIC);
444 fdt_set_totalsize(buf, bufsize);
445 fdt_set_version(buf, 17);
446 fdt_set_last_comp_version(buf, 16);
447 fdt_set_boot_cpuid_phys(buf, fdt_boot_cpuid_phys(fdt));
452 int fdt_pack(void *fdt)
457 err = rw_check_header(fdt);
461 mem_rsv_size = (fdt_num_mem_rsv(fdt)+1)
462 * sizeof(struct fdt_reserve_entry);
463 _packblocks(fdt, fdt, mem_rsv_size, fdt_size_dt_struct(fdt));
464 fdt_set_totalsize(fdt, _blob_data_size(fdt));