-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathfast_gcc_unwind.cpp
More file actions
459 lines (417 loc) · 12.8 KB
/
fast_gcc_unwind.cpp
File metadata and controls
459 lines (417 loc) · 12.8 KB
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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
#include <atomic>
#include <unwind.h>
#include <algorithm>
#include <bit>
#include <cstdint>
#include <cstdlib>
#include <span>
#include <platform.hpp>
/* Misc constants. */
#define R_IP 12
#define R_SP 13
#define R_LR 14
#define R_PC 15
struct core_regs
{
std::uint32_t r[16];
};
/* We use normal integer types here to avoid the compiler generating
coprocessor instructions. */
struct vfp_regs
{
std::uint64_t d[16];
std::uint32_t pad;
};
struct vfpv3_regs
{
/* Always populated via VSTM, so no need for the "pad" field from
vfp_regs (which is used to store the format word for FSTMX). */
std::uint64_t d[16];
};
struct wmmxd_regs
{
std::uint64_t wd[16];
};
struct wmmxc_regs
{
std::uint32_t wc[4];
};
/* The ABI specifies that the unwind routines may only use core registers,
except when actually manipulating coprocessor state. This allows
us to write one implementation that works on all platforms by
demand-saving coprocessor registers.
During unwinding we hold the coprocessor state in the actual hardware
registers and allocate demand-save areas for use during phase1
unwinding. */
struct phase1_vrs
{
/* The first fields must be the same as a phase2_vrs. */
std::uint32_t demand_save_flags;
struct core_regs core;
std::uint32_t prev_sp; /* Only valid during forced unwinding. */
struct vfp_regs vfp;
struct vfpv3_regs vfp_regs_16_to_31;
struct wmmxd_regs wmmxd;
struct wmmxc_regs wmmxc;
};
/* This must match the structure created by the assembly wrappers. */
struct phase2_vrs
{
std::uint32_t demand_save_flags;
struct core_regs core;
};
typedef struct __EIT_entry
{
std::uint32_t fnoffset;
std::uint32_t content;
} __EIT_entry;
std::uintptr_t selfrel_offset31(std::uint32_t const* p)
{
auto offset = static_cast<std::int32_t>(*p);
/* Sign extend to 32 bits. */
offset <<= 1;
offset >>= 1;
return std::bit_cast<std::uintptr_t>(offset +
std::bit_cast<std::intptr_t>(p));
}
/* Return the next byte of unwinding information, or CODE_FINISH if there is
no data remaining. */
[[gnu::always_inline]] _uw8 next_unwind_byte(__gnu_unwind_state* uws)
{
_uw8 b;
if (uws->bytes_left == 0) {
/* Load another word */
if (uws->words_left == 0)
return 0xB0; /* Nothing left. */
uws->words_left--;
uws->data = *(uws->next++);
uws->bytes_left = 3;
} else
uws->bytes_left--;
/* Extract the most significant byte. */
b = (uws->data >> 24) & 0xff;
uws->data <<= 8;
return b;
}
[[gnu::always_inline]] _Unwind_VRS_Result _My_Unwind_VRS_Get(
_Unwind_Context* context,
_Unwind_VRS_RegClass,
_uw regno,
_Unwind_VRS_DataRepresentation,
void* valuep)
{
auto* vrs = reinterpret_cast<phase1_vrs*>(context);
*(_uw*)valuep = vrs->core.r[regno];
return _UVRSR_OK;
}
/* ABI defined function to load a virtual register from memory. */
[[gnu::always_inline]] _Unwind_VRS_Result _My_Unwind_VRS_Set(
_Unwind_Context* context,
_Unwind_VRS_RegClass,
_uw regno,
_Unwind_VRS_DataRepresentation,
void* valuep)
{
auto* vrs = reinterpret_cast<phase1_vrs*>(context);
vrs->core.r[regno] = *(_uw*)valuep;
return _UVRSR_OK;
}
extern "C"
{
[[gnu::always_inline]] _Unwind_VRS_Result __wrap__Unwind_VRS_Pop(
_Unwind_Context* context,
_Unwind_VRS_RegClass regclass,
_uw discriminator,
_Unwind_VRS_DataRepresentation)
{
auto* vrs = reinterpret_cast<phase1_vrs*>(context);
switch (regclass) {
case _UVRSC_CORE: {
std::uint32_t mask = discriminator & 0xffff;
// The mask may not demand that the stack pointer be popped, but the
// stack pointer will still need to be popped anyway, so this check
// determines if the mask handles this or not.
bool set_stack_pointer_afterwards = (mask & R_SP) == 0x0;
std::uint32_t* ptr = // NOTLINTNEXTLINE
reinterpret_cast<std::uint32_t*>(vrs->core.r[R_SP]);
/* Pop the requested registers. */
while (mask) {
auto reg_to_restore = std::countr_zero(mask);
mask &= ~(1 << reg_to_restore);
vrs->core.r[reg_to_restore] = *(ptr++);
}
if (set_stack_pointer_afterwards) {
vrs->core.r[R_SP] = reinterpret_cast<std::uint32_t>(ptr);
}
}
return _UVRSR_OK;
case _UVRSC_VFP:
return _UVRSR_OK;
case _UVRSC_WMMXD:
return _UVRSR_OK;
case _UVRSC_WMMXC:
return _UVRSR_OK;
default:
return _UVRSR_FAILED;
}
}
/* Execute the unwinding instructions described by UWS. */
_Unwind_Reason_Code __wrap___gnu_unwind_execute(_Unwind_Context* context,
__gnu_unwind_state* uws)
{
_uw op;
int set_pc;
_uw reg;
set_pc = 0;
for (;;) {
op = next_unwind_byte(uws);
if (op == 0xb0) {
/* If we haven't already set pc then copy it from lr. */
if (!set_pc) {
_My_Unwind_VRS_Get(context, _UVRSC_CORE, R_LR, _UVRSD_UINT32, ®);
_My_Unwind_VRS_Set(context, _UVRSC_CORE, R_PC, _UVRSD_UINT32, ®);
set_pc = 1;
}
/* Drop out of the loop. */
break;
}
if ((op & 0x80) == 0) {
/* vsp = vsp +- (imm6 << 2 + 4). */
_uw offset;
offset = ((op & 0x3f) << 2) + 4;
_My_Unwind_VRS_Get(context, _UVRSC_CORE, R_SP, _UVRSD_UINT32, ®);
if (op & 0x40)
reg -= offset;
else
reg += offset;
_My_Unwind_VRS_Set(context, _UVRSC_CORE, R_SP, _UVRSD_UINT32, ®);
continue;
}
if ((op & 0xf0) == 0x80) {
op = (op << 8) | next_unwind_byte(uws);
if (op == 0x8000) {
/* Refuse to unwind. */
return _URC_FAILURE;
}
/* Pop r4-r15 under mask. */
op = (op << 4) & 0xfff0;
if (_Unwind_VRS_Pop(context, _UVRSC_CORE, op, _UVRSD_UINT32) !=
_UVRSR_OK)
return _URC_FAILURE;
if (op & (1 << R_PC))
set_pc = 1;
continue;
}
if ((op & 0xf0) == 0x90) {
op &= 0xf;
if (op == 13 || op == 15)
/* Reserved. */
return _URC_FAILURE;
/* vsp = r[nnnn]. */
_My_Unwind_VRS_Get(context, _UVRSC_CORE, op, _UVRSD_UINT32, ®);
_My_Unwind_VRS_Set(context, _UVRSC_CORE, R_SP, _UVRSD_UINT32, ®);
continue;
}
if ((op & 0xf0) == 0xa0) {
/* Pop r4-r[4+nnn], [lr]. */
_uw mask;
mask = (0xff0 >> (7 - (op & 7))) & 0xff0;
if (op & 8)
mask |= (1 << R_LR);
if (_Unwind_VRS_Pop(context, _UVRSC_CORE, mask, _UVRSD_UINT32) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
if ((op & 0xf0) == 0xb0) {
/* op == 0xb0 already handled. */
if (op == 0xb1) {
op = next_unwind_byte(uws);
if (op == 0 || ((op & 0xf0) != 0))
/* Spare. */
return _URC_FAILURE;
/* Pop r0-r4 under mask. */
if (_Unwind_VRS_Pop(context, _UVRSC_CORE, op, _UVRSD_UINT32) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
if (op == 0xb2) {
/* vsp = vsp + 0x204 + (uleb128 << 2). */
int shift;
_My_Unwind_VRS_Get(context, _UVRSC_CORE, R_SP, _UVRSD_UINT32, ®);
op = next_unwind_byte(uws);
shift = 2;
while (op & 0x80) {
reg += ((op & 0x7f) << shift);
shift += 7;
op = next_unwind_byte(uws);
}
reg += ((op & 0x7f) << shift) + 0x204;
_My_Unwind_VRS_Set(context, _UVRSC_CORE, R_SP, _UVRSD_UINT32, ®);
continue;
}
if (op == 0xb3) {
/* Pop VFP registers with fldmx. */
op = next_unwind_byte(uws);
op = ((op & 0xf0) << 12) | ((op & 0xf) + 1);
if (_Unwind_VRS_Pop(context, _UVRSC_VFP, op, _UVRSD_VFPX) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
if ((op & 0xfc) == 0xb4) /* Obsolete FPA. */
return _URC_FAILURE;
/* op & 0xf8 == 0xb8. */
/* Pop VFP D[8]-D[8+nnn] with fldmx. */
op = 0x80000 | ((op & 7) + 1);
if (_Unwind_VRS_Pop(context, _UVRSC_VFP, op, _UVRSD_VFPX) != _UVRSR_OK)
return _URC_FAILURE;
continue;
}
if ((op & 0xf0) == 0xc0) {
if (op == 0xc6) {
/* Pop iWMMXt D registers. */
op = next_unwind_byte(uws);
op = ((op & 0xf0) << 12) | ((op & 0xf) + 1);
if (_Unwind_VRS_Pop(context, _UVRSC_WMMXD, op, _UVRSD_UINT64) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
if (op == 0xc7) {
op = next_unwind_byte(uws);
if (op == 0 || (op & 0xf0) != 0)
/* Spare. */
return _URC_FAILURE;
/* Pop iWMMXt wCGR{3,2,1,0} under mask. */
if (_Unwind_VRS_Pop(context, _UVRSC_WMMXC, op, _UVRSD_UINT32) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
if ((op & 0xf8) == 0xc0) {
/* Pop iWMMXt wR[10]-wR[10+nnn]. */
op = 0xa0000 | ((op & 0xf) + 1);
if (_Unwind_VRS_Pop(context, _UVRSC_WMMXD, op, _UVRSD_UINT64) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
if (op == 0xc8) {
/* Pop VFPv3 registers D[16+ssss]-D[16+ssss+cccc] with vldm. */
op = next_unwind_byte(uws);
op = (((op & 0xf0) + 16) << 12) | ((op & 0xf) + 1);
if (_Unwind_VRS_Pop(context, _UVRSC_VFP, op, _UVRSD_DOUBLE) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
if (op == 0xc9) {
/* Pop VFP registers with fldmd. */
op = next_unwind_byte(uws);
op = ((op & 0xf0) << 12) | ((op & 0xf) + 1);
if (_Unwind_VRS_Pop(context, _UVRSC_VFP, op, _UVRSD_DOUBLE) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
/* Spare. */
return _URC_FAILURE;
}
if ((op & 0xf8) == 0xd0) {
/* Pop VFP D[8]-D[8+nnn] with fldmd. */
op = 0x80000 | ((op & 7) + 1);
if (_Unwind_VRS_Pop(context, _UVRSC_VFP, op, _UVRSD_DOUBLE) !=
_UVRSR_OK)
return _URC_FAILURE;
continue;
}
/* Spare. */
return _URC_FAILURE;
}
return _URC_OK;
}
[[gnu::used]]
_Unwind_Reason_Code __wrap___gnu_unwind_frame(_Unwind_Control_Block* ucbp,
_Unwind_Context* context)
{
_uw* ptr;
__gnu_unwind_state uws;
ptr = (_uw*)ucbp->pr_cache.ehtp;
/* Skip over the personality routine address. */
ptr++;
/* Setup the unwinder state. */
uws.data = (*ptr) << 8;
uws.next = ptr + 1;
uws.bytes_left = 3;
uws.words_left = ((*ptr) >> 24) & 0xff;
return __wrap___gnu_unwind_execute(context, &uws);
}
struct eit_entry_less_than
{
bool operator()(__EIT_entry const& left, __EIT_entry const& right)
{
return selfrel_offset31(&left.fnoffset) <
selfrel_offset31(&right.fnoffset);
}
bool operator()(__EIT_entry const& left, std::uint32_t right)
{
return selfrel_offset31(&left.fnoffset) < right;
}
bool operator()(std::uint32_t left, __EIT_entry const& right)
{
return left < selfrel_offset31(&right.fnoffset);
}
bool operator()(std::uint32_t left, std::uint32_t right)
{
return left < right;
}
};
#if 1
__EIT_entry const* search_EIT_table(__EIT_entry const* table, // NOLINT
int nrec, // NOLINT
std::uint32_t return_address)
{
if (nrec == 0) {
return nullptr;
}
auto const& next_entry = std::ranges::upper_bound(
std::span(table, nrec), return_address, eit_entry_less_than{});
auto const& actual_entry = *(next_entry - 1);
return &actual_entry;
}
#else
__EIT_entry const* search_EIT_table(__EIT_entry const* table, // NOLINT
int nrec, // NOLINT
_uw return_address)
{
_uw next_fn;
_uw this_fn;
int n, left, right;
if (nrec == 0)
return (__EIT_entry*)0;
left = 0;
right = nrec - 1;
while (1) {
n = (left + right) / 2;
this_fn = selfrel_offset31(&table[n].fnoffset);
if (n != nrec - 1) {
next_fn = selfrel_offset31(&table[n + 1].fnoffset) - 1;
} else {
next_fn = (_uw)0 - 1;
}
if (return_address < this_fn) {
if (n == left) {
return (__EIT_entry*)0;
}
right = n - 1;
} else if (return_address <= next_fn) {
return &table[n];
} else {
left = n + 1;
}
}
}
#endif
}