| /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 | 310 Node* RawMachineAssembler::Phi(MachineRepresentation rep, int input_count,
316 return AddNode(common()->Phi(rep, input_count), input_count + 1, buffer);
319 void RawMachineAssembler::AppendPhiInput(Node* phi, Node* new_input) {
320 const Operator* op = phi->op();
321 const Operator* new_op = common()->ResizeMergeOrPhi(op, phi->InputCount());
322 phi->InsertInput(zone(), phi->InputCount() - 1, new_input);
323 NodeProperties::ChangeOp(phi, new_op);
|
| common-operator.cc | 692 "Phi", // name
[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...] |
| /external/swiftshader/third_party/subzero/src/ |
| IcePhiLoweringImpl.h | 1 //===------ subzero/src/IcePhiLoweringImpl.h - Phi lowering -----*- C++ -*-===//
27 /// Turn an i64 Phi instruction into a pair of i32 Phi instructions, to preserve
35 auto *Phi = llvm::dyn_cast<InstPhi>(&I);
36 if (Phi->isDeleted())
38 Variable *Dest = Phi->getDest();
43 auto *PhiLo = InstPhi::create(Func, Phi->getSrcSize(), DestLo);
44 auto *PhiHi = InstPhi::create(Func, Phi->getSrcSize(), DestHi);
45 for (SizeT I = 0; I < Phi->getSrcSize(); ++I) {
46 Operand *Src = Phi->getSrc(I)
[all...] |
| IceCfgNode.cpp | 29 // Adds an instruction to either the Phi list or the regular instruction list.
43 if (auto *Phi = llvm::dyn_cast<InstPhi>(Instr)) {
45 Func->setError("Phi instruction added to the middle of a block");
48 Phis.push_back(Phi);
61 auto &Phi = llvm::cast<InstPhi>(Inst);
62 for (SizeT i = 0; i < Phi.getSrcSize(); ++i) {
63 if (Phi.getLabel(i) == Old) {
64 Phi.setLabel(i, New);
107 // Ensure each Phi instruction in the node is consistent with respect to control
108 // flow. For each predecessor, there must be a phi argument with that label
[all...] |
| IceInst.h | 31 // ordering of Phi and non-Phi instructions, etc. Most of the validity checking
60 Phi,
344 /// lowering. E.g., if Phi instruction lowering happens before target lowering,
658 /// Phi instruction. For incoming edge I, the node is Labels[I] and the Phi
679 static bool classof(const Inst *Instr) { return Instr->getKind() == Phi; }
686 /// but the Phi instruction is created before InEdges[] is available, so it's
[all...] |
| WasmTranslator.cpp | 327 Node Phi(wasm::LocalType, uint32_t Count, Node *Vals, Node Control) {
328 LOG(out << "Phi(" << Count << ", " << Control);
345 auto *Phi = InstPhi::create(Func, Count * 200, Dest);
349 Phi->addArgument(Op, InEdges[i]);
351 setDefiningInst(Dest, Phi);
352 Control.toCfgNode()->appendInst(Phi);
934 bool IsPhiWithMerge(Node Phi, Node Merge) const {
935 LOG(out << "IsPhiWithMerge(" << Phi << ", " << Merge << ")"
937 if (Phi && Phi.isOperand())
[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
|
| /frameworks/native/services/sensorservice/ |
| Fusion.h | 82 mat<mat33_t, 2, 2> Phi;
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| hlo_dataflow_analysis.cc | 152 bool HloDataflowAnalysis::Phi(
156 VLOG(4) << "Phi(" << instruction->name() << ")";
171 // Positions with phi values should never have more than one value in the
194 // Remove the existing phi value (if it exists). The phi can be its own
219 // Only a single value reaches this point. There should be no phi, and
228 // Remove the existing phi.
236 // Multiple distinct values reach this point. A phi value is
371 // A phi-node is not defined for a kConditional instruction even though it
373 // a phi-node only for kWhile to account for the dataflow through back-edge
[all...] |
| /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...] |
