HomeSort by relevance Sort by last modified time
    Searched defs:Phi (Results 1 - 24 of 24) sorted by null

  /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);
common-operator.cc 368 "Phi", // name
682 const Operator* CommonOperatorBuilder::Phi(MachineRepresentation rep,
695 "Phi", // name
852 return Phi(PhiRepresentationOf(op), size);
raw-machine-assembler.h 624 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2) {
625 return AddNode(common()->Phi(rep, 2), n1, n2);
627 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3) {
628 return AddNode(common()->Phi(rep, 3), n1, n2, n3);
630 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3, Node* n4) {
631 return AddNode(common()->Phi(rep, 4), n1, n2, n3, n4);
wasm-compiler.cc 314 bool WasmGraphBuilder::IsPhiWithMerge(Node* phi, Node* merge) {
315 return phi && IrOpcode::IsPhiOpcode(phi->opcode()) &&
316 NodeProperties::GetControlInput(phi) == merge;
329 void WasmGraphBuilder::AppendToPhi(Node* merge, Node* phi, Node* from) {
330 DCHECK(IrOpcode::IsPhiOpcode(phi->opcode()));
332 int new_size = phi->InputCount();
333 phi->InsertInput(jsgraph()->zone(), phi->InputCount() - 1, from);
335 phi, jsgraph()->common()->ResizeMergeOrPhi(phi->op(), new_size))
    [all...]
  /external/llvm/lib/Transforms/Scalar/
PartiallyInlineLibCalls.cpp 126 // dst = phi(v0, v1)
130 // Create phi and replace all uses.
133 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2);
134 Call->replaceAllUsesWith(Phi);
153 // Add phi operands.
154 Phi->addIncoming(Call, &CurrBB);
155 Phi->addIncoming(LibCall, LibCallBB);
LoopIdiomRecognize.cpp 752 /// 2) \p CntPhi is set to the corresponding phi node.
761 /// x1 = phi (x0, x2);
762 /// cnt1 = phi(cnt0, cnt2);
845 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0));
846 if (!Phi || Phi->getParent() != LoopEntry)
    [all...]
