Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 1 | //===-- llvm/CodeGen/DwarfExpression.cpp - Dwarf Debug Framework ----------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file contains support for writing dwarf debug info into asm files. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include "DwarfExpression.h" |
Adrian Prantl | a4c30d6 | 2015-01-12 23:36:56 +0000 | [diff] [blame] | 15 | |
| 16 | #include "DwarfDebug.h" |
Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 17 | #include "llvm/ADT/SmallBitVector.h" |
Adrian Prantl | a4c30d6 | 2015-01-12 23:36:56 +0000 | [diff] [blame] | 18 | #include "llvm/CodeGen/AsmPrinter.h" |
Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 19 | #include "llvm/Support/Dwarf.h" |
| 20 | #include "llvm/Target/TargetMachine.h" |
| 21 | #include "llvm/Target/TargetRegisterInfo.h" |
| 22 | #include "llvm/Target/TargetSubtargetInfo.h" |
| 23 | |
Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 24 | using namespace llvm; |
| 25 | |
Adrian Prantl | a4c30d6 | 2015-01-12 23:36:56 +0000 | [diff] [blame] | 26 | const TargetRegisterInfo *DwarfExpression::getTRI() const { |
| 27 | return AP.TM.getSubtargetImpl()->getRegisterInfo(); |
| 28 | } |
| 29 | |
Adrian Prantl | 66f2595 | 2015-01-13 00:04:06 +0000 | [diff] [blame] | 30 | unsigned DwarfExpression::getDwarfVersion() const { |
| 31 | return AP.getDwarfDebug()->getDwarfVersion(); |
| 32 | } |
| 33 | |
| 34 | void DwarfExpression::AddReg(int DwarfReg, const char *Comment) { |
Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 35 | assert(DwarfReg >= 0 && "invalid negative dwarf register number"); |
| 36 | if (DwarfReg < 32) { |
| 37 | EmitOp(dwarf::DW_OP_reg0 + DwarfReg, Comment); |
| 38 | } else { |
| 39 | EmitOp(dwarf::DW_OP_regx, Comment); |
| 40 | EmitUnsigned(DwarfReg); |
| 41 | } |
| 42 | } |
| 43 | |
| 44 | void DwarfExpression::AddRegIndirect(int DwarfReg, int Offset, bool Deref) { |
| 45 | assert(DwarfReg >= 0 && "invalid negative dwarf register number"); |
| 46 | if (DwarfReg < 32) { |
| 47 | EmitOp(dwarf::DW_OP_breg0 + DwarfReg); |
| 48 | } else { |
| 49 | EmitOp(dwarf::DW_OP_bregx); |
| 50 | EmitUnsigned(DwarfReg); |
| 51 | } |
| 52 | EmitSigned(Offset); |
| 53 | if (Deref) |
| 54 | EmitOp(dwarf::DW_OP_deref); |
| 55 | } |
| 56 | |
Adrian Prantl | 66f2595 | 2015-01-13 00:04:06 +0000 | [diff] [blame] | 57 | void DwarfExpression::AddOpPiece(unsigned SizeInBits, unsigned OffsetInBits) { |
Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 58 | assert(SizeInBits > 0 && "piece has size zero"); |
| 59 | const unsigned SizeOfByte = 8; |
| 60 | if (OffsetInBits > 0 || SizeInBits % SizeOfByte) { |
| 61 | EmitOp(dwarf::DW_OP_bit_piece); |
| 62 | EmitUnsigned(SizeInBits); |
| 63 | EmitUnsigned(OffsetInBits); |
| 64 | } else { |
| 65 | EmitOp(dwarf::DW_OP_piece); |
| 66 | unsigned ByteSize = SizeInBits / SizeOfByte; |
| 67 | EmitUnsigned(ByteSize); |
| 68 | } |
| 69 | } |
| 70 | |
| 71 | void DwarfExpression::AddShr(unsigned ShiftBy) { |
| 72 | EmitOp(dwarf::DW_OP_constu); |
| 73 | EmitUnsigned(ShiftBy); |
| 74 | EmitOp(dwarf::DW_OP_shr); |
| 75 | } |
| 76 | |
Adrian Prantl | 00dbc2a | 2015-01-12 22:19:26 +0000 | [diff] [blame] | 77 | bool DwarfExpression::AddMachineRegIndirect(unsigned MachineReg, int Offset) { |
Adrian Prantl | a4c30d6 | 2015-01-12 23:36:56 +0000 | [diff] [blame] | 78 | int DwarfReg = getTRI()->getDwarfRegNum(MachineReg, false); |
Adrian Prantl | 00dbc2a | 2015-01-12 22:19:26 +0000 | [diff] [blame] | 79 | if (DwarfReg < 0) |
| 80 | return false; |
| 81 | |
Adrian Prantl | 8995f5c | 2015-01-13 23:10:43 +0000 | [diff] [blame] | 82 | if (isFrameRegister(MachineReg)) { |
Adrian Prantl | 00dbc2a | 2015-01-12 22:19:26 +0000 | [diff] [blame] | 83 | // If variable offset is based in frame register then use fbreg. |
| 84 | EmitOp(dwarf::DW_OP_fbreg); |
| 85 | EmitSigned(Offset); |
| 86 | } else { |
| 87 | AddRegIndirect(DwarfReg, Offset); |
| 88 | } |
| 89 | return true; |
| 90 | } |
| 91 | |
Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 92 | void DwarfExpression::AddMachineRegPiece(unsigned MachineReg, |
| 93 | unsigned PieceSizeInBits, |
| 94 | unsigned PieceOffsetInBits) { |
Adrian Prantl | a4c30d6 | 2015-01-12 23:36:56 +0000 | [diff] [blame] | 95 | const TargetRegisterInfo *TRI = getTRI(); |
Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 96 | int Reg = TRI->getDwarfRegNum(MachineReg, false); |
| 97 | |
| 98 | // If this is a valid register number, emit it. |
| 99 | if (Reg >= 0) { |
| 100 | AddReg(Reg); |
Adrian Prantl | 0e6ffb9 | 2015-01-12 22:37:16 +0000 | [diff] [blame] | 101 | if (PieceSizeInBits) |
| 102 | AddOpPiece(PieceSizeInBits, PieceOffsetInBits); |
Adrian Prantl | b16d9eb | 2015-01-12 22:19:22 +0000 | [diff] [blame] | 103 | return; |
| 104 | } |
| 105 | |
| 106 | // Walk up the super-register chain until we find a valid number. |
| 107 | // For example, EAX on x86_64 is a 32-bit piece of RAX with offset 0. |
| 108 | for (MCSuperRegIterator SR(MachineReg, TRI); SR.isValid(); ++SR) { |
| 109 | Reg = TRI->getDwarfRegNum(*SR, false); |
| 110 | if (Reg >= 0) { |
| 111 | unsigned Idx = TRI->getSubRegIndex(*SR, MachineReg); |
| 112 | unsigned Size = TRI->getSubRegIdxSize(Idx); |
| 113 | unsigned RegOffset = TRI->getSubRegIdxOffset(Idx); |
| 114 | AddReg(Reg, "super-register"); |
| 115 | if (PieceOffsetInBits == RegOffset) { |
| 116 | AddOpPiece(Size, RegOffset); |
| 117 | } else { |
| 118 | // If this is part of a variable in a sub-register at a |
| 119 | // non-zero offset, we need to manually shift the value into |
| 120 | // place, since the DW_OP_piece describes the part of the |
| 121 | // variable, not the position of the subregister. |
| 122 | if (RegOffset) |
| 123 | AddShr(RegOffset); |
| 124 | AddOpPiece(Size, PieceOffsetInBits); |
| 125 | } |
| 126 | return; |
| 127 | } |
| 128 | } |
| 129 | |
| 130 | // Otherwise, attempt to find a covering set of sub-register numbers. |
| 131 | // For example, Q0 on ARM is a composition of D0+D1. |
| 132 | // |
| 133 | // Keep track of the current position so we can emit the more |
| 134 | // efficient DW_OP_piece. |
| 135 | unsigned CurPos = PieceOffsetInBits; |
| 136 | // The size of the register in bits, assuming 8 bits per byte. |
| 137 | unsigned RegSize = TRI->getMinimalPhysRegClass(MachineReg)->getSize() * 8; |
| 138 | // Keep track of the bits in the register we already emitted, so we |
| 139 | // can avoid emitting redundant aliasing subregs. |
| 140 | SmallBitVector Coverage(RegSize, false); |
| 141 | for (MCSubRegIterator SR(MachineReg, TRI); SR.isValid(); ++SR) { |
| 142 | unsigned Idx = TRI->getSubRegIndex(MachineReg, *SR); |
| 143 | unsigned Size = TRI->getSubRegIdxSize(Idx); |
| 144 | unsigned Offset = TRI->getSubRegIdxOffset(Idx); |
| 145 | Reg = TRI->getDwarfRegNum(*SR, false); |
| 146 | |
| 147 | // Intersection between the bits we already emitted and the bits |
| 148 | // covered by this subregister. |
| 149 | SmallBitVector Intersection(RegSize, false); |
| 150 | Intersection.set(Offset, Offset + Size); |
| 151 | Intersection ^= Coverage; |
| 152 | |
| 153 | // If this sub-register has a DWARF number and we haven't covered |
| 154 | // its range, emit a DWARF piece for it. |
| 155 | if (Reg >= 0 && Intersection.any()) { |
| 156 | AddReg(Reg, "sub-register"); |
| 157 | AddOpPiece(Size, Offset == CurPos ? 0 : Offset); |
| 158 | CurPos = Offset + Size; |
| 159 | |
| 160 | // Mark it as emitted. |
| 161 | Coverage.set(Offset, Offset + Size); |
| 162 | } |
| 163 | } |
| 164 | |
| 165 | if (CurPos == PieceOffsetInBits) |
| 166 | // FIXME: We have no reasonable way of handling errors in here. |
| 167 | EmitOp(dwarf::DW_OP_nop, "nop (could not find a dwarf register number)"); |
| 168 | } |
Adrian Prantl | 66f2595 | 2015-01-13 00:04:06 +0000 | [diff] [blame] | 169 | |
| 170 | void DwarfExpression::AddSignedConstant(int Value) { |
| 171 | EmitOp(dwarf::DW_OP_consts); |
| 172 | EmitSigned(Value); |
| 173 | // The proper way to describe a constant value is |
| 174 | // DW_OP_constu <const>, DW_OP_stack_value. |
| 175 | // Unfortunately, DW_OP_stack_value was not available until DWARF-4, |
| 176 | // so we will continue to generate DW_OP_constu <const> for DWARF-2 |
| 177 | // and DWARF-3. Technically, this is incorrect since DW_OP_const <const> |
| 178 | // actually describes a value at a constant addess, not a constant value. |
| 179 | // However, in the past there was no better way to describe a constant |
| 180 | // value, so the producers and consumers started to rely on heuristics |
| 181 | // to disambiguate the value vs. location status of the expression. |
| 182 | // See PR21176 for more details. |
| 183 | if (getDwarfVersion() >= 4) |
| 184 | EmitOp(dwarf::DW_OP_stack_value); |
| 185 | } |
| 186 | |
| 187 | void DwarfExpression::AddUnsignedConstant(unsigned Value) { |
| 188 | EmitOp(dwarf::DW_OP_constu); |
| 189 | EmitUnsigned(Value); |
| 190 | // cf. comment in DwarfExpression::AddSignedConstant(). |
| 191 | if (getDwarfVersion() >= 4) |
| 192 | EmitOp(dwarf::DW_OP_stack_value); |
| 193 | } |
Adrian Prantl | 092d948 | 2015-01-13 23:39:11 +0000 | [diff] [blame^] | 194 | |
| 195 | static unsigned getOffsetOrZero(unsigned OffsetInBits, |
| 196 | unsigned PieceOffsetInBits) { |
| 197 | if (OffsetInBits == PieceOffsetInBits) |
| 198 | return 0; |
| 199 | assert(OffsetInBits >= PieceOffsetInBits && "overlapping pieces"); |
| 200 | return OffsetInBits; |
| 201 | } |
| 202 | |
| 203 | void DwarfExpression::AddMachineRegExpression(DIExpression Expr, |
| 204 | unsigned MachineReg, |
| 205 | unsigned PieceOffsetInBits) { |
| 206 | unsigned N = Expr.getNumElements(); |
| 207 | unsigned I = 0; |
| 208 | // Pattern-match combinations for which more efficient representations exist |
| 209 | // first. |
| 210 | if (N >= 3 && Expr.getElement(0) == dwarf::DW_OP_piece) { |
| 211 | unsigned SizeOfByte = 8; |
| 212 | unsigned OffsetInBits = Expr.getElement(1) * SizeOfByte; |
| 213 | unsigned SizeInBits = Expr.getElement(2) * SizeOfByte; |
| 214 | AddMachineRegPiece(MachineReg, SizeInBits, |
| 215 | getOffsetOrZero(OffsetInBits, PieceOffsetInBits)); |
| 216 | I = 3; |
| 217 | } else if (N >= 3 && Expr.getElement(0) == dwarf::DW_OP_plus && |
| 218 | Expr.getElement(2) == dwarf::DW_OP_deref) { |
| 219 | // [DW_OP_reg,Offset,DW_OP_plus,DW_OP_deref] --> [DW_OP_breg,Offset]. |
| 220 | unsigned Offset = Expr.getElement(1); |
| 221 | AddMachineRegIndirect(MachineReg, Offset); |
| 222 | I = 3; |
| 223 | } else if (N >= 1 && Expr.getElement(0) == dwarf::DW_OP_deref) { |
| 224 | // [DW_OP_reg,DW_OP_deref] --> [DW_OP_breg]. |
| 225 | AddMachineRegIndirect(MachineReg); |
| 226 | I = 1; |
| 227 | } else |
| 228 | AddMachineRegPiece(MachineReg); |
| 229 | |
| 230 | // Emit remaining elements of the expression. |
| 231 | AddExpression(Expr, I); |
| 232 | } |
| 233 | |
| 234 | void DwarfExpression::AddExpression(DIExpression Expr, unsigned I, |
| 235 | unsigned PieceOffsetInBits) { |
| 236 | unsigned N = Expr.getNumElements(); |
| 237 | for (; I < N; ++I) { |
| 238 | switch (Expr.getElement(I)) { |
| 239 | case dwarf::DW_OP_piece: { |
| 240 | unsigned SizeOfByte = 8; |
| 241 | unsigned OffsetInBits = Expr.getElement(++I) * SizeOfByte; |
| 242 | unsigned SizeInBits = Expr.getElement(++I) * SizeOfByte; |
| 243 | AddOpPiece(SizeInBits, getOffsetOrZero(OffsetInBits, PieceOffsetInBits)); |
| 244 | break; |
| 245 | } |
| 246 | case dwarf::DW_OP_plus: |
| 247 | EmitOp(dwarf::DW_OP_plus_uconst); |
| 248 | EmitUnsigned(Expr.getElement(++I)); |
| 249 | break; |
| 250 | case dwarf::DW_OP_deref: |
| 251 | EmitOp(dwarf::DW_OP_deref); |
| 252 | break; |
| 253 | default: |
| 254 | llvm_unreachable("unhandled opcode found in DIExpression"); |
| 255 | } |
| 256 | } |
| 257 | } |