Lines Matching defs:UDiv
212 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(this);
213 OS << "(" << *UDiv->getLHS() << " /u " << *UDiv->getRHS() << ")";
602 // Lexicographically compare udiv expressions.
2131 return LHS; // X udiv 1 --> x
2132 // If the denominator is zero, the result of the udiv is undefined. Don't
3321 if (const SCEVUDivExpr *UDiv = dyn_cast<SCEVUDivExpr>(S)) {
3322 ConstantRange X = getUnsignedRange(UDiv->getLHS());
3323 ConstantRange Y = getUnsignedRange(UDiv->getRHS());
3324 return setUnsignedRange(UDiv, ConservativeResult.intersectWith(X.udiv(Y)));
3462 if (const SCEVUDivExpr *UDiv = dyn_cast<SCEVUDivExpr>(S)) {
3463 ConstantRange X = getSignedRange(UDiv->getLHS());
3464 ConstantRange Y = getSignedRange(UDiv->getRHS());
3465 return setSignedRange(UDiv, ConservativeResult.intersectWith(X.udiv(Y)));
3636 case Instruction::UDiv:
5528 // actually used. So the trip count computed by udiv could be smaller than the
5531 // FIXME: We really want an "isexact" bit for udiv.
6467 APInt ExitVal = (End + A).udiv(A);
6798 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(S);
6799 LoopDisposition LD = getLoopDisposition(UDiv->getLHS(), L);
6802 LoopDisposition RD = getLoopDisposition(UDiv->getRHS(), L);
6878 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(S);
6879 const SCEV *LHS = UDiv->getLHS(), *RHS = UDiv->getRHS();
