1 //===-- PhiElimination.cpp - Eliminate PHI nodes by inserting copies ------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass eliminates machine instruction PHI nodes by inserting copy
11 // instructions. This destroys SSA information, but is the desired input for
12 // some register allocators.
14 //===----------------------------------------------------------------------===//
16 #define DEBUG_TYPE "phielim"
17 #include "llvm/CodeGen/LiveVariables.h"
18 #include "llvm/CodeGen/Passes.h"
19 #include "llvm/CodeGen/MachineFunctionPass.h"
20 #include "llvm/CodeGen/MachineInstr.h"
21 #include "llvm/CodeGen/MachineInstrBuilder.h"
22 #include "llvm/CodeGen/MachineRegisterInfo.h"
23 #include "llvm/Target/TargetInstrInfo.h"
24 #include "llvm/Target/TargetMachine.h"
25 #include "llvm/ADT/SmallPtrSet.h"
26 #include "llvm/ADT/STLExtras.h"
27 #include "llvm/ADT/Statistic.h"
28 #include "llvm/Support/Compiler.h"
33 STATISTIC(NumAtomic, "Number of atomic phis lowered");
36 class VISIBILITY_HIDDEN PNE : public MachineFunctionPass {
37 MachineRegisterInfo *MRI; // Machine register information
40 static char ID; // Pass identification, replacement for typeid
41 PNE() : MachineFunctionPass((intptr_t)&ID) {}
43 virtual bool runOnMachineFunction(MachineFunction &Fn);
45 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
46 AU.addPreserved<LiveVariables>();
47 AU.addPreservedID(MachineLoopInfoID);
48 AU.addPreservedID(MachineDominatorsID);
49 MachineFunctionPass::getAnalysisUsage(AU);
53 /// EliminatePHINodes - Eliminate phi nodes by inserting copy instructions
54 /// in predecessor basic blocks.
56 bool EliminatePHINodes(MachineFunction &MF, MachineBasicBlock &MBB);
57 void LowerAtomicPHINode(MachineBasicBlock &MBB,
58 MachineBasicBlock::iterator AfterPHIsIt);
60 /// analyzePHINodes - Gather information about the PHI nodes in
61 /// here. In particular, we want to map the number of uses of a virtual
62 /// register which is used in a PHI node. We map that to the BB the
63 /// vreg is coming from. This is used later to determine when the vreg
64 /// is killed in the BB.
66 void analyzePHINodes(const MachineFunction& Fn);
68 typedef std::pair<const MachineBasicBlock*, unsigned> BBVRegPair;
69 typedef std::map<BBVRegPair, unsigned> VRegPHIUse;
71 VRegPHIUse VRegPHIUseCount;
73 // Defs of PHI sources which are implicit_def.
74 SmallPtrSet<MachineInstr*, 4> ImpDefs;
79 static RegisterPass<PNE>
80 X("phi-node-elimination", "Eliminate PHI nodes for register allocation");
82 const PassInfo *const llvm::PHIEliminationID = &X;
84 bool PNE::runOnMachineFunction(MachineFunction &Fn) {
85 MRI = &Fn.getRegInfo();
91 // Eliminate PHI instructions by inserting copies into predecessor blocks.
92 for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
93 Changed |= EliminatePHINodes(Fn, *I);
95 // Remove dead IMPLICIT_DEF instructions.
96 for (SmallPtrSet<MachineInstr*,4>::iterator I = ImpDefs.begin(),
97 E = ImpDefs.end(); I != E; ++I) {
98 MachineInstr *DefMI = *I;
99 unsigned DefReg = DefMI->getOperand(0).getReg();
100 if (MRI->use_begin(DefReg) == MRI->use_end())
101 DefMI->eraseFromParent();
105 VRegPHIUseCount.clear();
110 /// EliminatePHINodes - Eliminate phi nodes by inserting copy instructions in
111 /// predecessor basic blocks.
113 bool PNE::EliminatePHINodes(MachineFunction &MF, MachineBasicBlock &MBB) {
114 if (MBB.empty() || MBB.front().getOpcode() != TargetInstrInfo::PHI)
115 return false; // Quick exit for basic blocks without PHIs.
117 // Get an iterator to the first instruction after the last PHI node (this may
118 // also be the end of the basic block).
119 MachineBasicBlock::iterator AfterPHIsIt = MBB.begin();
120 while (AfterPHIsIt != MBB.end() &&
121 AfterPHIsIt->getOpcode() == TargetInstrInfo::PHI)
122 ++AfterPHIsIt; // Skip over all of the PHI nodes...
124 while (MBB.front().getOpcode() == TargetInstrInfo::PHI)
125 LowerAtomicPHINode(MBB, AfterPHIsIt);
130 static bool isSourceDefinedByImplicitDef(const MachineInstr *MPhi,
131 const MachineRegisterInfo *MRI) {
132 for (unsigned i = 1; i != MPhi->getNumOperands(); i += 2) {
133 unsigned SrcReg = MPhi->getOperand(i).getReg();
134 const MachineInstr *DefMI = MRI->getVRegDef(SrcReg);
135 if (!DefMI || DefMI->getOpcode() != TargetInstrInfo::IMPLICIT_DEF)
141 /// LowerAtomicPHINode - Lower the PHI node at the top of the specified block,
142 /// under the assuption that it needs to be lowered in a way that supports
143 /// atomic execution of PHIs. This lowering method is always correct all of the
146 void PNE::LowerAtomicPHINode(MachineBasicBlock &MBB,
147 MachineBasicBlock::iterator AfterPHIsIt) {
148 // Unlink the PHI node from the basic block, but don't delete the PHI yet.
149 MachineInstr *MPhi = MBB.remove(MBB.begin());
151 unsigned NumSrcs = (MPhi->getNumOperands() - 1) / 2;
152 unsigned DestReg = MPhi->getOperand(0).getReg();
154 // Create a new register for the incoming PHI arguments.
155 MachineFunction &MF = *MBB.getParent();
156 const TargetRegisterClass *RC = MF.getRegInfo().getRegClass(DestReg);
157 unsigned IncomingReg = MF.getRegInfo().createVirtualRegister(RC);
159 // Insert a register to register copy at the top of the current block (but
160 // after any remaining phi nodes) which copies the new incoming register
161 // into the phi node destination.
162 const TargetInstrInfo *TII = MF.getTarget().getInstrInfo();
163 if (isSourceDefinedByImplicitDef(MPhi, MRI))
164 // If all sources of a PHI node are implicit_def, just emit an implicit_def
165 // instead of a copy.
166 BuildMI(MBB, AfterPHIsIt, TII->get(TargetInstrInfo::IMPLICIT_DEF), DestReg);
168 TII->copyRegToReg(MBB, AfterPHIsIt, DestReg, IncomingReg, RC, RC);
170 // Update live variable information if there is any.
171 LiveVariables *LV = getAnalysisToUpdate<LiveVariables>();
173 MachineInstr *PHICopy = prior(AfterPHIsIt);
175 // Increment use count of the newly created virtual register.
176 LV->getVarInfo(IncomingReg).NumUses++;
178 // Add information to LiveVariables to know that the incoming value is
179 // killed. Note that because the value is defined in several places (once
180 // each for each incoming block), the "def" block and instruction fields for
181 // the VarInfo is not filled in.
182 LV->addVirtualRegisterKilled(IncomingReg, PHICopy);
184 // Since we are going to be deleting the PHI node, if it is the last use of
185 // any registers, or if the value itself is dead, we need to move this
186 // information over to the new copy we just inserted.
187 LV->removeVirtualRegistersKilled(MPhi);
189 // If the result is dead, update LV.
190 if (MPhi->registerDefIsDead(DestReg)) {
191 LV->addVirtualRegisterDead(DestReg, PHICopy);
192 LV->removeVirtualRegistersDead(MPhi);
195 LV->getVarInfo(IncomingReg).UsedBlocks[MBB.getNumber()] = true;
198 // Adjust the VRegPHIUseCount map to account for the removal of this PHI node.
199 for (unsigned i = 1; i != MPhi->getNumOperands(); i += 2)
200 --VRegPHIUseCount[BBVRegPair(MPhi->getOperand(i + 1).getMBB(),
201 MPhi->getOperand(i).getReg())];
203 // Now loop over all of the incoming arguments, changing them to copy into the
204 // IncomingReg register in the corresponding predecessor basic block.
205 SmallPtrSet<MachineBasicBlock*, 8> MBBsInsertedInto;
206 for (int i = NumSrcs - 1; i >= 0; --i) {
207 unsigned SrcReg = MPhi->getOperand(i*2+1).getReg();
208 assert(TargetRegisterInfo::isVirtualRegister(SrcReg) &&
209 "Machine PHI Operands must all be virtual registers!");
211 // If source is defined by an implicit def, there is no need to insert a
212 // copy unless it's the only source.
213 MachineInstr *DefMI = MRI->getVRegDef(SrcReg);
214 if (DefMI->getOpcode() == TargetInstrInfo::IMPLICIT_DEF) {
215 ImpDefs.insert(DefMI);
219 // Get the MachineBasicBlock equivalent of the BasicBlock that is the source
221 MachineBasicBlock &opBlock = *MPhi->getOperand(i*2+2).getMBB();
223 // Check to make sure we haven't already emitted the copy for this block.
224 // This can happen because PHI nodes may have multiple entries for the same
226 if (!MBBsInsertedInto.insert(&opBlock))
227 continue; // If the copy has already been emitted, we're done.
229 // Find a safe location to insert the copy, this may be the first terminator
230 // in the block (or end()).
231 MachineBasicBlock::iterator InsertPos = opBlock.getFirstTerminator();
234 TII->copyRegToReg(opBlock, InsertPos, IncomingReg, SrcReg, RC, RC);
236 // Now update live variable information if we have it. Otherwise we're done
239 // We want to be able to insert a kill of the register if this PHI (aka, the
240 // copy we just inserted) is the last use of the source value. Live
241 // variable analysis conservatively handles this by saying that the value is
242 // live until the end of the block the PHI entry lives in. If the value
243 // really is dead at the PHI copy, there will be no successor blocks which
244 // have the value live-in.
246 // Check to see if the copy is the last use, and if so, update the live
247 // variables information so that it knows the copy source instruction kills
248 // the incoming value.
249 LiveVariables::VarInfo &InRegVI = LV->getVarInfo(SrcReg);
250 InRegVI.UsedBlocks[opBlock.getNumber()] = true;
252 // Loop over all of the successors of the basic block, checking to see if
253 // the value is either live in the block, or if it is killed in the block.
254 // Also check to see if this register is in use by another PHI node which
255 // has not yet been eliminated. If so, it will be killed at an appropriate
258 // Is it used by any PHI instructions in this block?
259 bool ValueIsLive = VRegPHIUseCount[BBVRegPair(&opBlock, SrcReg)] != 0;
261 std::vector<MachineBasicBlock*> OpSuccBlocks;
263 // Otherwise, scan successors, including the BB the PHI node lives in.
264 for (MachineBasicBlock::succ_iterator SI = opBlock.succ_begin(),
265 E = opBlock.succ_end(); SI != E && !ValueIsLive; ++SI) {
266 MachineBasicBlock *SuccMBB = *SI;
268 // Is it alive in this successor?
269 unsigned SuccIdx = SuccMBB->getNumber();
270 if (SuccIdx < InRegVI.AliveBlocks.size() &&
271 InRegVI.AliveBlocks[SuccIdx]) {
276 OpSuccBlocks.push_back(SuccMBB);
279 // Check to see if this value is live because there is a use in a successor
282 switch (OpSuccBlocks.size()) {
284 MachineBasicBlock *MBB = OpSuccBlocks[0];
285 for (unsigned i = 0, e = InRegVI.Kills.size(); i != e; ++i)
286 if (InRegVI.Kills[i]->getParent() == MBB) {
293 MachineBasicBlock *MBB1 = OpSuccBlocks[0], *MBB2 = OpSuccBlocks[1];
294 for (unsigned i = 0, e = InRegVI.Kills.size(); i != e; ++i)
295 if (InRegVI.Kills[i]->getParent() == MBB1 ||
296 InRegVI.Kills[i]->getParent() == MBB2) {
303 std::sort(OpSuccBlocks.begin(), OpSuccBlocks.end());
304 for (unsigned i = 0, e = InRegVI.Kills.size(); i != e; ++i)
305 if (std::binary_search(OpSuccBlocks.begin(), OpSuccBlocks.end(),
306 InRegVI.Kills[i]->getParent())) {
313 // Okay, if we now know that the value is not live out of the block, we can
314 // add a kill marker in this block saying that it kills the incoming value!
316 // In our final twist, we have to decide which instruction kills the
317 // register. In most cases this is the copy, however, the first
318 // terminator instruction at the end of the block may also use the value.
319 // In this case, we should mark *it* as being the killing block, not the
321 MachineBasicBlock::iterator KillInst = prior(InsertPos);
322 MachineBasicBlock::iterator Term = opBlock.getFirstTerminator();
323 if (Term != opBlock.end()) {
324 if (Term->readsRegister(SrcReg))
327 // Check that no other terminators use values.
329 for (MachineBasicBlock::iterator TI = next(Term); TI != opBlock.end();
331 assert(!TI->readsRegister(SrcReg) &&
332 "Terminator instructions cannot use virtual registers unless"
333 "they are the first terminator in a block!");
338 // Finally, mark it killed.
339 LV->addVirtualRegisterKilled(SrcReg, KillInst);
341 // This vreg no longer lives all of the way through opBlock.
342 unsigned opBlockNum = opBlock.getNumber();
343 if (opBlockNum < InRegVI.AliveBlocks.size())
344 InRegVI.AliveBlocks[opBlockNum] = false;
348 // Really delete the PHI instruction now!
353 /// analyzePHINodes - Gather information about the PHI nodes in here. In
354 /// particular, we want to map the number of uses of a virtual register which is
355 /// used in a PHI node. We map that to the BB the vreg is coming from. This is
356 /// used later to determine when the vreg is killed in the BB.
358 void PNE::analyzePHINodes(const MachineFunction& Fn) {
359 for (MachineFunction::const_iterator I = Fn.begin(), E = Fn.end();
361 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end();
362 BBI != BBE && BBI->getOpcode() == TargetInstrInfo::PHI; ++BBI)
363 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2)
364 ++VRegPHIUseCount[BBVRegPair(BBI->getOperand(i + 1).getMBB(),
365 BBI->getOperand(i).getReg())];