Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
ba51a2f1
D
dragonwell8_hotspot
项目概览
openanolis
/
dragonwell8_hotspot
通知
2
Star
2
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
D
dragonwell8_hotspot
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
ba51a2f1
编写于
11月 12, 2013
作者:
R
rbackman
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
8028198: SIGSEGV in PhaseIdealLoop::build_loop_late_post
Reviewed-by: iveresov, kvn
上级
2f9d3ede
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
57 addition
and
0 deletion
+57
-0
src/share/vm/opto/loopopts.cpp
src/share/vm/opto/loopopts.cpp
+7
-0
test/compiler/intrinsics/mathexact/SplitThruPhiTest.java
test/compiler/intrinsics/mathexact/SplitThruPhiTest.java
+50
-0
未找到文件。
src/share/vm/opto/loopopts.cpp
浏览文件 @
ba51a2f1
...
...
@@ -42,6 +42,13 @@ Node *PhaseIdealLoop::split_thru_phi( Node *n, Node *region, int policy ) {
// so disable this for now
return
NULL
;
}
if
(
n
->
is_MathExact
())
{
// MathExact has projections that are not correctly handled in the code
// below.
return
NULL
;
}
int
wins
=
0
;
assert
(
!
n
->
is_CFG
(),
""
);
assert
(
region
->
is_Region
(),
""
);
...
...
test/compiler/intrinsics/mathexact/SplitThruPhiTest.java
0 → 100644
浏览文件 @
ba51a2f1
/*
* 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
;
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录