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 * @test
0N/A * @bug 4486658
3203N/A * @compile -source 1.5 MapCheck.java
0N/A * @run main/timeout=240 MapCheck
0N/A * @summary Times and checks basic map operations
0N/A */
0N/A
0N/Aimport java.util.*;
0N/Aimport java.io.*;
0N/A
0N/Apublic class MapCheck {
0N/A
0N/A static final int absentSize = 1 << 17;
0N/A static final int absentMask = absentSize - 1;
0N/A static Object[] absent = new Object[absentSize];
0N/A
0N/A static final Object MISSING = new Object();
0N/A
0N/A static TestTimer timer = new TestTimer();
0N/A
0N/A static void reallyAssert(boolean b) {
0N/A if (!b) throw new Error("Failed Assertion");
0N/A }
0N/A
0N/A public static void main(String[] args) throws Exception {
0N/A Class mapClass = java.util.concurrent.ConcurrentHashMap.class;
0N/A int numTests = 8;
0N/A int size = 50000;
0N/A
0N/A if (args.length > 0) {
0N/A try {
0N/A mapClass = Class.forName(args[0]);
3203N/A } catch (ClassNotFoundException e) {
0N/A throw new RuntimeException("Class " + args[0] + " not found.");
0N/A }
0N/A }
0N/A
0N/A
0N/A if (args.length > 1)
0N/A numTests = Integer.parseInt(args[1]);
0N/A
0N/A if (args.length > 2)
0N/A size = Integer.parseInt(args[2]);
0N/A
0N/A boolean doSerializeTest = args.length > 3;
0N/A
0N/A System.out.println("Testing " + mapClass.getName() + " trials: " + numTests + " size: " + size);
0N/A
0N/A for (int i = 0; i < absentSize; ++i) absent[i] = new Object();
0N/A
0N/A Object[] key = new Object[size];
0N/A for (int i = 0; i < size; ++i) key[i] = new Object();
0N/A
0N/A forceMem(size * 8);
0N/A
0N/A for (int rep = 0; rep < numTests; ++rep) {
0N/A runTest(newMap(mapClass), key);
0N/A }
0N/A
0N/A TestTimer.printStats();
0N/A
0N/A
0N/A if (doSerializeTest)
0N/A stest(newMap(mapClass), size);
0N/A }
0N/A
0N/A static Map newMap(Class cl) {
0N/A try {
0N/A Map m = (Map)cl.newInstance();
0N/A return m;
3203N/A } catch (Exception e) {
0N/A throw new RuntimeException("Can't instantiate " + cl + ": " + e);
0N/A }
0N/A }
0N/A
0N/A
0N/A static void runTest(Map s, Object[] key) {
0N/A shuffle(key);
0N/A int size = key.length;
0N/A long startTime = System.currentTimeMillis();
0N/A test(s, key);
0N/A long time = System.currentTimeMillis() - startTime;
0N/A }
0N/A
0N/A static void forceMem(int n) {
0N/A // force enough memory
0N/A Long[] junk = new Long[n];
0N/A for (int i = 0; i < junk.length; ++i) junk[i] = new Long(i);
0N/A int sum = 0;
0N/A for (int i = 0; i < junk.length; ++i)
0N/A sum += (int)(junk[i].longValue() + i);
0N/A if (sum == 0) System.out.println("Useless number = " + sum);
0N/A junk = null;
0N/A // System.gc();
0N/A }
0N/A
0N/A
0N/A static void t1(String nm, int n, Map s, Object[] key, int expect) {
0N/A int sum = 0;
0N/A int iters = 4;
0N/A timer.start(nm, n * iters);
0N/A for (int j = 0; j < iters; ++j) {
0N/A for (int i = 0; i < n; i++) {
0N/A if (s.get(key[i]) != null) ++sum;
0N/A }
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == expect * iters);
0N/A }
0N/A
0N/A static void t2(String nm, int n, Map s, Object[] key, int expect) {
0N/A int sum = 0;
0N/A timer.start(nm, n);
0N/A for (int i = 0; i < n; i++) {
0N/A if (s.remove(key[i]) != null) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == expect);
0N/A }
0N/A
0N/A static void t3(String nm, int n, Map s, Object[] key, int expect) {
0N/A int sum = 0;
0N/A timer.start(nm, n);
0N/A for (int i = 0; i < n; i++) {
0N/A if (s.put(key[i], absent[i & absentMask]) == null) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == expect);
0N/A }
0N/A
0N/A static void t4(String nm, int n, Map s, Object[] key, int expect) {
0N/A int sum = 0;
0N/A timer.start(nm, n);
0N/A for (int i = 0; i < n; i++) {
0N/A if (s.containsKey(key[i])) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == expect);
0N/A }
0N/A
0N/A static void t5(String nm, int n, Map s, Object[] key, int expect) {
0N/A int sum = 0;
0N/A timer.start(nm, n/2);
0N/A for (int i = n-2; i >= 0; i-=2) {
0N/A if (s.remove(key[i]) != null) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == expect);
0N/A }
0N/A
0N/A static void t6(String nm, int n, Map s, Object[] k1, Object[] k2) {
0N/A int sum = 0;
0N/A timer.start(nm, n * 2);
0N/A for (int i = 0; i < n; i++) {
0N/A if (s.get(k1[i]) != null) ++sum;
0N/A if (s.get(k2[i & absentMask]) != null) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == n);
0N/A }
0N/A
0N/A static void t7(String nm, int n, Map s, Object[] k1, Object[] k2) {
0N/A int sum = 0;
0N/A timer.start(nm, n * 2);
0N/A for (int i = 0; i < n; i++) {
0N/A if (s.containsKey(k1[i])) ++sum;
0N/A if (s.containsKey(k2[i & absentMask])) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == n);
0N/A }
0N/A
0N/A static void t8(String nm, int n, Map s, Object[] key, int expect) {
0N/A int sum = 0;
0N/A timer.start(nm, n);
0N/A for (int i = 0; i < n; i++) {
0N/A if (s.get(key[i]) != null) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == expect);
0N/A }
0N/A
0N/A
0N/A static void t9(Map s) {
0N/A int sum = 0;
0N/A int iters = 20;
0N/A timer.start("ContainsValue (/n) ", iters * s.size());
0N/A int step = absentSize / iters;
0N/A for (int i = 0; i < absentSize; i += step)
0N/A if (s.containsValue(absent[i])) ++sum;
0N/A timer.finish();
3203N/A reallyAssert(sum != 0);
0N/A }
0N/A
0N/A
0N/A static void ktest(Map s, int size, Object[] key) {
0N/A timer.start("ContainsKey ", size);
0N/A Set ks = s.keySet();
0N/A int sum = 0;
0N/A for (int i = 0; i < size; i++) {
0N/A if (ks.contains(key[i])) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A }
0N/A
0N/A
0N/A static void ittest1(Map s, int size) {
0N/A int sum = 0;
0N/A timer.start("Iter Key ", size);
0N/A for (Iterator it = s.keySet().iterator(); it.hasNext(); ) {
3203N/A if (it.next() != MISSING)
0N/A ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A }
0N/A
0N/A static void ittest2(Map s, int size) {
0N/A int sum = 0;
0N/A timer.start("Iter Value ", size);
0N/A for (Iterator it = s.values().iterator(); it.hasNext(); ) {
3203N/A if (it.next() != MISSING)
0N/A ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A }
0N/A static void ittest3(Map s, int size) {
0N/A int sum = 0;
0N/A timer.start("Iter Entry ", size);
0N/A for (Iterator it = s.entrySet().iterator(); it.hasNext(); ) {
3203N/A if (it.next() != MISSING)
0N/A ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A }
0N/A
0N/A static void ittest4(Map s, int size, int pos) {
0N/A IdentityHashMap seen = new IdentityHashMap(size);
3203N/A reallyAssert(s.size() == size);
0N/A int sum = 0;
0N/A timer.start("Iter XEntry ", size);
0N/A Iterator it = s.entrySet().iterator();
0N/A Object k = null;
0N/A Object v = null;
0N/A for (int i = 0; i < size-pos; ++i) {
0N/A Map.Entry x = (Map.Entry)(it.next());
0N/A k = x.getKey();
0N/A v = x.getValue();
0N/A seen.put(k, k);
0N/A if (x != MISSING)
0N/A ++sum;
0N/A }
3203N/A reallyAssert(s.containsKey(k));
0N/A it.remove();
3203N/A reallyAssert(!s.containsKey(k));
0N/A while (it.hasNext()) {
0N/A Map.Entry x = (Map.Entry)(it.next());
0N/A Object k2 = x.getKey();
0N/A seen.put(k2, k2);
0N/A if (x != MISSING)
0N/A ++sum;
0N/A }
0N/A
3203N/A reallyAssert(s.size() == size-1);
0N/A s.put(k, v);
3203N/A reallyAssert(seen.size() == size);
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
3203N/A reallyAssert(s.size() == size);
0N/A }
0N/A
0N/A
0N/A static void ittest(Map s, int size) {
0N/A ittest1(s, size);
0N/A ittest2(s, size);
0N/A ittest3(s, size);
0N/A // for (int i = 0; i < size-1; ++i)
0N/A // ittest4(s, size, i);
0N/A }
0N/A
0N/A static void entest1(Hashtable ht, int size) {
0N/A int sum = 0;
0N/A
0N/A timer.start("Iter Enumeration Key ", size);
0N/A for (Enumeration en = ht.keys(); en.hasMoreElements(); ) {
0N/A if (en.nextElement() != MISSING)
0N/A ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A }
0N/A
0N/A static void entest2(Hashtable ht, int size) {
0N/A int sum = 0;
0N/A timer.start("Iter Enumeration Value ", size);
0N/A for (Enumeration en = ht.elements(); en.hasMoreElements(); ) {
0N/A if (en.nextElement() != MISSING)
0N/A ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A }
0N/A
0N/A
0N/A static void entest3(Hashtable ht, int size) {
0N/A int sum = 0;
0N/A
0N/A timer.start("Iterf Enumeration Key ", size);
0N/A Enumeration en = ht.keys();
0N/A for (int i = 0; i < size; ++i) {
0N/A if (en.nextElement() != MISSING)
0N/A ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A }
0N/A
0N/A static void entest4(Hashtable ht, int size) {
0N/A int sum = 0;
0N/A timer.start("Iterf Enumeration Value", size);
0N/A Enumeration en = ht.elements();
0N/A for (int i = 0; i < size; ++i) {
0N/A if (en.nextElement() != MISSING)
0N/A ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A }
0N/A
0N/A static void entest(Map s, int size) {
0N/A if (s instanceof Hashtable) {
0N/A Hashtable ht = (Hashtable)s;
0N/A // entest3(ht, size);
0N/A // entest4(ht, size);
0N/A entest1(ht, size);
0N/A entest2(ht, size);
0N/A entest1(ht, size);
0N/A entest2(ht, size);
0N/A entest1(ht, size);
0N/A entest2(ht, size);
0N/A }
0N/A }
0N/A
0N/A static void rtest(Map s, int size) {
0N/A timer.start("Remove (iterator) ", size);
0N/A for (Iterator it = s.keySet().iterator(); it.hasNext(); ) {
0N/A it.next();
0N/A it.remove();
0N/A }
0N/A timer.finish();
0N/A }
0N/A
0N/A static void rvtest(Map s, int size) {
0N/A timer.start("Remove (iterator) ", size);
0N/A for (Iterator it = s.values().iterator(); it.hasNext(); ) {
0N/A it.next();
0N/A it.remove();
0N/A }
0N/A timer.finish();
0N/A }
0N/A
0N/A
0N/A static void dtest(Map s, int size, Object[] key) {
0N/A timer.start("Put (putAll) ", size * 2);
0N/A Map s2 = null;
0N/A try {
0N/A s2 = (Map) (s.getClass().newInstance());
0N/A s2.putAll(s);
0N/A }
0N/A catch (Exception e) { e.printStackTrace(); return; }
0N/A timer.finish();
0N/A
0N/A timer.start("Iter Equals ", size * 2);
0N/A boolean eqt = s2.equals(s) && s.equals(s2);
3203N/A reallyAssert(eqt);
0N/A timer.finish();
0N/A
0N/A timer.start("Iter HashCode ", size * 2);
0N/A int shc = s.hashCode();
0N/A int s2hc = s2.hashCode();
3203N/A reallyAssert(shc == s2hc);
0N/A timer.finish();
0N/A
0N/A timer.start("Put (present) ", size);
0N/A s2.putAll(s);
0N/A timer.finish();
0N/A
0N/A timer.start("Iter EntrySet contains ", size * 2);
0N/A Set es2 = s2.entrySet();
0N/A int sum = 0;
0N/A for (Iterator i1 = s.entrySet().iterator(); i1.hasNext(); ) {
0N/A Object entry = i1.next();
0N/A if (es2.contains(entry)) ++sum;
0N/A }
0N/A timer.finish();
3203N/A reallyAssert(sum == size);
0N/A
0N/A t6("Get ", size, s2, key, absent);
0N/A
0N/A Object hold = s2.get(key[size-1]);
0N/A s2.put(key[size-1], absent[0]);
0N/A timer.start("Iter Equals ", size * 2);
0N/A eqt = s2.equals(s) && s.equals(s2);
3203N/A reallyAssert(!eqt);
0N/A timer.finish();
0N/A
0N/A timer.start("Iter HashCode ", size * 2);
0N/A int s1h = s.hashCode();
0N/A int s2h = s2.hashCode();
3203N/A reallyAssert(s1h != s2h);
0N/A timer.finish();
0N/A
0N/A s2.put(key[size-1], hold);
0N/A timer.start("Remove (iterator) ", size * 2);
0N/A Iterator s2i = s2.entrySet().iterator();
0N/A Set es = s.entrySet();
0N/A while (s2i.hasNext())
0N/A es.remove(s2i.next());
0N/A timer.finish();
0N/A
3203N/A reallyAssert(s.isEmpty());
0N/A
0N/A timer.start("Clear ", size);
0N/A s2.clear();
0N/A timer.finish();
3203N/A reallyAssert(s2.isEmpty() && s.isEmpty());
0N/A }
0N/A
0N/A static void stest(Map s, int size) throws Exception {
0N/A if (!(s instanceof Serializable))
0N/A return;
0N/A System.out.print("Serialize : ");
0N/A
0N/A for (int i = 0; i < size; i++) {
0N/A s.put(new Integer(i), Boolean.TRUE);
0N/A }
0N/A
0N/A long startTime = System.currentTimeMillis();
0N/A
0N/A FileOutputStream fs = new FileOutputStream("MapCheck.dat");
0N/A ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(fs));
0N/A out.writeObject(s);
0N/A out.close();
0N/A
0N/A FileInputStream is = new FileInputStream("MapCheck.dat");
0N/A ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(is));
0N/A Map m = (Map)in.readObject();
0N/A
0N/A long endTime = System.currentTimeMillis();
0N/A long time = endTime - startTime;
0N/A
0N/A System.out.print(time + "ms");
0N/A
0N/A if (s instanceof IdentityHashMap) return;
3203N/A reallyAssert(s.equals(m));
0N/A }
0N/A
0N/A
0N/A static void test(Map s, Object[] key) {
0N/A int size = key.length;
0N/A
0N/A t3("Put (absent) ", size, s, key, size);
0N/A t3("Put (present) ", size, s, key, 0);
0N/A t7("ContainsKey ", size, s, key, absent);
0N/A t4("ContainsKey ", size, s, key, size);
0N/A ktest(s, size, key);
0N/A t4("ContainsKey ", absentSize, s, absent, 0);
0N/A t6("Get ", size, s, key, absent);
0N/A t1("Get (present) ", size, s, key, size);
0N/A t1("Get (absent) ", absentSize, s, absent, 0);
0N/A t2("Remove (absent) ", absentSize, s, absent, 0);
0N/A t5("Remove (present) ", size, s, key, size / 2);
0N/A t3("Put (half present) ", size, s, key, size / 2);
0N/A
0N/A ittest(s, size);
0N/A entest(s, size);
0N/A t9(s);
0N/A rtest(s, size);
0N/A
0N/A t4("ContainsKey ", size, s, key, 0);
0N/A t2("Remove (absent) ", size, s, key, 0);
0N/A t3("Put (presized) ", size, s, key, size);
0N/A dtest(s, size, key);
0N/A }
0N/A
0N/A static class TestTimer {
0N/A private String name;
0N/A private long numOps;
0N/A private long startTime;
0N/A private String cname;
0N/A
0N/A static final java.util.TreeMap accum = new java.util.TreeMap();
0N/A
0N/A static void printStats() {
0N/A for (Iterator it = accum.entrySet().iterator(); it.hasNext(); ) {
0N/A Map.Entry e = (Map.Entry)(it.next());
0N/A Stats stats = ((Stats)(e.getValue()));
0N/A int n = stats.number;
0N/A double t;
0N/A if (n > 0)
0N/A t = stats.sum / n;
0N/A else
0N/A t = stats.least;
0N/A long nano = Math.round(1000000.0 * t);
0N/A System.out.println(e.getKey() + ": " + nano);
0N/A }
0N/A }
0N/A
0N/A void start(String name, long numOps) {
0N/A this.name = name;
0N/A this.cname = classify();
0N/A this.numOps = numOps;
0N/A startTime = System.currentTimeMillis();
0N/A }
0N/A
0N/A
0N/A String classify() {
0N/A if (name.startsWith("Get"))
0N/A return "Get ";
0N/A else if (name.startsWith("Put"))
0N/A return "Put ";
0N/A else if (name.startsWith("Remove"))
0N/A return "Remove ";
0N/A else if (name.startsWith("Iter"))
0N/A return "Iter ";
0N/A else
0N/A return null;
0N/A }
0N/A
0N/A void finish() {
0N/A long endTime = System.currentTimeMillis();
0N/A long time = endTime - startTime;
0N/A double timePerOp = ((double)time)/numOps;
0N/A
0N/A Object st = accum.get(name);
0N/A if (st == null)
0N/A accum.put(name, new Stats(timePerOp));
0N/A else {
0N/A Stats stats = (Stats) st;
0N/A stats.sum += timePerOp;
0N/A stats.number++;
0N/A if (timePerOp < stats.least) stats.least = timePerOp;
0N/A }
0N/A
0N/A if (cname != null) {
0N/A st = accum.get(cname);
0N/A if (st == null)
0N/A accum.put(cname, new Stats(timePerOp));
0N/A else {
0N/A Stats stats = (Stats) st;
0N/A stats.sum += timePerOp;
0N/A stats.number++;
0N/A if (timePerOp < stats.least) stats.least = timePerOp;
0N/A }
0N/A }
0N/A
0N/A }
0N/A
0N/A }
0N/A
0N/A static class Stats {
0N/A double sum = 0;
0N/A double least;
0N/A int number = 0;
0N/A Stats(double t) { least = t; }
0N/A }
0N/A
0N/A static Random rng = new Random();
0N/A
0N/A static void shuffle(Object[] keys) {
0N/A int size = keys.length;
0N/A for (int i=size; i>1; i--) {
0N/A int r = rng.nextInt(i);
0N/A Object t = keys[i-1];
0N/A keys[i-1] = keys[r];
0N/A keys[r] = t;
0N/A }
0N/A }
0N/A
0N/A}