StructurizeCFG.cpp 142 /// The condition for the optional "Else" region is expressed as a PHI node.
143 /// The incomming values of the PHI node are true for the "If" edge and false
161 /// consist of a network of PHI nodes where the true incoming values expresses
557 /// \brief Remove all PHI values coming from "From" into "To" and remember
564 PHINode &Phi = cast<PHINode>(*I++);
565 while (Phi.getBasicBlockIndex(From) != -1) {
566 Value *Deleted = Phi.removeIncomingValue(From, false);
567 Map[&Phi].push_back(std::make_pair(From, Deleted));
572 /// \brief Add a dummy PHI value as soon as we knew the new predecessor
577 PHINode &Phi = cast<PHINode>(*I++)
    [all...]
IndVarSimplify.cpp 216 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
220 PHINode *PHI = dyn_cast<PHINode>(User);
221 if (!PHI)
225 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
226 if (PHI->getIncomingValue(i) != Def)
229 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
237 assert(InsertPt && "Missing phi operand");
296 // If this is not an add of the PHI with a constantfp, or if the constant fp
500 // Collect information about PHI nodes which can be transformed in
551 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Sca
    [all...]
GVN.cpp     [all...]
RewriteStatepointsForGC.cpp 375 // inlining could possibly introduce phi node that contains
408 // A PHI or Select is a base defining value. The outer findBasePointer
417 /// (i.e. a PHI or Select of two derived pointers), or c) involves a change
435 // inlining could possibly introduce phi node that contains
535 // it's analogous to the phi and select case even though it's not a merge.
587 // This is a previously inserted base phi or select. We know
727 // pointer or a PHI which obscures the base pointer.
728 // - Construct a mapping from PHI to unknown TOP state. Use an
736 // - For every conflict, insert a dummy PHI node without arguments. Add
782 if (PHINode *Phi = dyn_cast<PHINode>(Current))
989 PHINode *phi = cast<PHINode>(BDV); local
    [all...]
  /frameworks/native/services/sensorservice/
Fusion.h 82 mat<mat33_t, 2, 2> Phi;
  /external/v8/test/unittests/compiler/
instruction-sequence-unittest.cc 162 PhiInstruction* InstructionSequenceTest::Phi(VReg incoming_vreg_0,
173 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count); local
175 SetInput(phi, i, inputs[i]);
177 current_block_->AddPhi(phi);
178 return phi;
182 PhiInstruction* InstructionSequenceTest::Phi(VReg incoming_vreg_0,
184 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count); local
185 SetInput(phi, 0, incoming_vreg_0);
186 current_block_->AddPhi(phi);
187 return phi;
    [all...]
  /external/llvm/lib/Target/AMDGPU/
SIAnnotateControlFlow.cpp 78 bool isElse(PHINode *Phi);
80 void eraseIfUnused(PHINode *Phi);
170 /// \brief Can the condition represented by this PHI node treated like
172 bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
173 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
174 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
175 if (Phi->getIncomingBlock(i) == IDom) {
177 if (Phi->getIncomingValue(i) != BoolTrue)
181 if (Phi->getIncomingValue(i) != BoolFalse)
189 // \brief Erase "Phi" if it is not used any mor
    [all...]
  /external/v8/test/cctest/compiler/
test-osr.cc 94 return graph.NewNode(common.Phi(MachineRepresentation::kTagged, count),
316 Node* Phi(Node* i1, Node* i2, Node* i3) {
318 return t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 2),
321 return t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 3),
344 Node* outer_phi = outer.Phi(T.p0, T.p0, nullptr);
347 Node* osr_phi = inner.Phi(T.jsgraph.TrueConstant(), T.osr_values[0],
403 Node* outer_phi = outer.Phi(T.p0, T.p0, T.p0);
406 Node* osr_phi = inner.Phi(T.jsgraph.TrueConstant(), T.osr_values[0],
478 Node* phi = jsgraph->graph()->NewNode( local
479 jsgraph->common()->Phi(MachineRepresentation::kWord32, count), count + 1
    [all...]
test-loop-analysis.cc 74 Node* Phi(Node* a) {
78 Node* Phi(Node* a, Node* b) {
82 Node* Phi(Node* a, Node* b, Node* c) {
86 Node* Phi(Node* a, Node* b, Node* c, Node* d) {
115 : common.Phi(MachineRepresentation::kTagged, count);
212 Node* phi; member in struct:v8::internal::compiler::Counter
223 phi = w.t.graph.NewNode(w.t.op(2, false), base, base, w.loop);
224 add = w.t.graph.NewNode(&kIntAdd, phi, inc);
225 phi->ReplaceInput(1, add);
233 Node* phi; member in struct:v8::internal::compiler::StoreLoop
270 Node* phi = t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 2), local
692 Node* phi = t.graph.NewNode( local
931 Node* phi = t.graph.NewNode(t.common.Phi(MachineRepresentation::kWord32, 2), local
967 Node* phi = t.graph.NewNode(t.common.Phi(MachineRepresentation::kWord32, 2), local
    [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
407 MachineInstr *Phi = &*I;
409 // Have a PHI instruction. Get the operand that corresponds to the
411 // where the "reg" is defined by the PHI node we are looking at
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
DataFlowSanitizer.cpp     [all...]
  /external/llvm/lib/CodeGen/
CodeGenPrepare.cpp 232 // Eliminate blocks that contain only PHI nodes and an
351 /// Eliminate blocks that contain only PHI nodes, debug info directives, and an
366 // If the instruction before the branch (skipping debug info) isn't a phi
395 /// unconditional branch between them, and BB contains no other non-phi
399 // We only want to eliminate blocks whose phi nodes are used by phi nodes in
423 // If BB and DestBB contain any common predecessors, then the phi nodes in BB
432 // It is faster to get preds from a PHI than with pred_iterator.
448 // If V2 is a phi node in BB, look up what the mapped value will be.
463 /// Eliminate a basic block that has only phi's and an unconditional branch i
    [all...]
  /external/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp 61 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(2),
62 cl::desc("Control the amount of phi node folding to perform (default = 2)"));
106 // The first field contains the phi node that generates a result of the switch
108 // switch for that PHI.
164 // successor, and if that successor has a PHI node, and if *that* PHI node has
185 /// store all PHI nodes in common successors.
193 // We fold the unconditional branch if we can easily update all PHI nodes in
222 /// Update PHI nodes in Succ to indicate that there will now be entries in it
223 /// from the 'NewPred' block. The values that will be flowing into the PHI node
    [all...]
  /external/clang/lib/CodeGen/
MicrosoftCXXABI.cpp     [all...]
  /external/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 367 /// \brief The Loop exit block may have single value PHI nodes where the
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
d3d8types.h     [all...]
d3d9types.h     [all...]

Completed in 416 milliseconds