blob: 5dec591c7225f1af4fef5cfa27f2cd35ff99f1e9 [file] [log] [blame]
Hsiangkai Wang2532ac82018-08-17 15:22:04 +00001//===- llvm/CodeGen/AsmPrinter/DbgEntityHistoryCalculator.cpp -------------===//
Alexey Samsonov414b6fb2014-04-30 21:34:11 +00002//
Chandler Carruth2946cd72019-01-19 08:50:56 +00003// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
Alexey Samsonov414b6fb2014-04-30 21:34:11 +00006//
7//===----------------------------------------------------------------------===//
8
Yonghong Song61b189e2018-12-18 23:10:17 +00009#include "llvm/CodeGen/DbgEntityHistoryCalculator.h"
Benjamin Kramer6bf8af52014-10-06 15:31:04 +000010#include "llvm/ADT/BitVector.h"
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +000011#include "llvm/ADT/STLExtras.h"
David Stenberg5ffec6d2019-04-10 11:28:20 +000012#include "llvm/ADT/SmallSet.h"
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +000013#include "llvm/ADT/SmallVector.h"
Alexey Samsonov414b6fb2014-04-30 21:34:11 +000014#include "llvm/CodeGen/MachineBasicBlock.h"
15#include "llvm/CodeGen/MachineFunction.h"
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +000016#include "llvm/CodeGen/MachineInstr.h"
17#include "llvm/CodeGen/MachineOperand.h"
David Blaikieb3bde2e2017-11-17 01:07:10 +000018#include "llvm/CodeGen/TargetLowering.h"
19#include "llvm/CodeGen/TargetRegisterInfo.h"
20#include "llvm/CodeGen/TargetSubtargetInfo.h"
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +000021#include "llvm/IR/DebugInfoMetadata.h"
22#include "llvm/IR/DebugLoc.h"
23#include "llvm/MC/MCRegisterInfo.h"
Alexey Samsonov414b6fb2014-04-30 21:34:11 +000024#include "llvm/Support/Debug.h"
Benjamin Kramer16132e62015-03-23 18:07:13 +000025#include "llvm/Support/raw_ostream.h"
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +000026#include <cassert>
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +000027#include <map>
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +000028#include <utility>
29
Benjamin Kramer6bf8af52014-10-06 15:31:04 +000030using namespace llvm;
Alexey Samsonov414b6fb2014-04-30 21:34:11 +000031
32#define DEBUG_TYPE "dwarfdebug"
33
David Stenberg5ffec6d2019-04-10 11:28:20 +000034namespace {
35using EntryIndex = DbgValueHistoryMap::EntryIndex;
36}
37
Adrian Prantl5f8f34e42018-05-01 15:54:18 +000038// If @MI is a DBG_VALUE with debug value described by a
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +000039// defined register, returns the number of this register.
40// In the other case, returns 0.
41static unsigned isDescribedByReg(const MachineInstr &MI) {
42 assert(MI.isDebugValue());
Adrian Prantl87b7eb92014-10-01 18:55:02 +000043 assert(MI.getNumOperands() == 4);
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +000044 // If location of variable is described using a register (directly or
Dominic Chen6ba19652016-08-11 17:52:40 +000045 // indirectly), this register is always a first operand.
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +000046 return MI.getOperand(0).isReg() ? MI.getOperand(0).getReg() : 0;
47}
48
David Stenberg5ffec6d2019-04-10 11:28:20 +000049bool DbgValueHistoryMap::startDbgValue(InlinedEntity Var,
50 const MachineInstr &MI,
51 EntryIndex &NewIndex) {
Alexey Samsonovbb2990d2014-05-27 23:09:50 +000052 // Instruction range should start with a DBG_VALUE instruction for the
53 // variable.
Adrian Prantl87b7eb92014-10-01 18:55:02 +000054 assert(MI.isDebugValue() && "not a DBG_VALUE");
David Stenberg6feef562019-04-10 09:07:43 +000055 auto &Entries = VarEntries[Var];
David Stenberg5ffec6d2019-04-10 11:28:20 +000056 if (!Entries.empty() && Entries.back().isDbgValue() &&
57 !Entries.back().isClosed() &&
58 Entries.back().getInstr()->isIdenticalTo(MI)) {
Nicola Zaghend34e60c2018-05-14 12:53:11 +000059 LLVM_DEBUG(dbgs() << "Coalescing identical DBG_VALUE entries:\n"
David Stenberg5ffec6d2019-04-10 11:28:20 +000060 << "\t" << Entries.back().getInstr() << "\t" << MI
David Stenberg37399792019-04-10 09:07:32 +000061 << "\n");
David Stenberg5ffec6d2019-04-10 11:28:20 +000062 return false;
Alexey Samsonovbb2990d2014-05-27 23:09:50 +000063 }
David Stenberg5ffec6d2019-04-10 11:28:20 +000064 Entries.emplace_back(&MI, Entry::DbgValue);
65 NewIndex = Entries.size() - 1;
66 return true;
Alexey Samsonovbb2990d2014-05-27 23:09:50 +000067}
68
David Stenberg5ffec6d2019-04-10 11:28:20 +000069EntryIndex DbgValueHistoryMap::startClobber(InlinedEntity Var,
70 const MachineInstr &MI) {
David Stenberg6feef562019-04-10 09:07:43 +000071 auto &Entries = VarEntries[Var];
David Stenberg5ffec6d2019-04-10 11:28:20 +000072 Entries.emplace_back(&MI, Entry::Clobber);
73 return Entries.size() - 1;
David Stenberg37399792019-04-10 09:07:32 +000074}
75
David Stenberg5ffec6d2019-04-10 11:28:20 +000076void DbgValueHistoryMap::Entry::endEntry(EntryIndex Index) {
Alexey Samsonovbb2990d2014-05-27 23:09:50 +000077 // For now, instruction ranges are not allowed to cross basic block
78 // boundaries.
David Stenberg5ffec6d2019-04-10 11:28:20 +000079 assert(isDbgValue() && "Setting end index for non-debug value");
80 assert(!isClosed() && "End index has already been set");
81 EndIndex = Index;
Alexey Samsonovbb2990d2014-05-27 23:09:50 +000082}
83
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +000084unsigned DbgValueHistoryMap::getRegisterForVar(InlinedEntity Var) const {
David Stenberg6feef562019-04-10 09:07:43 +000085 const auto &I = VarEntries.find(Var);
86 if (I == VarEntries.end())
Alexey Samsonovbb2990d2014-05-27 23:09:50 +000087 return 0;
David Stenberg6feef562019-04-10 09:07:43 +000088 const auto &Entries = I->second;
89 if (Entries.empty() || Entries.back().isClosed())
Alexey Samsonovbb2990d2014-05-27 23:09:50 +000090 return 0;
David Stenberg5ffec6d2019-04-10 11:28:20 +000091 if (Entries.back().isClobber())
92 return 0;
93 return isDescribedByReg(*Entries.back().getInstr());
Alexey Samsonovbb2990d2014-05-27 23:09:50 +000094}
95
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +000096void DbgLabelInstrMap::addInstr(InlinedEntity Label, const MachineInstr &MI) {
Hsiangkai Wang2532ac82018-08-17 15:22:04 +000097 assert(MI.isDebugLabel() && "not a DBG_LABEL");
98 LabelInstr[Label] = &MI;
99}
100
Alexey Samsonovbb2990d2014-05-27 23:09:50 +0000101namespace {
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +0000102
Alexey Samsonovbb2990d2014-05-27 23:09:50 +0000103// Maps physreg numbers to the variables they describe.
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +0000104using InlinedEntity = DbgValueHistoryMap::InlinedEntity;
105using RegDescribedVarsMap = std::map<unsigned, SmallVector<InlinedEntity, 1>>;
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +0000106
David Stenberg5ffec6d2019-04-10 11:28:20 +0000107// Keeps track of the debug value entries that are currently live for each
108// inlined entity. As the history map entries are stored in a SmallVector, they
109// may be moved at insertion of new entries, so store indices rather than
110// pointers.
111using DbgValueEntriesMap = std::map<InlinedEntity, SmallSet<EntryIndex, 1>>;
112
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +0000113} // end anonymous namespace
Alexey Samsonovbb2990d2014-05-27 23:09:50 +0000114
Adrian Prantl5f8f34e42018-05-01 15:54:18 +0000115// Claim that @Var is not described by @RegNo anymore.
Duncan P. N. Exon Smith62e0f452015-04-15 22:29:27 +0000116static void dropRegDescribedVar(RegDescribedVarsMap &RegVars, unsigned RegNo,
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +0000117 InlinedEntity Var) {
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000118 const auto &I = RegVars.find(RegNo);
119 assert(RegNo != 0U && I != RegVars.end());
120 auto &VarSet = I->second;
Eugene Zelenko6e07bfd2017-08-17 21:26:39 +0000121 const auto &VarPos = llvm::find(VarSet, Var);
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000122 assert(VarPos != VarSet.end());
123 VarSet.erase(VarPos);
124 // Don't keep empty sets in a map to keep it as small as possible.
125 if (VarSet.empty())
126 RegVars.erase(I);
127}
128
Adrian Prantl5f8f34e42018-05-01 15:54:18 +0000129// Claim that @Var is now described by @RegNo.
Duncan P. N. Exon Smith62e0f452015-04-15 22:29:27 +0000130static void addRegDescribedVar(RegDescribedVarsMap &RegVars, unsigned RegNo,
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +0000131 InlinedEntity Var) {
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000132 assert(RegNo != 0U);
Alexey Samsonovbb2990d2014-05-27 23:09:50 +0000133 auto &VarSet = RegVars[RegNo];
David Majnemer0d955d02016-08-11 22:21:41 +0000134 assert(!is_contained(VarSet, Var));
Alexey Samsonovbb2990d2014-05-27 23:09:50 +0000135 VarSet.push_back(Var);
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000136}
137
David Stenberg5ffec6d2019-04-10 11:28:20 +0000138static void clobberRegEntries(InlinedEntity Var, unsigned RegNo,
139 const MachineInstr &ClobberingInstr,
140 DbgValueEntriesMap &LiveEntries,
141 DbgValueHistoryMap &HistMap) {
142 EntryIndex ClobberIndex = HistMap.startClobber(Var, ClobberingInstr);
143
144 // TODO: Close all preceding live entries that are clobbered by this
145 // instruction.
146 EntryIndex ValueIndex = ClobberIndex - 1;
147 auto &ValueEntry = HistMap.getEntry(Var, ValueIndex);
148 ValueEntry.endEntry(ClobberIndex);
149 LiveEntries[Var].erase(ValueIndex);
150}
151
152/// Add a new debug value for \p Var. Closes all overlapping debug values.
153static void handleNewDebugValue(InlinedEntity Var, const MachineInstr &DV,
154 RegDescribedVarsMap &RegVars,
155 DbgValueEntriesMap &LiveEntries,
156 DbgValueHistoryMap &HistMap) {
157 // TODO: We should track all registers which this variable is currently
158 // described by.
159
160 if (unsigned PrevReg = HistMap.getRegisterForVar(Var))
161 dropRegDescribedVar(RegVars, PrevReg, Var);
162
163 EntryIndex NewIndex;
164 if (HistMap.startDbgValue(Var, DV, NewIndex)) {
165 // If we have created a new debug value entry, close all preceding
166 // live entries that overlap.
167 SmallVector<EntryIndex, 4> IndicesToErase;
168 const DIExpression *DIExpr = DV.getDebugExpression();
169 for (auto Index : LiveEntries[Var]) {
170 auto &Entry = HistMap.getEntry(Var, Index);
171 assert(Entry.isDbgValue() && "Not a DBG_VALUE in LiveEntries");
172 const MachineInstr &DV = *Entry.getInstr();
173 if (DIExpr->fragmentsOverlap(DV.getDebugExpression())) {
174 IndicesToErase.push_back(Index);
175 Entry.endEntry(NewIndex);
176 }
177 }
178 // Drop all entries that have ended, and mark the new entry as live.
179 for (auto Index : IndicesToErase)
180 LiveEntries[Var].erase(Index);
181 LiveEntries[Var].insert(NewIndex);
182 }
183
184 if (unsigned NewReg = isDescribedByReg(DV))
185 addRegDescribedVar(RegVars, NewReg, Var);
186}
187
Adrian Prantl5f8f34e42018-05-01 15:54:18 +0000188// Terminate the location range for variables described by register at
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000189// @I by inserting @ClobberingInstr to their history.
190static void clobberRegisterUses(RegDescribedVarsMap &RegVars,
191 RegDescribedVarsMap::iterator I,
192 DbgValueHistoryMap &HistMap,
David Stenberg5ffec6d2019-04-10 11:28:20 +0000193 DbgValueEntriesMap &LiveEntries,
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000194 const MachineInstr &ClobberingInstr) {
195 // Iterate over all variables described by this register and add this
196 // instruction to their history, clobbering it.
197 for (const auto &Var : I->second)
David Stenberg5ffec6d2019-04-10 11:28:20 +0000198 clobberRegEntries(Var, I->first, ClobberingInstr, LiveEntries, HistMap);
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000199 RegVars.erase(I);
200}
201
Adrian Prantl5f8f34e42018-05-01 15:54:18 +0000202// Terminate the location range for variables described by register
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000203// @RegNo by inserting @ClobberingInstr to their history.
204static void clobberRegisterUses(RegDescribedVarsMap &RegVars, unsigned RegNo,
205 DbgValueHistoryMap &HistMap,
David Stenberg5ffec6d2019-04-10 11:28:20 +0000206 DbgValueEntriesMap &LiveEntries,
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000207 const MachineInstr &ClobberingInstr) {
208 const auto &I = RegVars.find(RegNo);
209 if (I == RegVars.end())
210 return;
David Stenberg5ffec6d2019-04-10 11:28:20 +0000211 clobberRegisterUses(RegVars, I, HistMap, LiveEntries, ClobberingInstr);
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000212}
213
Adrian Prantl5f8f34e42018-05-01 15:54:18 +0000214// Returns the first instruction in @MBB which corresponds to
Alexey Samsonov8000e272014-06-09 21:53:47 +0000215// the function epilogue, or nullptr if @MBB doesn't contain an epilogue.
216static const MachineInstr *getFirstEpilogueInst(const MachineBasicBlock &MBB) {
217 auto LastMI = MBB.getLastNonDebugInstr();
218 if (LastMI == MBB.end() || !LastMI->isReturn())
219 return nullptr;
220 // Assume that epilogue starts with instruction having the same debug location
221 // as the return instruction.
222 DebugLoc LastLoc = LastMI->getDebugLoc();
223 auto Res = LastMI;
Duncan P. N. Exon Smith18720962016-09-11 18:51:28 +0000224 for (MachineBasicBlock::const_reverse_iterator I = LastMI.getReverse(),
225 E = MBB.rend();
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000226 I != E; ++I) {
Alexey Samsonov8000e272014-06-09 21:53:47 +0000227 if (I->getDebugLoc() != LastLoc)
Duncan P. N. Exon Smith5bff5112016-07-08 19:31:47 +0000228 return &*Res;
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000229 Res = &*I;
Alexey Samsonov8000e272014-06-09 21:53:47 +0000230 }
231 // If all instructions have the same debug location, assume whole MBB is
232 // an epilogue.
Duncan P. N. Exon Smith5bff5112016-07-08 19:31:47 +0000233 return &*MBB.begin();
Alexey Samsonov8000e272014-06-09 21:53:47 +0000234}
235
Adrian Prantl5f8f34e42018-05-01 15:54:18 +0000236// Collect registers that are modified in the function body (their
Adrian Prantl364d1312014-08-06 18:41:24 +0000237// contents is changed outside of the prologue and epilogue).
Alexey Samsonov8000e272014-06-09 21:53:47 +0000238static void collectChangingRegs(const MachineFunction *MF,
239 const TargetRegisterInfo *TRI,
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000240 BitVector &Regs) {
Alexey Samsonov8000e272014-06-09 21:53:47 +0000241 for (const auto &MBB : *MF) {
242 auto FirstEpilogueInst = getFirstEpilogueInst(MBB);
Adrian Prantle2d63752014-08-06 18:41:19 +0000243
Alexey Samsonov8000e272014-06-09 21:53:47 +0000244 for (const auto &MI : MBB) {
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000245 // Avoid looking at prologue or epilogue instructions.
Adrian Prantle2d63752014-08-06 18:41:19 +0000246 if (&MI == FirstEpilogueInst)
247 break;
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000248 if (MI.getFlag(MachineInstr::FrameSetup))
249 continue;
250
251 // Look for register defs and register masks. Register masks are
252 // typically on calls and they clobber everything not in the mask.
253 for (const MachineOperand &MO : MI.operands()) {
Dominic Chen6ba19652016-08-11 17:52:40 +0000254 // Skip virtual registers since they are handled by the parent.
255 if (MO.isReg() && MO.isDef() && MO.getReg() &&
256 !TRI->isVirtualRegister(MO.getReg())) {
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000257 for (MCRegAliasIterator AI(MO.getReg(), TRI, true); AI.isValid();
258 ++AI)
259 Regs.set(*AI);
260 } else if (MO.isRegMask()) {
261 Regs.setBitsNotInMask(MO.getRegMask());
262 }
263 }
Alexey Samsonov8000e272014-06-09 21:53:47 +0000264 }
265 }
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000266}
267
Hsiangkai Wang2532ac82018-08-17 15:22:04 +0000268void llvm::calculateDbgEntityHistory(const MachineFunction *MF,
269 const TargetRegisterInfo *TRI,
270 DbgValueHistoryMap &DbgValues,
271 DbgLabelInstrMap &DbgLabels) {
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000272 BitVector ChangingRegs(TRI->getNumRegs());
Alexey Samsonov8000e272014-06-09 21:53:47 +0000273 collectChangingRegs(MF, TRI, ChangingRegs);
Alexey Samsonov414b6fb2014-04-30 21:34:11 +0000274
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000275 const TargetLowering *TLI = MF->getSubtarget().getTargetLowering();
276 unsigned SP = TLI->getStackPointerRegisterToSaveRestore();
Alexey Samsonov8000e272014-06-09 21:53:47 +0000277 RegDescribedVarsMap RegVars;
David Stenberg5ffec6d2019-04-10 11:28:20 +0000278 DbgValueEntriesMap LiveEntries;
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000279 for (const auto &MBB : *MF) {
280 for (const auto &MI : MBB) {
Shiva Chen801bf7e2018-05-09 02:42:00 +0000281 if (!MI.isDebugInstr()) {
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000282 // Not a DBG_VALUE instruction. It may clobber registers which describe
283 // some variables.
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000284 for (const MachineOperand &MO : MI.operands()) {
285 if (MO.isReg() && MO.isDef() && MO.getReg()) {
Adrian Prantld9cd4d52017-06-01 21:14:58 +0000286 // Ignore call instructions that claim to clobber SP. The AArch64
287 // backend does this for aggregate function arguments.
288 if (MI.isCall() && MO.getReg() == SP)
289 continue;
Dominic Chen6ba19652016-08-11 17:52:40 +0000290 // If this is a virtual register, only clobber it since it doesn't
291 // have aliases.
292 if (TRI->isVirtualRegister(MO.getReg()))
David Stenberg5ffec6d2019-04-10 11:28:20 +0000293 clobberRegisterUses(RegVars, MO.getReg(), DbgValues, LiveEntries,
294 MI);
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000295 // If this is a register def operand, it may end a debug value
296 // range.
Dominic Chen6ba19652016-08-11 17:52:40 +0000297 else {
298 for (MCRegAliasIterator AI(MO.getReg(), TRI, true); AI.isValid();
299 ++AI)
300 if (ChangingRegs.test(*AI))
David Stenberg5ffec6d2019-04-10 11:28:20 +0000301 clobberRegisterUses(RegVars, *AI, DbgValues, LiveEntries, MI);
Dominic Chen6ba19652016-08-11 17:52:40 +0000302 }
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000303 } else if (MO.isRegMask()) {
304 // If this is a register mask operand, clobber all debug values in
305 // non-CSRs.
Francis Visoiu Mistrihb52e0362017-05-17 01:07:53 +0000306 for (unsigned I : ChangingRegs.set_bits()) {
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000307 // Don't consider SP to be clobbered by register masks.
308 if (unsigned(I) != SP && TRI->isPhysicalRegister(I) &&
309 MO.clobbersPhysReg(I)) {
David Stenberg5ffec6d2019-04-10 11:28:20 +0000310 clobberRegisterUses(RegVars, I, DbgValues, LiveEntries, MI);
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000311 }
312 }
313 }
314 }
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000315 continue;
Alexey Samsonov414b6fb2014-04-30 21:34:11 +0000316 }
Alexey Samsonov414b6fb2014-04-30 21:34:11 +0000317
Hsiangkai Wang2532ac82018-08-17 15:22:04 +0000318 if (MI.isDebugValue()) {
319 assert(MI.getNumOperands() > 1 && "Invalid DBG_VALUE instruction!");
320 // Use the base variable (without any DW_OP_piece expressions)
321 // as index into History. The full variables including the
322 // piece expressions are attached to the MI.
323 const DILocalVariable *RawVar = MI.getDebugVariable();
324 assert(RawVar->isValidLocationForIntrinsic(MI.getDebugLoc()) &&
325 "Expected inlined-at fields to agree");
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +0000326 InlinedEntity Var(RawVar, MI.getDebugLoc()->getInlinedAt());
Shiva Chen801bf7e2018-05-09 02:42:00 +0000327
David Stenberg5ffec6d2019-04-10 11:28:20 +0000328 handleNewDebugValue(Var, MI, RegVars, LiveEntries, DbgValues);
Hsiangkai Wang2532ac82018-08-17 15:22:04 +0000329 } else if (MI.isDebugLabel()) {
330 assert(MI.getNumOperands() == 1 && "Invalid DBG_LABEL instruction!");
331 const DILabel *RawLabel = MI.getDebugLabel();
332 assert(RawLabel->isValidLocationForIntrinsic(MI.getDebugLoc()) &&
333 "Expected inlined-at fields to agree");
334 // When collecting debug information for labels, there is no MCSymbol
335 // generated for it. So, we keep MachineInstr in DbgLabels in order
336 // to query MCSymbol afterward.
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +0000337 InlinedEntity L(RawLabel, MI.getDebugLoc()->getInlinedAt());
Hsiangkai Wang2532ac82018-08-17 15:22:04 +0000338 DbgLabels.addInstr(L, MI);
339 }
Alexey Samsonov414b6fb2014-04-30 21:34:11 +0000340 }
Alexey Samsonovdfcaf9c2014-05-20 18:34:54 +0000341
342 // Make sure locations for register-described variables are valid only
343 // until the end of the basic block (unless it's the last basic block, in
344 // which case let their liveness run off to the end of the function).
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000345 if (!MBB.empty() && &MBB != &MF->back()) {
346 for (auto I = RegVars.begin(), E = RegVars.end(); I != E;) {
347 auto CurElem = I++; // CurElem can be erased below.
Dominic Chen6ba19652016-08-11 17:52:40 +0000348 if (TRI->isVirtualRegister(CurElem->first) ||
349 ChangingRegs.test(CurElem->first))
David Stenberg5ffec6d2019-04-10 11:28:20 +0000350 clobberRegisterUses(RegVars, CurElem, DbgValues, LiveEntries,
351 MBB.back());
Benjamin Kramer6bf8af52014-10-06 15:31:04 +0000352 }
Alexey Samsonov8000e272014-06-09 21:53:47 +0000353 }
Alexey Samsonov414b6fb2014-04-30 21:34:11 +0000354 }
355}
Vedant Kumar7224c082018-06-01 22:33:15 +0000356
357#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
358LLVM_DUMP_METHOD void DbgValueHistoryMap::dump() const {
359 dbgs() << "DbgValueHistoryMap:\n";
360 for (const auto &VarRangePair : *this) {
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +0000361 const InlinedEntity &Var = VarRangePair.first;
David Stenberg6feef562019-04-10 09:07:43 +0000362 const Entries &Entries = VarRangePair.second;
Vedant Kumar7224c082018-06-01 22:33:15 +0000363
Hsiangkai Wang760c1ab2018-09-06 02:22:06 +0000364 const DILocalVariable *LocalVar = cast<DILocalVariable>(Var.first);
Vedant Kumar7224c082018-06-01 22:33:15 +0000365 const DILocation *Location = Var.second;
366
367 dbgs() << " - " << LocalVar->getName() << " at ";
368
369 if (Location)
370 dbgs() << Location->getFilename() << ":" << Location->getLine() << ":"
371 << Location->getColumn();
372 else
373 dbgs() << "<unknown location>";
374
375 dbgs() << " --\n";
376
David Stenberg5ffec6d2019-04-10 11:28:20 +0000377 for (const auto &E : enumerate(Entries)) {
378 const auto &Entry = E.value();
379 dbgs() << " Entry[" << E.index() << "]: ";
380 if (Entry.isDbgValue())
381 dbgs() << "Debug value\n";
382 else
383 dbgs() << "Clobber\n";
384 dbgs() << " Instr: " << *Entry.getInstr();
385 if (Entry.isDbgValue()) {
386 if (Entry.getEndIndex() == NoEntry)
387 dbgs() << " - Valid until end of function\n";
388 else
389 dbgs() << " - Closed by Entry[" << Entry.getEndIndex() << "]\n";
390 }
Vedant Kumar7224c082018-06-01 22:33:15 +0000391 dbgs() << "\n";
392 }
393 }
394}
395#endif