Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

8308103: Massive (up to ~30x) increase in C2 compilation time since JDK 17 #14732

Closed
wants to merge 3 commits into from
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 7 additions & 1 deletion src/hotspot/share/opto/loopopts.cpp
Original file line number Diff line number Diff line change
@@ -1696,7 +1696,13 @@ void PhaseIdealLoop::try_sink_out_of_loop(Node* n) {
cast = ConstraintCastNode::make_cast_for_type(x_ctrl, in, in_t, ConstraintCastNode::UnconditionalDependency);
}
if (cast != nullptr) {
register_new_node(cast, x_ctrl);
Node* prev = _igvn.hash_find_insert(cast);
if (prev != nullptr) {
cast->destruct(&_igvn);
cast = prev;
} else {
register_new_node(cast, x_ctrl);
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Can you move creation of cast here so you don't need to destroy it in case of previous cast existance?
Or it is possible that ConstraintCastNode::make_cast_for_type() can return null`?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks for looking at this, Vladimir.
I'm not sure I understand what you're suggesting. Is it to not allocate a new node so it doesn't have to be destroyed if an identical node exist? But without a node it's not possible to rely on IGVN hashing?

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

You are right. Using hash to look for existing node is smart.

}
x->replace_edge(in, cast);
// Chain of AddP:
// 2- A CastPP of the base is only added now that both AddP nodes are sunk
Original file line number Diff line number Diff line change
@@ -0,0 +1,63 @@
/*
* Copyright (c) 2023, 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 8308103
* @summary Massive (up to ~30x) increase in C2 compilation time since JDK 17
* @run main/othervm -Xcomp -XX:CompileOnly=TestSinkingNodesCausesLongCompilation::mainTest -XX:+UnlockDiagnosticVMOptions
* -XX:RepeatCompilation=30 TestSinkingNodesCausesLongCompilation
*/

public class TestSinkingNodesCausesLongCompilation {
public static final int N = 400;
public static int iFld=41489;

public void mainTest(String[] strArr1) {
int i9=-13, i10=-248, i11=-4, i13=33, i15=-171, i18=-58, iArr2[]=new int[N];

for (i9 = 7; i9 < 256; i9++) {
i11 = 1;
do {
} while (++i11 < 101);
}
for (int i14 : iArr2) {
for (i15 = 63; 0 < i15; i15 -= 2) {
i10 *= i13;
i10 >>= i14;
}
for (i18 = 2; 63 > i18; i18++) {
i10 = iFld;
iArr2[i18] |= i11;
}
}
System.out.println("i9 = " + i9);
}

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