1 /*
   2  * Copyright (c) 2019, Loongson Technology Co. Ltd. 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 /**
  25  * @test
  26  * @bug 8224162
  27  * @summary Profile counter for a call site may overflow.
  28  * @requires (vm.debug == true)
  29  * @run main/othervm/timeout=600 -XX:-TieredCompilation -XX:-UseOnStackReplacement -XX:MaxTrivialSize=1 compiler.profiling.TestProfileCounterOverflow
  30  */
  31 
  32 package compiler.profiling;
  33 
  34 public class TestProfileCounterOverflow {
  35     public static void main(String[] args) throws Exception {
  36         int sum = 0;
  37         for (int i = 0; i < 4; i++) {
  38             sum += test(i);
  39         }
  40         System.out.println("sum = " + sum);
  41     }
  42 
  43     public static int test(int i) throws Exception {
  44         int sum = 0;
  45         if (i == 0) {
  46             long iteration = Integer.MAX_VALUE + 10000L;
  47             // Increase the profile counter to make it overflowed
  48             for (long j = 0; j < iteration; j++) {
  49                 sum += call(i);
  50             }
  51         } else {
  52             // Sleep to wait for the compilation to be finished
  53             Thread.sleep(2000);
  54         }
  55         return sum;
  56     }
  57 
  58     public static int call(int i) {
  59         return i;
  60     }
  61 }