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
int fdt_check_header(const void *fdt)
60
if (fdt_magic(fdt) == FDT_MAGIC) {
62
if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION)
63
return -FDT_ERR_BADVERSION;
64
if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION)
65
return -FDT_ERR_BADVERSION;
66
} else if (fdt_magic(fdt) == SW_MAGIC) {
67
/* Unfinished sequential-write blob */
68
if (fdt_size_dt_struct(fdt) == 0)
69
return -FDT_ERR_BADSTATE;
71
return -FDT_ERR_BADMAGIC;
77
const void *fdt_offset_ptr(const void *fdt, int offset, int len)
81
if (fdt_version(fdt) >= 0x11)
82
if (((offset + len) < offset)
83
|| ((offset + len) > fdt_size_dt_struct(fdt)))
86
p = _fdt_offset_ptr(fdt, offset);
93
uint32_t fdt_next_tag(const void *fdt, int offset, int *nextoffset)
95
const uint32_t *tagp, *lenp;
99
if (offset % FDT_TAGSIZE)
102
tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE);
104
return FDT_END; /* premature end */
105
tag = fdt32_to_cpu(*tagp);
106
offset += FDT_TAGSIZE;
112
p = fdt_offset_ptr(fdt, offset++, 1);
113
} while (p && (*p != '\0'));
118
lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp));
121
/* skip name offset, length and value */
122
offset += 2*FDT_TAGSIZE + fdt32_to_cpu(*lenp);
127
*nextoffset = ALIGN(offset, FDT_TAGSIZE);
132
int fdt_next_node(const void *fdt, int offset, int *depth)
138
tag = fdt_next_tag(fdt, offset, &nextoffset);
139
if (tag != FDT_BEGIN_NODE)
140
return -FDT_ERR_BADOFFSET;
145
tag = fdt_next_tag(fdt, offset, &nextoffset);
163
return -FDT_ERR_NOTFOUND;
166
return -FDT_ERR_BADSTRUCTURE;
168
} while (tag != FDT_BEGIN_NODE);
173
const char *_fdt_find_string(const char *strtab, int tabsize, const char *s)
175
int len = strlen(s) + 1;
176
const char *last = strtab + tabsize - len;
179
for (p = strtab; p <= last; p++)
180
if (memeq(p, s, len))
185
int fdt_move(const void *fdt, void *buf, int bufsize)
189
if (fdt_totalsize(fdt) > bufsize)
190
return -FDT_ERR_NOSPACE;
192
memmove(buf, fdt, fdt_totalsize(fdt));