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