0N/A/*
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A * This file is available under and governed by the GNU General Public
0N/A * License version 2 only, as published by the Free Software Foundation.
0N/A * However, the following notice accompanied the original version of this
0N/A * file:
0N/A *
0N/A * Written by Doug Lea with assistance from members of JCP JSR-166
0N/A * Expert Group and released to the public domain, as explained at
3984N/A * http://creativecommons.org/publicdomain/zero/1.0/
0N/A */
0N/A
0N/A/**
0N/A * Misc utilities in JSR166 performance tests
0N/A */
0N/A
0N/Aimport java.util.concurrent.*;
0N/Aimport java.util.concurrent.atomic.*;
0N/A
0N/Aclass LoopHelpers {
0N/A
0N/A // Some mindless computation to do between synchronizations...
0N/A
0N/A /**
0N/A * generates 32 bit pseudo-random numbers.
0N/A * Adapted from http://www.snippets.org
0N/A */
0N/A public static int compute1(int x) {
0N/A int lo = 16807 * (x & 0xFFFF);
0N/A int hi = 16807 * (x >>> 16);
0N/A lo += (hi & 0x7FFF) << 16;
0N/A if ((lo & 0x80000000) != 0) {
0N/A lo &= 0x7fffffff;
0N/A ++lo;
0N/A }
0N/A lo += hi >>> 15;
0N/A if (lo == 0 || (lo & 0x80000000) != 0) {
0N/A lo &= 0x7fffffff;
0N/A ++lo;
0N/A }
0N/A return lo;
0N/A }
0N/A
0N/A /**
0N/A * Computes a linear congruential random number a random number
0N/A * of times.
0N/A */
0N/A public static int compute2(int x) {
0N/A int loops = (x >>> 4) & 7;
0N/A while (loops-- > 0) {
0N/A x = (x * 2147483647) % 16807;
0N/A }
0N/A return x;
0N/A }
0N/A
0N/A /**
0N/A * An actually useful random number generator, but unsynchronized.
0N/A * Basically same as java.util.Random.
0N/A */
0N/A public static class SimpleRandom {
3203N/A private static final long multiplier = 0x5DEECE66DL;
3203N/A private static final long addend = 0xBL;
3203N/A private static final long mask = (1L << 48) - 1;
0N/A static final AtomicLong seq = new AtomicLong(1);
0N/A private long seed = System.nanoTime() + seq.getAndIncrement();
0N/A
0N/A public void setSeed(long s) {
0N/A seed = s;
0N/A }
0N/A
0N/A public int next() {
0N/A long nextseed = (seed * multiplier + addend) & mask;
0N/A seed = nextseed;
0N/A return ((int)(nextseed >>> 17)) & 0x7FFFFFFF;
0N/A }
0N/A }
0N/A
0N/A public static class BarrierTimer implements Runnable {
0N/A public volatile long startTime;
0N/A public volatile long endTime;
0N/A public void run() {
0N/A long t = System.nanoTime();
0N/A if (startTime == 0)
0N/A startTime = t;
0N/A else
0N/A endTime = t;
0N/A }
0N/A public void clear() {
0N/A startTime = 0;
0N/A endTime = 0;
0N/A }
0N/A public long getTime() {
0N/A return endTime - startTime;
0N/A }
0N/A }
0N/A
0N/A public static String rightJustify(long n) {
0N/A // There's probably a better way to do this...
0N/A String field = " ";
0N/A String num = Long.toString(n);
0N/A if (num.length() >= field.length())
0N/A return num;
0N/A StringBuffer b = new StringBuffer(field);
0N/A b.replace(b.length()-num.length(), b.length(), num);
0N/A return b.toString();
0N/A }
0N/A
0N/A}