Searched defs:isLoopInvariant (Results 1 - 3 of 3) sorted by relevance
/external/llvm/lib/Analysis/ |
H A D | LoopInfo.cpp | 59 /// isLoopInvariant - Return true if the specified value is loop invariant 61 bool Loop::isLoopInvariant(Value *V) const { function in class:Loop 71 if (!isLoopInvariant(I->getOperand(i))) 81 /// isLoopInvariant. 97 /// isLoopInvariant. 105 if (isLoopInvariant(I))
|
H A D | DependenceAnalysis.cpp | 762 bool DependenceAnalysis::isLoopInvariant(const SCEV *Expression, function in class:DependenceAnalysis 766 return SE->isLoopInvariant(Expression, LoopNest) && 767 isLoopInvariant(Expression, LoopNest->getParentLoop()); 779 if (Level <= CommonLevels && !SE->isLoopInvariant(Expression, LoopNest)) 812 return isLoopInvariant(Src, LoopNest); 815 if (!isLoopInvariant(Step, LoopNest)) 830 return isLoopInvariant(Dst, LoopNest); 833 if (!isLoopInvariant(Step, LoopNest)) 2959 if (SE->isLoopInvariant(AddRec, TargetLoop)) 3334 isLoopInvariant(SrcPtrSCE [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | IndVarSimplify.cpp | 554 if (!SE->isLoopInvariant(ExitValue, L) || 766 /// isLoopInvariant - Perform a quick domtree based check for loop invariance 767 /// assuming that V is used within the loop. LoopInfo::isLoopInvariant() seems 769 static bool isLoopInvariant(Value *V, const Loop *L, const DominatorTree *DT) { function 783 L && L->getLoopPreheader() && isLoopInvariant(NarrowOper, L, DT); 1303 if (isLoopInvariant(IncI->getOperand(1), L, DT)) 1313 if (isLoopInvariant(IncI->getOperand(0), L, DT)) 1350 if (!isLoopInvariant(RHS, L, DT)) { 1351 if (!isLoopInvariant(LHS, L, DT)) 1548 assert(SE->isLoopInvariant(IVOffse [all...] |
Completed in 6010 milliseconds