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
|
/*
* 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/test05.
* VM Testbase keywords: [jit, quick]
*
* @library /vmTestbase
* /test/lib
* @run main/othervm jit.deoptimization.test05.test05
*/
package jit.deoptimization.test05;
import nsk.share.TestFailure;
/*
*
*/
public class test05 {
public static void main (String[] args) {
A obj = new A();
int result = -1;
for (int index = 0; index < 1; index++) {
result += obj.used_alot();
}
if (result != -1) {
throw new TestFailure("result : " + result + " must equal 1");
}
}
}
class A {
protected int count;
public synchronized int foo(int index) {
int rv = ++count;
if (index < A.sIndex / 2)
rv = index;
else {
try {
rv = ((A)Class.forName("jit.deoptimization.test05.B").newInstance()).foo(index);
}
catch(Exception e) {
}
}
return rv;
}
public synchronized int used_alot() {
int result = 1;
for (int i = 0; i < A.sIndex; i++) {
result = foo(i);
}
return result;
}
protected static final int sIndex = 25000;
}
class B extends A {
public synchronized int foo(int index) {
int rv = 0;
int qrtr = A.sIndex / 4;
if (index > 3 * qrtr) {
try {
if (index < A.sIndex - qrtr)
rv = ((B)Class.forName("jit.deoptimization.test05.C").newInstance()).foo(index);
else
rv = ((B)Class.forName("jit.deoptimization.test05.D").newInstance()).foo(index);
}
catch(Exception e) {
}
}
else {
rv = 1;
}
return rv;
}
}
class C extends B {
public C () {
--this.count;
}
public synchronized int foo(int index) {
int j = count;
for (int i=0; i<5000; i++) {
j += used_alot();
if (i==4999) {
try {
j = ((D2)Class.forName("jit.deoptimization.test05.D2").newInstance()).foo(index);
}
catch (Exception e) {}
}
}
return j;
}
public synchronized int used_alot() {
int i=1;
int j=4;
int k=i+j;
byte ba[] = new byte[1000];
int ia[] = new int[1000];
return this.count + (ba.length + i + j - k - ia.length);
}
protected int count = 1;
}
class D extends C {
public D () {
super();
this.count+=2;
}
public int foo(int index) {
return super.foo(index);
}
public synchronized int used_alot() {
count += (--count);
return 0;
}
}
class D2 extends C {
public int foo(int index) {
return 0;
}
}
|
