Fri, 05 Sep 2014 12:36:37 -0700
8057623: add an extension class for argument handling
Reviewed-by: brutisso, mgerdin, tschatzl
1 /*
2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "classfile/vmSymbols.hpp"
28 #include "code/compiledIC.hpp"
29 #include "code/scopeDesc.hpp"
30 #include "code/vtableStubs.hpp"
31 #include "compiler/abstractCompiler.hpp"
32 #include "compiler/compileBroker.hpp"
33 #include "compiler/compilerOracle.hpp"
34 #include "compiler/disassembler.hpp"
35 #include "interpreter/interpreter.hpp"
36 #include "interpreter/interpreterRuntime.hpp"
37 #include "memory/gcLocker.inline.hpp"
38 #include "memory/universe.inline.hpp"
39 #include "oops/oop.inline.hpp"
40 #include "prims/forte.hpp"
41 #include "prims/jvmtiExport.hpp"
42 #include "prims/jvmtiRedefineClassesTrace.hpp"
43 #include "prims/methodHandles.hpp"
44 #include "prims/nativeLookup.hpp"
45 #include "runtime/arguments.hpp"
46 #include "runtime/biasedLocking.hpp"
47 #include "runtime/handles.inline.hpp"
48 #include "runtime/init.hpp"
49 #include "runtime/interfaceSupport.hpp"
50 #include "runtime/javaCalls.hpp"
51 #include "runtime/sharedRuntime.hpp"
52 #include "runtime/stubRoutines.hpp"
53 #include "runtime/vframe.hpp"
54 #include "runtime/vframeArray.hpp"
55 #include "utilities/copy.hpp"
56 #include "utilities/dtrace.hpp"
57 #include "utilities/events.hpp"
58 #include "utilities/hashtable.inline.hpp"
59 #include "utilities/macros.hpp"
60 #include "utilities/xmlstream.hpp"
61 #ifdef TARGET_ARCH_x86
62 # include "nativeInst_x86.hpp"
63 # include "vmreg_x86.inline.hpp"
64 #endif
65 #ifdef TARGET_ARCH_sparc
66 # include "nativeInst_sparc.hpp"
67 # include "vmreg_sparc.inline.hpp"
68 #endif
69 #ifdef TARGET_ARCH_zero
70 # include "nativeInst_zero.hpp"
71 # include "vmreg_zero.inline.hpp"
72 #endif
73 #ifdef TARGET_ARCH_arm
74 # include "nativeInst_arm.hpp"
75 # include "vmreg_arm.inline.hpp"
76 #endif
77 #ifdef TARGET_ARCH_ppc
78 # include "nativeInst_ppc.hpp"
79 # include "vmreg_ppc.inline.hpp"
80 #endif
81 #ifdef COMPILER1
82 #include "c1/c1_Runtime1.hpp"
83 #endif
85 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
87 // Shared stub locations
88 RuntimeStub* SharedRuntime::_wrong_method_blob;
89 RuntimeStub* SharedRuntime::_wrong_method_abstract_blob;
90 RuntimeStub* SharedRuntime::_ic_miss_blob;
91 RuntimeStub* SharedRuntime::_resolve_opt_virtual_call_blob;
92 RuntimeStub* SharedRuntime::_resolve_virtual_call_blob;
93 RuntimeStub* SharedRuntime::_resolve_static_call_blob;
95 DeoptimizationBlob* SharedRuntime::_deopt_blob;
96 SafepointBlob* SharedRuntime::_polling_page_vectors_safepoint_handler_blob;
97 SafepointBlob* SharedRuntime::_polling_page_safepoint_handler_blob;
98 SafepointBlob* SharedRuntime::_polling_page_return_handler_blob;
100 #ifdef COMPILER2
101 UncommonTrapBlob* SharedRuntime::_uncommon_trap_blob;
102 #endif // COMPILER2
105 //----------------------------generate_stubs-----------------------------------
106 void SharedRuntime::generate_stubs() {
107 _wrong_method_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method), "wrong_method_stub");
108 _wrong_method_abstract_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_abstract), "wrong_method_abstract_stub");
109 _ic_miss_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_ic_miss), "ic_miss_stub");
110 _resolve_opt_virtual_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_opt_virtual_call_C), "resolve_opt_virtual_call");
111 _resolve_virtual_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_virtual_call_C), "resolve_virtual_call");
112 _resolve_static_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_static_call_C), "resolve_static_call");
114 #ifdef COMPILER2
115 // Vectors are generated only by C2.
116 if (is_wide_vector(MaxVectorSize)) {
117 _polling_page_vectors_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_VECTOR_LOOP);
118 }
119 #endif // COMPILER2
120 _polling_page_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_LOOP);
121 _polling_page_return_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_RETURN);
123 generate_deopt_blob();
125 #ifdef COMPILER2
126 generate_uncommon_trap_blob();
127 #endif // COMPILER2
128 }
130 #include <math.h>
132 #ifndef USDT2
133 HS_DTRACE_PROBE_DECL4(hotspot, object__alloc, Thread*, char*, int, size_t);
134 HS_DTRACE_PROBE_DECL7(hotspot, method__entry, int,
135 char*, int, char*, int, char*, int);
136 HS_DTRACE_PROBE_DECL7(hotspot, method__return, int,
137 char*, int, char*, int, char*, int);
138 #endif /* !USDT2 */
140 // Implementation of SharedRuntime
142 #ifndef PRODUCT
143 // For statistics
144 int SharedRuntime::_ic_miss_ctr = 0;
145 int SharedRuntime::_wrong_method_ctr = 0;
146 int SharedRuntime::_resolve_static_ctr = 0;
147 int SharedRuntime::_resolve_virtual_ctr = 0;
148 int SharedRuntime::_resolve_opt_virtual_ctr = 0;
149 int SharedRuntime::_implicit_null_throws = 0;
150 int SharedRuntime::_implicit_div0_throws = 0;
151 int SharedRuntime::_throw_null_ctr = 0;
153 int SharedRuntime::_nof_normal_calls = 0;
154 int SharedRuntime::_nof_optimized_calls = 0;
155 int SharedRuntime::_nof_inlined_calls = 0;
156 int SharedRuntime::_nof_megamorphic_calls = 0;
157 int SharedRuntime::_nof_static_calls = 0;
158 int SharedRuntime::_nof_inlined_static_calls = 0;
159 int SharedRuntime::_nof_interface_calls = 0;
160 int SharedRuntime::_nof_optimized_interface_calls = 0;
161 int SharedRuntime::_nof_inlined_interface_calls = 0;
162 int SharedRuntime::_nof_megamorphic_interface_calls = 0;
163 int SharedRuntime::_nof_removable_exceptions = 0;
165 int SharedRuntime::_new_instance_ctr=0;
166 int SharedRuntime::_new_array_ctr=0;
167 int SharedRuntime::_multi1_ctr=0;
168 int SharedRuntime::_multi2_ctr=0;
169 int SharedRuntime::_multi3_ctr=0;
170 int SharedRuntime::_multi4_ctr=0;
171 int SharedRuntime::_multi5_ctr=0;
172 int SharedRuntime::_mon_enter_stub_ctr=0;
173 int SharedRuntime::_mon_exit_stub_ctr=0;
174 int SharedRuntime::_mon_enter_ctr=0;
175 int SharedRuntime::_mon_exit_ctr=0;
176 int SharedRuntime::_partial_subtype_ctr=0;
177 int SharedRuntime::_jbyte_array_copy_ctr=0;
178 int SharedRuntime::_jshort_array_copy_ctr=0;
179 int SharedRuntime::_jint_array_copy_ctr=0;
180 int SharedRuntime::_jlong_array_copy_ctr=0;
181 int SharedRuntime::_oop_array_copy_ctr=0;
182 int SharedRuntime::_checkcast_array_copy_ctr=0;
183 int SharedRuntime::_unsafe_array_copy_ctr=0;
184 int SharedRuntime::_generic_array_copy_ctr=0;
185 int SharedRuntime::_slow_array_copy_ctr=0;
186 int SharedRuntime::_find_handler_ctr=0;
187 int SharedRuntime::_rethrow_ctr=0;
189 int SharedRuntime::_ICmiss_index = 0;
190 int SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count];
191 address SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count];
194 void SharedRuntime::trace_ic_miss(address at) {
195 for (int i = 0; i < _ICmiss_index; i++) {
196 if (_ICmiss_at[i] == at) {
197 _ICmiss_count[i]++;
198 return;
199 }
200 }
201 int index = _ICmiss_index++;
202 if (_ICmiss_index >= maxICmiss_count) _ICmiss_index = maxICmiss_count - 1;
203 _ICmiss_at[index] = at;
204 _ICmiss_count[index] = 1;
205 }
207 void SharedRuntime::print_ic_miss_histogram() {
208 if (ICMissHistogram) {
209 tty->print_cr ("IC Miss Histogram:");
210 int tot_misses = 0;
211 for (int i = 0; i < _ICmiss_index; i++) {
212 tty->print_cr(" at: " INTPTR_FORMAT " nof: %d", _ICmiss_at[i], _ICmiss_count[i]);
213 tot_misses += _ICmiss_count[i];
214 }
215 tty->print_cr ("Total IC misses: %7d", tot_misses);
216 }
217 }
218 #endif // PRODUCT
220 #if INCLUDE_ALL_GCS
222 // G1 write-barrier pre: executed before a pointer store.
223 JRT_LEAF(void, SharedRuntime::g1_wb_pre(oopDesc* orig, JavaThread *thread))
224 if (orig == NULL) {
225 assert(false, "should be optimized out");
226 return;
227 }
228 assert(orig->is_oop(true /* ignore mark word */), "Error");
229 // store the original value that was in the field reference
230 thread->satb_mark_queue().enqueue(orig);
231 JRT_END
233 // G1 write-barrier post: executed after a pointer store.
234 JRT_LEAF(void, SharedRuntime::g1_wb_post(void* card_addr, JavaThread* thread))
235 thread->dirty_card_queue().enqueue(card_addr);
236 JRT_END
238 #endif // INCLUDE_ALL_GCS
241 JRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x))
242 return x * y;
243 JRT_END
246 JRT_LEAF(jlong, SharedRuntime::ldiv(jlong y, jlong x))
247 if (x == min_jlong && y == CONST64(-1)) {
248 return x;
249 } else {
250 return x / y;
251 }
252 JRT_END
255 JRT_LEAF(jlong, SharedRuntime::lrem(jlong y, jlong x))
256 if (x == min_jlong && y == CONST64(-1)) {
257 return 0;
258 } else {
259 return x % y;
260 }
261 JRT_END
264 const juint float_sign_mask = 0x7FFFFFFF;
265 const juint float_infinity = 0x7F800000;
266 const julong double_sign_mask = CONST64(0x7FFFFFFFFFFFFFFF);
267 const julong double_infinity = CONST64(0x7FF0000000000000);
269 JRT_LEAF(jfloat, SharedRuntime::frem(jfloat x, jfloat y))
270 #ifdef _WIN64
271 // 64-bit Windows on amd64 returns the wrong values for
272 // infinity operands.
273 union { jfloat f; juint i; } xbits, ybits;
274 xbits.f = x;
275 ybits.f = y;
276 // x Mod Infinity == x unless x is infinity
277 if ( ((xbits.i & float_sign_mask) != float_infinity) &&
278 ((ybits.i & float_sign_mask) == float_infinity) ) {
279 return x;
280 }
281 #endif
282 return ((jfloat)fmod((double)x,(double)y));
283 JRT_END
286 JRT_LEAF(jdouble, SharedRuntime::drem(jdouble x, jdouble y))
287 #ifdef _WIN64
288 union { jdouble d; julong l; } xbits, ybits;
289 xbits.d = x;
290 ybits.d = y;
291 // x Mod Infinity == x unless x is infinity
292 if ( ((xbits.l & double_sign_mask) != double_infinity) &&
293 ((ybits.l & double_sign_mask) == double_infinity) ) {
294 return x;
295 }
296 #endif
297 return ((jdouble)fmod((double)x,(double)y));
298 JRT_END
300 #ifdef __SOFTFP__
301 JRT_LEAF(jfloat, SharedRuntime::fadd(jfloat x, jfloat y))
302 return x + y;
303 JRT_END
305 JRT_LEAF(jfloat, SharedRuntime::fsub(jfloat x, jfloat y))
306 return x - y;
307 JRT_END
309 JRT_LEAF(jfloat, SharedRuntime::fmul(jfloat x, jfloat y))
310 return x * y;
311 JRT_END
313 JRT_LEAF(jfloat, SharedRuntime::fdiv(jfloat x, jfloat y))
314 return x / y;
315 JRT_END
317 JRT_LEAF(jdouble, SharedRuntime::dadd(jdouble x, jdouble y))
318 return x + y;
319 JRT_END
321 JRT_LEAF(jdouble, SharedRuntime::dsub(jdouble x, jdouble y))
322 return x - y;
323 JRT_END
325 JRT_LEAF(jdouble, SharedRuntime::dmul(jdouble x, jdouble y))
326 return x * y;
327 JRT_END
329 JRT_LEAF(jdouble, SharedRuntime::ddiv(jdouble x, jdouble y))
330 return x / y;
331 JRT_END
333 JRT_LEAF(jfloat, SharedRuntime::i2f(jint x))
334 return (jfloat)x;
335 JRT_END
337 JRT_LEAF(jdouble, SharedRuntime::i2d(jint x))
338 return (jdouble)x;
339 JRT_END
341 JRT_LEAF(jdouble, SharedRuntime::f2d(jfloat x))
342 return (jdouble)x;
343 JRT_END
345 JRT_LEAF(int, SharedRuntime::fcmpl(float x, float y))
346 return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan*/
347 JRT_END
349 JRT_LEAF(int, SharedRuntime::fcmpg(float x, float y))
350 return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */
351 JRT_END
353 JRT_LEAF(int, SharedRuntime::dcmpl(double x, double y))
354 return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan */
355 JRT_END
357 JRT_LEAF(int, SharedRuntime::dcmpg(double x, double y))
358 return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */
359 JRT_END
361 // Functions to return the opposite of the aeabi functions for nan.
362 JRT_LEAF(int, SharedRuntime::unordered_fcmplt(float x, float y))
363 return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
364 JRT_END
366 JRT_LEAF(int, SharedRuntime::unordered_dcmplt(double x, double y))
367 return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
368 JRT_END
370 JRT_LEAF(int, SharedRuntime::unordered_fcmple(float x, float y))
371 return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
372 JRT_END
374 JRT_LEAF(int, SharedRuntime::unordered_dcmple(double x, double y))
375 return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
376 JRT_END
378 JRT_LEAF(int, SharedRuntime::unordered_fcmpge(float x, float y))
379 return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
380 JRT_END
382 JRT_LEAF(int, SharedRuntime::unordered_dcmpge(double x, double y))
383 return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
384 JRT_END
386 JRT_LEAF(int, SharedRuntime::unordered_fcmpgt(float x, float y))
387 return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
388 JRT_END
390 JRT_LEAF(int, SharedRuntime::unordered_dcmpgt(double x, double y))
391 return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
392 JRT_END
394 // Intrinsics make gcc generate code for these.
395 float SharedRuntime::fneg(float f) {
396 return -f;
397 }
399 double SharedRuntime::dneg(double f) {
400 return -f;
401 }
403 #endif // __SOFTFP__
405 #if defined(__SOFTFP__) || defined(E500V2)
406 // Intrinsics make gcc generate code for these.
407 double SharedRuntime::dabs(double f) {
408 return (f <= (double)0.0) ? (double)0.0 - f : f;
409 }
411 #endif
413 #if defined(__SOFTFP__) || defined(PPC32)
414 double SharedRuntime::dsqrt(double f) {
415 return sqrt(f);
416 }
417 #endif
419 JRT_LEAF(jint, SharedRuntime::f2i(jfloat x))
420 if (g_isnan(x))
421 return 0;
422 if (x >= (jfloat) max_jint)
423 return max_jint;
424 if (x <= (jfloat) min_jint)
425 return min_jint;
426 return (jint) x;
427 JRT_END
430 JRT_LEAF(jlong, SharedRuntime::f2l(jfloat x))
431 if (g_isnan(x))
432 return 0;
433 if (x >= (jfloat) max_jlong)
434 return max_jlong;
435 if (x <= (jfloat) min_jlong)
436 return min_jlong;
437 return (jlong) x;
438 JRT_END
441 JRT_LEAF(jint, SharedRuntime::d2i(jdouble x))
442 if (g_isnan(x))
443 return 0;
444 if (x >= (jdouble) max_jint)
445 return max_jint;
446 if (x <= (jdouble) min_jint)
447 return min_jint;
448 return (jint) x;
449 JRT_END
452 JRT_LEAF(jlong, SharedRuntime::d2l(jdouble x))
453 if (g_isnan(x))
454 return 0;
455 if (x >= (jdouble) max_jlong)
456 return max_jlong;
457 if (x <= (jdouble) min_jlong)
458 return min_jlong;
459 return (jlong) x;
460 JRT_END
463 JRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x))
464 return (jfloat)x;
465 JRT_END
468 JRT_LEAF(jfloat, SharedRuntime::l2f(jlong x))
469 return (jfloat)x;
470 JRT_END
473 JRT_LEAF(jdouble, SharedRuntime::l2d(jlong x))
474 return (jdouble)x;
475 JRT_END
477 // Exception handling accross interpreter/compiler boundaries
478 //
479 // exception_handler_for_return_address(...) returns the continuation address.
480 // The continuation address is the entry point of the exception handler of the
481 // previous frame depending on the return address.
483 address SharedRuntime::raw_exception_handler_for_return_address(JavaThread* thread, address return_address) {
484 assert(frame::verify_return_pc(return_address), err_msg("must be a return address: " INTPTR_FORMAT, return_address));
486 // Reset method handle flag.
487 thread->set_is_method_handle_return(false);
489 // The fastest case first
490 CodeBlob* blob = CodeCache::find_blob(return_address);
491 nmethod* nm = (blob != NULL) ? blob->as_nmethod_or_null() : NULL;
492 if (nm != NULL) {
493 // Set flag if return address is a method handle call site.
494 thread->set_is_method_handle_return(nm->is_method_handle_return(return_address));
495 // native nmethods don't have exception handlers
496 assert(!nm->is_native_method(), "no exception handler");
497 assert(nm->header_begin() != nm->exception_begin(), "no exception handler");
498 if (nm->is_deopt_pc(return_address)) {
499 // If we come here because of a stack overflow, the stack may be
500 // unguarded. Reguard the stack otherwise if we return to the
501 // deopt blob and the stack bang causes a stack overflow we
502 // crash.
503 bool guard_pages_enabled = thread->stack_yellow_zone_enabled();
504 if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack();
505 assert(guard_pages_enabled, "stack banging in deopt blob may cause crash");
506 return SharedRuntime::deopt_blob()->unpack_with_exception();
507 } else {
508 return nm->exception_begin();
509 }
510 }
512 // Entry code
513 if (StubRoutines::returns_to_call_stub(return_address)) {
514 return StubRoutines::catch_exception_entry();
515 }
516 // Interpreted code
517 if (Interpreter::contains(return_address)) {
518 return Interpreter::rethrow_exception_entry();
519 }
521 guarantee(blob == NULL || !blob->is_runtime_stub(), "caller should have skipped stub");
522 guarantee(!VtableStubs::contains(return_address), "NULL exceptions in vtables should have been handled already!");
524 #ifndef PRODUCT
525 { ResourceMark rm;
526 tty->print_cr("No exception handler found for exception at " INTPTR_FORMAT " - potential problems:", return_address);
527 tty->print_cr("a) exception happened in (new?) code stubs/buffers that is not handled here");
528 tty->print_cr("b) other problem");
529 }
530 #endif // PRODUCT
532 ShouldNotReachHere();
533 return NULL;
534 }
537 JRT_LEAF(address, SharedRuntime::exception_handler_for_return_address(JavaThread* thread, address return_address))
538 return raw_exception_handler_for_return_address(thread, return_address);
539 JRT_END
542 address SharedRuntime::get_poll_stub(address pc) {
543 address stub;
544 // Look up the code blob
545 CodeBlob *cb = CodeCache::find_blob(pc);
547 // Should be an nmethod
548 assert( cb && cb->is_nmethod(), "safepoint polling: pc must refer to an nmethod" );
550 // Look up the relocation information
551 assert( ((nmethod*)cb)->is_at_poll_or_poll_return(pc),
552 "safepoint polling: type must be poll" );
554 assert( ((NativeInstruction*)pc)->is_safepoint_poll(),
555 "Only polling locations are used for safepoint");
557 bool at_poll_return = ((nmethod*)cb)->is_at_poll_return(pc);
558 bool has_wide_vectors = ((nmethod*)cb)->has_wide_vectors();
559 if (at_poll_return) {
560 assert(SharedRuntime::polling_page_return_handler_blob() != NULL,
561 "polling page return stub not created yet");
562 stub = SharedRuntime::polling_page_return_handler_blob()->entry_point();
563 } else if (has_wide_vectors) {
564 assert(SharedRuntime::polling_page_vectors_safepoint_handler_blob() != NULL,
565 "polling page vectors safepoint stub not created yet");
566 stub = SharedRuntime::polling_page_vectors_safepoint_handler_blob()->entry_point();
567 } else {
568 assert(SharedRuntime::polling_page_safepoint_handler_blob() != NULL,
569 "polling page safepoint stub not created yet");
570 stub = SharedRuntime::polling_page_safepoint_handler_blob()->entry_point();
571 }
572 #ifndef PRODUCT
573 if( TraceSafepoint ) {
574 char buf[256];
575 jio_snprintf(buf, sizeof(buf),
576 "... found polling page %s exception at pc = "
577 INTPTR_FORMAT ", stub =" INTPTR_FORMAT,
578 at_poll_return ? "return" : "loop",
579 (intptr_t)pc, (intptr_t)stub);
580 tty->print_raw_cr(buf);
581 }
582 #endif // PRODUCT
583 return stub;
584 }
587 oop SharedRuntime::retrieve_receiver( Symbol* sig, frame caller ) {
588 assert(caller.is_interpreted_frame(), "");
589 int args_size = ArgumentSizeComputer(sig).size() + 1;
590 assert(args_size <= caller.interpreter_frame_expression_stack_size(), "receiver must be on interpreter stack");
591 oop result = cast_to_oop(*caller.interpreter_frame_tos_at(args_size - 1));
592 assert(Universe::heap()->is_in(result) && result->is_oop(), "receiver must be an oop");
593 return result;
594 }
597 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Handle h_exception) {
598 if (JvmtiExport::can_post_on_exceptions()) {
599 vframeStream vfst(thread, true);
600 methodHandle method = methodHandle(thread, vfst.method());
601 address bcp = method()->bcp_from(vfst.bci());
602 JvmtiExport::post_exception_throw(thread, method(), bcp, h_exception());
603 }
604 Exceptions::_throw(thread, __FILE__, __LINE__, h_exception);
605 }
607 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Symbol* name, const char *message) {
608 Handle h_exception = Exceptions::new_exception(thread, name, message);
609 throw_and_post_jvmti_exception(thread, h_exception);
610 }
612 // The interpreter code to call this tracing function is only
613 // called/generated when TraceRedefineClasses has the right bits
614 // set. Since obsolete methods are never compiled, we don't have
615 // to modify the compilers to generate calls to this function.
616 //
617 JRT_LEAF(int, SharedRuntime::rc_trace_method_entry(
618 JavaThread* thread, Method* method))
619 assert(RC_TRACE_IN_RANGE(0x00001000, 0x00002000), "wrong call");
621 if (method->is_obsolete()) {
622 // We are calling an obsolete method, but this is not necessarily
623 // an error. Our method could have been redefined just after we
624 // fetched the Method* from the constant pool.
626 // RC_TRACE macro has an embedded ResourceMark
627 RC_TRACE_WITH_THREAD(0x00001000, thread,
628 ("calling obsolete method '%s'",
629 method->name_and_sig_as_C_string()));
630 if (RC_TRACE_ENABLED(0x00002000)) {
631 // this option is provided to debug calls to obsolete methods
632 guarantee(false, "faulting at call to an obsolete method.");
633 }
634 }
635 return 0;
636 JRT_END
638 // ret_pc points into caller; we are returning caller's exception handler
639 // for given exception
640 address SharedRuntime::compute_compiled_exc_handler(nmethod* nm, address ret_pc, Handle& exception,
641 bool force_unwind, bool top_frame_only) {
642 assert(nm != NULL, "must exist");
643 ResourceMark rm;
645 ScopeDesc* sd = nm->scope_desc_at(ret_pc);
646 // determine handler bci, if any
647 EXCEPTION_MARK;
649 int handler_bci = -1;
650 int scope_depth = 0;
651 if (!force_unwind) {
652 int bci = sd->bci();
653 bool recursive_exception = false;
654 do {
655 bool skip_scope_increment = false;
656 // exception handler lookup
657 KlassHandle ek (THREAD, exception->klass());
658 methodHandle mh(THREAD, sd->method());
659 handler_bci = Method::fast_exception_handler_bci_for(mh, ek, bci, THREAD);
660 if (HAS_PENDING_EXCEPTION) {
661 recursive_exception = true;
662 // We threw an exception while trying to find the exception handler.
663 // Transfer the new exception to the exception handle which will
664 // be set into thread local storage, and do another lookup for an
665 // exception handler for this exception, this time starting at the
666 // BCI of the exception handler which caused the exception to be
667 // thrown (bugs 4307310 and 4546590). Set "exception" reference
668 // argument to ensure that the correct exception is thrown (4870175).
669 exception = Handle(THREAD, PENDING_EXCEPTION);
670 CLEAR_PENDING_EXCEPTION;
671 if (handler_bci >= 0) {
672 bci = handler_bci;
673 handler_bci = -1;
674 skip_scope_increment = true;
675 }
676 }
677 else {
678 recursive_exception = false;
679 }
680 if (!top_frame_only && handler_bci < 0 && !skip_scope_increment) {
681 sd = sd->sender();
682 if (sd != NULL) {
683 bci = sd->bci();
684 }
685 ++scope_depth;
686 }
687 } while (recursive_exception || (!top_frame_only && handler_bci < 0 && sd != NULL));
688 }
690 // found handling method => lookup exception handler
691 int catch_pco = ret_pc - nm->code_begin();
693 ExceptionHandlerTable table(nm);
694 HandlerTableEntry *t = table.entry_for(catch_pco, handler_bci, scope_depth);
695 if (t == NULL && (nm->is_compiled_by_c1() || handler_bci != -1)) {
696 // Allow abbreviated catch tables. The idea is to allow a method
697 // to materialize its exceptions without committing to the exact
698 // routing of exceptions. In particular this is needed for adding
699 // a synthethic handler to unlock monitors when inlining
700 // synchonized methods since the unlock path isn't represented in
701 // the bytecodes.
702 t = table.entry_for(catch_pco, -1, 0);
703 }
705 #ifdef COMPILER1
706 if (t == NULL && nm->is_compiled_by_c1()) {
707 assert(nm->unwind_handler_begin() != NULL, "");
708 return nm->unwind_handler_begin();
709 }
710 #endif
712 if (t == NULL) {
713 tty->print_cr("MISSING EXCEPTION HANDLER for pc " INTPTR_FORMAT " and handler bci %d", ret_pc, handler_bci);
714 tty->print_cr(" Exception:");
715 exception->print();
716 tty->cr();
717 tty->print_cr(" Compiled exception table :");
718 table.print();
719 nm->print_code();
720 guarantee(false, "missing exception handler");
721 return NULL;
722 }
724 return nm->code_begin() + t->pco();
725 }
727 JRT_ENTRY(void, SharedRuntime::throw_AbstractMethodError(JavaThread* thread))
728 // These errors occur only at call sites
729 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_AbstractMethodError());
730 JRT_END
732 JRT_ENTRY(void, SharedRuntime::throw_IncompatibleClassChangeError(JavaThread* thread))
733 // These errors occur only at call sites
734 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError(), "vtable stub");
735 JRT_END
737 JRT_ENTRY(void, SharedRuntime::throw_ArithmeticException(JavaThread* thread))
738 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
739 JRT_END
741 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* thread))
742 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
743 JRT_END
745 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException_at_call(JavaThread* thread))
746 // This entry point is effectively only used for NullPointerExceptions which occur at inline
747 // cache sites (when the callee activation is not yet set up) so we are at a call site
748 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
749 JRT_END
751 JRT_ENTRY(void, SharedRuntime::throw_StackOverflowError(JavaThread* thread))
752 // We avoid using the normal exception construction in this case because
753 // it performs an upcall to Java, and we're already out of stack space.
754 Klass* k = SystemDictionary::StackOverflowError_klass();
755 oop exception_oop = InstanceKlass::cast(k)->allocate_instance(CHECK);
756 Handle exception (thread, exception_oop);
757 if (StackTraceInThrowable) {
758 java_lang_Throwable::fill_in_stack_trace(exception);
759 }
760 throw_and_post_jvmti_exception(thread, exception);
761 JRT_END
763 address SharedRuntime::continuation_for_implicit_exception(JavaThread* thread,
764 address pc,
765 SharedRuntime::ImplicitExceptionKind exception_kind)
766 {
767 address target_pc = NULL;
769 if (Interpreter::contains(pc)) {
770 #ifdef CC_INTERP
771 // C++ interpreter doesn't throw implicit exceptions
772 ShouldNotReachHere();
773 #else
774 switch (exception_kind) {
775 case IMPLICIT_NULL: return Interpreter::throw_NullPointerException_entry();
776 case IMPLICIT_DIVIDE_BY_ZERO: return Interpreter::throw_ArithmeticException_entry();
777 case STACK_OVERFLOW: return Interpreter::throw_StackOverflowError_entry();
778 default: ShouldNotReachHere();
779 }
780 #endif // !CC_INTERP
781 } else {
782 switch (exception_kind) {
783 case STACK_OVERFLOW: {
784 // Stack overflow only occurs upon frame setup; the callee is
785 // going to be unwound. Dispatch to a shared runtime stub
786 // which will cause the StackOverflowError to be fabricated
787 // and processed.
788 // Stack overflow should never occur during deoptimization:
789 // the compiled method bangs the stack by as much as the
790 // interpreter would need in case of a deoptimization. The
791 // deoptimization blob and uncommon trap blob bang the stack
792 // in a debug VM to verify the correctness of the compiled
793 // method stack banging.
794 assert(thread->deopt_mark() == NULL, "no stack overflow from deopt blob/uncommon trap");
795 Events::log_exception(thread, "StackOverflowError at " INTPTR_FORMAT, pc);
796 return StubRoutines::throw_StackOverflowError_entry();
797 }
799 case IMPLICIT_NULL: {
800 if (VtableStubs::contains(pc)) {
801 // We haven't yet entered the callee frame. Fabricate an
802 // exception and begin dispatching it in the caller. Since
803 // the caller was at a call site, it's safe to destroy all
804 // caller-saved registers, as these entry points do.
805 VtableStub* vt_stub = VtableStubs::stub_containing(pc);
807 // If vt_stub is NULL, then return NULL to signal handler to report the SEGV error.
808 if (vt_stub == NULL) return NULL;
810 if (vt_stub->is_abstract_method_error(pc)) {
811 assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs");
812 Events::log_exception(thread, "AbstractMethodError at " INTPTR_FORMAT, pc);
813 return StubRoutines::throw_AbstractMethodError_entry();
814 } else {
815 Events::log_exception(thread, "NullPointerException at vtable entry " INTPTR_FORMAT, pc);
816 return StubRoutines::throw_NullPointerException_at_call_entry();
817 }
818 } else {
819 CodeBlob* cb = CodeCache::find_blob(pc);
821 // If code blob is NULL, then return NULL to signal handler to report the SEGV error.
822 if (cb == NULL) return NULL;
824 // Exception happened in CodeCache. Must be either:
825 // 1. Inline-cache check in C2I handler blob,
826 // 2. Inline-cache check in nmethod, or
827 // 3. Implict null exception in nmethod
829 if (!cb->is_nmethod()) {
830 bool is_in_blob = cb->is_adapter_blob() || cb->is_method_handles_adapter_blob();
831 if (!is_in_blob) {
832 cb->print();
833 fatal(err_msg("exception happened outside interpreter, nmethods and vtable stubs at pc " INTPTR_FORMAT, pc));
834 }
835 Events::log_exception(thread, "NullPointerException in code blob at " INTPTR_FORMAT, pc);
836 // There is no handler here, so we will simply unwind.
837 return StubRoutines::throw_NullPointerException_at_call_entry();
838 }
840 // Otherwise, it's an nmethod. Consult its exception handlers.
841 nmethod* nm = (nmethod*)cb;
842 if (nm->inlinecache_check_contains(pc)) {
843 // exception happened inside inline-cache check code
844 // => the nmethod is not yet active (i.e., the frame
845 // is not set up yet) => use return address pushed by
846 // caller => don't push another return address
847 Events::log_exception(thread, "NullPointerException in IC check " INTPTR_FORMAT, pc);
848 return StubRoutines::throw_NullPointerException_at_call_entry();
849 }
851 if (nm->method()->is_method_handle_intrinsic()) {
852 // exception happened inside MH dispatch code, similar to a vtable stub
853 Events::log_exception(thread, "NullPointerException in MH adapter " INTPTR_FORMAT, pc);
854 return StubRoutines::throw_NullPointerException_at_call_entry();
855 }
857 #ifndef PRODUCT
858 _implicit_null_throws++;
859 #endif
860 target_pc = nm->continuation_for_implicit_exception(pc);
861 // If there's an unexpected fault, target_pc might be NULL,
862 // in which case we want to fall through into the normal
863 // error handling code.
864 }
866 break; // fall through
867 }
870 case IMPLICIT_DIVIDE_BY_ZERO: {
871 nmethod* nm = CodeCache::find_nmethod(pc);
872 guarantee(nm != NULL, "must have containing nmethod for implicit division-by-zero exceptions");
873 #ifndef PRODUCT
874 _implicit_div0_throws++;
875 #endif
876 target_pc = nm->continuation_for_implicit_exception(pc);
877 // If there's an unexpected fault, target_pc might be NULL,
878 // in which case we want to fall through into the normal
879 // error handling code.
880 break; // fall through
881 }
883 default: ShouldNotReachHere();
884 }
886 assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind");
888 // for AbortVMOnException flag
889 NOT_PRODUCT(Exceptions::debug_check_abort("java.lang.NullPointerException"));
890 if (exception_kind == IMPLICIT_NULL) {
891 Events::log_exception(thread, "Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
892 } else {
893 Events::log_exception(thread, "Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
894 }
895 return target_pc;
896 }
898 ShouldNotReachHere();
899 return NULL;
900 }
903 /**
904 * Throws an java/lang/UnsatisfiedLinkError. The address of this method is
905 * installed in the native function entry of all native Java methods before
906 * they get linked to their actual native methods.
907 *
908 * \note
909 * This method actually never gets called! The reason is because
910 * the interpreter's native entries call NativeLookup::lookup() which
911 * throws the exception when the lookup fails. The exception is then
912 * caught and forwarded on the return from NativeLookup::lookup() call
913 * before the call to the native function. This might change in the future.
914 */
915 JNI_ENTRY(void*, throw_unsatisfied_link_error(JNIEnv* env, ...))
916 {
917 // We return a bad value here to make sure that the exception is
918 // forwarded before we look at the return value.
919 THROW_(vmSymbols::java_lang_UnsatisfiedLinkError(), (void*)badJNIHandle);
920 }
921 JNI_END
923 address SharedRuntime::native_method_throw_unsatisfied_link_error_entry() {
924 return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error);
925 }
928 #ifndef PRODUCT
929 JRT_ENTRY(intptr_t, SharedRuntime::trace_bytecode(JavaThread* thread, intptr_t preserve_this_value, intptr_t tos, intptr_t tos2))
930 const frame f = thread->last_frame();
931 assert(f.is_interpreted_frame(), "must be an interpreted frame");
932 #ifndef PRODUCT
933 methodHandle mh(THREAD, f.interpreter_frame_method());
934 BytecodeTracer::trace(mh, f.interpreter_frame_bcp(), tos, tos2);
935 #endif // !PRODUCT
936 return preserve_this_value;
937 JRT_END
938 #endif // !PRODUCT
941 JRT_ENTRY(void, SharedRuntime::yield_all(JavaThread* thread, int attempts))
942 os::yield_all(attempts);
943 JRT_END
946 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* thread, oopDesc* obj))
947 assert(obj->is_oop(), "must be a valid oop");
948 assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
949 InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
950 JRT_END
953 jlong SharedRuntime::get_java_tid(Thread* thread) {
954 if (thread != NULL) {
955 if (thread->is_Java_thread()) {
956 oop obj = ((JavaThread*)thread)->threadObj();
957 return (obj == NULL) ? 0 : java_lang_Thread::thread_id(obj);
958 }
959 }
960 return 0;
961 }
963 /**
964 * This function ought to be a void function, but cannot be because
965 * it gets turned into a tail-call on sparc, which runs into dtrace bug
966 * 6254741. Once that is fixed we can remove the dummy return value.
967 */
968 int SharedRuntime::dtrace_object_alloc(oopDesc* o, int size) {
969 return dtrace_object_alloc_base(Thread::current(), o, size);
970 }
972 int SharedRuntime::dtrace_object_alloc_base(Thread* thread, oopDesc* o, int size) {
973 assert(DTraceAllocProbes, "wrong call");
974 Klass* klass = o->klass();
975 Symbol* name = klass->name();
976 #ifndef USDT2
977 HS_DTRACE_PROBE4(hotspot, object__alloc, get_java_tid(thread),
978 name->bytes(), name->utf8_length(), size * HeapWordSize);
979 #else /* USDT2 */
980 HOTSPOT_OBJECT_ALLOC(
981 get_java_tid(thread),
982 (char *) name->bytes(), name->utf8_length(), size * HeapWordSize);
983 #endif /* USDT2 */
984 return 0;
985 }
987 JRT_LEAF(int, SharedRuntime::dtrace_method_entry(
988 JavaThread* thread, Method* method))
989 assert(DTraceMethodProbes, "wrong call");
990 Symbol* kname = method->klass_name();
991 Symbol* name = method->name();
992 Symbol* sig = method->signature();
993 #ifndef USDT2
994 HS_DTRACE_PROBE7(hotspot, method__entry, get_java_tid(thread),
995 kname->bytes(), kname->utf8_length(),
996 name->bytes(), name->utf8_length(),
997 sig->bytes(), sig->utf8_length());
998 #else /* USDT2 */
999 HOTSPOT_METHOD_ENTRY(
1000 get_java_tid(thread),
1001 (char *) kname->bytes(), kname->utf8_length(),
1002 (char *) name->bytes(), name->utf8_length(),
1003 (char *) sig->bytes(), sig->utf8_length());
1004 #endif /* USDT2 */
1005 return 0;
1006 JRT_END
1008 JRT_LEAF(int, SharedRuntime::dtrace_method_exit(
1009 JavaThread* thread, Method* method))
1010 assert(DTraceMethodProbes, "wrong call");
1011 Symbol* kname = method->klass_name();
1012 Symbol* name = method->name();
1013 Symbol* sig = method->signature();
1014 #ifndef USDT2
1015 HS_DTRACE_PROBE7(hotspot, method__return, get_java_tid(thread),
1016 kname->bytes(), kname->utf8_length(),
1017 name->bytes(), name->utf8_length(),
1018 sig->bytes(), sig->utf8_length());
1019 #else /* USDT2 */
1020 HOTSPOT_METHOD_RETURN(
1021 get_java_tid(thread),
1022 (char *) kname->bytes(), kname->utf8_length(),
1023 (char *) name->bytes(), name->utf8_length(),
1024 (char *) sig->bytes(), sig->utf8_length());
1025 #endif /* USDT2 */
1026 return 0;
1027 JRT_END
1030 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode)
1031 // for a call current in progress, i.e., arguments has been pushed on stack
1032 // put callee has not been invoked yet. Used by: resolve virtual/static,
1033 // vtable updates, etc. Caller frame must be compiled.
1034 Handle SharedRuntime::find_callee_info(JavaThread* thread, Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) {
1035 ResourceMark rm(THREAD);
1037 // last java frame on stack (which includes native call frames)
1038 vframeStream vfst(thread, true); // Do not skip and javaCalls
1040 return find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(Handle()));
1041 }
1044 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode
1045 // for a call current in progress, i.e., arguments has been pushed on stack
1046 // but callee has not been invoked yet. Caller frame must be compiled.
1047 Handle SharedRuntime::find_callee_info_helper(JavaThread* thread,
1048 vframeStream& vfst,
1049 Bytecodes::Code& bc,
1050 CallInfo& callinfo, TRAPS) {
1051 Handle receiver;
1052 Handle nullHandle; //create a handy null handle for exception returns
1054 assert(!vfst.at_end(), "Java frame must exist");
1056 // Find caller and bci from vframe
1057 methodHandle caller(THREAD, vfst.method());
1058 int bci = vfst.bci();
1060 // Find bytecode
1061 Bytecode_invoke bytecode(caller, bci);
1062 bc = bytecode.invoke_code();
1063 int bytecode_index = bytecode.index();
1065 // Find receiver for non-static call
1066 if (bc != Bytecodes::_invokestatic &&
1067 bc != Bytecodes::_invokedynamic &&
1068 bc != Bytecodes::_invokehandle) {
1069 // This register map must be update since we need to find the receiver for
1070 // compiled frames. The receiver might be in a register.
1071 RegisterMap reg_map2(thread);
1072 frame stubFrame = thread->last_frame();
1073 // Caller-frame is a compiled frame
1074 frame callerFrame = stubFrame.sender(®_map2);
1076 methodHandle callee = bytecode.static_target(CHECK_(nullHandle));
1077 if (callee.is_null()) {
1078 THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle);
1079 }
1080 // Retrieve from a compiled argument list
1081 receiver = Handle(THREAD, callerFrame.retrieve_receiver(®_map2));
1083 if (receiver.is_null()) {
1084 THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle);
1085 }
1086 }
1088 // Resolve method. This is parameterized by bytecode.
1089 constantPoolHandle constants(THREAD, caller->constants());
1090 assert(receiver.is_null() || receiver->is_oop(), "wrong receiver");
1091 LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_(nullHandle));
1093 #ifdef ASSERT
1094 // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls
1095 if (bc != Bytecodes::_invokestatic && bc != Bytecodes::_invokedynamic && bc != Bytecodes::_invokehandle) {
1096 assert(receiver.not_null(), "should have thrown exception");
1097 KlassHandle receiver_klass(THREAD, receiver->klass());
1098 Klass* rk = constants->klass_ref_at(bytecode_index, CHECK_(nullHandle));
1099 // klass is already loaded
1100 KlassHandle static_receiver_klass(THREAD, rk);
1101 // Method handle invokes might have been optimized to a direct call
1102 // so don't check for the receiver class.
1103 // FIXME this weakens the assert too much
1104 methodHandle callee = callinfo.selected_method();
1105 assert(receiver_klass->is_subtype_of(static_receiver_klass()) ||
1106 callee->is_method_handle_intrinsic() ||
1107 callee->is_compiled_lambda_form(),
1108 "actual receiver must be subclass of static receiver klass");
1109 if (receiver_klass->oop_is_instance()) {
1110 if (InstanceKlass::cast(receiver_klass())->is_not_initialized()) {
1111 tty->print_cr("ERROR: Klass not yet initialized!!");
1112 receiver_klass()->print();
1113 }
1114 assert(!InstanceKlass::cast(receiver_klass())->is_not_initialized(), "receiver_klass must be initialized");
1115 }
1116 }
1117 #endif
1119 return receiver;
1120 }
1122 methodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) {
1123 ResourceMark rm(THREAD);
1124 // We need first to check if any Java activations (compiled, interpreted)
1125 // exist on the stack since last JavaCall. If not, we need
1126 // to get the target method from the JavaCall wrapper.
1127 vframeStream vfst(thread, true); // Do not skip any javaCalls
1128 methodHandle callee_method;
1129 if (vfst.at_end()) {
1130 // No Java frames were found on stack since we did the JavaCall.
1131 // Hence the stack can only contain an entry_frame. We need to
1132 // find the target method from the stub frame.
1133 RegisterMap reg_map(thread, false);
1134 frame fr = thread->last_frame();
1135 assert(fr.is_runtime_frame(), "must be a runtimeStub");
1136 fr = fr.sender(®_map);
1137 assert(fr.is_entry_frame(), "must be");
1138 // fr is now pointing to the entry frame.
1139 callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method());
1140 assert(fr.entry_frame_call_wrapper()->receiver() == NULL || !callee_method->is_static(), "non-null receiver for static call??");
1141 } else {
1142 Bytecodes::Code bc;
1143 CallInfo callinfo;
1144 find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle()));
1145 callee_method = callinfo.selected_method();
1146 }
1147 assert(callee_method()->is_method(), "must be");
1148 return callee_method;
1149 }
1151 // Resolves a call.
1152 methodHandle SharedRuntime::resolve_helper(JavaThread *thread,
1153 bool is_virtual,
1154 bool is_optimized, TRAPS) {
1155 methodHandle callee_method;
1156 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1157 if (JvmtiExport::can_hotswap_or_post_breakpoint()) {
1158 int retry_count = 0;
1159 while (!HAS_PENDING_EXCEPTION && callee_method->is_old() &&
1160 callee_method->method_holder() != SystemDictionary::Object_klass()) {
1161 // If has a pending exception then there is no need to re-try to
1162 // resolve this method.
1163 // If the method has been redefined, we need to try again.
1164 // Hack: we have no way to update the vtables of arrays, so don't
1165 // require that java.lang.Object has been updated.
1167 // It is very unlikely that method is redefined more than 100 times
1168 // in the middle of resolve. If it is looping here more than 100 times
1169 // means then there could be a bug here.
1170 guarantee((retry_count++ < 100),
1171 "Could not resolve to latest version of redefined method");
1172 // method is redefined in the middle of resolve so re-try.
1173 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1174 }
1175 }
1176 return callee_method;
1177 }
1179 // Resolves a call. The compilers generate code for calls that go here
1180 // and are patched with the real destination of the call.
1181 methodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread,
1182 bool is_virtual,
1183 bool is_optimized, TRAPS) {
1185 ResourceMark rm(thread);
1186 RegisterMap cbl_map(thread, false);
1187 frame caller_frame = thread->last_frame().sender(&cbl_map);
1189 CodeBlob* caller_cb = caller_frame.cb();
1190 guarantee(caller_cb != NULL && caller_cb->is_nmethod(), "must be called from nmethod");
1191 nmethod* caller_nm = caller_cb->as_nmethod_or_null();
1193 // make sure caller is not getting deoptimized
1194 // and removed before we are done with it.
1195 // CLEANUP - with lazy deopt shouldn't need this lock
1196 nmethodLocker caller_lock(caller_nm);
1198 // determine call info & receiver
1199 // note: a) receiver is NULL for static calls
1200 // b) an exception is thrown if receiver is NULL for non-static calls
1201 CallInfo call_info;
1202 Bytecodes::Code invoke_code = Bytecodes::_illegal;
1203 Handle receiver = find_callee_info(thread, invoke_code,
1204 call_info, CHECK_(methodHandle()));
1205 methodHandle callee_method = call_info.selected_method();
1207 assert((!is_virtual && invoke_code == Bytecodes::_invokestatic ) ||
1208 (!is_virtual && invoke_code == Bytecodes::_invokehandle ) ||
1209 (!is_virtual && invoke_code == Bytecodes::_invokedynamic) ||
1210 ( is_virtual && invoke_code != Bytecodes::_invokestatic ), "inconsistent bytecode");
1212 // We do not patch the call site if the caller nmethod has been made non-entrant.
1213 if (!caller_nm->is_in_use()) {
1214 return callee_method;
1215 }
1217 #ifndef PRODUCT
1218 // tracing/debugging/statistics
1219 int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
1220 (is_virtual) ? (&_resolve_virtual_ctr) :
1221 (&_resolve_static_ctr);
1222 Atomic::inc(addr);
1224 if (TraceCallFixup) {
1225 ResourceMark rm(thread);
1226 tty->print("resolving %s%s (%s) call to",
1227 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
1228 Bytecodes::name(invoke_code));
1229 callee_method->print_short_name(tty);
1230 tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT, caller_frame.pc(), callee_method->code());
1231 }
1232 #endif
1234 // JSR 292 key invariant:
1235 // If the resolved method is a MethodHandle invoke target the call
1236 // site must be a MethodHandle call site, because the lambda form might tail-call
1237 // leaving the stack in a state unknown to either caller or callee
1238 // TODO detune for now but we might need it again
1239 // assert(!callee_method->is_compiled_lambda_form() ||
1240 // caller_nm->is_method_handle_return(caller_frame.pc()), "must be MH call site");
1242 // Compute entry points. This might require generation of C2I converter
1243 // frames, so we cannot be holding any locks here. Furthermore, the
1244 // computation of the entry points is independent of patching the call. We
1245 // always return the entry-point, but we only patch the stub if the call has
1246 // not been deoptimized. Return values: For a virtual call this is an
1247 // (cached_oop, destination address) pair. For a static call/optimized
1248 // virtual this is just a destination address.
1250 StaticCallInfo static_call_info;
1251 CompiledICInfo virtual_call_info;
1253 // Make sure the callee nmethod does not get deoptimized and removed before
1254 // we are done patching the code.
1255 nmethod* callee_nm = callee_method->code();
1256 if (callee_nm != NULL && !callee_nm->is_in_use()) {
1257 // Patch call site to C2I adapter if callee nmethod is deoptimized or unloaded.
1258 callee_nm = NULL;
1259 }
1260 nmethodLocker nl_callee(callee_nm);
1261 #ifdef ASSERT
1262 address dest_entry_point = callee_nm == NULL ? 0 : callee_nm->entry_point(); // used below
1263 #endif
1265 if (is_virtual) {
1266 assert(receiver.not_null() || invoke_code == Bytecodes::_invokehandle, "sanity check");
1267 bool static_bound = call_info.resolved_method()->can_be_statically_bound();
1268 KlassHandle h_klass(THREAD, invoke_code == Bytecodes::_invokehandle ? NULL : receiver->klass());
1269 CompiledIC::compute_monomorphic_entry(callee_method, h_klass,
1270 is_optimized, static_bound, virtual_call_info,
1271 CHECK_(methodHandle()));
1272 } else {
1273 // static call
1274 CompiledStaticCall::compute_entry(callee_method, static_call_info);
1275 }
1277 // grab lock, check for deoptimization and potentially patch caller
1278 {
1279 MutexLocker ml_patch(CompiledIC_lock);
1281 // Lock blocks for safepoint during which both nmethods can change state.
1283 // Now that we are ready to patch if the Method* was redefined then
1284 // don't update call site and let the caller retry.
1285 // Don't update call site if caller nmethod has been made non-entrant
1286 // as it is a waste of time.
1287 // Don't update call site if callee nmethod was unloaded or deoptimized.
1288 // Don't update call site if callee nmethod was replaced by an other nmethod
1289 // which may happen when multiply alive nmethod (tiered compilation)
1290 // will be supported.
1291 if (!callee_method->is_old() && caller_nm->is_in_use() &&
1292 (callee_nm == NULL || callee_nm->is_in_use() && (callee_method->code() == callee_nm))) {
1293 #ifdef ASSERT
1294 // We must not try to patch to jump to an already unloaded method.
1295 if (dest_entry_point != 0) {
1296 CodeBlob* cb = CodeCache::find_blob(dest_entry_point);
1297 assert((cb != NULL) && cb->is_nmethod() && (((nmethod*)cb) == callee_nm),
1298 "should not call unloaded nmethod");
1299 }
1300 #endif
1301 if (is_virtual) {
1302 nmethod* nm = callee_nm;
1303 if (nm == NULL) CodeCache::find_blob(caller_frame.pc());
1304 CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc());
1305 if (inline_cache->is_clean()) {
1306 inline_cache->set_to_monomorphic(virtual_call_info);
1307 }
1308 } else {
1309 CompiledStaticCall* ssc = compiledStaticCall_before(caller_frame.pc());
1310 if (ssc->is_clean()) ssc->set(static_call_info);
1311 }
1312 }
1314 } // unlock CompiledIC_lock
1316 return callee_method;
1317 }
1320 // Inline caches exist only in compiled code
1321 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread))
1322 #ifdef ASSERT
1323 RegisterMap reg_map(thread, false);
1324 frame stub_frame = thread->last_frame();
1325 assert(stub_frame.is_runtime_frame(), "sanity check");
1326 frame caller_frame = stub_frame.sender(®_map);
1327 assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame");
1328 #endif /* ASSERT */
1330 methodHandle callee_method;
1331 JRT_BLOCK
1332 callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL);
1333 // Return Method* through TLS
1334 thread->set_vm_result_2(callee_method());
1335 JRT_BLOCK_END
1336 // return compiled code entry point after potential safepoints
1337 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1338 return callee_method->verified_code_entry();
1339 JRT_END
1342 // Handle call site that has been made non-entrant
1343 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread))
1344 // 6243940 We might end up in here if the callee is deoptimized
1345 // as we race to call it. We don't want to take a safepoint if
1346 // the caller was interpreted because the caller frame will look
1347 // interpreted to the stack walkers and arguments are now
1348 // "compiled" so it is much better to make this transition
1349 // invisible to the stack walking code. The i2c path will
1350 // place the callee method in the callee_target. It is stashed
1351 // there because if we try and find the callee by normal means a
1352 // safepoint is possible and have trouble gc'ing the compiled args.
1353 RegisterMap reg_map(thread, false);
1354 frame stub_frame = thread->last_frame();
1355 assert(stub_frame.is_runtime_frame(), "sanity check");
1356 frame caller_frame = stub_frame.sender(®_map);
1358 if (caller_frame.is_interpreted_frame() ||
1359 caller_frame.is_entry_frame()) {
1360 Method* callee = thread->callee_target();
1361 guarantee(callee != NULL && callee->is_method(), "bad handshake");
1362 thread->set_vm_result_2(callee);
1363 thread->set_callee_target(NULL);
1364 return callee->get_c2i_entry();
1365 }
1367 // Must be compiled to compiled path which is safe to stackwalk
1368 methodHandle callee_method;
1369 JRT_BLOCK
1370 // Force resolving of caller (if we called from compiled frame)
1371 callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL);
1372 thread->set_vm_result_2(callee_method());
1373 JRT_BLOCK_END
1374 // return compiled code entry point after potential safepoints
1375 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1376 return callee_method->verified_code_entry();
1377 JRT_END
1379 // Handle abstract method call
1380 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_abstract(JavaThread* thread))
1381 return StubRoutines::throw_AbstractMethodError_entry();
1382 JRT_END
1385 // resolve a static call and patch code
1386 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread ))
1387 methodHandle callee_method;
1388 JRT_BLOCK
1389 callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL);
1390 thread->set_vm_result_2(callee_method());
1391 JRT_BLOCK_END
1392 // return compiled code entry point after potential safepoints
1393 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1394 return callee_method->verified_code_entry();
1395 JRT_END
1398 // resolve virtual call and update inline cache to monomorphic
1399 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread ))
1400 methodHandle callee_method;
1401 JRT_BLOCK
1402 callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL);
1403 thread->set_vm_result_2(callee_method());
1404 JRT_BLOCK_END
1405 // return compiled code entry point after potential safepoints
1406 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1407 return callee_method->verified_code_entry();
1408 JRT_END
1411 // Resolve a virtual call that can be statically bound (e.g., always
1412 // monomorphic, so it has no inline cache). Patch code to resolved target.
1413 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread))
1414 methodHandle callee_method;
1415 JRT_BLOCK
1416 callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL);
1417 thread->set_vm_result_2(callee_method());
1418 JRT_BLOCK_END
1419 // return compiled code entry point after potential safepoints
1420 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1421 return callee_method->verified_code_entry();
1422 JRT_END
1428 methodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) {
1429 ResourceMark rm(thread);
1430 CallInfo call_info;
1431 Bytecodes::Code bc;
1433 // receiver is NULL for static calls. An exception is thrown for NULL
1434 // receivers for non-static calls
1435 Handle receiver = find_callee_info(thread, bc, call_info,
1436 CHECK_(methodHandle()));
1437 // Compiler1 can produce virtual call sites that can actually be statically bound
1438 // If we fell thru to below we would think that the site was going megamorphic
1439 // when in fact the site can never miss. Worse because we'd think it was megamorphic
1440 // we'd try and do a vtable dispatch however methods that can be statically bound
1441 // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a
1442 // reresolution of the call site (as if we did a handle_wrong_method and not an
1443 // plain ic_miss) and the site will be converted to an optimized virtual call site
1444 // never to miss again. I don't believe C2 will produce code like this but if it
1445 // did this would still be the correct thing to do for it too, hence no ifdef.
1446 //
1447 if (call_info.resolved_method()->can_be_statically_bound()) {
1448 methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle()));
1449 if (TraceCallFixup) {
1450 RegisterMap reg_map(thread, false);
1451 frame caller_frame = thread->last_frame().sender(®_map);
1452 ResourceMark rm(thread);
1453 tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc));
1454 callee_method->print_short_name(tty);
1455 tty->print_cr(" from pc: " INTPTR_FORMAT, caller_frame.pc());
1456 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1457 }
1458 return callee_method;
1459 }
1461 methodHandle callee_method = call_info.selected_method();
1463 bool should_be_mono = false;
1465 #ifndef PRODUCT
1466 Atomic::inc(&_ic_miss_ctr);
1468 // Statistics & Tracing
1469 if (TraceCallFixup) {
1470 ResourceMark rm(thread);
1471 tty->print("IC miss (%s) call to", Bytecodes::name(bc));
1472 callee_method->print_short_name(tty);
1473 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1474 }
1476 if (ICMissHistogram) {
1477 MutexLocker m(VMStatistic_lock);
1478 RegisterMap reg_map(thread, false);
1479 frame f = thread->last_frame().real_sender(®_map);// skip runtime stub
1480 // produce statistics under the lock
1481 trace_ic_miss(f.pc());
1482 }
1483 #endif
1485 // install an event collector so that when a vtable stub is created the
1486 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The
1487 // event can't be posted when the stub is created as locks are held
1488 // - instead the event will be deferred until the event collector goes
1489 // out of scope.
1490 JvmtiDynamicCodeEventCollector event_collector;
1492 // Update inline cache to megamorphic. Skip update if caller has been
1493 // made non-entrant or we are called from interpreted.
1494 { MutexLocker ml_patch (CompiledIC_lock);
1495 RegisterMap reg_map(thread, false);
1496 frame caller_frame = thread->last_frame().sender(®_map);
1497 CodeBlob* cb = caller_frame.cb();
1498 if (cb->is_nmethod() && ((nmethod*)cb)->is_in_use()) {
1499 // Not a non-entrant nmethod, so find inline_cache
1500 CompiledIC* inline_cache = CompiledIC_before(((nmethod*)cb), caller_frame.pc());
1501 bool should_be_mono = false;
1502 if (inline_cache->is_optimized()) {
1503 if (TraceCallFixup) {
1504 ResourceMark rm(thread);
1505 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc));
1506 callee_method->print_short_name(tty);
1507 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1508 }
1509 should_be_mono = true;
1510 } else if (inline_cache->is_icholder_call()) {
1511 CompiledICHolder* ic_oop = inline_cache->cached_icholder();
1512 if ( ic_oop != NULL) {
1514 if (receiver()->klass() == ic_oop->holder_klass()) {
1515 // This isn't a real miss. We must have seen that compiled code
1516 // is now available and we want the call site converted to a
1517 // monomorphic compiled call site.
1518 // We can't assert for callee_method->code() != NULL because it
1519 // could have been deoptimized in the meantime
1520 if (TraceCallFixup) {
1521 ResourceMark rm(thread);
1522 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc));
1523 callee_method->print_short_name(tty);
1524 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1525 }
1526 should_be_mono = true;
1527 }
1528 }
1529 }
1531 if (should_be_mono) {
1533 // We have a path that was monomorphic but was going interpreted
1534 // and now we have (or had) a compiled entry. We correct the IC
1535 // by using a new icBuffer.
1536 CompiledICInfo info;
1537 KlassHandle receiver_klass(THREAD, receiver()->klass());
1538 inline_cache->compute_monomorphic_entry(callee_method,
1539 receiver_klass,
1540 inline_cache->is_optimized(),
1541 false,
1542 info, CHECK_(methodHandle()));
1543 inline_cache->set_to_monomorphic(info);
1544 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) {
1545 // Potential change to megamorphic
1546 bool successful = inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle()));
1547 if (!successful) {
1548 inline_cache->set_to_clean();
1549 }
1550 } else {
1551 // Either clean or megamorphic
1552 }
1553 }
1554 } // Release CompiledIC_lock
1556 return callee_method;
1557 }
1559 //
1560 // Resets a call-site in compiled code so it will get resolved again.
1561 // This routines handles both virtual call sites, optimized virtual call
1562 // sites, and static call sites. Typically used to change a call sites
1563 // destination from compiled to interpreted.
1564 //
1565 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) {
1566 ResourceMark rm(thread);
1567 RegisterMap reg_map(thread, false);
1568 frame stub_frame = thread->last_frame();
1569 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1570 frame caller = stub_frame.sender(®_map);
1572 // Do nothing if the frame isn't a live compiled frame.
1573 // nmethod could be deoptimized by the time we get here
1574 // so no update to the caller is needed.
1576 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) {
1578 address pc = caller.pc();
1580 // Default call_addr is the location of the "basic" call.
1581 // Determine the address of the call we a reresolving. With
1582 // Inline Caches we will always find a recognizable call.
1583 // With Inline Caches disabled we may or may not find a
1584 // recognizable call. We will always find a call for static
1585 // calls and for optimized virtual calls. For vanilla virtual
1586 // calls it depends on the state of the UseInlineCaches switch.
1587 //
1588 // With Inline Caches disabled we can get here for a virtual call
1589 // for two reasons:
1590 // 1 - calling an abstract method. The vtable for abstract methods
1591 // will run us thru handle_wrong_method and we will eventually
1592 // end up in the interpreter to throw the ame.
1593 // 2 - a racing deoptimization. We could be doing a vanilla vtable
1594 // call and between the time we fetch the entry address and
1595 // we jump to it the target gets deoptimized. Similar to 1
1596 // we will wind up in the interprter (thru a c2i with c2).
1597 //
1598 address call_addr = NULL;
1599 {
1600 // Get call instruction under lock because another thread may be
1601 // busy patching it.
1602 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1603 // Location of call instruction
1604 if (NativeCall::is_call_before(pc)) {
1605 NativeCall *ncall = nativeCall_before(pc);
1606 call_addr = ncall->instruction_address();
1607 }
1608 }
1610 // Check for static or virtual call
1611 bool is_static_call = false;
1612 nmethod* caller_nm = CodeCache::find_nmethod(pc);
1613 // Make sure nmethod doesn't get deoptimized and removed until
1614 // this is done with it.
1615 // CLEANUP - with lazy deopt shouldn't need this lock
1616 nmethodLocker nmlock(caller_nm);
1618 if (call_addr != NULL) {
1619 RelocIterator iter(caller_nm, call_addr, call_addr+1);
1620 int ret = iter.next(); // Get item
1621 if (ret) {
1622 assert(iter.addr() == call_addr, "must find call");
1623 if (iter.type() == relocInfo::static_call_type) {
1624 is_static_call = true;
1625 } else {
1626 assert(iter.type() == relocInfo::virtual_call_type ||
1627 iter.type() == relocInfo::opt_virtual_call_type
1628 , "unexpected relocInfo. type");
1629 }
1630 } else {
1631 assert(!UseInlineCaches, "relocation info. must exist for this address");
1632 }
1634 // Cleaning the inline cache will force a new resolve. This is more robust
1635 // than directly setting it to the new destination, since resolving of calls
1636 // is always done through the same code path. (experience shows that it
1637 // leads to very hard to track down bugs, if an inline cache gets updated
1638 // to a wrong method). It should not be performance critical, since the
1639 // resolve is only done once.
1641 MutexLocker ml(CompiledIC_lock);
1642 //
1643 // We do not patch the call site if the nmethod has been made non-entrant
1644 // as it is a waste of time
1645 //
1646 if (caller_nm->is_in_use()) {
1647 if (is_static_call) {
1648 CompiledStaticCall* ssc= compiledStaticCall_at(call_addr);
1649 ssc->set_to_clean();
1650 } else {
1651 // compiled, dispatched call (which used to call an interpreted method)
1652 CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr);
1653 inline_cache->set_to_clean();
1654 }
1655 }
1656 }
1658 }
1660 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle()));
1663 #ifndef PRODUCT
1664 Atomic::inc(&_wrong_method_ctr);
1666 if (TraceCallFixup) {
1667 ResourceMark rm(thread);
1668 tty->print("handle_wrong_method reresolving call to");
1669 callee_method->print_short_name(tty);
1670 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1671 }
1672 #endif
1674 return callee_method;
1675 }
1677 #ifdef ASSERT
1678 void SharedRuntime::check_member_name_argument_is_last_argument(methodHandle method,
1679 const BasicType* sig_bt,
1680 const VMRegPair* regs) {
1681 ResourceMark rm;
1682 const int total_args_passed = method->size_of_parameters();
1683 const VMRegPair* regs_with_member_name = regs;
1684 VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1);
1686 const int member_arg_pos = total_args_passed - 1;
1687 assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob");
1688 assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object");
1690 const bool is_outgoing = method->is_method_handle_intrinsic();
1691 int comp_args_on_stack = java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1, is_outgoing);
1693 for (int i = 0; i < member_arg_pos; i++) {
1694 VMReg a = regs_with_member_name[i].first();
1695 VMReg b = regs_without_member_name[i].first();
1696 assert(a->value() == b->value(), err_msg_res("register allocation mismatch: a=%d, b=%d", a->value(), b->value()));
1697 }
1698 assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg");
1699 }
1700 #endif
1702 // ---------------------------------------------------------------------------
1703 // We are calling the interpreter via a c2i. Normally this would mean that
1704 // we were called by a compiled method. However we could have lost a race
1705 // where we went int -> i2c -> c2i and so the caller could in fact be
1706 // interpreted. If the caller is compiled we attempt to patch the caller
1707 // so he no longer calls into the interpreter.
1708 IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc))
1709 Method* moop(method);
1711 address entry_point = moop->from_compiled_entry();
1713 // It's possible that deoptimization can occur at a call site which hasn't
1714 // been resolved yet, in which case this function will be called from
1715 // an nmethod that has been patched for deopt and we can ignore the
1716 // request for a fixup.
1717 // Also it is possible that we lost a race in that from_compiled_entry
1718 // is now back to the i2c in that case we don't need to patch and if
1719 // we did we'd leap into space because the callsite needs to use
1720 // "to interpreter" stub in order to load up the Method*. Don't
1721 // ask me how I know this...
1723 CodeBlob* cb = CodeCache::find_blob(caller_pc);
1724 if (!cb->is_nmethod() || entry_point == moop->get_c2i_entry()) {
1725 return;
1726 }
1728 // The check above makes sure this is a nmethod.
1729 nmethod* nm = cb->as_nmethod_or_null();
1730 assert(nm, "must be");
1732 // Get the return PC for the passed caller PC.
1733 address return_pc = caller_pc + frame::pc_return_offset;
1735 // There is a benign race here. We could be attempting to patch to a compiled
1736 // entry point at the same time the callee is being deoptimized. If that is
1737 // the case then entry_point may in fact point to a c2i and we'd patch the
1738 // call site with the same old data. clear_code will set code() to NULL
1739 // at the end of it. If we happen to see that NULL then we can skip trying
1740 // to patch. If we hit the window where the callee has a c2i in the
1741 // from_compiled_entry and the NULL isn't present yet then we lose the race
1742 // and patch the code with the same old data. Asi es la vida.
1744 if (moop->code() == NULL) return;
1746 if (nm->is_in_use()) {
1748 // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1749 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1750 if (NativeCall::is_call_before(return_pc)) {
1751 NativeCall *call = nativeCall_before(return_pc);
1752 //
1753 // bug 6281185. We might get here after resolving a call site to a vanilla
1754 // virtual call. Because the resolvee uses the verified entry it may then
1755 // see compiled code and attempt to patch the site by calling us. This would
1756 // then incorrectly convert the call site to optimized and its downhill from
1757 // there. If you're lucky you'll get the assert in the bugid, if not you've
1758 // just made a call site that could be megamorphic into a monomorphic site
1759 // for the rest of its life! Just another racing bug in the life of
1760 // fixup_callers_callsite ...
1761 //
1762 RelocIterator iter(nm, call->instruction_address(), call->next_instruction_address());
1763 iter.next();
1764 assert(iter.has_current(), "must have a reloc at java call site");
1765 relocInfo::relocType typ = iter.reloc()->type();
1766 if ( typ != relocInfo::static_call_type &&
1767 typ != relocInfo::opt_virtual_call_type &&
1768 typ != relocInfo::static_stub_type) {
1769 return;
1770 }
1771 address destination = call->destination();
1772 if (destination != entry_point) {
1773 CodeBlob* callee = CodeCache::find_blob(destination);
1774 // callee == cb seems weird. It means calling interpreter thru stub.
1775 if (callee == cb || callee->is_adapter_blob()) {
1776 // static call or optimized virtual
1777 if (TraceCallFixup) {
1778 tty->print("fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1779 moop->print_short_name(tty);
1780 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1781 }
1782 call->set_destination_mt_safe(entry_point);
1783 } else {
1784 if (TraceCallFixup) {
1785 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1786 moop->print_short_name(tty);
1787 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1788 }
1789 // assert is too strong could also be resolve destinations.
1790 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be");
1791 }
1792 } else {
1793 if (TraceCallFixup) {
1794 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1795 moop->print_short_name(tty);
1796 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1797 }
1798 }
1799 }
1800 }
1801 IRT_END
1804 // same as JVM_Arraycopy, but called directly from compiled code
1805 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos,
1806 oopDesc* dest, jint dest_pos,
1807 jint length,
1808 JavaThread* thread)) {
1809 #ifndef PRODUCT
1810 _slow_array_copy_ctr++;
1811 #endif
1812 // Check if we have null pointers
1813 if (src == NULL || dest == NULL) {
1814 THROW(vmSymbols::java_lang_NullPointerException());
1815 }
1816 // Do the copy. The casts to arrayOop are necessary to the copy_array API,
1817 // even though the copy_array API also performs dynamic checks to ensure
1818 // that src and dest are truly arrays (and are conformable).
1819 // The copy_array mechanism is awkward and could be removed, but
1820 // the compilers don't call this function except as a last resort,
1821 // so it probably doesn't matter.
1822 src->klass()->copy_array((arrayOopDesc*)src, src_pos,
1823 (arrayOopDesc*)dest, dest_pos,
1824 length, thread);
1825 }
1826 JRT_END
1828 char* SharedRuntime::generate_class_cast_message(
1829 JavaThread* thread, const char* objName) {
1831 // Get target class name from the checkcast instruction
1832 vframeStream vfst(thread, true);
1833 assert(!vfst.at_end(), "Java frame must exist");
1834 Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci()));
1835 Klass* targetKlass = vfst.method()->constants()->klass_at(
1836 cc.index(), thread);
1837 return generate_class_cast_message(objName, targetKlass->external_name());
1838 }
1840 char* SharedRuntime::generate_class_cast_message(
1841 const char* objName, const char* targetKlassName, const char* desc) {
1842 size_t msglen = strlen(objName) + strlen(desc) + strlen(targetKlassName) + 1;
1844 char* message = NEW_RESOURCE_ARRAY(char, msglen);
1845 if (NULL == message) {
1846 // Shouldn't happen, but don't cause even more problems if it does
1847 message = const_cast<char*>(objName);
1848 } else {
1849 jio_snprintf(message, msglen, "%s%s%s", objName, desc, targetKlassName);
1850 }
1851 return message;
1852 }
1854 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
1855 (void) JavaThread::current()->reguard_stack();
1856 JRT_END
1859 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
1860 #ifndef PRODUCT
1861 int SharedRuntime::_monitor_enter_ctr=0;
1862 #endif
1863 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
1864 oop obj(_obj);
1865 #ifndef PRODUCT
1866 _monitor_enter_ctr++; // monitor enter slow
1867 #endif
1868 if (PrintBiasedLockingStatistics) {
1869 Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
1870 }
1871 Handle h_obj(THREAD, obj);
1872 if (UseBiasedLocking) {
1873 // Retry fast entry if bias is revoked to avoid unnecessary inflation
1874 ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK);
1875 } else {
1876 ObjectSynchronizer::slow_enter(h_obj, lock, CHECK);
1877 }
1878 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
1879 JRT_END
1881 #ifndef PRODUCT
1882 int SharedRuntime::_monitor_exit_ctr=0;
1883 #endif
1884 // Handles the uncommon cases of monitor unlocking in compiled code
1885 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock))
1886 oop obj(_obj);
1887 #ifndef PRODUCT
1888 _monitor_exit_ctr++; // monitor exit slow
1889 #endif
1890 Thread* THREAD = JavaThread::current();
1891 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore
1892 // testing was unable to ever fire the assert that guarded it so I have removed it.
1893 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?");
1894 #undef MIGHT_HAVE_PENDING
1895 #ifdef MIGHT_HAVE_PENDING
1896 // Save and restore any pending_exception around the exception mark.
1897 // While the slow_exit must not throw an exception, we could come into
1898 // this routine with one set.
1899 oop pending_excep = NULL;
1900 const char* pending_file;
1901 int pending_line;
1902 if (HAS_PENDING_EXCEPTION) {
1903 pending_excep = PENDING_EXCEPTION;
1904 pending_file = THREAD->exception_file();
1905 pending_line = THREAD->exception_line();
1906 CLEAR_PENDING_EXCEPTION;
1907 }
1908 #endif /* MIGHT_HAVE_PENDING */
1910 {
1911 // Exit must be non-blocking, and therefore no exceptions can be thrown.
1912 EXCEPTION_MARK;
1913 ObjectSynchronizer::slow_exit(obj, lock, THREAD);
1914 }
1916 #ifdef MIGHT_HAVE_PENDING
1917 if (pending_excep != NULL) {
1918 THREAD->set_pending_exception(pending_excep, pending_file, pending_line);
1919 }
1920 #endif /* MIGHT_HAVE_PENDING */
1921 JRT_END
1923 #ifndef PRODUCT
1925 void SharedRuntime::print_statistics() {
1926 ttyLocker ttyl;
1927 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'");
1929 if (_monitor_enter_ctr ) tty->print_cr("%5d monitor enter slow", _monitor_enter_ctr);
1930 if (_monitor_exit_ctr ) tty->print_cr("%5d monitor exit slow", _monitor_exit_ctr);
1931 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr);
1933 SharedRuntime::print_ic_miss_histogram();
1935 if (CountRemovableExceptions) {
1936 if (_nof_removable_exceptions > 0) {
1937 Unimplemented(); // this counter is not yet incremented
1938 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions);
1939 }
1940 }
1942 // Dump the JRT_ENTRY counters
1943 if( _new_instance_ctr ) tty->print_cr("%5d new instance requires GC", _new_instance_ctr);
1944 if( _new_array_ctr ) tty->print_cr("%5d new array requires GC", _new_array_ctr);
1945 if( _multi1_ctr ) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr);
1946 if( _multi2_ctr ) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr);
1947 if( _multi3_ctr ) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr);
1948 if( _multi4_ctr ) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr);
1949 if( _multi5_ctr ) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr);
1951 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr );
1952 tty->print_cr("%5d wrong method", _wrong_method_ctr );
1953 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr );
1954 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr );
1955 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr );
1957 if( _mon_enter_stub_ctr ) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr );
1958 if( _mon_exit_stub_ctr ) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr );
1959 if( _mon_enter_ctr ) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr );
1960 if( _mon_exit_ctr ) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr );
1961 if( _partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr );
1962 if( _jbyte_array_copy_ctr ) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr );
1963 if( _jshort_array_copy_ctr ) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr );
1964 if( _jint_array_copy_ctr ) tty->print_cr("%5d int array copies", _jint_array_copy_ctr );
1965 if( _jlong_array_copy_ctr ) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr );
1966 if( _oop_array_copy_ctr ) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr );
1967 if( _checkcast_array_copy_ctr ) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr );
1968 if( _unsafe_array_copy_ctr ) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr );
1969 if( _generic_array_copy_ctr ) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr );
1970 if( _slow_array_copy_ctr ) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr );
1971 if( _find_handler_ctr ) tty->print_cr("%5d find exception handler", _find_handler_ctr );
1972 if( _rethrow_ctr ) tty->print_cr("%5d rethrow handler", _rethrow_ctr );
1974 AdapterHandlerLibrary::print_statistics();
1976 if (xtty != NULL) xtty->tail("statistics");
1977 }
1979 inline double percent(int x, int y) {
1980 return 100.0 * x / MAX2(y, 1);
1981 }
1983 class MethodArityHistogram {
1984 public:
1985 enum { MAX_ARITY = 256 };
1986 private:
1987 static int _arity_histogram[MAX_ARITY]; // histogram of #args
1988 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words
1989 static int _max_arity; // max. arity seen
1990 static int _max_size; // max. arg size seen
1992 static void add_method_to_histogram(nmethod* nm) {
1993 Method* m = nm->method();
1994 ArgumentCount args(m->signature());
1995 int arity = args.size() + (m->is_static() ? 0 : 1);
1996 int argsize = m->size_of_parameters();
1997 arity = MIN2(arity, MAX_ARITY-1);
1998 argsize = MIN2(argsize, MAX_ARITY-1);
1999 int count = nm->method()->compiled_invocation_count();
2000 _arity_histogram[arity] += count;
2001 _size_histogram[argsize] += count;
2002 _max_arity = MAX2(_max_arity, arity);
2003 _max_size = MAX2(_max_size, argsize);
2004 }
2006 void print_histogram_helper(int n, int* histo, const char* name) {
2007 const int N = MIN2(5, n);
2008 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2009 double sum = 0;
2010 double weighted_sum = 0;
2011 int i;
2012 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; }
2013 double rest = sum;
2014 double percent = sum / 100;
2015 for (i = 0; i <= N; i++) {
2016 rest -= histo[i];
2017 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent);
2018 }
2019 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent);
2020 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
2021 }
2023 void print_histogram() {
2024 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2025 print_histogram_helper(_max_arity, _arity_histogram, "arity");
2026 tty->print_cr("\nSame for parameter size (in words):");
2027 print_histogram_helper(_max_size, _size_histogram, "size");
2028 tty->cr();
2029 }
2031 public:
2032 MethodArityHistogram() {
2033 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2034 _max_arity = _max_size = 0;
2035 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram [i] = 0;
2036 CodeCache::nmethods_do(add_method_to_histogram);
2037 print_histogram();
2038 }
2039 };
2041 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
2042 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
2043 int MethodArityHistogram::_max_arity;
2044 int MethodArityHistogram::_max_size;
2046 void SharedRuntime::print_call_statistics(int comp_total) {
2047 tty->print_cr("Calls from compiled code:");
2048 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
2049 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls;
2050 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls;
2051 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total));
2052 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total));
2053 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
2054 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls));
2055 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls));
2056 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
2057 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total));
2058 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
2059 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls));
2060 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls));
2061 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls));
2062 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
2063 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
2064 tty->cr();
2065 tty->print_cr("Note 1: counter updates are not MT-safe.");
2066 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
2067 tty->print_cr(" %% in nested categories are relative to their category");
2068 tty->print_cr(" (and thus add up to more than 100%% with inlining)");
2069 tty->cr();
2071 MethodArityHistogram h;
2072 }
2073 #endif
2076 // A simple wrapper class around the calling convention information
2077 // that allows sharing of adapters for the same calling convention.
2078 class AdapterFingerPrint : public CHeapObj<mtCode> {
2079 private:
2080 enum {
2081 _basic_type_bits = 4,
2082 _basic_type_mask = right_n_bits(_basic_type_bits),
2083 _basic_types_per_int = BitsPerInt / _basic_type_bits,
2084 _compact_int_count = 3
2085 };
2086 // TO DO: Consider integrating this with a more global scheme for compressing signatures.
2087 // For now, 4 bits per components (plus T_VOID gaps after double/long) is not excessive.
2089 union {
2090 int _compact[_compact_int_count];
2091 int* _fingerprint;
2092 } _value;
2093 int _length; // A negative length indicates the fingerprint is in the compact form,
2094 // Otherwise _value._fingerprint is the array.
2096 // Remap BasicTypes that are handled equivalently by the adapters.
2097 // These are correct for the current system but someday it might be
2098 // necessary to make this mapping platform dependent.
2099 static int adapter_encoding(BasicType in) {
2100 switch(in) {
2101 case T_BOOLEAN:
2102 case T_BYTE:
2103 case T_SHORT:
2104 case T_CHAR:
2105 // There are all promoted to T_INT in the calling convention
2106 return T_INT;
2108 case T_OBJECT:
2109 case T_ARRAY:
2110 // In other words, we assume that any register good enough for
2111 // an int or long is good enough for a managed pointer.
2112 #ifdef _LP64
2113 return T_LONG;
2114 #else
2115 return T_INT;
2116 #endif
2118 case T_INT:
2119 case T_LONG:
2120 case T_FLOAT:
2121 case T_DOUBLE:
2122 case T_VOID:
2123 return in;
2125 default:
2126 ShouldNotReachHere();
2127 return T_CONFLICT;
2128 }
2129 }
2131 public:
2132 AdapterFingerPrint(int total_args_passed, BasicType* sig_bt) {
2133 // The fingerprint is based on the BasicType signature encoded
2134 // into an array of ints with eight entries per int.
2135 int* ptr;
2136 int len = (total_args_passed + (_basic_types_per_int-1)) / _basic_types_per_int;
2137 if (len <= _compact_int_count) {
2138 assert(_compact_int_count == 3, "else change next line");
2139 _value._compact[0] = _value._compact[1] = _value._compact[2] = 0;
2140 // Storing the signature encoded as signed chars hits about 98%
2141 // of the time.
2142 _length = -len;
2143 ptr = _value._compact;
2144 } else {
2145 _length = len;
2146 _value._fingerprint = NEW_C_HEAP_ARRAY(int, _length, mtCode);
2147 ptr = _value._fingerprint;
2148 }
2150 // Now pack the BasicTypes with 8 per int
2151 int sig_index = 0;
2152 for (int index = 0; index < len; index++) {
2153 int value = 0;
2154 for (int byte = 0; byte < _basic_types_per_int; byte++) {
2155 int bt = ((sig_index < total_args_passed)
2156 ? adapter_encoding(sig_bt[sig_index++])
2157 : 0);
2158 assert((bt & _basic_type_mask) == bt, "must fit in 4 bits");
2159 value = (value << _basic_type_bits) | bt;
2160 }
2161 ptr[index] = value;
2162 }
2163 }
2165 ~AdapterFingerPrint() {
2166 if (_length > 0) {
2167 FREE_C_HEAP_ARRAY(int, _value._fingerprint, mtCode);
2168 }
2169 }
2171 int value(int index) {
2172 if (_length < 0) {
2173 return _value._compact[index];
2174 }
2175 return _value._fingerprint[index];
2176 }
2177 int length() {
2178 if (_length < 0) return -_length;
2179 return _length;
2180 }
2182 bool is_compact() {
2183 return _length <= 0;
2184 }
2186 unsigned int compute_hash() {
2187 int hash = 0;
2188 for (int i = 0; i < length(); i++) {
2189 int v = value(i);
2190 hash = (hash << 8) ^ v ^ (hash >> 5);
2191 }
2192 return (unsigned int)hash;
2193 }
2195 const char* as_string() {
2196 stringStream st;
2197 st.print("0x");
2198 for (int i = 0; i < length(); i++) {
2199 st.print("%08x", value(i));
2200 }
2201 return st.as_string();
2202 }
2204 bool equals(AdapterFingerPrint* other) {
2205 if (other->_length != _length) {
2206 return false;
2207 }
2208 if (_length < 0) {
2209 assert(_compact_int_count == 3, "else change next line");
2210 return _value._compact[0] == other->_value._compact[0] &&
2211 _value._compact[1] == other->_value._compact[1] &&
2212 _value._compact[2] == other->_value._compact[2];
2213 } else {
2214 for (int i = 0; i < _length; i++) {
2215 if (_value._fingerprint[i] != other->_value._fingerprint[i]) {
2216 return false;
2217 }
2218 }
2219 }
2220 return true;
2221 }
2222 };
2225 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries
2226 class AdapterHandlerTable : public BasicHashtable<mtCode> {
2227 friend class AdapterHandlerTableIterator;
2229 private:
2231 #ifndef PRODUCT
2232 static int _lookups; // number of calls to lookup
2233 static int _buckets; // number of buckets checked
2234 static int _equals; // number of buckets checked with matching hash
2235 static int _hits; // number of successful lookups
2236 static int _compact; // number of equals calls with compact signature
2237 #endif
2239 AdapterHandlerEntry* bucket(int i) {
2240 return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i);
2241 }
2243 public:
2244 AdapterHandlerTable()
2245 : BasicHashtable<mtCode>(293, sizeof(AdapterHandlerEntry)) { }
2247 // Create a new entry suitable for insertion in the table
2248 AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry) {
2249 AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable<mtCode>::new_entry(fingerprint->compute_hash());
2250 entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2251 return entry;
2252 }
2254 // Insert an entry into the table
2255 void add(AdapterHandlerEntry* entry) {
2256 int index = hash_to_index(entry->hash());
2257 add_entry(index, entry);
2258 }
2260 void free_entry(AdapterHandlerEntry* entry) {
2261 entry->deallocate();
2262 BasicHashtable<mtCode>::free_entry(entry);
2263 }
2265 // Find a entry with the same fingerprint if it exists
2266 AdapterHandlerEntry* lookup(int total_args_passed, BasicType* sig_bt) {
2267 NOT_PRODUCT(_lookups++);
2268 AdapterFingerPrint fp(total_args_passed, sig_bt);
2269 unsigned int hash = fp.compute_hash();
2270 int index = hash_to_index(hash);
2271 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2272 NOT_PRODUCT(_buckets++);
2273 if (e->hash() == hash) {
2274 NOT_PRODUCT(_equals++);
2275 if (fp.equals(e->fingerprint())) {
2276 #ifndef PRODUCT
2277 if (fp.is_compact()) _compact++;
2278 _hits++;
2279 #endif
2280 return e;
2281 }
2282 }
2283 }
2284 return NULL;
2285 }
2287 #ifndef PRODUCT
2288 void print_statistics() {
2289 ResourceMark rm;
2290 int longest = 0;
2291 int empty = 0;
2292 int total = 0;
2293 int nonempty = 0;
2294 for (int index = 0; index < table_size(); index++) {
2295 int count = 0;
2296 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2297 count++;
2298 }
2299 if (count != 0) nonempty++;
2300 if (count == 0) empty++;
2301 if (count > longest) longest = count;
2302 total += count;
2303 }
2304 tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f",
2305 empty, longest, total, total / (double)nonempty);
2306 tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d",
2307 _lookups, _buckets, _equals, _hits, _compact);
2308 }
2309 #endif
2310 };
2313 #ifndef PRODUCT
2315 int AdapterHandlerTable::_lookups;
2316 int AdapterHandlerTable::_buckets;
2317 int AdapterHandlerTable::_equals;
2318 int AdapterHandlerTable::_hits;
2319 int AdapterHandlerTable::_compact;
2321 #endif
2323 class AdapterHandlerTableIterator : public StackObj {
2324 private:
2325 AdapterHandlerTable* _table;
2326 int _index;
2327 AdapterHandlerEntry* _current;
2329 void scan() {
2330 while (_index < _table->table_size()) {
2331 AdapterHandlerEntry* a = _table->bucket(_index);
2332 _index++;
2333 if (a != NULL) {
2334 _current = a;
2335 return;
2336 }
2337 }
2338 }
2340 public:
2341 AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) {
2342 scan();
2343 }
2344 bool has_next() {
2345 return _current != NULL;
2346 }
2347 AdapterHandlerEntry* next() {
2348 if (_current != NULL) {
2349 AdapterHandlerEntry* result = _current;
2350 _current = _current->next();
2351 if (_current == NULL) scan();
2352 return result;
2353 } else {
2354 return NULL;
2355 }
2356 }
2357 };
2360 // ---------------------------------------------------------------------------
2361 // Implementation of AdapterHandlerLibrary
2362 AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL;
2363 AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL;
2364 const int AdapterHandlerLibrary_size = 16*K;
2365 BufferBlob* AdapterHandlerLibrary::_buffer = NULL;
2367 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
2368 // Should be called only when AdapterHandlerLibrary_lock is active.
2369 if (_buffer == NULL) // Initialize lazily
2370 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
2371 return _buffer;
2372 }
2374 void AdapterHandlerLibrary::initialize() {
2375 if (_adapters != NULL) return;
2376 _adapters = new AdapterHandlerTable();
2378 // Create a special handler for abstract methods. Abstract methods
2379 // are never compiled so an i2c entry is somewhat meaningless, but
2380 // throw AbstractMethodError just in case.
2381 // Pass wrong_method_abstract for the c2i transitions to return
2382 // AbstractMethodError for invalid invocations.
2383 address wrong_method_abstract = SharedRuntime::get_handle_wrong_method_abstract_stub();
2384 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL),
2385 StubRoutines::throw_AbstractMethodError_entry(),
2386 wrong_method_abstract, wrong_method_abstract);
2387 }
2389 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint,
2390 address i2c_entry,
2391 address c2i_entry,
2392 address c2i_unverified_entry) {
2393 return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2394 }
2396 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(methodHandle method) {
2397 // Use customized signature handler. Need to lock around updates to
2398 // the AdapterHandlerTable (it is not safe for concurrent readers
2399 // and a single writer: this could be fixed if it becomes a
2400 // problem).
2402 // Get the address of the ic_miss handlers before we grab the
2403 // AdapterHandlerLibrary_lock. This fixes bug 6236259 which
2404 // was caused by the initialization of the stubs happening
2405 // while we held the lock and then notifying jvmti while
2406 // holding it. This just forces the initialization to be a little
2407 // earlier.
2408 address ic_miss = SharedRuntime::get_ic_miss_stub();
2409 assert(ic_miss != NULL, "must have handler");
2411 ResourceMark rm;
2413 NOT_PRODUCT(int insts_size);
2414 AdapterBlob* new_adapter = NULL;
2415 AdapterHandlerEntry* entry = NULL;
2416 AdapterFingerPrint* fingerprint = NULL;
2417 {
2418 MutexLocker mu(AdapterHandlerLibrary_lock);
2419 // make sure data structure is initialized
2420 initialize();
2422 if (method->is_abstract()) {
2423 return _abstract_method_handler;
2424 }
2426 // Fill in the signature array, for the calling-convention call.
2427 int total_args_passed = method->size_of_parameters(); // All args on stack
2429 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2430 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2431 int i = 0;
2432 if (!method->is_static()) // Pass in receiver first
2433 sig_bt[i++] = T_OBJECT;
2434 for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) {
2435 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2436 if (ss.type() == T_LONG || ss.type() == T_DOUBLE)
2437 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2438 }
2439 assert(i == total_args_passed, "");
2441 // Lookup method signature's fingerprint
2442 entry = _adapters->lookup(total_args_passed, sig_bt);
2444 #ifdef ASSERT
2445 AdapterHandlerEntry* shared_entry = NULL;
2446 // Start adapter sharing verification only after the VM is booted.
2447 if (VerifyAdapterSharing && (entry != NULL)) {
2448 shared_entry = entry;
2449 entry = NULL;
2450 }
2451 #endif
2453 if (entry != NULL) {
2454 return entry;
2455 }
2457 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
2458 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
2460 // Make a C heap allocated version of the fingerprint to store in the adapter
2461 fingerprint = new AdapterFingerPrint(total_args_passed, sig_bt);
2463 // StubRoutines::code2() is initialized after this function can be called. As a result,
2464 // VerifyAdapterCalls and VerifyAdapterSharing can fail if we re-use code that generated
2465 // prior to StubRoutines::code2() being set. Checks refer to checks generated in an I2C
2466 // stub that ensure that an I2C stub is called from an interpreter frame.
2467 bool contains_all_checks = StubRoutines::code2() != NULL;
2469 // Create I2C & C2I handlers
2470 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2471 if (buf != NULL) {
2472 CodeBuffer buffer(buf);
2473 short buffer_locs[20];
2474 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
2475 sizeof(buffer_locs)/sizeof(relocInfo));
2477 MacroAssembler _masm(&buffer);
2478 entry = SharedRuntime::generate_i2c2i_adapters(&_masm,
2479 total_args_passed,
2480 comp_args_on_stack,
2481 sig_bt,
2482 regs,
2483 fingerprint);
2484 #ifdef ASSERT
2485 if (VerifyAdapterSharing) {
2486 if (shared_entry != NULL) {
2487 assert(shared_entry->compare_code(buf->code_begin(), buffer.insts_size()), "code must match");
2488 // Release the one just created and return the original
2489 _adapters->free_entry(entry);
2490 return shared_entry;
2491 } else {
2492 entry->save_code(buf->code_begin(), buffer.insts_size());
2493 }
2494 }
2495 #endif
2497 new_adapter = AdapterBlob::create(&buffer);
2498 NOT_PRODUCT(insts_size = buffer.insts_size());
2499 }
2500 if (new_adapter == NULL) {
2501 // CodeCache is full, disable compilation
2502 // Ought to log this but compile log is only per compile thread
2503 // and we're some non descript Java thread.
2504 MutexUnlocker mu(AdapterHandlerLibrary_lock);
2505 CompileBroker::handle_full_code_cache();
2506 return NULL; // Out of CodeCache space
2507 }
2508 entry->relocate(new_adapter->content_begin());
2509 #ifndef PRODUCT
2510 // debugging suppport
2511 if (PrintAdapterHandlers || PrintStubCode) {
2512 ttyLocker ttyl;
2513 entry->print_adapter_on(tty);
2514 tty->print_cr("i2c argument handler #%d for: %s %s (%d bytes generated)",
2515 _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"),
2516 method->signature()->as_C_string(), insts_size);
2517 tty->print_cr("c2i argument handler starts at %p",entry->get_c2i_entry());
2518 if (Verbose || PrintStubCode) {
2519 address first_pc = entry->base_address();
2520 if (first_pc != NULL) {
2521 Disassembler::decode(first_pc, first_pc + insts_size);
2522 tty->cr();
2523 }
2524 }
2525 }
2526 #endif
2527 // Add the entry only if the entry contains all required checks (see sharedRuntime_xxx.cpp)
2528 // The checks are inserted only if -XX:+VerifyAdapterCalls is specified.
2529 if (contains_all_checks || !VerifyAdapterCalls) {
2530 _adapters->add(entry);
2531 }
2532 }
2533 // Outside of the lock
2534 if (new_adapter != NULL) {
2535 char blob_id[256];
2536 jio_snprintf(blob_id,
2537 sizeof(blob_id),
2538 "%s(%s)@" PTR_FORMAT,
2539 new_adapter->name(),
2540 fingerprint->as_string(),
2541 new_adapter->content_begin());
2542 Forte::register_stub(blob_id, new_adapter->content_begin(),new_adapter->content_end());
2544 if (JvmtiExport::should_post_dynamic_code_generated()) {
2545 JvmtiExport::post_dynamic_code_generated(blob_id, new_adapter->content_begin(), new_adapter->content_end());
2546 }
2547 }
2548 return entry;
2549 }
2551 address AdapterHandlerEntry::base_address() {
2552 address base = _i2c_entry;
2553 if (base == NULL) base = _c2i_entry;
2554 assert(base <= _c2i_entry || _c2i_entry == NULL, "");
2555 assert(base <= _c2i_unverified_entry || _c2i_unverified_entry == NULL, "");
2556 return base;
2557 }
2559 void AdapterHandlerEntry::relocate(address new_base) {
2560 address old_base = base_address();
2561 assert(old_base != NULL, "");
2562 ptrdiff_t delta = new_base - old_base;
2563 if (_i2c_entry != NULL)
2564 _i2c_entry += delta;
2565 if (_c2i_entry != NULL)
2566 _c2i_entry += delta;
2567 if (_c2i_unverified_entry != NULL)
2568 _c2i_unverified_entry += delta;
2569 assert(base_address() == new_base, "");
2570 }
2573 void AdapterHandlerEntry::deallocate() {
2574 delete _fingerprint;
2575 #ifdef ASSERT
2576 if (_saved_code) FREE_C_HEAP_ARRAY(unsigned char, _saved_code, mtCode);
2577 #endif
2578 }
2581 #ifdef ASSERT
2582 // Capture the code before relocation so that it can be compared
2583 // against other versions. If the code is captured after relocation
2584 // then relative instructions won't be equivalent.
2585 void AdapterHandlerEntry::save_code(unsigned char* buffer, int length) {
2586 _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode);
2587 _saved_code_length = length;
2588 memcpy(_saved_code, buffer, length);
2589 }
2592 bool AdapterHandlerEntry::compare_code(unsigned char* buffer, int length) {
2593 if (length != _saved_code_length) {
2594 return false;
2595 }
2597 return (memcmp(buffer, _saved_code, length) == 0) ? true : false;
2598 }
2599 #endif
2602 /**
2603 * Create a native wrapper for this native method. The wrapper converts the
2604 * Java-compiled calling convention to the native convention, handles
2605 * arguments, and transitions to native. On return from the native we transition
2606 * back to java blocking if a safepoint is in progress.
2607 */
2608 void AdapterHandlerLibrary::create_native_wrapper(methodHandle method) {
2609 ResourceMark rm;
2610 nmethod* nm = NULL;
2612 assert(method->is_native(), "must be native");
2613 assert(method->is_method_handle_intrinsic() ||
2614 method->has_native_function(), "must have something valid to call!");
2616 {
2617 // Perform the work while holding the lock, but perform any printing outside the lock
2618 MutexLocker mu(AdapterHandlerLibrary_lock);
2619 // See if somebody beat us to it
2620 nm = method->code();
2621 if (nm != NULL) {
2622 return;
2623 }
2625 const int compile_id = CompileBroker::assign_compile_id(method, CompileBroker::standard_entry_bci);
2626 assert(compile_id > 0, "Must generate native wrapper");
2629 ResourceMark rm;
2630 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2631 if (buf != NULL) {
2632 CodeBuffer buffer(buf);
2633 double locs_buf[20];
2634 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2635 MacroAssembler _masm(&buffer);
2637 // Fill in the signature array, for the calling-convention call.
2638 const int total_args_passed = method->size_of_parameters();
2640 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2641 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2642 int i=0;
2643 if( !method->is_static() ) // Pass in receiver first
2644 sig_bt[i++] = T_OBJECT;
2645 SignatureStream ss(method->signature());
2646 for( ; !ss.at_return_type(); ss.next()) {
2647 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2648 if( ss.type() == T_LONG || ss.type() == T_DOUBLE )
2649 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2650 }
2651 assert(i == total_args_passed, "");
2652 BasicType ret_type = ss.type();
2654 // Now get the compiled-Java layout as input (or output) arguments.
2655 // NOTE: Stubs for compiled entry points of method handle intrinsics
2656 // are just trampolines so the argument registers must be outgoing ones.
2657 const bool is_outgoing = method->is_method_handle_intrinsic();
2658 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, is_outgoing);
2660 // Generate the compiled-to-native wrapper code
2661 nm = SharedRuntime::generate_native_wrapper(&_masm, method, compile_id, sig_bt, regs, ret_type);
2663 if (nm != NULL) {
2664 method->set_code(method, nm);
2665 }
2666 }
2667 } // Unlock AdapterHandlerLibrary_lock
2670 // Install the generated code.
2671 if (nm != NULL) {
2672 if (PrintCompilation) {
2673 ttyLocker ttyl;
2674 CompileTask::print_compilation(tty, nm, method->is_static() ? "(static)" : "");
2675 }
2676 nm->post_compiled_method_load_event();
2677 } else {
2678 // CodeCache is full, disable compilation
2679 CompileBroker::handle_full_code_cache();
2680 }
2681 }
2683 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::block_for_jni_critical(JavaThread* thread))
2684 assert(thread == JavaThread::current(), "must be");
2685 // The code is about to enter a JNI lazy critical native method and
2686 // _needs_gc is true, so if this thread is already in a critical
2687 // section then just return, otherwise this thread should block
2688 // until needs_gc has been cleared.
2689 if (thread->in_critical()) {
2690 return;
2691 }
2692 // Lock and unlock a critical section to give the system a chance to block
2693 GC_locker::lock_critical(thread);
2694 GC_locker::unlock_critical(thread);
2695 JRT_END
2697 #ifdef HAVE_DTRACE_H
2698 /**
2699 * Create a dtrace nmethod for this method. The wrapper converts the
2700 * Java-compiled calling convention to the native convention, makes a dummy call
2701 * (actually nops for the size of the call instruction, which become a trap if
2702 * probe is enabled), and finally returns to the caller. Since this all looks like a
2703 * leaf, no thread transition is needed.
2704 */
2705 nmethod *AdapterHandlerLibrary::create_dtrace_nmethod(methodHandle method) {
2706 ResourceMark rm;
2707 nmethod* nm = NULL;
2709 if (PrintCompilation) {
2710 ttyLocker ttyl;
2711 tty->print("--- n ");
2712 method->print_short_name(tty);
2713 if (method->is_static()) {
2714 tty->print(" (static)");
2715 }
2716 tty->cr();
2717 }
2719 {
2720 // perform the work while holding the lock, but perform any printing
2721 // outside the lock
2722 MutexLocker mu(AdapterHandlerLibrary_lock);
2723 // See if somebody beat us to it
2724 nm = method->code();
2725 if (nm) {
2726 return nm;
2727 }
2729 ResourceMark rm;
2731 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2732 if (buf != NULL) {
2733 CodeBuffer buffer(buf);
2734 // Need a few relocation entries
2735 double locs_buf[20];
2736 buffer.insts()->initialize_shared_locs(
2737 (relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2738 MacroAssembler _masm(&buffer);
2740 // Generate the compiled-to-native wrapper code
2741 nm = SharedRuntime::generate_dtrace_nmethod(&_masm, method);
2742 }
2743 }
2744 return nm;
2745 }
2747 // the dtrace method needs to convert java lang string to utf8 string.
2748 void SharedRuntime::get_utf(oopDesc* src, address dst) {
2749 typeArrayOop jlsValue = java_lang_String::value(src);
2750 int jlsOffset = java_lang_String::offset(src);
2751 int jlsLen = java_lang_String::length(src);
2752 jchar* jlsPos = (jlsLen == 0) ? NULL :
2753 jlsValue->char_at_addr(jlsOffset);
2754 assert(TypeArrayKlass::cast(jlsValue->klass())->element_type() == T_CHAR, "compressed string");
2755 (void) UNICODE::as_utf8(jlsPos, jlsLen, (char *)dst, max_dtrace_string_size);
2756 }
2757 #endif // ndef HAVE_DTRACE_H
2759 int SharedRuntime::convert_ints_to_longints_argcnt(int in_args_count, BasicType* in_sig_bt) {
2760 int argcnt = in_args_count;
2761 if (CCallingConventionRequiresIntsAsLongs) {
2762 for (int in = 0; in < in_args_count; in++) {
2763 BasicType bt = in_sig_bt[in];
2764 switch (bt) {
2765 case T_BOOLEAN:
2766 case T_CHAR:
2767 case T_BYTE:
2768 case T_SHORT:
2769 case T_INT:
2770 argcnt++;
2771 break;
2772 default:
2773 break;
2774 }
2775 }
2776 } else {
2777 assert(0, "This should not be needed on this platform");
2778 }
2780 return argcnt;
2781 }
2783 void SharedRuntime::convert_ints_to_longints(int i2l_argcnt, int& in_args_count,
2784 BasicType*& in_sig_bt, VMRegPair*& in_regs) {
2785 if (CCallingConventionRequiresIntsAsLongs) {
2786 VMRegPair *new_in_regs = NEW_RESOURCE_ARRAY(VMRegPair, i2l_argcnt);
2787 BasicType *new_in_sig_bt = NEW_RESOURCE_ARRAY(BasicType, i2l_argcnt);
2789 int argcnt = 0;
2790 for (int in = 0; in < in_args_count; in++, argcnt++) {
2791 BasicType bt = in_sig_bt[in];
2792 VMRegPair reg = in_regs[in];
2793 switch (bt) {
2794 case T_BOOLEAN:
2795 case T_CHAR:
2796 case T_BYTE:
2797 case T_SHORT:
2798 case T_INT:
2799 // Convert (bt) to (T_LONG,bt).
2800 new_in_sig_bt[argcnt ] = T_LONG;
2801 new_in_sig_bt[argcnt+1] = bt;
2802 assert(reg.first()->is_valid() && !reg.second()->is_valid(), "");
2803 new_in_regs[argcnt ].set2(reg.first());
2804 new_in_regs[argcnt+1].set_bad();
2805 argcnt++;
2806 break;
2807 default:
2808 // No conversion needed.
2809 new_in_sig_bt[argcnt] = bt;
2810 new_in_regs[argcnt] = reg;
2811 break;
2812 }
2813 }
2814 assert(argcnt == i2l_argcnt, "must match");
2816 in_regs = new_in_regs;
2817 in_sig_bt = new_in_sig_bt;
2818 in_args_count = i2l_argcnt;
2819 } else {
2820 assert(0, "This should not be needed on this platform");
2821 }
2822 }
2824 // -------------------------------------------------------------------------
2825 // Java-Java calling convention
2826 // (what you use when Java calls Java)
2828 //------------------------------name_for_receiver----------------------------------
2829 // For a given signature, return the VMReg for parameter 0.
2830 VMReg SharedRuntime::name_for_receiver() {
2831 VMRegPair regs;
2832 BasicType sig_bt = T_OBJECT;
2833 (void) java_calling_convention(&sig_bt, ®s, 1, true);
2834 // Return argument 0 register. In the LP64 build pointers
2835 // take 2 registers, but the VM wants only the 'main' name.
2836 return regs.first();
2837 }
2839 VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) {
2840 // This method is returning a data structure allocating as a
2841 // ResourceObject, so do not put any ResourceMarks in here.
2842 char *s = sig->as_C_string();
2843 int len = (int)strlen(s);
2844 s++; len--; // Skip opening paren
2845 char *t = s+len;
2846 while( *(--t) != ')' ) ; // Find close paren
2848 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, 256 );
2849 VMRegPair *regs = NEW_RESOURCE_ARRAY( VMRegPair, 256 );
2850 int cnt = 0;
2851 if (has_receiver) {
2852 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
2853 }
2855 while( s < t ) {
2856 switch( *s++ ) { // Switch on signature character
2857 case 'B': sig_bt[cnt++] = T_BYTE; break;
2858 case 'C': sig_bt[cnt++] = T_CHAR; break;
2859 case 'D': sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break;
2860 case 'F': sig_bt[cnt++] = T_FLOAT; break;
2861 case 'I': sig_bt[cnt++] = T_INT; break;
2862 case 'J': sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break;
2863 case 'S': sig_bt[cnt++] = T_SHORT; break;
2864 case 'Z': sig_bt[cnt++] = T_BOOLEAN; break;
2865 case 'V': sig_bt[cnt++] = T_VOID; break;
2866 case 'L': // Oop
2867 while( *s++ != ';' ) ; // Skip signature
2868 sig_bt[cnt++] = T_OBJECT;
2869 break;
2870 case '[': { // Array
2871 do { // Skip optional size
2872 while( *s >= '0' && *s <= '9' ) s++;
2873 } while( *s++ == '[' ); // Nested arrays?
2874 // Skip element type
2875 if( s[-1] == 'L' )
2876 while( *s++ != ';' ) ; // Skip signature
2877 sig_bt[cnt++] = T_ARRAY;
2878 break;
2879 }
2880 default : ShouldNotReachHere();
2881 }
2882 }
2884 if (has_appendix) {
2885 sig_bt[cnt++] = T_OBJECT;
2886 }
2888 assert( cnt < 256, "grow table size" );
2890 int comp_args_on_stack;
2891 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true);
2893 // the calling convention doesn't count out_preserve_stack_slots so
2894 // we must add that in to get "true" stack offsets.
2896 if (comp_args_on_stack) {
2897 for (int i = 0; i < cnt; i++) {
2898 VMReg reg1 = regs[i].first();
2899 if( reg1->is_stack()) {
2900 // Yuck
2901 reg1 = reg1->bias(out_preserve_stack_slots());
2902 }
2903 VMReg reg2 = regs[i].second();
2904 if( reg2->is_stack()) {
2905 // Yuck
2906 reg2 = reg2->bias(out_preserve_stack_slots());
2907 }
2908 regs[i].set_pair(reg2, reg1);
2909 }
2910 }
2912 // results
2913 *arg_size = cnt;
2914 return regs;
2915 }
2917 // OSR Migration Code
2918 //
2919 // This code is used convert interpreter frames into compiled frames. It is
2920 // called from very start of a compiled OSR nmethod. A temp array is
2921 // allocated to hold the interesting bits of the interpreter frame. All
2922 // active locks are inflated to allow them to move. The displaced headers and
2923 // active interpeter locals are copied into the temp buffer. Then we return
2924 // back to the compiled code. The compiled code then pops the current
2925 // interpreter frame off the stack and pushes a new compiled frame. Then it
2926 // copies the interpreter locals and displaced headers where it wants.
2927 // Finally it calls back to free the temp buffer.
2928 //
2929 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
2931 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) )
2933 //
2934 // This code is dependent on the memory layout of the interpreter local
2935 // array and the monitors. On all of our platforms the layout is identical
2936 // so this code is shared. If some platform lays the their arrays out
2937 // differently then this code could move to platform specific code or
2938 // the code here could be modified to copy items one at a time using
2939 // frame accessor methods and be platform independent.
2941 frame fr = thread->last_frame();
2942 assert( fr.is_interpreted_frame(), "" );
2943 assert( fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks" );
2945 // Figure out how many monitors are active.
2946 int active_monitor_count = 0;
2947 for( BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
2948 kptr < fr.interpreter_frame_monitor_begin();
2949 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
2950 if( kptr->obj() != NULL ) active_monitor_count++;
2951 }
2953 // QQQ we could place number of active monitors in the array so that compiled code
2954 // could double check it.
2956 Method* moop = fr.interpreter_frame_method();
2957 int max_locals = moop->max_locals();
2958 // Allocate temp buffer, 1 word per local & 2 per active monitor
2959 int buf_size_words = max_locals + active_monitor_count*2;
2960 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode);
2962 // Copy the locals. Order is preserved so that loading of longs works.
2963 // Since there's no GC I can copy the oops blindly.
2964 assert( sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
2965 Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
2966 (HeapWord*)&buf[0],
2967 max_locals);
2969 // Inflate locks. Copy the displaced headers. Be careful, there can be holes.
2970 int i = max_locals;
2971 for( BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
2972 kptr2 < fr.interpreter_frame_monitor_begin();
2973 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
2974 if( kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array
2975 BasicLock *lock = kptr2->lock();
2976 // Inflate so the displaced header becomes position-independent
2977 if (lock->displaced_header()->is_unlocked())
2978 ObjectSynchronizer::inflate_helper(kptr2->obj());
2979 // Now the displaced header is free to move
2980 buf[i++] = (intptr_t)lock->displaced_header();
2981 buf[i++] = cast_from_oop<intptr_t>(kptr2->obj());
2982 }
2983 }
2984 assert( i - max_locals == active_monitor_count*2, "found the expected number of monitors" );
2986 return buf;
2987 JRT_END
2989 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
2990 FREE_C_HEAP_ARRAY(intptr_t,buf, mtCode);
2991 JRT_END
2993 bool AdapterHandlerLibrary::contains(CodeBlob* b) {
2994 AdapterHandlerTableIterator iter(_adapters);
2995 while (iter.has_next()) {
2996 AdapterHandlerEntry* a = iter.next();
2997 if ( b == CodeCache::find_blob(a->get_i2c_entry()) ) return true;
2998 }
2999 return false;
3000 }
3002 void AdapterHandlerLibrary::print_handler_on(outputStream* st, CodeBlob* b) {
3003 AdapterHandlerTableIterator iter(_adapters);
3004 while (iter.has_next()) {
3005 AdapterHandlerEntry* a = iter.next();
3006 if (b == CodeCache::find_blob(a->get_i2c_entry())) {
3007 st->print("Adapter for signature: ");
3008 a->print_adapter_on(tty);
3009 return;
3010 }
3011 }
3012 assert(false, "Should have found handler");
3013 }
3015 void AdapterHandlerEntry::print_adapter_on(outputStream* st) const {
3016 st->print_cr("AHE@" INTPTR_FORMAT ": %s i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT,
3017 (intptr_t) this, fingerprint()->as_string(),
3018 get_i2c_entry(), get_c2i_entry(), get_c2i_unverified_entry());
3020 }
3022 #ifndef PRODUCT
3024 void AdapterHandlerLibrary::print_statistics() {
3025 _adapters->print_statistics();
3026 }
3028 #endif /* PRODUCT */