test/hotspot/jtreg/vmTestbase/gc/gctests/SoftReference/soft001/soft001.java
changeset 50168 2f59dc95847d
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/test/hotspot/jtreg/vmTestbase/gc/gctests/SoftReference/soft001/soft001.java	Thu May 17 14:52:47 2018 -0700
@@ -0,0 +1,201 @@
+/*
+ * Copyright (c) 2004, 2018, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @key stress gc
+ *
+ * @summary converted from VM Testbase gc/gctests/SoftReference/soft001.
+ * VM Testbase keywords: [gc, stress, stressopt, nonconcurrent]
+ * VM Testbase readme:
+ * DESCRIPTION
+ *     The test checks that Garbage Collector correctly works with
+ *     SoftReferences. It also checks that no unexpected exceptions and errors
+ *     are thrown or the JVM is not crashed.
+ *     The test starts a number of threads. Each thread run tests for some time
+ *     or serveral iterations.  See javadoc StressOptions for configuration.
+ *     First of all each thread defines what type to check (there are 10 types
+ *     totally). As soon as the type is defined, a SoftRefence is created that
+ *     refers to an array of tested type and is registered with in a queue. A
+ *     SoftRefence for NonbranchyTree class does not refer to an array, but to
+ *     instances of the class.
+ *     After that a thread performs next checks for the reference:
+ *         1. The reference is in queue after GC is provoked with
+ *            Algorithms.eatMemory() method (a single thread eats the memory).
+ *         2. queue.remove() returns reference from the queue.
+ *         3. queue.poll() returns null.
+ *         4. reference.clear() does not throw any exception.
+ *     The test extends ThreadedGCTest and implements GarbageProducerAware and
+ *     MemoryStrategyAware interfaces. The corresponding javadoc documentation
+ *     for additional test configuration.
+ *
+ * @library /vmTestbase
+ *          /test/lib
+ * @run driver jdk.test.lib.FileInstaller . .
+ * @run main/othervm gc.gctests.SoftReference.soft001.soft001 -ms low
+ */
+
+package gc.gctests.SoftReference.soft001;
+
+import java.lang.ref.Reference;
+import java.lang.ref.ReferenceQueue;
+import java.lang.ref.SoftReference;
+
+import nsk.share.gc.GC;
+import nsk.share.gc.NonbranchyTree;
+import nsk.share.gc.ThreadedGCTest;
+import nsk.share.gc.gp.GarbageProducer;
+import nsk.share.gc.gp.GarbageProducerAware;
+import nsk.share.gc.gp.GarbageUtils;
+import nsk.share.gc.gp.MemoryStrategy;
+import nsk.share.gc.gp.MemoryStrategyAware;
+import nsk.share.gc.gp.string.InternedStringProducer;
+import nsk.share.gc.gp.string.RandomStringProducer;
+
+public class soft001 extends ThreadedGCTest implements GarbageProducerAware, MemoryStrategyAware {
+
+    private GarbageProducer garbageProducer;
+    private InternedStringProducer internedStringProducer = new InternedStringProducer(new RandomStringProducer(10));
+    private MemoryStrategy memoryStrategy;
+    // Total number of types to test
+    final static int TYPES_COUNT = 11;
+    // Size of array of each tested type. The constant also specifies the
+    // number of nodes in a NonbranchyTree and size of each node
+    final static int SIZE = 100;
+
+    protected Runnable createRunnable(int i) {
+        return new Test();
+    }
+
+    public void setGarbageProducer(GarbageProducer garbageProducer) {
+        this.garbageProducer = garbageProducer;
+    }
+
+    public void setMemoryStrategy(MemoryStrategy memoryStrategy) {
+        this.memoryStrategy = memoryStrategy;
+    }
+
+    public static void main(String[] args) {
+        GC.runTest(new soft001(), args);
+    }
+
+    // The class implements the logic of the testcase
+    class Test implements Runnable {
+
+        int iteration;
+
+        public void run() {
+            // Pre-allocated OOME message to avoid OOME when logging it
+            String oomMsg = "Ignored OOME in run()";
+            try {
+
+                log.info("iteration " + iteration);
+                ReferenceQueue queue = new ReferenceQueue();
+                SoftReference reference;
+                int code = iteration % TYPES_COUNT;
+                String type;
+                // Define a specific type for each thread to test
+                switch (code) {
+                    case 0:
+                        reference = new SoftReference(new byte[SIZE], queue);
+                        type = "byte";
+                        break;
+                    case 1:
+                        reference = new SoftReference(new short[SIZE], queue);
+                        type = "short";
+                        break;
+                    case 2:
+                        reference = new SoftReference(new int[SIZE], queue);
+                        type = "int";
+                        break;
+                    case 3:
+                        reference = new SoftReference(new long[SIZE], queue);
+                        type = "long";
+                        break;
+                    case 4:
+                        reference = new SoftReference(new char[SIZE], queue);
+                        type = "char";
+                        break;
+                    case 5:
+                        reference = new SoftReference(new boolean[SIZE], queue);
+                        type = "boolean";
+                        break;
+                    case 6:
+                        reference = new SoftReference(new double[SIZE], queue);
+                        type = "double";
+                        break;
+                    case 7:
+                        reference = new SoftReference(new float[SIZE], queue);
+                        type = "float";
+                        break;
+                    case 8:
+                        reference = new SoftReference(new Object[SIZE], queue);
+                        type = "Object";
+                        break;
+                    case 9:
+                        reference = new SoftReference(internedStringProducer.create(SIZE), queue);
+                        type = "InternedString";
+                        break;
+                    default:
+                        reference = new SoftReference(new NonbranchyTree(SIZE, 0.3f, SIZE),
+                                queue);
+                        type = "NonbranchyTree";
+                        break;
+                }
+                int initialFactor = memoryStrategy.equals(MemoryStrategy.HIGH) ? 1 : (memoryStrategy.equals(MemoryStrategy.LOW) ? 10 : 2);
+                GarbageUtils.eatMemory(getExecutionController(), garbageProducer, initialFactor , 10, 0);
+                if (!getExecutionController().continueExecution()) {
+                    // we were interrrupted by stresser. just exit...
+                    return;
+                }
+                Reference polledReference = null;
+                try {
+                    polledReference = queue.remove();
+                } catch (InterruptedException e) {
+                    log.error("Unexpected InterruptedException during queue.remove().");
+                    setFailed(true);
+                }
+                // Check the reference and the queue
+                // The polled reference must be equal to the one enqueued to
+                // the queue
+
+                if (polledReference != reference) {
+                    log.error("The original reference is not equal to polled reference.");
+                    setFailed(true);
+                }
+
+                // queue.poll() once again must return null now, since there is
+                // only one reference in the queue
+                polledReference = queue.poll();
+                if (polledReference != null) {
+                    log.error("There are more  than one references in the queue.");
+                    setFailed(true);
+                }
+                reference.clear();
+            } catch (OutOfMemoryError e) {
+                log.info(oomMsg);
+            }
+            iteration++;
+        }
+    }
+}