test/compiler/6689060/Test.java

Tue, 31 Aug 2010 17:23:45 -0700

author
trims
date
Tue, 31 Aug 2010 17:23:45 -0700
changeset 2093
0803c0f69b51
parent 1907
c18cbe5936b8
child 6876
710a3c8b516e
permissions
-rw-r--r--

Added tag hs19-b06 for changeset 6c43216df135

kvn@598 1 /*
trims@1907 2 * Copyright (c) 2008, Oracle and/or its affiliates. All rights reserved.
kvn@688 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
kvn@598 4 *
kvn@688 5 * This code is free software; you can redistribute it and/or modify it
kvn@688 6 * under the terms of the GNU General Public License version 2 only, as
kvn@688 7 * published by the Free Software Foundation.
kvn@598 8 *
kvn@688 9 * This code is distributed in the hope that it will be useful, but WITHOUT
kvn@688 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
kvn@688 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
kvn@688 12 * version 2 for more details (a copy is included in the LICENSE file that
kvn@688 13 * accompanied this code).
kvn@598 14 *
kvn@688 15 * You should have received a copy of the GNU General Public License version
kvn@688 16 * 2 along with this work; if not, write to the Free Software Foundation,
kvn@688 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
kvn@598 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
kvn@598 22 */
kvn@598 23
kvn@598 24 /*
kvn@598 25 * @test
kvn@598 26 * @bug 6689060
kvn@598 27 * @summary Escape Analysis does not work with Compressed Oops
kvn@598 28 * @run main/othervm -Xbatch -XX:CompileCommand=exclude,Test.dummy -XX:+AggressiveOpts Test
kvn@598 29 */
kvn@598 30
kvn@598 31 import java.lang.reflect.Array;
kvn@598 32
kvn@598 33 class Point {
kvn@598 34 int x;
kvn@598 35 int y;
kvn@598 36 Point next;
kvn@598 37 int ax[];
kvn@598 38 int ay[];
kvn@598 39 Point pax[];
kvn@598 40 Point pay[];
kvn@598 41 public Point getNext() {
kvn@598 42 return next;
kvn@598 43 }
kvn@598 44 }
kvn@598 45
kvn@598 46 public class Test {
kvn@598 47
kvn@598 48 void dummy() {
kvn@598 49 // Empty method to verify correctness of DebugInfo.
kvn@598 50 // Use -XX:CompileCommand=exclude,Test.dummy
kvn@598 51 }
kvn@598 52
kvn@598 53 int ival(int i) {
kvn@598 54 return i*2;
kvn@598 55 }
kvn@598 56
kvn@598 57 int test80(int y, int l, int i) {
kvn@598 58 Point p = new Point();
kvn@598 59 p.ax = new int[2];
kvn@598 60 p.ay = new int[2];
kvn@598 61 int x = 3;
kvn@598 62 p.ax[0] = x;
kvn@598 63 p.ay[1] = 3 * x + y;
kvn@598 64 dummy();
kvn@598 65 return p.ax[0] * p.ay[1];
kvn@598 66 }
kvn@598 67
kvn@598 68 int test81(int y, int l, int i) {
kvn@598 69 Point p = new Point();
kvn@598 70 p.ax = new int[2];
kvn@598 71 p.ay = new int[2];
kvn@598 72 int x = 3;
kvn@598 73 p.ax[0] = x;
kvn@598 74 p.ay[1] = 3 * x + y;
kvn@598 75 dummy();
kvn@598 76 return p.ax[0] * p.ay[1];
kvn@598 77 }
kvn@598 78
kvn@598 79
kvn@598 80 int test44(int y) {
kvn@598 81 Point p1 = new Point();
kvn@598 82 p1.x = ival(3);
kvn@598 83 dummy();
kvn@598 84 p1.y = 3 * p1.x + y;
kvn@598 85 return p1.y;
kvn@598 86 }
kvn@598 87
kvn@598 88 int test43(int y) {
kvn@598 89 Point p1 = new Point();
kvn@598 90 if ( (y & 1) == 1 ) {
kvn@598 91 p1.x = ival(3);
kvn@598 92 } else {
kvn@598 93 p1.x = ival(5);
kvn@598 94 }
kvn@598 95 dummy();
kvn@598 96 p1.y = 3 * p1.x + y;
kvn@598 97 return p1.y;
kvn@598 98 }
kvn@598 99
kvn@598 100 int test42(int y) {
kvn@598 101 Point p1 = new Point();
kvn@598 102 p1.x = 3;
kvn@598 103 for (int i = 0; i < y; i++) {
kvn@598 104 if ( (i & 1) == 1 ) {
kvn@598 105 p1.x += 4;
kvn@598 106 }
kvn@598 107 }
kvn@598 108 p1.y = 3 * y + p1.x;
kvn@598 109 return p1.y;
kvn@598 110 }
kvn@598 111
kvn@598 112 int test40(int y) {
kvn@598 113 Point p1 = new Point();
kvn@598 114 if ( (y & 1) == 1 ) {
kvn@598 115 p1.x = 3;
kvn@598 116 } else {
kvn@598 117 p1.x = 5;
kvn@598 118 }
kvn@598 119 p1.y = 3 * p1.x + y;
kvn@598 120 return p1.y;
kvn@598 121 }
kvn@598 122
kvn@598 123 int test41(int y) {
kvn@598 124 Point p1 = new Point();
kvn@598 125 if ( (y & 1) == 1 ) {
kvn@598 126 p1.x += 4;
kvn@598 127 } else {
kvn@598 128 p1.x += 5;
kvn@598 129 }
kvn@598 130 p1.y = 3 * p1.x + y;
kvn@598 131 return p1.y;
kvn@598 132 }
kvn@598 133
kvn@598 134 Point test00(int y) {
kvn@598 135 int x = 3;
kvn@598 136 Point p = new Point();
kvn@598 137 p.x = x;
kvn@598 138 p.y = 3 * x + y;
kvn@598 139 return p;
kvn@598 140 }
kvn@598 141
kvn@598 142 Point test01(int y) {
kvn@598 143 int x = 3;
kvn@598 144 Point p = new Point();
kvn@598 145 p.x = x;
kvn@598 146 p.y = 3 * x + y;
kvn@598 147 dummy();
kvn@598 148 return p;
kvn@598 149 }
kvn@598 150
kvn@598 151 Point test02(int y) {
kvn@598 152 int x = 3;
kvn@598 153 Point p1 = null;
kvn@598 154 for (int i = 0; i < y; i++) {
kvn@598 155 Point p2 = new Point();
kvn@598 156 p2.x = x;
kvn@598 157 p2.y = 3 * y + x;
kvn@598 158 p2.next = p1;
kvn@598 159 p1 = p2;
kvn@598 160 }
kvn@598 161 return p1;
kvn@598 162 }
kvn@598 163
kvn@598 164 Point test03(int y) {
kvn@598 165 int x = 3;
kvn@598 166 Point p1 = null;
kvn@598 167 for (int i = 0; i < y; i++) {
kvn@598 168 Point p2 = new Point();
kvn@598 169 p2.x = x;
kvn@598 170 p2.y = 3 * y + x;
kvn@598 171 p2.next = p1;
kvn@598 172 p1 = p2;
kvn@598 173 }
kvn@598 174 dummy();
kvn@598 175 return p1;
kvn@598 176 }
kvn@598 177
kvn@598 178 Point test04(int y) {
kvn@598 179 int x = 3;
kvn@598 180 Point p1 = null;
kvn@598 181 for (int i = 0; i < y; i++) {
kvn@598 182 Point p2 = new Point();
kvn@598 183 p2.x = x;
kvn@598 184 p2.y = 3 * y + x;
kvn@598 185 p2.next = p1;
kvn@598 186 dummy();
kvn@598 187 p1 = p2;
kvn@598 188 }
kvn@598 189 return p1;
kvn@598 190 }
kvn@598 191
kvn@598 192 int test05(int y) {
kvn@598 193 int x = 3;
kvn@598 194 Point p1 = new Point();
kvn@598 195 for (int i = 0; i < y; i++) {
kvn@598 196 Point p2 = new Point();
kvn@598 197 p2.x = x;
kvn@598 198 p2.y = 3 * y + x;
kvn@598 199 p1.next = p2;
kvn@598 200 p1 = p2;
kvn@598 201 }
kvn@598 202 return p1.y;
kvn@598 203 }
kvn@598 204
kvn@598 205 int test0(int y) {
kvn@598 206 int x = 3;
kvn@598 207 Point p = new Point();
kvn@598 208 p.x = x;
kvn@598 209 p.y = 3 * x + y;
kvn@598 210 dummy();
kvn@598 211 return p.x * p.y;
kvn@598 212 }
kvn@598 213
kvn@598 214 int test1(int y) {
kvn@598 215 Point p = new Point();
kvn@598 216 if ( (y & 1) == 1 ) {
kvn@598 217 p = new Point(); // Kill previous
kvn@598 218 }
kvn@598 219 int x = 3;
kvn@598 220 p.x = x;
kvn@598 221 p.y = 3 * x + y;
kvn@598 222 dummy();
kvn@598 223 return p.x * p.y;
kvn@598 224 }
kvn@598 225
kvn@598 226 int test2(int y) {
kvn@598 227 Point p1 = new Point();
kvn@598 228 Point p2 = new Point();
kvn@598 229 p1.x = 3;
kvn@598 230 p2.x = 4;
kvn@598 231 p1.y = 3 * p2.x + y;
kvn@598 232 p2.y = 3 * p1.x + y;
kvn@598 233 dummy();
kvn@598 234 return p1.y * p2.y;
kvn@598 235 }
kvn@598 236
kvn@598 237 int test3(int y, Point p1) {
kvn@598 238 Point p2 = new Point();
kvn@598 239 p1.x = 3;
kvn@598 240 p2.x = 4;
kvn@598 241 p1.y = 3 * p2.x + y;
kvn@598 242 p2.y = 3 * p1.x + y;
kvn@598 243 dummy();
kvn@598 244 return p1.y * p2.y;
kvn@598 245 }
kvn@598 246
kvn@598 247 int test4(int y) {
kvn@598 248 Point p1 = new Point();
kvn@598 249 Point p2 = new Point();
kvn@598 250 if ( (y & 1) == 1 ) {
kvn@598 251 p1.x = 3;
kvn@598 252 p2.x = 4;
kvn@598 253 } else {
kvn@598 254 p1.x = 5;
kvn@598 255 p2.x = 6;
kvn@598 256 }
kvn@598 257 p1.y = 3 * p2.x + y;
kvn@598 258 p2.y = 3 * p1.x + y;
kvn@598 259 dummy();
kvn@598 260 return p1.y * p2.y;
kvn@598 261 }
kvn@598 262
kvn@598 263 int test5(int y, Point p1) {
kvn@598 264 Point p2 = new Point();
kvn@598 265 if ( (y & 1) == 1 ) {
kvn@598 266 p1.x = 3;
kvn@598 267 p2.x = 4;
kvn@598 268 } else {
kvn@598 269 p1.x = 5;
kvn@598 270 p2.x = 6;
kvn@598 271 }
kvn@598 272 p1.y = 3 * p2.x + y;
kvn@598 273 p2.y = 3 * p1.x + y;
kvn@598 274 dummy();
kvn@598 275 return p1.y * p2.y;
kvn@598 276 }
kvn@598 277
kvn@598 278 int test6(int y) {
kvn@598 279 Point p1 = new Point();
kvn@598 280 Point p2 = new Point();
kvn@598 281 p1.next = p2;
kvn@598 282 if ( (y & 1) == 1 ) {
kvn@598 283 p1.x = 3;
kvn@598 284 p1.getNext().x = 4;
kvn@598 285 } else {
kvn@598 286 p1.x = 5;
kvn@598 287 p1.getNext().x = 6;
kvn@598 288 }
kvn@598 289 p1.y = 3 * p2.x + y;
kvn@598 290 p2.y = 3 * p1.x + y;
kvn@598 291 dummy();
kvn@598 292 return p1.y * p2.y;
kvn@598 293 }
kvn@598 294
kvn@598 295 int test7(int y, Point p1) {
kvn@598 296 Point p2 = new Point();
kvn@598 297 p1.next = p2;
kvn@598 298 if ( (y & 1) == 1 ) {
kvn@598 299 p1.x = 3;
kvn@598 300 p1.getNext().x = 4;
kvn@598 301 } else {
kvn@598 302 p1.x = 5;
kvn@598 303 p1.getNext().x = 6;
kvn@598 304 }
kvn@598 305 p1.y = 3 * p2.x + y;
kvn@598 306 p2.y = 3 * p1.x + y;
kvn@598 307 dummy();
kvn@598 308 return p1.y * p2.y;
kvn@598 309 }
kvn@598 310
kvn@598 311 int test8(int y, int l, int i) {
kvn@598 312 Point p = new Point();
kvn@598 313 p.ax = new int[l];
kvn@598 314 p.ay = new int[l];
kvn@598 315 int x = 3;
kvn@598 316 p.ax[i] = x;
kvn@598 317 p.ay[i] = 3 * x + y;
kvn@598 318 dummy();
kvn@598 319 return p.ax[i] * p.ay[i];
kvn@598 320 }
kvn@598 321
kvn@598 322 int test9(int y, int l, int i) {
kvn@598 323 Point p = new Point();
kvn@598 324 p.pax = new Point[l];
kvn@598 325 p.pay = new Point[l];
kvn@598 326 p.pax[i] = new Point();
kvn@598 327 p.pay[i] = new Point();
kvn@598 328 p.pax[i].x = 3;
kvn@598 329 p.pay[i].x = 4;
kvn@598 330 p.pax[i].y = 3 * p.pay[i].x + y;
kvn@598 331 p.pay[i].y = 3 * p.pax[i].x + y;
kvn@598 332 dummy();
kvn@598 333 return p.pax[i].y * p.pay[i].y;
kvn@598 334 }
kvn@598 335
kvn@598 336 int test10(int y, int l, int i, Class cls) {
kvn@598 337 Point p = new Point();
kvn@598 338 try {
kvn@598 339 p.pax = (Point[])Array.newInstance(cls, l);
kvn@598 340 p.pax[i] = (Point)cls.newInstance();
kvn@598 341 }
kvn@598 342 catch(java.lang.InstantiationException ex) {
kvn@598 343 return 0;
kvn@598 344 }
kvn@598 345 catch(java.lang.IllegalAccessException ex) {
kvn@598 346 return 0;
kvn@598 347 }
kvn@598 348 p.pax[i].x = 3;
kvn@598 349 p.pax[i].y = 3 * p.pax[i].x + y;
kvn@598 350 dummy();
kvn@598 351 return p.pax[i].x * p.pax[i].y;
kvn@598 352 }
kvn@598 353
kvn@598 354 int test11(int y) {
kvn@598 355 Point p1 = new Point();
kvn@598 356 Point p2 = new Point();
kvn@598 357 p1.next = p2;
kvn@598 358 if ( (y & 1) == 1 ) {
kvn@598 359 p1.x = 3;
kvn@598 360 p1.next.x = 4;
kvn@598 361 } else {
kvn@598 362 p1.x = 5;
kvn@598 363 p1.next.x = 6;
kvn@598 364 }
kvn@598 365 p1.y = 3 * p1.next.x + y;
kvn@598 366 p1.next.y = 3 * p1.x + y;
kvn@598 367 dummy();
kvn@598 368 return p1.y * p1.next.y;
kvn@598 369 }
kvn@598 370
kvn@598 371 int test12(int y) {
kvn@598 372 Point p1 = new Point();
kvn@598 373 p1.next = p1;
kvn@598 374 if ( (y & 1) == 1 ) {
kvn@598 375 p1.x = 3;
kvn@598 376 p1.next.x = 4;
kvn@598 377 } else {
kvn@598 378 p1.x = 5;
kvn@598 379 p1.next.x = 6;
kvn@598 380 }
kvn@598 381 p1.y = 3 * p1.next.x + y;
kvn@598 382 p1.next.y = 3 * p1.x + y;
kvn@598 383 dummy();
kvn@598 384 return p1.y * p1.next.y;
kvn@598 385 }
kvn@598 386
kvn@598 387
kvn@598 388 public static void main(String args[]) {
kvn@598 389 Test tsr = new Test();
kvn@598 390 Point p = new Point();
kvn@598 391 Point ptmp = p;
kvn@598 392 Class cls = Point.class;
kvn@598 393 int y = 0;
kvn@598 394 for (int i=0; i<10000; i++) {
kvn@598 395 ptmp.next = tsr.test00(1);
kvn@598 396 ptmp.next = tsr.test01(1);
kvn@598 397 ptmp.next = tsr.test02(1);
kvn@598 398 ptmp.next = tsr.test03(1);
kvn@598 399 ptmp.next = tsr.test04(1);
kvn@598 400
kvn@598 401 y = tsr.test05(1);
kvn@598 402
kvn@598 403 y = tsr.test80(y, 1, 0);
kvn@598 404 y = tsr.test81(y, 1, 0);
kvn@598 405
kvn@598 406 y = tsr.test44(y);
kvn@598 407 y = tsr.test43(y);
kvn@598 408 y = tsr.test42(y);
kvn@598 409 y = tsr.test40(y);
kvn@598 410 y = tsr.test41(y);
kvn@598 411
kvn@598 412 y = tsr.test0(y);
kvn@598 413 y = tsr.test1(y);
kvn@598 414 y = tsr.test2(y);
kvn@598 415 y = tsr.test3(y, p);
kvn@598 416 y = tsr.test4(y);
kvn@598 417 y = tsr.test5(y, p);
kvn@598 418 y = tsr.test6(y);
kvn@598 419 y = tsr.test7(y, p);
kvn@598 420 y = tsr.test8(y, 1, 0);
kvn@598 421 y = tsr.test9(y, 1, 0);
kvn@598 422 y = tsr.test10(y, 1, 0, cls);
kvn@598 423 y = tsr.test11(y);
kvn@598 424 y = tsr.test12(y);
kvn@598 425 }
kvn@598 426 for (int i=0; i<10000; i++) {
kvn@598 427 ptmp.next = tsr.test00(1);
kvn@598 428 ptmp.next = tsr.test01(1);
kvn@598 429 ptmp.next = tsr.test02(1);
kvn@598 430 ptmp.next = tsr.test03(1);
kvn@598 431 ptmp.next = tsr.test04(1);
kvn@598 432
kvn@598 433 y = tsr.test05(1);
kvn@598 434
kvn@598 435 y = tsr.test80(y, 1, 0);
kvn@598 436 y = tsr.test81(y, 1, 0);
kvn@598 437
kvn@598 438 y = tsr.test44(y);
kvn@598 439 y = tsr.test43(y);
kvn@598 440 y = tsr.test42(y);
kvn@598 441 y = tsr.test40(y);
kvn@598 442 y = tsr.test41(y);
kvn@598 443
kvn@598 444 y = tsr.test0(y);
kvn@598 445 y = tsr.test1(y);
kvn@598 446 y = tsr.test2(y);
kvn@598 447 y = tsr.test3(y, p);
kvn@598 448 y = tsr.test4(y);
kvn@598 449 y = tsr.test5(y, p);
kvn@598 450 y = tsr.test6(y);
kvn@598 451 y = tsr.test7(y, p);
kvn@598 452 y = tsr.test8(y, 1, 0);
kvn@598 453 y = tsr.test9(y, 1, 0);
kvn@598 454 y = tsr.test10(y, 1, 0, cls);
kvn@598 455 y = tsr.test11(y);
kvn@598 456 y = tsr.test12(y);
kvn@598 457 }
kvn@598 458 for (int i=0; i<10000; i++) {
kvn@598 459 ptmp.next = tsr.test00(1);
kvn@598 460 ptmp.next = tsr.test01(1);
kvn@598 461 ptmp.next = tsr.test02(1);
kvn@598 462 ptmp.next = tsr.test03(1);
kvn@598 463 ptmp.next = tsr.test04(1);
kvn@598 464
kvn@598 465 y = tsr.test05(1);
kvn@598 466
kvn@598 467 y = tsr.test80(y, 1, 0);
kvn@598 468 y = tsr.test81(y, 1, 0);
kvn@598 469
kvn@598 470 y = tsr.test44(y);
kvn@598 471 y = tsr.test43(y);
kvn@598 472 y = tsr.test42(y);
kvn@598 473 y = tsr.test40(y);
kvn@598 474 y = tsr.test41(y);
kvn@598 475
kvn@598 476 y = tsr.test0(y);
kvn@598 477 y = tsr.test1(y);
kvn@598 478 y = tsr.test2(y);
kvn@598 479 y = tsr.test3(y, p);
kvn@598 480 y = tsr.test4(y);
kvn@598 481 y = tsr.test5(y, p);
kvn@598 482 y = tsr.test6(y);
kvn@598 483 y = tsr.test7(y, p);
kvn@598 484 y = tsr.test8(y, 1, 0);
kvn@598 485 y = tsr.test9(y, 1, 0);
kvn@598 486 y = tsr.test10(y, 1, 0, cls);
kvn@598 487 y = tsr.test11(y);
kvn@598 488 y = tsr.test12(y);
kvn@598 489 }
kvn@598 490
kvn@598 491 int z = 0;
kvn@598 492 y = tsr.test80(0, 1, 0);
kvn@598 493 z += y;
kvn@598 494 System.out.println("After 'test80' y=" + y);
kvn@598 495 y = tsr.test81(0, 1, 0);
kvn@598 496 z += y;
kvn@598 497 System.out.println("After 'test81' y=" + y);
kvn@598 498
kvn@598 499 y = tsr.test44(0);
kvn@598 500 z += y;
kvn@598 501 System.out.println("After 'test44' y=" + y);
kvn@598 502 y = tsr.test43(0);
kvn@598 503 z += y;
kvn@598 504 System.out.println("After 'test43' y=" + y);
kvn@598 505 y = tsr.test42(0);
kvn@598 506 z += y;
kvn@598 507 System.out.println("After 'test42' y=" + y);
kvn@598 508 y = tsr.test40(0);
kvn@598 509 z += y;
kvn@598 510 System.out.println("After 'test40' y=" + y);
kvn@598 511 y = tsr.test41(0);
kvn@598 512 z += y;
kvn@598 513 System.out.println("After 'test41' y=" + y);
kvn@598 514
kvn@598 515 ptmp.next = tsr.test00(1);
kvn@598 516 z += y;
kvn@598 517 System.out.println("After 'test00' p.y=" + ptmp.next.y);
kvn@598 518 ptmp.next = tsr.test01(1);
kvn@598 519 z += y;
kvn@598 520 System.out.println("After 'test01' p.y=" + ptmp.next.y);
kvn@598 521 ptmp.next = tsr.test02(1);
kvn@598 522 z += y;
kvn@598 523 System.out.println("After 'test02' p.y=" + ptmp.next.y);
kvn@598 524 ptmp.next = tsr.test03(1);
kvn@598 525 z += y;
kvn@598 526 System.out.println("After 'test03' p.y=" + ptmp.next.y);
kvn@598 527 ptmp.next = tsr.test04(1);
kvn@598 528 z += y;
kvn@598 529 System.out.println("After 'test04' p.y=" + ptmp.next.y);
kvn@598 530
kvn@598 531 y = tsr.test05(1);
kvn@598 532 z += y;
kvn@598 533 System.out.println("After 'test05' y=" + y);
kvn@598 534
kvn@598 535 y = tsr.test0(0);
kvn@598 536 z += y;
kvn@598 537 System.out.println("After 'test0' y=" + y);
kvn@598 538 y = tsr.test1(0);
kvn@598 539 z += y;
kvn@598 540 System.out.println("After 'test1' y=" + y);
kvn@598 541 y = tsr.test2(0);
kvn@598 542 z += y;
kvn@598 543 System.out.println("After 'test2' y=" + y);
kvn@598 544 y = tsr.test3(0, new Point());
kvn@598 545 z += y;
kvn@598 546 System.out.println("After 'test3' y=" + y);
kvn@598 547 y = tsr.test4(0);
kvn@598 548 z += y;
kvn@598 549 System.out.println("After 'test4' y=" + y);
kvn@598 550 y = tsr.test5(0, new Point());
kvn@598 551 z += y;
kvn@598 552 System.out.println("After 'test5' y=" + y);
kvn@598 553 y = tsr.test6(0);
kvn@598 554 z += y;
kvn@598 555 System.out.println("After 'test6' y=" + y);
kvn@598 556 y = tsr.test7(0, new Point());
kvn@598 557 z += y;
kvn@598 558 System.out.println("After 'test7' y=" + y);
kvn@598 559 y = tsr.test8(0, 1, 0);
kvn@598 560 z += y;
kvn@598 561 System.out.println("After 'test8' y=" + y);
kvn@598 562 y = tsr.test9(0, 1, 0);
kvn@598 563 z += y;
kvn@598 564 System.out.println("After 'test9' y=" + y);
kvn@598 565 y = tsr.test10(0, 1, 0, cls);
kvn@598 566 z += y;
kvn@598 567 System.out.println("After 'test10' y=" + y);
kvn@598 568 y = tsr.test11(0);
kvn@598 569 z += y;
kvn@598 570 System.out.println("After 'test11' y=" + y);
kvn@598 571 y = tsr.test12(0);
kvn@598 572 z += y;
kvn@598 573 System.out.println("After 'test12' y=" + y);
kvn@598 574 System.out.println("Sum of y =" + z);
kvn@598 575 }
kvn@598 576 }

mercurial