/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* 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
* @bug 6689060
* @summary Escape Analysis does not work with Compressed Oops
*/
class Point {
int x;
int y;
int ax[];
int ay[];
return next;
}
}
public class Test {
void dummy() {
// Empty method to verify correctness of DebugInfo.
// Use -XX:CompileCommand=exclude,Test.dummy
}
int ival(int i) {
return i*2;
}
int test80(int y, int l, int i) {
p.ax = new int[2];
p.ay = new int[2];
int x = 3;
p.ax[0] = x;
dummy();
}
int test81(int y, int l, int i) {
p.ax = new int[2];
p.ay = new int[2];
int x = 3;
p.ax[0] = x;
dummy();
}
int test44(int y) {
dummy();
return p1.y;
}
int test43(int y) {
if ( (y & 1) == 1 ) {
} else {
}
dummy();
return p1.y;
}
int test42(int y) {
p1.x = 3;
for (int i = 0; i < y; i++) {
if ( (i & 1) == 1 ) {
p1.x += 4;
}
}
return p1.y;
}
int test40(int y) {
if ( (y & 1) == 1 ) {
p1.x = 3;
} else {
p1.x = 5;
}
return p1.y;
}
int test41(int y) {
if ( (y & 1) == 1 ) {
p1.x += 4;
} else {
p1.x += 5;
}
return p1.y;
}
int x = 3;
p.x = x;
p.y = 3 * x + y;
return p;
}
int x = 3;
p.x = x;
p.y = 3 * x + y;
dummy();
return p;
}
int x = 3;
for (int i = 0; i < y; i++) {
p2.x = x;
p2.y = 3 * y + x;
}
return p1;
}
int x = 3;
for (int i = 0; i < y; i++) {
p2.x = x;
p2.y = 3 * y + x;
}
dummy();
return p1;
}
int x = 3;
for (int i = 0; i < y; i++) {
p2.x = x;
p2.y = 3 * y + x;
dummy();
}
return p1;
}
int test05(int y) {
int x = 3;
for (int i = 0; i < y; i++) {
p2.x = x;
p2.y = 3 * y + x;
}
return p1.y;
}
int test0(int y) {
int x = 3;
p.x = x;
p.y = 3 * x + y;
dummy();
return p.x * p.y;
}
int test1(int y) {
if ( (y & 1) == 1 ) {
p = new Point(); // Kill previous
}
int x = 3;
p.x = x;
p.y = 3 * x + y;
dummy();
return p.x * p.y;
}
int test2(int y) {
p1.x = 3;
p2.x = 4;
dummy();
}
p1.x = 3;
p2.x = 4;
dummy();
}
int test4(int y) {
if ( (y & 1) == 1 ) {
p1.x = 3;
p2.x = 4;
} else {
p1.x = 5;
p2.x = 6;
}
dummy();
}
if ( (y & 1) == 1 ) {
p1.x = 3;
p2.x = 4;
} else {
p1.x = 5;
p2.x = 6;
}
dummy();
}
int test6(int y) {
if ( (y & 1) == 1 ) {
p1.x = 3;
} else {
p1.x = 5;
}
dummy();
}
if ( (y & 1) == 1 ) {
p1.x = 3;
} else {
p1.x = 5;
}
dummy();
}
int test8(int y, int l, int i) {
p.ax = new int[l];
p.ay = new int[l];
int x = 3;
p.ax[i] = x;
p.ay[i] = 3 * x + y;
dummy();
}
int test9(int y, int l, int i) {
p.pax[i].x = 3;
p.pay[i].x = 4;
dummy();
}
try {
}
return 0;
}
return 0;
}
p.pax[i].x = 3;
dummy();
}
int test11(int y) {
if ( (y & 1) == 1 ) {
p1.x = 3;
} else {
p1.x = 5;
}
dummy();
}
int test12(int y) {
if ( (y & 1) == 1 ) {
p1.x = 3;
} else {
p1.x = 5;
}
dummy();
}
int y = 0;
for (int i=0; i<10000; i++) {
}
for (int i=0; i<10000; i++) {
}
for (int i=0; i<10000; i++) {
}
int z = 0;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
z += y;
}
}