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