323 /// expandAddToGEP - Expand an addition expression with a pointer type into
354   Value *Idx = expand(Offset);  in expandAddToGEP()
498     Value *LHS = expand(URemLHS);  in visitAddExpr()
499     Value *RHS = expand(URemRHS);  in visitAddExpr()
523       // This is the first operand. Just expand it.  in visitAddExpr()
524       Sum = expand(Op);  in visitAddExpr()
546       Value *W = expand(SE.getNegativeSCEV(Op));  in visitAddExpr()
552       Value *W = expand(Op);  in visitAddExpr()
582   // Expand the calculation of X pow N in the following manner:  in visitMulExpr()
603     Value *P = expand(I->second);  in visitMulExpr()
624       // This is the first operand. Just expand it.  in visitMulExpr()
658   Value *LHS = expand(S->getLHS());  in visitUDivExpr()
667   Value *RHS = expand(S->getRHS());  in visitUDivExpr()
849 /// expandIVInc - Expand an IV increment at Builder's current InsertPos.
930 /// getAddRecExprPHILiterally - Helper for expandAddRecExprLiterally. Expand
1039   // Expand code for the start value into the loop preheader.  in getAddRecExprPHILiterally()
1041          "Can't expand add recurrences without a loop preheader!");  in getAddRecExprPHILiterally()
1043       expand(Normalized->getStart(), L->getLoopPreheader()->getTerminator());  in getAddRecExprPHILiterally()
1051   // Expand code for the step value. Do this before creating the PHI so that PHI  in getAddRecExprPHILiterally()
1061   // Expand the step somewhere that dominates the loop header.  in getAddRecExprPHILiterally()
1062   Value *StepV = expand(Step, L->getHeader()->getFirstInsertionPt());  in getAddRecExprPHILiterally()
1179         // Expand the step somewhere that dominates the loop header.  in expandAddRecExprLiterally()
1181         StepV = expand(Step, L->getHeader()->getFirstInsertionPt());  in expandAddRecExprLiterally()
1196       Result = Builder.CreateSub(expand(Normalized->getStart()), Result);  in expandAddRecExprLiterally()
1204   // using evaluateAtIteration and expand the resulting SCEV expression. This  in visitAddRecExpr()
1233     Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(),  in visitAddRecExpr()
1237     V = expand(SE.getTruncateExpr(SE.getUnknown(V), Ty), NewInsertPt);  in visitAddRecExpr()
1244       Value *StartV = expand(SE.getPointerBase(S));  in visitAddRecExpr()
1253     // Just do a normal add. Pre-expand the operands to suppress folding.  in visitAddRecExpr()
1255     // The LHS and RHS values are factored out of the expand call to make the  in visitAddRecExpr()
1257     const SCEV *AddExprLHS = SE.getUnknown(expand(S->getStart()));  in visitAddRecExpr()
1258     const SCEV *AddExprRHS = SE.getUnknown(expand(Rest));  in visitAddRecExpr()
1259     return expand(SE.getAddExpr(AddExprLHS, AddExprRHS));  in visitAddRecExpr()
1311       expand(SE.getTruncateOrNoop(  in visitAddRecExpr()
1333   return expand(T);  in visitAddRecExpr()
1337   Value *V = expand(S->getOperand());  in visitPtrToIntExpr()
1343   Value *V = expand(S->getOperand());  in visitTruncateExpr()
1348   Value *V = expand(S->getOperand());  in visitZeroExtendExpr()
1354   Value *V = expand(S->getOperand());  in visitSignExtendExpr()
1361   Value *LHS = expand(S->getOperand(S->getNumOperands() - 1));  in expandMinMaxExpr()
1366     Value *RHS = expand(S->getOperand(i));  in expandMinMaxExpr()
1415   // Expand the code for this SCEV.  in expandCodeFor()
1416   Value *V = expand(SH);  in expandCodeFor()
1430   // sub scAddRecExpr type SCEV, it is required to expand the SCEV literally.  in FindValueInExprValueMap()
1461 // or expand the SCEV literally. Specifically, if the expansion is in LSRMode,
1465 // fails, expand the SCEV literally.
1466 Value *SCEVExpander::expand(const SCEV *S) {  in expand()  function in SCEVExpander
1526   // Expand the expression into instructions.  in expand()
1798   // Use expand's logic which is used for reusing a previous Value in  in hasRelatedExistingExpansion()
1823   // expand the SCEVExpr. This is so that when we come to cost the operands,  in costAndCollectOperands()
2075   Value *Expr0 = expand(Pred->getLHS(), IP);  in expandComparePredicate()
2076   Value *Expr1 = expand(Pred->getRHS(), IP);  in expandComparePredicate()
2109   Value *TripCountVal = expand(ExitCount, Loc);  in generateOverflowCheck()
2114   Value *StepValue = expand(Step, Loc);  in generateOverflowCheck()
2115   Value *NegStepValue = expand(SE.getNegativeSCEV(Step), Loc);  in generateOverflowCheck()
2116   Value *StartValue = expand(Start, Loc);  in generateOverflowCheck()
2296 // Search for a SCEV subexpression that is not safe to expand.  Any expression
2297 // that may expand to a !isSafeToSpeculativelyExecute value is unsafe, namely
2308 // We cannot generally expand recurrences unless the step dominates the loop