Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
eda775b3
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看板
体验新版 GitCode,发现更多精彩内容 >>
提交
eda775b3
编写于
4月 22, 2013
作者:
M
mgerdin
浏览文件
操作
浏览文件
下载
差异文件
Merge
上级
3e6183bb
45364b23
变更
6
隐藏空白更改
内联
并排
Showing
6 changed file
with
275 addition
and
98 deletion
+275
-98
src/share/vm/classfile/classLoaderData.cpp
src/share/vm/classfile/classLoaderData.cpp
+1
-0
src/share/vm/memory/metachunk.cpp
src/share/vm/memory/metachunk.cpp
+21
-17
src/share/vm/memory/metachunk.hpp
src/share/vm/memory/metachunk.hpp
+6
-12
src/share/vm/memory/metaspace.cpp
src/share/vm/memory/metaspace.cpp
+202
-23
src/share/vm/memory/metaspace.hpp
src/share/vm/memory/metaspace.hpp
+3
-0
test/gc/7072527/TestFullGCCount.java
test/gc/7072527/TestFullGCCount.java
+42
-46
未找到文件。
src/share/vm/classfile/classLoaderData.cpp
浏览文件 @
eda775b3
...
...
@@ -686,6 +686,7 @@ void ClassLoaderDataGraph::purge() {
next
=
purge_me
->
next
();
delete
purge_me
;
}
Metaspace
::
purge
();
}
// CDS support
...
...
src/share/vm/memory/metachunk.cpp
浏览文件 @
eda775b3
...
...
@@ -28,6 +28,7 @@
#include "utilities/copy.hpp"
#include "utilities/debug.hpp"
class
VirtualSpaceNode
;
//
// Future modification
//
...
...
@@ -45,27 +46,30 @@ size_t Metachunk::_overhead =
// Metachunk methods
Metachunk
*
Metachunk
::
initialize
(
MetaWord
*
ptr
,
size_t
word_size
)
{
// Set bottom, top, and end. Allow space for the Metachunk itself
Metachunk
*
chunk
=
(
Metachunk
*
)
ptr
;
MetaWord
*
chunk_bottom
=
ptr
+
_overhead
;
chunk
->
set_bottom
(
ptr
);
chunk
->
set_top
(
chunk_bottom
);
MetaWord
*
chunk_end
=
ptr
+
word_size
;
assert
(
chunk_end
>
chunk_bottom
,
"Chunk must be too small"
);
chunk
->
set_end
(
chunk_end
);
chunk
->
set_next
(
NULL
)
;
chunk
->
set_prev
(
NULL
)
;
chunk
->
set_word_size
(
word_size
)
;
Metachunk
::
Metachunk
(
size_t
word_size
,
VirtualSpaceNode
*
container
)
:
_word_size
(
word_size
),
_bottom
(
NULL
),
_end
(
NULL
),
_top
(
NULL
),
_next
(
NULL
),
_prev
(
NULL
),
_container
(
container
)
{
_bottom
=
(
MetaWord
*
)
this
;
_top
=
(
MetaWord
*
)
this
+
_overhead
;
_end
=
(
MetaWord
*
)
this
+
word_size
;
#ifdef ASSERT
size_t
data_word_size
=
pointer_delta
(
chunk_end
,
chunk_bottom
,
sizeof
(
MetaWord
));
Copy
::
fill_to_words
((
HeapWord
*
)
chunk_bottom
,
data_word_size
,
metadata_chunk_initialize
);
set_is_free
(
false
);
size_t
data_word_size
=
pointer_delta
(
end
(),
top
(),
sizeof
(
MetaWord
));
Copy
::
fill_to_words
((
HeapWord
*
)
top
(),
data_word_size
,
metadata_chunk_initialize
);
#endif
return
chunk
;
}
MetaWord
*
Metachunk
::
allocate
(
size_t
word_size
)
{
MetaWord
*
result
=
NULL
;
// If available, bump the pointer to allocate.
...
...
src/share/vm/memory/metachunk.hpp
浏览文件 @
eda775b3
...
...
@@ -41,10 +41,13 @@
// | | | |
// +--------------+ <- bottom ---+ ---+
class
VirtualSpaceNode
;
class
Metachunk
VALUE_OBJ_CLASS_SPEC
{
// link to support lists of chunks
Metachunk
*
_next
;
Metachunk
*
_prev
;
VirtualSpaceNode
*
_container
;
MetaWord
*
_bottom
;
MetaWord
*
_end
;
...
...
@@ -61,29 +64,20 @@ class Metachunk VALUE_OBJ_CLASS_SPEC {
// the space.
static
size_t
_overhead
;
void
set_bottom
(
MetaWord
*
v
)
{
_bottom
=
v
;
}
void
set_end
(
MetaWord
*
v
)
{
_end
=
v
;
}
void
set_top
(
MetaWord
*
v
)
{
_top
=
v
;
}
void
set_word_size
(
size_t
v
)
{
_word_size
=
v
;
}
public:
#ifdef ASSERT
Metachunk
()
:
_bottom
(
NULL
),
_end
(
NULL
),
_top
(
NULL
),
_is_free
(
false
),
_next
(
NULL
),
_prev
(
NULL
)
{}
#else
Metachunk
()
:
_bottom
(
NULL
),
_end
(
NULL
),
_top
(
NULL
),
_next
(
NULL
),
_prev
(
NULL
)
{}
#endif
Metachunk
(
size_t
word_size
,
VirtualSpaceNode
*
container
);
// Used to add a Metachunk to a list of Metachunks
void
set_next
(
Metachunk
*
v
)
{
_next
=
v
;
assert
(
v
!=
this
,
"Boom"
);}
void
set_prev
(
Metachunk
*
v
)
{
_prev
=
v
;
assert
(
v
!=
this
,
"Boom"
);}
void
set_container
(
VirtualSpaceNode
*
v
)
{
_container
=
v
;
}
MetaWord
*
allocate
(
size_t
word_size
);
static
Metachunk
*
initialize
(
MetaWord
*
ptr
,
size_t
word_size
);
// Accessors
Metachunk
*
next
()
const
{
return
_next
;
}
Metachunk
*
prev
()
const
{
return
_prev
;
}
VirtualSpaceNode
*
container
()
const
{
return
_container
;
}
MetaWord
*
bottom
()
const
{
return
_bottom
;
}
MetaWord
*
end
()
const
{
return
_end
;
}
MetaWord
*
top
()
const
{
return
_top
;
}
...
...
src/share/vm/memory/metaspace.cpp
浏览文件 @
eda775b3
...
...
@@ -112,6 +112,7 @@ typedef class FreeList<Metachunk> ChunkList;
class
ChunkManager
VALUE_OBJ_CLASS_SPEC
{
// Free list of chunks of different sizes.
// SpecializedChunk
// SmallChunk
// MediumChunk
// HumongousChunk
...
...
@@ -165,6 +166,10 @@ class ChunkManager VALUE_OBJ_CLASS_SPEC {
// for special, small, medium, and humongous chunks.
static
ChunkIndex
list_index
(
size_t
size
);
// Remove the chunk from its freelist. It is
// expected to be on one of the _free_chunks[] lists.
void
remove_chunk
(
Metachunk
*
chunk
);
// Add the simple linked list of chunks to the freelist of chunks
// of type index.
void
return_chunks
(
ChunkIndex
index
,
Metachunk
*
chunks
);
...
...
@@ -255,6 +260,8 @@ class VirtualSpaceNode : public CHeapObj<mtClass> {
ReservedSpace
_rs
;
VirtualSpace
_virtual_space
;
MetaWord
*
_top
;
// count of chunks contained in this VirtualSpace
uintx
_container_count
;
// Convenience functions for logical bottom and end
MetaWord
*
bottom
()
const
{
return
(
MetaWord
*
)
_virtual_space
.
low
();
}
...
...
@@ -264,10 +271,19 @@ class VirtualSpaceNode : public CHeapObj<mtClass> {
char
*
low
()
const
{
return
virtual_space
()
->
low
();
}
char
*
high
()
const
{
return
virtual_space
()
->
high
();
}
// The first Metachunk will be allocated at the bottom of the
// VirtualSpace
Metachunk
*
first_chunk
()
{
return
(
Metachunk
*
)
bottom
();
}
void
inc_container_count
();
#ifdef ASSERT
uint
container_count_slow
();
#endif
public:
VirtualSpaceNode
(
size_t
byte_size
);
VirtualSpaceNode
(
ReservedSpace
rs
)
:
_top
(
NULL
),
_next
(
NULL
),
_rs
(
rs
)
{}
VirtualSpaceNode
(
ReservedSpace
rs
)
:
_top
(
NULL
),
_next
(
NULL
),
_rs
(
rs
)
,
_container_count
(
0
)
{}
~
VirtualSpaceNode
();
// address of next available space in _virtual_space;
...
...
@@ -288,6 +304,12 @@ class VirtualSpaceNode : public CHeapObj<mtClass> {
MetaWord
*
top
()
const
{
return
_top
;
}
void
inc_top
(
size_t
word_size
)
{
_top
+=
word_size
;
}
uintx
container_count
()
{
return
_container_count
;
}
void
dec_container_count
();
#ifdef ASSERT
void
verify_container_count
();
#endif
// used and capacity in this single entry in the list
size_t
used_words_in_vs
()
const
;
size_t
capacity_words_in_vs
()
const
;
...
...
@@ -306,6 +328,10 @@ class VirtualSpaceNode : public CHeapObj<mtClass> {
bool
expand_by
(
size_t
words
,
bool
pre_touch
=
false
);
bool
shrink_by
(
size_t
words
);
// In preparation for deleting this node, remove all the chunks
// in the node from any freelist.
void
purge
(
ChunkManager
*
chunk_manager
);
#ifdef ASSERT
// Debug support
static
void
verify_virtual_space_total
();
...
...
@@ -317,7 +343,7 @@ class VirtualSpaceNode : public CHeapObj<mtClass> {
};
// byte_size is the size of the associated virtualspace.
VirtualSpaceNode
::
VirtualSpaceNode
(
size_t
byte_size
)
:
_top
(
NULL
),
_next
(
NULL
),
_rs
(
0
)
{
VirtualSpaceNode
::
VirtualSpaceNode
(
size_t
byte_size
)
:
_top
(
NULL
),
_next
(
NULL
),
_rs
(
0
)
,
_container_count
(
0
)
{
// align up to vm allocation granularity
byte_size
=
align_size_up
(
byte_size
,
os
::
vm_allocation_granularity
());
...
...
@@ -341,6 +367,39 @@ VirtualSpaceNode::VirtualSpaceNode(size_t byte_size) : _top(NULL), _next(NULL),
MemTracker
::
record_virtual_memory_type
((
address
)
_rs
.
base
(),
mtClass
);
}
void
VirtualSpaceNode
::
purge
(
ChunkManager
*
chunk_manager
)
{
Metachunk
*
chunk
=
first_chunk
();
Metachunk
*
invalid_chunk
=
(
Metachunk
*
)
top
();
while
(
chunk
<
invalid_chunk
)
{
assert
(
chunk
->
is_free
(),
"Should be marked free"
);
MetaWord
*
next
=
((
MetaWord
*
)
chunk
)
+
chunk
->
word_size
();
chunk_manager
->
remove_chunk
(
chunk
);
assert
(
chunk
->
next
()
==
NULL
&&
chunk
->
prev
()
==
NULL
,
"Was not removed from its list"
);
chunk
=
(
Metachunk
*
)
next
;
}
}
#ifdef ASSERT
uint
VirtualSpaceNode
::
container_count_slow
()
{
uint
count
=
0
;
Metachunk
*
chunk
=
first_chunk
();
Metachunk
*
invalid_chunk
=
(
Metachunk
*
)
top
();
while
(
chunk
<
invalid_chunk
)
{
MetaWord
*
next
=
((
MetaWord
*
)
chunk
)
+
chunk
->
word_size
();
// Don't count the chunks on the free lists. Those are
// still part of the VirtualSpaceNode but not currently
// counted.
if
(
!
chunk
->
is_free
())
{
count
++
;
}
chunk
=
(
Metachunk
*
)
next
;
}
return
count
;
}
#endif
// List of VirtualSpaces for metadata allocation.
// It has a _next link for singly linked list and a MemRegion
// for total space in the VirtualSpace.
...
...
@@ -410,14 +469,14 @@ class VirtualSpaceList : public CHeapObj<mtClass> {
void
initialize
(
size_t
word_size
);
size_t
virtual_space_total
()
{
return
_virtual_space_total
;
}
void
inc_virtual_space_total
(
size_t
v
)
{
Atomic
::
add_ptr
(
v
,
&
_virtual_space_total
);
}
size_t
virtual_space_count
()
{
return
_virtual_space_count
;
}
void
inc_virtual_space_count
()
{
Atomic
::
inc_ptr
(
&
_virtual_space_count
);
}
void
inc_virtual_space_total
(
size_t
v
);
void
dec_virtual_space_total
(
size_t
v
);
void
inc_virtual_space_count
();
void
dec_virtual_space_count
();
// Unlink empty VirtualSpaceNodes and free it.
void
purge
();
// Used and capacity in the entire list of virtual spaces.
// These are global values shared by all Metaspaces
...
...
@@ -641,6 +700,28 @@ Mutex* const SpaceManager::_expand_lock =
SpaceManager
::
_expand_lock_name
,
Mutex
::
_allow_vm_block_flag
);
void
VirtualSpaceNode
::
inc_container_count
()
{
assert_lock_strong
(
SpaceManager
::
expand_lock
());
_container_count
++
;
assert
(
_container_count
==
container_count_slow
(),
err_msg
(
"Inconsistency in countainer_count _container_count "
SIZE_FORMAT
"container_count_slow() "
SIZE_FORMAT
,
_container_count
,
container_count_slow
()));
}
void
VirtualSpaceNode
::
dec_container_count
()
{
assert_lock_strong
(
SpaceManager
::
expand_lock
());
_container_count
--
;
}
#ifdef ASSERT
void
VirtualSpaceNode
::
verify_container_count
()
{
assert
(
_container_count
==
container_count_slow
(),
err_msg
(
"Inconsistency in countainer_count _container_count "
SIZE_FORMAT
"container_count_slow() "
SIZE_FORMAT
,
_container_count
,
container_count_slow
()));
}
#endif
// BlockFreelist methods
BlockFreelist
::
BlockFreelist
()
:
_dictionary
(
NULL
)
{}
...
...
@@ -701,6 +782,10 @@ void BlockFreelist::print_on(outputStream* st) const {
VirtualSpaceNode
::~
VirtualSpaceNode
()
{
_rs
.
release
();
#ifdef ASSERT
size_t
word_size
=
sizeof
(
*
this
)
/
BytesPerWord
;
Copy
::
fill_to_words
((
HeapWord
*
)
this
,
word_size
,
0xf1f1f1f1
);
#endif
}
size_t
VirtualSpaceNode
::
used_words_in_vs
()
const
{
...
...
@@ -733,8 +818,8 @@ Metachunk* VirtualSpaceNode::take_from_committed(size_t chunk_word_size) {
// Take the space (bump top on the current virtual space).
inc_top
(
chunk_word_size
);
//
Point the chunk at the space
Metachunk
*
result
=
Metachunk
::
initialize
(
chunk_limit
,
chunk_word_size
);
//
Initialize the chunk
Metachunk
*
result
=
::
new
(
chunk_limit
)
Metachunk
(
chunk_word_size
,
this
);
return
result
;
}
...
...
@@ -762,9 +847,11 @@ bool VirtualSpaceNode::shrink_by(size_t words) {
Metachunk
*
VirtualSpaceNode
::
get_chunk_vs
(
size_t
chunk_word_size
)
{
assert_lock_strong
(
SpaceManager
::
expand_lock
());
Metachunk
*
result
=
NULL
;
return
take_from_committed
(
chunk_word_size
);
Metachunk
*
result
=
take_from_committed
(
chunk_word_size
);
if
(
result
!=
NULL
)
{
inc_container_count
();
}
return
result
;
}
Metachunk
*
VirtualSpaceNode
::
get_chunk_vs_with_expand
(
size_t
chunk_word_size
)
{
...
...
@@ -843,6 +930,83 @@ VirtualSpaceList::~VirtualSpaceList() {
}
}
void
VirtualSpaceList
::
inc_virtual_space_total
(
size_t
v
)
{
assert_lock_strong
(
SpaceManager
::
expand_lock
());
_virtual_space_total
=
_virtual_space_total
+
v
;
}
void
VirtualSpaceList
::
dec_virtual_space_total
(
size_t
v
)
{
assert_lock_strong
(
SpaceManager
::
expand_lock
());
_virtual_space_total
=
_virtual_space_total
-
v
;
}
void
VirtualSpaceList
::
inc_virtual_space_count
()
{
assert_lock_strong
(
SpaceManager
::
expand_lock
());
_virtual_space_count
++
;
}
void
VirtualSpaceList
::
dec_virtual_space_count
()
{
assert_lock_strong
(
SpaceManager
::
expand_lock
());
_virtual_space_count
--
;
}
void
ChunkManager
::
remove_chunk
(
Metachunk
*
chunk
)
{
size_t
word_size
=
chunk
->
word_size
();
ChunkIndex
index
=
list_index
(
word_size
);
if
(
index
!=
HumongousIndex
)
{
free_chunks
(
index
)
->
remove_chunk
(
chunk
);
}
else
{
humongous_dictionary
()
->
remove_chunk
(
chunk
);
}
// Chunk is being removed from the chunks free list.
dec_free_chunks_total
(
chunk
->
capacity_word_size
());
}
// Walk the list of VirtualSpaceNodes and delete
// nodes with a 0 container_count. Remove Metachunks in
// the node from their respective freelists.
void
VirtualSpaceList
::
purge
()
{
assert_lock_strong
(
SpaceManager
::
expand_lock
());
// Don't use a VirtualSpaceListIterator because this
// list is being changed and a straightforward use of an iterator is not safe.
VirtualSpaceNode
*
purged_vsl
=
NULL
;
VirtualSpaceNode
*
prev_vsl
=
virtual_space_list
();
VirtualSpaceNode
*
next_vsl
=
prev_vsl
;
while
(
next_vsl
!=
NULL
)
{
VirtualSpaceNode
*
vsl
=
next_vsl
;
next_vsl
=
vsl
->
next
();
// Don't free the current virtual space since it will likely
// be needed soon.
if
(
vsl
->
container_count
()
==
0
&&
vsl
!=
current_virtual_space
())
{
// Unlink it from the list
if
(
prev_vsl
==
vsl
)
{
// This is the case of the current note being the first note.
assert
(
vsl
==
virtual_space_list
(),
"Expected to be the first note"
);
set_virtual_space_list
(
vsl
->
next
());
}
else
{
prev_vsl
->
set_next
(
vsl
->
next
());
}
vsl
->
purge
(
chunk_manager
());
dec_virtual_space_total
(
vsl
->
reserved
()
->
word_size
());
dec_virtual_space_count
();
purged_vsl
=
vsl
;
delete
vsl
;
}
else
{
prev_vsl
=
vsl
;
}
}
#ifdef ASSERT
if
(
purged_vsl
!=
NULL
)
{
// List should be stable enough to use an iterator here.
VirtualSpaceListIterator
iter
(
virtual_space_list
());
while
(
iter
.
repeat
())
{
VirtualSpaceNode
*
vsl
=
iter
.
get_next
();
assert
(
vsl
!=
purged_vsl
,
"Purge of vsl failed"
);
}
}
#endif
}
size_t
VirtualSpaceList
::
used_words_sum
()
{
size_t
allocated_by_vs
=
0
;
VirtualSpaceListIterator
iter
(
virtual_space_list
());
...
...
@@ -955,8 +1119,10 @@ Metachunk* VirtualSpaceList::get_new_chunk(size_t word_size,
// Get a chunk from the chunk freelist
Metachunk
*
next
=
chunk_manager
()
->
chunk_freelist_allocate
(
grow_chunks_by_words
);
// Allocate a chunk out of the current virtual space.
if
(
next
==
NULL
)
{
if
(
next
!=
NULL
)
{
next
->
container
()
->
inc_container_count
();
}
else
{
// Allocate a chunk out of the current virtual space.
next
=
current_virtual_space
()
->
get_chunk_vs
(
grow_chunks_by_words
);
}
...
...
@@ -1567,9 +1733,6 @@ Metachunk* ChunkManager::free_chunks_get(size_t word_size) {
}
// Chunk is being removed from the chunks free list.
dec_free_chunks_total
(
chunk
->
capacity_word_size
());
#ifdef ASSERT
chunk
->
set_is_free
(
false
);
#endif
}
else
{
return
NULL
;
}
...
...
@@ -1578,6 +1741,11 @@ Metachunk* ChunkManager::free_chunks_get(size_t word_size) {
// Remove it from the links to this freelist
chunk
->
set_next
(
NULL
);
chunk
->
set_prev
(
NULL
);
#ifdef ASSERT
// Chunk is no longer on any freelist. Setting to false make container_count_slow()
// work.
chunk
->
set_is_free
(
false
);
#endif
slow_locked_verify
();
return
chunk
;
}
...
...
@@ -1887,11 +2055,13 @@ void ChunkManager::return_chunks(ChunkIndex index, Metachunk* chunks) {
assert_lock_strong
(
SpaceManager
::
expand_lock
());
Metachunk
*
cur
=
chunks
;
// This return chunks one at a time. If a new
// This return
s
chunks one at a time. If a new
// class List can be created that is a base class
// of FreeList then something like FreeList::prepend()
// can be used in place of this loop
while
(
cur
!=
NULL
)
{
assert
(
cur
->
container
()
!=
NULL
,
"Container should have been set"
);
cur
->
container
()
->
dec_container_count
();
// Capture the next link before it is changed
// by the call to return_chunk_at_head();
Metachunk
*
next
=
cur
->
next
();
...
...
@@ -1917,8 +2087,8 @@ SpaceManager::~SpaceManager() {
locked_print_chunks_in_use_on
(
gclog_or_tty
);
}
//
Mangle freed memory.
NOT_PRODUCT
(
mangle_freed_chunks
();)
//
Do not mangle freed Metachunks. The chunk size inside Metachunks
// is during the freeing of a VirtualSpaceNodes.
// Have to update before the chunks_in_use lists are emptied
// below.
...
...
@@ -1978,6 +2148,7 @@ SpaceManager::~SpaceManager() {
" granularity %d"
,
humongous_chunks
->
word_size
(),
HumongousChunkGranularity
));
Metachunk
*
next_humongous_chunks
=
humongous_chunks
->
next
();
humongous_chunks
->
container
()
->
dec_container_count
();
chunk_manager
->
humongous_dictionary
()
->
return_chunk
(
humongous_chunks
);
humongous_chunks
=
next_humongous_chunks
;
}
...
...
@@ -2716,6 +2887,13 @@ Metablock* Metaspace::allocate(ClassLoaderData* loader_data, size_t word_size,
return
Metablock
::
initialize
(
result
,
word_size
);
}
void
Metaspace
::
purge
()
{
MutexLockerEx
cl
(
SpaceManager
::
expand_lock
(),
Mutex
::
_no_safepoint_check_flag
);
space_list
()
->
purge
();
class_space_list
()
->
purge
();
}
void
Metaspace
::
print_on
(
outputStream
*
out
)
const
{
// Print both class virtual space counts and metaspace.
if
(
Verbose
)
{
...
...
@@ -2733,7 +2911,8 @@ bool Metaspace::contains(const void * ptr) {
// aren't deleted presently. When they are, some sort of locking might
// be needed. Note, locking this can cause inversion problems with the
// caller in MetaspaceObj::is_metadata() function.
return
space_list
()
->
contains
(
ptr
)
||
class_space_list
()
->
contains
(
ptr
);
return
space_list
()
->
contains
(
ptr
)
||
class_space_list
()
->
contains
(
ptr
);
}
void
Metaspace
::
verify
()
{
...
...
src/share/vm/memory/metaspace.hpp
浏览文件 @
eda775b3
...
...
@@ -150,6 +150,9 @@ class Metaspace : public CHeapObj<mtClass> {
static
bool
contains
(
const
void
*
ptr
);
void
dump
(
outputStream
*
const
out
)
const
;
// Free empty virtualspaces
static
void
purge
();
void
print_on
(
outputStream
*
st
)
const
;
// Debugging support
void
verify
();
...
...
test/gc/7072527/TestFullGCCount.java
浏览文件 @
eda775b3
/*
* Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2011,
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
...
...
@@ -25,71 +25,67 @@
* @test TestFullGCount.java
* @bug 7072527
* @summary CMS: JMM GC counters overcount in some cases
* @run main/othervm -XX:+UseConcMarkSweepGC TestFullGCCount
*
* @run main/othervm -XX:+PrintGC TestFullGCCount
*/
import
java.util.*
;
import
java.lang.management.*
;
/*
* Originally for a specific failure in CMS, this test now monitors all
* collectors for double-counting of collections.
*/
public
class
TestFullGCCount
{
public
String
collectorName
=
"ConcurrentMarkSweep"
;
static
List
<
GarbageCollectorMXBean
>
collectors
=
ManagementFactory
.
getGarbageCollectorMXBeans
()
;
public
static
void
main
(
String
[]
args
)
{
public
static
void
main
(
String
[]
args
)
{
int
iterations
=
20
;
boolean
failed
=
false
;
String
errorMessage
=
""
;
HashMap
<
String
,
List
>
counts
=
new
HashMap
<
String
,
List
>();
TestFullGCCount
t
=
null
;
if
(
args
.
length
==
2
)
{
t
=
new
TestFullGCCount
(
args
[
0
],
args
[
1
]);
}
else
{
t
=
new
TestFullGCCount
();
// Prime the collection of count lists for all collectors.
for
(
int
i
=
0
;
i
<
collectors
.
size
();
i
++)
{
GarbageCollectorMXBean
collector
=
collectors
.
get
(
i
);
counts
.
put
(
collector
.
getName
(),
new
ArrayList
<
Long
>(
iterations
));
}
System
.
out
.
println
(
"Monitoring collector: "
+
t
.
collectorName
);
t
.
run
();
}
public
TestFullGCCount
(
String
pool
,
String
collector
)
{
collectorName
=
collector
;
}
public
TestFullGCCount
()
{
}
// Perform some gc, record collector counts.
for
(
int
i
=
0
;
i
<
iterations
;
i
++)
{
System
.
gc
();
addCollectionCount
(
counts
,
i
);
}
public
void
run
()
{
int
count
=
0
;
int
iterations
=
20
;
long
counts
[]
=
new
long
[
iterations
];
boolean
diffAlways2
=
true
;
// assume we will fail
// Check the increments:
// Old gen collectors should increase by one,
// New collectors may or may not increase.
// Any increase >=2 is unexpected.
for
(
String
collector
:
counts
.
keySet
())
{
System
.
out
.
println
(
"Checking: "
+
collector
);
for
(
int
i
=
0
;
i
<
iterations
;
i
++)
{
System
.
gc
();
counts
[
i
]
=
getCollectionCount
();
if
(
i
>
0
)
{
if
(
counts
[
i
]
-
counts
[
i
-
1
]
!=
2
)
{
diffAlways2
=
false
;
for
(
int
i
=
0
;
i
<
iterations
-
1
;
i
++)
{
List
<
Long
>
theseCounts
=
counts
.
get
(
collector
);
long
a
=
theseCounts
.
get
(
i
);
long
b
=
theseCounts
.
get
(
i
+
1
);
if
(
b
-
a
>=
2
)
{
failed
=
true
;
errorMessage
+=
"Collector '"
+
collector
+
"' has increment "
+
(
b
-
a
)
+
" at iteration "
+
i
+
"\n"
;
}
}
}
if
(
diffAlways2
)
{
throw
new
RuntimeException
(
"FAILED: System.gc must be incrementing count twice."
);
if
(
failed
)
{
System
.
err
.
println
(
errorMessage
);
throw
new
RuntimeException
(
"FAILED: System.gc collections miscounted."
);
}
System
.
out
.
println
(
"Passed."
);
}
private
long
getCollectionCount
()
{
long
count
=
0
;
List
<
MemoryPoolMXBean
>
pools
=
ManagementFactory
.
getMemoryPoolMXBeans
();
List
<
GarbageCollectorMXBean
>
collectors
=
ManagementFactory
.
getGarbageCollectorMXBeans
();
for
(
int
i
=
0
;
i
<
collectors
.
size
();
i
++)
{
private
static
void
addCollectionCount
(
HashMap
<
String
,
List
>
counts
,
int
iteration
)
{
for
(
int
i
=
0
;
i
<
collectors
.
size
();
i
++)
{
GarbageCollectorMXBean
collector
=
collectors
.
get
(
i
);
String
name
=
collector
.
getName
();
if
(
name
.
contains
(
collectorName
))
{
System
.
out
.
println
(
name
+
": collection count = "
+
collector
.
getCollectionCount
());
count
=
collector
.
getCollectionCount
();
}
List
thisList
=
counts
.
get
(
collector
.
getName
());
thisList
.
add
(
collector
.
getCollectionCount
());
}
return
count
;
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录