Searched refs:merge0 (Results 1 – 3 of 3) sorted by relevance
/external/v8/test/unittests/compiler/ |
D | control-flow-optimizer-unittest.cc | 107 Node* merge0 = graph()->NewNode(common()->Merge(2), control1, control2); in TEST_F() local 109 cond1, cond2, merge0); in TEST_F() 110 Node* branch = graph()->NewNode(common()->Branch(), phi0, merge0); in TEST_F()
|
/external/v8/src/compiler/ |
D | js-intrinsic-lowering.cc | 401 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0); in ReduceValueOf() local 404 Node* ephi0 = graph()->NewNode(ephi_op, etrue0, efalse0, merge0); in ReduceValueOf() 408 return Change(node, phi_op, vtrue0, vfalse0, merge0); in ReduceValueOf()
|
D | simplified-lowering.cc | 1702 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0); in Int32Div() local 1703 return graph()->NewNode(phi_op, true0, false0, merge0); in Int32Div() 1801 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0); in Int32Mod() local 1802 return graph()->NewNode(phi_op, true0, false0, merge0); in Int32Mod() 1880 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0); in Uint32Mod() local 1881 return graph()->NewNode(phi_op, true0, false0, merge0); in Uint32Mod()
|