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"
59 _fdt_sw_check_header (
63 if (fdt_magic (fdt
) != FDT_SW_MAGIC
) {
64 return -FDT_ERR_BADMAGIC
;
67 /* FIXME: should check more details about the header state */
71 #define FDT_SW_CHECK_HEADER(fdt) \
74 if ((err = _fdt_sw_check_header(fdt)) != 0) \
84 int offset
= fdt_size_dt_struct (fdt
);
87 spaceleft
= fdt_totalsize (fdt
) - fdt_off_dt_struct (fdt
)
88 - fdt_size_dt_strings (fdt
);
90 if ((offset
+ len
< offset
) || (offset
+ len
> spaceleft
)) {
94 fdt_set_size_dt_struct (fdt
, offset
+ len
);
95 return _fdt_offset_ptr_w (fdt
, offset
);
106 if (bufsize
< sizeof (struct fdt_header
)) {
107 return -FDT_ERR_NOSPACE
;
110 memset (buf
, 0, bufsize
);
112 fdt_set_magic (fdt
, FDT_SW_MAGIC
);
113 fdt_set_version (fdt
, FDT_LAST_SUPPORTED_VERSION
);
114 fdt_set_last_comp_version (fdt
, FDT_FIRST_SUPPORTED_VERSION
);
115 fdt_set_totalsize (fdt
, bufsize
);
117 fdt_set_off_mem_rsvmap (
120 sizeof (struct fdt_header
),
121 sizeof (struct fdt_reserve_entry
)
124 fdt_set_off_dt_struct (fdt
, fdt_off_mem_rsvmap (fdt
));
125 fdt_set_off_dt_strings (fdt
, bufsize
);
137 size_t headsize
, tailsize
;
138 char *oldtail
, *newtail
;
140 FDT_SW_CHECK_HEADER (fdt
);
142 headsize
= fdt_off_dt_struct (fdt
);
143 tailsize
= fdt_size_dt_strings (fdt
);
145 if ((headsize
+ tailsize
) > bufsize
) {
146 return -FDT_ERR_NOSPACE
;
149 oldtail
= (char *)fdt
+ fdt_totalsize (fdt
) - tailsize
;
150 newtail
= (char *)buf
+ bufsize
- tailsize
;
152 /* Two cases to avoid clobbering data if the old and new
153 * buffers partially overlap */
155 memmove (buf
, fdt
, headsize
);
156 memmove (newtail
, oldtail
, tailsize
);
158 memmove (newtail
, oldtail
, tailsize
);
159 memmove (buf
, fdt
, headsize
);
162 fdt_set_off_dt_strings (buf
, bufsize
);
163 fdt_set_totalsize (buf
, bufsize
);
169 fdt_add_reservemap_entry (
175 struct fdt_reserve_entry
*re
;
178 FDT_SW_CHECK_HEADER (fdt
);
180 if (fdt_size_dt_struct (fdt
)) {
181 return -FDT_ERR_BADSTATE
;
184 offset
= fdt_off_dt_struct (fdt
);
185 if ((offset
+ sizeof (*re
)) > fdt_totalsize (fdt
)) {
186 return -FDT_ERR_NOSPACE
;
189 re
= (struct fdt_reserve_entry
*)((char *)fdt
+ offset
);
190 re
->address
= cpu_to_fdt64 (addr
);
191 re
->size
= cpu_to_fdt64 (size
);
193 fdt_set_off_dt_struct (fdt
, offset
+ sizeof (*re
));
199 fdt_finish_reservemap (
203 return fdt_add_reservemap_entry (fdt
, 0, 0);
212 struct fdt_node_header
*nh
;
213 int namelen
= strlen (name
) + 1;
215 FDT_SW_CHECK_HEADER (fdt
);
217 nh
= _fdt_grab_space (fdt
, sizeof (*nh
) + FDT_TAGALIGN (namelen
));
219 return -FDT_ERR_NOSPACE
;
222 nh
->tag
= cpu_to_fdt32 (FDT_BEGIN_NODE
);
223 memcpy (nh
->name
, name
, namelen
);
234 FDT_SW_CHECK_HEADER (fdt
);
236 en
= _fdt_grab_space (fdt
, FDT_TAGSIZE
);
238 return -FDT_ERR_NOSPACE
;
241 *en
= cpu_to_fdt32 (FDT_END_NODE
);
246 _fdt_find_add_string (
251 char *strtab
= (char *)fdt
+ fdt_totalsize (fdt
);
253 int strtabsize
= fdt_size_dt_strings (fdt
);
254 int len
= strlen (s
) + 1;
255 int struct_top
, offset
;
257 p
= _fdt_find_string (strtab
- strtabsize
, strtabsize
, s
);
263 offset
= -strtabsize
- len
;
264 struct_top
= fdt_off_dt_struct (fdt
) + fdt_size_dt_struct (fdt
);
265 if (fdt_totalsize (fdt
) + offset
< struct_top
) {
266 return 0; /* no more room :( */
269 memcpy (strtab
+ offset
, s
, len
);
270 fdt_set_size_dt_strings (fdt
, strtabsize
+ len
);
275 fdt_property_placeholder (
282 struct fdt_property
*prop
;
285 FDT_SW_CHECK_HEADER (fdt
);
287 nameoff
= _fdt_find_add_string (fdt
, name
);
289 return -FDT_ERR_NOSPACE
;
292 prop
= _fdt_grab_space (fdt
, sizeof (*prop
) + FDT_TAGALIGN (len
));
294 return -FDT_ERR_NOSPACE
;
297 prop
->tag
= cpu_to_fdt32 (FDT_PROP
);
298 prop
->nameoff
= cpu_to_fdt32 (nameoff
);
299 prop
->len
= cpu_to_fdt32 (len
);
315 ret
= fdt_property_placeholder (fdt
, name
, len
, &ptr
);
320 memcpy (ptr
, val
, len
);
329 char *p
= (char *)fdt
;
331 int oldstroffset
, newstroffset
;
333 int offset
, nextoffset
;
335 FDT_SW_CHECK_HEADER (fdt
);
338 end
= _fdt_grab_space (fdt
, sizeof (*end
));
340 return -FDT_ERR_NOSPACE
;
343 *end
= cpu_to_fdt32 (FDT_END
);
345 /* Relocate the string table */
346 oldstroffset
= fdt_totalsize (fdt
) - fdt_size_dt_strings (fdt
);
347 newstroffset
= fdt_off_dt_struct (fdt
) + fdt_size_dt_struct (fdt
);
348 memmove (p
+ newstroffset
, p
+ oldstroffset
, fdt_size_dt_strings (fdt
));
349 fdt_set_off_dt_strings (fdt
, newstroffset
);
351 /* Walk the structure, correcting string offsets */
353 while ((tag
= fdt_next_tag (fdt
, offset
, &nextoffset
)) != FDT_END
) {
354 if (tag
== FDT_PROP
) {
355 struct fdt_property
*prop
=
356 _fdt_offset_ptr_w (fdt
, offset
);
359 nameoff
= fdt32_to_cpu (prop
->nameoff
);
360 nameoff
+= fdt_size_dt_strings (fdt
);
361 prop
->nameoff
= cpu_to_fdt32 (nameoff
);
367 if (nextoffset
< 0) {
371 /* Finally, adjust the header */
372 fdt_set_totalsize (fdt
, newstroffset
+ fdt_size_dt_strings (fdt
));
373 fdt_set_magic (fdt
, FDT_MAGIC
);