/*
 * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/*
 * @test
 * @bug 8024924
 * @summary Test non constant addExact
 * @compile LoadTest.java Verify.java
 * @run main LoadTest
 *
 */

import java.lang.ArithmeticException;

public class LoadTest {
  public static java.util.Random rnd = new java.util.Random();
  public static int[] values = new int[256];

  public static void main(String[] args) {
    for (int i = 0; i < values.length; ++i) {
        values[i] = rnd.nextInt();
    }

    for (int i = 0; i < 50000; ++i) {
      Verify.verify(values[i & 255], values[i & 255] - i);
      Verify.verify(values[i & 255] + i, values[i & 255] - i);
      Verify.verify(values[i & 255], values[i & 255]);
      if ((i & 1) == 1 && i > 5) {
          Verify.verify(values[i & 255] + i, values[i & 255] - i);
      } else {
          Verify.verify(values[i & 255] - i, values[i & 255] + i);
      }
    }
  }
}