Home
last modified time | relevance | path

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

/minix3/external/bsd/llvm/dist/llvm/utils/TableGen/
H A DDAGISelMatcherEmitter.cpp280 NumCases = SOM->getNumCases(); in EmitMatcher()
283 NumCases = cast<SwitchTypeMatcher>(N)->getNumCases(); in EmitMatcher()
740 for (unsigned i = 0, e = SOM->getNumCases(); i != e; ++i) in BuildHistogram()
743 for (unsigned i = 0, e = STM->getNumCases(); i != e; ++i) in BuildHistogram()
H A DDAGISelMatcher.h516 unsigned getNumCases() const { return Cases.size(); } in getNumCases() function
570 unsigned getNumCases() const { return Cases.size(); } in getNumCases() function
/minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Utils/
H A DLowerExpectIntrinsic.cpp76 unsigned n = SI->getNumCases(); // +1 for default case. in HandleSwitchExpect()
H A DSimplifyCFG.cpp583 Cases.reserve(SI->getNumCases()); in GetValueEqualityComparisonCases()
712 bool HasWeight = MD && (MD->getNumOperands() == 2 + SI->getNumCases()); in SimplifyEqualityComparisonWithOnlyPredecessor()
2670 if (Weights.size() == 1 + SI->getNumCases()) { in SimplifySwitchOnSelect()
2804 if (Weights.size() == 1 + SI->getNumCases()) { in TryToSimplifyUncondBranchWithICmpInIt()
3209 assert(SI->getNumCases() > 1 && "Degenerate switch?"); in TurnSwitchRangeIntoICmp()
3221 assert(Cases.size() == SI->getNumCases() && "Not all cases gathered"); in TurnSwitchRangeIntoICmp()
3231 Constant *NumCases = ConstantInt::get(Offset->getType(), SI->getNumCases()); in TurnSwitchRangeIntoICmp()
3238 if (NumCases->isNullValue() && SI->getNumCases() != 0) in TurnSwitchRangeIntoICmp()
3250 if (Weights.size() == 1 + SI->getNumCases()) { in TurnSwitchRangeIntoICmp()
3267 for (unsigned I = 0, E = SI->getNumCases()-1; I != E; ++I) in TurnSwitchRangeIntoICmp()
[all …]
H A DLowerSwitch.cpp383 if (!SI->getNumCases()) { in processSwitchInst()
H A DLocal.cpp132 unsigned NCases = SI->getNumCases(); in ConstantFoldTerminator()
199 if (SI->getNumCases() == 1) { in ConstantFoldTerminator()
/minix3/external/bsd/llvm/dist/llvm/include/llvm/IR/
H A DInstructions.h2628 assert(Index < SI->getNumCases() && "Index out the number of cases.");
2634 assert((Index < SI->getNumCases() ||
2645 assert((Index == DefaultPseudoIndex || Index < SI->getNumCases()) &&
2653 assert(Index+1 <= SI->getNumCases() && "Index out the number of cases.");
2666 assert((Index == 0 || Index-1 <= SI->getNumCases()) &&
2703 assert(Index < SI->getNumCases() && "Index out the number of cases.");
2742 unsigned getNumCases() const {
2760 return CaseIt(this, getNumCases());
2765 return ConstCaseIt(this, getNumCases());
/minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Scalar/
H A DCorrelatedValuePropagation.cpp274 NumDeadCases += SI->getNumCases(); in processSwitch()
H A DSCCP.cpp549 if (!SI->getNumCases()) { in getFeasibleSuccessors()
613 if (SI->getNumCases() < 1) in isEdgeFeasible()
1477 if (!SI->getNumCases()) in ResolvedUndefsIn()
H A DLoopUnswitch.cpp462 unsigned NumCases = SI->getNumCases(); in processCurrentLoop()
/minix3/external/bsd/llvm/dist/llvm/lib/Target/PowerPC/
H A DPPCCTRLoops.cpp404 if (SI->getNumCases() + 1 >= (unsigned)TLI->getMinimumJumpTableEntries()) in mightUseCTR()
/minix3/external/bsd/llvm/dist/clang/lib/CodeGen/
H A DCGCleanup.cpp539 if (si->getNumCases() == 1 && si->getDefaultDest() == unreachableBB) { in destroyOptimisticNormalEntry()
H A DCGStmt.cpp1628 assert(SwitchWeights->size() == 1 + SwitchInsn->getNumCases() && in EmitSwitchStmt()
/minix3/external/bsd/llvm/dist/llvm/lib/Target/CppBackend/
H A DCPPBackend.cpp1155 << SI->getNumCases() << ", " << bbname << ");"; in printInstruction()
/minix3/external/bsd/llvm/dist/llvm/lib/IR/
H A DInstructions.cpp3467 unsigned NewCaseIdx = getNumCases(); in addCase()