2003-01-13 21:01:16 +01:00
|
|
|
//===-- PhiElimination.cpp - Eliminate PHI nodes by inserting copies ------===//
|
2003-10-20 21:43:21 +02:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2003-01-13 21:01:16 +01:00
|
|
|
//
|
|
|
|
// This pass eliminates machine instruction PHI nodes by inserting copy
|
|
|
|
// instructions. This destroys SSA information, but is the desired input for
|
|
|
|
// some register allocators.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2004-02-23 19:38:20 +01:00
|
|
|
#include "llvm/CodeGen/Passes.h"
|
2003-01-13 21:01:16 +01:00
|
|
|
#include "llvm/CodeGen/MachineFunctionPass.h"
|
|
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
|
|
|
#include "llvm/CodeGen/SSARegMap.h"
|
|
|
|
#include "llvm/CodeGen/LiveVariables.h"
|
2003-01-14 23:00:31 +01:00
|
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
2003-01-13 21:01:16 +01:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2004-09-02 00:55:40 +02:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2004-02-23 19:38:20 +01:00
|
|
|
using namespace llvm;
|
2003-11-11 23:41:34 +01:00
|
|
|
|
2003-01-13 21:01:16 +01:00
|
|
|
namespace {
|
|
|
|
struct PNE : public MachineFunctionPass {
|
|
|
|
bool runOnMachineFunction(MachineFunction &Fn) {
|
|
|
|
bool Changed = false;
|
|
|
|
|
|
|
|
// Eliminate PHI instructions by inserting copies into predecessor blocks.
|
|
|
|
//
|
|
|
|
for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
|
|
|
|
Changed |= EliminatePHINodes(Fn, *I);
|
|
|
|
|
|
|
|
//std::cerr << "AFTER PHI NODE ELIM:\n";
|
|
|
|
//Fn.dump();
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.addPreserved<LiveVariables>();
|
|
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
/// EliminatePHINodes - Eliminate phi nodes by inserting copy instructions
|
|
|
|
/// in predecessor basic blocks.
|
|
|
|
///
|
|
|
|
bool EliminatePHINodes(MachineFunction &MF, MachineBasicBlock &MBB);
|
|
|
|
};
|
|
|
|
|
|
|
|
RegisterPass<PNE> X("phi-node-elimination",
|
|
|
|
"Eliminate PHI nodes for register allocation");
|
|
|
|
}
|
|
|
|
|
2003-11-11 23:41:34 +01:00
|
|
|
|
2004-02-23 19:38:20 +01:00
|
|
|
const PassInfo *llvm::PHIEliminationID = X.getPassInfo();
|
2003-01-13 21:01:16 +01:00
|
|
|
|
|
|
|
/// EliminatePHINodes - Eliminate phi nodes by inserting copy instructions in
|
|
|
|
/// predecessor basic blocks.
|
|
|
|
///
|
|
|
|
bool PNE::EliminatePHINodes(MachineFunction &MF, MachineBasicBlock &MBB) {
|
2004-02-12 03:27:10 +01:00
|
|
|
if (MBB.empty() || MBB.front().getOpcode() != TargetInstrInfo::PHI)
|
2003-01-13 21:01:16 +01:00
|
|
|
return false; // Quick exit for normal case...
|
|
|
|
|
|
|
|
LiveVariables *LV = getAnalysisToUpdate<LiveVariables>();
|
2004-06-02 07:57:12 +02:00
|
|
|
const TargetInstrInfo &MII = *MF.getTarget().getInstrInfo();
|
2003-01-13 21:01:16 +01:00
|
|
|
const MRegisterInfo *RegInfo = MF.getTarget().getRegisterInfo();
|
|
|
|
|
2004-05-10 21:06:37 +02:00
|
|
|
// VRegPHIUseCount - Keep track of the number of times each virtual register
|
2004-05-12 23:47:57 +02:00
|
|
|
// is used by PHI nodes in successors of this block.
|
2004-05-10 21:17:36 +02:00
|
|
|
DenseMap<unsigned, VirtReg2IndexFunctor> VRegPHIUseCount;
|
|
|
|
VRegPHIUseCount.grow(MF.getSSARegMap()->getLastVirtReg());
|
2004-05-10 21:06:37 +02:00
|
|
|
|
2004-05-12 23:47:57 +02:00
|
|
|
unsigned BBIsSuccOfPreds = 0; // Number of times MBB is a succ of preds
|
|
|
|
for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin(),
|
|
|
|
E = MBB.pred_end(); PI != E; ++PI)
|
|
|
|
for (MachineBasicBlock::succ_iterator SI = (*PI)->succ_begin(),
|
|
|
|
E = (*PI)->succ_end(); SI != E; ++SI) {
|
|
|
|
BBIsSuccOfPreds += *SI == &MBB;
|
|
|
|
for (MachineBasicBlock::iterator BBI = (*SI)->begin(); BBI !=(*SI)->end() &&
|
|
|
|
BBI->getOpcode() == TargetInstrInfo::PHI; ++BBI)
|
|
|
|
for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2)
|
|
|
|
VRegPHIUseCount[BBI->getOperand(i).getReg()]++;
|
|
|
|
}
|
|
|
|
|
2004-05-10 20:47:18 +02:00
|
|
|
// Get an iterator to the first instruction after the last PHI node (this may
|
2004-05-12 23:47:57 +02:00
|
|
|
// also be the end of the basic block). While we are scanning the PHIs,
|
2004-05-10 21:06:37 +02:00
|
|
|
// populate the VRegPHIUseCount map.
|
2004-05-10 20:47:18 +02:00
|
|
|
MachineBasicBlock::iterator AfterPHIsIt = MBB.begin();
|
|
|
|
while (AfterPHIsIt != MBB.end() &&
|
2004-05-12 23:47:57 +02:00
|
|
|
AfterPHIsIt->getOpcode() == TargetInstrInfo::PHI)
|
2004-05-10 20:47:18 +02:00
|
|
|
++AfterPHIsIt; // Skip over all of the PHI nodes...
|
|
|
|
|
2004-02-12 03:27:10 +01:00
|
|
|
while (MBB.front().getOpcode() == TargetInstrInfo::PHI) {
|
2004-07-23 01:05:12 +02:00
|
|
|
// Unlink the PHI node from the basic block, but don't delete the PHI yet.
|
|
|
|
MachineInstr *MPhi = MBB.remove(MBB.begin());
|
2004-02-12 03:27:10 +01:00
|
|
|
|
2004-07-23 01:05:12 +02:00
|
|
|
assert(MRegisterInfo::isVirtualRegister(MPhi->getOperand(0).getReg()) &&
|
2003-01-13 21:01:16 +01:00
|
|
|
"PHI node doesn't write virt reg?");
|
|
|
|
|
2004-07-23 01:05:12 +02:00
|
|
|
unsigned DestReg = MPhi->getOperand(0).getReg();
|
2003-01-13 21:01:16 +01:00
|
|
|
|
|
|
|
// Create a new register for the incoming PHI arguments
|
|
|
|
const TargetRegisterClass *RC = MF.getSSARegMap()->getRegClass(DestReg);
|
|
|
|
unsigned IncomingReg = MF.getSSARegMap()->createVirtualRegister(RC);
|
|
|
|
|
2003-05-12 05:55:21 +02:00
|
|
|
// Insert a register to register copy in the top of the current block (but
|
2003-01-13 21:01:16 +01:00
|
|
|
// after any remaining phi nodes) which copies the new incoming register
|
|
|
|
// into the phi node destination.
|
|
|
|
//
|
|
|
|
RegInfo->copyRegToReg(MBB, AfterPHIsIt, DestReg, IncomingReg, RC);
|
2003-05-12 05:55:21 +02:00
|
|
|
|
|
|
|
// Update live variable information if there is any...
|
|
|
|
if (LV) {
|
2004-05-10 20:47:18 +02:00
|
|
|
MachineInstr *PHICopy = prior(AfterPHIsIt);
|
2003-05-12 05:55:21 +02:00
|
|
|
|
|
|
|
// Add information to LiveVariables to know that the incoming value is
|
2003-05-12 19:37:30 +02:00
|
|
|
// killed. Note that because the value is defined in several places (once
|
|
|
|
// each for each incoming block), the "def" block and instruction fields
|
|
|
|
// for the VarInfo is not filled in.
|
2003-05-12 05:55:21 +02:00
|
|
|
//
|
2004-07-19 08:55:21 +02:00
|
|
|
LV->addVirtualRegisterKilled(IncomingReg, PHICopy);
|
2003-01-13 21:01:16 +01:00
|
|
|
|
2003-05-12 05:55:21 +02:00
|
|
|
// Since we are going to be deleting the PHI node, if it is the last use
|
|
|
|
// of any registers, or if the value itself is dead, we need to move this
|
2004-07-23 01:05:12 +02:00
|
|
|
// information over to the new copy we just inserted.
|
2003-05-12 05:55:21 +02:00
|
|
|
//
|
|
|
|
std::pair<LiveVariables::killed_iterator, LiveVariables::killed_iterator>
|
2004-07-23 01:05:12 +02:00
|
|
|
RKs = LV->killed_range(MPhi);
|
2003-05-12 16:28:28 +02:00
|
|
|
std::vector<std::pair<MachineInstr*, unsigned> > Range;
|
2004-07-23 07:27:43 +02:00
|
|
|
if (RKs.first != RKs.second) // Delete the range.
|
2003-05-12 05:55:21 +02:00
|
|
|
LV->removeVirtualRegistersKilled(RKs.first, RKs.second);
|
2003-05-12 16:28:28 +02:00
|
|
|
|
2004-07-23 01:05:12 +02:00
|
|
|
RKs = LV->dead_range(MPhi);
|
2003-05-12 05:55:21 +02:00
|
|
|
if (RKs.first != RKs.second) {
|
2003-05-12 16:28:28 +02:00
|
|
|
// Works as above...
|
|
|
|
Range.assign(RKs.first, RKs.second);
|
2003-05-12 05:55:21 +02:00
|
|
|
LV->removeVirtualRegistersDead(RKs.first, RKs.second);
|
2003-05-12 16:28:28 +02:00
|
|
|
for (unsigned i = 0, e = Range.size(); i != e; ++i)
|
2004-07-19 08:55:21 +02:00
|
|
|
LV->addVirtualRegisterDead(Range[i].second, PHICopy);
|
2003-05-12 05:55:21 +02:00
|
|
|
}
|
|
|
|
}
|
2003-01-13 21:01:16 +01:00
|
|
|
|
2004-05-10 21:06:37 +02:00
|
|
|
// Adjust the VRegPHIUseCount map to account for the removal of this PHI
|
|
|
|
// node.
|
2004-07-23 01:05:12 +02:00
|
|
|
for (unsigned i = 1; i != MPhi->getNumOperands(); i += 2)
|
|
|
|
VRegPHIUseCount[MPhi->getOperand(i).getReg()] -= BBIsSuccOfPreds;
|
2004-05-10 21:06:37 +02:00
|
|
|
|
2003-05-12 05:55:21 +02:00
|
|
|
// Now loop over all of the incoming arguments, changing them to copy into
|
2003-01-13 21:01:16 +01:00
|
|
|
// the IncomingReg register in the corresponding predecessor basic block.
|
|
|
|
//
|
2004-07-23 01:05:12 +02:00
|
|
|
for (int i = MPhi->getNumOperands() - 1; i >= 2; i-=2) {
|
|
|
|
MachineOperand &opVal = MPhi->getOperand(i-1);
|
2003-01-13 21:01:16 +01:00
|
|
|
|
|
|
|
// Get the MachineBasicBlock equivalent of the BasicBlock that is the
|
2003-05-12 05:55:21 +02:00
|
|
|
// source path the PHI.
|
2004-07-23 01:05:12 +02:00
|
|
|
MachineBasicBlock &opBlock = *MPhi->getOperand(i).getMachineBasicBlock();
|
2003-01-13 21:01:16 +01:00
|
|
|
|
2004-02-23 19:14:48 +01:00
|
|
|
MachineBasicBlock::iterator I = opBlock.getFirstTerminator();
|
2003-05-12 06:08:54 +02:00
|
|
|
|
2003-01-13 21:01:16 +01:00
|
|
|
// Check to make sure we haven't already emitted the copy for this block.
|
|
|
|
// This can happen because PHI nodes may have multiple entries for the
|
|
|
|
// same basic block. It doesn't matter which entry we use though, because
|
|
|
|
// all incoming values are guaranteed to be the same for a particular bb.
|
|
|
|
//
|
2003-05-12 06:08:54 +02:00
|
|
|
// If we emitted a copy for this basic block already, it will be right
|
|
|
|
// where we want to insert one now. Just check for a definition of the
|
|
|
|
// register we are interested in!
|
2003-01-13 21:01:16 +01:00
|
|
|
//
|
|
|
|
bool HaveNotEmitted = true;
|
2003-05-12 06:08:54 +02:00
|
|
|
|
|
|
|
if (I != opBlock.begin()) {
|
2004-02-14 02:18:34 +01:00
|
|
|
MachineBasicBlock::iterator PrevInst = prior(I);
|
2003-05-12 06:08:54 +02:00
|
|
|
for (unsigned i = 0, e = PrevInst->getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = PrevInst->getOperand(i);
|
2004-02-10 22:12:22 +01:00
|
|
|
if (MO.isRegister() && MO.getReg() == IncomingReg)
|
2003-12-14 14:24:17 +01:00
|
|
|
if (MO.isDef()) {
|
2003-05-12 06:08:54 +02:00
|
|
|
HaveNotEmitted = false;
|
|
|
|
break;
|
|
|
|
}
|
2003-01-13 21:01:16 +01:00
|
|
|
}
|
2003-05-12 06:08:54 +02:00
|
|
|
}
|
2003-01-13 21:01:16 +01:00
|
|
|
|
2003-05-12 16:28:28 +02:00
|
|
|
if (HaveNotEmitted) { // If the copy has not already been emitted, do it.
|
2004-02-10 22:12:22 +01:00
|
|
|
assert(MRegisterInfo::isVirtualRegister(opVal.getReg()) &&
|
2003-05-12 06:08:54 +02:00
|
|
|
"Machine PHI Operands must all be virtual registers!");
|
2003-05-12 16:28:28 +02:00
|
|
|
unsigned SrcReg = opVal.getReg();
|
|
|
|
RegInfo->copyRegToReg(opBlock, I, IncomingReg, SrcReg, RC);
|
|
|
|
|
|
|
|
// Now update live variable information if we have it.
|
|
|
|
if (LV) {
|
|
|
|
// We want to be able to insert a kill of the register if this PHI
|
|
|
|
// (aka, the copy we just inserted) is the last use of the source
|
|
|
|
// value. Live variable analysis conservatively handles this by
|
|
|
|
// saying that the value is live until the end of the block the PHI
|
|
|
|
// entry lives in. If the value really is dead at the PHI copy, there
|
|
|
|
// will be no successor blocks which have the value live-in.
|
|
|
|
//
|
|
|
|
// Check to see if the copy is the last use, and if so, update the
|
|
|
|
// live variables information so that it knows the copy source
|
|
|
|
// instruction kills the incoming value.
|
|
|
|
//
|
|
|
|
LiveVariables::VarInfo &InRegVI = LV->getVarInfo(SrcReg);
|
|
|
|
|
2003-06-05 19:15:04 +02:00
|
|
|
// Loop over all of the successors of the basic block, checking to see
|
|
|
|
// if the value is either live in the block, or if it is killed in the
|
|
|
|
// block. Also check to see if this register is in use by another PHI
|
|
|
|
// node which has not yet been eliminated. If so, it will be killed
|
|
|
|
// at an appropriate point later.
|
2003-05-12 16:28:28 +02:00
|
|
|
//
|
|
|
|
bool ValueIsLive = false;
|
2004-05-01 23:24:39 +02:00
|
|
|
for (MachineBasicBlock::succ_iterator SI = opBlock.succ_begin(),
|
|
|
|
E = opBlock.succ_end(); SI != E && !ValueIsLive; ++SI) {
|
2004-05-12 23:47:57 +02:00
|
|
|
MachineBasicBlock *SuccMBB = *SI;
|
2003-05-12 16:28:28 +02:00
|
|
|
|
|
|
|
// Is it alive in this successor?
|
2004-07-01 06:29:47 +02:00
|
|
|
unsigned SuccIdx = SuccMBB->getNumber();
|
2003-05-12 16:28:28 +02:00
|
|
|
if (SuccIdx < InRegVI.AliveBlocks.size() &&
|
|
|
|
InRegVI.AliveBlocks[SuccIdx]) {
|
|
|
|
ValueIsLive = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Is it killed in this successor?
|
|
|
|
for (unsigned i = 0, e = InRegVI.Kills.size(); i != e; ++i)
|
2004-07-19 09:04:55 +02:00
|
|
|
if (InRegVI.Kills[i]->getParent() == SuccMBB) {
|
2003-05-12 16:28:28 +02:00
|
|
|
ValueIsLive = true;
|
|
|
|
break;
|
|
|
|
}
|
2003-06-05 19:15:04 +02:00
|
|
|
|
|
|
|
// Is it used by any PHI instructions in this block?
|
2004-05-10 21:17:36 +02:00
|
|
|
if (!ValueIsLive)
|
|
|
|
ValueIsLive = VRegPHIUseCount[SrcReg] != 0;
|
2003-05-12 16:28:28 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Okay, if we now know that the value is not live out of the block,
|
|
|
|
// we can add a kill marker to the copy we inserted saying that it
|
|
|
|
// kills the incoming value!
|
|
|
|
//
|
2004-02-12 03:27:10 +01:00
|
|
|
if (!ValueIsLive) {
|
2004-02-14 02:18:34 +01:00
|
|
|
MachineBasicBlock::iterator Prev = prior(I);
|
2004-07-19 08:55:21 +02:00
|
|
|
LV->addVirtualRegisterKilled(SrcReg, Prev);
|
2004-07-23 07:27:43 +02:00
|
|
|
|
|
|
|
// This vreg no longer lives all of the way through opBlock.
|
|
|
|
unsigned opBlockNum = opBlock.getNumber();
|
|
|
|
if (opBlockNum < InRegVI.AliveBlocks.size())
|
|
|
|
InRegVI.AliveBlocks[opBlockNum] = false;
|
2004-02-12 03:27:10 +01:00
|
|
|
}
|
2003-05-12 16:28:28 +02:00
|
|
|
}
|
2003-01-13 21:01:16 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-07-23 01:05:12 +02:00
|
|
|
// Really delete the PHI instruction now!
|
|
|
|
delete MPhi;
|
2003-01-13 21:01:16 +01:00
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|