/*

 * 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 LoopDependentTest.java Verify.java

 * @run main LoopDependentTest

 *

 */

import java.lang.ArithmeticException;

public class LoopDependentTest {

  public static java.util.Random rnd = new java.util.Random();

  public static void main(String[] args) {

    int rnd1 = rnd.nextInt(), rnd2 = rnd.nextInt();

    for (int i = 0; i < 50000; ++i) {

      Verify.verify(rnd1 + i, rnd2 + i);

      Verify.verify(rnd1 + i, rnd2 + (i & 0xff));

      Verify.verify(rnd1 - i, rnd2 - (i & 0xff));

      Verify.verify(rnd1 + i + 1, rnd2 + i + 2);

      Verify.verify(rnd1 + i * 2, rnd2 + i);

    }

  }

}