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
#include <mem_region-malloc.h>
60
static int _fdt_sw_check_header(void *fdt)
62
if (fdt_magic(fdt) != FDT_SW_MAGIC)
63
return -FDT_ERR_BADMAGIC;
64
/* FIXME: should check more details about the header state */
68
#define FDT_SW_CHECK_HEADER(fdt) \
71
if ((err = _fdt_sw_check_header(fdt)) != 0) \
75
static void *_fdt_grab_space(void *fdt, size_t len)
77
int offset = fdt_size_dt_struct(fdt);
80
spaceleft = fdt_totalsize(fdt) - fdt_off_dt_struct(fdt)
81
- fdt_size_dt_strings(fdt);
83
if ((offset + len < offset) || (offset + len > spaceleft))
86
fdt_set_size_dt_struct(fdt, offset + len);
87
return _fdt_offset_ptr_w(fdt, offset);
90
int fdt_create(void *buf, int bufsize)
94
if (bufsize < sizeof(struct fdt_header))
95
return -FDT_ERR_NOSPACE;
97
memset(buf, 0, bufsize);
99
fdt_set_magic(fdt, FDT_SW_MAGIC);
100
fdt_set_version(fdt, FDT_LAST_SUPPORTED_VERSION);
101
fdt_set_last_comp_version(fdt, FDT_FIRST_SUPPORTED_VERSION);
102
fdt_set_totalsize(fdt, bufsize);
104
fdt_set_off_mem_rsvmap(fdt, FDT_ALIGN(sizeof(struct fdt_header),
105
sizeof(struct fdt_reserve_entry)));
106
fdt_set_off_dt_struct(fdt, fdt_off_mem_rsvmap(fdt));
107
fdt_set_off_dt_strings(fdt, bufsize);
112
int fdt_add_reservemap_entry(void *fdt, uint64_t addr, uint64_t size)
114
struct fdt_reserve_entry *re;
117
FDT_SW_CHECK_HEADER(fdt);
119
if (fdt_size_dt_struct(fdt))
120
return -FDT_ERR_BADSTATE;
122
offset = fdt_off_dt_struct(fdt);
123
if ((offset + sizeof(*re)) > fdt_totalsize(fdt))
124
return -FDT_ERR_NOSPACE;
126
re = (struct fdt_reserve_entry *)((char *)fdt + offset);
127
re->address = cpu_to_fdt64(addr);
128
re->size = cpu_to_fdt64(size);
130
fdt_set_off_dt_struct(fdt, offset + sizeof(*re));
135
int fdt_finish_reservemap(void *fdt)
137
return fdt_add_reservemap_entry(fdt, 0, 0);
140
int fdt_begin_node(void *fdt, const char *name)
142
struct fdt_node_header *nh;
143
int namelen = strlen(name) + 1;
145
FDT_SW_CHECK_HEADER(fdt);
147
nh = _fdt_grab_space(fdt, sizeof(*nh) + FDT_TAGALIGN(namelen));
149
return -FDT_ERR_NOSPACE;
151
nh->tag = cpu_to_fdt32(FDT_BEGIN_NODE);
152
memcpy(nh->name, name, namelen);
156
int fdt_end_node(void *fdt)
160
FDT_SW_CHECK_HEADER(fdt);
162
en = _fdt_grab_space(fdt, FDT_TAGSIZE);
164
return -FDT_ERR_NOSPACE;
166
*en = cpu_to_fdt32(FDT_END_NODE);
170
static int _fdt_find_add_string(void *fdt, const char *s)
172
char *strtab = (char *)fdt + fdt_totalsize(fdt);
174
int strtabsize = fdt_size_dt_strings(fdt);
175
int len = strlen(s) + 1;
176
int struct_top, offset;
178
p = _fdt_find_string(strtab - strtabsize, strtabsize, s);
183
offset = -strtabsize - len;
184
struct_top = fdt_off_dt_struct(fdt) + fdt_size_dt_struct(fdt);
185
if (fdt_totalsize(fdt) + offset < struct_top)
186
return 0; /* no more room :( */
188
memcpy(strtab + offset, s, len);
189
fdt_set_size_dt_strings(fdt, strtabsize + len);
193
int fdt_property(void *fdt, const char *name, const void *val, int len)
195
struct fdt_property *prop;
198
FDT_SW_CHECK_HEADER(fdt);
200
nameoff = _fdt_find_add_string(fdt, name);
202
return -FDT_ERR_NOSPACE;
204
prop = _fdt_grab_space(fdt, sizeof(*prop) + FDT_TAGALIGN(len));
206
return -FDT_ERR_NOSPACE;
208
prop->tag = cpu_to_fdt32(FDT_PROP);
209
prop->nameoff = cpu_to_fdt32(nameoff);
210
prop->len = cpu_to_fdt32(len);
211
memcpy(prop->data, val, len);
215
int fdt_property_cells_v(void *fdt, unsigned const char *name, int count,
221
buffer = (uint32_t*)malloc(sizeof(uint32_t)*count);
224
for (i = 0; i < count; i++)
225
buffer[i] = cpu_to_fdt32(va_arg(args, uint32_t));
227
return fdt_property(fdt, name, buffer, sizeof(uint32_t)*count);
230
int fdt_property_cells(void *fdt, unsigned const char *name, int count, ...)
235
va_start(args, count);
236
ret = fdt_property_cells_v(fdt, name, count, args);
242
int fdt_finish(void *fdt)
244
char *p = (char *)fdt;
246
int oldstroffset, newstroffset;
248
int offset, nextoffset;
250
FDT_SW_CHECK_HEADER(fdt);
253
end = _fdt_grab_space(fdt, sizeof(*end));
255
return -FDT_ERR_NOSPACE;
256
*end = cpu_to_fdt32(FDT_END);
258
/* Relocate the string table */
259
oldstroffset = fdt_totalsize(fdt) - fdt_size_dt_strings(fdt);
260
newstroffset = fdt_off_dt_struct(fdt) + fdt_size_dt_struct(fdt);
261
memmove(p + newstroffset, p + oldstroffset, fdt_size_dt_strings(fdt));
262
fdt_set_off_dt_strings(fdt, newstroffset);
264
/* Walk the structure, correcting string offsets */
266
while ((tag = fdt_next_tag(fdt, offset, &nextoffset)) != FDT_END) {
267
if (tag == FDT_PROP) {
268
struct fdt_property *prop =
269
_fdt_offset_ptr_w(fdt, offset);
272
nameoff = fdt32_to_cpu(prop->nameoff);
273
nameoff += fdt_size_dt_strings(fdt);
274
prop->nameoff = cpu_to_fdt32(nameoff);
281
/* Finally, adjust the header */
282
fdt_set_totalsize(fdt, newstroffset + fdt_size_dt_strings(fdt));
283
fdt_set_magic(fdt, FDT_MAGIC);