121
|
1 //===- LiveDebugValues.cpp - Tracking Debug Value MIs ---------------------===//
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
3 // The LLVM Compiler Infrastructure
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 //
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
5 // This file is distributed under the University of Illinois Open Source
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 // License. See LICENSE.TXT for details.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8 //===----------------------------------------------------------------------===//
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 ///
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
10 /// This pass implements a data flow analysis that propagates debug location
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 /// information by inserting additional DBG_VALUE instructions into the machine
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 /// instruction stream. The pass internally builds debug location liveness
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13 /// ranges to determine the points where additional DBG_VALUEs need to be
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 /// inserted.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 ///
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 /// This is a separate pass from DbgValueHistoryCalculator to facilitate
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
17 /// testing and improve modularity.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
18 ///
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
19 //===----------------------------------------------------------------------===//
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
20
|
121
|
21 #include "llvm/ADT/DenseMap.h"
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
22 #include "llvm/ADT/PostOrderIterator.h"
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 #include "llvm/ADT/SmallPtrSet.h"
|
121
|
24 #include "llvm/ADT/SmallVector.h"
|
120
|
25 #include "llvm/ADT/SparseBitVector.h"
|
|
26 #include "llvm/ADT/Statistic.h"
|
|
27 #include "llvm/ADT/UniqueVector.h"
|
|
28 #include "llvm/CodeGen/LexicalScopes.h"
|
121
|
29 #include "llvm/CodeGen/MachineBasicBlock.h"
|
|
30 #include "llvm/CodeGen/MachineFrameInfo.h"
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
31 #include "llvm/CodeGen/MachineFunction.h"
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
32 #include "llvm/CodeGen/MachineFunctionPass.h"
|
121
|
33 #include "llvm/CodeGen/MachineInstr.h"
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
34 #include "llvm/CodeGen/MachineInstrBuilder.h"
|
121
|
35 #include "llvm/CodeGen/MachineMemOperand.h"
|
|
36 #include "llvm/CodeGen/MachineOperand.h"
|
|
37 #include "llvm/CodeGen/PseudoSourceValue.h"
|
134
|
38 #include "llvm/CodeGen/TargetFrameLowering.h"
|
|
39 #include "llvm/CodeGen/TargetInstrInfo.h"
|
|
40 #include "llvm/CodeGen/TargetLowering.h"
|
|
41 #include "llvm/CodeGen/TargetRegisterInfo.h"
|
|
42 #include "llvm/CodeGen/TargetSubtargetInfo.h"
|
121
|
43 #include "llvm/IR/DebugInfoMetadata.h"
|
|
44 #include "llvm/IR/DebugLoc.h"
|
|
45 #include "llvm/IR/Function.h"
|
|
46 #include "llvm/IR/Module.h"
|
|
47 #include "llvm/MC/MCRegisterInfo.h"
|
|
48 #include "llvm/Pass.h"
|
|
49 #include "llvm/Support/Casting.h"
|
|
50 #include "llvm/Support/Compiler.h"
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
51 #include "llvm/Support/Debug.h"
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
52 #include "llvm/Support/raw_ostream.h"
|
121
|
53 #include <algorithm>
|
|
54 #include <cassert>
|
|
55 #include <cstdint>
|
|
56 #include <functional>
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
57 #include <queue>
|
121
|
58 #include <utility>
|
|
59 #include <vector>
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
60
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
61 using namespace llvm;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
62
|
121
|
63 #define DEBUG_TYPE "livedebugvalues"
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
64
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
65 STATISTIC(NumInserted, "Number of DBG_VALUE instructions inserted");
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
66
|
120
|
67 // \brief If @MI is a DBG_VALUE with debug value described by a defined
|
|
68 // register, returns the number of this register. In the other case, returns 0.
|
|
69 static unsigned isDbgValueDescribedByReg(const MachineInstr &MI) {
|
|
70 assert(MI.isDebugValue() && "expected a DBG_VALUE");
|
|
71 assert(MI.getNumOperands() == 4 && "malformed DBG_VALUE");
|
|
72 // If location of variable is described using a register (directly
|
|
73 // or indirectly), this register is always a first operand.
|
|
74 return MI.getOperand(0).isReg() ? MI.getOperand(0).getReg() : 0;
|
|
75 }
|
|
76
|
121
|
77 namespace {
|
|
78
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
79 class LiveDebugValues : public MachineFunctionPass {
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
80 private:
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
81 const TargetRegisterInfo *TRI;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
82 const TargetInstrInfo *TII;
|
121
|
83 const TargetFrameLowering *TFI;
|
120
|
84 LexicalScopes LS;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
85
|
120
|
86 /// Keeps track of lexical scopes associated with a user value's source
|
|
87 /// location.
|
|
88 class UserValueScopes {
|
|
89 DebugLoc DL;
|
|
90 LexicalScopes &LS;
|
|
91 SmallPtrSet<const MachineBasicBlock *, 4> LBlocks;
|
|
92
|
|
93 public:
|
|
94 UserValueScopes(DebugLoc D, LexicalScopes &L) : DL(std::move(D)), LS(L) {}
|
|
95
|
|
96 /// Return true if current scope dominates at least one machine
|
|
97 /// instruction in a given machine basic block.
|
|
98 bool dominates(MachineBasicBlock *MBB) {
|
|
99 if (LBlocks.empty())
|
|
100 LS.getMachineBasicBlocks(DL, LBlocks);
|
|
101 return LBlocks.count(MBB) != 0 || LS.dominates(DL, MBB);
|
|
102 }
|
|
103 };
|
|
104
|
|
105 /// Based on std::pair so it can be used as an index into a DenseMap.
|
121
|
106 using DebugVariableBase =
|
|
107 std::pair<const DILocalVariable *, const DILocation *>;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
108 /// A potentially inlined instance of a variable.
|
120
|
109 struct DebugVariable : public DebugVariableBase {
|
|
110 DebugVariable(const DILocalVariable *Var, const DILocation *InlinedAt)
|
|
111 : DebugVariableBase(Var, InlinedAt) {}
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
112
|
121
|
113 const DILocalVariable *getVar() const { return this->first; }
|
|
114 const DILocation *getInlinedAt() const { return this->second; }
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
115
|
120
|
116 bool operator<(const DebugVariable &DV) const {
|
|
117 if (getVar() == DV.getVar())
|
|
118 return getInlinedAt() < DV.getInlinedAt();
|
|
119 return getVar() < DV.getVar();
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
120 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
121 };
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
122
|
120
|
123 /// A pair of debug variable and value location.
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
124 struct VarLoc {
|
120
|
125 const DebugVariable Var;
|
|
126 const MachineInstr &MI; ///< Only used for cloning a new DBG_VALUE.
|
|
127 mutable UserValueScopes UVS;
|
121
|
128 enum { InvalidKind = 0, RegisterKind } Kind = InvalidKind;
|
120
|
129
|
|
130 /// The value location. Stored separately to avoid repeatedly
|
|
131 /// extracting it from MI.
|
|
132 union {
|
121
|
133 uint64_t RegNo;
|
120
|
134 uint64_t Hash;
|
|
135 } Loc;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
136
|
120
|
137 VarLoc(const MachineInstr &MI, LexicalScopes &LS)
|
|
138 : Var(MI.getDebugVariable(), MI.getDebugLoc()->getInlinedAt()), MI(MI),
|
121
|
139 UVS(MI.getDebugLoc(), LS) {
|
120
|
140 static_assert((sizeof(Loc) == sizeof(uint64_t)),
|
|
141 "hash does not cover all members of Loc");
|
|
142 assert(MI.isDebugValue() && "not a DBG_VALUE");
|
|
143 assert(MI.getNumOperands() == 4 && "malformed DBG_VALUE");
|
|
144 if (int RegNo = isDbgValueDescribedByReg(MI)) {
|
|
145 Kind = RegisterKind;
|
121
|
146 Loc.RegNo = RegNo;
|
120
|
147 }
|
|
148 }
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
149
|
120
|
150 /// If this variable is described by a register, return it,
|
|
151 /// otherwise return 0.
|
|
152 unsigned isDescribedByReg() const {
|
|
153 if (Kind == RegisterKind)
|
121
|
154 return Loc.RegNo;
|
120
|
155 return 0;
|
|
156 }
|
|
157
|
|
158 /// Determine whether the lexical scope of this value's debug location
|
|
159 /// dominates MBB.
|
|
160 bool dominates(MachineBasicBlock &MBB) const { return UVS.dominates(&MBB); }
|
|
161
|
121
|
162 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
|
163 LLVM_DUMP_METHOD void dump() const { MI.dump(); }
|
|
164 #endif
|
120
|
165
|
|
166 bool operator==(const VarLoc &Other) const {
|
|
167 return Var == Other.Var && Loc.Hash == Other.Loc.Hash;
|
|
168 }
|
|
169
|
|
170 /// This operator guarantees that VarLocs are sorted by Variable first.
|
|
171 bool operator<(const VarLoc &Other) const {
|
|
172 if (Var == Other.Var)
|
|
173 return Loc.Hash < Other.Loc.Hash;
|
|
174 return Var < Other.Var;
|
|
175 }
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
176 };
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
177
|
121
|
178 using VarLocMap = UniqueVector<VarLoc>;
|
|
179 using VarLocSet = SparseBitVector<>;
|
|
180 using VarLocInMBB = SmallDenseMap<const MachineBasicBlock *, VarLocSet>;
|
|
181 struct SpillDebugPair {
|
|
182 MachineInstr *SpillInst;
|
|
183 MachineInstr *DebugInst;
|
|
184 };
|
|
185 using SpillMap = SmallVector<SpillDebugPair, 4>;
|
120
|
186
|
|
187 /// This holds the working set of currently open ranges. For fast
|
|
188 /// access, this is done both as a set of VarLocIDs, and a map of
|
|
189 /// DebugVariable to recent VarLocID. Note that a DBG_VALUE ends all
|
|
190 /// previous open ranges for the same variable.
|
|
191 class OpenRangesSet {
|
|
192 VarLocSet VarLocs;
|
|
193 SmallDenseMap<DebugVariableBase, unsigned, 8> Vars;
|
|
194
|
|
195 public:
|
|
196 const VarLocSet &getVarLocs() const { return VarLocs; }
|
|
197
|
|
198 /// Terminate all open ranges for Var by removing it from the set.
|
|
199 void erase(DebugVariable Var) {
|
|
200 auto It = Vars.find(Var);
|
|
201 if (It != Vars.end()) {
|
|
202 unsigned ID = It->second;
|
|
203 VarLocs.reset(ID);
|
|
204 Vars.erase(It);
|
|
205 }
|
|
206 }
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
207
|
120
|
208 /// Terminate all open ranges listed in \c KillSet by removing
|
|
209 /// them from the set.
|
|
210 void erase(const VarLocSet &KillSet, const VarLocMap &VarLocIDs) {
|
|
211 VarLocs.intersectWithComplement(KillSet);
|
|
212 for (unsigned ID : KillSet)
|
|
213 Vars.erase(VarLocIDs[ID].Var);
|
|
214 }
|
|
215
|
|
216 /// Insert a new range into the set.
|
|
217 void insert(unsigned VarLocID, DebugVariableBase Var) {
|
|
218 VarLocs.set(VarLocID);
|
|
219 Vars.insert({Var, VarLocID});
|
|
220 }
|
|
221
|
|
222 /// Empty the set.
|
|
223 void clear() {
|
|
224 VarLocs.clear();
|
|
225 Vars.clear();
|
|
226 }
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
227
|
120
|
228 /// Return whether the set is empty or not.
|
|
229 bool empty() const {
|
|
230 assert(Vars.empty() == VarLocs.empty() && "open ranges are inconsistent");
|
|
231 return VarLocs.empty();
|
|
232 }
|
|
233 };
|
|
234
|
121
|
235 bool isSpillInstruction(const MachineInstr &MI, MachineFunction *MF,
|
|
236 unsigned &Reg);
|
|
237 int extractSpillBaseRegAndOffset(const MachineInstr &MI, unsigned &Reg);
|
|
238
|
120
|
239 void transferDebugValue(const MachineInstr &MI, OpenRangesSet &OpenRanges,
|
|
240 VarLocMap &VarLocIDs);
|
121
|
241 void transferSpillInst(MachineInstr &MI, OpenRangesSet &OpenRanges,
|
|
242 VarLocMap &VarLocIDs, SpillMap &Spills);
|
120
|
243 void transferRegisterDef(MachineInstr &MI, OpenRangesSet &OpenRanges,
|
|
244 const VarLocMap &VarLocIDs);
|
|
245 bool transferTerminatorInst(MachineInstr &MI, OpenRangesSet &OpenRanges,
|
|
246 VarLocInMBB &OutLocs, const VarLocMap &VarLocIDs);
|
|
247 bool transfer(MachineInstr &MI, OpenRangesSet &OpenRanges,
|
121
|
248 VarLocInMBB &OutLocs, VarLocMap &VarLocIDs, SpillMap &Spills,
|
|
249 bool transferSpills);
|
120
|
250
|
|
251 bool join(MachineBasicBlock &MBB, VarLocInMBB &OutLocs, VarLocInMBB &InLocs,
|
|
252 const VarLocMap &VarLocIDs,
|
|
253 SmallPtrSet<const MachineBasicBlock *, 16> &Visited);
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
254
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
255 bool ExtendRanges(MachineFunction &MF);
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
256
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
257 public:
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
258 static char ID;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
259
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
260 /// Default construct and initialize the pass.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
261 LiveDebugValues();
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
262
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
263 /// Tell the pass manager which passes we depend on and what
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
264 /// information we preserve.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
265 void getAnalysisUsage(AnalysisUsage &AU) const override;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
266
|
120
|
267 MachineFunctionProperties getRequiredProperties() const override {
|
|
268 return MachineFunctionProperties().set(
|
|
269 MachineFunctionProperties::Property::NoVRegs);
|
|
270 }
|
|
271
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
272 /// Print to ostream with a message.
|
120
|
273 void printVarLocInMBB(const MachineFunction &MF, const VarLocInMBB &V,
|
|
274 const VarLocMap &VarLocIDs, const char *msg,
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
275 raw_ostream &Out) const;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
276
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
277 /// Calculate the liveness information for the given machine function.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
278 bool runOnMachineFunction(MachineFunction &MF) override;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
279 };
|
120
|
280
|
121
|
281 } // end anonymous namespace
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
282
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
283 //===----------------------------------------------------------------------===//
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
284 // Implementation
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
285 //===----------------------------------------------------------------------===//
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
286
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
287 char LiveDebugValues::ID = 0;
|
121
|
288
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
289 char &llvm::LiveDebugValuesID = LiveDebugValues::ID;
|
121
|
290
|
|
291 INITIALIZE_PASS(LiveDebugValues, DEBUG_TYPE, "Live DEBUG_VALUE analysis",
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
292 false, false)
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
293
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
294 /// Default construct and initialize the pass.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
295 LiveDebugValues::LiveDebugValues() : MachineFunctionPass(ID) {
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
296 initializeLiveDebugValuesPass(*PassRegistry::getPassRegistry());
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
297 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
298
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
299 /// Tell the pass manager which passes we depend on and what information we
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
300 /// preserve.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
301 void LiveDebugValues::getAnalysisUsage(AnalysisUsage &AU) const {
|
120
|
302 AU.setPreservesCFG();
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
303 MachineFunctionPass::getAnalysisUsage(AU);
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
304 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
305
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
306 //===----------------------------------------------------------------------===//
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
307 // Debug Range Extension Implementation
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
308 //===----------------------------------------------------------------------===//
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
309
|
121
|
310 #ifndef NDEBUG
|
120
|
311 void LiveDebugValues::printVarLocInMBB(const MachineFunction &MF,
|
|
312 const VarLocInMBB &V,
|
|
313 const VarLocMap &VarLocIDs,
|
|
314 const char *msg,
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
315 raw_ostream &Out) const {
|
120
|
316 Out << '\n' << msg << '\n';
|
|
317 for (const MachineBasicBlock &BB : MF) {
|
|
318 const auto &L = V.lookup(&BB);
|
|
319 Out << "MBB: " << BB.getName() << ":\n";
|
|
320 for (unsigned VLL : L) {
|
|
321 const VarLoc &VL = VarLocIDs[VLL];
|
|
322 Out << " Var: " << VL.Var.getVar()->getName();
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
323 Out << " MI: ";
|
120
|
324 VL.dump();
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
325 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
326 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
327 Out << "\n";
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
328 }
|
121
|
329 #endif
|
|
330
|
|
331 /// Given a spill instruction, extract the register and offset used to
|
|
332 /// address the spill location in a target independent way.
|
|
333 int LiveDebugValues::extractSpillBaseRegAndOffset(const MachineInstr &MI,
|
|
334 unsigned &Reg) {
|
|
335 assert(MI.hasOneMemOperand() &&
|
|
336 "Spill instruction does not have exactly one memory operand?");
|
|
337 auto MMOI = MI.memoperands_begin();
|
|
338 const PseudoSourceValue *PVal = (*MMOI)->getPseudoValue();
|
|
339 assert(PVal->kind() == PseudoSourceValue::FixedStack &&
|
|
340 "Inconsistent memory operand in spill instruction");
|
|
341 int FI = cast<FixedStackPseudoSourceValue>(PVal)->getFrameIndex();
|
|
342 const MachineBasicBlock *MBB = MI.getParent();
|
|
343 return TFI->getFrameIndexReference(*MBB->getParent(), FI, Reg);
|
|
344 }
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
345
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
346 /// End all previous ranges related to @MI and start a new range from @MI
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
347 /// if it is a DBG_VALUE instr.
|
120
|
348 void LiveDebugValues::transferDebugValue(const MachineInstr &MI,
|
|
349 OpenRangesSet &OpenRanges,
|
|
350 VarLocMap &VarLocIDs) {
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
351 if (!MI.isDebugValue())
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
352 return;
|
120
|
353 const DILocalVariable *Var = MI.getDebugVariable();
|
|
354 const DILocation *DebugLoc = MI.getDebugLoc();
|
|
355 const DILocation *InlinedAt = DebugLoc->getInlinedAt();
|
|
356 assert(Var->isValidLocationForIntrinsic(DebugLoc) &&
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
357 "Expected inlined-at fields to agree");
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
358
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
359 // End all previous ranges of Var.
|
120
|
360 DebugVariable V(Var, InlinedAt);
|
|
361 OpenRanges.erase(V);
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
362
|
120
|
363 // Add the VarLoc to OpenRanges from this DBG_VALUE.
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
364 // TODO: Currently handles DBG_VALUE which has only reg as location.
|
120
|
365 if (isDbgValueDescribedByReg(MI)) {
|
|
366 VarLoc VL(MI, LS);
|
|
367 unsigned ID = VarLocIDs.insert(VL);
|
|
368 OpenRanges.insert(ID, VL.Var);
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
369 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
370 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
371
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
372 /// A definition of a register may mark the end of a range.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
373 void LiveDebugValues::transferRegisterDef(MachineInstr &MI,
|
120
|
374 OpenRangesSet &OpenRanges,
|
|
375 const VarLocMap &VarLocIDs) {
|
121
|
376 MachineFunction *MF = MI.getMF();
|
120
|
377 const TargetLowering *TLI = MF->getSubtarget().getTargetLowering();
|
|
378 unsigned SP = TLI->getStackPointerRegisterToSaveRestore();
|
|
379 SparseBitVector<> KillSet;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
380 for (const MachineOperand &MO : MI.operands()) {
|
121
|
381 // Determine whether the operand is a register def. Assume that call
|
|
382 // instructions never clobber SP, because some backends (e.g., AArch64)
|
|
383 // never list SP in the regmask.
|
120
|
384 if (MO.isReg() && MO.isDef() && MO.getReg() &&
|
121
|
385 TRI->isPhysicalRegister(MO.getReg()) &&
|
|
386 !(MI.isCall() && MO.getReg() == SP)) {
|
120
|
387 // Remove ranges of all aliased registers.
|
|
388 for (MCRegAliasIterator RAI(MO.getReg(), TRI, true); RAI.isValid(); ++RAI)
|
|
389 for (unsigned ID : OpenRanges.getVarLocs())
|
|
390 if (VarLocIDs[ID].isDescribedByReg() == *RAI)
|
|
391 KillSet.set(ID);
|
|
392 } else if (MO.isRegMask()) {
|
|
393 // Remove ranges of all clobbered registers. Register masks don't usually
|
|
394 // list SP as preserved. While the debug info may be off for an
|
|
395 // instruction or two around callee-cleanup calls, transferring the
|
|
396 // DEBUG_VALUE across the call is still a better user experience.
|
|
397 for (unsigned ID : OpenRanges.getVarLocs()) {
|
|
398 unsigned Reg = VarLocIDs[ID].isDescribedByReg();
|
|
399 if (Reg && Reg != SP && MO.clobbersPhysReg(Reg))
|
|
400 KillSet.set(ID);
|
|
401 }
|
|
402 }
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
403 }
|
120
|
404 OpenRanges.erase(KillSet, VarLocIDs);
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
405 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
406
|
121
|
407 /// Decide if @MI is a spill instruction and return true if it is. We use 2
|
|
408 /// criteria to make this decision:
|
|
409 /// - Is this instruction a store to a spill slot?
|
|
410 /// - Is there a register operand that is both used and killed?
|
|
411 /// TODO: Store optimization can fold spills into other stores (including
|
|
412 /// other spills). We do not handle this yet (more than one memory operand).
|
|
413 bool LiveDebugValues::isSpillInstruction(const MachineInstr &MI,
|
|
414 MachineFunction *MF, unsigned &Reg) {
|
|
415 const MachineFrameInfo &FrameInfo = MF->getFrameInfo();
|
|
416 int FI;
|
|
417 const MachineMemOperand *MMO;
|
|
418
|
|
419 // TODO: Handle multiple stores folded into one.
|
|
420 if (!MI.hasOneMemOperand())
|
|
421 return false;
|
|
422
|
|
423 // To identify a spill instruction, use the same criteria as in AsmPrinter.
|
|
424 if (!((TII->isStoreToStackSlotPostFE(MI, FI) ||
|
|
425 TII->hasStoreToStackSlot(MI, MMO, FI)) &&
|
|
426 FrameInfo.isSpillSlotObjectIndex(FI)))
|
|
427 return false;
|
|
428
|
134
|
429 auto isKilledReg = [&](const MachineOperand MO, unsigned &Reg) {
|
|
430 if (!MO.isReg() || !MO.isUse()) {
|
|
431 Reg = 0;
|
|
432 return false;
|
|
433 }
|
|
434 Reg = MO.getReg();
|
|
435 return MO.isKill();
|
|
436 };
|
|
437
|
121
|
438 for (const MachineOperand &MO : MI.operands()) {
|
134
|
439 // In a spill instruction generated by the InlineSpiller the spilled
|
|
440 // register has its kill flag set.
|
|
441 if (isKilledReg(MO, Reg))
|
|
442 return true;
|
|
443 if (Reg != 0) {
|
|
444 // Check whether next instruction kills the spilled register.
|
|
445 // FIXME: Current solution does not cover search for killed register in
|
|
446 // bundles and instructions further down the chain.
|
|
447 auto NextI = std::next(MI.getIterator());
|
|
448 // Skip next instruction that points to basic block end iterator.
|
|
449 if (MI.getParent()->end() == NextI)
|
|
450 continue;
|
|
451 unsigned RegNext;
|
|
452 for (const MachineOperand &MONext : NextI->operands()) {
|
|
453 // Return true if we came across the register from the
|
|
454 // previous spill instruction that is killed in NextI.
|
|
455 if (isKilledReg(MONext, RegNext) && RegNext == Reg)
|
|
456 return true;
|
|
457 }
|
121
|
458 }
|
|
459 }
|
134
|
460 // Return false if we didn't find spilled register.
|
|
461 return false;
|
121
|
462 }
|
|
463
|
|
464 /// A spilled register may indicate that we have to end the current range of
|
|
465 /// a variable and create a new one for the spill location.
|
|
466 /// We don't want to insert any instructions in transfer(), so we just create
|
|
467 /// the DBG_VALUE witout inserting it and keep track of it in @Spills.
|
|
468 /// It will be inserted into the BB when we're done iterating over the
|
|
469 /// instructions.
|
|
470 void LiveDebugValues::transferSpillInst(MachineInstr &MI,
|
|
471 OpenRangesSet &OpenRanges,
|
|
472 VarLocMap &VarLocIDs,
|
|
473 SpillMap &Spills) {
|
|
474 unsigned Reg;
|
|
475 MachineFunction *MF = MI.getMF();
|
|
476 if (!isSpillInstruction(MI, MF, Reg))
|
|
477 return;
|
|
478
|
|
479 // Check if the register is the location of a debug value.
|
|
480 for (unsigned ID : OpenRanges.getVarLocs()) {
|
|
481 if (VarLocIDs[ID].isDescribedByReg() == Reg) {
|
134
|
482 DEBUG(dbgs() << "Spilling Register " << printReg(Reg, TRI) << '('
|
121
|
483 << VarLocIDs[ID].Var.getVar()->getName() << ")\n");
|
|
484
|
|
485 // Create a DBG_VALUE instruction to describe the Var in its spilled
|
|
486 // location, but don't insert it yet to avoid invalidating the
|
|
487 // iterator in our caller.
|
|
488 unsigned SpillBase;
|
|
489 int SpillOffset = extractSpillBaseRegAndOffset(MI, SpillBase);
|
|
490 const MachineInstr *DMI = &VarLocIDs[ID].MI;
|
|
491 auto *SpillExpr = DIExpression::prepend(
|
|
492 DMI->getDebugExpression(), DIExpression::NoDeref, SpillOffset);
|
|
493 MachineInstr *SpDMI =
|
|
494 BuildMI(*MF, DMI->getDebugLoc(), DMI->getDesc(), true, SpillBase,
|
|
495 DMI->getDebugVariable(), SpillExpr);
|
|
496 DEBUG(dbgs() << "Creating DBG_VALUE inst for spill: ";
|
|
497 SpDMI->print(dbgs(), false, TII));
|
|
498
|
|
499 // The newly created DBG_VALUE instruction SpDMI must be inserted after
|
|
500 // MI. Keep track of the pairing.
|
|
501 SpillDebugPair MIP = {&MI, SpDMI};
|
|
502 Spills.push_back(MIP);
|
|
503
|
|
504 // End all previous ranges of Var.
|
|
505 OpenRanges.erase(VarLocIDs[ID].Var);
|
|
506
|
|
507 // Add the VarLoc to OpenRanges.
|
|
508 VarLoc VL(*SpDMI, LS);
|
|
509 unsigned SpillLocID = VarLocIDs.insert(VL);
|
|
510 OpenRanges.insert(SpillLocID, VL.Var);
|
|
511 return;
|
|
512 }
|
|
513 }
|
|
514 }
|
|
515
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
516 /// Terminate all open ranges at the end of the current basic block.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
517 bool LiveDebugValues::transferTerminatorInst(MachineInstr &MI,
|
120
|
518 OpenRangesSet &OpenRanges,
|
|
519 VarLocInMBB &OutLocs,
|
|
520 const VarLocMap &VarLocIDs) {
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
521 bool Changed = false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
522 const MachineBasicBlock *CurMBB = MI.getParent();
|
134
|
523 if (!(MI.isTerminator() || (&MI == &CurMBB->back())))
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
524 return false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
525
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
526 if (OpenRanges.empty())
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
527 return false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
528
|
120
|
529 DEBUG(for (unsigned ID : OpenRanges.getVarLocs()) {
|
|
530 // Copy OpenRanges to OutLocs, if not already present.
|
|
531 dbgs() << "Add to OutLocs: "; VarLocIDs[ID].dump();
|
|
532 });
|
|
533 VarLocSet &VLS = OutLocs[CurMBB];
|
|
534 Changed = VLS |= OpenRanges.getVarLocs();
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
535 OpenRanges.clear();
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
536 return Changed;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
537 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
538
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
539 /// This routine creates OpenRanges and OutLocs.
|
120
|
540 bool LiveDebugValues::transfer(MachineInstr &MI, OpenRangesSet &OpenRanges,
|
121
|
541 VarLocInMBB &OutLocs, VarLocMap &VarLocIDs,
|
|
542 SpillMap &Spills, bool transferSpills) {
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
543 bool Changed = false;
|
120
|
544 transferDebugValue(MI, OpenRanges, VarLocIDs);
|
|
545 transferRegisterDef(MI, OpenRanges, VarLocIDs);
|
121
|
546 if (transferSpills)
|
|
547 transferSpillInst(MI, OpenRanges, VarLocIDs, Spills);
|
120
|
548 Changed = transferTerminatorInst(MI, OpenRanges, OutLocs, VarLocIDs);
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
549 return Changed;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
550 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
551
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
552 /// This routine joins the analysis results of all incoming edges in @MBB by
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
553 /// inserting a new DBG_VALUE instruction at the start of the @MBB - if the same
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
554 /// source variable in all the predecessors of @MBB reside in the same location.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
555 bool LiveDebugValues::join(MachineBasicBlock &MBB, VarLocInMBB &OutLocs,
|
120
|
556 VarLocInMBB &InLocs, const VarLocMap &VarLocIDs,
|
|
557 SmallPtrSet<const MachineBasicBlock *, 16> &Visited) {
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
558 DEBUG(dbgs() << "join MBB: " << MBB.getName() << "\n");
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
559 bool Changed = false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
560
|
120
|
561 VarLocSet InLocsT; // Temporary incoming locations.
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
562
|
120
|
563 // For all predecessors of this MBB, find the set of VarLocs that
|
|
564 // can be joined.
|
|
565 int NumVisited = 0;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
566 for (auto p : MBB.predecessors()) {
|
120
|
567 // Ignore unvisited predecessor blocks. As we are processing
|
|
568 // the blocks in reverse post-order any unvisited block can
|
|
569 // be considered to not remove any incoming values.
|
|
570 if (!Visited.count(p))
|
|
571 continue;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
572 auto OL = OutLocs.find(p);
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
573 // Join is null in case of empty OutLocs from any of the pred.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
574 if (OL == OutLocs.end())
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
575 return false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
576
|
120
|
577 // Just copy over the Out locs to incoming locs for the first visited
|
|
578 // predecessor, and for all other predecessors join the Out locs.
|
|
579 if (!NumVisited)
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
580 InLocsT = OL->second;
|
120
|
581 else
|
|
582 InLocsT &= OL->second;
|
|
583 NumVisited++;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
584 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
585
|
120
|
586 // Filter out DBG_VALUES that are out of scope.
|
|
587 VarLocSet KillSet;
|
|
588 for (auto ID : InLocsT)
|
|
589 if (!VarLocIDs[ID].dominates(MBB))
|
|
590 KillSet.set(ID);
|
|
591 InLocsT.intersectWithComplement(KillSet);
|
|
592
|
|
593 // As we are processing blocks in reverse post-order we
|
|
594 // should have processed at least one predecessor, unless it
|
|
595 // is the entry block which has no predecessor.
|
|
596 assert((NumVisited || MBB.pred_empty()) &&
|
|
597 "Should have processed at least one predecessor");
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
598 if (InLocsT.empty())
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
599 return false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
600
|
120
|
601 VarLocSet &ILS = InLocs[&MBB];
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
602
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
603 // Insert DBG_VALUE instructions, if not already inserted.
|
120
|
604 VarLocSet Diff = InLocsT;
|
|
605 Diff.intersectWithComplement(ILS);
|
|
606 for (auto ID : Diff) {
|
|
607 // This VarLoc is not found in InLocs i.e. it is not yet inserted. So, a
|
|
608 // new range is started for the var from the mbb's beginning by inserting
|
|
609 // a new DBG_VALUE. transfer() will end this range however appropriate.
|
|
610 const VarLoc &DiffIt = VarLocIDs[ID];
|
|
611 const MachineInstr *DMI = &DiffIt.MI;
|
|
612 MachineInstr *MI =
|
|
613 BuildMI(MBB, MBB.instr_begin(), DMI->getDebugLoc(), DMI->getDesc(),
|
121
|
614 DMI->isIndirectDebugValue(), DMI->getOperand(0).getReg(),
|
120
|
615 DMI->getDebugVariable(), DMI->getDebugExpression());
|
|
616 if (DMI->isIndirectDebugValue())
|
|
617 MI->getOperand(1).setImm(DMI->getOperand(1).getImm());
|
|
618 DEBUG(dbgs() << "Inserted: "; MI->dump(););
|
|
619 ILS.set(ID);
|
|
620 ++NumInserted;
|
|
621 Changed = true;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
622 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
623 return Changed;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
624 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
625
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
626 /// Calculate the liveness information for the given machine function and
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
627 /// extend ranges across basic blocks.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
628 bool LiveDebugValues::ExtendRanges(MachineFunction &MF) {
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
629 DEBUG(dbgs() << "\nDebug Range Extension\n");
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
630
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
631 bool Changed = false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
632 bool OLChanged = false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
633 bool MBBJoined = false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
634
|
121
|
635 VarLocMap VarLocIDs; // Map VarLoc<>unique ID for use in bitvectors.
|
120
|
636 OpenRangesSet OpenRanges; // Ranges that are open until end of bb.
|
121
|
637 VarLocInMBB OutLocs; // Ranges that exist beyond bb.
|
|
638 VarLocInMBB InLocs; // Ranges that are incoming after joining.
|
|
639 SpillMap Spills; // DBG_VALUEs associated with spills.
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
640
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
641 DenseMap<unsigned int, MachineBasicBlock *> OrderToBB;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
642 DenseMap<MachineBasicBlock *, unsigned int> BBToOrder;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
643 std::priority_queue<unsigned int, std::vector<unsigned int>,
|
120
|
644 std::greater<unsigned int>>
|
|
645 Worklist;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
646 std::priority_queue<unsigned int, std::vector<unsigned int>,
|
120
|
647 std::greater<unsigned int>>
|
|
648 Pending;
|
|
649
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
650 // Initialize every mbb with OutLocs.
|
121
|
651 // We are not looking at any spill instructions during the initial pass
|
|
652 // over the BBs. The LiveDebugVariables pass has already created DBG_VALUE
|
|
653 // instructions for spills of registers that are known to be user variables
|
|
654 // within the BB in which the spill occurs.
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
655 for (auto &MBB : MF)
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
656 for (auto &MI : MBB)
|
121
|
657 transfer(MI, OpenRanges, OutLocs, VarLocIDs, Spills,
|
|
658 /*transferSpills=*/false);
|
120
|
659
|
|
660 DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs, "OutLocs after initialization",
|
|
661 dbgs()));
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
662
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
663 ReversePostOrderTraversal<MachineFunction *> RPOT(&MF);
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
664 unsigned int RPONumber = 0;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
665 for (auto RI = RPOT.begin(), RE = RPOT.end(); RI != RE; ++RI) {
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
666 OrderToBB[RPONumber] = *RI;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
667 BBToOrder[*RI] = RPONumber;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
668 Worklist.push(RPONumber);
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
669 ++RPONumber;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
670 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
671 // This is a standard "union of predecessor outs" dataflow problem.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
672 // To solve it, we perform join() and transfer() using the two worklist method
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
673 // until the ranges converge.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
674 // Ranges have converged when both worklists are empty.
|
120
|
675 SmallPtrSet<const MachineBasicBlock *, 16> Visited;
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
676 while (!Worklist.empty() || !Pending.empty()) {
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
677 // We track what is on the pending worklist to avoid inserting the same
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
678 // thing twice. We could avoid this with a custom priority queue, but this
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
679 // is probably not worth it.
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
680 SmallPtrSet<MachineBasicBlock *, 16> OnPending;
|
120
|
681 DEBUG(dbgs() << "Processing Worklist\n");
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
682 while (!Worklist.empty()) {
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
683 MachineBasicBlock *MBB = OrderToBB[Worklist.top()];
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
684 Worklist.pop();
|
120
|
685 MBBJoined = join(*MBB, OutLocs, InLocs, VarLocIDs, Visited);
|
|
686 Visited.insert(MBB);
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
687 if (MBBJoined) {
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
688 MBBJoined = false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
689 Changed = true;
|
121
|
690 // Now that we have started to extend ranges across BBs we need to
|
|
691 // examine spill instructions to see whether they spill registers that
|
|
692 // correspond to user variables.
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
693 for (auto &MI : *MBB)
|
121
|
694 OLChanged |= transfer(MI, OpenRanges, OutLocs, VarLocIDs, Spills,
|
|
695 /*transferSpills=*/true);
|
|
696
|
|
697 // Add any DBG_VALUE instructions necessitated by spills.
|
|
698 for (auto &SP : Spills)
|
|
699 MBB->insertAfter(MachineBasicBlock::iterator(*SP.SpillInst),
|
|
700 SP.DebugInst);
|
|
701 Spills.clear();
|
120
|
702
|
|
703 DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs,
|
|
704 "OutLocs after propagating", dbgs()));
|
|
705 DEBUG(printVarLocInMBB(MF, InLocs, VarLocIDs,
|
|
706 "InLocs after propagating", dbgs()));
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
707
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
708 if (OLChanged) {
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
709 OLChanged = false;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
710 for (auto s : MBB->successors())
|
120
|
711 if (OnPending.insert(s).second) {
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
712 Pending.push(BBToOrder[s]);
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
713 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
714 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
715 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
716 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
717 Worklist.swap(Pending);
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
718 // At this point, pending must be empty, since it was just the empty
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
719 // worklist
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
720 assert(Pending.empty() && "Pending should be empty");
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
721 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
722
|
120
|
723 DEBUG(printVarLocInMBB(MF, OutLocs, VarLocIDs, "Final OutLocs", dbgs()));
|
|
724 DEBUG(printVarLocInMBB(MF, InLocs, VarLocIDs, "Final InLocs", dbgs()));
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
725 return Changed;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
726 }
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
727
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
728 bool LiveDebugValues::runOnMachineFunction(MachineFunction &MF) {
|
134
|
729 if (!MF.getFunction().getSubprogram())
|
120
|
730 // LiveDebugValues will already have removed all DBG_VALUEs.
|
|
731 return false;
|
|
732
|
121
|
733 // Skip functions from NoDebug compilation units.
|
134
|
734 if (MF.getFunction().getSubprogram()->getUnit()->getEmissionKind() ==
|
121
|
735 DICompileUnit::NoDebug)
|
|
736 return false;
|
|
737
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
738 TRI = MF.getSubtarget().getRegisterInfo();
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
739 TII = MF.getSubtarget().getInstrInfo();
|
121
|
740 TFI = MF.getSubtarget().getFrameLowering();
|
120
|
741 LS.initialize(MF);
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
742
|
120
|
743 bool Changed = ExtendRanges(MF);
|
100
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
744 return Changed;
|
Miyagi Mitsuki <e135756@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
745 }
|