Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
050abe1d
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看板
提交
050abe1d
编写于
7月 06, 2019
作者:
A
andrew
浏览文件
操作
浏览文件
下载
差异文件
Merge
上级
e3856024
49b69991
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
9 addition
and
11 deletion
+9
-11
.hgtags
.hgtags
+2
-0
src/share/vm/gc_implementation/g1/g1BlockOffsetTable.cpp
src/share/vm/gc_implementation/g1/g1BlockOffsetTable.cpp
+0
-6
src/share/vm/gc_implementation/g1/g1BlockOffsetTable.hpp
src/share/vm/gc_implementation/g1/g1BlockOffsetTable.hpp
+2
-4
src/share/vm/gc_implementation/g1/g1BlockOffsetTable.inline.hpp
...are/vm/gc_implementation/g1/g1BlockOffsetTable.inline.hpp
+5
-1
未找到文件。
.hgtags
浏览文件 @
050abe1d
...
...
@@ -1268,3 +1268,5 @@ af43bab3c5d022f0e0b7890f732d8b365b4364cc jdk8u222-b03
d690709cc3398f8cfd6ffebb89a229105fb3e69a jdk8u222-b04
1ec20e8a3d8a7a29e9113b14567abec9f0240e9d jdk8u222-b05
17778f8991c83d794897f05210dce2d2a7b4eb2d jdk8u222-b06
75f4e02f1113bc353fc60df7330dd5456efc49a3 jdk8u222-b07
36a743eee6721b423b7c21a3ba28ac8d906a5386 jdk8u222-b08
src/share/vm/gc_implementation/g1/g1BlockOffsetTable.cpp
浏览文件 @
050abe1d
...
...
@@ -447,8 +447,6 @@ G1BlockOffsetArrayContigSpace(G1BlockOffsetSharedArray* array,
}
HeapWord
*
G1BlockOffsetArrayContigSpace
::
initialize_threshold_raw
()
{
assert
(
!
Universe
::
heap
()
->
is_in_reserved
(
_array
->
_offset_array
),
"just checking"
);
_next_offset_index
=
_array
->
index_for_raw
(
_bottom
);
_next_offset_index
++
;
_next_offset_threshold
=
...
...
@@ -457,8 +455,6 @@ HeapWord* G1BlockOffsetArrayContigSpace::initialize_threshold_raw() {
}
void
G1BlockOffsetArrayContigSpace
::
zero_bottom_entry_raw
()
{
assert
(
!
Universe
::
heap
()
->
is_in_reserved
(
_array
->
_offset_array
),
"just checking"
);
size_t
bottom_index
=
_array
->
index_for_raw
(
_bottom
);
assert
(
_array
->
address_for_index_raw
(
bottom_index
)
==
_bottom
,
"Precondition of call"
);
...
...
@@ -466,8 +462,6 @@ void G1BlockOffsetArrayContigSpace::zero_bottom_entry_raw() {
}
HeapWord
*
G1BlockOffsetArrayContigSpace
::
initialize_threshold
()
{
assert
(
!
Universe
::
heap
()
->
is_in_reserved
(
_array
->
_offset_array
),
"just checking"
);
_next_offset_index
=
_array
->
index_for
(
_bottom
);
_next_offset_index
++
;
_next_offset_threshold
=
...
...
src/share/vm/gc_implementation/g1/g1BlockOffsetTable.hpp
浏览文件 @
050abe1d
...
...
@@ -145,7 +145,7 @@ private:
// Array for keeping offsets for retrieving object start fast given an
// address.
u_char
*
_offset_array
;
// byte array keeping backwards offsets
volatile
u_char
*
_offset_array
;
// byte array keeping backwards offsets
void
check_offset
(
size_t
offset
,
const
char
*
msg
)
const
{
assert
(
offset
<=
N_words
,
...
...
@@ -158,9 +158,7 @@ private:
// For performance these have to devolve to array accesses in product builds.
inline
u_char
offset_array
(
size_t
index
)
const
;
void
set_offset_array_raw
(
size_t
index
,
u_char
offset
)
{
_offset_array
[
index
]
=
offset
;
}
inline
void
set_offset_array_raw
(
size_t
index
,
u_char
offset
);
inline
void
set_offset_array
(
size_t
index
,
u_char
offset
);
...
...
src/share/vm/gc_implementation/g1/g1BlockOffsetTable.inline.hpp
浏览文件 @
050abe1d
...
...
@@ -63,6 +63,10 @@ u_char G1BlockOffsetSharedArray::offset_array(size_t index) const {
return
_offset_array
[
index
];
}
inline
void
G1BlockOffsetSharedArray
::
set_offset_array_raw
(
size_t
index
,
u_char
offset
)
{
_offset_array
[
index
]
=
offset
;
}
void
G1BlockOffsetSharedArray
::
set_offset_array
(
size_t
index
,
u_char
offset
)
{
check_index
(
index
,
"index out of range"
);
set_offset_array_raw
(
index
,
offset
);
...
...
@@ -81,7 +85,7 @@ void G1BlockOffsetSharedArray::set_offset_array(size_t left, size_t right, u_cha
assert
(
left
<=
right
,
"indexes out of order"
);
size_t
num_cards
=
right
-
left
+
1
;
if
(
UseMemSetInBOT
)
{
memset
(
&
_offset_array
[
left
]
,
offset
,
num_cards
);
memset
(
const_cast
<
u_char
*>
(
&
_offset_array
[
left
])
,
offset
,
num_cards
);
}
else
{
size_t
i
=
left
;
const
size_t
end
=
i
+
num_cards
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录