Mercurial > hg > truffle
annotate src/share/vm/runtime/deoptimization.cpp @ 8627:75db7afee829
implemented lazy installation of replacements (GRAAL-137)
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Wed, 03 Apr 2013 21:51:44 +0200 |
parents | 9f9aaa65294e |
children | b9a918201d47 |
rev | line source |
---|---|
0 | 1 /* |
4872
aa3d708d67c4
7141200: log some interesting information in ring buffers for crashes
never
parents:
4777
diff
changeset
|
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1255
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1255
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1255
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "classfile/systemDictionary.hpp" | |
27 #include "code/debugInfoRec.hpp" | |
28 #include "code/nmethod.hpp" | |
29 #include "code/pcDesc.hpp" | |
30 #include "code/scopeDesc.hpp" | |
31 #include "interpreter/bytecode.hpp" | |
32 #include "interpreter/interpreter.hpp" | |
33 #include "interpreter/oopMapCache.hpp" | |
34 #include "memory/allocation.inline.hpp" | |
35 #include "memory/oopFactory.hpp" | |
36 #include "memory/resourceArea.hpp" | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
37 #include "oops/method.hpp" |
1972 | 38 #include "oops/oop.inline.hpp" |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
39 #include "oops/fieldStreams.hpp" |
1972 | 40 #include "prims/jvmtiThreadState.hpp" |
41 #include "runtime/biasedLocking.hpp" | |
42 #include "runtime/compilationPolicy.hpp" | |
43 #include "runtime/deoptimization.hpp" | |
44 #include "runtime/interfaceSupport.hpp" | |
45 #include "runtime/sharedRuntime.hpp" | |
46 #include "runtime/signature.hpp" | |
47 #include "runtime/stubRoutines.hpp" | |
48 #include "runtime/thread.hpp" | |
49 #include "runtime/vframe.hpp" | |
50 #include "runtime/vframeArray.hpp" | |
51 #include "runtime/vframe_hp.hpp" | |
52 #include "utilities/events.hpp" | |
53 #include "utilities/xmlstream.hpp" | |
54 #ifdef TARGET_ARCH_x86 | |
55 # include "vmreg_x86.inline.hpp" | |
56 #endif | |
57 #ifdef TARGET_ARCH_sparc | |
58 # include "vmreg_sparc.inline.hpp" | |
59 #endif | |
60 #ifdef TARGET_ARCH_zero | |
61 # include "vmreg_zero.inline.hpp" | |
62 #endif | |
2192
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
63 #ifdef TARGET_ARCH_arm |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
64 # include "vmreg_arm.inline.hpp" |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
65 #endif |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
66 #ifdef TARGET_ARCH_ppc |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
67 # include "vmreg_ppc.inline.hpp" |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
68 #endif |
1972 | 69 #ifdef COMPILER2 |
70 #ifdef TARGET_ARCH_MODEL_x86_32 | |
71 # include "adfiles/ad_x86_32.hpp" | |
72 #endif | |
73 #ifdef TARGET_ARCH_MODEL_x86_64 | |
74 # include "adfiles/ad_x86_64.hpp" | |
75 #endif | |
76 #ifdef TARGET_ARCH_MODEL_sparc | |
77 # include "adfiles/ad_sparc.hpp" | |
78 #endif | |
79 #ifdef TARGET_ARCH_MODEL_zero | |
80 # include "adfiles/ad_zero.hpp" | |
81 #endif | |
2192
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
82 #ifdef TARGET_ARCH_MODEL_arm |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
83 # include "adfiles/ad_arm.hpp" |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
84 #endif |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
85 #ifdef TARGET_ARCH_MODEL_ppc |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
86 # include "adfiles/ad_ppc.hpp" |
b92c45f2bc75
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
2177
diff
changeset
|
87 #endif |
1972 | 88 #endif |
0 | 89 |
5129
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
90 #ifdef GRAAL |
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
91 #include "graal/graalCompiler.hpp" |
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
92 #endif |
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
93 |
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
94 |
0 | 95 bool DeoptimizationMarker::_is_active = false; |
96 | |
97 Deoptimization::UnrollBlock::UnrollBlock(int size_of_deoptimized_frame, | |
98 int caller_adjustment, | |
3369
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
99 int caller_actual_parameters, |
0 | 100 int number_of_frames, |
101 intptr_t* frame_sizes, | |
102 address* frame_pcs, | |
103 BasicType return_type) { | |
104 _size_of_deoptimized_frame = size_of_deoptimized_frame; | |
105 _caller_adjustment = caller_adjustment; | |
3369
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
106 _caller_actual_parameters = caller_actual_parameters; |
0 | 107 _number_of_frames = number_of_frames; |
108 _frame_sizes = frame_sizes; | |
109 _frame_pcs = frame_pcs; | |
6197 | 110 _register_block = NEW_C_HEAP_ARRAY(intptr_t, RegisterMap::reg_count * 2, mtCompiler); |
0 | 111 _return_type = return_type; |
3931
5432047c7db7
7087445: Improve platform independence of JSR292 shared code
bdelsart
parents:
3369
diff
changeset
|
112 _initial_info = 0; |
0 | 113 // PD (x86 only) |
114 _counter_temp = 0; | |
115 _unpack_kind = 0; | |
116 _sender_sp_temp = 0; | |
117 | |
118 _total_frame_sizes = size_of_frames(); | |
119 } | |
120 | |
121 | |
122 Deoptimization::UnrollBlock::~UnrollBlock() { | |
6197 | 123 FREE_C_HEAP_ARRAY(intptr_t, _frame_sizes, mtCompiler); |
124 FREE_C_HEAP_ARRAY(intptr_t, _frame_pcs, mtCompiler); | |
125 FREE_C_HEAP_ARRAY(intptr_t, _register_block, mtCompiler); | |
0 | 126 } |
127 | |
128 | |
129 intptr_t* Deoptimization::UnrollBlock::value_addr_at(int register_number) const { | |
130 assert(register_number < RegisterMap::reg_count, "checking register number"); | |
131 return &_register_block[register_number * 2]; | |
132 } | |
133 | |
134 | |
135 | |
136 int Deoptimization::UnrollBlock::size_of_frames() const { | |
137 // Acount first for the adjustment of the initial frame | |
138 int result = _caller_adjustment; | |
139 for (int index = 0; index < number_of_frames(); index++) { | |
140 result += frame_sizes()[index]; | |
141 } | |
142 return result; | |
143 } | |
144 | |
145 | |
146 void Deoptimization::UnrollBlock::print() { | |
147 ttyLocker ttyl; | |
148 tty->print_cr("UnrollBlock"); | |
149 tty->print_cr(" size_of_deoptimized_frame = %d", _size_of_deoptimized_frame); | |
150 tty->print( " frame_sizes: "); | |
151 for (int index = 0; index < number_of_frames(); index++) { | |
152 tty->print("%d ", frame_sizes()[index]); | |
153 } | |
154 tty->cr(); | |
155 } | |
156 | |
157 | |
158 // In order to make fetch_unroll_info work properly with escape | |
159 // analysis, The method was changed from JRT_LEAF to JRT_BLOCK_ENTRY and | |
160 // ResetNoHandleMark and HandleMark were removed from it. The actual reallocation | |
161 // of previously eliminated objects occurs in realloc_objects, which is | |
162 // called from the method fetch_unroll_info_helper below. | |
163 JRT_BLOCK_ENTRY(Deoptimization::UnrollBlock*, Deoptimization::fetch_unroll_info(JavaThread* thread)) | |
164 // It is actually ok to allocate handles in a leaf method. It causes no safepoints, | |
165 // but makes the entry a little slower. There is however a little dance we have to | |
166 // do in debug mode to get around the NoHandleMark code in the JRT_LEAF macro | |
167 | |
168 // fetch_unroll_info() is called at the beginning of the deoptimization | |
169 // handler. Note this fact before we start generating temporary frames | |
170 // that can confuse an asynchronous stack walker. This counter is | |
171 // decremented at the end of unpack_frames(). | |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
172 if (TraceDeoptimization) { |
5038
1b907994bf2d
fixed deoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4978
diff
changeset
|
173 tty->print_cr("Deoptimizing thread " INTPTR_FORMAT, thread); |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
174 } |
0 | 175 thread->inc_in_deopt_handler(); |
176 | |
177 return fetch_unroll_info_helper(thread); | |
178 JRT_END | |
179 | |
180 | |
181 // This is factored, since it is both called from a JRT_LEAF (deoptimization) and a JRT_ENTRY (uncommon_trap) | |
182 Deoptimization::UnrollBlock* Deoptimization::fetch_unroll_info_helper(JavaThread* thread) { | |
183 | |
184 // Note: there is a safepoint safety issue here. No matter whether we enter | |
185 // via vanilla deopt or uncommon trap we MUST NOT stop at a safepoint once | |
186 // the vframeArray is created. | |
187 // | |
188 | |
189 // Allocate our special deoptimization ResourceMark | |
190 DeoptResourceMark* dmark = new DeoptResourceMark(thread); | |
191 assert(thread->deopt_mark() == NULL, "Pending deopt!"); | |
192 thread->set_deopt_mark(dmark); | |
193 | |
194 frame stub_frame = thread->last_frame(); // Makes stack walkable as side effect | |
195 RegisterMap map(thread, true); | |
196 RegisterMap dummy_map(thread, false); | |
197 // Now get the deoptee with a valid map | |
198 frame deoptee = stub_frame.sender(&map); | |
1814
fd5d4527cdf5
6986270: guarantee(*bcp != Bytecodes::_monitorenter || exec_mode != Deoptimization::Unpack_exception) fails
iveresov
parents:
1783
diff
changeset
|
199 // Set the deoptee nmethod |
fd5d4527cdf5
6986270: guarantee(*bcp != Bytecodes::_monitorenter || exec_mode != Deoptimization::Unpack_exception) fails
iveresov
parents:
1783
diff
changeset
|
200 assert(thread->deopt_nmethod() == NULL, "Pending deopt!"); |
fd5d4527cdf5
6986270: guarantee(*bcp != Bytecodes::_monitorenter || exec_mode != Deoptimization::Unpack_exception) fails
iveresov
parents:
1783
diff
changeset
|
201 thread->set_deopt_nmethod(deoptee.cb()->as_nmethod_or_null()); |
0 | 202 |
3336
2e038ad0c1d0
7009361: JSR 292 Invalid value on stack on solaris-sparc with -Xcomp
never
parents:
2338
diff
changeset
|
203 if (VerifyStack) { |
2e038ad0c1d0
7009361: JSR 292 Invalid value on stack on solaris-sparc with -Xcomp
never
parents:
2338
diff
changeset
|
204 thread->validate_frame_layout(); |
2e038ad0c1d0
7009361: JSR 292 Invalid value on stack on solaris-sparc with -Xcomp
never
parents:
2338
diff
changeset
|
205 } |
2e038ad0c1d0
7009361: JSR 292 Invalid value on stack on solaris-sparc with -Xcomp
never
parents:
2338
diff
changeset
|
206 |
0 | 207 // Create a growable array of VFrames where each VFrame represents an inlined |
208 // Java frame. This storage is allocated with the usual system arena. | |
209 assert(deoptee.is_compiled_frame(), "Wrong frame type"); | |
5129
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
210 |
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
211 #ifdef GRAAL |
7660
0b646334c5f7
keep track of leafGraphIds only at the StructuredGraph level (see GRAAL-60)
Lukas Stadler <lukas.stadler@jku.at>
parents:
7232
diff
changeset
|
212 nmethod* nm = (nmethod*) deoptee.cb(); |
0b646334c5f7
keep track of leafGraphIds only at the StructuredGraph level (see GRAAL-60)
Lukas Stadler <lukas.stadler@jku.at>
parents:
7232
diff
changeset
|
213 GraalCompiler* compiler = (GraalCompiler*) nm->compiler(); |
0b646334c5f7
keep track of leafGraphIds only at the StructuredGraph level (see GRAAL-60)
Lukas Stadler <lukas.stadler@jku.at>
parents:
7232
diff
changeset
|
214 for (jlong* p = nm->leaf_graph_ids_begin(); p != nm->leaf_graph_ids_end(); p++) { |
8609
9f9aaa65294e
fixed -XX:+PrintDeoptimizationDetails in debug/fastdebug build
Christian Haeubl <haeubl@ssw.jku.at>
parents:
8328
diff
changeset
|
215 compiler->deopt_leaf_graph(*p); |
9f9aaa65294e
fixed -XX:+PrintDeoptimizationDetails in debug/fastdebug build
Christian Haeubl <haeubl@ssw.jku.at>
parents:
8328
diff
changeset
|
216 } |
9f9aaa65294e
fixed -XX:+PrintDeoptimizationDetails in debug/fastdebug build
Christian Haeubl <haeubl@ssw.jku.at>
parents:
8328
diff
changeset
|
217 if (PrintDeoptimizationDetails) { |
9f9aaa65294e
fixed -XX:+PrintDeoptimizationDetails in debug/fastdebug build
Christian Haeubl <haeubl@ssw.jku.at>
parents:
8328
diff
changeset
|
218 tty->print("leaf graph ids: "); |
9f9aaa65294e
fixed -XX:+PrintDeoptimizationDetails in debug/fastdebug build
Christian Haeubl <haeubl@ssw.jku.at>
parents:
8328
diff
changeset
|
219 for (jlong* p = nm->leaf_graph_ids_begin(); p != nm->leaf_graph_ids_end(); p++) { |
9f9aaa65294e
fixed -XX:+PrintDeoptimizationDetails in debug/fastdebug build
Christian Haeubl <haeubl@ssw.jku.at>
parents:
8328
diff
changeset
|
220 tty->print("%d ", *p); |
5129
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
221 } |
8609
9f9aaa65294e
fixed -XX:+PrintDeoptimizationDetails in debug/fastdebug build
Christian Haeubl <haeubl@ssw.jku.at>
parents:
8328
diff
changeset
|
222 tty->cr(); |
5129
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
223 } |
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
224 #endif |
51111665eda6
Support for recording a leaf graph id for each deoptimization point in the debug info.
Lukas Stadler <lukas.stadler@jku.at>
parents:
5038
diff
changeset
|
225 |
0 | 226 GrowableArray<compiledVFrame*>* chunk = new GrowableArray<compiledVFrame*>(10); |
227 vframe* vf = vframe::new_vframe(&deoptee, &map, thread); | |
228 while (!vf->is_top()) { | |
229 assert(vf->is_compiled_frame(), "Wrong frame type"); | |
230 chunk->push(compiledVFrame::cast(vf)); | |
231 vf = vf->sender(); | |
232 } | |
233 assert(vf->is_compiled_frame(), "Wrong frame type"); | |
234 chunk->push(compiledVFrame::cast(vf)); | |
235 | |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
236 #if defined(COMPILER2) || defined(GRAAL) |
0 | 237 // Reallocate the non-escaping objects and restore their fields. Then |
238 // relock objects if synchronization on them was eliminated. | |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
239 #ifdef COMPILER2 |
4777 | 240 if (DoEscapeAnalysis || EliminateNestedLocks) { |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
241 if (EliminateAllocations) { |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
242 #endif // COMPILER2 |
83
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
243 assert (chunk->at(0)->scope() != NULL,"expect only compiled java frames"); |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
244 GrowableArray<ScopeValue*>* objects = chunk->at(0)->scope()->objects(); |
1253
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
245 |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
246 // The flag return_oop() indicates call sites which return oop |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
247 // in compiled code. Such sites include java method calls, |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
248 // runtime calls (for example, used to allocate new objects/arrays |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
249 // on slow code path) and any other calls generated in compiled code. |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
250 // It is not guaranteed that we can get such information here only |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
251 // by analyzing bytecode in deoptimized frames. This is why this flag |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
252 // is set during method compilation (see Compile::Process_OopMap_Node()). |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
253 bool save_oop_result = chunk->at(0)->scope()->return_oop(); |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
254 Handle return_value; |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
255 if (save_oop_result) { |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
256 // Reallocation may trigger GC. If deoptimization happened on return from |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
257 // call which returns oop we need to save it since it is not in oopmap. |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
258 oop result = deoptee.saved_oop_result(&map); |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
259 assert(result == NULL || result->is_oop(), "must be oop"); |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
260 return_value = Handle(thread, result); |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
261 assert(Universe::heap()->is_in_or_null(result), "must be heap pointer"); |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
262 if (TraceDeoptimization) { |
6843 | 263 ttyLocker ttyl; |
1253
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
264 tty->print_cr("SAVED OOP RESULT " INTPTR_FORMAT " in thread " INTPTR_FORMAT, result, thread); |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
265 } |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
266 } |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
267 bool reallocated = false; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
268 if (objects != NULL) { |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
269 JRT_BLOCK |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
270 reallocated = realloc_objects(thread, &deoptee, objects, THREAD); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
271 JRT_END |
0 | 272 } |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
273 if (reallocated) { |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
274 reassign_fields(&deoptee, &map, objects); |
0 | 275 #ifndef PRODUCT |
276 if (TraceDeoptimization) { | |
277 ttyLocker ttyl; | |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
278 tty->print_cr("REALLOC OBJECTS in thread " INTPTR_FORMAT, thread); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
279 print_objects(objects); |
1253
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
280 } |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
281 #endif |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
282 } |
1253
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
283 if (save_oop_result) { |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
284 // Restore result. |
f70b0d9ab095
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn
parents:
1206
diff
changeset
|
285 deoptee.set_saved_oop_result(&map, return_value()); |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
286 } |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
287 #ifdef COMPILER2 |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
288 } |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
289 if (EliminateLocks) { |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
290 #endif // COMPILER2 |
83
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
291 #ifndef PRODUCT |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
292 bool first = true; |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
293 #endif |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
294 for (int i = 0; i < chunk->length(); i++) { |
83
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
295 compiledVFrame* cvf = chunk->at(i); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
296 assert (cvf->scope() != NULL,"expect only compiled java frames"); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
297 GrowableArray<MonitorInfo*>* monitors = cvf->monitors(); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
298 if (monitors->is_nonempty()) { |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
299 relock_objects(monitors, thread); |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
300 #ifndef PRODUCT |
4668
3dbcd1013cc8
added flag PrintDeoptimizationDetails
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4661
diff
changeset
|
301 if (PrintDeoptimizationDetails) { |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
302 ttyLocker ttyl; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
303 for (int j = 0; j < monitors->length(); j++) { |
83
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
304 MonitorInfo* mi = monitors->at(j); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
305 if (mi->eliminated()) { |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
306 if (first) { |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
307 first = false; |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
308 tty->print_cr("RELOCK OBJECTS in thread " INTPTR_FORMAT, thread); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
309 } |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
310 tty->print_cr(" object <" INTPTR_FORMAT "> locked", mi->owner()); |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
311 } |
0 | 312 } |
313 } | |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
314 #endif // !PRODUCT |
0 | 315 } |
316 } | |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
317 #ifdef COMPILER2 |
0 | 318 } |
319 } | |
320 #endif // COMPILER2 | |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
321 #endif // COMPILER2 || GRAAL |
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
322 |
0 | 323 // Ensure that no safepoint is taken after pointers have been stored |
324 // in fields of rematerialized objects. If a safepoint occurs from here on | |
325 // out the java state residing in the vframeArray will be missed. | |
326 No_Safepoint_Verifier no_safepoint; | |
327 | |
328 vframeArray* array = create_vframeArray(thread, deoptee, &map, chunk); | |
329 | |
330 assert(thread->vframe_array_head() == NULL, "Pending deopt!");; | |
331 thread->set_vframe_array_head(array); | |
332 | |
333 // Now that the vframeArray has been created if we have any deferred local writes | |
334 // added by jvmti then we can free up that structure as the data is now in the | |
335 // vframeArray | |
336 | |
337 if (thread->deferred_locals() != NULL) { | |
338 GrowableArray<jvmtiDeferredLocalVariableSet*>* list = thread->deferred_locals(); | |
339 int i = 0; | |
340 do { | |
341 // Because of inlining we could have multiple vframes for a single frame | |
342 // and several of the vframes could have deferred writes. Find them all. | |
343 if (list->at(i)->id() == array->original().id()) { | |
344 jvmtiDeferredLocalVariableSet* dlv = list->at(i); | |
345 list->remove_at(i); | |
346 // individual jvmtiDeferredLocalVariableSet are CHeapObj's | |
347 delete dlv; | |
348 } else { | |
349 i++; | |
350 } | |
351 } while ( i < list->length() ); | |
352 if (list->length() == 0) { | |
353 thread->set_deferred_locals(NULL); | |
354 // free the list and elements back to C heap. | |
355 delete list; | |
356 } | |
357 | |
358 } | |
359 | |
1692 | 360 #ifndef SHARK |
0 | 361 // Compute the caller frame based on the sender sp of stub_frame and stored frame sizes info. |
362 CodeBlob* cb = stub_frame.cb(); | |
363 // Verify we have the right vframeArray | |
364 assert(cb->frame_size() >= 0, "Unexpected frame size"); | |
365 intptr_t* unpack_sp = stub_frame.sp() + cb->frame_size(); | |
366 | |
1204 | 367 // If the deopt call site is a MethodHandle invoke call site we have |
368 // to adjust the unpack_sp. | |
369 nmethod* deoptee_nm = deoptee.cb()->as_nmethod_or_null(); | |
370 if (deoptee_nm != NULL && deoptee_nm->is_method_handle_return(deoptee.pc())) | |
371 unpack_sp = deoptee.unextended_sp(); | |
372 | |
0 | 373 #ifdef ASSERT |
374 assert(cb->is_deoptimization_stub() || cb->is_uncommon_trap_stub(), "just checking"); | |
375 #endif | |
1692 | 376 #else |
377 intptr_t* unpack_sp = stub_frame.sender(&dummy_map).unextended_sp(); | |
378 #endif // !SHARK | |
379 | |
0 | 380 // This is a guarantee instead of an assert because if vframe doesn't match |
381 // we will unpack the wrong deoptimized frame and wind up in strange places | |
382 // where it will be very difficult to figure out what went wrong. Better | |
383 // to die an early death here than some very obscure death later when the | |
384 // trail is cold. | |
385 // Note: on ia64 this guarantee can be fooled by frames with no memory stack | |
386 // in that it will fail to detect a problem when there is one. This needs | |
387 // more work in tiger timeframe. | |
388 guarantee(array->unextended_sp() == unpack_sp, "vframe_array_head must contain the vframeArray to unpack"); | |
389 | |
390 int number_of_frames = array->frames(); | |
391 | |
392 // Compute the vframes' sizes. Note that frame_sizes[] entries are ordered from outermost to innermost | |
393 // virtual activation, which is the reverse of the elements in the vframes array. | |
6197 | 394 intptr_t* frame_sizes = NEW_C_HEAP_ARRAY(intptr_t, number_of_frames, mtCompiler); |
0 | 395 // +1 because we always have an interpreter return address for the final slot. |
6197 | 396 address* frame_pcs = NEW_C_HEAP_ARRAY(address, number_of_frames + 1, mtCompiler); |
0 | 397 int popframe_extra_args = 0; |
398 // Create an interpreter return address for the stub to use as its return | |
399 // address so the skeletal frames are perfectly walkable | |
400 frame_pcs[number_of_frames] = Interpreter::deopt_entry(vtos, 0); | |
401 | |
402 // PopFrame requires that the preserved incoming arguments from the recently-popped topmost | |
403 // activation be put back on the expression stack of the caller for reexecution | |
404 if (JvmtiExport::can_pop_frame() && thread->popframe_forcing_deopt_reexecution()) { | |
405 popframe_extra_args = in_words(thread->popframe_preserved_args_size_in_words()); | |
406 } | |
407 | |
3369
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
408 // Find the current pc for sender of the deoptee. Since the sender may have been deoptimized |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
409 // itself since the deoptee vframeArray was created we must get a fresh value of the pc rather |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
410 // than simply use array->sender.pc(). This requires us to walk the current set of frames |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
411 // |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
412 frame deopt_sender = stub_frame.sender(&dummy_map); // First is the deoptee frame |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
413 deopt_sender = deopt_sender.sender(&dummy_map); // Now deoptee caller |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
414 |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
415 // It's possible that the number of paramters at the call site is |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
416 // different than number of arguments in the callee when method |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
417 // handles are used. If the caller is interpreted get the real |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
418 // value so that the proper amount of space can be added to it's |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
419 // frame. |
4042
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
420 bool caller_was_method_handle = false; |
3369
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
421 if (deopt_sender.is_interpreted_frame()) { |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
422 methodHandle method = deopt_sender.interpreter_frame_method(); |
4055
e342a5110bed
7106774: JSR 292: nightly test inlineMHTarget fails with wrong result
twisti
parents:
4042
diff
changeset
|
423 Bytecode_invoke cur = Bytecode_invoke_check(method, deopt_sender.interpreter_frame_bci()); |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6197
diff
changeset
|
424 if (cur.is_invokedynamic() || cur.is_invokehandle()) { |
4042
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
425 // Method handle invokes may involve fairly arbitrary chains of |
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
426 // calls so it's impossible to know how much actual space the |
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
427 // caller has for locals. |
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
428 caller_was_method_handle = true; |
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
429 } |
3369
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
430 } |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
431 |
0 | 432 // |
433 // frame_sizes/frame_pcs[0] oldest frame (int or c2i) | |
434 // frame_sizes/frame_pcs[1] next oldest frame (int) | |
435 // frame_sizes/frame_pcs[n] youngest frame (int) | |
436 // | |
437 // Now a pc in frame_pcs is actually the return address to the frame's caller (a frame | |
438 // owns the space for the return address to it's caller). Confusing ain't it. | |
439 // | |
440 // The vframe array can address vframes with indices running from | |
441 // 0.._frames-1. Index 0 is the youngest frame and _frame - 1 is the oldest (root) frame. | |
442 // When we create the skeletal frames we need the oldest frame to be in the zero slot | |
443 // in the frame_sizes/frame_pcs so the assembly code can do a trivial walk. | |
444 // so things look a little strange in this loop. | |
445 // | |
4042
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
446 int callee_parameters = 0; |
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
447 int callee_locals = 0; |
0 | 448 for (int index = 0; index < array->frames(); index++ ) { |
449 // frame[number_of_frames - 1 ] = on_stack_size(youngest) | |
450 // frame[number_of_frames - 2 ] = on_stack_size(sender(youngest)) | |
451 // frame[number_of_frames - 3 ] = on_stack_size(sender(sender(youngest))) | |
3369
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
452 int caller_parms = callee_parameters; |
4042
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
453 if ((index == array->frames() - 1) && caller_was_method_handle) { |
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
454 caller_parms = 0; |
3369
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
455 } |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
456 frame_sizes[number_of_frames - 1 - index] = BytesPerWord * array->element(index)->on_stack_size(caller_parms, |
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
457 callee_parameters, |
0 | 458 callee_locals, |
459 index == 0, | |
460 popframe_extra_args); | |
461 // This pc doesn't have to be perfect just good enough to identify the frame | |
462 // as interpreted so the skeleton frame will be walkable | |
463 // The correct pc will be set when the skeleton frame is completely filled out | |
464 // The final pc we store in the loop is wrong and will be overwritten below | |
465 frame_pcs[number_of_frames - 1 - index ] = Interpreter::deopt_entry(vtos, 0) - frame::pc_return_offset; | |
466 | |
467 callee_parameters = array->element(index)->method()->size_of_parameters(); | |
468 callee_locals = array->element(index)->method()->max_locals(); | |
469 popframe_extra_args = 0; | |
470 } | |
471 | |
472 // Compute whether the root vframe returns a float or double value. | |
473 BasicType return_type; | |
474 { | |
475 HandleMark hm; | |
476 methodHandle method(thread, array->element(0)->method()); | |
2142 | 477 Bytecode_invoke invoke = Bytecode_invoke_check(method, array->element(0)->bci()); |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
478 return_type = invoke.is_valid() ? invoke.result_type() : T_ILLEGAL; |
0 | 479 } |
480 | |
481 // Compute information for handling adapters and adjusting the frame size of the caller. | |
482 int caller_adjustment = 0; | |
483 | |
484 // Compute the amount the oldest interpreter frame will have to adjust | |
485 // its caller's stack by. If the caller is a compiled frame then | |
486 // we pretend that the callee has no parameters so that the | |
487 // extension counts for the full amount of locals and not just | |
488 // locals-parms. This is because without a c2i adapter the parm | |
489 // area as created by the compiled frame will not be usable by | |
490 // the interpreter. (Depending on the calling convention there | |
491 // may not even be enough space). | |
492 | |
493 // QQQ I'd rather see this pushed down into last_frame_adjust | |
494 // and have it take the sender (aka caller). | |
495 | |
4042
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
496 if (deopt_sender.is_compiled_frame() || caller_was_method_handle) { |
0 | 497 caller_adjustment = last_frame_adjust(0, callee_locals); |
4042
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
498 } else if (callee_locals > callee_parameters) { |
0 | 499 // The caller frame may need extending to accommodate |
500 // non-parameter locals of the first unpacked interpreted frame. | |
501 // Compute that adjustment. | |
4042
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
502 caller_adjustment = last_frame_adjust(callee_parameters, callee_locals); |
0 | 503 } |
504 | |
505 // If the sender is deoptimized the we must retrieve the address of the handler | |
506 // since the frame will "magically" show the original pc before the deopt | |
507 // and we'd undo the deopt. | |
508 | |
509 frame_pcs[0] = deopt_sender.raw_pc(); | |
510 | |
1692 | 511 #ifndef SHARK |
0 | 512 assert(CodeCache::find_blob_unsafe(frame_pcs[0]) != NULL, "bad pc"); |
1692 | 513 #endif // SHARK |
0 | 514 |
515 UnrollBlock* info = new UnrollBlock(array->frame_size() * BytesPerWord, | |
516 caller_adjustment * BytesPerWord, | |
4042
b20d64f83668
7090904: JSR 292: JRuby junit test crashes in PSScavengeRootsClosure::do_oop
twisti
parents:
3931
diff
changeset
|
517 caller_was_method_handle ? 0 : callee_parameters, |
0 | 518 number_of_frames, |
519 frame_sizes, | |
520 frame_pcs, | |
521 return_type); | |
3931
5432047c7db7
7087445: Improve platform independence of JSR292 shared code
bdelsart
parents:
3369
diff
changeset
|
522 // On some platforms, we need a way to pass some platform dependent |
5432047c7db7
7087445: Improve platform independence of JSR292 shared code
bdelsart
parents:
3369
diff
changeset
|
523 // information to the unpacking code so the skeletal frames come out |
5432047c7db7
7087445: Improve platform independence of JSR292 shared code
bdelsart
parents:
3369
diff
changeset
|
524 // correct (initial fp value, unextended sp, ...) |
5432047c7db7
7087445: Improve platform independence of JSR292 shared code
bdelsart
parents:
3369
diff
changeset
|
525 info->set_initial_info((intptr_t) array->sender().initial_deoptimization_info()); |
0 | 526 |
527 if (array->frames() > 1) { | |
528 if (VerifyStack && TraceDeoptimization) { | |
6843 | 529 ttyLocker ttyl; |
0 | 530 tty->print_cr("Deoptimizing method containing inlining"); |
531 } | |
532 } | |
533 | |
534 array->set_unroll_block(info); | |
535 return info; | |
536 } | |
537 | |
538 // Called to cleanup deoptimization data structures in normal case | |
539 // after unpacking to stack and when stack overflow error occurs | |
540 void Deoptimization::cleanup_deopt_info(JavaThread *thread, | |
541 vframeArray *array) { | |
542 | |
543 // Get array if coming from exception | |
544 if (array == NULL) { | |
545 array = thread->vframe_array_head(); | |
546 } | |
547 thread->set_vframe_array_head(NULL); | |
548 | |
549 // Free the previous UnrollBlock | |
550 vframeArray* old_array = thread->vframe_array_last(); | |
551 thread->set_vframe_array_last(array); | |
552 | |
553 if (old_array != NULL) { | |
554 UnrollBlock* old_info = old_array->unroll_block(); | |
555 old_array->set_unroll_block(NULL); | |
556 delete old_info; | |
557 delete old_array; | |
558 } | |
559 | |
560 // Deallocate any resource creating in this routine and any ResourceObjs allocated | |
561 // inside the vframeArray (StackValueCollections) | |
562 | |
563 delete thread->deopt_mark(); | |
564 thread->set_deopt_mark(NULL); | |
1814
fd5d4527cdf5
6986270: guarantee(*bcp != Bytecodes::_monitorenter || exec_mode != Deoptimization::Unpack_exception) fails
iveresov
parents:
1783
diff
changeset
|
565 thread->set_deopt_nmethod(NULL); |
0 | 566 |
567 | |
568 if (JvmtiExport::can_pop_frame()) { | |
569 #ifndef CC_INTERP | |
570 // Regardless of whether we entered this routine with the pending | |
571 // popframe condition bit set, we should always clear it now | |
572 thread->clear_popframe_condition(); | |
573 #else | |
574 // C++ interpeter will clear has_pending_popframe when it enters | |
575 // with method_resume. For deopt_resume2 we clear it now. | |
576 if (thread->popframe_forcing_deopt_reexecution()) | |
577 thread->clear_popframe_condition(); | |
578 #endif /* CC_INTERP */ | |
579 } | |
580 | |
581 // unpack_frames() is called at the end of the deoptimization handler | |
582 // and (in C2) at the end of the uncommon trap handler. Note this fact | |
583 // so that an asynchronous stack walker can work again. This counter is | |
584 // incremented at the beginning of fetch_unroll_info() and (in C2) at | |
585 // the beginning of uncommon_trap(). | |
586 thread->dec_in_deopt_handler(); | |
587 } | |
588 | |
589 | |
590 // Return BasicType of value being returned | |
591 JRT_LEAF(BasicType, Deoptimization::unpack_frames(JavaThread* thread, int exec_mode)) | |
592 | |
593 // We are already active int he special DeoptResourceMark any ResourceObj's we | |
594 // allocate will be freed at the end of the routine. | |
595 | |
596 // It is actually ok to allocate handles in a leaf method. It causes no safepoints, | |
597 // but makes the entry a little slower. There is however a little dance we have to | |
598 // do in debug mode to get around the NoHandleMark code in the JRT_LEAF macro | |
599 ResetNoHandleMark rnhm; // No-op in release/product versions | |
600 HandleMark hm; | |
601 | |
602 frame stub_frame = thread->last_frame(); | |
603 | |
604 // Since the frame to unpack is the top frame of this thread, the vframe_array_head | |
605 // must point to the vframeArray for the unpack frame. | |
606 vframeArray* array = thread->vframe_array_head(); | |
607 | |
608 #ifndef PRODUCT | |
609 if (TraceDeoptimization) { | |
6843 | 610 ttyLocker ttyl; |
0 | 611 tty->print_cr("DEOPT UNPACKING thread " INTPTR_FORMAT " vframeArray " INTPTR_FORMAT " mode %d", thread, array, exec_mode); |
612 } | |
613 #endif | |
4872
aa3d708d67c4
7141200: log some interesting information in ring buffers for crashes
never
parents:
4777
diff
changeset
|
614 Events::log(thread, "DEOPT UNPACKING pc=" INTPTR_FORMAT " sp=" INTPTR_FORMAT " mode %d", |
aa3d708d67c4
7141200: log some interesting information in ring buffers for crashes
never
parents:
4777
diff
changeset
|
615 stub_frame.pc(), stub_frame.sp(), exec_mode); |
0 | 616 |
617 UnrollBlock* info = array->unroll_block(); | |
618 | |
619 // Unpack the interpreter frames and any adapter frame (c2 only) we might create. | |
3369
3d2ab563047a
7043461: VM crashes in void LinkResolver::runtime_resolve_virtual_method
never
parents:
3346
diff
changeset
|
620 array->unpack_to_stack(stub_frame, exec_mode, info->caller_actual_parameters()); |
0 | 621 |
622 BasicType bt = info->return_type(); | |
623 | |
624 // If we have an exception pending, claim that the return type is an oop | |
625 // so the deopt_blob does not overwrite the exception_oop. | |
626 | |
627 if (exec_mode == Unpack_exception) | |
628 bt = T_OBJECT; | |
629 | |
630 // Cleanup thread deopt data | |
631 cleanup_deopt_info(thread, array); | |
632 | |
633 #ifndef PRODUCT | |
634 if (VerifyStack) { | |
635 ResourceMark res_mark; | |
636 | |
3336
2e038ad0c1d0
7009361: JSR 292 Invalid value on stack on solaris-sparc with -Xcomp
never
parents:
2338
diff
changeset
|
637 thread->validate_frame_layout(); |
2e038ad0c1d0
7009361: JSR 292 Invalid value on stack on solaris-sparc with -Xcomp
never
parents:
2338
diff
changeset
|
638 |
0 | 639 // Verify that the just-unpacked frames match the interpreter's |
640 // notions of expression stack and locals | |
641 vframeArray* cur_array = thread->vframe_array_last(); | |
642 RegisterMap rm(thread, false); | |
643 rm.set_include_argument_oops(false); | |
644 bool is_top_frame = true; | |
645 int callee_size_of_parameters = 0; | |
646 int callee_max_locals = 0; | |
647 for (int i = 0; i < cur_array->frames(); i++) { | |
648 vframeArrayElement* el = cur_array->element(i); | |
649 frame* iframe = el->iframe(); | |
650 guarantee(iframe->is_interpreted_frame(), "Wrong frame type"); | |
651 | |
652 // Get the oop map for this bci | |
653 InterpreterOopMap mask; | |
654 int cur_invoke_parameter_size = 0; | |
655 bool try_next_mask = false; | |
656 int next_mask_expression_stack_size = -1; | |
657 int top_frame_expression_stack_adjustment = 0; | |
658 methodHandle mh(thread, iframe->interpreter_frame_method()); | |
659 OopMapCache::compute_one_oop_map(mh, iframe->interpreter_frame_bci(), &mask); | |
660 BytecodeStream str(mh); | |
661 str.set_start(iframe->interpreter_frame_bci()); | |
662 int max_bci = mh->code_size(); | |
663 // Get to the next bytecode if possible | |
664 assert(str.bci() < max_bci, "bci in interpreter frame out of bounds"); | |
665 // Check to see if we can grab the number of outgoing arguments | |
666 // at an uncommon trap for an invoke (where the compiler | |
667 // generates debug info before the invoke has executed) | |
668 Bytecodes::Code cur_code = str.next(); | |
669 if (cur_code == Bytecodes::_invokevirtual || | |
670 cur_code == Bytecodes::_invokespecial || | |
671 cur_code == Bytecodes::_invokestatic || | |
672 cur_code == Bytecodes::_invokeinterface) { | |
2142 | 673 Bytecode_invoke invoke(mh, iframe->interpreter_frame_bci()); |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
674 Symbol* signature = invoke.signature(); |
0 | 675 ArgumentSizeComputer asc(signature); |
676 cur_invoke_parameter_size = asc.size(); | |
677 if (cur_code != Bytecodes::_invokestatic) { | |
678 // Add in receiver | |
679 ++cur_invoke_parameter_size; | |
680 } | |
681 } | |
682 if (str.bci() < max_bci) { | |
683 Bytecodes::Code bc = str.next(); | |
684 if (bc >= 0) { | |
685 // The interpreter oop map generator reports results before | |
686 // the current bytecode has executed except in the case of | |
687 // calls. It seems to be hard to tell whether the compiler | |
688 // has emitted debug information matching the "state before" | |
689 // a given bytecode or the state after, so we try both | |
690 switch (cur_code) { | |
691 case Bytecodes::_invokevirtual: | |
692 case Bytecodes::_invokespecial: | |
693 case Bytecodes::_invokestatic: | |
694 case Bytecodes::_invokeinterface: | |
695 case Bytecodes::_athrow: | |
696 break; | |
697 default: { | |
698 InterpreterOopMap next_mask; | |
699 OopMapCache::compute_one_oop_map(mh, str.bci(), &next_mask); | |
700 next_mask_expression_stack_size = next_mask.expression_stack_size(); | |
701 // Need to subtract off the size of the result type of | |
702 // the bytecode because this is not described in the | |
703 // debug info but returned to the interpreter in the TOS | |
704 // caching register | |
705 BasicType bytecode_result_type = Bytecodes::result_type(cur_code); | |
706 if (bytecode_result_type != T_ILLEGAL) { | |
707 top_frame_expression_stack_adjustment = type2size[bytecode_result_type]; | |
708 } | |
709 assert(top_frame_expression_stack_adjustment >= 0, ""); | |
710 try_next_mask = true; | |
711 break; | |
712 } | |
713 } | |
714 } | |
715 } | |
716 | |
717 // Verify stack depth and oops in frame | |
718 // This assertion may be dependent on the platform we're running on and may need modification (tested on x86 and sparc) | |
719 if (!( | |
720 /* SPARC */ | |
721 (iframe->interpreter_frame_expression_stack_size() == mask.expression_stack_size() + callee_size_of_parameters) || | |
722 /* x86 */ | |
723 (iframe->interpreter_frame_expression_stack_size() == mask.expression_stack_size() + callee_max_locals) || | |
724 (try_next_mask && | |
725 (iframe->interpreter_frame_expression_stack_size() == (next_mask_expression_stack_size - | |
726 top_frame_expression_stack_adjustment))) || | |
727 (is_top_frame && (exec_mode == Unpack_exception) && iframe->interpreter_frame_expression_stack_size() == 0) || | |
728 (is_top_frame && (exec_mode == Unpack_uncommon_trap || exec_mode == Unpack_reexecute) && | |
729 (iframe->interpreter_frame_expression_stack_size() == mask.expression_stack_size() + cur_invoke_parameter_size)) | |
730 )) { | |
731 ttyLocker ttyl; | |
732 | |
733 // Print out some information that will help us debug the problem | |
734 tty->print_cr("Wrong number of expression stack elements during deoptimization"); | |
735 tty->print_cr(" Error occurred while verifying frame %d (0..%d, 0 is topmost)", i, cur_array->frames() - 1); | |
736 tty->print_cr(" Fabricated interpreter frame had %d expression stack elements", | |
737 iframe->interpreter_frame_expression_stack_size()); | |
738 tty->print_cr(" Interpreter oop map had %d expression stack elements", mask.expression_stack_size()); | |
739 tty->print_cr(" try_next_mask = %d", try_next_mask); | |
740 tty->print_cr(" next_mask_expression_stack_size = %d", next_mask_expression_stack_size); | |
741 tty->print_cr(" callee_size_of_parameters = %d", callee_size_of_parameters); | |
742 tty->print_cr(" callee_max_locals = %d", callee_max_locals); | |
743 tty->print_cr(" top_frame_expression_stack_adjustment = %d", top_frame_expression_stack_adjustment); | |
744 tty->print_cr(" exec_mode = %d", exec_mode); | |
745 tty->print_cr(" cur_invoke_parameter_size = %d", cur_invoke_parameter_size); | |
746 tty->print_cr(" Thread = " INTPTR_FORMAT ", thread ID = " UINTX_FORMAT, thread, thread->osthread()->thread_id()); | |
747 tty->print_cr(" Interpreted frames:"); | |
748 for (int k = 0; k < cur_array->frames(); k++) { | |
749 vframeArrayElement* el = cur_array->element(k); | |
750 tty->print_cr(" %s (bci %d)", el->method()->name_and_sig_as_C_string(), el->bci()); | |
751 } | |
752 cur_array->print_on_2(tty); | |
753 guarantee(false, "wrong number of expression stack elements during deopt"); | |
754 } | |
755 VerifyOopClosure verify; | |
7179
d0aa87f04bd5
8003720: NPG: Method in interpreter stack frame can be deallocated
stefank
parents:
6940
diff
changeset
|
756 iframe->oops_interpreted_do(&verify, NULL, &rm, false); |
0 | 757 callee_size_of_parameters = mh->size_of_parameters(); |
758 callee_max_locals = mh->max_locals(); | |
759 is_top_frame = false; | |
760 } | |
761 } | |
762 #endif /* !PRODUCT */ | |
763 | |
764 | |
765 return bt; | |
766 JRT_END | |
767 | |
768 | |
769 int Deoptimization::deoptimize_dependents() { | |
770 Threads::deoptimized_wrt_marked_nmethods(); | |
771 return 0; | |
772 } | |
773 | |
774 | |
4978
99d3d8a72252
More ifdef GRAAL usage.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
4970
diff
changeset
|
775 #if defined(COMPILER2) || defined(GRAAL) |
0 | 776 bool Deoptimization::realloc_objects(JavaThread* thread, frame* fr, GrowableArray<ScopeValue*>* objects, TRAPS) { |
777 Handle pending_exception(thread->pending_exception()); | |
778 const char* exception_file = thread->exception_file(); | |
779 int exception_line = thread->exception_line(); | |
780 thread->clear_pending_exception(); | |
781 | |
782 for (int i = 0; i < objects->length(); i++) { | |
783 assert(objects->at(i)->is_object(), "invalid debug information"); | |
784 ObjectValue* sv = (ObjectValue*) objects->at(i); | |
785 | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
786 KlassHandle k(java_lang_Class::as_Klass(sv->klass()->as_ConstantOopReadValue()->value()())); |
0 | 787 oop obj = NULL; |
788 | |
789 if (k->oop_is_instance()) { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
790 InstanceKlass* ik = InstanceKlass::cast(k()); |
0 | 791 obj = ik->allocate_instance(CHECK_(false)); |
792 } else if (k->oop_is_typeArray()) { | |
6831
d8ce2825b193
8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
coleenp
parents:
6725
diff
changeset
|
793 TypeArrayKlass* ak = TypeArrayKlass::cast(k()); |
0 | 794 assert(sv->field_size() % type2size[ak->element_type()] == 0, "non-integral array length"); |
795 int len = sv->field_size() / type2size[ak->element_type()]; | |
796 obj = ak->allocate(len, CHECK_(false)); | |
797 } else if (k->oop_is_objArray()) { | |
6831
d8ce2825b193
8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
coleenp
parents:
6725
diff
changeset
|
798 ObjArrayKlass* ak = ObjArrayKlass::cast(k()); |
0 | 799 obj = ak->allocate(sv->field_size(), CHECK_(false)); |
800 } | |
801 | |
802 assert(obj != NULL, "allocation failed"); | |
803 assert(sv->value().is_null(), "redundant reallocation"); | |
804 sv->set_value(obj); | |
805 } | |
806 | |
807 if (pending_exception.not_null()) { | |
808 thread->set_pending_exception(pending_exception(), exception_file, exception_line); | |
809 } | |
810 | |
811 return true; | |
812 } | |
813 | |
814 // restore elements of an eliminated type array | |
815 void Deoptimization::reassign_type_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, typeArrayOop obj, BasicType type) { | |
816 int index = 0; | |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
817 intptr_t val; |
0 | 818 |
819 for (int i = 0; i < sv->field_size(); i++) { | |
820 StackValue* value = StackValue::create_stack_value(fr, reg_map, sv->field_at(i)); | |
821 switch(type) { | |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
822 case T_LONG: case T_DOUBLE: { |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
823 assert(value->type() == T_INT, "Agreement."); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
824 StackValue* low = |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
825 StackValue::create_stack_value(fr, reg_map, sv->field_at(++i)); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
826 #ifdef _LP64 |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
827 jlong res = (jlong)low->get_int(); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
828 #else |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
829 #ifdef SPARC |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
830 // For SPARC we have to swap high and low words. |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
831 jlong res = jlong_from((jint)low->get_int(), (jint)value->get_int()); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
832 #else |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
833 jlong res = jlong_from((jint)value->get_int(), (jint)low->get_int()); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
834 #endif //SPARC |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
835 #endif |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
836 obj->long_at_put(index, res); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
837 break; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
838 } |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
839 |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
840 // Have to cast to INT (32 bits) pointer to avoid little/big-endian problem. |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
841 case T_INT: case T_FLOAT: // 4 bytes. |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
842 assert(value->type() == T_INT, "Agreement."); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
843 val = value->get_int(); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
844 obj->int_at_put(index, (jint)*((jint*)&val)); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
845 break; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
846 |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
847 case T_SHORT: case T_CHAR: // 2 bytes |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
848 assert(value->type() == T_INT, "Agreement."); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
849 val = value->get_int(); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
850 obj->short_at_put(index, (jshort)*((jint*)&val)); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
851 break; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
852 |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
853 case T_BOOLEAN: case T_BYTE: // 1 byte |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
854 assert(value->type() == T_INT, "Agreement."); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
855 val = value->get_int(); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
856 obj->bool_at_put(index, (jboolean)*((jint*)&val)); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
857 break; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
858 |
0 | 859 default: |
860 ShouldNotReachHere(); | |
861 } | |
862 index++; | |
863 } | |
864 } | |
865 | |
866 // restore fields of an eliminated object array | |
867 void Deoptimization::reassign_object_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, objArrayOop obj) { | |
868 for (int i = 0; i < sv->field_size(); i++) { | |
869 StackValue* value = StackValue::create_stack_value(fr, reg_map, sv->field_at(i)); | |
870 assert(value->type() == T_OBJECT, "object element expected"); | |
871 obj->obj_at_put(i, value->get_obj()()); | |
872 } | |
873 } | |
874 | |
7222 | 875 class ReassignedField { |
876 public: | |
877 int _offset; | |
878 BasicType _type; | |
879 public: | |
880 ReassignedField() { | |
881 _offset = 0; | |
882 _type = T_ILLEGAL; | |
883 } | |
884 }; | |
7137
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
885 |
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
886 int compare(ReassignedField* left, ReassignedField* right) { |
7222 | 887 return left->_offset - right->_offset; |
7137
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
888 } |
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
889 |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
890 // Restore fields of an eliminated instance object using the same field order |
7084
9ba90252ce08
HotSpotResolvedJavaType is now the HotSpot implementation of ResolvedJavaType,
Gilles Duboscq <duboscq@ssw.jku.at>
parents:
6948
diff
changeset
|
891 // returned by HotSpotResolvedObjectType.getInstanceFields(true) |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
892 static int reassign_fields_by_klass(InstanceKlass* klass, frame* fr, RegisterMap* reg_map, ObjectValue* sv, int svIndex, oop obj) { |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
893 if (klass->superklass() != NULL) { |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
894 svIndex = reassign_fields_by_klass(klass->superklass(), fr, reg_map, sv, svIndex, obj); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
895 } |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
896 |
7137
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
897 GrowableArray<ReassignedField>* fields = new GrowableArray<ReassignedField>(); |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
898 for (AllFieldStream fs(klass); !fs.done(); fs.next()) { |
7137
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
899 if (!fs.access_flags().is_static()) { |
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
900 ReassignedField field; |
7222 | 901 field._offset = fs.offset(); |
902 field._type = FieldType::basic_type(fs.signature()); | |
7137
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
903 fields->append(field); |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
904 } |
7137
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
905 } |
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
906 fields->sort(compare); |
a818db37b7be
unify object reallocation code for c2 and Graal
Lukas Stadler <lukas.stadler@jku.at>
parents:
7084
diff
changeset
|
907 for (int i = 0; i < fields->length(); i++) { |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
908 intptr_t val; |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
909 StackValue* value = StackValue::create_stack_value(fr, reg_map, sv->field_at(svIndex)); |
7222 | 910 int offset = fields->at(i)._offset; |
911 BasicType type = fields->at(i)._type; | |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
912 switch (type) { |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
913 case T_OBJECT: case T_ARRAY: |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
914 assert(value->type() == T_OBJECT, "Agreement."); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
915 obj->obj_field_put(offset, value->get_obj()()); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
916 break; |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
917 |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
918 case T_LONG: case T_DOUBLE: { |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
919 assert(value->type() == T_INT, "Agreement."); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
920 StackValue* low = StackValue::create_stack_value(fr, reg_map, sv->field_at(++svIndex)); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
921 #ifdef _LP64 |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
922 jlong res = (jlong)low->get_int(); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
923 #else |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
924 #ifdef SPARC |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
925 // For SPARC we have to swap high and low words. |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
926 jlong res = jlong_from((jint)low->get_int(), (jint)value->get_int()); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
927 #else |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
928 jlong res = jlong_from((jint)value->get_int(), (jint)low->get_int()); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
929 #endif //SPARC |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
930 #endif |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
931 obj->long_field_put(offset, res); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
932 break; |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
933 } |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
934 // Have to cast to INT (32 bits) pointer to avoid little/big-endian problem. |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
935 case T_INT: case T_FLOAT: // 4 bytes. |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
936 assert(value->type() == T_INT, "Agreement."); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
937 val = value->get_int(); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
938 obj->int_field_put(offset, (jint)*((jint*)&val)); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
939 break; |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
940 |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
941 case T_SHORT: case T_CHAR: // 2 bytes |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
942 assert(value->type() == T_INT, "Agreement."); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
943 val = value->get_int(); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
944 obj->short_field_put(offset, (jshort)*((jint*)&val)); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
945 break; |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
946 |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
947 case T_BOOLEAN: case T_BYTE: // 1 byte |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
948 assert(value->type() == T_INT, "Agreement."); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
949 val = value->get_int(); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
950 obj->bool_field_put(offset, (jboolean)*((jint*)&val)); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
951 break; |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
952 |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
953 default: |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
954 ShouldNotReachHere(); |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
955 } |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
956 svIndex++; |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
957 } |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
958 return svIndex; |
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
959 } |
0 | 960 |
961 // restore fields of all eliminated objects and arrays | |
962 void Deoptimization::reassign_fields(frame* fr, RegisterMap* reg_map, GrowableArray<ScopeValue*>* objects) { | |
963 for (int i = 0; i < objects->length(); i++) { | |
964 ObjectValue* sv = (ObjectValue*) objects->at(i); | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
965 KlassHandle k(java_lang_Class::as_Klass(sv->klass()->as_ConstantOopReadValue()->value()())); |
0 | 966 Handle obj = sv->value(); |
967 assert(obj.not_null(), "reallocation was missed"); | |
4668
3dbcd1013cc8
added flag PrintDeoptimizationDetails
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4661
diff
changeset
|
968 if (PrintDeoptimizationDetails) { |
3134
4b63eb1197ca
Various fixes around escape analysis.
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3090
diff
changeset
|
969 tty->print_cr("reassign fields for object of type %s!", k->name()->as_C_string()); |
4b63eb1197ca
Various fixes around escape analysis.
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3090
diff
changeset
|
970 } |
0 | 971 |
972 if (k->oop_is_instance()) { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
973 InstanceKlass* ik = InstanceKlass::cast(k()); |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
974 reassign_fields_by_klass(ik, fr, reg_map, sv, 0, obj()); |
0 | 975 } else if (k->oop_is_typeArray()) { |
6831
d8ce2825b193
8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
coleenp
parents:
6725
diff
changeset
|
976 TypeArrayKlass* ak = TypeArrayKlass::cast(k()); |
0 | 977 reassign_type_array_elements(fr, reg_map, sv, (typeArrayOop) obj(), ak->element_type()); |
978 } else if (k->oop_is_objArray()) { | |
979 reassign_object_array_elements(fr, reg_map, sv, (objArrayOop) obj()); | |
980 } | |
981 } | |
982 } | |
983 | |
984 | |
985 // relock objects for which synchronization was eliminated | |
83
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
986 void Deoptimization::relock_objects(GrowableArray<MonitorInfo*>* monitors, JavaThread* thread) { |
0 | 987 for (int i = 0; i < monitors->length(); i++) { |
83
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
988 MonitorInfo* mon_info = monitors->at(i); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
989 if (mon_info->eliminated()) { |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
990 assert(mon_info->owner() != NULL, "reallocation was missed"); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
991 Handle obj = Handle(mon_info->owner()); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
992 markOop mark = obj->mark(); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
993 if (UseBiasedLocking && mark->has_bias_pattern()) { |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
994 // New allocated objects may have the mark set to anonymously biased. |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
995 // Also the deoptimized method may called methods with synchronization |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
996 // where the thread-local object is bias locked to the current thread. |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
997 assert(mark->is_biased_anonymously() || |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
998 mark->biased_locker() == thread, "should be locked to current thread"); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
999 // Reset mark word to unbiased prototype. |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
1000 markOop unbiased_prototype = markOopDesc::prototype()->set_age(mark->age()); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
1001 obj->set_mark(unbiased_prototype); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
1002 } |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
1003 BasicLock* lock = mon_info->lock(); |
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
1004 ObjectSynchronizer::slow_enter(obj, lock, thread); |
0 | 1005 } |
83
d3cd40645d0d
6681646: Relocking of a scalar replaced object during deoptimization is broken
kvn
parents:
44
diff
changeset
|
1006 assert(mon_info->owner()->is_locked(), "object must be locked now"); |
0 | 1007 } |
1008 } | |
1009 | |
1010 | |
1011 #ifndef PRODUCT | |
1012 // print information about reallocated objects | |
1013 void Deoptimization::print_objects(GrowableArray<ScopeValue*>* objects) { | |
1014 fieldDescriptor fd; | |
1015 | |
1016 for (int i = 0; i < objects->length(); i++) { | |
1017 ObjectValue* sv = (ObjectValue*) objects->at(i); | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1018 KlassHandle k(java_lang_Class::as_Klass(sv->klass()->as_ConstantOopReadValue()->value()())); |
0 | 1019 Handle obj = sv->value(); |
1020 | |
1021 tty->print(" object <" INTPTR_FORMAT "> of type ", sv->value()()); | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1022 k->print_value(); |
0 | 1023 tty->print(" allocated (%d bytes)", obj->size() * HeapWordSize); |
1024 tty->cr(); | |
1025 | |
1026 if (Verbose) { | |
1027 k->oop_print_on(obj(), tty); | |
1028 } | |
1029 } | |
1030 } | |
1031 #endif | |
4978
99d3d8a72252
More ifdef GRAAL usage.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
4970
diff
changeset
|
1032 #endif // COMPILER2 || GRAAL |
0 | 1033 |
1034 vframeArray* Deoptimization::create_vframeArray(JavaThread* thread, frame fr, RegisterMap *reg_map, GrowableArray<compiledVFrame*>* chunk) { | |
4872
aa3d708d67c4
7141200: log some interesting information in ring buffers for crashes
never
parents:
4777
diff
changeset
|
1035 Events::log(thread, "DEOPT PACKING pc=" INTPTR_FORMAT " sp=" INTPTR_FORMAT, fr.pc(), fr.sp()); |
0 | 1036 |
1037 #ifndef PRODUCT | |
4668
3dbcd1013cc8
added flag PrintDeoptimizationDetails
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4661
diff
changeset
|
1038 if (PrintDeoptimizationDetails) { |
0 | 1039 ttyLocker ttyl; |
1040 tty->print("DEOPT PACKING thread " INTPTR_FORMAT " ", thread); | |
1041 fr.print_on(tty); | |
1042 tty->print_cr(" Virtual frames (innermost first):"); | |
1043 for (int index = 0; index < chunk->length(); index++) { | |
1044 compiledVFrame* vf = chunk->at(index); | |
1045 tty->print(" %2d - ", index); | |
1046 vf->print_value(); | |
1047 int bci = chunk->at(index)->raw_bci(); | |
1048 const char* code_name; | |
1049 if (bci == SynchronizationEntryBCI) { | |
1050 code_name = "sync entry"; | |
1051 } else { | |
2142 | 1052 Bytecodes::Code code = vf->method()->code_at(bci); |
0 | 1053 code_name = Bytecodes::name(code); |
1054 } | |
1055 tty->print(" - %s", code_name); | |
1056 tty->print_cr(" @ bci %d ", bci); | |
1057 if (Verbose) { | |
1058 vf->print(); | |
1059 tty->cr(); | |
1060 } | |
1061 } | |
1062 } | |
1063 #endif | |
1064 | |
1065 // Register map for next frame (used for stack crawl). We capture | |
1066 // the state of the deopt'ing frame's caller. Thus if we need to | |
1067 // stuff a C2I adapter we can properly fill in the callee-save | |
1068 // register locations. | |
1069 frame caller = fr.sender(reg_map); | |
1070 int frame_size = caller.sp() - fr.sp(); | |
1071 | |
1072 frame sender = caller; | |
1073 | |
1074 // Since the Java thread being deoptimized will eventually adjust it's own stack, | |
1075 // the vframeArray containing the unpacking information is allocated in the C heap. | |
1076 // For Compiler1, the caller of the deoptimized frame is saved for use by unpack_frames(). | |
1077 vframeArray* array = vframeArray::allocate(thread, frame_size, chunk, reg_map, sender, caller, fr); | |
1078 | |
1079 // Compare the vframeArray to the collected vframes | |
1080 assert(array->structural_compare(thread, chunk), "just checking"); | |
1081 | |
1082 #ifndef PRODUCT | |
4668
3dbcd1013cc8
added flag PrintDeoptimizationDetails
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4661
diff
changeset
|
1083 if (PrintDeoptimizationDetails) { |
0 | 1084 ttyLocker ttyl; |
1085 tty->print_cr(" Created vframeArray " INTPTR_FORMAT, array); | |
1086 } | |
1087 #endif // PRODUCT | |
1088 | |
1089 return array; | |
1090 } | |
1091 | |
1092 | |
1093 static void collect_monitors(compiledVFrame* cvf, GrowableArray<Handle>* objects_to_revoke) { | |
1094 GrowableArray<MonitorInfo*>* monitors = cvf->monitors(); | |
1095 for (int i = 0; i < monitors->length(); i++) { | |
1096 MonitorInfo* mon_info = monitors->at(i); | |
818
b109e761e927
6837472: com/sun/jdi/MonitorFrameInfo.java fails with AggressiveOpts in 6u14
kvn
parents:
196
diff
changeset
|
1097 if (!mon_info->eliminated() && mon_info->owner() != NULL) { |
0 | 1098 objects_to_revoke->append(Handle(mon_info->owner())); |
1099 } | |
1100 } | |
1101 } | |
1102 | |
1103 | |
1104 void Deoptimization::revoke_biases_of_monitors(JavaThread* thread, frame fr, RegisterMap* map) { | |
1105 if (!UseBiasedLocking) { | |
1106 return; | |
1107 } | |
1108 | |
1109 GrowableArray<Handle>* objects_to_revoke = new GrowableArray<Handle>(); | |
1110 | |
1111 // Unfortunately we don't have a RegisterMap available in most of | |
1112 // the places we want to call this routine so we need to walk the | |
1113 // stack again to update the register map. | |
1114 if (map == NULL || !map->update_map()) { | |
1115 StackFrameStream sfs(thread, true); | |
1116 bool found = false; | |
1117 while (!found && !sfs.is_done()) { | |
1118 frame* cur = sfs.current(); | |
1119 sfs.next(); | |
1120 found = cur->id() == fr.id(); | |
1121 } | |
1122 assert(found, "frame to be deoptimized not found on target thread's stack"); | |
1123 map = sfs.register_map(); | |
1124 } | |
1125 | |
1126 vframe* vf = vframe::new_vframe(&fr, map, thread); | |
1127 compiledVFrame* cvf = compiledVFrame::cast(vf); | |
1128 // Revoke monitors' biases in all scopes | |
1129 while (!cvf->is_top()) { | |
1130 collect_monitors(cvf, objects_to_revoke); | |
1131 cvf = compiledVFrame::cast(cvf->sender()); | |
1132 } | |
1133 collect_monitors(cvf, objects_to_revoke); | |
1134 | |
1135 if (SafepointSynchronize::is_at_safepoint()) { | |
1136 BiasedLocking::revoke_at_safepoint(objects_to_revoke); | |
1137 } else { | |
1138 BiasedLocking::revoke(objects_to_revoke); | |
1139 } | |
1140 } | |
1141 | |
1142 | |
1143 void Deoptimization::revoke_biases_of_monitors(CodeBlob* cb) { | |
1144 if (!UseBiasedLocking) { | |
1145 return; | |
1146 } | |
1147 | |
1148 assert(SafepointSynchronize::is_at_safepoint(), "must only be called from safepoint"); | |
1149 GrowableArray<Handle>* objects_to_revoke = new GrowableArray<Handle>(); | |
1150 for (JavaThread* jt = Threads::first(); jt != NULL ; jt = jt->next()) { | |
1151 if (jt->has_last_Java_frame()) { | |
1152 StackFrameStream sfs(jt, true); | |
1153 while (!sfs.is_done()) { | |
1154 frame* cur = sfs.current(); | |
1155 if (cb->contains(cur->pc())) { | |
1156 vframe* vf = vframe::new_vframe(cur, sfs.register_map(), jt); | |
1157 compiledVFrame* cvf = compiledVFrame::cast(vf); | |
1158 // Revoke monitors' biases in all scopes | |
1159 while (!cvf->is_top()) { | |
1160 collect_monitors(cvf, objects_to_revoke); | |
1161 cvf = compiledVFrame::cast(cvf->sender()); | |
1162 } | |
1163 collect_monitors(cvf, objects_to_revoke); | |
1164 } | |
1165 sfs.next(); | |
1166 } | |
1167 } | |
1168 } | |
1169 BiasedLocking::revoke_at_safepoint(objects_to_revoke); | |
1170 } | |
1171 | |
1172 | |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1173 void Deoptimization::deoptimize_single_frame(JavaThread* thread, frame fr, Deoptimization::DeoptReason reason) { |
0 | 1174 assert(fr.can_be_deoptimized(), "checking frame type"); |
1175 | |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1176 gather_statistics(reason, Action_none, Bytecodes::_illegal); |
0 | 1177 |
1178 // Patch the nmethod so that when execution returns to it we will | |
1179 // deopt the execution state and return to the interpreter. | |
1180 fr.deoptimize(thread); | |
1181 } | |
1182 | |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1183 void Deoptimization::deoptimize(JavaThread* thread, frame fr, RegisterMap *map, DeoptReason reason) { |
0 | 1184 // Deoptimize only if the frame comes from compile code. |
1185 // Do not deoptimize the frame which is already patched | |
1186 // during the execution of the loops below. | |
1187 if (!fr.is_compiled_frame() || fr.is_deoptimized_frame()) { | |
1188 return; | |
1189 } | |
1190 ResourceMark rm; | |
1191 DeoptimizationMarker dm; | |
1192 if (UseBiasedLocking) { | |
1193 revoke_biases_of_monitors(thread, fr, map); | |
1194 } | |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1195 deoptimize_single_frame(thread, fr, reason); |
0 | 1196 |
1197 } | |
1198 | |
1199 | |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1200 void Deoptimization::deoptimize_frame_internal(JavaThread* thread, intptr_t* id, DeoptReason reason) { |
1905
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1201 assert(thread == Thread::current() || SafepointSynchronize::is_at_safepoint(), |
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1202 "can only deoptimize other thread at a safepoint"); |
0 | 1203 // Compute frame and register map based on thread and sp. |
1204 RegisterMap reg_map(thread, UseBiasedLocking); | |
1205 frame fr = thread->last_frame(); | |
1206 while (fr.id() != id) { | |
1207 fr = fr.sender(®_map); | |
1208 } | |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1209 deoptimize(thread, fr, ®_map, reason); |
0 | 1210 } |
1211 | |
1212 | |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1213 void Deoptimization::deoptimize_frame(JavaThread* thread, intptr_t* id, DeoptReason reason) { |
1905
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1214 if (thread == Thread::current()) { |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1215 Deoptimization::deoptimize_frame_internal(thread, id, reason); |
1905
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1216 } else { |
5110
0ebca2e35ca5
more preparations for disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5038
diff
changeset
|
1217 VM_DeoptimizeFrame deopt(thread, id, reason); |
1905
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1218 VMThread::execute(&deopt); |
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1219 } |
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1220 } |
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1221 |
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1814
diff
changeset
|
1222 |
0 | 1223 // JVMTI PopFrame support |
1224 JRT_LEAF(void, Deoptimization::popframe_preserve_args(JavaThread* thread, int bytes_to_save, void* start_address)) | |
1225 { | |
1226 thread->popframe_preserve_args(in_ByteSize(bytes_to_save), start_address); | |
1227 } | |
1228 JRT_END | |
1229 | |
1230 | |
4978
99d3d8a72252
More ifdef GRAAL usage.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
4970
diff
changeset
|
1231 #if defined(COMPILER2) || defined(SHARK) || defined(GRAAL) |
0 | 1232 void Deoptimization::load_class_by_index(constantPoolHandle constant_pool, int index, TRAPS) { |
1233 // in case of an unresolved klass entry, load the class. | |
1234 if (constant_pool->tag_at(index).is_unresolved_klass()) { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1235 Klass* tk = constant_pool->klass_at(index, CHECK); |
0 | 1236 return; |
1237 } | |
1238 | |
1239 if (!constant_pool->tag_at(index).is_symbol()) return; | |
1240 | |
6940
18fb7da42534
8000725: NPG: method_holder() and pool_holder() and pool_holder field should be InstanceKlass
coleenp
parents:
6853
diff
changeset
|
1241 Handle class_loader (THREAD, constant_pool->pool_holder()->class_loader()); |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
1242 Symbol* symbol = constant_pool->symbol_at(index); |
0 | 1243 |
1244 // class name? | |
1245 if (symbol->byte_at(0) != '(') { | |
6940
18fb7da42534
8000725: NPG: method_holder() and pool_holder() and pool_holder field should be InstanceKlass
coleenp
parents:
6853
diff
changeset
|
1246 Handle protection_domain (THREAD, constant_pool->pool_holder()->protection_domain()); |
0 | 1247 SystemDictionary::resolve_or_null(symbol, class_loader, protection_domain, CHECK); |
1248 return; | |
1249 } | |
1250 | |
1251 // then it must be a signature! | |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
1252 ResourceMark rm(THREAD); |
0 | 1253 for (SignatureStream ss(symbol); !ss.is_done(); ss.next()) { |
1254 if (ss.is_object()) { | |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
1255 Symbol* class_name = ss.as_symbol(CHECK); |
6940
18fb7da42534
8000725: NPG: method_holder() and pool_holder() and pool_holder field should be InstanceKlass
coleenp
parents:
6853
diff
changeset
|
1256 Handle protection_domain (THREAD, constant_pool->pool_holder()->protection_domain()); |
0 | 1257 SystemDictionary::resolve_or_null(class_name, class_loader, protection_domain, CHECK); |
1258 } | |
1259 } | |
1260 } | |
1261 | |
1262 | |
1263 void Deoptimization::load_class_by_index(constantPoolHandle constant_pool, int index) { | |
1264 EXCEPTION_MARK; | |
1265 load_class_by_index(constant_pool, index, THREAD); | |
1266 if (HAS_PENDING_EXCEPTION) { | |
1267 // Exception happened during classloading. We ignore the exception here, since it | |
1268 // is going to be rethrown since the current activation is going to be deoptimzied and | |
1269 // the interpreter will re-execute the bytecode. | |
1270 CLEAR_PENDING_EXCEPTION; | |
1271 } | |
1272 } | |
1273 | |
1274 JRT_ENTRY(void, Deoptimization::uncommon_trap_inner(JavaThread* thread, jint trap_request)) { | |
1275 HandleMark hm; | |
1276 | |
1277 // uncommon_trap() is called at the beginning of the uncommon trap | |
1278 // handler. Note this fact before we start generating temporary frames | |
1279 // that can confuse an asynchronous stack walker. This counter is | |
1280 // decremented at the end of unpack_frames(). | |
1281 thread->inc_in_deopt_handler(); | |
1282 | |
1283 // We need to update the map if we have biased locking. | |
6428
6278ac5829ce
fix for deopt issue with -XX:-UseBiasedLocking (plus a cosmetic fix in graalCodeInstaller.cpp)
Lukas Stadler <lukas.stadler@jku.at>
parents:
6275
diff
changeset
|
1284 #ifdef GRAAL |
6278ac5829ce
fix for deopt issue with -XX:-UseBiasedLocking (plus a cosmetic fix in graalCodeInstaller.cpp)
Lukas Stadler <lukas.stadler@jku.at>
parents:
6275
diff
changeset
|
1285 // (lstadler) Graal might need to get an exception from the stack, which in turn requires the register map to be valid |
6278ac5829ce
fix for deopt issue with -XX:-UseBiasedLocking (plus a cosmetic fix in graalCodeInstaller.cpp)
Lukas Stadler <lukas.stadler@jku.at>
parents:
6275
diff
changeset
|
1286 RegisterMap reg_map(thread, true); |
6278ac5829ce
fix for deopt issue with -XX:-UseBiasedLocking (plus a cosmetic fix in graalCodeInstaller.cpp)
Lukas Stadler <lukas.stadler@jku.at>
parents:
6275
diff
changeset
|
1287 #else |
0 | 1288 RegisterMap reg_map(thread, UseBiasedLocking); |
6428
6278ac5829ce
fix for deopt issue with -XX:-UseBiasedLocking (plus a cosmetic fix in graalCodeInstaller.cpp)
Lukas Stadler <lukas.stadler@jku.at>
parents:
6275
diff
changeset
|
1289 #endif |
0 | 1290 frame stub_frame = thread->last_frame(); |
1291 frame fr = stub_frame.sender(®_map); | |
1292 // Make sure the calling nmethod is not getting deoptimized and removed | |
1293 // before we are done with it. | |
1294 nmethodLocker nl(fr.pc()); | |
1295 | |
4872
aa3d708d67c4
7141200: log some interesting information in ring buffers for crashes
never
parents:
4777
diff
changeset
|
1296 // Log a message |
7193
ee32440febeb
8001538: hs_err file does not list anymore compiled methods in compilation events
vlivanov
parents:
6940
diff
changeset
|
1297 Events::log(thread, "Uncommon trap: trap_request=" PTR32_FORMAT " fr.pc=" INTPTR_FORMAT, |
ee32440febeb
8001538: hs_err file does not list anymore compiled methods in compilation events
vlivanov
parents:
6940
diff
changeset
|
1298 trap_request, fr.pc()); |
4872
aa3d708d67c4
7141200: log some interesting information in ring buffers for crashes
never
parents:
4777
diff
changeset
|
1299 |
0 | 1300 { |
1301 ResourceMark rm; | |
1302 | |
1303 // Revoke biases of any monitors in the frame to ensure we can migrate them | |
1304 revoke_biases_of_monitors(thread, fr, ®_map); | |
1305 | |
1306 DeoptReason reason = trap_request_reason(trap_request); | |
1307 DeoptAction action = trap_request_action(trap_request); | |
1308 jint unloaded_class_index = trap_request_index(trap_request); // CP idx or -1 | |
1309 | |
1310 vframe* vf = vframe::new_vframe(&fr, ®_map, thread); | |
1311 compiledVFrame* cvf = compiledVFrame::cast(vf); | |
1312 | |
1313 nmethod* nm = cvf->code(); | |
1314 | |
1315 ScopeDesc* trap_scope = cvf->scope(); | |
3017
b4ba003eb11d
Fixed unnecessary node in the graph builder.
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2938
diff
changeset
|
1316 |
b4ba003eb11d
Fixed unnecessary node in the graph builder.
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2938
diff
changeset
|
1317 if (TraceDeoptimization) { |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
1318 tty->print_cr(" bci=%d pc=%d, relative_pc=%d, method=%s", trap_scope->bci(), fr.pc(), fr.pc() - nm->code_begin(), trap_scope->method()->name()->as_C_string()); |
3017
b4ba003eb11d
Fixed unnecessary node in the graph builder.
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
2938
diff
changeset
|
1319 } |
0 | 1320 |
1321 methodHandle trap_method = trap_scope->method(); | |
1322 int trap_bci = trap_scope->bci(); | |
8328
6b6cbd8b8914
Support deoptimizing before the entry to a synchronized method.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
8151
diff
changeset
|
1323 if (trap_bci == SynchronizationEntryBCI) { |
6b6cbd8b8914
Support deoptimizing before the entry to a synchronized method.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
8151
diff
changeset
|
1324 trap_bci = 0; |
6b6cbd8b8914
Support deoptimizing before the entry to a synchronized method.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
8151
diff
changeset
|
1325 Thread::current()->set_pending_monitorenter(true); |
6b6cbd8b8914
Support deoptimizing before the entry to a synchronized method.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
8151
diff
changeset
|
1326 } |
2142 | 1327 Bytecodes::Code trap_bc = trap_method->java_code_at(trap_bci); |
0 | 1328 |
3018
5857923e563c
Fixed an issue with frame states in exception dispatch chains (now we are correctly rethrowing the exception immediately at entering the interpreter).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3017
diff
changeset
|
1329 if (trap_scope->rethrow_exception()) { |
4668
3dbcd1013cc8
added flag PrintDeoptimizationDetails
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4661
diff
changeset
|
1330 if (PrintDeoptimizationDetails) { |
6948
e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
Doug Simon <doug.simon@oracle.com>
diff
changeset
|
1331 tty->print_cr("Exception to be rethrown in the interpreter for method %s::%s at bci %d", trap_method->method_holder()->name()->as_C_string(), trap_method->name()->as_C_string(), trap_bci); |
3019
77bb196828cb
Fixed an issue with accessing non-initialized static fields.
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3018
diff
changeset
|
1332 } |
3018
5857923e563c
Fixed an issue with frame states in exception dispatch chains (now we are correctly rethrowing the exception immediately at entering the interpreter).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3017
diff
changeset
|
1333 GrowableArray<ScopeValue*>* expressions = trap_scope->expressions(); |
3167
132aa6f2bbc0
Fixed rethrow exception frame state (again.. and this time added some useful assertions).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3153
diff
changeset
|
1334 guarantee(expressions != NULL, "must have exception to throw"); |
3018
5857923e563c
Fixed an issue with frame states in exception dispatch chains (now we are correctly rethrowing the exception immediately at entering the interpreter).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3017
diff
changeset
|
1335 ScopeValue* topOfStack = expressions->top(); |
8151
b8f261ba79c6
Minimize diff to plain HotSpot version.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
8124
diff
changeset
|
1336 Handle topOfStackObj = StackValue::create_stack_value(&fr, ®_map, topOfStack)->get_obj(); |
3018
5857923e563c
Fixed an issue with frame states in exception dispatch chains (now we are correctly rethrowing the exception immediately at entering the interpreter).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3017
diff
changeset
|
1337 THREAD->set_pending_exception(topOfStackObj(), NULL, 0); |
5857923e563c
Fixed an issue with frame states in exception dispatch chains (now we are correctly rethrowing the exception immediately at entering the interpreter).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3017
diff
changeset
|
1338 } |
5857923e563c
Fixed an issue with frame states in exception dispatch chains (now we are correctly rethrowing the exception immediately at entering the interpreter).
Thomas Wuerthinger <thomas@wuerthinger.net>
parents:
3017
diff
changeset
|
1339 |
0 | 1340 // Record this event in the histogram. |
1341 gather_statistics(reason, action, trap_bc); | |
1342 | |
1343 // Ensure that we can record deopt. history: | |
1344 bool create_if_missing = ProfileTraps; | |
1345 | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1346 MethodData* trap_mdo = |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1347 get_method_data(thread, trap_method, create_if_missing); |
0 | 1348 |
7193
ee32440febeb
8001538: hs_err file does not list anymore compiled methods in compilation events
vlivanov
parents:
6940
diff
changeset
|
1349 // Log a message |
ee32440febeb
8001538: hs_err file does not list anymore compiled methods in compilation events
vlivanov
parents:
6940
diff
changeset
|
1350 Events::log_deopt_message(thread, "Uncommon trap: reason=%s action=%s pc=" INTPTR_FORMAT " method=%s @ %d", |
ee32440febeb
8001538: hs_err file does not list anymore compiled methods in compilation events
vlivanov
parents:
6940
diff
changeset
|
1351 trap_reason_name(reason), trap_action_name(action), fr.pc(), |
ee32440febeb
8001538: hs_err file does not list anymore compiled methods in compilation events
vlivanov
parents:
6940
diff
changeset
|
1352 trap_method->name_and_sig_as_C_string(), trap_bci); |
ee32440febeb
8001538: hs_err file does not list anymore compiled methods in compilation events
vlivanov
parents:
6940
diff
changeset
|
1353 |
0 | 1354 // Print a bunch of diagnostics, if requested. |
1355 if (TraceDeoptimization || LogCompilation) { | |
1356 ResourceMark rm; | |
1357 ttyLocker ttyl; | |
1358 char buf[100]; | |
1359 if (xtty != NULL) { | |
1360 xtty->begin_head("uncommon_trap thread='" UINTX_FORMAT"' %s", | |
1361 os::current_thread_id(), | |
1362 format_trap_request(buf, sizeof(buf), trap_request)); | |
1363 nm->log_identity(xtty); | |
1364 } | |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
1365 Symbol* class_name = NULL; |
0 | 1366 bool unresolved = false; |
1367 if (unloaded_class_index >= 0) { | |
1368 constantPoolHandle constants (THREAD, trap_method->constants()); | |
1369 if (constants->tag_at(unloaded_class_index).is_unresolved_klass()) { | |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
1370 class_name = constants->klass_name_at(unloaded_class_index); |
0 | 1371 unresolved = true; |
1372 if (xtty != NULL) | |
1373 xtty->print(" unresolved='1'"); | |
1374 } else if (constants->tag_at(unloaded_class_index).is_symbol()) { | |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
1375 class_name = constants->symbol_at(unloaded_class_index); |
0 | 1376 } |
1377 if (xtty != NULL) | |
1378 xtty->name(class_name); | |
1379 } | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1380 if (xtty != NULL && trap_mdo != NULL) { |
0 | 1381 // Dump the relevant MDO state. |
1382 // This is the deopt count for the current reason, any previous | |
1383 // reasons or recompiles seen at this point. | |
1384 int dcnt = trap_mdo->trap_count(reason); | |
1385 if (dcnt != 0) | |
1386 xtty->print(" count='%d'", dcnt); | |
1387 ProfileData* pdata = trap_mdo->bci_to_data(trap_bci); | |
1388 int dos = (pdata == NULL)? 0: pdata->trap_state(); | |
1389 if (dos != 0) { | |
1390 xtty->print(" state='%s'", format_trap_state(buf, sizeof(buf), dos)); | |
1391 if (trap_state_is_recompiled(dos)) { | |
1392 int recnt2 = trap_mdo->overflow_recompile_count(); | |
1393 if (recnt2 != 0) | |
1394 xtty->print(" recompiles2='%d'", recnt2); | |
1395 } | |
1396 } | |
1397 } | |
1398 if (xtty != NULL) { | |
1399 xtty->stamp(); | |
1400 xtty->end_head(); | |
1401 } | |
1402 if (TraceDeoptimization) { // make noise on the tty | |
1403 tty->print("Uncommon trap occurred in"); | |
1404 nm->method()->print_short_name(tty); | |
6843 | 1405 tty->print(" (@" INTPTR_FORMAT ") thread=" UINTX_FORMAT " reason=%s action=%s unloaded_class_index=%d", |
0 | 1406 fr.pc(), |
6843 | 1407 os::current_thread_id(), |
0 | 1408 trap_reason_name(reason), |
1409 trap_action_name(action), | |
1410 unloaded_class_index); | |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2142
diff
changeset
|
1411 if (class_name != NULL) { |
0 | 1412 tty->print(unresolved ? " unresolved class: " : " symbol: "); |
1413 class_name->print_symbol_on(tty); | |
1414 } | |
1415 tty->cr(); | |
1416 } | |
1417 if (xtty != NULL) { | |
1418 // Log the precise location of the trap. | |
1419 for (ScopeDesc* sd = trap_scope; ; sd = sd->sender()) { | |
1420 xtty->begin_elem("jvms bci='%d'", sd->bci()); | |
1421 xtty->method(sd->method()); | |
1422 xtty->end_elem(); | |
1423 if (sd->is_top()) break; | |
1424 } | |
1425 xtty->tail("uncommon_trap"); | |
1426 } | |
1427 } | |
1428 // (End diagnostic printout.) | |
1429 | |
1430 // Load class if necessary | |
1431 if (unloaded_class_index >= 0) { | |
1432 constantPoolHandle constants(THREAD, trap_method->constants()); | |
1433 load_class_by_index(constants, unloaded_class_index); | |
1434 } | |
1435 | |
1436 // Flush the nmethod if necessary and desirable. | |
1437 // | |
1438 // We need to avoid situations where we are re-flushing the nmethod | |
1439 // because of a hot deoptimization site. Repeated flushes at the same | |
1440 // point need to be detected by the compiler and avoided. If the compiler | |
1441 // cannot avoid them (or has a bug and "refuses" to avoid them), this | |
1442 // module must take measures to avoid an infinite cycle of recompilation | |
1443 // and deoptimization. There are several such measures: | |
1444 // | |
1445 // 1. If a recompilation is ordered a second time at some site X | |
1446 // and for the same reason R, the action is adjusted to 'reinterpret', | |
1447 // to give the interpreter time to exercise the method more thoroughly. | |
1448 // If this happens, the method's overflow_recompile_count is incremented. | |
1449 // | |
1450 // 2. If the compiler fails to reduce the deoptimization rate, then | |
1451 // the method's overflow_recompile_count will begin to exceed the set | |
1452 // limit PerBytecodeRecompilationCutoff. If this happens, the action | |
1453 // is adjusted to 'make_not_compilable', and the method is abandoned | |
1454 // to the interpreter. This is a performance hit for hot methods, | |
1455 // but is better than a disastrous infinite cycle of recompilations. | |
1456 // (Actually, only the method containing the site X is abandoned.) | |
1457 // | |
1458 // 3. In parallel with the previous measures, if the total number of | |
1459 // recompilations of a method exceeds the much larger set limit | |
1460 // PerMethodRecompilationCutoff, the method is abandoned. | |
1461 // This should only happen if the method is very large and has | |
1462 // many "lukewarm" deoptimizations. The code which enforces this | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1463 // limit is elsewhere (class nmethod, class Method). |
0 | 1464 // |
1465 // Note that the per-BCI 'is_recompiled' bit gives the compiler one chance | |
1466 // to recompile at each bytecode independently of the per-BCI cutoff. | |
1467 // | |
1468 // The decision to update code is up to the compiler, and is encoded | |
1469 // in the Action_xxx code. If the compiler requests Action_none | |
1470 // no trap state is changed, no compiled code is changed, and the | |
1471 // computation suffers along in the interpreter. | |
1472 // | |
1473 // The other action codes specify various tactics for decompilation | |
1474 // and recompilation. Action_maybe_recompile is the loosest, and | |
1475 // allows the compiled code to stay around until enough traps are seen, | |
1476 // and until the compiler gets around to recompiling the trapping method. | |
1477 // | |
1478 // The other actions cause immediate removal of the present code. | |
1479 | |
1480 bool update_trap_state = true; | |
1481 bool make_not_entrant = false; | |
1482 bool make_not_compilable = false; | |
1783 | 1483 bool reprofile = false; |
0 | 1484 switch (action) { |
1485 case Action_none: | |
1486 // Keep the old code. | |
1487 update_trap_state = false; | |
1488 break; | |
1489 case Action_maybe_recompile: | |
1490 // Do not need to invalidate the present code, but we can | |
1491 // initiate another | |
1492 // Start compiler without (necessarily) invalidating the nmethod. | |
1493 // The system will tolerate the old code, but new code should be | |
1494 // generated when possible. | |
1495 break; | |
1496 case Action_reinterpret: | |
1497 // Go back into the interpreter for a while, and then consider | |
1498 // recompiling form scratch. | |
1499 make_not_entrant = true; | |
1500 // Reset invocation counter for outer most method. | |
1501 // This will allow the interpreter to exercise the bytecodes | |
1502 // for a while before recompiling. | |
1503 // By contrast, Action_make_not_entrant is immediate. | |
1504 // | |
1505 // Note that the compiler will track null_check, null_assert, | |
1506 // range_check, and class_check events and log them as if they | |
1507 // had been traps taken from compiled code. This will update | |
1508 // the MDO trap history so that the next compilation will | |
1509 // properly detect hot trap sites. | |
1783 | 1510 reprofile = true; |
0 | 1511 break; |
1512 case Action_make_not_entrant: | |
1513 // Request immediate recompilation, and get rid of the old code. | |
1514 // Make them not entrant, so next time they are called they get | |
1515 // recompiled. Unloaded classes are loaded now so recompile before next | |
1516 // time they are called. Same for uninitialized. The interpreter will | |
1517 // link the missing class, if any. | |
1518 make_not_entrant = true; | |
1519 break; | |
1520 case Action_make_not_compilable: | |
1521 // Give up on compiling this method at all. | |
1522 make_not_entrant = true; | |
1523 make_not_compilable = true; | |
1524 break; | |
1525 default: | |
1526 ShouldNotReachHere(); | |
1527 } | |
1528 | |
1529 // Setting +ProfileTraps fixes the following, on all platforms: | |
1530 // 4852688: ProfileInterpreter is off by default for ia64. The result is | |
1531 // infinite heroic-opt-uncommon-trap/deopt/recompile cycles, since the | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1532 // recompile relies on a MethodData* to record heroic opt failures. |
0 | 1533 |
1534 // Whether the interpreter is producing MDO data or not, we also need | |
1535 // to use the MDO to detect hot deoptimization points and control | |
1536 // aggressive optimization. | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1537 bool inc_recompile_count = false; |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1538 ProfileData* pdata = NULL; |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1539 if (ProfileTraps && update_trap_state && trap_mdo != NULL) { |
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1540 assert(trap_mdo == get_method_data(thread, trap_method, false), "sanity"); |
0 | 1541 uint this_trap_count = 0; |
1542 bool maybe_prior_trap = false; | |
1543 bool maybe_prior_recompile = false; | |
5114
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1544 pdata = query_update_method_data(trap_mdo, trap_bci, reason, true, |
0 | 1545 //outputs: |
1546 this_trap_count, | |
1547 maybe_prior_trap, | |
1548 maybe_prior_recompile); | |
1549 // Because the interpreter also counts null, div0, range, and class | |
1550 // checks, these traps from compiled code are double-counted. | |
1551 // This is harmless; it just means that the PerXTrapLimit values | |
1552 // are in effect a little smaller than they look. | |
1553 | |
1554 DeoptReason per_bc_reason = reason_recorded_per_bytecode_if_any(reason); | |
1555 if (per_bc_reason != Reason_none) { | |
1556 // Now take action based on the partially known per-BCI history. | |
1557 if (maybe_prior_trap | |
1558 && this_trap_count >= (uint)PerBytecodeTrapLimit) { | |
1559 // If there are too many traps at this BCI, force a recompile. | |
1560 // This will allow the compiler to see the limit overflow, and | |
1561 // take corrective action, if possible. The compiler generally | |
1562 // does not use the exact PerBytecodeTrapLimit value, but instead | |
1563 // changes its tactics if it sees any traps at all. This provides | |
1564 // a little hysteresis, delaying a recompile until a trap happens | |
1565 // several times. | |
1566 // | |
1567 // Actually, since there is only one bit of counter per BCI, | |
1568 // the possible per-BCI counts are {0,1,(per-method count)}. | |
1569 // This produces accurate results if in fact there is only | |
1570 // one hot trap site, but begins to get fuzzy if there are | |
1571 // many sites. For example, if there are ten sites each | |
1572 // trapping two or more times, they each get the blame for | |
1573 // all of their traps. | |
1574 make_not_entrant = true; | |
1575 } | |
1576 | |
1577 // Detect repeated recompilation at the same BCI, and enforce a limit. | |
1578 if (make_not_entrant && maybe_prior_recompile) { | |
1579 // More than one recompile at this point. | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1580 inc_recompile_count = maybe_prior_trap; |
0 | 1581 } |
1582 } else { | |
1583 // For reasons which are not recorded per-bytecode, we simply | |
1584 // force recompiles unconditionally. | |
1585 // (Note that PerMethodRecompilationCutoff is enforced elsewhere.) | |
1586 make_not_entrant = true; | |
1587 } | |
1588 | |
1589 // Go back to the compiler if there are too many traps in this method. | |
1590 if (this_trap_count >= (uint)PerMethodTrapLimit) { | |
1591 // If there are too many traps in this method, force a recompile. | |
1592 // This will allow the compiler to see the limit overflow, and | |
1593 // take corrective action, if possible. | |
1594 // (This condition is an unlikely backstop only, because the | |
1595 // PerBytecodeTrapLimit is more likely to take effect first, | |
1596 // if it is applicable.) | |
1597 make_not_entrant = true; | |
1598 } | |
1599 | |
1600 // Here's more hysteresis: If there has been a recompile at | |
1601 // this trap point already, run the method in the interpreter | |
1602 // for a while to exercise it more thoroughly. | |
1603 if (make_not_entrant && maybe_prior_recompile && maybe_prior_trap) { | |
1783 | 1604 reprofile = true; |
0 | 1605 } |
1606 | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1607 } |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1608 |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1609 // Take requested actions on the method: |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1610 |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1611 // Recompile |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1612 if (make_not_entrant) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1613 if (!nm->make_not_entrant()) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1614 return; // the call did not change nmethod's state |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1615 } |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1616 |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1617 if (pdata != NULL) { |
0 | 1618 // Record the recompilation event, if any. |
1619 int tstate0 = pdata->trap_state(); | |
1620 int tstate1 = trap_state_set_recompiled(tstate0, true); | |
1621 if (tstate1 != tstate0) | |
1622 pdata->set_trap_state(tstate1); | |
1623 } | |
1624 } | |
1625 | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1626 if (inc_recompile_count) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1627 trap_mdo->inc_overflow_recompile_count(); |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1628 if ((uint)trap_mdo->overflow_recompile_count() > |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1629 (uint)PerBytecodeRecompilationCutoff) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1630 // Give up on the method containing the bad BCI. |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1631 if (trap_method() == nm->method()) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1632 make_not_compilable = true; |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1633 } else { |
7998 | 1634 trap_method->set_not_compilable(CompLevel_full_optimization, true, "overflow_recompile_count > PerBytecodeRecompilationCutoff"); |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1635 // But give grace to the enclosing nm->method(). |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1636 } |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1637 } |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1638 } |
0 | 1639 |
1783 | 1640 // Reprofile |
1641 if (reprofile) { | |
1642 CompilationPolicy::policy()->reprofile(trap_scope, nm->is_osr_method()); | |
0 | 1643 } |
1644 | |
1645 // Give up compiling | |
1783 | 1646 if (make_not_compilable && !nm->method()->is_not_compilable(CompLevel_full_optimization)) { |
0 | 1647 assert(make_not_entrant, "consistent"); |
1783 | 1648 nm->method()->set_not_compilable(CompLevel_full_optimization); |
0 | 1649 } |
1650 | |
1651 } // Free marked resources | |
1652 | |
1653 } | |
1654 JRT_END | |
1655 | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1656 MethodData* |
0 | 1657 Deoptimization::get_method_data(JavaThread* thread, methodHandle m, |
1658 bool create_if_missing) { | |
1659 Thread* THREAD = thread; | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1660 MethodData* mdo = m()->method_data(); |
0 | 1661 if (mdo == NULL && create_if_missing && !HAS_PENDING_EXCEPTION) { |
1662 // Build an MDO. Ignore errors like OutOfMemory; | |
1663 // that simply means we won't have an MDO to update. | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1664 Method::build_interpreter_method_data(m, THREAD); |
0 | 1665 if (HAS_PENDING_EXCEPTION) { |
1666 assert((PENDING_EXCEPTION->is_a(SystemDictionary::OutOfMemoryError_klass())), "we expect only an OOM error here"); | |
1667 CLEAR_PENDING_EXCEPTION; | |
1668 } | |
1669 mdo = m()->method_data(); | |
1670 } | |
1671 return mdo; | |
1672 } | |
1673 | |
1674 ProfileData* | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1675 Deoptimization::query_update_method_data(MethodData* trap_mdo, |
0 | 1676 int trap_bci, |
1677 Deoptimization::DeoptReason reason, | |
5114
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1678 bool update_total_trap_count, |
0 | 1679 //outputs: |
1680 uint& ret_this_trap_count, | |
1681 bool& ret_maybe_prior_trap, | |
1682 bool& ret_maybe_prior_recompile) { | |
5114
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1683 bool maybe_prior_trap = false; |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1684 bool maybe_prior_recompile = false; |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1685 uint this_trap_count = 0; |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1686 if (update_total_trap_count) { |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1687 uint prior_trap_count = trap_mdo->trap_count(reason); |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1688 this_trap_count = trap_mdo->inc_trap_count(reason); |
0 | 1689 |
5114
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1690 // If the runtime cannot find a place to store trap history, |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1691 // it is estimated based on the general condition of the method. |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1692 // If the method has ever been recompiled, or has ever incurred |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1693 // a trap with the present reason , then this BCI is assumed |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1694 // (pessimistically) to be the culprit. |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1695 maybe_prior_trap = (prior_trap_count != 0); |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1696 maybe_prior_recompile = (trap_mdo->decompile_count() != 0); |
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1697 } |
0 | 1698 |
1699 // For reasons which are recorded per bytecode, we check per-BCI data. | |
5114
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1700 ProfileData* pdata = NULL; |
0 | 1701 DeoptReason per_bc_reason = reason_recorded_per_bytecode_if_any(reason); |
5121
34518fd74518
fixed fastdebug C++ issue
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5114
diff
changeset
|
1702 assert(per_bc_reason != Reason_none || update_total_trap_count, "must be"); |
0 | 1703 if (per_bc_reason != Reason_none) { |
1704 // Find the profile data for this BCI. If there isn't one, | |
1705 // try to allocate one from the MDO's set of spares. | |
1706 // This will let us detect a repeated trap at this point. | |
1707 pdata = trap_mdo->allocate_bci_to_data(trap_bci); | |
1708 | |
1709 if (pdata != NULL) { | |
1710 // Query the trap state of this profile datum. | |
1711 int tstate0 = pdata->trap_state(); | |
1712 if (!trap_state_has_reason(tstate0, per_bc_reason)) | |
1713 maybe_prior_trap = false; | |
1714 if (!trap_state_is_recompiled(tstate0)) | |
1715 maybe_prior_recompile = false; | |
1716 | |
1717 // Update the trap state of this profile datum. | |
1718 int tstate1 = tstate0; | |
1719 // Record the reason. | |
1720 tstate1 = trap_state_add_reason(tstate1, per_bc_reason); | |
1721 // Store the updated state on the MDO, for next time. | |
1722 if (tstate1 != tstate0) | |
1723 pdata->set_trap_state(tstate1); | |
1724 } else { | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1725 if (LogCompilation && xtty != NULL) { |
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1726 ttyLocker ttyl; |
0 | 1727 // Missing MDP? Leave a small complaint in the log. |
1728 xtty->elem("missing_mdp bci='%d'", trap_bci); | |
1206
87684f1a88b5
6614597: Performance variability in jvm2008 xml.validation
kvn
parents:
1204
diff
changeset
|
1729 } |
0 | 1730 } |
1731 } | |
1732 | |
1733 // Return results: | |
1734 ret_this_trap_count = this_trap_count; | |
1735 ret_maybe_prior_trap = maybe_prior_trap; | |
1736 ret_maybe_prior_recompile = maybe_prior_recompile; | |
1737 return pdata; | |
1738 } | |
1739 | |
1740 void | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
1741 Deoptimization::update_method_data_from_interpreter(MethodData* trap_mdo, int trap_bci, int reason) { |
0 | 1742 ResourceMark rm; |
1743 // Ignored outputs: | |
1744 uint ignore_this_trap_count; | |
1745 bool ignore_maybe_prior_trap; | |
1746 bool ignore_maybe_prior_recompile; | |
5114
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1747 // Graal uses the total counts to determine if deoptimizations are happening too frequently -> do not adjust total counts |
5130 | 1748 bool update_total_counts = GRAAL_ONLY(false) NOT_GRAAL(true); |
0 | 1749 query_update_method_data(trap_mdo, trap_bci, |
1750 (DeoptReason)reason, | |
5114
dad1ac9dba7d
finished first implementation of disabling runtime feedback selectively based on deoptimization history
Christian Haeubl <christian.haeubl@oracle.com>
parents:
5110
diff
changeset
|
1751 update_total_counts, |
0 | 1752 ignore_this_trap_count, |
1753 ignore_maybe_prior_trap, | |
1754 ignore_maybe_prior_recompile); | |
1755 } | |
1756 | |
1757 Deoptimization::UnrollBlock* Deoptimization::uncommon_trap(JavaThread* thread, jint trap_request) { | |
4674
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
1758 if (TraceDeoptimization) { |
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
1759 tty->print("Uncommon trap "); |
e1c053324210
changed TraceDeoptimization output
Christian Haeubl <christian.haeubl@oracle.com>
parents:
4668
diff
changeset
|
1760 } |
0 | 1761 // Still in Java no safepoints |
1762 { | |
1763 // This enters VM and may safepoint | |
1764 uncommon_trap_inner(thread, trap_request); | |
1765 } | |
1766 return fetch_unroll_info_helper(thread); | |
1767 } | |
1768 | |
1769 // Local derived constants. | |
1770 // Further breakdown of DataLayout::trap_state, as promised by DataLayout. | |
1771 const int DS_REASON_MASK = DataLayout::trap_mask >> 1; | |
1772 const int DS_RECOMPILE_BIT = DataLayout::trap_mask - DS_REASON_MASK; | |
1773 | |
1774 //---------------------------trap_state_reason--------------------------------- | |
1775 Deoptimization::DeoptReason | |
1776 Deoptimization::trap_state_reason(int trap_state) { | |
1777 // This assert provides the link between the width of DataLayout::trap_bits | |
1778 // and the encoding of "recorded" reasons. It ensures there are enough | |
1779 // bits to store all needed reasons in the per-BCI MDO profile. | |
1780 assert(DS_REASON_MASK >= Reason_RECORDED_LIMIT, "enough bits"); | |
1781 int recompile_bit = (trap_state & DS_RECOMPILE_BIT); | |
1782 trap_state -= recompile_bit; | |
1783 if (trap_state == DS_REASON_MASK) { | |
1784 return Reason_many; | |
1785 } else { | |
1786 assert((int)Reason_none == 0, "state=0 => Reason_none"); | |
1787 return (DeoptReason)trap_state; | |
1788 } | |
1789 } | |
1790 //-------------------------trap_state_has_reason------------------------------- | |
1791 int Deoptimization::trap_state_has_reason(int trap_state, int reason) { | |
1792 assert(reason_is_recorded_per_bytecode((DeoptReason)reason), "valid reason"); | |
1793 assert(DS_REASON_MASK >= Reason_RECORDED_LIMIT, "enough bits"); | |
1794 int recompile_bit = (trap_state & DS_RECOMPILE_BIT); | |
1795 trap_state -= recompile_bit; | |
1796 if (trap_state == DS_REASON_MASK) { | |
1797 return -1; // true, unspecifically (bottom of state lattice) | |
1798 } else if (trap_state == reason) { | |
1799 return 1; // true, definitely | |
1800 } else if (trap_state == 0) { | |
1801 return 0; // false, definitely (top of state lattice) | |
1802 } else { | |
1803 return 0; // false, definitely | |
1804 } | |
1805 } | |
1806 //-------------------------trap_state_add_reason------------------------------- | |
1807 int Deoptimization::trap_state_add_reason(int trap_state, int reason) { | |
1808 assert(reason_is_recorded_per_bytecode((DeoptReason)reason) || reason == Reason_many, "valid reason"); | |
1809 int recompile_bit = (trap_state & DS_RECOMPILE_BIT); | |
1810 trap_state -= recompile_bit; | |
1811 if (trap_state == DS_REASON_MASK) { | |
1812 return trap_state + recompile_bit; // already at state lattice bottom | |
1813 } else if (trap_state == reason) { | |
1814 return trap_state + recompile_bit; // the condition is already true | |
1815 } else if (trap_state == 0) { | |
1816 return reason + recompile_bit; // no condition has yet been true | |
1817 } else { | |
1818 return DS_REASON_MASK + recompile_bit; // fall to state lattice bottom | |
1819 } | |
1820 } | |
1821 //-----------------------trap_state_is_recompiled------------------------------ | |
1822 bool Deoptimization::trap_state_is_recompiled(int trap_state) { | |
1823 return (trap_state & DS_RECOMPILE_BIT) != 0; | |
1824 } | |
1825 //-----------------------trap_state_set_recompiled----------------------------- | |
1826 int Deoptimization::trap_state_set_recompiled(int trap_state, bool z) { | |
1827 if (z) return trap_state | DS_RECOMPILE_BIT; | |
1828 else return trap_state & ~DS_RECOMPILE_BIT; | |
1829 } | |
1830 //---------------------------format_trap_state--------------------------------- | |
1831 // This is used for debugging and diagnostics, including hotspot.log output. | |
1832 const char* Deoptimization::format_trap_state(char* buf, size_t buflen, | |
1833 int trap_state) { | |
1834 DeoptReason reason = trap_state_reason(trap_state); | |
1835 bool recomp_flag = trap_state_is_recompiled(trap_state); | |
1836 // Re-encode the state from its decoded components. | |
1837 int decoded_state = 0; | |
1838 if (reason_is_recorded_per_bytecode(reason) || reason == Reason_many) | |
1839 decoded_state = trap_state_add_reason(decoded_state, reason); | |
1840 if (recomp_flag) | |
1841 decoded_state = trap_state_set_recompiled(decoded_state, recomp_flag); | |
1842 // If the state re-encodes properly, format it symbolically. | |
1843 // Because this routine is used for debugging and diagnostics, | |
1844 // be robust even if the state is a strange value. | |
1845 size_t len; | |
1846 if (decoded_state != trap_state) { | |
1847 // Random buggy state that doesn't decode?? | |
1848 len = jio_snprintf(buf, buflen, "#%d", trap_state); | |
1849 } else { | |
1850 len = jio_snprintf(buf, buflen, "%s%s", | |
1851 trap_reason_name(reason), | |
1852 recomp_flag ? " recompiled" : ""); | |
1853 } | |
1854 if (len >= buflen) | |
1855 buf[buflen-1] = '\0'; | |
1856 return buf; | |
1857 } | |
1858 | |
1859 | |
1860 //--------------------------------statics-------------------------------------- | |
1861 Deoptimization::DeoptAction Deoptimization::_unloaded_action | |
1862 = Deoptimization::Action_reinterpret; | |
1863 const char* Deoptimization::_trap_reason_name[Reason_LIMIT] = { | |
1864 // Note: Keep this in sync. with enum DeoptReason. | |
1865 "none", | |
1866 "null_check", | |
7154
5d0bb7d52783
changes to support Graal co-existing with the other HotSpot compiler(s) and being used for explicit compilation requests and code installation via the Graal API
Doug Simon <doug.simon@oracle.com>
parents:
7137
diff
changeset
|
1867 "null_assert" GRAAL_ONLY("|unreached0"), |
0 | 1868 "range_check", |
1869 "class_check", | |
1870 "array_check", | |
7154
5d0bb7d52783
changes to support Graal co-existing with the other HotSpot compiler(s) and being used for explicit compilation requests and code installation via the Graal API
Doug Simon <doug.simon@oracle.com>
parents:
7137
diff
changeset
|
1871 "intrinsic" GRAAL_ONLY("|type_checked_inlining"), |
5d0bb7d52783
changes to support Graal co-existing with the other HotSpot compiler(s) and being used for explicit compilation requests and code installation via the Graal API
Doug Simon <doug.simon@oracle.com>
parents:
7137
diff
changeset
|
1872 "bimorphic" GRAAL_ONLY("|optimized_type_check"), |
0 | 1873 "unloaded", |
7154
5d0bb7d52783
changes to support Graal co-existing with the other HotSpot compiler(s) and being used for explicit compilation requests and code installation via the Graal API
Doug Simon <doug.simon@oracle.com>
parents:
7137
diff
changeset
|
1874 "uninitialized" GRAAL_ONLY("|unresolved"), |
0 | 1875 "unreached", |
7154
5d0bb7d52783
changes to support Graal co-existing with the other HotSpot compiler(s) and being used for explicit compilation requests and code installation via the Graal API
Doug Simon <doug.simon@oracle.com>
parents:
7137
diff
changeset
|
1876 "unhandled" GRAAL_ONLY("|not_compiled_exception_handler"), |
0 | 1877 "constraint", |
1878 "div0_check", | |
7154
5d0bb7d52783
changes to support Graal co-existing with the other HotSpot compiler(s) and being used for explicit compilation requests and code installation via the Graal API
Doug Simon <doug.simon@oracle.com>
parents:
7137
diff
changeset
|
1879 "age" GRAAL_ONLY("|jsr_mismatch"), |
3345 | 1880 "predicate", |
1881 "loop_limit_check" | |
0 | 1882 }; |
1883 const char* Deoptimization::_trap_action_name[Action_LIMIT] = { | |
1884 // Note: Keep this in sync. with enum DeoptAction. | |
1885 "none", | |
1886 "maybe_recompile", | |
1887 "reinterpret", | |
1888 "make_not_entrant", | |
1889 "make_not_compilable" | |
1890 }; | |
1891 | |
1892 const char* Deoptimization::trap_reason_name(int reason) { | |
1893 if (reason == Reason_many) return "many"; | |
1894 if ((uint)reason < Reason_LIMIT) | |
1895 return _trap_reason_name[reason]; | |
1896 static char buf[20]; | |
1897 sprintf(buf, "reason%d", reason); | |
1898 return buf; | |
1899 } | |
1900 const char* Deoptimization::trap_action_name(int action) { | |
1901 if ((uint)action < Action_LIMIT) | |
1902 return _trap_action_name[action]; | |
1903 static char buf[20]; | |
1904 sprintf(buf, "action%d", action); | |
1905 return buf; | |
1906 } | |
1907 | |
1908 // This is used for debugging and diagnostics, including hotspot.log output. | |
1909 const char* Deoptimization::format_trap_request(char* buf, size_t buflen, | |
1910 int trap_request) { | |
1911 jint unloaded_class_index = trap_request_index(trap_request); | |
1912 const char* reason = trap_reason_name(trap_request_reason(trap_request)); | |
1913 const char* action = trap_action_name(trap_request_action(trap_request)); | |
1914 size_t len; | |
1915 if (unloaded_class_index < 0) { | |
1916 len = jio_snprintf(buf, buflen, "reason='%s' action='%s'", | |
1917 reason, action); | |
1918 } else { | |
1919 len = jio_snprintf(buf, buflen, "reason='%s' action='%s' index='%d'", | |
1920 reason, action, unloaded_class_index); | |
1921 } | |
1922 if (len >= buflen) | |
1923 buf[buflen-1] = '\0'; | |
1924 return buf; | |
1925 } | |
1926 | |
1927 juint Deoptimization::_deoptimization_hist | |
1928 [Deoptimization::Reason_LIMIT] | |
1929 [1 + Deoptimization::Action_LIMIT] | |
1930 [Deoptimization::BC_CASE_LIMIT] | |
1931 = {0}; | |
1932 | |
1933 enum { | |
1934 LSB_BITS = 8, | |
1935 LSB_MASK = right_n_bits(LSB_BITS) | |
1936 }; | |
1937 | |
1938 void Deoptimization::gather_statistics(DeoptReason reason, DeoptAction action, | |
1939 Bytecodes::Code bc) { | |
1940 assert(reason >= 0 && reason < Reason_LIMIT, "oob"); | |
1941 assert(action >= 0 && action < Action_LIMIT, "oob"); | |
1942 _deoptimization_hist[Reason_none][0][0] += 1; // total | |
1943 _deoptimization_hist[reason][0][0] += 1; // per-reason total | |
1944 juint* cases = _deoptimization_hist[reason][1+action]; | |
1945 juint* bc_counter_addr = NULL; | |
1946 juint bc_counter = 0; | |
1947 // Look for an unused counter, or an exact match to this BC. | |
1948 if (bc != Bytecodes::_illegal) { | |
1949 for (int bc_case = 0; bc_case < BC_CASE_LIMIT; bc_case++) { | |
1950 juint* counter_addr = &cases[bc_case]; | |
1951 juint counter = *counter_addr; | |
1952 if ((counter == 0 && bc_counter_addr == NULL) | |
1953 || (Bytecodes::Code)(counter & LSB_MASK) == bc) { | |
1954 // this counter is either free or is already devoted to this BC | |
1955 bc_counter_addr = counter_addr; | |
1956 bc_counter = counter | bc; | |
1957 } | |
1958 } | |
1959 } | |
1960 if (bc_counter_addr == NULL) { | |
1961 // Overflow, or no given bytecode. | |
1962 bc_counter_addr = &cases[BC_CASE_LIMIT-1]; | |
1963 bc_counter = (*bc_counter_addr & ~LSB_MASK); // clear LSB | |
1964 } | |
1965 *bc_counter_addr = bc_counter + (1 << LSB_BITS); | |
1966 } | |
1967 | |
1968 jint Deoptimization::total_deoptimization_count() { | |
1969 return _deoptimization_hist[Reason_none][0][0]; | |
1970 } | |
1971 | |
1972 jint Deoptimization::deoptimization_count(DeoptReason reason) { | |
1973 assert(reason >= 0 && reason < Reason_LIMIT, "oob"); | |
1974 return _deoptimization_hist[reason][0][0]; | |
1975 } | |
1976 | |
1977 void Deoptimization::print_statistics() { | |
1978 juint total = total_deoptimization_count(); | |
1979 juint account = total; | |
1980 if (total != 0) { | |
1981 ttyLocker ttyl; | |
1982 if (xtty != NULL) xtty->head("statistics type='deoptimization'"); | |
1983 tty->print_cr("Deoptimization traps recorded:"); | |
1984 #define PRINT_STAT_LINE(name, r) \ | |
1985 tty->print_cr(" %4d (%4.1f%%) %s", (int)(r), ((r) * 100.0) / total, name); | |
1986 PRINT_STAT_LINE("total", total); | |
1987 // For each non-zero entry in the histogram, print the reason, | |
1988 // the action, and (if specifically known) the type of bytecode. | |
1989 for (int reason = 0; reason < Reason_LIMIT; reason++) { | |
1990 for (int action = 0; action < Action_LIMIT; action++) { | |
1991 juint* cases = _deoptimization_hist[reason][1+action]; | |
1992 for (int bc_case = 0; bc_case < BC_CASE_LIMIT; bc_case++) { | |
1993 juint counter = cases[bc_case]; | |
1994 if (counter != 0) { | |
1995 char name[1*K]; | |
1996 Bytecodes::Code bc = (Bytecodes::Code)(counter & LSB_MASK); | |
1997 if (bc_case == BC_CASE_LIMIT && (int)bc == 0) | |
1998 bc = Bytecodes::_illegal; | |
1999 sprintf(name, "%s/%s/%s", | |
2000 trap_reason_name(reason), | |
2001 trap_action_name(action), | |
2002 Bytecodes::is_defined(bc)? Bytecodes::name(bc): "other"); | |
2003 juint r = counter >> LSB_BITS; | |
2004 tty->print_cr(" %40s: " UINT32_FORMAT " (%.1f%%)", name, r, (r * 100.0) / total); | |
2005 account -= r; | |
2006 } | |
2007 } | |
2008 } | |
2009 } | |
2010 if (account != 0) { | |
2011 PRINT_STAT_LINE("unaccounted", account); | |
2012 } | |
2013 #undef PRINT_STAT_LINE | |
2014 if (xtty != NULL) xtty->tail("statistics"); | |
2015 } | |
2016 } | |
4978
99d3d8a72252
More ifdef GRAAL usage.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
4970
diff
changeset
|
2017 #else // COMPILER2 || SHARK || GRAAL |
0 | 2018 |
2019 | |
2020 // Stubs for C1 only system. | |
2021 bool Deoptimization::trap_state_is_recompiled(int trap_state) { | |
2022 return false; | |
2023 } | |
2024 | |
2025 const char* Deoptimization::trap_reason_name(int reason) { | |
2026 return "unknown"; | |
2027 } | |
2028 | |
2029 void Deoptimization::print_statistics() { | |
2030 // no output | |
2031 } | |
2032 | |
2033 void | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6266
diff
changeset
|
2034 Deoptimization::update_method_data_from_interpreter(MethodData* trap_mdo, int trap_bci, int reason) { |
0 | 2035 // no udpate |
2036 } | |
2037 | |
2038 int Deoptimization::trap_state_has_reason(int trap_state, int reason) { | |
2039 return 0; | |
2040 } | |
2041 | |
2042 void Deoptimization::gather_statistics(DeoptReason reason, DeoptAction action, | |
2043 Bytecodes::Code bc) { | |
2044 // no update | |
2045 } | |
2046 | |
2047 const char* Deoptimization::format_trap_state(char* buf, size_t buflen, | |
2048 int trap_state) { | |
2049 jio_snprintf(buf, buflen, "#%d", trap_state); | |
2050 return buf; | |
2051 } | |
2052 | |
4978
99d3d8a72252
More ifdef GRAAL usage.
Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
parents:
4970
diff
changeset
|
2053 #endif // COMPILER2 || SHARK || GRAAL |