Searched refs:phi_op (Results 1 - 5 of 5) sorted by relevance

/external/v8/src/compiler/
H A Dsimplified-lowering.cc1663 const Operator* const phi_op = local
1695 false1 = graph()->NewNode(phi_op, true2, false2, if_false1);
1699 false0 = graph()->NewNode(phi_op, true1, false1, if_false0);
1703 return graph()->NewNode(phi_op, true0, false0, merge0);
1741 const Operator* const phi_op = local
1777 false1 = graph()->NewNode(phi_op, true2, false2, if_false1);
1781 true0 = graph()->NewNode(phi_op, true1, false1, if_true0);
1798 false0 = graph()->NewNode(phi_op, true1, false1, if_false0);
1802 return graph()->NewNode(phi_op, true0, false0, merge0);
1853 const Operator* const phi_op local
[all...]
H A Dchange-lowering.cc334 const Operator* phi_op = common()->Phi(MachineRepresentation::kFloat64, 2); local
355 vtrue1 = graph()->NewNode(phi_op, vtrue2, vfalse2, if_true1);
363 Node* phi1 = graph()->NewNode(phi_op, vtrue1, vfalse1, merge1);
H A Djs-intrinsic-lowering.cc358 const Operator* const phi_op = local
398 vfalse0 = graph()->NewNode(phi_op, vtrue1, vfalse1, merge1);
408 return Change(node, phi_op, vtrue0, vfalse0, merge0);
H A Dbytecode-graph-builder.cc1957 const Operator* phi_op = common()->Phi(MachineRepresentation::kTagged, count); local
1961 return graph()->NewNode(phi_op, count + 1, buffer, true);
1967 const Operator* phi_op = common()->EffectPhi(count); local
1971 return graph()->NewNode(phi_op, count + 1, buffer, true);
H A Dast-graph-builder.cc4292 const Operator* phi_op = common()->Phi(MachineRepresentation::kTagged, count); local
4296 return graph()->NewNode(phi_op, count + 1, buffer, true);
4302 const Operator* phi_op = common()->EffectPhi(count); local
4306 return graph()->NewNode(phi_op, count + 1, buffer, true);

Completed in 164 milliseconds