File: MultiplyByIntegerMinHang.java

package info (click to toggle)
openjdk-11 11.0.28%2B6-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 781,124 kB
  • sloc: java: 5,208,481; xml: 1,192,267; cpp: 1,138,346; ansic: 461,925; javascript: 162,416; sh: 16,738; objc: 13,729; python: 4,757; asm: 3,570; makefile: 2,965; perl: 357; awk: 351; sed: 172; jsp: 24; csh: 3
file content (64 lines) | stat: -rw-r--r-- 2,283 bytes parent folder | download | duplicates (22)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/*
 * Copyright (c) 2018, 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 8213419
 * @summary C2 may hang in MulLNode::Ideal()/MulINode::Ideal() with gcc 8.2.1
 *
 * @run main/othervm -XX:-TieredCompilation -XX:-BackgroundCompilation -XX:-UseOnStackReplacement MultiplyByIntegerMinHang
 *
 */

public class MultiplyByIntegerMinHang {
    public static void main(String[] args) {
        for (int i = 0; i < 20_000; i++) {
            if (test1(0) != 0) {
                throw new RuntimeException("incorrect result");
            }
            if (test1(1) != Integer.MIN_VALUE) {
                throw new RuntimeException("incorrect result");
            }
            if (test1(2) != 0) {
                throw new RuntimeException("incorrect result");
            }
            if (test2(0) != 0) {
                throw new RuntimeException("incorrect result");
            }
            if (test2(1) != Long.MIN_VALUE) {
                throw new RuntimeException("incorrect result");
            }
            if (test2(2) != 0) {
                throw new RuntimeException("incorrect result");
            }
        }
    }

    private static int test1(int v) {
        return v * Integer.MIN_VALUE;
    }

    private static long test2(long v) {
        return v * Long.MIN_VALUE;
    }
}