VN_Loop01.java revision 12651:6ef01bd40ce2 
1/*
2 * Copyright (c) 2009, 2012, 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 */
23package org.graalvm.compiler.jtt.optimize;
24
25import org.junit.Test;
26
27import org.graalvm.compiler.jtt.JTTTest;
28
29/*
30 * Tests value numbering of integer operations.
31 */
32public class VN_Loop01 extends JTTTest {
33
34    private static boolean cond1 = true;
35    private static boolean cond2 = true;
36
37    public static int test(int arg) {
38        if (arg == 0) {
39            return test1(arg);
40        }
41        if (arg == 1) {
42            return test2(arg);
43        }
44        if (arg == 2) {
45            return test3(arg);
46        }
47        if (arg == 3) {
48            return test4(arg);
49        }
50        return 0;
51    }
52
53    public static int test1(int x) {
54        int c = 3;
55        int t = x + c;
56        while (cond1) {
57            if (cond2) {
58                int u = x + c; // GVN should recognize u == t
59                return t + u;
60            }
61        }
62        return 3; // GVN should recognize 3 == 3
63    }
64
65    public static int test2(int x) {
66        int c = 3;
67        while (cond1) {
68            int t = x + c;
69            if (cond2) {
70                int u = x + c; // GVN should recognize u == t
71                return t + u;
72            }
73        }
74        return 3;
75    }
76
77    public static int test3(int x) {
78        int c = 3;
79        int t = x + c;
80        while (cond1) {
81            if (cond2) {
82                int u = x + c; // GVN should recognize u == t
83                return t + u;
84            }
85            int u = x + c; // GVN should recognize u == t
86            return t + u;
87        }
88        return 3; // GVN should recognize 3 == 3
89    }
90
91    public static int test4(int x) {
92        int c = 3;
93        int t = x + c;
94        while (cond1) {
95            if (!cond2) {
96                int u = x + c;
97                return t + u;
98            }
99            int u = x + c;
100            return t + u;
101        }
102        return 3;
103    }
104
105    @Test
106    public void run0() throws Throwable {
107        runTest("test", 0);
108    }
109
110    @Test
111    public void run1() throws Throwable {
112        runTest("test", 1);
113    }
114
115    @Test
116    public void run2() throws Throwable {
117        runTest("test", 2);
118    }
119
120    @Test
121    public void run3() throws Throwable {
122        runTest("test", 3);
123    }
124
125    @Test
126    public void run4() throws Throwable {
127        runTest("test", 4);
128    }
129
130}
131