Lines Matching defs:UDiv
212 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(this);
213 OS << "(" << *UDiv->getLHS() << " /u " << *UDiv->getRHS() << ")";
605 // Lexicographically compare udiv expressions.
2134 return LHS; // X udiv 1 --> x
2135 // If the denominator is zero, the result of the udiv is undefined. Don't
3362 if (const SCEVUDivExpr *UDiv = dyn_cast<SCEVUDivExpr>(S)) {
3363 ConstantRange X = getUnsignedRange(UDiv->getLHS());
3364 ConstantRange Y = getUnsignedRange(UDiv->getRHS());
3365 return setUnsignedRange(UDiv, ConservativeResult.intersectWith(X.udiv(Y)));
3503 if (const SCEVUDivExpr *UDiv = dyn_cast<SCEVUDivExpr>(S)) {
3504 ConstantRange X = getSignedRange(UDiv->getLHS());
3505 ConstantRange Y = getSignedRange(UDiv->getRHS());
3506 return setSignedRange(UDiv, ConservativeResult.intersectWith(X.udiv(Y)));
3677 case Instruction::UDiv:
5604 // back edge count. (Ideally we would have an "isexact" bit for udiv). We know
5613 // computed by this udiv could be smaller than the number of well-defined
6558 APInt ExitVal = (End + A).udiv(A);
6889 UDiv = cast<SCEVUDivExpr>(S);
6890 LoopDisposition LD = getLoopDisposition(UDiv->getLHS(), L);
6893 LoopDisposition RD = getLoopDisposition(UDiv->getRHS(), L);
6969 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(S);
6970 const SCEV *LHS = UDiv->getLHS(), *RHS = UDiv->getRHS();
