1 /*
   2  * Copyright (c) 2018, 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 import java.util.List;
  27 
  28 /**
  29  * @test
  30  * @summary Verifies the JVMTI Heap Monitor API when allocating a multi-array.
  31  * @build Frame HeapMonitor
  32  * @compile HeapMonitorMultiArrayTest.java
  33  * @run main/othervm/native -agentlib:HeapMonitorTest MyPackage.HeapMonitorMultiArrayTest
  34  */
  35 public class HeapMonitorMultiArrayTest {
  36 
  37   private static int[][] tab;
  38   public static void main(String[] args) throws Exception {
  39     // Set ourselves to sample everything.
  40     HeapMonitor.sampleEverything();
  41 
  42     // Do a few allocations now and see if the callback happens and the program finishes:
  43     HeapMonitor.resetEventStorage();
  44     int iterations = 1000;
  45     int allocationsPerIteration = 6;
  46     for (int i = 0; i < iterations; i++) {
  47       tab = new int[5][5];
  48     }
  49 
  50     int sampledEvents = HeapMonitor.sampledEvents();
  51     int expectedNumber = iterations * allocationsPerIteration;
  52 
  53     if (sampledEvents != expectedNumber) {
  54       throw new RuntimeException("Number of samples (" + sampledEvents + ") not the expected ("
  55           + expectedNumber + ")");
  56     }
  57   }
  58 }