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" 15 #include "DwarfDebug.h" 16 #include "llvm/ADT/SmallBitVector.h" 17 #include "llvm/CodeGen/AsmPrinter.h" 18 #include "llvm/Support/Dwarf.h" 19 #include "llvm/Target/TargetMachine.h" 20 #include "llvm/Target/TargetRegisterInfo.h" 21 #include "llvm/Target/TargetSubtargetInfo.h" 22 23 using namespace llvm; 24 25 void DwarfExpression::addReg(int DwarfReg, const char *Comment) { 26 assert(DwarfReg >= 0 && "invalid negative dwarf register number"); 27 assert((LocationKind == Unknown || LocationKind == Register) && 28 "location description already locked down"); 29 LocationKind = Register; 30 if (DwarfReg < 32) { 31 emitOp(dwarf::DW_OP_reg0 + DwarfReg, Comment); 32 } else { 33 emitOp(dwarf::DW_OP_regx, Comment); 34 emitUnsigned(DwarfReg); 35 } 36 } 37 38 void DwarfExpression::addBReg(int DwarfReg, int Offset) { 39 assert(DwarfReg >= 0 && "invalid negative dwarf register number"); 40 assert(LocationKind != Register && "location description already locked down"); 41 if (DwarfReg < 32) { 42 emitOp(dwarf::DW_OP_breg0 + DwarfReg); 43 } else { 44 emitOp(dwarf::DW_OP_bregx); 45 emitUnsigned(DwarfReg); 46 } 47 emitSigned(Offset); 48 } 49 50 void DwarfExpression::addFBReg(int Offset) { 51 emitOp(dwarf::DW_OP_fbreg); 52 emitSigned(Offset); 53 } 54 55 void DwarfExpression::addOpPiece(unsigned SizeInBits, unsigned OffsetInBits) { 56 if (!SizeInBits) 57 return; 58 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 this->OffsetInBits += SizeInBits; 70 } 71 72 void DwarfExpression::addShr(unsigned ShiftBy) { 73 emitOp(dwarf::DW_OP_constu); 74 emitUnsigned(ShiftBy); 75 emitOp(dwarf::DW_OP_shr); 76 } 77 78 void DwarfExpression::addAnd(unsigned Mask) { 79 emitOp(dwarf::DW_OP_constu); 80 emitUnsigned(Mask); 81 emitOp(dwarf::DW_OP_and); 82 } 83 84 bool DwarfExpression::addMachineReg(const TargetRegisterInfo &TRI, 85 unsigned MachineReg, unsigned MaxSize) { 86 if (!TRI.isPhysicalRegister(MachineReg)) { 87 if (isFrameRegister(TRI, MachineReg)) { 88 DwarfRegs.push_back({-1, 0, nullptr}); 89 return true; 90 } 91 return false; 92 } 93 94 int Reg = TRI.getDwarfRegNum(MachineReg, false); 95 96 // If this is a valid register number, emit it. 97 if (Reg >= 0) { 98 DwarfRegs.push_back({Reg, 0, nullptr}); 99 return true; 100 } 101 102 // Walk up the super-register chain until we find a valid number. 103 // For example, EAX on x86_64 is a 32-bit fragment of RAX with offset 0. 104 for (MCSuperRegIterator SR(MachineReg, &TRI); SR.isValid(); ++SR) { 105 Reg = TRI.getDwarfRegNum(*SR, false); 106 if (Reg >= 0) { 107 unsigned Idx = TRI.getSubRegIndex(*SR, MachineReg); 108 unsigned Size = TRI.getSubRegIdxSize(Idx); 109 unsigned RegOffset = TRI.getSubRegIdxOffset(Idx); 110 DwarfRegs.push_back({Reg, 0, "super-register"}); 111 // Use a DW_OP_bit_piece to describe the sub-register. 112 setSubRegisterPiece(Size, RegOffset); 113 return true; 114 } 115 } 116 117 // Otherwise, attempt to find a covering set of sub-register numbers. 118 // For example, Q0 on ARM is a composition of D0+D1. 119 unsigned CurPos = 0; 120 // The size of the register in bits, assuming 8 bits per byte. 121 unsigned RegSize = TRI.getMinimalPhysRegClass(MachineReg)->getSize() * 8; 122 // Keep track of the bits in the register we already emitted, so we 123 // can avoid emitting redundant aliasing subregs. 124 SmallBitVector Coverage(RegSize, false); 125 for (MCSubRegIterator SR(MachineReg, &TRI); SR.isValid(); ++SR) { 126 unsigned Idx = TRI.getSubRegIndex(MachineReg, *SR); 127 unsigned Size = TRI.getSubRegIdxSize(Idx); 128 unsigned Offset = TRI.getSubRegIdxOffset(Idx); 129 Reg = TRI.getDwarfRegNum(*SR, false); 130 131 // Intersection between the bits we already emitted and the bits 132 // covered by this subregister. 133 SmallBitVector Intersection(RegSize, false); 134 Intersection.set(Offset, Offset + Size); 135 Intersection ^= Coverage; 136 137 // If this sub-register has a DWARF number and we haven't covered 138 // its range, emit a DWARF piece for it. 139 if (Reg >= 0 && Intersection.any()) { 140 // Emit a piece for any gap in the coverage. 141 if (Offset > CurPos) 142 DwarfRegs.push_back({-1, Offset - CurPos, nullptr}); 143 DwarfRegs.push_back( 144 {Reg, std::min<unsigned>(Size, MaxSize - Offset), "sub-register"}); 145 if (Offset >= MaxSize) 146 break; 147 148 // Mark it as emitted. 149 Coverage.set(Offset, Offset + Size); 150 CurPos = Offset + Size; 151 } 152 } 153 154 return CurPos; 155 } 156 157 void DwarfExpression::addStackValue() { 158 if (DwarfVersion >= 4) 159 emitOp(dwarf::DW_OP_stack_value); 160 } 161 162 void DwarfExpression::addSignedConstant(int64_t Value) { 163 assert(LocationKind == Implicit || LocationKind == Unknown); 164 LocationKind = Implicit; 165 emitOp(dwarf::DW_OP_consts); 166 emitSigned(Value); 167 } 168 169 void DwarfExpression::addUnsignedConstant(uint64_t Value) { 170 assert(LocationKind == Implicit || LocationKind == Unknown); 171 LocationKind = Implicit; 172 emitOp(dwarf::DW_OP_constu); 173 emitUnsigned(Value); 174 } 175 176 void DwarfExpression::addUnsignedConstant(const APInt &Value) { 177 assert(LocationKind == Implicit || LocationKind == Unknown); 178 LocationKind = Implicit; 179 180 unsigned Size = Value.getBitWidth(); 181 const uint64_t *Data = Value.getRawData(); 182 183 // Chop it up into 64-bit pieces, because that's the maximum that 184 // addUnsignedConstant takes. 185 unsigned Offset = 0; 186 while (Offset < Size) { 187 addUnsignedConstant(*Data++); 188 if (Offset == 0 && Size <= 64) 189 break; 190 addStackValue(); 191 addOpPiece(std::min(Size - Offset, 64u), Offset); 192 Offset += 64; 193 } 194 } 195 196 bool DwarfExpression::addMachineLocExpression(const TargetRegisterInfo &TRI, 197 DIExpressionCursor &ExprCursor, 198 MachineLocation Loc, 199 unsigned FragmentOffsetInBits) { 200 if (Loc.isIndirect()) 201 LocationKind = Memory; 202 203 unsigned MachineReg = Loc.getReg(); 204 auto Fragment = ExprCursor.getFragmentInfo(); 205 if (!addMachineReg(TRI, MachineReg, Fragment ? Fragment->SizeInBits : ~1U)) 206 return false; 207 208 bool HasComplexExpression = false; 209 auto Op = ExprCursor.peek(); 210 if (Op && Op->getOp() != dwarf::DW_OP_LLVM_fragment) 211 HasComplexExpression = true; 212 213 // If the register can only be described by a complex expression (i.e., 214 // multiple subregisters) it doesn't safely compose with another complex 215 // expression. For example, it is not possible to apply a DW_OP_deref 216 // operation to multiple DW_OP_pieces. 217 if (HasComplexExpression && DwarfRegs.size() > 1) { 218 DwarfRegs.clear(); 219 return false; 220 } 221 222 // Handle simple register locations. 223 if (LocationKind != Memory && !HasComplexExpression) { 224 for (auto &Reg : DwarfRegs) { 225 if (Reg.DwarfRegNo >= 0) 226 addReg(Reg.DwarfRegNo, Reg.Comment); 227 addOpPiece(Reg.Size); 228 } 229 DwarfRegs.clear(); 230 return true; 231 } 232 233 // FIXME: 234 // Don't emit locations that cannot be expressed without DW_OP_stack_value. 235 236 assert(DwarfRegs.size() == 1); 237 auto Reg = DwarfRegs[0]; 238 bool FBReg = isFrameRegister(TRI, MachineReg); 239 int SignedOffset = 0; 240 assert(Reg.Size == 0 && "subregister has same size as superregister"); 241 242 // Pattern-match combinations for which more efficient representations exist. 243 // [Reg, Offset, DW_OP_plus] --> [DW_OP_breg, Offset]. 244 // [Reg, Offset, DW_OP_minus] --> [DW_OP_breg, -Offset]. 245 // If Reg is a subregister we need to mask it out before subtracting. 246 if (Op && ((Op->getOp() == dwarf::DW_OP_plus) || 247 (Op->getOp() == dwarf::DW_OP_minus && !SubRegisterSizeInBits))) { 248 int Offset = Op->getArg(0); 249 SignedOffset = (Op->getOp() == dwarf::DW_OP_plus) ? Offset : -Offset; 250 ExprCursor.take(); 251 } 252 if (FBReg) 253 addFBReg(SignedOffset); 254 else 255 addBReg(Reg.DwarfRegNo, SignedOffset); 256 DwarfRegs.clear(); 257 return true; 258 } 259 260 /// Assuming a well-formed expression, match "DW_OP_deref* DW_OP_LLVM_fragment?". 261 static bool isMemoryLocation(DIExpressionCursor ExprCursor) { 262 while (ExprCursor) { 263 auto Op = ExprCursor.take(); 264 switch (Op->getOp()) { 265 case dwarf::DW_OP_deref: 266 case dwarf::DW_OP_LLVM_fragment: 267 break; 268 default: 269 return false; 270 } 271 } 272 return true; 273 } 274 275 void DwarfExpression::addExpression(DIExpressionCursor &&ExprCursor, 276 unsigned FragmentOffsetInBits) { 277 // If we need to mask out a subregister, do it now, unless the next 278 // operation would emit an OpPiece anyway. 279 auto N = ExprCursor.peek(); 280 if (SubRegisterSizeInBits && N && (N->getOp() != dwarf::DW_OP_LLVM_fragment)) 281 maskSubRegister(); 282 283 while (ExprCursor) { 284 auto Op = ExprCursor.take(); 285 switch (Op->getOp()) { 286 case dwarf::DW_OP_LLVM_fragment: { 287 unsigned SizeInBits = Op->getArg(1); 288 unsigned FragmentOffset = Op->getArg(0); 289 // The fragment offset must have already been adjusted by emitting an 290 // empty DW_OP_piece / DW_OP_bit_piece before we emitted the base 291 // location. 292 assert(OffsetInBits >= FragmentOffset && "fragment offset not added?"); 293 294 // If addMachineReg already emitted DW_OP_piece operations to represent 295 // a super-register by splicing together sub-registers, subtract the size 296 // of the pieces that was already emitted. 297 SizeInBits -= OffsetInBits - FragmentOffset; 298 299 // If addMachineReg requested a DW_OP_bit_piece to stencil out a 300 // sub-register that is smaller than the current fragment's size, use it. 301 if (SubRegisterSizeInBits) 302 SizeInBits = std::min<unsigned>(SizeInBits, SubRegisterSizeInBits); 303 304 // Emit a DW_OP_stack_value for implicit location descriptions. 305 if (LocationKind == Implicit) 306 addStackValue(); 307 308 // Emit the DW_OP_piece. 309 addOpPiece(SizeInBits, SubRegisterOffsetInBits); 310 setSubRegisterPiece(0, 0); 311 // Reset the location description kind. 312 LocationKind = Unknown; 313 return; 314 } 315 case dwarf::DW_OP_plus: 316 assert(LocationKind != Register); 317 emitOp(dwarf::DW_OP_plus_uconst); 318 emitUnsigned(Op->getArg(0)); 319 break; 320 case dwarf::DW_OP_minus: 321 assert(LocationKind != Register); 322 // There is no DW_OP_minus_uconst. 323 emitOp(dwarf::DW_OP_constu); 324 emitUnsigned(Op->getArg(0)); 325 emitOp(dwarf::DW_OP_minus); 326 break; 327 case dwarf::DW_OP_deref: { 328 assert(LocationKind != Register); 329 if (LocationKind != Memory && isMemoryLocation(ExprCursor)) 330 // Turning this into a memory location description makes the deref 331 // implicit. 332 LocationKind = Memory; 333 else 334 emitOp(dwarf::DW_OP_deref); 335 break; 336 } 337 case dwarf::DW_OP_constu: 338 assert(LocationKind != Register); 339 emitOp(dwarf::DW_OP_constu); 340 emitUnsigned(Op->getArg(0)); 341 break; 342 case dwarf::DW_OP_stack_value: 343 assert(LocationKind == Unknown || LocationKind == Implicit); 344 LocationKind = Implicit; 345 break; 346 case dwarf::DW_OP_swap: 347 assert(LocationKind != Register); 348 emitOp(dwarf::DW_OP_swap); 349 break; 350 case dwarf::DW_OP_xderef: 351 assert(LocationKind != Register); 352 emitOp(dwarf::DW_OP_xderef); 353 break; 354 default: 355 llvm_unreachable("unhandled opcode found in expression"); 356 } 357 } 358 359 if (LocationKind == Implicit) 360 // Turn this into an implicit location description. 361 addStackValue(); 362 } 363 364 /// add masking operations to stencil out a subregister. 365 void DwarfExpression::maskSubRegister() { 366 assert(SubRegisterSizeInBits && "no subregister was registered"); 367 if (SubRegisterOffsetInBits > 0) 368 addShr(SubRegisterOffsetInBits); 369 uint64_t Mask = (1ULL << (uint64_t)SubRegisterSizeInBits) - 1ULL; 370 addAnd(Mask); 371 } 372 373 374 void DwarfExpression::finalize() { 375 assert(DwarfRegs.size() == 0 && "dwarf registers not emitted"); 376 // Emit any outstanding DW_OP_piece operations to mask out subregisters. 377 if (SubRegisterSizeInBits == 0) 378 return; 379 // Don't emit a DW_OP_piece for a subregister at offset 0. 380 if (SubRegisterOffsetInBits == 0) 381 return; 382 addOpPiece(SubRegisterSizeInBits, SubRegisterOffsetInBits); 383 } 384 385 void DwarfExpression::addFragmentOffset(const DIExpression *Expr) { 386 if (!Expr || !Expr->isFragment()) 387 return; 388 389 uint64_t FragmentOffset = Expr->getFragmentInfo()->OffsetInBits; 390 assert(FragmentOffset >= OffsetInBits && 391 "overlapping or duplicate fragments"); 392 if (FragmentOffset > OffsetInBits) 393 addOpPiece(FragmentOffset - OffsetInBits); 394 OffsetInBits = FragmentOffset; 395 } 396