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

8335709: C2: assert(!loop->is_member(get_loop(useblock))) failed: must be outside loop #2991

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
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
7 changes: 4 additions & 3 deletions src/hotspot/share/opto/loopnode.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -4807,7 +4807,8 @@ int PhaseIdealLoop::build_loop_tree_impl( Node *n, int pre_order ) {

} else { // Else not a nested loop
if( !_nodes[m->_idx] ) continue; // Dead code has no loop
l = get_loop(m); // Get previously determined loop
IdealLoopTree* m_loop = get_loop(m);
l = m_loop; // Get previously determined loop
// If successor is header of a loop (nest), move up-loop till it
// is a member of some outer enclosing loop. Since there are no
// shared headers (I've split them already) I only need to go up
Expand All @@ -4833,10 +4834,10 @@ int PhaseIdealLoop::build_loop_tree_impl( Node *n, int pre_order ) {
// Insert the NeverBranch between 'm' and it's control user.
NeverBranchNode *iff = new NeverBranchNode( m );
_igvn.register_new_node_with_optimizer(iff);
set_loop(iff, l);
set_loop(iff, m_loop);
Node *if_t = new CProjNode( iff, 0 );
_igvn.register_new_node_with_optimizer(if_t);
set_loop(if_t, l);
set_loop(if_t, m_loop);

Node* cfg = nullptr; // Find the One True Control User of m
for (DUIterator_Fast jmax, j = m->fast_outs(jmax); j < jmax; j++) {
Expand Down
Original file line number Diff line number Diff line change
@@ -0,0 +1,57 @@
/*
* Copyright (c) 2024, 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 8335709
* @summary C2: assert(!loop->is_member(get_loop(useblock))) failed: must be outside loop
* @library /test/lib
* @run main/othervm -Xcomp -XX:CompileCommand=compileonly,InfiniteLoopBadControlNeverBranch::* InfiniteLoopBadControlNeverBranch
*
*/


import jdk.test.lib.Utils;

public class InfiniteLoopBadControlNeverBranch {
static int b;
static short c;

public static void main(String[] args) throws InterruptedException {
Thread thread = new Thread(() -> test());
thread.setDaemon(true);
thread.start();
Thread.sleep(Utils.adjustTimeout(4000));
}

static void test() {
int i = 0;
while (true) {
if (i > 1) {
b = 0;
}
c = (short) (b * 7);
i++;
}
}
}