Mercurial > hg > graal-compiler
view graal/com.oracle.graal.compiler.test/src/com/oracle/graal/compiler/test/ea/PartialEscapeAnalysisTest.java @ 20069:2dbfa1ed5efa
Reduce usages of fixed node probability cache.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Mon, 30 Mar 2015 00:54:07 +0200 |
parents | 2fd45bb25118 |
children | 33be8eb8cbd5 |
line wrap: on
line source
/* * Copyright (c) 2011, 2012, 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.ea; import java.lang.ref.*; import org.junit.*; import com.oracle.graal.compiler.test.*; import com.oracle.graal.graph.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.cfg.*; import com.oracle.graal.nodes.java.*; import com.oracle.graal.nodes.virtual.*; import com.oracle.graal.phases.common.*; /** * The PartialEscapeAnalysisPhase is expected to remove all allocations and return the correct * values. */ public class PartialEscapeAnalysisTest extends EATestBase { public static class TestObject { public int x; public int y; public TestObject(int x, int y) { this.x = x; this.y = y; } } public static class TestObject2 { public Object x; public Object y; public TestObject2(Object x, Object y) { this.x = x; this.y = y; } } @Test public void test1() { testPartialEscapeAnalysis("test1Snippet", 0.25, 1); } @SuppressWarnings("all") public static Object test1Snippet(int a, int b, Object x, Object y) { TestObject2 obj = new TestObject2(x, y); if (a < 0) { if (b < 0) { return obj; } else { return obj.y; } } else { return obj.x; } } @Test public void test2() { testPartialEscapeAnalysis("test2Snippet", 1.5, 3, LoadIndexedNode.class); } public static Object test2Snippet(int a, Object x, Object y, Object z) { TestObject2 obj = new TestObject2(x, y); obj.x = new TestObject2(obj, z); if (a < 0) { ((TestObject2) obj.x).y = null; obj.y = null; return obj; } else { ((TestObject2) obj.x).y = Integer.class; ((TestObject2) obj.x).x = null; return obj.x; } } @Test public void test3() { testPartialEscapeAnalysis("test3Snippet", 0.5, 1, StoreFieldNode.class, LoadFieldNode.class); } public static Object test3Snippet(int a) { if (a < 0) { TestObject obj = new TestObject(1, 2); obj.x = 123; obj.y = 234; obj.x = 123111; obj.y = new Integer(123).intValue(); return obj; } else { return null; } } @Test @Ignore public void testCache() { testPartialEscapeAnalysis("testCacheSnippet", 0.75, 1); } public static class CacheKey { private final int idx; private final Object ref; public CacheKey(int idx, Object ref) { this.idx = idx; this.ref = ref; } @Override public int hashCode() { return 31 * idx + ref.hashCode(); } public synchronized boolean equals(CacheKey other) { return idx == other.idx && ref == other.ref; } } public static CacheKey cacheKey = null; public static Object value = null; private static native Object createValue(CacheKey key); public static Object testCacheSnippet(int idx, Object ref) { CacheKey key = new CacheKey(idx, ref); if (!key.equals(cacheKey)) { cacheKey = key; value = createValue(key); } return value; } public static int testReference1Snippet(Object a) { SoftReference<Object> softReference = new SoftReference<>(a); if (softReference.get().hashCode() == 0) { return 1; } else { return 2; } } @Test public void testReference1() { prepareGraph("testReference1Snippet", false); assertDeepEquals(1, graph.getNodes().filter(NewInstanceNode.class).count()); } @SafeVarargs protected final void testPartialEscapeAnalysis(final String snippet, double expectedProbability, int expectedCount, Class<? extends Node>... invalidNodeClasses) { prepareGraph(snippet, false); for (AbstractMergeNode merge : graph.getNodes(AbstractMergeNode.TYPE)) { merge.setStateAfter(null); } new DeadCodeEliminationPhase().apply(graph); new CanonicalizerPhase().apply(graph, context); try { Assert.assertTrue("partial escape analysis should have removed all NewInstanceNode allocations", graph.getNodes().filter(NewInstanceNode.class).isEmpty()); Assert.assertTrue("partial escape analysis should have removed all NewArrayNode allocations", graph.getNodes().filter(NewArrayNode.class).isEmpty()); ControlFlowGraph cfg = ControlFlowGraph.compute(graph, true, true, false, false); double probabilitySum = 0; int materializeCount = 0; for (CommitAllocationNode materialize : graph.getNodes().filter(CommitAllocationNode.class)) { probabilitySum += cfg.blockFor(materialize).probability() * materialize.getVirtualObjects().size(); materializeCount += materialize.getVirtualObjects().size(); } Assert.assertEquals("unexpected number of MaterializeObjectNodes", expectedCount, materializeCount); Assert.assertEquals("unexpected probability of MaterializeObjectNodes", expectedProbability, probabilitySum, 0.01); for (Node node : graph.getNodes()) { for (Class<? extends Node> clazz : invalidNodeClasses) { Assert.assertFalse("instance of invalid class: " + clazz.getSimpleName(), clazz.isInstance(node) && node.usages().isNotEmpty()); } } } catch (AssertionError e) { TypeSystemTest.outputGraph(graph, snippet + ": " + e.getMessage()); throw e; } } }