Tue, 11 Nov 2014 11:05:41 +0100
8056071: compiler/whitebox/IsMethodCompilableTest.java fails with 'method() is not compilable after 3 iterations'
Summary: Always use MDO if valid and always compile trivial methods with C1 if available.
Reviewed-by: kvn, iveresov
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 assert(caller_nm->is_alive(), "It should be alive");
1214 #ifndef PRODUCT
1215 // tracing/debugging/statistics
1216 int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
1217 (is_virtual) ? (&_resolve_virtual_ctr) :
1218 (&_resolve_static_ctr);
1219 Atomic::inc(addr);
1221 if (TraceCallFixup) {
1222 ResourceMark rm(thread);
1223 tty->print("resolving %s%s (%s) call to",
1224 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
1225 Bytecodes::name(invoke_code));
1226 callee_method->print_short_name(tty);
1227 tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT, caller_frame.pc(), callee_method->code());
1228 }
1229 #endif
1231 // JSR 292 key invariant:
1232 // If the resolved method is a MethodHandle invoke target the call
1233 // site must be a MethodHandle call site, because the lambda form might tail-call
1234 // leaving the stack in a state unknown to either caller or callee
1235 // TODO detune for now but we might need it again
1236 // assert(!callee_method->is_compiled_lambda_form() ||
1237 // caller_nm->is_method_handle_return(caller_frame.pc()), "must be MH call site");
1239 // Compute entry points. This might require generation of C2I converter
1240 // frames, so we cannot be holding any locks here. Furthermore, the
1241 // computation of the entry points is independent of patching the call. We
1242 // always return the entry-point, but we only patch the stub if the call has
1243 // not been deoptimized. Return values: For a virtual call this is an
1244 // (cached_oop, destination address) pair. For a static call/optimized
1245 // virtual this is just a destination address.
1247 StaticCallInfo static_call_info;
1248 CompiledICInfo virtual_call_info;
1250 // Make sure the callee nmethod does not get deoptimized and removed before
1251 // we are done patching the code.
1252 nmethod* callee_nm = callee_method->code();
1253 if (callee_nm != NULL && !callee_nm->is_in_use()) {
1254 // Patch call site to C2I adapter if callee nmethod is deoptimized or unloaded.
1255 callee_nm = NULL;
1256 }
1257 nmethodLocker nl_callee(callee_nm);
1258 #ifdef ASSERT
1259 address dest_entry_point = callee_nm == NULL ? 0 : callee_nm->entry_point(); // used below
1260 #endif
1262 if (is_virtual) {
1263 assert(receiver.not_null() || invoke_code == Bytecodes::_invokehandle, "sanity check");
1264 bool static_bound = call_info.resolved_method()->can_be_statically_bound();
1265 KlassHandle h_klass(THREAD, invoke_code == Bytecodes::_invokehandle ? NULL : receiver->klass());
1266 CompiledIC::compute_monomorphic_entry(callee_method, h_klass,
1267 is_optimized, static_bound, virtual_call_info,
1268 CHECK_(methodHandle()));
1269 } else {
1270 // static call
1271 CompiledStaticCall::compute_entry(callee_method, static_call_info);
1272 }
1274 // grab lock, check for deoptimization and potentially patch caller
1275 {
1276 MutexLocker ml_patch(CompiledIC_lock);
1278 // Lock blocks for safepoint during which both nmethods can change state.
1280 // Now that we are ready to patch if the Method* was redefined then
1281 // don't update call site and let the caller retry.
1282 // Don't update call site if callee nmethod was unloaded or deoptimized.
1283 // Don't update call site if callee nmethod was replaced by an other nmethod
1284 // which may happen when multiply alive nmethod (tiered compilation)
1285 // will be supported.
1286 if (!callee_method->is_old() &&
1287 (callee_nm == NULL || callee_nm->is_in_use() && (callee_method->code() == callee_nm))) {
1288 #ifdef ASSERT
1289 // We must not try to patch to jump to an already unloaded method.
1290 if (dest_entry_point != 0) {
1291 CodeBlob* cb = CodeCache::find_blob(dest_entry_point);
1292 assert((cb != NULL) && cb->is_nmethod() && (((nmethod*)cb) == callee_nm),
1293 "should not call unloaded nmethod");
1294 }
1295 #endif
1296 if (is_virtual) {
1297 nmethod* nm = callee_nm;
1298 if (nm == NULL) CodeCache::find_blob(caller_frame.pc());
1299 CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc());
1300 if (inline_cache->is_clean()) {
1301 inline_cache->set_to_monomorphic(virtual_call_info);
1302 }
1303 } else {
1304 CompiledStaticCall* ssc = compiledStaticCall_before(caller_frame.pc());
1305 if (ssc->is_clean()) ssc->set(static_call_info);
1306 }
1307 }
1309 } // unlock CompiledIC_lock
1311 return callee_method;
1312 }
1315 // Inline caches exist only in compiled code
1316 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread))
1317 #ifdef ASSERT
1318 RegisterMap reg_map(thread, false);
1319 frame stub_frame = thread->last_frame();
1320 assert(stub_frame.is_runtime_frame(), "sanity check");
1321 frame caller_frame = stub_frame.sender(®_map);
1322 assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame");
1323 #endif /* ASSERT */
1325 methodHandle callee_method;
1326 JRT_BLOCK
1327 callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL);
1328 // Return Method* through TLS
1329 thread->set_vm_result_2(callee_method());
1330 JRT_BLOCK_END
1331 // return compiled code entry point after potential safepoints
1332 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1333 return callee_method->verified_code_entry();
1334 JRT_END
1337 // Handle call site that has been made non-entrant
1338 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread))
1339 // 6243940 We might end up in here if the callee is deoptimized
1340 // as we race to call it. We don't want to take a safepoint if
1341 // the caller was interpreted because the caller frame will look
1342 // interpreted to the stack walkers and arguments are now
1343 // "compiled" so it is much better to make this transition
1344 // invisible to the stack walking code. The i2c path will
1345 // place the callee method in the callee_target. It is stashed
1346 // there because if we try and find the callee by normal means a
1347 // safepoint is possible and have trouble gc'ing the compiled args.
1348 RegisterMap reg_map(thread, false);
1349 frame stub_frame = thread->last_frame();
1350 assert(stub_frame.is_runtime_frame(), "sanity check");
1351 frame caller_frame = stub_frame.sender(®_map);
1353 if (caller_frame.is_interpreted_frame() ||
1354 caller_frame.is_entry_frame()) {
1355 Method* callee = thread->callee_target();
1356 guarantee(callee != NULL && callee->is_method(), "bad handshake");
1357 thread->set_vm_result_2(callee);
1358 thread->set_callee_target(NULL);
1359 return callee->get_c2i_entry();
1360 }
1362 // Must be compiled to compiled path which is safe to stackwalk
1363 methodHandle callee_method;
1364 JRT_BLOCK
1365 // Force resolving of caller (if we called from compiled frame)
1366 callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL);
1367 thread->set_vm_result_2(callee_method());
1368 JRT_BLOCK_END
1369 // return compiled code entry point after potential safepoints
1370 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1371 return callee_method->verified_code_entry();
1372 JRT_END
1374 // Handle abstract method call
1375 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_abstract(JavaThread* thread))
1376 return StubRoutines::throw_AbstractMethodError_entry();
1377 JRT_END
1380 // resolve a static call and patch code
1381 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread ))
1382 methodHandle callee_method;
1383 JRT_BLOCK
1384 callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL);
1385 thread->set_vm_result_2(callee_method());
1386 JRT_BLOCK_END
1387 // return compiled code entry point after potential safepoints
1388 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1389 return callee_method->verified_code_entry();
1390 JRT_END
1393 // resolve virtual call and update inline cache to monomorphic
1394 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread ))
1395 methodHandle callee_method;
1396 JRT_BLOCK
1397 callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL);
1398 thread->set_vm_result_2(callee_method());
1399 JRT_BLOCK_END
1400 // return compiled code entry point after potential safepoints
1401 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1402 return callee_method->verified_code_entry();
1403 JRT_END
1406 // Resolve a virtual call that can be statically bound (e.g., always
1407 // monomorphic, so it has no inline cache). Patch code to resolved target.
1408 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread))
1409 methodHandle callee_method;
1410 JRT_BLOCK
1411 callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL);
1412 thread->set_vm_result_2(callee_method());
1413 JRT_BLOCK_END
1414 // return compiled code entry point after potential safepoints
1415 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1416 return callee_method->verified_code_entry();
1417 JRT_END
1423 methodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) {
1424 ResourceMark rm(thread);
1425 CallInfo call_info;
1426 Bytecodes::Code bc;
1428 // receiver is NULL for static calls. An exception is thrown for NULL
1429 // receivers for non-static calls
1430 Handle receiver = find_callee_info(thread, bc, call_info,
1431 CHECK_(methodHandle()));
1432 // Compiler1 can produce virtual call sites that can actually be statically bound
1433 // If we fell thru to below we would think that the site was going megamorphic
1434 // when in fact the site can never miss. Worse because we'd think it was megamorphic
1435 // we'd try and do a vtable dispatch however methods that can be statically bound
1436 // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a
1437 // reresolution of the call site (as if we did a handle_wrong_method and not an
1438 // plain ic_miss) and the site will be converted to an optimized virtual call site
1439 // never to miss again. I don't believe C2 will produce code like this but if it
1440 // did this would still be the correct thing to do for it too, hence no ifdef.
1441 //
1442 if (call_info.resolved_method()->can_be_statically_bound()) {
1443 methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle()));
1444 if (TraceCallFixup) {
1445 RegisterMap reg_map(thread, false);
1446 frame caller_frame = thread->last_frame().sender(®_map);
1447 ResourceMark rm(thread);
1448 tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc));
1449 callee_method->print_short_name(tty);
1450 tty->print_cr(" from pc: " INTPTR_FORMAT, caller_frame.pc());
1451 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1452 }
1453 return callee_method;
1454 }
1456 methodHandle callee_method = call_info.selected_method();
1458 bool should_be_mono = false;
1460 #ifndef PRODUCT
1461 Atomic::inc(&_ic_miss_ctr);
1463 // Statistics & Tracing
1464 if (TraceCallFixup) {
1465 ResourceMark rm(thread);
1466 tty->print("IC miss (%s) call to", Bytecodes::name(bc));
1467 callee_method->print_short_name(tty);
1468 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1469 }
1471 if (ICMissHistogram) {
1472 MutexLocker m(VMStatistic_lock);
1473 RegisterMap reg_map(thread, false);
1474 frame f = thread->last_frame().real_sender(®_map);// skip runtime stub
1475 // produce statistics under the lock
1476 trace_ic_miss(f.pc());
1477 }
1478 #endif
1480 // install an event collector so that when a vtable stub is created the
1481 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The
1482 // event can't be posted when the stub is created as locks are held
1483 // - instead the event will be deferred until the event collector goes
1484 // out of scope.
1485 JvmtiDynamicCodeEventCollector event_collector;
1487 // Update inline cache to megamorphic. Skip update if we are called from interpreted.
1488 { MutexLocker ml_patch (CompiledIC_lock);
1489 RegisterMap reg_map(thread, false);
1490 frame caller_frame = thread->last_frame().sender(®_map);
1491 CodeBlob* cb = caller_frame.cb();
1492 if (cb->is_nmethod()) {
1493 CompiledIC* inline_cache = CompiledIC_before(((nmethod*)cb), caller_frame.pc());
1494 bool should_be_mono = false;
1495 if (inline_cache->is_optimized()) {
1496 if (TraceCallFixup) {
1497 ResourceMark rm(thread);
1498 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc));
1499 callee_method->print_short_name(tty);
1500 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1501 }
1502 should_be_mono = true;
1503 } else if (inline_cache->is_icholder_call()) {
1504 CompiledICHolder* ic_oop = inline_cache->cached_icholder();
1505 if ( ic_oop != NULL) {
1507 if (receiver()->klass() == ic_oop->holder_klass()) {
1508 // This isn't a real miss. We must have seen that compiled code
1509 // is now available and we want the call site converted to a
1510 // monomorphic compiled call site.
1511 // We can't assert for callee_method->code() != NULL because it
1512 // could have been deoptimized in the meantime
1513 if (TraceCallFixup) {
1514 ResourceMark rm(thread);
1515 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc));
1516 callee_method->print_short_name(tty);
1517 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1518 }
1519 should_be_mono = true;
1520 }
1521 }
1522 }
1524 if (should_be_mono) {
1526 // We have a path that was monomorphic but was going interpreted
1527 // and now we have (or had) a compiled entry. We correct the IC
1528 // by using a new icBuffer.
1529 CompiledICInfo info;
1530 KlassHandle receiver_klass(THREAD, receiver()->klass());
1531 inline_cache->compute_monomorphic_entry(callee_method,
1532 receiver_klass,
1533 inline_cache->is_optimized(),
1534 false,
1535 info, CHECK_(methodHandle()));
1536 inline_cache->set_to_monomorphic(info);
1537 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) {
1538 // Potential change to megamorphic
1539 bool successful = inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle()));
1540 if (!successful) {
1541 inline_cache->set_to_clean();
1542 }
1543 } else {
1544 // Either clean or megamorphic
1545 }
1546 }
1547 } // Release CompiledIC_lock
1549 return callee_method;
1550 }
1552 //
1553 // Resets a call-site in compiled code so it will get resolved again.
1554 // This routines handles both virtual call sites, optimized virtual call
1555 // sites, and static call sites. Typically used to change a call sites
1556 // destination from compiled to interpreted.
1557 //
1558 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) {
1559 ResourceMark rm(thread);
1560 RegisterMap reg_map(thread, false);
1561 frame stub_frame = thread->last_frame();
1562 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1563 frame caller = stub_frame.sender(®_map);
1565 // Do nothing if the frame isn't a live compiled frame.
1566 // nmethod could be deoptimized by the time we get here
1567 // so no update to the caller is needed.
1569 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) {
1571 address pc = caller.pc();
1573 // Default call_addr is the location of the "basic" call.
1574 // Determine the address of the call we a reresolving. With
1575 // Inline Caches we will always find a recognizable call.
1576 // With Inline Caches disabled we may or may not find a
1577 // recognizable call. We will always find a call for static
1578 // calls and for optimized virtual calls. For vanilla virtual
1579 // calls it depends on the state of the UseInlineCaches switch.
1580 //
1581 // With Inline Caches disabled we can get here for a virtual call
1582 // for two reasons:
1583 // 1 - calling an abstract method. The vtable for abstract methods
1584 // will run us thru handle_wrong_method and we will eventually
1585 // end up in the interpreter to throw the ame.
1586 // 2 - a racing deoptimization. We could be doing a vanilla vtable
1587 // call and between the time we fetch the entry address and
1588 // we jump to it the target gets deoptimized. Similar to 1
1589 // we will wind up in the interprter (thru a c2i with c2).
1590 //
1591 address call_addr = NULL;
1592 {
1593 // Get call instruction under lock because another thread may be
1594 // busy patching it.
1595 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1596 // Location of call instruction
1597 if (NativeCall::is_call_before(pc)) {
1598 NativeCall *ncall = nativeCall_before(pc);
1599 call_addr = ncall->instruction_address();
1600 }
1601 }
1603 // Check for static or virtual call
1604 bool is_static_call = false;
1605 nmethod* caller_nm = CodeCache::find_nmethod(pc);
1606 // Make sure nmethod doesn't get deoptimized and removed until
1607 // this is done with it.
1608 // CLEANUP - with lazy deopt shouldn't need this lock
1609 nmethodLocker nmlock(caller_nm);
1611 if (call_addr != NULL) {
1612 RelocIterator iter(caller_nm, call_addr, call_addr+1);
1613 int ret = iter.next(); // Get item
1614 if (ret) {
1615 assert(iter.addr() == call_addr, "must find call");
1616 if (iter.type() == relocInfo::static_call_type) {
1617 is_static_call = true;
1618 } else {
1619 assert(iter.type() == relocInfo::virtual_call_type ||
1620 iter.type() == relocInfo::opt_virtual_call_type
1621 , "unexpected relocInfo. type");
1622 }
1623 } else {
1624 assert(!UseInlineCaches, "relocation info. must exist for this address");
1625 }
1627 // Cleaning the inline cache will force a new resolve. This is more robust
1628 // than directly setting it to the new destination, since resolving of calls
1629 // is always done through the same code path. (experience shows that it
1630 // leads to very hard to track down bugs, if an inline cache gets updated
1631 // to a wrong method). It should not be performance critical, since the
1632 // resolve is only done once.
1634 MutexLocker ml(CompiledIC_lock);
1635 if (is_static_call) {
1636 CompiledStaticCall* ssc= compiledStaticCall_at(call_addr);
1637 ssc->set_to_clean();
1638 } else {
1639 // compiled, dispatched call (which used to call an interpreted method)
1640 CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr);
1641 inline_cache->set_to_clean();
1642 }
1643 }
1645 }
1647 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle()));
1650 #ifndef PRODUCT
1651 Atomic::inc(&_wrong_method_ctr);
1653 if (TraceCallFixup) {
1654 ResourceMark rm(thread);
1655 tty->print("handle_wrong_method reresolving call to");
1656 callee_method->print_short_name(tty);
1657 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1658 }
1659 #endif
1661 return callee_method;
1662 }
1664 #ifdef ASSERT
1665 void SharedRuntime::check_member_name_argument_is_last_argument(methodHandle method,
1666 const BasicType* sig_bt,
1667 const VMRegPair* regs) {
1668 ResourceMark rm;
1669 const int total_args_passed = method->size_of_parameters();
1670 const VMRegPair* regs_with_member_name = regs;
1671 VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1);
1673 const int member_arg_pos = total_args_passed - 1;
1674 assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob");
1675 assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object");
1677 const bool is_outgoing = method->is_method_handle_intrinsic();
1678 int comp_args_on_stack = java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1, is_outgoing);
1680 for (int i = 0; i < member_arg_pos; i++) {
1681 VMReg a = regs_with_member_name[i].first();
1682 VMReg b = regs_without_member_name[i].first();
1683 assert(a->value() == b->value(), err_msg_res("register allocation mismatch: a=%d, b=%d", a->value(), b->value()));
1684 }
1685 assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg");
1686 }
1687 #endif
1689 // ---------------------------------------------------------------------------
1690 // We are calling the interpreter via a c2i. Normally this would mean that
1691 // we were called by a compiled method. However we could have lost a race
1692 // where we went int -> i2c -> c2i and so the caller could in fact be
1693 // interpreted. If the caller is compiled we attempt to patch the caller
1694 // so he no longer calls into the interpreter.
1695 IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc))
1696 Method* moop(method);
1698 address entry_point = moop->from_compiled_entry();
1700 // It's possible that deoptimization can occur at a call site which hasn't
1701 // been resolved yet, in which case this function will be called from
1702 // an nmethod that has been patched for deopt and we can ignore the
1703 // request for a fixup.
1704 // Also it is possible that we lost a race in that from_compiled_entry
1705 // is now back to the i2c in that case we don't need to patch and if
1706 // we did we'd leap into space because the callsite needs to use
1707 // "to interpreter" stub in order to load up the Method*. Don't
1708 // ask me how I know this...
1710 CodeBlob* cb = CodeCache::find_blob(caller_pc);
1711 if (!cb->is_nmethod() || entry_point == moop->get_c2i_entry()) {
1712 return;
1713 }
1715 // The check above makes sure this is a nmethod.
1716 nmethod* nm = cb->as_nmethod_or_null();
1717 assert(nm, "must be");
1719 // Get the return PC for the passed caller PC.
1720 address return_pc = caller_pc + frame::pc_return_offset;
1722 // There is a benign race here. We could be attempting to patch to a compiled
1723 // entry point at the same time the callee is being deoptimized. If that is
1724 // the case then entry_point may in fact point to a c2i and we'd patch the
1725 // call site with the same old data. clear_code will set code() to NULL
1726 // at the end of it. If we happen to see that NULL then we can skip trying
1727 // to patch. If we hit the window where the callee has a c2i in the
1728 // from_compiled_entry and the NULL isn't present yet then we lose the race
1729 // and patch the code with the same old data. Asi es la vida.
1731 if (moop->code() == NULL) return;
1733 if (nm->is_in_use()) {
1735 // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1736 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1737 if (NativeCall::is_call_before(return_pc)) {
1738 NativeCall *call = nativeCall_before(return_pc);
1739 //
1740 // bug 6281185. We might get here after resolving a call site to a vanilla
1741 // virtual call. Because the resolvee uses the verified entry it may then
1742 // see compiled code and attempt to patch the site by calling us. This would
1743 // then incorrectly convert the call site to optimized and its downhill from
1744 // there. If you're lucky you'll get the assert in the bugid, if not you've
1745 // just made a call site that could be megamorphic into a monomorphic site
1746 // for the rest of its life! Just another racing bug in the life of
1747 // fixup_callers_callsite ...
1748 //
1749 RelocIterator iter(nm, call->instruction_address(), call->next_instruction_address());
1750 iter.next();
1751 assert(iter.has_current(), "must have a reloc at java call site");
1752 relocInfo::relocType typ = iter.reloc()->type();
1753 if ( typ != relocInfo::static_call_type &&
1754 typ != relocInfo::opt_virtual_call_type &&
1755 typ != relocInfo::static_stub_type) {
1756 return;
1757 }
1758 address destination = call->destination();
1759 if (destination != entry_point) {
1760 CodeBlob* callee = CodeCache::find_blob(destination);
1761 // callee == cb seems weird. It means calling interpreter thru stub.
1762 if (callee == cb || callee->is_adapter_blob()) {
1763 // static call or optimized virtual
1764 if (TraceCallFixup) {
1765 tty->print("fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1766 moop->print_short_name(tty);
1767 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1768 }
1769 call->set_destination_mt_safe(entry_point);
1770 } else {
1771 if (TraceCallFixup) {
1772 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1773 moop->print_short_name(tty);
1774 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1775 }
1776 // assert is too strong could also be resolve destinations.
1777 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be");
1778 }
1779 } else {
1780 if (TraceCallFixup) {
1781 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1782 moop->print_short_name(tty);
1783 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1784 }
1785 }
1786 }
1787 }
1788 IRT_END
1791 // same as JVM_Arraycopy, but called directly from compiled code
1792 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos,
1793 oopDesc* dest, jint dest_pos,
1794 jint length,
1795 JavaThread* thread)) {
1796 #ifndef PRODUCT
1797 _slow_array_copy_ctr++;
1798 #endif
1799 // Check if we have null pointers
1800 if (src == NULL || dest == NULL) {
1801 THROW(vmSymbols::java_lang_NullPointerException());
1802 }
1803 // Do the copy. The casts to arrayOop are necessary to the copy_array API,
1804 // even though the copy_array API also performs dynamic checks to ensure
1805 // that src and dest are truly arrays (and are conformable).
1806 // The copy_array mechanism is awkward and could be removed, but
1807 // the compilers don't call this function except as a last resort,
1808 // so it probably doesn't matter.
1809 src->klass()->copy_array((arrayOopDesc*)src, src_pos,
1810 (arrayOopDesc*)dest, dest_pos,
1811 length, thread);
1812 }
1813 JRT_END
1815 char* SharedRuntime::generate_class_cast_message(
1816 JavaThread* thread, const char* objName) {
1818 // Get target class name from the checkcast instruction
1819 vframeStream vfst(thread, true);
1820 assert(!vfst.at_end(), "Java frame must exist");
1821 Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci()));
1822 Klass* targetKlass = vfst.method()->constants()->klass_at(
1823 cc.index(), thread);
1824 return generate_class_cast_message(objName, targetKlass->external_name());
1825 }
1827 char* SharedRuntime::generate_class_cast_message(
1828 const char* objName, const char* targetKlassName, const char* desc) {
1829 size_t msglen = strlen(objName) + strlen(desc) + strlen(targetKlassName) + 1;
1831 char* message = NEW_RESOURCE_ARRAY(char, msglen);
1832 if (NULL == message) {
1833 // Shouldn't happen, but don't cause even more problems if it does
1834 message = const_cast<char*>(objName);
1835 } else {
1836 jio_snprintf(message, msglen, "%s%s%s", objName, desc, targetKlassName);
1837 }
1838 return message;
1839 }
1841 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
1842 (void) JavaThread::current()->reguard_stack();
1843 JRT_END
1846 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
1847 #ifndef PRODUCT
1848 int SharedRuntime::_monitor_enter_ctr=0;
1849 #endif
1850 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
1851 oop obj(_obj);
1852 #ifndef PRODUCT
1853 _monitor_enter_ctr++; // monitor enter slow
1854 #endif
1855 if (PrintBiasedLockingStatistics) {
1856 Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
1857 }
1858 Handle h_obj(THREAD, obj);
1859 if (UseBiasedLocking) {
1860 // Retry fast entry if bias is revoked to avoid unnecessary inflation
1861 ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK);
1862 } else {
1863 ObjectSynchronizer::slow_enter(h_obj, lock, CHECK);
1864 }
1865 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
1866 JRT_END
1868 #ifndef PRODUCT
1869 int SharedRuntime::_monitor_exit_ctr=0;
1870 #endif
1871 // Handles the uncommon cases of monitor unlocking in compiled code
1872 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock))
1873 oop obj(_obj);
1874 #ifndef PRODUCT
1875 _monitor_exit_ctr++; // monitor exit slow
1876 #endif
1877 Thread* THREAD = JavaThread::current();
1878 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore
1879 // testing was unable to ever fire the assert that guarded it so I have removed it.
1880 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?");
1881 #undef MIGHT_HAVE_PENDING
1882 #ifdef MIGHT_HAVE_PENDING
1883 // Save and restore any pending_exception around the exception mark.
1884 // While the slow_exit must not throw an exception, we could come into
1885 // this routine with one set.
1886 oop pending_excep = NULL;
1887 const char* pending_file;
1888 int pending_line;
1889 if (HAS_PENDING_EXCEPTION) {
1890 pending_excep = PENDING_EXCEPTION;
1891 pending_file = THREAD->exception_file();
1892 pending_line = THREAD->exception_line();
1893 CLEAR_PENDING_EXCEPTION;
1894 }
1895 #endif /* MIGHT_HAVE_PENDING */
1897 {
1898 // Exit must be non-blocking, and therefore no exceptions can be thrown.
1899 EXCEPTION_MARK;
1900 ObjectSynchronizer::slow_exit(obj, lock, THREAD);
1901 }
1903 #ifdef MIGHT_HAVE_PENDING
1904 if (pending_excep != NULL) {
1905 THREAD->set_pending_exception(pending_excep, pending_file, pending_line);
1906 }
1907 #endif /* MIGHT_HAVE_PENDING */
1908 JRT_END
1910 #ifndef PRODUCT
1912 void SharedRuntime::print_statistics() {
1913 ttyLocker ttyl;
1914 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'");
1916 if (_monitor_enter_ctr ) tty->print_cr("%5d monitor enter slow", _monitor_enter_ctr);
1917 if (_monitor_exit_ctr ) tty->print_cr("%5d monitor exit slow", _monitor_exit_ctr);
1918 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr);
1920 SharedRuntime::print_ic_miss_histogram();
1922 if (CountRemovableExceptions) {
1923 if (_nof_removable_exceptions > 0) {
1924 Unimplemented(); // this counter is not yet incremented
1925 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions);
1926 }
1927 }
1929 // Dump the JRT_ENTRY counters
1930 if( _new_instance_ctr ) tty->print_cr("%5d new instance requires GC", _new_instance_ctr);
1931 if( _new_array_ctr ) tty->print_cr("%5d new array requires GC", _new_array_ctr);
1932 if( _multi1_ctr ) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr);
1933 if( _multi2_ctr ) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr);
1934 if( _multi3_ctr ) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr);
1935 if( _multi4_ctr ) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr);
1936 if( _multi5_ctr ) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr);
1938 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr );
1939 tty->print_cr("%5d wrong method", _wrong_method_ctr );
1940 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr );
1941 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr );
1942 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr );
1944 if( _mon_enter_stub_ctr ) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr );
1945 if( _mon_exit_stub_ctr ) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr );
1946 if( _mon_enter_ctr ) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr );
1947 if( _mon_exit_ctr ) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr );
1948 if( _partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr );
1949 if( _jbyte_array_copy_ctr ) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr );
1950 if( _jshort_array_copy_ctr ) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr );
1951 if( _jint_array_copy_ctr ) tty->print_cr("%5d int array copies", _jint_array_copy_ctr );
1952 if( _jlong_array_copy_ctr ) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr );
1953 if( _oop_array_copy_ctr ) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr );
1954 if( _checkcast_array_copy_ctr ) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr );
1955 if( _unsafe_array_copy_ctr ) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr );
1956 if( _generic_array_copy_ctr ) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr );
1957 if( _slow_array_copy_ctr ) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr );
1958 if( _find_handler_ctr ) tty->print_cr("%5d find exception handler", _find_handler_ctr );
1959 if( _rethrow_ctr ) tty->print_cr("%5d rethrow handler", _rethrow_ctr );
1961 AdapterHandlerLibrary::print_statistics();
1963 if (xtty != NULL) xtty->tail("statistics");
1964 }
1966 inline double percent(int x, int y) {
1967 return 100.0 * x / MAX2(y, 1);
1968 }
1970 class MethodArityHistogram {
1971 public:
1972 enum { MAX_ARITY = 256 };
1973 private:
1974 static int _arity_histogram[MAX_ARITY]; // histogram of #args
1975 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words
1976 static int _max_arity; // max. arity seen
1977 static int _max_size; // max. arg size seen
1979 static void add_method_to_histogram(nmethod* nm) {
1980 Method* m = nm->method();
1981 ArgumentCount args(m->signature());
1982 int arity = args.size() + (m->is_static() ? 0 : 1);
1983 int argsize = m->size_of_parameters();
1984 arity = MIN2(arity, MAX_ARITY-1);
1985 argsize = MIN2(argsize, MAX_ARITY-1);
1986 int count = nm->method()->compiled_invocation_count();
1987 _arity_histogram[arity] += count;
1988 _size_histogram[argsize] += count;
1989 _max_arity = MAX2(_max_arity, arity);
1990 _max_size = MAX2(_max_size, argsize);
1991 }
1993 void print_histogram_helper(int n, int* histo, const char* name) {
1994 const int N = MIN2(5, n);
1995 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
1996 double sum = 0;
1997 double weighted_sum = 0;
1998 int i;
1999 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; }
2000 double rest = sum;
2001 double percent = sum / 100;
2002 for (i = 0; i <= N; i++) {
2003 rest -= histo[i];
2004 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent);
2005 }
2006 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent);
2007 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
2008 }
2010 void print_histogram() {
2011 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2012 print_histogram_helper(_max_arity, _arity_histogram, "arity");
2013 tty->print_cr("\nSame for parameter size (in words):");
2014 print_histogram_helper(_max_size, _size_histogram, "size");
2015 tty->cr();
2016 }
2018 public:
2019 MethodArityHistogram() {
2020 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2021 _max_arity = _max_size = 0;
2022 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram [i] = 0;
2023 CodeCache::nmethods_do(add_method_to_histogram);
2024 print_histogram();
2025 }
2026 };
2028 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
2029 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
2030 int MethodArityHistogram::_max_arity;
2031 int MethodArityHistogram::_max_size;
2033 void SharedRuntime::print_call_statistics(int comp_total) {
2034 tty->print_cr("Calls from compiled code:");
2035 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
2036 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls;
2037 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls;
2038 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total));
2039 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total));
2040 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
2041 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls));
2042 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls));
2043 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
2044 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total));
2045 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
2046 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls));
2047 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls));
2048 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls));
2049 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
2050 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
2051 tty->cr();
2052 tty->print_cr("Note 1: counter updates are not MT-safe.");
2053 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
2054 tty->print_cr(" %% in nested categories are relative to their category");
2055 tty->print_cr(" (and thus add up to more than 100%% with inlining)");
2056 tty->cr();
2058 MethodArityHistogram h;
2059 }
2060 #endif
2063 // A simple wrapper class around the calling convention information
2064 // that allows sharing of adapters for the same calling convention.
2065 class AdapterFingerPrint : public CHeapObj<mtCode> {
2066 private:
2067 enum {
2068 _basic_type_bits = 4,
2069 _basic_type_mask = right_n_bits(_basic_type_bits),
2070 _basic_types_per_int = BitsPerInt / _basic_type_bits,
2071 _compact_int_count = 3
2072 };
2073 // TO DO: Consider integrating this with a more global scheme for compressing signatures.
2074 // For now, 4 bits per components (plus T_VOID gaps after double/long) is not excessive.
2076 union {
2077 int _compact[_compact_int_count];
2078 int* _fingerprint;
2079 } _value;
2080 int _length; // A negative length indicates the fingerprint is in the compact form,
2081 // Otherwise _value._fingerprint is the array.
2083 // Remap BasicTypes that are handled equivalently by the adapters.
2084 // These are correct for the current system but someday it might be
2085 // necessary to make this mapping platform dependent.
2086 static int adapter_encoding(BasicType in) {
2087 switch(in) {
2088 case T_BOOLEAN:
2089 case T_BYTE:
2090 case T_SHORT:
2091 case T_CHAR:
2092 // There are all promoted to T_INT in the calling convention
2093 return T_INT;
2095 case T_OBJECT:
2096 case T_ARRAY:
2097 // In other words, we assume that any register good enough for
2098 // an int or long is good enough for a managed pointer.
2099 #ifdef _LP64
2100 return T_LONG;
2101 #else
2102 return T_INT;
2103 #endif
2105 case T_INT:
2106 case T_LONG:
2107 case T_FLOAT:
2108 case T_DOUBLE:
2109 case T_VOID:
2110 return in;
2112 default:
2113 ShouldNotReachHere();
2114 return T_CONFLICT;
2115 }
2116 }
2118 public:
2119 AdapterFingerPrint(int total_args_passed, BasicType* sig_bt) {
2120 // The fingerprint is based on the BasicType signature encoded
2121 // into an array of ints with eight entries per int.
2122 int* ptr;
2123 int len = (total_args_passed + (_basic_types_per_int-1)) / _basic_types_per_int;
2124 if (len <= _compact_int_count) {
2125 assert(_compact_int_count == 3, "else change next line");
2126 _value._compact[0] = _value._compact[1] = _value._compact[2] = 0;
2127 // Storing the signature encoded as signed chars hits about 98%
2128 // of the time.
2129 _length = -len;
2130 ptr = _value._compact;
2131 } else {
2132 _length = len;
2133 _value._fingerprint = NEW_C_HEAP_ARRAY(int, _length, mtCode);
2134 ptr = _value._fingerprint;
2135 }
2137 // Now pack the BasicTypes with 8 per int
2138 int sig_index = 0;
2139 for (int index = 0; index < len; index++) {
2140 int value = 0;
2141 for (int byte = 0; byte < _basic_types_per_int; byte++) {
2142 int bt = ((sig_index < total_args_passed)
2143 ? adapter_encoding(sig_bt[sig_index++])
2144 : 0);
2145 assert((bt & _basic_type_mask) == bt, "must fit in 4 bits");
2146 value = (value << _basic_type_bits) | bt;
2147 }
2148 ptr[index] = value;
2149 }
2150 }
2152 ~AdapterFingerPrint() {
2153 if (_length > 0) {
2154 FREE_C_HEAP_ARRAY(int, _value._fingerprint, mtCode);
2155 }
2156 }
2158 int value(int index) {
2159 if (_length < 0) {
2160 return _value._compact[index];
2161 }
2162 return _value._fingerprint[index];
2163 }
2164 int length() {
2165 if (_length < 0) return -_length;
2166 return _length;
2167 }
2169 bool is_compact() {
2170 return _length <= 0;
2171 }
2173 unsigned int compute_hash() {
2174 int hash = 0;
2175 for (int i = 0; i < length(); i++) {
2176 int v = value(i);
2177 hash = (hash << 8) ^ v ^ (hash >> 5);
2178 }
2179 return (unsigned int)hash;
2180 }
2182 const char* as_string() {
2183 stringStream st;
2184 st.print("0x");
2185 for (int i = 0; i < length(); i++) {
2186 st.print("%08x", value(i));
2187 }
2188 return st.as_string();
2189 }
2191 bool equals(AdapterFingerPrint* other) {
2192 if (other->_length != _length) {
2193 return false;
2194 }
2195 if (_length < 0) {
2196 assert(_compact_int_count == 3, "else change next line");
2197 return _value._compact[0] == other->_value._compact[0] &&
2198 _value._compact[1] == other->_value._compact[1] &&
2199 _value._compact[2] == other->_value._compact[2];
2200 } else {
2201 for (int i = 0; i < _length; i++) {
2202 if (_value._fingerprint[i] != other->_value._fingerprint[i]) {
2203 return false;
2204 }
2205 }
2206 }
2207 return true;
2208 }
2209 };
2212 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries
2213 class AdapterHandlerTable : public BasicHashtable<mtCode> {
2214 friend class AdapterHandlerTableIterator;
2216 private:
2218 #ifndef PRODUCT
2219 static int _lookups; // number of calls to lookup
2220 static int _buckets; // number of buckets checked
2221 static int _equals; // number of buckets checked with matching hash
2222 static int _hits; // number of successful lookups
2223 static int _compact; // number of equals calls with compact signature
2224 #endif
2226 AdapterHandlerEntry* bucket(int i) {
2227 return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i);
2228 }
2230 public:
2231 AdapterHandlerTable()
2232 : BasicHashtable<mtCode>(293, sizeof(AdapterHandlerEntry)) { }
2234 // Create a new entry suitable for insertion in the table
2235 AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry) {
2236 AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable<mtCode>::new_entry(fingerprint->compute_hash());
2237 entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2238 return entry;
2239 }
2241 // Insert an entry into the table
2242 void add(AdapterHandlerEntry* entry) {
2243 int index = hash_to_index(entry->hash());
2244 add_entry(index, entry);
2245 }
2247 void free_entry(AdapterHandlerEntry* entry) {
2248 entry->deallocate();
2249 BasicHashtable<mtCode>::free_entry(entry);
2250 }
2252 // Find a entry with the same fingerprint if it exists
2253 AdapterHandlerEntry* lookup(int total_args_passed, BasicType* sig_bt) {
2254 NOT_PRODUCT(_lookups++);
2255 AdapterFingerPrint fp(total_args_passed, sig_bt);
2256 unsigned int hash = fp.compute_hash();
2257 int index = hash_to_index(hash);
2258 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2259 NOT_PRODUCT(_buckets++);
2260 if (e->hash() == hash) {
2261 NOT_PRODUCT(_equals++);
2262 if (fp.equals(e->fingerprint())) {
2263 #ifndef PRODUCT
2264 if (fp.is_compact()) _compact++;
2265 _hits++;
2266 #endif
2267 return e;
2268 }
2269 }
2270 }
2271 return NULL;
2272 }
2274 #ifndef PRODUCT
2275 void print_statistics() {
2276 ResourceMark rm;
2277 int longest = 0;
2278 int empty = 0;
2279 int total = 0;
2280 int nonempty = 0;
2281 for (int index = 0; index < table_size(); index++) {
2282 int count = 0;
2283 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2284 count++;
2285 }
2286 if (count != 0) nonempty++;
2287 if (count == 0) empty++;
2288 if (count > longest) longest = count;
2289 total += count;
2290 }
2291 tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f",
2292 empty, longest, total, total / (double)nonempty);
2293 tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d",
2294 _lookups, _buckets, _equals, _hits, _compact);
2295 }
2296 #endif
2297 };
2300 #ifndef PRODUCT
2302 int AdapterHandlerTable::_lookups;
2303 int AdapterHandlerTable::_buckets;
2304 int AdapterHandlerTable::_equals;
2305 int AdapterHandlerTable::_hits;
2306 int AdapterHandlerTable::_compact;
2308 #endif
2310 class AdapterHandlerTableIterator : public StackObj {
2311 private:
2312 AdapterHandlerTable* _table;
2313 int _index;
2314 AdapterHandlerEntry* _current;
2316 void scan() {
2317 while (_index < _table->table_size()) {
2318 AdapterHandlerEntry* a = _table->bucket(_index);
2319 _index++;
2320 if (a != NULL) {
2321 _current = a;
2322 return;
2323 }
2324 }
2325 }
2327 public:
2328 AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) {
2329 scan();
2330 }
2331 bool has_next() {
2332 return _current != NULL;
2333 }
2334 AdapterHandlerEntry* next() {
2335 if (_current != NULL) {
2336 AdapterHandlerEntry* result = _current;
2337 _current = _current->next();
2338 if (_current == NULL) scan();
2339 return result;
2340 } else {
2341 return NULL;
2342 }
2343 }
2344 };
2347 // ---------------------------------------------------------------------------
2348 // Implementation of AdapterHandlerLibrary
2349 AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL;
2350 AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL;
2351 const int AdapterHandlerLibrary_size = 16*K;
2352 BufferBlob* AdapterHandlerLibrary::_buffer = NULL;
2354 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
2355 // Should be called only when AdapterHandlerLibrary_lock is active.
2356 if (_buffer == NULL) // Initialize lazily
2357 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
2358 return _buffer;
2359 }
2361 void AdapterHandlerLibrary::initialize() {
2362 if (_adapters != NULL) return;
2363 _adapters = new AdapterHandlerTable();
2365 // Create a special handler for abstract methods. Abstract methods
2366 // are never compiled so an i2c entry is somewhat meaningless, but
2367 // throw AbstractMethodError just in case.
2368 // Pass wrong_method_abstract for the c2i transitions to return
2369 // AbstractMethodError for invalid invocations.
2370 address wrong_method_abstract = SharedRuntime::get_handle_wrong_method_abstract_stub();
2371 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL),
2372 StubRoutines::throw_AbstractMethodError_entry(),
2373 wrong_method_abstract, wrong_method_abstract);
2374 }
2376 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint,
2377 address i2c_entry,
2378 address c2i_entry,
2379 address c2i_unverified_entry) {
2380 return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2381 }
2383 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(methodHandle method) {
2384 // Use customized signature handler. Need to lock around updates to
2385 // the AdapterHandlerTable (it is not safe for concurrent readers
2386 // and a single writer: this could be fixed if it becomes a
2387 // problem).
2389 // Get the address of the ic_miss handlers before we grab the
2390 // AdapterHandlerLibrary_lock. This fixes bug 6236259 which
2391 // was caused by the initialization of the stubs happening
2392 // while we held the lock and then notifying jvmti while
2393 // holding it. This just forces the initialization to be a little
2394 // earlier.
2395 address ic_miss = SharedRuntime::get_ic_miss_stub();
2396 assert(ic_miss != NULL, "must have handler");
2398 ResourceMark rm;
2400 NOT_PRODUCT(int insts_size);
2401 AdapterBlob* new_adapter = NULL;
2402 AdapterHandlerEntry* entry = NULL;
2403 AdapterFingerPrint* fingerprint = NULL;
2404 {
2405 MutexLocker mu(AdapterHandlerLibrary_lock);
2406 // make sure data structure is initialized
2407 initialize();
2409 if (method->is_abstract()) {
2410 return _abstract_method_handler;
2411 }
2413 // Fill in the signature array, for the calling-convention call.
2414 int total_args_passed = method->size_of_parameters(); // All args on stack
2416 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2417 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2418 int i = 0;
2419 if (!method->is_static()) // Pass in receiver first
2420 sig_bt[i++] = T_OBJECT;
2421 for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) {
2422 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2423 if (ss.type() == T_LONG || ss.type() == T_DOUBLE)
2424 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2425 }
2426 assert(i == total_args_passed, "");
2428 // Lookup method signature's fingerprint
2429 entry = _adapters->lookup(total_args_passed, sig_bt);
2431 #ifdef ASSERT
2432 AdapterHandlerEntry* shared_entry = NULL;
2433 // Start adapter sharing verification only after the VM is booted.
2434 if (VerifyAdapterSharing && (entry != NULL)) {
2435 shared_entry = entry;
2436 entry = NULL;
2437 }
2438 #endif
2440 if (entry != NULL) {
2441 return entry;
2442 }
2444 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
2445 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
2447 // Make a C heap allocated version of the fingerprint to store in the adapter
2448 fingerprint = new AdapterFingerPrint(total_args_passed, sig_bt);
2450 // StubRoutines::code2() is initialized after this function can be called. As a result,
2451 // VerifyAdapterCalls and VerifyAdapterSharing can fail if we re-use code that generated
2452 // prior to StubRoutines::code2() being set. Checks refer to checks generated in an I2C
2453 // stub that ensure that an I2C stub is called from an interpreter frame.
2454 bool contains_all_checks = StubRoutines::code2() != NULL;
2456 // Create I2C & C2I handlers
2457 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2458 if (buf != NULL) {
2459 CodeBuffer buffer(buf);
2460 short buffer_locs[20];
2461 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
2462 sizeof(buffer_locs)/sizeof(relocInfo));
2464 MacroAssembler _masm(&buffer);
2465 entry = SharedRuntime::generate_i2c2i_adapters(&_masm,
2466 total_args_passed,
2467 comp_args_on_stack,
2468 sig_bt,
2469 regs,
2470 fingerprint);
2471 #ifdef ASSERT
2472 if (VerifyAdapterSharing) {
2473 if (shared_entry != NULL) {
2474 assert(shared_entry->compare_code(buf->code_begin(), buffer.insts_size()), "code must match");
2475 // Release the one just created and return the original
2476 _adapters->free_entry(entry);
2477 return shared_entry;
2478 } else {
2479 entry->save_code(buf->code_begin(), buffer.insts_size());
2480 }
2481 }
2482 #endif
2484 new_adapter = AdapterBlob::create(&buffer);
2485 NOT_PRODUCT(insts_size = buffer.insts_size());
2486 }
2487 if (new_adapter == NULL) {
2488 // CodeCache is full, disable compilation
2489 // Ought to log this but compile log is only per compile thread
2490 // and we're some non descript Java thread.
2491 MutexUnlocker mu(AdapterHandlerLibrary_lock);
2492 CompileBroker::handle_full_code_cache();
2493 return NULL; // Out of CodeCache space
2494 }
2495 entry->relocate(new_adapter->content_begin());
2496 #ifndef PRODUCT
2497 // debugging suppport
2498 if (PrintAdapterHandlers || PrintStubCode) {
2499 ttyLocker ttyl;
2500 entry->print_adapter_on(tty);
2501 tty->print_cr("i2c argument handler #%d for: %s %s (%d bytes generated)",
2502 _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"),
2503 method->signature()->as_C_string(), insts_size);
2504 tty->print_cr("c2i argument handler starts at %p",entry->get_c2i_entry());
2505 if (Verbose || PrintStubCode) {
2506 address first_pc = entry->base_address();
2507 if (first_pc != NULL) {
2508 Disassembler::decode(first_pc, first_pc + insts_size);
2509 tty->cr();
2510 }
2511 }
2512 }
2513 #endif
2514 // Add the entry only if the entry contains all required checks (see sharedRuntime_xxx.cpp)
2515 // The checks are inserted only if -XX:+VerifyAdapterCalls is specified.
2516 if (contains_all_checks || !VerifyAdapterCalls) {
2517 _adapters->add(entry);
2518 }
2519 }
2520 // Outside of the lock
2521 if (new_adapter != NULL) {
2522 char blob_id[256];
2523 jio_snprintf(blob_id,
2524 sizeof(blob_id),
2525 "%s(%s)@" PTR_FORMAT,
2526 new_adapter->name(),
2527 fingerprint->as_string(),
2528 new_adapter->content_begin());
2529 Forte::register_stub(blob_id, new_adapter->content_begin(),new_adapter->content_end());
2531 if (JvmtiExport::should_post_dynamic_code_generated()) {
2532 JvmtiExport::post_dynamic_code_generated(blob_id, new_adapter->content_begin(), new_adapter->content_end());
2533 }
2534 }
2535 return entry;
2536 }
2538 address AdapterHandlerEntry::base_address() {
2539 address base = _i2c_entry;
2540 if (base == NULL) base = _c2i_entry;
2541 assert(base <= _c2i_entry || _c2i_entry == NULL, "");
2542 assert(base <= _c2i_unverified_entry || _c2i_unverified_entry == NULL, "");
2543 return base;
2544 }
2546 void AdapterHandlerEntry::relocate(address new_base) {
2547 address old_base = base_address();
2548 assert(old_base != NULL, "");
2549 ptrdiff_t delta = new_base - old_base;
2550 if (_i2c_entry != NULL)
2551 _i2c_entry += delta;
2552 if (_c2i_entry != NULL)
2553 _c2i_entry += delta;
2554 if (_c2i_unverified_entry != NULL)
2555 _c2i_unverified_entry += delta;
2556 assert(base_address() == new_base, "");
2557 }
2560 void AdapterHandlerEntry::deallocate() {
2561 delete _fingerprint;
2562 #ifdef ASSERT
2563 if (_saved_code) FREE_C_HEAP_ARRAY(unsigned char, _saved_code, mtCode);
2564 #endif
2565 }
2568 #ifdef ASSERT
2569 // Capture the code before relocation so that it can be compared
2570 // against other versions. If the code is captured after relocation
2571 // then relative instructions won't be equivalent.
2572 void AdapterHandlerEntry::save_code(unsigned char* buffer, int length) {
2573 _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode);
2574 _saved_code_length = length;
2575 memcpy(_saved_code, buffer, length);
2576 }
2579 bool AdapterHandlerEntry::compare_code(unsigned char* buffer, int length) {
2580 if (length != _saved_code_length) {
2581 return false;
2582 }
2584 return (memcmp(buffer, _saved_code, length) == 0) ? true : false;
2585 }
2586 #endif
2589 /**
2590 * Create a native wrapper for this native method. The wrapper converts the
2591 * Java-compiled calling convention to the native convention, handles
2592 * arguments, and transitions to native. On return from the native we transition
2593 * back to java blocking if a safepoint is in progress.
2594 */
2595 void AdapterHandlerLibrary::create_native_wrapper(methodHandle method) {
2596 ResourceMark rm;
2597 nmethod* nm = NULL;
2599 assert(method->is_native(), "must be native");
2600 assert(method->is_method_handle_intrinsic() ||
2601 method->has_native_function(), "must have something valid to call!");
2603 {
2604 // Perform the work while holding the lock, but perform any printing outside the lock
2605 MutexLocker mu(AdapterHandlerLibrary_lock);
2606 // See if somebody beat us to it
2607 nm = method->code();
2608 if (nm != NULL) {
2609 return;
2610 }
2612 const int compile_id = CompileBroker::assign_compile_id(method, CompileBroker::standard_entry_bci);
2613 assert(compile_id > 0, "Must generate native wrapper");
2616 ResourceMark rm;
2617 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2618 if (buf != NULL) {
2619 CodeBuffer buffer(buf);
2620 double locs_buf[20];
2621 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2622 MacroAssembler _masm(&buffer);
2624 // Fill in the signature array, for the calling-convention call.
2625 const int total_args_passed = method->size_of_parameters();
2627 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2628 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2629 int i=0;
2630 if( !method->is_static() ) // Pass in receiver first
2631 sig_bt[i++] = T_OBJECT;
2632 SignatureStream ss(method->signature());
2633 for( ; !ss.at_return_type(); ss.next()) {
2634 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2635 if( ss.type() == T_LONG || ss.type() == T_DOUBLE )
2636 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2637 }
2638 assert(i == total_args_passed, "");
2639 BasicType ret_type = ss.type();
2641 // Now get the compiled-Java layout as input (or output) arguments.
2642 // NOTE: Stubs for compiled entry points of method handle intrinsics
2643 // are just trampolines so the argument registers must be outgoing ones.
2644 const bool is_outgoing = method->is_method_handle_intrinsic();
2645 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, is_outgoing);
2647 // Generate the compiled-to-native wrapper code
2648 nm = SharedRuntime::generate_native_wrapper(&_masm, method, compile_id, sig_bt, regs, ret_type);
2650 if (nm != NULL) {
2651 method->set_code(method, nm);
2652 }
2653 }
2654 } // Unlock AdapterHandlerLibrary_lock
2657 // Install the generated code.
2658 if (nm != NULL) {
2659 if (PrintCompilation) {
2660 ttyLocker ttyl;
2661 CompileTask::print_compilation(tty, nm, method->is_static() ? "(static)" : "");
2662 }
2663 nm->post_compiled_method_load_event();
2664 } else {
2665 // CodeCache is full, disable compilation
2666 CompileBroker::handle_full_code_cache();
2667 }
2668 }
2670 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::block_for_jni_critical(JavaThread* thread))
2671 assert(thread == JavaThread::current(), "must be");
2672 // The code is about to enter a JNI lazy critical native method and
2673 // _needs_gc is true, so if this thread is already in a critical
2674 // section then just return, otherwise this thread should block
2675 // until needs_gc has been cleared.
2676 if (thread->in_critical()) {
2677 return;
2678 }
2679 // Lock and unlock a critical section to give the system a chance to block
2680 GC_locker::lock_critical(thread);
2681 GC_locker::unlock_critical(thread);
2682 JRT_END
2684 #ifdef HAVE_DTRACE_H
2685 /**
2686 * Create a dtrace nmethod for this method. The wrapper converts the
2687 * Java-compiled calling convention to the native convention, makes a dummy call
2688 * (actually nops for the size of the call instruction, which become a trap if
2689 * probe is enabled), and finally returns to the caller. Since this all looks like a
2690 * leaf, no thread transition is needed.
2691 */
2692 nmethod *AdapterHandlerLibrary::create_dtrace_nmethod(methodHandle method) {
2693 ResourceMark rm;
2694 nmethod* nm = NULL;
2696 if (PrintCompilation) {
2697 ttyLocker ttyl;
2698 tty->print("--- n ");
2699 method->print_short_name(tty);
2700 if (method->is_static()) {
2701 tty->print(" (static)");
2702 }
2703 tty->cr();
2704 }
2706 {
2707 // perform the work while holding the lock, but perform any printing
2708 // outside the lock
2709 MutexLocker mu(AdapterHandlerLibrary_lock);
2710 // See if somebody beat us to it
2711 nm = method->code();
2712 if (nm) {
2713 return nm;
2714 }
2716 ResourceMark rm;
2718 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2719 if (buf != NULL) {
2720 CodeBuffer buffer(buf);
2721 // Need a few relocation entries
2722 double locs_buf[20];
2723 buffer.insts()->initialize_shared_locs(
2724 (relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2725 MacroAssembler _masm(&buffer);
2727 // Generate the compiled-to-native wrapper code
2728 nm = SharedRuntime::generate_dtrace_nmethod(&_masm, method);
2729 }
2730 }
2731 return nm;
2732 }
2734 // the dtrace method needs to convert java lang string to utf8 string.
2735 void SharedRuntime::get_utf(oopDesc* src, address dst) {
2736 typeArrayOop jlsValue = java_lang_String::value(src);
2737 int jlsOffset = java_lang_String::offset(src);
2738 int jlsLen = java_lang_String::length(src);
2739 jchar* jlsPos = (jlsLen == 0) ? NULL :
2740 jlsValue->char_at_addr(jlsOffset);
2741 assert(TypeArrayKlass::cast(jlsValue->klass())->element_type() == T_CHAR, "compressed string");
2742 (void) UNICODE::as_utf8(jlsPos, jlsLen, (char *)dst, max_dtrace_string_size);
2743 }
2744 #endif // ndef HAVE_DTRACE_H
2746 int SharedRuntime::convert_ints_to_longints_argcnt(int in_args_count, BasicType* in_sig_bt) {
2747 int argcnt = in_args_count;
2748 if (CCallingConventionRequiresIntsAsLongs) {
2749 for (int in = 0; in < in_args_count; in++) {
2750 BasicType bt = in_sig_bt[in];
2751 switch (bt) {
2752 case T_BOOLEAN:
2753 case T_CHAR:
2754 case T_BYTE:
2755 case T_SHORT:
2756 case T_INT:
2757 argcnt++;
2758 break;
2759 default:
2760 break;
2761 }
2762 }
2763 } else {
2764 assert(0, "This should not be needed on this platform");
2765 }
2767 return argcnt;
2768 }
2770 void SharedRuntime::convert_ints_to_longints(int i2l_argcnt, int& in_args_count,
2771 BasicType*& in_sig_bt, VMRegPair*& in_regs) {
2772 if (CCallingConventionRequiresIntsAsLongs) {
2773 VMRegPair *new_in_regs = NEW_RESOURCE_ARRAY(VMRegPair, i2l_argcnt);
2774 BasicType *new_in_sig_bt = NEW_RESOURCE_ARRAY(BasicType, i2l_argcnt);
2776 int argcnt = 0;
2777 for (int in = 0; in < in_args_count; in++, argcnt++) {
2778 BasicType bt = in_sig_bt[in];
2779 VMRegPair reg = in_regs[in];
2780 switch (bt) {
2781 case T_BOOLEAN:
2782 case T_CHAR:
2783 case T_BYTE:
2784 case T_SHORT:
2785 case T_INT:
2786 // Convert (bt) to (T_LONG,bt).
2787 new_in_sig_bt[argcnt ] = T_LONG;
2788 new_in_sig_bt[argcnt+1] = bt;
2789 assert(reg.first()->is_valid() && !reg.second()->is_valid(), "");
2790 new_in_regs[argcnt ].set2(reg.first());
2791 new_in_regs[argcnt+1].set_bad();
2792 argcnt++;
2793 break;
2794 default:
2795 // No conversion needed.
2796 new_in_sig_bt[argcnt] = bt;
2797 new_in_regs[argcnt] = reg;
2798 break;
2799 }
2800 }
2801 assert(argcnt == i2l_argcnt, "must match");
2803 in_regs = new_in_regs;
2804 in_sig_bt = new_in_sig_bt;
2805 in_args_count = i2l_argcnt;
2806 } else {
2807 assert(0, "This should not be needed on this platform");
2808 }
2809 }
2811 // -------------------------------------------------------------------------
2812 // Java-Java calling convention
2813 // (what you use when Java calls Java)
2815 //------------------------------name_for_receiver----------------------------------
2816 // For a given signature, return the VMReg for parameter 0.
2817 VMReg SharedRuntime::name_for_receiver() {
2818 VMRegPair regs;
2819 BasicType sig_bt = T_OBJECT;
2820 (void) java_calling_convention(&sig_bt, ®s, 1, true);
2821 // Return argument 0 register. In the LP64 build pointers
2822 // take 2 registers, but the VM wants only the 'main' name.
2823 return regs.first();
2824 }
2826 VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) {
2827 // This method is returning a data structure allocating as a
2828 // ResourceObject, so do not put any ResourceMarks in here.
2829 char *s = sig->as_C_string();
2830 int len = (int)strlen(s);
2831 s++; len--; // Skip opening paren
2832 char *t = s+len;
2833 while( *(--t) != ')' ) ; // Find close paren
2835 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, 256 );
2836 VMRegPair *regs = NEW_RESOURCE_ARRAY( VMRegPair, 256 );
2837 int cnt = 0;
2838 if (has_receiver) {
2839 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
2840 }
2842 while( s < t ) {
2843 switch( *s++ ) { // Switch on signature character
2844 case 'B': sig_bt[cnt++] = T_BYTE; break;
2845 case 'C': sig_bt[cnt++] = T_CHAR; break;
2846 case 'D': sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break;
2847 case 'F': sig_bt[cnt++] = T_FLOAT; break;
2848 case 'I': sig_bt[cnt++] = T_INT; break;
2849 case 'J': sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break;
2850 case 'S': sig_bt[cnt++] = T_SHORT; break;
2851 case 'Z': sig_bt[cnt++] = T_BOOLEAN; break;
2852 case 'V': sig_bt[cnt++] = T_VOID; break;
2853 case 'L': // Oop
2854 while( *s++ != ';' ) ; // Skip signature
2855 sig_bt[cnt++] = T_OBJECT;
2856 break;
2857 case '[': { // Array
2858 do { // Skip optional size
2859 while( *s >= '0' && *s <= '9' ) s++;
2860 } while( *s++ == '[' ); // Nested arrays?
2861 // Skip element type
2862 if( s[-1] == 'L' )
2863 while( *s++ != ';' ) ; // Skip signature
2864 sig_bt[cnt++] = T_ARRAY;
2865 break;
2866 }
2867 default : ShouldNotReachHere();
2868 }
2869 }
2871 if (has_appendix) {
2872 sig_bt[cnt++] = T_OBJECT;
2873 }
2875 assert( cnt < 256, "grow table size" );
2877 int comp_args_on_stack;
2878 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true);
2880 // the calling convention doesn't count out_preserve_stack_slots so
2881 // we must add that in to get "true" stack offsets.
2883 if (comp_args_on_stack) {
2884 for (int i = 0; i < cnt; i++) {
2885 VMReg reg1 = regs[i].first();
2886 if( reg1->is_stack()) {
2887 // Yuck
2888 reg1 = reg1->bias(out_preserve_stack_slots());
2889 }
2890 VMReg reg2 = regs[i].second();
2891 if( reg2->is_stack()) {
2892 // Yuck
2893 reg2 = reg2->bias(out_preserve_stack_slots());
2894 }
2895 regs[i].set_pair(reg2, reg1);
2896 }
2897 }
2899 // results
2900 *arg_size = cnt;
2901 return regs;
2902 }
2904 // OSR Migration Code
2905 //
2906 // This code is used convert interpreter frames into compiled frames. It is
2907 // called from very start of a compiled OSR nmethod. A temp array is
2908 // allocated to hold the interesting bits of the interpreter frame. All
2909 // active locks are inflated to allow them to move. The displaced headers and
2910 // active interpeter locals are copied into the temp buffer. Then we return
2911 // back to the compiled code. The compiled code then pops the current
2912 // interpreter frame off the stack and pushes a new compiled frame. Then it
2913 // copies the interpreter locals and displaced headers where it wants.
2914 // Finally it calls back to free the temp buffer.
2915 //
2916 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
2918 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) )
2920 //
2921 // This code is dependent on the memory layout of the interpreter local
2922 // array and the monitors. On all of our platforms the layout is identical
2923 // so this code is shared. If some platform lays the their arrays out
2924 // differently then this code could move to platform specific code or
2925 // the code here could be modified to copy items one at a time using
2926 // frame accessor methods and be platform independent.
2928 frame fr = thread->last_frame();
2929 assert( fr.is_interpreted_frame(), "" );
2930 assert( fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks" );
2932 // Figure out how many monitors are active.
2933 int active_monitor_count = 0;
2934 for( BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
2935 kptr < fr.interpreter_frame_monitor_begin();
2936 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
2937 if( kptr->obj() != NULL ) active_monitor_count++;
2938 }
2940 // QQQ we could place number of active monitors in the array so that compiled code
2941 // could double check it.
2943 Method* moop = fr.interpreter_frame_method();
2944 int max_locals = moop->max_locals();
2945 // Allocate temp buffer, 1 word per local & 2 per active monitor
2946 int buf_size_words = max_locals + active_monitor_count*2;
2947 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode);
2949 // Copy the locals. Order is preserved so that loading of longs works.
2950 // Since there's no GC I can copy the oops blindly.
2951 assert( sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
2952 Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
2953 (HeapWord*)&buf[0],
2954 max_locals);
2956 // Inflate locks. Copy the displaced headers. Be careful, there can be holes.
2957 int i = max_locals;
2958 for( BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
2959 kptr2 < fr.interpreter_frame_monitor_begin();
2960 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
2961 if( kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array
2962 BasicLock *lock = kptr2->lock();
2963 // Inflate so the displaced header becomes position-independent
2964 if (lock->displaced_header()->is_unlocked())
2965 ObjectSynchronizer::inflate_helper(kptr2->obj());
2966 // Now the displaced header is free to move
2967 buf[i++] = (intptr_t)lock->displaced_header();
2968 buf[i++] = cast_from_oop<intptr_t>(kptr2->obj());
2969 }
2970 }
2971 assert( i - max_locals == active_monitor_count*2, "found the expected number of monitors" );
2973 return buf;
2974 JRT_END
2976 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
2977 FREE_C_HEAP_ARRAY(intptr_t,buf, mtCode);
2978 JRT_END
2980 bool AdapterHandlerLibrary::contains(CodeBlob* b) {
2981 AdapterHandlerTableIterator iter(_adapters);
2982 while (iter.has_next()) {
2983 AdapterHandlerEntry* a = iter.next();
2984 if ( b == CodeCache::find_blob(a->get_i2c_entry()) ) return true;
2985 }
2986 return false;
2987 }
2989 void AdapterHandlerLibrary::print_handler_on(outputStream* st, CodeBlob* b) {
2990 AdapterHandlerTableIterator iter(_adapters);
2991 while (iter.has_next()) {
2992 AdapterHandlerEntry* a = iter.next();
2993 if (b == CodeCache::find_blob(a->get_i2c_entry())) {
2994 st->print("Adapter for signature: ");
2995 a->print_adapter_on(tty);
2996 return;
2997 }
2998 }
2999 assert(false, "Should have found handler");
3000 }
3002 void AdapterHandlerEntry::print_adapter_on(outputStream* st) const {
3003 st->print_cr("AHE@" INTPTR_FORMAT ": %s i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT,
3004 (intptr_t) this, fingerprint()->as_string(),
3005 get_i2c_entry(), get_c2i_entry(), get_c2i_unverified_entry());
3007 }
3009 #ifndef PRODUCT
3011 void AdapterHandlerLibrary::print_statistics() {
3012 _adapters->print_statistics();
3013 }
3015 #endif /* PRODUCT */