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

8028198: SIGSEGV in PhaseIdealLoop::build_loop_late_post

Browse source 
Reviewed-by: iveresov, kvn
This commit is contained in:
Rickard Bäckman 2013-11-12 13:47:57 +01:00
parent 31d2d5121a
commit 0ef4539a9f
2 changed files with 57 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

7
hotspot/src/share/vm/opto/loopopts.cpp
View file

@ -42,6 +42,13 @@ Node *PhaseIdealLoop::split_thru_phi( Node *n, Node *region, int policy ) {
// so disable this for now // so disable this for now
return NULL; return NULL;
} }
if (n->is_MathExact()) {
// MathExact has projections that are not correctly handled in the code
// below.
return NULL;
}
int wins = 0; int wins = 0;
assert(!n->is_CFG(), ""); assert(!n->is_CFG(), "");
assert(region->is_Region(), ""); assert(region->is_Region(), "");

50
hotspot/test/compiler/intrinsics/mathexact/SplitThruPhiTest.java Normal file
View file

@ -0,0 +1,50 @@
/*
* Copyright (c) 2013, 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 8028198
* @summary Verify that split through phi does the right thing
* @compile SplitThruPhiTest.java
* @run main SplitThruPhiTest
*
*/
public class SplitThruPhiTest {
public static volatile int value = 19;
public static int store = 0;
public static void main(String[] args) {
for (int i = 0; i < 150000; ++i) {
store = runTest(value);
}
}
public static int runTest(int val) {
int result = Math.addExact(val, 1);
int total = 0;
for (int i = val; i < 200; i = Math.addExact(i, 1)) {
total += i;
}
return total;
}
}