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 ((err
= fdt_check_header(fdt
)))
76 if (fdt_version(fdt
) < 17)
77 return -FDT_ERR_BADVERSION
;
78 if (_blocks_misordered(fdt
, sizeof(struct fdt_reserve_entry
),
79 fdt_size_dt_struct(fdt
)))
80 return -FDT_ERR_BADLAYOUT
;
81 if (fdt_version(fdt
) > 17)
82 fdt_set_version(fdt
, 17);
87 #define RW_CHECK_HEADER(fdt) \
90 if ((err = rw_check_header(fdt)) != 0) \
94 static inline int _blob_data_size(void *fdt
)
96 return fdt_off_dt_strings(fdt
) + fdt_size_dt_strings(fdt
);
99 static int _blob_splice(void *fdt
, void *p
, int oldlen
, int newlen
)
101 void *end
= fdt
+ _blob_data_size(fdt
);
103 if (((p
+ oldlen
) < p
) || ((p
+ oldlen
) > end
))
104 return -FDT_ERR_BADOFFSET
;
105 if ((end
- oldlen
+ newlen
) > (fdt
+ fdt_totalsize(fdt
)))
106 return -FDT_ERR_NOSPACE
;
107 memmove(p
+ newlen
, p
+ oldlen
, end
- p
- oldlen
);
111 static int _blob_splice_mem_rsv(void *fdt
, struct fdt_reserve_entry
*p
,
114 int delta
= (newn
- oldn
) * sizeof(*p
);
116 err
= _blob_splice(fdt
, p
, oldn
* sizeof(*p
), newn
* sizeof(*p
));
119 fdt_set_off_dt_struct(fdt
, fdt_off_dt_struct(fdt
) + delta
);
120 fdt_set_off_dt_strings(fdt
, fdt_off_dt_strings(fdt
) + delta
);
124 static int _blob_splice_struct(void *fdt
, void *p
,
125 int oldlen
, int newlen
)
127 int delta
= newlen
- oldlen
;
130 if ((err
= _blob_splice(fdt
, p
, oldlen
, newlen
)))
133 fdt_set_size_dt_struct(fdt
, fdt_size_dt_struct(fdt
) + delta
);
134 fdt_set_off_dt_strings(fdt
, fdt_off_dt_strings(fdt
) + delta
);
138 static int _blob_splice_string(void *fdt
, int newlen
)
140 void *p
= fdt
+ fdt_off_dt_strings(fdt
) + fdt_size_dt_strings(fdt
);
143 if ((err
= _blob_splice(fdt
, p
, 0, newlen
)))
146 fdt_set_size_dt_strings(fdt
, fdt_size_dt_strings(fdt
) + newlen
);
150 static int _find_add_string(void *fdt
, const char *s
)
152 char *strtab
= (char *)fdt
+ fdt_off_dt_strings(fdt
);
155 int len
= strlen(s
) + 1;
158 p
= _fdt_find_string(strtab
, fdt_size_dt_strings(fdt
), s
);
163 new = strtab
+ fdt_size_dt_strings(fdt
);
164 err
= _blob_splice_string(fdt
, len
);
169 return (new - strtab
);
172 int fdt_add_mem_rsv(void *fdt
, uint64_t address
, uint64_t size
)
174 struct fdt_reserve_entry
*re
;
177 if ((err
= rw_check_header(fdt
)))
180 re
= _fdt_mem_rsv_w(fdt
, fdt_num_mem_rsv(fdt
));
181 err
= _blob_splice_mem_rsv(fdt
, re
, 0, 1);
185 re
->address
= cpu_to_fdt64(address
);
186 re
->size
= cpu_to_fdt64(size
);
190 int fdt_del_mem_rsv(void *fdt
, int n
)
192 struct fdt_reserve_entry
*re
= _fdt_mem_rsv_w(fdt
, n
);
195 if ((err
= rw_check_header(fdt
)))
197 if (n
>= fdt_num_mem_rsv(fdt
))
198 return -FDT_ERR_NOTFOUND
;
200 err
= _blob_splice_mem_rsv(fdt
, re
, 1, 0);
206 static int _resize_property(void *fdt
, int nodeoffset
, const char *name
, int len
,
207 struct fdt_property
**prop
)
212 *prop
= fdt_get_property_w(fdt
, nodeoffset
, name
, &oldlen
);
216 if ((err
= _blob_splice_struct(fdt
, (*prop
)->data
,
217 ALIGN(oldlen
, FDT_TAGSIZE
),
218 ALIGN(len
, FDT_TAGSIZE
))))
221 (*prop
)->len
= cpu_to_fdt32(len
);
225 static int _add_property(void *fdt
, int nodeoffset
, const char *name
, int len
,
226 struct fdt_property
**prop
)
234 tag
= fdt_next_tag(fdt
, nodeoffset
, &nextoffset
);
235 if (tag
!= FDT_BEGIN_NODE
)
236 return -FDT_ERR_BADOFFSET
;
238 namestroff
= _find_add_string(fdt
, name
);
242 *prop
= _fdt_offset_ptr_w(fdt
, nextoffset
);
243 proplen
= sizeof(**prop
) + ALIGN(len
, FDT_TAGSIZE
);
245 err
= _blob_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_setprop(void *fdt
, int nodeoffset
, const char *name
,
256 const void *val
, int len
)
258 struct fdt_property
*prop
;
261 if ((err
= rw_check_header(fdt
)))
264 err
= _resize_property(fdt
, nodeoffset
, name
, len
, &prop
);
265 if (err
== -FDT_ERR_NOTFOUND
)
266 err
= _add_property(fdt
, nodeoffset
, name
, len
, &prop
);
270 memcpy(prop
->data
, val
, len
);
274 int fdt_delprop(void *fdt
, int nodeoffset
, const char *name
)
276 struct fdt_property
*prop
;
279 RW_CHECK_HEADER(fdt
);
281 prop
= fdt_get_property_w(fdt
, nodeoffset
, name
, &len
);
285 proplen
= sizeof(*prop
) + ALIGN(len
, FDT_TAGSIZE
);
286 return _blob_splice_struct(fdt
, prop
, proplen
, 0);
289 int fdt_add_subnode_namelen(void *fdt
, int parentoffset
,
290 const char *name
, int namelen
)
292 struct fdt_node_header
*nh
;
293 int offset
, nextoffset
;
299 RW_CHECK_HEADER(fdt
);
301 offset
= fdt_subnode_offset_namelen(fdt
, parentoffset
, name
, namelen
);
303 return -FDT_ERR_EXISTS
;
304 else if (offset
!= -FDT_ERR_NOTFOUND
)
307 /* Try to place the new node after the parent's properties */
308 fdt_next_tag(fdt
, parentoffset
, &nextoffset
); /* skip the BEGIN_NODE */
311 tag
= fdt_next_tag(fdt
, offset
, &nextoffset
);
312 } while (tag
== FDT_PROP
);
314 nh
= _fdt_offset_ptr_w(fdt
, offset
);
315 nodelen
= sizeof(*nh
) + ALIGN(namelen
+1, FDT_TAGSIZE
) + FDT_TAGSIZE
;
317 err
= _blob_splice_struct(fdt
, nh
, 0, nodelen
);
321 nh
->tag
= cpu_to_fdt32(FDT_BEGIN_NODE
);
322 memset(nh
->name
, 0, ALIGN(namelen
+1, FDT_TAGSIZE
));
323 memcpy(nh
->name
, name
, namelen
);
324 endtag
= (uint32_t *)((void *)nh
+ nodelen
- FDT_TAGSIZE
);
325 *endtag
= cpu_to_fdt32(FDT_END_NODE
);
330 int fdt_add_subnode(void *fdt
, int parentoffset
, const char *name
)
332 return fdt_add_subnode_namelen(fdt
, parentoffset
, name
, strlen(name
));
335 int fdt_del_node(void *fdt
, int nodeoffset
)
339 RW_CHECK_HEADER(fdt
);
341 endoffset
= _fdt_node_end_offset(fdt
, nodeoffset
);
345 return _blob_splice_struct(fdt
, _fdt_offset_ptr_w(fdt
, nodeoffset
),
346 endoffset
- nodeoffset
, 0);
349 static void _packblocks(const void *fdt
, void *buf
,
350 int mem_rsv_size
, int struct_size
)
352 int mem_rsv_off
, struct_off
, strings_off
;
354 mem_rsv_off
= ALIGN(sizeof(struct fdt_header
), 8);
355 struct_off
= mem_rsv_off
+ mem_rsv_size
;
356 strings_off
= struct_off
+ struct_size
;
358 memmove(buf
+ mem_rsv_off
, fdt
+ fdt_off_mem_rsvmap(fdt
), mem_rsv_size
);
359 fdt_set_off_mem_rsvmap(buf
, mem_rsv_off
);
361 memmove(buf
+ struct_off
, fdt
+ fdt_off_dt_struct(fdt
), struct_size
);
362 fdt_set_off_dt_struct(buf
, struct_off
);
363 fdt_set_size_dt_struct(buf
, struct_size
);
365 memmove(buf
+ strings_off
, fdt
+ fdt_off_dt_strings(fdt
),
366 fdt_size_dt_strings(fdt
));
367 fdt_set_off_dt_strings(buf
, strings_off
);
368 fdt_set_size_dt_strings(buf
, fdt_size_dt_strings(fdt
));
371 int fdt_open_into(const void *fdt
, void *buf
, int bufsize
)
374 int mem_rsv_size
, struct_size
;
378 err
= fdt_check_header(fdt
);
382 mem_rsv_size
= (fdt_num_mem_rsv(fdt
)+1)
383 * sizeof(struct fdt_reserve_entry
);
385 if (fdt_version(fdt
) >= 17) {
386 struct_size
= fdt_size_dt_struct(fdt
);
389 while (fdt_next_tag(fdt
, struct_size
, &struct_size
) != FDT_END
)
393 if (!_blocks_misordered(fdt
, mem_rsv_size
, struct_size
)) {
394 /* no further work necessary */
395 err
= fdt_move(fdt
, buf
, bufsize
);
398 fdt_set_version(buf
, 17);
399 fdt_set_size_dt_struct(buf
, struct_size
);
400 fdt_set_totalsize(buf
, bufsize
);
404 /* Need to reorder */
405 newsize
= ALIGN(sizeof(struct fdt_header
), 8) + mem_rsv_size
406 + struct_size
+ fdt_size_dt_strings(fdt
);
408 if (bufsize
< newsize
)
409 return -FDT_ERR_NOSPACE
;
411 if (((buf
+ newsize
) <= fdt
)
412 || (buf
>= (fdt
+ fdt_totalsize(fdt
)))) {
415 tmp
= (void *)fdt
+ fdt_totalsize(fdt
);
416 if ((tmp
+ newsize
) > (buf
+ bufsize
))
417 return -FDT_ERR_NOSPACE
;
420 _packblocks(fdt
, tmp
, mem_rsv_size
, struct_size
);
421 memmove(buf
, tmp
, newsize
);
423 fdt_set_magic(buf
, FDT_MAGIC
);
424 fdt_set_totalsize(buf
, bufsize
);
425 fdt_set_version(buf
, 17);
426 fdt_set_last_comp_version(buf
, 16);
427 fdt_set_boot_cpuid_phys(buf
, fdt_boot_cpuid_phys(fdt
));
432 int fdt_pack(void *fdt
)
437 err
= rw_check_header(fdt
);
441 mem_rsv_size
= (fdt_num_mem_rsv(fdt
)+1)
442 * sizeof(struct fdt_reserve_entry
);
443 _packblocks(fdt
, fdt
, mem_rsv_size
, fdt_size_dt_struct(fdt
));
444 fdt_set_totalsize(fdt
, _blob_data_size(fdt
));