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