RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-01-10 14:12:11 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

[NewGVN] Remove (for now) unused code. NFCI.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@290420 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Davide Italiano 2016-12-23 10:28:30 +00:00
parent 90dfd72f29
commit fa641c2b8d
1 changed files with 0 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
lib/Transforms/Scalar/NewGVN.cpp
View File

@ -1129,7 +1129,6 @@ void NewGVN::processOutgoingEdges(TerminatorInst *TI, BasicBlock *B) {
// Remember how many outgoing edges there are to every successor.
SmallDenseMap<BasicBlock *, unsigned, 16> SwitchEdges;
bool MultipleEdgesOneReachable = false;
Value *SwitchCond = SI->getCondition();
Value *CondEvaluated = findConditionEquivalence(SwitchCond, B);
// See if we were able to turn this switch statement into a constant.
@ -1147,17 +1146,6 @@ void NewGVN::processOutgoingEdges(TerminatorInst *TI, BasicBlock *B) {
// Now get where it goes and mark it reachable.
BasicBlock *TargetBlock = CaseVal.getCaseSuccessor();
updateReachableEdge(B, TargetBlock);
unsigned WhichSucc = CaseVal.getSuccessorIndex();
// Calculate whether our single reachable edge is really a single edge to
// the target block. If not, and the block has multiple predecessors, we
// can only replace phi node values.
for (unsigned i = 0, e = SI->getNumSuccessors(); i != e; ++i) {
if (i == WhichSucc)
continue;
BasicBlock *Block = SI->getSuccessor(i);
if (Block == TargetBlock)
MultipleEdgesOneReachable = true;
}
} else {
for (unsigned i = 0, e = SI->getNumSuccessors(); i != e; ++i) {
BasicBlock *TargetBlock = SI->getSuccessor(i);