Fri, 11 Apr 2014 20:02:37 +0000
8039904: dtrace/hotspot/Monitors/Monitors001 fails with "assert(s > 0) failed: Bad size calculated"
Summary: Dtrace monitoring uses size before mirror size is set.
Reviewed-by: kamg, hseigel
1 /*
2 * Copyright (c) 1997, 2013, 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 // Shared stub locations
86 RuntimeStub* SharedRuntime::_wrong_method_blob;
87 RuntimeStub* SharedRuntime::_wrong_method_abstract_blob;
88 RuntimeStub* SharedRuntime::_ic_miss_blob;
89 RuntimeStub* SharedRuntime::_resolve_opt_virtual_call_blob;
90 RuntimeStub* SharedRuntime::_resolve_virtual_call_blob;
91 RuntimeStub* SharedRuntime::_resolve_static_call_blob;
93 DeoptimizationBlob* SharedRuntime::_deopt_blob;
94 SafepointBlob* SharedRuntime::_polling_page_vectors_safepoint_handler_blob;
95 SafepointBlob* SharedRuntime::_polling_page_safepoint_handler_blob;
96 SafepointBlob* SharedRuntime::_polling_page_return_handler_blob;
98 #ifdef COMPILER2
99 UncommonTrapBlob* SharedRuntime::_uncommon_trap_blob;
100 #endif // COMPILER2
103 //----------------------------generate_stubs-----------------------------------
104 void SharedRuntime::generate_stubs() {
105 _wrong_method_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method), "wrong_method_stub");
106 _wrong_method_abstract_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_abstract), "wrong_method_abstract_stub");
107 _ic_miss_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_ic_miss), "ic_miss_stub");
108 _resolve_opt_virtual_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_opt_virtual_call_C), "resolve_opt_virtual_call");
109 _resolve_virtual_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_virtual_call_C), "resolve_virtual_call");
110 _resolve_static_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_static_call_C), "resolve_static_call");
112 #ifdef COMPILER2
113 // Vectors are generated only by C2.
114 if (is_wide_vector(MaxVectorSize)) {
115 _polling_page_vectors_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_VECTOR_LOOP);
116 }
117 #endif // COMPILER2
118 _polling_page_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_LOOP);
119 _polling_page_return_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_RETURN);
121 generate_deopt_blob();
123 #ifdef COMPILER2
124 generate_uncommon_trap_blob();
125 #endif // COMPILER2
126 }
128 #include <math.h>
130 #ifndef USDT2
131 HS_DTRACE_PROBE_DECL4(hotspot, object__alloc, Thread*, char*, int, size_t);
132 HS_DTRACE_PROBE_DECL7(hotspot, method__entry, int,
133 char*, int, char*, int, char*, int);
134 HS_DTRACE_PROBE_DECL7(hotspot, method__return, int,
135 char*, int, char*, int, char*, int);
136 #endif /* !USDT2 */
138 // Implementation of SharedRuntime
140 #ifndef PRODUCT
141 // For statistics
142 int SharedRuntime::_ic_miss_ctr = 0;
143 int SharedRuntime::_wrong_method_ctr = 0;
144 int SharedRuntime::_resolve_static_ctr = 0;
145 int SharedRuntime::_resolve_virtual_ctr = 0;
146 int SharedRuntime::_resolve_opt_virtual_ctr = 0;
147 int SharedRuntime::_implicit_null_throws = 0;
148 int SharedRuntime::_implicit_div0_throws = 0;
149 int SharedRuntime::_throw_null_ctr = 0;
151 int SharedRuntime::_nof_normal_calls = 0;
152 int SharedRuntime::_nof_optimized_calls = 0;
153 int SharedRuntime::_nof_inlined_calls = 0;
154 int SharedRuntime::_nof_megamorphic_calls = 0;
155 int SharedRuntime::_nof_static_calls = 0;
156 int SharedRuntime::_nof_inlined_static_calls = 0;
157 int SharedRuntime::_nof_interface_calls = 0;
158 int SharedRuntime::_nof_optimized_interface_calls = 0;
159 int SharedRuntime::_nof_inlined_interface_calls = 0;
160 int SharedRuntime::_nof_megamorphic_interface_calls = 0;
161 int SharedRuntime::_nof_removable_exceptions = 0;
163 int SharedRuntime::_new_instance_ctr=0;
164 int SharedRuntime::_new_array_ctr=0;
165 int SharedRuntime::_multi1_ctr=0;
166 int SharedRuntime::_multi2_ctr=0;
167 int SharedRuntime::_multi3_ctr=0;
168 int SharedRuntime::_multi4_ctr=0;
169 int SharedRuntime::_multi5_ctr=0;
170 int SharedRuntime::_mon_enter_stub_ctr=0;
171 int SharedRuntime::_mon_exit_stub_ctr=0;
172 int SharedRuntime::_mon_enter_ctr=0;
173 int SharedRuntime::_mon_exit_ctr=0;
174 int SharedRuntime::_partial_subtype_ctr=0;
175 int SharedRuntime::_jbyte_array_copy_ctr=0;
176 int SharedRuntime::_jshort_array_copy_ctr=0;
177 int SharedRuntime::_jint_array_copy_ctr=0;
178 int SharedRuntime::_jlong_array_copy_ctr=0;
179 int SharedRuntime::_oop_array_copy_ctr=0;
180 int SharedRuntime::_checkcast_array_copy_ctr=0;
181 int SharedRuntime::_unsafe_array_copy_ctr=0;
182 int SharedRuntime::_generic_array_copy_ctr=0;
183 int SharedRuntime::_slow_array_copy_ctr=0;
184 int SharedRuntime::_find_handler_ctr=0;
185 int SharedRuntime::_rethrow_ctr=0;
187 int SharedRuntime::_ICmiss_index = 0;
188 int SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count];
189 address SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count];
192 void SharedRuntime::trace_ic_miss(address at) {
193 for (int i = 0; i < _ICmiss_index; i++) {
194 if (_ICmiss_at[i] == at) {
195 _ICmiss_count[i]++;
196 return;
197 }
198 }
199 int index = _ICmiss_index++;
200 if (_ICmiss_index >= maxICmiss_count) _ICmiss_index = maxICmiss_count - 1;
201 _ICmiss_at[index] = at;
202 _ICmiss_count[index] = 1;
203 }
205 void SharedRuntime::print_ic_miss_histogram() {
206 if (ICMissHistogram) {
207 tty->print_cr ("IC Miss Histogram:");
208 int tot_misses = 0;
209 for (int i = 0; i < _ICmiss_index; i++) {
210 tty->print_cr(" at: " INTPTR_FORMAT " nof: %d", _ICmiss_at[i], _ICmiss_count[i]);
211 tot_misses += _ICmiss_count[i];
212 }
213 tty->print_cr ("Total IC misses: %7d", tot_misses);
214 }
215 }
216 #endif // PRODUCT
218 #if INCLUDE_ALL_GCS
220 // G1 write-barrier pre: executed before a pointer store.
221 JRT_LEAF(void, SharedRuntime::g1_wb_pre(oopDesc* orig, JavaThread *thread))
222 if (orig == NULL) {
223 assert(false, "should be optimized out");
224 return;
225 }
226 assert(orig->is_oop(true /* ignore mark word */), "Error");
227 // store the original value that was in the field reference
228 thread->satb_mark_queue().enqueue(orig);
229 JRT_END
231 // G1 write-barrier post: executed after a pointer store.
232 JRT_LEAF(void, SharedRuntime::g1_wb_post(void* card_addr, JavaThread* thread))
233 thread->dirty_card_queue().enqueue(card_addr);
234 JRT_END
236 #endif // INCLUDE_ALL_GCS
239 JRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x))
240 return x * y;
241 JRT_END
244 JRT_LEAF(jlong, SharedRuntime::ldiv(jlong y, jlong x))
245 if (x == min_jlong && y == CONST64(-1)) {
246 return x;
247 } else {
248 return x / y;
249 }
250 JRT_END
253 JRT_LEAF(jlong, SharedRuntime::lrem(jlong y, jlong x))
254 if (x == min_jlong && y == CONST64(-1)) {
255 return 0;
256 } else {
257 return x % y;
258 }
259 JRT_END
262 const juint float_sign_mask = 0x7FFFFFFF;
263 const juint float_infinity = 0x7F800000;
264 const julong double_sign_mask = CONST64(0x7FFFFFFFFFFFFFFF);
265 const julong double_infinity = CONST64(0x7FF0000000000000);
267 JRT_LEAF(jfloat, SharedRuntime::frem(jfloat x, jfloat y))
268 #ifdef _WIN64
269 // 64-bit Windows on amd64 returns the wrong values for
270 // infinity operands.
271 union { jfloat f; juint i; } xbits, ybits;
272 xbits.f = x;
273 ybits.f = y;
274 // x Mod Infinity == x unless x is infinity
275 if ( ((xbits.i & float_sign_mask) != float_infinity) &&
276 ((ybits.i & float_sign_mask) == float_infinity) ) {
277 return x;
278 }
279 #endif
280 return ((jfloat)fmod((double)x,(double)y));
281 JRT_END
284 JRT_LEAF(jdouble, SharedRuntime::drem(jdouble x, jdouble y))
285 #ifdef _WIN64
286 union { jdouble d; julong l; } xbits, ybits;
287 xbits.d = x;
288 ybits.d = y;
289 // x Mod Infinity == x unless x is infinity
290 if ( ((xbits.l & double_sign_mask) != double_infinity) &&
291 ((ybits.l & double_sign_mask) == double_infinity) ) {
292 return x;
293 }
294 #endif
295 return ((jdouble)fmod((double)x,(double)y));
296 JRT_END
298 #ifdef __SOFTFP__
299 JRT_LEAF(jfloat, SharedRuntime::fadd(jfloat x, jfloat y))
300 return x + y;
301 JRT_END
303 JRT_LEAF(jfloat, SharedRuntime::fsub(jfloat x, jfloat y))
304 return x - y;
305 JRT_END
307 JRT_LEAF(jfloat, SharedRuntime::fmul(jfloat x, jfloat y))
308 return x * y;
309 JRT_END
311 JRT_LEAF(jfloat, SharedRuntime::fdiv(jfloat x, jfloat y))
312 return x / y;
313 JRT_END
315 JRT_LEAF(jdouble, SharedRuntime::dadd(jdouble x, jdouble y))
316 return x + y;
317 JRT_END
319 JRT_LEAF(jdouble, SharedRuntime::dsub(jdouble x, jdouble y))
320 return x - y;
321 JRT_END
323 JRT_LEAF(jdouble, SharedRuntime::dmul(jdouble x, jdouble y))
324 return x * y;
325 JRT_END
327 JRT_LEAF(jdouble, SharedRuntime::ddiv(jdouble x, jdouble y))
328 return x / y;
329 JRT_END
331 JRT_LEAF(jfloat, SharedRuntime::i2f(jint x))
332 return (jfloat)x;
333 JRT_END
335 JRT_LEAF(jdouble, SharedRuntime::i2d(jint x))
336 return (jdouble)x;
337 JRT_END
339 JRT_LEAF(jdouble, SharedRuntime::f2d(jfloat x))
340 return (jdouble)x;
341 JRT_END
343 JRT_LEAF(int, SharedRuntime::fcmpl(float x, float y))
344 return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan*/
345 JRT_END
347 JRT_LEAF(int, SharedRuntime::fcmpg(float x, float y))
348 return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */
349 JRT_END
351 JRT_LEAF(int, SharedRuntime::dcmpl(double x, double y))
352 return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan */
353 JRT_END
355 JRT_LEAF(int, SharedRuntime::dcmpg(double x, double y))
356 return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */
357 JRT_END
359 // Functions to return the opposite of the aeabi functions for nan.
360 JRT_LEAF(int, SharedRuntime::unordered_fcmplt(float x, float y))
361 return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
362 JRT_END
364 JRT_LEAF(int, SharedRuntime::unordered_dcmplt(double x, double y))
365 return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
366 JRT_END
368 JRT_LEAF(int, SharedRuntime::unordered_fcmple(float x, float y))
369 return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
370 JRT_END
372 JRT_LEAF(int, SharedRuntime::unordered_dcmple(double x, double y))
373 return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
374 JRT_END
376 JRT_LEAF(int, SharedRuntime::unordered_fcmpge(float x, float y))
377 return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
378 JRT_END
380 JRT_LEAF(int, SharedRuntime::unordered_dcmpge(double x, double y))
381 return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
382 JRT_END
384 JRT_LEAF(int, SharedRuntime::unordered_fcmpgt(float x, float y))
385 return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
386 JRT_END
388 JRT_LEAF(int, SharedRuntime::unordered_dcmpgt(double x, double y))
389 return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
390 JRT_END
392 // Intrinsics make gcc generate code for these.
393 float SharedRuntime::fneg(float f) {
394 return -f;
395 }
397 double SharedRuntime::dneg(double f) {
398 return -f;
399 }
401 #endif // __SOFTFP__
403 #if defined(__SOFTFP__) || defined(E500V2)
404 // Intrinsics make gcc generate code for these.
405 double SharedRuntime::dabs(double f) {
406 return (f <= (double)0.0) ? (double)0.0 - f : f;
407 }
409 #endif
411 #if defined(__SOFTFP__) || defined(PPC32)
412 double SharedRuntime::dsqrt(double f) {
413 return sqrt(f);
414 }
415 #endif
417 JRT_LEAF(jint, SharedRuntime::f2i(jfloat x))
418 if (g_isnan(x))
419 return 0;
420 if (x >= (jfloat) max_jint)
421 return max_jint;
422 if (x <= (jfloat) min_jint)
423 return min_jint;
424 return (jint) x;
425 JRT_END
428 JRT_LEAF(jlong, SharedRuntime::f2l(jfloat x))
429 if (g_isnan(x))
430 return 0;
431 if (x >= (jfloat) max_jlong)
432 return max_jlong;
433 if (x <= (jfloat) min_jlong)
434 return min_jlong;
435 return (jlong) x;
436 JRT_END
439 JRT_LEAF(jint, SharedRuntime::d2i(jdouble x))
440 if (g_isnan(x))
441 return 0;
442 if (x >= (jdouble) max_jint)
443 return max_jint;
444 if (x <= (jdouble) min_jint)
445 return min_jint;
446 return (jint) x;
447 JRT_END
450 JRT_LEAF(jlong, SharedRuntime::d2l(jdouble x))
451 if (g_isnan(x))
452 return 0;
453 if (x >= (jdouble) max_jlong)
454 return max_jlong;
455 if (x <= (jdouble) min_jlong)
456 return min_jlong;
457 return (jlong) x;
458 JRT_END
461 JRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x))
462 return (jfloat)x;
463 JRT_END
466 JRT_LEAF(jfloat, SharedRuntime::l2f(jlong x))
467 return (jfloat)x;
468 JRT_END
471 JRT_LEAF(jdouble, SharedRuntime::l2d(jlong x))
472 return (jdouble)x;
473 JRT_END
475 // Exception handling accross interpreter/compiler boundaries
476 //
477 // exception_handler_for_return_address(...) returns the continuation address.
478 // The continuation address is the entry point of the exception handler of the
479 // previous frame depending on the return address.
481 address SharedRuntime::raw_exception_handler_for_return_address(JavaThread* thread, address return_address) {
482 assert(frame::verify_return_pc(return_address), err_msg("must be a return address: " INTPTR_FORMAT, return_address));
484 // Reset method handle flag.
485 thread->set_is_method_handle_return(false);
487 // The fastest case first
488 CodeBlob* blob = CodeCache::find_blob(return_address);
489 nmethod* nm = (blob != NULL) ? blob->as_nmethod_or_null() : NULL;
490 if (nm != NULL) {
491 // Set flag if return address is a method handle call site.
492 thread->set_is_method_handle_return(nm->is_method_handle_return(return_address));
493 // native nmethods don't have exception handlers
494 assert(!nm->is_native_method(), "no exception handler");
495 assert(nm->header_begin() != nm->exception_begin(), "no exception handler");
496 if (nm->is_deopt_pc(return_address)) {
497 // If we come here because of a stack overflow, the stack may be
498 // unguarded. Reguard the stack otherwise if we return to the
499 // deopt blob and the stack bang causes a stack overflow we
500 // crash.
501 bool guard_pages_enabled = thread->stack_yellow_zone_enabled();
502 if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack();
503 assert(guard_pages_enabled, "stack banging in deopt blob may cause crash");
504 return SharedRuntime::deopt_blob()->unpack_with_exception();
505 } else {
506 return nm->exception_begin();
507 }
508 }
510 // Entry code
511 if (StubRoutines::returns_to_call_stub(return_address)) {
512 return StubRoutines::catch_exception_entry();
513 }
514 // Interpreted code
515 if (Interpreter::contains(return_address)) {
516 return Interpreter::rethrow_exception_entry();
517 }
519 guarantee(blob == NULL || !blob->is_runtime_stub(), "caller should have skipped stub");
520 guarantee(!VtableStubs::contains(return_address), "NULL exceptions in vtables should have been handled already!");
522 #ifndef PRODUCT
523 { ResourceMark rm;
524 tty->print_cr("No exception handler found for exception at " INTPTR_FORMAT " - potential problems:", return_address);
525 tty->print_cr("a) exception happened in (new?) code stubs/buffers that is not handled here");
526 tty->print_cr("b) other problem");
527 }
528 #endif // PRODUCT
530 ShouldNotReachHere();
531 return NULL;
532 }
535 JRT_LEAF(address, SharedRuntime::exception_handler_for_return_address(JavaThread* thread, address return_address))
536 return raw_exception_handler_for_return_address(thread, return_address);
537 JRT_END
540 address SharedRuntime::get_poll_stub(address pc) {
541 address stub;
542 // Look up the code blob
543 CodeBlob *cb = CodeCache::find_blob(pc);
545 // Should be an nmethod
546 assert( cb && cb->is_nmethod(), "safepoint polling: pc must refer to an nmethod" );
548 // Look up the relocation information
549 assert( ((nmethod*)cb)->is_at_poll_or_poll_return(pc),
550 "safepoint polling: type must be poll" );
552 assert( ((NativeInstruction*)pc)->is_safepoint_poll(),
553 "Only polling locations are used for safepoint");
555 bool at_poll_return = ((nmethod*)cb)->is_at_poll_return(pc);
556 bool has_wide_vectors = ((nmethod*)cb)->has_wide_vectors();
557 if (at_poll_return) {
558 assert(SharedRuntime::polling_page_return_handler_blob() != NULL,
559 "polling page return stub not created yet");
560 stub = SharedRuntime::polling_page_return_handler_blob()->entry_point();
561 } else if (has_wide_vectors) {
562 assert(SharedRuntime::polling_page_vectors_safepoint_handler_blob() != NULL,
563 "polling page vectors safepoint stub not created yet");
564 stub = SharedRuntime::polling_page_vectors_safepoint_handler_blob()->entry_point();
565 } else {
566 assert(SharedRuntime::polling_page_safepoint_handler_blob() != NULL,
567 "polling page safepoint stub not created yet");
568 stub = SharedRuntime::polling_page_safepoint_handler_blob()->entry_point();
569 }
570 #ifndef PRODUCT
571 if( TraceSafepoint ) {
572 char buf[256];
573 jio_snprintf(buf, sizeof(buf),
574 "... found polling page %s exception at pc = "
575 INTPTR_FORMAT ", stub =" INTPTR_FORMAT,
576 at_poll_return ? "return" : "loop",
577 (intptr_t)pc, (intptr_t)stub);
578 tty->print_raw_cr(buf);
579 }
580 #endif // PRODUCT
581 return stub;
582 }
585 oop SharedRuntime::retrieve_receiver( Symbol* sig, frame caller ) {
586 assert(caller.is_interpreted_frame(), "");
587 int args_size = ArgumentSizeComputer(sig).size() + 1;
588 assert(args_size <= caller.interpreter_frame_expression_stack_size(), "receiver must be on interpreter stack");
589 oop result = cast_to_oop(*caller.interpreter_frame_tos_at(args_size - 1));
590 assert(Universe::heap()->is_in(result) && result->is_oop(), "receiver must be an oop");
591 return result;
592 }
595 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Handle h_exception) {
596 if (JvmtiExport::can_post_on_exceptions()) {
597 vframeStream vfst(thread, true);
598 methodHandle method = methodHandle(thread, vfst.method());
599 address bcp = method()->bcp_from(vfst.bci());
600 JvmtiExport::post_exception_throw(thread, method(), bcp, h_exception());
601 }
602 Exceptions::_throw(thread, __FILE__, __LINE__, h_exception);
603 }
605 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Symbol* name, const char *message) {
606 Handle h_exception = Exceptions::new_exception(thread, name, message);
607 throw_and_post_jvmti_exception(thread, h_exception);
608 }
610 // The interpreter code to call this tracing function is only
611 // called/generated when TraceRedefineClasses has the right bits
612 // set. Since obsolete methods are never compiled, we don't have
613 // to modify the compilers to generate calls to this function.
614 //
615 JRT_LEAF(int, SharedRuntime::rc_trace_method_entry(
616 JavaThread* thread, Method* method))
617 assert(RC_TRACE_IN_RANGE(0x00001000, 0x00002000), "wrong call");
619 if (method->is_obsolete()) {
620 // We are calling an obsolete method, but this is not necessarily
621 // an error. Our method could have been redefined just after we
622 // fetched the Method* from the constant pool.
624 // RC_TRACE macro has an embedded ResourceMark
625 RC_TRACE_WITH_THREAD(0x00001000, thread,
626 ("calling obsolete method '%s'",
627 method->name_and_sig_as_C_string()));
628 if (RC_TRACE_ENABLED(0x00002000)) {
629 // this option is provided to debug calls to obsolete methods
630 guarantee(false, "faulting at call to an obsolete method.");
631 }
632 }
633 return 0;
634 JRT_END
636 // ret_pc points into caller; we are returning caller's exception handler
637 // for given exception
638 address SharedRuntime::compute_compiled_exc_handler(nmethod* nm, address ret_pc, Handle& exception,
639 bool force_unwind, bool top_frame_only) {
640 assert(nm != NULL, "must exist");
641 ResourceMark rm;
643 ScopeDesc* sd = nm->scope_desc_at(ret_pc);
644 // determine handler bci, if any
645 EXCEPTION_MARK;
647 int handler_bci = -1;
648 int scope_depth = 0;
649 if (!force_unwind) {
650 int bci = sd->bci();
651 bool recursive_exception = false;
652 do {
653 bool skip_scope_increment = false;
654 // exception handler lookup
655 KlassHandle ek (THREAD, exception->klass());
656 methodHandle mh(THREAD, sd->method());
657 handler_bci = Method::fast_exception_handler_bci_for(mh, ek, bci, THREAD);
658 if (HAS_PENDING_EXCEPTION) {
659 recursive_exception = true;
660 // We threw an exception while trying to find the exception handler.
661 // Transfer the new exception to the exception handle which will
662 // be set into thread local storage, and do another lookup for an
663 // exception handler for this exception, this time starting at the
664 // BCI of the exception handler which caused the exception to be
665 // thrown (bugs 4307310 and 4546590). Set "exception" reference
666 // argument to ensure that the correct exception is thrown (4870175).
667 exception = Handle(THREAD, PENDING_EXCEPTION);
668 CLEAR_PENDING_EXCEPTION;
669 if (handler_bci >= 0) {
670 bci = handler_bci;
671 handler_bci = -1;
672 skip_scope_increment = true;
673 }
674 }
675 else {
676 recursive_exception = false;
677 }
678 if (!top_frame_only && handler_bci < 0 && !skip_scope_increment) {
679 sd = sd->sender();
680 if (sd != NULL) {
681 bci = sd->bci();
682 }
683 ++scope_depth;
684 }
685 } while (recursive_exception || (!top_frame_only && handler_bci < 0 && sd != NULL));
686 }
688 // found handling method => lookup exception handler
689 int catch_pco = ret_pc - nm->code_begin();
691 ExceptionHandlerTable table(nm);
692 HandlerTableEntry *t = table.entry_for(catch_pco, handler_bci, scope_depth);
693 if (t == NULL && (nm->is_compiled_by_c1() || handler_bci != -1)) {
694 // Allow abbreviated catch tables. The idea is to allow a method
695 // to materialize its exceptions without committing to the exact
696 // routing of exceptions. In particular this is needed for adding
697 // a synthethic handler to unlock monitors when inlining
698 // synchonized methods since the unlock path isn't represented in
699 // the bytecodes.
700 t = table.entry_for(catch_pco, -1, 0);
701 }
703 #ifdef COMPILER1
704 if (t == NULL && nm->is_compiled_by_c1()) {
705 assert(nm->unwind_handler_begin() != NULL, "");
706 return nm->unwind_handler_begin();
707 }
708 #endif
710 if (t == NULL) {
711 tty->print_cr("MISSING EXCEPTION HANDLER for pc " INTPTR_FORMAT " and handler bci %d", ret_pc, handler_bci);
712 tty->print_cr(" Exception:");
713 exception->print();
714 tty->cr();
715 tty->print_cr(" Compiled exception table :");
716 table.print();
717 nm->print_code();
718 guarantee(false, "missing exception handler");
719 return NULL;
720 }
722 return nm->code_begin() + t->pco();
723 }
725 JRT_ENTRY(void, SharedRuntime::throw_AbstractMethodError(JavaThread* thread))
726 // These errors occur only at call sites
727 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_AbstractMethodError());
728 JRT_END
730 JRT_ENTRY(void, SharedRuntime::throw_IncompatibleClassChangeError(JavaThread* thread))
731 // These errors occur only at call sites
732 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError(), "vtable stub");
733 JRT_END
735 JRT_ENTRY(void, SharedRuntime::throw_ArithmeticException(JavaThread* thread))
736 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
737 JRT_END
739 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* thread))
740 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
741 JRT_END
743 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException_at_call(JavaThread* thread))
744 // This entry point is effectively only used for NullPointerExceptions which occur at inline
745 // cache sites (when the callee activation is not yet set up) so we are at a call site
746 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
747 JRT_END
749 JRT_ENTRY(void, SharedRuntime::throw_StackOverflowError(JavaThread* thread))
750 // We avoid using the normal exception construction in this case because
751 // it performs an upcall to Java, and we're already out of stack space.
752 Klass* k = SystemDictionary::StackOverflowError_klass();
753 oop exception_oop = InstanceKlass::cast(k)->allocate_instance(CHECK);
754 Handle exception (thread, exception_oop);
755 if (StackTraceInThrowable) {
756 java_lang_Throwable::fill_in_stack_trace(exception);
757 }
758 throw_and_post_jvmti_exception(thread, exception);
759 JRT_END
761 address SharedRuntime::continuation_for_implicit_exception(JavaThread* thread,
762 address pc,
763 SharedRuntime::ImplicitExceptionKind exception_kind)
764 {
765 address target_pc = NULL;
767 if (Interpreter::contains(pc)) {
768 #ifdef CC_INTERP
769 // C++ interpreter doesn't throw implicit exceptions
770 ShouldNotReachHere();
771 #else
772 switch (exception_kind) {
773 case IMPLICIT_NULL: return Interpreter::throw_NullPointerException_entry();
774 case IMPLICIT_DIVIDE_BY_ZERO: return Interpreter::throw_ArithmeticException_entry();
775 case STACK_OVERFLOW: return Interpreter::throw_StackOverflowError_entry();
776 default: ShouldNotReachHere();
777 }
778 #endif // !CC_INTERP
779 } else {
780 switch (exception_kind) {
781 case STACK_OVERFLOW: {
782 // Stack overflow only occurs upon frame setup; the callee is
783 // going to be unwound. Dispatch to a shared runtime stub
784 // which will cause the StackOverflowError to be fabricated
785 // and processed.
786 // For stack overflow in deoptimization blob, cleanup thread.
787 if (thread->deopt_mark() != NULL) {
788 Deoptimization::cleanup_deopt_info(thread, NULL);
789 }
790 Events::log_exception(thread, "StackOverflowError at " INTPTR_FORMAT, pc);
791 return StubRoutines::throw_StackOverflowError_entry();
792 }
794 case IMPLICIT_NULL: {
795 if (VtableStubs::contains(pc)) {
796 // We haven't yet entered the callee frame. Fabricate an
797 // exception and begin dispatching it in the caller. Since
798 // the caller was at a call site, it's safe to destroy all
799 // caller-saved registers, as these entry points do.
800 VtableStub* vt_stub = VtableStubs::stub_containing(pc);
802 // If vt_stub is NULL, then return NULL to signal handler to report the SEGV error.
803 if (vt_stub == NULL) return NULL;
805 if (vt_stub->is_abstract_method_error(pc)) {
806 assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs");
807 Events::log_exception(thread, "AbstractMethodError at " INTPTR_FORMAT, pc);
808 return StubRoutines::throw_AbstractMethodError_entry();
809 } else {
810 Events::log_exception(thread, "NullPointerException at vtable entry " INTPTR_FORMAT, pc);
811 return StubRoutines::throw_NullPointerException_at_call_entry();
812 }
813 } else {
814 CodeBlob* cb = CodeCache::find_blob(pc);
816 // If code blob is NULL, then return NULL to signal handler to report the SEGV error.
817 if (cb == NULL) return NULL;
819 // Exception happened in CodeCache. Must be either:
820 // 1. Inline-cache check in C2I handler blob,
821 // 2. Inline-cache check in nmethod, or
822 // 3. Implict null exception in nmethod
824 if (!cb->is_nmethod()) {
825 bool is_in_blob = cb->is_adapter_blob() || cb->is_method_handles_adapter_blob();
826 if (!is_in_blob) {
827 cb->print();
828 fatal(err_msg("exception happened outside interpreter, nmethods and vtable stubs at pc " INTPTR_FORMAT, pc));
829 }
830 Events::log_exception(thread, "NullPointerException in code blob at " INTPTR_FORMAT, pc);
831 // There is no handler here, so we will simply unwind.
832 return StubRoutines::throw_NullPointerException_at_call_entry();
833 }
835 // Otherwise, it's an nmethod. Consult its exception handlers.
836 nmethod* nm = (nmethod*)cb;
837 if (nm->inlinecache_check_contains(pc)) {
838 // exception happened inside inline-cache check code
839 // => the nmethod is not yet active (i.e., the frame
840 // is not set up yet) => use return address pushed by
841 // caller => don't push another return address
842 Events::log_exception(thread, "NullPointerException in IC check " INTPTR_FORMAT, pc);
843 return StubRoutines::throw_NullPointerException_at_call_entry();
844 }
846 if (nm->method()->is_method_handle_intrinsic()) {
847 // exception happened inside MH dispatch code, similar to a vtable stub
848 Events::log_exception(thread, "NullPointerException in MH adapter " INTPTR_FORMAT, pc);
849 return StubRoutines::throw_NullPointerException_at_call_entry();
850 }
852 #ifndef PRODUCT
853 _implicit_null_throws++;
854 #endif
855 target_pc = nm->continuation_for_implicit_exception(pc);
856 // If there's an unexpected fault, target_pc might be NULL,
857 // in which case we want to fall through into the normal
858 // error handling code.
859 }
861 break; // fall through
862 }
865 case IMPLICIT_DIVIDE_BY_ZERO: {
866 nmethod* nm = CodeCache::find_nmethod(pc);
867 guarantee(nm != NULL, "must have containing nmethod for implicit division-by-zero exceptions");
868 #ifndef PRODUCT
869 _implicit_div0_throws++;
870 #endif
871 target_pc = nm->continuation_for_implicit_exception(pc);
872 // If there's an unexpected fault, target_pc might be NULL,
873 // in which case we want to fall through into the normal
874 // error handling code.
875 break; // fall through
876 }
878 default: ShouldNotReachHere();
879 }
881 assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind");
883 // for AbortVMOnException flag
884 NOT_PRODUCT(Exceptions::debug_check_abort("java.lang.NullPointerException"));
885 if (exception_kind == IMPLICIT_NULL) {
886 Events::log_exception(thread, "Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
887 } else {
888 Events::log_exception(thread, "Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
889 }
890 return target_pc;
891 }
893 ShouldNotReachHere();
894 return NULL;
895 }
898 /**
899 * Throws an java/lang/UnsatisfiedLinkError. The address of this method is
900 * installed in the native function entry of all native Java methods before
901 * they get linked to their actual native methods.
902 *
903 * \note
904 * This method actually never gets called! The reason is because
905 * the interpreter's native entries call NativeLookup::lookup() which
906 * throws the exception when the lookup fails. The exception is then
907 * caught and forwarded on the return from NativeLookup::lookup() call
908 * before the call to the native function. This might change in the future.
909 */
910 JNI_ENTRY(void*, throw_unsatisfied_link_error(JNIEnv* env, ...))
911 {
912 // We return a bad value here to make sure that the exception is
913 // forwarded before we look at the return value.
914 THROW_(vmSymbols::java_lang_UnsatisfiedLinkError(), (void*)badJNIHandle);
915 }
916 JNI_END
918 address SharedRuntime::native_method_throw_unsatisfied_link_error_entry() {
919 return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error);
920 }
923 #ifndef PRODUCT
924 JRT_ENTRY(intptr_t, SharedRuntime::trace_bytecode(JavaThread* thread, intptr_t preserve_this_value, intptr_t tos, intptr_t tos2))
925 const frame f = thread->last_frame();
926 assert(f.is_interpreted_frame(), "must be an interpreted frame");
927 #ifndef PRODUCT
928 methodHandle mh(THREAD, f.interpreter_frame_method());
929 BytecodeTracer::trace(mh, f.interpreter_frame_bcp(), tos, tos2);
930 #endif // !PRODUCT
931 return preserve_this_value;
932 JRT_END
933 #endif // !PRODUCT
936 JRT_ENTRY(void, SharedRuntime::yield_all(JavaThread* thread, int attempts))
937 os::yield_all(attempts);
938 JRT_END
941 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* thread, oopDesc* obj))
942 assert(obj->is_oop(), "must be a valid oop");
943 assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
944 InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
945 JRT_END
948 jlong SharedRuntime::get_java_tid(Thread* thread) {
949 if (thread != NULL) {
950 if (thread->is_Java_thread()) {
951 oop obj = ((JavaThread*)thread)->threadObj();
952 return (obj == NULL) ? 0 : java_lang_Thread::thread_id(obj);
953 }
954 }
955 return 0;
956 }
958 /**
959 * This function ought to be a void function, but cannot be because
960 * it gets turned into a tail-call on sparc, which runs into dtrace bug
961 * 6254741. Once that is fixed we can remove the dummy return value.
962 */
963 int SharedRuntime::dtrace_object_alloc(oopDesc* o, int size) {
964 return dtrace_object_alloc_base(Thread::current(), o, size);
965 }
967 int SharedRuntime::dtrace_object_alloc_base(Thread* thread, oopDesc* o, int size) {
968 assert(DTraceAllocProbes, "wrong call");
969 Klass* klass = o->klass();
970 Symbol* name = klass->name();
971 #ifndef USDT2
972 HS_DTRACE_PROBE4(hotspot, object__alloc, get_java_tid(thread),
973 name->bytes(), name->utf8_length(), size * HeapWordSize);
974 #else /* USDT2 */
975 HOTSPOT_OBJECT_ALLOC(
976 get_java_tid(thread),
977 (char *) name->bytes(), name->utf8_length(), size * HeapWordSize);
978 #endif /* USDT2 */
979 return 0;
980 }
982 JRT_LEAF(int, SharedRuntime::dtrace_method_entry(
983 JavaThread* thread, Method* method))
984 assert(DTraceMethodProbes, "wrong call");
985 Symbol* kname = method->klass_name();
986 Symbol* name = method->name();
987 Symbol* sig = method->signature();
988 #ifndef USDT2
989 HS_DTRACE_PROBE7(hotspot, method__entry, get_java_tid(thread),
990 kname->bytes(), kname->utf8_length(),
991 name->bytes(), name->utf8_length(),
992 sig->bytes(), sig->utf8_length());
993 #else /* USDT2 */
994 HOTSPOT_METHOD_ENTRY(
995 get_java_tid(thread),
996 (char *) kname->bytes(), kname->utf8_length(),
997 (char *) name->bytes(), name->utf8_length(),
998 (char *) sig->bytes(), sig->utf8_length());
999 #endif /* USDT2 */
1000 return 0;
1001 JRT_END
1003 JRT_LEAF(int, SharedRuntime::dtrace_method_exit(
1004 JavaThread* thread, Method* method))
1005 assert(DTraceMethodProbes, "wrong call");
1006 Symbol* kname = method->klass_name();
1007 Symbol* name = method->name();
1008 Symbol* sig = method->signature();
1009 #ifndef USDT2
1010 HS_DTRACE_PROBE7(hotspot, method__return, get_java_tid(thread),
1011 kname->bytes(), kname->utf8_length(),
1012 name->bytes(), name->utf8_length(),
1013 sig->bytes(), sig->utf8_length());
1014 #else /* USDT2 */
1015 HOTSPOT_METHOD_RETURN(
1016 get_java_tid(thread),
1017 (char *) kname->bytes(), kname->utf8_length(),
1018 (char *) name->bytes(), name->utf8_length(),
1019 (char *) sig->bytes(), sig->utf8_length());
1020 #endif /* USDT2 */
1021 return 0;
1022 JRT_END
1025 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode)
1026 // for a call current in progress, i.e., arguments has been pushed on stack
1027 // put callee has not been invoked yet. Used by: resolve virtual/static,
1028 // vtable updates, etc. Caller frame must be compiled.
1029 Handle SharedRuntime::find_callee_info(JavaThread* thread, Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) {
1030 ResourceMark rm(THREAD);
1032 // last java frame on stack (which includes native call frames)
1033 vframeStream vfst(thread, true); // Do not skip and javaCalls
1035 return find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(Handle()));
1036 }
1039 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode
1040 // for a call current in progress, i.e., arguments has been pushed on stack
1041 // but callee has not been invoked yet. Caller frame must be compiled.
1042 Handle SharedRuntime::find_callee_info_helper(JavaThread* thread,
1043 vframeStream& vfst,
1044 Bytecodes::Code& bc,
1045 CallInfo& callinfo, TRAPS) {
1046 Handle receiver;
1047 Handle nullHandle; //create a handy null handle for exception returns
1049 assert(!vfst.at_end(), "Java frame must exist");
1051 // Find caller and bci from vframe
1052 methodHandle caller(THREAD, vfst.method());
1053 int bci = vfst.bci();
1055 // Find bytecode
1056 Bytecode_invoke bytecode(caller, bci);
1057 bc = bytecode.invoke_code();
1058 int bytecode_index = bytecode.index();
1060 // Find receiver for non-static call
1061 if (bc != Bytecodes::_invokestatic &&
1062 bc != Bytecodes::_invokedynamic &&
1063 bc != Bytecodes::_invokehandle) {
1064 // This register map must be update since we need to find the receiver for
1065 // compiled frames. The receiver might be in a register.
1066 RegisterMap reg_map2(thread);
1067 frame stubFrame = thread->last_frame();
1068 // Caller-frame is a compiled frame
1069 frame callerFrame = stubFrame.sender(®_map2);
1071 methodHandle callee = bytecode.static_target(CHECK_(nullHandle));
1072 if (callee.is_null()) {
1073 THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle);
1074 }
1075 // Retrieve from a compiled argument list
1076 receiver = Handle(THREAD, callerFrame.retrieve_receiver(®_map2));
1078 if (receiver.is_null()) {
1079 THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle);
1080 }
1081 }
1083 // Resolve method. This is parameterized by bytecode.
1084 constantPoolHandle constants(THREAD, caller->constants());
1085 assert(receiver.is_null() || receiver->is_oop(), "wrong receiver");
1086 LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_(nullHandle));
1088 #ifdef ASSERT
1089 // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls
1090 if (bc != Bytecodes::_invokestatic && bc != Bytecodes::_invokedynamic && bc != Bytecodes::_invokehandle) {
1091 assert(receiver.not_null(), "should have thrown exception");
1092 KlassHandle receiver_klass(THREAD, receiver->klass());
1093 Klass* rk = constants->klass_ref_at(bytecode_index, CHECK_(nullHandle));
1094 // klass is already loaded
1095 KlassHandle static_receiver_klass(THREAD, rk);
1096 // Method handle invokes might have been optimized to a direct call
1097 // so don't check for the receiver class.
1098 // FIXME this weakens the assert too much
1099 methodHandle callee = callinfo.selected_method();
1100 assert(receiver_klass->is_subtype_of(static_receiver_klass()) ||
1101 callee->is_method_handle_intrinsic() ||
1102 callee->is_compiled_lambda_form(),
1103 "actual receiver must be subclass of static receiver klass");
1104 if (receiver_klass->oop_is_instance()) {
1105 if (InstanceKlass::cast(receiver_klass())->is_not_initialized()) {
1106 tty->print_cr("ERROR: Klass not yet initialized!!");
1107 receiver_klass()->print();
1108 }
1109 assert(!InstanceKlass::cast(receiver_klass())->is_not_initialized(), "receiver_klass must be initialized");
1110 }
1111 }
1112 #endif
1114 return receiver;
1115 }
1117 methodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) {
1118 ResourceMark rm(THREAD);
1119 // We need first to check if any Java activations (compiled, interpreted)
1120 // exist on the stack since last JavaCall. If not, we need
1121 // to get the target method from the JavaCall wrapper.
1122 vframeStream vfst(thread, true); // Do not skip any javaCalls
1123 methodHandle callee_method;
1124 if (vfst.at_end()) {
1125 // No Java frames were found on stack since we did the JavaCall.
1126 // Hence the stack can only contain an entry_frame. We need to
1127 // find the target method from the stub frame.
1128 RegisterMap reg_map(thread, false);
1129 frame fr = thread->last_frame();
1130 assert(fr.is_runtime_frame(), "must be a runtimeStub");
1131 fr = fr.sender(®_map);
1132 assert(fr.is_entry_frame(), "must be");
1133 // fr is now pointing to the entry frame.
1134 callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method());
1135 assert(fr.entry_frame_call_wrapper()->receiver() == NULL || !callee_method->is_static(), "non-null receiver for static call??");
1136 } else {
1137 Bytecodes::Code bc;
1138 CallInfo callinfo;
1139 find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle()));
1140 callee_method = callinfo.selected_method();
1141 }
1142 assert(callee_method()->is_method(), "must be");
1143 return callee_method;
1144 }
1146 // Resolves a call.
1147 methodHandle SharedRuntime::resolve_helper(JavaThread *thread,
1148 bool is_virtual,
1149 bool is_optimized, TRAPS) {
1150 methodHandle callee_method;
1151 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1152 if (JvmtiExport::can_hotswap_or_post_breakpoint()) {
1153 int retry_count = 0;
1154 while (!HAS_PENDING_EXCEPTION && callee_method->is_old() &&
1155 callee_method->method_holder() != SystemDictionary::Object_klass()) {
1156 // If has a pending exception then there is no need to re-try to
1157 // resolve this method.
1158 // If the method has been redefined, we need to try again.
1159 // Hack: we have no way to update the vtables of arrays, so don't
1160 // require that java.lang.Object has been updated.
1162 // It is very unlikely that method is redefined more than 100 times
1163 // in the middle of resolve. If it is looping here more than 100 times
1164 // means then there could be a bug here.
1165 guarantee((retry_count++ < 100),
1166 "Could not resolve to latest version of redefined method");
1167 // method is redefined in the middle of resolve so re-try.
1168 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1169 }
1170 }
1171 return callee_method;
1172 }
1174 // Resolves a call. The compilers generate code for calls that go here
1175 // and are patched with the real destination of the call.
1176 methodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread,
1177 bool is_virtual,
1178 bool is_optimized, TRAPS) {
1180 ResourceMark rm(thread);
1181 RegisterMap cbl_map(thread, false);
1182 frame caller_frame = thread->last_frame().sender(&cbl_map);
1184 CodeBlob* caller_cb = caller_frame.cb();
1185 guarantee(caller_cb != NULL && caller_cb->is_nmethod(), "must be called from nmethod");
1186 nmethod* caller_nm = caller_cb->as_nmethod_or_null();
1188 // make sure caller is not getting deoptimized
1189 // and removed before we are done with it.
1190 // CLEANUP - with lazy deopt shouldn't need this lock
1191 nmethodLocker caller_lock(caller_nm);
1193 // determine call info & receiver
1194 // note: a) receiver is NULL for static calls
1195 // b) an exception is thrown if receiver is NULL for non-static calls
1196 CallInfo call_info;
1197 Bytecodes::Code invoke_code = Bytecodes::_illegal;
1198 Handle receiver = find_callee_info(thread, invoke_code,
1199 call_info, CHECK_(methodHandle()));
1200 methodHandle callee_method = call_info.selected_method();
1202 assert((!is_virtual && invoke_code == Bytecodes::_invokestatic ) ||
1203 (!is_virtual && invoke_code == Bytecodes::_invokehandle ) ||
1204 (!is_virtual && invoke_code == Bytecodes::_invokedynamic) ||
1205 ( is_virtual && invoke_code != Bytecodes::_invokestatic ), "inconsistent bytecode");
1207 // We do not patch the call site if the caller nmethod has been made non-entrant.
1208 if (!caller_nm->is_in_use()) {
1209 return callee_method;
1210 }
1212 #ifndef PRODUCT
1213 // tracing/debugging/statistics
1214 int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
1215 (is_virtual) ? (&_resolve_virtual_ctr) :
1216 (&_resolve_static_ctr);
1217 Atomic::inc(addr);
1219 if (TraceCallFixup) {
1220 ResourceMark rm(thread);
1221 tty->print("resolving %s%s (%s) call to",
1222 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
1223 Bytecodes::name(invoke_code));
1224 callee_method->print_short_name(tty);
1225 tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT, caller_frame.pc(), callee_method->code());
1226 }
1227 #endif
1229 // JSR 292 key invariant:
1230 // If the resolved method is a MethodHandle invoke target the call
1231 // site must be a MethodHandle call site, because the lambda form might tail-call
1232 // leaving the stack in a state unknown to either caller or callee
1233 // TODO detune for now but we might need it again
1234 // assert(!callee_method->is_compiled_lambda_form() ||
1235 // caller_nm->is_method_handle_return(caller_frame.pc()), "must be MH call site");
1237 // Compute entry points. This might require generation of C2I converter
1238 // frames, so we cannot be holding any locks here. Furthermore, the
1239 // computation of the entry points is independent of patching the call. We
1240 // always return the entry-point, but we only patch the stub if the call has
1241 // not been deoptimized. Return values: For a virtual call this is an
1242 // (cached_oop, destination address) pair. For a static call/optimized
1243 // virtual this is just a destination address.
1245 StaticCallInfo static_call_info;
1246 CompiledICInfo virtual_call_info;
1248 // Make sure the callee nmethod does not get deoptimized and removed before
1249 // we are done patching the code.
1250 nmethod* callee_nm = callee_method->code();
1251 if (callee_nm != NULL && !callee_nm->is_in_use()) {
1252 // Patch call site to C2I adapter if callee nmethod is deoptimized or unloaded.
1253 callee_nm = NULL;
1254 }
1255 nmethodLocker nl_callee(callee_nm);
1256 #ifdef ASSERT
1257 address dest_entry_point = callee_nm == NULL ? 0 : callee_nm->entry_point(); // used below
1258 #endif
1260 if (is_virtual) {
1261 assert(receiver.not_null() || invoke_code == Bytecodes::_invokehandle, "sanity check");
1262 bool static_bound = call_info.resolved_method()->can_be_statically_bound();
1263 KlassHandle h_klass(THREAD, invoke_code == Bytecodes::_invokehandle ? NULL : receiver->klass());
1264 CompiledIC::compute_monomorphic_entry(callee_method, h_klass,
1265 is_optimized, static_bound, virtual_call_info,
1266 CHECK_(methodHandle()));
1267 } else {
1268 // static call
1269 CompiledStaticCall::compute_entry(callee_method, static_call_info);
1270 }
1272 // grab lock, check for deoptimization and potentially patch caller
1273 {
1274 MutexLocker ml_patch(CompiledIC_lock);
1276 // Lock blocks for safepoint during which both nmethods can change state.
1278 // Now that we are ready to patch if the Method* was redefined then
1279 // don't update call site and let the caller retry.
1280 // Don't update call site if caller nmethod has been made non-entrant
1281 // as it is a waste of time.
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() && caller_nm->is_in_use() &&
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 caller has been
1488 // made non-entrant or we are called from interpreted.
1489 { MutexLocker ml_patch (CompiledIC_lock);
1490 RegisterMap reg_map(thread, false);
1491 frame caller_frame = thread->last_frame().sender(®_map);
1492 CodeBlob* cb = caller_frame.cb();
1493 if (cb->is_nmethod() && ((nmethod*)cb)->is_in_use()) {
1494 // Not a non-entrant nmethod, so find inline_cache
1495 CompiledIC* inline_cache = CompiledIC_before(((nmethod*)cb), caller_frame.pc());
1496 bool should_be_mono = false;
1497 if (inline_cache->is_optimized()) {
1498 if (TraceCallFixup) {
1499 ResourceMark rm(thread);
1500 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc));
1501 callee_method->print_short_name(tty);
1502 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1503 }
1504 should_be_mono = true;
1505 } else if (inline_cache->is_icholder_call()) {
1506 CompiledICHolder* ic_oop = inline_cache->cached_icholder();
1507 if ( ic_oop != NULL) {
1509 if (receiver()->klass() == ic_oop->holder_klass()) {
1510 // This isn't a real miss. We must have seen that compiled code
1511 // is now available and we want the call site converted to a
1512 // monomorphic compiled call site.
1513 // We can't assert for callee_method->code() != NULL because it
1514 // could have been deoptimized in the meantime
1515 if (TraceCallFixup) {
1516 ResourceMark rm(thread);
1517 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc));
1518 callee_method->print_short_name(tty);
1519 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1520 }
1521 should_be_mono = true;
1522 }
1523 }
1524 }
1526 if (should_be_mono) {
1528 // We have a path that was monomorphic but was going interpreted
1529 // and now we have (or had) a compiled entry. We correct the IC
1530 // by using a new icBuffer.
1531 CompiledICInfo info;
1532 KlassHandle receiver_klass(THREAD, receiver()->klass());
1533 inline_cache->compute_monomorphic_entry(callee_method,
1534 receiver_klass,
1535 inline_cache->is_optimized(),
1536 false,
1537 info, CHECK_(methodHandle()));
1538 inline_cache->set_to_monomorphic(info);
1539 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) {
1540 // Potential change to megamorphic
1541 bool successful = inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle()));
1542 if (!successful) {
1543 inline_cache->set_to_clean();
1544 }
1545 } else {
1546 // Either clean or megamorphic
1547 }
1548 }
1549 } // Release CompiledIC_lock
1551 return callee_method;
1552 }
1554 //
1555 // Resets a call-site in compiled code so it will get resolved again.
1556 // This routines handles both virtual call sites, optimized virtual call
1557 // sites, and static call sites. Typically used to change a call sites
1558 // destination from compiled to interpreted.
1559 //
1560 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) {
1561 ResourceMark rm(thread);
1562 RegisterMap reg_map(thread, false);
1563 frame stub_frame = thread->last_frame();
1564 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1565 frame caller = stub_frame.sender(®_map);
1567 // Do nothing if the frame isn't a live compiled frame.
1568 // nmethod could be deoptimized by the time we get here
1569 // so no update to the caller is needed.
1571 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) {
1573 address pc = caller.pc();
1575 // Default call_addr is the location of the "basic" call.
1576 // Determine the address of the call we a reresolving. With
1577 // Inline Caches we will always find a recognizable call.
1578 // With Inline Caches disabled we may or may not find a
1579 // recognizable call. We will always find a call for static
1580 // calls and for optimized virtual calls. For vanilla virtual
1581 // calls it depends on the state of the UseInlineCaches switch.
1582 //
1583 // With Inline Caches disabled we can get here for a virtual call
1584 // for two reasons:
1585 // 1 - calling an abstract method. The vtable for abstract methods
1586 // will run us thru handle_wrong_method and we will eventually
1587 // end up in the interpreter to throw the ame.
1588 // 2 - a racing deoptimization. We could be doing a vanilla vtable
1589 // call and between the time we fetch the entry address and
1590 // we jump to it the target gets deoptimized. Similar to 1
1591 // we will wind up in the interprter (thru a c2i with c2).
1592 //
1593 address call_addr = NULL;
1594 {
1595 // Get call instruction under lock because another thread may be
1596 // busy patching it.
1597 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1598 // Location of call instruction
1599 if (NativeCall::is_call_before(pc)) {
1600 NativeCall *ncall = nativeCall_before(pc);
1601 call_addr = ncall->instruction_address();
1602 }
1603 }
1605 // Check for static or virtual call
1606 bool is_static_call = false;
1607 nmethod* caller_nm = CodeCache::find_nmethod(pc);
1608 // Make sure nmethod doesn't get deoptimized and removed until
1609 // this is done with it.
1610 // CLEANUP - with lazy deopt shouldn't need this lock
1611 nmethodLocker nmlock(caller_nm);
1613 if (call_addr != NULL) {
1614 RelocIterator iter(caller_nm, call_addr, call_addr+1);
1615 int ret = iter.next(); // Get item
1616 if (ret) {
1617 assert(iter.addr() == call_addr, "must find call");
1618 if (iter.type() == relocInfo::static_call_type) {
1619 is_static_call = true;
1620 } else {
1621 assert(iter.type() == relocInfo::virtual_call_type ||
1622 iter.type() == relocInfo::opt_virtual_call_type
1623 , "unexpected relocInfo. type");
1624 }
1625 } else {
1626 assert(!UseInlineCaches, "relocation info. must exist for this address");
1627 }
1629 // Cleaning the inline cache will force a new resolve. This is more robust
1630 // than directly setting it to the new destination, since resolving of calls
1631 // is always done through the same code path. (experience shows that it
1632 // leads to very hard to track down bugs, if an inline cache gets updated
1633 // to a wrong method). It should not be performance critical, since the
1634 // resolve is only done once.
1636 MutexLocker ml(CompiledIC_lock);
1637 //
1638 // We do not patch the call site if the nmethod has been made non-entrant
1639 // as it is a waste of time
1640 //
1641 if (caller_nm->is_in_use()) {
1642 if (is_static_call) {
1643 CompiledStaticCall* ssc= compiledStaticCall_at(call_addr);
1644 ssc->set_to_clean();
1645 } else {
1646 // compiled, dispatched call (which used to call an interpreted method)
1647 CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr);
1648 inline_cache->set_to_clean();
1649 }
1650 }
1651 }
1653 }
1655 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle()));
1658 #ifndef PRODUCT
1659 Atomic::inc(&_wrong_method_ctr);
1661 if (TraceCallFixup) {
1662 ResourceMark rm(thread);
1663 tty->print("handle_wrong_method reresolving call to");
1664 callee_method->print_short_name(tty);
1665 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1666 }
1667 #endif
1669 return callee_method;
1670 }
1672 #ifdef ASSERT
1673 void SharedRuntime::check_member_name_argument_is_last_argument(methodHandle method,
1674 const BasicType* sig_bt,
1675 const VMRegPair* regs) {
1676 ResourceMark rm;
1677 const int total_args_passed = method->size_of_parameters();
1678 const VMRegPair* regs_with_member_name = regs;
1679 VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1);
1681 const int member_arg_pos = total_args_passed - 1;
1682 assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob");
1683 assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object");
1685 const bool is_outgoing = method->is_method_handle_intrinsic();
1686 int comp_args_on_stack = java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1, is_outgoing);
1688 for (int i = 0; i < member_arg_pos; i++) {
1689 VMReg a = regs_with_member_name[i].first();
1690 VMReg b = regs_without_member_name[i].first();
1691 assert(a->value() == b->value(), err_msg_res("register allocation mismatch: a=%d, b=%d", a->value(), b->value()));
1692 }
1693 assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg");
1694 }
1695 #endif
1697 // ---------------------------------------------------------------------------
1698 // We are calling the interpreter via a c2i. Normally this would mean that
1699 // we were called by a compiled method. However we could have lost a race
1700 // where we went int -> i2c -> c2i and so the caller could in fact be
1701 // interpreted. If the caller is compiled we attempt to patch the caller
1702 // so he no longer calls into the interpreter.
1703 IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc))
1704 Method* moop(method);
1706 address entry_point = moop->from_compiled_entry();
1708 // It's possible that deoptimization can occur at a call site which hasn't
1709 // been resolved yet, in which case this function will be called from
1710 // an nmethod that has been patched for deopt and we can ignore the
1711 // request for a fixup.
1712 // Also it is possible that we lost a race in that from_compiled_entry
1713 // is now back to the i2c in that case we don't need to patch and if
1714 // we did we'd leap into space because the callsite needs to use
1715 // "to interpreter" stub in order to load up the Method*. Don't
1716 // ask me how I know this...
1718 CodeBlob* cb = CodeCache::find_blob(caller_pc);
1719 if (!cb->is_nmethod() || entry_point == moop->get_c2i_entry()) {
1720 return;
1721 }
1723 // The check above makes sure this is a nmethod.
1724 nmethod* nm = cb->as_nmethod_or_null();
1725 assert(nm, "must be");
1727 // Get the return PC for the passed caller PC.
1728 address return_pc = caller_pc + frame::pc_return_offset;
1730 // There is a benign race here. We could be attempting to patch to a compiled
1731 // entry point at the same time the callee is being deoptimized. If that is
1732 // the case then entry_point may in fact point to a c2i and we'd patch the
1733 // call site with the same old data. clear_code will set code() to NULL
1734 // at the end of it. If we happen to see that NULL then we can skip trying
1735 // to patch. If we hit the window where the callee has a c2i in the
1736 // from_compiled_entry and the NULL isn't present yet then we lose the race
1737 // and patch the code with the same old data. Asi es la vida.
1739 if (moop->code() == NULL) return;
1741 if (nm->is_in_use()) {
1743 // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1744 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1745 if (NativeCall::is_call_before(return_pc)) {
1746 NativeCall *call = nativeCall_before(return_pc);
1747 //
1748 // bug 6281185. We might get here after resolving a call site to a vanilla
1749 // virtual call. Because the resolvee uses the verified entry it may then
1750 // see compiled code and attempt to patch the site by calling us. This would
1751 // then incorrectly convert the call site to optimized and its downhill from
1752 // there. If you're lucky you'll get the assert in the bugid, if not you've
1753 // just made a call site that could be megamorphic into a monomorphic site
1754 // for the rest of its life! Just another racing bug in the life of
1755 // fixup_callers_callsite ...
1756 //
1757 RelocIterator iter(nm, call->instruction_address(), call->next_instruction_address());
1758 iter.next();
1759 assert(iter.has_current(), "must have a reloc at java call site");
1760 relocInfo::relocType typ = iter.reloc()->type();
1761 if ( typ != relocInfo::static_call_type &&
1762 typ != relocInfo::opt_virtual_call_type &&
1763 typ != relocInfo::static_stub_type) {
1764 return;
1765 }
1766 address destination = call->destination();
1767 if (destination != entry_point) {
1768 CodeBlob* callee = CodeCache::find_blob(destination);
1769 // callee == cb seems weird. It means calling interpreter thru stub.
1770 if (callee == cb || callee->is_adapter_blob()) {
1771 // static call or optimized virtual
1772 if (TraceCallFixup) {
1773 tty->print("fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1774 moop->print_short_name(tty);
1775 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1776 }
1777 call->set_destination_mt_safe(entry_point);
1778 } else {
1779 if (TraceCallFixup) {
1780 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1781 moop->print_short_name(tty);
1782 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1783 }
1784 // assert is too strong could also be resolve destinations.
1785 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be");
1786 }
1787 } else {
1788 if (TraceCallFixup) {
1789 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1790 moop->print_short_name(tty);
1791 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1792 }
1793 }
1794 }
1795 }
1796 IRT_END
1799 // same as JVM_Arraycopy, but called directly from compiled code
1800 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos,
1801 oopDesc* dest, jint dest_pos,
1802 jint length,
1803 JavaThread* thread)) {
1804 #ifndef PRODUCT
1805 _slow_array_copy_ctr++;
1806 #endif
1807 // Check if we have null pointers
1808 if (src == NULL || dest == NULL) {
1809 THROW(vmSymbols::java_lang_NullPointerException());
1810 }
1811 // Do the copy. The casts to arrayOop are necessary to the copy_array API,
1812 // even though the copy_array API also performs dynamic checks to ensure
1813 // that src and dest are truly arrays (and are conformable).
1814 // The copy_array mechanism is awkward and could be removed, but
1815 // the compilers don't call this function except as a last resort,
1816 // so it probably doesn't matter.
1817 src->klass()->copy_array((arrayOopDesc*)src, src_pos,
1818 (arrayOopDesc*)dest, dest_pos,
1819 length, thread);
1820 }
1821 JRT_END
1823 char* SharedRuntime::generate_class_cast_message(
1824 JavaThread* thread, const char* objName) {
1826 // Get target class name from the checkcast instruction
1827 vframeStream vfst(thread, true);
1828 assert(!vfst.at_end(), "Java frame must exist");
1829 Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci()));
1830 Klass* targetKlass = vfst.method()->constants()->klass_at(
1831 cc.index(), thread);
1832 return generate_class_cast_message(objName, targetKlass->external_name());
1833 }
1835 char* SharedRuntime::generate_class_cast_message(
1836 const char* objName, const char* targetKlassName, const char* desc) {
1837 size_t msglen = strlen(objName) + strlen(desc) + strlen(targetKlassName) + 1;
1839 char* message = NEW_RESOURCE_ARRAY(char, msglen);
1840 if (NULL == message) {
1841 // Shouldn't happen, but don't cause even more problems if it does
1842 message = const_cast<char*>(objName);
1843 } else {
1844 jio_snprintf(message, msglen, "%s%s%s", objName, desc, targetKlassName);
1845 }
1846 return message;
1847 }
1849 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
1850 (void) JavaThread::current()->reguard_stack();
1851 JRT_END
1854 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
1855 #ifndef PRODUCT
1856 int SharedRuntime::_monitor_enter_ctr=0;
1857 #endif
1858 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
1859 oop obj(_obj);
1860 #ifndef PRODUCT
1861 _monitor_enter_ctr++; // monitor enter slow
1862 #endif
1863 if (PrintBiasedLockingStatistics) {
1864 Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
1865 }
1866 Handle h_obj(THREAD, obj);
1867 if (UseBiasedLocking) {
1868 // Retry fast entry if bias is revoked to avoid unnecessary inflation
1869 ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK);
1870 } else {
1871 ObjectSynchronizer::slow_enter(h_obj, lock, CHECK);
1872 }
1873 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
1874 JRT_END
1876 #ifndef PRODUCT
1877 int SharedRuntime::_monitor_exit_ctr=0;
1878 #endif
1879 // Handles the uncommon cases of monitor unlocking in compiled code
1880 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock))
1881 oop obj(_obj);
1882 #ifndef PRODUCT
1883 _monitor_exit_ctr++; // monitor exit slow
1884 #endif
1885 Thread* THREAD = JavaThread::current();
1886 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore
1887 // testing was unable to ever fire the assert that guarded it so I have removed it.
1888 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?");
1889 #undef MIGHT_HAVE_PENDING
1890 #ifdef MIGHT_HAVE_PENDING
1891 // Save and restore any pending_exception around the exception mark.
1892 // While the slow_exit must not throw an exception, we could come into
1893 // this routine with one set.
1894 oop pending_excep = NULL;
1895 const char* pending_file;
1896 int pending_line;
1897 if (HAS_PENDING_EXCEPTION) {
1898 pending_excep = PENDING_EXCEPTION;
1899 pending_file = THREAD->exception_file();
1900 pending_line = THREAD->exception_line();
1901 CLEAR_PENDING_EXCEPTION;
1902 }
1903 #endif /* MIGHT_HAVE_PENDING */
1905 {
1906 // Exit must be non-blocking, and therefore no exceptions can be thrown.
1907 EXCEPTION_MARK;
1908 ObjectSynchronizer::slow_exit(obj, lock, THREAD);
1909 }
1911 #ifdef MIGHT_HAVE_PENDING
1912 if (pending_excep != NULL) {
1913 THREAD->set_pending_exception(pending_excep, pending_file, pending_line);
1914 }
1915 #endif /* MIGHT_HAVE_PENDING */
1916 JRT_END
1918 #ifndef PRODUCT
1920 void SharedRuntime::print_statistics() {
1921 ttyLocker ttyl;
1922 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'");
1924 if (_monitor_enter_ctr ) tty->print_cr("%5d monitor enter slow", _monitor_enter_ctr);
1925 if (_monitor_exit_ctr ) tty->print_cr("%5d monitor exit slow", _monitor_exit_ctr);
1926 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr);
1928 SharedRuntime::print_ic_miss_histogram();
1930 if (CountRemovableExceptions) {
1931 if (_nof_removable_exceptions > 0) {
1932 Unimplemented(); // this counter is not yet incremented
1933 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions);
1934 }
1935 }
1937 // Dump the JRT_ENTRY counters
1938 if( _new_instance_ctr ) tty->print_cr("%5d new instance requires GC", _new_instance_ctr);
1939 if( _new_array_ctr ) tty->print_cr("%5d new array requires GC", _new_array_ctr);
1940 if( _multi1_ctr ) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr);
1941 if( _multi2_ctr ) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr);
1942 if( _multi3_ctr ) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr);
1943 if( _multi4_ctr ) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr);
1944 if( _multi5_ctr ) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr);
1946 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr );
1947 tty->print_cr("%5d wrong method", _wrong_method_ctr );
1948 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr );
1949 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr );
1950 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr );
1952 if( _mon_enter_stub_ctr ) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr );
1953 if( _mon_exit_stub_ctr ) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr );
1954 if( _mon_enter_ctr ) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr );
1955 if( _mon_exit_ctr ) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr );
1956 if( _partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr );
1957 if( _jbyte_array_copy_ctr ) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr );
1958 if( _jshort_array_copy_ctr ) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr );
1959 if( _jint_array_copy_ctr ) tty->print_cr("%5d int array copies", _jint_array_copy_ctr );
1960 if( _jlong_array_copy_ctr ) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr );
1961 if( _oop_array_copy_ctr ) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr );
1962 if( _checkcast_array_copy_ctr ) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr );
1963 if( _unsafe_array_copy_ctr ) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr );
1964 if( _generic_array_copy_ctr ) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr );
1965 if( _slow_array_copy_ctr ) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr );
1966 if( _find_handler_ctr ) tty->print_cr("%5d find exception handler", _find_handler_ctr );
1967 if( _rethrow_ctr ) tty->print_cr("%5d rethrow handler", _rethrow_ctr );
1969 AdapterHandlerLibrary::print_statistics();
1971 if (xtty != NULL) xtty->tail("statistics");
1972 }
1974 inline double percent(int x, int y) {
1975 return 100.0 * x / MAX2(y, 1);
1976 }
1978 class MethodArityHistogram {
1979 public:
1980 enum { MAX_ARITY = 256 };
1981 private:
1982 static int _arity_histogram[MAX_ARITY]; // histogram of #args
1983 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words
1984 static int _max_arity; // max. arity seen
1985 static int _max_size; // max. arg size seen
1987 static void add_method_to_histogram(nmethod* nm) {
1988 Method* m = nm->method();
1989 ArgumentCount args(m->signature());
1990 int arity = args.size() + (m->is_static() ? 0 : 1);
1991 int argsize = m->size_of_parameters();
1992 arity = MIN2(arity, MAX_ARITY-1);
1993 argsize = MIN2(argsize, MAX_ARITY-1);
1994 int count = nm->method()->compiled_invocation_count();
1995 _arity_histogram[arity] += count;
1996 _size_histogram[argsize] += count;
1997 _max_arity = MAX2(_max_arity, arity);
1998 _max_size = MAX2(_max_size, argsize);
1999 }
2001 void print_histogram_helper(int n, int* histo, const char* name) {
2002 const int N = MIN2(5, n);
2003 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2004 double sum = 0;
2005 double weighted_sum = 0;
2006 int i;
2007 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; }
2008 double rest = sum;
2009 double percent = sum / 100;
2010 for (i = 0; i <= N; i++) {
2011 rest -= histo[i];
2012 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent);
2013 }
2014 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent);
2015 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
2016 }
2018 void print_histogram() {
2019 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2020 print_histogram_helper(_max_arity, _arity_histogram, "arity");
2021 tty->print_cr("\nSame for parameter size (in words):");
2022 print_histogram_helper(_max_size, _size_histogram, "size");
2023 tty->cr();
2024 }
2026 public:
2027 MethodArityHistogram() {
2028 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2029 _max_arity = _max_size = 0;
2030 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram [i] = 0;
2031 CodeCache::nmethods_do(add_method_to_histogram);
2032 print_histogram();
2033 }
2034 };
2036 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
2037 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
2038 int MethodArityHistogram::_max_arity;
2039 int MethodArityHistogram::_max_size;
2041 void SharedRuntime::print_call_statistics(int comp_total) {
2042 tty->print_cr("Calls from compiled code:");
2043 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
2044 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls;
2045 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls;
2046 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total));
2047 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total));
2048 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
2049 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls));
2050 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls));
2051 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
2052 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total));
2053 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
2054 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls));
2055 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls));
2056 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls));
2057 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
2058 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
2059 tty->cr();
2060 tty->print_cr("Note 1: counter updates are not MT-safe.");
2061 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
2062 tty->print_cr(" %% in nested categories are relative to their category");
2063 tty->print_cr(" (and thus add up to more than 100%% with inlining)");
2064 tty->cr();
2066 MethodArityHistogram h;
2067 }
2068 #endif
2071 // A simple wrapper class around the calling convention information
2072 // that allows sharing of adapters for the same calling convention.
2073 class AdapterFingerPrint : public CHeapObj<mtCode> {
2074 private:
2075 enum {
2076 _basic_type_bits = 4,
2077 _basic_type_mask = right_n_bits(_basic_type_bits),
2078 _basic_types_per_int = BitsPerInt / _basic_type_bits,
2079 _compact_int_count = 3
2080 };
2081 // TO DO: Consider integrating this with a more global scheme for compressing signatures.
2082 // For now, 4 bits per components (plus T_VOID gaps after double/long) is not excessive.
2084 union {
2085 int _compact[_compact_int_count];
2086 int* _fingerprint;
2087 } _value;
2088 int _length; // A negative length indicates the fingerprint is in the compact form,
2089 // Otherwise _value._fingerprint is the array.
2091 // Remap BasicTypes that are handled equivalently by the adapters.
2092 // These are correct for the current system but someday it might be
2093 // necessary to make this mapping platform dependent.
2094 static int adapter_encoding(BasicType in) {
2095 switch(in) {
2096 case T_BOOLEAN:
2097 case T_BYTE:
2098 case T_SHORT:
2099 case T_CHAR:
2100 // There are all promoted to T_INT in the calling convention
2101 return T_INT;
2103 case T_OBJECT:
2104 case T_ARRAY:
2105 // In other words, we assume that any register good enough for
2106 // an int or long is good enough for a managed pointer.
2107 #ifdef _LP64
2108 return T_LONG;
2109 #else
2110 return T_INT;
2111 #endif
2113 case T_INT:
2114 case T_LONG:
2115 case T_FLOAT:
2116 case T_DOUBLE:
2117 case T_VOID:
2118 return in;
2120 default:
2121 ShouldNotReachHere();
2122 return T_CONFLICT;
2123 }
2124 }
2126 public:
2127 AdapterFingerPrint(int total_args_passed, BasicType* sig_bt) {
2128 // The fingerprint is based on the BasicType signature encoded
2129 // into an array of ints with eight entries per int.
2130 int* ptr;
2131 int len = (total_args_passed + (_basic_types_per_int-1)) / _basic_types_per_int;
2132 if (len <= _compact_int_count) {
2133 assert(_compact_int_count == 3, "else change next line");
2134 _value._compact[0] = _value._compact[1] = _value._compact[2] = 0;
2135 // Storing the signature encoded as signed chars hits about 98%
2136 // of the time.
2137 _length = -len;
2138 ptr = _value._compact;
2139 } else {
2140 _length = len;
2141 _value._fingerprint = NEW_C_HEAP_ARRAY(int, _length, mtCode);
2142 ptr = _value._fingerprint;
2143 }
2145 // Now pack the BasicTypes with 8 per int
2146 int sig_index = 0;
2147 for (int index = 0; index < len; index++) {
2148 int value = 0;
2149 for (int byte = 0; byte < _basic_types_per_int; byte++) {
2150 int bt = ((sig_index < total_args_passed)
2151 ? adapter_encoding(sig_bt[sig_index++])
2152 : 0);
2153 assert((bt & _basic_type_mask) == bt, "must fit in 4 bits");
2154 value = (value << _basic_type_bits) | bt;
2155 }
2156 ptr[index] = value;
2157 }
2158 }
2160 ~AdapterFingerPrint() {
2161 if (_length > 0) {
2162 FREE_C_HEAP_ARRAY(int, _value._fingerprint, mtCode);
2163 }
2164 }
2166 int value(int index) {
2167 if (_length < 0) {
2168 return _value._compact[index];
2169 }
2170 return _value._fingerprint[index];
2171 }
2172 int length() {
2173 if (_length < 0) return -_length;
2174 return _length;
2175 }
2177 bool is_compact() {
2178 return _length <= 0;
2179 }
2181 unsigned int compute_hash() {
2182 int hash = 0;
2183 for (int i = 0; i < length(); i++) {
2184 int v = value(i);
2185 hash = (hash << 8) ^ v ^ (hash >> 5);
2186 }
2187 return (unsigned int)hash;
2188 }
2190 const char* as_string() {
2191 stringStream st;
2192 st.print("0x");
2193 for (int i = 0; i < length(); i++) {
2194 st.print("%08x", value(i));
2195 }
2196 return st.as_string();
2197 }
2199 bool equals(AdapterFingerPrint* other) {
2200 if (other->_length != _length) {
2201 return false;
2202 }
2203 if (_length < 0) {
2204 assert(_compact_int_count == 3, "else change next line");
2205 return _value._compact[0] == other->_value._compact[0] &&
2206 _value._compact[1] == other->_value._compact[1] &&
2207 _value._compact[2] == other->_value._compact[2];
2208 } else {
2209 for (int i = 0; i < _length; i++) {
2210 if (_value._fingerprint[i] != other->_value._fingerprint[i]) {
2211 return false;
2212 }
2213 }
2214 }
2215 return true;
2216 }
2217 };
2220 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries
2221 class AdapterHandlerTable : public BasicHashtable<mtCode> {
2222 friend class AdapterHandlerTableIterator;
2224 private:
2226 #ifndef PRODUCT
2227 static int _lookups; // number of calls to lookup
2228 static int _buckets; // number of buckets checked
2229 static int _equals; // number of buckets checked with matching hash
2230 static int _hits; // number of successful lookups
2231 static int _compact; // number of equals calls with compact signature
2232 #endif
2234 AdapterHandlerEntry* bucket(int i) {
2235 return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i);
2236 }
2238 public:
2239 AdapterHandlerTable()
2240 : BasicHashtable<mtCode>(293, sizeof(AdapterHandlerEntry)) { }
2242 // Create a new entry suitable for insertion in the table
2243 AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry) {
2244 AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable<mtCode>::new_entry(fingerprint->compute_hash());
2245 entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2246 return entry;
2247 }
2249 // Insert an entry into the table
2250 void add(AdapterHandlerEntry* entry) {
2251 int index = hash_to_index(entry->hash());
2252 add_entry(index, entry);
2253 }
2255 void free_entry(AdapterHandlerEntry* entry) {
2256 entry->deallocate();
2257 BasicHashtable<mtCode>::free_entry(entry);
2258 }
2260 // Find a entry with the same fingerprint if it exists
2261 AdapterHandlerEntry* lookup(int total_args_passed, BasicType* sig_bt) {
2262 NOT_PRODUCT(_lookups++);
2263 AdapterFingerPrint fp(total_args_passed, sig_bt);
2264 unsigned int hash = fp.compute_hash();
2265 int index = hash_to_index(hash);
2266 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2267 NOT_PRODUCT(_buckets++);
2268 if (e->hash() == hash) {
2269 NOT_PRODUCT(_equals++);
2270 if (fp.equals(e->fingerprint())) {
2271 #ifndef PRODUCT
2272 if (fp.is_compact()) _compact++;
2273 _hits++;
2274 #endif
2275 return e;
2276 }
2277 }
2278 }
2279 return NULL;
2280 }
2282 #ifndef PRODUCT
2283 void print_statistics() {
2284 ResourceMark rm;
2285 int longest = 0;
2286 int empty = 0;
2287 int total = 0;
2288 int nonempty = 0;
2289 for (int index = 0; index < table_size(); index++) {
2290 int count = 0;
2291 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2292 count++;
2293 }
2294 if (count != 0) nonempty++;
2295 if (count == 0) empty++;
2296 if (count > longest) longest = count;
2297 total += count;
2298 }
2299 tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f",
2300 empty, longest, total, total / (double)nonempty);
2301 tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d",
2302 _lookups, _buckets, _equals, _hits, _compact);
2303 }
2304 #endif
2305 };
2308 #ifndef PRODUCT
2310 int AdapterHandlerTable::_lookups;
2311 int AdapterHandlerTable::_buckets;
2312 int AdapterHandlerTable::_equals;
2313 int AdapterHandlerTable::_hits;
2314 int AdapterHandlerTable::_compact;
2316 #endif
2318 class AdapterHandlerTableIterator : public StackObj {
2319 private:
2320 AdapterHandlerTable* _table;
2321 int _index;
2322 AdapterHandlerEntry* _current;
2324 void scan() {
2325 while (_index < _table->table_size()) {
2326 AdapterHandlerEntry* a = _table->bucket(_index);
2327 _index++;
2328 if (a != NULL) {
2329 _current = a;
2330 return;
2331 }
2332 }
2333 }
2335 public:
2336 AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) {
2337 scan();
2338 }
2339 bool has_next() {
2340 return _current != NULL;
2341 }
2342 AdapterHandlerEntry* next() {
2343 if (_current != NULL) {
2344 AdapterHandlerEntry* result = _current;
2345 _current = _current->next();
2346 if (_current == NULL) scan();
2347 return result;
2348 } else {
2349 return NULL;
2350 }
2351 }
2352 };
2355 // ---------------------------------------------------------------------------
2356 // Implementation of AdapterHandlerLibrary
2357 AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL;
2358 AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL;
2359 const int AdapterHandlerLibrary_size = 16*K;
2360 BufferBlob* AdapterHandlerLibrary::_buffer = NULL;
2362 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
2363 // Should be called only when AdapterHandlerLibrary_lock is active.
2364 if (_buffer == NULL) // Initialize lazily
2365 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
2366 return _buffer;
2367 }
2369 void AdapterHandlerLibrary::initialize() {
2370 if (_adapters != NULL) return;
2371 _adapters = new AdapterHandlerTable();
2373 // Create a special handler for abstract methods. Abstract methods
2374 // are never compiled so an i2c entry is somewhat meaningless, but
2375 // throw AbstractMethodError just in case.
2376 // Pass wrong_method_abstract for the c2i transitions to return
2377 // AbstractMethodError for invalid invocations.
2378 address wrong_method_abstract = SharedRuntime::get_handle_wrong_method_abstract_stub();
2379 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL),
2380 StubRoutines::throw_AbstractMethodError_entry(),
2381 wrong_method_abstract, wrong_method_abstract);
2382 }
2384 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint,
2385 address i2c_entry,
2386 address c2i_entry,
2387 address c2i_unverified_entry) {
2388 return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2389 }
2391 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(methodHandle method) {
2392 // Use customized signature handler. Need to lock around updates to
2393 // the AdapterHandlerTable (it is not safe for concurrent readers
2394 // and a single writer: this could be fixed if it becomes a
2395 // problem).
2397 // Get the address of the ic_miss handlers before we grab the
2398 // AdapterHandlerLibrary_lock. This fixes bug 6236259 which
2399 // was caused by the initialization of the stubs happening
2400 // while we held the lock and then notifying jvmti while
2401 // holding it. This just forces the initialization to be a little
2402 // earlier.
2403 address ic_miss = SharedRuntime::get_ic_miss_stub();
2404 assert(ic_miss != NULL, "must have handler");
2406 ResourceMark rm;
2408 NOT_PRODUCT(int insts_size);
2409 AdapterBlob* new_adapter = NULL;
2410 AdapterHandlerEntry* entry = NULL;
2411 AdapterFingerPrint* fingerprint = NULL;
2412 {
2413 MutexLocker mu(AdapterHandlerLibrary_lock);
2414 // make sure data structure is initialized
2415 initialize();
2417 if (method->is_abstract()) {
2418 return _abstract_method_handler;
2419 }
2421 // Fill in the signature array, for the calling-convention call.
2422 int total_args_passed = method->size_of_parameters(); // All args on stack
2424 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2425 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2426 int i = 0;
2427 if (!method->is_static()) // Pass in receiver first
2428 sig_bt[i++] = T_OBJECT;
2429 for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) {
2430 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2431 if (ss.type() == T_LONG || ss.type() == T_DOUBLE)
2432 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2433 }
2434 assert(i == total_args_passed, "");
2436 // Lookup method signature's fingerprint
2437 entry = _adapters->lookup(total_args_passed, sig_bt);
2439 #ifdef ASSERT
2440 AdapterHandlerEntry* shared_entry = NULL;
2441 // Start adapter sharing verification only after the VM is booted.
2442 if (VerifyAdapterSharing && (entry != NULL)) {
2443 shared_entry = entry;
2444 entry = NULL;
2445 }
2446 #endif
2448 if (entry != NULL) {
2449 return entry;
2450 }
2452 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
2453 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
2455 // Make a C heap allocated version of the fingerprint to store in the adapter
2456 fingerprint = new AdapterFingerPrint(total_args_passed, sig_bt);
2458 // StubRoutines::code2() is initialized after this function can be called. As a result,
2459 // VerifyAdapterCalls and VerifyAdapterSharing can fail if we re-use code that generated
2460 // prior to StubRoutines::code2() being set. Checks refer to checks generated in an I2C
2461 // stub that ensure that an I2C stub is called from an interpreter frame.
2462 bool contains_all_checks = StubRoutines::code2() != NULL;
2464 // Create I2C & C2I handlers
2465 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2466 if (buf != NULL) {
2467 CodeBuffer buffer(buf);
2468 short buffer_locs[20];
2469 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
2470 sizeof(buffer_locs)/sizeof(relocInfo));
2472 MacroAssembler _masm(&buffer);
2473 entry = SharedRuntime::generate_i2c2i_adapters(&_masm,
2474 total_args_passed,
2475 comp_args_on_stack,
2476 sig_bt,
2477 regs,
2478 fingerprint);
2479 #ifdef ASSERT
2480 if (VerifyAdapterSharing) {
2481 if (shared_entry != NULL) {
2482 assert(shared_entry->compare_code(buf->code_begin(), buffer.insts_size()), "code must match");
2483 // Release the one just created and return the original
2484 _adapters->free_entry(entry);
2485 return shared_entry;
2486 } else {
2487 entry->save_code(buf->code_begin(), buffer.insts_size());
2488 }
2489 }
2490 #endif
2492 new_adapter = AdapterBlob::create(&buffer);
2493 NOT_PRODUCT(insts_size = buffer.insts_size());
2494 }
2495 if (new_adapter == NULL) {
2496 // CodeCache is full, disable compilation
2497 // Ought to log this but compile log is only per compile thread
2498 // and we're some non descript Java thread.
2499 MutexUnlocker mu(AdapterHandlerLibrary_lock);
2500 CompileBroker::handle_full_code_cache();
2501 return NULL; // Out of CodeCache space
2502 }
2503 entry->relocate(new_adapter->content_begin());
2504 #ifndef PRODUCT
2505 // debugging suppport
2506 if (PrintAdapterHandlers || PrintStubCode) {
2507 ttyLocker ttyl;
2508 entry->print_adapter_on(tty);
2509 tty->print_cr("i2c argument handler #%d for: %s %s (%d bytes generated)",
2510 _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"),
2511 method->signature()->as_C_string(), insts_size);
2512 tty->print_cr("c2i argument handler starts at %p",entry->get_c2i_entry());
2513 if (Verbose || PrintStubCode) {
2514 address first_pc = entry->base_address();
2515 if (first_pc != NULL) {
2516 Disassembler::decode(first_pc, first_pc + insts_size);
2517 tty->cr();
2518 }
2519 }
2520 }
2521 #endif
2522 // Add the entry only if the entry contains all required checks (see sharedRuntime_xxx.cpp)
2523 // The checks are inserted only if -XX:+VerifyAdapterCalls is specified.
2524 if (contains_all_checks || !VerifyAdapterCalls) {
2525 _adapters->add(entry);
2526 }
2527 }
2528 // Outside of the lock
2529 if (new_adapter != NULL) {
2530 char blob_id[256];
2531 jio_snprintf(blob_id,
2532 sizeof(blob_id),
2533 "%s(%s)@" PTR_FORMAT,
2534 new_adapter->name(),
2535 fingerprint->as_string(),
2536 new_adapter->content_begin());
2537 Forte::register_stub(blob_id, new_adapter->content_begin(),new_adapter->content_end());
2539 if (JvmtiExport::should_post_dynamic_code_generated()) {
2540 JvmtiExport::post_dynamic_code_generated(blob_id, new_adapter->content_begin(), new_adapter->content_end());
2541 }
2542 }
2543 return entry;
2544 }
2546 address AdapterHandlerEntry::base_address() {
2547 address base = _i2c_entry;
2548 if (base == NULL) base = _c2i_entry;
2549 assert(base <= _c2i_entry || _c2i_entry == NULL, "");
2550 assert(base <= _c2i_unverified_entry || _c2i_unverified_entry == NULL, "");
2551 return base;
2552 }
2554 void AdapterHandlerEntry::relocate(address new_base) {
2555 address old_base = base_address();
2556 assert(old_base != NULL, "");
2557 ptrdiff_t delta = new_base - old_base;
2558 if (_i2c_entry != NULL)
2559 _i2c_entry += delta;
2560 if (_c2i_entry != NULL)
2561 _c2i_entry += delta;
2562 if (_c2i_unverified_entry != NULL)
2563 _c2i_unverified_entry += delta;
2564 assert(base_address() == new_base, "");
2565 }
2568 void AdapterHandlerEntry::deallocate() {
2569 delete _fingerprint;
2570 #ifdef ASSERT
2571 if (_saved_code) FREE_C_HEAP_ARRAY(unsigned char, _saved_code, mtCode);
2572 #endif
2573 }
2576 #ifdef ASSERT
2577 // Capture the code before relocation so that it can be compared
2578 // against other versions. If the code is captured after relocation
2579 // then relative instructions won't be equivalent.
2580 void AdapterHandlerEntry::save_code(unsigned char* buffer, int length) {
2581 _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode);
2582 _saved_code_length = length;
2583 memcpy(_saved_code, buffer, length);
2584 }
2587 bool AdapterHandlerEntry::compare_code(unsigned char* buffer, int length) {
2588 if (length != _saved_code_length) {
2589 return false;
2590 }
2592 return (memcmp(buffer, _saved_code, length) == 0) ? true : false;
2593 }
2594 #endif
2597 /**
2598 * Create a native wrapper for this native method. The wrapper converts the
2599 * Java-compiled calling convention to the native convention, handles
2600 * arguments, and transitions to native. On return from the native we transition
2601 * back to java blocking if a safepoint is in progress.
2602 */
2603 void AdapterHandlerLibrary::create_native_wrapper(methodHandle method) {
2604 ResourceMark rm;
2605 nmethod* nm = NULL;
2607 assert(method->is_native(), "must be native");
2608 assert(method->is_method_handle_intrinsic() ||
2609 method->has_native_function(), "must have something valid to call!");
2611 {
2612 // Perform the work while holding the lock, but perform any printing outside the lock
2613 MutexLocker mu(AdapterHandlerLibrary_lock);
2614 // See if somebody beat us to it
2615 nm = method->code();
2616 if (nm != NULL) {
2617 return;
2618 }
2620 const int compile_id = CompileBroker::assign_compile_id(method, CompileBroker::standard_entry_bci);
2621 assert(compile_id > 0, "Must generate native wrapper");
2624 ResourceMark rm;
2625 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2626 if (buf != NULL) {
2627 CodeBuffer buffer(buf);
2628 double locs_buf[20];
2629 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2630 MacroAssembler _masm(&buffer);
2632 // Fill in the signature array, for the calling-convention call.
2633 const int total_args_passed = method->size_of_parameters();
2635 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2636 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2637 int i=0;
2638 if( !method->is_static() ) // Pass in receiver first
2639 sig_bt[i++] = T_OBJECT;
2640 SignatureStream ss(method->signature());
2641 for( ; !ss.at_return_type(); ss.next()) {
2642 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2643 if( ss.type() == T_LONG || ss.type() == T_DOUBLE )
2644 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2645 }
2646 assert(i == total_args_passed, "");
2647 BasicType ret_type = ss.type();
2649 // Now get the compiled-Java layout as input (or output) arguments.
2650 // NOTE: Stubs for compiled entry points of method handle intrinsics
2651 // are just trampolines so the argument registers must be outgoing ones.
2652 const bool is_outgoing = method->is_method_handle_intrinsic();
2653 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, is_outgoing);
2655 // Generate the compiled-to-native wrapper code
2656 nm = SharedRuntime::generate_native_wrapper(&_masm, method, compile_id, sig_bt, regs, ret_type);
2658 if (nm != NULL) {
2659 method->set_code(method, nm);
2660 }
2661 }
2662 } // Unlock AdapterHandlerLibrary_lock
2665 // Install the generated code.
2666 if (nm != NULL) {
2667 if (PrintCompilation) {
2668 ttyLocker ttyl;
2669 CompileTask::print_compilation(tty, nm, method->is_static() ? "(static)" : "");
2670 }
2671 nm->post_compiled_method_load_event();
2672 } else {
2673 // CodeCache is full, disable compilation
2674 CompileBroker::handle_full_code_cache();
2675 }
2676 }
2678 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::block_for_jni_critical(JavaThread* thread))
2679 assert(thread == JavaThread::current(), "must be");
2680 // The code is about to enter a JNI lazy critical native method and
2681 // _needs_gc is true, so if this thread is already in a critical
2682 // section then just return, otherwise this thread should block
2683 // until needs_gc has been cleared.
2684 if (thread->in_critical()) {
2685 return;
2686 }
2687 // Lock and unlock a critical section to give the system a chance to block
2688 GC_locker::lock_critical(thread);
2689 GC_locker::unlock_critical(thread);
2690 JRT_END
2692 #ifdef HAVE_DTRACE_H
2693 // Create a dtrace nmethod for this method. The wrapper converts the
2694 // java compiled calling convention to the native convention, makes a dummy call
2695 // (actually nops for the size of the call instruction, which become a trap if
2696 // probe is enabled). The returns to the caller. Since this all looks like a
2697 // leaf no thread transition is needed.
2699 nmethod *AdapterHandlerLibrary::create_dtrace_nmethod(methodHandle method) {
2700 ResourceMark rm;
2701 nmethod* nm = NULL;
2703 if (PrintCompilation) {
2704 ttyLocker ttyl;
2705 tty->print("--- n%s ");
2706 method->print_short_name(tty);
2707 if (method->is_static()) {
2708 tty->print(" (static)");
2709 }
2710 tty->cr();
2711 }
2713 {
2714 // perform the work while holding the lock, but perform any printing
2715 // outside the lock
2716 MutexLocker mu(AdapterHandlerLibrary_lock);
2717 // See if somebody beat us to it
2718 nm = method->code();
2719 if (nm) {
2720 return nm;
2721 }
2723 ResourceMark rm;
2725 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2726 if (buf != NULL) {
2727 CodeBuffer buffer(buf);
2728 // Need a few relocation entries
2729 double locs_buf[20];
2730 buffer.insts()->initialize_shared_locs(
2731 (relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2732 MacroAssembler _masm(&buffer);
2734 // Generate the compiled-to-native wrapper code
2735 nm = SharedRuntime::generate_dtrace_nmethod(&_masm, method);
2736 }
2737 }
2738 return nm;
2739 }
2741 // the dtrace method needs to convert java lang string to utf8 string.
2742 void SharedRuntime::get_utf(oopDesc* src, address dst) {
2743 typeArrayOop jlsValue = java_lang_String::value(src);
2744 int jlsOffset = java_lang_String::offset(src);
2745 int jlsLen = java_lang_String::length(src);
2746 jchar* jlsPos = (jlsLen == 0) ? NULL :
2747 jlsValue->char_at_addr(jlsOffset);
2748 assert(TypeArrayKlass::cast(jlsValue->klass())->element_type() == T_CHAR, "compressed string");
2749 (void) UNICODE::as_utf8(jlsPos, jlsLen, (char *)dst, max_dtrace_string_size);
2750 }
2751 #endif // ndef HAVE_DTRACE_H
2753 int SharedRuntime::convert_ints_to_longints_argcnt(int in_args_count, BasicType* in_sig_bt) {
2754 int argcnt = in_args_count;
2755 if (CCallingConventionRequiresIntsAsLongs) {
2756 for (int in = 0; in < in_args_count; in++) {
2757 BasicType bt = in_sig_bt[in];
2758 switch (bt) {
2759 case T_BOOLEAN:
2760 case T_CHAR:
2761 case T_BYTE:
2762 case T_SHORT:
2763 case T_INT:
2764 argcnt++;
2765 break;
2766 default:
2767 break;
2768 }
2769 }
2770 } else {
2771 assert(0, "This should not be needed on this platform");
2772 }
2774 return argcnt;
2775 }
2777 void SharedRuntime::convert_ints_to_longints(int i2l_argcnt, int& in_args_count,
2778 BasicType*& in_sig_bt, VMRegPair*& in_regs) {
2779 if (CCallingConventionRequiresIntsAsLongs) {
2780 VMRegPair *new_in_regs = NEW_RESOURCE_ARRAY(VMRegPair, i2l_argcnt);
2781 BasicType *new_in_sig_bt = NEW_RESOURCE_ARRAY(BasicType, i2l_argcnt);
2783 int argcnt = 0;
2784 for (int in = 0; in < in_args_count; in++, argcnt++) {
2785 BasicType bt = in_sig_bt[in];
2786 VMRegPair reg = in_regs[in];
2787 switch (bt) {
2788 case T_BOOLEAN:
2789 case T_CHAR:
2790 case T_BYTE:
2791 case T_SHORT:
2792 case T_INT:
2793 // Convert (bt) to (T_LONG,bt).
2794 new_in_sig_bt[argcnt ] = T_LONG;
2795 new_in_sig_bt[argcnt+1] = bt;
2796 assert(reg.first()->is_valid() && !reg.second()->is_valid(), "");
2797 new_in_regs[argcnt ].set2(reg.first());
2798 new_in_regs[argcnt+1].set_bad();
2799 argcnt++;
2800 break;
2801 default:
2802 // No conversion needed.
2803 new_in_sig_bt[argcnt] = bt;
2804 new_in_regs[argcnt] = reg;
2805 break;
2806 }
2807 }
2808 assert(argcnt == i2l_argcnt, "must match");
2810 in_regs = new_in_regs;
2811 in_sig_bt = new_in_sig_bt;
2812 in_args_count = i2l_argcnt;
2813 } else {
2814 assert(0, "This should not be needed on this platform");
2815 }
2816 }
2818 // -------------------------------------------------------------------------
2819 // Java-Java calling convention
2820 // (what you use when Java calls Java)
2822 //------------------------------name_for_receiver----------------------------------
2823 // For a given signature, return the VMReg for parameter 0.
2824 VMReg SharedRuntime::name_for_receiver() {
2825 VMRegPair regs;
2826 BasicType sig_bt = T_OBJECT;
2827 (void) java_calling_convention(&sig_bt, ®s, 1, true);
2828 // Return argument 0 register. In the LP64 build pointers
2829 // take 2 registers, but the VM wants only the 'main' name.
2830 return regs.first();
2831 }
2833 VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) {
2834 // This method is returning a data structure allocating as a
2835 // ResourceObject, so do not put any ResourceMarks in here.
2836 char *s = sig->as_C_string();
2837 int len = (int)strlen(s);
2838 s++; len--; // Skip opening paren
2839 char *t = s+len;
2840 while( *(--t) != ')' ) ; // Find close paren
2842 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, 256 );
2843 VMRegPair *regs = NEW_RESOURCE_ARRAY( VMRegPair, 256 );
2844 int cnt = 0;
2845 if (has_receiver) {
2846 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
2847 }
2849 while( s < t ) {
2850 switch( *s++ ) { // Switch on signature character
2851 case 'B': sig_bt[cnt++] = T_BYTE; break;
2852 case 'C': sig_bt[cnt++] = T_CHAR; break;
2853 case 'D': sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break;
2854 case 'F': sig_bt[cnt++] = T_FLOAT; break;
2855 case 'I': sig_bt[cnt++] = T_INT; break;
2856 case 'J': sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break;
2857 case 'S': sig_bt[cnt++] = T_SHORT; break;
2858 case 'Z': sig_bt[cnt++] = T_BOOLEAN; break;
2859 case 'V': sig_bt[cnt++] = T_VOID; break;
2860 case 'L': // Oop
2861 while( *s++ != ';' ) ; // Skip signature
2862 sig_bt[cnt++] = T_OBJECT;
2863 break;
2864 case '[': { // Array
2865 do { // Skip optional size
2866 while( *s >= '0' && *s <= '9' ) s++;
2867 } while( *s++ == '[' ); // Nested arrays?
2868 // Skip element type
2869 if( s[-1] == 'L' )
2870 while( *s++ != ';' ) ; // Skip signature
2871 sig_bt[cnt++] = T_ARRAY;
2872 break;
2873 }
2874 default : ShouldNotReachHere();
2875 }
2876 }
2878 if (has_appendix) {
2879 sig_bt[cnt++] = T_OBJECT;
2880 }
2882 assert( cnt < 256, "grow table size" );
2884 int comp_args_on_stack;
2885 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true);
2887 // the calling convention doesn't count out_preserve_stack_slots so
2888 // we must add that in to get "true" stack offsets.
2890 if (comp_args_on_stack) {
2891 for (int i = 0; i < cnt; i++) {
2892 VMReg reg1 = regs[i].first();
2893 if( reg1->is_stack()) {
2894 // Yuck
2895 reg1 = reg1->bias(out_preserve_stack_slots());
2896 }
2897 VMReg reg2 = regs[i].second();
2898 if( reg2->is_stack()) {
2899 // Yuck
2900 reg2 = reg2->bias(out_preserve_stack_slots());
2901 }
2902 regs[i].set_pair(reg2, reg1);
2903 }
2904 }
2906 // results
2907 *arg_size = cnt;
2908 return regs;
2909 }
2911 // OSR Migration Code
2912 //
2913 // This code is used convert interpreter frames into compiled frames. It is
2914 // called from very start of a compiled OSR nmethod. A temp array is
2915 // allocated to hold the interesting bits of the interpreter frame. All
2916 // active locks are inflated to allow them to move. The displaced headers and
2917 // active interpeter locals are copied into the temp buffer. Then we return
2918 // back to the compiled code. The compiled code then pops the current
2919 // interpreter frame off the stack and pushes a new compiled frame. Then it
2920 // copies the interpreter locals and displaced headers where it wants.
2921 // Finally it calls back to free the temp buffer.
2922 //
2923 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
2925 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) )
2927 //
2928 // This code is dependent on the memory layout of the interpreter local
2929 // array and the monitors. On all of our platforms the layout is identical
2930 // so this code is shared. If some platform lays the their arrays out
2931 // differently then this code could move to platform specific code or
2932 // the code here could be modified to copy items one at a time using
2933 // frame accessor methods and be platform independent.
2935 frame fr = thread->last_frame();
2936 assert( fr.is_interpreted_frame(), "" );
2937 assert( fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks" );
2939 // Figure out how many monitors are active.
2940 int active_monitor_count = 0;
2941 for( BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
2942 kptr < fr.interpreter_frame_monitor_begin();
2943 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
2944 if( kptr->obj() != NULL ) active_monitor_count++;
2945 }
2947 // QQQ we could place number of active monitors in the array so that compiled code
2948 // could double check it.
2950 Method* moop = fr.interpreter_frame_method();
2951 int max_locals = moop->max_locals();
2952 // Allocate temp buffer, 1 word per local & 2 per active monitor
2953 int buf_size_words = max_locals + active_monitor_count*2;
2954 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode);
2956 // Copy the locals. Order is preserved so that loading of longs works.
2957 // Since there's no GC I can copy the oops blindly.
2958 assert( sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
2959 Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
2960 (HeapWord*)&buf[0],
2961 max_locals);
2963 // Inflate locks. Copy the displaced headers. Be careful, there can be holes.
2964 int i = max_locals;
2965 for( BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
2966 kptr2 < fr.interpreter_frame_monitor_begin();
2967 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
2968 if( kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array
2969 BasicLock *lock = kptr2->lock();
2970 // Inflate so the displaced header becomes position-independent
2971 if (lock->displaced_header()->is_unlocked())
2972 ObjectSynchronizer::inflate_helper(kptr2->obj());
2973 // Now the displaced header is free to move
2974 buf[i++] = (intptr_t)lock->displaced_header();
2975 buf[i++] = cast_from_oop<intptr_t>(kptr2->obj());
2976 }
2977 }
2978 assert( i - max_locals == active_monitor_count*2, "found the expected number of monitors" );
2980 return buf;
2981 JRT_END
2983 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
2984 FREE_C_HEAP_ARRAY(intptr_t,buf, mtCode);
2985 JRT_END
2987 bool AdapterHandlerLibrary::contains(CodeBlob* b) {
2988 AdapterHandlerTableIterator iter(_adapters);
2989 while (iter.has_next()) {
2990 AdapterHandlerEntry* a = iter.next();
2991 if ( b == CodeCache::find_blob(a->get_i2c_entry()) ) return true;
2992 }
2993 return false;
2994 }
2996 void AdapterHandlerLibrary::print_handler_on(outputStream* st, CodeBlob* b) {
2997 AdapterHandlerTableIterator iter(_adapters);
2998 while (iter.has_next()) {
2999 AdapterHandlerEntry* a = iter.next();
3000 if (b == CodeCache::find_blob(a->get_i2c_entry())) {
3001 st->print("Adapter for signature: ");
3002 a->print_adapter_on(tty);
3003 return;
3004 }
3005 }
3006 assert(false, "Should have found handler");
3007 }
3009 void AdapterHandlerEntry::print_adapter_on(outputStream* st) const {
3010 st->print_cr("AHE@" INTPTR_FORMAT ": %s i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT,
3011 (intptr_t) this, fingerprint()->as_string(),
3012 get_i2c_entry(), get_c2i_entry(), get_c2i_unverified_entry());
3014 }
3016 #ifndef PRODUCT
3018 void AdapterHandlerLibrary::print_statistics() {
3019 _adapters->print_statistics();
3020 }
3022 #endif /* PRODUCT */