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 _fdt_blocks_misordered(const void *fdt
,
59 int mem_rsv_size
, int struct_size
)
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
)));
70 static int _fdt_rw_check_header(void *fdt
)
72 FDT_CHECK_HEADER(fdt
);
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);
85 #define FDT_RW_CHECK_HEADER(fdt) \
88 if ((__err = _fdt_rw_check_header(fdt)) != 0) \
92 static inline int _fdt_data_size(void *fdt
)
94 return fdt_off_dt_strings(fdt
) + fdt_size_dt_strings(fdt
);
97 static int _fdt_splice(void *fdt
, void *splicepoint
, int oldlen
, int newlen
)
99 char *p
= splicepoint
;
100 char *end
= (char *)fdt
+ _fdt_data_size(fdt
);
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
);
112 static int _fdt_splice_mem_rsv(void *fdt
, struct fdt_reserve_entry
*p
,
115 int delta
= (newn
- oldn
) * sizeof(*p
);
117 err
= _fdt_splice(fdt
, p
, oldn
* sizeof(*p
), newn
* sizeof(*p
));
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
);
125 static int _fdt_splice_struct(void *fdt
, void *p
,
126 int oldlen
, int newlen
)
128 int delta
= newlen
- oldlen
;
131 if ((err
= _fdt_splice(fdt
, p
, oldlen
, newlen
)))
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
);
139 static int _fdt_splice_string(void *fdt
, int newlen
)
141 void *p
= (char *)fdt
142 + fdt_off_dt_strings(fdt
) + fdt_size_dt_strings(fdt
);
145 if ((err
= _fdt_splice(fdt
, p
, 0, newlen
)))
148 fdt_set_size_dt_strings(fdt
, fdt_size_dt_strings(fdt
) + newlen
);
152 static int _fdt_find_add_string(void *fdt
, const char *s
)
154 char *strtab
= (char *)fdt
+ fdt_off_dt_strings(fdt
);
157 int len
= strlen(s
) + 1;
160 p
= _fdt_find_string(strtab
, fdt_size_dt_strings(fdt
), s
);
165 new = strtab
+ fdt_size_dt_strings(fdt
);
166 err
= _fdt_splice_string(fdt
, len
);
171 return (new - strtab
);
174 int fdt_add_mem_rsv(void *fdt
, uint64_t address
, uint64_t size
)
176 struct fdt_reserve_entry
*re
;
179 FDT_RW_CHECK_HEADER(fdt
);
181 re
= _fdt_mem_rsv_w(fdt
, fdt_num_mem_rsv(fdt
));
182 err
= _fdt_splice_mem_rsv(fdt
, re
, 0, 1);
186 re
->address
= cpu_to_fdt64(address
);
187 re
->size
= cpu_to_fdt64(size
);
191 int fdt_del_mem_rsv(void *fdt
, int n
)
193 struct fdt_reserve_entry
*re
= _fdt_mem_rsv_w(fdt
, n
);
196 FDT_RW_CHECK_HEADER(fdt
);
198 if (n
>= fdt_num_mem_rsv(fdt
))
199 return -FDT_ERR_NOTFOUND
;
201 err
= _fdt_splice_mem_rsv(fdt
, re
, 1, 0);
207 static int _fdt_resize_property(void *fdt
, int nodeoffset
, const char *name
,
208 int len
, struct fdt_property
**prop
)
213 *prop
= fdt_get_property_w(fdt
, nodeoffset
, name
, &oldlen
);
217 if ((err
= _fdt_splice_struct(fdt
, (*prop
)->data
, FDT_TAGALIGN(oldlen
),
221 (*prop
)->len
= cpu_to_fdt32(len
);
225 static int _fdt_add_property(void *fdt
, int nodeoffset
, const char *name
,
226 int len
, struct fdt_property
**prop
)
233 if ((nextoffset
= _fdt_check_node_offset(fdt
, nodeoffset
)) < 0)
236 namestroff
= _fdt_find_add_string(fdt
, name
);
240 *prop
= _fdt_offset_ptr_w(fdt
, nextoffset
);
241 proplen
= sizeof(**prop
) + FDT_TAGALIGN(len
);
243 err
= _fdt_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 FDT_RW_CHECK_HEADER(fdt
);
261 namep
= (char *)(uintptr_t)fdt_get_name(fdt
, nodeoffset
, &oldlen
);
265 newlen
= strlen(name
);
267 err
= _fdt_splice_struct(fdt
, namep
, FDT_TAGALIGN(oldlen
+1),
268 FDT_TAGALIGN(newlen
+1));
272 memcpy(namep
, name
, newlen
+1);
276 int fdt_setprop(void *fdt
, int nodeoffset
, const char *name
,
277 const void *val
, int len
)
279 struct fdt_property
*prop
;
282 FDT_RW_CHECK_HEADER(fdt
);
284 err
= _fdt_resize_property(fdt
, nodeoffset
, name
, len
, &prop
);
285 if (err
== -FDT_ERR_NOTFOUND
)
286 err
= _fdt_add_property(fdt
, nodeoffset
, name
, len
, &prop
);
290 memcpy(prop
->data
, val
, len
);
294 int fdt_appendprop(void *fdt
, int nodeoffset
, const char *name
,
295 const void *val
, int len
)
297 struct fdt_property
*prop
;
298 int err
, oldlen
, newlen
;
300 FDT_RW_CHECK_HEADER(fdt
);
302 prop
= fdt_get_property_w(fdt
, nodeoffset
, name
, &oldlen
);
304 newlen
= len
+ oldlen
;
305 err
= _fdt_splice_struct(fdt
, prop
->data
,
306 FDT_TAGALIGN(oldlen
),
307 FDT_TAGALIGN(newlen
));
310 prop
->len
= cpu_to_fdt32(newlen
);
311 memcpy(prop
->data
+ oldlen
, val
, len
);
313 err
= _fdt_add_property(fdt
, nodeoffset
, name
, len
, &prop
);
316 memcpy(prop
->data
, val
, len
);
321 int fdt_delprop(void *fdt
, int nodeoffset
, const char *name
)
323 struct fdt_property
*prop
;
326 FDT_RW_CHECK_HEADER(fdt
);
328 prop
= fdt_get_property_w(fdt
, nodeoffset
, name
, &len
);
332 proplen
= sizeof(*prop
) + FDT_TAGALIGN(len
);
333 return _fdt_splice_struct(fdt
, prop
, proplen
, 0);
336 int fdt_add_subnode_namelen(void *fdt
, int parentoffset
,
337 const char *name
, int namelen
)
339 struct fdt_node_header
*nh
;
340 int offset
, nextoffset
;
346 FDT_RW_CHECK_HEADER(fdt
);
348 offset
= fdt_subnode_offset_namelen(fdt
, parentoffset
, name
, namelen
);
350 return -FDT_ERR_EXISTS
;
351 else if (offset
!= -FDT_ERR_NOTFOUND
)
354 /* Try to place the new node after the parent's properties */
355 fdt_next_tag(fdt
, parentoffset
, &nextoffset
); /* skip the BEGIN_NODE */
358 tag
= fdt_next_tag(fdt
, offset
, &nextoffset
);
359 } while ((tag
== FDT_PROP
) || (tag
== FDT_NOP
));
361 nh
= _fdt_offset_ptr_w(fdt
, offset
);
362 nodelen
= sizeof(*nh
) + FDT_TAGALIGN(namelen
+1) + FDT_TAGSIZE
;
364 err
= _fdt_splice_struct(fdt
, nh
, 0, nodelen
);
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
);
377 int fdt_add_subnode(void *fdt
, int parentoffset
, const char *name
)
379 return fdt_add_subnode_namelen(fdt
, parentoffset
, name
, strlen(name
));
382 int fdt_del_node(void *fdt
, int nodeoffset
)
386 FDT_RW_CHECK_HEADER(fdt
);
388 endoffset
= _fdt_node_end_offset(fdt
, nodeoffset
);
392 return _fdt_splice_struct(fdt
, _fdt_offset_ptr_w(fdt
, nodeoffset
),
393 endoffset
- nodeoffset
, 0);
396 static void _fdt_packblocks(const char *old
, char *new,
397 int mem_rsv_size
, int struct_size
)
399 int mem_rsv_off
, struct_off
, strings_off
;
401 mem_rsv_off
= FDT_ALIGN(sizeof(struct fdt_header
), 8);
402 struct_off
= mem_rsv_off
+ mem_rsv_size
;
403 strings_off
= struct_off
+ struct_size
;
405 memmove(new + mem_rsv_off
, old
+ fdt_off_mem_rsvmap(old
), mem_rsv_size
);
406 fdt_set_off_mem_rsvmap(new, mem_rsv_off
);
408 memmove(new + struct_off
, old
+ fdt_off_dt_struct(old
), struct_size
);
409 fdt_set_off_dt_struct(new, struct_off
);
410 fdt_set_size_dt_struct(new, struct_size
);
412 memmove(new + strings_off
, old
+ fdt_off_dt_strings(old
),
413 fdt_size_dt_strings(old
));
414 fdt_set_off_dt_strings(new, strings_off
);
415 fdt_set_size_dt_strings(new, fdt_size_dt_strings(old
));
418 int fdt_open_into(const void *fdt
, void *buf
, int bufsize
)
421 int mem_rsv_size
, struct_size
;
423 const char *fdtstart
= fdt
;
424 const char *fdtend
= fdtstart
+ fdt_totalsize(fdt
);
427 FDT_CHECK_HEADER(fdt
);
429 mem_rsv_size
= (fdt_num_mem_rsv(fdt
)+1)
430 * sizeof(struct fdt_reserve_entry
);
432 if (fdt_version(fdt
) >= 17) {
433 struct_size
= fdt_size_dt_struct(fdt
);
436 while (fdt_next_tag(fdt
, struct_size
, &struct_size
) != FDT_END
)
442 if (!_fdt_blocks_misordered(fdt
, mem_rsv_size
, struct_size
)) {
443 /* no further work necessary */
444 err
= fdt_move(fdt
, buf
, bufsize
);
447 fdt_set_version(buf
, 17);
448 fdt_set_size_dt_struct(buf
, struct_size
);
449 fdt_set_totalsize(buf
, bufsize
);
453 /* Need to reorder */
454 newsize
= FDT_ALIGN(sizeof(struct fdt_header
), 8) + mem_rsv_size
455 + struct_size
+ fdt_size_dt_strings(fdt
);
457 if (bufsize
< newsize
)
458 return -FDT_ERR_NOSPACE
;
460 /* First attempt to build converted tree at beginning of buffer */
462 /* But if that overlaps with the old tree... */
463 if (((tmp
+ newsize
) > fdtstart
) && (tmp
< fdtend
)) {
464 /* Try right after the old tree instead */
465 tmp
= (char *)(uintptr_t)fdtend
;
466 if ((tmp
+ newsize
) > ((char *)buf
+ bufsize
))
467 return -FDT_ERR_NOSPACE
;
470 _fdt_packblocks(fdt
, tmp
, mem_rsv_size
, struct_size
);
471 memmove(buf
, tmp
, newsize
);
473 fdt_set_magic(buf
, FDT_MAGIC
);
474 fdt_set_totalsize(buf
, bufsize
);
475 fdt_set_version(buf
, 17);
476 fdt_set_last_comp_version(buf
, 16);
477 fdt_set_boot_cpuid_phys(buf
, fdt_boot_cpuid_phys(fdt
));
482 int fdt_pack(void *fdt
)
486 FDT_RW_CHECK_HEADER(fdt
);
488 mem_rsv_size
= (fdt_num_mem_rsv(fdt
)+1)
489 * sizeof(struct fdt_reserve_entry
);
490 _fdt_packblocks(fdt
, fdt
, mem_rsv_size
, fdt_size_dt_struct(fdt
));
491 fdt_set_totalsize(fdt
, _fdt_data_size(fdt
));