diff graal/com.oracle.graal.compiler.test/src/com/oracle/graal/compiler/test/LockEliminationTest.java @ 10807:d3a677910eea

new ValueAnchorCleanupPhase to make lock elimination work again, tests for lock elimination
author Lukas Stadler <lukas.stadler@jku.at>
date Thu, 18 Jul 2013 13:17:37 +0200
parents
children 9878214a0093
line wrap: on
line diff
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/graal/com.oracle.graal.compiler.test/src/com/oracle/graal/compiler/test/LockEliminationTest.java	Thu Jul 18 13:17:37 2013 +0200
@@ -0,0 +1,104 @@
+/*
+ * 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 java.lang.reflect.*;
+
+import org.junit.*;
+
+import com.oracle.graal.api.code.*;
+import com.oracle.graal.nodes.*;
+import com.oracle.graal.nodes.java.*;
+import com.oracle.graal.nodes.spi.Lowerable.LoweringType;
+import com.oracle.graal.phases.*;
+import com.oracle.graal.phases.common.*;
+import com.oracle.graal.phases.tiers.*;
+
+public class LockEliminationTest extends GraalCompilerTest {
+
+    static class A {
+
+        int value;
+
+        public synchronized int getValue() {
+            return value;
+        }
+    }
+
+    static int field1;
+    static int field2;
+
+    public static void testSynchronizedSnippet(A x, A y) {
+        synchronized (x) {
+            field1 = x.value;
+        }
+        synchronized (x) {
+            field2 = y.value;
+        }
+    }
+
+    @Test
+    public void testLock() {
+        test("testSynchronizedSnippet", new A(), new A());
+
+        StructuredGraph graph = getGraph("testSynchronizedSnippet");
+        new CanonicalizerPhase.Instance(runtime(), null, true).apply(graph);
+        new LockEliminationPhase().apply(graph);
+        assertEquals(1, graph.getNodes().filter(MonitorEnterNode.class).count());
+        assertEquals(1, graph.getNodes().filter(MonitorExitNode.class).count());
+    }
+
+    public static void testSynchronizedMethodSnippet(A x) {
+        int value1 = x.getValue();
+        int value2 = x.getValue();
+        field1 = value1;
+        field2 = value2;
+    }
+
+    @Test
+    public void testSynchronizedMethod() {
+        test("testSynchronizedMethodSnippet", new A());
+
+        StructuredGraph graph = getGraph("testSynchronizedMethodSnippet");
+        new CanonicalizerPhase.Instance(runtime(), null, true).apply(graph);
+        new LockEliminationPhase().apply(graph);
+        assertEquals(1, graph.getNodes().filter(MonitorEnterNode.class).count());
+        assertEquals(1, graph.getNodes().filter(MonitorExitNode.class).count());
+    }
+
+    private StructuredGraph getGraph(String snippet) {
+        Method method = getMethod(snippet);
+        StructuredGraph graph = parse(method);
+        PhasePlan phasePlan = getDefaultPhasePlan();
+        Assumptions assumptions = new Assumptions(true);
+        new CanonicalizerPhase.Instance(runtime(), assumptions, true).apply(graph);
+        new InliningPhase(runtime(), null, replacements, assumptions, null, phasePlan, OptimisticOptimizations.ALL).apply(graph);
+        new CanonicalizerPhase.Instance(runtime(), assumptions, true).apply(graph);
+        new DeadCodeEliminationPhase().apply(graph);
+        new LoweringPhase(LoweringType.BEFORE_GUARDS).apply(graph, new PhaseContext(runtime, assumptions, replacements));
+        new ValueAnchorCleanupPhase().apply(graph);
+        new LockEliminationPhase().apply(graph);
+        return graph;
+    }
+
+}