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

8286177: C2: "failed: non-reduction loop contains reduction nodes" assert failure #1195

Closed
wants to merge 1 commit into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
7 changes: 5 additions & 2 deletions src/hotspot/share/opto/superword.cpp
Expand Up @@ -104,8 +104,6 @@ void SuperWord::transform_loop(IdealLoopTree* lpt, bool do_optimization) {

if (!cl->is_valid_counted_loop()) return; // skip malformed counted loop

assert(!lpt->has_reduction_nodes() || cl->is_reduction_loop(),
"non-reduction loop contains reduction nodes");
bool post_loop_allowed = (PostLoopMultiversioning && Matcher::has_predicated_vectors() && cl->is_post_loop());
if (post_loop_allowed) {
if (cl->is_reduction_loop()) return; // no predication mapping
Expand Down Expand Up @@ -2299,6 +2297,11 @@ void SuperWord::output() {
return;
}

// Check that the loop to be vectorized does not have inconsistent reduction
// information, which would likely lead to a miscompilation.
assert(!lpt()->has_reduction_nodes() || cl->is_reduction_loop(),
"non-reduction loop contains reduction nodes");

#ifndef PRODUCT
if (TraceLoopOpts) {
tty->print("SuperWord::output ");
Expand Down
@@ -0,0 +1,60 @@
/*
* Copyright (c) 2022, 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 8286177
* @summary Test that inconsistent reduction node-loop state does not trigger
* assertion failures when the inconsistency does not lead to a
* miscompilation.
* @run main/othervm -Xbatch compiler.loopopts.superword.TestHoistedReductionNode
*/
package compiler.loopopts.superword;

public class TestHoistedReductionNode {

static boolean b = true;

static int test() {
int acc = 0;
int i = 0;
do {
int j = 0;
do {
if (b) {
acc += j;
}
j++;
} while (j < 5);
i++;
} while (i < 100);
return acc;

}

public static void main(String[] args) {
for (int i = 0; i < 10_000; i++) {
test();
}
}
}