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