1020     const SCEV *S = SE.getMinusSCEV(It, SE.getConstant(It->getType(), i));  in BinomialCoefficient()
2298     Operation = &ScalarEvolution::getMinusSCEV;  in willNotOverflow()
3343   return getMinusSCEV(LHS, Mult, SCEV::FlagNUW);  in getURemExpr()
4480   return getMinusSCEV(getMinusOne(Ty), V);  in getNotSCEV()
4513 const SCEV *ScalarEvolution::getMinusSCEV(const SCEV *LHS, const SCEV *RHS,  in getMinusSCEV()  function in ScalarEvolution
4902       return SE.getMinusSCEV(Expr, Expr->getStepRecurrence(SE));  in visitAddRecExpr()
5695             if (isKnownPositive(getMinusSCEV(getSCEV(GEP), Ptr)))  in createAddRecFromPHI()
6020       const SCEV *LDiff = getMinusSCEV(LA, LS);  in createNodeForSelectOrPHIInstWithICmpInstCond()
6021       const SCEV *RDiff = getMinusSCEV(RA, RS);  in createNodeForSelectOrPHIInstWithICmpInstCond()
6025       LDiff = getMinusSCEV(LA, RS);  in createNodeForSelectOrPHIInstWithICmpInstCond()
6026       RDiff = getMinusSCEV(RA, LS);  in createNodeForSelectOrPHIInstWithICmpInstCond()
6043       const SCEV *Y = getMinusSCEV(FalseValExpr, X); // y = (x+y)-x  in createNodeForSelectOrPHIInstWithICmpInstCond()
6044       const SCEV *C = getMinusSCEV(TrueValExpr, Y);  // C = (C+y)-y  in createNodeForSelectOrPHIInstWithICmpInstCond()
6101   return SE->getAddExpr(C, SE->getUMinExpr(CondExpr, SE->getMinusSCEV(X, C),  in createNodeForSelectViaUMinSeq()
7476               AddOps.push_back(getMinusSCEV(LHS, RHS, Flags));  in createSCEV()
7543       return getMinusSCEV(LHS, RHS, Flags);  in createSCEV()
7774         return getMinusSCEV(V1, V2, SCEV::FlagNSW);  in createSCEV()
7855         return getMinusSCEV(X, ClampedY, SCEV::FlagNUW);  in createSCEV()
8938     ExitLimit EL = howFarToZero(getMinusSCEV(LHS, RHS), L, ControlsExit,  in computeExitLimitFromICmp()
8955     ExitLimit EL = howFarToNonZero(getMinusSCEV(LHS, RHS), L);  in computeExitLimitFromICmp()
9000   ExitLimit EL = howFarToZero(getMinusSCEV(LHS, RHS), L, ControlsExit);  in computeExitLimitFromSingleExitSwitch()
10865     auto *Diff = getMinusSCEV(LHS, RHS);  in isKnownPredicateViaConstantRanges()
12130       auto *DenomMinusTwo = getMinusSCEV(DenominatorExt, getConstant(WTy, 2));  in isImpliedViaOperations()
12143       auto *NegDenomMinusOne = getMinusSCEV(MinusOne, DenominatorExt);  in isImpliedViaOperations()
12288     APInt MaxStrideMinusOne = getSignedRangeMax(getMinusSCEV(Stride, One));  in canIVOverflowOnLT()
12296   APInt MaxStrideMinusOne = getUnsignedRangeMax(getMinusSCEV(Stride, One));  in canIVOverflowOnLT()
12311     APInt MaxStrideMinusOne = getSignedRangeMax(getMinusSCEV(Stride, One));  in canIVOverflowOnGT()
12319   APInt MaxStrideMinusOne = getUnsignedRangeMax(getMinusSCEV(Stride, One));  in canIVOverflowOnGT()
12330   const SCEV *NMinusOne = getMinusSCEV(N, MinNOne);  in getUDivCeilSCEV()
12565         auto *StartIfZero = getMinusSCEV(IV->getStart(), Stride);  in howManyLessThans()
12635   auto *OrigStartMinusStride = getMinusSCEV(OrigStart, Stride);  in howManyLessThans()
12662         getMinusSCEV(getAddExpr(RHS, MinusOne), getMinusSCEV(Start, Stride));  in howManyLessThans()
12706       BECountIfBackedgeTaken = getUDivCeilSCEV(getMinusSCEV(RHS, Start), Stride);  in howManyLessThans()
12768       if (Start == Stride || Start == getMinusSCEV(Stride, One)) {  in howManyLessThans()
12779     const SCEV *Delta = getMinusSCEV(End, Start);  in howManyLessThans()
12784           getUDivExpr(getAddExpr(Delta, getMinusSCEV(Stride, One)), Stride);  in howManyLessThans()
12879       getAddExpr(getMinusSCEV(Start, End), getMinusSCEV(Stride, One)), Stride);  in howManyGreaterThans()
13719     const SCEV *Delta = SE2.getMinusSCEV(Old, New);  in verify()
14658           getUMinExpr(RewrittenLHS, getMinusSCEV(RHS, getOne(RHS->getType())));  in applyLoopGuards()
14662           getSMinExpr(RewrittenLHS, getMinusSCEV(RHS, getOne(RHS->getType())));  in applyLoopGuards()