/*

 * Copyright (c) 2018, 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 8211698

 * @summary Crash in C2 compiled code during execution of double array heavy processing code

 *

 * @run main/othervm -XX:CompileOnly=Test8211698.test Test8211698

 *

 */

public class Test8211698 {

    public static void main(String[] args) {

        Test8211698 issue = new Test8211698();

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

            issue.test();

        }

    }

    public void test() {

        int[] iarr1 = new int[888];

        for (int i = 5; i > 0; i--) {

            for (int j = 0; j <= i - 1; j++) {

                int istep = 2 * j - i;

                int iadj = 0;

                if (istep < 0) {

                    iadj = iarr1[-istep];

                } else {

                    iadj = iarr1[istep];

                }

            }

        }

    }

}