46459
|
1 |
/*
|
|
2 |
* Copyright (c) 2017, 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 |
package org.graalvm.compiler.core.test;
|
|
24 |
|
46640
|
25 |
import org.graalvm.compiler.debug.DebugContext;
|
46459
|
26 |
import org.graalvm.compiler.debug.DebugDumpScope;
|
|
27 |
import org.graalvm.compiler.loop.DefaultLoopPolicies;
|
|
28 |
import org.graalvm.compiler.loop.phases.LoopFullUnrollPhase;
|
|
29 |
import org.graalvm.compiler.nodes.LoopBeginNode;
|
|
30 |
import org.graalvm.compiler.nodes.StructuredGraph;
|
|
31 |
import org.graalvm.compiler.nodes.StructuredGraph.AllowAssumptions;
|
|
32 |
import org.graalvm.compiler.phases.common.CanonicalizerPhase;
|
|
33 |
import org.graalvm.compiler.phases.tiers.PhaseContext;
|
|
34 |
import org.junit.Test;
|
|
35 |
|
|
36 |
public class LoopFullUnrollTest extends GraalCompilerTest {
|
|
37 |
|
|
38 |
public static int testMinToMax(int input) {
|
|
39 |
int ret = 2;
|
|
40 |
int current = input;
|
|
41 |
for (long i = Long.MIN_VALUE; i < Long.MAX_VALUE; i++) {
|
|
42 |
ret *= 2 + current;
|
|
43 |
current /= 50;
|
|
44 |
}
|
|
45 |
return ret;
|
|
46 |
}
|
|
47 |
|
|
48 |
@Test
|
|
49 |
public void runMinToMax() throws Throwable {
|
|
50 |
test("testMinToMax", 1);
|
|
51 |
}
|
|
52 |
|
|
53 |
public static int testMinTo0(int input) {
|
|
54 |
int ret = 2;
|
|
55 |
int current = input;
|
|
56 |
for (long i = Long.MIN_VALUE; i <= 0; i++) {
|
|
57 |
ret *= 2 + current;
|
|
58 |
current /= 50;
|
|
59 |
}
|
|
60 |
return ret;
|
|
61 |
}
|
|
62 |
|
|
63 |
@Test
|
|
64 |
public void runMinTo0() throws Throwable {
|
|
65 |
test("testMinTo0", 1);
|
|
66 |
}
|
|
67 |
|
|
68 |
public static int testNegativeTripCount(int input) {
|
|
69 |
int ret = 2;
|
|
70 |
int current = input;
|
|
71 |
for (long i = 0; i <= -20; i++) {
|
|
72 |
ret *= 2 + current;
|
|
73 |
current /= 50;
|
|
74 |
}
|
|
75 |
return ret;
|
|
76 |
}
|
|
77 |
|
|
78 |
@Test
|
|
79 |
public void runNegativeTripCount() throws Throwable {
|
|
80 |
test("testNegativeTripCount", 0);
|
|
81 |
}
|
|
82 |
|
|
83 |
@SuppressWarnings("try")
|
|
84 |
private void test(String snippet, int loopCount) {
|
46640
|
85 |
DebugContext debug = getDebugContext();
|
|
86 |
try (DebugContext.Scope s = debug.scope(getClass().getSimpleName(), new DebugDumpScope(snippet))) {
|
|
87 |
final StructuredGraph graph = parseEager(snippet, AllowAssumptions.NO, debug);
|
46459
|
88 |
|
|
89 |
PhaseContext context = new PhaseContext(getProviders());
|
|
90 |
new LoopFullUnrollPhase(new CanonicalizerPhase(), new DefaultLoopPolicies()).apply(graph, context);
|
|
91 |
|
|
92 |
assertTrue(graph.getNodes().filter(LoopBeginNode.class).count() == loopCount);
|
|
93 |
} catch (Throwable e) {
|
46640
|
94 |
throw debug.handle(e);
|
46459
|
95 |
}
|
|
96 |
}
|
|
97 |
}
|