File: TestModDivTopInput.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 (76 lines) | stat: -rw-r--r-- 2,371 bytes parent folder | download | duplicates (6)
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
65
66
67
68
69
70
71
72
73
74
75
76
/*
 * Copyright (c) 2022, 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 8283451
 * @summary C2: assert(_base == Long) failed: Not a Long
 * @run main/othervm -XX:+UnlockDiagnosticVMOptions -XX:+StressLCM -XX:+StressGCM
 *                   -Xcomp -XX:CompileOnly=TestModDivTopInput -XX:-TieredCompilation TestModDivTopInput
 */

public class TestModDivTopInput {

    public static final int N = 400;

    public static float fFld=-2.447F;
    public long lFld=-189L;

    public void mainTest(String[] strArr1) {

        int i18, i20=-14, i21, iArr2[]=new int[N];
        boolean b2=true;
        double d2;
        long l;

        init(iArr2, -13265);

        for (i18 = 13; i18 < 315; ++i18) {
            if (b2) continue;
            for (d2 = 5; d2 < 83; d2++) {
            }
            for (i21 = 4; i21 < 83; i21++) {
                for (l = 1; 2 > l; l++) {
                }
                b2 = b2;
                lFld %= (i20 | 1);
                i20 = (int)fFld;
                i20 += (int)d2;
            }
        }
    }

    public static void main(String[] strArr) {
        TestModDivTopInput _instance = new TestModDivTopInput();
        for (int i = 0; i < 10; i++ ) {
            _instance.mainTest(strArr);
        }
    }

    static void init(int[] arr, int v) {
        for (int i = 0; i < arr.length; i++) {
            arr[i] = v;
        }
    }

}