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