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