]>
git.ipfire.org Git - people/ms/u-boot.git/blob - lib/libfdt/fdt_rw.c
2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
4 * SPDX-License-Identifier: GPL-2.0+ BSD-2-Clause
6 #include "libfdt_env.h"
15 #include "libfdt_internal.h"
17 static int _fdt_blocks_misordered(const void *fdt
,
18 int mem_rsv_size
, int struct_size
)
20 return (fdt_off_mem_rsvmap(fdt
) < FDT_ALIGN(sizeof(struct fdt_header
), 8))
21 || (fdt_off_dt_struct(fdt
) <
22 (fdt_off_mem_rsvmap(fdt
) + mem_rsv_size
))
23 || (fdt_off_dt_strings(fdt
) <
24 (fdt_off_dt_struct(fdt
) + struct_size
))
25 || (fdt_totalsize(fdt
) <
26 (fdt_off_dt_strings(fdt
) + fdt_size_dt_strings(fdt
)));
29 static int _fdt_rw_check_header(void *fdt
)
31 FDT_CHECK_HEADER(fdt
);
33 if (fdt_version(fdt
) < 17)
34 return -FDT_ERR_BADVERSION
;
35 if (_fdt_blocks_misordered(fdt
, sizeof(struct fdt_reserve_entry
),
36 fdt_size_dt_struct(fdt
)))
37 return -FDT_ERR_BADLAYOUT
;
38 if (fdt_version(fdt
) > 17)
39 fdt_set_version(fdt
, 17);
44 #define FDT_RW_CHECK_HEADER(fdt) \
47 if ((__err = _fdt_rw_check_header(fdt)) != 0) \
51 static inline int _fdt_data_size(void *fdt
)
53 return fdt_off_dt_strings(fdt
) + fdt_size_dt_strings(fdt
);
56 static int _fdt_splice(void *fdt
, void *splicepoint
, int oldlen
, int newlen
)
58 char *p
= splicepoint
;
59 char *end
= (char *)fdt
+ _fdt_data_size(fdt
);
61 if (((p
+ oldlen
) < p
) || ((p
+ oldlen
) > end
))
62 return -FDT_ERR_BADOFFSET
;
63 if ((end
- oldlen
+ newlen
) > ((char *)fdt
+ fdt_totalsize(fdt
)))
64 return -FDT_ERR_NOSPACE
;
65 memmove(p
+ newlen
, p
+ oldlen
, end
- p
- oldlen
);
69 static int _fdt_splice_mem_rsv(void *fdt
, struct fdt_reserve_entry
*p
,
72 int delta
= (newn
- oldn
) * sizeof(*p
);
74 err
= _fdt_splice(fdt
, p
, oldn
* sizeof(*p
), newn
* sizeof(*p
));
77 fdt_set_off_dt_struct(fdt
, fdt_off_dt_struct(fdt
) + delta
);
78 fdt_set_off_dt_strings(fdt
, fdt_off_dt_strings(fdt
) + delta
);
82 static int _fdt_splice_struct(void *fdt
, void *p
,
83 int oldlen
, int newlen
)
85 int delta
= newlen
- oldlen
;
88 if ((err
= _fdt_splice(fdt
, p
, oldlen
, newlen
)))
91 fdt_set_size_dt_struct(fdt
, fdt_size_dt_struct(fdt
) + delta
);
92 fdt_set_off_dt_strings(fdt
, fdt_off_dt_strings(fdt
) + delta
);
96 static int _fdt_splice_string(void *fdt
, int newlen
)
99 + fdt_off_dt_strings(fdt
) + fdt_size_dt_strings(fdt
);
102 if ((err
= _fdt_splice(fdt
, p
, 0, newlen
)))
105 fdt_set_size_dt_strings(fdt
, fdt_size_dt_strings(fdt
) + newlen
);
109 static int _fdt_find_add_string(void *fdt
, const char *s
)
111 char *strtab
= (char *)fdt
+ fdt_off_dt_strings(fdt
);
114 int len
= strlen(s
) + 1;
117 p
= _fdt_find_string(strtab
, fdt_size_dt_strings(fdt
), s
);
122 new = strtab
+ fdt_size_dt_strings(fdt
);
123 err
= _fdt_splice_string(fdt
, len
);
128 return (new - strtab
);
131 int fdt_add_mem_rsv(void *fdt
, uint64_t address
, uint64_t size
)
133 struct fdt_reserve_entry
*re
;
136 FDT_RW_CHECK_HEADER(fdt
);
138 re
= _fdt_mem_rsv_w(fdt
, fdt_num_mem_rsv(fdt
));
139 err
= _fdt_splice_mem_rsv(fdt
, re
, 0, 1);
143 re
->address
= cpu_to_fdt64(address
);
144 re
->size
= cpu_to_fdt64(size
);
148 int fdt_del_mem_rsv(void *fdt
, int n
)
150 struct fdt_reserve_entry
*re
= _fdt_mem_rsv_w(fdt
, n
);
153 FDT_RW_CHECK_HEADER(fdt
);
155 if (n
>= fdt_num_mem_rsv(fdt
))
156 return -FDT_ERR_NOTFOUND
;
158 err
= _fdt_splice_mem_rsv(fdt
, re
, 1, 0);
164 static int _fdt_resize_property(void *fdt
, int nodeoffset
, const char *name
,
165 int len
, struct fdt_property
**prop
)
170 *prop
= fdt_get_property_w(fdt
, nodeoffset
, name
, &oldlen
);
174 if ((err
= _fdt_splice_struct(fdt
, (*prop
)->data
, FDT_TAGALIGN(oldlen
),
178 (*prop
)->len
= cpu_to_fdt32(len
);
182 static int _fdt_add_property(void *fdt
, int nodeoffset
, const char *name
,
183 int len
, struct fdt_property
**prop
)
190 if ((nextoffset
= _fdt_check_node_offset(fdt
, nodeoffset
)) < 0)
193 namestroff
= _fdt_find_add_string(fdt
, name
);
197 *prop
= _fdt_offset_ptr_w(fdt
, nextoffset
);
198 proplen
= sizeof(**prop
) + FDT_TAGALIGN(len
);
200 err
= _fdt_splice_struct(fdt
, *prop
, 0, proplen
);
204 (*prop
)->tag
= cpu_to_fdt32(FDT_PROP
);
205 (*prop
)->nameoff
= cpu_to_fdt32(namestroff
);
206 (*prop
)->len
= cpu_to_fdt32(len
);
210 int fdt_set_name(void *fdt
, int nodeoffset
, const char *name
)
216 FDT_RW_CHECK_HEADER(fdt
);
218 namep
= (char *)(uintptr_t)fdt_get_name(fdt
, nodeoffset
, &oldlen
);
222 newlen
= strlen(name
);
224 err
= _fdt_splice_struct(fdt
, namep
, FDT_TAGALIGN(oldlen
+1),
225 FDT_TAGALIGN(newlen
+1));
229 memcpy(namep
, name
, newlen
+1);
233 int fdt_setprop(void *fdt
, int nodeoffset
, const char *name
,
234 const void *val
, int len
)
236 struct fdt_property
*prop
;
239 FDT_RW_CHECK_HEADER(fdt
);
241 err
= _fdt_resize_property(fdt
, nodeoffset
, name
, len
, &prop
);
242 if (err
== -FDT_ERR_NOTFOUND
)
243 err
= _fdt_add_property(fdt
, nodeoffset
, name
, len
, &prop
);
247 memcpy(prop
->data
, val
, len
);
251 int fdt_appendprop(void *fdt
, int nodeoffset
, const char *name
,
252 const void *val
, int len
)
254 struct fdt_property
*prop
;
255 int err
, oldlen
, newlen
;
257 FDT_RW_CHECK_HEADER(fdt
);
259 prop
= fdt_get_property_w(fdt
, nodeoffset
, name
, &oldlen
);
261 newlen
= len
+ oldlen
;
262 err
= _fdt_splice_struct(fdt
, prop
->data
,
263 FDT_TAGALIGN(oldlen
),
264 FDT_TAGALIGN(newlen
));
267 prop
->len
= cpu_to_fdt32(newlen
);
268 memcpy(prop
->data
+ oldlen
, val
, len
);
270 err
= _fdt_add_property(fdt
, nodeoffset
, name
, len
, &prop
);
273 memcpy(prop
->data
, val
, len
);
278 int fdt_delprop(void *fdt
, int nodeoffset
, const char *name
)
280 struct fdt_property
*prop
;
283 FDT_RW_CHECK_HEADER(fdt
);
285 prop
= fdt_get_property_w(fdt
, nodeoffset
, name
, &len
);
289 proplen
= sizeof(*prop
) + FDT_TAGALIGN(len
);
290 return _fdt_splice_struct(fdt
, prop
, proplen
, 0);
293 int fdt_add_subnode_namelen(void *fdt
, int parentoffset
,
294 const char *name
, int namelen
)
296 struct fdt_node_header
*nh
;
297 int offset
, nextoffset
;
303 FDT_RW_CHECK_HEADER(fdt
);
305 offset
= fdt_subnode_offset_namelen(fdt
, parentoffset
, name
, namelen
);
307 return -FDT_ERR_EXISTS
;
308 else if (offset
!= -FDT_ERR_NOTFOUND
)
311 /* Try to place the new node after the parent's properties */
312 fdt_next_tag(fdt
, parentoffset
, &nextoffset
); /* skip the BEGIN_NODE */
315 tag
= fdt_next_tag(fdt
, offset
, &nextoffset
);
316 } while ((tag
== FDT_PROP
) || (tag
== FDT_NOP
));
318 nh
= _fdt_offset_ptr_w(fdt
, offset
);
319 nodelen
= sizeof(*nh
) + FDT_TAGALIGN(namelen
+1) + FDT_TAGSIZE
;
321 err
= _fdt_splice_struct(fdt
, nh
, 0, nodelen
);
325 nh
->tag
= cpu_to_fdt32(FDT_BEGIN_NODE
);
326 memset(nh
->name
, 0, FDT_TAGALIGN(namelen
+1));
327 memcpy(nh
->name
, name
, namelen
);
328 endtag
= (fdt32_t
*)((char *)nh
+ nodelen
- FDT_TAGSIZE
);
329 *endtag
= cpu_to_fdt32(FDT_END_NODE
);
334 int fdt_add_subnode(void *fdt
, int parentoffset
, const char *name
)
336 return fdt_add_subnode_namelen(fdt
, parentoffset
, name
, strlen(name
));
339 int fdt_del_node(void *fdt
, int nodeoffset
)
343 FDT_RW_CHECK_HEADER(fdt
);
345 endoffset
= _fdt_node_end_offset(fdt
, nodeoffset
);
349 return _fdt_splice_struct(fdt
, _fdt_offset_ptr_w(fdt
, nodeoffset
),
350 endoffset
- nodeoffset
, 0);
353 static void _fdt_packblocks(const char *old
, char *new,
354 int mem_rsv_size
, int struct_size
)
356 int mem_rsv_off
, struct_off
, strings_off
;
358 mem_rsv_off
= FDT_ALIGN(sizeof(struct fdt_header
), 8);
359 struct_off
= mem_rsv_off
+ mem_rsv_size
;
360 strings_off
= struct_off
+ struct_size
;
362 memmove(new + mem_rsv_off
, old
+ fdt_off_mem_rsvmap(old
), mem_rsv_size
);
363 fdt_set_off_mem_rsvmap(new, mem_rsv_off
);
365 memmove(new + struct_off
, old
+ fdt_off_dt_struct(old
), struct_size
);
366 fdt_set_off_dt_struct(new, struct_off
);
367 fdt_set_size_dt_struct(new, struct_size
);
369 memmove(new + strings_off
, old
+ fdt_off_dt_strings(old
),
370 fdt_size_dt_strings(old
));
371 fdt_set_off_dt_strings(new, strings_off
);
372 fdt_set_size_dt_strings(new, fdt_size_dt_strings(old
));
375 int fdt_open_into(const void *fdt
, void *buf
, int bufsize
)
378 int mem_rsv_size
, struct_size
;
380 const char *fdtstart
= fdt
;
381 const char *fdtend
= fdtstart
+ fdt_totalsize(fdt
);
384 FDT_CHECK_HEADER(fdt
);
386 mem_rsv_size
= (fdt_num_mem_rsv(fdt
)+1)
387 * sizeof(struct fdt_reserve_entry
);
389 if (fdt_version(fdt
) >= 17) {
390 struct_size
= fdt_size_dt_struct(fdt
);
393 while (fdt_next_tag(fdt
, struct_size
, &struct_size
) != FDT_END
)
399 if (!_fdt_blocks_misordered(fdt
, mem_rsv_size
, struct_size
)) {
400 /* no further work necessary */
401 err
= fdt_move(fdt
, buf
, bufsize
);
404 fdt_set_version(buf
, 17);
405 fdt_set_size_dt_struct(buf
, struct_size
);
406 fdt_set_totalsize(buf
, bufsize
);
410 /* Need to reorder */
411 newsize
= FDT_ALIGN(sizeof(struct fdt_header
), 8) + mem_rsv_size
412 + struct_size
+ fdt_size_dt_strings(fdt
);
414 if (bufsize
< newsize
)
415 return -FDT_ERR_NOSPACE
;
417 /* First attempt to build converted tree at beginning of buffer */
419 /* But if that overlaps with the old tree... */
420 if (((tmp
+ newsize
) > fdtstart
) && (tmp
< fdtend
)) {
421 /* Try right after the old tree instead */
422 tmp
= (char *)(uintptr_t)fdtend
;
423 if ((tmp
+ newsize
) > ((char *)buf
+ bufsize
))
424 return -FDT_ERR_NOSPACE
;
427 _fdt_packblocks(fdt
, tmp
, mem_rsv_size
, struct_size
);
428 memmove(buf
, tmp
, newsize
);
430 fdt_set_magic(buf
, FDT_MAGIC
);
431 fdt_set_totalsize(buf
, bufsize
);
432 fdt_set_version(buf
, 17);
433 fdt_set_last_comp_version(buf
, 16);
434 fdt_set_boot_cpuid_phys(buf
, fdt_boot_cpuid_phys(fdt
));
439 int fdt_pack(void *fdt
)
443 FDT_RW_CHECK_HEADER(fdt
);
445 mem_rsv_size
= (fdt_num_mem_rsv(fdt
)+1)
446 * sizeof(struct fdt_reserve_entry
);
447 _fdt_packblocks(fdt
, fdt
, mem_rsv_size
, fdt_size_dt_struct(fdt
));
448 fdt_set_totalsize(fdt
, _fdt_data_size(fdt
));