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#include <fdt.h>
54#include <libfdt.h>
55
56#include "libfdt_internal.h"
57
58int fdt_check_header(const void *fdt)
59{
60 if (fdt_magic(fdt) == FDT_MAGIC) {
61
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) == FDT_SW_MAGIC) {
67
68 if (fdt_size_dt_struct(fdt) == 0)
69 return -FDT_ERR_BADSTATE;
70 } else {
71 return -FDT_ERR_BADMAGIC;
72 }
73
74 return 0;
75}
76
77const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int len)
78{
79 const char *p;
80
81 if (fdt_version(fdt) >= 0x11)
82 if (((offset + len) < offset)
83 || ((offset + len) > fdt_size_dt_struct(fdt)))
84 return NULL;
85
86 p = _fdt_offset_ptr(fdt, offset);
87
88 if (p + len < p)
89 return NULL;
90 return p;
91}
92
93uint32_t fdt_next_tag(const void *fdt, int startoffset, int *nextoffset)
94{
95 const uint32_t *tagp, *lenp;
96 uint32_t tag;
97 int offset = startoffset;
98 const char *p;
99
100 *nextoffset = -FDT_ERR_TRUNCATED;
101 tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE);
102 if (!tagp)
103 return FDT_END;
104 tag = fdt32_to_cpu(*tagp);
105 offset += FDT_TAGSIZE;
106
107 *nextoffset = -FDT_ERR_BADSTRUCTURE;
108 switch (tag) {
109 case FDT_BEGIN_NODE:
110
111 do {
112 p = fdt_offset_ptr(fdt, offset++, 1);
113 } while (p && (*p != '\0'));
114 if (!p)
115 return FDT_END;
116 break;
117
118 case FDT_PROP:
119 lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp));
120 if (!lenp)
121 return FDT_END;
122
123 offset += sizeof(struct fdt_property) - FDT_TAGSIZE
124 + fdt32_to_cpu(*lenp);
125 break;
126
127 case FDT_END:
128 case FDT_END_NODE:
129 case FDT_NOP:
130 break;
131
132 default:
133 return FDT_END;
134 }
135
136 if (!fdt_offset_ptr(fdt, startoffset, offset - startoffset))
137 return FDT_END;
138
139 *nextoffset = FDT_TAGALIGN(offset);
140 return tag;
141}
142
143int _fdt_check_node_offset(const void *fdt, int offset)
144{
145 if ((offset < 0) || (offset % FDT_TAGSIZE)
146 || (fdt_next_tag(fdt, offset, &offset) != FDT_BEGIN_NODE))
147 return -FDT_ERR_BADOFFSET;
148
149 return offset;
150}
151
152int _fdt_check_prop_offset(const void *fdt, int offset)
153{
154 if ((offset < 0) || (offset % FDT_TAGSIZE)
155 || (fdt_next_tag(fdt, offset, &offset) != FDT_PROP))
156 return -FDT_ERR_BADOFFSET;
157
158 return offset;
159}
160
161int fdt_next_node(const void *fdt, int offset, int *depth)
162{
163 int nextoffset = 0;
164 uint32_t tag;
165
166 if (offset >= 0)
167 if ((nextoffset = _fdt_check_node_offset(fdt, offset)) < 0)
168 return nextoffset;
169
170 do {
171 offset = nextoffset;
172 tag = fdt_next_tag(fdt, offset, &nextoffset);
173
174 switch (tag) {
175 case FDT_PROP:
176 case FDT_NOP:
177 break;
178
179 case FDT_BEGIN_NODE:
180 if (depth)
181 (*depth)++;
182 break;
183
184 case FDT_END_NODE:
185 if (depth && ((--(*depth)) < 0))
186 return nextoffset;
187 break;
188
189 case FDT_END:
190 if ((nextoffset >= 0)
191 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))
192 return -FDT_ERR_NOTFOUND;
193 else
194 return nextoffset;
195 }
196 } while (tag != FDT_BEGIN_NODE);
197
198 return offset;
199}
200
201const char *_fdt_find_string(const char *strtab, int tabsize, const char *s)
202{
203 int len = strlen(s) + 1;
204 const char *last = strtab + tabsize - len;
205 const char *p;
206
207 for (p = strtab; p <= last; p++)
208 if (memcmp(p, s, len) == 0)
209 return p;
210 return NULL;
211}
212
213int fdt_move(const void *fdt, void *buf, int bufsize)
214{
215 FDT_CHECK_HEADER(fdt);
216
217 if (fdt_totalsize(fdt) > bufsize)
218 return -FDT_ERR_NOSPACE;
219
220 memmove(buf, fdt, fdt_totalsize(fdt));
221 return 0;
222}
223