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