Home
last modified time | relevance | path

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

/openbsd/gnu/llvm/llvm/lib/Transforms/Utils/
H A DLoopUtils.cpp1115 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNegativeInLoop()
1122 return SE.isAvailableAtLoopEntry(S, L) && in isKnownNonNegativeInLoop()
1132 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMinInLoop()
1143 return SE.isAvailableAtLoopEntry(S, L) && in cannotBeMaxInLoop()
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopBoundSplit.cpp131 if (!SE.isAvailableAtLoopEntry(Cond.BoundSCEV, &L)) in hasProcessableCondition()
H A DInductiveRangeCheckElimination.cpp665 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeDecreasingBound()
715 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeIncreasingBound()
/openbsd/gnu/llvm/llvm/lib/Analysis/
H A DScalarEvolution.cpp2905 if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) { in getAddExpr()
3278 if (isAvailableAtLoopEntry(Ops[i], AddRecLoop)) { in getMulExpr()
10893 if (!isAvailableAtLoopEntry(SplitLHS.first, MDL) || in isKnownViaInduction()
10894 !isAvailableAtLoopEntry(SplitRHS.first, MDL)) in isKnownViaInduction()
11579 assert(isAvailableAtLoopEntry(LHS, L) && in isLoopEntryGuardedByCond()
11581 assert(isAvailableAtLoopEntry(RHS, L) && in isLoopEntryGuardedByCond()
11988 if (!isAvailableAtLoopEntry(FoundRHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
11999 if (!isAvailableAtLoopEntry(FoundLHS, AR->getLoop())) in isImpliedCondOperandsViaAddRecStart()
12079 return isAvailableAtLoopEntry(FoundRHS, L) && in isImpliedCondOperandsViaNoOverflow()
12978 assert(isAvailableAtLoopEntry(OrigStart, L) && "Must be!"); in howManyLessThans()
[all …]
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/
H A DScalarEvolution.h1215 bool isAvailableAtLoopEntry(const SCEV *S, const Loop *L);