Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
07630a3f
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看板
提交
07630a3f
编写于
2月 18, 2016
作者:
A
asaha
浏览文件
操作
浏览文件
下载
差异文件
Merge
上级
6a45eb64
aaf6d795
变更
6
隐藏空白更改
内联
并排
Showing
6 changed file
with
521 addition
and
63 deletion
+521
-63
.hgtags
.hgtags
+4
-0
src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp
src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp
+26
-0
src/share/vm/gc_implementation/g1/heapRegion.cpp
src/share/vm/gc_implementation/g1/heapRegion.cpp
+138
-51
src/share/vm/gc_implementation/g1/heapRegion.hpp
src/share/vm/gc_implementation/g1/heapRegion.hpp
+3
-0
test/compiler/loopopts/CountedLoopProblem.java
test/compiler/loopopts/CountedLoopProblem.java
+16
-12
test/stress/gc/TestStressRSetCoarsening.java
test/stress/gc/TestStressRSetCoarsening.java
+334
-0
未找到文件。
.hgtags
浏览文件 @
07630a3f
...
@@ -818,6 +818,8 @@ ca3b8c8e390ab0540b0cc2e5def869b38e460d86 jdk8u75-b01
...
@@ -818,6 +818,8 @@ ca3b8c8e390ab0540b0cc2e5def869b38e460d86 jdk8u75-b01
32b682649973231b54740c09b10889660f6ebde5 jdk8u75-b04
32b682649973231b54740c09b10889660f6ebde5 jdk8u75-b04
1f43bd4fab06d2ca5d1964611df14d8506d6b36e jdk8u75-b05
1f43bd4fab06d2ca5d1964611df14d8506d6b36e jdk8u75-b05
916712f178c39d0acbc590f38802133fc86a7346 jdk8u75-b06
916712f178c39d0acbc590f38802133fc86a7346 jdk8u75-b06
8c791dd1c24d85ebd18b03d49185c2a25263c129 jdk8u75-b07
e4a935cb6f7178912fd653e2a9514eadec7935ab jdk8u75-b08
d7b01fb81aa8a5437cb03bc36afe15cf0e55fb89 jdk8u76-b00
d7b01fb81aa8a5437cb03bc36afe15cf0e55fb89 jdk8u76-b00
c1679cc87ba045219169cabb6b9b378c2b5cc578 jdk8u76-b01
c1679cc87ba045219169cabb6b9b378c2b5cc578 jdk8u76-b01
218483967e52b419d885d34af4488a81c5133804 jdk8u76-b02
218483967e52b419d885d34af4488a81c5133804 jdk8u76-b02
...
@@ -825,4 +827,6 @@ c1679cc87ba045219169cabb6b9b378c2b5cc578 jdk8u76-b01
...
@@ -825,4 +827,6 @@ c1679cc87ba045219169cabb6b9b378c2b5cc578 jdk8u76-b01
16f7b676725aadafb79ea105b22df112e2593a78 jdk8u76-b04
16f7b676725aadafb79ea105b22df112e2593a78 jdk8u76-b04
35bfaf7f9021b5c1e86effbeac075753a82e9a0c jdk8u76-b05
35bfaf7f9021b5c1e86effbeac075753a82e9a0c jdk8u76-b05
6449ee3bf707225372709ac830524c00984c601f jdk8u76-b06
6449ee3bf707225372709ac830524c00984c601f jdk8u76-b06
7d1074c74d6000ec8257917ebfcee3fed4249f7d jdk8u76-b07
392f8722fc513e28f78c5c563d51af7dc8466b29 jdk8u76-b08
b374548dcb4834eb8731a06b52faddd0f10bd45d jdk8u81-b00
b374548dcb4834eb8731a06b52faddd0f10bd45d jdk8u81-b00
src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp
浏览文件 @
07630a3f
...
@@ -3839,6 +3839,16 @@ G1CollectedHeap::cleanup_surviving_young_words() {
...
@@ -3839,6 +3839,16 @@ G1CollectedHeap::cleanup_surviving_young_words() {
_surviving_young_words
=
NULL
;
_surviving_young_words
=
NULL
;
}
}
class
VerifyRegionRemSetClosure
:
public
HeapRegionClosure
{
public:
bool
doHeapRegion
(
HeapRegion
*
hr
)
{
if
(
!
hr
->
continuesHumongous
())
{
hr
->
verify_rem_set
();
}
return
false
;
}
};
#ifdef ASSERT
#ifdef ASSERT
class
VerifyCSetClosure
:
public
HeapRegionClosure
{
class
VerifyCSetClosure
:
public
HeapRegionClosure
{
public:
public:
...
@@ -4015,6 +4025,14 @@ G1CollectedHeap::do_collection_pause_at_safepoint(double target_pause_time_ms) {
...
@@ -4015,6 +4025,14 @@ G1CollectedHeap::do_collection_pause_at_safepoint(double target_pause_time_ms) {
increment_total_collections
(
false
/* full gc */
);
increment_total_collections
(
false
/* full gc */
);
increment_gc_time_stamp
();
increment_gc_time_stamp
();
if
(
VerifyRememberedSets
)
{
if
(
!
VerifySilently
)
{
gclog_or_tty
->
print_cr
(
"[Verifying RemSets before GC]"
);
}
VerifyRegionRemSetClosure
v_cl
;
heap_region_iterate
(
&
v_cl
);
}
verify_before_gc
();
verify_before_gc
();
check_bitmaps
(
"GC Start"
);
check_bitmaps
(
"GC Start"
);
...
@@ -4246,6 +4264,14 @@ G1CollectedHeap::do_collection_pause_at_safepoint(double target_pause_time_ms) {
...
@@ -4246,6 +4264,14 @@ G1CollectedHeap::do_collection_pause_at_safepoint(double target_pause_time_ms) {
// scanning cards (see CR 7039627).
// scanning cards (see CR 7039627).
increment_gc_time_stamp
();
increment_gc_time_stamp
();
if
(
VerifyRememberedSets
)
{
if
(
!
VerifySilently
)
{
gclog_or_tty
->
print_cr
(
"[Verifying RemSets after GC]"
);
}
VerifyRegionRemSetClosure
v_cl
;
heap_region_iterate
(
&
v_cl
);
}
verify_after_gc
();
verify_after_gc
();
check_bitmaps
(
"GC End"
);
check_bitmaps
(
"GC End"
);
...
...
src/share/vm/gc_implementation/g1/heapRegion.cpp
浏览文件 @
07630a3f
...
@@ -639,8 +639,8 @@ void HeapRegion::print_on(outputStream* st) const {
...
@@ -639,8 +639,8 @@ void HeapRegion::print_on(outputStream* st) const {
G1OffsetTableContigSpace
::
print_on
(
st
);
G1OffsetTableContigSpace
::
print_on
(
st
);
}
}
class
VerifyLiveClosure
:
public
OopClosure
{
class
G1VerificationClosure
:
public
OopClosure
{
pr
ivate
:
pr
otected
:
G1CollectedHeap
*
_g1h
;
G1CollectedHeap
*
_g1h
;
CardTableModRefBS
*
_bs
;
CardTableModRefBS
*
_bs
;
oop
_containing_obj
;
oop
_containing_obj
;
...
@@ -651,7 +651,7 @@ public:
...
@@ -651,7 +651,7 @@ public:
// _vo == UsePrevMarking -> use "prev" marking information,
// _vo == UsePrevMarking -> use "prev" marking information,
// _vo == UseNextMarking -> use "next" marking information,
// _vo == UseNextMarking -> use "next" marking information,
// _vo == UseMarkWord -> use mark word from object header.
// _vo == UseMarkWord -> use mark word from object header.
VerifyLive
Closure
(
G1CollectedHeap
*
g1h
,
VerifyOption
vo
)
:
G1Verification
Closure
(
G1CollectedHeap
*
g1h
,
VerifyOption
vo
)
:
_g1h
(
g1h
),
_bs
(
NULL
),
_containing_obj
(
NULL
),
_g1h
(
g1h
),
_bs
(
NULL
),
_containing_obj
(
NULL
),
_failures
(
false
),
_n_failures
(
0
),
_vo
(
vo
)
_failures
(
false
),
_n_failures
(
0
),
_vo
(
vo
)
{
{
...
@@ -667,9 +667,6 @@ public:
...
@@ -667,9 +667,6 @@ public:
bool
failures
()
{
return
_failures
;
}
bool
failures
()
{
return
_failures
;
}
int
n_failures
()
{
return
_n_failures
;
}
int
n_failures
()
{
return
_n_failures
;
}
virtual
void
do_oop
(
narrowOop
*
p
)
{
do_oop_work
(
p
);
}
virtual
void
do_oop
(
oop
*
p
)
{
do_oop_work
(
p
);
}
void
print_object
(
outputStream
*
out
,
oop
obj
)
{
void
print_object
(
outputStream
*
out
,
oop
obj
)
{
#ifdef PRODUCT
#ifdef PRODUCT
Klass
*
k
=
obj
->
klass
();
Klass
*
k
=
obj
->
klass
();
...
@@ -679,19 +676,31 @@ public:
...
@@ -679,19 +676,31 @@ public:
obj
->
print_on
(
out
);
obj
->
print_on
(
out
);
#endif // PRODUCT
#endif // PRODUCT
}
}
};
class
VerifyLiveClosure
:
public
G1VerificationClosure
{
public:
VerifyLiveClosure
(
G1CollectedHeap
*
g1h
,
VerifyOption
vo
)
:
G1VerificationClosure
(
g1h
,
vo
)
{}
virtual
void
do_oop
(
narrowOop
*
p
)
{
do_oop_work
(
p
);
}
virtual
void
do_oop
(
oop
*
p
)
{
do_oop_work
(
p
);
}
template
<
class
T
>
template
<
class
T
>
void
do_oop_work
(
T
*
p
)
{
void
do_oop_work
(
T
*
p
)
{
assert
(
_containing_obj
!=
NULL
,
"Precondition"
);
assert
(
_containing_obj
!=
NULL
,
"Precondition"
);
assert
(
!
_g1h
->
is_obj_dead_cond
(
_containing_obj
,
_vo
),
assert
(
!
_g1h
->
is_obj_dead_cond
(
_containing_obj
,
_vo
),
"Precondition"
);
"Precondition"
);
verify_liveness
(
p
);
}
template
<
class
T
>
void
verify_liveness
(
T
*
p
)
{
T
heap_oop
=
oopDesc
::
load_heap_oop
(
p
);
T
heap_oop
=
oopDesc
::
load_heap_oop
(
p
);
if
(
!
oopDesc
::
is_null
(
heap_oop
))
{
if
(
!
oopDesc
::
is_null
(
heap_oop
))
{
oop
obj
=
oopDesc
::
decode_heap_oop_not_null
(
heap_oop
);
oop
obj
=
oopDesc
::
decode_heap_oop_not_null
(
heap_oop
);
bool
failed
=
false
;
bool
failed
=
false
;
if
(
!
_g1h
->
is_in_closed_subset
(
obj
)
||
_g1h
->
is_obj_dead_cond
(
obj
,
_vo
))
{
if
(
!
_g1h
->
is_in_closed_subset
(
obj
)
||
_g1h
->
is_obj_dead_cond
(
obj
,
_vo
))
{
MutexLockerEx
x
(
ParGCRareEvent_lock
,
MutexLockerEx
x
(
ParGCRareEvent_lock
,
Mutex
::
_no_safepoint_check_flag
);
Mutex
::
_no_safepoint_check_flag
);
if
(
!
_failures
)
{
if
(
!
_failures
)
{
gclog_or_tty
->
cr
();
gclog_or_tty
->
cr
();
...
@@ -727,50 +736,71 @@ public:
...
@@ -727,50 +736,71 @@ public:
failed
=
true
;
failed
=
true
;
_n_failures
++
;
_n_failures
++
;
}
}
}
}
};
if
(
!
_g1h
->
full_collection
()
||
G1VerifyRSetsDuringFullGC
)
{
class
VerifyRemSetClosure
:
public
G1VerificationClosure
{
HeapRegion
*
from
=
_g1h
->
heap_region_containing
((
HeapWord
*
)
p
);
public:
HeapRegion
*
to
=
_g1h
->
heap_region_containing
(
obj
);
VerifyRemSetClosure
(
G1CollectedHeap
*
g1h
,
VerifyOption
vo
)
:
G1VerificationClosure
(
g1h
,
vo
)
{}
if
(
from
!=
NULL
&&
to
!=
NULL
&&
virtual
void
do_oop
(
narrowOop
*
p
)
{
do_oop_work
(
p
);
}
from
!=
to
&&
virtual
void
do_oop
(
oop
*
p
)
{
do_oop_work
(
p
);
}
!
to
->
isHumongous
())
{
jbyte
cv_obj
=
*
_bs
->
byte_for_const
(
_containing_obj
);
template
<
class
T
>
jbyte
cv_field
=
*
_bs
->
byte_for_const
(
p
);
void
do_oop_work
(
T
*
p
)
{
const
jbyte
dirty
=
CardTableModRefBS
::
dirty_card_val
();
assert
(
_containing_obj
!=
NULL
,
"Precondition"
);
assert
(
!
_g1h
->
is_obj_dead_cond
(
_containing_obj
,
_vo
),
bool
is_bad
=
!
(
from
->
is_young
()
"Precondition"
);
||
to
->
rem_set
()
->
contains_reference
(
p
)
verify_remembered_set
(
p
);
||
!
G1HRRSFlushLogBuffersOnVerify
&&
// buffers were not flushed
}
(
_containing_obj
->
is_objArray
()
?
cv_field
==
dirty
template
<
class
T
>
:
cv_obj
==
dirty
||
cv_field
==
dirty
));
void
verify_remembered_set
(
T
*
p
)
{
if
(
is_bad
)
{
T
heap_oop
=
oopDesc
::
load_heap_oop
(
p
);
MutexLockerEx
x
(
ParGCRareEvent_lock
,
if
(
!
oopDesc
::
is_null
(
heap_oop
))
{
Mutex
::
_no_safepoint_check_flag
);
oop
obj
=
oopDesc
::
decode_heap_oop_not_null
(
heap_oop
);
bool
failed
=
false
;
if
(
!
_failures
)
{
HeapRegion
*
from
=
_g1h
->
heap_region_containing
((
HeapWord
*
)
p
);
gclog_or_tty
->
cr
();
HeapRegion
*
to
=
_g1h
->
heap_region_containing
(
obj
);
gclog_or_tty
->
print_cr
(
"----------"
);
if
(
from
!=
NULL
&&
to
!=
NULL
&&
}
from
!=
to
&&
gclog_or_tty
->
print_cr
(
"Missing rem set entry:"
);
!
to
->
isHumongous
())
{
gclog_or_tty
->
print_cr
(
"Field "
PTR_FORMAT
" "
jbyte
cv_obj
=
*
_bs
->
byte_for_const
(
_containing_obj
);
"of obj "
PTR_FORMAT
", "
jbyte
cv_field
=
*
_bs
->
byte_for_const
(
p
);
"in region "
HR_FORMAT
,
const
jbyte
dirty
=
CardTableModRefBS
::
dirty_card_val
();
p
,
(
void
*
)
_containing_obj
,
HR_FORMAT_PARAMS
(
from
));
bool
is_bad
=
!
(
from
->
is_young
()
_containing_obj
->
print_on
(
gclog_or_tty
);
||
to
->
rem_set
()
->
contains_reference
(
p
)
gclog_or_tty
->
print_cr
(
"points to obj "
PTR_FORMAT
" "
||
!
G1HRRSFlushLogBuffersOnVerify
&&
// buffers were not flushed
"in region "
HR_FORMAT
,
(
_containing_obj
->
is_objArray
()
?
(
void
*
)
obj
,
cv_field
==
dirty
HR_FORMAT_PARAMS
(
to
));
:
cv_obj
==
dirty
||
cv_field
==
dirty
));
obj
->
print_on
(
gclog_or_tty
);
if
(
is_bad
)
{
gclog_or_tty
->
print_cr
(
"Obj head CTE = %d, field CTE = %d."
,
MutexLockerEx
x
(
ParGCRareEvent_lock
,
cv_obj
,
cv_field
);
Mutex
::
_no_safepoint_check_flag
);
if
(
!
_failures
)
{
gclog_or_tty
->
cr
();
gclog_or_tty
->
print_cr
(
"----------"
);
gclog_or_tty
->
print_cr
(
"----------"
);
gclog_or_tty
->
flush
();
_failures
=
true
;
if
(
!
failed
)
_n_failures
++
;
}
}
gclog_or_tty
->
print_cr
(
"Missing rem set entry:"
);
gclog_or_tty
->
print_cr
(
"Field "
PTR_FORMAT
" "
"of obj "
PTR_FORMAT
", "
"in region "
HR_FORMAT
,
p
,
(
void
*
)
_containing_obj
,
HR_FORMAT_PARAMS
(
from
));
_containing_obj
->
print_on
(
gclog_or_tty
);
gclog_or_tty
->
print_cr
(
"points to obj "
PTR_FORMAT
" "
"in region "
HR_FORMAT
,
(
void
*
)
obj
,
HR_FORMAT_PARAMS
(
to
));
obj
->
print_on
(
gclog_or_tty
);
gclog_or_tty
->
print_cr
(
"Obj head CTE = %d, field CTE = %d."
,
cv_obj
,
cv_field
);
gclog_or_tty
->
print_cr
(
"----------"
);
gclog_or_tty
->
flush
();
_failures
=
true
;
if
(
!
failed
)
_n_failures
++
;
}
}
}
}
}
}
...
@@ -787,6 +817,7 @@ void HeapRegion::verify(VerifyOption vo,
...
@@ -787,6 +817,7 @@ void HeapRegion::verify(VerifyOption vo,
HeapWord
*
p
=
bottom
();
HeapWord
*
p
=
bottom
();
HeapWord
*
prev_p
=
NULL
;
HeapWord
*
prev_p
=
NULL
;
VerifyLiveClosure
vl_cl
(
g1
,
vo
);
VerifyLiveClosure
vl_cl
(
g1
,
vo
);
VerifyRemSetClosure
vr_cl
(
g1
,
vo
);
bool
is_humongous
=
isHumongous
();
bool
is_humongous
=
isHumongous
();
bool
do_bot_verify
=
!
is_young
();
bool
do_bot_verify
=
!
is_young
();
size_t
object_num
=
0
;
size_t
object_num
=
0
;
...
@@ -832,7 +863,23 @@ void HeapRegion::verify(VerifyOption vo,
...
@@ -832,7 +863,23 @@ void HeapRegion::verify(VerifyOption vo,
return
;
return
;
}
else
{
}
else
{
vl_cl
.
set_containing_obj
(
obj
);
vl_cl
.
set_containing_obj
(
obj
);
obj
->
oop_iterate_no_header
(
&
vl_cl
);
if
(
!
g1
->
full_collection
()
||
G1VerifyRSetsDuringFullGC
)
{
// verify liveness and rem_set
vr_cl
.
set_containing_obj
(
obj
);
G1Mux2Closure
mux
(
&
vl_cl
,
&
vr_cl
);
obj
->
oop_iterate_no_header
(
&
mux
);
if
(
vr_cl
.
failures
())
{
*
failures
=
true
;
}
if
(
G1MaxVerifyFailures
>=
0
&&
vr_cl
.
n_failures
()
>=
G1MaxVerifyFailures
)
{
return
;
}
}
else
{
// verify only liveness
obj
->
oop_iterate_no_header
(
&
vl_cl
);
}
if
(
vl_cl
.
failures
())
{
if
(
vl_cl
.
failures
())
{
*
failures
=
true
;
*
failures
=
true
;
}
}
...
@@ -842,7 +889,7 @@ void HeapRegion::verify(VerifyOption vo,
...
@@ -842,7 +889,7 @@ void HeapRegion::verify(VerifyOption vo,
}
}
}
}
}
else
{
}
else
{
gclog_or_tty
->
print_cr
(
PTR_FORMAT
" no an oop"
,
(
void
*
)
obj
);
gclog_or_tty
->
print_cr
(
PTR_FORMAT
" no
t
an oop"
,
(
void
*
)
obj
);
*
failures
=
true
;
*
failures
=
true
;
return
;
return
;
}
}
...
@@ -930,6 +977,46 @@ void HeapRegion::verify() const {
...
@@ -930,6 +977,46 @@ void HeapRegion::verify() const {
verify
(
VerifyOption_G1UsePrevMarking
,
/* failures */
&
dummy
);
verify
(
VerifyOption_G1UsePrevMarking
,
/* failures */
&
dummy
);
}
}
void
HeapRegion
::
verify_rem_set
(
VerifyOption
vo
,
bool
*
failures
)
const
{
G1CollectedHeap
*
g1
=
G1CollectedHeap
::
heap
();
*
failures
=
false
;
HeapWord
*
p
=
bottom
();
HeapWord
*
prev_p
=
NULL
;
VerifyRemSetClosure
vr_cl
(
g1
,
vo
);
while
(
p
<
top
())
{
oop
obj
=
oop
(
p
);
size_t
obj_size
=
block_size
(
p
);
if
(
!
g1
->
is_obj_dead_cond
(
obj
,
this
,
vo
))
{
if
(
obj
->
is_oop
())
{
vr_cl
.
set_containing_obj
(
obj
);
obj
->
oop_iterate_no_header
(
&
vr_cl
);
if
(
vr_cl
.
failures
())
{
*
failures
=
true
;
}
if
(
G1MaxVerifyFailures
>=
0
&&
vr_cl
.
n_failures
()
>=
G1MaxVerifyFailures
)
{
return
;
}
}
else
{
gclog_or_tty
->
print_cr
(
PTR_FORMAT
" not an oop"
,
p2i
(
obj
));
*
failures
=
true
;
return
;
}
}
prev_p
=
p
;
p
+=
obj_size
;
}
}
void
HeapRegion
::
verify_rem_set
()
const
{
bool
failures
=
false
;
verify_rem_set
(
VerifyOption_G1UsePrevMarking
,
&
failures
);
guarantee
(
!
failures
,
"HeapRegion RemSet verification failed"
);
}
// G1OffsetTableContigSpace code; copied from space.cpp. Hope this can go
// G1OffsetTableContigSpace code; copied from space.cpp. Hope this can go
// away eventually.
// away eventually.
...
...
src/share/vm/gc_implementation/g1/heapRegion.hpp
浏览文件 @
07630a3f
...
@@ -779,6 +779,9 @@ class HeapRegion: public G1OffsetTableContigSpace {
...
@@ -779,6 +779,9 @@ class HeapRegion: public G1OffsetTableContigSpace {
// Override; it uses the "prev" marking information
// Override; it uses the "prev" marking information
virtual
void
verify
()
const
;
virtual
void
verify
()
const
;
void
verify_rem_set
(
VerifyOption
vo
,
bool
*
failures
)
const
;
void
verify_rem_set
()
const
;
};
};
// HeapRegionClosure is used for iterating over regions.
// HeapRegionClosure is used for iterating over regions.
...
...
test/compiler/loopopts/CountedLoopProblem.java
浏览文件 @
07630a3f
...
@@ -36,18 +36,22 @@ public class CountedLoopProblem {
...
@@ -36,18 +36,22 @@ public class CountedLoopProblem {
public
static
void
main
(
String
[]
args
)
throws
Exception
{
public
static
void
main
(
String
[]
args
)
throws
Exception
{
Random
r
=
new
Random
(
42
);
Random
r
=
new
Random
(
42
);
int
x
=
0
;
int
x
=
0
;
StringBuilder
sb
=
new
StringBuilder
();
try
{
for
(
int
i
=
0
;
i
<
1000000
;
++
i
)
{
StringBuilder
sb
=
new
StringBuilder
();
int
v
=
Math
.
abs
(
r
.
nextInt
());
for
(
int
i
=
0
;
i
<
1000000
;
++
i
)
{
sb
.
append
(
'+'
).
append
(
v
).
append
(
'\n'
);
int
v
=
Math
.
abs
(
r
.
nextInt
());
x
+=
v
;
sb
.
append
(
'+'
).
append
(
v
).
append
(
'\n'
);
// To trigger the problem we must OSR in the following loop
x
+=
v
;
// To make the problem 100% reproducible run with -XX:-TieredCompilation -XX:OSROnlyBCI=62
// To trigger the problem we must OSR in the following loop
while
(
x
<
0
)
x
+=
1000000000
;
// To make the problem 100% reproducible run with -XX:-TieredCompilation -XX:OSROnlyBCI=62
sb
.
append
(
'='
).
append
(
x
).
append
(
'\n'
);
while
(
x
<
0
)
x
+=
1000000000
;
}
sb
.
append
(
'='
).
append
(
x
).
append
(
'\n'
);
if
(
sb
.
toString
().
hashCode
()
!=
0xaba94591
)
{
}
throw
new
Exception
(
"Unexpected result"
);
if
(
sb
.
toString
().
hashCode
()
!=
0xaba94591
)
{
throw
new
Exception
(
"Unexpected result"
);
}
}
catch
(
OutOfMemoryError
e
)
{
// small heap, ignore
}
}
}
}
}
}
...
...
test/stress/gc/TestStressRSetCoarsening.java
0 → 100644
浏览文件 @
07630a3f
/*
* Copyright (c) 2016, 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.
*/
import
java.util.concurrent.TimeoutException
;
import
sun.hotspot.WhiteBox
;
/*
* @test TestStressRSetCoarsening.java
* @key stress
* @bug 8146984 8147087
* @requires vm.gc=="G1" | vm.gc=="null"
* @requires os.maxMemory > 3G
*
* @summary Stress G1 Remembered Set by creating a lot of cross region links
* @library /testlibrary /testlibrary/whitebox
* @build sun.hotspot.WhiteBox
* @run main ClassFileInstaller sun.hotspot.WhiteBox
* sun.hotspot.WhiteBox$WhiteBoxPermission
* @run main/othervm/timeout=300
* -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC
* -XX:+IgnoreUnrecognizedVMOptions -XX:+PrintGC -XX:+PrintGCTimeStamps -Xlog:gc
* -Xmx500m -XX:G1HeapRegionSize=1m -XX:MaxGCPauseMillis=1000 TestStressRSetCoarsening 1 0 300
* @run main/othervm/timeout=300
* -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC
* -XX:+IgnoreUnrecognizedVMOptions -XX:+PrintGC -XX:+PrintGCTimeStamps -Xlog:gc
* -Xmx500m -XX:G1HeapRegionSize=8m -XX:MaxGCPauseMillis=1000 TestStressRSetCoarsening 1 10 300
* @run main/othervm/timeout=300
* -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC
* -XX:+IgnoreUnrecognizedVMOptions -XX:+PrintGC -XX:+PrintGCTimeStamps -Xlog:gc
* -Xmx500m -XX:G1HeapRegionSize=32m -XX:MaxGCPauseMillis=1000 TestStressRSetCoarsening 42 10 300
* @run main/othervm/timeout=300
* -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC
* -XX:+IgnoreUnrecognizedVMOptions -XX:+PrintGC -XX:+PrintGCTimeStamps -Xlog:gc
* -Xmx500m -XX:G1HeapRegionSize=1m -XX:MaxGCPauseMillis=1000 TestStressRSetCoarsening 2 0 300
* @run main/othervm/timeout=1800
* -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC
* -XX:+IgnoreUnrecognizedVMOptions -XX:+PrintGC -XX:+PrintGCTimeStamps -Xlog:gc
* -Xmx1G -XX:G1HeapRegionSize=1m -XX:MaxGCPauseMillis=1000 TestStressRSetCoarsening 500 0 1800
* @run main/othervm/timeout=1800
* -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC
* -XX:+IgnoreUnrecognizedVMOptions -XX:+PrintGC -XX:+PrintGCTimeStamps -Xlog:gc
* -Xmx1G -XX:G1HeapRegionSize=1m -XX:MaxGCPauseMillis=1000 TestStressRSetCoarsening 10 10 1800
*/
/**
* What the test does.
* Preparation stage:
* Fill out ~90% of the heap with objects, each object is an object array.
* If we want to allocate K objects per region, we calculate N to meet:
* sizeOf(Object[N]) ~= regionSize / K
* Stress stage:
* No more allocation, so no more GC.
* We will perform a number of iterations. On each iteration i,
* for each pair of regions Rx and Ry we will set c[i] references
* from Rx to Ry. If c[i] less than c[i-1] at the end of iteration
* concurrent mark cycle will be initiated (to recalculate remembered sets).
* As the result RSet will be growing up and down, up and down many times.
*
* The test expects: no crash and no timeouts.
*
* Test Parameters:
* args[0] - number of objects per Heap Region (1 - means humongous)
* args[1] - number of regions to refresh to provoke GC at the end of cycle.
* (0 - means no GC, i.e. no reading from RSet)
* args[2] - timeout in seconds (to stop execution to avoid jtreg timeout)
*/
public
class
TestStressRSetCoarsening
{
public
static
void
main
(
String
...
args
)
throws
InterruptedException
{
if
(
args
.
length
!=
3
)
{
throw
new
IllegalArgumentException
(
"Wrong number of arguments "
+
args
.
length
);
}
int
objectsPerRegion
=
Integer
.
parseInt
(
args
[
0
]);
// 1 means humongous
int
regsToRefresh
=
Integer
.
parseInt
(
args
[
1
]);
// 0 means no regions to refresh at the end of cycle
int
timeout
=
Integer
.
parseInt
(
args
[
2
]);
// in seconds, test should stop working eariler
new
TestStressRSetCoarsening
(
objectsPerRegion
,
regsToRefresh
,
timeout
).
go
();
}
private
static
final
long
KB
=
1024
;
private
static
final
long
MB
=
1024
*
KB
;
private
static
final
WhiteBox
WB
=
WhiteBox
.
getWhiteBox
();
public
final
Object
[][]
storage
;
/**
* Number of objects per region. This is a test parameter.
*/
public
final
int
K
;
/**
* Length of object array: sizeOf(Object[N]) ~= regionSize / K
* N will be calculated as function of K.
*/
public
final
int
N
;
/**
* How many regions involved into testing.
* Will be calculated as heapFractionToAllocate * freeRegionCount.
*/
public
final
int
regionCount
;
/**
* How much heap to use.
*/
public
final
float
heapFractionToAllocate
=
0.9f
;
/**
* How many regions to be refreshed at the end of cycle.
* This is a test parameter.
*/
public
final
int
regsToRefresh
;
/**
* Initial time.
*/
public
final
long
start
;
/**
* Time when the test should stop working.
*/
public
final
long
finishAt
;
/**
* Does pre-calculation and allocate necessary objects.
*
* @param objPerRegions how many objects per G1 heap region
*/
TestStressRSetCoarsening
(
int
objPerRegions
,
int
regsToRefresh
,
int
timeout
)
{
this
.
K
=
objPerRegions
;
this
.
regsToRefresh
=
regsToRefresh
;
this
.
start
=
System
.
currentTimeMillis
();
this
.
finishAt
=
start
+
timeout
*
900
;
// 10% ahead of jtreg timeout
long
regionSize
=
WB
.
g1RegionSize
();
// How many free regions
Runtime
rt
=
Runtime
.
getRuntime
();
long
used
=
rt
.
totalMemory
()
-
rt
.
freeMemory
();
long
totalFree
=
rt
.
maxMemory
()
-
used
;
regionCount
=
(
int
)
((
totalFree
/
regionSize
)
*
heapFractionToAllocate
);
long
toAllocate
=
regionCount
*
regionSize
;
System
.
out
.
println
(
"%% Test parameters"
);
System
.
out
.
println
(
"%% Objects per region : "
+
K
);
System
.
out
.
println
(
"%% Heap fraction to allocate : "
+
(
int
)
(
heapFractionToAllocate
*
100
)
+
"%"
);
System
.
out
.
println
(
"%% Regions to refresh to provoke GC: "
+
regsToRefresh
);
System
.
out
.
println
(
"%% Memory"
);
System
.
out
.
println
(
"%% used : "
+
used
/
MB
+
"M"
);
System
.
out
.
println
(
"%% available : "
+
totalFree
/
MB
+
"M"
);
System
.
out
.
println
(
"%% to allocate : "
+
toAllocate
/
MB
+
"M"
);
System
.
out
.
println
(
"%% (in regs) : "
+
regionCount
);
System
.
out
.
println
(
"%% G1 Region Size: "
+
regionSize
/
MB
+
"M"
);
int
refSize
=
WB
.
getHeapOopSize
();
// Calculate N: K*sizeOf(Object[N]) ~= regionSize
// sizeOf(Object[N]) ~= (N+4)*refSize
// ==>
// N = regionSize / K / refSize - 4;
N
=
(
int
)
((
regionSize
/
K
)
/
refSize
)
-
5
;
/*
* --------------
* region0 storage[0] = new Object[N]
* ...
* storage[K-1] = new Object[N]
* ---------------
* region1 storage[K] = new Object[N]
* ...
* storage[2*K - 1] = new Object[N]
* --------------
* ...
* --------------
* regionX storage[X*K] = new Object[N]
* ...
* storage[(X+1)*K -1] = new Object[N]
* where X = HeapFraction * TotalRegions
* -------------
*/
System
.
out
.
println
(
"%% Objects"
);
System
.
out
.
println
(
"%% N (array length) : "
+
N
);
System
.
out
.
println
(
"%% K (objects in regions): "
+
K
);
System
.
out
.
println
(
"%% Reference size : "
+
refSize
);
System
.
out
.
println
(
"%% Approximate obj size : "
+
(
N
+
2
)
*
refSize
/
KB
+
"K)"
);
storage
=
new
Object
[
regionCount
*
K
][];
for
(
int
i
=
0
;
i
<
storage
.
length
;
i
++)
{
storage
[
i
]
=
new
Object
[
N
];
}
}
public
void
go
()
throws
InterruptedException
{
// threshold for sparce -> fine
final
int
FINE
=
WB
.
getIntxVMFlag
(
"G1RSetSparseRegionEntries"
).
intValue
();
// threshold for fine -> coarse
final
int
COARSE
=
WB
.
getIntxVMFlag
(
"G1RSetRegionEntries"
).
intValue
();
// regToRegRefCounts - array of reference counts from region to region
// at the the end of iteration.
// The number of test iterations is array length - 1.
// If c[i] > c[i-1] then during the iteration i more references will
// be created.
// If c[i] < c[i-1] then some referenes will be cleaned.
int
[]
regToRegRefCounts
=
{
0
,
FINE
/
2
,
0
,
FINE
,
(
FINE
+
COARSE
)
/
2
,
0
,
COARSE
,
COARSE
+
10
,
FINE
+
1
,
FINE
/
2
,
0
};
// For progress tracking
int
[]
progress
=
new
int
[
regToRegRefCounts
.
length
];
progress
[
0
]
=
0
;
for
(
int
i
=
1
;
i
<
regToRegRefCounts
.
length
;
i
++)
{
progress
[
i
]
=
progress
[
i
-
1
]
+
Math
.
abs
(
regToRegRefCounts
[
i
]
-
regToRegRefCounts
[
i
-
1
]);
}
try
{
for
(
int
i
=
1
;
i
<
regToRegRefCounts
.
length
;
i
++)
{
int
pre
=
regToRegRefCounts
[
i
-
1
];
int
cur
=
regToRegRefCounts
[
i
];
float
prog
=
((
float
)
progress
[
i
-
1
]
/
progress
[
progress
.
length
-
1
]);
System
.
out
.
println
(
"%% step "
+
i
+
" out of "
+
(
regToRegRefCounts
.
length
-
1
)
+
" (~"
+
(
int
)
(
100
*
prog
)
+
"% done)"
);
System
.
out
.
println
(
"%% "
+
pre
+
" --> "
+
cur
);
for
(
int
to
=
0
;
to
<
regionCount
;
to
++)
{
// Select a celebrity object that we will install references to.
// The celebrity will be referred from all other regions.
// If the number of references after should be less than they
// were before, select NULL.
Object
celebrity
=
cur
>
pre
?
storage
[
to
*
K
]
:
null
;
for
(
int
from
=
0
;
from
<
regionCount
;
from
++)
{
if
(
to
==
from
)
{
continue
;
// no need to refer to itself
}
int
step
=
cur
>
pre
?
+
1
:
-
1
;
for
(
int
rn
=
pre
;
rn
!=
cur
;
rn
+=
step
)
{
storage
[
getY
(
to
,
from
,
rn
)][
getX
(
to
,
from
,
rn
)]
=
celebrity
;
if
(
System
.
currentTimeMillis
()
>
finishAt
)
{
throw
new
TimeoutException
();
}
}
}
}
if
(
pre
>
cur
)
{
// Number of references went down.
// Need to provoke recalculation of RSet.
WB
.
g1StartConcMarkCycle
();
while
(
WB
.
g1InConcurrentMark
())
{
Thread
.
sleep
(
1
);
}
}
// To force the use of rememebered set entries we need to provoke a GC.
// To induce some fragmentation, and some mixed GCs, we need
// to make a few objects unreachable.
for
(
int
toClean
=
i
*
regsToRefresh
;
toClean
<
(
i
+
1
)
*
regsToRefresh
;
toClean
++)
{
int
to
=
toClean
%
regionCount
;
// Need to remove all references from all regions to the region 'to'
for
(
int
from
=
0
;
from
<
regionCount
;
from
++)
{
if
(
to
==
from
)
{
continue
;
// no need to refer to itself
}
for
(
int
rn
=
0
;
rn
<=
cur
;
rn
++)
{
storage
[
getY
(
to
,
from
,
rn
)][
getX
(
to
,
from
,
rn
)]
=
null
;
}
}
// 'Refresh' storage elements for the region 'to'
// After that loop all 'old' objects in the region 'to'
// should become unreachable.
for
(
int
k
=
0
;
k
<
K
;
k
++)
{
storage
[(
to
*
K
+
k
)
%
storage
.
length
]
=
new
Object
[
N
];
}
}
}
}
catch
(
TimeoutException
e
)
{
System
.
out
.
println
(
"%% TIMEOUT!!!"
);
}
long
now
=
System
.
currentTimeMillis
();
System
.
out
.
println
(
"%% Summary"
);
System
.
out
.
println
(
"%% Time spent : "
+
((
now
-
start
)
/
1000
)
+
" seconds"
);
System
.
out
.
println
(
"%% Free memory left : "
+
Runtime
.
getRuntime
().
freeMemory
()
/
KB
+
"K"
);
System
.
out
.
println
(
"%% Test passed"
);
}
/**
* Returns X index in the Storage of the reference #rn from the region
* 'from' to the region 'to'.
*
* @param to region # to refer to
* @param from region # to refer from
* @param rn number of reference
*
* @return X index in the range: [0 ... N-1]
*/
private
int
getX
(
int
to
,
int
from
,
int
rn
)
{
return
(
rn
*
regionCount
+
to
)
%
N
;
}
/**
* Returns Y index in the Storage of the reference #rn from the region
* 'from' to the region 'to'.
*
* @param to region # to refer to
* @param from region # to refer from
* @param rn number of reference
*
* @return Y index in the range: [0 ... K*regionCount -1]
*/
private
int
getY
(
int
to
,
int
from
,
int
rn
)
{
return
((
rn
*
regionCount
+
to
)
/
N
+
from
*
K
)
%
(
regionCount
*
K
);
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录