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 */
24
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
84
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;
92
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;
97
98 #ifdef COMPILER2
99 UncommonTrapBlob* SharedRuntime::_uncommon_trap_blob;
100 #endif // COMPILER2
101
102
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");
111
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);
120
121 generate_deopt_blob();
122
123 #ifdef COMPILER2
124 generate_uncommon_trap_blob();
125 #endif // COMPILER2
126 }
127
128 #include <math.h>
129
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 */
137
138 // Implementation of SharedRuntime
139
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;
150
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;
162
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;
186
187 int SharedRuntime::_ICmiss_index = 0;
188 int SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count];
189 address SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count];
190
191
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 }
204
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
217
218 #if INCLUDE_ALL_GCS
219
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
230
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
235
236 #endif // INCLUDE_ALL_GCS
237
238
239 JRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x))
240 return x * y;
241 JRT_END
242
243
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
251
252
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
260
261
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);
266
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
282
283
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
297
298 #ifdef __SOFTFP__
299 JRT_LEAF(jfloat, SharedRuntime::fadd(jfloat x, jfloat y))
300 return x + y;
301 JRT_END
302
303 JRT_LEAF(jfloat, SharedRuntime::fsub(jfloat x, jfloat y))
304 return x - y;
305 JRT_END
306
307 JRT_LEAF(jfloat, SharedRuntime::fmul(jfloat x, jfloat y))
308 return x * y;
309 JRT_END
310
311 JRT_LEAF(jfloat, SharedRuntime::fdiv(jfloat x, jfloat y))
312 return x / y;
313 JRT_END
314
315 JRT_LEAF(jdouble, SharedRuntime::dadd(jdouble x, jdouble y))
316 return x + y;
317 JRT_END
318
319 JRT_LEAF(jdouble, SharedRuntime::dsub(jdouble x, jdouble y))
320 return x - y;
321 JRT_END
322
323 JRT_LEAF(jdouble, SharedRuntime::dmul(jdouble x, jdouble y))
324 return x * y;
325 JRT_END
326
327 JRT_LEAF(jdouble, SharedRuntime::ddiv(jdouble x, jdouble y))
328 return x / y;
329 JRT_END
330
331 JRT_LEAF(jfloat, SharedRuntime::i2f(jint x))
332 return (jfloat)x;
333 JRT_END
334
335 JRT_LEAF(jdouble, SharedRuntime::i2d(jint x))
336 return (jdouble)x;
337 JRT_END
338
339 JRT_LEAF(jdouble, SharedRuntime::f2d(jfloat x))
340 return (jdouble)x;
341 JRT_END
342
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
346
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
350
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
354
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
358
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
363
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
367
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
371
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
375
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
379
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
383
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
387
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
391
392 // Intrinsics make gcc generate code for these.
393 float SharedRuntime::fneg(float f) {
394 return -f;
395 }
396
397 double SharedRuntime::dneg(double f) {
398 return -f;
399 }
400
401 #endif // __SOFTFP__
402
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 }
408
409 #endif
410
411 #if defined(__SOFTFP__) || defined(PPC32)
412 double SharedRuntime::dsqrt(double f) {
413 return sqrt(f);
414 }
415 #endif
416
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
426
427
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
437
438
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
448
449
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
459
460
461 JRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x))
462 return (jfloat)x;
463 JRT_END
464
465
466 JRT_LEAF(jfloat, SharedRuntime::l2f(jlong x))
467 return (jfloat)x;
468 JRT_END
469
470
471 JRT_LEAF(jdouble, SharedRuntime::l2d(jlong x))
472 return (jdouble)x;
473 JRT_END
474
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.
480
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));
483
484 // Reset method handle flag.
485 thread->set_is_method_handle_return(false);
486
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 }
509
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 }
518
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!");
521
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
529
530 ShouldNotReachHere();
531 return NULL;
532 }
533
534
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
538
539
540 address SharedRuntime::get_poll_stub(address pc) {
541 address stub;
542 // Look up the code blob
543 CodeBlob *cb = CodeCache::find_blob(pc);
544
545 // Should be an nmethod
546 assert( cb && cb->is_nmethod(), "safepoint polling: pc must refer to an nmethod" );
547
548 // Look up the relocation information
549 assert( ((nmethod*)cb)->is_at_poll_or_poll_return(pc),
550 "safepoint polling: type must be poll" );
551
552 assert( ((NativeInstruction*)pc)->is_safepoint_poll(),
553 "Only polling locations are used for safepoint");
554
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 }
583
584
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 }
593
594
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 }
604
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 }
609
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");
618
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.
623
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
635
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;
642
643 ScopeDesc* sd = nm->scope_desc_at(ret_pc);
644 // determine handler bci, if any
645 EXCEPTION_MARK;
646
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 }
687
688 // found handling method => lookup exception handler
689 int catch_pco = ret_pc - nm->code_begin();
690
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 }
702
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
709
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 }
721
722 return nm->code_begin() + t->pco();
723 }
724
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
729
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
734
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
738
739 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* thread))
740 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
741 JRT_END
742
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
748
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
760
761 address SharedRuntime::continuation_for_implicit_exception(JavaThread* thread,
762 address pc,
763 SharedRuntime::ImplicitExceptionKind exception_kind)
764 {
765 address target_pc = NULL;
766
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 Events::log_exception(thread, "StackOverflowError at " INTPTR_FORMAT, pc);
787 return StubRoutines::throw_StackOverflowError_entry();
788 }
789
790 case IMPLICIT_NULL: {
791 if (VtableStubs::contains(pc)) {
792 // We haven't yet entered the callee frame. Fabricate an
793 // exception and begin dispatching it in the caller. Since
794 // the caller was at a call site, it's safe to destroy all
795 // caller-saved registers, as these entry points do.
796 VtableStub* vt_stub = VtableStubs::stub_containing(pc);
797
798 // If vt_stub is NULL, then return NULL to signal handler to report the SEGV error.
799 if (vt_stub == NULL) return NULL;
800
801 if (vt_stub->is_abstract_method_error(pc)) {
802 assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs");
803 Events::log_exception(thread, "AbstractMethodError at " INTPTR_FORMAT, pc);
804 return StubRoutines::throw_AbstractMethodError_entry();
805 } else {
806 Events::log_exception(thread, "NullPointerException at vtable entry " INTPTR_FORMAT, pc);
807 return StubRoutines::throw_NullPointerException_at_call_entry();
808 }
809 } else {
810 CodeBlob* cb = CodeCache::find_blob(pc);
811
812 // If code blob is NULL, then return NULL to signal handler to report the SEGV error.
813 if (cb == NULL) return NULL;
814
815 // Exception happened in CodeCache. Must be either:
816 // 1. Inline-cache check in C2I handler blob,
817 // 2. Inline-cache check in nmethod, or
818 // 3. Implict null exception in nmethod
819
820 if (!cb->is_nmethod()) {
821 bool is_in_blob = cb->is_adapter_blob() || cb->is_method_handles_adapter_blob();
822 if (!is_in_blob) {
823 cb->print();
824 fatal(err_msg("exception happened outside interpreter, nmethods and vtable stubs at pc " INTPTR_FORMAT, pc));
825 }
826 Events::log_exception(thread, "NullPointerException in code blob at " INTPTR_FORMAT, pc);
827 // There is no handler here, so we will simply unwind.
828 return StubRoutines::throw_NullPointerException_at_call_entry();
829 }
830
831 // Otherwise, it's an nmethod. Consult its exception handlers.
832 nmethod* nm = (nmethod*)cb;
833 if (nm->inlinecache_check_contains(pc)) {
834 // exception happened inside inline-cache check code
835 // => the nmethod is not yet active (i.e., the frame
836 // is not set up yet) => use return address pushed by
837 // caller => don't push another return address
838 Events::log_exception(thread, "NullPointerException in IC check " INTPTR_FORMAT, pc);
839 return StubRoutines::throw_NullPointerException_at_call_entry();
840 }
841
842 if (nm->method()->is_method_handle_intrinsic()) {
843 // exception happened inside MH dispatch code, similar to a vtable stub
844 Events::log_exception(thread, "NullPointerException in MH adapter " INTPTR_FORMAT, pc);
845 return StubRoutines::throw_NullPointerException_at_call_entry();
846 }
847
848 #ifndef PRODUCT
849 _implicit_null_throws++;
850 #endif
851 target_pc = nm->continuation_for_implicit_exception(pc);
852 // If there's an unexpected fault, target_pc might be NULL,
853 // in which case we want to fall through into the normal
854 // error handling code.
855 }
856
857 break; // fall through
858 }
859
860
861 case IMPLICIT_DIVIDE_BY_ZERO: {
862 nmethod* nm = CodeCache::find_nmethod(pc);
863 guarantee(nm != NULL, "must have containing nmethod for implicit division-by-zero exceptions");
864 #ifndef PRODUCT
865 _implicit_div0_throws++;
866 #endif
867 target_pc = nm->continuation_for_implicit_exception(pc);
868 // If there's an unexpected fault, target_pc might be NULL,
869 // in which case we want to fall through into the normal
870 // error handling code.
871 break; // fall through
872 }
873
874 default: ShouldNotReachHere();
875 }
876
877 assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind");
878
879 // for AbortVMOnException flag
880 NOT_PRODUCT(Exceptions::debug_check_abort("java.lang.NullPointerException"));
881 if (exception_kind == IMPLICIT_NULL) {
882 Events::log_exception(thread, "Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
883 } else {
884 Events::log_exception(thread, "Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc);
885 }
886 return target_pc;
887 }
888
889 ShouldNotReachHere();
890 return NULL;
891 }
892
893
894 /**
895 * Throws an java/lang/UnsatisfiedLinkError. The address of this method is
896 * installed in the native function entry of all native Java methods before
897 * they get linked to their actual native methods.
898 *
899 * \note
900 * This method actually never gets called! The reason is because
901 * the interpreter's native entries call NativeLookup::lookup() which
902 * throws the exception when the lookup fails. The exception is then
903 * caught and forwarded on the return from NativeLookup::lookup() call
904 * before the call to the native function. This might change in the future.
905 */
906 JNI_ENTRY(void*, throw_unsatisfied_link_error(JNIEnv* env, ...))
907 {
908 // We return a bad value here to make sure that the exception is
909 // forwarded before we look at the return value.
910 THROW_(vmSymbols::java_lang_UnsatisfiedLinkError(), (void*)badJNIHandle);
911 }
912 JNI_END
913
914 address SharedRuntime::native_method_throw_unsatisfied_link_error_entry() {
915 return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error);
916 }
917
918
919 #ifndef PRODUCT
920 JRT_ENTRY(intptr_t, SharedRuntime::trace_bytecode(JavaThread* thread, intptr_t preserve_this_value, intptr_t tos, intptr_t tos2))
921 const frame f = thread->last_frame();
922 assert(f.is_interpreted_frame(), "must be an interpreted frame");
923 #ifndef PRODUCT
924 methodHandle mh(THREAD, f.interpreter_frame_method());
925 BytecodeTracer::trace(mh, f.interpreter_frame_bcp(), tos, tos2);
926 #endif // !PRODUCT
927 return preserve_this_value;
928 JRT_END
929 #endif // !PRODUCT
930
931
932 JRT_ENTRY(void, SharedRuntime::yield_all(JavaThread* thread, int attempts))
933 os::yield_all(attempts);
934 JRT_END
935
936
937 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* thread, oopDesc* obj))
938 assert(obj->is_oop(), "must be a valid oop");
939 assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
940 InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
941 JRT_END
942
943
944 jlong SharedRuntime::get_java_tid(Thread* thread) {
945 if (thread != NULL) {
946 if (thread->is_Java_thread()) {
947 oop obj = ((JavaThread*)thread)->threadObj();
948 return (obj == NULL) ? 0 : java_lang_Thread::thread_id(obj);
949 }
950 }
951 return 0;
952 }
953
954 /**
955 * This function ought to be a void function, but cannot be because
956 * it gets turned into a tail-call on sparc, which runs into dtrace bug
957 * 6254741. Once that is fixed we can remove the dummy return value.
958 */
959 int SharedRuntime::dtrace_object_alloc(oopDesc* o) {
960 return dtrace_object_alloc_base(Thread::current(), o);
961 }
962
963 int SharedRuntime::dtrace_object_alloc_base(Thread* thread, oopDesc* o) {
964 assert(DTraceAllocProbes, "wrong call");
965 Klass* klass = o->klass();
966 int size = o->size();
967 Symbol* name = klass->name();
968 #ifndef USDT2
969 HS_DTRACE_PROBE4(hotspot, object__alloc, get_java_tid(thread),
970 name->bytes(), name->utf8_length(), size * HeapWordSize);
971 #else /* USDT2 */
972 HOTSPOT_OBJECT_ALLOC(
973 get_java_tid(thread),
974 (char *) name->bytes(), name->utf8_length(), size * HeapWordSize);
975 #endif /* USDT2 */
976 return 0;
977 }
978
979 JRT_LEAF(int, SharedRuntime::dtrace_method_entry(
980 JavaThread* thread, Method* method))
981 assert(DTraceMethodProbes, "wrong call");
982 Symbol* kname = method->klass_name();
983 Symbol* name = method->name();
984 Symbol* sig = method->signature();
985 #ifndef USDT2
986 HS_DTRACE_PROBE7(hotspot, method__entry, get_java_tid(thread),
987 kname->bytes(), kname->utf8_length(),
988 name->bytes(), name->utf8_length(),
989 sig->bytes(), sig->utf8_length());
990 #else /* USDT2 */
991 HOTSPOT_METHOD_ENTRY(
992 get_java_tid(thread),
993 (char *) kname->bytes(), kname->utf8_length(),
994 (char *) name->bytes(), name->utf8_length(),
995 (char *) sig->bytes(), sig->utf8_length());
996 #endif /* USDT2 */
997 return 0;
998 JRT_END
999
1000 JRT_LEAF(int, SharedRuntime::dtrace_method_exit(
1001 JavaThread* thread, Method* method))
1002 assert(DTraceMethodProbes, "wrong call");
1003 Symbol* kname = method->klass_name();
1004 Symbol* name = method->name();
1005 Symbol* sig = method->signature();
1006 #ifndef USDT2
1007 HS_DTRACE_PROBE7(hotspot, method__return, get_java_tid(thread),
1008 kname->bytes(), kname->utf8_length(),
1009 name->bytes(), name->utf8_length(),
1010 sig->bytes(), sig->utf8_length());
1011 #else /* USDT2 */
1012 HOTSPOT_METHOD_RETURN(
1013 get_java_tid(thread),
1014 (char *) kname->bytes(), kname->utf8_length(),
1015 (char *) name->bytes(), name->utf8_length(),
1016 (char *) sig->bytes(), sig->utf8_length());
1017 #endif /* USDT2 */
1018 return 0;
1019 JRT_END
1020
1021
1022 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode)
1023 // for a call current in progress, i.e., arguments has been pushed on stack
1024 // put callee has not been invoked yet. Used by: resolve virtual/static,
1025 // vtable updates, etc. Caller frame must be compiled.
1026 Handle SharedRuntime::find_callee_info(JavaThread* thread, Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) {
1027 ResourceMark rm(THREAD);
1028
1029 // last java frame on stack (which includes native call frames)
1030 vframeStream vfst(thread, true); // Do not skip and javaCalls
1031
1032 return find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(Handle()));
1033 }
1034
1035
1036 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode
1037 // for a call current in progress, i.e., arguments has been pushed on stack
1038 // but callee has not been invoked yet. Caller frame must be compiled.
1039 Handle SharedRuntime::find_callee_info_helper(JavaThread* thread,
1040 vframeStream& vfst,
1041 Bytecodes::Code& bc,
1042 CallInfo& callinfo, TRAPS) {
1043 Handle receiver;
1044 Handle nullHandle; //create a handy null handle for exception returns
1045
1046 assert(!vfst.at_end(), "Java frame must exist");
1047
1048 // Find caller and bci from vframe
1049 methodHandle caller(THREAD, vfst.method());
1050 int bci = vfst.bci();
1051
1052 // Find bytecode
1053 Bytecode_invoke bytecode(caller, bci);
1054 bc = bytecode.invoke_code();
1055 int bytecode_index = bytecode.index();
1056
1057 // Find receiver for non-static call
1058 if (bc != Bytecodes::_invokestatic &&
1059 bc != Bytecodes::_invokedynamic &&
1060 bc != Bytecodes::_invokehandle) {
1061 // This register map must be update since we need to find the receiver for
1062 // compiled frames. The receiver might be in a register.
1063 RegisterMap reg_map2(thread);
1064 frame stubFrame = thread->last_frame();
1065 // Caller-frame is a compiled frame
1066 frame callerFrame = stubFrame.sender(®_map2);
1067
1068 methodHandle callee = bytecode.static_target(CHECK_(nullHandle));
1069 if (callee.is_null()) {
1070 THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle);
1071 }
1072 // Retrieve from a compiled argument list
1073 receiver = Handle(THREAD, callerFrame.retrieve_receiver(®_map2));
1074
1075 if (receiver.is_null()) {
1076 THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle);
1077 }
1078 }
1079
1080 // Resolve method. This is parameterized by bytecode.
1081 constantPoolHandle constants(THREAD, caller->constants());
1082 assert(receiver.is_null() || receiver->is_oop(), "wrong receiver");
1083 LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_(nullHandle));
1084
1085 #ifdef ASSERT
1086 // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls
1087 if (bc != Bytecodes::_invokestatic && bc != Bytecodes::_invokedynamic && bc != Bytecodes::_invokehandle) {
1088 assert(receiver.not_null(), "should have thrown exception");
1089 KlassHandle receiver_klass(THREAD, receiver->klass());
1090 Klass* rk = constants->klass_ref_at(bytecode_index, CHECK_(nullHandle));
1091 // klass is already loaded
1092 KlassHandle static_receiver_klass(THREAD, rk);
1093 // Method handle invokes might have been optimized to a direct call
1094 // so don't check for the receiver class.
1095 // FIXME this weakens the assert too much
1096 methodHandle callee = callinfo.selected_method();
1097 assert(receiver_klass->is_subtype_of(static_receiver_klass()) ||
1098 callee->is_method_handle_intrinsic() ||
1099 callee->is_compiled_lambda_form(),
1100 "actual receiver must be subclass of static receiver klass");
1101 if (receiver_klass->oop_is_instance()) {
1102 if (InstanceKlass::cast(receiver_klass())->is_not_initialized()) {
1103 tty->print_cr("ERROR: Klass not yet initialized!!");
1104 receiver_klass()->print();
1105 }
1106 assert(!InstanceKlass::cast(receiver_klass())->is_not_initialized(), "receiver_klass must be initialized");
1107 }
1108 }
1109 #endif
1110
1111 return receiver;
1112 }
1113
1114 methodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) {
1115 ResourceMark rm(THREAD);
1116 // We need first to check if any Java activations (compiled, interpreted)
1117 // exist on the stack since last JavaCall. If not, we need
1118 // to get the target method from the JavaCall wrapper.
1119 vframeStream vfst(thread, true); // Do not skip any javaCalls
1120 methodHandle callee_method;
1121 if (vfst.at_end()) {
1122 // No Java frames were found on stack since we did the JavaCall.
1123 // Hence the stack can only contain an entry_frame. We need to
1124 // find the target method from the stub frame.
1125 RegisterMap reg_map(thread, false);
1126 frame fr = thread->last_frame();
1127 assert(fr.is_runtime_frame(), "must be a runtimeStub");
1128 fr = fr.sender(®_map);
1129 assert(fr.is_entry_frame(), "must be");
1130 // fr is now pointing to the entry frame.
1131 callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method());
1132 assert(fr.entry_frame_call_wrapper()->receiver() == NULL || !callee_method->is_static(), "non-null receiver for static call??");
1133 } else {
1134 Bytecodes::Code bc;
1135 CallInfo callinfo;
1136 find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle()));
1137 callee_method = callinfo.selected_method();
1138 }
1139 assert(callee_method()->is_method(), "must be");
1140 return callee_method;
1141 }
1142
1143 // Resolves a call.
1144 methodHandle SharedRuntime::resolve_helper(JavaThread *thread,
1145 bool is_virtual,
1146 bool is_optimized, TRAPS) {
1147 methodHandle callee_method;
1148 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1149 if (JvmtiExport::can_hotswap_or_post_breakpoint()) {
1150 int retry_count = 0;
1151 while (!HAS_PENDING_EXCEPTION && callee_method->is_old() &&
1152 callee_method->method_holder() != SystemDictionary::Object_klass()) {
1153 // If has a pending exception then there is no need to re-try to
1154 // resolve this method.
1155 // If the method has been redefined, we need to try again.
1156 // Hack: we have no way to update the vtables of arrays, so don't
1157 // require that java.lang.Object has been updated.
1158
1159 // It is very unlikely that method is redefined more than 100 times
1160 // in the middle of resolve. If it is looping here more than 100 times
1161 // means then there could be a bug here.
1162 guarantee((retry_count++ < 100),
1163 "Could not resolve to latest version of redefined method");
1164 // method is redefined in the middle of resolve so re-try.
1165 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1166 }
1167 }
1168 return callee_method;
1169 }
1170
1171 // Resolves a call. The compilers generate code for calls that go here
1172 // and are patched with the real destination of the call.
1173 methodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread,
1174 bool is_virtual,
1175 bool is_optimized, TRAPS) {
1176
1177 ResourceMark rm(thread);
1178 RegisterMap cbl_map(thread, false);
1179 frame caller_frame = thread->last_frame().sender(&cbl_map);
1180
1181 CodeBlob* caller_cb = caller_frame.cb();
1182 guarantee(caller_cb != NULL && caller_cb->is_nmethod(), "must be called from nmethod");
1183 nmethod* caller_nm = caller_cb->as_nmethod_or_null();
1184
1185 // make sure caller is not getting deoptimized
1186 // and removed before we are done with it.
1187 // CLEANUP - with lazy deopt shouldn't need this lock
1188 nmethodLocker caller_lock(caller_nm);
1189
1190 // determine call info & receiver
1191 // note: a) receiver is NULL for static calls
1192 // b) an exception is thrown if receiver is NULL for non-static calls
1193 CallInfo call_info;
1194 Bytecodes::Code invoke_code = Bytecodes::_illegal;
1195 Handle receiver = find_callee_info(thread, invoke_code,
1196 call_info, CHECK_(methodHandle()));
1197 methodHandle callee_method = call_info.selected_method();
1198
1199 assert((!is_virtual && invoke_code == Bytecodes::_invokestatic ) ||
1200 (!is_virtual && invoke_code == Bytecodes::_invokehandle ) ||
1201 (!is_virtual && invoke_code == Bytecodes::_invokedynamic) ||
1202 ( is_virtual && invoke_code != Bytecodes::_invokestatic ), "inconsistent bytecode");
1203
1204 // We do not patch the call site if the caller nmethod has been made non-entrant.
1205 if (!caller_nm->is_in_use()) {
1206 return callee_method;
1207 }
1208
1209 #ifndef PRODUCT
1210 // tracing/debugging/statistics
1211 int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
1212 (is_virtual) ? (&_resolve_virtual_ctr) :
1213 (&_resolve_static_ctr);
1214 Atomic::inc(addr);
1215
1216 if (TraceCallFixup) {
1217 ResourceMark rm(thread);
1218 tty->print("resolving %s%s (%s) call to",
1219 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
1220 Bytecodes::name(invoke_code));
1221 callee_method->print_short_name(tty);
1222 tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT, caller_frame.pc(), callee_method->code());
1223 }
1224 #endif
1225
1226 // JSR 292 key invariant:
1227 // If the resolved method is a MethodHandle invoke target the call
1228 // site must be a MethodHandle call site, because the lambda form might tail-call
1229 // leaving the stack in a state unknown to either caller or callee
1230 // TODO detune for now but we might need it again
1231 // assert(!callee_method->is_compiled_lambda_form() ||
1232 // caller_nm->is_method_handle_return(caller_frame.pc()), "must be MH call site");
1233
1234 // Compute entry points. This might require generation of C2I converter
1235 // frames, so we cannot be holding any locks here. Furthermore, the
1236 // computation of the entry points is independent of patching the call. We
1237 // always return the entry-point, but we only patch the stub if the call has
1238 // not been deoptimized. Return values: For a virtual call this is an
1239 // (cached_oop, destination address) pair. For a static call/optimized
1240 // virtual this is just a destination address.
1241
1242 StaticCallInfo static_call_info;
1243 CompiledICInfo virtual_call_info;
1244
1245 // Make sure the callee nmethod does not get deoptimized and removed before
1246 // we are done patching the code.
1247 nmethod* callee_nm = callee_method->code();
1248 if (callee_nm != NULL && !callee_nm->is_in_use()) {
1249 // Patch call site to C2I adapter if callee nmethod is deoptimized or unloaded.
1250 callee_nm = NULL;
1251 }
1252 nmethodLocker nl_callee(callee_nm);
1253 #ifdef ASSERT
1254 address dest_entry_point = callee_nm == NULL ? 0 : callee_nm->entry_point(); // used below
1255 #endif
1256
1257 if (is_virtual) {
1258 assert(receiver.not_null() || invoke_code == Bytecodes::_invokehandle, "sanity check");
1259 bool static_bound = call_info.resolved_method()->can_be_statically_bound();
1260 KlassHandle h_klass(THREAD, invoke_code == Bytecodes::_invokehandle ? NULL : receiver->klass());
1261 CompiledIC::compute_monomorphic_entry(callee_method, h_klass,
1262 is_optimized, static_bound, virtual_call_info,
1263 CHECK_(methodHandle()));
1264 } else {
1265 // static call
1266 CompiledStaticCall::compute_entry(callee_method, static_call_info);
1267 }
1268
1269 // grab lock, check for deoptimization and potentially patch caller
1270 {
1271 MutexLocker ml_patch(CompiledIC_lock);
1272
1273 // Lock blocks for safepoint during which both nmethods can change state.
1274
1275 // Now that we are ready to patch if the Method* was redefined then
1276 // don't update call site and let the caller retry.
1277 // Don't update call site if caller nmethod has been made non-entrant
1278 // as it is a waste of time.
1279 // Don't update call site if callee nmethod was unloaded or deoptimized.
1280 // Don't update call site if callee nmethod was replaced by an other nmethod
1281 // which may happen when multiply alive nmethod (tiered compilation)
1282 // will be supported.
1283 if (!callee_method->is_old() && caller_nm->is_in_use() &&
1284 (callee_nm == NULL || callee_nm->is_in_use() && (callee_method->code() == callee_nm))) {
1285 #ifdef ASSERT
1286 // We must not try to patch to jump to an already unloaded method.
1287 if (dest_entry_point != 0) {
1288 CodeBlob* cb = CodeCache::find_blob(dest_entry_point);
1289 assert((cb != NULL) && cb->is_nmethod() && (((nmethod*)cb) == callee_nm),
1290 "should not call unloaded nmethod");
1291 }
1292 #endif
1293 if (is_virtual) {
1294 nmethod* nm = callee_nm;
1295 if (nm == NULL) CodeCache::find_blob(caller_frame.pc());
1296 CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc());
1297 if (inline_cache->is_clean()) {
1298 inline_cache->set_to_monomorphic(virtual_call_info);
1299 }
1300 } else {
1301 CompiledStaticCall* ssc = compiledStaticCall_before(caller_frame.pc());
1302 if (ssc->is_clean()) ssc->set(static_call_info);
1303 }
1304 }
1305
1306 } // unlock CompiledIC_lock
1307
1308 return callee_method;
1309 }
1310
1311
1312 // Inline caches exist only in compiled code
1313 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread))
1314 #ifdef ASSERT
1315 RegisterMap reg_map(thread, false);
1316 frame stub_frame = thread->last_frame();
1317 assert(stub_frame.is_runtime_frame(), "sanity check");
1318 frame caller_frame = stub_frame.sender(®_map);
1319 assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame");
1320 #endif /* ASSERT */
1321
1322 methodHandle callee_method;
1323 JRT_BLOCK
1324 callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL);
1325 // Return Method* through TLS
1326 thread->set_vm_result_2(callee_method());
1327 JRT_BLOCK_END
1328 // return compiled code entry point after potential safepoints
1329 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1330 return callee_method->verified_code_entry();
1331 JRT_END
1332
1333
1334 // Handle call site that has been made non-entrant
1335 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread))
1336 // 6243940 We might end up in here if the callee is deoptimized
1337 // as we race to call it. We don't want to take a safepoint if
1338 // the caller was interpreted because the caller frame will look
1339 // interpreted to the stack walkers and arguments are now
1340 // "compiled" so it is much better to make this transition
1341 // invisible to the stack walking code. The i2c path will
1342 // place the callee method in the callee_target. It is stashed
1343 // there because if we try and find the callee by normal means a
1344 // safepoint is possible and have trouble gc'ing the compiled args.
1345 RegisterMap reg_map(thread, false);
1346 frame stub_frame = thread->last_frame();
1347 assert(stub_frame.is_runtime_frame(), "sanity check");
1348 frame caller_frame = stub_frame.sender(®_map);
1349
1350 if (caller_frame.is_interpreted_frame() ||
1351 caller_frame.is_entry_frame()) {
1352 Method* callee = thread->callee_target();
1353 guarantee(callee != NULL && callee->is_method(), "bad handshake");
1354 thread->set_vm_result_2(callee);
1355 thread->set_callee_target(NULL);
1356 return callee->get_c2i_entry();
1357 }
1358
1359 // Must be compiled to compiled path which is safe to stackwalk
1360 methodHandle callee_method;
1361 JRT_BLOCK
1362 // Force resolving of caller (if we called from compiled frame)
1363 callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL);
1364 thread->set_vm_result_2(callee_method());
1365 JRT_BLOCK_END
1366 // return compiled code entry point after potential safepoints
1367 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1368 return callee_method->verified_code_entry();
1369 JRT_END
1370
1371 // Handle abstract method call
1372 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_abstract(JavaThread* thread))
1373 return StubRoutines::throw_AbstractMethodError_entry();
1374 JRT_END
1375
1376
1377 // resolve a static call and patch code
1378 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread ))
1379 methodHandle callee_method;
1380 JRT_BLOCK
1381 callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL);
1382 thread->set_vm_result_2(callee_method());
1383 JRT_BLOCK_END
1384 // return compiled code entry point after potential safepoints
1385 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1386 return callee_method->verified_code_entry();
1387 JRT_END
1388
1389
1390 // resolve virtual call and update inline cache to monomorphic
1391 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread ))
1392 methodHandle callee_method;
1393 JRT_BLOCK
1394 callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL);
1395 thread->set_vm_result_2(callee_method());
1396 JRT_BLOCK_END
1397 // return compiled code entry point after potential safepoints
1398 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1399 return callee_method->verified_code_entry();
1400 JRT_END
1401
1402
1403 // Resolve a virtual call that can be statically bound (e.g., always
1404 // monomorphic, so it has no inline cache). Patch code to resolved target.
1405 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread))
1406 methodHandle callee_method;
1407 JRT_BLOCK
1408 callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL);
1409 thread->set_vm_result_2(callee_method());
1410 JRT_BLOCK_END
1411 // return compiled code entry point after potential safepoints
1412 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1413 return callee_method->verified_code_entry();
1414 JRT_END
1415
1416
1417
1418
1419
1420 methodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) {
1421 ResourceMark rm(thread);
1422 CallInfo call_info;
1423 Bytecodes::Code bc;
1424
1425 // receiver is NULL for static calls. An exception is thrown for NULL
1426 // receivers for non-static calls
1427 Handle receiver = find_callee_info(thread, bc, call_info,
1428 CHECK_(methodHandle()));
1429 // Compiler1 can produce virtual call sites that can actually be statically bound
1430 // If we fell thru to below we would think that the site was going megamorphic
1431 // when in fact the site can never miss. Worse because we'd think it was megamorphic
1432 // we'd try and do a vtable dispatch however methods that can be statically bound
1433 // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a
1434 // reresolution of the call site (as if we did a handle_wrong_method and not an
1435 // plain ic_miss) and the site will be converted to an optimized virtual call site
1436 // never to miss again. I don't believe C2 will produce code like this but if it
1437 // did this would still be the correct thing to do for it too, hence no ifdef.
1438 //
1439 if (call_info.resolved_method()->can_be_statically_bound()) {
1440 methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle()));
1441 if (TraceCallFixup) {
1442 RegisterMap reg_map(thread, false);
1443 frame caller_frame = thread->last_frame().sender(®_map);
1444 ResourceMark rm(thread);
1445 tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc));
1446 callee_method->print_short_name(tty);
1447 tty->print_cr(" from pc: " INTPTR_FORMAT, caller_frame.pc());
1448 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1449 }
1450 return callee_method;
1451 }
1452
1453 methodHandle callee_method = call_info.selected_method();
1454
1455 bool should_be_mono = false;
1456
1457 #ifndef PRODUCT
1458 Atomic::inc(&_ic_miss_ctr);
1459
1460 // Statistics & Tracing
1461 if (TraceCallFixup) {
1462 ResourceMark rm(thread);
1463 tty->print("IC miss (%s) call to", Bytecodes::name(bc));
1464 callee_method->print_short_name(tty);
1465 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1466 }
1467
1468 if (ICMissHistogram) {
1469 MutexLocker m(VMStatistic_lock);
1470 RegisterMap reg_map(thread, false);
1471 frame f = thread->last_frame().real_sender(®_map);// skip runtime stub
1472 // produce statistics under the lock
1473 trace_ic_miss(f.pc());
1474 }
1475 #endif
1476
1477 // install an event collector so that when a vtable stub is created the
1478 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The
1479 // event can't be posted when the stub is created as locks are held
1480 // - instead the event will be deferred until the event collector goes
1481 // out of scope.
1482 JvmtiDynamicCodeEventCollector event_collector;
1483
1484 // Update inline cache to megamorphic. Skip update if caller has been
1485 // made non-entrant or we are called from interpreted.
1486 { MutexLocker ml_patch (CompiledIC_lock);
1487 RegisterMap reg_map(thread, false);
1488 frame caller_frame = thread->last_frame().sender(®_map);
1489 CodeBlob* cb = caller_frame.cb();
1490 if (cb->is_nmethod() && ((nmethod*)cb)->is_in_use()) {
1491 // Not a non-entrant nmethod, so find inline_cache
1492 CompiledIC* inline_cache = CompiledIC_before(((nmethod*)cb), caller_frame.pc());
1493 bool should_be_mono = false;
1494 if (inline_cache->is_optimized()) {
1495 if (TraceCallFixup) {
1496 ResourceMark rm(thread);
1497 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc));
1498 callee_method->print_short_name(tty);
1499 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1500 }
1501 should_be_mono = true;
1502 } else if (inline_cache->is_icholder_call()) {
1503 CompiledICHolder* ic_oop = inline_cache->cached_icholder();
1504 if ( ic_oop != NULL) {
1505
1506 if (receiver()->klass() == ic_oop->holder_klass()) {
1507 // This isn't a real miss. We must have seen that compiled code
1508 // is now available and we want the call site converted to a
1509 // monomorphic compiled call site.
1510 // We can't assert for callee_method->code() != NULL because it
1511 // could have been deoptimized in the meantime
1512 if (TraceCallFixup) {
1513 ResourceMark rm(thread);
1514 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc));
1515 callee_method->print_short_name(tty);
1516 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1517 }
1518 should_be_mono = true;
1519 }
1520 }
1521 }
1522
1523 if (should_be_mono) {
1524
1525 // We have a path that was monomorphic but was going interpreted
1526 // and now we have (or had) a compiled entry. We correct the IC
1527 // by using a new icBuffer.
1528 CompiledICInfo info;
1529 KlassHandle receiver_klass(THREAD, receiver()->klass());
1530 inline_cache->compute_monomorphic_entry(callee_method,
1531 receiver_klass,
1532 inline_cache->is_optimized(),
1533 false,
1534 info, CHECK_(methodHandle()));
1535 inline_cache->set_to_monomorphic(info);
1536 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) {
1537 // Potential change to megamorphic
1538 bool successful = inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle()));
1539 if (!successful) {
1540 inline_cache->set_to_clean();
1541 }
1542 } else {
1543 // Either clean or megamorphic
1544 }
1545 }
1546 } // Release CompiledIC_lock
1547
1548 return callee_method;
1549 }
1550
1551 //
1552 // Resets a call-site in compiled code so it will get resolved again.
1553 // This routines handles both virtual call sites, optimized virtual call
1554 // sites, and static call sites. Typically used to change a call sites
1555 // destination from compiled to interpreted.
1556 //
1557 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) {
1558 ResourceMark rm(thread);
1559 RegisterMap reg_map(thread, false);
1560 frame stub_frame = thread->last_frame();
1561 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1562 frame caller = stub_frame.sender(®_map);
1563
1564 // Do nothing if the frame isn't a live compiled frame.
1565 // nmethod could be deoptimized by the time we get here
1566 // so no update to the caller is needed.
1567
1568 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) {
1569
1570 address pc = caller.pc();
1571
1572 // Default call_addr is the location of the "basic" call.
1573 // Determine the address of the call we a reresolving. With
1574 // Inline Caches we will always find a recognizable call.
1575 // With Inline Caches disabled we may or may not find a
1576 // recognizable call. We will always find a call for static
1577 // calls and for optimized virtual calls. For vanilla virtual
1578 // calls it depends on the state of the UseInlineCaches switch.
1579 //
1580 // With Inline Caches disabled we can get here for a virtual call
1581 // for two reasons:
1582 // 1 - calling an abstract method. The vtable for abstract methods
1583 // will run us thru handle_wrong_method and we will eventually
1584 // end up in the interpreter to throw the ame.
1585 // 2 - a racing deoptimization. We could be doing a vanilla vtable
1586 // call and between the time we fetch the entry address and
1587 // we jump to it the target gets deoptimized. Similar to 1
1588 // we will wind up in the interprter (thru a c2i with c2).
1589 //
1590 address call_addr = NULL;
1591 {
1592 // Get call instruction under lock because another thread may be
1593 // busy patching it.
1594 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1595 // Location of call instruction
1596 if (NativeCall::is_call_before(pc)) {
1597 NativeCall *ncall = nativeCall_before(pc);
1598 call_addr = ncall->instruction_address();
1599 }
1600 }
1601
1602 // Check for static or virtual call
1603 bool is_static_call = false;
1604 nmethod* caller_nm = CodeCache::find_nmethod(pc);
1605 // Make sure nmethod doesn't get deoptimized and removed until
1606 // this is done with it.
1607 // CLEANUP - with lazy deopt shouldn't need this lock
1608 nmethodLocker nmlock(caller_nm);
1609
1610 if (call_addr != NULL) {
1611 RelocIterator iter(caller_nm, call_addr, call_addr+1);
1612 int ret = iter.next(); // Get item
1613 if (ret) {
1614 assert(iter.addr() == call_addr, "must find call");
1615 if (iter.type() == relocInfo::static_call_type) {
1616 is_static_call = true;
1617 } else {
1618 assert(iter.type() == relocInfo::virtual_call_type ||
1619 iter.type() == relocInfo::opt_virtual_call_type
1620 , "unexpected relocInfo. type");
1621 }
1622 } else {
1623 assert(!UseInlineCaches, "relocation info. must exist for this address");
1624 }
1625
1626 // Cleaning the inline cache will force a new resolve. This is more robust
1627 // than directly setting it to the new destination, since resolving of calls
1628 // is always done through the same code path. (experience shows that it
1629 // leads to very hard to track down bugs, if an inline cache gets updated
1630 // to a wrong method). It should not be performance critical, since the
1631 // resolve is only done once.
1632
1633 MutexLocker ml(CompiledIC_lock);
1634 //
1635 // We do not patch the call site if the nmethod has been made non-entrant
1636 // as it is a waste of time
1637 //
1638 if (caller_nm->is_in_use()) {
1639 if (is_static_call) {
1640 CompiledStaticCall* ssc= compiledStaticCall_at(call_addr);
1641 ssc->set_to_clean();
1642 } else {
1643 // compiled, dispatched call (which used to call an interpreted method)
1644 CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr);
1645 inline_cache->set_to_clean();
1646 }
1647 }
1648 }
1649
1650 }
1651
1652 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle()));
1653
1654
1655 #ifndef PRODUCT
1656 Atomic::inc(&_wrong_method_ctr);
1657
1658 if (TraceCallFixup) {
1659 ResourceMark rm(thread);
1660 tty->print("handle_wrong_method reresolving call to");
1661 callee_method->print_short_name(tty);
1662 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code());
1663 }
1664 #endif
1665
1666 return callee_method;
1667 }
1668
1669 #ifdef ASSERT
1670 void SharedRuntime::check_member_name_argument_is_last_argument(methodHandle method,
1671 const BasicType* sig_bt,
1672 const VMRegPair* regs) {
1673 ResourceMark rm;
1674 const int total_args_passed = method->size_of_parameters();
1675 const VMRegPair* regs_with_member_name = regs;
1676 VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1);
1677
1678 const int member_arg_pos = total_args_passed - 1;
1679 assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob");
1680 assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object");
1681
1682 const bool is_outgoing = method->is_method_handle_intrinsic();
1683 int comp_args_on_stack = java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1, is_outgoing);
1684
1685 for (int i = 0; i < member_arg_pos; i++) {
1686 VMReg a = regs_with_member_name[i].first();
1687 VMReg b = regs_without_member_name[i].first();
1688 assert(a->value() == b->value(), err_msg_res("register allocation mismatch: a=%d, b=%d", a->value(), b->value()));
1689 }
1690 assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg");
1691 }
1692 #endif
1693
1694 // ---------------------------------------------------------------------------
1695 // We are calling the interpreter via a c2i. Normally this would mean that
1696 // we were called by a compiled method. However we could have lost a race
1697 // where we went int -> i2c -> c2i and so the caller could in fact be
1698 // interpreted. If the caller is compiled we attempt to patch the caller
1699 // so he no longer calls into the interpreter.
1700 IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc))
1701 Method* moop(method);
1702
1703 address entry_point = moop->from_compiled_entry();
1704
1705 // It's possible that deoptimization can occur at a call site which hasn't
1706 // been resolved yet, in which case this function will be called from
1707 // an nmethod that has been patched for deopt and we can ignore the
1708 // request for a fixup.
1709 // Also it is possible that we lost a race in that from_compiled_entry
1710 // is now back to the i2c in that case we don't need to patch and if
1711 // we did we'd leap into space because the callsite needs to use
1712 // "to interpreter" stub in order to load up the Method*. Don't
1713 // ask me how I know this...
1714
1715 CodeBlob* cb = CodeCache::find_blob(caller_pc);
1716 if (!cb->is_nmethod() || entry_point == moop->get_c2i_entry()) {
1717 return;
1718 }
1719
1720 // The check above makes sure this is a nmethod.
1721 nmethod* nm = cb->as_nmethod_or_null();
1722 assert(nm, "must be");
1723
1724 // Get the return PC for the passed caller PC.
1725 address return_pc = caller_pc + frame::pc_return_offset;
1726
1727 // There is a benign race here. We could be attempting to patch to a compiled
1728 // entry point at the same time the callee is being deoptimized. If that is
1729 // the case then entry_point may in fact point to a c2i and we'd patch the
1730 // call site with the same old data. clear_code will set code() to NULL
1731 // at the end of it. If we happen to see that NULL then we can skip trying
1732 // to patch. If we hit the window where the callee has a c2i in the
1733 // from_compiled_entry and the NULL isn't present yet then we lose the race
1734 // and patch the code with the same old data. Asi es la vida.
1735
1736 if (moop->code() == NULL) return;
1737
1738 if (nm->is_in_use()) {
1739
1740 // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1741 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1742 if (NativeCall::is_call_before(return_pc)) {
1743 NativeCall *call = nativeCall_before(return_pc);
1744 //
1745 // bug 6281185. We might get here after resolving a call site to a vanilla
1746 // virtual call. Because the resolvee uses the verified entry it may then
1747 // see compiled code and attempt to patch the site by calling us. This would
1748 // then incorrectly convert the call site to optimized and its downhill from
1749 // there. If you're lucky you'll get the assert in the bugid, if not you've
1750 // just made a call site that could be megamorphic into a monomorphic site
1751 // for the rest of its life! Just another racing bug in the life of
1752 // fixup_callers_callsite ...
1753 //
1754 RelocIterator iter(nm, call->instruction_address(), call->next_instruction_address());
1755 iter.next();
1756 assert(iter.has_current(), "must have a reloc at java call site");
1757 relocInfo::relocType typ = iter.reloc()->type();
1758 if ( typ != relocInfo::static_call_type &&
1759 typ != relocInfo::opt_virtual_call_type &&
1760 typ != relocInfo::static_stub_type) {
1761 return;
1762 }
1763 address destination = call->destination();
1764 if (destination != entry_point) {
1765 CodeBlob* callee = CodeCache::find_blob(destination);
1766 // callee == cb seems weird. It means calling interpreter thru stub.
1767 if (callee == cb || callee->is_adapter_blob()) {
1768 // static call or optimized virtual
1769 if (TraceCallFixup) {
1770 tty->print("fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1771 moop->print_short_name(tty);
1772 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1773 }
1774 call->set_destination_mt_safe(entry_point);
1775 } else {
1776 if (TraceCallFixup) {
1777 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1778 moop->print_short_name(tty);
1779 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1780 }
1781 // assert is too strong could also be resolve destinations.
1782 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be");
1783 }
1784 } else {
1785 if (TraceCallFixup) {
1786 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", caller_pc);
1787 moop->print_short_name(tty);
1788 tty->print_cr(" to " INTPTR_FORMAT, entry_point);
1789 }
1790 }
1791 }
1792 }
1793 IRT_END
1794
1795
1796 // same as JVM_Arraycopy, but called directly from compiled code
1797 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos,
1798 oopDesc* dest, jint dest_pos,
1799 jint length,
1800 JavaThread* thread)) {
1801 #ifndef PRODUCT
1802 _slow_array_copy_ctr++;
1803 #endif
1804 // Check if we have null pointers
1805 if (src == NULL || dest == NULL) {
1806 THROW(vmSymbols::java_lang_NullPointerException());
1807 }
1808 // Do the copy. The casts to arrayOop are necessary to the copy_array API,
1809 // even though the copy_array API also performs dynamic checks to ensure
1810 // that src and dest are truly arrays (and are conformable).
1811 // The copy_array mechanism is awkward and could be removed, but
1812 // the compilers don't call this function except as a last resort,
1813 // so it probably doesn't matter.
1814 src->klass()->copy_array((arrayOopDesc*)src, src_pos,
1815 (arrayOopDesc*)dest, dest_pos,
1816 length, thread);
1817 }
1818 JRT_END
1819
1820 char* SharedRuntime::generate_class_cast_message(
1821 JavaThread* thread, const char* objName) {
1822
1823 // Get target class name from the checkcast instruction
1824 vframeStream vfst(thread, true);
1825 assert(!vfst.at_end(), "Java frame must exist");
1826 Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci()));
1827 Klass* targetKlass = vfst.method()->constants()->klass_at(
1828 cc.index(), thread);
1829 return generate_class_cast_message(objName, targetKlass->external_name());
1830 }
1831
1832 char* SharedRuntime::generate_class_cast_message(
1833 const char* objName, const char* targetKlassName, const char* desc) {
1834 size_t msglen = strlen(objName) + strlen(desc) + strlen(targetKlassName) + 1;
1835
1836 char* message = NEW_RESOURCE_ARRAY(char, msglen);
1837 if (NULL == message) {
1838 // Shouldn't happen, but don't cause even more problems if it does
1839 message = const_cast<char*>(objName);
1840 } else {
1841 jio_snprintf(message, msglen, "%s%s%s", objName, desc, targetKlassName);
1842 }
1843 return message;
1844 }
1845
1846 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
1847 (void) JavaThread::current()->reguard_stack();
1848 JRT_END
1849
1850
1851 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
1852 #ifndef PRODUCT
1853 int SharedRuntime::_monitor_enter_ctr=0;
1854 #endif
1855 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
1856 oop obj(_obj);
1857 #ifndef PRODUCT
1858 _monitor_enter_ctr++; // monitor enter slow
1859 #endif
1860 if (PrintBiasedLockingStatistics) {
1861 Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
1862 }
1863 Handle h_obj(THREAD, obj);
1864 if (UseBiasedLocking) {
1865 // Retry fast entry if bias is revoked to avoid unnecessary inflation
1866 ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK);
1867 } else {
1868 ObjectSynchronizer::slow_enter(h_obj, lock, CHECK);
1869 }
1870 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
1871 JRT_END
1872
1873 #ifndef PRODUCT
1874 int SharedRuntime::_monitor_exit_ctr=0;
1875 #endif
1876 // Handles the uncommon cases of monitor unlocking in compiled code
1877 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock))
1878 oop obj(_obj);
1879 #ifndef PRODUCT
1880 _monitor_exit_ctr++; // monitor exit slow
1881 #endif
1882 Thread* THREAD = JavaThread::current();
1883 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore
1884 // testing was unable to ever fire the assert that guarded it so I have removed it.
1885 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?");
1886 #undef MIGHT_HAVE_PENDING
1887 #ifdef MIGHT_HAVE_PENDING
1888 // Save and restore any pending_exception around the exception mark.
1889 // While the slow_exit must not throw an exception, we could come into
1890 // this routine with one set.
1891 oop pending_excep = NULL;
1892 const char* pending_file;
1893 int pending_line;
1894 if (HAS_PENDING_EXCEPTION) {
1895 pending_excep = PENDING_EXCEPTION;
1896 pending_file = THREAD->exception_file();
1897 pending_line = THREAD->exception_line();
1898 CLEAR_PENDING_EXCEPTION;
1899 }
1900 #endif /* MIGHT_HAVE_PENDING */
1901
1902 {
1903 // Exit must be non-blocking, and therefore no exceptions can be thrown.
1904 EXCEPTION_MARK;
1905 ObjectSynchronizer::slow_exit(obj, lock, THREAD);
1906 }
1907
1908 #ifdef MIGHT_HAVE_PENDING
1909 if (pending_excep != NULL) {
1910 THREAD->set_pending_exception(pending_excep, pending_file, pending_line);
1911 }
1912 #endif /* MIGHT_HAVE_PENDING */
1913 JRT_END
1914
1915 #ifndef PRODUCT
1916
1917 void SharedRuntime::print_statistics() {
1918 ttyLocker ttyl;
1919 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'");
1920
1921 if (_monitor_enter_ctr ) tty->print_cr("%5d monitor enter slow", _monitor_enter_ctr);
1922 if (_monitor_exit_ctr ) tty->print_cr("%5d monitor exit slow", _monitor_exit_ctr);
1923 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr);
1924
1925 SharedRuntime::print_ic_miss_histogram();
1926
1927 if (CountRemovableExceptions) {
1928 if (_nof_removable_exceptions > 0) {
1929 Unimplemented(); // this counter is not yet incremented
1930 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions);
1931 }
1932 }
1933
1934 // Dump the JRT_ENTRY counters
1935 if( _new_instance_ctr ) tty->print_cr("%5d new instance requires GC", _new_instance_ctr);
1936 if( _new_array_ctr ) tty->print_cr("%5d new array requires GC", _new_array_ctr);
1937 if( _multi1_ctr ) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr);
1938 if( _multi2_ctr ) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr);
1939 if( _multi3_ctr ) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr);
1940 if( _multi4_ctr ) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr);
1941 if( _multi5_ctr ) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr);
1942
1943 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr );
1944 tty->print_cr("%5d wrong method", _wrong_method_ctr );
1945 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr );
1946 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr );
1947 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr );
1948
1949 if( _mon_enter_stub_ctr ) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr );
1950 if( _mon_exit_stub_ctr ) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr );
1951 if( _mon_enter_ctr ) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr );
1952 if( _mon_exit_ctr ) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr );
1953 if( _partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr );
1954 if( _jbyte_array_copy_ctr ) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr );
1955 if( _jshort_array_copy_ctr ) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr );
1956 if( _jint_array_copy_ctr ) tty->print_cr("%5d int array copies", _jint_array_copy_ctr );
1957 if( _jlong_array_copy_ctr ) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr );
1958 if( _oop_array_copy_ctr ) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr );
1959 if( _checkcast_array_copy_ctr ) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr );
1960 if( _unsafe_array_copy_ctr ) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr );
1961 if( _generic_array_copy_ctr ) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr );
1962 if( _slow_array_copy_ctr ) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr );
1963 if( _find_handler_ctr ) tty->print_cr("%5d find exception handler", _find_handler_ctr );
1964 if( _rethrow_ctr ) tty->print_cr("%5d rethrow handler", _rethrow_ctr );
1965
1966 AdapterHandlerLibrary::print_statistics();
1967
1968 if (xtty != NULL) xtty->tail("statistics");
1969 }
1970
1971 inline double percent(int x, int y) {
1972 return 100.0 * x / MAX2(y, 1);
1973 }
1974
1975 class MethodArityHistogram {
1976 public:
1977 enum { MAX_ARITY = 256 };
1978 private:
1979 static int _arity_histogram[MAX_ARITY]; // histogram of #args
1980 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words
1981 static int _max_arity; // max. arity seen
1982 static int _max_size; // max. arg size seen
1983
1984 static void add_method_to_histogram(nmethod* nm) {
1985 Method* m = nm->method();
1986 ArgumentCount args(m->signature());
1987 int arity = args.size() + (m->is_static() ? 0 : 1);
1988 int argsize = m->size_of_parameters();
1989 arity = MIN2(arity, MAX_ARITY-1);
1990 argsize = MIN2(argsize, MAX_ARITY-1);
1991 int count = nm->method()->compiled_invocation_count();
1992 _arity_histogram[arity] += count;
1993 _size_histogram[argsize] += count;
1994 _max_arity = MAX2(_max_arity, arity);
1995 _max_size = MAX2(_max_size, argsize);
1996 }
1997
1998 void print_histogram_helper(int n, int* histo, const char* name) {
1999 const int N = MIN2(5, n);
2000 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2001 double sum = 0;
2002 double weighted_sum = 0;
2003 int i;
2004 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; }
2005 double rest = sum;
2006 double percent = sum / 100;
2007 for (i = 0; i <= N; i++) {
2008 rest -= histo[i];
2009 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent);
2010 }
2011 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent);
2012 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
2013 }
2014
2015 void print_histogram() {
2016 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2017 print_histogram_helper(_max_arity, _arity_histogram, "arity");
2018 tty->print_cr("\nSame for parameter size (in words):");
2019 print_histogram_helper(_max_size, _size_histogram, "size");
2020 tty->cr();
2021 }
2022
2023 public:
2024 MethodArityHistogram() {
2025 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2026 _max_arity = _max_size = 0;
2027 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram [i] = 0;
2028 CodeCache::nmethods_do(add_method_to_histogram);
2029 print_histogram();
2030 }
2031 };
2032
2033 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
2034 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
2035 int MethodArityHistogram::_max_arity;
2036 int MethodArityHistogram::_max_size;
2037
2038 void SharedRuntime::print_call_statistics(int comp_total) {
2039 tty->print_cr("Calls from compiled code:");
2040 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
2041 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls;
2042 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls;
2043 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total));
2044 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total));
2045 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
2046 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls));
2047 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls));
2048 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
2049 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total));
2050 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
2051 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls));
2052 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls));
2053 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls));
2054 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
2055 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
2056 tty->cr();
2057 tty->print_cr("Note 1: counter updates are not MT-safe.");
2058 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
2059 tty->print_cr(" %% in nested categories are relative to their category");
2060 tty->print_cr(" (and thus add up to more than 100%% with inlining)");
2061 tty->cr();
2062
2063 MethodArityHistogram h;
2064 }
2065 #endif
2066
2067
2068 // A simple wrapper class around the calling convention information
2069 // that allows sharing of adapters for the same calling convention.
2070 class AdapterFingerPrint : public CHeapObj<mtCode> {
2071 private:
2072 enum {
2073 _basic_type_bits = 4,
2074 _basic_type_mask = right_n_bits(_basic_type_bits),
2075 _basic_types_per_int = BitsPerInt / _basic_type_bits,
2076 _compact_int_count = 3
2077 };
2078 // TO DO: Consider integrating this with a more global scheme for compressing signatures.
2079 // For now, 4 bits per components (plus T_VOID gaps after double/long) is not excessive.
2080
2081 union {
2082 int _compact[_compact_int_count];
2083 int* _fingerprint;
2084 } _value;
2085 int _length; // A negative length indicates the fingerprint is in the compact form,
2086 // Otherwise _value._fingerprint is the array.
2087
2088 // Remap BasicTypes that are handled equivalently by the adapters.
2089 // These are correct for the current system but someday it might be
2090 // necessary to make this mapping platform dependent.
2091 static int adapter_encoding(BasicType in) {
2092 switch(in) {
2093 case T_BOOLEAN:
2094 case T_BYTE:
2095 case T_SHORT:
2096 case T_CHAR:
2097 // There are all promoted to T_INT in the calling convention
2098 return T_INT;
2099
2100 case T_OBJECT:
2101 case T_ARRAY:
2102 // In other words, we assume that any register good enough for
2103 // an int or long is good enough for a managed pointer.
2104 #ifdef _LP64
2105 return T_LONG;
2106 #else
2107 return T_INT;
2108 #endif
2109
2110 case T_INT:
2111 case T_LONG:
2112 case T_FLOAT:
2113 case T_DOUBLE:
2114 case T_VOID:
2115 return in;
2116
2117 default:
2118 ShouldNotReachHere();
2119 return T_CONFLICT;
2120 }
2121 }
2122
2123 public:
2124 AdapterFingerPrint(int total_args_passed, BasicType* sig_bt) {
2125 // The fingerprint is based on the BasicType signature encoded
2126 // into an array of ints with eight entries per int.
2127 int* ptr;
2128 int len = (total_args_passed + (_basic_types_per_int-1)) / _basic_types_per_int;
2129 if (len <= _compact_int_count) {
2130 assert(_compact_int_count == 3, "else change next line");
2131 _value._compact[0] = _value._compact[1] = _value._compact[2] = 0;
2132 // Storing the signature encoded as signed chars hits about 98%
2133 // of the time.
2134 _length = -len;
2135 ptr = _value._compact;
2136 } else {
2137 _length = len;
2138 _value._fingerprint = NEW_C_HEAP_ARRAY(int, _length, mtCode);
2139 ptr = _value._fingerprint;
2140 }
2141
2142 // Now pack the BasicTypes with 8 per int
2143 int sig_index = 0;
2144 for (int index = 0; index < len; index++) {
2145 int value = 0;
2146 for (int byte = 0; byte < _basic_types_per_int; byte++) {
2147 int bt = ((sig_index < total_args_passed)
2148 ? adapter_encoding(sig_bt[sig_index++])
2149 : 0);
2150 assert((bt & _basic_type_mask) == bt, "must fit in 4 bits");
2151 value = (value << _basic_type_bits) | bt;
2152 }
2153 ptr[index] = value;
2154 }
2155 }
2156
2157 ~AdapterFingerPrint() {
2158 if (_length > 0) {
2159 FREE_C_HEAP_ARRAY(int, _value._fingerprint, mtCode);
2160 }
2161 }
2162
2163 int value(int index) {
2164 if (_length < 0) {
2165 return _value._compact[index];
2166 }
2167 return _value._fingerprint[index];
2168 }
2169 int length() {
2170 if (_length < 0) return -_length;
2171 return _length;
2172 }
2173
2174 bool is_compact() {
2175 return _length <= 0;
2176 }
2177
2178 unsigned int compute_hash() {
2179 int hash = 0;
2180 for (int i = 0; i < length(); i++) {
2181 int v = value(i);
2182 hash = (hash << 8) ^ v ^ (hash >> 5);
2183 }
2184 return (unsigned int)hash;
2185 }
2186
2187 const char* as_string() {
2188 stringStream st;
2189 st.print("0x");
2190 for (int i = 0; i < length(); i++) {
2191 st.print("%08x", value(i));
2192 }
2193 return st.as_string();
2194 }
2195
2196 bool equals(AdapterFingerPrint* other) {
2197 if (other->_length != _length) {
2198 return false;
2199 }
2200 if (_length < 0) {
2201 assert(_compact_int_count == 3, "else change next line");
2202 return _value._compact[0] == other->_value._compact[0] &&
2203 _value._compact[1] == other->_value._compact[1] &&
2204 _value._compact[2] == other->_value._compact[2];
2205 } else {
2206 for (int i = 0; i < _length; i++) {
2207 if (_value._fingerprint[i] != other->_value._fingerprint[i]) {
2208 return false;
2209 }
2210 }
2211 }
2212 return true;
2213 }
2214 };
2215
2216
2217 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries
2218 class AdapterHandlerTable : public BasicHashtable<mtCode> {
2219 friend class AdapterHandlerTableIterator;
2220
2221 private:
2222
2223 #ifndef PRODUCT
2224 static int _lookups; // number of calls to lookup
2225 static int _buckets; // number of buckets checked
2226 static int _equals; // number of buckets checked with matching hash
2227 static int _hits; // number of successful lookups
2228 static int _compact; // number of equals calls with compact signature
2229 #endif
2230
2231 AdapterHandlerEntry* bucket(int i) {
2232 return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i);
2233 }
2234
2235 public:
2236 AdapterHandlerTable()
2237 : BasicHashtable<mtCode>(293, sizeof(AdapterHandlerEntry)) { }
2238
2239 // Create a new entry suitable for insertion in the table
2240 AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry) {
2241 AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable<mtCode>::new_entry(fingerprint->compute_hash());
2242 entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2243 return entry;
2244 }
2245
2246 // Insert an entry into the table
2247 void add(AdapterHandlerEntry* entry) {
2248 int index = hash_to_index(entry->hash());
2249 add_entry(index, entry);
2250 }
2251
2252 void free_entry(AdapterHandlerEntry* entry) {
2253 entry->deallocate();
2254 BasicHashtable<mtCode>::free_entry(entry);
2255 }
2256
2257 // Find a entry with the same fingerprint if it exists
2258 AdapterHandlerEntry* lookup(int total_args_passed, BasicType* sig_bt) {
2259 NOT_PRODUCT(_lookups++);
2260 AdapterFingerPrint fp(total_args_passed, sig_bt);
2261 unsigned int hash = fp.compute_hash();
2262 int index = hash_to_index(hash);
2263 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2264 NOT_PRODUCT(_buckets++);
2265 if (e->hash() == hash) {
2266 NOT_PRODUCT(_equals++);
2267 if (fp.equals(e->fingerprint())) {
2268 #ifndef PRODUCT
2269 if (fp.is_compact()) _compact++;
2270 _hits++;
2271 #endif
2272 return e;
2273 }
2274 }
2275 }
2276 return NULL;
2277 }
2278
2279 #ifndef PRODUCT
2280 void print_statistics() {
2281 ResourceMark rm;
2282 int longest = 0;
2283 int empty = 0;
2284 int total = 0;
2285 int nonempty = 0;
2286 for (int index = 0; index < table_size(); index++) {
2287 int count = 0;
2288 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2289 count++;
2290 }
2291 if (count != 0) nonempty++;
2292 if (count == 0) empty++;
2293 if (count > longest) longest = count;
2294 total += count;
2295 }
2296 tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f",
2297 empty, longest, total, total / (double)nonempty);
2298 tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d",
2299 _lookups, _buckets, _equals, _hits, _compact);
2300 }
2301 #endif
2302 };
2303
2304
2305 #ifndef PRODUCT
2306
2307 int AdapterHandlerTable::_lookups;
2308 int AdapterHandlerTable::_buckets;
2309 int AdapterHandlerTable::_equals;
2310 int AdapterHandlerTable::_hits;
2311 int AdapterHandlerTable::_compact;
2312
2313 #endif
2314
2315 class AdapterHandlerTableIterator : public StackObj {
2316 private:
2317 AdapterHandlerTable* _table;
2318 int _index;
2319 AdapterHandlerEntry* _current;
2320
2321 void scan() {
2322 while (_index < _table->table_size()) {
2323 AdapterHandlerEntry* a = _table->bucket(_index);
2324 _index++;
2325 if (a != NULL) {
2326 _current = a;
2327 return;
2328 }
2329 }
2330 }
2331
2332 public:
2333 AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) {
2334 scan();
2335 }
2336 bool has_next() {
2337 return _current != NULL;
2338 }
2339 AdapterHandlerEntry* next() {
2340 if (_current != NULL) {
2341 AdapterHandlerEntry* result = _current;
2342 _current = _current->next();
2343 if (_current == NULL) scan();
2344 return result;
2345 } else {
2346 return NULL;
2347 }
2348 }
2349 };
2350
2351
2352 // ---------------------------------------------------------------------------
2353 // Implementation of AdapterHandlerLibrary
2354 AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL;
2355 AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL;
2356 const int AdapterHandlerLibrary_size = 16*K;
2357 BufferBlob* AdapterHandlerLibrary::_buffer = NULL;
2358
2359 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
2360 // Should be called only when AdapterHandlerLibrary_lock is active.
2361 if (_buffer == NULL) // Initialize lazily
2362 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
2363 return _buffer;
2364 }
2365
2366 void AdapterHandlerLibrary::initialize() {
2367 if (_adapters != NULL) return;
2368 _adapters = new AdapterHandlerTable();
2369
2370 // Create a special handler for abstract methods. Abstract methods
2371 // are never compiled so an i2c entry is somewhat meaningless, but
2372 // throw AbstractMethodError just in case.
2373 // Pass wrong_method_abstract for the c2i transitions to return
2374 // AbstractMethodError for invalid invocations.
2375 address wrong_method_abstract = SharedRuntime::get_handle_wrong_method_abstract_stub();
2376 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL),
2377 StubRoutines::throw_AbstractMethodError_entry(),
2378 wrong_method_abstract, wrong_method_abstract);
2379 }
2380
2381 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint,
2382 address i2c_entry,
2383 address c2i_entry,
2384 address c2i_unverified_entry) {
2385 return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2386 }
2387
2388 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(methodHandle method) {
2389 // Use customized signature handler. Need to lock around updates to
2390 // the AdapterHandlerTable (it is not safe for concurrent readers
2391 // and a single writer: this could be fixed if it becomes a
2392 // problem).
2393
2394 // Get the address of the ic_miss handlers before we grab the
2395 // AdapterHandlerLibrary_lock. This fixes bug 6236259 which
2396 // was caused by the initialization of the stubs happening
2397 // while we held the lock and then notifying jvmti while
2398 // holding it. This just forces the initialization to be a little
2399 // earlier.
2400 address ic_miss = SharedRuntime::get_ic_miss_stub();
2401 assert(ic_miss != NULL, "must have handler");
2402
2403 ResourceMark rm;
2404
2405 NOT_PRODUCT(int insts_size);
2406 AdapterBlob* new_adapter = NULL;
2407 AdapterHandlerEntry* entry = NULL;
2408 AdapterFingerPrint* fingerprint = NULL;
2409 {
2410 MutexLocker mu(AdapterHandlerLibrary_lock);
2411 // make sure data structure is initialized
2412 initialize();
2413
2414 if (method->is_abstract()) {
2415 return _abstract_method_handler;
2416 }
2417
2418 // Fill in the signature array, for the calling-convention call.
2419 int total_args_passed = method->size_of_parameters(); // All args on stack
2420
2421 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2422 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2423 int i = 0;
2424 if (!method->is_static()) // Pass in receiver first
2425 sig_bt[i++] = T_OBJECT;
2426 for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) {
2427 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2428 if (ss.type() == T_LONG || ss.type() == T_DOUBLE)
2429 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2430 }
2431 assert(i == total_args_passed, "");
2432
2433 // Lookup method signature's fingerprint
2434 entry = _adapters->lookup(total_args_passed, sig_bt);
2435
2436 #ifdef ASSERT
2437 AdapterHandlerEntry* shared_entry = NULL;
2438 // Start adapter sharing verification only after the VM is booted.
2439 if (VerifyAdapterSharing && (entry != NULL)) {
2440 shared_entry = entry;
2441 entry = NULL;
2442 }
2443 #endif
2444
2445 if (entry != NULL) {
2446 return entry;
2447 }
2448
2449 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
2450 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
2451
2452 // Make a C heap allocated version of the fingerprint to store in the adapter
2453 fingerprint = new AdapterFingerPrint(total_args_passed, sig_bt);
2454
2455 // StubRoutines::code2() is initialized after this function can be called. As a result,
2456 // VerifyAdapterCalls and VerifyAdapterSharing can fail if we re-use code that generated
2457 // prior to StubRoutines::code2() being set. Checks refer to checks generated in an I2C
2458 // stub that ensure that an I2C stub is called from an interpreter frame.
2459 bool contains_all_checks = StubRoutines::code2() != NULL;
2460
2461 // Create I2C & C2I handlers
2462 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2463 if (buf != NULL) {
2464 CodeBuffer buffer(buf);
2465 short buffer_locs[20];
2466 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
2467 sizeof(buffer_locs)/sizeof(relocInfo));
2468
2469 MacroAssembler _masm(&buffer);
2470 entry = SharedRuntime::generate_i2c2i_adapters(&_masm,
2471 total_args_passed,
2472 comp_args_on_stack,
2473 sig_bt,
2474 regs,
2475 fingerprint);
2476 #ifdef ASSERT
2477 if (VerifyAdapterSharing) {
2478 if (shared_entry != NULL) {
2479 assert(shared_entry->compare_code(buf->code_begin(), buffer.insts_size()), "code must match");
2480 // Release the one just created and return the original
2481 _adapters->free_entry(entry);
2482 return shared_entry;
2483 } else {
2484 entry->save_code(buf->code_begin(), buffer.insts_size());
2485 }
2486 }
2487 #endif
2488
2489 new_adapter = AdapterBlob::create(&buffer);
2490 NOT_PRODUCT(insts_size = buffer.insts_size());
2491 }
2492 if (new_adapter == NULL) {
2493 // CodeCache is full, disable compilation
2494 // Ought to log this but compile log is only per compile thread
2495 // and we're some non descript Java thread.
2496 MutexUnlocker mu(AdapterHandlerLibrary_lock);
2497 CompileBroker::handle_full_code_cache();
2498 return NULL; // Out of CodeCache space
2499 }
2500 entry->relocate(new_adapter->content_begin());
2501 #ifndef PRODUCT
2502 // debugging suppport
2503 if (PrintAdapterHandlers || PrintStubCode) {
2504 ttyLocker ttyl;
2505 entry->print_adapter_on(tty);
2506 tty->print_cr("i2c argument handler #%d for: %s %s (%d bytes generated)",
2507 _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"),
2508 method->signature()->as_C_string(), insts_size);
2509 tty->print_cr("c2i argument handler starts at %p",entry->get_c2i_entry());
2510 if (Verbose || PrintStubCode) {
2511 address first_pc = entry->base_address();
2512 if (first_pc != NULL) {
2513 Disassembler::decode(first_pc, first_pc + insts_size);
2514 tty->cr();
2515 }
2516 }
2517 }
2518 #endif
2519 // Add the entry only if the entry contains all required checks (see sharedRuntime_xxx.cpp)
2520 // The checks are inserted only if -XX:+VerifyAdapterCalls is specified.
2521 if (contains_all_checks || !VerifyAdapterCalls) {
2522 _adapters->add(entry);
2523 }
2524 }
2525 // Outside of the lock
2526 if (new_adapter != NULL) {
2527 char blob_id[256];
2528 jio_snprintf(blob_id,
2529 sizeof(blob_id),
2530 "%s(%s)@" PTR_FORMAT,
2531 new_adapter->name(),
2532 fingerprint->as_string(),
2533 new_adapter->content_begin());
2534 Forte::register_stub(blob_id, new_adapter->content_begin(),new_adapter->content_end());
2535
2536 if (JvmtiExport::should_post_dynamic_code_generated()) {
2537 JvmtiExport::post_dynamic_code_generated(blob_id, new_adapter->content_begin(), new_adapter->content_end());
2538 }
2539 }
2540 return entry;
2541 }
2542
2543 address AdapterHandlerEntry::base_address() {
2544 address base = _i2c_entry;
2545 if (base == NULL) base = _c2i_entry;
2546 assert(base <= _c2i_entry || _c2i_entry == NULL, "");
2547 assert(base <= _c2i_unverified_entry || _c2i_unverified_entry == NULL, "");
2548 return base;
2549 }
2550
2551 void AdapterHandlerEntry::relocate(address new_base) {
2552 address old_base = base_address();
2553 assert(old_base != NULL, "");
2554 ptrdiff_t delta = new_base - old_base;
2555 if (_i2c_entry != NULL)
2556 _i2c_entry += delta;
2557 if (_c2i_entry != NULL)
2558 _c2i_entry += delta;
2559 if (_c2i_unverified_entry != NULL)
2560 _c2i_unverified_entry += delta;
2561 assert(base_address() == new_base, "");
2562 }
2563
2564
2565 void AdapterHandlerEntry::deallocate() {
2566 delete _fingerprint;
2567 #ifdef ASSERT
2568 if (_saved_code) FREE_C_HEAP_ARRAY(unsigned char, _saved_code, mtCode);
2569 #endif
2570 }
2571
2572
2573 #ifdef ASSERT
2574 // Capture the code before relocation so that it can be compared
2575 // against other versions. If the code is captured after relocation
2576 // then relative instructions won't be equivalent.
2577 void AdapterHandlerEntry::save_code(unsigned char* buffer, int length) {
2578 _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode);
2579 _saved_code_length = length;
2580 memcpy(_saved_code, buffer, length);
2581 }
2582
2583
2584 bool AdapterHandlerEntry::compare_code(unsigned char* buffer, int length) {
2585 if (length != _saved_code_length) {
2586 return false;
2587 }
2588
2589 return (memcmp(buffer, _saved_code, length) == 0) ? true : false;
2590 }
2591 #endif
2592
2593
2594 /**
2595 * Create a native wrapper for this native method. The wrapper converts the
2596 * Java-compiled calling convention to the native convention, handles
2597 * arguments, and transitions to native. On return from the native we transition
2598 * back to java blocking if a safepoint is in progress.
2599 */
2600 void AdapterHandlerLibrary::create_native_wrapper(methodHandle method) {
2601 ResourceMark rm;
2602 nmethod* nm = NULL;
2603
2604 assert(method->is_native(), "must be native");
2605 assert(method->is_method_handle_intrinsic() ||
2606 method->has_native_function(), "must have something valid to call!");
2607
2608 {
2609 // Perform the work while holding the lock, but perform any printing outside the lock
2610 MutexLocker mu(AdapterHandlerLibrary_lock);
2611 // See if somebody beat us to it
2612 nm = method->code();
2613 if (nm != NULL) {
2614 return;
2615 }
2616
2617 const int compile_id = CompileBroker::assign_compile_id(method, CompileBroker::standard_entry_bci);
2618 assert(compile_id > 0, "Must generate native wrapper");
2619
2620
2621 ResourceMark rm;
2622 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2623 if (buf != NULL) {
2624 CodeBuffer buffer(buf);
2625 double locs_buf[20];
2626 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2627 MacroAssembler _masm(&buffer);
2628
2629 // Fill in the signature array, for the calling-convention call.
2630 const int total_args_passed = method->size_of_parameters();
2631
2632 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2633 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2634 int i=0;
2635 if( !method->is_static() ) // Pass in receiver first
2636 sig_bt[i++] = T_OBJECT;
2637 SignatureStream ss(method->signature());
2638 for( ; !ss.at_return_type(); ss.next()) {
2639 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2640 if( ss.type() == T_LONG || ss.type() == T_DOUBLE )
2641 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2642 }
2643 assert(i == total_args_passed, "");
2644 BasicType ret_type = ss.type();
2645
2646 // Now get the compiled-Java layout as input (or output) arguments.
2647 // NOTE: Stubs for compiled entry points of method handle intrinsics
2648 // are just trampolines so the argument registers must be outgoing ones.
2649 const bool is_outgoing = method->is_method_handle_intrinsic();
2650 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, is_outgoing);
2651
2652 // Generate the compiled-to-native wrapper code
2653 nm = SharedRuntime::generate_native_wrapper(&_masm, method, compile_id, sig_bt, regs, ret_type);
2654
2655 if (nm != NULL) {
2656 method->set_code(method, nm);
2657 }
2658 }
2659 } // Unlock AdapterHandlerLibrary_lock
2660
2661
2662 // Install the generated code.
2663 if (nm != NULL) {
2664 if (PrintCompilation) {
2665 ttyLocker ttyl;
2666 CompileTask::print_compilation(tty, nm, method->is_static() ? "(static)" : "");
2667 }
2668 nm->post_compiled_method_load_event();
2669 } else {
2670 // CodeCache is full, disable compilation
2671 CompileBroker::handle_full_code_cache();
2672 }
2673 }
2674
2675 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::block_for_jni_critical(JavaThread* thread))
2676 assert(thread == JavaThread::current(), "must be");
2677 // The code is about to enter a JNI lazy critical native method and
2678 // _needs_gc is true, so if this thread is already in a critical
2679 // section then just return, otherwise this thread should block
2680 // until needs_gc has been cleared.
2681 if (thread->in_critical()) {
2682 return;
2683 }
2684 // Lock and unlock a critical section to give the system a chance to block
2685 GC_locker::lock_critical(thread);
2686 GC_locker::unlock_critical(thread);
2687 JRT_END
2688
2689 #ifdef HAVE_DTRACE_H
2690 // Create a dtrace nmethod for this method. The wrapper converts the
2691 // java compiled calling convention to the native convention, makes a dummy call
2692 // (actually nops for the size of the call instruction, which become a trap if
2693 // probe is enabled). The returns to the caller. Since this all looks like a
2694 // leaf no thread transition is needed.
2695
2696 nmethod *AdapterHandlerLibrary::create_dtrace_nmethod(methodHandle method) {
2697 ResourceMark rm;
2698 nmethod* nm = NULL;
2699
2700 if (PrintCompilation) {
2701 ttyLocker ttyl;
2702 tty->print("--- n%s ");
2703 method->print_short_name(tty);
2704 if (method->is_static()) {
2705 tty->print(" (static)");
2706 }
2707 tty->cr();
2708 }
2709
2710 {
2711 // perform the work while holding the lock, but perform any printing
2712 // outside the lock
2713 MutexLocker mu(AdapterHandlerLibrary_lock);
2714 // See if somebody beat us to it
2715 nm = method->code();
2716 if (nm) {
2717 return nm;
2718 }
2719
2720 ResourceMark rm;
2721
2722 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2723 if (buf != NULL) {
2724 CodeBuffer buffer(buf);
2725 // Need a few relocation entries
2726 double locs_buf[20];
2727 buffer.insts()->initialize_shared_locs(
2728 (relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2729 MacroAssembler _masm(&buffer);
2730
2731 // Generate the compiled-to-native wrapper code
2732 nm = SharedRuntime::generate_dtrace_nmethod(&_masm, method);
2733 }
2734 }
2735 return nm;
2736 }
2737
2738 // the dtrace method needs to convert java lang string to utf8 string.
2739 void SharedRuntime::get_utf(oopDesc* src, address dst) {
2740 typeArrayOop jlsValue = java_lang_String::value(src);
2741 int jlsOffset = java_lang_String::offset(src);
2742 int jlsLen = java_lang_String::length(src);
2743 jchar* jlsPos = (jlsLen == 0) ? NULL :
2744 jlsValue->char_at_addr(jlsOffset);
2745 assert(TypeArrayKlass::cast(jlsValue->klass())->element_type() == T_CHAR, "compressed string");
2746 (void) UNICODE::as_utf8(jlsPos, jlsLen, (char *)dst, max_dtrace_string_size);
2747 }
2748 #endif // ndef HAVE_DTRACE_H
2749
2750 int SharedRuntime::convert_ints_to_longints_argcnt(int in_args_count, BasicType* in_sig_bt) {
2751 int argcnt = in_args_count;
2752 if (CCallingConventionRequiresIntsAsLongs) {
2753 for (int in = 0; in < in_args_count; in++) {
2754 BasicType bt = in_sig_bt[in];
2755 switch (bt) {
2756 case T_BOOLEAN:
2757 case T_CHAR:
2758 case T_BYTE:
2759 case T_SHORT:
2760 case T_INT:
2761 argcnt++;
2762 break;
2763 default:
2764 break;
2765 }
2766 }
2767 } else {
2768 assert(0, "This should not be needed on this platform");
2769 }
2770
2771 return argcnt;
2772 }
2773
2774 void SharedRuntime::convert_ints_to_longints(int i2l_argcnt, int& in_args_count,
2775 BasicType*& in_sig_bt, VMRegPair*& in_regs) {
2776 if (CCallingConventionRequiresIntsAsLongs) {
2777 VMRegPair *new_in_regs = NEW_RESOURCE_ARRAY(VMRegPair, i2l_argcnt);
2778 BasicType *new_in_sig_bt = NEW_RESOURCE_ARRAY(BasicType, i2l_argcnt);
2779
2780 int argcnt = 0;
2781 for (int in = 0; in < in_args_count; in++, argcnt++) {
2782 BasicType bt = in_sig_bt[in];
2783 VMRegPair reg = in_regs[in];
2784 switch (bt) {
2785 case T_BOOLEAN:
2786 case T_CHAR:
2787 case T_BYTE:
2788 case T_SHORT:
2789 case T_INT:
2790 // Convert (bt) to (T_LONG,bt).
2791 new_in_sig_bt[argcnt ] = T_LONG;
2792 new_in_sig_bt[argcnt+1] = bt;
2793 assert(reg.first()->is_valid() && !reg.second()->is_valid(), "");
2794 new_in_regs[argcnt ].set2(reg.first());
2795 new_in_regs[argcnt+1].set_bad();
2796 argcnt++;
2797 break;
2798 default:
2799 // No conversion needed.
2800 new_in_sig_bt[argcnt] = bt;
2801 new_in_regs[argcnt] = reg;
2802 break;
2803 }
2804 }
2805 assert(argcnt == i2l_argcnt, "must match");
2806
2807 in_regs = new_in_regs;
2808 in_sig_bt = new_in_sig_bt;
2809 in_args_count = i2l_argcnt;
2810 } else {
2811 assert(0, "This should not be needed on this platform");
2812 }
2813 }
2814
2815 // -------------------------------------------------------------------------
2816 // Java-Java calling convention
2817 // (what you use when Java calls Java)
2818
2819 //------------------------------name_for_receiver----------------------------------
2820 // For a given signature, return the VMReg for parameter 0.
2821 VMReg SharedRuntime::name_for_receiver() {
2822 VMRegPair regs;
2823 BasicType sig_bt = T_OBJECT;
2824 (void) java_calling_convention(&sig_bt, ®s, 1, true);
2825 // Return argument 0 register. In the LP64 build pointers
2826 // take 2 registers, but the VM wants only the 'main' name.
2827 return regs.first();
2828 }
2829
2830 VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) {
2831 // This method is returning a data structure allocating as a
2832 // ResourceObject, so do not put any ResourceMarks in here.
2833 char *s = sig->as_C_string();
2834 int len = (int)strlen(s);
2835 s++; len--; // Skip opening paren
2836 char *t = s+len;
2837 while( *(--t) != ')' ) ; // Find close paren
2838
2839 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, 256 );
2840 VMRegPair *regs = NEW_RESOURCE_ARRAY( VMRegPair, 256 );
2841 int cnt = 0;
2842 if (has_receiver) {
2843 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
2844 }
2845
2846 while( s < t ) {
2847 switch( *s++ ) { // Switch on signature character
2848 case 'B': sig_bt[cnt++] = T_BYTE; break;
2849 case 'C': sig_bt[cnt++] = T_CHAR; break;
2850 case 'D': sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break;
2851 case 'F': sig_bt[cnt++] = T_FLOAT; break;
2852 case 'I': sig_bt[cnt++] = T_INT; break;
2853 case 'J': sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break;
2854 case 'S': sig_bt[cnt++] = T_SHORT; break;
2855 case 'Z': sig_bt[cnt++] = T_BOOLEAN; break;
2856 case 'V': sig_bt[cnt++] = T_VOID; break;
2857 case 'L': // Oop
2858 while( *s++ != ';' ) ; // Skip signature
2859 sig_bt[cnt++] = T_OBJECT;
2860 break;
2861 case '[': { // Array
2862 do { // Skip optional size
2863 while( *s >= '0' && *s <= '9' ) s++;
2864 } while( *s++ == '[' ); // Nested arrays?
2865 // Skip element type
2866 if( s[-1] == 'L' )
2867 while( *s++ != ';' ) ; // Skip signature
2868 sig_bt[cnt++] = T_ARRAY;
2869 break;
2870 }
2871 default : ShouldNotReachHere();
2872 }
2873 }
2874
2875 if (has_appendix) {
2876 sig_bt[cnt++] = T_OBJECT;
2877 }
2878
2879 assert( cnt < 256, "grow table size" );
2880
2881 int comp_args_on_stack;
2882 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true);
2883
2884 // the calling convention doesn't count out_preserve_stack_slots so
2885 // we must add that in to get "true" stack offsets.
2886
2887 if (comp_args_on_stack) {
2888 for (int i = 0; i < cnt; i++) {
2889 VMReg reg1 = regs[i].first();
2890 if( reg1->is_stack()) {
2891 // Yuck
2892 reg1 = reg1->bias(out_preserve_stack_slots());
2893 }
2894 VMReg reg2 = regs[i].second();
2895 if( reg2->is_stack()) {
2896 // Yuck
2897 reg2 = reg2->bias(out_preserve_stack_slots());
2898 }
2899 regs[i].set_pair(reg2, reg1);
2900 }
2901 }
2902
2903 // results
2904 *arg_size = cnt;
2905 return regs;
2906 }
2907
2908 // OSR Migration Code
2909 //
2910 // This code is used convert interpreter frames into compiled frames. It is
2911 // called from very start of a compiled OSR nmethod. A temp array is
2912 // allocated to hold the interesting bits of the interpreter frame. All
2913 // active locks are inflated to allow them to move. The displaced headers and
2914 // active interpeter locals are copied into the temp buffer. Then we return
2915 // back to the compiled code. The compiled code then pops the current
2916 // interpreter frame off the stack and pushes a new compiled frame. Then it
2917 // copies the interpreter locals and displaced headers where it wants.
2918 // Finally it calls back to free the temp buffer.
2919 //
2920 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
2921
2922 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) )
2923
2924 //
2925 // This code is dependent on the memory layout of the interpreter local
2926 // array and the monitors. On all of our platforms the layout is identical
2927 // so this code is shared. If some platform lays the their arrays out
2928 // differently then this code could move to platform specific code or
2929 // the code here could be modified to copy items one at a time using
2930 // frame accessor methods and be platform independent.
2931
2932 frame fr = thread->last_frame();
2933 assert( fr.is_interpreted_frame(), "" );
2934 assert( fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks" );
2935
2936 // Figure out how many monitors are active.
2937 int active_monitor_count = 0;
2938 for( BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
2939 kptr < fr.interpreter_frame_monitor_begin();
2940 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
2941 if( kptr->obj() != NULL ) active_monitor_count++;
2942 }
2943
2944 // QQQ we could place number of active monitors in the array so that compiled code
2945 // could double check it.
2946
2947 Method* moop = fr.interpreter_frame_method();
2948 int max_locals = moop->max_locals();
2949 // Allocate temp buffer, 1 word per local & 2 per active monitor
2950 int buf_size_words = max_locals + active_monitor_count*2;
2951 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode);
2952
2953 // Copy the locals. Order is preserved so that loading of longs works.
2954 // Since there's no GC I can copy the oops blindly.
2955 assert( sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
2956 Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
2957 (HeapWord*)&buf[0],
2958 max_locals);
2959
2960 // Inflate locks. Copy the displaced headers. Be careful, there can be holes.
2961 int i = max_locals;
2962 for( BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
2963 kptr2 < fr.interpreter_frame_monitor_begin();
2964 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
2965 if( kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array
2966 BasicLock *lock = kptr2->lock();
2967 // Inflate so the displaced header becomes position-independent
2968 if (lock->displaced_header()->is_unlocked())
2969 ObjectSynchronizer::inflate_helper(kptr2->obj());
2970 // Now the displaced header is free to move
2971 buf[i++] = (intptr_t)lock->displaced_header();
2972 buf[i++] = cast_from_oop<intptr_t>(kptr2->obj());
2973 }
2974 }
2975 assert( i - max_locals == active_monitor_count*2, "found the expected number of monitors" );
2976
2977 return buf;
2978 JRT_END
2979
2980 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
2981 FREE_C_HEAP_ARRAY(intptr_t,buf, mtCode);
2982 JRT_END
2983
2984 bool AdapterHandlerLibrary::contains(CodeBlob* b) {
2985 AdapterHandlerTableIterator iter(_adapters);
2986 while (iter.has_next()) {
2987 AdapterHandlerEntry* a = iter.next();
2988 if ( b == CodeCache::find_blob(a->get_i2c_entry()) ) return true;
2989 }
2990 return false;
2991 }
2992
2993 void AdapterHandlerLibrary::print_handler_on(outputStream* st, CodeBlob* b) {
2994 AdapterHandlerTableIterator iter(_adapters);
2995 while (iter.has_next()) {
2996 AdapterHandlerEntry* a = iter.next();
2997 if (b == CodeCache::find_blob(a->get_i2c_entry())) {
2998 st->print("Adapter for signature: ");
2999 a->print_adapter_on(tty);
3000 return;
3001 }
3002 }
3003 assert(false, "Should have found handler");
3004 }
3005
3006 void AdapterHandlerEntry::print_adapter_on(outputStream* st) const {
3007 st->print_cr("AHE@" INTPTR_FORMAT ": %s i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT,
3008 (intptr_t) this, fingerprint()->as_string(),
3009 get_i2c_entry(), get_c2i_entry(), get_c2i_unverified_entry());
3010
3011 }
3012
3013 #ifndef PRODUCT
3014
3015 void AdapterHandlerLibrary::print_statistics() {
3016 _adapters->print_statistics();
3017 }
3018
3019 #endif /* PRODUCT */