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