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