archive/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2025-09-20 19:14:38 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

8263971: C2 crashes with SIGFPE with -XX:+StressGCM and -XX:+StressIGVN

Browse source 
Reviewed-by: chagedorn, thartmann
This commit is contained in:
Roland Westrelin 2021-03-30 07:40:49 +00:00
parent bcdf4694e0
commit 8100a20e98
2 changed files with 72 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

9
src/hotspot/share/opto/castnode.cpp
View file

@ -240,9 +240,8 @@ const Type* CastIINode::Value(PhaseGVN* phase) const {
return res; return res;
} }
static Node* find_or_make_CastII(PhaseIterGVN* igvn, Node* parent, Node* control, static Node* find_or_make_CastII(PhaseIterGVN* igvn, Node* parent, Node* control, const TypeInt* type, bool carry_dependency) {
const TypeInt* type) { Node* n = new CastIINode(parent, type, carry_dependency);
Node* n = new CastIINode(parent, type);
n->set_req(0, control); n->set_req(0, control);
Node* existing = igvn->hash_find_insert(n); Node* existing = igvn->hash_find_insert(n);
if (existing != NULL) { if (existing != NULL) {
@ -275,8 +274,8 @@ Node *CastIINode::Ideal(PhaseGVN *phase, bool can_reshape) {
Node* x = z->in(1); Node* x = z->in(1);
Node* y = z->in(2); Node* y = z->in(2);
Node* cx = find_or_make_CastII(igvn, x, in(0), rx->is_int()); Node* cx = find_or_make_CastII(igvn, x, in(0), rx->is_int(), _carry_dependency);
Node* cy = find_or_make_CastII(igvn, y, in(0), ry->is_int()); Node* cy = find_or_make_CastII(igvn, y, in(0), ry->is_int(), _carry_dependency);
switch (op) { switch (op) {
case Op_AddI: return new AddINode(cx, cy); case Op_AddI: return new AddINode(cx, cy);
case Op_SubI: return new SubINode(cx, cy); case Op_SubI: return new SubINode(cx, cy);

68
test/hotspot/jtreg/compiler/loopopts/TestLostDependencyOnZeroTripGuard.java Normal file
View file

@ -0,0 +1,68 @@
/*
* Copyright (c) 2021, 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 8263971
* @summary C2 crashes with SIGFPE with -XX:+StressGCM and -XX:+StressIGVN
*
* @run main/othervm -Xcomp -XX:-TieredCompilation -XX:CompileOnly=TestLostDependencyOnZeroTripGuard -XX:+UnlockDiagnosticVMOptions
* -XX:+IgnoreUnrecognizedVMOptions -XX:+StressGCM -XX:StressSeed=886771365 TestLostDependencyOnZeroTripGuard
* @run main/othervm -Xcomp -XX:-TieredCompilation -XX:CompileOnly=TestLostDependencyOnZeroTripGuard -XX:+UnlockDiagnosticVMOptions
* -XX:+IgnoreUnrecognizedVMOptions -XX:+StressGCM TestLostDependencyOnZeroTripGuard
*
*/
public class TestLostDependencyOnZeroTripGuard {
public static final int N = 400;
public int iArrFld[]=new int[N];
public void mainTest(String[] strArr1) {
int i=57657, i1=577, i2=6, i3=157, i4=12, i23=61271;
boolean bArr[]=new boolean[N];
for (i = 9; 379 > i; i++) {
i2 = 1;
do {
i1 <<= i3;
} while (++i2 < 68);
for (i23 = 68; i23 > 3; i23--) {
bArr[i23 + 1] = true;
try {
i1 = (-42360 / i23);
iArrFld[i + 1] = (i4 % 15384);
} catch (ArithmeticException a_e) {}
}
}
}
public static void main(String[] strArr) {
TestLostDependencyOnZeroTripGuard _instance = new TestLostDependencyOnZeroTripGuard();
for (int i = 0; i < 10; i++ ) {
_instance.mainTest(strArr);
}
}
}