blob: 1d35b228c408f1053a062061be0caa7e0cc10a03 [file] [log] [blame]
Saleem Abdulrasool17552662015-04-24 19:39:17 +00001//===-------------------------- DwarfInstructions.hpp ---------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
7//
8//
Ed Maste4c43c3d2016-07-19 17:15:50 +00009// Processor specific interpretation of DWARF unwind info.
Saleem Abdulrasool17552662015-04-24 19:39:17 +000010//
11//===----------------------------------------------------------------------===//
12
13#ifndef __DWARF_INSTRUCTIONS_HPP__
14#define __DWARF_INSTRUCTIONS_HPP__
15
16#include <stdint.h>
17#include <stdio.h>
18#include <stdlib.h>
19
20#include "dwarf2.h"
Saleem Abdulrasool17552662015-04-24 19:39:17 +000021#include "Registers.hpp"
22#include "DwarfParser.hpp"
23#include "config.h"
24
25
26namespace libunwind {
27
28
Ed Maste4c43c3d2016-07-19 17:15:50 +000029/// DwarfInstructions maps abtract DWARF unwind instructions to a particular
Saleem Abdulrasool17552662015-04-24 19:39:17 +000030/// architecture
31template <typename A, typename R>
32class DwarfInstructions {
33public:
34 typedef typename A::pint_t pint_t;
35 typedef typename A::sint_t sint_t;
36
37 static int stepWithDwarf(A &addressSpace, pint_t pc, pint_t fdeStart,
38 R &registers);
39
40private:
41
42 enum {
43 DW_X86_64_RET_ADDR = 16
44 };
45
46 enum {
47 DW_X86_RET_ADDR = 8
48 };
49
50 typedef typename CFI_Parser<A>::RegisterLocation RegisterLocation;
51 typedef typename CFI_Parser<A>::PrologInfo PrologInfo;
52 typedef typename CFI_Parser<A>::FDE_Info FDE_Info;
53 typedef typename CFI_Parser<A>::CIE_Info CIE_Info;
54
55 static pint_t evaluateExpression(pint_t expression, A &addressSpace,
56 const R &registers,
57 pint_t initialStackValue);
58 static pint_t getSavedRegister(A &addressSpace, const R &registers,
59 pint_t cfa, const RegisterLocation &savedReg);
60 static double getSavedFloatRegister(A &addressSpace, const R &registers,
61 pint_t cfa, const RegisterLocation &savedReg);
62 static v128 getSavedVectorRegister(A &addressSpace, const R &registers,
63 pint_t cfa, const RegisterLocation &savedReg);
64
65 static pint_t getCFA(A &addressSpace, const PrologInfo &prolog,
66 const R &registers) {
67 if (prolog.cfaRegister != 0)
68 return (pint_t)((sint_t)registers.getRegister((int)prolog.cfaRegister) +
69 prolog.cfaRegisterOffset);
70 if (prolog.cfaExpression != 0)
71 return evaluateExpression((pint_t)prolog.cfaExpression, addressSpace,
72 registers, 0);
73 assert(0 && "getCFA(): unknown location");
74 __builtin_unreachable();
75 }
76};
77
78
79template <typename A, typename R>
80typename A::pint_t DwarfInstructions<A, R>::getSavedRegister(
81 A &addressSpace, const R &registers, pint_t cfa,
82 const RegisterLocation &savedReg) {
83 switch (savedReg.location) {
84 case CFI_Parser<A>::kRegisterInCFA:
John Baldwin1a6e6be2018-02-27 21:24:02 +000085 return addressSpace.getRegister(cfa + (pint_t)savedReg.value);
Saleem Abdulrasool17552662015-04-24 19:39:17 +000086
87 case CFI_Parser<A>::kRegisterAtExpression:
John Baldwin1a6e6be2018-02-27 21:24:02 +000088 return addressSpace.getRegister(
Saleem Abdulrasool17552662015-04-24 19:39:17 +000089 evaluateExpression((pint_t)savedReg.value, addressSpace,
90 registers, cfa));
91
92 case CFI_Parser<A>::kRegisterIsExpression:
93 return evaluateExpression((pint_t)savedReg.value, addressSpace,
94 registers, cfa);
95
96 case CFI_Parser<A>::kRegisterInRegister:
97 return registers.getRegister((int)savedReg.value);
98
99 case CFI_Parser<A>::kRegisterUnused:
100 case CFI_Parser<A>::kRegisterOffsetFromCFA:
101 // FIX ME
102 break;
103 }
104 _LIBUNWIND_ABORT("unsupported restore location for register");
105}
106
107template <typename A, typename R>
108double DwarfInstructions<A, R>::getSavedFloatRegister(
109 A &addressSpace, const R &registers, pint_t cfa,
110 const RegisterLocation &savedReg) {
111 switch (savedReg.location) {
112 case CFI_Parser<A>::kRegisterInCFA:
113 return addressSpace.getDouble(cfa + (pint_t)savedReg.value);
114
115 case CFI_Parser<A>::kRegisterAtExpression:
116 return addressSpace.getDouble(
117 evaluateExpression((pint_t)savedReg.value, addressSpace,
118 registers, cfa));
119
120 case CFI_Parser<A>::kRegisterIsExpression:
121 case CFI_Parser<A>::kRegisterUnused:
122 case CFI_Parser<A>::kRegisterOffsetFromCFA:
123 case CFI_Parser<A>::kRegisterInRegister:
124 // FIX ME
125 break;
126 }
127 _LIBUNWIND_ABORT("unsupported restore location for float register");
128}
129
130template <typename A, typename R>
131v128 DwarfInstructions<A, R>::getSavedVectorRegister(
132 A &addressSpace, const R &registers, pint_t cfa,
133 const RegisterLocation &savedReg) {
134 switch (savedReg.location) {
135 case CFI_Parser<A>::kRegisterInCFA:
136 return addressSpace.getVector(cfa + (pint_t)savedReg.value);
137
138 case CFI_Parser<A>::kRegisterAtExpression:
139 return addressSpace.getVector(
140 evaluateExpression((pint_t)savedReg.value, addressSpace,
141 registers, cfa));
142
143 case CFI_Parser<A>::kRegisterIsExpression:
144 case CFI_Parser<A>::kRegisterUnused:
145 case CFI_Parser<A>::kRegisterOffsetFromCFA:
146 case CFI_Parser<A>::kRegisterInRegister:
147 // FIX ME
148 break;
149 }
150 _LIBUNWIND_ABORT("unsupported restore location for vector register");
151}
152
153template <typename A, typename R>
154int DwarfInstructions<A, R>::stepWithDwarf(A &addressSpace, pint_t pc,
155 pint_t fdeStart, R &registers) {
156 FDE_Info fdeInfo;
157 CIE_Info cieInfo;
158 if (CFI_Parser<A>::decodeFDE(addressSpace, fdeStart, &fdeInfo,
159 &cieInfo) == NULL) {
160 PrologInfo prolog;
161 if (CFI_Parser<A>::parseFDEInstructions(addressSpace, fdeInfo, cieInfo, pc,
162 &prolog)) {
163 // get pointer to cfa (architecture specific)
164 pint_t cfa = getCFA(addressSpace, prolog, registers);
165
Ed Maste4c43c3d2016-07-19 17:15:50 +0000166 // restore registers that DWARF says were saved
Saleem Abdulrasool17552662015-04-24 19:39:17 +0000167 R newRegisters = registers;
168 pint_t returnAddress = 0;
169 const int lastReg = R::lastDwarfRegNum();
Martin Storsjof10f3c92017-10-27 07:59:01 +0000170 assert(static_cast<int>(CFI_Parser<A>::kMaxRegisterNumber) >= lastReg &&
Saleem Abdulrasool17552662015-04-24 19:39:17 +0000171 "register range too large");
Ed Mastec14579b2015-08-13 13:45:45 +0000172 assert(lastReg >= (int)cieInfo.returnAddressRegister &&
Saleem Abdulrasool17552662015-04-24 19:39:17 +0000173 "register range does not contain return address register");
174 for (int i = 0; i <= lastReg; ++i) {
Logan Chien0112edf2015-05-30 14:00:39 +0000175 if (prolog.savedRegisters[i].location !=
176 CFI_Parser<A>::kRegisterUnused) {
177 if (registers.validFloatRegister(i))
Saleem Abdulrasool17552662015-04-24 19:39:17 +0000178 newRegisters.setFloatRegister(
179 i, getSavedFloatRegister(addressSpace, registers, cfa,
180 prolog.savedRegisters[i]));
181 else if (registers.validVectorRegister(i))
182 newRegisters.setVectorRegister(
183 i, getSavedVectorRegister(addressSpace, registers, cfa,
184 prolog.savedRegisters[i]));
185 else if (i == (int)cieInfo.returnAddressRegister)
186 returnAddress = getSavedRegister(addressSpace, registers, cfa,
187 prolog.savedRegisters[i]);
188 else if (registers.validRegister(i))
189 newRegisters.setRegister(
190 i, getSavedRegister(addressSpace, registers, cfa,
191 prolog.savedRegisters[i]));
192 else
193 return UNW_EBADREG;
194 }
195 }
196
197 // By definition, the CFA is the stack pointer at the call site, so
198 // restoring SP means setting it to CFA.
199 newRegisters.setSP(cfa);
200
Luke Cheeseman4d8e4312018-12-14 11:30:12 +0000201#if defined(_LIBUNWIND_TARGET_AARCH64)
202 // If the target is aarch64 then the return address may have been signed
203 // using the v8.3 pointer authentication extensions. The original
204 // return address needs to be authenticated before the return address is
205 // restored. autia1716 is used instead of autia as autia1716 assembles
206 // to a NOP on pre-v8.3a architectures.
207 if (prolog.savedRegisters[UNW_ARM64_RA_SIGN_STATE].value) {
208#if !defined(_LIBUNWIND_IS_NATIVE_ONLY)
209 return UNW_ECROSSRASIGNING;
210#else
211 register unsigned long long x17 __asm("x17") = returnAddress;
212 register unsigned long long x16 __asm("x16") = cfa;
213
Luke Cheesemancba83c32018-12-17 11:43:24 +0000214 // These are the autia1716/autib1716 instructions. The hint instructions
215 // are used here as gcc does not assemble autia1716/autib1716 for pre
216 // armv8.3a targets.
217 if (cieInfo.addressesSignedWithBKey)
218 asm("hint 0xe" : "+r"(x17) : "r"(x16)); // autib1716
219 else
220 asm("hint 0xc" : "+r"(x17) : "r"(x16)); // autia1716
Luke Cheeseman4d8e4312018-12-14 11:30:12 +0000221 returnAddress = x17;
222#endif
223 }
224#endif
225
Saleem Abdulrasool17552662015-04-24 19:39:17 +0000226 // Return address is address after call site instruction, so setting IP to
227 // that does simualates a return.
228 newRegisters.setIP(returnAddress);
229
230 // Simulate the step by replacing the register set with the new ones.
231 registers = newRegisters;
232
233 return UNW_STEP_SUCCESS;
234 }
235 }
236 return UNW_EBADFRAME;
237}
238
239template <typename A, typename R>
240typename A::pint_t
241DwarfInstructions<A, R>::evaluateExpression(pint_t expression, A &addressSpace,
242 const R &registers,
243 pint_t initialStackValue) {
244 const bool log = false;
245 pint_t p = expression;
246 pint_t expressionEnd = expression + 20; // temp, until len read
247 pint_t length = (pint_t)addressSpace.getULEB128(p, expressionEnd);
248 expressionEnd = p + length;
249 if (log)
250 fprintf(stderr, "evaluateExpression(): length=%" PRIu64 "\n",
251 (uint64_t)length);
252 pint_t stack[100];
253 pint_t *sp = stack;
254 *(++sp) = initialStackValue;
255
256 while (p < expressionEnd) {
257 if (log) {
258 for (pint_t *t = sp; t > stack; --t) {
259 fprintf(stderr, "sp[] = 0x%" PRIx64 "\n", (uint64_t)(*t));
260 }
261 }
262 uint8_t opcode = addressSpace.get8(p++);
263 sint_t svalue, svalue2;
264 pint_t value;
265 uint32_t reg;
266 switch (opcode) {
267 case DW_OP_addr:
268 // push immediate address sized value
269 value = addressSpace.getP(p);
270 p += sizeof(pint_t);
271 *(++sp) = value;
272 if (log)
273 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)value);
274 break;
275
276 case DW_OP_deref:
277 // pop stack, dereference, push result
278 value = *sp--;
279 *(++sp) = addressSpace.getP(value);
280 if (log)
281 fprintf(stderr, "dereference 0x%" PRIx64 "\n", (uint64_t)value);
282 break;
283
284 case DW_OP_const1u:
285 // push immediate 1 byte value
286 value = addressSpace.get8(p);
287 p += 1;
288 *(++sp) = value;
289 if (log)
290 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)value);
291 break;
292
293 case DW_OP_const1s:
294 // push immediate 1 byte signed value
295 svalue = (int8_t) addressSpace.get8(p);
296 p += 1;
297 *(++sp) = (pint_t)svalue;
298 if (log)
299 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)svalue);
300 break;
301
302 case DW_OP_const2u:
303 // push immediate 2 byte value
304 value = addressSpace.get16(p);
305 p += 2;
306 *(++sp) = value;
307 if (log)
308 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)value);
309 break;
310
311 case DW_OP_const2s:
312 // push immediate 2 byte signed value
313 svalue = (int16_t) addressSpace.get16(p);
314 p += 2;
315 *(++sp) = (pint_t)svalue;
316 if (log)
317 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)svalue);
318 break;
319
320 case DW_OP_const4u:
321 // push immediate 4 byte value
322 value = addressSpace.get32(p);
323 p += 4;
324 *(++sp) = value;
325 if (log)
326 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)value);
327 break;
328
329 case DW_OP_const4s:
330 // push immediate 4 byte signed value
331 svalue = (int32_t)addressSpace.get32(p);
332 p += 4;
333 *(++sp) = (pint_t)svalue;
334 if (log)
335 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)svalue);
336 break;
337
338 case DW_OP_const8u:
339 // push immediate 8 byte value
340 value = (pint_t)addressSpace.get64(p);
341 p += 8;
342 *(++sp) = value;
343 if (log)
344 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)value);
345 break;
346
347 case DW_OP_const8s:
348 // push immediate 8 byte signed value
349 value = (pint_t)addressSpace.get64(p);
350 p += 8;
351 *(++sp) = value;
352 if (log)
353 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)value);
354 break;
355
356 case DW_OP_constu:
357 // push immediate ULEB128 value
358 value = (pint_t)addressSpace.getULEB128(p, expressionEnd);
359 *(++sp) = value;
360 if (log)
361 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)value);
362 break;
363
364 case DW_OP_consts:
365 // push immediate SLEB128 value
366 svalue = (sint_t)addressSpace.getSLEB128(p, expressionEnd);
367 *(++sp) = (pint_t)svalue;
368 if (log)
369 fprintf(stderr, "push 0x%" PRIx64 "\n", (uint64_t)svalue);
370 break;
371
372 case DW_OP_dup:
373 // push top of stack
374 value = *sp;
375 *(++sp) = value;
376 if (log)
377 fprintf(stderr, "duplicate top of stack\n");
378 break;
379
380 case DW_OP_drop:
381 // pop
382 --sp;
383 if (log)
384 fprintf(stderr, "pop top of stack\n");
385 break;
386
387 case DW_OP_over:
388 // dup second
389 value = sp[-1];
390 *(++sp) = value;
391 if (log)
392 fprintf(stderr, "duplicate second in stack\n");
393 break;
394
395 case DW_OP_pick:
396 // pick from
397 reg = addressSpace.get8(p);
398 p += 1;
399 value = sp[-reg];
400 *(++sp) = value;
401 if (log)
402 fprintf(stderr, "duplicate %d in stack\n", reg);
403 break;
404
405 case DW_OP_swap:
406 // swap top two
407 value = sp[0];
408 sp[0] = sp[-1];
409 sp[-1] = value;
410 if (log)
411 fprintf(stderr, "swap top of stack\n");
412 break;
413
414 case DW_OP_rot:
415 // rotate top three
416 value = sp[0];
417 sp[0] = sp[-1];
418 sp[-1] = sp[-2];
419 sp[-2] = value;
420 if (log)
421 fprintf(stderr, "rotate top three of stack\n");
422 break;
423
424 case DW_OP_xderef:
425 // pop stack, dereference, push result
426 value = *sp--;
427 *sp = *((pint_t*)value);
428 if (log)
429 fprintf(stderr, "x-dereference 0x%" PRIx64 "\n", (uint64_t)value);
430 break;
431
432 case DW_OP_abs:
433 svalue = (sint_t)*sp;
434 if (svalue < 0)
435 *sp = (pint_t)(-svalue);
436 if (log)
437 fprintf(stderr, "abs\n");
438 break;
439
440 case DW_OP_and:
441 value = *sp--;
442 *sp &= value;
443 if (log)
444 fprintf(stderr, "and\n");
445 break;
446
447 case DW_OP_div:
448 svalue = (sint_t)(*sp--);
449 svalue2 = (sint_t)*sp;
450 *sp = (pint_t)(svalue2 / svalue);
451 if (log)
452 fprintf(stderr, "div\n");
453 break;
454
455 case DW_OP_minus:
456 value = *sp--;
457 *sp = *sp - value;
458 if (log)
459 fprintf(stderr, "minus\n");
460 break;
461
462 case DW_OP_mod:
463 svalue = (sint_t)(*sp--);
464 svalue2 = (sint_t)*sp;
465 *sp = (pint_t)(svalue2 % svalue);
466 if (log)
467 fprintf(stderr, "module\n");
468 break;
469
470 case DW_OP_mul:
471 svalue = (sint_t)(*sp--);
472 svalue2 = (sint_t)*sp;
473 *sp = (pint_t)(svalue2 * svalue);
474 if (log)
475 fprintf(stderr, "mul\n");
476 break;
477
478 case DW_OP_neg:
479 *sp = 0 - *sp;
480 if (log)
481 fprintf(stderr, "neg\n");
482 break;
483
484 case DW_OP_not:
485 svalue = (sint_t)(*sp);
486 *sp = (pint_t)(~svalue);
487 if (log)
488 fprintf(stderr, "not\n");
489 break;
490
491 case DW_OP_or:
492 value = *sp--;
493 *sp |= value;
494 if (log)
495 fprintf(stderr, "or\n");
496 break;
497
498 case DW_OP_plus:
499 value = *sp--;
500 *sp += value;
501 if (log)
502 fprintf(stderr, "plus\n");
503 break;
504
505 case DW_OP_plus_uconst:
506 // pop stack, add uelb128 constant, push result
Saleem Abdulrasool92acbf12017-03-08 16:03:27 +0000507 *sp += static_cast<pint_t>(addressSpace.getULEB128(p, expressionEnd));
Saleem Abdulrasool17552662015-04-24 19:39:17 +0000508 if (log)
509 fprintf(stderr, "add constant\n");
510 break;
511
512 case DW_OP_shl:
513 value = *sp--;
514 *sp = *sp << value;
515 if (log)
516 fprintf(stderr, "shift left\n");
517 break;
518
519 case DW_OP_shr:
520 value = *sp--;
521 *sp = *sp >> value;
522 if (log)
523 fprintf(stderr, "shift left\n");
524 break;
525
526 case DW_OP_shra:
527 value = *sp--;
528 svalue = (sint_t)*sp;
529 *sp = (pint_t)(svalue >> value);
530 if (log)
531 fprintf(stderr, "shift left arithmetric\n");
532 break;
533
534 case DW_OP_xor:
535 value = *sp--;
536 *sp ^= value;
537 if (log)
538 fprintf(stderr, "xor\n");
539 break;
540
541 case DW_OP_skip:
542 svalue = (int16_t) addressSpace.get16(p);
543 p += 2;
544 p = (pint_t)((sint_t)p + svalue);
545 if (log)
546 fprintf(stderr, "skip %" PRIu64 "\n", (uint64_t)svalue);
547 break;
548
549 case DW_OP_bra:
550 svalue = (int16_t) addressSpace.get16(p);
551 p += 2;
552 if (*sp--)
553 p = (pint_t)((sint_t)p + svalue);
554 if (log)
555 fprintf(stderr, "bra %" PRIu64 "\n", (uint64_t)svalue);
556 break;
557
558 case DW_OP_eq:
559 value = *sp--;
560 *sp = (*sp == value);
561 if (log)
562 fprintf(stderr, "eq\n");
563 break;
564
565 case DW_OP_ge:
566 value = *sp--;
567 *sp = (*sp >= value);
568 if (log)
569 fprintf(stderr, "ge\n");
570 break;
571
572 case DW_OP_gt:
573 value = *sp--;
574 *sp = (*sp > value);
575 if (log)
576 fprintf(stderr, "gt\n");
577 break;
578
579 case DW_OP_le:
580 value = *sp--;
581 *sp = (*sp <= value);
582 if (log)
583 fprintf(stderr, "le\n");
584 break;
585
586 case DW_OP_lt:
587 value = *sp--;
588 *sp = (*sp < value);
589 if (log)
590 fprintf(stderr, "lt\n");
591 break;
592
593 case DW_OP_ne:
594 value = *sp--;
595 *sp = (*sp != value);
596 if (log)
597 fprintf(stderr, "ne\n");
598 break;
599
600 case DW_OP_lit0:
601 case DW_OP_lit1:
602 case DW_OP_lit2:
603 case DW_OP_lit3:
604 case DW_OP_lit4:
605 case DW_OP_lit5:
606 case DW_OP_lit6:
607 case DW_OP_lit7:
608 case DW_OP_lit8:
609 case DW_OP_lit9:
610 case DW_OP_lit10:
611 case DW_OP_lit11:
612 case DW_OP_lit12:
613 case DW_OP_lit13:
614 case DW_OP_lit14:
615 case DW_OP_lit15:
616 case DW_OP_lit16:
617 case DW_OP_lit17:
618 case DW_OP_lit18:
619 case DW_OP_lit19:
620 case DW_OP_lit20:
621 case DW_OP_lit21:
622 case DW_OP_lit22:
623 case DW_OP_lit23:
624 case DW_OP_lit24:
625 case DW_OP_lit25:
626 case DW_OP_lit26:
627 case DW_OP_lit27:
628 case DW_OP_lit28:
629 case DW_OP_lit29:
630 case DW_OP_lit30:
631 case DW_OP_lit31:
632 value = static_cast<pint_t>(opcode - DW_OP_lit0);
633 *(++sp) = value;
634 if (log)
635 fprintf(stderr, "push literal 0x%" PRIx64 "\n", (uint64_t)value);
636 break;
637
638 case DW_OP_reg0:
639 case DW_OP_reg1:
640 case DW_OP_reg2:
641 case DW_OP_reg3:
642 case DW_OP_reg4:
643 case DW_OP_reg5:
644 case DW_OP_reg6:
645 case DW_OP_reg7:
646 case DW_OP_reg8:
647 case DW_OP_reg9:
648 case DW_OP_reg10:
649 case DW_OP_reg11:
650 case DW_OP_reg12:
651 case DW_OP_reg13:
652 case DW_OP_reg14:
653 case DW_OP_reg15:
654 case DW_OP_reg16:
655 case DW_OP_reg17:
656 case DW_OP_reg18:
657 case DW_OP_reg19:
658 case DW_OP_reg20:
659 case DW_OP_reg21:
660 case DW_OP_reg22:
661 case DW_OP_reg23:
662 case DW_OP_reg24:
663 case DW_OP_reg25:
664 case DW_OP_reg26:
665 case DW_OP_reg27:
666 case DW_OP_reg28:
667 case DW_OP_reg29:
668 case DW_OP_reg30:
669 case DW_OP_reg31:
670 reg = static_cast<uint32_t>(opcode - DW_OP_reg0);
671 *(++sp) = registers.getRegister((int)reg);
672 if (log)
673 fprintf(stderr, "push reg %d\n", reg);
674 break;
675
676 case DW_OP_regx:
677 reg = static_cast<uint32_t>(addressSpace.getULEB128(p, expressionEnd));
678 *(++sp) = registers.getRegister((int)reg);
679 if (log)
680 fprintf(stderr, "push reg %d + 0x%" PRIx64 "\n", reg, (uint64_t)svalue);
681 break;
682
683 case DW_OP_breg0:
684 case DW_OP_breg1:
685 case DW_OP_breg2:
686 case DW_OP_breg3:
687 case DW_OP_breg4:
688 case DW_OP_breg5:
689 case DW_OP_breg6:
690 case DW_OP_breg7:
691 case DW_OP_breg8:
692 case DW_OP_breg9:
693 case DW_OP_breg10:
694 case DW_OP_breg11:
695 case DW_OP_breg12:
696 case DW_OP_breg13:
697 case DW_OP_breg14:
698 case DW_OP_breg15:
699 case DW_OP_breg16:
700 case DW_OP_breg17:
701 case DW_OP_breg18:
702 case DW_OP_breg19:
703 case DW_OP_breg20:
704 case DW_OP_breg21:
705 case DW_OP_breg22:
706 case DW_OP_breg23:
707 case DW_OP_breg24:
708 case DW_OP_breg25:
709 case DW_OP_breg26:
710 case DW_OP_breg27:
711 case DW_OP_breg28:
712 case DW_OP_breg29:
713 case DW_OP_breg30:
714 case DW_OP_breg31:
715 reg = static_cast<uint32_t>(opcode - DW_OP_breg0);
716 svalue = (sint_t)addressSpace.getSLEB128(p, expressionEnd);
717 svalue += static_cast<sint_t>(registers.getRegister((int)reg));
718 *(++sp) = (pint_t)(svalue);
719 if (log)
720 fprintf(stderr, "push reg %d + 0x%" PRIx64 "\n", reg, (uint64_t)svalue);
721 break;
722
723 case DW_OP_bregx:
724 reg = static_cast<uint32_t>(addressSpace.getULEB128(p, expressionEnd));
725 svalue = (sint_t)addressSpace.getSLEB128(p, expressionEnd);
726 svalue += static_cast<sint_t>(registers.getRegister((int)reg));
727 *(++sp) = (pint_t)(svalue);
728 if (log)
729 fprintf(stderr, "push reg %d + 0x%" PRIx64 "\n", reg, (uint64_t)svalue);
730 break;
731
732 case DW_OP_fbreg:
733 _LIBUNWIND_ABORT("DW_OP_fbreg not implemented");
734 break;
735
736 case DW_OP_piece:
737 _LIBUNWIND_ABORT("DW_OP_piece not implemented");
738 break;
739
740 case DW_OP_deref_size:
741 // pop stack, dereference, push result
742 value = *sp--;
743 switch (addressSpace.get8(p++)) {
744 case 1:
745 value = addressSpace.get8(value);
746 break;
747 case 2:
748 value = addressSpace.get16(value);
749 break;
750 case 4:
751 value = addressSpace.get32(value);
752 break;
753 case 8:
754 value = (pint_t)addressSpace.get64(value);
755 break;
756 default:
757 _LIBUNWIND_ABORT("DW_OP_deref_size with bad size");
758 }
759 *(++sp) = value;
760 if (log)
761 fprintf(stderr, "sized dereference 0x%" PRIx64 "\n", (uint64_t)value);
762 break;
763
764 case DW_OP_xderef_size:
765 case DW_OP_nop:
766 case DW_OP_push_object_addres:
767 case DW_OP_call2:
768 case DW_OP_call4:
769 case DW_OP_call_ref:
770 default:
Ed Maste4c43c3d2016-07-19 17:15:50 +0000771 _LIBUNWIND_ABORT("DWARF opcode not implemented");
Saleem Abdulrasool17552662015-04-24 19:39:17 +0000772 }
773
774 }
775 if (log)
776 fprintf(stderr, "expression evaluates to 0x%" PRIx64 "\n", (uint64_t)*sp);
777 return *sp;
778}
779
780
781
782} // namespace libunwind
783
784#endif // __DWARF_INSTRUCTIONS_HPP__