Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
8dd1803e
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看板
提交
8dd1803e
编写于
3月 06, 2013
作者:
K
kvn
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
8009472: Print additional information for 8004640 failure
Summary: dump nodes and types in 8004640 case. Reviewed-by: roland
上级
89c7b7b1
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
29 addition
and
8 deletion
+29
-8
src/share/vm/opto/compile.hpp
src/share/vm/opto/compile.hpp
+1
-0
src/share/vm/opto/memnode.cpp
src/share/vm/opto/memnode.cpp
+28
-8
未找到文件。
src/share/vm/opto/compile.hpp
浏览文件 @
8dd1803e
...
@@ -678,6 +678,7 @@ class Compile : public Phase {
...
@@ -678,6 +678,7 @@ class Compile : public Phase {
void
record_dead_node
(
uint
idx
)
{
if
(
_dead_node_list
.
test_set
(
idx
))
return
;
void
record_dead_node
(
uint
idx
)
{
if
(
_dead_node_list
.
test_set
(
idx
))
return
;
_dead_node_count
++
;
_dead_node_count
++
;
}
}
bool
is_dead_node
(
uint
idx
)
{
return
_dead_node_list
.
test
(
idx
)
!=
0
;
}
uint
dead_node_count
()
{
return
_dead_node_count
;
}
uint
dead_node_count
()
{
return
_dead_node_count
;
}
void
reset_dead_node_list
()
{
_dead_node_list
.
Reset
();
void
reset_dead_node_list
()
{
_dead_node_list
.
Reset
();
_dead_node_count
=
0
;
_dead_node_count
=
0
;
...
...
src/share/vm/opto/memnode.cpp
浏览文件 @
8dd1803e
...
@@ -238,7 +238,7 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
...
@@ -238,7 +238,7 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
return
this
;
return
this
;
ctl
=
in
(
MemNode
::
Control
);
ctl
=
in
(
MemNode
::
Control
);
// Don't bother trying to transform a dead node
// Don't bother trying to transform a dead node
if
(
ctl
&&
ctl
->
is_top
()
)
return
NodeSentinel
;
if
(
ctl
&&
ctl
->
is_top
()
)
return
NodeSentinel
;
PhaseIterGVN
*
igvn
=
phase
->
is_IterGVN
();
PhaseIterGVN
*
igvn
=
phase
->
is_IterGVN
();
// Wait if control on the worklist.
// Wait if control on the worklist.
...
@@ -262,8 +262,8 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
...
@@ -262,8 +262,8 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
}
}
// Ignore if memory is dead, or self-loop
// Ignore if memory is dead, or self-loop
Node
*
mem
=
in
(
MemNode
::
Memory
);
Node
*
mem
=
in
(
MemNode
::
Memory
);
if
(
phase
->
type
(
mem
)
==
Type
::
TOP
)
return
NodeSentinel
;
// caller will return NULL
if
(
phase
->
type
(
mem
)
==
Type
::
TOP
)
return
NodeSentinel
;
// caller will return NULL
assert
(
mem
!=
this
,
"dead loop in MemNode::Ideal"
);
assert
(
mem
!=
this
,
"dead loop in MemNode::Ideal"
);
if
(
can_reshape
&&
igvn
!=
NULL
&&
igvn
->
_worklist
.
member
(
mem
))
{
if
(
can_reshape
&&
igvn
!=
NULL
&&
igvn
->
_worklist
.
member
(
mem
))
{
// This memory slice may be dead.
// This memory slice may be dead.
...
@@ -273,12 +273,12 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
...
@@ -273,12 +273,12 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
}
}
Node
*
address
=
in
(
MemNode
::
Address
);
Node
*
address
=
in
(
MemNode
::
Address
);
const
Type
*
t_adr
=
phase
->
type
(
address
);
const
Type
*
t_adr
=
phase
->
type
(
address
);
if
(
t_adr
==
Type
::
TOP
)
return
NodeSentinel
;
// caller will return NULL
if
(
t_adr
==
Type
::
TOP
)
return
NodeSentinel
;
// caller will return NULL
if
(
can_reshape
&&
igvn
!=
NULL
&&
if
(
can_reshape
&&
igvn
!=
NULL
&&
(
igvn
->
_worklist
.
member
(
address
)
||
(
igvn
->
_worklist
.
member
(
address
)
||
igvn
->
_worklist
.
size
()
>
0
&&
(
phase
->
type
(
address
)
!=
adr_type
()))
)
{
igvn
->
_worklist
.
size
()
>
0
&&
(
t_adr
!=
adr_type
()))
)
{
// The address's base and type may change when the address is processed.
// The address's base and type may change when the address is processed.
// Delay this mem node transformation until the address is processed.
// Delay this mem node transformation until the address is processed.
phase
->
is_IterGVN
()
->
_worklist
.
push
(
this
);
phase
->
is_IterGVN
()
->
_worklist
.
push
(
this
);
...
@@ -288,7 +288,7 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
...
@@ -288,7 +288,7 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
// Do NOT remove or optimize the next lines: ensure a new alias index
// Do NOT remove or optimize the next lines: ensure a new alias index
// is allocated for an oop pointer type before Escape Analysis.
// is allocated for an oop pointer type before Escape Analysis.
// Note: C++ will not remove it since the call has side effect.
// Note: C++ will not remove it since the call has side effect.
if
(
t_adr
->
isa_oopptr
()
)
{
if
(
t_adr
->
isa_oopptr
()
)
{
int
alias_idx
=
phase
->
C
->
get_alias_index
(
t_adr
->
is_ptr
());
int
alias_idx
=
phase
->
C
->
get_alias_index
(
t_adr
->
is_ptr
());
}
}
...
@@ -296,6 +296,26 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
...
@@ -296,6 +296,26 @@ Node *MemNode::Ideal_common(PhaseGVN *phase, bool can_reshape) {
Node
*
base
=
NULL
;
Node
*
base
=
NULL
;
if
(
address
->
is_AddP
())
if
(
address
->
is_AddP
())
base
=
address
->
in
(
AddPNode
::
Base
);
base
=
address
->
in
(
AddPNode
::
Base
);
if
(
base
!=
NULL
&&
phase
->
type
(
base
)
->
higher_equal
(
TypePtr
::
NULL_PTR
)
&&
!
t_adr
->
isa_rawptr
())
{
// Note: raw address has TOP base and top->higher_equal(TypePtr::NULL_PTR) is true.
Compile
*
C
=
phase
->
C
;
tty
->
cr
();
tty
->
print_cr
(
"===== NULL+offs not RAW address ====="
);
if
(
C
->
is_dead_node
(
this
->
_idx
))
tty
->
print_cr
(
"'this' is dead"
);
if
((
ctl
!=
NULL
)
&&
C
->
is_dead_node
(
ctl
->
_idx
))
tty
->
print_cr
(
"'ctl' is dead"
);
if
(
C
->
is_dead_node
(
mem
->
_idx
))
tty
->
print_cr
(
"'mem' is dead"
);
if
(
C
->
is_dead_node
(
address
->
_idx
))
tty
->
print_cr
(
"'address' is dead"
);
if
(
C
->
is_dead_node
(
base
->
_idx
))
tty
->
print_cr
(
"'base' is dead"
);
tty
->
cr
();
base
->
dump
(
1
);
tty
->
cr
();
this
->
dump
(
2
);
tty
->
print
(
"this->adr_type(): "
);
adr_type
()
->
dump
();
tty
->
cr
();
tty
->
print
(
"phase->type(address): "
);
t_adr
->
dump
();
tty
->
cr
();
tty
->
print
(
"phase->type(base): "
);
phase
->
type
(
address
)
->
dump
();
tty
->
cr
();
tty
->
cr
();
}
assert
(
base
==
NULL
||
t_adr
->
isa_rawptr
()
||
assert
(
base
==
NULL
||
t_adr
->
isa_rawptr
()
||
!
phase
->
type
(
base
)
->
higher_equal
(
TypePtr
::
NULL_PTR
),
"NULL+offs not RAW address?"
);
!
phase
->
type
(
base
)
->
higher_equal
(
TypePtr
::
NULL_PTR
),
"NULL+offs not RAW address?"
);
#endif
#endif
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录