636     const SCEV *Sum = SE->getAddExpr(A1X1, B1Y1);  in intersectConstraints()  local
637     if (isKnownPredicate(CmpInst::ICMP_EQ, Sum, Y->getC()))  in intersectConstraints()
639     if (isKnownPredicate(CmpInst::ICMP_NE, Sum, Y->getC())) {  in intersectConstraints()
2451   if (const SCEVAddExpr *Sum = dyn_cast<SCEVAddExpr>(Delta)) {  in gcdMIVtest()  local
2453     for (unsigned Op = 0, Ops = Sum->getNumOperands(); Op < Ops; Op++) {  in gcdMIVtest()
2454       const SCEV *Operand = Sum->getOperand(Op);  in gcdMIVtest()
3045   const SCEV *Sum = Bound[1].Lower[Bound[1].Direction];  in getLowerBound()  local
3046   for (unsigned K = 2; Sum && K <= MaxLevels; ++K) {  in getLowerBound()
3048       Sum = SE->getAddExpr(Sum, Bound[K].Lower[Bound[K].Direction]);  in getLowerBound()
3050       Sum = nullptr;  in getLowerBound()
3052   return Sum;  in getLowerBound()
3061   const SCEV *Sum = Bound[1].Upper[Bound[1].Direction];  in getUpperBound()  local
3062   for (unsigned K = 2; Sum && K <= MaxLevels; ++K) {  in getUpperBound()
3064       Sum = SE->getAddExpr(Sum, Bound[K].Upper[Bound[K].Direction]);  in getUpperBound()
3066       Sum = nullptr;  in getUpperBound()
3068   return Sum;  in getUpperBound()
3126     const SCEV *Sum = SE->getAddExpr(AddRec->getStepRecurrence(*SE), Value);  in addToCoefficient()  local
3127     if (Sum->isZero())  in addToCoefficient()
3130                              Sum,  in addToCoefficient()