RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity

Make use of "external" depth-first iterators to avoid revisiting nodes

Browse Source 
multiple times.  This reduces the time to construct post-dominance sets a LOT.
For example, optimizing perlbmk goes from taking 12.9894s to 1.4074s.

llvm-svn: 9091
This commit is contained in:
Chris Lattner 2003-10-13 16:36:06 +00:00
parent 4063621588
commit 97f3f7e819
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/Analysis/PostDominators.cpp
View File

@ -51,12 +51,12 @@ bool PostDominatorSet::runOnFunction(Function &F) {
do { do {
Changed = false; Changed = false;
std::set<const BasicBlock*> Visited; std::set<BasicBlock*> Visited;
DomSetType WorkingSet; DomSetType WorkingSet;
for (unsigned i = 0, e = Roots.size(); i != e; ++i) for (unsigned i = 0, e = Roots.size(); i != e; ++i)
for (idf_iterator<BasicBlock*> It = idf_begin(Roots[i]), for (idf_ext_iterator<BasicBlock*> It = idf_ext_begin(Roots[i], Visited),
E = idf_end(Roots[i]); It != E; ++It) { E = idf_ext_end(Roots[i], Visited); It != E; ++It) {
BasicBlock *BB = *It; BasicBlock *BB = *It;
succ_iterator SI = succ_begin(BB), SE = succ_end(BB); succ_iterator SI = succ_begin(BB), SE = succ_end(BB);
if (SI != SE) { // Is there SOME successor? if (SI != SE) { // Is there SOME successor?