1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/test/compiler/6863420/Test.java Sun Jul 26 16:40:14 2009 -0700
1.3 @@ -0,0 +1,91 @@
1.4 +/*
1.5 + * Copyright 2009 D.E. Shaw. All Rights Reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation.
1.11 + *
1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.15 + * version 2 for more details (a copy is included in the LICENSE file that
1.16 + * accompanied this code).
1.17 + *
1.18 + * You should have received a copy of the GNU General Public License version
1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.21 + *
1.22 + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or
1.24 + * have any questions.
1.25 + *
1.26 + */
1.27 +
1.28 +/**
1.29 + * @test
1.30 + * @bug 6863420
1.31 + * @summary os::javaTimeNanos() go backward on Solaris x86
1.32 + *
1.33 + * @run main/othervm Test
1.34 + */
1.35 +
1.36 +public class Test {
1.37 + static long value = 0;
1.38 + static boolean got_backward_time = false;
1.39 +
1.40 + public static void main(String args[]) {
1.41 + final int count = 100000;
1.42 +
1.43 + for (int numThreads = 1; numThreads <= 32; numThreads++) {
1.44 + final int numRuns = 1;
1.45 + for (int t=1; t <= numRuns; t++) {
1.46 + final int curRun = t;
1.47 +
1.48 + System.out.println("Spawning " + numThreads + " threads");
1.49 + final Thread threads[] = new Thread[numThreads];
1.50 + for (int i = 0; i < threads.length; i++) {
1.51 + Runnable thread =
1.52 + new Runnable() {
1.53 + public void run() {
1.54 + for (long l = 0; l < 100000; l++) {
1.55 + final long start = System.nanoTime();
1.56 + if (value == 12345678) {
1.57 + System.out.println("Wow!");
1.58 + }
1.59 + final long end = System.nanoTime();
1.60 + final long time = end - start;
1.61 + value += time;
1.62 + if (time < 0) {
1.63 + System.out.println(
1.64 + "Backwards: " +
1.65 + "start=" + start + " " +
1.66 + "end=" + end + " " +
1.67 + "time= " + time
1.68 + );
1.69 + got_backward_time = true;
1.70 + }
1.71 + }
1.72 + }
1.73 + };
1.74 + threads[i] = new Thread(thread, "Thread" + i);
1.75 + }
1.76 + for (int i = 0; i < threads.length; i++) {
1.77 + threads[i].start();
1.78 + }
1.79 + for (int i = 0; i < threads.length; i++) {
1.80 + try {
1.81 + threads[i].join();
1.82 + }
1.83 + catch (InterruptedException e) {
1.84 + continue;
1.85 + }
1.86 + }
1.87 + }
1.88 + }
1.89 +
1.90 + if (got_backward_time) {
1.91 + System.exit(97);
1.92 + }
1.93 + }
1.94 +}
