Lines Matching refs:udiv
204 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(this);
205 OS << "(" << *UDiv->getLHS() << " /u " << *UDiv->getRHS() << ")";
594 // 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
3324 if (const SCEVUDivExpr *UDiv = dyn_cast<SCEVUDivExpr>(S)) {
3325 ConstantRange X = getUnsignedRange(UDiv->getLHS());
3326 ConstantRange Y = getUnsignedRange(UDiv->getRHS());
3327 return setUnsignedRange(UDiv, ConservativeResult.intersectWith(X.udiv(Y)));
3465 if (const SCEVUDivExpr *UDiv = dyn_cast<SCEVUDivExpr>(S)) {
3466 ConstantRange X = getSignedRange(UDiv->getLHS());
3467 ConstantRange Y = getSignedRange(UDiv->getRHS());
3468 return setSignedRange(UDiv, ConservativeResult.intersectWith(X.udiv(Y)));
3639 case Instruction::UDiv:
5520 // actually used. So the trip count computed by udiv could be smaller than the
5523 // FIXME: We really want an "isexact" bit for udiv.
6417 APInt ExitVal = (End + A).udiv(A);
6746 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(S);
6747 LoopDisposition LD = getLoopDisposition(UDiv->getLHS(), L);
6750 LoopDisposition RD = getLoopDisposition(UDiv->getRHS(), L);
6826 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(S);
6827 const SCEV *LHS = UDiv->getLHS(), *RHS = UDiv->getRHS();
6888 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(S);
6889 const SCEV *LHS = UDiv->getLHS(), *RHS = UDiv->getRHS();
