Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openanolis
dragonwell8_hotspot
提交
303c3ceb
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,发现更多精彩内容 >>
提交
303c3ceb
编写于
6月 14, 2018
作者:
K
kevinw
浏览文件
操作
浏览文件
下载
差异文件
Merge
上级
1f2ceb48
277c9802
变更
7
隐藏空白更改
内联
并排
Showing
7 changed file
with
16 addition
and
16 deletion
+16
-16
src/share/vm/opto/buildOopMap.cpp
src/share/vm/opto/buildOopMap.cpp
+2
-2
src/share/vm/opto/compile.cpp
src/share/vm/opto/compile.cpp
+3
-3
src/share/vm/opto/gcm.cpp
src/share/vm/opto/gcm.cpp
+2
-2
src/share/vm/opto/idealGraphPrinter.cpp
src/share/vm/opto/idealGraphPrinter.cpp
+2
-2
src/share/vm/opto/output.cpp
src/share/vm/opto/output.cpp
+2
-2
src/share/vm/opto/split_if.cpp
src/share/vm/opto/split_if.cpp
+3
-3
src/share/vm/utilities/globalDefinitions.hpp
src/share/vm/utilities/globalDefinitions.hpp
+2
-2
未找到文件。
src/share/vm/opto/buildOopMap.cpp
浏览文件 @
303c3ceb
/*
* Copyright (c) 2002, 201
3
, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2002, 201
8
, 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
...
...
@@ -629,7 +629,7 @@ void Compile::BuildOopMaps() {
// last block as his only undone child, we can move the OopFlow from the
// pred to this block. Otherwise we have to grab a new OopFlow.
OopFlow
*
flow
=
NULL
;
// Flag for finding optimized flow
Block
*
pred
=
(
Block
*
)
0xdeadbeef
;
Block
*
pred
=
(
Block
*
)
((
intptr_t
)
0xdeadbeef
)
;
// Scan this block's preds to find a done predecessor
for
(
uint
j
=
1
;
j
<
b
->
num_preds
();
j
++
)
{
Block
*
p
=
_cfg
->
get_block_for_node
(
b
->
pred
(
j
));
...
...
src/share/vm/opto/compile.cpp
浏览文件 @
303c3ceb
/*
* Copyright (c) 1997, 201
5
, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 201
8
, 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
...
...
@@ -2392,8 +2392,8 @@ void Compile::Code_Gen() {
print_method
(
PHASE_FINAL_CODE
);
// He's dead, Jim.
_cfg
=
(
PhaseCFG
*
)
0xdeadbeef
;
_regalloc
=
(
PhaseChaitin
*
)
0xdeadbeef
;
_cfg
=
(
PhaseCFG
*
)
((
intptr_t
)
0xdeadbeef
)
;
_regalloc
=
(
PhaseChaitin
*
)
((
intptr_t
)
0xdeadbeef
)
;
}
...
...
src/share/vm/opto/gcm.cpp
浏览文件 @
303c3ceb
/*
* Copyright (c) 1997, 201
5
, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 201
8
, 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
...
...
@@ -1375,7 +1375,7 @@ void PhaseCFG::global_code_motion() {
}
#endif
// Dead.
_node_latency
=
(
GrowableArray
<
uint
>
*
)
0xdeadbeef
;
_node_latency
=
(
GrowableArray
<
uint
>
*
)
((
intptr_t
)
0xdeadbeef
)
;
}
bool
PhaseCFG
::
do_global_code_motion
()
{
...
...
src/share/vm/opto/idealGraphPrinter.cpp
浏览文件 @
303c3ceb
/*
* Copyright (c) 2007, 201
4
, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2007, 201
8
, 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
...
...
@@ -612,7 +612,7 @@ void IdealGraphPrinter::visit_node(Node *n, bool edges, VectorSet* temp_set) {
}
#endif
if
(
_chaitin
&&
_chaitin
!=
(
PhaseChaitin
*
)
0xdeadbeef
)
{
if
(
_chaitin
&&
_chaitin
!=
(
PhaseChaitin
*
)
((
intptr_t
)
0xdeadbeef
)
)
{
buffer
[
0
]
=
0
;
_chaitin
->
dump_register
(
node
,
buffer
);
print_prop
(
"reg"
,
buffer
);
...
...
src/share/vm/opto/output.cpp
浏览文件 @
303c3ceb
/*
* Copyright (c) 1998, 201
4
, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1998, 201
8
, 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
...
...
@@ -2687,7 +2687,7 @@ void Scheduling::anti_do_def( Block *b, Node *def, OptoReg::Name def_reg, int is
}
Node
*
kill
=
def
;
// Rename 'def' to more descriptive 'kill'
debug_only
(
def
=
(
Node
*
)
0xdeadbeef
;
)
debug_only
(
def
=
(
Node
*
)
((
intptr_t
)
0xdeadbeef
)
;
)
// After some number of kills there _may_ be a later def
Node
*
later_def
=
NULL
;
...
...
src/share/vm/opto/split_if.cpp
浏览文件 @
303c3ceb
/*
* Copyright (c) 1999, 201
2
, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1999, 201
8
, 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
...
...
@@ -255,7 +255,7 @@ struct small_cache : public Dict {
Node
*
PhaseIdealLoop
::
spinup
(
Node
*
iff_dom
,
Node
*
new_false
,
Node
*
new_true
,
Node
*
use_blk
,
Node
*
def
,
small_cache
*
cache
)
{
if
(
use_blk
->
is_top
())
// Handle dead uses
return
use_blk
;
Node
*
prior_n
=
(
Node
*
)
0xdeadbeef
;
Node
*
prior_n
=
(
Node
*
)
((
intptr_t
)
0xdeadbeef
)
;
Node
*
n
=
use_blk
;
// Get path input
assert
(
use_blk
!=
iff_dom
,
""
);
// Here's the "spinup" the dominator tree loop. Do a cache-check
...
...
@@ -302,7 +302,7 @@ Node *PhaseIdealLoop::spinup( Node *iff_dom, Node *new_false, Node *new_true, No
}
// Update cache everywhere
prior_n
=
(
Node
*
)
0xdeadbeef
;
// Reset IDOM walk
prior_n
=
(
Node
*
)
((
intptr_t
)
0xdeadbeef
)
;
// Reset IDOM walk
n
=
use_blk
;
// Get path input
// Spin-up the idom tree again, basically doing path-compression.
// Insert cache entries along the way, so that if we ever hit this
...
...
src/share/vm/utilities/globalDefinitions.hpp
浏览文件 @
303c3ceb
...
...
@@ -1038,8 +1038,8 @@ extern void basic_fatal(const char* msg);
// Special constants for debugging
const
jint
badInt
=
-
3
;
// generic "bad int" value
const
long
badAddressVal
=
-
2
;
// generic "bad address" value
const
long
badOopVal
=
-
1
;
// generic "bad oop" value
const
intptr_t
badAddressVal
=
-
2
;
// generic "bad address" value
const
intptr_t
badOopVal
=
-
1
;
// generic "bad oop" value
const
intptr_t
badHeapOopVal
=
(
intptr_t
)
CONST64
(
0x2BAD4B0BBAADBABE
);
// value used to zap heap after GC
const
int
badHandleValue
=
0xBC
;
// value used to zap vm handle area
const
int
badResourceValue
=
0xAB
;
// value used to zap resource area
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录