1 /*

     2  * Copyright (c) 2013, Oracle 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 /*

    25  * @test

    26  * @bug 8024924

    27  * @summary Test non constant addExact

    28  * @compile NonConstantTest.java Verify.java

    29  * @run main NonConstantTest

    30  *

    31  */

    32 

    33 import java.lang.ArithmeticException;

    34 

    35 public class NonConstantTest {

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

    37 

    38   public static void main(String[] args) {

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

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

    41       Verify.verify(rnd1, rnd2);

    42       Verify.verify(rnd1, rnd2 + 1);

    43       Verify.verify(rnd1 + 1, rnd2);

    44       Verify.verify(rnd1 - 1, rnd2);

    45       Verify.verify(rnd1, rnd2 - 1);

    46     }

    47   }

    48 }