RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-20 19:42:54 +02:00
Code Issues Projects Releases Wiki Activity

Change std::list into a std::vector for IntervalSets. This reduces

Browse Source 
compile time for 176.gcc from 5.6 secs to 4.7 secs.

llvm-svn: 15072
This commit is contained in:
Alkis Evlogimenos 2004-07-21 09:46:55 +00:00
parent 441f3a155d
commit c767432a26
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lib/CodeGen/RegAllocIterativeScan.cpp
View File

@ -53,7 +53,7 @@ namespace {
const TargetMachine* tm_;
const MRegisterInfo* mri_;
LiveIntervals* li_;
typedef std::list<LiveInterval*> IntervalPtrs;
typedef std::vector<LiveInterval*> IntervalPtrs;
IntervalPtrs unhandled_, fixed_, active_, inactive_, handled_, spilled_;
std::auto_ptr<PhysRegTracker> prt_;
@ -196,7 +196,8 @@ bool RA::linearScan()
<< mf_->getFunction()->getName() << '\n');
unhandled_.sort(less_ptr<LiveInterval>());
std::sort(unhandled_.begin(), unhandled_.end(),
greater_ptr<LiveInterval>());
DEBUG(printIntervals("unhandled", unhandled_.begin(), unhandled_.end()));
DEBUG(printIntervals("fixed", fixed_.begin(), fixed_.end()));
DEBUG(printIntervals("active", active_.begin(), active_.end()));
@ -204,8 +205,8 @@ bool RA::linearScan()
while (!unhandled_.empty()) {
// pick the interval with the earliest start point
IntervalPtrs::value_type cur = unhandled_.front();
unhandled_.pop_front();
IntervalPtrs::value_type cur = unhandled_.back();
unhandled_.pop_back();
++numIterations;
DEBUG(std::cerr << "\n*** CURRENT ***: " << *cur << '\n');