--- /dev/null 2016-05-31 09:42:47.975716356 -0700 +++ new/src/jdk.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/LoopUnswitchTest.java 2016-12-07 13:48:27.046701445 -0800 @@ -0,0 +1,144 @@ +/* + * 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 org.graalvm.compiler.core.test; + +import org.junit.Test; + +import org.graalvm.compiler.debug.Debug; +import org.graalvm.compiler.debug.Debug.Scope; +import org.graalvm.compiler.debug.DebugDumpScope; +import org.graalvm.compiler.loop.DefaultLoopPolicies; +import org.graalvm.compiler.loop.phases.LoopUnswitchingPhase; +import org.graalvm.compiler.nodes.StructuredGraph; +import org.graalvm.compiler.nodes.StructuredGraph.AllowAssumptions; +import org.graalvm.compiler.phases.common.CanonicalizerPhase; +import org.graalvm.compiler.phases.tiers.PhaseContext; + +public class LoopUnswitchTest extends GraalCompilerTest { + + public static int referenceSnippet1(int a) { + int sum = 0; + if (a > 2) { + for (int i = 0; i < 1000; i++) { + sum += 2; + } + } else { + for (int i = 0; i < 1000; i++) { + sum += a; + } + } + return sum; + } + + public static int test1Snippet(int a) { + int sum = 0; + for (int i = 0; i < 1000; i++) { + if (a > 2) { + sum += 2; + } else { + sum += a; + } + } + return sum; + } + + public static int referenceSnippet2(int a) { + int sum = 0; + switch (a) { + case 0: + for (int i = 0; i < 1000; i++) { + sum += System.currentTimeMillis(); + } + break; + case 1: + for (int i = 0; i < 1000; i++) { + sum += 1; + sum += 5; + } + break; + case 55: + for (int i = 0; i < 1000; i++) { + sum += 5; + } + break; + default: + for (int i = 0; i < 1000; i++) { + // nothing + } + break; + } + return sum; + } + + @SuppressWarnings("fallthrough") + public static int test2Snippet(int a) { + int sum = 0; + for (int i = 0; i < 1000; i++) { + switch (a) { + case 0: + sum += System.currentTimeMillis(); + break; + case 1: + sum += 1; + // fall through + case 55: + sum += 5; + break; + default: + // nothing + break; + } + } + return sum; + } + + @Test + public void test1() { + test("test1Snippet", "referenceSnippet1"); + } + + @Test + public void test2() { + test("test2Snippet", "referenceSnippet2"); + } + + @SuppressWarnings("try") + private void test(String snippet, String referenceSnippet) { + final StructuredGraph graph = parseEager(snippet, AllowAssumptions.NO); + final StructuredGraph referenceGraph = parseEager(referenceSnippet, AllowAssumptions.NO); + + new LoopUnswitchingPhase(new DefaultLoopPolicies()).apply(graph); + + // Framestates create comparison problems + graph.clearAllStateAfter(); + referenceGraph.clearAllStateAfter(); + + new CanonicalizerPhase().apply(graph, new PhaseContext(getProviders())); + new CanonicalizerPhase().apply(referenceGraph, new PhaseContext(getProviders())); + try (Scope s = Debug.scope("Test", new DebugDumpScope("Test:" + snippet))) { + assertEquals(referenceGraph, graph); + } catch (Throwable e) { + throw Debug.handle(e); + } + } +}