| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 173 /// Returns true if Phi is a reduction of type Kind and adds it to the
175 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
179 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
181 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
184 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
188 static bool isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
203 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
215 /// Determines if Phi may have been type-promoted. If Phi has a single user
216 /// that ANDs the Phi with a type mask, return the user. RT is updated t
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 174 /// Returns true if Phi is a reduction of type Kind and adds it to the
176 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
180 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
182 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
185 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
191 /// to handle Phi as a first-order recurrence.
193 isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
209 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
221 /// Determines if Phi may have been type-promoted. If Phi has a single use
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 174 /// Returns true if Phi is a reduction of type Kind and adds it to the
176 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
180 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
182 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
185 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
191 /// to handle Phi as a first-order recurrence.
193 isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
209 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
221 /// Determines if Phi may have been type-promoted. If Phi has a single use
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 174 /// Returns true if Phi is a reduction of type Kind and adds it to the
176 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
180 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
182 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
185 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
191 /// to handle Phi as a first-order recurrence.
193 isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
209 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
221 /// Determines if Phi may have been type-promoted. If Phi has a single use
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 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 t
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 173 /// Returns true if Phi is a reduction of type Kind and adds it to the
175 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
179 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
181 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
184 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
188 static bool isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
203 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
215 /// Determines if Phi may have been type-promoted. If Phi has a single user
216 /// that ANDs the Phi with a type mask, return the user. RT is updated t
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 173 /// Returns true if Phi is a reduction of type Kind and adds it to the
175 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
179 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
181 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
184 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
188 static bool isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
203 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
215 /// Determines if Phi may have been type-promoted. If Phi has a single user
216 /// that ANDs the Phi with a type mask, return the user. RT is updated t
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 174 /// Returns true if Phi is a reduction of type Kind and adds it to the
176 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
180 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
182 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
185 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
191 /// to handle Phi as a first-order recurrence.
193 isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
209 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
221 /// Determines if Phi may have been type-promoted. If Phi has a single use
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 174 /// Returns true if Phi is a reduction of type Kind and adds it to the
176 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
180 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
182 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
185 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
191 /// to handle Phi as a first-order recurrence.
193 isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
209 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
221 /// Determines if Phi may have been type-promoted. If Phi has a single use
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 174 /// Returns true if Phi is a reduction of type Kind and adds it to the
176 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
180 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor is
182 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
185 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
191 /// to handle Phi as a first-order recurrence.
193 isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
209 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
221 /// Determines if Phi may have been type-promoted. If Phi has a single use
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 175 /// Returns true if Phi is a reduction of type Kind and adds it to the
179 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
186 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor
190 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
196 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
202 /// to handle Phi as a first-order recurrence.
204 isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
220 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
233 /// actual type of the Phi if the recurrence has been type-promoted.
253 // First occurrence of unasfe algebra in the PHI's use-chain
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| LoopUtils.h | 175 /// Returns true if Phi is a reduction of type Kind and adds it to the
179 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop,
186 /// Returns true if Phi is a reduction in TheLoop. The RecurrenceDescriptor
190 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop,
196 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
202 /// to handle Phi as a first-order recurrence.
204 isFirstOrderRecurrence(PHINode *Phi, Loop *TheLoop,
220 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
233 /// actual type of the Phi if the recurrence has been type-promoted.
253 // First occurrence of unasfe algebra in the PHI's use-chain
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | 182 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
186 PHINode *PHI = dyn_cast<PHINode>(User);
187 if (!PHI)
191 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
192 if (PHI->getIncomingValue(i) != Def)
195 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
203 assert(InsertPt && "Missing phi operand");
262 // If this is not an add of the PHI with a constantfp, or if the constant fp
466 // Collect information about PHI nodes which can be transformed in
516 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Sca
[all...] |
| StructurizeCFG.cpp | 143 /// The condition for the optional "Else" region is expressed as a PHI node.
144 /// The incomming values of the PHI node are true for the "If" edge and false
162 /// consist of a network of PHI nodes where the true incoming values expresses
567 /// \brief Remove all PHI values coming from "From" into "To" and remember
574 PHINode &Phi = cast<PHINode>(*I++);
575 while (Phi.getBasicBlockIndex(From) != -1) {
576 Value *Deleted = Phi.removeIncomingValue(From, false);
577 Map[&Phi].push_back(std::make_pair(From, Deleted));
582 /// \brief Add a dummy PHI value as soon as we knew the new predecessor
587 PHINode &Phi = cast<PHINode>(*I++)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| MemorySSA.cpp | 209 // Rename the phi nodes in our successor block
213 auto *Phi = cast<MemoryPhi>(&Accesses->front());
214 Phi->addIncoming(IncomingVal, BB);
223 /// in phi nodes in our successors.
249 /// \brief Compute dominator levels, used by the phi insertion algorithm above.
256 /// \brief This handles unreachable block accesses by deleting phi nodes in
263 // Make sure phi nodes in our reachable successors end up with a
271 // Rename the phi nodes in our successor block
275 auto *Phi = cast<MemoryPhi>(&Accesses->front());
276 Phi->addIncoming(LiveOnEntryDef.get(), BB)
[all...] |
| /frameworks/native/services/sensorservice/ |
| Fusion.h | 82 mat<mat33_t, 2, 2> Phi;
|
| Fusion.cpp | 176 Phi[0][1] = 0;
177 Phi[1][1] = 1;
447 // P(k+1) = Phi(k)*P(k)*Phi(k)' + G*Q(k)*G'
453 // Phi = | Phi00 Phi10 |
482 Phi[0][0] = I33 - wx*(k1*ilwe) + wx2*k0;
483 Phi[1][0] = wx*k0 - I33dT - wx2*(ilwe*ilwe*ilwe)*(lwedT-k1);
490 P = Phi*P*transpose(Phi) + GQGt;
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| deadcode.go | 242 // Remove phi args from c's phis.
254 // a Phi with a Copy can in general cause problems because
255 // Phi and Copy don't have exactly the same semantics.
256 // Phi arguments always come from a predecessor block,
258 // 1: x = (Phi y)
261 // If we replace Phi->Copy, we get
265 // (Phi y) refers to the *previous* value of y, whereas
275 // x = (Phi z)
278 // Where opX are not Phi ops. But such a situation
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| deadcode.go | 242 // Remove phi args from c's phis.
254 // a Phi with a Copy can in general cause problems because
255 // Phi and Copy don't have exactly the same semantics.
256 // Phi arguments always come from a predecessor block,
258 // 1: x = (Phi y)
261 // If we replace Phi->Copy, we get
265 // (Phi y) refers to the *previous* value of y, whereas
275 // x = (Phi z)
278 // Where opX are not Phi ops. But such a situation
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | 198 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
202 PHINode *PHI = dyn_cast<PHINode>(User);
203 if (!PHI)
207 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
208 if (PHI->getIncomingValue(i) != Def)
211 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
219 assert(InsertPt && "Missing phi operand");
271 // If this is not an add of the PHI with a constantfp, or if the constant fp
449 // Add a new IVUsers entry for the newly-created integer PHI.
502 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Sca
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| /prebuilts/go/darwin-x86/src/math/ |
| const.go | 14 Phi = 1.61803398874989484820458683436563811772030917980576286213544862 // https://oeis.org/A001622
|
| /prebuilts/go/linux-x86/src/math/ |
| const.go | 14 Phi = 1.61803398874989484820458683436563811772030917980576286213544862 // https://oeis.org/A001622
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCBoolRetToInt.cpp | 141 const PHINode *Phi = dyn_cast<PHINode>(V);
142 return !Phi || Promotable.count(Phi);
|
| /external/llvm/lib/CodeGen/ |
| MachinePipeliner.cpp | 49 // represent loop carried dependences in the DAG as order edges to the Phi
121 /// an unrelated Phi.
124 cl::desc("Prune dependences between unrelated Phi nodes."),
291 /// using an anti dependence from a Phi to an instruction.
325 // Instructions that feed a Phi have a distance of 1. Computing larger
410 unsigned PhiNum, MachineInstr *Phi,
540 /// second is true if the register defines a Phi value and loop value is
541 /// scheduled before the Phi.
650 /// The number of stages for a Phi is a little different than other
652 /// because we assume the Phi is needed for at least 1 iteration
[all...] |
