Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
a0c70fb2
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看板
提交
a0c70fb2
编写于
2月 29, 2016
作者:
A
asaha
浏览文件
操作
浏览文件
下载
差异文件
Merge
上级
cfe9f392
6433561e
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
31 addition
and
6 deletion
+31
-6
.hgtags
.hgtags
+1
-0
src/share/vm/oops/typeArrayOop.hpp
src/share/vm/oops/typeArrayOop.hpp
+1
-1
src/share/vm/runtime/deoptimization.cpp
src/share/vm/runtime/deoptimization.cpp
+29
-5
未找到文件。
.hgtags
浏览文件 @
a0c70fb2
...
@@ -818,6 +818,7 @@ ca3b8c8e390ab0540b0cc2e5def869b38e460d86 jdk8u75-b01
...
@@ -818,6 +818,7 @@ ca3b8c8e390ab0540b0cc2e5def869b38e460d86 jdk8u75-b01
8c791dd1c24d85ebd18b03d49185c2a25263c129 jdk8u75-b07
8c791dd1c24d85ebd18b03d49185c2a25263c129 jdk8u75-b07
e4a935cb6f7178912fd653e2a9514eadec7935ab jdk8u75-b08
e4a935cb6f7178912fd653e2a9514eadec7935ab jdk8u75-b08
e97c45c377eb8d022cfe24b73737fa312107e0a5 jdk8u75-b09
e97c45c377eb8d022cfe24b73737fa312107e0a5 jdk8u75-b09
d44c7e324682a30e064503ef9582d83a41f4173e jdk8u75-b10
d7b01fb81aa8a5437cb03bc36afe15cf0e55fb89 jdk8u76-b00
d7b01fb81aa8a5437cb03bc36afe15cf0e55fb89 jdk8u76-b00
c1679cc87ba045219169cabb6b9b378c2b5cc578 jdk8u76-b01
c1679cc87ba045219169cabb6b9b378c2b5cc578 jdk8u76-b01
218483967e52b419d885d34af4488a81c5133804 jdk8u76-b02
218483967e52b419d885d34af4488a81c5133804 jdk8u76-b02
...
...
src/share/vm/oops/typeArrayOop.hpp
浏览文件 @
a0c70fb2
...
@@ -96,7 +96,7 @@ class typeArrayOopDesc : public arrayOopDesc {
...
@@ -96,7 +96,7 @@ class typeArrayOopDesc : public arrayOopDesc {
void
byte_at_put
(
int
which
,
jbyte
contents
)
{
*
byte_at_addr
(
which
)
=
contents
;
}
void
byte_at_put
(
int
which
,
jbyte
contents
)
{
*
byte_at_addr
(
which
)
=
contents
;
}
jboolean
bool_at
(
int
which
)
const
{
return
*
bool_at_addr
(
which
);
}
jboolean
bool_at
(
int
which
)
const
{
return
*
bool_at_addr
(
which
);
}
void
bool_at_put
(
int
which
,
jboolean
contents
)
{
*
bool_at_addr
(
which
)
=
contents
;
}
void
bool_at_put
(
int
which
,
jboolean
contents
)
{
*
bool_at_addr
(
which
)
=
(((
jint
)
contents
)
&
1
)
;
}
jchar
char_at
(
int
which
)
const
{
return
*
char_at_addr
(
which
);
}
jchar
char_at
(
int
which
)
const
{
return
*
char_at_addr
(
which
);
}
void
char_at_put
(
int
which
,
jchar
contents
)
{
*
char_at_addr
(
which
)
=
contents
;
}
void
char_at_put
(
int
which
,
jchar
contents
)
{
*
char_at_addr
(
which
)
=
contents
;
}
...
...
src/share/vm/runtime/deoptimization.cpp
浏览文件 @
a0c70fb2
/*
/*
* Copyright (c) 1997, 201
5
, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 201
6
, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
*
* This code is free software; you can redistribute it and/or modify it
* This code is free software; you can redistribute it and/or modify it
...
@@ -847,13 +847,25 @@ public:
...
@@ -847,13 +847,25 @@ public:
_obj
->
int_field_put
(
offset
,
(
jint
)
*
((
jint
*
)
&
val
));
_obj
->
int_field_put
(
offset
,
(
jint
)
*
((
jint
*
)
&
val
));
break
;
break
;
case
T_SHORT
:
case
T_CHAR
:
// 2 bytes
case
T_SHORT
:
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
val
=
value
->
get_int
();
val
=
value
->
get_int
();
_obj
->
short_field_put
(
offset
,
(
jshort
)
*
((
jint
*
)
&
val
));
_obj
->
short_field_put
(
offset
,
(
jshort
)
*
((
jint
*
)
&
val
));
break
;
break
;
case
T_BOOLEAN
:
case
T_BYTE
:
// 1 byte
case
T_CHAR
:
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
val
=
value
->
get_int
();
_obj
->
char_field_put
(
offset
,
(
jchar
)
*
((
jint
*
)
&
val
));
break
;
case
T_BYTE
:
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
val
=
value
->
get_int
();
_obj
->
byte_field_put
(
offset
,
(
jbyte
)
*
((
jint
*
)
&
val
));
break
;
case
T_BOOLEAN
:
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
val
=
value
->
get_int
();
val
=
value
->
get_int
();
_obj
->
bool_field_put
(
offset
,
(
jboolean
)
*
((
jint
*
)
&
val
));
_obj
->
bool_field_put
(
offset
,
(
jboolean
)
*
((
jint
*
)
&
val
));
...
@@ -899,13 +911,25 @@ void Deoptimization::reassign_type_array_elements(frame* fr, RegisterMap* reg_ma
...
@@ -899,13 +911,25 @@ void Deoptimization::reassign_type_array_elements(frame* fr, RegisterMap* reg_ma
obj
->
int_at_put
(
index
,
(
jint
)
*
((
jint
*
)
&
val
));
obj
->
int_at_put
(
index
,
(
jint
)
*
((
jint
*
)
&
val
));
break
;
break
;
case
T_SHORT
:
case
T_CHAR
:
// 2 bytes
case
T_SHORT
:
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
val
=
value
->
get_int
();
val
=
value
->
get_int
();
obj
->
short_at_put
(
index
,
(
jshort
)
*
((
jint
*
)
&
val
));
obj
->
short_at_put
(
index
,
(
jshort
)
*
((
jint
*
)
&
val
));
break
;
break
;
case
T_BOOLEAN
:
case
T_BYTE
:
// 1 byte
case
T_CHAR
:
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
val
=
value
->
get_int
();
obj
->
char_at_put
(
index
,
(
jchar
)
*
((
jint
*
)
&
val
));
break
;
case
T_BYTE
:
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
val
=
value
->
get_int
();
obj
->
byte_at_put
(
index
,
(
jbyte
)
*
((
jint
*
)
&
val
));
break
;
case
T_BOOLEAN
:
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
assert
(
value
->
type
()
==
T_INT
,
"Agreement."
);
val
=
value
->
get_int
();
val
=
value
->
get_int
();
obj
->
bool_at_put
(
index
,
(
jboolean
)
*
((
jint
*
)
&
val
));
obj
->
bool_at_put
(
index
,
(
jboolean
)
*
((
jint
*
)
&
val
));
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录