1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/*
* Copyright (c) 2008, 2020, 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.
*/
/*
* @test
*
* @summary converted from VM Testbase jit/deoptimization/test08.
* VM Testbase keywords: [jit, quick]
*
* @library /vmTestbase
* /test/lib
* @run main/othervm jit.deoptimization.test08.test08
*/
package jit.deoptimization.test08;
import nsk.share.TestFailure;
/*
* Simple recursion that should causes hotspot to deoptimize
* used_alot and A.foo and A.bar methods
* Expected result for the test is: 0
*
* run with the -XX:TraceDeoptimization to observ the result.
*/
public class test08 {
public static void main (String[] args) {
A obj = new A();
for (int index = 0; index < 1; index++) {
obj.used_alot();
}
}
}
class A {
static int result = 0;
synchronized public int foo(int index, int iter) {
synchronized (A.a_ext) {
if (index == 0)
return result;
else if (iter <= sIteration / 2) {
result = bar(index) * foo(--index, iter);
} else {
try {
// halfway through the max iterations
// create a B. This should cause the
// used_alot to be deoptimized
// Call b.frame for the remaining part of the recursion
if (b == null)
b = Class.forName("jit.deoptimization.test08.B").newInstance();
result *= ((B)b).foo(index, iter);
} catch (Exception x) {
throw new TestFailure("Class not found: B");
}
}
}
return result;
}
// Does nothing but it will let be over written in class C, See Below
synchronized public int bar(int index) {
synchronized (a_ext) {
for (int i=0; i<5; i++)
index--;
}
return 0;
}
synchronized public void used_alot() {
int result = 1;
synchronized (a_ext) {
for (int index = 1; index <= sIteration; index++) {
result *= foo(index, index);
}
}
if (result != 0) {
System.err.println ("Result: " + result);
System.exit (1);
}
}
protected Object b = null;
protected static final int sIteration = 1000;
protected static final Object a_ext = new Object();
}
class B extends A {
// Override foo in order to force deoptimization.
// Also creates and instance of class C in the last
// iteration in order to force A.foo to get deoptimized
// otherwise just do something stupid.
synchronized public int foo(int index, int iter) {
synchronized (A.a_ext) {
synchronized (B.b_ext) {
// Make sure that this class was created at least
// halfway through the iteration. Simple sanity check
if (iter < sIteration /2) {
System.out.println ("class B create to early");
System.exit(1);
}
if (iter == sIteration) {
try {
result = ((C)(Class.forName("jit.deoptimization.test08.C").newInstance())).foo(index,iter);
result *= ((C)(Class.forName("jit.deoptimization.test08.C").newInstance())).bar(index);
} catch (Exception x) {
throw new TestFailure("Class not found: C");
}
} else {
result = bar(index);
if (index != 0)
result += foo(--index, iter);
}
}
}
return result;
}
protected static final Object b_ext = new Object();
}
class C extends B {
synchronized public int foo(int index, int iter) {
synchronized (A.a_ext) {
synchronized (B.b_ext) {
synchronized (C.c_ext) {
for (int i=0; i<iter; i++) {
result = bar(i);
if (i == iter-2) {
try {
result = ((D)(Class.forName("jit.deoptimization.test08.D").newInstance())).bar(index);
} catch (Exception x) {
throw new TestFailure("Class not found: D");
}
}
}
}
}
}
return result;
}
protected static final Object c_ext = new Object();
}
class D extends C {
synchronized public int bar(int index) {
return 1;
}
}
|
