Merge safe parts from last night's buggy commit. These do not break

any test cases :-)


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@11032 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Alkis Evlogimenos
2004-01-31 19:59:32 +00:00
parent bd490d919b
commit 08cec00588
4 changed files with 92 additions and 107 deletions

View File

@@ -9,12 +9,12 @@
// //
// This file implements the LiveInterval analysis pass. Given some // This file implements the LiveInterval analysis pass. Given some
// numbering of each the machine instructions (in this implemention // numbering of each the machine instructions (in this implemention
// depth-first order) an interval [i, j] is said to be a live interval // depth-first order) an interval [i, j) is said to be a live interval
// for register v if there is no instruction with number j' > j such // for register v if there is no instruction with number j' > j such
// that v is live at j' abd there is no instruction with number i' < i // that v is live at j' abd there is no instruction with number i' < i
// such that v is live at i'. In this implementation intervals can // such that v is live at i'. In this implementation intervals can
// have holes, i.e. an interval might look like [1,20], [50,65], // have holes, i.e. an interval might look like [1,20), [50,65),
// [1000,1001] // [1000,1001)
// //
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
@@ -22,11 +22,7 @@
#define LLVM_CODEGEN_LIVEINTERVALS_H #define LLVM_CODEGEN_LIVEINTERVALS_H
#include "llvm/CodeGen/MachineFunctionPass.h" #include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineBasicBlock.h"
#include <iostream>
#include <list> #include <list>
#include <map>
#include <vector>
namespace llvm { namespace llvm {
@@ -113,19 +109,13 @@ namespace llvm {
public: public:
virtual void getAnalysisUsage(AnalysisUsage &AU) const; virtual void getAnalysisUsage(AnalysisUsage &AU) const;
virtual void releaseMemory();
/// runOnMachineFunction - pass entry point
virtual bool runOnMachineFunction(MachineFunction&);
Intervals& getIntervals() { return intervals_; } Intervals& getIntervals() { return intervals_; }
MachineBasicBlockPtrs getOrderedMachineBasicBlockPtrs() const {
MachineBasicBlockPtrs result;
for (MbbIndex2MbbMap::const_iterator
it = mbbi2mbbMap_.begin(), itEnd = mbbi2mbbMap_.end();
it != itEnd; ++it) {
result.push_back(it->second);
}
return result;
}
const Reg2RegMap& getJoinedRegMap() const { const Reg2RegMap& getJoinedRegMap() const {
return r2rMap_; return r2rMap_;
} }
@@ -134,9 +124,6 @@ namespace llvm {
unsigned rep(unsigned reg); unsigned rep(unsigned reg);
private: private:
/// runOnMachineFunction - pass entry point
bool runOnMachineFunction(MachineFunction&);
/// computeIntervals - compute live intervals /// computeIntervals - compute live intervals
void computeIntervals(); void computeIntervals();

View File

@@ -9,12 +9,12 @@
// //
// This file implements the LiveInterval analysis pass. Given some // This file implements the LiveInterval analysis pass. Given some
// numbering of each the machine instructions (in this implemention // numbering of each the machine instructions (in this implemention
// depth-first order) an interval [i, j] is said to be a live interval // depth-first order) an interval [i, j) is said to be a live interval
// for register v if there is no instruction with number j' > j such // for register v if there is no instruction with number j' > j such
// that v is live at j' abd there is no instruction with number i' < i // that v is live at j' abd there is no instruction with number i' < i
// such that v is live at i'. In this implementation intervals can // such that v is live at i'. In this implementation intervals can
// have holes, i.e. an interval might look like [1,20], [50,65], // have holes, i.e. an interval might look like [1,20), [50,65),
// [1000,1001] // [1000,1001)
// //
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
@@ -22,11 +22,7 @@
#define LLVM_CODEGEN_LIVEINTERVALS_H #define LLVM_CODEGEN_LIVEINTERVALS_H
#include "llvm/CodeGen/MachineFunctionPass.h" #include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineBasicBlock.h"
#include <iostream>
#include <list> #include <list>
#include <map>
#include <vector>
namespace llvm { namespace llvm {
@@ -113,19 +109,13 @@ namespace llvm {
public: public:
virtual void getAnalysisUsage(AnalysisUsage &AU) const; virtual void getAnalysisUsage(AnalysisUsage &AU) const;
virtual void releaseMemory();
/// runOnMachineFunction - pass entry point
virtual bool runOnMachineFunction(MachineFunction&);
Intervals& getIntervals() { return intervals_; } Intervals& getIntervals() { return intervals_; }
MachineBasicBlockPtrs getOrderedMachineBasicBlockPtrs() const {
MachineBasicBlockPtrs result;
for (MbbIndex2MbbMap::const_iterator
it = mbbi2mbbMap_.begin(), itEnd = mbbi2mbbMap_.end();
it != itEnd; ++it) {
result.push_back(it->second);
}
return result;
}
const Reg2RegMap& getJoinedRegMap() const { const Reg2RegMap& getJoinedRegMap() const {
return r2rMap_; return r2rMap_;
} }
@@ -134,9 +124,6 @@ namespace llvm {
unsigned rep(unsigned reg); unsigned rep(unsigned reg);
private: private:
/// runOnMachineFunction - pass entry point
bool runOnMachineFunction(MachineFunction&);
/// computeIntervals - compute live intervals /// computeIntervals - compute live intervals
void computeIntervals(); void computeIntervals();

View File

@@ -17,22 +17,18 @@
#define DEBUG_TYPE "liveintervals" #define DEBUG_TYPE "liveintervals"
#include "llvm/CodeGen/LiveIntervals.h" #include "llvm/CodeGen/LiveIntervals.h"
#include "llvm/Function.h"
#include "llvm/Analysis/LoopInfo.h" #include "llvm/Analysis/LoopInfo.h"
#include "llvm/CodeGen/LiveVariables.h" #include "llvm/CodeGen/LiveVariables.h"
#include "llvm/CodeGen/MachineFrameInfo.h" #include "llvm/CodeGen/MachineFrameInfo.h"
#include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineInstr.h" #include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/Passes.h" #include "llvm/CodeGen/Passes.h"
#include "llvm/CodeGen/SSARegMap.h" #include "llvm/CodeGen/SSARegMap.h"
#include "llvm/Target/MRegisterInfo.h" #include "llvm/Target/MRegisterInfo.h"
#include "llvm/Target/TargetInstrInfo.h" #include "llvm/Target/TargetInstrInfo.h"
#include "llvm/Target/TargetMachine.h" #include "llvm/Target/TargetMachine.h"
#include "llvm/Target/TargetRegInfo.h"
#include "llvm/Support/CFG.h" #include "llvm/Support/CFG.h"
#include "Support/CommandLine.h" #include "Support/CommandLine.h"
#include "Support/Debug.h" #include "Support/Debug.h"
#include "Support/DepthFirstIterator.h"
#include "Support/Statistic.h" #include "Support/Statistic.h"
#include <cmath> #include <cmath>
#include <iostream> #include <iostream>
@@ -45,6 +41,7 @@ namespace {
"Live Interval Analysis"); "Live Interval Analysis");
Statistic<> numIntervals("liveintervals", "Number of intervals"); Statistic<> numIntervals("liveintervals", "Number of intervals");
Statistic<> numJoined ("liveintervals", "Number of intervals joined");
cl::opt<bool> cl::opt<bool>
join("join-liveintervals", join("join-liveintervals",
@@ -63,6 +60,17 @@ void LiveIntervals::getAnalysisUsage(AnalysisUsage &AU) const
MachineFunctionPass::getAnalysisUsage(AU); MachineFunctionPass::getAnalysisUsage(AU);
} }
void LiveIntervals::releaseMemory()
{
mbbi2mbbMap_.clear();
mi2iMap_.clear();
r2iMap_.clear();
r2iMap_.clear();
r2rMap_.clear();
intervals_.clear();
}
/// runOnMachineFunction - Register allocate the whole function /// runOnMachineFunction - Register allocate the whole function
/// ///
bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) { bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) {
@@ -71,19 +79,13 @@ bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) {
tm_ = &fn.getTarget(); tm_ = &fn.getTarget();
mri_ = tm_->getRegisterInfo(); mri_ = tm_->getRegisterInfo();
lv_ = &getAnalysis<LiveVariables>(); lv_ = &getAnalysis<LiveVariables>();
mbbi2mbbMap_.clear();
mi2iMap_.clear();
r2iMap_.clear();
r2iMap_.clear();
r2rMap_.clear();
intervals_.clear();
// number MachineInstrs // number MachineInstrs
unsigned miIndex = 0; unsigned miIndex = 0;
for (MachineFunction::iterator mbb = mf_->begin(), mbbEnd = mf_->end(); for (MachineFunction::iterator mbb = mf_->begin(), mbbEnd = mf_->end();
mbb != mbbEnd; ++mbb) { mbb != mbbEnd; ++mbb) {
const std::pair<MachineBasicBlock*, unsigned>& entry = const std::pair<MachineBasicBlock*, unsigned>& entry =
lv_->getMachineBasicBlockInfo(&*mbb); lv_->getMachineBasicBlockInfo(mbb);
bool inserted = mbbi2mbbMap_.insert(std::make_pair(entry.second, bool inserted = mbbi2mbbMap_.insert(std::make_pair(entry.second,
entry.first)).second; entry.first)).second;
assert(inserted && "multiple index -> MachineBasicBlock"); assert(inserted && "multiple index -> MachineBasicBlock");
@@ -107,20 +109,22 @@ bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) {
const MachineBasicBlock* mbb = mbbi; const MachineBasicBlock* mbb = mbbi;
unsigned loopDepth = loopInfo.getLoopDepth(mbb->getBasicBlock()); unsigned loopDepth = loopInfo.getLoopDepth(mbb->getBasicBlock());
for (MachineBasicBlock::const_iterator mii = mbb->begin(), if (loopDepth) {
mie = mbb->end(); mii != mie; ++mii) { for (MachineBasicBlock::const_iterator mii = mbb->begin(),
MachineInstr* mi = *mii; mie = mbb->end(); mii != mie; ++mii) {
MachineInstr* mi = *mii;
for (int i = mi->getNumOperands() - 1; i >= 0; --i) { for (int i = mi->getNumOperands() - 1; i >= 0; --i) {
MachineOperand& mop = mi->getOperand(i); MachineOperand& mop = mi->getOperand(i);
if (!mop.isVirtualRegister()) if (!mop.isVirtualRegister())
continue; continue;
unsigned reg = mop.getAllocatedRegNum(); unsigned reg = mop.getAllocatedRegNum();
Reg2IntervalMap::iterator r2iit = r2iMap_.find(reg); Reg2IntervalMap::iterator r2iit = r2iMap_.find(reg);
assert(r2iit != r2iMap_.end()); assert(r2iit != r2iMap_.end());
r2iit->second->weight += pow(10.0F, loopDepth); r2iit->second->weight += pow(10.0F, loopDepth);
}
} }
} }
} }
@@ -152,14 +156,12 @@ void LiveIntervals::handleVirtualRegisterDef(MachineBasicBlock* mbb,
LiveVariables::VarInfo& vi = lv_->getVarInfo(reg); LiveVariables::VarInfo& vi = lv_->getVarInfo(reg);
Interval* interval = 0; Interval* interval = 0;
Reg2IntervalMap::iterator r2iit = r2iMap_.find(reg); Reg2IntervalMap::iterator r2iit = r2iMap_.lower_bound(reg);
if (r2iit == r2iMap_.end()) { if (r2iit == r2iMap_.end() || r2iit->first != reg) {
// add new interval // add new interval
intervals_.push_back(Interval(reg)); intervals_.push_back(Interval(reg));
// update interval index for this register // update interval index for this register
bool inserted = r2iMap_.insert(r2iit, std::make_pair(reg, --intervals_.end()));
r2iMap_.insert(std::make_pair(reg, --intervals_.end())).second;
assert(inserted);
interval = &intervals_.back(); interval = &intervals_.back();
} }
else { else {
@@ -188,6 +190,10 @@ void LiveIntervals::handleVirtualRegisterDef(MachineBasicBlock* mbb,
instrIndex : instrIndex :
getInstructionIndex(killerBlock->front())); getInstructionIndex(killerBlock->front()));
unsigned end = getInstructionIndex(killerInstr) + 1; unsigned end = getInstructionIndex(killerInstr) + 1;
// we do not want to add invalid ranges. these can happen when
// a variable has its latest use and is redefined later on in
// the same basic block (common with variables introduced by
// PHI elimination)
if (start < end) { if (start < end) {
killedInDefiningBasicBlock |= mbb == killerBlock; killedInDefiningBasicBlock |= mbb == killerBlock;
interval->addRange(start, end); interval->addRange(start, end);
@@ -250,19 +256,15 @@ void LiveIntervals::handlePhysicalRegisterDef(MachineBasicBlock* mbb,
exit: exit:
assert(start < end && "did not find end of interval?"); assert(start < end && "did not find end of interval?");
Reg2IntervalMap::iterator r2iit = r2iMap_.find(reg); Reg2IntervalMap::iterator r2iit = r2iMap_.lower_bound(reg);
if (r2iit != r2iMap_.end()) { if (r2iit != r2iMap_.end() && r2iit->first == reg) {
Interval& interval = *r2iit->second; r2iit->second->addRange(start, end);
interval.addRange(start, end);
} }
else { else {
intervals_.push_back(Interval(reg)); intervals_.push_back(Interval(reg));
Interval& interval = intervals_.back();
// update interval index for this register // update interval index for this register
bool inserted = r2iMap_.insert(r2iit, std::make_pair(reg, --intervals_.end()));
r2iMap_.insert(std::make_pair(reg, --intervals_.end())).second; intervals_.back().addRange(start, end);
assert(inserted);
interval.addRange(start, end);
} }
} }
@@ -291,7 +293,7 @@ unsigned LiveIntervals::getInstructionIndex(MachineInstr* instr) const
/// computeIntervals - computes the live intervals for virtual /// computeIntervals - computes the live intervals for virtual
/// registers. for some ordering of the machine instructions [1,N] a /// registers. for some ordering of the machine instructions [1,N] a
/// live interval is an interval [i, j] where 1 <= i <= j <= N for /// live interval is an interval [i, j) where 1 <= i <= j < N for
/// which a variable is live /// which a variable is live
void LiveIntervals::computeIntervals() void LiveIntervals::computeIntervals()
{ {
@@ -319,12 +321,8 @@ void LiveIntervals::computeIntervals()
// handle explicit defs // handle explicit defs
for (int i = instr->getNumOperands() - 1; i >= 0; --i) { for (int i = instr->getNumOperands() - 1; i >= 0; --i) {
MachineOperand& mop = instr->getOperand(i); MachineOperand& mop = instr->getOperand(i);
// handle register defs - build intervals
if (!mop.isRegister()) if (mop.isRegister() && mop.isDef())
continue;
// handle defs - build intervals
if (mop.isDef())
handleRegisterDef(mbb, mi, mop.getAllocatedRegNum()); handleRegisterDef(mbb, mi, mop.getAllocatedRegNum());
} }
} }
@@ -424,6 +422,7 @@ void LiveIntervals::joinIntervals()
intervals_.erase(dstInt); intervals_.erase(dstInt);
} }
} }
++numJoined;
} }
} }
} }
@@ -434,7 +433,7 @@ void LiveIntervals::joinIntervals()
DEBUG(for (Reg2RegMap::const_iterator i = r2rMap_.begin(), DEBUG(for (Reg2RegMap::const_iterator i = r2rMap_.begin(),
e = r2rMap_.end(); i != e; ++i) e = r2rMap_.end(); i != e; ++i)
std::cerr << i->first << " -> " << i->second << '\n';); std::cerr << i->first << " -> " << i->second << '\n';);
} }
bool LiveIntervals::overlapsAliases(const Interval& lhs, bool LiveIntervals::overlapsAliases(const Interval& lhs,
@@ -461,6 +460,15 @@ LiveIntervals::Interval::Interval(unsigned r)
} }
// This example is provided becaues liveAt() is non-obvious:
//
// this = [1,2), liveAt(1) will return false. The idea is that the
// variable is defined in 1 and not live after definition. So it was
// dead to begin with (defined but never used).
//
// this = [1,3), liveAt(2) will return false. The variable is used at
// 2 but 2 is the last use so the variable's allocated register is
// available for reuse.
bool LiveIntervals::Interval::liveAt(unsigned index) const bool LiveIntervals::Interval::liveAt(unsigned index) const
{ {
Range dummy(index, index+1); Range dummy(index, index+1);
@@ -474,6 +482,20 @@ bool LiveIntervals::Interval::liveAt(unsigned index) const
return index >= r->first && index < (r->second - 1); return index >= r->first && index < (r->second - 1);
} }
// This example is provided because overlaps() is non-obvious:
//
// 0: A = ...
// 1: B = ...
// 2: C = A + B ;; last use of A
//
// The live intervals should look like:
//
// A = [0, 3)
// B = [1, x)
// C = [2, y)
//
// A->overlaps(C) should return false since we want to be able to join
// A and C.
bool LiveIntervals::Interval::overlaps(const Interval& other) const bool LiveIntervals::Interval::overlaps(const Interval& other) const
{ {
Ranges::const_iterator i = ranges.begin(); Ranges::const_iterator i = ranges.begin();
@@ -514,6 +536,7 @@ bool LiveIntervals::Interval::overlaps(const Interval& other) const
void LiveIntervals::Interval::addRange(unsigned start, unsigned end) void LiveIntervals::Interval::addRange(unsigned start, unsigned end)
{ {
assert(start < end && "Invalid range to add!");
DEBUG(std::cerr << "\t\t\tadding range: [" << start <<','<< end << ") -> "); DEBUG(std::cerr << "\t\t\tadding range: [" << start <<','<< end << ") -> ");
//assert(start < end && "invalid range?"); //assert(start < end && "invalid range?");
Range range = std::make_pair(start, end); Range range = std::make_pair(start, end);
@@ -558,12 +581,13 @@ LiveIntervals::Interval::mergeRangesForward(Ranges::iterator it)
LiveIntervals::Interval::Ranges::iterator LiveIntervals::Interval::Ranges::iterator
LiveIntervals::Interval::mergeRangesBackward(Ranges::iterator it) LiveIntervals::Interval::mergeRangesBackward(Ranges::iterator it)
{ {
for (Ranges::iterator prev = it - 1; while (it != ranges.begin()) {
it != ranges.begin() && it->first <= prev->second; ) { Ranges::iterator prev = it - 1;
if (it->first > prev->second) break;
it->first = std::min(it->first, prev->first); it->first = std::min(it->first, prev->first);
it->second = std::max(it->second, prev->second); it->second = std::max(it->second, prev->second);
it = ranges.erase(prev); it = ranges.erase(prev);
prev = it - 1;
} }
return it; return it;

View File

@@ -9,12 +9,12 @@
// //
// This file implements the LiveInterval analysis pass. Given some // This file implements the LiveInterval analysis pass. Given some
// numbering of each the machine instructions (in this implemention // numbering of each the machine instructions (in this implemention
// depth-first order) an interval [i, j] is said to be a live interval // depth-first order) an interval [i, j) is said to be a live interval
// for register v if there is no instruction with number j' > j such // for register v if there is no instruction with number j' > j such
// that v is live at j' abd there is no instruction with number i' < i // that v is live at j' abd there is no instruction with number i' < i
// such that v is live at i'. In this implementation intervals can // such that v is live at i'. In this implementation intervals can
// have holes, i.e. an interval might look like [1,20], [50,65], // have holes, i.e. an interval might look like [1,20), [50,65),
// [1000,1001] // [1000,1001)
// //
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
@@ -22,11 +22,7 @@
#define LLVM_CODEGEN_LIVEINTERVALS_H #define LLVM_CODEGEN_LIVEINTERVALS_H
#include "llvm/CodeGen/MachineFunctionPass.h" #include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineBasicBlock.h"
#include <iostream>
#include <list> #include <list>
#include <map>
#include <vector>
namespace llvm { namespace llvm {
@@ -113,19 +109,13 @@ namespace llvm {
public: public:
virtual void getAnalysisUsage(AnalysisUsage &AU) const; virtual void getAnalysisUsage(AnalysisUsage &AU) const;
virtual void releaseMemory();
/// runOnMachineFunction - pass entry point
virtual bool runOnMachineFunction(MachineFunction&);
Intervals& getIntervals() { return intervals_; } Intervals& getIntervals() { return intervals_; }
MachineBasicBlockPtrs getOrderedMachineBasicBlockPtrs() const {
MachineBasicBlockPtrs result;
for (MbbIndex2MbbMap::const_iterator
it = mbbi2mbbMap_.begin(), itEnd = mbbi2mbbMap_.end();
it != itEnd; ++it) {
result.push_back(it->second);
}
return result;
}
const Reg2RegMap& getJoinedRegMap() const { const Reg2RegMap& getJoinedRegMap() const {
return r2rMap_; return r2rMap_;
} }
@@ -134,9 +124,6 @@ namespace llvm {
unsigned rep(unsigned reg); unsigned rep(unsigned reg);
private: private:
/// runOnMachineFunction - pass entry point
bool runOnMachineFunction(MachineFunction&);
/// computeIntervals - compute live intervals /// computeIntervals - compute live intervals
void computeIntervals(); void computeIntervals();