Mercurial > jdk8-mips64-public > hotspot / file diff

     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/test/compiler/loopopts/TestBeautifyLoops.java	Mon Mar 23 19:52:34 2020 +0800
     1.3 @@ -0,0 +1,61 @@
     1.4 +/*
     1.5 + * Copyright (c) 2020, Huawei Technologies Co. Ltd. All rights reserved.
     1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     1.7 + *
     1.8 + * This code is free software; you can redistribute it and/or modify it
     1.9 + * under the terms of the GNU General Public License version 2 only, as
    1.10 + * published by the Free Software Foundation.
    1.11 + *
    1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
    1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    1.14 + * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    1.15 + * version 2 for more details (a copy is included in the LICENSE file that
    1.16 + * accompanied this code).
    1.17 + *
    1.18 + * You should have received a copy of the GNU General Public License version
    1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
    1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    1.21 + *
    1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
    1.23 + * or visit www.oracle.com if you need additional information or have any
    1.24 + * questions.
    1.25 + */
    1.26 +
    1.27 +/**
    1.28 + * @test
    1.29 + * @bug 8240576
    1.30 + * @summary JVM crashes after transformation in C2 IdealLoopTree::merge_many_backedges
    1.31 + *
    1.32 + * @run main/othervm -XX:-TieredCompilation -XX:-BackgroundCompilation
    1.33 + *      compiler.loopopts.TestBeautifyLoops
    1.34 + */
    1.35 +
    1.36 +package compiler.loopopts;
    1.37 +
    1.38 +public class TestBeautifyLoops {
    1.39 +    private int mI = 0;
    1.40 +    private long mJ = 0;
    1.41 +    private float mF = 0f;
    1.42 +
    1.43 +    public void testMethod() {
    1.44 +        for (int i0 = 0; i0 < 100; i0++) {
    1.45 +            if (mF != 0) {
    1.46 +                // do nothing
    1.47 +            } else {
    1.48 +                try {
    1.49 +                    mJ = Long.MAX_VALUE;
    1.50 +                    for (int i1 = 0; i1 < 101; i1++) {
    1.51 +                        for (int i2 = 0; i2 < 102; i2++) {
    1.52 +                            mI = new Integer(0x1234);
    1.53 +                        }
    1.54 +                    }
    1.55 +                } catch (Exception ignored) {}
    1.56 +            }
    1.57 +        }
    1.58 +    }
    1.59 +
    1.60 +    public static void main(String[] args) {
    1.61 +        TestBeautifyLoops obj = new TestBeautifyLoops();
    1.62 +        obj.testMethod();
    1.63 +    }
    1.64 +}