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