2010-03-02 02:38:24 +00:00
|
|
|
//===-- MachineCSE.cpp - Machine Common Subexpression Elimination Pass ----===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This pass performs global common subexpression elimination on machine
|
2010-03-02 19:02:27 +00:00
|
|
|
// instructions using a scoped hash table based value numbering scheme. It
|
2010-03-02 02:38:24 +00:00
|
|
|
// must be run while the machine function is still in SSA form.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#define DEBUG_TYPE "machine-cse"
|
|
|
|
#include "llvm/CodeGen/Passes.h"
|
|
|
|
#include "llvm/CodeGen/MachineDominators.h"
|
|
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
2010-03-03 02:48:20 +00:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
|
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
2010-03-02 02:38:24 +00:00
|
|
|
#include "llvm/ADT/ScopedHashTable.h"
|
|
|
|
#include "llvm/ADT/Statistic.h"
|
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
|
2010-03-03 21:20:05 +00:00
|
|
|
STATISTIC(NumCoalesces, "Number of copies coalesced");
|
|
|
|
STATISTIC(NumCSEs, "Number of common subexpression eliminated");
|
|
|
|
|
2010-03-02 02:38:24 +00:00
|
|
|
namespace {
|
|
|
|
class MachineCSE : public MachineFunctionPass {
|
2010-03-03 02:48:20 +00:00
|
|
|
const TargetInstrInfo *TII;
|
|
|
|
MachineRegisterInfo *MRI;
|
2010-03-02 02:38:24 +00:00
|
|
|
MachineDominatorTree *DT;
|
|
|
|
public:
|
|
|
|
static char ID; // Pass identification
|
2010-03-03 02:48:20 +00:00
|
|
|
MachineCSE() : MachineFunctionPass(&ID), CurrVN(0) {}
|
2010-03-02 02:38:24 +00:00
|
|
|
|
|
|
|
virtual bool runOnMachineFunction(MachineFunction &MF);
|
|
|
|
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.setPreservesCFG();
|
|
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
|
|
|
AU.addRequired<MachineDominatorTree>();
|
|
|
|
AU.addPreserved<MachineDominatorTree>();
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2010-03-03 21:20:05 +00:00
|
|
|
unsigned CurrVN;
|
2010-03-03 23:27:36 +00:00
|
|
|
ScopedHashTable<MachineInstr*, unsigned, MachineInstrExpressionTrait> VNT;
|
2010-03-03 21:20:05 +00:00
|
|
|
SmallVector<MachineInstr*, 64> Exps;
|
|
|
|
|
2010-03-03 02:48:20 +00:00
|
|
|
bool PerformTrivialCoalescing(MachineInstr *MI, MachineBasicBlock *MBB);
|
2010-03-02 02:38:24 +00:00
|
|
|
bool ProcessBlock(MachineDomTreeNode *Node);
|
|
|
|
};
|
|
|
|
} // end anonymous namespace
|
|
|
|
|
|
|
|
char MachineCSE::ID = 0;
|
|
|
|
static RegisterPass<MachineCSE>
|
|
|
|
X("machine-cse", "Machine Common Subexpression Elimination");
|
|
|
|
|
|
|
|
FunctionPass *llvm::createMachineCSEPass() { return new MachineCSE(); }
|
|
|
|
|
2010-03-03 02:48:20 +00:00
|
|
|
bool MachineCSE::PerformTrivialCoalescing(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *MBB) {
|
|
|
|
bool Changed = false;
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = MI->getOperand(i);
|
2010-03-03 21:20:05 +00:00
|
|
|
if (!MO.isReg() || !MO.isUse())
|
|
|
|
continue;
|
|
|
|
unsigned Reg = MO.getReg();
|
|
|
|
if (!Reg || TargetRegisterInfo::isPhysicalRegister(Reg))
|
|
|
|
continue;
|
|
|
|
if (!MRI->hasOneUse(Reg))
|
|
|
|
// Only coalesce single use copies. This ensure the copy will be
|
|
|
|
// deleted.
|
|
|
|
continue;
|
|
|
|
MachineInstr *DefMI = MRI->getVRegDef(Reg);
|
|
|
|
if (DefMI->getParent() != MBB)
|
|
|
|
continue;
|
|
|
|
unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
|
|
|
|
if (TII->isMoveInstr(*DefMI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) &&
|
|
|
|
TargetRegisterInfo::isVirtualRegister(SrcReg) &&
|
|
|
|
!SrcSubIdx && !DstSubIdx) {
|
|
|
|
MO.setReg(SrcReg);
|
|
|
|
DefMI->eraseFromParent();
|
|
|
|
++NumCoalesces;
|
|
|
|
Changed = true;
|
2010-03-03 02:48:20 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool hasLivePhysRegDefUse(MachineInstr *MI) {
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = MI->getOperand(i);
|
|
|
|
if (!MO.isReg())
|
|
|
|
continue;
|
|
|
|
unsigned Reg = MO.getReg();
|
|
|
|
if (!Reg)
|
|
|
|
continue;
|
2010-03-03 21:20:05 +00:00
|
|
|
// FIXME: This is obviously overly conservative. On x86 lots of instructions
|
|
|
|
// will def EFLAGS and they are not marked dead at this point.
|
2010-03-03 02:48:20 +00:00
|
|
|
if (TargetRegisterInfo::isPhysicalRegister(Reg) &&
|
|
|
|
!(MO.isDef() && MO.isDead()))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-03-02 02:38:24 +00:00
|
|
|
bool MachineCSE::ProcessBlock(MachineDomTreeNode *Node) {
|
2010-03-03 02:48:20 +00:00
|
|
|
bool Changed = false;
|
|
|
|
|
2010-03-03 23:27:36 +00:00
|
|
|
ScopedHashTableScope<MachineInstr*, unsigned,
|
|
|
|
MachineInstrExpressionTrait> VNTS(VNT);
|
2010-03-02 02:38:24 +00:00
|
|
|
MachineBasicBlock *MBB = Node->getBlock();
|
2010-03-03 21:20:05 +00:00
|
|
|
for (MachineBasicBlock::iterator I = MBB->begin(), E = MBB->end(); I != E; ) {
|
2010-03-03 02:48:20 +00:00
|
|
|
MachineInstr *MI = &*I;
|
2010-03-03 21:20:05 +00:00
|
|
|
++I;
|
2010-03-03 02:48:20 +00:00
|
|
|
bool SawStore = false;
|
|
|
|
if (!MI->isSafeToMove(TII, 0, SawStore))
|
|
|
|
continue;
|
|
|
|
// Ignore copies or instructions that read / write physical registers
|
|
|
|
// (except for dead defs of physical registers).
|
|
|
|
unsigned SrcReg, DstReg, SrcSubIdx, DstSubIdx;
|
2010-03-03 21:20:05 +00:00
|
|
|
if (TII->isMoveInstr(*MI, SrcReg, DstReg, SrcSubIdx, DstSubIdx) ||
|
|
|
|
MI->isExtractSubreg() || MI->isInsertSubreg() || MI->isSubregToReg())
|
|
|
|
continue;
|
2010-03-03 02:48:20 +00:00
|
|
|
if (hasLivePhysRegDefUse(MI))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
bool FoundCSE = VNT.count(MI);
|
|
|
|
if (!FoundCSE) {
|
|
|
|
// Look for trivial copy coalescing opportunities.
|
|
|
|
if (PerformTrivialCoalescing(MI, MBB))
|
|
|
|
FoundCSE = VNT.count(MI);
|
|
|
|
}
|
|
|
|
|
2010-03-03 21:20:05 +00:00
|
|
|
if (!FoundCSE) {
|
|
|
|
VNT.insert(MI, CurrVN++);
|
|
|
|
Exps.push_back(MI);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Found a common subexpression, eliminate it.
|
|
|
|
unsigned CSVN = VNT.lookup(MI);
|
|
|
|
MachineInstr *CSMI = Exps[CSVN];
|
|
|
|
DEBUG(dbgs() << "Examining: " << *MI);
|
|
|
|
DEBUG(dbgs() << "*** Found a common subexpression: " << *CSMI);
|
|
|
|
unsigned NumDefs = MI->getDesc().getNumDefs();
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); NumDefs && i != e; ++i) {
|
|
|
|
MachineOperand &MO = MI->getOperand(i);
|
|
|
|
if (!MO.isReg() || !MO.isDef())
|
|
|
|
continue;
|
|
|
|
unsigned OldReg = MO.getReg();
|
|
|
|
unsigned NewReg = CSMI->getOperand(i).getReg();
|
|
|
|
assert(OldReg != NewReg &&
|
|
|
|
TargetRegisterInfo::isVirtualRegister(OldReg) &&
|
|
|
|
TargetRegisterInfo::isVirtualRegister(NewReg) &&
|
|
|
|
"Do not CSE physical register defs!");
|
|
|
|
MRI->replaceRegWith(OldReg, NewReg);
|
|
|
|
--NumDefs;
|
|
|
|
}
|
|
|
|
MI->eraseFromParent();
|
|
|
|
++NumCSEs;
|
2010-03-02 02:38:24 +00:00
|
|
|
}
|
2010-03-03 02:48:20 +00:00
|
|
|
|
|
|
|
// Recursively call ProcessBlock with childred.
|
|
|
|
const std::vector<MachineDomTreeNode*> &Children = Node->getChildren();
|
|
|
|
for (unsigned i = 0, e = Children.size(); i != e; ++i)
|
|
|
|
Changed |= ProcessBlock(Children[i]);
|
|
|
|
|
|
|
|
return Changed;
|
2010-03-02 02:38:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool MachineCSE::runOnMachineFunction(MachineFunction &MF) {
|
2010-03-03 02:48:20 +00:00
|
|
|
TII = MF.getTarget().getInstrInfo();
|
|
|
|
MRI = &MF.getRegInfo();
|
2010-03-02 02:38:24 +00:00
|
|
|
DT = &getAnalysis<MachineDominatorTree>();
|
|
|
|
return ProcessBlock(DT->getRootNode());
|
|
|
|
}
|