Lines Matching defs:LowerBound

154 BasicBlock *NewLeafBlock(CaseRange &Leaf, Value *Val, ConstantInt *LowerBound,
169     if (Leaf.Low == LowerBound) {
222 /// The function recursively builds this tree. LowerBound and UpperBound are
226 BasicBlock *SwitchConvert(CaseItr Begin, CaseItr End, ConstantInt *LowerBound,
231   assert(LowerBound && UpperBound && "Bounds must be initialized");
239     if (Begin->Low == LowerBound && Begin->High == UpperBound) {
240       APInt NumMergedCases = UpperBound->getValue() - LowerBound->getValue();
244     return NewLeafBlock(*Begin, Val, LowerBound, UpperBound, OrigBlock,
278   LLVM_DEBUG(dbgs() << "LHS Bounds ==> [" << LowerBound->getValue() << ", "
291       SwitchConvert(LHS.begin(), LHS.end(), LowerBound, NewUpperBound, Val,
387   ConstantInt *LowerBound = nullptr;
395     LowerBound = Cases.front().Low;
425     LowerBound = ConstantInt::get(SI->getContext(), Min);
512       SwitchConvert(Cases.begin(), Cases.end(), LowerBound, UpperBound, Val,