test/hotspot/jtreg/compiler/escapeAnalysis/TestValAtSafepointOverflowsInt.java

/*
 * Copyright (c) 2021, Red Hat, Inc. 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 8261812
 * @summary C2 compilation fails with assert(!had_error) failed: bad dominance
 *
 * @run main/othervm -XX:-BackgroundCompilation TestValAtSafepointOverflowsInt
 *
 */

public class TestValAtSafepointOverflowsInt {
    private static volatile int volatileField;

    public static void main(String[] args) {
        for (int i = 0; i < 20_000; i++) {
            testByte(true, false);
            testByte(false, false);
            testShort(true, false);
            testShort(false, false);
            testChar(true, false);
            testChar(false, false);
        }
        testByte(true, true);
        testShort(true, true);
        testChar(true, true);
    }

    private static Object testByte(boolean flag, boolean flag2) {
        int i;
        // loop to delay constant folding
        for (i = 0; i < 9; i++) {
        }
        C obj = new C();
        if (flag) {
            obj.byteField = (byte)(1 << i);
        } else {
            obj.byteField = (byte)(1 << (i+1));
        }
        // Phi for byte here for uncommon trap in never taken path below
        // Phi inputs don't fit in a byte. Phi transfomed to top.
        if (flag2) {
            return obj;
        }
        return null;
    }

    private static Object testShort(boolean flag, boolean flag2) {
        int i;
        for (i = 0; i < 17; i++) {
        }
        C obj = new C();
        if (flag) {
            obj.shortField = (short)(1 << i);
        } else {
            obj.shortField = (short)(1 << (i+1));
        }
        if (flag2) {
            return obj;
        }
        return null;
    }

    private static Object testChar(boolean flag, boolean flag2) {
        int i;
        for (i = 0; i < 17; i++) {
        }
        C obj = new C();
        if (flag) {
            obj.charField = (char)(1 << i);
        } else {
            obj.charField = (char)(1 << (i+1));
        }
        if (flag2) {
            return obj;
        }
        return null;
    }


    static class C {
        byte byteField;
        short shortField;
        char charField;
    }

}