Mon, 07 Jul 2014 10:12:40 +0200
8049421: G1 Class Unloading after completing a concurrent mark cycle
Reviewed-by: tschatzl, ehelin, brutisso, coleenp, roland, iveresov
Contributed-by: stefan.karlsson@oracle.com, mikael.gerdin@oracle.com
duke@435 | 1 | /* |
drchase@6680 | 2 | * Copyright (c) 1999, 2014, 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 "asm/codeBuffer.hpp" |
stefank@2314 | 27 | #include "c1/c1_CodeStubs.hpp" |
stefank@2314 | 28 | #include "c1/c1_Defs.hpp" |
stefank@2314 | 29 | #include "c1/c1_FrameMap.hpp" |
stefank@2314 | 30 | #include "c1/c1_LIRAssembler.hpp" |
stefank@2314 | 31 | #include "c1/c1_MacroAssembler.hpp" |
stefank@2314 | 32 | #include "c1/c1_Runtime1.hpp" |
stefank@2314 | 33 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 34 | #include "classfile/vmSymbols.hpp" |
stefank@2314 | 35 | #include "code/codeBlob.hpp" |
stefank@2314 | 36 | #include "code/compiledIC.hpp" |
stefank@2314 | 37 | #include "code/pcDesc.hpp" |
stefank@2314 | 38 | #include "code/scopeDesc.hpp" |
stefank@2314 | 39 | #include "code/vtableStubs.hpp" |
stefank@2314 | 40 | #include "compiler/disassembler.hpp" |
stefank@2314 | 41 | #include "gc_interface/collectedHeap.hpp" |
stefank@2314 | 42 | #include "interpreter/bytecode.hpp" |
stefank@2314 | 43 | #include "interpreter/interpreter.hpp" |
stefank@2314 | 44 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 45 | #include "memory/barrierSet.hpp" |
stefank@2314 | 46 | #include "memory/oopFactory.hpp" |
stefank@2314 | 47 | #include "memory/resourceArea.hpp" |
stefank@2314 | 48 | #include "oops/objArrayKlass.hpp" |
stefank@2314 | 49 | #include "oops/oop.inline.hpp" |
stefank@2314 | 50 | #include "runtime/biasedLocking.hpp" |
stefank@2314 | 51 | #include "runtime/compilationPolicy.hpp" |
stefank@2314 | 52 | #include "runtime/interfaceSupport.hpp" |
stefank@2314 | 53 | #include "runtime/javaCalls.hpp" |
stefank@2314 | 54 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 55 | #include "runtime/threadCritical.hpp" |
stefank@2314 | 56 | #include "runtime/vframe.hpp" |
stefank@2314 | 57 | #include "runtime/vframeArray.hpp" |
stefank@2314 | 58 | #include "utilities/copy.hpp" |
stefank@2314 | 59 | #include "utilities/events.hpp" |
duke@435 | 60 | |
duke@435 | 61 | |
duke@435 | 62 | // Implementation of StubAssembler |
duke@435 | 63 | |
duke@435 | 64 | StubAssembler::StubAssembler(CodeBuffer* code, const char * name, int stub_id) : C1_MacroAssembler(code) { |
duke@435 | 65 | _name = name; |
duke@435 | 66 | _must_gc_arguments = false; |
duke@435 | 67 | _frame_size = no_frame_size; |
duke@435 | 68 | _num_rt_args = 0; |
duke@435 | 69 | _stub_id = stub_id; |
duke@435 | 70 | } |
duke@435 | 71 | |
duke@435 | 72 | |
duke@435 | 73 | void StubAssembler::set_info(const char* name, bool must_gc_arguments) { |
duke@435 | 74 | _name = name; |
duke@435 | 75 | _must_gc_arguments = must_gc_arguments; |
duke@435 | 76 | } |
duke@435 | 77 | |
duke@435 | 78 | |
duke@435 | 79 | void StubAssembler::set_frame_size(int size) { |
duke@435 | 80 | if (_frame_size == no_frame_size) { |
duke@435 | 81 | _frame_size = size; |
duke@435 | 82 | } |
duke@435 | 83 | assert(_frame_size == size, "can't change the frame size"); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | |
duke@435 | 87 | void StubAssembler::set_num_rt_args(int args) { |
duke@435 | 88 | if (_num_rt_args == 0) { |
duke@435 | 89 | _num_rt_args = args; |
duke@435 | 90 | } |
duke@435 | 91 | assert(_num_rt_args == args, "can't change the number of args"); |
duke@435 | 92 | } |
duke@435 | 93 | |
duke@435 | 94 | // Implementation of Runtime1 |
duke@435 | 95 | |
duke@435 | 96 | CodeBlob* Runtime1::_blobs[Runtime1::number_of_ids]; |
duke@435 | 97 | const char *Runtime1::_blob_names[] = { |
duke@435 | 98 | RUNTIME1_STUBS(STUB_NAME, LAST_STUB_NAME) |
duke@435 | 99 | }; |
duke@435 | 100 | |
duke@435 | 101 | #ifndef PRODUCT |
duke@435 | 102 | // statistics |
duke@435 | 103 | int Runtime1::_generic_arraycopy_cnt = 0; |
duke@435 | 104 | int Runtime1::_primitive_arraycopy_cnt = 0; |
duke@435 | 105 | int Runtime1::_oop_arraycopy_cnt = 0; |
roland@2728 | 106 | int Runtime1::_generic_arraycopystub_cnt = 0; |
duke@435 | 107 | int Runtime1::_arraycopy_slowcase_cnt = 0; |
roland@2728 | 108 | int Runtime1::_arraycopy_checkcast_cnt = 0; |
roland@2728 | 109 | int Runtime1::_arraycopy_checkcast_attempt_cnt = 0; |
duke@435 | 110 | int Runtime1::_new_type_array_slowcase_cnt = 0; |
duke@435 | 111 | int Runtime1::_new_object_array_slowcase_cnt = 0; |
duke@435 | 112 | int Runtime1::_new_instance_slowcase_cnt = 0; |
duke@435 | 113 | int Runtime1::_new_multi_array_slowcase_cnt = 0; |
duke@435 | 114 | int Runtime1::_monitorenter_slowcase_cnt = 0; |
duke@435 | 115 | int Runtime1::_monitorexit_slowcase_cnt = 0; |
duke@435 | 116 | int Runtime1::_patch_code_slowcase_cnt = 0; |
duke@435 | 117 | int Runtime1::_throw_range_check_exception_count = 0; |
duke@435 | 118 | int Runtime1::_throw_index_exception_count = 0; |
duke@435 | 119 | int Runtime1::_throw_div0_exception_count = 0; |
duke@435 | 120 | int Runtime1::_throw_null_pointer_exception_count = 0; |
duke@435 | 121 | int Runtime1::_throw_class_cast_exception_count = 0; |
duke@435 | 122 | int Runtime1::_throw_incompatible_class_change_error_count = 0; |
duke@435 | 123 | int Runtime1::_throw_array_store_exception_count = 0; |
duke@435 | 124 | int Runtime1::_throw_count = 0; |
roland@2728 | 125 | |
roland@2728 | 126 | static int _byte_arraycopy_cnt = 0; |
roland@2728 | 127 | static int _short_arraycopy_cnt = 0; |
roland@2728 | 128 | static int _int_arraycopy_cnt = 0; |
roland@2728 | 129 | static int _long_arraycopy_cnt = 0; |
roland@2728 | 130 | static int _oop_arraycopy_cnt = 0; |
roland@2728 | 131 | |
roland@2728 | 132 | address Runtime1::arraycopy_count_address(BasicType type) { |
roland@2728 | 133 | switch (type) { |
roland@2728 | 134 | case T_BOOLEAN: |
roland@2728 | 135 | case T_BYTE: return (address)&_byte_arraycopy_cnt; |
roland@2728 | 136 | case T_CHAR: |
roland@2728 | 137 | case T_SHORT: return (address)&_short_arraycopy_cnt; |
roland@2728 | 138 | case T_FLOAT: |
roland@2728 | 139 | case T_INT: return (address)&_int_arraycopy_cnt; |
roland@2728 | 140 | case T_DOUBLE: |
roland@2728 | 141 | case T_LONG: return (address)&_long_arraycopy_cnt; |
roland@2728 | 142 | case T_ARRAY: |
roland@2728 | 143 | case T_OBJECT: return (address)&_oop_arraycopy_cnt; |
roland@2728 | 144 | default: |
roland@2728 | 145 | ShouldNotReachHere(); |
roland@2728 | 146 | return NULL; |
roland@2728 | 147 | } |
roland@2728 | 148 | } |
roland@2728 | 149 | |
roland@2728 | 150 | |
duke@435 | 151 | #endif |
duke@435 | 152 | |
duke@435 | 153 | // Simple helper to see if the caller of a runtime stub which |
duke@435 | 154 | // entered the VM has been deoptimized |
duke@435 | 155 | |
duke@435 | 156 | static bool caller_is_deopted() { |
duke@435 | 157 | JavaThread* thread = JavaThread::current(); |
duke@435 | 158 | RegisterMap reg_map(thread, false); |
duke@435 | 159 | frame runtime_frame = thread->last_frame(); |
duke@435 | 160 | frame caller_frame = runtime_frame.sender(®_map); |
duke@435 | 161 | assert(caller_frame.is_compiled_frame(), "must be compiled"); |
duke@435 | 162 | return caller_frame.is_deoptimized_frame(); |
duke@435 | 163 | } |
duke@435 | 164 | |
duke@435 | 165 | // Stress deoptimization |
duke@435 | 166 | static void deopt_caller() { |
duke@435 | 167 | if ( !caller_is_deopted()) { |
duke@435 | 168 | JavaThread* thread = JavaThread::current(); |
duke@435 | 169 | RegisterMap reg_map(thread, false); |
duke@435 | 170 | frame runtime_frame = thread->last_frame(); |
duke@435 | 171 | frame caller_frame = runtime_frame.sender(®_map); |
dcubed@1648 | 172 | Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
duke@435 | 173 | assert(caller_is_deopted(), "Must be deoptimized"); |
duke@435 | 174 | } |
duke@435 | 175 | } |
duke@435 | 176 | |
duke@435 | 177 | |
iveresov@1939 | 178 | void Runtime1::generate_blob_for(BufferBlob* buffer_blob, StubID id) { |
duke@435 | 179 | assert(0 <= id && id < number_of_ids, "illegal stub id"); |
duke@435 | 180 | ResourceMark rm; |
duke@435 | 181 | // create code buffer for code storage |
twisti@2103 | 182 | CodeBuffer code(buffer_blob); |
duke@435 | 183 | |
iveresov@1939 | 184 | Compilation::setup_code_buffer(&code, 0); |
duke@435 | 185 | |
duke@435 | 186 | // create assembler for code generation |
duke@435 | 187 | StubAssembler* sasm = new StubAssembler(&code, name_for(id), id); |
duke@435 | 188 | // generate code for runtime stub |
duke@435 | 189 | OopMapSet* oop_maps; |
duke@435 | 190 | oop_maps = generate_code_for(id, sasm); |
duke@435 | 191 | assert(oop_maps == NULL || sasm->frame_size() != no_frame_size, |
duke@435 | 192 | "if stub has an oop map it must have a valid frame size"); |
duke@435 | 193 | |
duke@435 | 194 | #ifdef ASSERT |
duke@435 | 195 | // Make sure that stubs that need oopmaps have them |
duke@435 | 196 | switch (id) { |
duke@435 | 197 | // These stubs don't need to have an oopmap |
duke@435 | 198 | case dtrace_object_alloc_id: |
ysr@777 | 199 | case g1_pre_barrier_slow_id: |
ysr@777 | 200 | case g1_post_barrier_slow_id: |
duke@435 | 201 | case slow_subtype_check_id: |
duke@435 | 202 | case fpu2long_stub_id: |
duke@435 | 203 | case unwind_exception_id: |
iveresov@2138 | 204 | case counter_overflow_id: |
bobv@2036 | 205 | #if defined(SPARC) || defined(PPC) |
duke@435 | 206 | case handle_exception_nofpu_id: // Unused on sparc |
duke@435 | 207 | #endif |
duke@435 | 208 | break; |
duke@435 | 209 | |
duke@435 | 210 | // All other stubs should have oopmaps |
duke@435 | 211 | default: |
duke@435 | 212 | assert(oop_maps != NULL, "must have an oopmap"); |
duke@435 | 213 | } |
duke@435 | 214 | #endif |
duke@435 | 215 | |
duke@435 | 216 | // align so printing shows nop's instead of random code at the end (SimpleStubs are aligned) |
duke@435 | 217 | sasm->align(BytesPerWord); |
duke@435 | 218 | // make sure all code is in code buffer |
duke@435 | 219 | sasm->flush(); |
duke@435 | 220 | // create blob - distinguish a few special cases |
duke@435 | 221 | CodeBlob* blob = RuntimeStub::new_runtime_stub(name_for(id), |
duke@435 | 222 | &code, |
duke@435 | 223 | CodeOffsets::frame_never_safe, |
duke@435 | 224 | sasm->frame_size(), |
duke@435 | 225 | oop_maps, |
duke@435 | 226 | sasm->must_gc_arguments()); |
duke@435 | 227 | // install blob |
duke@435 | 228 | assert(blob != NULL, "blob must exist"); |
duke@435 | 229 | _blobs[id] = blob; |
duke@435 | 230 | } |
duke@435 | 231 | |
duke@435 | 232 | |
iveresov@1939 | 233 | void Runtime1::initialize(BufferBlob* blob) { |
iveresov@1939 | 234 | // platform-dependent initialization |
iveresov@1939 | 235 | initialize_pd(); |
iveresov@1939 | 236 | // generate stubs |
iveresov@1939 | 237 | for (int id = 0; id < number_of_ids; id++) generate_blob_for(blob, (StubID)id); |
iveresov@1939 | 238 | // printing |
duke@435 | 239 | #ifndef PRODUCT |
iveresov@1939 | 240 | if (PrintSimpleStubs) { |
iveresov@1939 | 241 | ResourceMark rm; |
iveresov@1939 | 242 | for (int id = 0; id < number_of_ids; id++) { |
iveresov@1939 | 243 | _blobs[id]->print(); |
iveresov@1939 | 244 | if (_blobs[id]->oop_maps() != NULL) { |
iveresov@1939 | 245 | _blobs[id]->oop_maps()->print(); |
duke@435 | 246 | } |
duke@435 | 247 | } |
iveresov@1939 | 248 | } |
duke@435 | 249 | #endif |
duke@435 | 250 | } |
duke@435 | 251 | |
duke@435 | 252 | |
duke@435 | 253 | CodeBlob* Runtime1::blob_for(StubID id) { |
duke@435 | 254 | assert(0 <= id && id < number_of_ids, "illegal stub id"); |
duke@435 | 255 | return _blobs[id]; |
duke@435 | 256 | } |
duke@435 | 257 | |
duke@435 | 258 | |
duke@435 | 259 | const char* Runtime1::name_for(StubID id) { |
duke@435 | 260 | assert(0 <= id && id < number_of_ids, "illegal stub id"); |
duke@435 | 261 | return _blob_names[id]; |
duke@435 | 262 | } |
duke@435 | 263 | |
duke@435 | 264 | const char* Runtime1::name_for_address(address entry) { |
duke@435 | 265 | for (int id = 0; id < number_of_ids; id++) { |
duke@435 | 266 | if (entry == entry_for((StubID)id)) return name_for((StubID)id); |
duke@435 | 267 | } |
duke@435 | 268 | |
duke@435 | 269 | #define FUNCTION_CASE(a, f) \ |
duke@435 | 270 | if ((intptr_t)a == CAST_FROM_FN_PTR(intptr_t, f)) return #f |
duke@435 | 271 | |
duke@435 | 272 | FUNCTION_CASE(entry, os::javaTimeMillis); |
duke@435 | 273 | FUNCTION_CASE(entry, os::javaTimeNanos); |
duke@435 | 274 | FUNCTION_CASE(entry, SharedRuntime::OSR_migration_end); |
duke@435 | 275 | FUNCTION_CASE(entry, SharedRuntime::d2f); |
duke@435 | 276 | FUNCTION_CASE(entry, SharedRuntime::d2i); |
duke@435 | 277 | FUNCTION_CASE(entry, SharedRuntime::d2l); |
duke@435 | 278 | FUNCTION_CASE(entry, SharedRuntime::dcos); |
duke@435 | 279 | FUNCTION_CASE(entry, SharedRuntime::dexp); |
duke@435 | 280 | FUNCTION_CASE(entry, SharedRuntime::dlog); |
duke@435 | 281 | FUNCTION_CASE(entry, SharedRuntime::dlog10); |
duke@435 | 282 | FUNCTION_CASE(entry, SharedRuntime::dpow); |
duke@435 | 283 | FUNCTION_CASE(entry, SharedRuntime::drem); |
duke@435 | 284 | FUNCTION_CASE(entry, SharedRuntime::dsin); |
duke@435 | 285 | FUNCTION_CASE(entry, SharedRuntime::dtan); |
duke@435 | 286 | FUNCTION_CASE(entry, SharedRuntime::f2i); |
duke@435 | 287 | FUNCTION_CASE(entry, SharedRuntime::f2l); |
duke@435 | 288 | FUNCTION_CASE(entry, SharedRuntime::frem); |
duke@435 | 289 | FUNCTION_CASE(entry, SharedRuntime::l2d); |
duke@435 | 290 | FUNCTION_CASE(entry, SharedRuntime::l2f); |
duke@435 | 291 | FUNCTION_CASE(entry, SharedRuntime::ldiv); |
duke@435 | 292 | FUNCTION_CASE(entry, SharedRuntime::lmul); |
duke@435 | 293 | FUNCTION_CASE(entry, SharedRuntime::lrem); |
duke@435 | 294 | FUNCTION_CASE(entry, SharedRuntime::lrem); |
duke@435 | 295 | FUNCTION_CASE(entry, SharedRuntime::dtrace_method_entry); |
duke@435 | 296 | FUNCTION_CASE(entry, SharedRuntime::dtrace_method_exit); |
roland@3838 | 297 | FUNCTION_CASE(entry, is_instance_of); |
duke@435 | 298 | FUNCTION_CASE(entry, trace_block_entry); |
rbackman@3709 | 299 | #ifdef TRACE_HAVE_INTRINSICS |
rbackman@3709 | 300 | FUNCTION_CASE(entry, TRACE_TIME_METHOD); |
rbackman@3709 | 301 | #endif |
drchase@5353 | 302 | FUNCTION_CASE(entry, StubRoutines::updateBytesCRC32()); |
duke@435 | 303 | |
duke@435 | 304 | #undef FUNCTION_CASE |
duke@435 | 305 | |
bobv@2036 | 306 | // Soft float adds more runtime names. |
bobv@2036 | 307 | return pd_name_for_address(entry); |
duke@435 | 308 | } |
duke@435 | 309 | |
duke@435 | 310 | |
coleenp@4037 | 311 | JRT_ENTRY(void, Runtime1::new_instance(JavaThread* thread, Klass* klass)) |
duke@435 | 312 | NOT_PRODUCT(_new_instance_slowcase_cnt++;) |
duke@435 | 313 | |
coleenp@4037 | 314 | assert(klass->is_klass(), "not a class"); |
duke@435 | 315 | instanceKlassHandle h(thread, klass); |
duke@435 | 316 | h->check_valid_for_instantiation(true, CHECK); |
duke@435 | 317 | // make sure klass is initialized |
duke@435 | 318 | h->initialize(CHECK); |
duke@435 | 319 | // allocate instance and return via TLS |
duke@435 | 320 | oop obj = h->allocate_instance(CHECK); |
duke@435 | 321 | thread->set_vm_result(obj); |
duke@435 | 322 | JRT_END |
duke@435 | 323 | |
duke@435 | 324 | |
coleenp@4037 | 325 | JRT_ENTRY(void, Runtime1::new_type_array(JavaThread* thread, Klass* klass, jint length)) |
duke@435 | 326 | NOT_PRODUCT(_new_type_array_slowcase_cnt++;) |
duke@435 | 327 | // Note: no handle for klass needed since they are not used |
duke@435 | 328 | // anymore after new_typeArray() and no GC can happen before. |
duke@435 | 329 | // (This may have to change if this code changes!) |
coleenp@4037 | 330 | assert(klass->is_klass(), "not a class"); |
coleenp@4142 | 331 | BasicType elt_type = TypeArrayKlass::cast(klass)->element_type(); |
duke@435 | 332 | oop obj = oopFactory::new_typeArray(elt_type, length, CHECK); |
duke@435 | 333 | thread->set_vm_result(obj); |
duke@435 | 334 | // This is pretty rare but this runtime patch is stressful to deoptimization |
duke@435 | 335 | // if we deoptimize here so force a deopt to stress the path. |
duke@435 | 336 | if (DeoptimizeALot) { |
duke@435 | 337 | deopt_caller(); |
duke@435 | 338 | } |
duke@435 | 339 | |
duke@435 | 340 | JRT_END |
duke@435 | 341 | |
duke@435 | 342 | |
coleenp@4037 | 343 | JRT_ENTRY(void, Runtime1::new_object_array(JavaThread* thread, Klass* array_klass, jint length)) |
duke@435 | 344 | NOT_PRODUCT(_new_object_array_slowcase_cnt++;) |
duke@435 | 345 | |
duke@435 | 346 | // Note: no handle for klass needed since they are not used |
duke@435 | 347 | // anymore after new_objArray() and no GC can happen before. |
duke@435 | 348 | // (This may have to change if this code changes!) |
coleenp@4037 | 349 | assert(array_klass->is_klass(), "not a class"); |
coleenp@4142 | 350 | Klass* elem_klass = ObjArrayKlass::cast(array_klass)->element_klass(); |
duke@435 | 351 | objArrayOop obj = oopFactory::new_objArray(elem_klass, length, CHECK); |
duke@435 | 352 | thread->set_vm_result(obj); |
duke@435 | 353 | // This is pretty rare but this runtime patch is stressful to deoptimization |
duke@435 | 354 | // if we deoptimize here so force a deopt to stress the path. |
duke@435 | 355 | if (DeoptimizeALot) { |
duke@435 | 356 | deopt_caller(); |
duke@435 | 357 | } |
duke@435 | 358 | JRT_END |
duke@435 | 359 | |
duke@435 | 360 | |
coleenp@4037 | 361 | JRT_ENTRY(void, Runtime1::new_multi_array(JavaThread* thread, Klass* klass, int rank, jint* dims)) |
duke@435 | 362 | NOT_PRODUCT(_new_multi_array_slowcase_cnt++;) |
duke@435 | 363 | |
coleenp@4037 | 364 | assert(klass->is_klass(), "not a class"); |
duke@435 | 365 | assert(rank >= 1, "rank must be nonzero"); |
coleenp@4142 | 366 | oop obj = ArrayKlass::cast(klass)->multi_allocate(rank, dims, CHECK); |
duke@435 | 367 | thread->set_vm_result(obj); |
duke@435 | 368 | JRT_END |
duke@435 | 369 | |
duke@435 | 370 | |
duke@435 | 371 | JRT_ENTRY(void, Runtime1::unimplemented_entry(JavaThread* thread, StubID id)) |
duke@435 | 372 | tty->print_cr("Runtime1::entry_for(%d) returned unimplemented entry point", id); |
duke@435 | 373 | JRT_END |
duke@435 | 374 | |
duke@435 | 375 | |
never@2488 | 376 | JRT_ENTRY(void, Runtime1::throw_array_store_exception(JavaThread* thread, oopDesc* obj)) |
never@2488 | 377 | ResourceMark rm(thread); |
hseigel@4278 | 378 | const char* klass_name = obj->klass()->external_name(); |
never@2488 | 379 | SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayStoreException(), klass_name); |
duke@435 | 380 | JRT_END |
duke@435 | 381 | |
duke@435 | 382 | |
iveresov@2988 | 383 | // counter_overflow() is called from within C1-compiled methods. The enclosing method is the method |
iveresov@2988 | 384 | // associated with the top activation record. The inlinee (that is possibly included in the enclosing |
iveresov@2988 | 385 | // method) method oop is passed as an argument. In order to do that it is embedded in the code as |
iveresov@2988 | 386 | // a constant. |
coleenp@4037 | 387 | static nmethod* counter_overflow_helper(JavaThread* THREAD, int branch_bci, Method* m) { |
iveresov@2138 | 388 | nmethod* osr_nm = NULL; |
iveresov@2138 | 389 | methodHandle method(THREAD, m); |
iveresov@2138 | 390 | |
iveresov@2138 | 391 | RegisterMap map(THREAD, false); |
iveresov@2138 | 392 | frame fr = THREAD->last_frame().sender(&map); |
duke@435 | 393 | nmethod* nm = (nmethod*) fr.cb(); |
iveresov@2138 | 394 | assert(nm!= NULL && nm->is_nmethod(), "Sanity check"); |
iveresov@2138 | 395 | methodHandle enclosing_method(THREAD, nm->method()); |
iveresov@2138 | 396 | |
iveresov@2138 | 397 | CompLevel level = (CompLevel)nm->comp_level(); |
iveresov@2138 | 398 | int bci = InvocationEntryBci; |
iveresov@2138 | 399 | if (branch_bci != InvocationEntryBci) { |
iveresov@2138 | 400 | // Compute desination bci |
iveresov@2138 | 401 | address pc = method()->code_base() + branch_bci; |
never@2462 | 402 | Bytecodes::Code branch = Bytecodes::code_at(method(), pc); |
iveresov@2138 | 403 | int offset = 0; |
iveresov@2138 | 404 | switch (branch) { |
iveresov@2138 | 405 | case Bytecodes::_if_icmplt: case Bytecodes::_iflt: |
iveresov@2138 | 406 | case Bytecodes::_if_icmpgt: case Bytecodes::_ifgt: |
iveresov@2138 | 407 | case Bytecodes::_if_icmple: case Bytecodes::_ifle: |
iveresov@2138 | 408 | case Bytecodes::_if_icmpge: case Bytecodes::_ifge: |
iveresov@2138 | 409 | case Bytecodes::_if_icmpeq: case Bytecodes::_if_acmpeq: case Bytecodes::_ifeq: |
iveresov@2138 | 410 | case Bytecodes::_if_icmpne: case Bytecodes::_if_acmpne: case Bytecodes::_ifne: |
iveresov@2138 | 411 | case Bytecodes::_ifnull: case Bytecodes::_ifnonnull: case Bytecodes::_goto: |
iveresov@2138 | 412 | offset = (int16_t)Bytes::get_Java_u2(pc + 1); |
iveresov@2138 | 413 | break; |
iveresov@2138 | 414 | case Bytecodes::_goto_w: |
iveresov@2138 | 415 | offset = Bytes::get_Java_u4(pc + 1); |
iveresov@2138 | 416 | break; |
iveresov@2138 | 417 | default: ; |
duke@435 | 418 | } |
iveresov@2138 | 419 | bci = branch_bci + offset; |
iveresov@2138 | 420 | } |
iveresov@3452 | 421 | assert(!HAS_PENDING_EXCEPTION, "Should not have any exceptions pending"); |
iveresov@2988 | 422 | osr_nm = CompilationPolicy::policy()->event(enclosing_method, method, branch_bci, bci, level, nm, THREAD); |
iveresov@3452 | 423 | assert(!HAS_PENDING_EXCEPTION, "Event handler should not throw any exceptions"); |
iveresov@2138 | 424 | return osr_nm; |
iveresov@2138 | 425 | } |
iveresov@2138 | 426 | |
coleenp@4037 | 427 | JRT_BLOCK_ENTRY(address, Runtime1::counter_overflow(JavaThread* thread, int bci, Method* method)) |
iveresov@2138 | 428 | nmethod* osr_nm; |
iveresov@2138 | 429 | JRT_BLOCK |
iveresov@2138 | 430 | osr_nm = counter_overflow_helper(thread, bci, method); |
iveresov@2138 | 431 | if (osr_nm != NULL) { |
iveresov@2138 | 432 | RegisterMap map(thread, false); |
iveresov@2138 | 433 | frame fr = thread->last_frame().sender(&map); |
never@2260 | 434 | Deoptimization::deoptimize_frame(thread, fr.id()); |
duke@435 | 435 | } |
iveresov@2138 | 436 | JRT_BLOCK_END |
iveresov@2138 | 437 | return NULL; |
duke@435 | 438 | JRT_END |
duke@435 | 439 | |
duke@435 | 440 | extern void vm_exit(int code); |
duke@435 | 441 | |
duke@435 | 442 | // Enter this method from compiled code handler below. This is where we transition |
duke@435 | 443 | // to VM mode. This is done as a helper routine so that the method called directly |
duke@435 | 444 | // from compiled code does not have to transition to VM. This allows the entry |
duke@435 | 445 | // method to see if the nmethod that we have just looked up a handler for has |
duke@435 | 446 | // been deoptimized while we were in the vm. This simplifies the assembly code |
duke@435 | 447 | // cpu directories. |
duke@435 | 448 | // |
duke@435 | 449 | // We are entering here from exception stub (via the entry method below) |
duke@435 | 450 | // If there is a compiled exception handler in this method, we will continue there; |
duke@435 | 451 | // otherwise we will unwind the stack and continue at the caller of top frame method |
duke@435 | 452 | // Note: we enter in Java using a special JRT wrapper. This wrapper allows us to |
duke@435 | 453 | // control the area where we can allow a safepoint. After we exit the safepoint area we can |
duke@435 | 454 | // check to see if the handler we are going to return is now in a nmethod that has |
duke@435 | 455 | // been deoptimized. If that is the case we return the deopt blob |
duke@435 | 456 | // unpack_with_exception entry instead. This makes life for the exception blob easier |
duke@435 | 457 | // because making that same check and diverting is painful from assembly language. |
duke@435 | 458 | JRT_ENTRY_NO_ASYNC(static address, exception_handler_for_pc_helper(JavaThread* thread, oopDesc* ex, address pc, nmethod*& nm)) |
twisti@2603 | 459 | // Reset method handle flag. |
twisti@2603 | 460 | thread->set_is_method_handle_return(false); |
duke@435 | 461 | |
duke@435 | 462 | Handle exception(thread, ex); |
duke@435 | 463 | nm = CodeCache::find_nmethod(pc); |
duke@435 | 464 | assert(nm != NULL, "this is not an nmethod"); |
duke@435 | 465 | // Adjust the pc as needed/ |
duke@435 | 466 | if (nm->is_deopt_pc(pc)) { |
duke@435 | 467 | RegisterMap map(thread, false); |
duke@435 | 468 | frame exception_frame = thread->last_frame().sender(&map); |
duke@435 | 469 | // if the frame isn't deopted then pc must not correspond to the caller of last_frame |
duke@435 | 470 | assert(exception_frame.is_deoptimized_frame(), "must be deopted"); |
duke@435 | 471 | pc = exception_frame.pc(); |
duke@435 | 472 | } |
duke@435 | 473 | #ifdef ASSERT |
duke@435 | 474 | assert(exception.not_null(), "NULL exceptions should be handled by throw_exception"); |
duke@435 | 475 | assert(exception->is_oop(), "just checking"); |
duke@435 | 476 | // Check that exception is a subclass of Throwable, otherwise we have a VerifyError |
never@1577 | 477 | if (!(exception->is_a(SystemDictionary::Throwable_klass()))) { |
duke@435 | 478 | if (ExitVMOnVerifyError) vm_exit(-1); |
duke@435 | 479 | ShouldNotReachHere(); |
duke@435 | 480 | } |
duke@435 | 481 | #endif |
duke@435 | 482 | |
duke@435 | 483 | // Check the stack guard pages and reenable them if necessary and there is |
duke@435 | 484 | // enough space on the stack to do so. Use fast exceptions only if the guard |
duke@435 | 485 | // pages are enabled. |
duke@435 | 486 | bool guard_pages_enabled = thread->stack_yellow_zone_enabled(); |
duke@435 | 487 | if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack(); |
duke@435 | 488 | |
dcubed@1648 | 489 | if (JvmtiExport::can_post_on_exceptions()) { |
duke@435 | 490 | // To ensure correct notification of exception catches and throws |
duke@435 | 491 | // we have to deoptimize here. If we attempted to notify the |
duke@435 | 492 | // catches and throws during this exception lookup it's possible |
duke@435 | 493 | // we could deoptimize on the way out of the VM and end back in |
duke@435 | 494 | // the interpreter at the throw site. This would result in double |
duke@435 | 495 | // notifications since the interpreter would also notify about |
duke@435 | 496 | // these same catches and throws as it unwound the frame. |
duke@435 | 497 | |
duke@435 | 498 | RegisterMap reg_map(thread); |
duke@435 | 499 | frame stub_frame = thread->last_frame(); |
duke@435 | 500 | frame caller_frame = stub_frame.sender(®_map); |
duke@435 | 501 | |
duke@435 | 502 | // We don't really want to deoptimize the nmethod itself since we |
duke@435 | 503 | // can actually continue in the exception handler ourselves but I |
duke@435 | 504 | // don't see an easy way to have the desired effect. |
never@2260 | 505 | Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
never@2260 | 506 | assert(caller_is_deopted(), "Must be deoptimized"); |
duke@435 | 507 | |
duke@435 | 508 | return SharedRuntime::deopt_blob()->unpack_with_exception_in_tls(); |
duke@435 | 509 | } |
duke@435 | 510 | |
twisti@2603 | 511 | // ExceptionCache is used only for exceptions at call sites and not for implicit exceptions |
duke@435 | 512 | if (guard_pages_enabled) { |
duke@435 | 513 | address fast_continuation = nm->handler_for_exception_and_pc(exception, pc); |
duke@435 | 514 | if (fast_continuation != NULL) { |
twisti@2603 | 515 | // Set flag if return address is a method handle call site. |
twisti@2603 | 516 | thread->set_is_method_handle_return(nm->is_method_handle_return(pc)); |
duke@435 | 517 | return fast_continuation; |
duke@435 | 518 | } |
duke@435 | 519 | } |
duke@435 | 520 | |
duke@435 | 521 | // If the stack guard pages are enabled, check whether there is a handler in |
duke@435 | 522 | // the current method. Otherwise (guard pages disabled), force an unwind and |
duke@435 | 523 | // skip the exception cache update (i.e., just leave continuation==NULL). |
duke@435 | 524 | address continuation = NULL; |
duke@435 | 525 | if (guard_pages_enabled) { |
duke@435 | 526 | |
duke@435 | 527 | // New exception handling mechanism can support inlined methods |
duke@435 | 528 | // with exception handlers since the mappings are from PC to PC |
duke@435 | 529 | |
duke@435 | 530 | // debugging support |
duke@435 | 531 | // tracing |
duke@435 | 532 | if (TraceExceptions) { |
duke@435 | 533 | ttyLocker ttyl; |
duke@435 | 534 | ResourceMark rm; |
drchase@6680 | 535 | tty->print_cr("Exception <%s> (" INTPTR_FORMAT ") thrown in compiled method <%s> at PC " INTPTR_FORMAT " for thread " INTPTR_FORMAT "", |
drchase@6680 | 536 | exception->print_value_string(), p2i((address)exception()), nm->method()->print_value_string(), p2i(pc), p2i(thread)); |
duke@435 | 537 | } |
duke@435 | 538 | // for AbortVMOnException flag |
duke@435 | 539 | NOT_PRODUCT(Exceptions::debug_check_abort(exception)); |
duke@435 | 540 | |
duke@435 | 541 | // Clear out the exception oop and pc since looking up an |
duke@435 | 542 | // exception handler can cause class loading, which might throw an |
duke@435 | 543 | // exception and those fields are expected to be clear during |
duke@435 | 544 | // normal bytecode execution. |
twisti@5915 | 545 | thread->clear_exception_oop_and_pc(); |
duke@435 | 546 | |
duke@435 | 547 | continuation = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, false, false); |
duke@435 | 548 | // If an exception was thrown during exception dispatch, the exception oop may have changed |
duke@435 | 549 | thread->set_exception_oop(exception()); |
duke@435 | 550 | thread->set_exception_pc(pc); |
duke@435 | 551 | |
duke@435 | 552 | // the exception cache is used only by non-implicit exceptions |
twisti@2603 | 553 | if (continuation != NULL) { |
duke@435 | 554 | nm->add_handler_for_exception_and_pc(exception, pc, continuation); |
duke@435 | 555 | } |
duke@435 | 556 | } |
duke@435 | 557 | |
duke@435 | 558 | thread->set_vm_result(exception()); |
twisti@2603 | 559 | // Set flag if return address is a method handle call site. |
twisti@2603 | 560 | thread->set_is_method_handle_return(nm->is_method_handle_return(pc)); |
duke@435 | 561 | |
duke@435 | 562 | if (TraceExceptions) { |
duke@435 | 563 | ttyLocker ttyl; |
duke@435 | 564 | ResourceMark rm; |
duke@435 | 565 | tty->print_cr("Thread " PTR_FORMAT " continuing at PC " PTR_FORMAT " for exception thrown at PC " PTR_FORMAT, |
drchase@6680 | 566 | p2i(thread), p2i(continuation), p2i(pc)); |
duke@435 | 567 | } |
duke@435 | 568 | |
duke@435 | 569 | return continuation; |
duke@435 | 570 | JRT_END |
duke@435 | 571 | |
duke@435 | 572 | // Enter this method from compiled code only if there is a Java exception handler |
twisti@2603 | 573 | // in the method handling the exception. |
duke@435 | 574 | // We are entering here from exception stub. We don't do a normal VM transition here. |
duke@435 | 575 | // We do it in a helper. This is so we can check to see if the nmethod we have just |
duke@435 | 576 | // searched for an exception handler has been deoptimized in the meantime. |
twisti@2603 | 577 | address Runtime1::exception_handler_for_pc(JavaThread* thread) { |
duke@435 | 578 | oop exception = thread->exception_oop(); |
duke@435 | 579 | address pc = thread->exception_pc(); |
duke@435 | 580 | // Still in Java mode |
twisti@2603 | 581 | DEBUG_ONLY(ResetNoHandleMark rnhm); |
duke@435 | 582 | nmethod* nm = NULL; |
duke@435 | 583 | address continuation = NULL; |
duke@435 | 584 | { |
duke@435 | 585 | // Enter VM mode by calling the helper |
duke@435 | 586 | ResetNoHandleMark rnhm; |
duke@435 | 587 | continuation = exception_handler_for_pc_helper(thread, exception, pc, nm); |
duke@435 | 588 | } |
duke@435 | 589 | // Back in JAVA, use no oops DON'T safepoint |
duke@435 | 590 | |
duke@435 | 591 | // Now check to see if the nmethod we were called from is now deoptimized. |
duke@435 | 592 | // If so we must return to the deopt blob and deoptimize the nmethod |
duke@435 | 593 | if (nm != NULL && caller_is_deopted()) { |
duke@435 | 594 | continuation = SharedRuntime::deopt_blob()->unpack_with_exception_in_tls(); |
duke@435 | 595 | } |
duke@435 | 596 | |
twisti@2603 | 597 | assert(continuation != NULL, "no handler found"); |
duke@435 | 598 | return continuation; |
duke@435 | 599 | } |
duke@435 | 600 | |
duke@435 | 601 | |
duke@435 | 602 | JRT_ENTRY(void, Runtime1::throw_range_check_exception(JavaThread* thread, int index)) |
duke@435 | 603 | NOT_PRODUCT(_throw_range_check_exception_count++;) |
duke@435 | 604 | char message[jintAsStringSize]; |
duke@435 | 605 | sprintf(message, "%d", index); |
duke@435 | 606 | SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), message); |
duke@435 | 607 | JRT_END |
duke@435 | 608 | |
duke@435 | 609 | |
duke@435 | 610 | JRT_ENTRY(void, Runtime1::throw_index_exception(JavaThread* thread, int index)) |
duke@435 | 611 | NOT_PRODUCT(_throw_index_exception_count++;) |
duke@435 | 612 | char message[16]; |
duke@435 | 613 | sprintf(message, "%d", index); |
duke@435 | 614 | SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IndexOutOfBoundsException(), message); |
duke@435 | 615 | JRT_END |
duke@435 | 616 | |
duke@435 | 617 | |
duke@435 | 618 | JRT_ENTRY(void, Runtime1::throw_div0_exception(JavaThread* thread)) |
duke@435 | 619 | NOT_PRODUCT(_throw_div0_exception_count++;) |
duke@435 | 620 | SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero"); |
duke@435 | 621 | JRT_END |
duke@435 | 622 | |
duke@435 | 623 | |
duke@435 | 624 | JRT_ENTRY(void, Runtime1::throw_null_pointer_exception(JavaThread* thread)) |
duke@435 | 625 | NOT_PRODUCT(_throw_null_pointer_exception_count++;) |
duke@435 | 626 | SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException()); |
duke@435 | 627 | JRT_END |
duke@435 | 628 | |
duke@435 | 629 | |
duke@435 | 630 | JRT_ENTRY(void, Runtime1::throw_class_cast_exception(JavaThread* thread, oopDesc* object)) |
duke@435 | 631 | NOT_PRODUCT(_throw_class_cast_exception_count++;) |
duke@435 | 632 | ResourceMark rm(thread); |
duke@435 | 633 | char* message = SharedRuntime::generate_class_cast_message( |
hseigel@4278 | 634 | thread, object->klass()->external_name()); |
duke@435 | 635 | SharedRuntime::throw_and_post_jvmti_exception( |
duke@435 | 636 | thread, vmSymbols::java_lang_ClassCastException(), message); |
duke@435 | 637 | JRT_END |
duke@435 | 638 | |
duke@435 | 639 | |
duke@435 | 640 | JRT_ENTRY(void, Runtime1::throw_incompatible_class_change_error(JavaThread* thread)) |
duke@435 | 641 | NOT_PRODUCT(_throw_incompatible_class_change_error_count++;) |
duke@435 | 642 | ResourceMark rm(thread); |
duke@435 | 643 | SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError()); |
duke@435 | 644 | JRT_END |
duke@435 | 645 | |
duke@435 | 646 | |
duke@435 | 647 | JRT_ENTRY_NO_ASYNC(void, Runtime1::monitorenter(JavaThread* thread, oopDesc* obj, BasicObjectLock* lock)) |
duke@435 | 648 | NOT_PRODUCT(_monitorenter_slowcase_cnt++;) |
duke@435 | 649 | if (PrintBiasedLockingStatistics) { |
duke@435 | 650 | Atomic::inc(BiasedLocking::slow_path_entry_count_addr()); |
duke@435 | 651 | } |
duke@435 | 652 | Handle h_obj(thread, obj); |
duke@435 | 653 | assert(h_obj()->is_oop(), "must be NULL or an object"); |
duke@435 | 654 | if (UseBiasedLocking) { |
duke@435 | 655 | // Retry fast entry if bias is revoked to avoid unnecessary inflation |
duke@435 | 656 | ObjectSynchronizer::fast_enter(h_obj, lock->lock(), true, CHECK); |
duke@435 | 657 | } else { |
duke@435 | 658 | if (UseFastLocking) { |
duke@435 | 659 | // When using fast locking, the compiled code has already tried the fast case |
duke@435 | 660 | assert(obj == lock->obj(), "must match"); |
duke@435 | 661 | ObjectSynchronizer::slow_enter(h_obj, lock->lock(), THREAD); |
duke@435 | 662 | } else { |
duke@435 | 663 | lock->set_obj(obj); |
duke@435 | 664 | ObjectSynchronizer::fast_enter(h_obj, lock->lock(), false, THREAD); |
duke@435 | 665 | } |
duke@435 | 666 | } |
duke@435 | 667 | JRT_END |
duke@435 | 668 | |
duke@435 | 669 | |
duke@435 | 670 | JRT_LEAF(void, Runtime1::monitorexit(JavaThread* thread, BasicObjectLock* lock)) |
duke@435 | 671 | NOT_PRODUCT(_monitorexit_slowcase_cnt++;) |
duke@435 | 672 | assert(thread == JavaThread::current(), "threads must correspond"); |
duke@435 | 673 | assert(thread->last_Java_sp(), "last_Java_sp must be set"); |
duke@435 | 674 | // monitorexit is non-blocking (leaf routine) => no exceptions can be thrown |
duke@435 | 675 | EXCEPTION_MARK; |
duke@435 | 676 | |
duke@435 | 677 | oop obj = lock->obj(); |
duke@435 | 678 | assert(obj->is_oop(), "must be NULL or an object"); |
duke@435 | 679 | if (UseFastLocking) { |
duke@435 | 680 | // When using fast locking, the compiled code has already tried the fast case |
duke@435 | 681 | ObjectSynchronizer::slow_exit(obj, lock->lock(), THREAD); |
duke@435 | 682 | } else { |
duke@435 | 683 | ObjectSynchronizer::fast_exit(obj, lock->lock(), THREAD); |
duke@435 | 684 | } |
duke@435 | 685 | JRT_END |
duke@435 | 686 | |
twisti@3244 | 687 | // Cf. OptoRuntime::deoptimize_caller_frame |
twisti@3244 | 688 | JRT_ENTRY(void, Runtime1::deoptimize(JavaThread* thread)) |
twisti@3244 | 689 | // Called from within the owner thread, so no need for safepoint |
twisti@3244 | 690 | RegisterMap reg_map(thread, false); |
twisti@3244 | 691 | frame stub_frame = thread->last_frame(); |
twisti@3244 | 692 | assert(stub_frame.is_runtime_frame(), "sanity check"); |
twisti@3244 | 693 | frame caller_frame = stub_frame.sender(®_map); |
twisti@3244 | 694 | |
twisti@3244 | 695 | // We are coming from a compiled method; check this is true. |
twisti@3244 | 696 | assert(CodeCache::find_nmethod(caller_frame.pc()) != NULL, "sanity"); |
twisti@3244 | 697 | |
twisti@3244 | 698 | // Deoptimize the caller frame. |
twisti@3244 | 699 | Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
twisti@3244 | 700 | |
twisti@3244 | 701 | // Return to the now deoptimized frame. |
twisti@3244 | 702 | JRT_END |
twisti@3244 | 703 | |
duke@435 | 704 | |
coleenp@4037 | 705 | static Klass* resolve_field_return_klass(methodHandle caller, int bci, TRAPS) { |
never@2462 | 706 | Bytecode_field field_access(caller, bci); |
duke@435 | 707 | // This can be static or non-static field access |
never@2462 | 708 | Bytecodes::Code code = field_access.code(); |
duke@435 | 709 | |
duke@435 | 710 | // We must load class, initialize class and resolvethe field |
drchase@5732 | 711 | fieldDescriptor result; // initialize class if needed |
duke@435 | 712 | constantPoolHandle constants(THREAD, caller->constants()); |
drchase@5732 | 713 | LinkResolver::resolve_field_access(result, constants, field_access.index(), Bytecodes::java_code(code), CHECK_NULL); |
drchase@5732 | 714 | return result.field_holder(); |
duke@435 | 715 | } |
duke@435 | 716 | |
duke@435 | 717 | |
duke@435 | 718 | // |
duke@435 | 719 | // This routine patches sites where a class wasn't loaded or |
duke@435 | 720 | // initialized at the time the code was generated. It handles |
duke@435 | 721 | // references to classes, fields and forcing of initialization. Most |
duke@435 | 722 | // of the cases are straightforward and involving simply forcing |
duke@435 | 723 | // resolution of a class, rewriting the instruction stream with the |
duke@435 | 724 | // needed constant and replacing the call in this function with the |
duke@435 | 725 | // patched code. The case for static field is more complicated since |
duke@435 | 726 | // the thread which is in the process of initializing a class can |
duke@435 | 727 | // access it's static fields but other threads can't so the code |
duke@435 | 728 | // either has to deoptimize when this case is detected or execute a |
duke@435 | 729 | // check that the current thread is the initializing thread. The |
duke@435 | 730 | // current |
duke@435 | 731 | // |
duke@435 | 732 | // Patches basically look like this: |
duke@435 | 733 | // |
duke@435 | 734 | // |
duke@435 | 735 | // patch_site: jmp patch stub ;; will be patched |
duke@435 | 736 | // continue: ... |
duke@435 | 737 | // ... |
duke@435 | 738 | // ... |
duke@435 | 739 | // ... |
duke@435 | 740 | // |
duke@435 | 741 | // They have a stub which looks like this: |
duke@435 | 742 | // |
duke@435 | 743 | // ;; patch body |
duke@435 | 744 | // movl <const>, reg (for class constants) |
duke@435 | 745 | // <or> movl [reg1 + <const>], reg (for field offsets) |
duke@435 | 746 | // <or> movl reg, [reg1 + <const>] (for field offsets) |
duke@435 | 747 | // <being_init offset> <bytes to copy> <bytes to skip> |
duke@435 | 748 | // patch_stub: call Runtime1::patch_code (through a runtime stub) |
duke@435 | 749 | // jmp patch_site |
duke@435 | 750 | // |
duke@435 | 751 | // |
duke@435 | 752 | // A normal patch is done by rewriting the patch body, usually a move, |
duke@435 | 753 | // and then copying it into place over top of the jmp instruction |
duke@435 | 754 | // being careful to flush caches and doing it in an MP-safe way. The |
duke@435 | 755 | // constants following the patch body are used to find various pieces |
duke@435 | 756 | // of the patch relative to the call site for Runtime1::patch_code. |
duke@435 | 757 | // The case for getstatic and putstatic is more complicated because |
duke@435 | 758 | // getstatic and putstatic have special semantics when executing while |
duke@435 | 759 | // the class is being initialized. getstatic/putstatic on a class |
duke@435 | 760 | // which is being_initialized may be executed by the initializing |
duke@435 | 761 | // thread but other threads have to block when they execute it. This |
duke@435 | 762 | // is accomplished in compiled code by executing a test of the current |
duke@435 | 763 | // thread against the initializing thread of the class. It's emitted |
duke@435 | 764 | // as boilerplate in their stub which allows the patched code to be |
duke@435 | 765 | // executed before it's copied back into the main body of the nmethod. |
duke@435 | 766 | // |
duke@435 | 767 | // being_init: get_thread(<tmp reg> |
duke@435 | 768 | // cmpl [reg1 + <init_thread_offset>], <tmp reg> |
duke@435 | 769 | // jne patch_stub |
duke@435 | 770 | // movl [reg1 + <const>], reg (for field offsets) <or> |
duke@435 | 771 | // movl reg, [reg1 + <const>] (for field offsets) |
duke@435 | 772 | // jmp continue |
duke@435 | 773 | // <being_init offset> <bytes to copy> <bytes to skip> |
duke@435 | 774 | // patch_stub: jmp Runtim1::patch_code (through a runtime stub) |
duke@435 | 775 | // jmp patch_site |
duke@435 | 776 | // |
duke@435 | 777 | // If the class is being initialized the patch body is rewritten and |
duke@435 | 778 | // the patch site is rewritten to jump to being_init, instead of |
duke@435 | 779 | // patch_stub. Whenever this code is executed it checks the current |
duke@435 | 780 | // thread against the intializing thread so other threads will enter |
duke@435 | 781 | // the runtime and end up blocked waiting the class to finish |
duke@435 | 782 | // initializing inside the calls to resolve_field below. The |
duke@435 | 783 | // initializing class will continue on it's way. Once the class is |
duke@435 | 784 | // fully_initialized, the intializing_thread of the class becomes |
duke@435 | 785 | // NULL, so the next thread to execute this code will fail the test, |
duke@435 | 786 | // call into patch_code and complete the patching process by copying |
duke@435 | 787 | // the patch body back into the main part of the nmethod and resume |
duke@435 | 788 | // executing. |
duke@435 | 789 | // |
duke@435 | 790 | // |
duke@435 | 791 | |
duke@435 | 792 | JRT_ENTRY(void, Runtime1::patch_code(JavaThread* thread, Runtime1::StubID stub_id )) |
duke@435 | 793 | NOT_PRODUCT(_patch_code_slowcase_cnt++;) |
duke@435 | 794 | |
duke@435 | 795 | ResourceMark rm(thread); |
duke@435 | 796 | RegisterMap reg_map(thread, false); |
duke@435 | 797 | frame runtime_frame = thread->last_frame(); |
duke@435 | 798 | frame caller_frame = runtime_frame.sender(®_map); |
duke@435 | 799 | |
duke@435 | 800 | // last java frame on stack |
duke@435 | 801 | vframeStream vfst(thread, true); |
duke@435 | 802 | assert(!vfst.at_end(), "Java frame must exist"); |
duke@435 | 803 | |
duke@435 | 804 | methodHandle caller_method(THREAD, vfst.method()); |
duke@435 | 805 | // Note that caller_method->code() may not be same as caller_code because of OSR's |
duke@435 | 806 | // Note also that in the presence of inlining it is not guaranteed |
duke@435 | 807 | // that caller_method() == caller_code->method() |
duke@435 | 808 | |
duke@435 | 809 | int bci = vfst.bci(); |
never@2462 | 810 | Bytecodes::Code code = caller_method()->java_code_at(bci); |
duke@435 | 811 | |
duke@435 | 812 | #ifndef PRODUCT |
duke@435 | 813 | // this is used by assertions in the access_field_patching_id |
duke@435 | 814 | BasicType patch_field_type = T_ILLEGAL; |
duke@435 | 815 | #endif // PRODUCT |
duke@435 | 816 | bool deoptimize_for_volatile = false; |
duke@435 | 817 | int patch_field_offset = -1; |
coleenp@4037 | 818 | KlassHandle init_klass(THREAD, NULL); // klass needed by load_klass_patching code |
coleenp@4037 | 819 | KlassHandle load_klass(THREAD, NULL); // klass needed by load_klass_patching code |
coleenp@4037 | 820 | Handle mirror(THREAD, NULL); // oop needed by load_mirror_patching code |
roland@5628 | 821 | Handle appendix(THREAD, NULL); // oop needed by appendix_patching code |
coleenp@4037 | 822 | bool load_klass_or_mirror_patch_id = |
coleenp@4037 | 823 | (stub_id == Runtime1::load_klass_patching_id || stub_id == Runtime1::load_mirror_patching_id); |
coleenp@4037 | 824 | |
duke@435 | 825 | if (stub_id == Runtime1::access_field_patching_id) { |
duke@435 | 826 | |
never@2462 | 827 | Bytecode_field field_access(caller_method, bci); |
drchase@5732 | 828 | fieldDescriptor result; // initialize class if needed |
never@2462 | 829 | Bytecodes::Code code = field_access.code(); |
duke@435 | 830 | constantPoolHandle constants(THREAD, caller_method->constants()); |
drchase@5732 | 831 | LinkResolver::resolve_field_access(result, constants, field_access.index(), Bytecodes::java_code(code), CHECK); |
drchase@5732 | 832 | patch_field_offset = result.offset(); |
duke@435 | 833 | |
duke@435 | 834 | // If we're patching a field which is volatile then at compile it |
duke@435 | 835 | // must not have been know to be volatile, so the generated code |
duke@435 | 836 | // isn't correct for a volatile reference. The nmethod has to be |
duke@435 | 837 | // deoptimized so that the code can be regenerated correctly. |
duke@435 | 838 | // This check is only needed for access_field_patching since this |
duke@435 | 839 | // is the path for patching field offsets. load_klass is only |
duke@435 | 840 | // used for patching references to oops which don't need special |
duke@435 | 841 | // handling in the volatile case. |
duke@435 | 842 | deoptimize_for_volatile = result.access_flags().is_volatile(); |
duke@435 | 843 | |
duke@435 | 844 | #ifndef PRODUCT |
duke@435 | 845 | patch_field_type = result.field_type(); |
duke@435 | 846 | #endif |
coleenp@4037 | 847 | } else if (load_klass_or_mirror_patch_id) { |
coleenp@4037 | 848 | Klass* k = NULL; |
duke@435 | 849 | switch (code) { |
duke@435 | 850 | case Bytecodes::_putstatic: |
duke@435 | 851 | case Bytecodes::_getstatic: |
coleenp@4037 | 852 | { Klass* klass = resolve_field_return_klass(caller_method, bci, CHECK); |
duke@435 | 853 | init_klass = KlassHandle(THREAD, klass); |
coleenp@4037 | 854 | mirror = Handle(THREAD, klass->java_mirror()); |
duke@435 | 855 | } |
duke@435 | 856 | break; |
duke@435 | 857 | case Bytecodes::_new: |
never@2462 | 858 | { Bytecode_new bnew(caller_method(), caller_method->bcp_from(bci)); |
never@2462 | 859 | k = caller_method->constants()->klass_at(bnew.index(), CHECK); |
duke@435 | 860 | } |
duke@435 | 861 | break; |
duke@435 | 862 | case Bytecodes::_multianewarray: |
never@2462 | 863 | { Bytecode_multianewarray mna(caller_method(), caller_method->bcp_from(bci)); |
never@2462 | 864 | k = caller_method->constants()->klass_at(mna.index(), CHECK); |
duke@435 | 865 | } |
duke@435 | 866 | break; |
duke@435 | 867 | case Bytecodes::_instanceof: |
never@2462 | 868 | { Bytecode_instanceof io(caller_method(), caller_method->bcp_from(bci)); |
never@2462 | 869 | k = caller_method->constants()->klass_at(io.index(), CHECK); |
duke@435 | 870 | } |
duke@435 | 871 | break; |
duke@435 | 872 | case Bytecodes::_checkcast: |
never@2462 | 873 | { Bytecode_checkcast cc(caller_method(), caller_method->bcp_from(bci)); |
never@2462 | 874 | k = caller_method->constants()->klass_at(cc.index(), CHECK); |
duke@435 | 875 | } |
duke@435 | 876 | break; |
duke@435 | 877 | case Bytecodes::_anewarray: |
never@2462 | 878 | { Bytecode_anewarray anew(caller_method(), caller_method->bcp_from(bci)); |
coleenp@4037 | 879 | Klass* ek = caller_method->constants()->klass_at(anew.index(), CHECK); |
hseigel@4278 | 880 | k = ek->array_klass(CHECK); |
duke@435 | 881 | } |
duke@435 | 882 | break; |
duke@435 | 883 | case Bytecodes::_ldc: |
duke@435 | 884 | case Bytecodes::_ldc_w: |
duke@435 | 885 | { |
never@2462 | 886 | Bytecode_loadconstant cc(caller_method, bci); |
coleenp@4037 | 887 | oop m = cc.resolve_constant(CHECK); |
coleenp@4037 | 888 | mirror = Handle(THREAD, m); |
duke@435 | 889 | } |
duke@435 | 890 | break; |
roland@5628 | 891 | default: fatal("unexpected bytecode for load_klass_or_mirror_patch_id"); |
duke@435 | 892 | } |
duke@435 | 893 | // convert to handle |
coleenp@4037 | 894 | load_klass = KlassHandle(THREAD, k); |
roland@5628 | 895 | } else if (stub_id == load_appendix_patching_id) { |
roland@5628 | 896 | Bytecode_invoke bytecode(caller_method, bci); |
roland@5628 | 897 | Bytecodes::Code bc = bytecode.invoke_code(); |
roland@5628 | 898 | |
roland@5628 | 899 | CallInfo info; |
roland@5628 | 900 | constantPoolHandle pool(thread, caller_method->constants()); |
roland@5628 | 901 | int index = bytecode.index(); |
roland@5628 | 902 | LinkResolver::resolve_invoke(info, Handle(), pool, index, bc, CHECK); |
roland@5628 | 903 | appendix = info.resolved_appendix(); |
roland@5628 | 904 | switch (bc) { |
roland@5628 | 905 | case Bytecodes::_invokehandle: { |
roland@5628 | 906 | int cache_index = ConstantPool::decode_cpcache_index(index, true); |
roland@5628 | 907 | assert(cache_index >= 0 && cache_index < pool->cache()->length(), "unexpected cache index"); |
roland@5628 | 908 | pool->cache()->entry_at(cache_index)->set_method_handle(pool, info); |
roland@5628 | 909 | break; |
roland@5628 | 910 | } |
roland@5628 | 911 | case Bytecodes::_invokedynamic: { |
roland@5628 | 912 | pool->invokedynamic_cp_cache_entry_at(index)->set_dynamic_call(pool, info); |
roland@5628 | 913 | break; |
roland@5628 | 914 | } |
roland@5628 | 915 | default: fatal("unexpected bytecode for load_appendix_patching_id"); |
roland@5628 | 916 | } |
duke@435 | 917 | } else { |
duke@435 | 918 | ShouldNotReachHere(); |
duke@435 | 919 | } |
duke@435 | 920 | |
duke@435 | 921 | if (deoptimize_for_volatile) { |
duke@435 | 922 | // At compile time we assumed the field wasn't volatile but after |
duke@435 | 923 | // loading it turns out it was volatile so we have to throw the |
duke@435 | 924 | // compiled code out and let it be regenerated. |
duke@435 | 925 | if (TracePatching) { |
duke@435 | 926 | tty->print_cr("Deoptimizing for patching volatile field reference"); |
duke@435 | 927 | } |
never@920 | 928 | // It's possible the nmethod was invalidated in the last |
never@920 | 929 | // safepoint, but if it's still alive then make it not_entrant. |
never@920 | 930 | nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); |
never@920 | 931 | if (nm != NULL) { |
never@920 | 932 | nm->make_not_entrant(); |
never@920 | 933 | } |
never@920 | 934 | |
never@2260 | 935 | Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
duke@435 | 936 | |
duke@435 | 937 | // Return to the now deoptimized frame. |
duke@435 | 938 | } |
duke@435 | 939 | |
duke@435 | 940 | // Now copy code back |
duke@435 | 941 | |
duke@435 | 942 | { |
duke@435 | 943 | MutexLockerEx ml_patch (Patching_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 944 | // |
duke@435 | 945 | // Deoptimization may have happened while we waited for the lock. |
duke@435 | 946 | // In that case we don't bother to do any patching we just return |
duke@435 | 947 | // and let the deopt happen |
duke@435 | 948 | if (!caller_is_deopted()) { |
duke@435 | 949 | NativeGeneralJump* jump = nativeGeneralJump_at(caller_frame.pc()); |
duke@435 | 950 | address instr_pc = jump->jump_destination(); |
duke@435 | 951 | NativeInstruction* ni = nativeInstruction_at(instr_pc); |
duke@435 | 952 | if (ni->is_jump() ) { |
duke@435 | 953 | // the jump has not been patched yet |
duke@435 | 954 | // The jump destination is slow case and therefore not part of the stubs |
duke@435 | 955 | // (stubs are only for StaticCalls) |
duke@435 | 956 | |
duke@435 | 957 | // format of buffer |
duke@435 | 958 | // .... |
duke@435 | 959 | // instr byte 0 <-- copy_buff |
duke@435 | 960 | // instr byte 1 |
duke@435 | 961 | // .. |
duke@435 | 962 | // instr byte n-1 |
duke@435 | 963 | // n |
duke@435 | 964 | // .... <-- call destination |
duke@435 | 965 | |
duke@435 | 966 | address stub_location = caller_frame.pc() + PatchingStub::patch_info_offset(); |
duke@435 | 967 | unsigned char* byte_count = (unsigned char*) (stub_location - 1); |
duke@435 | 968 | unsigned char* byte_skip = (unsigned char*) (stub_location - 2); |
duke@435 | 969 | unsigned char* being_initialized_entry_offset = (unsigned char*) (stub_location - 3); |
duke@435 | 970 | address copy_buff = stub_location - *byte_skip - *byte_count; |
duke@435 | 971 | address being_initialized_entry = stub_location - *being_initialized_entry_offset; |
duke@435 | 972 | if (TracePatching) { |
drchase@6680 | 973 | tty->print_cr(" Patching %s at bci %d at address " INTPTR_FORMAT " (%s)", Bytecodes::name(code), bci, |
drchase@6680 | 974 | p2i(instr_pc), (stub_id == Runtime1::access_field_patching_id) ? "field" : "klass"); |
duke@435 | 975 | nmethod* caller_code = CodeCache::find_nmethod(caller_frame.pc()); |
duke@435 | 976 | assert(caller_code != NULL, "nmethod not found"); |
duke@435 | 977 | |
duke@435 | 978 | // NOTE we use pc() not original_pc() because we already know they are |
duke@435 | 979 | // identical otherwise we'd have never entered this block of code |
duke@435 | 980 | |
duke@435 | 981 | OopMap* map = caller_code->oop_map_for_return_address(caller_frame.pc()); |
duke@435 | 982 | assert(map != NULL, "null check"); |
duke@435 | 983 | map->print(); |
duke@435 | 984 | tty->cr(); |
duke@435 | 985 | |
duke@435 | 986 | Disassembler::decode(copy_buff, copy_buff + *byte_count, tty); |
duke@435 | 987 | } |
duke@435 | 988 | // depending on the code below, do_patch says whether to copy the patch body back into the nmethod |
duke@435 | 989 | bool do_patch = true; |
duke@435 | 990 | if (stub_id == Runtime1::access_field_patching_id) { |
duke@435 | 991 | // The offset may not be correct if the class was not loaded at code generation time. |
duke@435 | 992 | // Set it now. |
duke@435 | 993 | NativeMovRegMem* n_move = nativeMovRegMem_at(copy_buff); |
duke@435 | 994 | assert(n_move->offset() == 0 || (n_move->offset() == 4 && (patch_field_type == T_DOUBLE || patch_field_type == T_LONG)), "illegal offset for type"); |
duke@435 | 995 | assert(patch_field_offset >= 0, "illegal offset"); |
duke@435 | 996 | n_move->add_offset_in_bytes(patch_field_offset); |
coleenp@4037 | 997 | } else if (load_klass_or_mirror_patch_id) { |
duke@435 | 998 | // If a getstatic or putstatic is referencing a klass which |
duke@435 | 999 | // isn't fully initialized, the patch body isn't copied into |
duke@435 | 1000 | // place until initialization is complete. In this case the |
duke@435 | 1001 | // patch site is setup so that any threads besides the |
duke@435 | 1002 | // initializing thread are forced to come into the VM and |
duke@435 | 1003 | // block. |
duke@435 | 1004 | do_patch = (code != Bytecodes::_getstatic && code != Bytecodes::_putstatic) || |
coleenp@4037 | 1005 | InstanceKlass::cast(init_klass())->is_initialized(); |
duke@435 | 1006 | NativeGeneralJump* jump = nativeGeneralJump_at(instr_pc); |
duke@435 | 1007 | if (jump->jump_destination() == being_initialized_entry) { |
duke@435 | 1008 | assert(do_patch == true, "initialization must be complete at this point"); |
duke@435 | 1009 | } else { |
duke@435 | 1010 | // patch the instruction <move reg, klass> |
duke@435 | 1011 | NativeMovConstReg* n_copy = nativeMovConstReg_at(copy_buff); |
bobv@2036 | 1012 | |
bobv@2036 | 1013 | assert(n_copy->data() == 0 || |
iveresov@2138 | 1014 | n_copy->data() == (intptr_t)Universe::non_oop_word(), |
bobv@2036 | 1015 | "illegal init value"); |
coleenp@4037 | 1016 | if (stub_id == Runtime1::load_klass_patching_id) { |
roland@5628 | 1017 | assert(load_klass() != NULL, "klass not set"); |
roland@5628 | 1018 | n_copy->set_data((intx) (load_klass())); |
coleenp@4037 | 1019 | } else { |
coleenp@4037 | 1020 | assert(mirror() != NULL, "klass not set"); |
stefank@6992 | 1021 | // Don't need a G1 pre-barrier here since we assert above that data isn't an oop. |
hseigel@5784 | 1022 | n_copy->set_data(cast_from_oop<intx>(mirror())); |
coleenp@4037 | 1023 | } |
duke@435 | 1024 | |
duke@435 | 1025 | if (TracePatching) { |
duke@435 | 1026 | Disassembler::decode(copy_buff, copy_buff + *byte_count, tty); |
duke@435 | 1027 | } |
roland@5628 | 1028 | } |
roland@5628 | 1029 | } else if (stub_id == Runtime1::load_appendix_patching_id) { |
roland@5628 | 1030 | NativeMovConstReg* n_copy = nativeMovConstReg_at(copy_buff); |
roland@5628 | 1031 | assert(n_copy->data() == 0 || |
roland@5628 | 1032 | n_copy->data() == (intptr_t)Universe::non_oop_word(), |
roland@5628 | 1033 | "illegal init value"); |
hseigel@5784 | 1034 | n_copy->set_data(cast_from_oop<intx>(appendix())); |
duke@435 | 1035 | |
roland@5628 | 1036 | if (TracePatching) { |
roland@5628 | 1037 | Disassembler::decode(copy_buff, copy_buff + *byte_count, tty); |
duke@435 | 1038 | } |
duke@435 | 1039 | } else { |
duke@435 | 1040 | ShouldNotReachHere(); |
duke@435 | 1041 | } |
coleenp@4037 | 1042 | |
roland@5628 | 1043 | #if defined(SPARC) || defined(PPC) |
roland@5628 | 1044 | if (load_klass_or_mirror_patch_id || |
roland@5628 | 1045 | stub_id == Runtime1::load_appendix_patching_id) { |
roland@5628 | 1046 | // Update the location in the nmethod with the proper |
roland@5628 | 1047 | // metadata. When the code was generated, a NULL was stuffed |
roland@5628 | 1048 | // in the metadata table and that table needs to be update to |
roland@5628 | 1049 | // have the right value. On intel the value is kept |
roland@5628 | 1050 | // directly in the instruction instead of in the metadata |
roland@5628 | 1051 | // table, so set_data above effectively updated the value. |
roland@5628 | 1052 | nmethod* nm = CodeCache::find_nmethod(instr_pc); |
roland@5628 | 1053 | assert(nm != NULL, "invalid nmethod_pc"); |
roland@5628 | 1054 | RelocIterator mds(nm, copy_buff, copy_buff + 1); |
roland@5628 | 1055 | bool found = false; |
roland@5628 | 1056 | while (mds.next() && !found) { |
roland@5628 | 1057 | if (mds.type() == relocInfo::oop_type) { |
roland@5628 | 1058 | assert(stub_id == Runtime1::load_mirror_patching_id || |
roland@5628 | 1059 | stub_id == Runtime1::load_appendix_patching_id, "wrong stub id"); |
roland@5628 | 1060 | oop_Relocation* r = mds.oop_reloc(); |
roland@5628 | 1061 | oop* oop_adr = r->oop_addr(); |
roland@5628 | 1062 | *oop_adr = stub_id == Runtime1::load_mirror_patching_id ? mirror() : appendix(); |
roland@5628 | 1063 | r->fix_oop_relocation(); |
roland@5628 | 1064 | found = true; |
roland@5628 | 1065 | } else if (mds.type() == relocInfo::metadata_type) { |
roland@5628 | 1066 | assert(stub_id == Runtime1::load_klass_patching_id, "wrong stub id"); |
roland@5628 | 1067 | metadata_Relocation* r = mds.metadata_reloc(); |
roland@5628 | 1068 | Metadata** metadata_adr = r->metadata_addr(); |
roland@5628 | 1069 | *metadata_adr = load_klass(); |
roland@5628 | 1070 | r->fix_metadata_relocation(); |
roland@5628 | 1071 | found = true; |
roland@5628 | 1072 | } |
roland@5628 | 1073 | } |
roland@5628 | 1074 | assert(found, "the metadata must exist!"); |
roland@5628 | 1075 | } |
roland@5628 | 1076 | #endif |
duke@435 | 1077 | if (do_patch) { |
duke@435 | 1078 | // replace instructions |
duke@435 | 1079 | // first replace the tail, then the call |
bobv@2036 | 1080 | #ifdef ARM |
jiangli@5803 | 1081 | if((load_klass_or_mirror_patch_id || |
jiangli@5803 | 1082 | stub_id == Runtime1::load_appendix_patching_id) && |
jiangli@5803 | 1083 | !VM_Version::supports_movw()) { |
vladidan@2801 | 1084 | nmethod* nm = CodeCache::find_nmethod(instr_pc); |
coleenp@4037 | 1085 | address addr = NULL; |
vladidan@2801 | 1086 | assert(nm != NULL, "invalid nmethod_pc"); |
coleenp@4037 | 1087 | RelocIterator mds(nm, copy_buff, copy_buff + 1); |
coleenp@4037 | 1088 | while (mds.next()) { |
coleenp@4037 | 1089 | if (mds.type() == relocInfo::oop_type) { |
jiangli@5803 | 1090 | assert(stub_id == Runtime1::load_mirror_patching_id || |
jiangli@5803 | 1091 | stub_id == Runtime1::load_appendix_patching_id, "wrong stub id"); |
coleenp@4037 | 1092 | oop_Relocation* r = mds.oop_reloc(); |
coleenp@4037 | 1093 | addr = (address)r->oop_addr(); |
coleenp@4037 | 1094 | break; |
coleenp@4037 | 1095 | } else if (mds.type() == relocInfo::metadata_type) { |
coleenp@4037 | 1096 | assert(stub_id == Runtime1::load_klass_patching_id, "wrong stub id"); |
coleenp@4037 | 1097 | metadata_Relocation* r = mds.metadata_reloc(); |
coleenp@4037 | 1098 | addr = (address)r->metadata_addr(); |
vladidan@2801 | 1099 | break; |
vladidan@2801 | 1100 | } |
vladidan@2801 | 1101 | } |
coleenp@4037 | 1102 | assert(addr != NULL, "metadata relocation must exist"); |
bobv@2036 | 1103 | copy_buff -= *byte_count; |
bobv@2036 | 1104 | NativeMovConstReg* n_copy2 = nativeMovConstReg_at(copy_buff); |
coleenp@4037 | 1105 | n_copy2->set_pc_relative_offset(addr, instr_pc); |
bobv@2036 | 1106 | } |
bobv@2036 | 1107 | #endif |
bobv@2036 | 1108 | |
duke@435 | 1109 | for (int i = NativeCall::instruction_size; i < *byte_count; i++) { |
duke@435 | 1110 | address ptr = copy_buff + i; |
duke@435 | 1111 | int a_byte = (*ptr) & 0xFF; |
duke@435 | 1112 | address dst = instr_pc + i; |
duke@435 | 1113 | *(unsigned char*)dst = (unsigned char) a_byte; |
duke@435 | 1114 | } |
duke@435 | 1115 | ICache::invalidate_range(instr_pc, *byte_count); |
duke@435 | 1116 | NativeGeneralJump::replace_mt_safe(instr_pc, copy_buff); |
duke@435 | 1117 | |
roland@5628 | 1118 | if (load_klass_or_mirror_patch_id || |
roland@5628 | 1119 | stub_id == Runtime1::load_appendix_patching_id) { |
coleenp@4037 | 1120 | relocInfo::relocType rtype = |
coleenp@4037 | 1121 | (stub_id == Runtime1::load_klass_patching_id) ? |
coleenp@4037 | 1122 | relocInfo::metadata_type : |
coleenp@4037 | 1123 | relocInfo::oop_type; |
coleenp@4037 | 1124 | // update relocInfo to metadata |
duke@435 | 1125 | nmethod* nm = CodeCache::find_nmethod(instr_pc); |
duke@435 | 1126 | assert(nm != NULL, "invalid nmethod_pc"); |
duke@435 | 1127 | |
duke@435 | 1128 | // The old patch site is now a move instruction so update |
duke@435 | 1129 | // the reloc info so that it will get updated during |
duke@435 | 1130 | // future GCs. |
duke@435 | 1131 | RelocIterator iter(nm, (address)instr_pc, (address)(instr_pc + 1)); |
duke@435 | 1132 | relocInfo::change_reloc_info_for_address(&iter, (address) instr_pc, |
coleenp@4037 | 1133 | relocInfo::none, rtype); |
duke@435 | 1134 | #ifdef SPARC |
coleenp@4037 | 1135 | // Sparc takes two relocations for an metadata so update the second one. |
duke@435 | 1136 | address instr_pc2 = instr_pc + NativeMovConstReg::add_offset; |
duke@435 | 1137 | RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1); |
duke@435 | 1138 | relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2, |
coleenp@4037 | 1139 | relocInfo::none, rtype); |
duke@435 | 1140 | #endif |
bobv@2036 | 1141 | #ifdef PPC |
bobv@2036 | 1142 | { address instr_pc2 = instr_pc + NativeMovConstReg::lo_offset; |
bobv@2036 | 1143 | RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1); |
coleenp@4037 | 1144 | relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2, |
coleenp@4037 | 1145 | relocInfo::none, rtype); |
bobv@2036 | 1146 | } |
bobv@2036 | 1147 | #endif |
duke@435 | 1148 | } |
duke@435 | 1149 | |
duke@435 | 1150 | } else { |
duke@435 | 1151 | ICache::invalidate_range(copy_buff, *byte_count); |
duke@435 | 1152 | NativeGeneralJump::insert_unconditional(instr_pc, being_initialized_entry); |
duke@435 | 1153 | } |
duke@435 | 1154 | } |
duke@435 | 1155 | } |
duke@435 | 1156 | } |
johnc@5548 | 1157 | |
johnc@5548 | 1158 | // If we are patching in a non-perm oop, make sure the nmethod |
johnc@5548 | 1159 | // is on the right list. |
roland@5628 | 1160 | if (ScavengeRootsInCode && ((mirror.not_null() && mirror()->is_scavengable()) || |
roland@5628 | 1161 | (appendix.not_null() && appendix->is_scavengable()))) { |
johnc@5548 | 1162 | MutexLockerEx ml_code (CodeCache_lock, Mutex::_no_safepoint_check_flag); |
johnc@5548 | 1163 | nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); |
johnc@5548 | 1164 | guarantee(nm != NULL, "only nmethods can contain non-perm oops"); |
johnc@5548 | 1165 | if (!nm->on_scavenge_root_list()) { |
johnc@5548 | 1166 | CodeCache::add_scavenge_root_nmethod(nm); |
johnc@5548 | 1167 | } |
johnc@5548 | 1168 | |
johnc@5548 | 1169 | // Since we've patched some oops in the nmethod, |
johnc@5548 | 1170 | // (re)register it with the heap. |
johnc@5548 | 1171 | Universe::heap()->register_nmethod(nm); |
johnc@5548 | 1172 | } |
duke@435 | 1173 | JRT_END |
duke@435 | 1174 | |
duke@435 | 1175 | // |
duke@435 | 1176 | // Entry point for compiled code. We want to patch a nmethod. |
duke@435 | 1177 | // We don't do a normal VM transition here because we want to |
duke@435 | 1178 | // know after the patching is complete and any safepoint(s) are taken |
duke@435 | 1179 | // if the calling nmethod was deoptimized. We do this by calling a |
duke@435 | 1180 | // helper method which does the normal VM transition and when it |
duke@435 | 1181 | // completes we can check for deoptimization. This simplifies the |
duke@435 | 1182 | // assembly code in the cpu directories. |
duke@435 | 1183 | // |
duke@435 | 1184 | int Runtime1::move_klass_patching(JavaThread* thread) { |
duke@435 | 1185 | // |
duke@435 | 1186 | // NOTE: we are still in Java |
duke@435 | 1187 | // |
duke@435 | 1188 | Thread* THREAD = thread; |
duke@435 | 1189 | debug_only(NoHandleMark nhm;) |
duke@435 | 1190 | { |
duke@435 | 1191 | // Enter VM mode |
duke@435 | 1192 | |
duke@435 | 1193 | ResetNoHandleMark rnhm; |
duke@435 | 1194 | patch_code(thread, load_klass_patching_id); |
duke@435 | 1195 | } |
duke@435 | 1196 | // Back in JAVA, use no oops DON'T safepoint |
duke@435 | 1197 | |
duke@435 | 1198 | // Return true if calling code is deoptimized |
duke@435 | 1199 | |
duke@435 | 1200 | return caller_is_deopted(); |
duke@435 | 1201 | } |
duke@435 | 1202 | |
coleenp@4037 | 1203 | int Runtime1::move_mirror_patching(JavaThread* thread) { |
coleenp@4037 | 1204 | // |
coleenp@4037 | 1205 | // NOTE: we are still in Java |
coleenp@4037 | 1206 | // |
coleenp@4037 | 1207 | Thread* THREAD = thread; |
coleenp@4037 | 1208 | debug_only(NoHandleMark nhm;) |
coleenp@4037 | 1209 | { |
coleenp@4037 | 1210 | // Enter VM mode |
coleenp@4037 | 1211 | |
coleenp@4037 | 1212 | ResetNoHandleMark rnhm; |
coleenp@4037 | 1213 | patch_code(thread, load_mirror_patching_id); |
coleenp@4037 | 1214 | } |
coleenp@4037 | 1215 | // Back in JAVA, use no oops DON'T safepoint |
coleenp@4037 | 1216 | |
coleenp@4037 | 1217 | // Return true if calling code is deoptimized |
coleenp@4037 | 1218 | |
coleenp@4037 | 1219 | return caller_is_deopted(); |
coleenp@4037 | 1220 | } |
coleenp@4037 | 1221 | |
roland@5628 | 1222 | int Runtime1::move_appendix_patching(JavaThread* thread) { |
roland@5628 | 1223 | // |
roland@5628 | 1224 | // NOTE: we are still in Java |
roland@5628 | 1225 | // |
roland@5628 | 1226 | Thread* THREAD = thread; |
roland@5628 | 1227 | debug_only(NoHandleMark nhm;) |
roland@5628 | 1228 | { |
roland@5628 | 1229 | // Enter VM mode |
roland@5628 | 1230 | |
roland@5628 | 1231 | ResetNoHandleMark rnhm; |
roland@5628 | 1232 | patch_code(thread, load_appendix_patching_id); |
roland@5628 | 1233 | } |
roland@5628 | 1234 | // Back in JAVA, use no oops DON'T safepoint |
roland@5628 | 1235 | |
roland@5628 | 1236 | // Return true if calling code is deoptimized |
roland@5628 | 1237 | |
roland@5628 | 1238 | return caller_is_deopted(); |
roland@5628 | 1239 | } |
duke@435 | 1240 | // |
duke@435 | 1241 | // Entry point for compiled code. We want to patch a nmethod. |
duke@435 | 1242 | // We don't do a normal VM transition here because we want to |
duke@435 | 1243 | // know after the patching is complete and any safepoint(s) are taken |
duke@435 | 1244 | // if the calling nmethod was deoptimized. We do this by calling a |
duke@435 | 1245 | // helper method which does the normal VM transition and when it |
duke@435 | 1246 | // completes we can check for deoptimization. This simplifies the |
duke@435 | 1247 | // assembly code in the cpu directories. |
duke@435 | 1248 | // |
duke@435 | 1249 | |
duke@435 | 1250 | int Runtime1::access_field_patching(JavaThread* thread) { |
duke@435 | 1251 | // |
duke@435 | 1252 | // NOTE: we are still in Java |
duke@435 | 1253 | // |
duke@435 | 1254 | Thread* THREAD = thread; |
duke@435 | 1255 | debug_only(NoHandleMark nhm;) |
duke@435 | 1256 | { |
duke@435 | 1257 | // Enter VM mode |
duke@435 | 1258 | |
duke@435 | 1259 | ResetNoHandleMark rnhm; |
duke@435 | 1260 | patch_code(thread, access_field_patching_id); |
duke@435 | 1261 | } |
duke@435 | 1262 | // Back in JAVA, use no oops DON'T safepoint |
duke@435 | 1263 | |
duke@435 | 1264 | // Return true if calling code is deoptimized |
duke@435 | 1265 | |
duke@435 | 1266 | return caller_is_deopted(); |
duke@435 | 1267 | JRT_END |
duke@435 | 1268 | |
duke@435 | 1269 | |
duke@435 | 1270 | JRT_LEAF(void, Runtime1::trace_block_entry(jint block_id)) |
duke@435 | 1271 | // for now we just print out the block id |
duke@435 | 1272 | tty->print("%d ", block_id); |
duke@435 | 1273 | JRT_END |
duke@435 | 1274 | |
duke@435 | 1275 | |
coleenp@548 | 1276 | // Array copy return codes. |
coleenp@548 | 1277 | enum { |
coleenp@548 | 1278 | ac_failed = -1, // arraycopy failed |
coleenp@548 | 1279 | ac_ok = 0 // arraycopy succeeded |
coleenp@548 | 1280 | }; |
coleenp@548 | 1281 | |
coleenp@548 | 1282 | |
ysr@1680 | 1283 | // Below length is the # elements copied. |
coleenp@548 | 1284 | template <class T> int obj_arraycopy_work(oopDesc* src, T* src_addr, |
coleenp@548 | 1285 | oopDesc* dst, T* dst_addr, |
coleenp@548 | 1286 | int length) { |
coleenp@548 | 1287 | |
coleenp@548 | 1288 | // For performance reasons, we assume we are using a card marking write |
coleenp@548 | 1289 | // barrier. The assert will fail if this is not the case. |
coleenp@548 | 1290 | // Note that we use the non-virtual inlineable variant of write_ref_array. |
coleenp@548 | 1291 | BarrierSet* bs = Universe::heap()->barrier_set(); |
ysr@1680 | 1292 | assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); |
ysr@1680 | 1293 | assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well."); |
coleenp@548 | 1294 | if (src == dst) { |
coleenp@548 | 1295 | // same object, no check |
ysr@1680 | 1296 | bs->write_ref_array_pre(dst_addr, length); |
coleenp@548 | 1297 | Copy::conjoint_oops_atomic(src_addr, dst_addr, length); |
ysr@1680 | 1298 | bs->write_ref_array((HeapWord*)dst_addr, length); |
coleenp@548 | 1299 | return ac_ok; |
coleenp@548 | 1300 | } else { |
coleenp@4142 | 1301 | Klass* bound = ObjArrayKlass::cast(dst->klass())->element_klass(); |
coleenp@4142 | 1302 | Klass* stype = ObjArrayKlass::cast(src->klass())->element_klass(); |
hseigel@4278 | 1303 | if (stype == bound || stype->is_subtype_of(bound)) { |
coleenp@548 | 1304 | // Elements are guaranteed to be subtypes, so no check necessary |
ysr@1680 | 1305 | bs->write_ref_array_pre(dst_addr, length); |
coleenp@548 | 1306 | Copy::conjoint_oops_atomic(src_addr, dst_addr, length); |
ysr@1680 | 1307 | bs->write_ref_array((HeapWord*)dst_addr, length); |
coleenp@548 | 1308 | return ac_ok; |
coleenp@548 | 1309 | } |
coleenp@548 | 1310 | } |
coleenp@548 | 1311 | return ac_failed; |
coleenp@548 | 1312 | } |
coleenp@548 | 1313 | |
duke@435 | 1314 | // fast and direct copy of arrays; returning -1, means that an exception may be thrown |
duke@435 | 1315 | // and we did not copy anything |
duke@435 | 1316 | JRT_LEAF(int, Runtime1::arraycopy(oopDesc* src, int src_pos, oopDesc* dst, int dst_pos, int length)) |
duke@435 | 1317 | #ifndef PRODUCT |
duke@435 | 1318 | _generic_arraycopy_cnt++; // Slow-path oop array copy |
duke@435 | 1319 | #endif |
duke@435 | 1320 | |
duke@435 | 1321 | if (src == NULL || dst == NULL || src_pos < 0 || dst_pos < 0 || length < 0) return ac_failed; |
duke@435 | 1322 | if (!dst->is_array() || !src->is_array()) return ac_failed; |
duke@435 | 1323 | if ((unsigned int) arrayOop(src)->length() < (unsigned int)src_pos + (unsigned int)length) return ac_failed; |
duke@435 | 1324 | if ((unsigned int) arrayOop(dst)->length() < (unsigned int)dst_pos + (unsigned int)length) return ac_failed; |
duke@435 | 1325 | |
duke@435 | 1326 | if (length == 0) return ac_ok; |
duke@435 | 1327 | if (src->is_typeArray()) { |
minqi@5097 | 1328 | Klass* klass_oop = src->klass(); |
duke@435 | 1329 | if (klass_oop != dst->klass()) return ac_failed; |
coleenp@4142 | 1330 | TypeArrayKlass* klass = TypeArrayKlass::cast(klass_oop); |
duke@435 | 1331 | const int l2es = klass->log2_element_size(); |
duke@435 | 1332 | const int ihs = klass->array_header_in_bytes() / wordSize; |
duke@435 | 1333 | char* src_addr = (char*) ((oopDesc**)src + ihs) + (src_pos << l2es); |
duke@435 | 1334 | char* dst_addr = (char*) ((oopDesc**)dst + ihs) + (dst_pos << l2es); |
duke@435 | 1335 | // Potential problem: memmove is not guaranteed to be word atomic |
duke@435 | 1336 | // Revisit in Merlin |
duke@435 | 1337 | memmove(dst_addr, src_addr, length << l2es); |
duke@435 | 1338 | return ac_ok; |
duke@435 | 1339 | } else if (src->is_objArray() && dst->is_objArray()) { |
iveresov@2344 | 1340 | if (UseCompressedOops) { |
coleenp@548 | 1341 | narrowOop *src_addr = objArrayOop(src)->obj_at_addr<narrowOop>(src_pos); |
coleenp@548 | 1342 | narrowOop *dst_addr = objArrayOop(dst)->obj_at_addr<narrowOop>(dst_pos); |
coleenp@548 | 1343 | return obj_arraycopy_work(src, src_addr, dst, dst_addr, length); |
duke@435 | 1344 | } else { |
coleenp@548 | 1345 | oop *src_addr = objArrayOop(src)->obj_at_addr<oop>(src_pos); |
coleenp@548 | 1346 | oop *dst_addr = objArrayOop(dst)->obj_at_addr<oop>(dst_pos); |
coleenp@548 | 1347 | return obj_arraycopy_work(src, src_addr, dst, dst_addr, length); |
duke@435 | 1348 | } |
duke@435 | 1349 | } |
duke@435 | 1350 | return ac_failed; |
duke@435 | 1351 | JRT_END |
duke@435 | 1352 | |
duke@435 | 1353 | |
duke@435 | 1354 | JRT_LEAF(void, Runtime1::primitive_arraycopy(HeapWord* src, HeapWord* dst, int length)) |
duke@435 | 1355 | #ifndef PRODUCT |
duke@435 | 1356 | _primitive_arraycopy_cnt++; |
duke@435 | 1357 | #endif |
duke@435 | 1358 | |
duke@435 | 1359 | if (length == 0) return; |
duke@435 | 1360 | // Not guaranteed to be word atomic, but that doesn't matter |
duke@435 | 1361 | // for anything but an oop array, which is covered by oop_arraycopy. |
kvn@1958 | 1362 | Copy::conjoint_jbytes(src, dst, length); |
duke@435 | 1363 | JRT_END |
duke@435 | 1364 | |
duke@435 | 1365 | JRT_LEAF(void, Runtime1::oop_arraycopy(HeapWord* src, HeapWord* dst, int num)) |
duke@435 | 1366 | #ifndef PRODUCT |
duke@435 | 1367 | _oop_arraycopy_cnt++; |
duke@435 | 1368 | #endif |
duke@435 | 1369 | |
duke@435 | 1370 | if (num == 0) return; |
ysr@1680 | 1371 | BarrierSet* bs = Universe::heap()->barrier_set(); |
ysr@1680 | 1372 | assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); |
ysr@1680 | 1373 | assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well."); |
ysr@1680 | 1374 | if (UseCompressedOops) { |
ysr@1680 | 1375 | bs->write_ref_array_pre((narrowOop*)dst, num); |
iveresov@2344 | 1376 | Copy::conjoint_oops_atomic((narrowOop*) src, (narrowOop*) dst, num); |
ysr@1680 | 1377 | } else { |
ysr@1680 | 1378 | bs->write_ref_array_pre((oop*)dst, num); |
iveresov@2344 | 1379 | Copy::conjoint_oops_atomic((oop*) src, (oop*) dst, num); |
ysr@1680 | 1380 | } |
ysr@1680 | 1381 | bs->write_ref_array(dst, num); |
duke@435 | 1382 | JRT_END |
duke@435 | 1383 | |
duke@435 | 1384 | |
roland@3838 | 1385 | JRT_LEAF(int, Runtime1::is_instance_of(oopDesc* mirror, oopDesc* obj)) |
roland@3838 | 1386 | // had to return int instead of bool, otherwise there may be a mismatch |
roland@3838 | 1387 | // between the C calling convention and the Java one. |
roland@3838 | 1388 | // e.g., on x86, GCC may clear only %al when returning a bool false, but |
roland@3838 | 1389 | // JVM takes the whole %eax as the return value, which may misinterpret |
roland@3838 | 1390 | // the return value as a boolean true. |
roland@3838 | 1391 | |
roland@3838 | 1392 | assert(mirror != NULL, "should null-check on mirror before calling"); |
coleenp@4037 | 1393 | Klass* k = java_lang_Class::as_Klass(mirror); |
roland@3838 | 1394 | return (k != NULL && obj != NULL && obj->is_a(k)) ? 1 : 0; |
roland@3838 | 1395 | JRT_END |
roland@3838 | 1396 | |
roland@4860 | 1397 | JRT_ENTRY(void, Runtime1::predicate_failed_trap(JavaThread* thread)) |
roland@4860 | 1398 | ResourceMark rm; |
roland@4860 | 1399 | |
roland@4860 | 1400 | assert(!TieredCompilation, "incompatible with tiered compilation"); |
roland@4860 | 1401 | |
roland@4860 | 1402 | RegisterMap reg_map(thread, false); |
roland@4860 | 1403 | frame runtime_frame = thread->last_frame(); |
roland@4860 | 1404 | frame caller_frame = runtime_frame.sender(®_map); |
roland@4860 | 1405 | |
roland@4860 | 1406 | nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); |
roland@4860 | 1407 | assert (nm != NULL, "no more nmethod?"); |
roland@4860 | 1408 | nm->make_not_entrant(); |
roland@4860 | 1409 | |
roland@4860 | 1410 | methodHandle m(nm->method()); |
roland@4860 | 1411 | MethodData* mdo = m->method_data(); |
roland@4860 | 1412 | |
roland@4860 | 1413 | if (mdo == NULL && !HAS_PENDING_EXCEPTION) { |
roland@4860 | 1414 | // Build an MDO. Ignore errors like OutOfMemory; |
roland@4860 | 1415 | // that simply means we won't have an MDO to update. |
roland@4860 | 1416 | Method::build_interpreter_method_data(m, THREAD); |
roland@4860 | 1417 | if (HAS_PENDING_EXCEPTION) { |
roland@4860 | 1418 | assert((PENDING_EXCEPTION->is_a(SystemDictionary::OutOfMemoryError_klass())), "we expect only an OOM error here"); |
roland@4860 | 1419 | CLEAR_PENDING_EXCEPTION; |
roland@4860 | 1420 | } |
roland@4860 | 1421 | mdo = m->method_data(); |
roland@4860 | 1422 | } |
roland@4860 | 1423 | |
roland@4860 | 1424 | if (mdo != NULL) { |
roland@4860 | 1425 | mdo->inc_trap_count(Deoptimization::Reason_none); |
roland@4860 | 1426 | } |
roland@4860 | 1427 | |
roland@4860 | 1428 | if (TracePredicateFailedTraps) { |
roland@4860 | 1429 | stringStream ss1, ss2; |
roland@4860 | 1430 | vframeStream vfst(thread); |
roland@4860 | 1431 | methodHandle inlinee = methodHandle(vfst.method()); |
roland@4860 | 1432 | inlinee->print_short_name(&ss1); |
roland@4860 | 1433 | m->print_short_name(&ss2); |
drchase@6680 | 1434 | tty->print_cr("Predicate failed trap in method %s at bci %d inlined in %s at pc " INTPTR_FORMAT, ss1.as_string(), vfst.bci(), ss2.as_string(), p2i(caller_frame.pc())); |
roland@4860 | 1435 | } |
roland@4860 | 1436 | |
roland@4860 | 1437 | |
roland@4860 | 1438 | Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
roland@4860 | 1439 | |
roland@4860 | 1440 | JRT_END |
roland@3838 | 1441 | |
duke@435 | 1442 | #ifndef PRODUCT |
duke@435 | 1443 | void Runtime1::print_statistics() { |
duke@435 | 1444 | tty->print_cr("C1 Runtime statistics:"); |
duke@435 | 1445 | tty->print_cr(" _resolve_invoke_virtual_cnt: %d", SharedRuntime::_resolve_virtual_ctr); |
duke@435 | 1446 | tty->print_cr(" _resolve_invoke_opt_virtual_cnt: %d", SharedRuntime::_resolve_opt_virtual_ctr); |
duke@435 | 1447 | tty->print_cr(" _resolve_invoke_static_cnt: %d", SharedRuntime::_resolve_static_ctr); |
duke@435 | 1448 | tty->print_cr(" _handle_wrong_method_cnt: %d", SharedRuntime::_wrong_method_ctr); |
duke@435 | 1449 | tty->print_cr(" _ic_miss_cnt: %d", SharedRuntime::_ic_miss_ctr); |
duke@435 | 1450 | tty->print_cr(" _generic_arraycopy_cnt: %d", _generic_arraycopy_cnt); |
roland@2728 | 1451 | tty->print_cr(" _generic_arraycopystub_cnt: %d", _generic_arraycopystub_cnt); |
roland@2728 | 1452 | tty->print_cr(" _byte_arraycopy_cnt: %d", _byte_arraycopy_cnt); |
roland@2728 | 1453 | tty->print_cr(" _short_arraycopy_cnt: %d", _short_arraycopy_cnt); |
roland@2728 | 1454 | tty->print_cr(" _int_arraycopy_cnt: %d", _int_arraycopy_cnt); |
roland@2728 | 1455 | tty->print_cr(" _long_arraycopy_cnt: %d", _long_arraycopy_cnt); |
duke@435 | 1456 | tty->print_cr(" _primitive_arraycopy_cnt: %d", _primitive_arraycopy_cnt); |
roland@2728 | 1457 | tty->print_cr(" _oop_arraycopy_cnt (C): %d", Runtime1::_oop_arraycopy_cnt); |
roland@2728 | 1458 | tty->print_cr(" _oop_arraycopy_cnt (stub): %d", _oop_arraycopy_cnt); |
duke@435 | 1459 | tty->print_cr(" _arraycopy_slowcase_cnt: %d", _arraycopy_slowcase_cnt); |
roland@2728 | 1460 | tty->print_cr(" _arraycopy_checkcast_cnt: %d", _arraycopy_checkcast_cnt); |
roland@2728 | 1461 | tty->print_cr(" _arraycopy_checkcast_attempt_cnt:%d", _arraycopy_checkcast_attempt_cnt); |
duke@435 | 1462 | |
duke@435 | 1463 | tty->print_cr(" _new_type_array_slowcase_cnt: %d", _new_type_array_slowcase_cnt); |
duke@435 | 1464 | tty->print_cr(" _new_object_array_slowcase_cnt: %d", _new_object_array_slowcase_cnt); |
duke@435 | 1465 | tty->print_cr(" _new_instance_slowcase_cnt: %d", _new_instance_slowcase_cnt); |
duke@435 | 1466 | tty->print_cr(" _new_multi_array_slowcase_cnt: %d", _new_multi_array_slowcase_cnt); |
duke@435 | 1467 | tty->print_cr(" _monitorenter_slowcase_cnt: %d", _monitorenter_slowcase_cnt); |
duke@435 | 1468 | tty->print_cr(" _monitorexit_slowcase_cnt: %d", _monitorexit_slowcase_cnt); |
duke@435 | 1469 | tty->print_cr(" _patch_code_slowcase_cnt: %d", _patch_code_slowcase_cnt); |
duke@435 | 1470 | |
duke@435 | 1471 | tty->print_cr(" _throw_range_check_exception_count: %d:", _throw_range_check_exception_count); |
duke@435 | 1472 | tty->print_cr(" _throw_index_exception_count: %d:", _throw_index_exception_count); |
duke@435 | 1473 | tty->print_cr(" _throw_div0_exception_count: %d:", _throw_div0_exception_count); |
duke@435 | 1474 | tty->print_cr(" _throw_null_pointer_exception_count: %d:", _throw_null_pointer_exception_count); |
duke@435 | 1475 | tty->print_cr(" _throw_class_cast_exception_count: %d:", _throw_class_cast_exception_count); |
duke@435 | 1476 | tty->print_cr(" _throw_incompatible_class_change_error_count: %d:", _throw_incompatible_class_change_error_count); |
duke@435 | 1477 | tty->print_cr(" _throw_array_store_exception_count: %d:", _throw_array_store_exception_count); |
duke@435 | 1478 | tty->print_cr(" _throw_count: %d:", _throw_count); |
duke@435 | 1479 | |
duke@435 | 1480 | SharedRuntime::print_ic_miss_histogram(); |
duke@435 | 1481 | tty->cr(); |
duke@435 | 1482 | } |
duke@435 | 1483 | #endif // PRODUCT |