1 /* 2 * Copyright (c) 2012, 2014, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 24 25 package org.graalvm.compiler.core.test; 26 27 import static org.graalvm.compiler.graph.test.matchers.NodeIterableIsEmpty.isNotEmpty; 28 29 import org.graalvm.compiler.nodes.StructuredGraph; 30 import org.graalvm.compiler.nodes.StructuredGraph.AllowAssumptions; 31 import org.graalvm.compiler.nodes.calc.IntegerLessThanNode; 32 import org.graalvm.compiler.phases.common.CanonicalizerPhase; 33 import org.graalvm.compiler.phases.tiers.PhaseContext; 34 import org.junit.Assert; 35 import org.junit.Test; 36 37 public class CompareCanonicalizerTest2 extends GraalCompilerTest { 38 39 @SuppressWarnings("unused") private static int sink0; 40 @SuppressWarnings("unused") private static int sink1; 41 42 private StructuredGraph getCanonicalizedGraph(String name) { 43 StructuredGraph graph = parseEager(name, AllowAssumptions.YES); 44 new CanonicalizerPhase().apply(graph, new PhaseContext(getProviders())); 45 return graph; 46 } 47 48 public void testIntegerTestCanonicalization(String name) { 49 StructuredGraph graph = getCanonicalizedGraph(name); 50 Assert.assertThat(graph.getNodes().filter(IntegerLessThanNode.class), isNotEmpty()); 51 } 52 53 @Test 54 public void test0() { 55 testIntegerTestCanonicalization("integerTestCanonicalization0"); 56 } 57 58 @Test 59 public void test1() { 60 testIntegerTestCanonicalization("integerTestCanonicalization1"); 61 } 62 63 public static void integerTestCanonicalization0(int a) { 64 if (1 < a + 1) { 65 sink1 = 0; 66 } else { 67 sink0 = -1; 68 } 69 } 70 71 public static void integerTestCanonicalization1(int a) { 72 if (a - 1 < -1) { 73 sink1 = 0; 74 } else { 75 sink0 = -1; 76 } 77 } 78 79 }