1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51#include "libfdt_env.h"
52
53#ifndef USE_HOSTCC
54#include <fdt.h>
55#include <libfdt.h>
56#else
57#include "fdt_host.h"
58#endif
59
60#include "libfdt_internal.h"
61
62int fdt_check_header(const void *fdt)
63{
64 if (fdt_magic(fdt) == FDT_MAGIC) {
65
66 if (fdt_version(fdt) < FDT_FIRST_SUPPORTED_VERSION)
67 return -FDT_ERR_BADVERSION;
68 if (fdt_last_comp_version(fdt) > FDT_LAST_SUPPORTED_VERSION)
69 return -FDT_ERR_BADVERSION;
70 } else if (fdt_magic(fdt) == FDT_SW_MAGIC) {
71
72 if (fdt_size_dt_struct(fdt) == 0)
73 return -FDT_ERR_BADSTATE;
74 } else {
75 return -FDT_ERR_BADMAGIC;
76 }
77
78 return 0;
79}
80
81const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int len)
82{
83 const char *p;
84
85 if (fdt_version(fdt) >= 0x11)
86 if (((offset + len) < offset)
87 || ((offset + len) > fdt_size_dt_struct(fdt)))
88 return NULL;
89
90 p = _fdt_offset_ptr(fdt, offset);
91
92 if (p + len < p)
93 return NULL;
94 return p;
95}
96
97uint32_t fdt_next_tag(const void *fdt, int startoffset, int *nextoffset)
98{
99 const fdt32_t *tagp, *lenp;
100 uint32_t tag;
101 int offset = startoffset;
102 const char *p;
103
104 *nextoffset = -FDT_ERR_TRUNCATED;
105 tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE);
106 if (!tagp)
107 return FDT_END;
108 tag = fdt32_to_cpu(*tagp);
109 offset += FDT_TAGSIZE;
110
111 *nextoffset = -FDT_ERR_BADSTRUCTURE;
112 switch (tag) {
113 case FDT_BEGIN_NODE:
114
115 do {
116 p = fdt_offset_ptr(fdt, offset++, 1);
117 } while (p && (*p != '\0'));
118 if (!p)
119 return FDT_END;
120 break;
121
122 case FDT_PROP:
123 lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp));
124 if (!lenp)
125 return FDT_END;
126
127 offset += sizeof(struct fdt_property) - FDT_TAGSIZE
128 + fdt32_to_cpu(*lenp);
129 break;
130
131 case FDT_END:
132 case FDT_END_NODE:
133 case FDT_NOP:
134 break;
135
136 default:
137 return FDT_END;
138 }
139
140 if (!fdt_offset_ptr(fdt, startoffset, offset - startoffset))
141 return FDT_END;
142
143 *nextoffset = FDT_TAGALIGN(offset);
144 return tag;
145}
146
147int _fdt_check_node_offset(const void *fdt, int offset)
148{
149 if ((offset < 0) || (offset % FDT_TAGSIZE)
150 || (fdt_next_tag(fdt, offset, &offset) != FDT_BEGIN_NODE))
151 return -FDT_ERR_BADOFFSET;
152
153 return offset;
154}
155
156int _fdt_check_prop_offset(const void *fdt, int offset)
157{
158 if ((offset < 0) || (offset % FDT_TAGSIZE)
159 || (fdt_next_tag(fdt, offset, &offset) != FDT_PROP))
160 return -FDT_ERR_BADOFFSET;
161
162 return offset;
163}
164
165int fdt_next_node(const void *fdt, int offset, int *depth)
166{
167 int nextoffset = 0;
168 uint32_t tag;
169
170 if (offset >= 0)
171 if ((nextoffset = _fdt_check_node_offset(fdt, offset)) < 0)
172 return nextoffset;
173
174 do {
175 offset = nextoffset;
176 tag = fdt_next_tag(fdt, offset, &nextoffset);
177
178 switch (tag) {
179 case FDT_PROP:
180 case FDT_NOP:
181 break;
182
183 case FDT_BEGIN_NODE:
184 if (depth)
185 (*depth)++;
186 break;
187
188 case FDT_END_NODE:
189 if (depth && ((--(*depth)) < 0))
190 return nextoffset;
191 break;
192
193 case FDT_END:
194 if ((nextoffset >= 0)
195 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))
196 return -FDT_ERR_NOTFOUND;
197 else
198 return nextoffset;
199 }
200 } while (tag != FDT_BEGIN_NODE);
201
202 return offset;
203}
204
205const char *_fdt_find_string(const char *strtab, int tabsize, const char *s)
206{
207 int len = strlen(s) + 1;
208 const char *last = strtab + tabsize - len;
209 const char *p;
210
211 for (p = strtab; p <= last; p++)
212 if (memcmp(p, s, len) == 0)
213 return p;
214 return NULL;
215}
216
217int fdt_move(const void *fdt, void *buf, int bufsize)
218{
219 FDT_CHECK_HEADER(fdt);
220
221 if (fdt_totalsize(fdt) > bufsize)
222 return -FDT_ERR_NOSPACE;
223
224 memmove(buf, fdt, fdt_totalsize(fdt));
225 return 0;
226}
227