Lines Matching refs:Merge

207       Reduce(graph()->NewNode(common()->Merge(2), if_true, if_false));  in TEST_F()
221       Reduce(graph()->NewNode(common()->Merge(2), if_false, if_true));  in TEST_F()
241     Node* const merge = graph()->NewNode(common()->Merge(value_input_count),  in TEST_F()
287       Node* const merge = graph()->NewNode(common()->Merge(value_input_count),  in TEST_F()
330   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
350   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
368   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
386   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
404   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
422   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
446   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()