/*
 * Copyright (c) 2002, 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
 *
 * @summary converted from VM Testbase runtime/jbe/hoist/hoist02.
 * VM Testbase keywords: [quick, runtime]
 *
 * @library /vmTestbase
 *          /test/lib
 * @run driver jdk.test.lib.FileInstaller . .
 * @run main/othervm vm.compiler.jbe.hoist.hoist02.hoist02
 */

package vm.compiler.jbe.hoist.hoist02;

// hoist02.java

/* -- Test hoist invariant code of integer expression. This eliminates unnecessary recomputations of invariant expressions in loops.

     Example:

     int a[];
     int x, y, z;
     for (i = 0; i < 100; i++)
        a[i] = (x + y)*z;
 */

public class hoist02 {
    int LEN = 5000;
    int a[] = new int[LEN];
    int aopt[] = new int[LEN];
    boolean bool_val = true;
    int i1 = 1, i2 = 2, i3 = 3, i4 = 4, i5 = 5, i6 = 6, i7 = 7, i8 = 8, i9 = 9;

    public static void main(String args[]) {
        hoist02 hst = new hoist02();

        hst.f();
        hst.fopt();
        if (hst.eCheck()) {
            System.out.println("Test hoist02 Passed.");
        } else {
            throw new Error("Test hoist02 Failed.");
        }
    }

    void f() {
        // Non-optimized version: i1 through i9 are invariants
        int i = 0;

        do
            a[i++] = bool_val ? (i1+i2+i3+i4+i5+i6+i7+i8+i9) : (i1*i2*i3*i4*i5*i6*i7*i8*i9);
        while (i < a.length);
    }

    // Code fragment after the invariant expression is hoisted out of the loop.
    void fopt() {
        int i = 0;
        int t =  bool_val ? (i1+i2+i3+i4+i5+i6+i7+i8+i9) : (i1*i2*i3*i4*i5*i6*i7*i8*i9);

        do
            aopt[i++] = t;
        while (i < aopt.length);
    }

    // Check Loop Hoisting results
    boolean eCheck() {
        for (int i = 0; i < a.length; i++)
            if (a[i] != aopt[i]) {
                System.out.println("a["+i+"]="+a[i]+"; aopt["+i+"]="+aopt[i]);
                return false;
            }

        return true;
    }
}