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

/external/v8/test/unittests/compiler/
H A Dbranch-elimination-unittest.cc132 Node* merge1 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); local
135 Int32Constant(1), Int32Constant(2), merge1);
137 Node* branch2 = graph()->NewNode(common()->Branch(), condition, merge1);
143 Int32Constant(3), Int32Constant(4), merge1);
156 EXPECT_THAT(branch2, IsBranch(condition, merge1));
H A Dcontrol-equivalence-unittest.cc116 Node* merge1 = Merge1(start); local
117 ComputeEquivalence(merge1);
119 ASSERT_EQUIVALENCE(start, merge1);
H A Deffect-control-linearizer-unittest.cc199 Node* merge1 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); local
238 schedule.AddNode(m1block, merge1);
260 ASSERT_THAT(branch2, IsBranch(const0, merge1));
/external/v8/src/compiler/
H A Djs-intrinsic-lowering.cc277 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1); local
278 efalse0 = graph()->NewNode(ephi_op, etrue1, efalse1, merge1);
279 vfalse0 = graph()->NewNode(phi_op, vtrue1, vfalse1, merge1);
H A Dwasm-compiler.cc2174 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1); local
2175 Node* ephi1 = graph()->NewNode(ephi_op, etrue1, efalse1, merge1);
2176 Node* phi1 = graph()->NewNode(phi_op, vtrue1, vfalse1, merge1);
2185 use->ReplaceUses(merge1);

Completed in 365 milliseconds