Home
last modified time | relevance | path

Searched refs:matchSimpleRecurrence (Results 1 – 13 of 13) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DHashRecognize.cpp295 bool matchSimpleRecurrence(const PHINode *P);
321 bool RecurrenceInfo::matchSimpleRecurrence(const PHINode *P) { in matchSimpleRecurrence() function in RecurrenceInfo
323 return llvm::matchSimpleRecurrence(Phi, BO, Start, Step); in matchSimpleRecurrence()
429 SimpleRecurrence.matchSimpleRecurrence(&P); in getRecurrences()
H A DValueTracking.cpp1561 if (matchSimpleRecurrence(P, BO, R, L)) { in computeKnownBitsFromOperator()
2338 if (!matchSimpleRecurrence(PN, BO, Start, Step)) in isPowerOfTwoRecurrence()
2798 if (!matchSimpleRecurrence(PN, BO, Start, Step) || in isNonZeroRecurrence()
3638 !matchSimpleRecurrence(PN1, BO1, Start1, Step1) || in getInvertibleOperands()
3639 !matchSimpleRecurrence(PN2, BO2, Start2, Step2)) in getInvertibleOperands()
9112 bool llvm::matchSimpleRecurrence(const PHINode *P, BinaryOperator *&BO, in matchSimpleRecurrence() function in llvm
9123 bool llvm::matchSimpleRecurrence(const BinaryOperator *I, PHINode *&P, in matchSimpleRecurrence() function in llvm
9129 return P && matchSimpleRecurrence(P, BO, Start, Step) && BO == I; in matchSimpleRecurrence()
H A DScalarEvolution.cpp6456 if (!matchSimpleRecurrence(P, BO, Start, Step)) in getRangeForUnknownRecurrence()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DValueTracking.h965 LLVM_ABI bool matchSimpleRecurrence(const PHINode *P, BinaryOperator *&BO,
969 LLVM_ABI bool matchSimpleRecurrence(const BinaryOperator *I, PHINode *&P,
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopTermFold.cpp96 if (!matchSimpleRecurrence(LHS, ToFold, ToFoldStart, ToFoldStep)) in canFoldTermCondOfLoop()
H A DLoopStrengthReduce.cpp6082 if (!matchSimpleRecurrence(&PN, BO, Start, Step)) in ImplementSolution()
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVGatherScatterLowering.cpp206 if (!matchSimpleRecurrence(Phi, Inc, Start, Step) || in matchStridedRecurrence()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVEGatherScatterLowering.cpp1030 if (!matchSimpleRecurrence(Phi, IncInstruction, Start, IncrementPerRound) || in optimiseOffsets()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp1413 if (!matchSimpleRecurrence(Iv2Next, Iv2, Iv2Start, Iv2Step) || in foldDependentIVs()
H A DInstructionCombining.cpp2011 if (!matchSimpleRecurrence(BO0, PN0, Start0, Step0) || !PN0->hasOneUse() || in foldBinopWithRecurrence()
2012 !matchSimpleRecurrence(BO1, PN1, Start1, Step1) || !PN1->hasOneUse() || in foldBinopWithRecurrence()
H A DInstCombineAndOrXor.cpp2848 if (matchSimpleRecurrence(&I, PN, Start, Step) && DT.dominates(Step, PN)) in visitAnd()
4199 if (matchSimpleRecurrence(&I, PN, Start, Step) && DT.dominates(Step, PN)) in visitOr()
H A DInstCombineMulDivRem.cpp1057 if (matchSimpleRecurrence(&I, PN, Start, Step) && I.hasNoNaNs() && in visitFMul()
H A DInstCombineAddSub.cpp1919 if (matchSimpleRecurrence(&I, PHI, Start, Step)) in visitAdd()