File: TestLiveNodeLimit.java

package info (click to toggle)
openjdk-25 25.0.1%2B8-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 825,408 kB
  • sloc: java: 5,585,680; cpp: 1,333,948; xml: 1,321,242; ansic: 488,034; asm: 404,003; objc: 21,088; sh: 15,106; javascript: 13,265; python: 8,319; makefile: 2,518; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (111 lines) | stat: -rw-r--r-- 5,543 bytes parent folder | download | duplicates (9)
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
/*
 * Copyright (c) 2020, 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
 * @bug 8244724
 * @summary Test which exceeds the live node limit in Compile::Code_Gen(). The previouslz failing assert is now only checked during parsing and during Compile::Optimize().
 *
 * @compile -XDstringConcat=inline TestLiveNodeLimit.java
 * @run main/othervm -Xcomp -XX:CompileCommand=compileonly,compiler.c2.TestLiveNodeLimit::test* compiler.c2.TestLiveNodeLimit
 */
package compiler.c2;

import java.util.ArrayList;

public class TestLiveNodeLimit {

    public static ArrayList<String> arrList = new ArrayList<String>();

    public static void main(String[] args) {
        for (int i = 0; i < 10000; i++) {
            testNodeLimitInBuildCfg();
            testNodeLimitInGlobalCodeMotion();
        }
    }

    // Hits live node limit in PhaseCFG::build_cfg(). There are around 70000 nodes right before build_cfg()
    // which creates another 15000 nodes which exceeds the default max node limit of 80000.
    public static int testNodeLimitInBuildCfg() {
        // Just some string operations that create a lot of nodes when compiled with javac with -XDstringConcat=inline
        // which generate a lot of StringBuilder objects and calls
        String someString = "as@df#as@df" + "fdsa";
        String[] split = someString.split("#");
        String[] tmp1 = split[0].split("@");
        String[] tmp2 = split[0].split("@");
        String concat1 = tmp1[0] + tmp2[0] + split[0];
        String concat2 = tmp1[0] + tmp2[0] + split[0];
        String concat3 = tmp1[0] + tmp2[0];
        String concat4 = tmp1[0] + tmp2[0];
        String string1 = "string1";
        String[] stringArr1 = arrList.toArray(new String[4]);
        String[] stringArr2 = new String[3];
        String[] stringArr3 = new String[3];
        if (stringArr1.length > 1) {
            stringArr2 = new String[3 * stringArr1.length];
            stringArr3 = new String[3 * stringArr1.length];
            for (int i = 0; i < stringArr1.length; i++) {
                stringArr2[3 * i    ] = string1 + concat1 + concat3 + stringArr1[i];
                stringArr2[3 * i + 1] = string1 + concat1 + concat3 + stringArr1[i];
                stringArr2[3 * i + 2] = string1 + concat1 + concat3 + stringArr1[i];
                stringArr3[3 * i    ] = string1 + concat2 + concat3 + concat4 + stringArr1[i];
                stringArr3[3 * i + 1] = string1 + concat2 + concat3 + concat4 + stringArr1[i];
                stringArr3[3 * i + 2] = string1 + concat2 + concat3 + concat4 + stringArr1[i];
            }
        }
        return stringArr1.length + stringArr2.length + stringArr3.length;
    }

    // Hits live node limit in PhaseCFG::global_code_motion(). There are around 79000 nodes right before global_code_motion()
    // which creates another 2000 nodes which exceeds the default max node limit of 80000.
    public static int testNodeLimitInGlobalCodeMotion() {
        // Just some string operations that create a lot of nodes when compiled with javac with -XDstringConcat=inline
        // which generate a lot of StringBuilder objects and calls
        String someString = "as@df#as@df" + "fdsa";
        String[] split = someString.split("#");
        String[] tmp1 = split[0].split("@");
        String[] tmp2 = split[0].split("@");
        String concat1 = tmp1[0] + tmp2[0] + split[0];
        String concat2 = tmp1[0] + tmp2[0] + split[0];
        String concat3 = tmp1[0] + tmp2[0] + split[0];
        String concat4 = tmp1[0] + tmp2[0] + split[0];
        String string1 = "string1";
        String[] stringArr1 = arrList.toArray(new String[4]);
        String[] stringArr2 = new String[3];
        String[] stringArr3 = new String[3];
        if (stringArr1.length > 1) {
            stringArr2 = new String[3 * stringArr1.length];
            stringArr3 = new String[3 * stringArr1.length];
            for (int i = 0; i < stringArr1.length; i++) {
                stringArr2[3 * i    ] = string1 + concat1 + concat3 + stringArr1[i];
                stringArr2[3 * i + 1] = string1 + concat1 + concat3 + stringArr1[i];
                stringArr2[3 * i + 2] = string1 + concat1 + concat3 + stringArr1[i];
                stringArr3[3 * i    ] = string1 + concat2 + concat4 + stringArr1[i];
                stringArr3[3 * i + 1] = string1 + concat2 + concat4 + stringArr1[i];
                stringArr3[3 * i + 2] = string1 + concat2 + stringArr1[i];
            }
        }
        return stringArr1.length + stringArr2.length + stringArr3.length;
    }
}