Mercurial > hg > graal-compiler
view graal/com.oracle.graal.compiler.test/src/com/oracle/graal/compiler/test/IfCanonicalizerTest.java @ 8125:0026a2e70695
Merge fixes.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Tue, 05 Mar 2013 23:58:57 +0100 |
parents | 961ad124cb21 |
children | 6d376d09880b |
line wrap: on
line source
/* * Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.graal.compiler.test; import static com.oracle.graal.graph.iterators.NodePredicates.*; import org.junit.*; import com.oracle.graal.api.code.*; import com.oracle.graal.debug.*; import com.oracle.graal.graph.*; import com.oracle.graal.nodes.*; import com.oracle.graal.phases.common.*; /** * In the following tests, the usages of local variable "a" are replaced with the integer constant * 0. Then canonicalization is applied and it is verified that the resulting graph is equal to the * graph of the method that just has a "return 1" statement in it. */ public class IfCanonicalizerTest extends GraalCompilerTest { private static final String REFERENCE_SNIPPET = "referenceSnippet"; @SuppressWarnings("all") public static int referenceSnippet(int a) { return 1; } @Test public void test1() { test("test1Snippet"); } @SuppressWarnings("all") public static int test1Snippet(int a) { if (a == 0) { return 1; } else { return 2; } } @Test public void test2() { test("test2Snippet"); } @SuppressWarnings("all") public static int test2Snippet(int a) { if (a == 0) { if (a == 0) { if (a == 0) { return 1; } } } else { return 2; } return 3; } @Test public void test3() { test("test3Snippet"); } @SuppressWarnings("all") public static int test3Snippet(int a) { if (a == 0) { if (a != 1) { if (a == 1) { return 3; } else { if (a >= 0) { if (a <= 0) { if (a > -1) { if (a < 1) { return 1; } } } } } } } else { return 2; } return 3; } @Test public void test4() { test("test4Snippet"); } public static int test4Snippet(int a) { if (a == 0) { return 1; } return 1; } @Test public void test5() { test("test5Snippet"); } public static int test5Snippet(int a) { int val = 2; if (a == 0) { val = 1; } if (a * (3 + val) == 0) { return 1; } return 1; } private void test(String snippet) { StructuredGraph graph = parse(snippet); LocalNode local = graph.getNodes(LocalNode.class).iterator().next(); ConstantNode constant = ConstantNode.forInt(0, graph); for (Node n : local.usages().filter(isNotA(FrameState.class)).snapshot()) { n.replaceFirstInput(local, constant); } Debug.dump(graph, "Graph"); new CanonicalizerPhase(runtime(), new Assumptions(false)).apply(graph); StructuredGraph referenceGraph = parse(REFERENCE_SNIPPET); assertEquals(referenceGraph, graph); } }