diff options
author | Benjamin Kramer <benny.kra@googlemail.com> | 2011-02-03 22:51:41 +0000 |
---|---|---|
committer | Benjamin Kramer <benny.kra@googlemail.com> | 2011-02-03 22:51:41 +0000 |
commit | 62aa46b8527217a628ca6df295ea35349b8bbdde (patch) | |
tree | 3330af72368bb86aa1a305ceb7170abbc316b766 /llvm/lib/Transforms | |
parent | edeaf16f2c2f02d6e43312d48d26d354d87913f3 (diff) | |
download | bcm5719-llvm-62aa46b8527217a628ca6df295ea35349b8bbdde.tar.gz bcm5719-llvm-62aa46b8527217a628ca6df295ea35349b8bbdde.zip |
SimplifyCFG: Also transform switches that represent a range comparison but are not sorted into sub+icmp.
This transforms another 1000 switches in gcc.c.
llvm-svn: 124826
Diffstat (limited to 'llvm/lib/Transforms')
-rw-r--r-- | llvm/lib/Transforms/Utils/SimplifyCFG.cpp | 23 |
1 files changed, 17 insertions, 6 deletions
diff --git a/llvm/lib/Transforms/Utils/SimplifyCFG.cpp b/llvm/lib/Transforms/Utils/SimplifyCFG.cpp index bf753dc05d4..93d81435760 100644 --- a/llvm/lib/Transforms/Utils/SimplifyCFG.cpp +++ b/llvm/lib/Transforms/Utils/SimplifyCFG.cpp @@ -2241,14 +2241,25 @@ bool SimplifyCFGOpt::SimplifyUnreachable(UnreachableInst *UI) { /// integer range comparison into a sub, an icmp and a branch. static bool TurnSwitchRangeIntoICmp(SwitchInst *SI) { assert(SI->getNumCases() > 2 && "Degenerate switch?"); - // We can do this transform if the switch consists of an ascending series - // and all cases point to the same destination. - for (unsigned I = 2, E = SI->getNumCases(); I != E; ++I) - if (SI->getSuccessor(I-1) != SI->getSuccessor(I) || - SI->getCaseValue(I-1)->getValue()+1 != SI->getCaseValue(I)->getValue()) + + // Make sure all cases point to the same destination and gather the values. + SmallVector<ConstantInt *, 16> Cases; + Cases.push_back(SI->getCaseValue(1)); + for (unsigned I = 2, E = SI->getNumCases(); I != E; ++I) { + if (SI->getSuccessor(I-1) != SI->getSuccessor(I)) return false; + Cases.push_back(SI->getCaseValue(I)); + } + assert(Cases.size() == SI->getNumCases()-1 && "Not all cases gathered"); + + // Sort the case values, then check if they form a range we can transform. + array_pod_sort(Cases.begin(), Cases.end(), ConstantIntSortPredicate); + for (unsigned I = 1, E = Cases.size(); I != E; ++I) { + if (Cases[I-1]->getValue() != Cases[I]->getValue()+1) + return false; + } - Constant *Offset = ConstantExpr::getNeg(SI->getCaseValue(1)); + Constant *Offset = ConstantExpr::getNeg(Cases.back()); Constant *NumCases = ConstantInt::get(Offset->getType(), SI->getNumCases()-1); Value *Sub = BinaryOperator::CreateAdd(SI->getCondition(), Offset, "off", SI); |