mirror of
https://github.com/openjdk/jdk19u.git
synced 2025-12-10 00:20:40 -06:00
8290964: C2 compilation fails with assert "non-reduction loop contains reduction nodes"
Backport-of: 4bdd1c914859e221c64208d47ef309d463609953
This commit is contained in:
parent
3f3bbdfa26
commit
6c7378a33f
@ -3896,17 +3896,6 @@ uint IdealLoopTree::est_loop_flow_merge_sz() const {
|
||||
return 0;
|
||||
}
|
||||
|
||||
#ifdef ASSERT
|
||||
bool IdealLoopTree::has_reduction_nodes() const {
|
||||
for (uint i = 0; i < _body.size(); i++) {
|
||||
if (_body[i]->is_reduction()) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
#endif // ASSERT
|
||||
|
||||
#ifndef PRODUCT
|
||||
//------------------------------dump_head--------------------------------------
|
||||
// Dump 1 liner for loop header info
|
||||
|
||||
@ -778,11 +778,6 @@ public:
|
||||
|
||||
void remove_main_post_loops(CountedLoopNode *cl, PhaseIdealLoop *phase);
|
||||
|
||||
#ifdef ASSERT
|
||||
// Tell whether the body contains nodes marked as reductions.
|
||||
bool has_reduction_nodes() const;
|
||||
#endif // ASSERT
|
||||
|
||||
#ifndef PRODUCT
|
||||
void dump_head() const; // Dump loop head only
|
||||
void dump() const; // Dump this loop recursively
|
||||
|
||||
@ -2416,11 +2416,6 @@ bool SuperWord::output() {
|
||||
return false;
|
||||
}
|
||||
|
||||
// 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 ");
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user