Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
aefda4e7
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看板
提交
aefda4e7
编写于
8月 31, 2009
作者:
A
apetrusenko
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
6841313: G1: dirty cards of survivor regions in parallel
Reviewed-by: tonyp, iveresov
上级
b1caa4ad
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
91 addition
and
13 deletion
+91
-13
src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp
src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp
+63
-12
src/share/vm/gc_implementation/g1/g1_globals.hpp
src/share/vm/gc_implementation/g1/g1_globals.hpp
+4
-1
src/share/vm/memory/cardTableModRefBS.cpp
src/share/vm/memory/cardTableModRefBS.cpp
+23
-0
src/share/vm/memory/cardTableModRefBS.hpp
src/share/vm/memory/cardTableModRefBS.hpp
+1
-0
未找到文件。
src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp
浏览文件 @
aefda4e7
...
@@ -2739,8 +2739,6 @@ G1CollectedHeap::do_collection_pause_at_safepoint() {
...
@@ -2739,8 +2739,6 @@ G1CollectedHeap::do_collection_pause_at_safepoint() {
_in_cset_fast_test
=
NULL
;
_in_cset_fast_test
=
NULL
;
_in_cset_fast_test_base
=
NULL
;
_in_cset_fast_test_base
=
NULL
;
release_gc_alloc_regions
(
false
/* totally */
);
cleanup_surviving_young_words
();
cleanup_surviving_young_words
();
if
(
g1_policy
()
->
in_young_gc_mode
())
{
if
(
g1_policy
()
->
in_young_gc_mode
())
{
...
@@ -4132,6 +4130,7 @@ void G1CollectedHeap::evacuate_collection_set() {
...
@@ -4132,6 +4130,7 @@ void G1CollectedHeap::evacuate_collection_set() {
G1KeepAliveClosure
keep_alive
(
this
);
G1KeepAliveClosure
keep_alive
(
this
);
JNIHandles
::
weak_oops_do
(
&
is_alive
,
&
keep_alive
);
JNIHandles
::
weak_oops_do
(
&
is_alive
,
&
keep_alive
);
}
}
release_gc_alloc_regions
(
false
/* totally */
);
g1_rem_set
()
->
cleanup_after_oops_into_collection_set_do
();
g1_rem_set
()
->
cleanup_after_oops_into_collection_set_do
();
concurrent_g1_refine
()
->
clear_hot_cache
();
concurrent_g1_refine
()
->
clear_hot_cache
();
...
@@ -4265,12 +4264,18 @@ void G1CollectedHeap::dirtyCardsForYoungRegions(CardTableModRefBS* ct_bs, HeapRe
...
@@ -4265,12 +4264,18 @@ void G1CollectedHeap::dirtyCardsForYoungRegions(CardTableModRefBS* ct_bs, HeapRe
class
G1ParCleanupCTTask
:
public
AbstractGangTask
{
class
G1ParCleanupCTTask
:
public
AbstractGangTask
{
CardTableModRefBS
*
_ct_bs
;
CardTableModRefBS
*
_ct_bs
;
G1CollectedHeap
*
_g1h
;
G1CollectedHeap
*
_g1h
;
HeapRegion
*
volatile
_so_head
;
HeapRegion
*
volatile
_su_head
;
public:
public:
G1ParCleanupCTTask
(
CardTableModRefBS
*
ct_bs
,
G1ParCleanupCTTask
(
CardTableModRefBS
*
ct_bs
,
G1CollectedHeap
*
g1h
)
:
G1CollectedHeap
*
g1h
,
HeapRegion
*
scan_only_list
,
HeapRegion
*
survivor_list
)
:
AbstractGangTask
(
"G1 Par Cleanup CT Task"
),
AbstractGangTask
(
"G1 Par Cleanup CT Task"
),
_ct_bs
(
ct_bs
),
_ct_bs
(
ct_bs
),
_g1h
(
g1h
)
_g1h
(
g1h
),
_so_head
(
scan_only_list
),
_su_head
(
survivor_list
)
{
}
{
}
void
work
(
int
i
)
{
void
work
(
int
i
)
{
...
@@ -4278,22 +4283,64 @@ public:
...
@@ -4278,22 +4283,64 @@ public:
while
(
r
=
_g1h
->
pop_dirty_cards_region
())
{
while
(
r
=
_g1h
->
pop_dirty_cards_region
())
{
clear_cards
(
r
);
clear_cards
(
r
);
}
}
// Redirty the cards of the scan-only and survivor regions.
dirty_list
(
&
this
->
_so_head
);
dirty_list
(
&
this
->
_su_head
);
}
}
void
clear_cards
(
HeapRegion
*
r
)
{
void
clear_cards
(
HeapRegion
*
r
)
{
// Cards for Survivor and Scan-Only regions will be dirtied later.
// Cards for Survivor and Scan-Only regions will be dirtied later.
if
(
!
r
->
is_scan_only
()
&&
!
r
->
is_survivor
())
{
if
(
!
r
->
is_scan_only
()
&&
!
r
->
is_survivor
())
{
_ct_bs
->
clear
(
MemRegion
(
r
->
bottom
(),
r
->
end
()));
_ct_bs
->
clear
(
MemRegion
(
r
->
bottom
(),
r
->
end
()));
}
}
}
}
void
dirty_list
(
HeapRegion
*
volatile
*
head_ptr
)
{
HeapRegion
*
head
;
do
{
// Pop region off the list.
head
=
*
head_ptr
;
if
(
head
!=
NULL
)
{
HeapRegion
*
r
=
(
HeapRegion
*
)
Atomic
::
cmpxchg_ptr
(
head
->
get_next_young_region
(),
head_ptr
,
head
);
if
(
r
==
head
)
{
assert
(
!
r
->
isHumongous
(),
"Humongous regions shouldn't be on survivor list"
);
_ct_bs
->
dirty
(
MemRegion
(
r
->
bottom
(),
r
->
end
()));
}
}
}
while
(
*
head_ptr
!=
NULL
);
}
};
};
#ifndef PRODUCT
class
G1VerifyCardTableCleanup
:
public
HeapRegionClosure
{
CardTableModRefBS
*
_ct_bs
;
public:
G1VerifyCardTableCleanup
(
CardTableModRefBS
*
ct_bs
)
:
_ct_bs
(
ct_bs
)
{
}
virtual
bool
doHeapRegion
(
HeapRegion
*
r
)
{
MemRegion
mr
(
r
->
bottom
(),
r
->
end
());
if
(
r
->
is_scan_only
()
||
r
->
is_survivor
())
{
_ct_bs
->
verify_dirty_region
(
mr
);
}
else
{
_ct_bs
->
verify_clean_region
(
mr
);
}
return
false
;
}
};
#endif
void
G1CollectedHeap
::
cleanUpCardTable
()
{
void
G1CollectedHeap
::
cleanUpCardTable
()
{
CardTableModRefBS
*
ct_bs
=
(
CardTableModRefBS
*
)
(
barrier_set
());
CardTableModRefBS
*
ct_bs
=
(
CardTableModRefBS
*
)
(
barrier_set
());
double
start
=
os
::
elapsedTime
();
double
start
=
os
::
elapsedTime
();
// Iterate over the dirty cards region list.
// Iterate over the dirty cards region list.
G1ParCleanupCTTask
cleanup_task
(
ct_bs
,
this
);
G1ParCleanupCTTask
cleanup_task
(
ct_bs
,
this
,
_young_list
->
first_scan_only_region
(),
_young_list
->
first_survivor_region
());
if
(
ParallelGCThreads
>
0
)
{
if
(
ParallelGCThreads
>
0
)
{
set_par_threads
(
workers
()
->
total_workers
());
set_par_threads
(
workers
()
->
total_workers
());
workers
()
->
run_task
(
&
cleanup_task
);
workers
()
->
run_task
(
&
cleanup_task
);
...
@@ -4309,18 +4356,22 @@ void G1CollectedHeap::cleanUpCardTable() {
...
@@ -4309,18 +4356,22 @@ void G1CollectedHeap::cleanUpCardTable() {
}
}
r
->
set_next_dirty_cards_region
(
NULL
);
r
->
set_next_dirty_cards_region
(
NULL
);
}
}
// now, redirty the cards of the scan-only and survivor regions
// (it seemed faster to do it this way, instead of iterating over
// all regions and then clearing / dirtying as appropriate)
dirtyCardsForYoungRegions
(
ct_bs
,
_young_list
->
first_scan_only_region
());
dirtyCardsForYoungRegions
(
ct_bs
,
_young_list
->
first_survivor_region
());
}
}
// now, redirty the cards of the scan-only and survivor regions
// (it seemed faster to do it this way, instead of iterating over
// all regions and then clearing / dirtying as appropriate)
dirtyCardsForYoungRegions
(
ct_bs
,
_young_list
->
first_scan_only_region
());
dirtyCardsForYoungRegions
(
ct_bs
,
_young_list
->
first_survivor_region
());
double
elapsed
=
os
::
elapsedTime
()
-
start
;
double
elapsed
=
os
::
elapsedTime
()
-
start
;
g1_policy
()
->
record_clear_ct_time
(
elapsed
*
1000.0
);
g1_policy
()
->
record_clear_ct_time
(
elapsed
*
1000.0
);
#ifndef PRODUCT
if
(
G1VerifyCTCleanup
||
VerifyAfterGC
)
{
G1VerifyCardTableCleanup
cleanup_verifier
(
ct_bs
);
heap_region_iterate
(
&
cleanup_verifier
);
}
#endif
}
}
void
G1CollectedHeap
::
do_collection_pause_if_appropriate
(
size_t
word_size
)
{
void
G1CollectedHeap
::
do_collection_pause_if_appropriate
(
size_t
word_size
)
{
if
(
g1_policy
()
->
should_do_collection_pause
(
word_size
))
{
if
(
g1_policy
()
->
should_do_collection_pause
(
word_size
))
{
do_collection_pause
();
do_collection_pause
();
...
...
src/share/vm/gc_implementation/g1/g1_globals.hpp
浏览文件 @
aefda4e7
...
@@ -260,6 +260,9 @@
...
@@ -260,6 +260,9 @@
\
\
develop(intx, G1CardCountCacheExpandThreshold, 16, \
develop(intx, G1CardCountCacheExpandThreshold, 16, \
"Expand the card count cache if the number of collisions for " \
"Expand the card count cache if the number of collisions for " \
"a particular entry exceeds this value.")
"a particular entry exceeds this value.") \
\
develop(bool, G1VerifyCTCleanup, false, \
"Verify card table cleanup.")
G1_FLAGS
(
DECLARE_DEVELOPER_FLAG
,
DECLARE_PD_DEVELOPER_FLAG
,
DECLARE_PRODUCT_FLAG
,
DECLARE_PD_PRODUCT_FLAG
,
DECLARE_DIAGNOSTIC_FLAG
,
DECLARE_EXPERIMENTAL_FLAG
,
DECLARE_NOTPRODUCT_FLAG
,
DECLARE_MANAGEABLE_FLAG
,
DECLARE_PRODUCT_RW_FLAG
)
G1_FLAGS
(
DECLARE_DEVELOPER_FLAG
,
DECLARE_PD_DEVELOPER_FLAG
,
DECLARE_PRODUCT_FLAG
,
DECLARE_PD_PRODUCT_FLAG
,
DECLARE_DIAGNOSTIC_FLAG
,
DECLARE_EXPERIMENTAL_FLAG
,
DECLARE_NOTPRODUCT_FLAG
,
DECLARE_MANAGEABLE_FLAG
,
DECLARE_PRODUCT_RW_FLAG
)
src/share/vm/memory/cardTableModRefBS.cpp
浏览文件 @
aefda4e7
...
@@ -660,6 +660,29 @@ void CardTableModRefBS::verify_clean_region(MemRegion mr) {
...
@@ -660,6 +660,29 @@ void CardTableModRefBS::verify_clean_region(MemRegion mr) {
GuaranteeNotModClosure
blk
(
this
);
GuaranteeNotModClosure
blk
(
this
);
non_clean_card_iterate_work
(
mr
,
&
blk
,
false
);
non_clean_card_iterate_work
(
mr
,
&
blk
,
false
);
}
}
// To verify a MemRegion is entirely dirty this closure is passed to
// dirty_card_iterate. If the region is dirty do_MemRegion will be
// invoked only once with a MemRegion equal to the one being
// verified.
class
GuaranteeDirtyClosure
:
public
MemRegionClosure
{
CardTableModRefBS
*
_ct
;
MemRegion
_mr
;
bool
_result
;
public:
GuaranteeDirtyClosure
(
CardTableModRefBS
*
ct
,
MemRegion
mr
)
:
_ct
(
ct
),
_mr
(
mr
),
_result
(
false
)
{}
void
do_MemRegion
(
MemRegion
mr
)
{
_result
=
_mr
.
equals
(
mr
);
}
bool
result
()
const
{
return
_result
;
}
};
void
CardTableModRefBS
::
verify_dirty_region
(
MemRegion
mr
)
{
GuaranteeDirtyClosure
blk
(
this
,
mr
);
dirty_card_iterate
(
mr
,
&
blk
);
guarantee
(
blk
.
result
(),
"Non-dirty cards in region that should be dirty"
);
}
#endif
#endif
bool
CardTableModRefBSForCTRS
::
card_will_be_scanned
(
jbyte
cv
)
{
bool
CardTableModRefBSForCTRS
::
card_will_be_scanned
(
jbyte
cv
)
{
...
...
src/share/vm/memory/cardTableModRefBS.hpp
浏览文件 @
aefda4e7
...
@@ -456,6 +456,7 @@ public:
...
@@ -456,6 +456,7 @@ public:
void
verify_guard
();
void
verify_guard
();
void
verify_clean_region
(
MemRegion
mr
)
PRODUCT_RETURN
;
void
verify_clean_region
(
MemRegion
mr
)
PRODUCT_RETURN
;
void
verify_dirty_region
(
MemRegion
mr
)
PRODUCT_RETURN
;
static
size_t
par_chunk_heapword_alignment
()
{
static
size_t
par_chunk_heapword_alignment
()
{
return
CardsPerStrideChunk
*
card_size_in_words
;
return
CardsPerStrideChunk
*
card_size_in_words
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录