1 /* 2 * Copyright (c) 2012, 2018, 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 org.graalvm.compiler.nodes.StructuredGraph; 28 import org.graalvm.compiler.nodes.StructuredGraph.AllowAssumptions; 29 import org.graalvm.compiler.phases.common.CanonicalizerPhase; 30 import org.graalvm.compiler.phases.tiers.PhaseContext; 31 import org.junit.Test; 32 33 public class CompareCanonicalizerTest2 extends GraalCompilerTest { 34 35 @SuppressWarnings("unused") private static boolean sink; 36 37 private StructuredGraph getCanonicalizedGraph(String name) { 38 StructuredGraph graph = getRegularGraph(name); 39 new CanonicalizerPhase().apply(graph, new PhaseContext(getProviders())); 40 return graph; 41 } 42 43 private StructuredGraph getRegularGraph(String name) { 44 StructuredGraph graph = parseEager(name, AllowAssumptions.YES); 45 return graph; 46 } 47 48 @Test 49 public void test0() { 50 assertEquals(getCanonicalizedGraph("integerTestCanonicalization0"), getRegularGraph("integerTestCanonicalization0")); 51 } 52 53 public static void integerTestCanonicalization0(int a) { 54 sink = 1 < a + 1; 55 } 56 57 @Test 58 public void test1() { 59 assertEquals(getCanonicalizedGraph("integerTestCanonicalization1"), getRegularGraph("integerTestCanonicalization1")); 60 } 61 62 public static void integerTestCanonicalization1(int a) { 63 sink = a - 1 < -1; 64 } 65 66 @Test 67 public void test2() { 68 assertEquals(getCanonicalizedGraph("integerTestCanonicalization2a"), getCanonicalizedGraph("integerTestCanonicalization2Reference")); 69 assertEquals(getCanonicalizedGraph("integerTestCanonicalization2b"), getCanonicalizedGraph("integerTestCanonicalization2Reference")); 70 } 71 72 public static boolean integerTestCanonicalization2a(Object[] arr) { 73 return arr.length - 1 < 0; 74 } 75 76 public static boolean integerTestCanonicalization2b(Object[] arr) { 77 return arr.length < 1; 78 } 79 80 public static boolean integerTestCanonicalization2Reference(Object[] arr) { 81 return arr.length == 0; 82 } 83 84 @Test 85 public void test3() { 86 assertEquals(getCanonicalizedGraph("integerTestCanonicalization3"), getCanonicalizedGraph("integerTestCanonicalization3Reference")); 87 } 88 89 public static boolean integerTestCanonicalization3(Object[] arr) { 90 return ((long) (arr.length - 1)) - 1 < 0; 91 } 92 93 public static boolean integerTestCanonicalization3Reference(Object[] arr) { 94 return arr.length < 2; 95 } 96 97 }