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