1 /* 2 * Copyright (c) 2017, Google 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 24 package MyPackage; 25 26 /** 27 * @test 28 * @summary Checks the Recent garbage storage system. 29 * @build Frame 30 * @compile HeapMonitorRecentTest.java 31 * @run main/othervm/native -agentlib:HeapMonitor MyPackage.HeapMonitorRecentTest 32 */ 33 34 import java.io.PrintStream; 35 36 public class HeapMonitorRecentTest { 37 38 static { 39 try { 40 System.loadLibrary("HeapMonitor"); 41 } catch (UnsatisfiedLinkError ule) { 42 System.err.println("Could not load HeapMonitor library"); 43 System.err.println("java.library.path: " 44 + System.getProperty("java.library.path")); 45 throw ule; 46 } 47 } 48 49 native static int checkLiveOrRecentFrames(Frame[] frames); 50 native static int checkLiveAndRecentFrames(Frame[] frames); 51 native static int enableSampling(); 52 53 public static int cnt; 54 public static int g_tmp[]; 55 public int array[]; 56 57 public static int helper() { 58 int sum = 0; 59 // Let us assume that the array is 24 bytes of memory. 60 for (int i = 0; i < 127000 / 6; i++) { 61 int tmp[] = new int[1]; 62 // Force it to be kept. 63 g_tmp = tmp; 64 sum += g_tmp[0]; 65 } 66 return sum; 67 } 68 69 public static void runner(int max) { 70 int sum = 0; 71 for (int j = 0; j < max; j++) { 72 sum += helper(); 73 } 74 System.out.println(sum); 75 } 76 77 public static void main(String[] args) { 78 Frame[] frames = new Frame[3]; 79 frames[0] = new Frame("helper", "()I", "HeapMonitorRecentTest.java", 61); 80 frames[1] = new Frame("runner", "(I)V", "HeapMonitorRecentTest.java", 72); 81 frames[2] = new Frame("main", "([Ljava/lang/String;)V", "HeapMonitorRecentTest.java", 86); 82 83 enableSampling(); 84 // We are testing for the recent garbage sampler: 85 // First run for 10000 iterations to fill up the garbage sampler. 86 runner(10000); 87 88 // Now because we are in a different stack frame line here, we can just re-use the same runner. 89 // Run for 3, we really should not see that many of these and most should be the first type. 90 runner(5000); 91 92 // We should no longer have the initial frames. 93 int status = checkLiveOrRecentFrames(frames); 94 if (status != 0) { 95 throw new RuntimeException("Non-zero status returned from the agent: " + status); 96 } 97 98 // Change the last frame only since the rest is identical. 99 frames[2].lineNumber = 90; 100 101 // We should see those new frames. 102 status = checkLiveAndRecentFrames(frames); 103 if (status == 0) { 104 throw new RuntimeException("Non-zero status returned from the agent: " + status); 105 } 106 } 107 }