diff options
| author | Chris Lattner <sabre@nondot.org> | 2009-10-27 21:27:42 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2009-10-27 21:27:42 +0000 |
| commit | c5c281ea44cc96b17aee19754ab03e65e8ba8ead (patch) | |
| tree | b52e6c6236b5701f3a6dad4bc1ca93d81d7f7cb6 | |
| parent | e8628a020695599ed6d13fd5e84e22801b946af5 (diff) | |
| download | bcm5719-llvm-c5c281ea44cc96b17aee19754ab03e65e8ba8ead.tar.gz bcm5719-llvm-c5c281ea44cc96b17aee19754ab03e65e8ba8ead.zip | |
Random updates to passes for indbr, I need blockaddress before I can do much more.
llvm-svn: 85316
| -rw-r--r-- | llvm/include/llvm/Bitcode/LLVMBitCodes.h | 4 | ||||
| -rw-r--r-- | llvm/lib/Analysis/InlineCost.cpp | 3 | ||||
| -rw-r--r-- | llvm/lib/Analysis/SparsePropagation.cpp | 5 |
3 files changed, 10 insertions, 2 deletions
diff --git a/llvm/include/llvm/Bitcode/LLVMBitCodes.h b/llvm/include/llvm/Bitcode/LLVMBitCodes.h index 55bd2566bad..7cadd5807fa 100644 --- a/llvm/include/llvm/Bitcode/LLVMBitCodes.h +++ b/llvm/include/llvm/Bitcode/LLVMBitCodes.h @@ -209,7 +209,7 @@ namespace bitc { FUNC_CODE_INST_RET = 10, // RET: [opty,opval<both optional>] FUNC_CODE_INST_BR = 11, // BR: [bb#, bb#, cond] or [bb#] - FUNC_CODE_INST_SWITCH = 12, // SWITCH: [opty, operands...] + FUNC_CODE_INST_SWITCH = 12, // SWITCH: [opty, op0, op1, ...] FUNC_CODE_INST_INVOKE = 13, // INVOKE: [attr, fnty, op0,op1, ...] FUNC_CODE_INST_UNWIND = 14, // UNWIND FUNC_CODE_INST_UNREACHABLE = 15, // UNREACHABLE @@ -237,7 +237,7 @@ namespace bitc { // new select on i1 or [N x i1] FUNC_CODE_INST_VSELECT = 29, // VSELECT: [ty,opval,opval,predty,pred] FUNC_CODE_INST_INBOUNDS_GEP= 30, // INBOUNDS_GEP: [n x operands] - FUNC_CODE_INST_INDBR = 31 // INDBR: [opty, operands...] + FUNC_CODE_INST_INDBR = 31 // INDBR: [opty, op0, op1, ...] }; } // End bitc namespace } // End llvm namespace diff --git a/llvm/lib/Analysis/InlineCost.cpp b/llvm/lib/Analysis/InlineCost.cpp index febdd9101c8..559f468bd64 100644 --- a/llvm/lib/Analysis/InlineCost.cpp +++ b/llvm/lib/Analysis/InlineCost.cpp @@ -31,6 +31,9 @@ unsigned InlineCostAnalyzer::FunctionInfo:: // Eliminating a switch is a big win, proportional to the number of edges // deleted. Reduction += (SI->getNumSuccessors()-1) * 40; + else if (isa<IndBrInst>(*UI)) + // Eliminating an indirect branch is a big win. + Reduction += 200; else if (CallInst *CI = dyn_cast<CallInst>(*UI)) { // Turning an indirect call into a direct call is a BIG win Reduction += CI->getCalledValue() == V ? 500 : 0; diff --git a/llvm/lib/Analysis/SparsePropagation.cpp b/llvm/lib/Analysis/SparsePropagation.cpp index b7844f02276..6578cb4681e 100644 --- a/llvm/lib/Analysis/SparsePropagation.cpp +++ b/llvm/lib/Analysis/SparsePropagation.cpp @@ -166,6 +166,11 @@ void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI, return; } + if (IndBrInst *IBI = dyn_cast<IndBrInst>(TI)) { + Succs.assign(Succs.size(), true); + return; + } + SwitchInst &SI = cast<SwitchInst>(TI); LatticeVal SCValue; if (AggressiveUndef) |
