Mercurial > hg > graal-compiler
view graal/com.oracle.max.graal.tests/src/com/oracle/max/graal/compiler/tests/BoxingEliminationTest.java @ 4411:cd2b68ef8e23
cleanup around filter and predicates :
remove duplicate compiler.util.NodeIterators
add contains to NodeIterable
support isNotA(Class).nor(Class) filtering
support filtering on interfaces
remove and/or(Class) from FilteredNodeIterable replace with isA(Class).or(Class)
lower the cost on extending NodeIterable (remove the until field)
NodeList is a NodeIterable
Use NodeIterable functions where possible
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Mon, 30 Jan 2012 13:06:11 +0100 |
parents | 4df4499e0289 |
children | c8de52cc672a |
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.max.graal.compiler.tests; import static com.oracle.max.graal.graph.iterators.NodePredicates.*; import java.util.*; import org.junit.*; import com.oracle.max.graal.compiler.phases.*; import com.oracle.max.graal.compiler.phases.PhasePlan.PhasePosition; import com.oracle.max.graal.graph.*; import com.oracle.max.graal.nodes.*; import com.oracle.max.graal.nodes.extended.*; /** * In the following tests, the usages of local variable "a" are replaced with the integer constant 0. * Then boxing elimination 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 BoxingEliminationTest extends GraphTest { private static final String REFERENCE_SNIPPET = "referenceSnippet"; @SuppressWarnings("all") public static int referenceSnippet(int a) { return 1; } public static Integer boxedInteger() { return 1; } public static Object boxedObject() { return 1; } @Test public void test1() { test("test1Snippet"); } @SuppressWarnings("all") public static int test1Snippet(int a) { return boxedInteger(); } @Test public void test2() { test("test2Snippet"); } @SuppressWarnings("all") public static int test2Snippet(int a) { return (Integer) boxedObject(); } @Test public void test3() { test("test3Snippet"); } @SuppressWarnings("all") public static int test3Snippet(int a) { int b = boxedInteger(); if (b < 0) { b = boxedInteger(); } return b; } private void test(String snippet) { StructuredGraph graph = parse(snippet); BoxingMethodPool pool = new BoxingMethodPool(runtime()); IdentifyBoxingPhase identifyBoxingPhase = new IdentifyBoxingPhase(pool); PhasePlan phasePlan = getDefaultPhasePlan(); phasePlan.addPhase(PhasePosition.AFTER_PARSING, identifyBoxingPhase); identifyBoxingPhase.apply(graph); 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); } Collection<Invoke> hints = new ArrayList<>(); for (Invoke invoke : graph.getInvokes()) { hints.add(invoke); } new InliningPhase(null, runtime(), hints, null, phasePlan).apply(graph); new CanonicalizerPhase(null, runtime(), null).apply(graph); print(graph); new BoxingEliminationPhase().apply(graph); print(graph); new ExpandBoxingNodesPhase(pool).apply(graph); new CanonicalizerPhase(null, runtime(), null).apply(graph); new DeadCodeEliminationPhase().apply(graph); StructuredGraph referenceGraph = parse(REFERENCE_SNIPPET); assertEquals(referenceGraph, graph); } }