1 /* 2 * Copyright (c) 2013, 2018, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 package metaspace.stressHierarchy.common; 24 25 import nsk.share.test.ExecutionController; 26 import nsk.share.test.Tests; 27 import metaspace.stressHierarchy.common.classloader.tree.Tree; 28 29 /** 30 * Test checks that ancestors will not be reclaimed while references on descenders are alive. 31 * We create hierarchy of classes, each loaded by dedicated classloader. Then we cleanup 32 * references to all nodes except those that are in bottom level. Finally we check that classes 33 * in bottom level are alive. 34 */ 35 public class StressHierarchy1 extends StressHierarchyBaseClass { 36 37 public static void main(String[] args) { 38 try { 39 StressHierarchyBaseClass.args = args; 40 Tests.runTest(new StressHierarchy1(), args); 41 } catch (OutOfMemoryError error) { 42 System.out.print("Got OOME: " + error.getMessage()); 43 } 44 } 45 46 @Override 47 protected void runTestLogic(Tree tree, ExecutionController stresser) 48 throws Throwable { 49 50 for (int cleanupLevel = tree.getMaxLevel() - 1; cleanupLevel > 1; cleanupLevel--) { 51 tree.cleanupLevel(cleanupLevel); 52 log.info("cleanupLevel=" + cleanupLevel); 53 triggerUnloadingHelper.triggerUnloading(stresser); 54 if (!stresser.continueExecution()) { 55 // pass test 56 return; 57 } 58 } 59 60 log.info("Check bottom level"); 61 performChecksHelper.checkLevelAlive(tree, tree.getMaxLevel()); 62 } 63 64 }