0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1 //===---- LiveRangeCalc.cpp - Calculate live ranges -----------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
3 // The LLVM Compiler Infrastructure
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
5 // This file is distributed under the University of Illinois Open Source
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 // License. See LICENSE.TXT for details.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
10 // Implementation of the LiveRangeCalc class.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 #include "LiveRangeCalc.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 #include "llvm/CodeGen/MachineDominators.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 #include "llvm/CodeGen/MachineRegisterInfo.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
17
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
18 using namespace llvm;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
19
|
77
|
20 #define DEBUG_TYPE "regalloc"
|
|
21
|
83
|
22 void LiveRangeCalc::resetLiveOutMap() {
|
|
23 unsigned NumBlocks = MF->getNumBlockIDs();
|
|
24 Seen.clear();
|
|
25 Seen.resize(NumBlocks);
|
|
26 Map.resize(NumBlocks);
|
|
27 }
|
|
28
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
29 void LiveRangeCalc::reset(const MachineFunction *mf,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
30 SlotIndexes *SI,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
31 MachineDominatorTree *MDT,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
32 VNInfo::Allocator *VNIA) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
33 MF = mf;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
34 MRI = &MF->getRegInfo();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
35 Indexes = SI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
36 DomTree = MDT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
37 Alloc = VNIA;
|
83
|
38 resetLiveOutMap();
|
|
39 LiveIn.clear();
|
|
40 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
41
|
83
|
42
|
|
43 static void createDeadDef(SlotIndexes &Indexes, VNInfo::Allocator &Alloc,
|
|
44 LiveRange &LR, const MachineOperand &MO) {
|
|
45 const MachineInstr *MI = MO.getParent();
|
95
|
46 SlotIndex DefIdx =
|
|
47 Indexes.getInstructionIndex(MI).getRegSlot(MO.isEarlyClobber());
|
83
|
48
|
|
49 // Create the def in LR. This may find an existing def.
|
|
50 LR.createDeadDef(DefIdx, Alloc);
|
|
51 }
|
|
52
|
95
|
53 void LiveRangeCalc::calculate(LiveInterval &LI, bool TrackSubRegs) {
|
83
|
54 assert(MRI && Indexes && "call reset() first");
|
|
55
|
|
56 // Step 1: Create minimal live segments for every definition of Reg.
|
|
57 // Visit all def operands. If the same instruction has multiple defs of Reg,
|
|
58 // createDeadDef() will deduplicate.
|
|
59 const TargetRegisterInfo &TRI = *MRI->getTargetRegisterInfo();
|
|
60 unsigned Reg = LI.reg;
|
|
61 for (const MachineOperand &MO : MRI->reg_nodbg_operands(Reg)) {
|
|
62 if (!MO.isDef() && !MO.readsReg())
|
|
63 continue;
|
|
64
|
|
65 unsigned SubReg = MO.getSubReg();
|
95
|
66 if (LI.hasSubRanges() || (SubReg != 0 && TrackSubRegs)) {
|
|
67 LaneBitmask Mask = SubReg != 0 ? TRI.getSubRegIndexLaneMask(SubReg)
|
|
68 : MRI->getMaxLaneMaskForVReg(Reg);
|
83
|
69
|
|
70 // If this is the first time we see a subregister def, initialize
|
|
71 // subranges by creating a copy of the main range.
|
|
72 if (!LI.hasSubRanges() && !LI.empty()) {
|
95
|
73 LaneBitmask ClassMask = MRI->getMaxLaneMaskForVReg(Reg);
|
83
|
74 LI.createSubRangeFrom(*Alloc, ClassMask, LI);
|
|
75 }
|
|
76
|
|
77 for (LiveInterval::SubRange &S : LI.subranges()) {
|
|
78 // A Mask for subregs common to the existing subrange and current def.
|
95
|
79 LaneBitmask Common = S.LaneMask & Mask;
|
83
|
80 if (Common == 0)
|
|
81 continue;
|
|
82 // A Mask for subregs covered by the subrange but not the current def.
|
95
|
83 LaneBitmask LRest = S.LaneMask & ~Mask;
|
83
|
84 LiveInterval::SubRange *CommonRange;
|
|
85 if (LRest != 0) {
|
|
86 // Split current subrange into Common and LRest ranges.
|
|
87 S.LaneMask = LRest;
|
|
88 CommonRange = LI.createSubRangeFrom(*Alloc, Common, S);
|
|
89 } else {
|
|
90 assert(Common == S.LaneMask);
|
|
91 CommonRange = &S;
|
|
92 }
|
|
93 if (MO.isDef())
|
|
94 createDeadDef(*Indexes, *Alloc, *CommonRange, MO);
|
|
95 Mask &= ~Common;
|
|
96 }
|
|
97 // Create a new SubRange for subregs we did not cover yet.
|
|
98 if (Mask != 0) {
|
|
99 LiveInterval::SubRange *NewRange = LI.createSubRange(*Alloc, Mask);
|
|
100 if (MO.isDef())
|
|
101 createDeadDef(*Indexes, *Alloc, *NewRange, MO);
|
|
102 }
|
|
103 }
|
|
104
|
|
105 // Create the def in the main liverange. We do not have to do this if
|
|
106 // subranges are tracked as we recreate the main range later in this case.
|
|
107 if (MO.isDef() && !LI.hasSubRanges())
|
|
108 createDeadDef(*Indexes, *Alloc, LI, MO);
|
|
109 }
|
|
110
|
|
111 // We may have created empty live ranges for partially undefined uses, we
|
|
112 // can't keep them because we won't find defs in them later.
|
|
113 LI.removeEmptySubRanges();
|
|
114
|
|
115 // Step 2: Extend live segments to all uses, constructing SSA form as
|
|
116 // necessary.
|
|
117 if (LI.hasSubRanges()) {
|
|
118 for (LiveInterval::SubRange &S : LI.subranges()) {
|
|
119 resetLiveOutMap();
|
|
120 extendToUses(S, Reg, S.LaneMask);
|
|
121 }
|
|
122 LI.clear();
|
|
123 LI.constructMainRangeFromSubranges(*Indexes, *Alloc);
|
|
124 } else {
|
|
125 resetLiveOutMap();
|
|
126 extendToUses(LI, Reg, ~0u);
|
|
127 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
128 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
129
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
130
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
131 void LiveRangeCalc::createDeadDefs(LiveRange &LR, unsigned Reg) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
132 assert(MRI && Indexes && "call reset() first");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
133
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
134 // Visit all def operands. If the same instruction has multiple defs of Reg,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
135 // LR.createDeadDef() will deduplicate.
|
83
|
136 for (MachineOperand &MO : MRI->def_operands(Reg))
|
|
137 createDeadDef(*Indexes, *Alloc, LR, MO);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
138 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
139
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
140
|
95
|
141 void LiveRangeCalc::extendToUses(LiveRange &LR, unsigned Reg,
|
|
142 LaneBitmask Mask) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
143 // Visit all operands that read Reg. This may include partial defs.
|
83
|
144 const TargetRegisterInfo &TRI = *MRI->getTargetRegisterInfo();
|
77
|
145 for (MachineOperand &MO : MRI->reg_nodbg_operands(Reg)) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
146 // Clear all kill flags. They will be reinserted after register allocation
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
147 // by LiveIntervalAnalysis::addKillFlags().
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
148 if (MO.isUse())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
149 MO.setIsKill(false);
|
83
|
150 else {
|
|
151 // We only care about uses, but on the main range (mask ~0u) this includes
|
|
152 // the "virtual" reads happening for subregister defs.
|
|
153 if (Mask != ~0u)
|
|
154 continue;
|
|
155 }
|
|
156
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
157 if (!MO.readsReg())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
158 continue;
|
83
|
159 unsigned SubReg = MO.getSubReg();
|
|
160 if (SubReg != 0) {
|
95
|
161 LaneBitmask SubRegMask = TRI.getSubRegIndexLaneMask(SubReg);
|
83
|
162 // Ignore uses not covering the current subrange.
|
|
163 if ((SubRegMask & Mask) == 0)
|
|
164 continue;
|
|
165 }
|
|
166
|
|
167 // Determine the actual place of the use.
|
77
|
168 const MachineInstr *MI = MO.getParent();
|
|
169 unsigned OpNo = (&MO - &MI->getOperand(0));
|
83
|
170 SlotIndex UseIdx;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
171 if (MI->isPHI()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
172 assert(!MO.isDef() && "Cannot handle PHI def of partial register.");
|
83
|
173 // The actual place where a phi operand is used is the end of the pred
|
|
174 // MBB. PHI operands are paired: (Reg, PredMBB).
|
|
175 UseIdx = Indexes->getMBBEndIdx(MI->getOperand(OpNo+1).getMBB());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
176 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
177 // Check for early-clobber redefs.
|
83
|
178 bool isEarlyClobber = false;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
179 unsigned DefIdx;
|
83
|
180 if (MO.isDef())
|
|
181 isEarlyClobber = MO.isEarlyClobber();
|
|
182 else if (MI->isRegTiedToDefOperand(OpNo, &DefIdx)) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
183 // FIXME: This would be a lot easier if tied early-clobber uses also
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
184 // had an early-clobber flag.
|
83
|
185 isEarlyClobber = MI->getOperand(DefIdx).isEarlyClobber();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
186 }
|
83
|
187 UseIdx = Indexes->getInstructionIndex(MI).getRegSlot(isEarlyClobber);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
188 }
|
83
|
189
|
|
190 // MI is reading Reg. We may have visited MI before if it happens to be
|
|
191 // reading Reg multiple times. That is OK, extend() is idempotent.
|
|
192 extend(LR, UseIdx, Reg);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
193 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
194 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
195
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
196
|
83
|
197 void LiveRangeCalc::updateFromLiveIns() {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
198 LiveRangeUpdater Updater;
|
83
|
199 for (const LiveInBlock &I : LiveIn) {
|
|
200 if (!I.DomNode)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
201 continue;
|
83
|
202 MachineBasicBlock *MBB = I.DomNode->getBlock();
|
|
203 assert(I.Value && "No live-in value found");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
204 SlotIndex Start, End;
|
77
|
205 std::tie(Start, End) = Indexes->getMBBRange(MBB);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
206
|
83
|
207 if (I.Kill.isValid())
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
208 // Value is killed inside this block.
|
83
|
209 End = I.Kill;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
210 else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
211 // The value is live-through, update LiveOut as well.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
212 // Defer the Domtree lookup until it is needed.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
213 assert(Seen.test(MBB->getNumber()));
|
83
|
214 Map[MBB] = LiveOutPair(I.Value, nullptr);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
215 }
|
83
|
216 Updater.setDest(&I.LR);
|
|
217 Updater.add(Start, End, I.Value);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
218 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
219 LiveIn.clear();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
220 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
221
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
222
|
83
|
223 void LiveRangeCalc::extend(LiveRange &LR, SlotIndex Use, unsigned PhysReg) {
|
|
224 assert(Use.isValid() && "Invalid SlotIndex");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
225 assert(Indexes && "Missing SlotIndexes");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
226 assert(DomTree && "Missing dominator tree");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
227
|
83
|
228 MachineBasicBlock *UseMBB = Indexes->getMBBFromIndex(Use.getPrevSlot());
|
|
229 assert(UseMBB && "No MBB at Use");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
230
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
231 // Is there a def in the same MBB we can extend?
|
83
|
232 if (LR.extendInBlock(Indexes->getMBBStartIdx(UseMBB), Use))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
233 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
234
|
83
|
235 // Find the single reaching def, or determine if Use is jointly dominated by
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
236 // multiple values, and we may need to create even more phi-defs to preserve
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
237 // VNInfo SSA form. Perform a search for all predecessor blocks where we
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
238 // know the dominating VNInfo.
|
83
|
239 if (findReachingDefs(LR, *UseMBB, Use, PhysReg))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
240 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
241
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
242 // When there were multiple different values, we may need new PHIs.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
243 calculateValues();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
244 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
245
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
246
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
247 // This function is called by a client after using the low-level API to add
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
248 // live-out and live-in blocks. The unique value optimization is not
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
249 // available, SplitEditor::transferValues handles that case directly anyway.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
250 void LiveRangeCalc::calculateValues() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
251 assert(Indexes && "Missing SlotIndexes");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
252 assert(DomTree && "Missing dominator tree");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
253 updateSSA();
|
83
|
254 updateFromLiveIns();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
255 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
256
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
257
|
83
|
258 bool LiveRangeCalc::findReachingDefs(LiveRange &LR, MachineBasicBlock &UseMBB,
|
|
259 SlotIndex Use, unsigned PhysReg) {
|
|
260 unsigned UseMBBNum = UseMBB.getNumber();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
261
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
262 // Block numbers where LR should be live-in.
|
83
|
263 SmallVector<unsigned, 16> WorkList(1, UseMBBNum);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
264
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
265 // Remember if we have seen more than one value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
266 bool UniqueVNI = true;
|
77
|
267 VNInfo *TheVNI = nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
268
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
269 // Using Seen as a visited set, perform a BFS for all reaching defs.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
270 for (unsigned i = 0; i != WorkList.size(); ++i) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
271 MachineBasicBlock *MBB = MF->getBlockNumbered(WorkList[i]);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
272
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
273 #ifndef NDEBUG
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
274 if (MBB->pred_empty()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
275 MBB->getParent()->verify();
|
95
|
276 errs() << "Use of " << PrintReg(PhysReg)
|
|
277 << " does not have a corresponding definition on every path:\n";
|
|
278 const MachineInstr *MI = Indexes->getInstructionFromIndex(Use);
|
|
279 if (MI != nullptr)
|
|
280 errs() << Use << " " << *MI;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
281 llvm_unreachable("Use not jointly dominated by defs.");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
282 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
283
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
284 if (TargetRegisterInfo::isPhysicalRegister(PhysReg) &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
285 !MBB->isLiveIn(PhysReg)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
286 MBB->getParent()->verify();
|
95
|
287 errs() << "The register " << PrintReg(PhysReg)
|
|
288 << " needs to be live in to BB#" << MBB->getNumber()
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
289 << ", but is missing from the live-in list.\n";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
290 llvm_unreachable("Invalid global physical register");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
291 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
292 #endif
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
293
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
294 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
295 PE = MBB->pred_end(); PI != PE; ++PI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
296 MachineBasicBlock *Pred = *PI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
297
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
298 // Is this a known live-out block?
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
299 if (Seen.test(Pred->getNumber())) {
|
83
|
300 if (VNInfo *VNI = Map[Pred].first) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
301 if (TheVNI && TheVNI != VNI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
302 UniqueVNI = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
303 TheVNI = VNI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
304 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
305 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
306 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
307
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
308 SlotIndex Start, End;
|
77
|
309 std::tie(Start, End) = Indexes->getMBBRange(Pred);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
310
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
311 // First time we see Pred. Try to determine the live-out value, but set
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
312 // it as null if Pred is live-through with an unknown value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
313 VNInfo *VNI = LR.extendInBlock(Start, End);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
314 setLiveOutValue(Pred, VNI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
315 if (VNI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
316 if (TheVNI && TheVNI != VNI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
317 UniqueVNI = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
318 TheVNI = VNI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
319 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
320 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
321
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
322 // No, we need a live-in value for Pred as well
|
83
|
323 if (Pred != &UseMBB)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
324 WorkList.push_back(Pred->getNumber());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
325 else
|
83
|
326 // Loopback to UseMBB, so value is really live through.
|
|
327 Use = SlotIndex();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
328 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
329 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
330
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
331 LiveIn.clear();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
332
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
333 // Both updateSSA() and LiveRangeUpdater benefit from ordered blocks, but
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
334 // neither require it. Skip the sorting overhead for small updates.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
335 if (WorkList.size() > 4)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
336 array_pod_sort(WorkList.begin(), WorkList.end());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
337
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
338 // If a unique reaching def was found, blit in the live ranges immediately.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
339 if (UniqueVNI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
340 LiveRangeUpdater Updater(&LR);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
341 for (SmallVectorImpl<unsigned>::const_iterator I = WorkList.begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
342 E = WorkList.end(); I != E; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
343 SlotIndex Start, End;
|
77
|
344 std::tie(Start, End) = Indexes->getMBBRange(*I);
|
83
|
345 // Trim the live range in UseMBB.
|
|
346 if (*I == UseMBBNum && Use.isValid())
|
|
347 End = Use;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
348 else
|
83
|
349 Map[MF->getBlockNumbered(*I)] = LiveOutPair(TheVNI, nullptr);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
350 Updater.add(Start, End, TheVNI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
351 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
352 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
353 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
354
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
355 // Multiple values were found, so transfer the work list to the LiveIn array
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
356 // where UpdateSSA will use it as a work list.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
357 LiveIn.reserve(WorkList.size());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
358 for (SmallVectorImpl<unsigned>::const_iterator
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
359 I = WorkList.begin(), E = WorkList.end(); I != E; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
360 MachineBasicBlock *MBB = MF->getBlockNumbered(*I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
361 addLiveInBlock(LR, DomTree->getNode(MBB));
|
83
|
362 if (MBB == &UseMBB)
|
|
363 LiveIn.back().Kill = Use;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
364 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
365
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
366 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
367 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
368
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
369
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
370 // This is essentially the same iterative algorithm that SSAUpdater uses,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
371 // except we already have a dominator tree, so we don't have to recompute it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
372 void LiveRangeCalc::updateSSA() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
373 assert(Indexes && "Missing SlotIndexes");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
374 assert(DomTree && "Missing dominator tree");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
375
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
376 // Interate until convergence.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
377 unsigned Changes;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
378 do {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
379 Changes = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
380 // Propagate live-out values down the dominator tree, inserting phi-defs
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
381 // when necessary.
|
83
|
382 for (LiveInBlock &I : LiveIn) {
|
|
383 MachineDomTreeNode *Node = I.DomNode;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
384 // Skip block if the live-in value has already been determined.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
385 if (!Node)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
386 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
387 MachineBasicBlock *MBB = Node->getBlock();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
388 MachineDomTreeNode *IDom = Node->getIDom();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
389 LiveOutPair IDomValue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
390
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
391 // We need a live-in value to a block with no immediate dominator?
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
392 // This is probably an unreachable block that has survived somehow.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
393 bool needPHI = !IDom || !Seen.test(IDom->getBlock()->getNumber());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
394
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
395 // IDom dominates all of our predecessors, but it may not be their
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
396 // immediate dominator. Check if any of them have live-out values that are
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
397 // properly dominated by IDom. If so, we need a phi-def here.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
398 if (!needPHI) {
|
83
|
399 IDomValue = Map[IDom->getBlock()];
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
400
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
401 // Cache the DomTree node that defined the value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
402 if (IDomValue.first && !IDomValue.second)
|
83
|
403 Map[IDom->getBlock()].second = IDomValue.second =
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
404 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
405
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
406 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
407 PE = MBB->pred_end(); PI != PE; ++PI) {
|
83
|
408 LiveOutPair &Value = Map[*PI];
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
409 if (!Value.first || Value.first == IDomValue.first)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
410 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
411
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
412 // Cache the DomTree node that defined the value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
413 if (!Value.second)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
414 Value.second =
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
415 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
416
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
417 // This predecessor is carrying something other than IDomValue.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
418 // It could be because IDomValue hasn't propagated yet, or it could be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
419 // because MBB is in the dominance frontier of that value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
420 if (DomTree->dominates(IDom, Value.second)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
421 needPHI = true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
422 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
423 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
424 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
425 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
426
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
427 // The value may be live-through even if Kill is set, as can happen when
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
428 // we are called from extendRange. In that case LiveOutSeen is true, and
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
429 // LiveOut indicates a foreign or missing value.
|
83
|
430 LiveOutPair &LOP = Map[MBB];
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
431
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
432 // Create a phi-def if required.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
433 if (needPHI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
434 ++Changes;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
435 assert(Alloc && "Need VNInfo allocator to create PHI-defs");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
436 SlotIndex Start, End;
|
77
|
437 std::tie(Start, End) = Indexes->getMBBRange(MBB);
|
83
|
438 LiveRange &LR = I.LR;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
439 VNInfo *VNI = LR.getNextValue(Start, *Alloc);
|
83
|
440 I.Value = VNI;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
441 // This block is done, we know the final value.
|
83
|
442 I.DomNode = nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
443
|
83
|
444 // Add liveness since updateFromLiveIns now skips this node.
|
|
445 if (I.Kill.isValid())
|
|
446 LR.addSegment(LiveInterval::Segment(Start, I.Kill, VNI));
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
447 else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
448 LR.addSegment(LiveInterval::Segment(Start, End, VNI));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
449 LOP = LiveOutPair(VNI, Node);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
450 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
451 } else if (IDomValue.first) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
452 // No phi-def here. Remember incoming value.
|
83
|
453 I.Value = IDomValue.first;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
454
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
455 // If the IDomValue is killed in the block, don't propagate through.
|
83
|
456 if (I.Kill.isValid())
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
457 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
458
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
459 // Propagate IDomValue if it isn't killed:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
460 // MBB is live-out and doesn't define its own value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
461 if (LOP.first == IDomValue.first)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
462 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
463 ++Changes;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
464 LOP = IDomValue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
465 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
466 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
467 } while (Changes);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
468 }
|