< prev index next >

test/hotspot/jtreg/vmTestbase/gc/gctests/JumbleGC002/JumbleGC002.java

Print this page
rev 59093 : [mq]: randomness-code_vmTestbase_gc
rev 59094 : imported patch randomness-keyword_vmTestbase_gc
rev 59095 : imported patch 8243430.00

*** 1,7 **** /* ! * Copyright (c) 2003, 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. --- 1,7 ---- /* ! * Copyright (c) 2003, 2020, 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.
*** 21,31 **** * questions. */ /* * @test ! * @key stress gc * * @summary converted from VM Testbase gc/gctests/JumbleGC002. * VM Testbase keywords: [gc, stress, stressopt, nonconcurrent, quarantine] * VM Testbase readme: * DESCRIPTION --- 21,31 ---- * questions. */ /* * @test ! * @key stress gc randomness * * @summary converted from VM Testbase gc/gctests/JumbleGC002. * VM Testbase keywords: [gc, stress, stressopt, nonconcurrent, quarantine] * VM Testbase readme: * DESCRIPTION
*** 56,69 **** package gc.gctests.JumbleGC002; import java.io.*; import java.util.*; - import java.util.concurrent.ThreadLocalRandom; import nsk.share.*; import nsk.share.gc.*; /** * This test simply does Algorithms.eatMemory() in a loop * in multiple threads. */ --- 56,69 ---- package gc.gctests.JumbleGC002; import java.io.*; import java.util.*; import nsk.share.*; import nsk.share.gc.*; + import nsk.share.test.LocalRandom; /** * This test simply does Algorithms.eatMemory() in a loop * in multiple threads. */
*** 87,97 **** private Vector vector; int numberOfElements; int numberOfQuarters; int id; int nodes; - ThreadLocalRandom random = ThreadLocalRandom.current(); public Eater(int id, int numberOfQuarters, int nodes) { this.numberOfQuarters = numberOfQuarters; numberOfElements = 4 * numberOfQuarters; this.id = id; --- 87,96 ----
*** 121,148 **** // element in the quarter is a NonbranchyTree. private void fillVector() { for (int i = 0; i < numberOfQuarters; i++) { // Append initialized long[] ! int length = random.nextInt(ARRAY_MAX_LENGTH); long[] l = new long[length]; for (int j = 0; j < length; j++) { l[j] = (long) j; } if (vector.elementAt(4 * i) == null) { vector.setElementAt(l, 4 * i); } // Append not initialized double[] ! length = random.nextInt(ARRAY_MAX_LENGTH); double[] d = new double[length]; if (vector.elementAt(4 * i + 1) == null) { vector.setElementAt(d, 4 * i + 1); } // Append initialized int[] ! length = random.nextInt(ARRAY_MAX_LENGTH); int[] n = new int[length]; for (int j = 0; j < length; j++) { n[j] = j; } if (vector.elementAt(4 * i + 2) == null) { --- 120,147 ---- // element in the quarter is a NonbranchyTree. private void fillVector() { for (int i = 0; i < numberOfQuarters; i++) { // Append initialized long[] ! int length = LocalRandom.nextInt(ARRAY_MAX_LENGTH); long[] l = new long[length]; for (int j = 0; j < length; j++) { l[j] = (long) j; } if (vector.elementAt(4 * i) == null) { vector.setElementAt(l, 4 * i); } // Append not initialized double[] ! length = LocalRandom.nextInt(ARRAY_MAX_LENGTH); double[] d = new double[length]; if (vector.elementAt(4 * i + 1) == null) { vector.setElementAt(d, 4 * i + 1); } // Append initialized int[] ! length = LocalRandom.nextInt(ARRAY_MAX_LENGTH); int[] n = new int[length]; for (int j = 0; j < length; j++) { n[j] = j; } if (vector.elementAt(4 * i + 2) == null) {
*** 160,170 **** } } // Drop references to half of the elements of the vector private void cleanVector() { ! int index = random.nextInt(numberOfElements / 2); for (int i = index; i < index + numberOfElements / 2; i++) { vector.setElementAt(null, i); } } } --- 159,169 ---- } } // Drop references to half of the elements of the vector private void cleanVector() { ! int index = LocalRandom.nextInt(numberOfElements / 2); for (int i = index; i < index + numberOfElements / 2; i++) { vector.setElementAt(null, i); } } }
< prev index next >