Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell11
提交
c9f12f7c
D
dragonwell11
项目概览
openanolis
/
dragonwell11
通知
7
Star
2
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
D
dragonwell11
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
c9f12f7c
编写于
5月 25, 2015
作者:
J
jmasa
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
8081629: CMS split_block() does not correctly fix up block-offset-table for large blocks
Reviewed-by: tschatzl, ysr
上级
4c4a1e0b
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
8 addition
and
1 deletion
+8
-1
hotspot/src/share/vm/gc/shared/blockOffsetTable.cpp
hotspot/src/share/vm/gc/shared/blockOffsetTable.cpp
+8
-1
未找到文件。
hotspot/src/share/vm/gc/shared/blockOffsetTable.cpp
浏览文件 @
c9f12f7c
...
...
@@ -447,14 +447,16 @@ void BlockOffsetArrayNonContigSpace::split_block(HeapWord* blk,
}
else
{
// Unilaterally fix the first (num_pref_cards - 1) following
// the "offset card" in the suffix block.
const
size_t
right_most_fixed_index
=
suff_index
+
num_pref_cards
-
1
;
set_remainder_to_point_to_start_incl
(
suff_index
+
1
,
suff_index
+
num_pref_cards
-
1
,
true
/* reducing */
);
right_most_fixed_index
,
true
/* reducing */
);
// Fix the appropriate cards in the remainder of the
// suffix block -- these are the last num_pref_cards
// cards in each power block of the "new" range plumbed
// from suff_addr.
bool
more
=
true
;
uint
i
=
1
;
// Fix the first power block with back_by > num_pref_cards.
while
(
more
&&
(
i
<
N_powers
))
{
size_t
back_by
=
power_to_cards_back
(
i
);
size_t
right_index
=
suff_index
+
back_by
-
1
;
...
...
@@ -463,6 +465,9 @@ void BlockOffsetArrayNonContigSpace::split_block(HeapWord* blk,
right_index
=
end_index
-
1
;
more
=
false
;
}
if
(
left_index
<=
right_most_fixed_index
)
{
left_index
=
right_most_fixed_index
+
1
;
}
if
(
back_by
>
num_pref_cards
)
{
// Fill in the remainder of this "power block", if it
// is non-null.
...
...
@@ -471,12 +476,14 @@ void BlockOffsetArrayNonContigSpace::split_block(HeapWord* blk,
N_words
+
i
-
1
,
true
/* reducing */
);
}
else
{
more
=
false
;
// we are done
assert
((
end_index
-
1
)
==
right_index
,
"Must be at the end."
);
}
i
++
;
break
;
}
i
++
;
}
// Fix the rest of the power blocks.
while
(
more
&&
(
i
<
N_powers
))
{
size_t
back_by
=
power_to_cards_back
(
i
);
size_t
right_index
=
suff_index
+
back_by
-
1
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录