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 frequent garbage storage system.
  29  * @build Frame
  30  * @compile HeapMonitorFrequentTest.java
  31  * @run main/othervm/native -agentlib:HeapMonitor MyPackage.HeapMonitorFrequentTest
  32  */
  33 
  34 import java.io.PrintStream;
  35 
  36 public class HeapMonitorFrequentTest {
  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 checkFrequentFrames(Frame[] frames);
  50   native static int enableSampling();
  51 
  52   public static int cnt;
  53   public static int g_tmp[];
  54   public int array[];
  55 
  56   public static int helper() {
  57     int sum = 0;
  58     // Let us assume that the array is 24 bytes of memory.
  59     for (int i = 0; i < 127000 / 6; i++) {
  60       int tmp[] = new int[1];
  61       // Force it to be kept.
  62       g_tmp = tmp;
  63       sum += g_tmp[0];
  64     }
  65     return sum;
  66   }
  67 
  68   public static void runner(int max) {
  69     int sum = 0;
  70     for (int j = 0; j < max; j++) {
  71       sum += helper();
  72     }
  73     System.out.println(sum);
  74   }
  75 
  76   public static void main(String[] args) {
  77     Frame[] frames = new Frame[3];
  78     frames[0] = new Frame("helper", "()I", "HeapMonitorRecentTest.java", 60);
  79     frames[1] = new Frame("runner", "(I)V", "HeapMonitorRecentTest.java", 71);
  80     frames[2] = new Frame("main", "([Ljava/lang/String;)V", "HeapMonitorRecentTest.java", 85);
  81 
  82     enableSampling();
  83     // We are testing for the recent garbage sampler:
  84     // First run for 10000 iterations to fill up the garbage sampler.
  85     runner(10000);
  86 
  87     // Now because we are in a different stack frame line here, we can just re-use the same runner.
  88     // Run for 3, we really should not see that many of these and most should be the first type.
  89     runner(5000);
  90 
  91     // Both types should exist in frequent since it was frequent enough.
  92     int status = checkFrequentFrames(frames);
  93     if (status == 0) {
  94       throw new RuntimeException("Old frames no longer exist");
  95     }
  96 
  97     // Change the last frame only since the rest is identical.
  98     frames[2].lineNumber = 89;
  99 
 100     status = checkFrequentFrames(frames);
 101     if (status == 0) {
 102       throw new RuntimeException("New frames not in the frequent sampling list");
 103     }
 104   }
 105 }