1 /* 2 * Copyright (c) 2017, Red Hat, Inc. and/or its affiliates. 3 * 4 * This code is free software; you can redistribute it and/or modify it 5 * under the terms of the GNU General Public License version 2 only, as 6 * published by the Free Software Foundation. 7 * 8 * This code is distributed in the hope that it will be useful, but WITHOUT 9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 11 * version 2 for more details (a copy is included in the LICENSE file that 12 * accompanied this code). 13 * 14 * You should have received a copy of the GNU General Public License version 15 * 2 along with this work; if not, write to the Free Software Foundation, 16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 17 * 18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 19 * or visit www.oracle.com if you need additional information or have any 20 * questions. 21 * 22 */ 23 24 /* 25 * @test HeapUncommit 26 * @summary Acceptance tests: collector can withstand allocation 27 * 28 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=passive -XX:ShenandoahUncommitDelay=0 -XX:+ShenandoahDegeneratedGC -XX:+ShenandoahVerify HeapUncommit 29 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=passive -XX:ShenandoahUncommitDelay=0 -XX:-ShenandoahDegeneratedGC -XX:+ShenandoahVerify HeapUncommit 30 * 31 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=adaptive -XX:ShenandoahUncommitDelay=0 -XX:+ShenandoahVerify HeapUncommit 32 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=static -XX:ShenandoahUncommitDelay=0 -XX:+ShenandoahVerify HeapUncommit 33 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=compact -XX:ShenandoahUncommitDelay=0 -XX:+ShenandoahVerify HeapUncommit 34 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=aggressive -XX:ShenandoahUncommitDelay=0 -XX:+ShenandoahVerify HeapUncommit 35 * 36 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=passive -XX:ShenandoahUncommitDelay=0 HeapUncommit 37 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=adaptive -XX:ShenandoahUncommitDelay=0 HeapUncommit 38 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=static -XX:ShenandoahUncommitDelay=0 HeapUncommit 39 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=compact -XX:ShenandoahUncommitDelay=0 HeapUncommit 40 * @run main/othervm -XX:+UseShenandoahGC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -Xmx1g -XX:+ShenandoahUncommit -XX:ShenandoahGCHeuristics=aggressive -XX:ShenandoahUncommitDelay=0 HeapUncommit 41 */ 42 43 import java.util.Random; 44 45 public class HeapUncommit { 46 47 static final long TARGET_MB = Long.getLong("target", 10_000); // 10 Gb allocation 48 49 static volatile Object sink; 50 51 public static void main(String[] args) throws Exception { 52 final int min = 0; 53 final int max = 384*1024; 54 long count = TARGET_MB * 1024 * 1024 / (16 + 4*(min + (max-min)/2)); 55 56 Random r = new Random(); 57 for (long c = 0; c < count; c++) { 58 sink = new int[min + r.nextInt(max-min)]; 59 } 60 } 61 62 }