Home
last modified time | relevance | path

Searched refs:getNumCases (Results 1 – 17 of 17) sorted by relevance

/external/llvm/utils/TableGen/
DDAGISelMatcherEmitter.cpp298 NumCases = SOM->getNumCases(); in EmitMatcher()
301 NumCases = cast<SwitchTypeMatcher>(N)->getNumCases(); in EmitMatcher()
754 for (unsigned i = 0, e = SOM->getNumCases(); i != e; ++i) in BuildHistogram()
757 for (unsigned i = 0, e = STM->getNumCases(); i != e; ++i) in BuildHistogram()
DDAGISelMatcher.h516 unsigned getNumCases() const { return Cases.size(); } in getNumCases() function
570 unsigned getNumCases() const { return Cases.size(); } in getNumCases() function
/external/llvm/lib/Transforms/Scalar/
DLowerExpectIntrinsic.cpp59 unsigned n = SI.getNumCases(); // +1 for default case. in handleSwitchExpect()
DCorrelatedValuePropagation.cpp293 NumDeadCases += SI->getNumCases(); in processSwitch()
DSCCP.cpp557 if (!SI->getNumCases()) { in getFeasibleSuccessors()
621 if (SI->getNumCases() < 1) in isEdgeFeasible()
1486 if (!SI->getNumCases()) in ResolvedUndefsIn()
DLoopUnswitch.cpp555 unsigned NumCases = SI->getNumCases(); in processCurrentLoop()
/external/llvm/lib/Transforms/Utils/
DSimplifyCFG.cpp582 Cases.reserve(SI->getNumCases()); in GetValueEqualityComparisonCases()
709 bool HasWeight = MD && (MD->getNumOperands() == 2 + SI->getNumCases()); in SimplifyEqualityComparisonWithOnlyPredecessor()
2975 if (Weights.size() == 1 + SI->getNumCases()) { in SimplifySwitchOnSelect()
3110 if (Weights.size() == 1 + SI->getNumCases()) { in TryToSimplifyUncondBranchWithICmpInIt()
3553 assert(SI->getNumCases() > 1 && "Degenerate switch?"); in TurnSwitchRangeIntoICmp()
3621 if (Weights.size() == 1 + SI->getNumCases()) { in TurnSwitchRangeIntoICmp()
3648 unsigned PreviousEdges = SI->getNumCases() - ContiguousCases->size(); in TurnSwitchRangeIntoICmp()
3691 SI->getNumCases() == (1ULL << NumUnknownBits)) { in EliminateDeadSwitchCases()
3707 HasWeight = (Weights.size() == 1 + SI->getNumCases()); in EliminateDeadSwitchCases()
4353 if (SI->getNumCases() > TableSize || TableSize >= UINT64_MAX / 10) in ShouldBuildLookupTable()
[all …]
DLocal.cpp125 SI->getNumCases() > 0) { in ConstantFoldTerminator()
142 unsigned NCases = SI->getNumCases(); in ConstantFoldTerminator()
208 if (SI->getNumCases() == 1) { in ConstantFoldTerminator()
DLowerSwitch.cpp413 if (!SI->getNumCases()) { in processSwitchInst()
/external/llvm/include/llvm/IR/
DInstructions.h2990 assert(Index < SI->getNumCases() && "Index out the number of cases.");
2996 assert((Index < SI->getNumCases() ||
3007 assert((Index == DefaultPseudoIndex || Index < SI->getNumCases()) &&
3015 assert(Index+1 <= SI->getNumCases() && "Index out the number of cases.");
3028 assert((Index == 0 || Index-1 <= SI->getNumCases()) &&
3064 assert(Index < SI->getNumCases() && "Index out the number of cases.");
3101 unsigned getNumCases() const {
3119 return CaseIt(this, getNumCases());
3124 return ConstCaseIt(this, getNumCases());
/external/llvm/lib/Transforms/Instrumentation/
DSanitizerCoverage.cpp388 Initializers.push_back(ConstantInt::get(Int64Ty, SI->getNumCases())); in InjectTraceForSwitch()
/external/llvm/lib/Target/PowerPC/
DPPCCTRLoops.cpp422 if (SI->getNumCases() + 1 >= (unsigned)TLI->getMinimumJumpTableEntries()) in mightUseCTR()
/external/clang/lib/CodeGen/
DCGCleanup.cpp562 if (si->getNumCases() == 1 && si->getDefaultDest() == unreachableBB) { in destroyOptimisticNormalEntry()
DCGStmt.cpp1554 assert(SwitchWeights->size() == 1 + SwitchInsn->getNumCases() && in EmitSwitchStmt()
/external/llvm/lib/Target/CppBackend/
DCPPBackend.cpp1157 << SI->getNumCases() << ", " << bbname << ");"; in printInstruction()
/external/llvm/lib/IR/
DInstructions.cpp3635 unsigned NewCaseIdx = getNumCases(); in addCase()
/external/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAGBuilder.cpp8472 Clusters.reserve(SI.getNumCases()); in visitSwitch()
8478 : BranchProbability(1, SI.getNumCases() + 1); in visitSwitch()