LoopHelpers.java revision 3203
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 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 * 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 * 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. 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 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 * 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 0N/A * Misc utilities in JSR166 performance tests 0N/A // Some mindless computation to do between synchronizations... 0N/A * generates 32 bit pseudo-random numbers. 0N/A int lo =
16807 * (x &
0xFFFF);
0N/A int hi =
16807 * (x >>>
16);
0N/A if ((
lo &
0x80000000) !=
0) {
0N/A if (
lo ==
0 || (
lo &
0x80000000) !=
0) {
0N/A * Computes a linear congruential random number a random number 0N/A x = (x *
2147483647) %
16807;
0N/A * An actually useful random number generator, but unsynchronized. 0N/A * Basically same as java.util.Random. 3203N/A private static final long mask = (
1L <<
48) -
1;
0N/A // There's probably a better way to do this...