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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
static uint32_t be32(const void *p)
{
const uint8_t *b = p;
return ((uint32_t)b[0] << 24) | ((uint32_t)b[1] << 16) |
((uint32_t)b[2] << 8) | (uint32_t)b[3];
}
static void put_be32(void *p, uint32_t v)
{
uint8_t *b = p;
b[0] = (uint8_t)(v >> 24);
b[1] = (uint8_t)(v >> 16);
b[2] = (uint8_t)(v >> 8);
b[3] = (uint8_t)v;
}
static void put_be64(void *p, uint64_t v)
{
uint8_t *b = p;
b[0] = (uint8_t)(v >> 56);
b[1] = (uint8_t)(v >> 48);
b[2] = (uint8_t)(v >> 40);
b[3] = (uint8_t)(v >> 32);
b[4] = (uint8_t)(v >> 24);
b[5] = (uint8_t)(v >> 16);
b[6] = (uint8_t)(v >> 8);
b[7] = (uint8_t)v;
}
static int name_eq(const char *node, const char *want)
{
while (*node && *node != '@') {
if (*node != *want)
return 0;
node++;
want++;
}
return *want == '\0';
}
int tb_dtb_patch_memory(uintptr_t dtb, uint64_t base, uint64_t size)
{
uint8_t *basep = (uint8_t *)dtb;
uint32_t off_struct = be32(basep + 8);
uint32_t off_strings = be32(basep + 12);
uint8_t *p = basep + off_struct;
uint8_t *strings = basep + off_strings;
const char *cur_node = NULL;
int depth = 0;
if (be32(basep) != 0xd00dfeed)
return -1;
while (p < basep + be32(basep + 4)) {
uint32_t token = be32(p);
switch (token) {
case FDT_BEGIN_NODE: {
char *name = (char *)(p + 4);
size_t len = strlen(name) + 1;
p += 4 + ((len + 3) & ~3);
depth++;
cur_node = name;
break;
}
case FDT_END_NODE:
depth--;
p += 4;
break;
case FDT_PROP: {
uint32_t plen = be32(p + 4);
const char *pname = (char *)strings + be32(p + 8);
uint8_t *val = p + 12;
p += 12 + ((plen + 3) & ~3);
if (depth == 2 && name_eq(cur_node, "memory") &&
strcmp(pname, "reg") == 0 && plen >= 16) {
put_be32(val, (uint32_t)(base >> 32));
put_be32(val + 4, (uint32_t)base);
put_be32(val + 8, (uint32_t)(size >> 32));
put_be32(val + 12, (uint32_t)size);
return 0;
}
break;
}
case FDT_NOP:
p += 4;
break;
case FDT_END:
return -2;
}
}
return -3;
}
int tb_dtb_patch_spin_table(uintptr_t dtb, uintptr_t *gates, int ngates)
{
uint8_t *base = (uint8_t *)dtb;
uint32_t off_struct = be32(base + 8);
uint32_t off_strings = be32(base + 12);
uint8_t *p = base + off_struct;
uint8_t *strings = base + off_strings;
const char *cur_cpu = NULL;
int in_cpus = 0;
int written = 0;
int depth = 0;
if (be32(base) != 0xd00dfeed)
return -1;
while (p < base + be32(base + 4)) {
uint32_t token = be32(p);
switch (token) {
case FDT_BEGIN_NODE: {
char *name = (char *)(p + 4);
size_t len = strlen(name) + 1;
p += 4 + ((len + 3) & ~3);
depth++;
if (depth == 2 && name_eq(name, "cpus")) {
in_cpus = 1;
} else if (depth == 2) {
in_cpus = 0;
} else if (in_cpus && depth == 3) {
cur_cpu = name;
}
break;
}
case FDT_END_NODE:
depth--;
p += 4;
break;
case FDT_PROP: {
uint32_t plen = be32(p + 4);
const char *pname = (char *)strings + be32(p + 8);
uint8_t *val = p + 12;
p += 12 + ((plen + 3) & ~3);
if (in_cpus && depth == 3 &&
strcmp(pname, "cpu-release-addr") == 0 &&
plen == 8 && cur_cpu) {
long idx = -1;
const char *at = strchr(cur_cpu, '@');
if (at) {
idx = 0;
while (*at >= '0' && *at <= '9') {
at++;
}
at = strchr(cur_cpu, '@') + 1;
while (*at >= '0' && *at <= '9') {
idx = idx * 10 + (*at - '0');
at++;
}
}
if (idx >= 0 && idx < ngates) {
put_be64(val, (uint64_t)gates[idx]);
written++;
}
}
break;
}
case FDT_NOP:
p += 4;
break;
case FDT_END:
return written;
}
}
return written;
}
int tb_dtb_patch_initrd(uintptr_t dtb, uint64_t start, uint64_t end)
{
uint8_t *basep = (uint8_t *)dtb;
uint32_t off_struct = be32(basep + 8);
uint32_t off_strings = be32(basep + 12);
uint8_t *p = basep + off_struct;
uint8_t *strings = basep + off_strings;
const char *cur_node = NULL;
int depth = 0;
if (be32(basep) != 0xd00dfeed)
return -1;
while (p < basep + be32(basep + 4)) {
uint32_t token = be32(p);
switch (token) {
case FDT_BEGIN_NODE: {
char *name = (char *)(p + 4);
size_t len = strlen(name) + 1;
p += 4 + ((len + 3) & ~3);
depth++;
cur_node = name;
break;
}
case FDT_END_NODE:
depth--;
p += 4;
break;
case FDT_PROP: {
uint32_t plen = be32(p + 4);
const char *pname = (char *)strings + be32(p + 8);
uint8_t *val = p + 12;
p += 12 + ((plen + 3) & ~3);
if (depth == 2 && name_eq(cur_node, "chosen") &&
strcmp(pname, "linux,initrd-start") == 0 &&
plen >= 8) {
put_be64(val, start);
}
if (depth == 2 && name_eq(cur_node, "chosen") &&
strcmp(pname, "linux,initrd-end") == 0 &&
plen >= 8) {
put_be64(val, end);
return 0;
}
break;
}
case FDT_NOP:
p += 4;
break;
case FDT_END:
return -2;
}
}
return -2;
}
|