Lines Matching refs:UpperBound
107 ConstantInt *LowerBound, ConstantInt *UpperBound,
112 ConstantInt *LowerBound, ConstantInt *UpperBound,
244 /// The function recursively builds this tree. LowerBound and UpperBound are
250 ConstantInt *UpperBound, Value *Val,
254 assert(LowerBound && UpperBound && "Bounds must be initialized");
262 if (Begin->Low == LowerBound && Begin->High == UpperBound) {
264 NumMergedCases = UpperBound->getSExtValue() - LowerBound->getSExtValue();
268 return newLeafBlock(*Begin, Val, LowerBound, UpperBound, OrigBlock,
305 << ", " << UpperBound->getSExtValue() << "]\n");
319 UpperBound, Val, NewNode, OrigBlock,
335 ConstantInt *UpperBound,
354 } else if (Leaf.High == UpperBound) {
368 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High);
369 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound,
474 ConstantInt *UpperBound = nullptr;
482 UpperBound = Cases.back().High;
511 UpperBound = ConstantInt::get(SI->getContext(), Max);
602 switchConvert(Cases.begin(), Cases.end(), LowerBound, UpperBound, Val,