| /external/v8/src/compiler/ |
| diamond.h | 52 Node* Phi(MachineRepresentation rep, Node* tv, Node* fv) {
53 return graph->NewNode(common->Phi(rep, 2), tv, fv, merge);
|
| raw-machine-assembler.cc | 555 Node* RawMachineAssembler::Phi(MachineRepresentation rep, int input_count,
561 return AddNode(common()->Phi(rep, input_count), input_count + 1, buffer);
564 void RawMachineAssembler::AppendPhiInput(Node* phi, Node* new_input) {
565 const Operator* op = phi->op();
566 const Operator* new_op = common()->ResizeMergeOrPhi(op, phi->InputCount());
567 phi->InsertInput(zone(), phi->InputCount() - 1, new_input);
568 NodeProperties::ChangeOp(phi, new_op);
|
| common-operator.cc | 537 "Phi", // name
[all...] |
| raw-machine-assembler.h | 794 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2) {
795 return AddNode(common()->Phi(rep, 2), n1, n2, graph()->start());
797 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3) {
798 return AddNode(common()->Phi(rep, 3), n1, n2, n3, graph()->start());
800 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3, Node* n4) {
801 return AddNode(common()->Phi(rep, 4), n1, n2, n3, n4, graph()->start());
803 Node* Phi(MachineRepresentation rep, int input_count, Node* const* inputs);
804 void AppendPhiInput(Node* phi, Node* new_input);
[all...] |
| wasm-compiler.cc | 259 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 1),
262 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 1),
341 bool WasmGraphBuilder::IsPhiWithMerge(Node* phi, Node* merge) {
342 return phi && IrOpcode::IsPhiOpcode(phi->opcode()) &&
343 NodeProperties::GetControlInput(phi) == merge;
367 void WasmGraphBuilder::AppendToPhi(Node* phi, Node* from) {
368 DCHECK(IrOpcode::IsPhiOpcode(phi->opcode()));
369 int new_size = phi->InputCount();
370 phi->InsertInput(jsgraph()->zone(), phi->InputCount() - 1, from)
2272 Node* phi = graph()->NewNode(common->Phi(MachineRepresentation::kTagged, 2), local
2491 Node* phi = graph()->NewNode(common->Phi(MachineRepresentation::kFloat64, 2), local
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| PartiallyInlineLibCalls.cpp | 48 // dst = phi(v0, v1)
52 // Create phi and replace all uses.
55 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2);
56 Call->replaceAllUsesWith(Phi);
75 // Add phi operands.
76 Phi->addIncoming(Call, &CurrBB);
77 Phi->addIncoming(LibCall, LibCallBB);
|
| LoopIdiomRecognize.cpp | [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...] |
| GVN.cpp | [all...] |
| 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...] |
| RewriteStatepointsForGC.cpp | 368 // A PHI or Select is a base defining value. The outer findBasePointer
377 /// (i.e. a PHI or Select of two derived pointers), or c) involves a change
399 // "phi (const1, const2)" or "phi (const, regular gc ptr)".
483 // it's analogous to the phi and select case even though it's not a merge.
535 // This is a previously inserted base phi or select. We know
656 // pointer or a PHI which obscures the base pointer.
657 // - Construct a mapping from PHI to unknown TOP state. Use an
665 // - For every conflict, insert a dummy PHI node without arguments. Add
737 // Return a phi state for a base defining value. We'll generate a ne
[all...] |
| /prebuilts/go/darwin-x86/src/math/ |
| const.go | 12 Phi = 1.61803398874989484820458683436563811772030917980576286213544862 // http://oeis.org/A001622
|
| /prebuilts/go/linux-x86/src/math/ |
| const.go | 12 Phi = 1.61803398874989484820458683436563811772030917980576286213544862 // http://oeis.org/A001622
|
| /frameworks/native/services/sensorservice/ |
| Fusion.h | 82 mat<mat33_t, 2, 2> Phi;
|
| /external/llvm/lib/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 80 bool isElse(PHINode *Phi);
82 void eraseIfUnused(PHINode *Phi);
189 /// \brief Can the condition represented by this PHI node treated like
191 bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
192 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
193 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
194 if (Phi->getIncomingBlock(i) == IDom) {
196 if (Phi->getIncomingValue(i) != BoolTrue)
200 if (Phi->getIncomingValue(i) != BoolFalse)
208 // \brief Erase "Phi" if it is not used any mor
[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...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | 151 /// R = phi ..., [ R.next, LatchBlock ]
215 /// \brief Return true if the Phi may generate a value that may underflow,
217 bool phiMayWrapOrUnderflow(MachineInstr *Phi, const MachineOperand *EndVal,
253 /// The desired flow is: phi ---> bump -+-> comparison-in-latch.
255 /// +-> back to phi
260 /// phi -+-> bump ---> back to phi
409 MachineInstr *Phi = &*I;
411 // Have a PHI instruction. Get the operand that corresponds to the
413 // where the "reg" is defined by the PHI node we are looking at
[all...] |
| RDFGraph.h | 115 // p3: phi [d4<r0>(,d12,u9):]
116 // p5: phi [d6<r1>(,,u10):]
123 // kind of the node (i.e. f - function, b - basic block, p - phi, s - state-
159 // - Phi: Phi node, members are reference nodes.
161 // - Block: Basic block, members are instruction nodes (i.e. Phi or Stmt).
241 Phi = 0x0003 << 2, // 011
278 return KB == Phi || KB == Stmt;
279 case Phi:
443 NodeId PredB; // Id of the predecessor block for a phi use
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| DataFlowSanitizer.cpp | 824 // We will not necessarily be able to compute the shadow for every phi nod
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| GVN.cpp | [all...] |
| 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/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 44 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1),
45 cl::desc("Control the amount of phi node folding to perform (default = 1)"));
88 // successor, and if that successor has a PHI node, and if *that* PHI node has
107 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
109 /// flowing into the PHI nodes will be the same as those coming in from
123 /// least one PHI node in it), check to see if the merge at this block is due
587 // Remove PHI node entries for the dead edge.
640 // Remove PHI node entries for dead edges.
773 // sure we update the number of entries in the PHI nodes for thes
[all...] |
| /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...] |
