1 /*
2 * Copyright 1997-2010 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
24
25 #include "incls/_precompiled.incl"
26 #include "incls/_sharedRuntime.cpp.incl"
27 #include <math.h>
28
29 HS_DTRACE_PROBE_DECL4(hotspot, object__alloc, Thread*, char*, int, size_t);
30 HS_DTRACE_PROBE_DECL7(hotspot, method__entry, int,
31 char*, int, char*, int, char*, int);
32 HS_DTRACE_PROBE_DECL7(hotspot, method__return, int,
33 char*, int, char*, int, char*, int);
34
35 // Implementation of SharedRuntime
36
37 #ifndef PRODUCT
38 // For statistics
39 int SharedRuntime::_ic_miss_ctr = 0;
40 int SharedRuntime::_wrong_method_ctr = 0;
41 int SharedRuntime::_resolve_static_ctr = 0;
42 int SharedRuntime::_resolve_virtual_ctr = 0;
43 int SharedRuntime::_resolve_opt_virtual_ctr = 0;
44 int SharedRuntime::_implicit_null_throws = 0;
45 int SharedRuntime::_implicit_div0_throws = 0;
46 int SharedRuntime::_throw_null_ctr = 0;
47
48 int SharedRuntime::_nof_normal_calls = 0;
49 int SharedRuntime::_nof_optimized_calls = 0;
50 int SharedRuntime::_nof_inlined_calls = 0;
51 int SharedRuntime::_nof_megamorphic_calls = 0;
52 int SharedRuntime::_nof_static_calls = 0;
53 int SharedRuntime::_nof_inlined_static_calls = 0;
54 int SharedRuntime::_nof_interface_calls = 0;
55 int SharedRuntime::_nof_optimized_interface_calls = 0;
56 int SharedRuntime::_nof_inlined_interface_calls = 0;
57 int SharedRuntime::_nof_megamorphic_interface_calls = 0;
58 int SharedRuntime::_nof_removable_exceptions = 0;
59
60 int SharedRuntime::_new_instance_ctr=0;
61 int SharedRuntime::_new_array_ctr=0;
62 int SharedRuntime::_multi1_ctr=0;
63 int SharedRuntime::_multi2_ctr=0;
64 int SharedRuntime::_multi3_ctr=0;
65 int SharedRuntime::_multi4_ctr=0;
66 int SharedRuntime::_multi5_ctr=0;
67 int SharedRuntime::_mon_enter_stub_ctr=0;
68 int SharedRuntime::_mon_exit_stub_ctr=0;
69 int SharedRuntime::_mon_enter_ctr=0;
70 int SharedRuntime::_mon_exit_ctr=0;
71 int SharedRuntime::_partial_subtype_ctr=0;
72 int SharedRuntime::_jbyte_array_copy_ctr=0;
73 int SharedRuntime::_jshort_array_copy_ctr=0;
74 int SharedRuntime::_jint_array_copy_ctr=0;
75 int SharedRuntime::_jlong_array_copy_ctr=0;
76 int SharedRuntime::_oop_array_copy_ctr=0;
77 int SharedRuntime::_checkcast_array_copy_ctr=0;
78 int SharedRuntime::_unsafe_array_copy_ctr=0;
79 int SharedRuntime::_generic_array_copy_ctr=0;
80 int SharedRuntime::_slow_array_copy_ctr=0;
81 int SharedRuntime::_find_handler_ctr=0;
82 int SharedRuntime::_rethrow_ctr=0;
83
84 int SharedRuntime::_ICmiss_index = 0;
85 int SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count];
86 address SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count];
87
88 void SharedRuntime::trace_ic_miss(address at) {
89 for (int i = 0; i < _ICmiss_index; i++) {
90 if (_ICmiss_at[i] == at) {
91 _ICmiss_count[i]++;
92 return;
93 }
94 }
95 int index = _ICmiss_index++;
96 if (_ICmiss_index >= maxICmiss_count) _ICmiss_index = maxICmiss_count - 1;
97 _ICmiss_at[index] = at;
98 _ICmiss_count[index] = 1;
99 }
100
101 void SharedRuntime::print_ic_miss_histogram() {
102 if (ICMissHistogram) {
103 tty->print_cr ("IC Miss Histogram:");
104 int tot_misses = 0;
105 for (int i = 0; i < _ICmiss_index; i++) {
106 tty->print_cr(" at: " INTPTR_FORMAT " nof: %d", _ICmiss_at[i], _ICmiss_count[i]);
107 tot_misses += _ICmiss_count[i];
108 }
109 tty->print_cr ("Total IC misses: %7d", tot_misses);
110 }
111 }
112 #endif // PRODUCT
113
114 #ifndef SERIALGC
115
116 // G1 write-barrier pre: executed before a pointer store.
117 JRT_LEAF(void, SharedRuntime::g1_wb_pre(oopDesc* orig, JavaThread *thread))
118 if (orig == NULL) {
119 assert(false, "should be optimized out");
120 return;
121 }
122 assert(orig->is_oop(true /* ignore mark word */), "Error");
123 // store the original value that was in the field reference
124 thread->satb_mark_queue().enqueue(orig);
125 JRT_END
126
127 // G1 write-barrier post: executed after a pointer store.
128 JRT_LEAF(void, SharedRuntime::g1_wb_post(void* card_addr, JavaThread* thread))
129 thread->dirty_card_queue().enqueue(card_addr);
130 JRT_END
131
132 #endif // !SERIALGC
133
134
135 JRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x))
136 return x * y;
137 JRT_END
138
139
140 JRT_LEAF(jlong, SharedRuntime::ldiv(jlong y, jlong x))
141 if (x == min_jlong && y == CONST64(-1)) {
142 return x;
143 } else {
144 return x / y;
145 }
146 JRT_END
147
148
149 JRT_LEAF(jlong, SharedRuntime::lrem(jlong y, jlong x))
150 if (x == min_jlong && y == CONST64(-1)) {
151 return 0;
152 } else {
153 return x % y;
154 }
155 JRT_END
156
157
158 const juint float_sign_mask = 0x7FFFFFFF;
159 const juint float_infinity = 0x7F800000;
160 const julong double_sign_mask = CONST64(0x7FFFFFFFFFFFFFFF);
161 const julong double_infinity = CONST64(0x7FF0000000000000);
162
163 JRT_LEAF(jfloat, SharedRuntime::frem(jfloat x, jfloat y))
164 #ifdef _WIN64
165 // 64-bit Windows on amd64 returns the wrong values for
166 // infinity operands.
167 union { jfloat f; juint i; } xbits, ybits;
168 xbits.f = x;
169 ybits.f = y;
170 // x Mod Infinity == x unless x is infinity
171 if ( ((xbits.i & float_sign_mask) != float_infinity) &&
172 ((ybits.i & float_sign_mask) == float_infinity) ) {
173 return x;
174 }
175 #endif
176 return ((jfloat)fmod((double)x,(double)y));
177 JRT_END
178
179
180 JRT_LEAF(jdouble, SharedRuntime::drem(jdouble x, jdouble y))
181 #ifdef _WIN64
182 union { jdouble d; julong l; } xbits, ybits;
183 xbits.d = x;
184 ybits.d = y;
185 // x Mod Infinity == x unless x is infinity
186 if ( ((xbits.l & double_sign_mask) != double_infinity) &&
187 ((ybits.l & double_sign_mask) == double_infinity) ) {
188 return x;
189 }
190 #endif
191 return ((jdouble)fmod((double)x,(double)y));
192 JRT_END
193
194
195 JRT_LEAF(jint, SharedRuntime::f2i(jfloat x))
196 if (g_isnan(x))
197 return 0;
198 if (x >= (jfloat) max_jint)
199 return max_jint;
200 if (x <= (jfloat) min_jint)
201 return min_jint;
202 return (jint) x;
203 JRT_END
204
205
206 JRT_LEAF(jlong, SharedRuntime::f2l(jfloat x))
207 if (g_isnan(x))
208 return 0;
209 if (x >= (jfloat) max_jlong)
210 return max_jlong;
211 if (x <= (jfloat) min_jlong)
212 return min_jlong;
213 return (jlong) x;
214 JRT_END
215
216
217 JRT_LEAF(jint, SharedRuntime::d2i(jdouble x))
218 if (g_isnan(x))
219 return 0;
220 if (x >= (jdouble) max_jint)
221 return max_jint;
222 if (x <= (jdouble) min_jint)
223 return min_jint;
224 return (jint) x;
225 JRT_END
226
227
228 JRT_LEAF(jlong, SharedRuntime::d2l(jdouble x))
229 if (g_isnan(x))
230 return 0;
231 if (x >= (jdouble) max_jlong)
232 return max_jlong;
233 if (x <= (jdouble) min_jlong)
234 return min_jlong;
235 return (jlong) x;
236 JRT_END
237
238
239 JRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x))
240 return (jfloat)x;
241 JRT_END
242
243
244 JRT_LEAF(jfloat, SharedRuntime::l2f(jlong x))
245 return (jfloat)x;
246 JRT_END
247
248
249 JRT_LEAF(jdouble, SharedRuntime::l2d(jlong x))
250 return (jdouble)x;
251 JRT_END
252
253 // Exception handling accross interpreter/compiler boundaries
254 //
255 // exception_handler_for_return_address(...) returns the continuation address.
256 // The continuation address is the entry point of the exception handler of the
257 // previous frame depending on the return address.
258
259 address SharedRuntime::raw_exception_handler_for_return_address(address return_address) {
260 assert(frame::verify_return_pc(return_address), "must be a return pc");
261
262 // the fastest case first
263 CodeBlob* blob = CodeCache::find_blob(return_address);
264 if (blob != NULL && blob->is_nmethod()) {
265 nmethod* code = (nmethod*)blob;
266 assert(code != NULL, "nmethod must be present");
267 // native nmethods don't have exception handlers
268 assert(!code->is_native_method(), "no exception handler");
269 assert(code->header_begin() != code->exception_begin(), "no exception handler");
270 if (code->is_deopt_pc(return_address)) {
271 return SharedRuntime::deopt_blob()->unpack_with_exception();
272 } else {
273 return code->exception_begin();
274 }
275 }
276
277 // Entry code
278 if (StubRoutines::returns_to_call_stub(return_address)) {
279 return StubRoutines::catch_exception_entry();
280 }
281 // Interpreted code
282 if (Interpreter::contains(return_address)) {
283 return Interpreter::rethrow_exception_entry();
284 }
285
286 // Compiled code
287 if (CodeCache::contains(return_address)) {
288 CodeBlob* blob = CodeCache::find_blob(return_address);
289 if (blob->is_nmethod()) {
290 nmethod* code = (nmethod*)blob;
291 assert(code != NULL, "nmethod must be present");
292 assert(code->header_begin() != code->exception_begin(), "no exception handler");
293 return code->exception_begin();
294 }
295 if (blob->is_runtime_stub()) {
296 ShouldNotReachHere(); // callers are responsible for skipping runtime stub frames
297 }
298 }
299 guarantee(!VtableStubs::contains(return_address), "NULL exceptions in vtables should have been handled already!");
300 #ifndef PRODUCT
301 { ResourceMark rm;
302 tty->print_cr("No exception handler found for exception at " INTPTR_FORMAT " - potential problems:", return_address);
303 tty->print_cr("a) exception happened in (new?) code stubs/buffers that is not handled here");
304 tty->print_cr("b) other problem");
305 }
306 #endif // PRODUCT
307 ShouldNotReachHere();
308 return NULL;
309 }
310
311
312 JRT_LEAF(address, SharedRuntime::exception_handler_for_return_address(address return_address))
313 return raw_exception_handler_for_return_address(return_address);
314 JRT_END
315
316 address SharedRuntime::get_poll_stub(address pc) {
317 address stub;
318 // Look up the code blob
319 CodeBlob *cb = CodeCache::find_blob(pc);
320
321 // Should be an nmethod
322 assert( cb && cb->is_nmethod(), "safepoint polling: pc must refer to an nmethod" );
323
324 // Look up the relocation information
325 assert( ((nmethod*)cb)->is_at_poll_or_poll_return(pc),
326 "safepoint polling: type must be poll" );
327
328 assert( ((NativeInstruction*)pc)->is_safepoint_poll(),
329 "Only polling locations are used for safepoint");
330
331 bool at_poll_return = ((nmethod*)cb)->is_at_poll_return(pc);
332 if (at_poll_return) {
333 assert(SharedRuntime::polling_page_return_handler_blob() != NULL,
334 "polling page return stub not created yet");
335 stub = SharedRuntime::polling_page_return_handler_blob()->instructions_begin();
336 } else {
337 assert(SharedRuntime::polling_page_safepoint_handler_blob() != NULL,
338 "polling page safepoint stub not created yet");
339 stub = SharedRuntime::polling_page_safepoint_handler_blob()->instructions_begin();
340 }
341 #ifndef PRODUCT
342 if( TraceSafepoint ) {
343 char buf[256];
344 jio_snprintf(buf, sizeof(buf),
345 "... found polling page %s exception at pc = "
346 INTPTR_FORMAT ", stub =" INTPTR_FORMAT,
347 at_poll_return ? "return" : "loop",
348 (intptr_t)pc, (intptr_t)stub);
349 tty->print_raw_cr(buf);
350 }
351 #endif // PRODUCT
352 return stub;
353 }
354
355
356 oop SharedRuntime::retrieve_receiver( symbolHandle sig, frame caller ) {
357 assert(caller.is_interpreted_frame(), "");
358 int args_size = ArgumentSizeComputer(sig).size() + 1;
359 assert(args_size <= caller.interpreter_frame_expression_stack_size(), "receiver must be on interpreter stack");
360 oop result = (oop) *caller.interpreter_frame_tos_at(args_size - 1);
361 assert(Universe::heap()->is_in(result) && result->is_oop(), "receiver must be an oop");
362 return result;
363 }
364
365
366 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Handle h_exception) {
367 if (JvmtiExport::can_post_exceptions()) {
368 vframeStream vfst(thread, true);
369 methodHandle method = methodHandle(thread, vfst.method());
370 address bcp = method()->bcp_from(vfst.bci());
371 JvmtiExport::post_exception_throw(thread, method(), bcp, h_exception());
372 }
373 Exceptions::_throw(thread, __FILE__, __LINE__, h_exception);
374 }
375
376 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, symbolOop name, const char *message) {
377 Handle h_exception = Exceptions::new_exception(thread, name, message);
378 throw_and_post_jvmti_exception(thread, h_exception);
379 }
380
381 // The interpreter code to call this tracing function is only
382 // called/generated when TraceRedefineClasses has the right bits
383 // set. Since obsolete methods are never compiled, we don't have
384 // to modify the compilers to generate calls to this function.
385 //
386 JRT_LEAF(int, SharedRuntime::rc_trace_method_entry(
387 JavaThread* thread, methodOopDesc* method))
388 assert(RC_TRACE_IN_RANGE(0x00001000, 0x00002000), "wrong call");
389
390 if (method->is_obsolete()) {
391 // We are calling an obsolete method, but this is not necessarily
392 // an error. Our method could have been redefined just after we
393 // fetched the methodOop from the constant pool.
394
395 // RC_TRACE macro has an embedded ResourceMark
396 RC_TRACE_WITH_THREAD(0x00001000, thread,
397 ("calling obsolete method '%s'",
398 method->name_and_sig_as_C_string()));
399 if (RC_TRACE_ENABLED(0x00002000)) {
400 // this option is provided to debug calls to obsolete methods
401 guarantee(false, "faulting at call to an obsolete method.");
402 }
403 }
404 return 0;
405 JRT_END
406
407 // ret_pc points into caller; we are returning caller's exception handler
408 // for given exception
409 address SharedRuntime::compute_compiled_exc_handler(nmethod* nm, address ret_pc, Handle& exception,
410 bool force_unwind, bool top_frame_only) {
411 assert(nm != NULL, "must exist");
412 ResourceMark rm;
413
414 ScopeDesc* sd = nm->scope_desc_at(ret_pc);
415 // determine handler bci, if any
416 EXCEPTION_MARK;
417
418 int handler_bci = -1;
419 int scope_depth = 0;
420 if (!force_unwind) {
421 int bci = sd->bci();
422 do {
423 bool skip_scope_increment = false;
424 // exception handler lookup
425 KlassHandle ek (THREAD, exception->klass());
426 handler_bci = sd->method()->fast_exception_handler_bci_for(ek, bci, THREAD);
427 if (HAS_PENDING_EXCEPTION) {
428 // We threw an exception while trying to find the exception handler.
429 // Transfer the new exception to the exception handle which will
430 // be set into thread local storage, and do another lookup for an
431 // exception handler for this exception, this time starting at the
432 // BCI of the exception handler which caused the exception to be
433 // thrown (bugs 4307310 and 4546590). Set "exception" reference
434 // argument to ensure that the correct exception is thrown (4870175).
435 exception = Handle(THREAD, PENDING_EXCEPTION);
436 CLEAR_PENDING_EXCEPTION;
437 if (handler_bci >= 0) {
438 bci = handler_bci;
439 handler_bci = -1;
440 skip_scope_increment = true;
441 }
442 }
443 if (!top_frame_only && handler_bci < 0 && !skip_scope_increment) {
444 sd = sd->sender();
445 if (sd != NULL) {
446 bci = sd->bci();
447 }
448 ++scope_depth;
449 }
450 } while (!top_frame_only && handler_bci < 0 && sd != NULL);
451 }
452
453 // found handling method => lookup exception handler
454 int catch_pco = ret_pc - nm->instructions_begin();
455
456 ExceptionHandlerTable table(nm);
457 HandlerTableEntry *t = table.entry_for(catch_pco, handler_bci, scope_depth);
458 if (t == NULL && (nm->is_compiled_by_c1() || handler_bci != -1)) {
459 // Allow abbreviated catch tables. The idea is to allow a method
460 // to materialize its exceptions without committing to the exact
461 // routing of exceptions. In particular this is needed for adding
462 // a synthethic handler to unlock monitors when inlining
463 // synchonized methods since the unlock path isn't represented in
464 // the bytecodes.
465 t = table.entry_for(catch_pco, -1, 0);
466 }
467
468 #ifdef COMPILER1
469 if (nm->is_compiled_by_c1() && t == NULL && handler_bci == -1) {
470 // Exception is not handled by this frame so unwind. Note that
471 // this is not the same as how C2 does this. C2 emits a table
472 // entry that dispatches to the unwind code in the nmethod.
473 return NULL;
474 }
475 #endif /* COMPILER1 */
476
477
478 if (t == NULL) {
479 tty->print_cr("MISSING EXCEPTION HANDLER for pc " INTPTR_FORMAT " and handler bci %d", ret_pc, handler_bci);
480 tty->print_cr(" Exception:");
481 exception->print();
482 tty->cr();
483 tty->print_cr(" Compiled exception table :");
484 table.print();
485 nm->print_code();
486 guarantee(false, "missing exception handler");
487 return NULL;
488 }
489
490 return nm->instructions_begin() + t->pco();
491 }
492
493 JRT_ENTRY(void, SharedRuntime::throw_AbstractMethodError(JavaThread* thread))
494 // These errors occur only at call sites
495 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_AbstractMethodError());
496 JRT_END
497
498 JRT_ENTRY(void, SharedRuntime::throw_IncompatibleClassChangeError(JavaThread* thread))
499 // These errors occur only at call sites
500 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError(), "vtable stub");
501 JRT_END
502
503 JRT_ENTRY(void, SharedRuntime::throw_ArithmeticException(JavaThread* thread))
504 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
505 JRT_END
506
507 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* thread))
508 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
509 JRT_END
510
511 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException_at_call(JavaThread* thread))
512 // This entry point is effectively only used for NullPointerExceptions which occur at inline
513 // cache sites (when the callee activation is not yet set up) so we are at a call site
514 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
515 JRT_END
516
517 JRT_ENTRY(void, SharedRuntime::throw_StackOverflowError(JavaThread* thread))
518 // We avoid using the normal exception construction in this case because
519 // it performs an upcall to Java, and we're already out of stack space.
520 klassOop k = SystemDictionary::StackOverflowError_klass();
521 oop exception_oop = instanceKlass::cast(k)->allocate_instance(CHECK);
522 Handle exception (thread, exception_oop);
523 if (StackTraceInThrowable) {
524 java_lang_Throwable::fill_in_stack_trace(exception);
525 }
526 throw_and_post_jvmti_exception(thread, exception);
527 JRT_END
528
529 address SharedRuntime::continuation_for_implicit_exception(JavaThread* thread,
530 address pc,
531 SharedRuntime::ImplicitExceptionKind exception_kind)
532 {
533 address target_pc = NULL;
534
535 if (Interpreter::contains(pc)) {
536 #ifdef CC_INTERP
537 // C++ interpreter doesn't throw implicit exceptions
538 ShouldNotReachHere();
539 #else
540 switch (exception_kind) {
541 case IMPLICIT_NULL: return Interpreter::throw_NullPointerException_entry();
542 case IMPLICIT_DIVIDE_BY_ZERO: return Interpreter::throw_ArithmeticException_entry();
543 case STACK_OVERFLOW: return Interpreter::throw_StackOverflowError_entry();
544 default: ShouldNotReachHere();
545 }
546 #endif // !CC_INTERP
547 } else {
548 switch (exception_kind) {
549 case STACK_OVERFLOW: {
550 // Stack overflow only occurs upon frame setup; the callee is
551 // going to be unwound. Dispatch to a shared runtime stub
552 // which will cause the StackOverflowError to be fabricated
553 // and processed.
554 // For stack overflow in deoptimization blob, cleanup thread.
555 if (thread->deopt_mark() != NULL) {
556 Deoptimization::cleanup_deopt_info(thread, NULL);
557 }
558 return StubRoutines::throw_StackOverflowError_entry();
559 }
560
561 case IMPLICIT_NULL: {
562 if (VtableStubs::contains(pc)) {
563 // We haven't yet entered the callee frame. Fabricate an
564 // exception and begin dispatching it in the caller. Since
565 // the caller was at a call site, it's safe to destroy all
566 // caller-saved registers, as these entry points do.
567 VtableStub* vt_stub = VtableStubs::stub_containing(pc);
568
569 // If vt_stub is NULL, then return NULL to signal handler to report the SEGV error.
570 if (vt_stub == NULL) return NULL;
571
572 if (vt_stub->is_abstract_method_error(pc)) {
573 assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs");
574 return StubRoutines::throw_AbstractMethodError_entry();
575 } else {
576 return StubRoutines::throw_NullPointerException_at_call_entry();
577 }
578 } else {
579 CodeBlob* cb = CodeCache::find_blob(pc);
580
581 // If code blob is NULL, then return NULL to signal handler to report the SEGV error.
582 if (cb == NULL) return NULL;
583
584 // Exception happened in CodeCache. Must be either:
585 // 1. Inline-cache check in C2I handler blob,
586 // 2. Inline-cache check in nmethod, or
587 // 3. Implict null exception in nmethod
588
589 if (!cb->is_nmethod()) {
590 guarantee(cb->is_adapter_blob(),
591 "exception happened outside interpreter, nmethods and vtable stubs (1)");
592 // There is no handler here, so we will simply unwind.
593 return StubRoutines::throw_NullPointerException_at_call_entry();
594 }
595
596 // Otherwise, it's an nmethod. Consult its exception handlers.
597 nmethod* nm = (nmethod*)cb;
598 if (nm->inlinecache_check_contains(pc)) {
599 // exception happened inside inline-cache check code
600 // => the nmethod is not yet active (i.e., the frame
601 // is not set up yet) => use return address pushed by
602 // caller => don't push another return address
603 return StubRoutines::throw_NullPointerException_at_call_entry();
604 }
605
606 #ifndef PRODUCT
607 _implicit_null_throws++;
608 #endif
609 target_pc = nm->continuation_for_implicit_exception(pc);
610 guarantee(target_pc != 0, "must have a continuation point");
611 }
612
613 break; // fall through
614 }
615
616
617 case IMPLICIT_DIVIDE_BY_ZERO: {
618 nmethod* nm = CodeCache::find_nmethod(pc);
619 guarantee(nm != NULL, "must have containing nmethod for implicit division-by-zero exceptions");
620 #ifndef PRODUCT
621 _implicit_div0_throws++;
622 #endif
623 target_pc = nm->continuation_for_implicit_exception(pc);
624 guarantee(target_pc != 0, "must have a continuation point");
625 break; // fall through
626 }
627
628 default: ShouldNotReachHere();
629 }
630
631 guarantee(target_pc != NULL, "must have computed destination PC for implicit exception");
632 assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind");
633
634 // for AbortVMOnException flag
635 NOT_PRODUCT(Exceptions::debug_check_abort("java.lang.NullPointerException"));
636 if (exception_kind == IMPLICIT_NULL) {
637 Events::log("Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
638 } else {
639 Events::log("Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
640 }
641 return target_pc;
642 }
643
644 ShouldNotReachHere();
645 return NULL;
646 }
647
648
649 JNI_ENTRY(void, throw_unsatisfied_link_error(JNIEnv* env, ...))
650 {
651 THROW(vmSymbols::java_lang_UnsatisfiedLinkError());
652 }
653 JNI_END
654
655
656 address SharedRuntime::native_method_throw_unsatisfied_link_error_entry() {
657 return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error);
658 }
659
660
661 #ifndef PRODUCT
662 JRT_ENTRY(intptr_t, SharedRuntime::trace_bytecode(JavaThread* thread, intptr_t preserve_this_value, intptr_t tos, intptr_t tos2))
663 const frame f = thread->last_frame();
664 assert(f.is_interpreted_frame(), "must be an interpreted frame");
665 #ifndef PRODUCT
666 methodHandle mh(THREAD, f.interpreter_frame_method());
667 BytecodeTracer::trace(mh, f.interpreter_frame_bcp(), tos, tos2);
668 #endif // !PRODUCT
669 return preserve_this_value;
670 JRT_END
671 #endif // !PRODUCT
672
673
674 JRT_ENTRY(void, SharedRuntime::yield_all(JavaThread* thread, int attempts))
675 os::yield_all(attempts);
676 JRT_END
677
678
679 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* thread, oopDesc* obj))
680 assert(obj->is_oop(), "must be a valid oop");
681 assert(obj->klass()->klass_part()->has_finalizer(), "shouldn't be here otherwise");
682 instanceKlass::register_finalizer(instanceOop(obj), CHECK);
683 JRT_END
684
685
686 jlong SharedRuntime::get_java_tid(Thread* thread) {
687 if (thread != NULL) {
688 if (thread->is_Java_thread()) {
689 oop obj = ((JavaThread*)thread)->threadObj();
690 return (obj == NULL) ? 0 : java_lang_Thread::thread_id(obj);
691 }
692 }
693 return 0;
694 }
695
696 /**
697 * This function ought to be a void function, but cannot be because
698 * it gets turned into a tail-call on sparc, which runs into dtrace bug
699 * 6254741. Once that is fixed we can remove the dummy return value.
700 */
701 int SharedRuntime::dtrace_object_alloc(oopDesc* o) {
702 return dtrace_object_alloc_base(Thread::current(), o);
703 }
704
705 int SharedRuntime::dtrace_object_alloc_base(Thread* thread, oopDesc* o) {
706 assert(DTraceAllocProbes, "wrong call");
707 Klass* klass = o->blueprint();
708 int size = o->size();
709 symbolOop name = klass->name();
710 HS_DTRACE_PROBE4(hotspot, object__alloc, get_java_tid(thread),
711 name->bytes(), name->utf8_length(), size * HeapWordSize);
712 return 0;
713 }
714
715 JRT_LEAF(int, SharedRuntime::dtrace_method_entry(
716 JavaThread* thread, methodOopDesc* method))
717 assert(DTraceMethodProbes, "wrong call");
718 symbolOop kname = method->klass_name();
719 symbolOop name = method->name();
720 symbolOop sig = method->signature();
721 HS_DTRACE_PROBE7(hotspot, method__entry, get_java_tid(thread),
722 kname->bytes(), kname->utf8_length(),
723 name->bytes(), name->utf8_length(),
724 sig->bytes(), sig->utf8_length());
725 return 0;
726 JRT_END
727
728 JRT_LEAF(int, SharedRuntime::dtrace_method_exit(
729 JavaThread* thread, methodOopDesc* method))
730 assert(DTraceMethodProbes, "wrong call");
731 symbolOop kname = method->klass_name();
732 symbolOop name = method->name();
733 symbolOop sig = method->signature();
734 HS_DTRACE_PROBE7(hotspot, method__return, get_java_tid(thread),
735 kname->bytes(), kname->utf8_length(),
736 name->bytes(), name->utf8_length(),
737 sig->bytes(), sig->utf8_length());
738 return 0;
739 JRT_END
740
741
742 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode)
743 // for a call current in progress, i.e., arguments has been pushed on stack
744 // put callee has not been invoked yet. Used by: resolve virtual/static,
745 // vtable updates, etc. Caller frame must be compiled.
746 Handle SharedRuntime::find_callee_info(JavaThread* thread, Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) {
747 ResourceMark rm(THREAD);
748
749 // last java frame on stack (which includes native call frames)
750 vframeStream vfst(thread, true); // Do not skip and javaCalls
751
752 return find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(Handle()));
753 }
754
755
756 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode
757 // for a call current in progress, i.e., arguments has been pushed on stack
758 // but callee has not been invoked yet. Caller frame must be compiled.
759 Handle SharedRuntime::find_callee_info_helper(JavaThread* thread,
760 vframeStream& vfst,
761 Bytecodes::Code& bc,
762 CallInfo& callinfo, TRAPS) {
763 Handle receiver;
764 Handle nullHandle; //create a handy null handle for exception returns
765
766 assert(!vfst.at_end(), "Java frame must exist");
767
768 // Find caller and bci from vframe
769 methodHandle caller (THREAD, vfst.method());
770 int bci = vfst.bci();
771
772 // Find bytecode
773 Bytecode_invoke* bytecode = Bytecode_invoke_at(caller, bci);
774 bc = bytecode->adjusted_invoke_code();
775 int bytecode_index = bytecode->index();
776
777 // Find receiver for non-static call
778 if (bc != Bytecodes::_invokestatic) {
779 // This register map must be update since we need to find the receiver for
780 // compiled frames. The receiver might be in a register.
781 RegisterMap reg_map2(thread);
782 frame stubFrame = thread->last_frame();
783 // Caller-frame is a compiled frame
784 frame callerFrame = stubFrame.sender(®_map2);
785
786 methodHandle callee = bytecode->static_target(CHECK_(nullHandle));
787 if (callee.is_null()) {
788 THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle);
789 }
790 // Retrieve from a compiled argument list
791 receiver = Handle(THREAD, callerFrame.retrieve_receiver(®_map2));
792
793 if (receiver.is_null()) {
794 THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle);
795 }
796 }
797
798 // Resolve method. This is parameterized by bytecode.
799 constantPoolHandle constants (THREAD, caller->constants());
800 assert (receiver.is_null() || receiver->is_oop(), "wrong receiver");
801 LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_(nullHandle));
802
803 #ifdef ASSERT
804 // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls
805 if (bc != Bytecodes::_invokestatic && bc != Bytecodes::_invokedynamic) {
806 assert(receiver.not_null(), "should have thrown exception");
807 KlassHandle receiver_klass (THREAD, receiver->klass());
808 klassOop rk = constants->klass_ref_at(bytecode_index, CHECK_(nullHandle));
809 // klass is already loaded
810 KlassHandle static_receiver_klass (THREAD, rk);
811 assert(receiver_klass->is_subtype_of(static_receiver_klass()), "actual receiver must be subclass of static receiver klass");
812 if (receiver_klass->oop_is_instance()) {
813 if (instanceKlass::cast(receiver_klass())->is_not_initialized()) {
814 tty->print_cr("ERROR: Klass not yet initialized!!");
815 receiver_klass.print();
816 }
817 assert (!instanceKlass::cast(receiver_klass())->is_not_initialized(), "receiver_klass must be initialized");
818 }
819 }
820 #endif
821
822 return receiver;
823 }
824
825 methodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) {
826 ResourceMark rm(THREAD);
827 // We need first to check if any Java activations (compiled, interpreted)
828 // exist on the stack since last JavaCall. If not, we need
829 // to get the target method from the JavaCall wrapper.
830 vframeStream vfst(thread, true); // Do not skip any javaCalls
831 methodHandle callee_method;
832 if (vfst.at_end()) {
833 // No Java frames were found on stack since we did the JavaCall.
834 // Hence the stack can only contain an entry_frame. We need to
835 // find the target method from the stub frame.
836 RegisterMap reg_map(thread, false);
837 frame fr = thread->last_frame();
838 assert(fr.is_runtime_frame(), "must be a runtimeStub");
839 fr = fr.sender(®_map);
840 assert(fr.is_entry_frame(), "must be");
841 // fr is now pointing to the entry frame.
842 callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method());
843 assert(fr.entry_frame_call_wrapper()->receiver() == NULL || !callee_method->is_static(), "non-null receiver for static call??");
844 } else {
845 Bytecodes::Code bc;
846 CallInfo callinfo;
847 find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle()));
848 callee_method = callinfo.selected_method();
849 }
850 assert(callee_method()->is_method(), "must be");
851 return callee_method;
852 }
853
854 // Resolves a call.
855 methodHandle SharedRuntime::resolve_helper(JavaThread *thread,
856 bool is_virtual,
857 bool is_optimized, TRAPS) {
858 methodHandle callee_method;
859 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
860 if (JvmtiExport::can_hotswap_or_post_breakpoint()) {
861 int retry_count = 0;
862 while (!HAS_PENDING_EXCEPTION && callee_method->is_old() &&
863 callee_method->method_holder() != SystemDictionary::Object_klass()) {
864 // If has a pending exception then there is no need to re-try to
865 // resolve this method.
866 // If the method has been redefined, we need to try again.
867 // Hack: we have no way to update the vtables of arrays, so don't
868 // require that java.lang.Object has been updated.
869
870 // It is very unlikely that method is redefined more than 100 times
871 // in the middle of resolve. If it is looping here more than 100 times
872 // means then there could be a bug here.
873 guarantee((retry_count++ < 100),
874 "Could not resolve to latest version of redefined method");
875 // method is redefined in the middle of resolve so re-try.
876 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
877 }
878 }
879 return callee_method;
880 }
881
882 // Resolves a call. The compilers generate code for calls that go here
883 // and are patched with the real destination of the call.
884 methodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread,
885 bool is_virtual,
886 bool is_optimized, TRAPS) {
887
888 ResourceMark rm(thread);
889 RegisterMap cbl_map(thread, false);
890 frame caller_frame = thread->last_frame().sender(&cbl_map);
891
892 CodeBlob* cb = caller_frame.cb();
893 guarantee(cb != NULL && cb->is_nmethod(), "must be called from nmethod");
894 // make sure caller is not getting deoptimized
895 // and removed before we are done with it.
896 // CLEANUP - with lazy deopt shouldn't need this lock
897 nmethodLocker caller_lock((nmethod*)cb);
898
899
900 // determine call info & receiver
901 // note: a) receiver is NULL for static calls
902 // b) an exception is thrown if receiver is NULL for non-static calls
903 CallInfo call_info;
904 Bytecodes::Code invoke_code = Bytecodes::_illegal;
905 Handle receiver = find_callee_info(thread, invoke_code,
906 call_info, CHECK_(methodHandle()));
907 methodHandle callee_method = call_info.selected_method();
908
909 assert((!is_virtual && invoke_code == Bytecodes::_invokestatic) ||
910 ( is_virtual && invoke_code != Bytecodes::_invokestatic), "inconsistent bytecode");
911
912 #ifndef PRODUCT
913 // tracing/debugging/statistics
914 int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
915 (is_virtual) ? (&_resolve_virtual_ctr) :
916 (&_resolve_static_ctr);
917 Atomic::inc(addr);
918
919 if (TraceCallFixup) {
920 ResourceMark rm(thread);
921 tty->print("resolving %s%s (%s) call to",
922 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
923 Bytecodes::name(invoke_code));
924 callee_method->print_short_name(tty);
925 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
926 }
927 #endif
928
929 // Compute entry points. This might require generation of C2I converter
930 // frames, so we cannot be holding any locks here. Furthermore, the
931 // computation of the entry points is independent of patching the call. We
932 // always return the entry-point, but we only patch the stub if the call has
933 // not been deoptimized. Return values: For a virtual call this is an
934 // (cached_oop, destination address) pair. For a static call/optimized
935 // virtual this is just a destination address.
936
937 StaticCallInfo static_call_info;
938 CompiledICInfo virtual_call_info;
939
940
941 // Make sure the callee nmethod does not get deoptimized and removed before
942 // we are done patching the code.
943 nmethod* nm = callee_method->code();
944 nmethodLocker nl_callee(nm);
945 #ifdef ASSERT
946 address dest_entry_point = nm == NULL ? 0 : nm->entry_point(); // used below
947 #endif
948
949 if (is_virtual) {
950 assert(receiver.not_null(), "sanity check");
951 bool static_bound = call_info.resolved_method()->can_be_statically_bound();
952 KlassHandle h_klass(THREAD, receiver->klass());
953 CompiledIC::compute_monomorphic_entry(callee_method, h_klass,
954 is_optimized, static_bound, virtual_call_info,
955 CHECK_(methodHandle()));
956 } else {
957 // static call
958 CompiledStaticCall::compute_entry(callee_method, static_call_info);
959 }
960
961 // grab lock, check for deoptimization and potentially patch caller
962 {
963 MutexLocker ml_patch(CompiledIC_lock);
964
965 // Now that we are ready to patch if the methodOop was redefined then
966 // don't update call site and let the caller retry.
967
968 if (!callee_method->is_old()) {
969 #ifdef ASSERT
970 // We must not try to patch to jump to an already unloaded method.
971 if (dest_entry_point != 0) {
972 assert(CodeCache::find_blob(dest_entry_point) != NULL,
973 "should not unload nmethod while locked");
974 }
975 #endif
976 if (is_virtual) {
977 CompiledIC* inline_cache = CompiledIC_before(caller_frame.pc());
978 if (inline_cache->is_clean()) {
979 inline_cache->set_to_monomorphic(virtual_call_info);
980 }
981 } else {
982 CompiledStaticCall* ssc = compiledStaticCall_before(caller_frame.pc());
983 if (ssc->is_clean()) ssc->set(static_call_info);
984 }
985 }
986
987 } // unlock CompiledIC_lock
988
989 return callee_method;
990 }
991
992
993 // Inline caches exist only in compiled code
994 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread))
995 #ifdef ASSERT
996 RegisterMap reg_map(thread, false);
997 frame stub_frame = thread->last_frame();
998 assert(stub_frame.is_runtime_frame(), "sanity check");
999 frame caller_frame = stub_frame.sender(®_map);
1000 assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame");
1001 #endif /* ASSERT */
1002
1003 methodHandle callee_method;
1004 JRT_BLOCK
1005 callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL);
1006 // Return methodOop through TLS
1007 thread->set_vm_result(callee_method());
1008 JRT_BLOCK_END
1009 // return compiled code entry point after potential safepoints
1010 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1011 return callee_method->verified_code_entry();
1012 JRT_END
1013
1014
1015 // Handle call site that has been made non-entrant
1016 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread))
1017 // 6243940 We might end up in here if the callee is deoptimized
1018 // as we race to call it. We don't want to take a safepoint if
1019 // the caller was interpreted because the caller frame will look
1020 // interpreted to the stack walkers and arguments are now
1021 // "compiled" so it is much better to make this transition
1022 // invisible to the stack walking code. The i2c path will
1023 // place the callee method in the callee_target. It is stashed
1024 // there because if we try and find the callee by normal means a
1025 // safepoint is possible and have trouble gc'ing the compiled args.
1026 RegisterMap reg_map(thread, false);
1027 frame stub_frame = thread->last_frame();
1028 assert(stub_frame.is_runtime_frame(), "sanity check");
1029 frame caller_frame = stub_frame.sender(®_map);
1030
1031 // MethodHandle invokes don't have a CompiledIC and should always
1032 // simply redispatch to the callee_target.
1033 address sender_pc = caller_frame.pc();
1034 CodeBlob* sender_cb = caller_frame.cb();
1035 nmethod* sender_nm = sender_cb->as_nmethod_or_null();
1036 bool is_mh_invoke_via_adapter = false; // Direct c2c call or via adapter?
1037 if (sender_nm != NULL && sender_nm->is_method_handle_return(sender_pc)) {
1038 // If the callee_target is set, then we have come here via an i2c
1039 // adapter.
1040 methodOop callee = thread->callee_target();
1041 if (callee != NULL) {
1042 assert(callee->is_method(), "sanity");
1043 is_mh_invoke_via_adapter = true;
1044 }
1045 }
1046
1047 if (caller_frame.is_interpreted_frame() ||
1048 caller_frame.is_entry_frame() ||
1049 is_mh_invoke_via_adapter) {
1050 methodOop callee = thread->callee_target();
1051 guarantee(callee != NULL && callee->is_method(), "bad handshake");
1052 thread->set_vm_result(callee);
1053 thread->set_callee_target(NULL);
1054 return callee->get_c2i_entry();
1055 }
1056
1057 // Must be compiled to compiled path which is safe to stackwalk
1058 methodHandle callee_method;
1059 JRT_BLOCK
1060 // Force resolving of caller (if we called from compiled frame)
1061 callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL);
1062 thread->set_vm_result(callee_method());
1063 JRT_BLOCK_END
1064 // return compiled code entry point after potential safepoints
1065 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1066 return callee_method->verified_code_entry();
1067 JRT_END
1068
1069
1070 // resolve a static call and patch code
1071 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread ))
1072 methodHandle callee_method;
1073 JRT_BLOCK
1074 callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL);
1075 thread->set_vm_result(callee_method());
1076 JRT_BLOCK_END
1077 // return compiled code entry point after potential safepoints
1078 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1079 return callee_method->verified_code_entry();
1080 JRT_END
1081
1082
1083 // resolve virtual call and update inline cache to monomorphic
1084 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread ))
1085 methodHandle callee_method;
1086 JRT_BLOCK
1087 callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL);
1088 thread->set_vm_result(callee_method());
1089 JRT_BLOCK_END
1090 // return compiled code entry point after potential safepoints
1091 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1092 return callee_method->verified_code_entry();
1093 JRT_END
1094
1095
1096 // Resolve a virtual call that can be statically bound (e.g., always
1097 // monomorphic, so it has no inline cache). Patch code to resolved target.
1098 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread))
1099 methodHandle callee_method;
1100 JRT_BLOCK
1101 callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL);
1102 thread->set_vm_result(callee_method());
1103 JRT_BLOCK_END
1104 // return compiled code entry point after potential safepoints
1105 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1106 return callee_method->verified_code_entry();
1107 JRT_END
1108
1109
1110
1111
1112
1113 methodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) {
1114 ResourceMark rm(thread);
1115 CallInfo call_info;
1116 Bytecodes::Code bc;
1117
1118 // receiver is NULL for static calls. An exception is thrown for NULL
1119 // receivers for non-static calls
1120 Handle receiver = find_callee_info(thread, bc, call_info,
1121 CHECK_(methodHandle()));
1122 // Compiler1 can produce virtual call sites that can actually be statically bound
1123 // If we fell thru to below we would think that the site was going megamorphic
1124 // when in fact the site can never miss. Worse because we'd think it was megamorphic
1125 // we'd try and do a vtable dispatch however methods that can be statically bound
1126 // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a
1127 // reresolution of the call site (as if we did a handle_wrong_method and not an
1128 // plain ic_miss) and the site will be converted to an optimized virtual call site
1129 // never to miss again. I don't believe C2 will produce code like this but if it
1130 // did this would still be the correct thing to do for it too, hence no ifdef.
1131 //
1132 if (call_info.resolved_method()->can_be_statically_bound()) {
1133 methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle()));
1134 if (TraceCallFixup) {
1135 RegisterMap reg_map(thread, false);
1136 frame caller_frame = thread->last_frame().sender(®_map);
1137 ResourceMark rm(thread);
1138 tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc));
1139 callee_method->print_short_name(tty);
1140 tty->print_cr(" from pc: " INTPTR_FORMAT, caller_frame.pc());
1141 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1142 }
1143 return callee_method;
1144 }
1145
1146 methodHandle callee_method = call_info.selected_method();
1147
1148 bool should_be_mono = false;
1149
1150 #ifndef PRODUCT
1151 Atomic::inc(&_ic_miss_ctr);
1152
1153 // Statistics & Tracing
1154 if (TraceCallFixup) {
1155 ResourceMark rm(thread);
1156 tty->print("IC miss (%s) call to", Bytecodes::name(bc));
1157 callee_method->print_short_name(tty);
1158 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1159 }
1160
1161 if (ICMissHistogram) {
1162 MutexLocker m(VMStatistic_lock);
1163 RegisterMap reg_map(thread, false);
1164 frame f = thread->last_frame().real_sender(®_map);// skip runtime stub
1165 // produce statistics under the lock
1166 trace_ic_miss(f.pc());
1167 }
1168 #endif
1169
1170 // install an event collector so that when a vtable stub is created the
1171 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The
1172 // event can't be posted when the stub is created as locks are held
1173 // - instead the event will be deferred until the event collector goes
1174 // out of scope.
1175 JvmtiDynamicCodeEventCollector event_collector;
1176
1177 // Update inline cache to megamorphic. Skip update if caller has been
1178 // made non-entrant or we are called from interpreted.
1179 { MutexLocker ml_patch (CompiledIC_lock);
1180 RegisterMap reg_map(thread, false);
1181 frame caller_frame = thread->last_frame().sender(®_map);
1182 CodeBlob* cb = caller_frame.cb();
1183 if (cb->is_nmethod() && ((nmethod*)cb)->is_in_use()) {
1184 // Not a non-entrant nmethod, so find inline_cache
1185 CompiledIC* inline_cache = CompiledIC_before(caller_frame.pc());
1186 bool should_be_mono = false;
1187 if (inline_cache->is_optimized()) {
1188 if (TraceCallFixup) {
1189 ResourceMark rm(thread);
1190 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc));
1191 callee_method->print_short_name(tty);
1192 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1193 }
1194 should_be_mono = true;
1195 } else {
1196 compiledICHolderOop ic_oop = (compiledICHolderOop) inline_cache->cached_oop();
1197 if ( ic_oop != NULL && ic_oop->is_compiledICHolder()) {
1198
1199 if (receiver()->klass() == ic_oop->holder_klass()) {
1200 // This isn't a real miss. We must have seen that compiled code
1201 // is now available and we want the call site converted to a
1202 // monomorphic compiled call site.
1203 // We can't assert for callee_method->code() != NULL because it
1204 // could have been deoptimized in the meantime
1205 if (TraceCallFixup) {
1206 ResourceMark rm(thread);
1207 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc));
1208 callee_method->print_short_name(tty);
1209 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1210 }
1211 should_be_mono = true;
1212 }
1213 }
1214 }
1215
1216 if (should_be_mono) {
1217
1218 // We have a path that was monomorphic but was going interpreted
1219 // and now we have (or had) a compiled entry. We correct the IC
1220 // by using a new icBuffer.
1221 CompiledICInfo info;
1222 KlassHandle receiver_klass(THREAD, receiver()->klass());
1223 inline_cache->compute_monomorphic_entry(callee_method,
1224 receiver_klass,
1225 inline_cache->is_optimized(),
1226 false,
1227 info, CHECK_(methodHandle()));
1228 inline_cache->set_to_monomorphic(info);
1229 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) {
1230 // Change to megamorphic
1231 inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle()));
1232 } else {
1233 // Either clean or megamorphic
1234 }
1235 }
1236 } // Release CompiledIC_lock
1237
1238 return callee_method;
1239 }
1240
1241 //
1242 // Resets a call-site in compiled code so it will get resolved again.
1243 // This routines handles both virtual call sites, optimized virtual call
1244 // sites, and static call sites. Typically used to change a call sites
1245 // destination from compiled to interpreted.
1246 //
1247 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) {
1248 ResourceMark rm(thread);
1249 RegisterMap reg_map(thread, false);
1250 frame stub_frame = thread->last_frame();
1251 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1252 frame caller = stub_frame.sender(®_map);
1253
1254 // Do nothing if the frame isn't a live compiled frame.
1255 // nmethod could be deoptimized by the time we get here
1256 // so no update to the caller is needed.
1257
1258 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) {
1259
1260 address pc = caller.pc();
1261 Events::log("update call-site at pc " INTPTR_FORMAT, pc);
1262
1263 // Default call_addr is the location of the "basic" call.
1264 // Determine the address of the call we a reresolving. With
1265 // Inline Caches we will always find a recognizable call.
1266 // With Inline Caches disabled we may or may not find a
1267 // recognizable call. We will always find a call for static
1268 // calls and for optimized virtual calls. For vanilla virtual
1269 // calls it depends on the state of the UseInlineCaches switch.
1270 //
1271 // With Inline Caches disabled we can get here for a virtual call
1272 // for two reasons:
1273 // 1 - calling an abstract method. The vtable for abstract methods
1274 // will run us thru handle_wrong_method and we will eventually
1275 // end up in the interpreter to throw the ame.
1276 // 2 - a racing deoptimization. We could be doing a vanilla vtable
1277 // call and between the time we fetch the entry address and
1278 // we jump to it the target gets deoptimized. Similar to 1
1279 // we will wind up in the interprter (thru a c2i with c2).
1280 //
1281 address call_addr = NULL;
1282 {
1283 // Get call instruction under lock because another thread may be
1284 // busy patching it.
1285 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1286 // Location of call instruction
1287 if (NativeCall::is_call_before(pc)) {
1288 NativeCall *ncall = nativeCall_before(pc);
1289 call_addr = ncall->instruction_address();
1290 }
1291 }
1292
1293 // Check for static or virtual call
1294 bool is_static_call = false;
1295 nmethod* caller_nm = CodeCache::find_nmethod(pc);
1296 // Make sure nmethod doesn't get deoptimized and removed until
1297 // this is done with it.
1298 // CLEANUP - with lazy deopt shouldn't need this lock
1299 nmethodLocker nmlock(caller_nm);
1300
1301 if (call_addr != NULL) {
1302 RelocIterator iter(caller_nm, call_addr, call_addr+1);
1303 int ret = iter.next(); // Get item
1304 if (ret) {
1305 assert(iter.addr() == call_addr, "must find call");
1306 if (iter.type() == relocInfo::static_call_type) {
1307 is_static_call = true;
1308 } else {
1309 assert(iter.type() == relocInfo::virtual_call_type ||
1310 iter.type() == relocInfo::opt_virtual_call_type
1311 , "unexpected relocInfo. type");
1312 }
1313 } else {
1314 assert(!UseInlineCaches, "relocation info. must exist for this address");
1315 }
1316
1317 // Cleaning the inline cache will force a new resolve. This is more robust
1318 // than directly setting it to the new destination, since resolving of calls
1319 // is always done through the same code path. (experience shows that it
1320 // leads to very hard to track down bugs, if an inline cache gets updated
1321 // to a wrong method). It should not be performance critical, since the
1322 // resolve is only done once.
1323
1324 MutexLocker ml(CompiledIC_lock);
1325 //
1326 // We do not patch the call site if the nmethod has been made non-entrant
1327 // as it is a waste of time
1328 //
1329 if (caller_nm->is_in_use()) {
1330 if (is_static_call) {
1331 CompiledStaticCall* ssc= compiledStaticCall_at(call_addr);
1332 ssc->set_to_clean();
1333 } else {
1334 // compiled, dispatched call (which used to call an interpreted method)
1335 CompiledIC* inline_cache = CompiledIC_at(call_addr);
1336 inline_cache->set_to_clean();
1337 }
1338 }
1339 }
1340
1341 }
1342
1343 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle()));
1344
1345
1346 #ifndef PRODUCT
1347 Atomic::inc(&_wrong_method_ctr);
1348
1349 if (TraceCallFixup) {
1350 ResourceMark rm(thread);
1351 tty->print("handle_wrong_method reresolving call to");
1352 callee_method->print_short_name(tty);
1353 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1354 }
1355 #endif
1356
1357 return callee_method;
1358 }
1359
1360 // ---------------------------------------------------------------------------
1361 // We are calling the interpreter via a c2i. Normally this would mean that
1362 // we were called by a compiled method. However we could have lost a race
1363 // where we went int -> i2c -> c2i and so the caller could in fact be
1364 // interpreted. If the caller is compiled we attempt to patch the caller
1365 // so he no longer calls into the interpreter.
1366 IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(methodOopDesc* method, address caller_pc))
1367 methodOop moop(method);
1368
1369 address entry_point = moop->from_compiled_entry();
1370
1371 // It's possible that deoptimization can occur at a call site which hasn't
1372 // been resolved yet, in which case this function will be called from
1373 // an nmethod that has been patched for deopt and we can ignore the
1374 // request for a fixup.
1375 // Also it is possible that we lost a race in that from_compiled_entry
1376 // is now back to the i2c in that case we don't need to patch and if
1377 // we did we'd leap into space because the callsite needs to use
1378 // "to interpreter" stub in order to load up the methodOop. Don't
1379 // ask me how I know this...
1380
1381 CodeBlob* cb = CodeCache::find_blob(caller_pc);
1382 if (!cb->is_nmethod() || entry_point == moop->get_c2i_entry()) {
1383 return;
1384 }
1385
1386 // The check above makes sure this is a nmethod.
1387 nmethod* nm = cb->as_nmethod_or_null();
1388 assert(nm, "must be");
1389
1390 // Don't fixup MethodHandle call sites as c2i/i2c adapters are used
1391 // to implement MethodHandle actions.
1392 if (nm->is_method_handle_return(caller_pc)) {
1393 return;
1394 }
1395
1396 // There is a benign race here. We could be attempting to patch to a compiled
1397 // entry point at the same time the callee is being deoptimized. If that is
1398 // the case then entry_point may in fact point to a c2i and we'd patch the
1399 // call site with the same old data. clear_code will set code() to NULL
1400 // at the end of it. If we happen to see that NULL then we can skip trying
1401 // to patch. If we hit the window where the callee has a c2i in the
1402 // from_compiled_entry and the NULL isn't present yet then we lose the race
1403 // and patch the code with the same old data. Asi es la vida.
1404
1405 if (moop->code() == NULL) return;
1406
1407 if (nm->is_in_use()) {
1408
1409 // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1410 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1411 if (NativeCall::is_call_before(caller_pc + frame::pc_return_offset)) {
1412 NativeCall *call = nativeCall_before(caller_pc + frame::pc_return_offset);
1413 //
1414 // bug 6281185. We might get here after resolving a call site to a vanilla
1415 // virtual call. Because the resolvee uses the verified entry it may then
1416 // see compiled code and attempt to patch the site by calling us. This would
1417 // then incorrectly convert the call site to optimized and its downhill from
1418 // there. If you're lucky you'll get the assert in the bugid, if not you've
1419 // just made a call site that could be megamorphic into a monomorphic site
1420 // for the rest of its life! Just another racing bug in the life of
1421 // fixup_callers_callsite ...
1422 //
1423 RelocIterator iter(cb, call->instruction_address(), call->next_instruction_address());
1424 iter.next();
1425 assert(iter.has_current(), "must have a reloc at java call site");
1426 relocInfo::relocType typ = iter.reloc()->type();
1427 if ( typ != relocInfo::static_call_type &&
1428 typ != relocInfo::opt_virtual_call_type &&
1429 typ != relocInfo::static_stub_type) {
1430 return;
1431 }
1432 address destination = call->destination();
1433 if (destination != entry_point) {
1434 CodeBlob* callee = CodeCache::find_blob(destination);
1435 // callee == cb seems weird. It means calling interpreter thru stub.
1436 if (callee == cb || callee->is_adapter_blob()) {
1437 // static call or optimized virtual
1438 if (TraceCallFixup) {
1439 tty->print("fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1440 moop->print_short_name(tty);
1441 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1442 }
1443 call->set_destination_mt_safe(entry_point);
1444 } else {
1445 if (TraceCallFixup) {
1446 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1447 moop->print_short_name(tty);
1448 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1449 }
1450 // assert is too strong could also be resolve destinations.
1451 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be");
1452 }
1453 } else {
1454 if (TraceCallFixup) {
1455 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1456 moop->print_short_name(tty);
1457 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1458 }
1459 }
1460 }
1461 }
1462
1463 IRT_END
1464
1465
1466 // same as JVM_Arraycopy, but called directly from compiled code
1467 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos,
1468 oopDesc* dest, jint dest_pos,
1469 jint length,
1470 JavaThread* thread)) {
1471 #ifndef PRODUCT
1472 _slow_array_copy_ctr++;
1473 #endif
1474 // Check if we have null pointers
1475 if (src == NULL || dest == NULL) {
1476 THROW(vmSymbols::java_lang_NullPointerException());
1477 }
1478 // Do the copy. The casts to arrayOop are necessary to the copy_array API,
1479 // even though the copy_array API also performs dynamic checks to ensure
1480 // that src and dest are truly arrays (and are conformable).
1481 // The copy_array mechanism is awkward and could be removed, but
1482 // the compilers don't call this function except as a last resort,
1483 // so it probably doesn't matter.
1484 Klass::cast(src->klass())->copy_array((arrayOopDesc*)src, src_pos,
1485 (arrayOopDesc*)dest, dest_pos,
1486 length, thread);
1487 }
1488 JRT_END
1489
1490 char* SharedRuntime::generate_class_cast_message(
1491 JavaThread* thread, const char* objName) {
1492
1493 // Get target class name from the checkcast instruction
1494 vframeStream vfst(thread, true);
1495 assert(!vfst.at_end(), "Java frame must exist");
1496 Bytecode_checkcast* cc = Bytecode_checkcast_at(
1497 vfst.method()->bcp_from(vfst.bci()));
1498 Klass* targetKlass = Klass::cast(vfst.method()->constants()->klass_at(
1499 cc->index(), thread));
1500 return generate_class_cast_message(objName, targetKlass->external_name());
1501 }
1502
1503 char* SharedRuntime::generate_wrong_method_type_message(JavaThread* thread,
1504 oopDesc* required,
1505 oopDesc* actual) {
1506 assert(EnableMethodHandles, "");
1507 oop singleKlass = wrong_method_type_is_for_single_argument(thread, required);
1508 if (singleKlass != NULL) {
1509 const char* objName = "argument or return value";
1510 if (actual != NULL) {
1511 // be flexible about the junk passed in:
1512 klassOop ak = (actual->is_klass()
1513 ? (klassOop)actual
1514 : actual->klass());
1515 objName = Klass::cast(ak)->external_name();
1516 }
1517 Klass* targetKlass = Klass::cast(required->is_klass()
1518 ? (klassOop)required
1519 : java_lang_Class::as_klassOop(required));
1520 return generate_class_cast_message(objName, targetKlass->external_name());
1521 } else {
1522 // %%% need to get the MethodType string, without messing around too much
1523 // Get a signature from the invoke instruction
1524 const char* mhName = "method handle";
1525 const char* targetType = "the required signature";
1526 vframeStream vfst(thread, true);
1527 if (!vfst.at_end()) {
1528 Bytecode_invoke* call = Bytecode_invoke_at(vfst.method(), vfst.bci());
1529 methodHandle target;
1530 {
1531 EXCEPTION_MARK;
1532 target = call->static_target(THREAD);
1533 if (HAS_PENDING_EXCEPTION) { CLEAR_PENDING_EXCEPTION; }
1534 }
1535 if (target.not_null()
1536 && target->is_method_handle_invoke()
1537 && required == target->method_handle_type()) {
1538 targetType = target->signature()->as_C_string();
1539 }
1540 }
1541 klassOop kignore; int fignore;
1542 methodOop actual_method = MethodHandles::decode_method(actual,
1543 kignore, fignore);
1544 if (actual_method != NULL) {
1545 if (actual_method->name() == vmSymbols::invoke_name())
1546 mhName = "$";
1547 else
1548 mhName = actual_method->signature()->as_C_string();
1549 if (mhName[0] == '$')
1550 mhName = actual_method->signature()->as_C_string();
1551 }
1552 return generate_class_cast_message(mhName, targetType,
1553 " cannot be called as ");
1554 }
1555 }
1556
1557 oop SharedRuntime::wrong_method_type_is_for_single_argument(JavaThread* thr,
1558 oopDesc* required) {
1559 if (required == NULL) return NULL;
1560 if (required->klass() == SystemDictionary::Class_klass())
1561 return required;
1562 if (required->is_klass())
1563 return Klass::cast(klassOop(required))->java_mirror();
1564 return NULL;
1565 }
1566
1567
1568 char* SharedRuntime::generate_class_cast_message(
1569 const char* objName, const char* targetKlassName, const char* desc) {
1570 size_t msglen = strlen(objName) + strlen(desc) + strlen(targetKlassName) + 1;
1571
1572 char* message = NEW_RESOURCE_ARRAY(char, msglen);
1573 if (NULL == message) {
1574 // Shouldn't happen, but don't cause even more problems if it does
1575 message = const_cast<char*>(objName);
1576 } else {
1577 jio_snprintf(message, msglen, "%s%s%s", objName, desc, targetKlassName);
1578 }
1579 return message;
1580 }
1581
1582 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
1583 (void) JavaThread::current()->reguard_stack();
1584 JRT_END
1585
1586
1587 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
1588 #ifndef PRODUCT
1589 int SharedRuntime::_monitor_enter_ctr=0;
1590 #endif
1591 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
1592 oop obj(_obj);
1593 #ifndef PRODUCT
1594 _monitor_enter_ctr++; // monitor enter slow
1595 #endif
1596 if (PrintBiasedLockingStatistics) {
1597 Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
1598 }
1599 Handle h_obj(THREAD, obj);
1600 if (UseBiasedLocking) {
1601 // Retry fast entry if bias is revoked to avoid unnecessary inflation
1602 ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK);
1603 } else {
1604 ObjectSynchronizer::slow_enter(h_obj, lock, CHECK);
1605 }
1606 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
1607 JRT_END
1608
1609 #ifndef PRODUCT
1610 int SharedRuntime::_monitor_exit_ctr=0;
1611 #endif
1612 // Handles the uncommon cases of monitor unlocking in compiled code
1613 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock))
1614 oop obj(_obj);
1615 #ifndef PRODUCT
1616 _monitor_exit_ctr++; // monitor exit slow
1617 #endif
1618 Thread* THREAD = JavaThread::current();
1619 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore
1620 // testing was unable to ever fire the assert that guarded it so I have removed it.
1621 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?");
1622 #undef MIGHT_HAVE_PENDING
1623 #ifdef MIGHT_HAVE_PENDING
1624 // Save and restore any pending_exception around the exception mark.
1625 // While the slow_exit must not throw an exception, we could come into
1626 // this routine with one set.
1627 oop pending_excep = NULL;
1628 const char* pending_file;
1629 int pending_line;
1630 if (HAS_PENDING_EXCEPTION) {
1631 pending_excep = PENDING_EXCEPTION;
1632 pending_file = THREAD->exception_file();
1633 pending_line = THREAD->exception_line();
1634 CLEAR_PENDING_EXCEPTION;
1635 }
1636 #endif /* MIGHT_HAVE_PENDING */
1637
1638 {
1639 // Exit must be non-blocking, and therefore no exceptions can be thrown.
1640 EXCEPTION_MARK;
1641 ObjectSynchronizer::slow_exit(obj, lock, THREAD);
1642 }
1643
1644 #ifdef MIGHT_HAVE_PENDING
1645 if (pending_excep != NULL) {
1646 THREAD->set_pending_exception(pending_excep, pending_file, pending_line);
1647 }
1648 #endif /* MIGHT_HAVE_PENDING */
1649 JRT_END
1650
1651 #ifndef PRODUCT
1652
1653 void SharedRuntime::print_statistics() {
1654 ttyLocker ttyl;
1655 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'");
1656
1657 if (_monitor_enter_ctr ) tty->print_cr("%5d monitor enter slow", _monitor_enter_ctr);
1658 if (_monitor_exit_ctr ) tty->print_cr("%5d monitor exit slow", _monitor_exit_ctr);
1659 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr);
1660
1661 SharedRuntime::print_ic_miss_histogram();
1662
1663 if (CountRemovableExceptions) {
1664 if (_nof_removable_exceptions > 0) {
1665 Unimplemented(); // this counter is not yet incremented
1666 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions);
1667 }
1668 }
1669
1670 // Dump the JRT_ENTRY counters
1671 if( _new_instance_ctr ) tty->print_cr("%5d new instance requires GC", _new_instance_ctr);
1672 if( _new_array_ctr ) tty->print_cr("%5d new array requires GC", _new_array_ctr);
1673 if( _multi1_ctr ) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr);
1674 if( _multi2_ctr ) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr);
1675 if( _multi3_ctr ) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr);
1676 if( _multi4_ctr ) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr);
1677 if( _multi5_ctr ) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr);
1678
1679 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr );
1680 tty->print_cr("%5d wrong method", _wrong_method_ctr );
1681 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr );
1682 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr );
1683 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr );
1684
1685 if( _mon_enter_stub_ctr ) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr );
1686 if( _mon_exit_stub_ctr ) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr );
1687 if( _mon_enter_ctr ) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr );
1688 if( _mon_exit_ctr ) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr );
1689 if( _partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr );
1690 if( _jbyte_array_copy_ctr ) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr );
1691 if( _jshort_array_copy_ctr ) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr );
1692 if( _jint_array_copy_ctr ) tty->print_cr("%5d int array copies", _jint_array_copy_ctr );
1693 if( _jlong_array_copy_ctr ) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr );
1694 if( _oop_array_copy_ctr ) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr );
1695 if( _checkcast_array_copy_ctr ) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr );
1696 if( _unsafe_array_copy_ctr ) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr );
1697 if( _generic_array_copy_ctr ) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr );
1698 if( _slow_array_copy_ctr ) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr );
1699 if( _find_handler_ctr ) tty->print_cr("%5d find exception handler", _find_handler_ctr );
1700 if( _rethrow_ctr ) tty->print_cr("%5d rethrow handler", _rethrow_ctr );
1701
1702 AdapterHandlerLibrary::print_statistics();
1703
1704 if (xtty != NULL) xtty->tail("statistics");
1705 }
1706
1707 inline double percent(int x, int y) {
1708 return 100.0 * x / MAX2(y, 1);
1709 }
1710
1711 class MethodArityHistogram {
1712 public:
1713 enum { MAX_ARITY = 256 };
1714 private:
1715 static int _arity_histogram[MAX_ARITY]; // histogram of #args
1716 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words
1717 static int _max_arity; // max. arity seen
1718 static int _max_size; // max. arg size seen
1719
1720 static void add_method_to_histogram(nmethod* nm) {
1721 methodOop m = nm->method();
1722 ArgumentCount args(m->signature());
1723 int arity = args.size() + (m->is_static() ? 0 : 1);
1724 int argsize = m->size_of_parameters();
1725 arity = MIN2(arity, MAX_ARITY-1);
1726 argsize = MIN2(argsize, MAX_ARITY-1);
1727 int count = nm->method()->compiled_invocation_count();
1728 _arity_histogram[arity] += count;
1729 _size_histogram[argsize] += count;
1730 _max_arity = MAX2(_max_arity, arity);
1731 _max_size = MAX2(_max_size, argsize);
1732 }
1733
1734 void print_histogram_helper(int n, int* histo, const char* name) {
1735 const int N = MIN2(5, n);
1736 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
1737 double sum = 0;
1738 double weighted_sum = 0;
1739 int i;
1740 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; }
1741 double rest = sum;
1742 double percent = sum / 100;
1743 for (i = 0; i <= N; i++) {
1744 rest -= histo[i];
1745 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent);
1746 }
1747 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent);
1748 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
1749 }
1750
1751 void print_histogram() {
1752 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
1753 print_histogram_helper(_max_arity, _arity_histogram, "arity");
1754 tty->print_cr("\nSame for parameter size (in words):");
1755 print_histogram_helper(_max_size, _size_histogram, "size");
1756 tty->cr();
1757 }
1758
1759 public:
1760 MethodArityHistogram() {
1761 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1762 _max_arity = _max_size = 0;
1763 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram [i] = 0;
1764 CodeCache::nmethods_do(add_method_to_histogram);
1765 print_histogram();
1766 }
1767 };
1768
1769 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
1770 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
1771 int MethodArityHistogram::_max_arity;
1772 int MethodArityHistogram::_max_size;
1773
1774 void SharedRuntime::print_call_statistics(int comp_total) {
1775 tty->print_cr("Calls from compiled code:");
1776 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
1777 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls;
1778 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls;
1779 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total));
1780 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total));
1781 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
1782 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls));
1783 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls));
1784 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
1785 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total));
1786 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
1787 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls));
1788 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls));
1789 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls));
1790 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
1791 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
1792 tty->cr();
1793 tty->print_cr("Note 1: counter updates are not MT-safe.");
1794 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
1795 tty->print_cr(" %% in nested categories are relative to their category");
1796 tty->print_cr(" (and thus add up to more than 100%% with inlining)");
1797 tty->cr();
1798
1799 MethodArityHistogram h;
1800 }
1801 #endif
1802
1803
1804 // A simple wrapper class around the calling convention information
1805 // that allows sharing of adapters for the same calling convention.
1806 class AdapterFingerPrint : public CHeapObj {
1807 private:
1808 union {
1809 signed char _compact[12];
1810 int _compact_int[3];
1811 intptr_t* _fingerprint;
1812 } _value;
1813 int _length; // A negative length indicates that _value._fingerprint is the array.
1814 // Otherwise it's in the compact form.
1815
1816 public:
1817 AdapterFingerPrint(int total_args_passed, VMRegPair* regs) {
1818 assert(sizeof(_value._compact) == sizeof(_value._compact_int), "must match");
1819 _length = total_args_passed * 2;
1820 if (_length < (int)sizeof(_value._compact)) {
1821 _value._compact_int[0] = _value._compact_int[1] = _value._compact_int[2] = 0;
1822 // Storing the signature encoded as signed chars hits about 98%
1823 // of the time.
1824 signed char* ptr = _value._compact;
1825 int o = 0;
1826 for (int i = 0; i < total_args_passed; i++) {
1827 VMRegPair pair = regs[i];
1828 intptr_t v1 = pair.first()->value();
1829 intptr_t v2 = pair.second()->value();
1830 if (v1 == (signed char) v1 &&
1831 v2 == (signed char) v2) {
1832 _value._compact[o++] = v1;
1833 _value._compact[o++] = v2;
1834 } else {
1835 goto big;
1836 }
1837 }
1838 _length = -_length;
1839 return;
1840 }
1841 big:
1842 _value._fingerprint = NEW_C_HEAP_ARRAY(intptr_t, _length);
1843 int o = 0;
1844 for (int i = 0; i < total_args_passed; i++) {
1845 VMRegPair pair = regs[i];
1846 intptr_t v1 = pair.first()->value();
1847 intptr_t v2 = pair.second()->value();
1848 _value._fingerprint[o++] = v1;
1849 _value._fingerprint[o++] = v2;
1850 }
1851 }
1852
1853 AdapterFingerPrint(AdapterFingerPrint* orig) {
1854 _length = orig->_length;
1855 _value = orig->_value;
1856 // take ownership of any storage by destroying the length
1857 orig->_length = 0;
1858 }
1859
1860 ~AdapterFingerPrint() {
1861 if (_length > 0) {
1862 FREE_C_HEAP_ARRAY(int, _value._fingerprint);
1863 }
1864 }
1865
1866 AdapterFingerPrint* allocate() {
1867 return new AdapterFingerPrint(this);
1868 }
1869
1870 intptr_t value(int index) {
1871 if (_length < 0) {
1872 return _value._compact[index];
1873 }
1874 return _value._fingerprint[index];
1875 }
1876 int length() {
1877 if (_length < 0) return -_length;
1878 return _length;
1879 }
1880
1881 bool is_compact() {
1882 return _length <= 0;
1883 }
1884
1885 unsigned int compute_hash() {
1886 intptr_t hash = 0;
1887 for (int i = 0; i < length(); i++) {
1888 intptr_t v = value(i);
1889 hash = (hash << 8) ^ v ^ (hash >> 5);
1890 }
1891 return (unsigned int)hash;
1892 }
1893
1894 const char* as_string() {
1895 stringStream st;
1896 for (int i = 0; i < length(); i++) {
1897 st.print(PTR_FORMAT, value(i));
1898 }
1899 return st.as_string();
1900 }
1901
1902 bool equals(AdapterFingerPrint* other) {
1903 if (other->_length != _length) {
1904 return false;
1905 }
1906 if (_length < 0) {
1907 return _value._compact_int[0] == other->_value._compact_int[0] &&
1908 _value._compact_int[1] == other->_value._compact_int[1] &&
1909 _value._compact_int[2] == other->_value._compact_int[2];
1910 } else {
1911 for (int i = 0; i < _length; i++) {
1912 if (_value._fingerprint[i] != other->_value._fingerprint[i]) {
1913 return false;
1914 }
1915 }
1916 }
1917 return true;
1918 }
1919 };
1920
1921
1922 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries
1923 class AdapterHandlerTable : public BasicHashtable {
1924 friend class AdapterHandlerTableIterator;
1925
1926 private:
1927
1928 #ifdef ASSERT
1929 static int _lookups; // number of calls to lookup
1930 static int _buckets; // number of buckets checked
1931 static int _equals; // number of buckets checked with matching hash
1932 static int _hits; // number of successful lookups
1933 static int _compact; // number of equals calls with compact signature
1934 #endif
1935
1936 AdapterHandlerEntry* bucket(int i) {
1937 return (AdapterHandlerEntry*)BasicHashtable::bucket(i);
1938 }
1939
1940 public:
1941 AdapterHandlerTable()
1942 : BasicHashtable(293, sizeof(AdapterHandlerEntry)) { }
1943
1944 // Create a new entry suitable for insertion in the table
1945 AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry) {
1946 AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable::new_entry(fingerprint->compute_hash());
1947 entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
1948 return entry;
1949 }
1950
1951 // Insert an entry into the table
1952 void add(AdapterHandlerEntry* entry) {
1953 int index = hash_to_index(entry->hash());
1954 add_entry(index, entry);
1955 }
1956
1957 // Find a entry with the same fingerprint if it exists
1958 AdapterHandlerEntry* lookup(int total_args_passed, VMRegPair* regs) {
1959 debug_only(_lookups++);
1960 AdapterFingerPrint fp(total_args_passed, regs);
1961 unsigned int hash = fp.compute_hash();
1962 int index = hash_to_index(hash);
1963 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
1964 debug_only(_buckets++);
1965 if (e->hash() == hash) {
1966 debug_only(_equals++);
1967 if (fp.equals(e->fingerprint())) {
1968 #ifdef ASSERT
1969 if (fp.is_compact()) _compact++;
1970 _hits++;
1971 #endif
1972 return e;
1973 }
1974 }
1975 }
1976 return NULL;
1977 }
1978
1979 void print_statistics() {
1980 ResourceMark rm;
1981 int longest = 0;
1982 int empty = 0;
1983 int total = 0;
1984 int nonempty = 0;
1985 for (int index = 0; index < table_size(); index++) {
1986 int count = 0;
1987 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
1988 count++;
1989 }
1990 if (count != 0) nonempty++;
1991 if (count == 0) empty++;
1992 if (count > longest) longest = count;
1993 total += count;
1994 }
1995 tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f",
1996 empty, longest, total, total / (double)nonempty);
1997 #ifdef ASSERT
1998 tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d",
1999 _lookups, _buckets, _equals, _hits, _compact);
2000 #endif
2001 }
2002 };
2003
2004
2005 #ifdef ASSERT
2006
2007 int AdapterHandlerTable::_lookups;
2008 int AdapterHandlerTable::_buckets;
2009 int AdapterHandlerTable::_equals;
2010 int AdapterHandlerTable::_hits;
2011 int AdapterHandlerTable::_compact;
2012
2013 class AdapterHandlerTableIterator : public StackObj {
2014 private:
2015 AdapterHandlerTable* _table;
2016 int _index;
2017 AdapterHandlerEntry* _current;
2018
2019 void scan() {
2020 while (_index < _table->table_size()) {
2021 AdapterHandlerEntry* a = _table->bucket(_index);
2022 if (a != NULL) {
2023 _current = a;
2024 return;
2025 }
2026 _index++;
2027 }
2028 }
2029
2030 public:
2031 AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) {
2032 scan();
2033 }
2034 bool has_next() {
2035 return _current != NULL;
2036 }
2037 AdapterHandlerEntry* next() {
2038 if (_current != NULL) {
2039 AdapterHandlerEntry* result = _current;
2040 _current = _current->next();
2041 if (_current == NULL) scan();
2042 return result;
2043 } else {
2044 return NULL;
2045 }
2046 }
2047 };
2048 #endif
2049
2050
2051 // ---------------------------------------------------------------------------
2052 // Implementation of AdapterHandlerLibrary
2053 const char* AdapterHandlerEntry::name = "I2C/C2I adapters";
2054 AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL;
2055 AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL;
2056 const int AdapterHandlerLibrary_size = 16*K;
2057 BufferBlob* AdapterHandlerLibrary::_buffer = NULL;
2058
2059 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
2060 // Should be called only when AdapterHandlerLibrary_lock is active.
2061 if (_buffer == NULL) // Initialize lazily
2062 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
2063 return _buffer;
2064 }
2065
2066 void AdapterHandlerLibrary::initialize() {
2067 if (_adapters != NULL) return;
2068 _adapters = new AdapterHandlerTable();
2069
2070 // Create a special handler for abstract methods. Abstract methods
2071 // are never compiled so an i2c entry is somewhat meaningless, but
2072 // fill it in with something appropriate just in case. Pass handle
2073 // wrong method for the c2i transitions.
2074 address wrong_method = SharedRuntime::get_handle_wrong_method_stub();
2075 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL),
2076 StubRoutines::throw_AbstractMethodError_entry(),
2077 wrong_method, wrong_method);
2078 }
2079
2080 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint,
2081 address i2c_entry,
2082 address c2i_entry,
2083 address c2i_unverified_entry) {
2084 return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2085 }
2086
2087 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(methodHandle method) {
2088 // Use customized signature handler. Need to lock around updates to
2089 // the AdapterHandlerTable (it is not safe for concurrent readers
2090 // and a single writer: this could be fixed if it becomes a
2091 // problem).
2092
2093 // Get the address of the ic_miss handlers before we grab the
2094 // AdapterHandlerLibrary_lock. This fixes bug 6236259 which
2095 // was caused by the initialization of the stubs happening
2096 // while we held the lock and then notifying jvmti while
2097 // holding it. This just forces the initialization to be a little
2098 // earlier.
2099 address ic_miss = SharedRuntime::get_ic_miss_stub();
2100 assert(ic_miss != NULL, "must have handler");
2101
2102 ResourceMark rm;
2103
2104 NOT_PRODUCT(int code_size);
2105 BufferBlob *B = NULL;
2106 AdapterHandlerEntry* entry = NULL;
2107 AdapterFingerPrint* fingerprint = NULL;
2108 {
2109 MutexLocker mu(AdapterHandlerLibrary_lock);
2110 // make sure data structure is initialized
2111 initialize();
2112
2113 if (method->is_abstract()) {
2114 return _abstract_method_handler;
2115 }
2116
2117 // Fill in the signature array, for the calling-convention call.
2118 int total_args_passed = method->size_of_parameters(); // All args on stack
2119
2120 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2121 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2122 int i = 0;
2123 if (!method->is_static()) // Pass in receiver first
2124 sig_bt[i++] = T_OBJECT;
2125 for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) {
2126 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2127 if (ss.type() == T_LONG || ss.type() == T_DOUBLE)
2128 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2129 }
2130 assert(i == total_args_passed, "");
2131
2132 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
2133 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
2134
2135 // Lookup method signature's fingerprint
2136 entry = _adapters->lookup(total_args_passed, regs);
2137 if (entry != NULL) {
2138 return entry;
2139 }
2140
2141 // Make a C heap allocated version of the fingerprint to store in the adapter
2142 fingerprint = new AdapterFingerPrint(total_args_passed, regs);
2143
2144 // Create I2C & C2I handlers
2145
2146 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2147 if (buf != NULL) {
2148 CodeBuffer buffer(buf->instructions_begin(), buf->instructions_size());
2149 short buffer_locs[20];
2150 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
2151 sizeof(buffer_locs)/sizeof(relocInfo));
2152 MacroAssembler _masm(&buffer);
2153
2154 entry = SharedRuntime::generate_i2c2i_adapters(&_masm,
2155 total_args_passed,
2156 comp_args_on_stack,
2157 sig_bt,
2158 regs,
2159 fingerprint);
2160
2161 B = BufferBlob::create(AdapterHandlerEntry::name, &buffer);
2162 NOT_PRODUCT(code_size = buffer.code_size());
2163 }
2164 if (B == NULL) {
2165 // CodeCache is full, disable compilation
2166 // Ought to log this but compile log is only per compile thread
2167 // and we're some non descript Java thread.
2168 MutexUnlocker mu(AdapterHandlerLibrary_lock);
2169 CompileBroker::handle_full_code_cache();
2170 return NULL; // Out of CodeCache space
2171 }
2172 entry->relocate(B->instructions_begin());
2173 #ifndef PRODUCT
2174 // debugging suppport
2175 if (PrintAdapterHandlers) {
2176 tty->cr();
2177 tty->print_cr("i2c argument handler #%d for: %s %s (fingerprint = %s, %d bytes generated)",
2178 _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"),
2179 method->signature()->as_C_string(), fingerprint->as_string(), code_size );
2180 tty->print_cr("c2i argument handler starts at %p",entry->get_c2i_entry());
2181 Disassembler::decode(entry->get_i2c_entry(), entry->get_i2c_entry() + code_size);
2182 }
2183 #endif
2184
2185 _adapters->add(entry);
2186 }
2187 // Outside of the lock
2188 if (B != NULL) {
2189 char blob_id[256];
2190 jio_snprintf(blob_id,
2191 sizeof(blob_id),
2192 "%s(%s)@" PTR_FORMAT,
2193 AdapterHandlerEntry::name,
2194 fingerprint->as_string(),
2195 B->instructions_begin());
2196 VTune::register_stub(blob_id, B->instructions_begin(), B->instructions_end());
2197 Forte::register_stub(blob_id, B->instructions_begin(), B->instructions_end());
2198
2199 if (JvmtiExport::should_post_dynamic_code_generated()) {
2200 JvmtiExport::post_dynamic_code_generated(blob_id,
2201 B->instructions_begin(),
2202 B->instructions_end());
2203 }
2204 }
2205 return entry;
2206 }
2207
2208 void AdapterHandlerEntry::relocate(address new_base) {
2209 ptrdiff_t delta = new_base - _i2c_entry;
2210 _i2c_entry += delta;
2211 _c2i_entry += delta;
2212 _c2i_unverified_entry += delta;
2213 }
2214
2215 // Create a native wrapper for this native method. The wrapper converts the
2216 // java compiled calling convention to the native convention, handlizes
2217 // arguments, and transitions to native. On return from the native we transition
2218 // back to java blocking if a safepoint is in progress.
2219 nmethod *AdapterHandlerLibrary::create_native_wrapper(methodHandle method) {
2220 ResourceMark rm;
2221 nmethod* nm = NULL;
2222
2223 if (PrintCompilation) {
2224 ttyLocker ttyl;
2225 tty->print("--- n%s ", (method->is_synchronized() ? "s" : " "));
2226 method->print_short_name(tty);
2227 if (method->is_static()) {
2228 tty->print(" (static)");
2229 }
2230 tty->cr();
2231 }
2232
2233 assert(method->has_native_function(), "must have something valid to call!");
2234
2235 {
2236 // perform the work while holding the lock, but perform any printing outside the lock
2237 MutexLocker mu(AdapterHandlerLibrary_lock);
2238 // See if somebody beat us to it
2239 nm = method->code();
2240 if (nm) {
2241 return nm;
2242 }
2243
2244 ResourceMark rm;
2245
2246 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2247 if (buf != NULL) {
2248 CodeBuffer buffer(buf->instructions_begin(), buf->instructions_size());
2249 double locs_buf[20];
2250 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2251 MacroAssembler _masm(&buffer);
2252
2253 // Fill in the signature array, for the calling-convention call.
2254 int total_args_passed = method->size_of_parameters();
2255
2256 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType,total_args_passed);
2257 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair,total_args_passed);
2258 int i=0;
2259 if( !method->is_static() ) // Pass in receiver first
2260 sig_bt[i++] = T_OBJECT;
2261 SignatureStream ss(method->signature());
2262 for( ; !ss.at_return_type(); ss.next()) {
2263 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2264 if( ss.type() == T_LONG || ss.type() == T_DOUBLE )
2265 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2266 }
2267 assert( i==total_args_passed, "" );
2268 BasicType ret_type = ss.type();
2269
2270 // Now get the compiled-Java layout as input arguments
2271 int comp_args_on_stack;
2272 comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
2273
2274 // Generate the compiled-to-native wrapper code
2275 nm = SharedRuntime::generate_native_wrapper(&_masm,
2276 method,
2277 total_args_passed,
2278 comp_args_on_stack,
2279 sig_bt,regs,
2280 ret_type);
2281 }
2282 }
2283
2284 // Must unlock before calling set_code
2285 // Install the generated code.
2286 if (nm != NULL) {
2287 method->set_code(method, nm);
2288 nm->post_compiled_method_load_event();
2289 } else {
2290 // CodeCache is full, disable compilation
2291 // Ought to log this but compile log is only per compile thread
2292 // and we're some non descript Java thread.
2293 MutexUnlocker mu(AdapterHandlerLibrary_lock);
2294 CompileBroker::handle_full_code_cache();
2295 }
2296 return nm;
2297 }
2298
2299 #ifdef HAVE_DTRACE_H
2300 // Create a dtrace nmethod for this method. The wrapper converts the
2301 // java compiled calling convention to the native convention, makes a dummy call
2302 // (actually nops for the size of the call instruction, which become a trap if
2303 // probe is enabled). The returns to the caller. Since this all looks like a
2304 // leaf no thread transition is needed.
2305
2306 nmethod *AdapterHandlerLibrary::create_dtrace_nmethod(methodHandle method) {
2307 ResourceMark rm;
2308 nmethod* nm = NULL;
2309
2310 if (PrintCompilation) {
2311 ttyLocker ttyl;
2312 tty->print("--- n%s ");
2313 method->print_short_name(tty);
2314 if (method->is_static()) {
2315 tty->print(" (static)");
2316 }
2317 tty->cr();
2318 }
2319
2320 {
2321 // perform the work while holding the lock, but perform any printing
2322 // outside the lock
2323 MutexLocker mu(AdapterHandlerLibrary_lock);
2324 // See if somebody beat us to it
2325 nm = method->code();
2326 if (nm) {
2327 return nm;
2328 }
2329
2330 ResourceMark rm;
2331
2332 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2333 if (buf != NULL) {
2334 CodeBuffer buffer(buf->instructions_begin(), buf->instructions_size());
2335 // Need a few relocation entries
2336 double locs_buf[20];
2337 buffer.insts()->initialize_shared_locs(
2338 (relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2339 MacroAssembler _masm(&buffer);
2340
2341 // Generate the compiled-to-native wrapper code
2342 nm = SharedRuntime::generate_dtrace_nmethod(&_masm, method);
2343 }
2344 }
2345 return nm;
2346 }
2347
2348 // the dtrace method needs to convert java lang string to utf8 string.
2349 void SharedRuntime::get_utf(oopDesc* src, address dst) {
2350 typeArrayOop jlsValue = java_lang_String::value(src);
2351 int jlsOffset = java_lang_String::offset(src);
2352 int jlsLen = java_lang_String::length(src);
2353 jchar* jlsPos = (jlsLen == 0) ? NULL :
2354 jlsValue->char_at_addr(jlsOffset);
2355 (void) UNICODE::as_utf8(jlsPos, jlsLen, (char *)dst, max_dtrace_string_size);
2356 }
2357 #endif // ndef HAVE_DTRACE_H
2358
2359 // -------------------------------------------------------------------------
2360 // Java-Java calling convention
2361 // (what you use when Java calls Java)
2362
2363 //------------------------------name_for_receiver----------------------------------
2364 // For a given signature, return the VMReg for parameter 0.
2365 VMReg SharedRuntime::name_for_receiver() {
2366 VMRegPair regs;
2367 BasicType sig_bt = T_OBJECT;
2368 (void) java_calling_convention(&sig_bt, ®s, 1, true);
2369 // Return argument 0 register. In the LP64 build pointers
2370 // take 2 registers, but the VM wants only the 'main' name.
2371 return regs.first();
2372 }
2373
2374 VMRegPair *SharedRuntime::find_callee_arguments(symbolOop sig, bool has_receiver, int* arg_size) {
2375 // This method is returning a data structure allocating as a
2376 // ResourceObject, so do not put any ResourceMarks in here.
2377 char *s = sig->as_C_string();
2378 int len = (int)strlen(s);
2379 *s++; len--; // Skip opening paren
2380 char *t = s+len;
2381 while( *(--t) != ')' ) ; // Find close paren
2382
2383 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, 256 );
2384 VMRegPair *regs = NEW_RESOURCE_ARRAY( VMRegPair, 256 );
2385 int cnt = 0;
2386 if (has_receiver) {
2387 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
2388 }
2389
2390 while( s < t ) {
2391 switch( *s++ ) { // Switch on signature character
2392 case 'B': sig_bt[cnt++] = T_BYTE; break;
2393 case 'C': sig_bt[cnt++] = T_CHAR; break;
2394 case 'D': sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break;
2395 case 'F': sig_bt[cnt++] = T_FLOAT; break;
2396 case 'I': sig_bt[cnt++] = T_INT; break;
2397 case 'J': sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break;
2398 case 'S': sig_bt[cnt++] = T_SHORT; break;
2399 case 'Z': sig_bt[cnt++] = T_BOOLEAN; break;
2400 case 'V': sig_bt[cnt++] = T_VOID; break;
2401 case 'L': // Oop
2402 while( *s++ != ';' ) ; // Skip signature
2403 sig_bt[cnt++] = T_OBJECT;
2404 break;
2405 case '[': { // Array
2406 do { // Skip optional size
2407 while( *s >= '0' && *s <= '9' ) s++;
2408 } while( *s++ == '[' ); // Nested arrays?
2409 // Skip element type
2410 if( s[-1] == 'L' )
2411 while( *s++ != ';' ) ; // Skip signature
2412 sig_bt[cnt++] = T_ARRAY;
2413 break;
2414 }
2415 default : ShouldNotReachHere();
2416 }
2417 }
2418 assert( cnt < 256, "grow table size" );
2419
2420 int comp_args_on_stack;
2421 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true);
2422
2423 // the calling convention doesn't count out_preserve_stack_slots so
2424 // we must add that in to get "true" stack offsets.
2425
2426 if (comp_args_on_stack) {
2427 for (int i = 0; i < cnt; i++) {
2428 VMReg reg1 = regs[i].first();
2429 if( reg1->is_stack()) {
2430 // Yuck
2431 reg1 = reg1->bias(out_preserve_stack_slots());
2432 }
2433 VMReg reg2 = regs[i].second();
2434 if( reg2->is_stack()) {
2435 // Yuck
2436 reg2 = reg2->bias(out_preserve_stack_slots());
2437 }
2438 regs[i].set_pair(reg2, reg1);
2439 }
2440 }
2441
2442 // results
2443 *arg_size = cnt;
2444 return regs;
2445 }
2446
2447 // OSR Migration Code
2448 //
2449 // This code is used convert interpreter frames into compiled frames. It is
2450 // called from very start of a compiled OSR nmethod. A temp array is
2451 // allocated to hold the interesting bits of the interpreter frame. All
2452 // active locks are inflated to allow them to move. The displaced headers and
2453 // active interpeter locals are copied into the temp buffer. Then we return
2454 // back to the compiled code. The compiled code then pops the current
2455 // interpreter frame off the stack and pushes a new compiled frame. Then it
2456 // copies the interpreter locals and displaced headers where it wants.
2457 // Finally it calls back to free the temp buffer.
2458 //
2459 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
2460
2461 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) )
2462
2463 #ifdef IA64
2464 ShouldNotReachHere(); // NYI
2465 #endif /* IA64 */
2466
2467 //
2468 // This code is dependent on the memory layout of the interpreter local
2469 // array and the monitors. On all of our platforms the layout is identical
2470 // so this code is shared. If some platform lays the their arrays out
2471 // differently then this code could move to platform specific code or
2472 // the code here could be modified to copy items one at a time using
2473 // frame accessor methods and be platform independent.
2474
2475 frame fr = thread->last_frame();
2476 assert( fr.is_interpreted_frame(), "" );
2477 assert( fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks" );
2478
2479 // Figure out how many monitors are active.
2480 int active_monitor_count = 0;
2481 for( BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
2482 kptr < fr.interpreter_frame_monitor_begin();
2483 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
2484 if( kptr->obj() != NULL ) active_monitor_count++;
2485 }
2486
2487 // QQQ we could place number of active monitors in the array so that compiled code
2488 // could double check it.
2489
2490 methodOop moop = fr.interpreter_frame_method();
2491 int max_locals = moop->max_locals();
2492 // Allocate temp buffer, 1 word per local & 2 per active monitor
2493 int buf_size_words = max_locals + active_monitor_count*2;
2494 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words);
2495
2496 // Copy the locals. Order is preserved so that loading of longs works.
2497 // Since there's no GC I can copy the oops blindly.
2498 assert( sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
2499 if (TaggedStackInterpreter) {
2500 for (int i = 0; i < max_locals; i++) {
2501 // copy only each local separately to the buffer avoiding the tag
2502 buf[i] = *fr.interpreter_frame_local_at(max_locals-i-1);
2503 }
2504 } else {
2505 Copy::disjoint_words(
2506 (HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
2507 (HeapWord*)&buf[0],
2508 max_locals);
2509 }
2510
2511 // Inflate locks. Copy the displaced headers. Be careful, there can be holes.
2512 int i = max_locals;
2513 for( BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
2514 kptr2 < fr.interpreter_frame_monitor_begin();
2515 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
2516 if( kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array
2517 BasicLock *lock = kptr2->lock();
2518 // Inflate so the displaced header becomes position-independent
2519 if (lock->displaced_header()->is_unlocked())
2520 ObjectSynchronizer::inflate_helper(kptr2->obj());
2521 // Now the displaced header is free to move
2522 buf[i++] = (intptr_t)lock->displaced_header();
2523 buf[i++] = (intptr_t)kptr2->obj();
2524 }
2525 }
2526 assert( i - max_locals == active_monitor_count*2, "found the expected number of monitors" );
2527
2528 return buf;
2529 JRT_END
2530
2531 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
2532 FREE_C_HEAP_ARRAY(intptr_t,buf);
2533 JRT_END
2534
2535 #ifndef PRODUCT
2536 bool AdapterHandlerLibrary::contains(CodeBlob* b) {
2537 AdapterHandlerTableIterator iter(_adapters);
2538 while (iter.has_next()) {
2539 AdapterHandlerEntry* a = iter.next();
2540 if ( b == CodeCache::find_blob(a->get_i2c_entry()) ) return true;
2541 }
2542 return false;
2543 }
2544
2545 void AdapterHandlerLibrary::print_handler(CodeBlob* b) {
2546 AdapterHandlerTableIterator iter(_adapters);
2547 while (iter.has_next()) {
2548 AdapterHandlerEntry* a = iter.next();
2549 if ( b == CodeCache::find_blob(a->get_i2c_entry()) ) {
2550 tty->print("Adapter for signature: ");
2551 tty->print_cr("%s i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT,
2552 a->fingerprint()->as_string(),
2553 a->get_i2c_entry(), a->get_c2i_entry(), a->get_c2i_unverified_entry());
2554 return;
2555 }
2556 }
2557 assert(false, "Should have found handler");
2558 }
2559
2560 void AdapterHandlerLibrary::print_statistics() {
2561 _adapters->print_statistics();
2562 }
2563
2564 #endif /* PRODUCT */