Initial load
diff --git a/test/java/util/Random/DistinctSeeds.java b/test/java/util/Random/DistinctSeeds.java
new file mode 100644
index 0000000..795051b
--- /dev/null
+++ b/test/java/util/Random/DistinctSeeds.java
@@ -0,0 +1,50 @@
+/*
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ */
+
+/*
+ * This file is available under and governed by the GNU General Public
+ * License version 2 only, as published by the Free Software Foundation.
+ * However, the following notice accompanied the original version of this
+ * file:
+ *
+ * Written by Doug Lea with assistance from members of JCP JSR-166
+ * Expert Group and released to the public domain, as explained at
+ * http://creativecommons.org/licenses/publicdomain
+ */
+
+/*
+ * @test
+ * @bug 4949279
+ * @summary Independent instantiations of Random() have distinct seeds.
+ */
+
+import java.util.Random;
+
+public class DistinctSeeds {
+    public static void main(String[] args) throws Exception {
+        // Strictly speaking, it is possible for these to randomly fail,
+        // but the probability should be *extremely* small (< 2**-63).
+        if (new Random().nextLong() == new Random().nextLong() ||
+            new Random().nextLong() == new Random().nextLong())
+            throw new RuntimeException("Random() seeds not unique.");
+    }
+}
diff --git a/test/java/util/Random/NextBytes.java b/test/java/util/Random/NextBytes.java
new file mode 100644
index 0000000..2b67a06
--- /dev/null
+++ b/test/java/util/Random/NextBytes.java
@@ -0,0 +1,61 @@
+/*
+ * Copyright 2005 Sun Microsystems, Inc.  All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ */
+
+/*
+ * @test
+ * @bug 4261170
+ * @summary Tests for Random.nextBytes
+ * @author Martin Buchholz
+ */
+
+import java.util.*;
+
+public class NextBytes {
+    private static void realMain(String[] args) throws Throwable {
+        byte[] expected = new byte[]
+            {27, -105, -24, 83, -77, -29, 119, -74, -106, 68, 54};
+        Random r = new java.util.Random(2398579034L);
+        for (int i = 0; i <= expected.length; i++) {
+            r.setSeed(2398579034L);
+            byte[] actual = new byte[i];
+            r.nextBytes(actual);
+            //System.out.println(Arrays.toString(actual));
+            check(Arrays.equals(actual, Arrays.copyOf(expected,i)));
+        }
+    }
+
+    //--------------------- Infrastructure ---------------------------
+    static volatile int passed = 0, failed = 0;
+    static void pass() {passed++;}
+    static void fail() {failed++; Thread.dumpStack();}
+    static void fail(String msg) {System.out.println(msg); fail();}
+    static void unexpected(Throwable t) {failed++; t.printStackTrace();}
+    static void check(boolean cond) {if (cond) pass(); else fail();}
+    static void equal(Object x, Object y) {
+        if (x == null ? y == null : x.equals(y)) pass();
+        else fail(x + " not equal to " + y);}
+    public static void main(String[] args) throws Throwable {
+        try {realMain(args);} catch (Throwable t) {unexpected(t);}
+        System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
+        if (failed > 0) throw new AssertionError("Some tests failed");}
+}
diff --git a/test/java/util/Random/NextIntPowerOfTwoMod.java b/test/java/util/Random/NextIntPowerOfTwoMod.java
new file mode 100644
index 0000000..d4faf83
--- /dev/null
+++ b/test/java/util/Random/NextIntPowerOfTwoMod.java
@@ -0,0 +1,42 @@
+/*
+ * Copyright 1999 Sun Microsystems, Inc.  All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ */
+
+/**
+ * @test
+ * @bug 4187412
+ * @summary The FCS release of 1.2 did not special case the Random.nextInt
+ *          calculation for a power of two modulus, as mandated by the spec.
+ */
+
+import java.util.Random;
+
+public class NextIntPowerOfTwoMod {
+    public static void main(String[] args) throws Exception {
+        Random r = new Random(69);
+        int total = 0;
+        for (int i=0; i<1000; i++)
+            total += r.nextInt(16);
+        if (total != 7639)
+            throw new RuntimeException("Not using correct algorithm.");
+    }
+}