Lines Matching defs:UDiv
211 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(this);
212 OS << "(" << *UDiv->getLHS() << " /u " << *UDiv->getRHS() << ")";
600 // Lexicographically compare udiv expressions.
2682 return LHS; // X udiv 1 --> x
2683 // If the denominator is zero, the result of the udiv is undefined. Don't
2805 /// possible. There is no representation for an exact udiv in SCEV IR, but we
2807 /// it's not exact because the udiv may be clearing bits.
2834 cast<SCEVConstant>(getConstant(LHSCst->getAPInt().udiv(Factor)));
2836 cast<SCEVConstant>(getConstant(RHSCst->getAPInt().udiv(Factor)));
3831 case Instruction::UDiv:
3859 return BinaryOp(Instruction::UDiv, Op->getOperand(0), X);
4489 if (const SCEVUDivExpr *UDiv = dyn_cast<SCEVUDivExpr>(S)) {
4490 ConstantRange X = getRange(UDiv->getLHS(), SignHint);
4491 ConstantRange Y = getRange(UDiv->getRHS(), SignHint);
4492 return setRange(UDiv, SignHint,
4493 ConservativeResult.intersectWith(X.udiv(Y)));
5028 case Instruction::UDiv:
8835 APInt ExitVal = (End + A).udiv(A);
9760 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(S);
9761 LoopDisposition LD = getLoopDisposition(UDiv->getLHS(), L);
9764 LoopDisposition RD = getLoopDisposition(UDiv->getRHS(), L);
9846 const SCEVUDivExpr *UDiv = cast<SCEVUDivExpr>(S);
9847 const SCEV *LHS = UDiv->getLHS(), *RHS = UDiv->getRHS();
