Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
fc7cdccf
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看板
提交
fc7cdccf
编写于
3月 31, 2011
作者:
N
never
浏览文件
操作
浏览文件
下载
差异文件
Merge
上级
61b950f8
7e4585a5
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
16 addition
and
6 deletion
+16
-6
src/share/vm/opto/loopTransform.cpp
src/share/vm/opto/loopTransform.cpp
+6
-0
src/share/vm/opto/memnode.cpp
src/share/vm/opto/memnode.cpp
+10
-6
未找到文件。
src/share/vm/opto/loopTransform.cpp
浏览文件 @
fc7cdccf
...
@@ -432,6 +432,12 @@ bool IdealLoopTree::policy_maximally_unroll( PhaseIdealLoop *phase ) const {
...
@@ -432,6 +432,12 @@ bool IdealLoopTree::policy_maximally_unroll( PhaseIdealLoop *phase ) const {
return
false
;
return
false
;
}
}
// Currently we don't have policy to optimize one iteration loops.
// Maximally unrolling transformation is used for that:
// it is peeled and the original loop become non reachable (dead).
if
(
trip_count
==
1
)
return
true
;
// Do not unroll a loop with String intrinsics code.
// Do not unroll a loop with String intrinsics code.
// String intrinsics are large and have loops.
// String intrinsics are large and have loops.
for
(
uint
k
=
0
;
k
<
_body
.
size
();
k
++
)
{
for
(
uint
k
=
0
;
k
<
_body
.
size
();
k
++
)
{
...
...
src/share/vm/opto/memnode.cpp
浏览文件 @
fc7cdccf
...
@@ -2628,12 +2628,16 @@ uint StrIntrinsicNode::match_edge(uint idx) const {
...
@@ -2628,12 +2628,16 @@ uint StrIntrinsicNode::match_edge(uint idx) const {
Node
*
StrIntrinsicNode
::
Ideal
(
PhaseGVN
*
phase
,
bool
can_reshape
)
{
Node
*
StrIntrinsicNode
::
Ideal
(
PhaseGVN
*
phase
,
bool
can_reshape
)
{
if
(
remove_dead_region
(
phase
,
can_reshape
))
return
this
;
if
(
remove_dead_region
(
phase
,
can_reshape
))
return
this
;
Node
*
mem
=
phase
->
transform
(
in
(
MemNode
::
Memory
));
if
(
can_reshape
)
{
// If transformed to a MergeMem, get the desired slice
Node
*
mem
=
phase
->
transform
(
in
(
MemNode
::
Memory
));
uint
alias_idx
=
phase
->
C
->
get_alias_index
(
adr_type
());
// If transformed to a MergeMem, get the desired slice
mem
=
mem
->
is_MergeMem
()
?
mem
->
as_MergeMem
()
->
memory_at
(
alias_idx
)
:
mem
;
uint
alias_idx
=
phase
->
C
->
get_alias_index
(
adr_type
());
if
(
mem
!=
in
(
MemNode
::
Memory
))
mem
=
mem
->
is_MergeMem
()
?
mem
->
as_MergeMem
()
->
memory_at
(
alias_idx
)
:
mem
;
set_req
(
MemNode
::
Memory
,
mem
);
if
(
mem
!=
in
(
MemNode
::
Memory
))
{
set_req
(
MemNode
::
Memory
,
mem
);
return
this
;
}
}
return
NULL
;
return
NULL
;
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录