Mon, 18 Jun 2012 12:29:21 -0700
7176856: add the JRE name to the error log
Reviewed-by: coleenp, jrose, kvn, twisti
Contributed-by: Krystal Mok <sajia@taobao.com>
duke@435 | 1 | /* |
trims@2708 | 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 | #ifndef SHARE_VM_RUNTIME_DEOPTIMIZATION_HPP |
stefank@2314 | 26 | #define SHARE_VM_RUNTIME_DEOPTIMIZATION_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "memory/allocation.hpp" |
stefank@2314 | 29 | #include "runtime/frame.inline.hpp" |
stefank@2314 | 30 | |
duke@435 | 31 | class ProfileData; |
duke@435 | 32 | class vframeArray; |
duke@435 | 33 | class MonitorValue; |
duke@435 | 34 | class ObjectValue; |
duke@435 | 35 | |
duke@435 | 36 | class Deoptimization : AllStatic { |
never@3138 | 37 | friend class VMStructs; |
never@3138 | 38 | |
duke@435 | 39 | public: |
duke@435 | 40 | // What condition caused the deoptimization? |
duke@435 | 41 | enum DeoptReason { |
duke@435 | 42 | Reason_many = -1, // indicates presence of several reasons |
duke@435 | 43 | Reason_none = 0, // indicates absence of a relevant deopt. |
kvn@1641 | 44 | // Next 7 reasons are recorded per bytecode in DataLayout::trap_bits |
duke@435 | 45 | Reason_null_check, // saw unexpected null or zero divisor (@bci) |
duke@435 | 46 | Reason_null_assert, // saw unexpected non-null or non-zero (@bci) |
duke@435 | 47 | Reason_range_check, // saw unexpected array index (@bci) |
duke@435 | 48 | Reason_class_check, // saw unexpected object class (@bci) |
duke@435 | 49 | Reason_array_check, // saw unexpected array class (aastore @bci) |
duke@435 | 50 | Reason_intrinsic, // saw unexpected operand to intrinsic (@bci) |
kvn@1641 | 51 | Reason_bimorphic, // saw unexpected object class in bimorphic inlining (@bci) |
kvn@1641 | 52 | |
duke@435 | 53 | Reason_unloaded, // unloaded class or constant pool entry |
duke@435 | 54 | Reason_uninitialized, // bad class state (uninitialized) |
duke@435 | 55 | Reason_unreached, // code is not reached, compiler |
duke@435 | 56 | Reason_unhandled, // arbitrary compiler limitation |
duke@435 | 57 | Reason_constraint, // arbitrary runtime constraint violated |
duke@435 | 58 | Reason_div0_check, // a null_check due to division by zero |
duke@435 | 59 | Reason_age, // nmethod too old; tier threshold reached |
cfang@1607 | 60 | Reason_predicate, // compiler generated predicate failed |
kvn@2877 | 61 | Reason_loop_limit_check, // compiler generated loop limits check failed |
duke@435 | 62 | Reason_LIMIT, |
duke@435 | 63 | // Note: Keep this enum in sync. with _trap_reason_name. |
kvn@1641 | 64 | Reason_RECORDED_LIMIT = Reason_bimorphic // some are not recorded per bc |
duke@435 | 65 | // Note: Reason_RECORDED_LIMIT should be < 8 to fit into 3 bits of |
duke@435 | 66 | // DataLayout::trap_bits. This dependency is enforced indirectly |
duke@435 | 67 | // via asserts, to avoid excessive direct header-to-header dependencies. |
duke@435 | 68 | // See Deoptimization::trap_state_reason and class DataLayout. |
duke@435 | 69 | }; |
duke@435 | 70 | |
duke@435 | 71 | // What action must be taken by the runtime? |
duke@435 | 72 | enum DeoptAction { |
duke@435 | 73 | Action_none, // just interpret, do not invalidate nmethod |
duke@435 | 74 | Action_maybe_recompile, // recompile the nmethod; need not invalidate |
duke@435 | 75 | Action_reinterpret, // invalidate the nmethod, reset IC, maybe recompile |
duke@435 | 76 | Action_make_not_entrant, // invalidate the nmethod, recompile (probably) |
duke@435 | 77 | Action_make_not_compilable, // invalidate the nmethod and do not compile |
duke@435 | 78 | Action_LIMIT |
duke@435 | 79 | // Note: Keep this enum in sync. with _trap_action_name. |
duke@435 | 80 | }; |
duke@435 | 81 | |
duke@435 | 82 | enum { |
duke@435 | 83 | _action_bits = 3, |
kvn@2877 | 84 | _reason_bits = 5, |
duke@435 | 85 | _action_shift = 0, |
duke@435 | 86 | _reason_shift = _action_shift+_action_bits, |
duke@435 | 87 | BC_CASE_LIMIT = PRODUCT_ONLY(1) NOT_PRODUCT(4) // for _deoptimization_hist |
duke@435 | 88 | }; |
duke@435 | 89 | |
duke@435 | 90 | enum UnpackType { |
duke@435 | 91 | Unpack_deopt = 0, // normal deoptimization, use pc computed in unpack_vframe_on_stack |
duke@435 | 92 | Unpack_exception = 1, // exception is pending |
duke@435 | 93 | Unpack_uncommon_trap = 2, // redo last byte code (C2 only) |
duke@435 | 94 | Unpack_reexecute = 3 // reexecute bytecode (C1 only) |
duke@435 | 95 | }; |
duke@435 | 96 | |
duke@435 | 97 | // Checks all compiled methods. Invalid methods are deleted and |
duke@435 | 98 | // corresponding activations are deoptimized. |
duke@435 | 99 | static int deoptimize_dependents(); |
duke@435 | 100 | |
duke@435 | 101 | // Deoptimizes a frame lazily. nmethod gets patched deopt happens on return to the frame |
duke@435 | 102 | static void deoptimize(JavaThread* thread, frame fr, RegisterMap *reg_map); |
duke@435 | 103 | |
duke@435 | 104 | private: |
duke@435 | 105 | // Does the actual work for deoptimizing a single frame |
duke@435 | 106 | static void deoptimize_single_frame(JavaThread* thread, frame fr); |
duke@435 | 107 | |
duke@435 | 108 | // Helper function to revoke biases of all monitors in frame if UseBiasedLocking |
duke@435 | 109 | // is enabled |
duke@435 | 110 | static void revoke_biases_of_monitors(JavaThread* thread, frame fr, RegisterMap* map); |
duke@435 | 111 | // Helper function to revoke biases of all monitors in frames |
duke@435 | 112 | // executing in a particular CodeBlob if UseBiasedLocking is enabled |
duke@435 | 113 | static void revoke_biases_of_monitors(CodeBlob* cb); |
duke@435 | 114 | |
duke@435 | 115 | #ifdef COMPILER2 |
duke@435 | 116 | // Support for restoring non-escaping objects |
duke@435 | 117 | static bool realloc_objects(JavaThread* thread, frame* fr, GrowableArray<ScopeValue*>* objects, TRAPS); |
duke@435 | 118 | static void reassign_type_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, typeArrayOop obj, BasicType type); |
duke@435 | 119 | static void reassign_object_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, objArrayOop obj); |
duke@435 | 120 | static void reassign_fields(frame* fr, RegisterMap* reg_map, GrowableArray<ScopeValue*>* objects); |
kvn@518 | 121 | static void relock_objects(GrowableArray<MonitorInfo*>* monitors, JavaThread* thread); |
duke@435 | 122 | NOT_PRODUCT(static void print_objects(GrowableArray<ScopeValue*>* objects);) |
duke@435 | 123 | #endif // COMPILER2 |
duke@435 | 124 | |
duke@435 | 125 | public: |
duke@435 | 126 | static vframeArray* create_vframeArray(JavaThread* thread, frame fr, RegisterMap *reg_map, GrowableArray<compiledVFrame*>* chunk); |
duke@435 | 127 | |
duke@435 | 128 | // Interface used for unpacking deoptimized frames |
duke@435 | 129 | |
duke@435 | 130 | // UnrollBlock is returned by fetch_unroll_info() to the deoptimization handler (blob). |
duke@435 | 131 | // This is only a CheapObj to ease debugging after a deopt failure |
duke@435 | 132 | class UnrollBlock : public CHeapObj { |
duke@435 | 133 | private: |
duke@435 | 134 | int _size_of_deoptimized_frame; // Size, in bytes, of current deoptimized frame |
duke@435 | 135 | int _caller_adjustment; // Adjustment, in bytes, to caller's SP by initial interpreted frame |
duke@435 | 136 | int _number_of_frames; // Number frames to unroll |
duke@435 | 137 | int _total_frame_sizes; // Total of number*sizes frames |
duke@435 | 138 | intptr_t* _frame_sizes; // Array of frame sizes, in bytes, for unrolling the stack |
duke@435 | 139 | address* _frame_pcs; // Array of frame pc's, in bytes, for unrolling the stack |
duke@435 | 140 | intptr_t* _register_block; // Block for storing callee-saved registers. |
duke@435 | 141 | BasicType _return_type; // Tells if we have to restore double or long return value |
bdelsart@3130 | 142 | intptr_t _initial_info; // Platform dependent data for the sender frame (was FP on x86) |
never@2901 | 143 | int _caller_actual_parameters; // The number of actual arguments at the |
never@2901 | 144 | // interpreted caller of the deoptimized frame |
never@2901 | 145 | |
duke@435 | 146 | // The following fields are used as temps during the unpacking phase |
duke@435 | 147 | // (which is tight on registers, especially on x86). They really ought |
duke@435 | 148 | // to be PD variables but that involves moving this class into its own |
duke@435 | 149 | // file to use the pd include mechanism. Maybe in a later cleanup ... |
duke@435 | 150 | intptr_t _counter_temp; // SHOULD BE PD VARIABLE (x86 frame count temp) |
duke@435 | 151 | intptr_t _unpack_kind; // SHOULD BE PD VARIABLE (x86 unpack kind) |
duke@435 | 152 | intptr_t _sender_sp_temp; // SHOULD BE PD VARIABLE (x86 sender_sp) |
duke@435 | 153 | public: |
duke@435 | 154 | // Constructor |
duke@435 | 155 | UnrollBlock(int size_of_deoptimized_frame, |
duke@435 | 156 | int caller_adjustment, |
never@2901 | 157 | int caller_actual_parameters, |
duke@435 | 158 | int number_of_frames, |
duke@435 | 159 | intptr_t* frame_sizes, |
duke@435 | 160 | address* frames_pcs, |
duke@435 | 161 | BasicType return_type); |
duke@435 | 162 | ~UnrollBlock(); |
duke@435 | 163 | |
duke@435 | 164 | // Returns where a register is located. |
duke@435 | 165 | intptr_t* value_addr_at(int register_number) const; |
duke@435 | 166 | |
duke@435 | 167 | // Accessors |
duke@435 | 168 | intptr_t* frame_sizes() const { return _frame_sizes; } |
duke@435 | 169 | int number_of_frames() const { return _number_of_frames; } |
duke@435 | 170 | address* frame_pcs() const { return _frame_pcs ; } |
duke@435 | 171 | |
duke@435 | 172 | // Returns the total size of frames |
duke@435 | 173 | int size_of_frames() const; |
duke@435 | 174 | |
bdelsart@3130 | 175 | void set_initial_info(intptr_t info) { _initial_info = info; } |
bdelsart@2620 | 176 | |
never@2901 | 177 | int caller_actual_parameters() const { return _caller_actual_parameters; } |
never@2901 | 178 | |
duke@435 | 179 | // Accessors used by the code generator for the unpack stub. |
duke@435 | 180 | static int size_of_deoptimized_frame_offset_in_bytes() { return offset_of(UnrollBlock, _size_of_deoptimized_frame); } |
duke@435 | 181 | static int caller_adjustment_offset_in_bytes() { return offset_of(UnrollBlock, _caller_adjustment); } |
duke@435 | 182 | static int number_of_frames_offset_in_bytes() { return offset_of(UnrollBlock, _number_of_frames); } |
duke@435 | 183 | static int frame_sizes_offset_in_bytes() { return offset_of(UnrollBlock, _frame_sizes); } |
duke@435 | 184 | static int total_frame_sizes_offset_in_bytes() { return offset_of(UnrollBlock, _total_frame_sizes); } |
duke@435 | 185 | static int frame_pcs_offset_in_bytes() { return offset_of(UnrollBlock, _frame_pcs); } |
duke@435 | 186 | static int register_block_offset_in_bytes() { return offset_of(UnrollBlock, _register_block); } |
duke@435 | 187 | static int return_type_offset_in_bytes() { return offset_of(UnrollBlock, _return_type); } |
duke@435 | 188 | static int counter_temp_offset_in_bytes() { return offset_of(UnrollBlock, _counter_temp); } |
bdelsart@3130 | 189 | static int initial_info_offset_in_bytes() { return offset_of(UnrollBlock, _initial_info); } |
duke@435 | 190 | static int unpack_kind_offset_in_bytes() { return offset_of(UnrollBlock, _unpack_kind); } |
duke@435 | 191 | static int sender_sp_temp_offset_in_bytes() { return offset_of(UnrollBlock, _sender_sp_temp); } |
duke@435 | 192 | |
duke@435 | 193 | BasicType return_type() const { return _return_type; } |
duke@435 | 194 | void print(); |
duke@435 | 195 | }; |
duke@435 | 196 | |
duke@435 | 197 | //** Returns an UnrollBlock continuing information |
duke@435 | 198 | // how to make room for the resulting interpreter frames. |
duke@435 | 199 | // Called by assembly stub after execution has returned to |
duke@435 | 200 | // deoptimized frame. |
duke@435 | 201 | // @argument thread. Thread where stub_frame resides. |
duke@435 | 202 | // @see OptoRuntime::deoptimization_fetch_unroll_info_C |
duke@435 | 203 | static UnrollBlock* fetch_unroll_info(JavaThread* thread); |
duke@435 | 204 | |
duke@435 | 205 | //** Unpacks vframeArray onto execution stack |
duke@435 | 206 | // Called by assembly stub after execution has returned to |
duke@435 | 207 | // deoptimized frame and after the stack unrolling. |
duke@435 | 208 | // @argument thread. Thread where stub_frame resides. |
duke@435 | 209 | // @argument exec_mode. Determines how execution should be continuted in top frame. |
duke@435 | 210 | // 0 means continue after current byte code |
duke@435 | 211 | // 1 means exception has happened, handle exception |
duke@435 | 212 | // 2 means reexecute current bytecode (for uncommon traps). |
duke@435 | 213 | // @see OptoRuntime::deoptimization_unpack_frames_C |
duke@435 | 214 | // Return BasicType of call return type, if any |
duke@435 | 215 | static BasicType unpack_frames(JavaThread* thread, int exec_mode); |
duke@435 | 216 | |
duke@435 | 217 | // Cleans up deoptimization bits on thread after unpacking or in the |
duke@435 | 218 | // case of an exception. |
duke@435 | 219 | static void cleanup_deopt_info(JavaThread *thread, |
duke@435 | 220 | vframeArray * array); |
duke@435 | 221 | |
duke@435 | 222 | // Restores callee saved values from deoptimized frame into oldest interpreter frame |
duke@435 | 223 | // so caller of the deoptimized frame will get back the values it expects. |
duke@435 | 224 | static void unwind_callee_save_values(frame* f, vframeArray* vframe_array); |
duke@435 | 225 | |
duke@435 | 226 | //** Performs an uncommon trap for compiled code. |
duke@435 | 227 | // The top most compiler frame is converted into interpreter frames |
duke@435 | 228 | static UnrollBlock* uncommon_trap(JavaThread* thread, jint unloaded_class_index); |
duke@435 | 229 | // Helper routine that enters the VM and may block |
duke@435 | 230 | static void uncommon_trap_inner(JavaThread* thread, jint unloaded_class_index); |
duke@435 | 231 | |
duke@435 | 232 | //** Deoptimizes the frame identified by id. |
duke@435 | 233 | // Only called from VMDeoptimizeFrame |
duke@435 | 234 | // @argument thread. Thread where stub_frame resides. |
duke@435 | 235 | // @argument id. id of frame that should be deoptimized. |
never@2260 | 236 | static void deoptimize_frame_internal(JavaThread* thread, intptr_t* id); |
never@2260 | 237 | |
never@2260 | 238 | // If thread is not the current thread then execute |
never@2260 | 239 | // VM_DeoptimizeFrame otherwise deoptimize directly. |
duke@435 | 240 | static void deoptimize_frame(JavaThread* thread, intptr_t* id); |
duke@435 | 241 | |
duke@435 | 242 | // Statistics |
duke@435 | 243 | static void gather_statistics(DeoptReason reason, DeoptAction action, |
duke@435 | 244 | Bytecodes::Code bc = Bytecodes::_illegal); |
duke@435 | 245 | static void print_statistics(); |
duke@435 | 246 | |
duke@435 | 247 | // How much room to adjust the last frame's SP by, to make space for |
duke@435 | 248 | // the callee's interpreter frame (which expects locals to be next to |
duke@435 | 249 | // incoming arguments) |
duke@435 | 250 | static int last_frame_adjust(int callee_parameters, int callee_locals); |
duke@435 | 251 | |
duke@435 | 252 | // trap_request codes |
duke@435 | 253 | static DeoptReason trap_request_reason(int trap_request) { |
duke@435 | 254 | if (trap_request < 0) |
duke@435 | 255 | return (DeoptReason) |
duke@435 | 256 | ((~(trap_request) >> _reason_shift) & right_n_bits(_reason_bits)); |
duke@435 | 257 | else |
duke@435 | 258 | // standard reason for unloaded CP entry |
duke@435 | 259 | return Reason_unloaded; |
duke@435 | 260 | } |
duke@435 | 261 | static DeoptAction trap_request_action(int trap_request) { |
duke@435 | 262 | if (trap_request < 0) |
duke@435 | 263 | return (DeoptAction) |
duke@435 | 264 | ((~(trap_request) >> _action_shift) & right_n_bits(_action_bits)); |
duke@435 | 265 | else |
duke@435 | 266 | // standard action for unloaded CP entry |
duke@435 | 267 | return _unloaded_action; |
duke@435 | 268 | } |
duke@435 | 269 | static int trap_request_index(int trap_request) { |
duke@435 | 270 | if (trap_request < 0) |
duke@435 | 271 | return -1; |
duke@435 | 272 | else |
duke@435 | 273 | return trap_request; |
duke@435 | 274 | } |
duke@435 | 275 | static int make_trap_request(DeoptReason reason, DeoptAction action, |
duke@435 | 276 | int index = -1) { |
duke@435 | 277 | assert((1 << _reason_bits) >= Reason_LIMIT, "enough bits"); |
duke@435 | 278 | assert((1 << _action_bits) >= Action_LIMIT, "enough bits"); |
duke@435 | 279 | int trap_request; |
duke@435 | 280 | if (index != -1) |
duke@435 | 281 | trap_request = index; |
duke@435 | 282 | else |
duke@435 | 283 | trap_request = (~(((reason) << _reason_shift) |
duke@435 | 284 | + ((action) << _action_shift))); |
duke@435 | 285 | assert(reason == trap_request_reason(trap_request), "valid reason"); |
duke@435 | 286 | assert(action == trap_request_action(trap_request), "valid action"); |
duke@435 | 287 | assert(index == trap_request_index(trap_request), "valid index"); |
duke@435 | 288 | return trap_request; |
duke@435 | 289 | } |
duke@435 | 290 | |
duke@435 | 291 | // The trap_state stored in a MDO is decoded here. |
duke@435 | 292 | // It records two items of information. |
duke@435 | 293 | // reason: If a deoptimization happened here, what its reason was, |
duke@435 | 294 | // or if there were multiple deopts with differing reasons. |
duke@435 | 295 | // recompiled: If a deoptimization here triggered a recompilation. |
duke@435 | 296 | // Note that not all reasons are recorded per-bci. |
duke@435 | 297 | static DeoptReason trap_state_reason(int trap_state); |
duke@435 | 298 | static int trap_state_has_reason(int trap_state, int reason); |
duke@435 | 299 | static int trap_state_add_reason(int trap_state, int reason); |
duke@435 | 300 | static bool trap_state_is_recompiled(int trap_state); |
duke@435 | 301 | static int trap_state_set_recompiled(int trap_state, bool z); |
duke@435 | 302 | static const char* format_trap_state(char* buf, size_t buflen, |
duke@435 | 303 | int trap_state); |
duke@435 | 304 | |
duke@435 | 305 | static bool reason_is_recorded_per_bytecode(DeoptReason reason) { |
kvn@1641 | 306 | return reason > Reason_none && reason <= Reason_RECORDED_LIMIT; |
duke@435 | 307 | } |
duke@435 | 308 | |
duke@435 | 309 | static DeoptReason reason_recorded_per_bytecode_if_any(DeoptReason reason) { |
duke@435 | 310 | if (reason_is_recorded_per_bytecode(reason)) |
duke@435 | 311 | return reason; |
duke@435 | 312 | else if (reason == Reason_div0_check) // null check due to divide-by-zero? |
duke@435 | 313 | return Reason_null_check; // recorded per BCI as a null check |
duke@435 | 314 | else |
duke@435 | 315 | return Reason_none; |
duke@435 | 316 | } |
duke@435 | 317 | |
duke@435 | 318 | static const char* trap_reason_name(int reason); |
duke@435 | 319 | static const char* trap_action_name(int action); |
duke@435 | 320 | // Format like reason='foo' action='bar' index='123'. |
duke@435 | 321 | // This is suitable both for XML and for tty output. |
duke@435 | 322 | static const char* format_trap_request(char* buf, size_t buflen, |
duke@435 | 323 | int trap_request); |
duke@435 | 324 | |
duke@435 | 325 | static jint total_deoptimization_count(); |
duke@435 | 326 | static jint deoptimization_count(DeoptReason reason); |
duke@435 | 327 | |
duke@435 | 328 | // JVMTI PopFrame support |
duke@435 | 329 | |
duke@435 | 330 | // Preserves incoming arguments to the popped frame when it is |
duke@435 | 331 | // returning to a deoptimized caller |
duke@435 | 332 | static void popframe_preserve_args(JavaThread* thread, int bytes_to_save, void* start_address); |
duke@435 | 333 | |
duke@435 | 334 | private: |
duke@435 | 335 | static methodDataOop get_method_data(JavaThread* thread, methodHandle m, bool create_if_missing); |
duke@435 | 336 | // Update the mdo's count and per-BCI reason bits, returning previous state: |
duke@435 | 337 | static ProfileData* query_update_method_data(methodDataHandle trap_mdo, |
duke@435 | 338 | int trap_bci, |
duke@435 | 339 | DeoptReason reason, |
duke@435 | 340 | //outputs: |
duke@435 | 341 | uint& ret_this_trap_count, |
duke@435 | 342 | bool& ret_maybe_prior_trap, |
duke@435 | 343 | bool& ret_maybe_prior_recompile); |
duke@435 | 344 | // class loading support for uncommon trap |
duke@435 | 345 | static void load_class_by_index(constantPoolHandle constant_pool, int index, TRAPS); |
duke@435 | 346 | static void load_class_by_index(constantPoolHandle constant_pool, int index); |
duke@435 | 347 | |
duke@435 | 348 | static UnrollBlock* fetch_unroll_info_helper(JavaThread* thread); |
duke@435 | 349 | |
duke@435 | 350 | static DeoptAction _unloaded_action; // == Action_reinterpret; |
duke@435 | 351 | static const char* _trap_reason_name[Reason_LIMIT]; |
duke@435 | 352 | static const char* _trap_action_name[Action_LIMIT]; |
duke@435 | 353 | |
duke@435 | 354 | static juint _deoptimization_hist[Reason_LIMIT][1+Action_LIMIT][BC_CASE_LIMIT]; |
duke@435 | 355 | // Note: Histogram array size is 1-2 Kb. |
duke@435 | 356 | |
duke@435 | 357 | public: |
duke@435 | 358 | static void update_method_data_from_interpreter(methodDataHandle trap_mdo, int trap_bci, int reason); |
duke@435 | 359 | }; |
duke@435 | 360 | |
duke@435 | 361 | class DeoptimizationMarker : StackObj { // for profiling |
duke@435 | 362 | static bool _is_active; |
duke@435 | 363 | public: |
duke@435 | 364 | DeoptimizationMarker() { _is_active = true; } |
duke@435 | 365 | ~DeoptimizationMarker() { _is_active = false; } |
duke@435 | 366 | static bool is_active() { return _is_active; } |
duke@435 | 367 | }; |
stefank@2314 | 368 | |
stefank@2314 | 369 | #endif // SHARE_VM_RUNTIME_DEOPTIMIZATION_HPP |