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