Lines Matching refs:Phi
171 /// Returns true if Phi is a reduction of type Kind and adds it to the
173 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
177 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
179 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
182 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
186 static bool isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
201 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
213 /// Determines if Phi may have been type-promoted. If Phi has a single user
214 /// that ANDs the Phi with a type mask, return the user. RT is updated to
217 static Instruction *lookThroughAnd(PHINode *Phi, Type *&RT,
232 /// actual type of the Phi if the recurrence has been type-promoted.
252 // First occurrence of unasfe algebra in the PHI's use-chain.
297 /// Returns true if \p Phi is an induction in the loop \p L. If \p Phi is an
300 /// expression for \p Phi than the one returned by the ScalarEvolution
302 static bool isInductionPHI(PHINode *Phi, const Loop* L, ScalarEvolution *SE,
306 /// Returns true if \p Phi is a floating point induction in the loop \p L.
307 /// If \p Phi is an induction, the induction descriptor \p D will contain
309 static bool isFPInductionPHI(PHINode *Phi, const Loop* L,
312 /// Returns true if \p Phi is a loop \p L induction, in the context associated
314 /// further SCEV predicates to \p PSE in order to prove that \p Phi is an
316 /// If \p Phi is an induction, \p D will contain the data describing this
318 static bool isInductionPHI(PHINode *Phi, const Loop* L,
366 /// For the given instruction which have uses outside of the loop, an LCSSA PHI
380 /// current loop. For each, an LCSSA PHI node is inserted and the uses outside
