/*
* 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 java.util.*;
import org.junit.*;
import com.oracle.max.graal.compiler.phases.*;
import com.oracle.max.graal.graph.*;
import com.oracle.max.graal.nodes.*;
/**
* 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 InvokeTest extends GraphTest {
private static final String REFERENCE_SNIPPET = "referenceSnippet";
public static int referenceSnippet(int a) {
return 1;
}
public static int const1() {
return 1;
}
@Test
public void test1() {
test("test1Snippet");
}
public static int test1Snippet(int a) {
return const1();
}
@Test
public void test2() {
test("test2Snippet");
}
public static int test2Snippet(int a) {
return const1() + const1() + const1() + const1() + const1() + const1() + const1();
}
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().snapshot()) {
if (n instanceof FrameState) {
// Do not replace.
} else {
n.replaceFirstInput(local, constant);
}
}
Collection<Invoke> hints = new ArrayList<Invoke>();
for (Invoke invoke : graph.getInvokes()) {
hints.add(invoke);
}
new InliningPhase(null, runtime(), hints, null, PhasePlan.DEFAULT).apply(graph);
new CanonicalizerPhase(null, runtime(), null).apply(graph);
new DeadCodeEliminationPhase().apply(graph);
StructuredGraph referenceGraph = parse(REFERENCE_SNIPPET);
assertEquals(referenceGraph, graph);
}
}