| /external/v8/src/compiler/ |
| effect-control-linearizer.cc | 54 // Update all inputs to an effect phi with the effects from the given
151 // There should be at most one effect phi in a block.
159 // In case of loops, we do not update the effect phi immediately
161 // record the effect phi for later processing.
177 // There was no effect phi.
203 // to create an effect phi node.
210 // Let us update the effect phi node later.
579 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
600 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
639 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2) local
665 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), local
[all...] |
| wasm-compiler.cc | 218 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 1),
221 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 1),
317 bool WasmGraphBuilder::IsPhiWithMerge(Node* phi, Node* merge) {
318 return phi && IrOpcode::IsPhiOpcode(phi->opcode()) &&
319 NodeProperties::GetControlInput(phi) == merge;
330 void WasmGraphBuilder::AppendToPhi(Node* phi, Node* from) {
331 DCHECK(IrOpcode::IsPhiOpcode(phi->opcode()));
332 int new_size = phi->InputCount();
333 phi->InsertInput(jsgraph()->zone(), phi->InputCount() - 1, from)
1998 Node* phi = graph()->NewNode(common->Phi(MachineRepresentation::kTagged, 2), local
2221 Node* phi = graph()->NewNode(common->Phi(MachineRepresentation::kFloat64, 2), local
[all...] |
| int64-lowering.cc | 60 // To break cycles with phi nodes we push phis on a separate stack so
659 lt32.Phi(MachineRepresentation::kWord32, GetReplacementLow(input),
662 lt32.Phi(MachineRepresentation::kWord32, GetReplacementHigh(input),
692 Node* low_node = d.Phi(
711 d.Phi(MachineRepresentation::kWord32,
819 void Int64Lowering::PreparePhiReplacement(Node* phi) {
820 MachineRepresentation rep = PhiRepresentationOf(phi->op());
[all...] |
| simplified-lowering.cc | 466 // Recompute the phi representation based on the new type.
829 // Infer representation for phi-like nodes.
886 // Convert inputs to the output representation of this phi, pass the
[all...] |
| raw-machine-assembler.h | 719 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2) {
720 return AddNode(common()->Phi(rep, 2), n1, n2, graph()->start());
722 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3) {
723 return AddNode(common()->Phi(rep, 3), n1, n2, n3, graph()->start());
725 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3, Node* n4) {
726 return AddNode(common()->Phi(rep, 4), n1, n2, n3, n4, graph()->start());
728 Node* Phi(MachineRepresentation rep, int input_count, Node* const* inputs);
729 void AppendPhiInput(Node* phi, Node* new_input);
|
| common-operator.h | 202 const Operator* Phi(MachineRepresentation representation,
218 // Constructs a new merge or phi operator with the same opcode as {op}, but
|
| js-intrinsic-lowering.cc | 213 // Turn the {node} into a Phi.
214 return Change(node, common()->Phi(MachineRepresentation::kTagged, 2), vtrue,
240 common()->Phi(MachineRepresentation::kTagged, 2);
288 // Turn the {node} into a Phi.
|
| memory-optimizer.cc | 208 common()->Phi(MachineType::PointerRepresentation(), 2), vtrue, vfalse,
283 value = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
417 // TODO(bmeurer): We could potentially just create a Phi here to merge
|
| loop-peeling.cc | 66 // | Merge <------phi
249 if (input != inputs[0]) { // Non-redundant phi.
252 Node* phi = graph->NewNode(op, backedges + 1, &inputs[0]); local
253 node->ReplaceInput(0, phi);
314 Node* phi = local
315 graph->NewNode(common->Phi(MachineRepresentation::kTagged, 2), node,
317 for (Edge edge : value_edges) edge.UpdateTo(phi);
|
| /external/v8/test/unittests/compiler/ |
| dead-code-elimination-unittest.cc | 193 Node* const phi = graph()->NewNode( local
194 common()->Phi(MachineRepresentation::kTagged, 2), v0, v1, merge);
197 EXPECT_CALL(editor, Replace(phi, v0));
220 Node* const phi = graph()->NewNode( local
221 common()->Phi(MachineRepresentation::kTagged, 4), v0, v1, v2, v3, merge);
225 EXPECT_CALL(editor, Revisit(phi));
230 EXPECT_THAT(phi,
278 Node* const phi = graph()->NewNode( local
279 common()->Phi(MachineRepresentation::kTagged, 2), v0, v1, loop);
283 EXPECT_CALL(editor, Replace(phi, v0))
307 Node* const phi = graph()->NewNode( local
[all...] |
| instruction-sequence-unittest.h | 25 VReg(PhiInstruction* phi) : value_(phi->virtual_register()) {} // NOLINT
145 PhiInstruction* Phi(VReg incoming_vreg_0 = VReg(),
149 PhiInstruction* Phi(VReg incoming_vreg_0, size_t input_count);
150 void SetInput(PhiInstruction* phi, size_t input, VReg vreg);
|
| control-flow-optimizer-unittest.cc | 108 Node* phi0 = graph()->NewNode(common()->Phi(MachineRepresentation::kBit, 2),
|
| diamond-unittest.cc | 121 Node* phi = d.Phi(types[i], p1, p2); local
127 EXPECT_THAT(phi, IsPhi(types[i], p1, p2, d.merge));
|
| loop-peeling-unittest.cc | 47 Node* phi; member in struct:v8::internal::compiler::Counter
122 return graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), a,
137 Node* phi = graph()->NewNode( local
138 common()->Phi(MachineRepresentation::kTagged, 2), base, base, w->loop);
139 Node* add = graph()->NewNode(machine()->Int32Add(), phi, inc);
140 phi->ReplaceInput(1, add);
141 return {base, inc, phi, add};
170 Node* r = InsertReturn(c.phi, start(), w.exit);
187 r, IsReturn(IsPhi(MachineRepresentation::kTagged, c.phi, c.base,
200 Node* r = InsertReturn(c.phi, start(), outer.exit)
274 Node* phi = NewPhi(&outer, Int32Constant(11), c.phi); local
351 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 3), local
399 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 3), local
[all...] |
| instruction-sequence-unittest.cc | 164 PhiInstruction* InstructionSequenceTest::Phi(VReg incoming_vreg_0,
175 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count); local
177 SetInput(phi, i, inputs[i]);
179 current_block_->AddPhi(phi);
180 return phi;
184 PhiInstruction* InstructionSequenceTest::Phi(VReg incoming_vreg_0,
186 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count); local
187 SetInput(phi, 0, incoming_vreg_0);
188 current_block_->AddPhi(phi);
189 return phi;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| 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...] |
| GVN.cpp | [all...] |
| 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...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | 367 /// \brief The Loop exit block may have single value PHI nodes where the
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 489 std::vector<til::Phi*> CurrentArguments;
491 std::vector<til::Phi*> IncompleteArgs;
|
| ThreadSafetyTIL.h | [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/v8/src/wasm/ |
| ast-decoder.cc | 764 TFNode* phi = builder_->Phi(tval.type, 2, vals, merge); local
765 Push(tval.type, phi);
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 80 // if there are no PHI nodes.
89 // Resolve any PHI nodes at the start of the block. They are all
99 // Make all PHI nodes that referred to BB now refer to Pred as their
289 // PHI nodes. Insert associations now.
350 // Loop over all of the PHI nodes in the block, changing them to use
368 // Add phi entries for newly created values to all exit blocks.
374 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) {
375 Value *Incoming = phi->getIncomingValueForBlock(*BB);
379 phi->addIncoming(Incoming, New);
399 // Loop over the PHI nodes in the original block, setting incoming values
[all...] |
| /external/v8/tools/turbolizer/ |
| graph-layout.js | 304 if (n.opcode == 'Phi' || n.opcode == 'EffectPhi') {
349 if (n.opcode != "Start" && n.opcode != "Phi" && n.opcode != "EffectPhi") {
|
