Home
last modified time | relevance | path

Searched refs:isAvailableAtLoopEntry (Results 1 – 4 of 4) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DLoopUtils.cpp1106 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNegativeInLoop()
1113 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNonNegativeInLoop()
1123 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMinInLoop()
1134 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMaxInLoop()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp668 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeDecreasingBound()
718 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeIncreasingBound()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DScalarEvolution.cpp2308 bool ScalarEvolution::isAvailableAtLoopEntry(const SCEV *S, const Loop *L) { in isAvailableAtLoopEntry() function in ScalarEvolution
2618 if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) { in getAddExpr()
2973 if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) { in getMulExpr()
9620 if (!isAvailableAtLoopEntry(SplitLHS.first, MDL) || in isKnownViaInduction()
9621 !isAvailableAtLoopEntry(SplitRHS.first, MDL)) in isKnownViaInduction()
10237 assert(isAvailableAtLoopEntry(LHS, L) && in isLoopEntryGuardedByCond()
10239 assert(isAvailableAtLoopEntry(RHS, L) && in isLoopEntryGuardedByCond()
10594 if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
10605 if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
10685 return isAvailableAtLoopEntry(FoundRHS, L) && in isImpliedCondOperandsViaNoOverflow()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DScalarEvolution.h1028 bool isAvailableAtLoopEntry(const SCEV *S, const Loop *L);