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