blob: 8d523377fb40b5926fb176618159ee9334339bb4 [file] [log] [blame]
Eugene Zelenko5df3d892017-08-24 21:21:39 +00001//===- LiveDebugValues.cpp - Tracking Debug Value MIs ---------------------===//
Vikram TV859ad292015-12-16 11:09:48 +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
Vikram TV859ad292015-12-16 11:09:48 +00006//
7//===----------------------------------------------------------------------===//
8///
9/// This pass implements a data flow analysis that propagates debug location
Jeremy Morse67443c32019-08-21 09:22:31 +000010/// information by inserting additional DBG_VALUE insts into the machine
11/// instruction stream. Before running, each DBG_VALUE inst corresponds to a
12/// source assignment of a variable. Afterwards, a DBG_VALUE inst specifies a
13/// variable location for the current basic block (see SourceLevelDebugging.rst).
Vikram TV859ad292015-12-16 11:09:48 +000014///
15/// This is a separate pass from DbgValueHistoryCalculator to facilitate
16/// testing and improve modularity.
17///
Jeremy Morse67443c32019-08-21 09:22:31 +000018/// Each variable location is represented by a VarLoc object that identifies the
19/// source variable, its current machine-location, and the DBG_VALUE inst that
20/// specifies the location. Each VarLoc is indexed in the (function-scope)
21/// VarLocMap, giving each VarLoc a unique index. Rather than operate directly
22/// on machine locations, the dataflow analysis in this pass identifies
23/// locations by their index in the VarLocMap, meaning all the variable
24/// locations in a block can be described by a sparse vector of VarLocMap
25/// indexes.
26///
Vikram TV859ad292015-12-16 11:09:48 +000027//===----------------------------------------------------------------------===//
28
Eugene Zelenko5df3d892017-08-24 21:21:39 +000029#include "llvm/ADT/DenseMap.h"
Daniel Berlin72560592016-01-10 18:08:32 +000030#include "llvm/ADT/PostOrderIterator.h"
31#include "llvm/ADT/SmallPtrSet.h"
Jeremy Morsebf2b2f02019-06-13 12:51:57 +000032#include "llvm/ADT/SmallSet.h"
Eugene Zelenko5df3d892017-08-24 21:21:39 +000033#include "llvm/ADT/SmallVector.h"
Adrian Prantl6ee02c72016-05-25 22:21:12 +000034#include "llvm/ADT/SparseBitVector.h"
Mehdi Aminib550cb12016-04-18 09:17:29 +000035#include "llvm/ADT/Statistic.h"
Adrian Prantl6ee02c72016-05-25 22:21:12 +000036#include "llvm/ADT/UniqueVector.h"
Adrian Prantl7f5866c2016-09-28 17:51:14 +000037#include "llvm/CodeGen/LexicalScopes.h"
Eugene Zelenko5df3d892017-08-24 21:21:39 +000038#include "llvm/CodeGen/MachineBasicBlock.h"
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +000039#include "llvm/CodeGen/MachineFrameInfo.h"
Vikram TV859ad292015-12-16 11:09:48 +000040#include "llvm/CodeGen/MachineFunction.h"
41#include "llvm/CodeGen/MachineFunctionPass.h"
Eugene Zelenko5df3d892017-08-24 21:21:39 +000042#include "llvm/CodeGen/MachineInstr.h"
Vikram TV859ad292015-12-16 11:09:48 +000043#include "llvm/CodeGen/MachineInstrBuilder.h"
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +000044#include "llvm/CodeGen/MachineMemOperand.h"
Eugene Zelenko5df3d892017-08-24 21:21:39 +000045#include "llvm/CodeGen/MachineOperand.h"
46#include "llvm/CodeGen/PseudoSourceValue.h"
Wolfgang Pieb90d856c2019-02-04 20:42:45 +000047#include "llvm/CodeGen/RegisterScavenging.h"
David Blaikie3f833ed2017-11-08 01:01:31 +000048#include "llvm/CodeGen/TargetFrameLowering.h"
49#include "llvm/CodeGen/TargetInstrInfo.h"
David Blaikieb3bde2e2017-11-17 01:07:10 +000050#include "llvm/CodeGen/TargetLowering.h"
Djordje Todorovic12aca5d2019-07-09 08:36:34 +000051#include "llvm/CodeGen/TargetPassConfig.h"
David Blaikieb3bde2e2017-11-17 01:07:10 +000052#include "llvm/CodeGen/TargetRegisterInfo.h"
53#include "llvm/CodeGen/TargetSubtargetInfo.h"
Nico Weber432a3882018-04-30 14:59:11 +000054#include "llvm/Config/llvm-config.h"
Wolfgang Pieb90d856c2019-02-04 20:42:45 +000055#include "llvm/IR/DIBuilder.h"
Eugene Zelenko5df3d892017-08-24 21:21:39 +000056#include "llvm/IR/DebugInfoMetadata.h"
57#include "llvm/IR/DebugLoc.h"
58#include "llvm/IR/Function.h"
59#include "llvm/IR/Module.h"
60#include "llvm/MC/MCRegisterInfo.h"
61#include "llvm/Pass.h"
62#include "llvm/Support/Casting.h"
63#include "llvm/Support/Compiler.h"
Vikram TV859ad292015-12-16 11:09:48 +000064#include "llvm/Support/Debug.h"
65#include "llvm/Support/raw_ostream.h"
Eugene Zelenko5df3d892017-08-24 21:21:39 +000066#include <algorithm>
67#include <cassert>
68#include <cstdint>
69#include <functional>
Mehdi Aminib550cb12016-04-18 09:17:29 +000070#include <queue>
Jeremy Morsebf2b2f02019-06-13 12:51:57 +000071#include <tuple>
Eugene Zelenko5df3d892017-08-24 21:21:39 +000072#include <utility>
73#include <vector>
Vikram TV859ad292015-12-16 11:09:48 +000074
75using namespace llvm;
76
Matthias Braun1527baa2017-05-25 21:26:32 +000077#define DEBUG_TYPE "livedebugvalues"
Vikram TV859ad292015-12-16 11:09:48 +000078
79STATISTIC(NumInserted, "Number of DBG_VALUE instructions inserted");
Jeremy Morse0ae54982019-08-23 16:33:42 +000080STATISTIC(NumRemoved, "Number of DBG_VALUE instructions removed");
Vikram TV859ad292015-12-16 11:09:48 +000081
Adrian Prantl5f8f34e42018-05-01 15:54:18 +000082// If @MI is a DBG_VALUE with debug value described by a defined
Adrian Prantl6ee02c72016-05-25 22:21:12 +000083// register, returns the number of this register. In the other case, returns 0.
Matt Arsenaulte3a676e2019-06-24 15:50:29 +000084static Register isDbgValueDescribedByReg(const MachineInstr &MI) {
Adrian Prantl6ee02c72016-05-25 22:21:12 +000085 assert(MI.isDebugValue() && "expected a DBG_VALUE");
86 assert(MI.getNumOperands() == 4 && "malformed DBG_VALUE");
87 // If location of variable is described using a register (directly
88 // or indirectly), this register is always a first operand.
Matt Arsenaulte3a676e2019-06-24 15:50:29 +000089 return MI.getOperand(0).isReg() ? MI.getOperand(0).getReg() : Register();
Adrian Prantl6ee02c72016-05-25 22:21:12 +000090}
91
Eugene Zelenko5df3d892017-08-24 21:21:39 +000092namespace {
Vikram TV859ad292015-12-16 11:09:48 +000093
Eugene Zelenko5df3d892017-08-24 21:21:39 +000094class LiveDebugValues : public MachineFunctionPass {
Vikram TV859ad292015-12-16 11:09:48 +000095private:
96 const TargetRegisterInfo *TRI;
97 const TargetInstrInfo *TII;
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +000098 const TargetFrameLowering *TFI;
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +000099 BitVector CalleeSavedRegs;
Adrian Prantl7f5866c2016-09-28 17:51:14 +0000100 LexicalScopes LS;
101
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000102 enum struct TransferKind { TransferCopy, TransferSpill, TransferRestore };
103
Adrian Prantl7f5866c2016-09-28 17:51:14 +0000104 /// Keeps track of lexical scopes associated with a user value's source
105 /// location.
106 class UserValueScopes {
107 DebugLoc DL;
108 LexicalScopes &LS;
109 SmallPtrSet<const MachineBasicBlock *, 4> LBlocks;
110
111 public:
112 UserValueScopes(DebugLoc D, LexicalScopes &L) : DL(std::move(D)), LS(L) {}
113
114 /// Return true if current scope dominates at least one machine
115 /// instruction in a given machine basic block.
116 bool dominates(MachineBasicBlock *MBB) {
117 if (LBlocks.empty())
118 LS.getMachineBasicBlocks(DL, LBlocks);
119 return LBlocks.count(MBB) != 0 || LS.dominates(DL, MBB);
120 }
121 };
Vikram TV859ad292015-12-16 11:09:48 +0000122
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000123 using FragmentInfo = DIExpression::FragmentInfo;
124 using OptFragmentInfo = Optional<DIExpression::FragmentInfo>;
Vikram TV859ad292015-12-16 11:09:48 +0000125
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000126 /// Storage for identifying a potentially inlined instance of a variable,
127 /// or a fragment thereof.
128 class DebugVariable {
129 const DILocalVariable *Variable;
130 OptFragmentInfo Fragment;
131 const DILocation *InlinedAt;
Vikram TV859ad292015-12-16 11:09:48 +0000132
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000133 /// Fragment that will overlap all other fragments. Used as default when
134 /// caller demands a fragment.
135 static const FragmentInfo DefaultFragment;
136
137 public:
138 DebugVariable(const DILocalVariable *Var, OptFragmentInfo &&FragmentInfo,
139 const DILocation *InlinedAt)
140 : Variable(Var), Fragment(FragmentInfo), InlinedAt(InlinedAt) {}
141
142 DebugVariable(const DILocalVariable *Var, OptFragmentInfo &FragmentInfo,
143 const DILocation *InlinedAt)
144 : Variable(Var), Fragment(FragmentInfo), InlinedAt(InlinedAt) {}
145
146 DebugVariable(const DILocalVariable *Var, const DIExpression *DIExpr,
147 const DILocation *InlinedAt)
148 : DebugVariable(Var, DIExpr->getFragmentInfo(), InlinedAt) {}
149
150 DebugVariable(const MachineInstr &MI)
151 : DebugVariable(MI.getDebugVariable(),
152 MI.getDebugExpression()->getFragmentInfo(),
153 MI.getDebugLoc()->getInlinedAt()) {}
154
155 const DILocalVariable *getVar() const { return Variable; }
156 const OptFragmentInfo &getFragment() const { return Fragment; }
157 const DILocation *getInlinedAt() const { return InlinedAt; }
158
159 const FragmentInfo getFragmentDefault() const {
160 return Fragment.getValueOr(DefaultFragment);
161 }
162
163 static bool isFragmentDefault(FragmentInfo &F) {
164 return F == DefaultFragment;
165 }
166
167 bool operator==(const DebugVariable &Other) const {
168 return std::tie(Variable, Fragment, InlinedAt) ==
169 std::tie(Other.Variable, Other.Fragment, Other.InlinedAt);
170 }
171
172 bool operator<(const DebugVariable &Other) const {
173 return std::tie(Variable, Fragment, InlinedAt) <
174 std::tie(Other.Variable, Other.Fragment, Other.InlinedAt);
Vikram TV859ad292015-12-16 11:09:48 +0000175 }
176 };
177
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000178 friend struct llvm::DenseMapInfo<DebugVariable>;
179
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000180 /// A pair of debug variable and value location.
Vikram TV859ad292015-12-16 11:09:48 +0000181 struct VarLoc {
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000182 // The location at which a spilled variable resides. It consists of a
183 // register and an offset.
184 struct SpillLoc {
185 unsigned SpillBase;
186 int SpillOffset;
187 bool operator==(const SpillLoc &Other) const {
188 return SpillBase == Other.SpillBase && SpillOffset == Other.SpillOffset;
189 }
190 };
191
Jeremy Morse337a7cb2019-09-04 11:09:05 +0000192 /// Identity of the variable at this location.
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000193 const DebugVariable Var;
Jeremy Morse337a7cb2019-09-04 11:09:05 +0000194
195 /// The expression applied to this location.
196 const DIExpression *Expr;
197
198 /// DBG_VALUE to clone var/expr information from if this location
199 /// is moved.
200 const MachineInstr &MI;
201
Adrian Prantl7f5866c2016-09-28 17:51:14 +0000202 mutable UserValueScopes UVS;
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000203 enum VarLocKind {
204 InvalidKind = 0,
205 RegisterKind,
Jeremy Morsebcff4172019-06-10 15:23:46 +0000206 SpillLocKind,
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000207 ImmediateKind,
208 EntryValueKind
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000209 } Kind = InvalidKind;
Vikram TV859ad292015-12-16 11:09:48 +0000210
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000211 /// The value location. Stored separately to avoid repeatedly
212 /// extracting it from MI.
213 union {
Adrian Prantl359846f2017-07-28 23:25:51 +0000214 uint64_t RegNo;
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000215 SpillLoc SpillLocation;
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000216 uint64_t Hash;
Jeremy Morsebcff4172019-06-10 15:23:46 +0000217 int64_t Immediate;
218 const ConstantFP *FPImm;
219 const ConstantInt *CImm;
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000220 } Loc;
221
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000222 VarLoc(const MachineInstr &MI, LexicalScopes &LS,
Jeremy Morse337a7cb2019-09-04 11:09:05 +0000223 VarLocKind K = InvalidKind)
224 : Var(MI), Expr(MI.getDebugExpression()), MI(MI),
225 UVS(MI.getDebugLoc(), LS) {
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000226 static_assert((sizeof(Loc) == sizeof(uint64_t)),
227 "hash does not cover all members of Loc");
228 assert(MI.isDebugValue() && "not a DBG_VALUE");
229 assert(MI.getNumOperands() == 4 && "malformed DBG_VALUE");
Adrian Prantl00698732016-05-25 22:37:29 +0000230 if (int RegNo = isDbgValueDescribedByReg(MI)) {
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000231 Kind = MI.isDebugEntryValue() ? EntryValueKind : RegisterKind;
Adrian Prantl359846f2017-07-28 23:25:51 +0000232 Loc.RegNo = RegNo;
Jeremy Morsebcff4172019-06-10 15:23:46 +0000233 } else if (MI.getOperand(0).isImm()) {
234 Kind = ImmediateKind;
235 Loc.Immediate = MI.getOperand(0).getImm();
236 } else if (MI.getOperand(0).isFPImm()) {
237 Kind = ImmediateKind;
238 Loc.FPImm = MI.getOperand(0).getFPImm();
239 } else if (MI.getOperand(0).isCImm()) {
240 Kind = ImmediateKind;
241 Loc.CImm = MI.getOperand(0).getCImm();
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000242 }
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000243 assert((Kind != ImmediateKind || !MI.isDebugEntryValue()) &&
244 "entry values must be register locations");
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000245 }
246
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000247 /// The constructor for spill locations.
248 VarLoc(const MachineInstr &MI, unsigned SpillBase, int SpillOffset,
Jeremy Morse8b593482019-08-16 10:04:17 +0000249 LexicalScopes &LS, const MachineInstr &OrigMI)
Jeremy Morse337a7cb2019-09-04 11:09:05 +0000250 : Var(MI), Expr(MI.getDebugExpression()), MI(OrigMI),
251 UVS(MI.getDebugLoc(), LS) {
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000252 assert(MI.isDebugValue() && "not a DBG_VALUE");
253 assert(MI.getNumOperands() == 4 && "malformed DBG_VALUE");
254 Kind = SpillLocKind;
255 Loc.SpillLocation = {SpillBase, SpillOffset};
256 }
257
Jeremy Morsebcff4172019-06-10 15:23:46 +0000258 // Is the Loc field a constant or constant object?
259 bool isConstant() const { return Kind == ImmediateKind; }
260
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000261 /// If this variable is described by a register, return it,
262 /// otherwise return 0.
263 unsigned isDescribedByReg() const {
264 if (Kind == RegisterKind)
Adrian Prantl359846f2017-07-28 23:25:51 +0000265 return Loc.RegNo;
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000266 return 0;
267 }
268
Adrian Prantl7f5866c2016-09-28 17:51:14 +0000269 /// Determine whether the lexical scope of this value's debug location
270 /// dominates MBB.
271 bool dominates(MachineBasicBlock &MBB) const { return UVS.dominates(&MBB); }
272
Aaron Ballman615eb472017-10-15 14:32:27 +0000273#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
Matthias Braun194ded52017-01-28 06:53:55 +0000274 LLVM_DUMP_METHOD void dump() const { MI.dump(); }
275#endif
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000276
277 bool operator==(const VarLoc &Other) const {
Jeremy Morsebcff4172019-06-10 15:23:46 +0000278 return Kind == Other.Kind && Var == Other.Var &&
Jeremy Morse337a7cb2019-09-04 11:09:05 +0000279 Loc.Hash == Other.Loc.Hash && Expr == Other.Expr;
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000280 }
281
Adrian Prantl7509d542016-05-26 21:42:47 +0000282 /// This operator guarantees that VarLocs are sorted by Variable first.
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000283 bool operator<(const VarLoc &Other) const {
Jeremy Morse337a7cb2019-09-04 11:09:05 +0000284 return std::tie(Var, Kind, Loc.Hash, Expr) <
285 std::tie(Other.Var, Other.Kind, Other.Loc.Hash, Other.Expr);
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000286 }
Vikram TV859ad292015-12-16 11:09:48 +0000287 };
288
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000289 using DebugParamMap = SmallDenseMap<const DILocalVariable *, MachineInstr *>;
Eugene Zelenko5df3d892017-08-24 21:21:39 +0000290 using VarLocMap = UniqueVector<VarLoc>;
291 using VarLocSet = SparseBitVector<>;
292 using VarLocInMBB = SmallDenseMap<const MachineBasicBlock *, VarLocSet>;
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000293 struct TransferDebugPair {
294 MachineInstr *TransferInst;
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000295 MachineInstr *DebugInst;
296 };
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000297 using TransferMap = SmallVector<TransferDebugPair, 4>;
Vikram TV859ad292015-12-16 11:09:48 +0000298
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000299 // Types for recording sets of variable fragments that overlap. For a given
300 // local variable, we record all other fragments of that variable that could
301 // overlap it, to reduce search time.
302 using FragmentOfVar =
303 std::pair<const DILocalVariable *, DIExpression::FragmentInfo>;
304 using OverlapMap =
305 DenseMap<FragmentOfVar, SmallVector<DIExpression::FragmentInfo, 1>>;
306
307 // Helper while building OverlapMap, a map of all fragments seen for a given
308 // DILocalVariable.
309 using VarToFragments =
310 DenseMap<const DILocalVariable *, SmallSet<FragmentInfo, 4>>;
311
Adrian Prantl7509d542016-05-26 21:42:47 +0000312 /// This holds the working set of currently open ranges. For fast
313 /// access, this is done both as a set of VarLocIDs, and a map of
314 /// DebugVariable to recent VarLocID. Note that a DBG_VALUE ends all
315 /// previous open ranges for the same variable.
316 class OpenRangesSet {
317 VarLocSet VarLocs;
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000318 SmallDenseMap<DebugVariable, unsigned, 8> Vars;
319 OverlapMap &OverlappingFragments;
Adrian Prantl7509d542016-05-26 21:42:47 +0000320
321 public:
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000322 OpenRangesSet(OverlapMap &_OLapMap) : OverlappingFragments(_OLapMap) {}
323
Adrian Prantl7509d542016-05-26 21:42:47 +0000324 const VarLocSet &getVarLocs() const { return VarLocs; }
325
326 /// Terminate all open ranges for Var by removing it from the set.
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000327 void erase(DebugVariable Var);
Adrian Prantl7509d542016-05-26 21:42:47 +0000328
329 /// Terminate all open ranges listed in \c KillSet by removing
330 /// them from the set.
331 void erase(const VarLocSet &KillSet, const VarLocMap &VarLocIDs) {
332 VarLocs.intersectWithComplement(KillSet);
333 for (unsigned ID : KillSet)
334 Vars.erase(VarLocIDs[ID].Var);
335 }
336
337 /// Insert a new range into the set.
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000338 void insert(unsigned VarLocID, DebugVariable Var) {
Adrian Prantl7509d542016-05-26 21:42:47 +0000339 VarLocs.set(VarLocID);
340 Vars.insert({Var, VarLocID});
341 }
342
Jeremy Morse67443c32019-08-21 09:22:31 +0000343 /// Insert a set of ranges.
344 void insertFromLocSet(const VarLocSet &ToLoad, const VarLocMap &Map) {
345 for (unsigned Id : ToLoad) {
346 const VarLoc &Var = Map[Id];
347 insert(Id, Var.Var);
348 }
349 }
350
Adrian Prantl7509d542016-05-26 21:42:47 +0000351 /// Empty the set.
352 void clear() {
353 VarLocs.clear();
354 Vars.clear();
355 }
356
357 /// Return whether the set is empty or not.
358 bool empty() const {
359 assert(Vars.empty() == VarLocs.empty() && "open ranges are inconsistent");
360 return VarLocs.empty();
361 }
362 };
363
Jeremy Morse5d9cd3b2019-09-06 10:08:22 +0000364 /// Tests whether this instruction is a spill to a stack location.
365 bool isSpillInstruction(const MachineInstr &MI, MachineFunction *MF);
366
367 /// Decide if @MI is a spill instruction and return true if it is. We use 2
368 /// criteria to make this decision:
369 /// - Is this instruction a store to a spill slot?
370 /// - Is there a register operand that is both used and killed?
371 /// TODO: Store optimization can fold spills into other stores (including
372 /// other spills). We do not handle this yet (more than one memory operand).
373 bool isLocationSpill(const MachineInstr &MI, MachineFunction *MF,
374 unsigned &Reg);
375
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000376 /// If a given instruction is identified as a spill, return the spill location
377 /// and set \p Reg to the spilled register.
378 Optional<VarLoc::SpillLoc> isRestoreInstruction(const MachineInstr &MI,
379 MachineFunction *MF,
380 unsigned &Reg);
381 /// Given a spill instruction, extract the register and offset used to
382 /// address the spill location in a target independent way.
383 VarLoc::SpillLoc extractSpillBaseRegAndOffset(const MachineInstr &MI);
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000384 void insertTransferDebugPair(MachineInstr &MI, OpenRangesSet &OpenRanges,
385 TransferMap &Transfers, VarLocMap &VarLocIDs,
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000386 unsigned OldVarID, TransferKind Kind,
387 unsigned NewReg = 0);
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000388
Adrian Prantl7509d542016-05-26 21:42:47 +0000389 void transferDebugValue(const MachineInstr &MI, OpenRangesSet &OpenRanges,
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000390 VarLocMap &VarLocIDs);
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000391 void transferSpillOrRestoreInst(MachineInstr &MI, OpenRangesSet &OpenRanges,
392 VarLocMap &VarLocIDs, TransferMap &Transfers);
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000393 void emitEntryValues(MachineInstr &MI, OpenRangesSet &OpenRanges,
394 VarLocMap &VarLocIDs, TransferMap &Transfers,
395 DebugParamMap &DebugEntryVals,
396 SparseBitVector<> &KillSet);
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000397 void transferRegisterCopy(MachineInstr &MI, OpenRangesSet &OpenRanges,
398 VarLocMap &VarLocIDs, TransferMap &Transfers);
Adrian Prantl7509d542016-05-26 21:42:47 +0000399 void transferRegisterDef(MachineInstr &MI, OpenRangesSet &OpenRanges,
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000400 VarLocMap &VarLocIDs, TransferMap &Transfers,
401 DebugParamMap &DebugEntryVals);
Jeremy Morse67443c32019-08-21 09:22:31 +0000402 bool transferTerminator(MachineBasicBlock *MBB, OpenRangesSet &OpenRanges,
403 VarLocInMBB &OutLocs, const VarLocMap &VarLocIDs);
Nikola Prica441ad622019-05-27 13:51:30 +0000404
Jeremy Morse67443c32019-08-21 09:22:31 +0000405 void process(MachineInstr &MI, OpenRangesSet &OpenRanges,
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000406 VarLocInMBB &OutLocs, VarLocMap &VarLocIDs,
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000407 TransferMap &Transfers, DebugParamMap &DebugEntryVals,
Jeremy Morse313d2ce2019-08-29 10:53:29 +0000408 OverlapMap &OverlapFragments,
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000409 VarToFragments &SeenFragments);
Vikram TV859ad292015-12-16 11:09:48 +0000410
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000411 void accumulateFragmentMap(MachineInstr &MI, VarToFragments &SeenFragments,
412 OverlapMap &OLapMap);
413
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000414 bool join(MachineBasicBlock &MBB, VarLocInMBB &OutLocs, VarLocInMBB &InLocs,
Keith Walker83ebef52016-09-27 16:46:07 +0000415 const VarLocMap &VarLocIDs,
Vedant Kumar8c466682018-10-05 21:44:15 +0000416 SmallPtrSet<const MachineBasicBlock *, 16> &Visited,
Jeremy Morse67443c32019-08-21 09:22:31 +0000417 SmallPtrSetImpl<const MachineBasicBlock *> &ArtificialBlocks,
418 VarLocInMBB &PendingInLocs);
419
420 /// Create DBG_VALUE insts for inlocs that have been propagated but
421 /// had their instruction creation deferred.
422 void flushPendingLocs(VarLocInMBB &PendingInLocs, VarLocMap &VarLocIDs);
Vikram TV859ad292015-12-16 11:09:48 +0000423
424 bool ExtendRanges(MachineFunction &MF);
425
426public:
427 static char ID;
428
429 /// Default construct and initialize the pass.
430 LiveDebugValues();
431
432 /// Tell the pass manager which passes we depend on and what
433 /// information we preserve.
434 void getAnalysisUsage(AnalysisUsage &AU) const override;
435
Derek Schuffad154c82016-03-28 17:05:30 +0000436 MachineFunctionProperties getRequiredProperties() const override {
437 return MachineFunctionProperties().set(
Matthias Braun1eb47362016-08-25 01:27:13 +0000438 MachineFunctionProperties::Property::NoVRegs);
Derek Schuffad154c82016-03-28 17:05:30 +0000439 }
440
Vikram TV859ad292015-12-16 11:09:48 +0000441 /// Print to ostream with a message.
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000442 void printVarLocInMBB(const MachineFunction &MF, const VarLocInMBB &V,
443 const VarLocMap &VarLocIDs, const char *msg,
Vikram TV859ad292015-12-16 11:09:48 +0000444 raw_ostream &Out) const;
445
446 /// Calculate the liveness information for the given machine function.
447 bool runOnMachineFunction(MachineFunction &MF) override;
448};
Adrian Prantl7f5866c2016-09-28 17:51:14 +0000449
Eugene Zelenko5df3d892017-08-24 21:21:39 +0000450} // end anonymous namespace
Vikram TV859ad292015-12-16 11:09:48 +0000451
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000452namespace llvm {
453
454template <> struct DenseMapInfo<LiveDebugValues::DebugVariable> {
455 using DV = LiveDebugValues::DebugVariable;
456 using OptFragmentInfo = LiveDebugValues::OptFragmentInfo;
457 using FragmentInfo = LiveDebugValues::FragmentInfo;
458
459 // Empty key: no key should be generated that has no DILocalVariable.
460 static inline DV getEmptyKey() {
461 return DV(nullptr, OptFragmentInfo(), nullptr);
462 }
463
464 // Difference in tombstone is that the Optional is meaningful
465 static inline DV getTombstoneKey() {
466 return DV(nullptr, OptFragmentInfo({0, 0}), nullptr);
467 }
468
469 static unsigned getHashValue(const DV &D) {
470 unsigned HV = 0;
471 const OptFragmentInfo &Fragment = D.getFragment();
472 if (Fragment)
473 HV = DenseMapInfo<FragmentInfo>::getHashValue(*Fragment);
474
475 return hash_combine(D.getVar(), HV, D.getInlinedAt());
476 }
477
478 static bool isEqual(const DV &A, const DV &B) { return A == B; }
479};
480
David Stenberg1278a192019-06-13 14:02:55 +0000481} // namespace llvm
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000482
Vikram TV859ad292015-12-16 11:09:48 +0000483//===----------------------------------------------------------------------===//
484// Implementation
485//===----------------------------------------------------------------------===//
486
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000487const DIExpression::FragmentInfo
488 LiveDebugValues::DebugVariable::DefaultFragment = {
489 std::numeric_limits<uint64_t>::max(),
490 std::numeric_limits<uint64_t>::min()};
491
Vikram TV859ad292015-12-16 11:09:48 +0000492char LiveDebugValues::ID = 0;
Eugene Zelenko5df3d892017-08-24 21:21:39 +0000493
Vikram TV859ad292015-12-16 11:09:48 +0000494char &llvm::LiveDebugValuesID = LiveDebugValues::ID;
Eugene Zelenko5df3d892017-08-24 21:21:39 +0000495
Matthias Braun1527baa2017-05-25 21:26:32 +0000496INITIALIZE_PASS(LiveDebugValues, DEBUG_TYPE, "Live DEBUG_VALUE analysis",
Vikram TV859ad292015-12-16 11:09:48 +0000497 false, false)
498
499/// Default construct and initialize the pass.
500LiveDebugValues::LiveDebugValues() : MachineFunctionPass(ID) {
501 initializeLiveDebugValuesPass(*PassRegistry::getPassRegistry());
502}
503
504/// Tell the pass manager which passes we depend on and what information we
505/// preserve.
506void LiveDebugValues::getAnalysisUsage(AnalysisUsage &AU) const {
Matt Arsenaultb1630a12016-06-08 05:18:01 +0000507 AU.setPreservesCFG();
Vikram TV859ad292015-12-16 11:09:48 +0000508 MachineFunctionPass::getAnalysisUsage(AU);
509}
510
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000511/// Erase a variable from the set of open ranges, and additionally erase any
512/// fragments that may overlap it.
513void LiveDebugValues::OpenRangesSet::erase(DebugVariable Var) {
514 // Erasure helper.
515 auto DoErase = [this](DebugVariable VarToErase) {
516 auto It = Vars.find(VarToErase);
517 if (It != Vars.end()) {
518 unsigned ID = It->second;
519 VarLocs.reset(ID);
520 Vars.erase(It);
521 }
522 };
523
524 // Erase the variable/fragment that ends here.
525 DoErase(Var);
526
527 // Extract the fragment. Interpret an empty fragment as one that covers all
528 // possible bits.
529 FragmentInfo ThisFragment = Var.getFragmentDefault();
530
531 // There may be fragments that overlap the designated fragment. Look them up
532 // in the pre-computed overlap map, and erase them too.
533 auto MapIt = OverlappingFragments.find({Var.getVar(), ThisFragment});
534 if (MapIt != OverlappingFragments.end()) {
535 for (auto Fragment : MapIt->second) {
536 LiveDebugValues::OptFragmentInfo FragmentHolder;
537 if (!DebugVariable::isFragmentDefault(Fragment))
538 FragmentHolder = LiveDebugValues::OptFragmentInfo(Fragment);
539 DoErase({Var.getVar(), FragmentHolder, Var.getInlinedAt()});
540 }
541 }
542}
543
Vikram TV859ad292015-12-16 11:09:48 +0000544//===----------------------------------------------------------------------===//
545// Debug Range Extension Implementation
546//===----------------------------------------------------------------------===//
547
Matthias Braun194ded52017-01-28 06:53:55 +0000548#ifndef NDEBUG
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000549void LiveDebugValues::printVarLocInMBB(const MachineFunction &MF,
550 const VarLocInMBB &V,
551 const VarLocMap &VarLocIDs,
552 const char *msg,
Vikram TV859ad292015-12-16 11:09:48 +0000553 raw_ostream &Out) const {
Keith Walkerf83a19f2016-09-20 16:04:31 +0000554 Out << '\n' << msg << '\n';
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000555 for (const MachineBasicBlock &BB : MF) {
Vedant Kumar9b558382018-10-05 21:44:00 +0000556 const VarLocSet &L = V.lookup(&BB);
557 if (L.empty())
558 continue;
559 Out << "MBB: " << BB.getNumber() << ":\n";
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000560 for (unsigned VLL : L) {
561 const VarLoc &VL = VarLocIDs[VLL];
Adrian Prantl7509d542016-05-26 21:42:47 +0000562 Out << " Var: " << VL.Var.getVar()->getName();
Vikram TV859ad292015-12-16 11:09:48 +0000563 Out << " MI: ";
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000564 VL.dump();
Vikram TV859ad292015-12-16 11:09:48 +0000565 }
566 }
567 Out << "\n";
568}
Matthias Braun194ded52017-01-28 06:53:55 +0000569#endif
Vikram TV859ad292015-12-16 11:09:48 +0000570
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000571LiveDebugValues::VarLoc::SpillLoc
572LiveDebugValues::extractSpillBaseRegAndOffset(const MachineInstr &MI) {
Fangrui Songf78650a2018-07-30 19:41:25 +0000573 assert(MI.hasOneMemOperand() &&
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000574 "Spill instruction does not have exactly one memory operand?");
575 auto MMOI = MI.memoperands_begin();
576 const PseudoSourceValue *PVal = (*MMOI)->getPseudoValue();
577 assert(PVal->kind() == PseudoSourceValue::FixedStack &&
578 "Inconsistent memory operand in spill instruction");
579 int FI = cast<FixedStackPseudoSourceValue>(PVal)->getFrameIndex();
580 const MachineBasicBlock *MBB = MI.getParent();
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000581 unsigned Reg;
582 int Offset = TFI->getFrameIndexReference(*MBB->getParent(), FI, Reg);
583 return {Reg, Offset};
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000584}
585
Vikram TV859ad292015-12-16 11:09:48 +0000586/// End all previous ranges related to @MI and start a new range from @MI
587/// if it is a DBG_VALUE instr.
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000588void LiveDebugValues::transferDebugValue(const MachineInstr &MI,
Adrian Prantl7509d542016-05-26 21:42:47 +0000589 OpenRangesSet &OpenRanges,
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000590 VarLocMap &VarLocIDs) {
Vikram TV859ad292015-12-16 11:09:48 +0000591 if (!MI.isDebugValue())
592 return;
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000593 const DILocalVariable *Var = MI.getDebugVariable();
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000594 const DIExpression *Expr = MI.getDebugExpression();
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000595 const DILocation *DebugLoc = MI.getDebugLoc();
596 const DILocation *InlinedAt = DebugLoc->getInlinedAt();
597 assert(Var->isValidLocationForIntrinsic(DebugLoc) &&
Vikram TV859ad292015-12-16 11:09:48 +0000598 "Expected inlined-at fields to agree");
Vikram TV859ad292015-12-16 11:09:48 +0000599
600 // End all previous ranges of Var.
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000601 DebugVariable V(Var, Expr, InlinedAt);
Adrian Prantl7509d542016-05-26 21:42:47 +0000602 OpenRanges.erase(V);
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000603
604 // Add the VarLoc to OpenRanges from this DBG_VALUE.
Jeremy Morsebcff4172019-06-10 15:23:46 +0000605 unsigned ID;
Djordje Todorovic774eabd2019-06-27 18:12:04 +0000606 if (isDbgValueDescribedByReg(MI) || MI.getOperand(0).isImm() ||
607 MI.getOperand(0).isFPImm() || MI.getOperand(0).isCImm()) {
Jeremy Morsebcff4172019-06-10 15:23:46 +0000608 // Use normal VarLoc constructor for registers and immediates.
Djordje Todorovic774eabd2019-06-27 18:12:04 +0000609 VarLoc VL(MI, LS);
Jeremy Morsebcff4172019-06-10 15:23:46 +0000610 ID = VarLocIDs.insert(VL);
Adrian Prantl7509d542016-05-26 21:42:47 +0000611 OpenRanges.insert(ID, VL.Var);
Jeremy Morsebcff4172019-06-10 15:23:46 +0000612 } else if (MI.hasOneMemOperand()) {
Jeremy Morse8b593482019-08-16 10:04:17 +0000613 llvm_unreachable("DBG_VALUE with mem operand encountered after regalloc?");
Jeremy Morsebcff4172019-06-10 15:23:46 +0000614 } else {
615 // This must be an undefined location. We should leave OpenRanges closed.
616 assert(MI.getOperand(0).isReg() && MI.getOperand(0).getReg() == 0 &&
617 "Unexpected non-undef DBG_VALUE encountered");
Adrian Prantl7509d542016-05-26 21:42:47 +0000618 }
Vikram TV859ad292015-12-16 11:09:48 +0000619}
620
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000621void LiveDebugValues::emitEntryValues(MachineInstr &MI,
622 OpenRangesSet &OpenRanges,
623 VarLocMap &VarLocIDs,
624 TransferMap &Transfers,
625 DebugParamMap &DebugEntryVals,
626 SparseBitVector<> &KillSet) {
627 MachineFunction *MF = MI.getParent()->getParent();
628 for (unsigned ID : KillSet) {
629 if (!VarLocIDs[ID].Var.getVar()->isParameter())
630 continue;
631
632 const MachineInstr *CurrDebugInstr = &VarLocIDs[ID].MI;
633
634 // If parameter's DBG_VALUE is not in the map that means we can't
635 // generate parameter's entry value.
636 if (!DebugEntryVals.count(CurrDebugInstr->getDebugVariable()))
637 continue;
638
639 auto ParamDebugInstr = DebugEntryVals[CurrDebugInstr->getDebugVariable()];
640 DIExpression *NewExpr = DIExpression::prepend(
641 ParamDebugInstr->getDebugExpression(), DIExpression::EntryValue);
642 MachineInstr *EntryValDbgMI =
643 BuildMI(*MF, ParamDebugInstr->getDebugLoc(), ParamDebugInstr->getDesc(),
644 ParamDebugInstr->isIndirectDebugValue(),
645 ParamDebugInstr->getOperand(0).getReg(),
646 ParamDebugInstr->getDebugVariable(), NewExpr);
647
648 if (ParamDebugInstr->isIndirectDebugValue())
649 EntryValDbgMI->getOperand(1).setImm(
650 ParamDebugInstr->getOperand(1).getImm());
651
652 Transfers.push_back({&MI, EntryValDbgMI});
653 VarLoc VL(*EntryValDbgMI, LS);
654 unsigned EntryValLocID = VarLocIDs.insert(VL);
655 OpenRanges.insert(EntryValLocID, VL.Var);
656 }
657}
658
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000659/// Create new TransferDebugPair and insert it in \p Transfers. The VarLoc
660/// with \p OldVarID should be deleted form \p OpenRanges and replaced with
661/// new VarLoc. If \p NewReg is different than default zero value then the
662/// new location will be register location created by the copy like instruction,
663/// otherwise it is variable's location on the stack.
664void LiveDebugValues::insertTransferDebugPair(
665 MachineInstr &MI, OpenRangesSet &OpenRanges, TransferMap &Transfers,
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000666 VarLocMap &VarLocIDs, unsigned OldVarID, TransferKind Kind,
667 unsigned NewReg) {
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000668 const MachineInstr *DebugInstr = &VarLocIDs[OldVarID].MI;
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000669 MachineFunction *MF = MI.getParent()->getParent();
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000670 MachineInstr *NewDebugInstr;
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000671
Nikola Prica2d0106a2019-06-03 09:48:29 +0000672 auto ProcessVarLoc = [&MI, &OpenRanges, &Transfers, &DebugInstr,
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000673 &VarLocIDs](VarLoc &VL, MachineInstr *NewDebugInstr) {
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000674 unsigned LocId = VarLocIDs.insert(VL);
Nikola Prica2d0106a2019-06-03 09:48:29 +0000675
676 // Close this variable's previous location range.
Jeremy Morsebf2b2f02019-06-13 12:51:57 +0000677 DebugVariable V(*DebugInstr);
Nikola Prica2d0106a2019-06-03 09:48:29 +0000678 OpenRanges.erase(V);
679
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000680 OpenRanges.insert(LocId, VL.Var);
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000681 // The newly created DBG_VALUE instruction NewDebugInstr must be inserted
682 // after MI. Keep track of the pairing.
683 TransferDebugPair MIP = {&MI, NewDebugInstr};
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000684 Transfers.push_back(MIP);
685 };
686
687 // End all previous ranges of Var.
688 OpenRanges.erase(VarLocIDs[OldVarID].Var);
689 switch (Kind) {
690 case TransferKind::TransferCopy: {
691 assert(NewReg &&
692 "No register supplied when handling a copy of a debug value");
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000693 // Create a DBG_VALUE instruction to describe the Var in its new
694 // register location.
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000695 NewDebugInstr = BuildMI(
696 *MF, DebugInstr->getDebugLoc(), DebugInstr->getDesc(),
697 DebugInstr->isIndirectDebugValue(), NewReg,
698 DebugInstr->getDebugVariable(), DebugInstr->getDebugExpression());
699 if (DebugInstr->isIndirectDebugValue())
700 NewDebugInstr->getOperand(1).setImm(DebugInstr->getOperand(1).getImm());
701 VarLoc VL(*NewDebugInstr, LS);
702 ProcessVarLoc(VL, NewDebugInstr);
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000703 LLVM_DEBUG(dbgs() << "Creating DBG_VALUE inst for register copy: ";
Craig Topper78c794a2019-06-02 01:36:48 +0000704 NewDebugInstr->print(dbgs(), /*IsStandalone*/false,
705 /*SkipOpers*/false, /*SkipDebugLoc*/false,
706 /*AddNewLine*/true, TII));
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000707 return;
708 }
709 case TransferKind::TransferSpill: {
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000710 // Create a DBG_VALUE instruction to describe the Var in its spilled
711 // location.
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000712 VarLoc::SpillLoc SpillLocation = extractSpillBaseRegAndOffset(MI);
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000713 auto *SpillExpr = DIExpression::prepend(DebugInstr->getDebugExpression(),
Petar Jovanovice85bbf52019-05-20 10:35:57 +0000714 DIExpression::ApplyOffset,
715 SpillLocation.SpillOffset);
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000716 NewDebugInstr = BuildMI(
717 *MF, DebugInstr->getDebugLoc(), DebugInstr->getDesc(), true,
718 SpillLocation.SpillBase, DebugInstr->getDebugVariable(), SpillExpr);
719 VarLoc VL(*NewDebugInstr, SpillLocation.SpillBase,
Jeremy Morse8b593482019-08-16 10:04:17 +0000720 SpillLocation.SpillOffset, LS, *DebugInstr);
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000721 ProcessVarLoc(VL, NewDebugInstr);
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000722 LLVM_DEBUG(dbgs() << "Creating DBG_VALUE inst for spill: ";
Craig Topper78c794a2019-06-02 01:36:48 +0000723 NewDebugInstr->print(dbgs(), /*IsStandalone*/false,
724 /*SkipOpers*/false, /*SkipDebugLoc*/false,
725 /*AddNewLine*/true, TII));
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000726 return;
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000727 }
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000728 case TransferKind::TransferRestore: {
729 assert(NewReg &&
730 "No register supplied when handling a restore of a debug value");
731 MachineFunction *MF = MI.getMF();
732 DIBuilder DIB(*const_cast<Function &>(MF->getFunction()).getParent());
Jeremy Morse8b593482019-08-16 10:04:17 +0000733 // DebugInstr refers to the pre-spill location, therefore we can reuse
734 // its expression.
735 NewDebugInstr = BuildMI(
736 *MF, DebugInstr->getDebugLoc(), DebugInstr->getDesc(), false, NewReg,
737 DebugInstr->getDebugVariable(), DebugInstr->getDebugExpression());
Petar Jovanovicaa28b6d2019-05-23 13:49:06 +0000738 VarLoc VL(*NewDebugInstr, LS);
739 ProcessVarLoc(VL, NewDebugInstr);
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000740 LLVM_DEBUG(dbgs() << "Creating DBG_VALUE inst for register restore: ";
Craig Topper78c794a2019-06-02 01:36:48 +0000741 NewDebugInstr->print(dbgs(), /*IsStandalone*/false,
742 /*SkipOpers*/false, /*SkipDebugLoc*/false,
743 /*AddNewLine*/true, TII));
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000744 return;
745 }
746 }
747 llvm_unreachable("Invalid transfer kind");
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000748}
749
Vikram TV859ad292015-12-16 11:09:48 +0000750/// A definition of a register may mark the end of a range.
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000751void LiveDebugValues::transferRegisterDef(
752 MachineInstr &MI, OpenRangesSet &OpenRanges, VarLocMap &VarLocIDs,
753 TransferMap &Transfers, DebugParamMap &DebugEntryVals) {
Justin Bognerfdf9bf42017-10-10 23:50:49 +0000754 MachineFunction *MF = MI.getMF();
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000755 const TargetLowering *TLI = MF->getSubtarget().getTargetLowering();
756 unsigned SP = TLI->getStackPointerRegisterToSaveRestore();
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000757 SparseBitVector<> KillSet;
Vikram TV859ad292015-12-16 11:09:48 +0000758 for (const MachineOperand &MO : MI.operands()) {
Adrian Prantlea8880b2017-03-03 01:08:25 +0000759 // Determine whether the operand is a register def. Assume that call
760 // instructions never clobber SP, because some backends (e.g., AArch64)
761 // never list SP in the regmask.
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000762 if (MO.isReg() && MO.isDef() && MO.getReg() &&
Daniel Sanders2bea69b2019-08-01 23:27:28 +0000763 Register::isPhysicalRegister(MO.getReg()) &&
Adrian Prantlea8880b2017-03-03 01:08:25 +0000764 !(MI.isCall() && MO.getReg() == SP)) {
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000765 // Remove ranges of all aliased registers.
766 for (MCRegAliasIterator RAI(MO.getReg(), TRI, true); RAI.isValid(); ++RAI)
Adrian Prantl7509d542016-05-26 21:42:47 +0000767 for (unsigned ID : OpenRanges.getVarLocs())
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000768 if (VarLocIDs[ID].isDescribedByReg() == *RAI)
769 KillSet.set(ID);
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000770 } else if (MO.isRegMask()) {
771 // Remove ranges of all clobbered registers. Register masks don't usually
772 // list SP as preserved. While the debug info may be off for an
773 // instruction or two around callee-cleanup calls, transferring the
774 // DEBUG_VALUE across the call is still a better user experience.
Adrian Prantl7509d542016-05-26 21:42:47 +0000775 for (unsigned ID : OpenRanges.getVarLocs()) {
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000776 unsigned Reg = VarLocIDs[ID].isDescribedByReg();
777 if (Reg && Reg != SP && MO.clobbersPhysReg(Reg))
778 KillSet.set(ID);
779 }
Reid Klecknerf6f04f82016-03-25 17:54:46 +0000780 }
Vikram TV859ad292015-12-16 11:09:48 +0000781 }
Adrian Prantl7509d542016-05-26 21:42:47 +0000782 OpenRanges.erase(KillSet, VarLocIDs);
Djordje Todorovic12aca5d2019-07-09 08:36:34 +0000783
784 if (auto *TPC = getAnalysisIfAvailable<TargetPassConfig>()) {
785 auto &TM = TPC->getTM<TargetMachine>();
786 if (TM.Options.EnableDebugEntryValues)
787 emitEntryValues(MI, OpenRanges, VarLocIDs, Transfers, DebugEntryVals,
788 KillSet);
789 }
Vikram TV859ad292015-12-16 11:09:48 +0000790}
791
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000792bool LiveDebugValues::isSpillInstruction(const MachineInstr &MI,
Jeremy Morse5d9cd3b2019-09-06 10:08:22 +0000793 MachineFunction *MF) {
Fangrui Songf78650a2018-07-30 19:41:25 +0000794 // TODO: Handle multiple stores folded into one.
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000795 if (!MI.hasOneMemOperand())
796 return false;
797
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000798 if (!MI.getSpillSize(TII) && !MI.getFoldedSpillSize(TII))
799 return false; // This is not a spill instruction, since no valid size was
800 // returned from either function.
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000801
Jeremy Morse5d9cd3b2019-09-06 10:08:22 +0000802 return true;
803}
804
805bool LiveDebugValues::isLocationSpill(const MachineInstr &MI,
806 MachineFunction *MF, unsigned &Reg) {
807 if (!isSpillInstruction(MI, MF))
808 return false;
809
Petar Jovanovic0b464e42018-01-16 14:46:05 +0000810 auto isKilledReg = [&](const MachineOperand MO, unsigned &Reg) {
811 if (!MO.isReg() || !MO.isUse()) {
812 Reg = 0;
813 return false;
814 }
815 Reg = MO.getReg();
816 return MO.isKill();
817 };
818
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000819 for (const MachineOperand &MO : MI.operands()) {
Petar Jovanovic0b464e42018-01-16 14:46:05 +0000820 // In a spill instruction generated by the InlineSpiller the spilled
821 // register has its kill flag set.
822 if (isKilledReg(MO, Reg))
823 return true;
824 if (Reg != 0) {
825 // Check whether next instruction kills the spilled register.
826 // FIXME: Current solution does not cover search for killed register in
827 // bundles and instructions further down the chain.
828 auto NextI = std::next(MI.getIterator());
829 // Skip next instruction that points to basic block end iterator.
830 if (MI.getParent()->end() == NextI)
831 continue;
832 unsigned RegNext;
833 for (const MachineOperand &MONext : NextI->operands()) {
834 // Return true if we came across the register from the
835 // previous spill instruction that is killed in NextI.
836 if (isKilledReg(MONext, RegNext) && RegNext == Reg)
837 return true;
838 }
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000839 }
840 }
Petar Jovanovic0b464e42018-01-16 14:46:05 +0000841 // Return false if we didn't find spilled register.
842 return false;
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000843}
844
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000845Optional<LiveDebugValues::VarLoc::SpillLoc>
846LiveDebugValues::isRestoreInstruction(const MachineInstr &MI,
847 MachineFunction *MF, unsigned &Reg) {
848 if (!MI.hasOneMemOperand())
849 return None;
850
851 // FIXME: Handle folded restore instructions with more than one memory
852 // operand.
853 if (MI.getRestoreSize(TII)) {
854 Reg = MI.getOperand(0).getReg();
855 return extractSpillBaseRegAndOffset(MI);
856 }
857 return None;
858}
859
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000860/// A spilled register may indicate that we have to end the current range of
861/// a variable and create a new one for the spill location.
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000862/// A restored register may indicate the reverse situation.
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000863/// We don't want to insert any instructions in process(), so we just create
864/// the DBG_VALUE without inserting it and keep track of it in \p Transfers.
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000865/// It will be inserted into the BB when we're done iterating over the
866/// instructions.
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000867void LiveDebugValues::transferSpillOrRestoreInst(MachineInstr &MI,
868 OpenRangesSet &OpenRanges,
869 VarLocMap &VarLocIDs,
870 TransferMap &Transfers) {
Wolfgang Piebfacd0522019-01-30 20:37:14 +0000871 MachineFunction *MF = MI.getMF();
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000872 TransferKind TKind;
873 unsigned Reg;
874 Optional<VarLoc::SpillLoc> Loc;
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000875
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000876 LLVM_DEBUG(dbgs() << "Examining instruction: "; MI.dump(););
877
Jeremy Morse5d9cd3b2019-09-06 10:08:22 +0000878 // First, if there are any DBG_VALUEs pointing at a spill slot that is
879 // written to, then close the variable location. The value in memory
880 // will have changed.
881 VarLocSet KillSet;
882 if (isSpillInstruction(MI, MF)) {
883 Loc = extractSpillBaseRegAndOffset(MI);
884 for (unsigned ID : OpenRanges.getVarLocs()) {
885 const VarLoc &VL = VarLocIDs[ID];
886 if (VL.Kind == VarLoc::SpillLocKind && VL.Loc.SpillLocation == *Loc) {
887 // This location is overwritten by the current instruction -- terminate
888 // the open range, and insert an explicit DBG_VALUE $noreg.
889 //
890 // Doing this at a later stage would require re-interpreting all
891 // DBG_VALUes and DIExpressions to identify whether they point at
892 // memory, and then analysing all memory writes to see if they
893 // overwrite that memory, which is expensive.
894 //
895 // At this stage, we already know which DBG_VALUEs are for spills and
896 // where they are located; it's best to fix handle overwrites now.
897 KillSet.set(ID);
898 MachineInstr *NewDebugInstr =
899 BuildMI(*MF, VL.MI.getDebugLoc(), VL.MI.getDesc(),
900 VL.MI.isIndirectDebugValue(), 0, // $noreg
901 VL.MI.getDebugVariable(), VL.MI.getDebugExpression());
902 Transfers.push_back({&MI, NewDebugInstr});
903 }
904 }
905 OpenRanges.erase(KillSet, VarLocIDs);
906 }
907
908 // Try to recognise spill and restore instructions that may create a new
909 // variable location.
910 if (isLocationSpill(MI, MF, Reg)) {
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000911 TKind = TransferKind::TransferSpill;
912 LLVM_DEBUG(dbgs() << "Recognized as spill: "; MI.dump(););
913 LLVM_DEBUG(dbgs() << "Register: " << Reg << " " << printReg(Reg, TRI)
914 << "\n");
915 } else {
916 if (!(Loc = isRestoreInstruction(MI, MF, Reg)))
917 return;
918 TKind = TransferKind::TransferRestore;
919 LLVM_DEBUG(dbgs() << "Recognized as restore: "; MI.dump(););
920 LLVM_DEBUG(dbgs() << "Register: " << Reg << " " << printReg(Reg, TRI)
921 << "\n");
922 }
923 // Check if the register or spill location is the location of a debug value.
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000924 for (unsigned ID : OpenRanges.getVarLocs()) {
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000925 if (TKind == TransferKind::TransferSpill &&
Jeremy Morse8b593482019-08-16 10:04:17 +0000926 VarLocIDs[ID].isDescribedByReg() == Reg) {
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000927 LLVM_DEBUG(dbgs() << "Spilling Register " << printReg(Reg, TRI) << '('
928 << VarLocIDs[ID].Var.getVar()->getName() << ")\n");
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000929 } else if (TKind == TransferKind::TransferRestore &&
Jeremy Morseca0e4b32019-08-29 11:20:54 +0000930 VarLocIDs[ID].Kind == VarLoc::SpillLocKind &&
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000931 VarLocIDs[ID].Loc.SpillLocation == *Loc) {
932 LLVM_DEBUG(dbgs() << "Restoring Register " << printReg(Reg, TRI) << '('
933 << VarLocIDs[ID].Var.getVar()->getName() << ")\n");
934 } else
935 continue;
936 insertTransferDebugPair(MI, OpenRanges, Transfers, VarLocIDs, ID, TKind,
937 Reg);
938 return;
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000939 }
940}
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000941
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000942/// If \p MI is a register copy instruction, that copies a previously tracked
943/// value from one register to another register that is callee saved, we
944/// create new DBG_VALUE instruction described with copy destination register.
945void LiveDebugValues::transferRegisterCopy(MachineInstr &MI,
946 OpenRangesSet &OpenRanges,
947 VarLocMap &VarLocIDs,
948 TransferMap &Transfers) {
949 const MachineOperand *SrcRegOp, *DestRegOp;
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000950
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000951 if (!TII->isCopyInstr(MI, SrcRegOp, DestRegOp) || !SrcRegOp->isKill() ||
952 !DestRegOp->isDef())
953 return;
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000954
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000955 auto isCalleSavedReg = [&](unsigned Reg) {
956 for (MCRegAliasIterator RAI(Reg, TRI, true); RAI.isValid(); ++RAI)
957 if (CalleeSavedRegs.test(*RAI))
958 return true;
959 return false;
960 };
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000961
Daniel Sanders0c476112019-08-15 19:22:08 +0000962 Register SrcReg = SrcRegOp->getReg();
963 Register DestReg = DestRegOp->getReg();
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +0000964
965 // We want to recognize instructions where destination register is callee
966 // saved register. If register that could be clobbered by the call is
967 // included, there would be a great chance that it is going to be clobbered
968 // soon. It is more likely that previous register location, which is callee
969 // saved, is going to stay unclobbered longer, even if it is killed.
970 if (!isCalleSavedReg(DestReg))
971 return;
972
973 for (unsigned ID : OpenRanges.getVarLocs()) {
974 if (VarLocIDs[ID].isDescribedByReg() == SrcReg) {
975 insertTransferDebugPair(MI, OpenRanges, Transfers, VarLocIDs, ID,
Wolfgang Pieb90d856c2019-02-04 20:42:45 +0000976 TransferKind::TransferCopy, DestReg);
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +0000977 return;
978 }
979 }
980}
981
Vikram TV859ad292015-12-16 11:09:48 +0000982/// Terminate all open ranges at the end of the current basic block.
Jeremy Morse67443c32019-08-21 09:22:31 +0000983bool LiveDebugValues::transferTerminator(MachineBasicBlock *CurMBB,
984 OpenRangesSet &OpenRanges,
985 VarLocInMBB &OutLocs,
986 const VarLocMap &VarLocIDs) {
Daniel Berlinca4d93a2016-01-10 03:25:42 +0000987 bool Changed = false;
Vikram TV859ad292015-12-16 11:09:48 +0000988
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000989 LLVM_DEBUG(for (unsigned ID
990 : OpenRanges.getVarLocs()) {
991 // Copy OpenRanges to OutLocs, if not already present.
Vedant Kumar9b558382018-10-05 21:44:00 +0000992 dbgs() << "Add to OutLocs in MBB #" << CurMBB->getNumber() << ": ";
Nicola Zaghend34e60c2018-05-14 12:53:11 +0000993 VarLocIDs[ID].dump();
994 });
Adrian Prantl6ee02c72016-05-25 22:21:12 +0000995 VarLocSet &VLS = OutLocs[CurMBB];
Jeremy Morse0ae54982019-08-23 16:33:42 +0000996 Changed = VLS != OpenRanges.getVarLocs();
Nikola Prica2d0106a2019-06-03 09:48:29 +0000997 // New OutLocs set may be different due to spill, restore or register
998 // copy instruction processing.
999 if (Changed)
1000 VLS = OpenRanges.getVarLocs();
Vikram TV859ad292015-12-16 11:09:48 +00001001 OpenRanges.clear();
Daniel Berlinca4d93a2016-01-10 03:25:42 +00001002 return Changed;
Vikram TV859ad292015-12-16 11:09:48 +00001003}
1004
Jeremy Morsebf2b2f02019-06-13 12:51:57 +00001005/// Accumulate a mapping between each DILocalVariable fragment and other
1006/// fragments of that DILocalVariable which overlap. This reduces work during
1007/// the data-flow stage from "Find any overlapping fragments" to "Check if the
1008/// known-to-overlap fragments are present".
1009/// \param MI A previously unprocessed DEBUG_VALUE instruction to analyze for
1010/// fragment usage.
1011/// \param SeenFragments Map from DILocalVariable to all fragments of that
1012/// Variable which are known to exist.
1013/// \param OverlappingFragments The overlap map being constructed, from one
1014/// Var/Fragment pair to a vector of fragments known to overlap.
1015void LiveDebugValues::accumulateFragmentMap(MachineInstr &MI,
1016 VarToFragments &SeenFragments,
1017 OverlapMap &OverlappingFragments) {
1018 DebugVariable MIVar(MI);
1019 FragmentInfo ThisFragment = MIVar.getFragmentDefault();
1020
1021 // If this is the first sighting of this variable, then we are guaranteed
1022 // there are currently no overlapping fragments either. Initialize the set
1023 // of seen fragments, record no overlaps for the current one, and return.
1024 auto SeenIt = SeenFragments.find(MIVar.getVar());
1025 if (SeenIt == SeenFragments.end()) {
1026 SmallSet<FragmentInfo, 4> OneFragment;
1027 OneFragment.insert(ThisFragment);
1028 SeenFragments.insert({MIVar.getVar(), OneFragment});
1029
1030 OverlappingFragments.insert({{MIVar.getVar(), ThisFragment}, {}});
1031 return;
1032 }
1033
1034 // If this particular Variable/Fragment pair already exists in the overlap
1035 // map, it has already been accounted for.
1036 auto IsInOLapMap =
1037 OverlappingFragments.insert({{MIVar.getVar(), ThisFragment}, {}});
1038 if (!IsInOLapMap.second)
1039 return;
1040
1041 auto &ThisFragmentsOverlaps = IsInOLapMap.first->second;
1042 auto &AllSeenFragments = SeenIt->second;
1043
1044 // Otherwise, examine all other seen fragments for this variable, with "this"
1045 // fragment being a previously unseen fragment. Record any pair of
1046 // overlapping fragments.
1047 for (auto &ASeenFragment : AllSeenFragments) {
1048 // Does this previously seen fragment overlap?
1049 if (DIExpression::fragmentsOverlap(ThisFragment, ASeenFragment)) {
1050 // Yes: Mark the current fragment as being overlapped.
1051 ThisFragmentsOverlaps.push_back(ASeenFragment);
1052 // Mark the previously seen fragment as being overlapped by the current
1053 // one.
1054 auto ASeenFragmentsOverlaps =
1055 OverlappingFragments.find({MIVar.getVar(), ASeenFragment});
1056 assert(ASeenFragmentsOverlaps != OverlappingFragments.end() &&
1057 "Previously seen var fragment has no vector of overlaps");
1058 ASeenFragmentsOverlaps->second.push_back(ThisFragment);
1059 }
1060 }
1061
1062 AllSeenFragments.insert(ThisFragment);
1063}
1064
Vikram TV859ad292015-12-16 11:09:48 +00001065/// This routine creates OpenRanges and OutLocs.
Jeremy Morse67443c32019-08-21 09:22:31 +00001066void LiveDebugValues::process(MachineInstr &MI, OpenRangesSet &OpenRanges,
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +00001067 VarLocInMBB &OutLocs, VarLocMap &VarLocIDs,
Jeremy Morse313d2ce2019-08-29 10:53:29 +00001068 TransferMap &Transfers,
1069 DebugParamMap &DebugEntryVals,
Jeremy Morsed2cd9c22019-06-13 13:11:57 +00001070 OverlapMap &OverlapFragments,
1071 VarToFragments &SeenFragments) {
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001072 transferDebugValue(MI, OpenRanges, VarLocIDs);
Djordje Todorovic12aca5d2019-07-09 08:36:34 +00001073 transferRegisterDef(MI, OpenRanges, VarLocIDs, Transfers,
1074 DebugEntryVals);
Jeremy Morse313d2ce2019-08-29 10:53:29 +00001075 transferRegisterCopy(MI, OpenRanges, VarLocIDs, Transfers);
1076 transferSpillOrRestoreInst(MI, OpenRanges, VarLocIDs, Transfers);
Vikram TV859ad292015-12-16 11:09:48 +00001077}
1078
1079/// This routine joins the analysis results of all incoming edges in @MBB by
1080/// inserting a new DBG_VALUE instruction at the start of the @MBB - if the same
1081/// source variable in all the predecessors of @MBB reside in the same location.
Vedant Kumar8c466682018-10-05 21:44:15 +00001082bool LiveDebugValues::join(
1083 MachineBasicBlock &MBB, VarLocInMBB &OutLocs, VarLocInMBB &InLocs,
1084 const VarLocMap &VarLocIDs,
1085 SmallPtrSet<const MachineBasicBlock *, 16> &Visited,
Jeremy Morse67443c32019-08-21 09:22:31 +00001086 SmallPtrSetImpl<const MachineBasicBlock *> &ArtificialBlocks,
1087 VarLocInMBB &PendingInLocs) {
Vedant Kumar9b558382018-10-05 21:44:00 +00001088 LLVM_DEBUG(dbgs() << "join MBB: " << MBB.getNumber() << "\n");
Daniel Berlinca4d93a2016-01-10 03:25:42 +00001089 bool Changed = false;
Vikram TV859ad292015-12-16 11:09:48 +00001090
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001091 VarLocSet InLocsT; // Temporary incoming locations.
Vikram TV859ad292015-12-16 11:09:48 +00001092
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001093 // For all predecessors of this MBB, find the set of VarLocs that
1094 // can be joined.
Keith Walker83ebef52016-09-27 16:46:07 +00001095 int NumVisited = 0;
Vikram TV859ad292015-12-16 11:09:48 +00001096 for (auto p : MBB.predecessors()) {
Jeremy Morse313d2ce2019-08-29 10:53:29 +00001097 // Ignore backedges if we have not visited the predecessor yet. As the
1098 // predecessor hasn't yet had locations propagated into it, most locations
1099 // will not yet be valid, so treat them as all being uninitialized and
1100 // potentially valid. If a location guessed to be correct here is
1101 // invalidated later, we will remove it when we revisit this block.
Vedant Kumar9b558382018-10-05 21:44:00 +00001102 if (!Visited.count(p)) {
1103 LLVM_DEBUG(dbgs() << " ignoring unvisited pred MBB: " << p->getNumber()
1104 << "\n");
Keith Walker83ebef52016-09-27 16:46:07 +00001105 continue;
Vedant Kumar9b558382018-10-05 21:44:00 +00001106 }
Vikram TV859ad292015-12-16 11:09:48 +00001107 auto OL = OutLocs.find(p);
1108 // Join is null in case of empty OutLocs from any of the pred.
1109 if (OL == OutLocs.end())
Daniel Berlinca4d93a2016-01-10 03:25:42 +00001110 return false;
Vikram TV859ad292015-12-16 11:09:48 +00001111
Keith Walker83ebef52016-09-27 16:46:07 +00001112 // Just copy over the Out locs to incoming locs for the first visited
1113 // predecessor, and for all other predecessors join the Out locs.
1114 if (!NumVisited)
Vikram TV859ad292015-12-16 11:09:48 +00001115 InLocsT = OL->second;
Keith Walker83ebef52016-09-27 16:46:07 +00001116 else
1117 InLocsT &= OL->second;
Vedant Kumar9b558382018-10-05 21:44:00 +00001118
1119 LLVM_DEBUG({
1120 if (!InLocsT.empty()) {
1121 for (auto ID : InLocsT)
1122 dbgs() << " gathered candidate incoming var: "
1123 << VarLocIDs[ID].Var.getVar()->getName() << "\n";
1124 }
1125 });
1126
Keith Walker83ebef52016-09-27 16:46:07 +00001127 NumVisited++;
Vikram TV859ad292015-12-16 11:09:48 +00001128 }
1129
Adrian Prantl7f5866c2016-09-28 17:51:14 +00001130 // Filter out DBG_VALUES that are out of scope.
1131 VarLocSet KillSet;
Vedant Kumar8c466682018-10-05 21:44:15 +00001132 bool IsArtificial = ArtificialBlocks.count(&MBB);
1133 if (!IsArtificial) {
1134 for (auto ID : InLocsT) {
1135 if (!VarLocIDs[ID].dominates(MBB)) {
1136 KillSet.set(ID);
1137 LLVM_DEBUG({
1138 auto Name = VarLocIDs[ID].Var.getVar()->getName();
1139 dbgs() << " killing " << Name << ", it doesn't dominate MBB\n";
1140 });
1141 }
Vedant Kumar9b558382018-10-05 21:44:00 +00001142 }
1143 }
Adrian Prantl7f5866c2016-09-28 17:51:14 +00001144 InLocsT.intersectWithComplement(KillSet);
1145
Keith Walker83ebef52016-09-27 16:46:07 +00001146 // As we are processing blocks in reverse post-order we
1147 // should have processed at least one predecessor, unless it
1148 // is the entry block which has no predecessor.
1149 assert((NumVisited || MBB.pred_empty()) &&
1150 "Should have processed at least one predecessor");
Vikram TV859ad292015-12-16 11:09:48 +00001151
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001152 VarLocSet &ILS = InLocs[&MBB];
Jeremy Morse67443c32019-08-21 09:22:31 +00001153 VarLocSet &Pending = PendingInLocs[&MBB];
Vikram TV859ad292015-12-16 11:09:48 +00001154
Jeremy Morse67443c32019-08-21 09:22:31 +00001155 // New locations will have DBG_VALUE insts inserted at the start of the
1156 // block, after location propagation has finished. Record the insertions
1157 // that we need to perform in the Pending set.
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001158 VarLocSet Diff = InLocsT;
1159 Diff.intersectWithComplement(ILS);
1160 for (auto ID : Diff) {
Jeremy Morse67443c32019-08-21 09:22:31 +00001161 Pending.set(ID);
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001162 ILS.set(ID);
1163 ++NumInserted;
1164 Changed = true;
Vikram TV859ad292015-12-16 11:09:48 +00001165 }
Jeremy Morse0ae54982019-08-23 16:33:42 +00001166
1167 // We may have lost locations by learning about a predecessor that either
1168 // loses or moves a variable. Find any locations in ILS that are not in the
1169 // new in-locations, and delete those.
1170 VarLocSet Removed = ILS;
1171 Removed.intersectWithComplement(InLocsT);
1172 for (auto ID : Removed) {
1173 Pending.reset(ID);
1174 ILS.reset(ID);
1175 ++NumRemoved;
1176 Changed = true;
1177 }
1178
Daniel Berlinca4d93a2016-01-10 03:25:42 +00001179 return Changed;
Vikram TV859ad292015-12-16 11:09:48 +00001180}
1181
Jeremy Morse67443c32019-08-21 09:22:31 +00001182void LiveDebugValues::flushPendingLocs(VarLocInMBB &PendingInLocs,
1183 VarLocMap &VarLocIDs) {
1184 // PendingInLocs records all locations propagated into blocks, which have
1185 // not had DBG_VALUE insts created. Go through and create those insts now.
1186 for (auto &Iter : PendingInLocs) {
1187 // Map is keyed on a constant pointer, unwrap it so we can insert insts.
1188 auto &MBB = const_cast<MachineBasicBlock &>(*Iter.first);
1189 VarLocSet &Pending = Iter.second;
1190
1191 for (unsigned ID : Pending) {
1192 // The ID location is live-in to MBB -- work out what kind of machine
1193 // location it is and create a DBG_VALUE.
1194 const VarLoc &DiffIt = VarLocIDs[ID];
1195 const MachineInstr *DebugInstr = &DiffIt.MI;
1196 MachineInstr *MI = nullptr;
1197
1198 if (DiffIt.isConstant()) {
1199 MachineOperand MO(DebugInstr->getOperand(0));
1200 MI = BuildMI(MBB, MBB.instr_begin(), DebugInstr->getDebugLoc(),
1201 DebugInstr->getDesc(), false, MO,
1202 DebugInstr->getDebugVariable(),
1203 DebugInstr->getDebugExpression());
1204 } else {
1205 auto *DebugExpr = DebugInstr->getDebugExpression();
1206 Register Reg = DebugInstr->getOperand(0).getReg();
1207 bool IsIndirect = DebugInstr->isIndirectDebugValue();
1208
1209 if (DiffIt.Kind == VarLoc::SpillLocKind) {
1210 // This is is a spilt location; DebugInstr refers to the unspilt
1211 // location. We need to rebuild the spilt location expression and
1212 // point the DBG_VALUE at the frame register.
1213 DebugExpr = DIExpression::prepend(
1214 DebugInstr->getDebugExpression(), DIExpression::ApplyOffset,
1215 DiffIt.Loc.SpillLocation.SpillOffset);
1216 Reg = TRI->getFrameRegister(*DebugInstr->getMF());
1217 IsIndirect = true;
1218 }
1219
1220 MI = BuildMI(MBB, MBB.instr_begin(), DebugInstr->getDebugLoc(),
1221 DebugInstr->getDesc(), IsIndirect, Reg,
1222 DebugInstr->getDebugVariable(), DebugExpr);
1223 }
Jeremy Morsec8c5f2a2019-09-04 10:18:03 +00001224 (void)MI;
Jeremy Morse67443c32019-08-21 09:22:31 +00001225 LLVM_DEBUG(dbgs() << "Inserted: "; MI->dump(););
1226 }
1227 }
1228}
1229
Vikram TV859ad292015-12-16 11:09:48 +00001230/// Calculate the liveness information for the given machine function and
1231/// extend ranges across basic blocks.
1232bool LiveDebugValues::ExtendRanges(MachineFunction &MF) {
Nicola Zaghend34e60c2018-05-14 12:53:11 +00001233 LLVM_DEBUG(dbgs() << "\nDebug Range Extension\n");
Vikram TV859ad292015-12-16 11:09:48 +00001234
1235 bool Changed = false;
Daniel Berlinca4d93a2016-01-10 03:25:42 +00001236 bool OLChanged = false;
1237 bool MBBJoined = false;
Vikram TV859ad292015-12-16 11:09:48 +00001238
Jeremy Morsebf2b2f02019-06-13 12:51:57 +00001239 VarLocMap VarLocIDs; // Map VarLoc<>unique ID for use in bitvectors.
1240 OverlapMap OverlapFragments; // Map of overlapping variable fragments
1241 OpenRangesSet OpenRanges(OverlapFragments);
1242 // Ranges that are open until end of bb.
1243 VarLocInMBB OutLocs; // Ranges that exist beyond bb.
1244 VarLocInMBB InLocs; // Ranges that are incoming after joining.
1245 TransferMap Transfers; // DBG_VALUEs associated with spills.
Jeremy Morse67443c32019-08-21 09:22:31 +00001246 VarLocInMBB PendingInLocs; // Ranges that are incoming after joining, but
1247 // that we have deferred creating DBG_VALUE insts
1248 // for immediately.
Jeremy Morsebf2b2f02019-06-13 12:51:57 +00001249
1250 VarToFragments SeenFragments;
Vikram TV859ad292015-12-16 11:09:48 +00001251
Vedant Kumar8c466682018-10-05 21:44:15 +00001252 // Blocks which are artificial, i.e. blocks which exclusively contain
1253 // instructions without locations, or with line 0 locations.
1254 SmallPtrSet<const MachineBasicBlock *, 16> ArtificialBlocks;
1255
Daniel Berlin72560592016-01-10 18:08:32 +00001256 DenseMap<unsigned int, MachineBasicBlock *> OrderToBB;
1257 DenseMap<MachineBasicBlock *, unsigned int> BBToOrder;
1258 std::priority_queue<unsigned int, std::vector<unsigned int>,
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001259 std::greater<unsigned int>>
1260 Worklist;
Daniel Berlin72560592016-01-10 18:08:32 +00001261 std::priority_queue<unsigned int, std::vector<unsigned int>,
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001262 std::greater<unsigned int>>
1263 Pending;
1264
Djordje Todorovic12aca5d2019-07-09 08:36:34 +00001265 // Besides parameter's modification, check whether a DBG_VALUE is inlined
1266 // in order to deduce whether the variable that it tracks comes from
1267 // a different function. If that is the case we can't track its entry value.
1268 auto IsUnmodifiedFuncParam = [&](const MachineInstr &MI) {
1269 auto *DIVar = MI.getDebugVariable();
1270 return DIVar->isParameter() && DIVar->isNotModified() &&
1271 !MI.getDebugLoc()->getInlinedAt();
1272 };
1273
1274 const TargetLowering *TLI = MF.getSubtarget().getTargetLowering();
1275 unsigned SP = TLI->getStackPointerRegisterToSaveRestore();
Daniel Sanders0c476112019-08-15 19:22:08 +00001276 Register FP = TRI->getFrameRegister(MF);
Djordje Todorovic12aca5d2019-07-09 08:36:34 +00001277 auto IsRegOtherThanSPAndFP = [&](const MachineOperand &Op) -> bool {
1278 return Op.isReg() && Op.getReg() != SP && Op.getReg() != FP;
1279 };
1280
1281 // Working set of currently collected debug variables mapped to DBG_VALUEs
1282 // representing candidates for production of debug entry values.
1283 DebugParamMap DebugEntryVals;
1284
1285 MachineBasicBlock &First_MBB = *(MF.begin());
1286 // Only in the case of entry MBB collect DBG_VALUEs representing
1287 // function parameters in order to generate debug entry values for them.
1288 // Currently, we generate debug entry values only for parameters that are
1289 // unmodified throughout the function and located in a register.
1290 // TODO: Add support for parameters that are described as fragments.
1291 // TODO: Add support for modified arguments that can be expressed
1292 // by using its entry value.
1293 // TODO: Add support for local variables that are expressed in terms of
1294 // parameters entry values.
1295 for (auto &MI : First_MBB)
1296 if (MI.isDebugValue() && IsUnmodifiedFuncParam(MI) &&
1297 !MI.isIndirectDebugValue() && IsRegOtherThanSPAndFP(MI.getOperand(0)) &&
1298 !DebugEntryVals.count(MI.getDebugVariable()) &&
1299 !MI.getDebugExpression()->isFragment())
1300 DebugEntryVals[MI.getDebugVariable()] = &MI;
1301
Jeremy Morse313d2ce2019-08-29 10:53:29 +00001302 // Initialize per-block structures and scan for fragment overlaps.
Jeremy Morsebf2b2f02019-06-13 12:51:57 +00001303 for (auto &MBB : MF) {
Jeremy Morse67443c32019-08-21 09:22:31 +00001304 PendingInLocs[&MBB] = VarLocSet();
Jeremy Morse313d2ce2019-08-29 10:53:29 +00001305
1306 for (auto &MI : MBB) {
1307 if (MI.isDebugValue())
1308 accumulateFragmentMap(MI, SeenFragments, OverlapFragments);
1309 }
Jeremy Morsebf2b2f02019-06-13 12:51:57 +00001310 }
Adrian Prantl6ee02c72016-05-25 22:21:12 +00001311
Vedant Kumar8c466682018-10-05 21:44:15 +00001312 auto hasNonArtificialLocation = [](const MachineInstr &MI) -> bool {
1313 if (const DebugLoc &DL = MI.getDebugLoc())
1314 return DL.getLine() != 0;
1315 return false;
1316 };
1317 for (auto &MBB : MF)
1318 if (none_of(MBB.instrs(), hasNonArtificialLocation))
1319 ArtificialBlocks.insert(&MBB);
1320
Nicola Zaghend34e60c2018-05-14 12:53:11 +00001321 LLVM_DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs,
1322 "OutLocs after initialization", dbgs()));
Vikram TV859ad292015-12-16 11:09:48 +00001323
Daniel Berlin72560592016-01-10 18:08:32 +00001324 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF);
1325 unsigned int RPONumber = 0;
1326 for (auto RI = RPOT.begin(), RE = RPOT.end(); RI != RE; ++RI) {
1327 OrderToBB[RPONumber] = *RI;
1328 BBToOrder[*RI] = RPONumber;
1329 Worklist.push(RPONumber);
1330 ++RPONumber;
1331 }
Daniel Berlin72560592016-01-10 18:08:32 +00001332 // This is a standard "union of predecessor outs" dataflow problem.
Petar Jovanovicbe2e80a2018-07-13 08:24:26 +00001333 // To solve it, we perform join() and process() using the two worklist method
Daniel Berlin72560592016-01-10 18:08:32 +00001334 // until the ranges converge.
1335 // Ranges have converged when both worklists are empty.
Keith Walker83ebef52016-09-27 16:46:07 +00001336 SmallPtrSet<const MachineBasicBlock *, 16> Visited;
Daniel Berlin72560592016-01-10 18:08:32 +00001337 while (!Worklist.empty() || !Pending.empty()) {
1338 // We track what is on the pending worklist to avoid inserting the same
1339 // thing twice. We could avoid this with a custom priority queue, but this
1340 // is probably not worth it.
1341 SmallPtrSet<MachineBasicBlock *, 16> OnPending;
Nicola Zaghend34e60c2018-05-14 12:53:11 +00001342 LLVM_DEBUG(dbgs() << "Processing Worklist\n");
Daniel Berlin72560592016-01-10 18:08:32 +00001343 while (!Worklist.empty()) {
1344 MachineBasicBlock *MBB = OrderToBB[Worklist.top()];
1345 Worklist.pop();
Jeremy Morse67443c32019-08-21 09:22:31 +00001346 MBBJoined = join(*MBB, OutLocs, InLocs, VarLocIDs, Visited,
1347 ArtificialBlocks, PendingInLocs);
Jeremy Morse313d2ce2019-08-29 10:53:29 +00001348 MBBJoined |= Visited.insert(MBB).second;
Daniel Berlin72560592016-01-10 18:08:32 +00001349 if (MBBJoined) {
1350 MBBJoined = false;
1351 Changed = true;
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +00001352 // Now that we have started to extend ranges across BBs we need to
1353 // examine spill instructions to see whether they spill registers that
1354 // correspond to user variables.
Jeremy Morse67443c32019-08-21 09:22:31 +00001355 // First load any pending inlocs.
1356 OpenRanges.insertFromLocSet(PendingInLocs[MBB], VarLocIDs);
Daniel Berlin72560592016-01-10 18:08:32 +00001357 for (auto &MI : *MBB)
Jeremy Morsed2cd9c22019-06-13 13:11:57 +00001358 process(MI, OpenRanges, OutLocs, VarLocIDs, Transfers,
Jeremy Morse313d2ce2019-08-29 10:53:29 +00001359 DebugEntryVals, OverlapFragments, SeenFragments);
Jeremy Morse67443c32019-08-21 09:22:31 +00001360 OLChanged |= transferTerminator(MBB, OpenRanges, OutLocs, VarLocIDs);
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +00001361
Nicola Zaghend34e60c2018-05-14 12:53:11 +00001362 LLVM_DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs,
1363 "OutLocs after propagating", dbgs()));
1364 LLVM_DEBUG(printVarLocInMBB(MF, InLocs, VarLocIDs,
1365 "InLocs after propagating", dbgs()));
Vikram TV859ad292015-12-16 11:09:48 +00001366
Daniel Berlin72560592016-01-10 18:08:32 +00001367 if (OLChanged) {
1368 OLChanged = false;
1369 for (auto s : MBB->successors())
Benjamin Kramer4dea8f52016-06-17 18:59:41 +00001370 if (OnPending.insert(s).second) {
Daniel Berlin72560592016-01-10 18:08:32 +00001371 Pending.push(BBToOrder[s]);
1372 }
1373 }
Vikram TV859ad292015-12-16 11:09:48 +00001374 }
1375 }
Daniel Berlin72560592016-01-10 18:08:32 +00001376 Worklist.swap(Pending);
1377 // At this point, pending must be empty, since it was just the empty
1378 // worklist
1379 assert(Pending.empty() && "Pending should be empty");
Vikram TV859ad292015-12-16 11:09:48 +00001380 }
Daniel Berlin72560592016-01-10 18:08:32 +00001381
Jeremy Morse0ca48de22019-10-04 09:38:05 +00001382 // Add any DBG_VALUE instructions created by location transfers.
1383 for (auto &TR : Transfers) {
1384 auto *MBB = TR.TransferInst->getParent();
1385 MBB->insertAfterBundle(TR.TransferInst->getIterator(), TR.DebugInst);
1386 }
1387 Transfers.clear();
1388
Jeremy Morse67443c32019-08-21 09:22:31 +00001389 // Deferred inlocs will not have had any DBG_VALUE insts created; do
1390 // that now.
1391 flushPendingLocs(PendingInLocs, VarLocIDs);
1392
Nicola Zaghend34e60c2018-05-14 12:53:11 +00001393 LLVM_DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs, "Final OutLocs", dbgs()));
1394 LLVM_DEBUG(printVarLocInMBB(MF, InLocs, VarLocIDs, "Final InLocs", dbgs()));
Vikram TV859ad292015-12-16 11:09:48 +00001395 return Changed;
1396}
1397
1398bool LiveDebugValues::runOnMachineFunction(MachineFunction &MF) {
Matthias Braunf1caa282017-12-15 22:22:58 +00001399 if (!MF.getFunction().getSubprogram())
Adrian Prantl7f5866c2016-09-28 17:51:14 +00001400 // LiveDebugValues will already have removed all DBG_VALUEs.
1401 return false;
1402
Wolfgang Piebe018bbd2017-07-19 19:36:40 +00001403 // Skip functions from NoDebug compilation units.
Matthias Braunf1caa282017-12-15 22:22:58 +00001404 if (MF.getFunction().getSubprogram()->getUnit()->getEmissionKind() ==
Wolfgang Piebe018bbd2017-07-19 19:36:40 +00001405 DICompileUnit::NoDebug)
1406 return false;
1407
Vikram TV859ad292015-12-16 11:09:48 +00001408 TRI = MF.getSubtarget().getRegisterInfo();
1409 TII = MF.getSubtarget().getInstrInfo();
Wolfgang Pieb399dcfa2017-02-14 19:08:45 +00001410 TFI = MF.getSubtarget().getFrameLowering();
Krasimir Georgiev2f1bba72019-09-18 14:42:09 +00001411 TFI->determineCalleeSaves(MF, CalleeSavedRegs,
1412 std::make_unique<RegScavenger>().get());
Adrian Prantl7f5866c2016-09-28 17:51:14 +00001413 LS.initialize(MF);
Vikram TV859ad292015-12-16 11:09:48 +00001414
Adrian Prantl7f5866c2016-09-28 17:51:14 +00001415 bool Changed = ExtendRanges(MF);
Vikram TV859ad292015-12-16 11:09:48 +00001416 return Changed;
1417}