1 /*
2 * Copyright (c) 1997, 2019, 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 "jvm.h"
27 #include "aot/aotLoader.hpp"
28 #include "classfile/stringTable.hpp"
29 #include "classfile/systemDictionary.hpp"
30 #include "classfile/vmSymbols.hpp"
31 #include "code/codeCache.hpp"
32 #include "code/compiledIC.hpp"
33 #include "code/icBuffer.hpp"
34 #include "code/compiledMethod.inline.hpp"
35 #include "code/scopeDesc.hpp"
36 #include "code/vtableStubs.hpp"
37 #include "compiler/abstractCompiler.hpp"
38 #include "compiler/compileBroker.hpp"
39 #include "compiler/disassembler.hpp"
40 #include "gc/shared/barrierSet.hpp"
41 #include "gc/shared/gcLocker.inline.hpp"
42 #include "interpreter/interpreter.hpp"
43 #include "interpreter/interpreterRuntime.hpp"
44 #include "jfr/jfrEvents.hpp"
45 #include "logging/log.hpp"
46 #include "memory/metaspaceShared.hpp"
47 #include "memory/resourceArea.hpp"
48 #include "memory/universe.hpp"
49 #include "oops/klass.hpp"
50 #include "oops/method.inline.hpp"
51 #include "oops/objArrayKlass.hpp"
52 #include "oops/oop.inline.hpp"
53 #include "prims/forte.hpp"
54 #include "prims/jvmtiExport.hpp"
55 #include "prims/methodHandles.hpp"
56 #include "prims/nativeLookup.hpp"
57 #include "runtime/arguments.hpp"
58 #include "runtime/atomic.hpp"
59 #include "runtime/biasedLocking.hpp"
60 #include "runtime/frame.inline.hpp"
61 #include "runtime/handles.inline.hpp"
62 #include "runtime/init.hpp"
63 #include "runtime/interfaceSupport.inline.hpp"
64 #include "runtime/java.hpp"
65 #include "runtime/javaCalls.hpp"
66 #include "runtime/sharedRuntime.hpp"
67 #include "runtime/stubRoutines.hpp"
68 #include "runtime/vframe.inline.hpp"
69 #include "runtime/vframeArray.hpp"
70 #include "utilities/copy.hpp"
71 #include "utilities/dtrace.hpp"
72 #include "utilities/events.hpp"
73 #include "utilities/hashtable.inline.hpp"
74 #include "utilities/macros.hpp"
75 #include "utilities/xmlstream.hpp"
76 #ifdef COMPILER1
77 #include "c1/c1_Runtime1.hpp"
78 #endif
79
80 // Shared stub locations
81 RuntimeStub* SharedRuntime::_wrong_method_blob;
82 RuntimeStub* SharedRuntime::_wrong_method_abstract_blob;
83 RuntimeStub* SharedRuntime::_ic_miss_blob;
84 RuntimeStub* SharedRuntime::_resolve_opt_virtual_call_blob;
85 RuntimeStub* SharedRuntime::_resolve_virtual_call_blob;
86 RuntimeStub* SharedRuntime::_resolve_static_call_blob;
87 address SharedRuntime::_resolve_static_call_entry;
88
89 DeoptimizationBlob* SharedRuntime::_deopt_blob;
90 SafepointBlob* SharedRuntime::_polling_page_vectors_safepoint_handler_blob;
91 SafepointBlob* SharedRuntime::_polling_page_safepoint_handler_blob;
92 SafepointBlob* SharedRuntime::_polling_page_return_handler_blob;
93
94 #ifdef COMPILER2
95 UncommonTrapBlob* SharedRuntime::_uncommon_trap_blob;
96 #endif // COMPILER2
97
98
99 //----------------------------generate_stubs-----------------------------------
100 void SharedRuntime::generate_stubs() {
101 _wrong_method_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method), "wrong_method_stub");
102 _wrong_method_abstract_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_abstract), "wrong_method_abstract_stub");
103 _ic_miss_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_ic_miss), "ic_miss_stub");
104 _resolve_opt_virtual_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_opt_virtual_call_C), "resolve_opt_virtual_call");
105 _resolve_virtual_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_virtual_call_C), "resolve_virtual_call");
106 _resolve_static_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_static_call_C), "resolve_static_call");
107 _resolve_static_call_entry = _resolve_static_call_blob->entry_point();
108
109 #if COMPILER2_OR_JVMCI
110 // Vectors are generated only by C2 and JVMCI.
111 bool support_wide = is_wide_vector(MaxVectorSize);
112 if (support_wide) {
113 _polling_page_vectors_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_VECTOR_LOOP);
114 }
115 #endif // COMPILER2_OR_JVMCI
116 _polling_page_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_LOOP);
117 _polling_page_return_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_RETURN);
118
119 generate_deopt_blob();
120
121 #ifdef COMPILER2
122 generate_uncommon_trap_blob();
123 #endif // COMPILER2
124 }
125
126 #include <math.h>
127
128 // Implementation of SharedRuntime
129
130 #ifndef PRODUCT
131 // For statistics
132 int SharedRuntime::_ic_miss_ctr = 0;
133 int SharedRuntime::_wrong_method_ctr = 0;
134 int SharedRuntime::_resolve_static_ctr = 0;
135 int SharedRuntime::_resolve_virtual_ctr = 0;
136 int SharedRuntime::_resolve_opt_virtual_ctr = 0;
137 int SharedRuntime::_implicit_null_throws = 0;
138 int SharedRuntime::_implicit_div0_throws = 0;
139 int SharedRuntime::_throw_null_ctr = 0;
140
141 int SharedRuntime::_nof_normal_calls = 0;
142 int SharedRuntime::_nof_optimized_calls = 0;
143 int SharedRuntime::_nof_inlined_calls = 0;
144 int SharedRuntime::_nof_megamorphic_calls = 0;
145 int SharedRuntime::_nof_static_calls = 0;
146 int SharedRuntime::_nof_inlined_static_calls = 0;
147 int SharedRuntime::_nof_interface_calls = 0;
148 int SharedRuntime::_nof_optimized_interface_calls = 0;
149 int SharedRuntime::_nof_inlined_interface_calls = 0;
150 int SharedRuntime::_nof_megamorphic_interface_calls = 0;
151 int SharedRuntime::_nof_removable_exceptions = 0;
152
153 int SharedRuntime::_new_instance_ctr=0;
154 int SharedRuntime::_new_array_ctr=0;
155 int SharedRuntime::_multi1_ctr=0;
156 int SharedRuntime::_multi2_ctr=0;
157 int SharedRuntime::_multi3_ctr=0;
158 int SharedRuntime::_multi4_ctr=0;
159 int SharedRuntime::_multi5_ctr=0;
160 int SharedRuntime::_mon_enter_stub_ctr=0;
161 int SharedRuntime::_mon_exit_stub_ctr=0;
162 int SharedRuntime::_mon_enter_ctr=0;
163 int SharedRuntime::_mon_exit_ctr=0;
164 int SharedRuntime::_partial_subtype_ctr=0;
165 int SharedRuntime::_jbyte_array_copy_ctr=0;
166 int SharedRuntime::_jshort_array_copy_ctr=0;
167 int SharedRuntime::_jint_array_copy_ctr=0;
168 int SharedRuntime::_jlong_array_copy_ctr=0;
169 int SharedRuntime::_oop_array_copy_ctr=0;
170 int SharedRuntime::_checkcast_array_copy_ctr=0;
171 int SharedRuntime::_unsafe_array_copy_ctr=0;
172 int SharedRuntime::_generic_array_copy_ctr=0;
173 int SharedRuntime::_slow_array_copy_ctr=0;
174 int SharedRuntime::_find_handler_ctr=0;
175 int SharedRuntime::_rethrow_ctr=0;
176
177 int SharedRuntime::_ICmiss_index = 0;
178 int SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count];
179 address SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count];
180
181
182 void SharedRuntime::trace_ic_miss(address at) {
183 for (int i = 0; i < _ICmiss_index; i++) {
184 if (_ICmiss_at[i] == at) {
185 _ICmiss_count[i]++;
186 return;
187 }
188 }
189 int index = _ICmiss_index++;
190 if (_ICmiss_index >= maxICmiss_count) _ICmiss_index = maxICmiss_count - 1;
191 _ICmiss_at[index] = at;
192 _ICmiss_count[index] = 1;
193 }
194
195 void SharedRuntime::print_ic_miss_histogram() {
196 if (ICMissHistogram) {
197 tty->print_cr("IC Miss Histogram:");
198 int tot_misses = 0;
199 for (int i = 0; i < _ICmiss_index; i++) {
200 tty->print_cr(" at: " INTPTR_FORMAT " nof: %d", p2i(_ICmiss_at[i]), _ICmiss_count[i]);
201 tot_misses += _ICmiss_count[i];
202 }
203 tty->print_cr("Total IC misses: %7d", tot_misses);
204 }
205 }
206 #endif // PRODUCT
207
208
209 JRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x))
210 return x * y;
211 JRT_END
212
213
214 JRT_LEAF(jlong, SharedRuntime::ldiv(jlong y, jlong x))
215 if (x == min_jlong && y == CONST64(-1)) {
216 return x;
217 } else {
218 return x / y;
219 }
220 JRT_END
221
222
223 JRT_LEAF(jlong, SharedRuntime::lrem(jlong y, jlong x))
224 if (x == min_jlong && y == CONST64(-1)) {
225 return 0;
226 } else {
227 return x % y;
228 }
229 JRT_END
230
231
232 const juint float_sign_mask = 0x7FFFFFFF;
233 const juint float_infinity = 0x7F800000;
234 const julong double_sign_mask = CONST64(0x7FFFFFFFFFFFFFFF);
235 const julong double_infinity = CONST64(0x7FF0000000000000);
236
237 JRT_LEAF(jfloat, SharedRuntime::frem(jfloat x, jfloat y))
238 #ifdef _WIN64
239 // 64-bit Windows on amd64 returns the wrong values for
240 // infinity operands.
241 union { jfloat f; juint i; } xbits, ybits;
242 xbits.f = x;
243 ybits.f = y;
244 // x Mod Infinity == x unless x is infinity
245 if (((xbits.i & float_sign_mask) != float_infinity) &&
246 ((ybits.i & float_sign_mask) == float_infinity) ) {
247 return x;
248 }
249 return ((jfloat)fmod_winx64((double)x, (double)y));
250 #else
251 return ((jfloat)fmod((double)x,(double)y));
252 #endif
253 JRT_END
254
255
256 JRT_LEAF(jdouble, SharedRuntime::drem(jdouble x, jdouble y))
257 #ifdef _WIN64
258 union { jdouble d; julong l; } xbits, ybits;
259 xbits.d = x;
260 ybits.d = y;
261 // x Mod Infinity == x unless x is infinity
262 if (((xbits.l & double_sign_mask) != double_infinity) &&
263 ((ybits.l & double_sign_mask) == double_infinity) ) {
264 return x;
265 }
266 return ((jdouble)fmod_winx64((double)x, (double)y));
267 #else
268 return ((jdouble)fmod((double)x,(double)y));
269 #endif
270 JRT_END
271
272 #ifdef __SOFTFP__
273 JRT_LEAF(jfloat, SharedRuntime::fadd(jfloat x, jfloat y))
274 return x + y;
275 JRT_END
276
277 JRT_LEAF(jfloat, SharedRuntime::fsub(jfloat x, jfloat y))
278 return x - y;
279 JRT_END
280
281 JRT_LEAF(jfloat, SharedRuntime::fmul(jfloat x, jfloat y))
282 return x * y;
283 JRT_END
284
285 JRT_LEAF(jfloat, SharedRuntime::fdiv(jfloat x, jfloat y))
286 return x / y;
287 JRT_END
288
289 JRT_LEAF(jdouble, SharedRuntime::dadd(jdouble x, jdouble y))
290 return x + y;
291 JRT_END
292
293 JRT_LEAF(jdouble, SharedRuntime::dsub(jdouble x, jdouble y))
294 return x - y;
295 JRT_END
296
297 JRT_LEAF(jdouble, SharedRuntime::dmul(jdouble x, jdouble y))
298 return x * y;
299 JRT_END
300
301 JRT_LEAF(jdouble, SharedRuntime::ddiv(jdouble x, jdouble y))
302 return x / y;
303 JRT_END
304
305 JRT_LEAF(jfloat, SharedRuntime::i2f(jint x))
306 return (jfloat)x;
307 JRT_END
308
309 JRT_LEAF(jdouble, SharedRuntime::i2d(jint x))
310 return (jdouble)x;
311 JRT_END
312
313 JRT_LEAF(jdouble, SharedRuntime::f2d(jfloat x))
314 return (jdouble)x;
315 JRT_END
316
317 JRT_LEAF(int, SharedRuntime::fcmpl(float x, float y))
318 return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan*/
319 JRT_END
320
321 JRT_LEAF(int, SharedRuntime::fcmpg(float x, float y))
322 return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */
323 JRT_END
324
325 JRT_LEAF(int, SharedRuntime::dcmpl(double x, double y))
326 return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan */
327 JRT_END
328
329 JRT_LEAF(int, SharedRuntime::dcmpg(double x, double y))
330 return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */
331 JRT_END
332
333 // Functions to return the opposite of the aeabi functions for nan.
334 JRT_LEAF(int, SharedRuntime::unordered_fcmplt(float x, float y))
335 return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
336 JRT_END
337
338 JRT_LEAF(int, SharedRuntime::unordered_dcmplt(double x, double y))
339 return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
340 JRT_END
341
342 JRT_LEAF(int, SharedRuntime::unordered_fcmple(float x, float y))
343 return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
344 JRT_END
345
346 JRT_LEAF(int, SharedRuntime::unordered_dcmple(double x, double y))
347 return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
348 JRT_END
349
350 JRT_LEAF(int, SharedRuntime::unordered_fcmpge(float x, float y))
351 return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
352 JRT_END
353
354 JRT_LEAF(int, SharedRuntime::unordered_dcmpge(double x, double y))
355 return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
356 JRT_END
357
358 JRT_LEAF(int, SharedRuntime::unordered_fcmpgt(float x, float y))
359 return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
360 JRT_END
361
362 JRT_LEAF(int, SharedRuntime::unordered_dcmpgt(double x, double y))
363 return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
364 JRT_END
365
366 // Intrinsics make gcc generate code for these.
367 float SharedRuntime::fneg(float f) {
368 return -f;
369 }
370
371 double SharedRuntime::dneg(double f) {
372 return -f;
373 }
374
375 #endif // __SOFTFP__
376
377 #if defined(__SOFTFP__) || defined(E500V2)
378 // Intrinsics make gcc generate code for these.
379 double SharedRuntime::dabs(double f) {
380 return (f <= (double)0.0) ? (double)0.0 - f : f;
381 }
382
383 #endif
384
385 #if defined(__SOFTFP__) || defined(PPC)
386 double SharedRuntime::dsqrt(double f) {
387 return sqrt(f);
388 }
389 #endif
390
391 JRT_LEAF(jint, SharedRuntime::f2i(jfloat x))
392 if (g_isnan(x))
393 return 0;
394 if (x >= (jfloat) max_jint)
395 return max_jint;
396 if (x <= (jfloat) min_jint)
397 return min_jint;
398 return (jint) x;
399 JRT_END
400
401
402 JRT_LEAF(jlong, SharedRuntime::f2l(jfloat x))
403 if (g_isnan(x))
404 return 0;
405 if (x >= (jfloat) max_jlong)
406 return max_jlong;
407 if (x <= (jfloat) min_jlong)
408 return min_jlong;
409 return (jlong) x;
410 JRT_END
411
412
413 JRT_LEAF(jint, SharedRuntime::d2i(jdouble x))
414 if (g_isnan(x))
415 return 0;
416 if (x >= (jdouble) max_jint)
417 return max_jint;
418 if (x <= (jdouble) min_jint)
419 return min_jint;
420 return (jint) x;
421 JRT_END
422
423
424 JRT_LEAF(jlong, SharedRuntime::d2l(jdouble x))
425 if (g_isnan(x))
426 return 0;
427 if (x >= (jdouble) max_jlong)
428 return max_jlong;
429 if (x <= (jdouble) min_jlong)
430 return min_jlong;
431 return (jlong) x;
432 JRT_END
433
434
435 JRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x))
436 return (jfloat)x;
437 JRT_END
438
439
440 JRT_LEAF(jfloat, SharedRuntime::l2f(jlong x))
441 return (jfloat)x;
442 JRT_END
443
444
445 JRT_LEAF(jdouble, SharedRuntime::l2d(jlong x))
446 return (jdouble)x;
447 JRT_END
448
449 // Exception handling across interpreter/compiler boundaries
450 //
451 // exception_handler_for_return_address(...) returns the continuation address.
452 // The continuation address is the entry point of the exception handler of the
453 // previous frame depending on the return address.
454
455 address SharedRuntime::raw_exception_handler_for_return_address(JavaThread* thread, address return_address) {
456 assert(frame::verify_return_pc(return_address), "must be a return address: " INTPTR_FORMAT, p2i(return_address));
457 assert(thread->frames_to_pop_failed_realloc() == 0 || Interpreter::contains(return_address), "missed frames to pop?");
458
459 // Reset method handle flag.
460 thread->set_is_method_handle_return(false);
461
462 #if INCLUDE_JVMCI
463 // JVMCI's ExceptionHandlerStub expects the thread local exception PC to be clear
464 // and other exception handler continuations do not read it
465 thread->set_exception_pc(NULL);
466 #endif // INCLUDE_JVMCI
467
468 // The fastest case first
469 CodeBlob* blob = CodeCache::find_blob(return_address);
470 CompiledMethod* nm = (blob != NULL) ? blob->as_compiled_method_or_null() : NULL;
471 if (nm != NULL) {
472 // Set flag if return address is a method handle call site.
473 thread->set_is_method_handle_return(nm->is_method_handle_return(return_address));
474 // native nmethods don't have exception handlers
475 assert(!nm->is_native_method(), "no exception handler");
476 assert(nm->header_begin() != nm->exception_begin(), "no exception handler");
477 if (nm->is_deopt_pc(return_address)) {
478 // If we come here because of a stack overflow, the stack may be
479 // unguarded. Reguard the stack otherwise if we return to the
480 // deopt blob and the stack bang causes a stack overflow we
481 // crash.
482 bool guard_pages_enabled = thread->stack_guards_enabled();
483 if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack();
484 if (thread->reserved_stack_activation() != thread->stack_base()) {
485 thread->set_reserved_stack_activation(thread->stack_base());
486 }
487 assert(guard_pages_enabled, "stack banging in deopt blob may cause crash");
488 return SharedRuntime::deopt_blob()->unpack_with_exception();
489 } else {
490 return nm->exception_begin();
491 }
492 }
493
494 // Entry code
495 if (StubRoutines::returns_to_call_stub(return_address)) {
496 return StubRoutines::catch_exception_entry();
497 }
498 // Interpreted code
499 if (Interpreter::contains(return_address)) {
500 return Interpreter::rethrow_exception_entry();
501 }
502
503 guarantee(blob == NULL || !blob->is_runtime_stub(), "caller should have skipped stub");
504 guarantee(!VtableStubs::contains(return_address), "NULL exceptions in vtables should have been handled already!");
505
506 #ifndef PRODUCT
507 { ResourceMark rm;
508 tty->print_cr("No exception handler found for exception at " INTPTR_FORMAT " - potential problems:", p2i(return_address));
509 tty->print_cr("a) exception happened in (new?) code stubs/buffers that is not handled here");
510 tty->print_cr("b) other problem");
511 }
512 #endif // PRODUCT
513
514 ShouldNotReachHere();
515 return NULL;
516 }
517
518
519 JRT_LEAF(address, SharedRuntime::exception_handler_for_return_address(JavaThread* thread, address return_address))
520 return raw_exception_handler_for_return_address(thread, return_address);
521 JRT_END
522
523
524 address SharedRuntime::get_poll_stub(address pc) {
525 address stub;
526 // Look up the code blob
527 CodeBlob *cb = CodeCache::find_blob(pc);
528
529 // Should be an nmethod
530 guarantee(cb != NULL && cb->is_compiled(), "safepoint polling: pc must refer to an nmethod");
531
532 // Look up the relocation information
533 assert(((CompiledMethod*)cb)->is_at_poll_or_poll_return(pc),
534 "safepoint polling: type must be poll");
535
536 #ifdef ASSERT
537 if (!((NativeInstruction*)pc)->is_safepoint_poll()) {
538 tty->print_cr("bad pc: " PTR_FORMAT, p2i(pc));
539 Disassembler::decode(cb);
540 fatal("Only polling locations are used for safepoint");
541 }
542 #endif
543
544 bool at_poll_return = ((CompiledMethod*)cb)->is_at_poll_return(pc);
545 bool has_wide_vectors = ((CompiledMethod*)cb)->has_wide_vectors();
546 if (at_poll_return) {
547 assert(SharedRuntime::polling_page_return_handler_blob() != NULL,
548 "polling page return stub not created yet");
549 stub = SharedRuntime::polling_page_return_handler_blob()->entry_point();
550 } else if (has_wide_vectors) {
551 assert(SharedRuntime::polling_page_vectors_safepoint_handler_blob() != NULL,
552 "polling page vectors safepoint stub not created yet");
553 stub = SharedRuntime::polling_page_vectors_safepoint_handler_blob()->entry_point();
554 } else {
555 assert(SharedRuntime::polling_page_safepoint_handler_blob() != NULL,
556 "polling page safepoint stub not created yet");
557 stub = SharedRuntime::polling_page_safepoint_handler_blob()->entry_point();
558 }
559 log_debug(safepoint)("... found polling page %s exception at pc = "
560 INTPTR_FORMAT ", stub =" INTPTR_FORMAT,
561 at_poll_return ? "return" : "loop",
562 (intptr_t)pc, (intptr_t)stub);
563 return stub;
564 }
565
566
567 oop SharedRuntime::retrieve_receiver( Symbol* sig, frame caller ) {
568 assert(caller.is_interpreted_frame(), "");
569 int args_size = ArgumentSizeComputer(sig).size() + 1;
570 assert(args_size <= caller.interpreter_frame_expression_stack_size(), "receiver must be on interpreter stack");
571 oop result = cast_to_oop(*caller.interpreter_frame_tos_at(args_size - 1));
572 assert(Universe::heap()->is_in(result) && oopDesc::is_oop(result), "receiver must be an oop");
573 return result;
574 }
575
576
577 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Handle h_exception) {
578 if (JvmtiExport::can_post_on_exceptions()) {
579 vframeStream vfst(thread, true);
580 methodHandle method = methodHandle(thread, vfst.method());
581 address bcp = method()->bcp_from(vfst.bci());
582 JvmtiExport::post_exception_throw(thread, method(), bcp, h_exception());
583 }
584 Exceptions::_throw(thread, __FILE__, __LINE__, h_exception);
585 }
586
587 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Symbol* name, const char *message) {
588 Handle h_exception = Exceptions::new_exception(thread, name, message);
589 throw_and_post_jvmti_exception(thread, h_exception);
590 }
591
592 // The interpreter code to call this tracing function is only
593 // called/generated when UL is on for redefine, class and has the right level
594 // and tags. Since obsolete methods are never compiled, we don't have
595 // to modify the compilers to generate calls to this function.
596 //
597 JRT_LEAF(int, SharedRuntime::rc_trace_method_entry(
598 JavaThread* thread, Method* method))
599 if (method->is_obsolete()) {
600 // We are calling an obsolete method, but this is not necessarily
601 // an error. Our method could have been redefined just after we
602 // fetched the Method* from the constant pool.
603 ResourceMark rm;
604 log_trace(redefine, class, obsolete)("calling obsolete method '%s'", method->name_and_sig_as_C_string());
605 }
606 return 0;
607 JRT_END
608
609 // ret_pc points into caller; we are returning caller's exception handler
610 // for given exception
611 address SharedRuntime::compute_compiled_exc_handler(CompiledMethod* cm, address ret_pc, Handle& exception,
612 bool force_unwind, bool top_frame_only, bool& recursive_exception_occurred) {
613 assert(cm != NULL, "must exist");
614 ResourceMark rm;
615
616 #if INCLUDE_JVMCI
617 if (cm->is_compiled_by_jvmci()) {
618 // lookup exception handler for this pc
619 int catch_pco = ret_pc - cm->code_begin();
620 ExceptionHandlerTable table(cm);
621 HandlerTableEntry *t = table.entry_for(catch_pco, -1, 0);
622 if (t != NULL) {
623 return cm->code_begin() + t->pco();
624 } else {
625 return Deoptimization::deoptimize_for_missing_exception_handler(cm);
626 }
627 }
628 #endif // INCLUDE_JVMCI
629
630 nmethod* nm = cm->as_nmethod();
631 ScopeDesc* sd = nm->scope_desc_at(ret_pc);
632 // determine handler bci, if any
633 EXCEPTION_MARK;
634
635 int handler_bci = -1;
636 int scope_depth = 0;
637 if (!force_unwind) {
638 int bci = sd->bci();
639 bool recursive_exception = false;
640 do {
641 bool skip_scope_increment = false;
642 // exception handler lookup
643 Klass* ek = exception->klass();
644 methodHandle mh(THREAD, sd->method());
645 handler_bci = Method::fast_exception_handler_bci_for(mh, ek, bci, THREAD);
646 if (HAS_PENDING_EXCEPTION) {
647 recursive_exception = true;
648 // We threw an exception while trying to find the exception handler.
649 // Transfer the new exception to the exception handle which will
650 // be set into thread local storage, and do another lookup for an
651 // exception handler for this exception, this time starting at the
652 // BCI of the exception handler which caused the exception to be
653 // thrown (bugs 4307310 and 4546590). Set "exception" reference
654 // argument to ensure that the correct exception is thrown (4870175).
655 recursive_exception_occurred = true;
656 exception = Handle(THREAD, PENDING_EXCEPTION);
657 CLEAR_PENDING_EXCEPTION;
658 if (handler_bci >= 0) {
659 bci = handler_bci;
660 handler_bci = -1;
661 skip_scope_increment = true;
662 }
663 }
664 else {
665 recursive_exception = false;
666 }
667 if (!top_frame_only && handler_bci < 0 && !skip_scope_increment) {
668 sd = sd->sender();
669 if (sd != NULL) {
670 bci = sd->bci();
671 }
672 ++scope_depth;
673 }
674 } while (recursive_exception || (!top_frame_only && handler_bci < 0 && sd != NULL));
675 }
676
677 // found handling method => lookup exception handler
678 int catch_pco = ret_pc - nm->code_begin();
679
680 ExceptionHandlerTable table(nm);
681 HandlerTableEntry *t = table.entry_for(catch_pco, handler_bci, scope_depth);
682 if (t == NULL && (nm->is_compiled_by_c1() || handler_bci != -1)) {
683 // Allow abbreviated catch tables. The idea is to allow a method
684 // to materialize its exceptions without committing to the exact
685 // routing of exceptions. In particular this is needed for adding
686 // a synthetic handler to unlock monitors when inlining
687 // synchronized methods since the unlock path isn't represented in
688 // the bytecodes.
689 t = table.entry_for(catch_pco, -1, 0);
690 }
691
692 #ifdef COMPILER1
693 if (t == NULL && nm->is_compiled_by_c1()) {
694 assert(nm->unwind_handler_begin() != NULL, "");
695 return nm->unwind_handler_begin();
696 }
697 #endif
698
699 if (t == NULL) {
700 ttyLocker ttyl;
701 tty->print_cr("MISSING EXCEPTION HANDLER for pc " INTPTR_FORMAT " and handler bci %d", p2i(ret_pc), handler_bci);
702 tty->print_cr(" Exception:");
703 exception->print();
704 tty->cr();
705 tty->print_cr(" Compiled exception table :");
706 table.print();
707 nm->print_code();
708 guarantee(false, "missing exception handler");
709 return NULL;
710 }
711
712 return nm->code_begin() + t->pco();
713 }
714
715 JRT_ENTRY(void, SharedRuntime::throw_AbstractMethodError(JavaThread* thread))
716 // These errors occur only at call sites
717 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_AbstractMethodError());
718 JRT_END
719
720 JRT_ENTRY(void, SharedRuntime::throw_IncompatibleClassChangeError(JavaThread* thread))
721 // These errors occur only at call sites
722 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError(), "vtable stub");
723 JRT_END
724
725 JRT_ENTRY(void, SharedRuntime::throw_ArithmeticException(JavaThread* thread))
726 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
727 JRT_END
728
729 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* thread))
730 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
731 JRT_END
732
733 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException_at_call(JavaThread* thread))
734 // This entry point is effectively only used for NullPointerExceptions which occur at inline
735 // cache sites (when the callee activation is not yet set up) so we are at a call site
736 throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
737 JRT_END
738
739 JRT_ENTRY(void, SharedRuntime::throw_StackOverflowError(JavaThread* thread))
740 throw_StackOverflowError_common(thread, false);
741 JRT_END
742
743 JRT_ENTRY(void, SharedRuntime::throw_delayed_StackOverflowError(JavaThread* thread))
744 throw_StackOverflowError_common(thread, true);
745 JRT_END
746
747 void SharedRuntime::throw_StackOverflowError_common(JavaThread* thread, bool delayed) {
748 // We avoid using the normal exception construction in this case because
749 // it performs an upcall to Java, and we're already out of stack space.
750 Thread* THREAD = thread;
751 Klass* k = SystemDictionary::StackOverflowError_klass();
752 oop exception_oop = InstanceKlass::cast(k)->allocate_instance(CHECK);
753 if (delayed) {
754 java_lang_Throwable::set_message(exception_oop,
755 Universe::delayed_stack_overflow_error_message());
756 }
757 Handle exception (thread, exception_oop);
758 if (StackTraceInThrowable) {
759 java_lang_Throwable::fill_in_stack_trace(exception);
760 }
761 // Increment counter for hs_err file reporting
762 Atomic::inc(&Exceptions::_stack_overflow_errors);
763 throw_and_post_jvmti_exception(thread, exception);
764 }
765
766 address SharedRuntime::continuation_for_implicit_exception(JavaThread* thread,
767 address pc,
768 ImplicitExceptionKind exception_kind)
769 {
770 address target_pc = NULL;
771
772 if (Interpreter::contains(pc)) {
773 #ifdef CC_INTERP
774 // C++ interpreter doesn't throw implicit exceptions
775 ShouldNotReachHere();
776 #else
777 switch (exception_kind) {
778 case IMPLICIT_NULL: return Interpreter::throw_NullPointerException_entry();
779 case IMPLICIT_DIVIDE_BY_ZERO: return Interpreter::throw_ArithmeticException_entry();
780 case STACK_OVERFLOW: return Interpreter::throw_StackOverflowError_entry();
781 default: ShouldNotReachHere();
782 }
783 #endif // !CC_INTERP
784 } else {
785 switch (exception_kind) {
786 case STACK_OVERFLOW: {
787 // Stack overflow only occurs upon frame setup; the callee is
788 // going to be unwound. Dispatch to a shared runtime stub
789 // which will cause the StackOverflowError to be fabricated
790 // and processed.
791 // Stack overflow should never occur during deoptimization:
792 // the compiled method bangs the stack by as much as the
793 // interpreter would need in case of a deoptimization. The
794 // deoptimization blob and uncommon trap blob bang the stack
795 // in a debug VM to verify the correctness of the compiled
796 // method stack banging.
797 assert(thread->deopt_mark() == NULL, "no stack overflow from deopt blob/uncommon trap");
798 Events::log_exception(thread, "StackOverflowError at " INTPTR_FORMAT, p2i(pc));
799 return StubRoutines::throw_StackOverflowError_entry();
800 }
801
802 case IMPLICIT_NULL: {
803 if (VtableStubs::contains(pc)) {
804 // We haven't yet entered the callee frame. Fabricate an
805 // exception and begin dispatching it in the caller. Since
806 // the caller was at a call site, it's safe to destroy all
807 // caller-saved registers, as these entry points do.
808 VtableStub* vt_stub = VtableStubs::stub_containing(pc);
809
810 // If vt_stub is NULL, then return NULL to signal handler to report the SEGV error.
811 if (vt_stub == NULL) return NULL;
812
813 if (vt_stub->is_abstract_method_error(pc)) {
814 assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs");
815 Events::log_exception(thread, "AbstractMethodError at " INTPTR_FORMAT, p2i(pc));
816 // Instead of throwing the abstract method error here directly, we re-resolve
817 // and will throw the AbstractMethodError during resolve. As a result, we'll
818 // get a more detailed error message.
819 return SharedRuntime::get_handle_wrong_method_stub();
820 } else {
821 Events::log_exception(thread, "NullPointerException at vtable entry " INTPTR_FORMAT, p2i(pc));
822 // Assert that the signal comes from the expected location in stub code.
823 assert(vt_stub->is_null_pointer_exception(pc),
824 "obtained signal from unexpected location in stub code");
825 return StubRoutines::throw_NullPointerException_at_call_entry();
826 }
827 } else {
828 CodeBlob* cb = CodeCache::find_blob(pc);
829
830 // If code blob is NULL, then return NULL to signal handler to report the SEGV error.
831 if (cb == NULL) return NULL;
832
833 // Exception happened in CodeCache. Must be either:
834 // 1. Inline-cache check in C2I handler blob,
835 // 2. Inline-cache check in nmethod, or
836 // 3. Implicit null exception in nmethod
837
838 if (!cb->is_compiled()) {
839 bool is_in_blob = cb->is_adapter_blob() || cb->is_method_handles_adapter_blob();
840 if (!is_in_blob) {
841 // Allow normal crash reporting to handle this
842 return NULL;
843 }
844 Events::log_exception(thread, "NullPointerException in code blob at " INTPTR_FORMAT, p2i(pc));
845 // There is no handler here, so we will simply unwind.
846 return StubRoutines::throw_NullPointerException_at_call_entry();
847 }
848
849 // Otherwise, it's a compiled method. Consult its exception handlers.
850 CompiledMethod* cm = (CompiledMethod*)cb;
851 if (cm->inlinecache_check_contains(pc)) {
852 // exception happened inside inline-cache check code
853 // => the nmethod is not yet active (i.e., the frame
854 // is not set up yet) => use return address pushed by
855 // caller => don't push another return address
856 Events::log_exception(thread, "NullPointerException in IC check " INTPTR_FORMAT, p2i(pc));
857 return StubRoutines::throw_NullPointerException_at_call_entry();
858 }
859
860 if (cm->method()->is_method_handle_intrinsic()) {
861 // exception happened inside MH dispatch code, similar to a vtable stub
862 Events::log_exception(thread, "NullPointerException in MH adapter " INTPTR_FORMAT, p2i(pc));
863 return StubRoutines::throw_NullPointerException_at_call_entry();
864 }
865
866 #ifndef PRODUCT
867 _implicit_null_throws++;
868 #endif
869 target_pc = cm->continuation_for_implicit_null_exception(pc);
870 // If there's an unexpected fault, target_pc might be NULL,
871 // in which case we want to fall through into the normal
872 // error handling code.
873 }
874
875 break; // fall through
876 }
877
878
879 case IMPLICIT_DIVIDE_BY_ZERO: {
880 CompiledMethod* cm = CodeCache::find_compiled(pc);
881 guarantee(cm != NULL, "must have containing compiled method for implicit division-by-zero exceptions");
882 #ifndef PRODUCT
883 _implicit_div0_throws++;
884 #endif
885 target_pc = cm->continuation_for_implicit_div0_exception(pc);
886 // If there's an unexpected fault, target_pc might be NULL,
887 // in which case we want to fall through into the normal
888 // error handling code.
889 break; // fall through
890 }
891
892 default: ShouldNotReachHere();
893 }
894
895 assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind");
896
897 if (exception_kind == IMPLICIT_NULL) {
898 #ifndef PRODUCT
899 // for AbortVMOnException flag
900 Exceptions::debug_check_abort("java.lang.NullPointerException");
901 #endif //PRODUCT
902 Events::log_exception(thread, "Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, p2i(pc), p2i(target_pc));
903 } else {
904 #ifndef PRODUCT
905 // for AbortVMOnException flag
906 Exceptions::debug_check_abort("java.lang.ArithmeticException");
907 #endif //PRODUCT
908 Events::log_exception(thread, "Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, p2i(pc), p2i(target_pc));
909 }
910 return target_pc;
911 }
912
913 ShouldNotReachHere();
914 return NULL;
915 }
916
917
918 /**
919 * Throws an java/lang/UnsatisfiedLinkError. The address of this method is
920 * installed in the native function entry of all native Java methods before
921 * they get linked to their actual native methods.
922 *
923 * \note
924 * This method actually never gets called! The reason is because
925 * the interpreter's native entries call NativeLookup::lookup() which
926 * throws the exception when the lookup fails. The exception is then
927 * caught and forwarded on the return from NativeLookup::lookup() call
928 * before the call to the native function. This might change in the future.
929 */
930 JNI_ENTRY(void*, throw_unsatisfied_link_error(JNIEnv* env, ...))
931 {
932 // We return a bad value here to make sure that the exception is
933 // forwarded before we look at the return value.
934 THROW_(vmSymbols::java_lang_UnsatisfiedLinkError(), (void*)badAddress);
935 }
936 JNI_END
937
938 address SharedRuntime::native_method_throw_unsatisfied_link_error_entry() {
939 return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error);
940 }
941
942 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* thread, oopDesc* obj))
943 #if INCLUDE_JVMCI
944 if (!obj->klass()->has_finalizer()) {
945 return;
946 }
947 #endif // INCLUDE_JVMCI
948 assert(oopDesc::is_oop(obj), "must be a valid oop");
949 assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
950 InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
951 JRT_END
952
953
954 jlong SharedRuntime::get_java_tid(Thread* thread) {
955 if (thread != NULL) {
956 if (thread->is_Java_thread()) {
957 oop obj = ((JavaThread*)thread)->threadObj();
958 return (obj == NULL) ? 0 : java_lang_Thread::thread_id(obj);
959 }
960 }
961 return 0;
962 }
963
964 /**
965 * This function ought to be a void function, but cannot be because
966 * it gets turned into a tail-call on sparc, which runs into dtrace bug
967 * 6254741. Once that is fixed we can remove the dummy return value.
968 */
969 int SharedRuntime::dtrace_object_alloc(oopDesc* o, int size) {
970 return dtrace_object_alloc_base(Thread::current(), o, size);
971 }
972
973 int SharedRuntime::dtrace_object_alloc_base(Thread* thread, oopDesc* o, int size) {
974 assert(DTraceAllocProbes, "wrong call");
975 Klass* klass = o->klass();
976 Symbol* name = klass->name();
977 HOTSPOT_OBJECT_ALLOC(
978 get_java_tid(thread),
979 (char *) name->bytes(), name->utf8_length(), size * HeapWordSize);
980 return 0;
981 }
982
983 JRT_LEAF(int, SharedRuntime::dtrace_method_entry(
984 JavaThread* thread, Method* method))
985 assert(DTraceMethodProbes, "wrong call");
986 Symbol* kname = method->klass_name();
987 Symbol* name = method->name();
988 Symbol* sig = method->signature();
989 HOTSPOT_METHOD_ENTRY(
990 get_java_tid(thread),
991 (char *) kname->bytes(), kname->utf8_length(),
992 (char *) name->bytes(), name->utf8_length(),
993 (char *) sig->bytes(), sig->utf8_length());
994 return 0;
995 JRT_END
996
997 JRT_LEAF(int, SharedRuntime::dtrace_method_exit(
998 JavaThread* thread, Method* method))
999 assert(DTraceMethodProbes, "wrong call");
1000 Symbol* kname = method->klass_name();
1001 Symbol* name = method->name();
1002 Symbol* sig = method->signature();
1003 HOTSPOT_METHOD_RETURN(
1004 get_java_tid(thread),
1005 (char *) kname->bytes(), kname->utf8_length(),
1006 (char *) name->bytes(), name->utf8_length(),
1007 (char *) sig->bytes(), sig->utf8_length());
1008 return 0;
1009 JRT_END
1010
1011
1012 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode)
1013 // for a call current in progress, i.e., arguments has been pushed on stack
1014 // put callee has not been invoked yet. Used by: resolve virtual/static,
1015 // vtable updates, etc. Caller frame must be compiled.
1016 Handle SharedRuntime::find_callee_info(JavaThread* thread, Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) {
1017 ResourceMark rm(THREAD);
1018
1019 // last java frame on stack (which includes native call frames)
1020 vframeStream vfst(thread, true); // Do not skip and javaCalls
1021
1022 return find_callee_info_helper(thread, vfst, bc, callinfo, THREAD);
1023 }
1024
1025 Method* SharedRuntime::extract_attached_method(vframeStream& vfst) {
1026 CompiledMethod* caller = vfst.nm();
1027
1028 nmethodLocker caller_lock(caller);
1029
1030 address pc = vfst.frame_pc();
1031 { // Get call instruction under lock because another thread may be busy patching it.
1032 CompiledICLocker ic_locker(caller);
1033 return caller->attached_method_before_pc(pc);
1034 }
1035 return NULL;
1036 }
1037
1038 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode
1039 // for a call current in progress, i.e., arguments has been pushed on stack
1040 // but callee has not been invoked yet. Caller frame must be compiled.
1041 Handle SharedRuntime::find_callee_info_helper(JavaThread* thread,
1042 vframeStream& vfst,
1043 Bytecodes::Code& bc,
1044 CallInfo& callinfo, TRAPS) {
1045 Handle receiver;
1046 Handle nullHandle; //create a handy null handle for exception returns
1047
1048 assert(!vfst.at_end(), "Java frame must exist");
1049
1050 // Find caller and bci from vframe
1051 methodHandle caller(THREAD, vfst.method());
1052 int bci = vfst.bci();
1053
1054 Bytecode_invoke bytecode(caller, bci);
1055 int bytecode_index = bytecode.index();
1056 bc = bytecode.invoke_code();
1057
1058 methodHandle attached_method(THREAD, extract_attached_method(vfst));
1059 if (attached_method.not_null()) {
1060 Method* callee = bytecode.static_target(CHECK_NH);
1061 vmIntrinsics::ID id = callee->intrinsic_id();
1062 // When VM replaces MH.invokeBasic/linkTo* call with a direct/virtual call,
1063 // it attaches statically resolved method to the call site.
1064 if (MethodHandles::is_signature_polymorphic(id) &&
1065 MethodHandles::is_signature_polymorphic_intrinsic(id)) {
1066 bc = MethodHandles::signature_polymorphic_intrinsic_bytecode(id);
1067
1068 // Adjust invocation mode according to the attached method.
1069 switch (bc) {
1070 case Bytecodes::_invokevirtual:
1071 if (attached_method->method_holder()->is_interface()) {
1072 bc = Bytecodes::_invokeinterface;
1073 }
1074 break;
1075 case Bytecodes::_invokeinterface:
1076 if (!attached_method->method_holder()->is_interface()) {
1077 bc = Bytecodes::_invokevirtual;
1078 }
1079 break;
1080 case Bytecodes::_invokehandle:
1081 if (!MethodHandles::is_signature_polymorphic_method(attached_method())) {
1082 bc = attached_method->is_static() ? Bytecodes::_invokestatic
1083 : Bytecodes::_invokevirtual;
1084 }
1085 break;
1086 default:
1087 break;
1088 }
1089 }
1090 }
1091
1092 assert(bc != Bytecodes::_illegal, "not initialized");
1093
1094 bool has_receiver = bc != Bytecodes::_invokestatic &&
1095 bc != Bytecodes::_invokedynamic &&
1096 bc != Bytecodes::_invokehandle;
1097
1098 // Find receiver for non-static call
1099 if (has_receiver) {
1100 // This register map must be update since we need to find the receiver for
1101 // compiled frames. The receiver might be in a register.
1102 RegisterMap reg_map2(thread);
1103 frame stubFrame = thread->last_frame();
1104 // Caller-frame is a compiled frame
1105 frame callerFrame = stubFrame.sender(®_map2);
1106
1107 if (attached_method.is_null()) {
1108 Method* callee = bytecode.static_target(CHECK_NH);
1109 if (callee == NULL) {
1110 THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle);
1111 }
1112 }
1113
1114 // Retrieve from a compiled argument list
1115 receiver = Handle(THREAD, callerFrame.retrieve_receiver(®_map2));
1116
1117 if (receiver.is_null()) {
1118 THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle);
1119 }
1120 }
1121
1122 // Resolve method
1123 if (attached_method.not_null()) {
1124 // Parameterized by attached method.
1125 LinkResolver::resolve_invoke(callinfo, receiver, attached_method, bc, CHECK_NH);
1126 } else {
1127 // Parameterized by bytecode.
1128 constantPoolHandle constants(THREAD, caller->constants());
1129 LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_NH);
1130 }
1131
1132 #ifdef ASSERT
1133 // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls
1134 if (has_receiver) {
1135 assert(receiver.not_null(), "should have thrown exception");
1136 Klass* receiver_klass = receiver->klass();
1137 Klass* rk = NULL;
1138 if (attached_method.not_null()) {
1139 // In case there's resolved method attached, use its holder during the check.
1140 rk = attached_method->method_holder();
1141 } else {
1142 // Klass is already loaded.
1143 constantPoolHandle constants(THREAD, caller->constants());
1144 rk = constants->klass_ref_at(bytecode_index, CHECK_NH);
1145 }
1146 Klass* static_receiver_klass = rk;
1147 assert(receiver_klass->is_subtype_of(static_receiver_klass),
1148 "actual receiver must be subclass of static receiver klass");
1149 if (receiver_klass->is_instance_klass()) {
1150 if (InstanceKlass::cast(receiver_klass)->is_not_initialized()) {
1151 tty->print_cr("ERROR: Klass not yet initialized!!");
1152 receiver_klass->print();
1153 }
1154 assert(!InstanceKlass::cast(receiver_klass)->is_not_initialized(), "receiver_klass must be initialized");
1155 }
1156 }
1157 #endif
1158
1159 return receiver;
1160 }
1161
1162 methodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) {
1163 ResourceMark rm(THREAD);
1164 // We need first to check if any Java activations (compiled, interpreted)
1165 // exist on the stack since last JavaCall. If not, we need
1166 // to get the target method from the JavaCall wrapper.
1167 vframeStream vfst(thread, true); // Do not skip any javaCalls
1168 methodHandle callee_method;
1169 if (vfst.at_end()) {
1170 // No Java frames were found on stack since we did the JavaCall.
1171 // Hence the stack can only contain an entry_frame. We need to
1172 // find the target method from the stub frame.
1173 RegisterMap reg_map(thread, false);
1174 frame fr = thread->last_frame();
1175 assert(fr.is_runtime_frame(), "must be a runtimeStub");
1176 fr = fr.sender(®_map);
1177 assert(fr.is_entry_frame(), "must be");
1178 // fr is now pointing to the entry frame.
1179 callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method());
1180 } else {
1181 Bytecodes::Code bc;
1182 CallInfo callinfo;
1183 find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle()));
1184 callee_method = methodHandle(THREAD, callinfo.selected_method());
1185 }
1186 assert(callee_method()->is_method(), "must be");
1187 return callee_method;
1188 }
1189
1190 // Resolves a call.
1191 methodHandle SharedRuntime::resolve_helper(JavaThread *thread,
1192 bool is_virtual,
1193 bool is_optimized, TRAPS) {
1194 methodHandle callee_method;
1195 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1196 if (JvmtiExport::can_hotswap_or_post_breakpoint()) {
1197 int retry_count = 0;
1198 while (!HAS_PENDING_EXCEPTION && callee_method->is_old() &&
1199 callee_method->method_holder() != SystemDictionary::Object_klass()) {
1200 // If has a pending exception then there is no need to re-try to
1201 // resolve this method.
1202 // If the method has been redefined, we need to try again.
1203 // Hack: we have no way to update the vtables of arrays, so don't
1204 // require that java.lang.Object has been updated.
1205
1206 // It is very unlikely that method is redefined more than 100 times
1207 // in the middle of resolve. If it is looping here more than 100 times
1208 // means then there could be a bug here.
1209 guarantee((retry_count++ < 100),
1210 "Could not resolve to latest version of redefined method");
1211 // method is redefined in the middle of resolve so re-try.
1212 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1213 }
1214 }
1215 return callee_method;
1216 }
1217
1218 // This fails if resolution required refilling of IC stubs
1219 bool SharedRuntime::resolve_sub_helper_internal(methodHandle callee_method, const frame& caller_frame,
1220 CompiledMethod* caller_nm, bool is_virtual, bool is_optimized,
1221 Handle receiver, CallInfo& call_info, Bytecodes::Code invoke_code, TRAPS) {
1222 StaticCallInfo static_call_info;
1223 CompiledICInfo virtual_call_info;
1224
1225 // Make sure the callee nmethod does not get deoptimized and removed before
1226 // we are done patching the code.
1227 CompiledMethod* callee = callee_method->code();
1228
1229 if (callee != NULL) {
1230 assert(callee->is_compiled(), "must be nmethod for patching");
1231 }
1232
1233 if (callee != NULL && !callee->is_in_use()) {
1234 // Patch call site to C2I adapter if callee nmethod is deoptimized or unloaded.
1235 callee = NULL;
1236 }
1237 nmethodLocker nl_callee(callee);
1238 #ifdef ASSERT
1239 address dest_entry_point = callee == NULL ? 0 : callee->entry_point(); // used below
1240 #endif
1241
1242 bool is_nmethod = caller_nm->is_nmethod();
1243
1244 if (is_virtual) {
1245 assert(receiver.not_null() || invoke_code == Bytecodes::_invokehandle, "sanity check");
1246 bool static_bound = call_info.resolved_method()->can_be_statically_bound();
1247 Klass* klass = invoke_code == Bytecodes::_invokehandle ? NULL : receiver->klass();
1248 CompiledIC::compute_monomorphic_entry(callee_method, klass,
1249 is_optimized, static_bound, is_nmethod, virtual_call_info,
1250 CHECK_false);
1251 } else {
1252 // static call
1253 CompiledStaticCall::compute_entry(callee_method, is_nmethod, static_call_info);
1254 }
1255
1256 // grab lock, check for deoptimization and potentially patch caller
1257 {
1258 CompiledICLocker ml(caller_nm);
1259
1260 // Lock blocks for safepoint during which both nmethods can change state.
1261
1262 // Now that we are ready to patch if the Method* was redefined then
1263 // don't update call site and let the caller retry.
1264 // Don't update call site if callee nmethod was unloaded or deoptimized.
1265 // Don't update call site if callee nmethod was replaced by an other nmethod
1266 // which may happen when multiply alive nmethod (tiered compilation)
1267 // will be supported.
1268 if (!callee_method->is_old() &&
1269 (callee == NULL || (callee->is_in_use() && callee_method->code() == callee))) {
1270 NoSafepointVerifier nsv;
1271 #ifdef ASSERT
1272 // We must not try to patch to jump to an already unloaded method.
1273 if (dest_entry_point != 0) {
1274 CodeBlob* cb = CodeCache::find_blob(dest_entry_point);
1275 assert((cb != NULL) && cb->is_compiled() && (((CompiledMethod*)cb) == callee),
1276 "should not call unloaded nmethod");
1277 }
1278 #endif
1279 if (is_virtual) {
1280 CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc());
1281 if (inline_cache->is_clean()) {
1282 if (!inline_cache->set_to_monomorphic(virtual_call_info)) {
1283 return false;
1284 }
1285 }
1286 } else {
1287 if (VM_Version::supports_fast_class_init_checks() &&
1288 invoke_code == Bytecodes::_invokestatic &&
1289 callee_method->needs_clinit_barrier() &&
1290 callee != NULL && (callee->is_compiled_by_jvmci() || callee->is_aot())) {
1291 return true; // skip patching for JVMCI or AOT code
1292 }
1293 CompiledStaticCall* ssc = caller_nm->compiledStaticCall_before(caller_frame.pc());
1294 if (ssc->is_clean()) ssc->set(static_call_info);
1295 }
1296 }
1297 } // unlock CompiledICLocker
1298 return true;
1299 }
1300
1301 // Resolves a call. The compilers generate code for calls that go here
1302 // and are patched with the real destination of the call.
1303 methodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread,
1304 bool is_virtual,
1305 bool is_optimized, TRAPS) {
1306
1307 ResourceMark rm(thread);
1308 RegisterMap cbl_map(thread, false);
1309 frame caller_frame = thread->last_frame().sender(&cbl_map);
1310
1311 CodeBlob* caller_cb = caller_frame.cb();
1312 guarantee(caller_cb != NULL && caller_cb->is_compiled(), "must be called from compiled method");
1313 CompiledMethod* caller_nm = caller_cb->as_compiled_method_or_null();
1314
1315 // make sure caller is not getting deoptimized
1316 // and removed before we are done with it.
1317 // CLEANUP - with lazy deopt shouldn't need this lock
1318 nmethodLocker caller_lock(caller_nm);
1319
1320 // determine call info & receiver
1321 // note: a) receiver is NULL for static calls
1322 // b) an exception is thrown if receiver is NULL for non-static calls
1323 CallInfo call_info;
1324 Bytecodes::Code invoke_code = Bytecodes::_illegal;
1325 Handle receiver = find_callee_info(thread, invoke_code,
1326 call_info, CHECK_(methodHandle()));
1327 methodHandle callee_method(THREAD, call_info.selected_method());
1328
1329 assert((!is_virtual && invoke_code == Bytecodes::_invokestatic ) ||
1330 (!is_virtual && invoke_code == Bytecodes::_invokespecial) ||
1331 (!is_virtual && invoke_code == Bytecodes::_invokehandle ) ||
1332 (!is_virtual && invoke_code == Bytecodes::_invokedynamic) ||
1333 ( is_virtual && invoke_code != Bytecodes::_invokestatic ), "inconsistent bytecode");
1334
1335 assert(caller_nm->is_alive() && !caller_nm->is_unloading(), "It should be alive");
1336
1337 #ifndef PRODUCT
1338 // tracing/debugging/statistics
1339 int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
1340 (is_virtual) ? (&_resolve_virtual_ctr) :
1341 (&_resolve_static_ctr);
1342 Atomic::inc(addr);
1343
1344 if (TraceCallFixup) {
1345 ResourceMark rm(thread);
1346 tty->print("resolving %s%s (%s) call to",
1347 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
1348 Bytecodes::name(invoke_code));
1349 callee_method->print_short_name(tty);
1350 tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT,
1351 p2i(caller_frame.pc()), p2i(callee_method->code()));
1352 }
1353 #endif
1354
1355 if (invoke_code == Bytecodes::_invokestatic) {
1356 assert(callee_method->method_holder()->is_initialized() ||
1357 callee_method->method_holder()->is_reentrant_initialization(thread),
1358 "invalid class initialization state for invoke_static");
1359 if (!VM_Version::supports_fast_class_init_checks() && callee_method->needs_clinit_barrier()) {
1360 // In order to keep class initialization check, do not patch call
1361 // site for static call when the class is not fully initialized.
1362 // Proper check is enforced by call site re-resolution on every invocation.
1363 //
1364 // When fast class initialization checks are supported (VM_Version::supports_fast_class_init_checks() == true),
1365 // explicit class initialization check is put in nmethod entry (VEP).
1366 assert(callee_method->method_holder()->is_linked(), "must be");
1367 return callee_method;
1368 }
1369 }
1370
1371 // JSR 292 key invariant:
1372 // If the resolved method is a MethodHandle invoke target, the call
1373 // site must be a MethodHandle call site, because the lambda form might tail-call
1374 // leaving the stack in a state unknown to either caller or callee
1375 // TODO detune for now but we might need it again
1376 // assert(!callee_method->is_compiled_lambda_form() ||
1377 // caller_nm->is_method_handle_return(caller_frame.pc()), "must be MH call site");
1378
1379 // Compute entry points. This might require generation of C2I converter
1380 // frames, so we cannot be holding any locks here. Furthermore, the
1381 // computation of the entry points is independent of patching the call. We
1382 // always return the entry-point, but we only patch the stub if the call has
1383 // not been deoptimized. Return values: For a virtual call this is an
1384 // (cached_oop, destination address) pair. For a static call/optimized
1385 // virtual this is just a destination address.
1386
1387 // Patching IC caches may fail if we run out if transition stubs.
1388 // We refill the ic stubs then and try again.
1389 for (;;) {
1390 ICRefillVerifier ic_refill_verifier;
1391 bool successful = resolve_sub_helper_internal(callee_method, caller_frame, caller_nm,
1392 is_virtual, is_optimized, receiver,
1393 call_info, invoke_code, CHECK_(methodHandle()));
1394 if (successful) {
1395 return callee_method;
1396 } else {
1397 InlineCacheBuffer::refill_ic_stubs();
1398 }
1399 }
1400
1401 }
1402
1403
1404 // Inline caches exist only in compiled code
1405 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread))
1406 #ifdef ASSERT
1407 RegisterMap reg_map(thread, false);
1408 frame stub_frame = thread->last_frame();
1409 assert(stub_frame.is_runtime_frame(), "sanity check");
1410 frame caller_frame = stub_frame.sender(®_map);
1411 assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame");
1412 #endif /* ASSERT */
1413
1414 methodHandle callee_method;
1415 JRT_BLOCK
1416 callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL);
1417 // Return Method* through TLS
1418 thread->set_vm_result_2(callee_method());
1419 JRT_BLOCK_END
1420 // return compiled code entry point after potential safepoints
1421 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1422 return callee_method->verified_code_entry();
1423 JRT_END
1424
1425
1426 // Handle call site that has been made non-entrant
1427 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread))
1428 // 6243940 We might end up in here if the callee is deoptimized
1429 // as we race to call it. We don't want to take a safepoint if
1430 // the caller was interpreted because the caller frame will look
1431 // interpreted to the stack walkers and arguments are now
1432 // "compiled" so it is much better to make this transition
1433 // invisible to the stack walking code. The i2c path will
1434 // place the callee method in the callee_target. It is stashed
1435 // there because if we try and find the callee by normal means a
1436 // safepoint is possible and have trouble gc'ing the compiled args.
1437 RegisterMap reg_map(thread, false);
1438 frame stub_frame = thread->last_frame();
1439 assert(stub_frame.is_runtime_frame(), "sanity check");
1440 frame caller_frame = stub_frame.sender(®_map);
1441
1442 if (caller_frame.is_interpreted_frame() ||
1443 caller_frame.is_entry_frame()) {
1444 Method* callee = thread->callee_target();
1445 guarantee(callee != NULL && callee->is_method(), "bad handshake");
1446 thread->set_vm_result_2(callee);
1447 thread->set_callee_target(NULL);
1448 if (caller_frame.is_entry_frame() && VM_Version::supports_fast_class_init_checks()) {
1449 // Bypass class initialization checks in c2i when caller is in native.
1450 // JNI calls to static methods don't have class initialization checks.
1451 // Fast class initialization checks are present in c2i adapters and call into
1452 // SharedRuntime::handle_wrong_method() on the slow path.
1453 //
1454 // JVM upcalls may land here as well, but there's a proper check present in
1455 // LinkResolver::resolve_static_call (called from JavaCalls::call_static),
1456 // so bypassing it in c2i adapter is benign.
1457 return callee->get_c2i_no_clinit_check_entry();
1458 } else {
1459 return callee->get_c2i_entry();
1460 }
1461 }
1462
1463 // Must be compiled to compiled path which is safe to stackwalk
1464 methodHandle callee_method;
1465 JRT_BLOCK
1466 // Force resolving of caller (if we called from compiled frame)
1467 callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL);
1468 thread->set_vm_result_2(callee_method());
1469 JRT_BLOCK_END
1470 // return compiled code entry point after potential safepoints
1471 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1472 return callee_method->verified_code_entry();
1473 JRT_END
1474
1475 // Handle abstract method call
1476 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_abstract(JavaThread* thread))
1477 // Verbose error message for AbstractMethodError.
1478 // Get the called method from the invoke bytecode.
1479 vframeStream vfst(thread, true);
1480 assert(!vfst.at_end(), "Java frame must exist");
1481 methodHandle caller(thread, vfst.method());
1482 Bytecode_invoke invoke(caller, vfst.bci());
1483 DEBUG_ONLY( invoke.verify(); )
1484
1485 // Find the compiled caller frame.
1486 RegisterMap reg_map(thread);
1487 frame stubFrame = thread->last_frame();
1488 assert(stubFrame.is_runtime_frame(), "must be");
1489 frame callerFrame = stubFrame.sender(®_map);
1490 assert(callerFrame.is_compiled_frame(), "must be");
1491
1492 // Install exception and return forward entry.
1493 address res = StubRoutines::throw_AbstractMethodError_entry();
1494 JRT_BLOCK
1495 methodHandle callee(thread, invoke.static_target(thread));
1496 if (!callee.is_null()) {
1497 oop recv = callerFrame.retrieve_receiver(®_map);
1498 Klass *recv_klass = (recv != NULL) ? recv->klass() : NULL;
1499 LinkResolver::throw_abstract_method_error(callee, recv_klass, thread);
1500 res = StubRoutines::forward_exception_entry();
1501 }
1502 JRT_BLOCK_END
1503 return res;
1504 JRT_END
1505
1506
1507 // resolve a static call and patch code
1508 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread ))
1509 methodHandle callee_method;
1510 JRT_BLOCK
1511 callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL);
1512 thread->set_vm_result_2(callee_method());
1513 JRT_BLOCK_END
1514 // return compiled code entry point after potential safepoints
1515 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1516 return callee_method->verified_code_entry();
1517 JRT_END
1518
1519
1520 // resolve virtual call and update inline cache to monomorphic
1521 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread ))
1522 methodHandle callee_method;
1523 JRT_BLOCK
1524 callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL);
1525 thread->set_vm_result_2(callee_method());
1526 JRT_BLOCK_END
1527 // return compiled code entry point after potential safepoints
1528 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1529 return callee_method->verified_code_entry();
1530 JRT_END
1531
1532
1533 // Resolve a virtual call that can be statically bound (e.g., always
1534 // monomorphic, so it has no inline cache). Patch code to resolved target.
1535 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread))
1536 methodHandle callee_method;
1537 JRT_BLOCK
1538 callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL);
1539 thread->set_vm_result_2(callee_method());
1540 JRT_BLOCK_END
1541 // return compiled code entry point after potential safepoints
1542 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1543 return callee_method->verified_code_entry();
1544 JRT_END
1545
1546 // The handle_ic_miss_helper_internal function returns false if it failed due
1547 // to either running out of vtable stubs or ic stubs due to IC transitions
1548 // to transitional states. The needs_ic_stub_refill value will be set if
1549 // the failure was due to running out of IC stubs, in which case handle_ic_miss_helper
1550 // refills the IC stubs and tries again.
1551 bool SharedRuntime::handle_ic_miss_helper_internal(Handle receiver, CompiledMethod* caller_nm,
1552 const frame& caller_frame, methodHandle callee_method,
1553 Bytecodes::Code bc, CallInfo& call_info,
1554 bool& needs_ic_stub_refill, TRAPS) {
1555 CompiledICLocker ml(caller_nm);
1556 CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc());
1557 bool should_be_mono = false;
1558 if (inline_cache->is_optimized()) {
1559 if (TraceCallFixup) {
1560 ResourceMark rm(THREAD);
1561 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc));
1562 callee_method->print_short_name(tty);
1563 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1564 }
1565 should_be_mono = true;
1566 } else if (inline_cache->is_icholder_call()) {
1567 CompiledICHolder* ic_oop = inline_cache->cached_icholder();
1568 if (ic_oop != NULL) {
1569 if (!ic_oop->is_loader_alive()) {
1570 // Deferred IC cleaning due to concurrent class unloading
1571 if (!inline_cache->set_to_clean()) {
1572 needs_ic_stub_refill = true;
1573 return false;
1574 }
1575 } else if (receiver()->klass() == ic_oop->holder_klass()) {
1576 // This isn't a real miss. We must have seen that compiled code
1577 // is now available and we want the call site converted to a
1578 // monomorphic compiled call site.
1579 // We can't assert for callee_method->code() != NULL because it
1580 // could have been deoptimized in the meantime
1581 if (TraceCallFixup) {
1582 ResourceMark rm(THREAD);
1583 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc));
1584 callee_method->print_short_name(tty);
1585 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1586 }
1587 should_be_mono = true;
1588 }
1589 }
1590 }
1591
1592 if (should_be_mono) {
1593 // We have a path that was monomorphic but was going interpreted
1594 // and now we have (or had) a compiled entry. We correct the IC
1595 // by using a new icBuffer.
1596 CompiledICInfo info;
1597 Klass* receiver_klass = receiver()->klass();
1598 inline_cache->compute_monomorphic_entry(callee_method,
1599 receiver_klass,
1600 inline_cache->is_optimized(),
1601 false, caller_nm->is_nmethod(),
1602 info, CHECK_false);
1603 if (!inline_cache->set_to_monomorphic(info)) {
1604 needs_ic_stub_refill = true;
1605 return false;
1606 }
1607 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) {
1608 // Potential change to megamorphic
1609
1610 bool successful = inline_cache->set_to_megamorphic(&call_info, bc, needs_ic_stub_refill, CHECK_false);
1611 if (needs_ic_stub_refill) {
1612 return false;
1613 }
1614 if (!successful) {
1615 if (!inline_cache->set_to_clean()) {
1616 needs_ic_stub_refill = true;
1617 return false;
1618 }
1619 }
1620 } else {
1621 // Either clean or megamorphic
1622 }
1623 return true;
1624 }
1625
1626 methodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) {
1627 ResourceMark rm(thread);
1628 CallInfo call_info;
1629 Bytecodes::Code bc;
1630
1631 // receiver is NULL for static calls. An exception is thrown for NULL
1632 // receivers for non-static calls
1633 Handle receiver = find_callee_info(thread, bc, call_info,
1634 CHECK_(methodHandle()));
1635 // Compiler1 can produce virtual call sites that can actually be statically bound
1636 // If we fell thru to below we would think that the site was going megamorphic
1637 // when in fact the site can never miss. Worse because we'd think it was megamorphic
1638 // we'd try and do a vtable dispatch however methods that can be statically bound
1639 // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a
1640 // reresolution of the call site (as if we did a handle_wrong_method and not an
1641 // plain ic_miss) and the site will be converted to an optimized virtual call site
1642 // never to miss again. I don't believe C2 will produce code like this but if it
1643 // did this would still be the correct thing to do for it too, hence no ifdef.
1644 //
1645 if (call_info.resolved_method()->can_be_statically_bound()) {
1646 methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle()));
1647 if (TraceCallFixup) {
1648 RegisterMap reg_map(thread, false);
1649 frame caller_frame = thread->last_frame().sender(®_map);
1650 ResourceMark rm(thread);
1651 tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc));
1652 callee_method->print_short_name(tty);
1653 tty->print_cr(" from pc: " INTPTR_FORMAT, p2i(caller_frame.pc()));
1654 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1655 }
1656 return callee_method;
1657 }
1658
1659 methodHandle callee_method(thread, call_info.selected_method());
1660
1661 #ifndef PRODUCT
1662 Atomic::inc(&_ic_miss_ctr);
1663
1664 // Statistics & Tracing
1665 if (TraceCallFixup) {
1666 ResourceMark rm(thread);
1667 tty->print("IC miss (%s) call to", Bytecodes::name(bc));
1668 callee_method->print_short_name(tty);
1669 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1670 }
1671
1672 if (ICMissHistogram) {
1673 MutexLocker m(VMStatistic_lock);
1674 RegisterMap reg_map(thread, false);
1675 frame f = thread->last_frame().real_sender(®_map);// skip runtime stub
1676 // produce statistics under the lock
1677 trace_ic_miss(f.pc());
1678 }
1679 #endif
1680
1681 // install an event collector so that when a vtable stub is created the
1682 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The
1683 // event can't be posted when the stub is created as locks are held
1684 // - instead the event will be deferred until the event collector goes
1685 // out of scope.
1686 JvmtiDynamicCodeEventCollector event_collector;
1687
1688 // Update inline cache to megamorphic. Skip update if we are called from interpreted.
1689 // Transitioning IC caches may require transition stubs. If we run out
1690 // of transition stubs, we have to drop locks and perform a safepoint
1691 // that refills them.
1692 RegisterMap reg_map(thread, false);
1693 frame caller_frame = thread->last_frame().sender(®_map);
1694 CodeBlob* cb = caller_frame.cb();
1695 CompiledMethod* caller_nm = cb->as_compiled_method();
1696
1697 for (;;) {
1698 ICRefillVerifier ic_refill_verifier;
1699 bool needs_ic_stub_refill = false;
1700 bool successful = handle_ic_miss_helper_internal(receiver, caller_nm, caller_frame, callee_method,
1701 bc, call_info, needs_ic_stub_refill, CHECK_(methodHandle()));
1702 if (successful || !needs_ic_stub_refill) {
1703 return callee_method;
1704 } else {
1705 InlineCacheBuffer::refill_ic_stubs();
1706 }
1707 }
1708 }
1709
1710 static bool clear_ic_at_addr(CompiledMethod* caller_nm, address call_addr, bool is_static_call) {
1711 CompiledICLocker ml(caller_nm);
1712 if (is_static_call) {
1713 CompiledStaticCall* ssc = caller_nm->compiledStaticCall_at(call_addr);
1714 if (!ssc->is_clean()) {
1715 return ssc->set_to_clean();
1716 }
1717 } else {
1718 // compiled, dispatched call (which used to call an interpreted method)
1719 CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr);
1720 if (!inline_cache->is_clean()) {
1721 return inline_cache->set_to_clean();
1722 }
1723 }
1724 return true;
1725 }
1726
1727 //
1728 // Resets a call-site in compiled code so it will get resolved again.
1729 // This routines handles both virtual call sites, optimized virtual call
1730 // sites, and static call sites. Typically used to change a call sites
1731 // destination from compiled to interpreted.
1732 //
1733 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) {
1734 ResourceMark rm(thread);
1735 RegisterMap reg_map(thread, false);
1736 frame stub_frame = thread->last_frame();
1737 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1738 frame caller = stub_frame.sender(®_map);
1739
1740 // Do nothing if the frame isn't a live compiled frame.
1741 // nmethod could be deoptimized by the time we get here
1742 // so no update to the caller is needed.
1743
1744 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) {
1745
1746 address pc = caller.pc();
1747
1748 // Check for static or virtual call
1749 bool is_static_call = false;
1750 CompiledMethod* caller_nm = CodeCache::find_compiled(pc);
1751
1752 // Default call_addr is the location of the "basic" call.
1753 // Determine the address of the call we a reresolving. With
1754 // Inline Caches we will always find a recognizable call.
1755 // With Inline Caches disabled we may or may not find a
1756 // recognizable call. We will always find a call for static
1757 // calls and for optimized virtual calls. For vanilla virtual
1758 // calls it depends on the state of the UseInlineCaches switch.
1759 //
1760 // With Inline Caches disabled we can get here for a virtual call
1761 // for two reasons:
1762 // 1 - calling an abstract method. The vtable for abstract methods
1763 // will run us thru handle_wrong_method and we will eventually
1764 // end up in the interpreter to throw the ame.
1765 // 2 - a racing deoptimization. We could be doing a vanilla vtable
1766 // call and between the time we fetch the entry address and
1767 // we jump to it the target gets deoptimized. Similar to 1
1768 // we will wind up in the interprter (thru a c2i with c2).
1769 //
1770 address call_addr = NULL;
1771 {
1772 // Get call instruction under lock because another thread may be
1773 // busy patching it.
1774 CompiledICLocker ml(caller_nm);
1775 // Location of call instruction
1776 call_addr = caller_nm->call_instruction_address(pc);
1777 }
1778 // Make sure nmethod doesn't get deoptimized and removed until
1779 // this is done with it.
1780 // CLEANUP - with lazy deopt shouldn't need this lock
1781 nmethodLocker nmlock(caller_nm);
1782
1783 if (call_addr != NULL) {
1784 RelocIterator iter(caller_nm, call_addr, call_addr+1);
1785 int ret = iter.next(); // Get item
1786 if (ret) {
1787 assert(iter.addr() == call_addr, "must find call");
1788 if (iter.type() == relocInfo::static_call_type) {
1789 is_static_call = true;
1790 } else {
1791 assert(iter.type() == relocInfo::virtual_call_type ||
1792 iter.type() == relocInfo::opt_virtual_call_type
1793 , "unexpected relocInfo. type");
1794 }
1795 } else {
1796 assert(!UseInlineCaches, "relocation info. must exist for this address");
1797 }
1798
1799 // Cleaning the inline cache will force a new resolve. This is more robust
1800 // than directly setting it to the new destination, since resolving of calls
1801 // is always done through the same code path. (experience shows that it
1802 // leads to very hard to track down bugs, if an inline cache gets updated
1803 // to a wrong method). It should not be performance critical, since the
1804 // resolve is only done once.
1805
1806 for (;;) {
1807 ICRefillVerifier ic_refill_verifier;
1808 if (!clear_ic_at_addr(caller_nm, call_addr, is_static_call)) {
1809 InlineCacheBuffer::refill_ic_stubs();
1810 } else {
1811 break;
1812 }
1813 }
1814 }
1815 }
1816
1817 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle()));
1818
1819
1820 #ifndef PRODUCT
1821 Atomic::inc(&_wrong_method_ctr);
1822
1823 if (TraceCallFixup) {
1824 ResourceMark rm(thread);
1825 tty->print("handle_wrong_method reresolving call to");
1826 callee_method->print_short_name(tty);
1827 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1828 }
1829 #endif
1830
1831 return callee_method;
1832 }
1833
1834 address SharedRuntime::handle_unsafe_access(JavaThread* thread, address next_pc) {
1835 // The faulting unsafe accesses should be changed to throw the error
1836 // synchronously instead. Meanwhile the faulting instruction will be
1837 // skipped over (effectively turning it into a no-op) and an
1838 // asynchronous exception will be raised which the thread will
1839 // handle at a later point. If the instruction is a load it will
1840 // return garbage.
1841
1842 // Request an async exception.
1843 thread->set_pending_unsafe_access_error();
1844
1845 // Return address of next instruction to execute.
1846 return next_pc;
1847 }
1848
1849 #ifdef ASSERT
1850 void SharedRuntime::check_member_name_argument_is_last_argument(const methodHandle& method,
1851 const BasicType* sig_bt,
1852 const VMRegPair* regs) {
1853 ResourceMark rm;
1854 const int total_args_passed = method->size_of_parameters();
1855 const VMRegPair* regs_with_member_name = regs;
1856 VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1);
1857
1858 const int member_arg_pos = total_args_passed - 1;
1859 assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob");
1860 assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object");
1861
1862 const bool is_outgoing = method->is_method_handle_intrinsic();
1863 int comp_args_on_stack = java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1, is_outgoing);
1864
1865 for (int i = 0; i < member_arg_pos; i++) {
1866 VMReg a = regs_with_member_name[i].first();
1867 VMReg b = regs_without_member_name[i].first();
1868 assert(a->value() == b->value(), "register allocation mismatch: a=" INTX_FORMAT ", b=" INTX_FORMAT, a->value(), b->value());
1869 }
1870 assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg");
1871 }
1872 #endif
1873
1874 bool SharedRuntime::should_fixup_call_destination(address destination, address entry_point, address caller_pc, Method* moop, CodeBlob* cb) {
1875 if (destination != entry_point) {
1876 CodeBlob* callee = CodeCache::find_blob(destination);
1877 // callee == cb seems weird. It means calling interpreter thru stub.
1878 if (callee != NULL && (callee == cb || callee->is_adapter_blob())) {
1879 // static call or optimized virtual
1880 if (TraceCallFixup) {
1881 tty->print("fixup callsite at " INTPTR_FORMAT " to compiled code for", p2i(caller_pc));
1882 moop->print_short_name(tty);
1883 tty->print_cr(" to " INTPTR_FORMAT, p2i(entry_point));
1884 }
1885 return true;
1886 } else {
1887 if (TraceCallFixup) {
1888 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", p2i(caller_pc));
1889 moop->print_short_name(tty);
1890 tty->print_cr(" to " INTPTR_FORMAT, p2i(entry_point));
1891 }
1892 // assert is too strong could also be resolve destinations.
1893 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be");
1894 }
1895 } else {
1896 if (TraceCallFixup) {
1897 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", p2i(caller_pc));
1898 moop->print_short_name(tty);
1899 tty->print_cr(" to " INTPTR_FORMAT, p2i(entry_point));
1900 }
1901 }
1902 return false;
1903 }
1904
1905 // ---------------------------------------------------------------------------
1906 // We are calling the interpreter via a c2i. Normally this would mean that
1907 // we were called by a compiled method. However we could have lost a race
1908 // where we went int -> i2c -> c2i and so the caller could in fact be
1909 // interpreted. If the caller is compiled we attempt to patch the caller
1910 // so he no longer calls into the interpreter.
1911 JRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc))
1912 Method* moop(method);
1913
1914 address entry_point = moop->from_compiled_entry_no_trampoline();
1915
1916 // It's possible that deoptimization can occur at a call site which hasn't
1917 // been resolved yet, in which case this function will be called from
1918 // an nmethod that has been patched for deopt and we can ignore the
1919 // request for a fixup.
1920 // Also it is possible that we lost a race in that from_compiled_entry
1921 // is now back to the i2c in that case we don't need to patch and if
1922 // we did we'd leap into space because the callsite needs to use
1923 // "to interpreter" stub in order to load up the Method*. Don't
1924 // ask me how I know this...
1925
1926 CodeBlob* cb = CodeCache::find_blob(caller_pc);
1927 if (cb == NULL || !cb->is_compiled() || entry_point == moop->get_c2i_entry()) {
1928 return;
1929 }
1930
1931 // The check above makes sure this is a nmethod.
1932 CompiledMethod* nm = cb->as_compiled_method_or_null();
1933 assert(nm, "must be");
1934
1935 // Get the return PC for the passed caller PC.
1936 address return_pc = caller_pc + frame::pc_return_offset;
1937
1938 // There is a benign race here. We could be attempting to patch to a compiled
1939 // entry point at the same time the callee is being deoptimized. If that is
1940 // the case then entry_point may in fact point to a c2i and we'd patch the
1941 // call site with the same old data. clear_code will set code() to NULL
1942 // at the end of it. If we happen to see that NULL then we can skip trying
1943 // to patch. If we hit the window where the callee has a c2i in the
1944 // from_compiled_entry and the NULL isn't present yet then we lose the race
1945 // and patch the code with the same old data. Asi es la vida.
1946
1947 if (moop->code() == NULL) return;
1948
1949 if (nm->is_in_use()) {
1950 // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1951 CompiledICLocker ic_locker(nm);
1952 if (NativeCall::is_call_before(return_pc)) {
1953 ResourceMark mark;
1954 NativeCallWrapper* call = nm->call_wrapper_before(return_pc);
1955 //
1956 // bug 6281185. We might get here after resolving a call site to a vanilla
1957 // virtual call. Because the resolvee uses the verified entry it may then
1958 // see compiled code and attempt to patch the site by calling us. This would
1959 // then incorrectly convert the call site to optimized and its downhill from
1960 // there. If you're lucky you'll get the assert in the bugid, if not you've
1961 // just made a call site that could be megamorphic into a monomorphic site
1962 // for the rest of its life! Just another racing bug in the life of
1963 // fixup_callers_callsite ...
1964 //
1965 RelocIterator iter(nm, call->instruction_address(), call->next_instruction_address());
1966 iter.next();
1967 assert(iter.has_current(), "must have a reloc at java call site");
1968 relocInfo::relocType typ = iter.reloc()->type();
1969 if (typ != relocInfo::static_call_type &&
1970 typ != relocInfo::opt_virtual_call_type &&
1971 typ != relocInfo::static_stub_type) {
1972 return;
1973 }
1974 address destination = call->destination();
1975 if (should_fixup_call_destination(destination, entry_point, caller_pc, moop, cb)) {
1976 call->set_destination_mt_safe(entry_point);
1977 }
1978 }
1979 }
1980 JRT_END
1981
1982
1983 // same as JVM_Arraycopy, but called directly from compiled code
1984 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos,
1985 oopDesc* dest, jint dest_pos,
1986 jint length,
1987 JavaThread* thread)) {
1988 #ifndef PRODUCT
1989 _slow_array_copy_ctr++;
1990 #endif
1991 // Check if we have null pointers
1992 if (src == NULL || dest == NULL) {
1993 THROW(vmSymbols::java_lang_NullPointerException());
1994 }
1995 // Do the copy. The casts to arrayOop are necessary to the copy_array API,
1996 // even though the copy_array API also performs dynamic checks to ensure
1997 // that src and dest are truly arrays (and are conformable).
1998 // The copy_array mechanism is awkward and could be removed, but
1999 // the compilers don't call this function except as a last resort,
2000 // so it probably doesn't matter.
2001 src->klass()->copy_array((arrayOopDesc*)src, src_pos,
2002 (arrayOopDesc*)dest, dest_pos,
2003 length, thread);
2004 }
2005 JRT_END
2006
2007 // The caller of generate_class_cast_message() (or one of its callers)
2008 // must use a ResourceMark in order to correctly free the result.
2009 char* SharedRuntime::generate_class_cast_message(
2010 JavaThread* thread, Klass* caster_klass) {
2011
2012 // Get target class name from the checkcast instruction
2013 vframeStream vfst(thread, true);
2014 assert(!vfst.at_end(), "Java frame must exist");
2015 Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci()));
2016 constantPoolHandle cpool(thread, vfst.method()->constants());
2017 Klass* target_klass = ConstantPool::klass_at_if_loaded(cpool, cc.index());
2018 Symbol* target_klass_name = NULL;
2019 if (target_klass == NULL) {
2020 // This klass should be resolved, but just in case, get the name in the klass slot.
2021 target_klass_name = cpool->klass_name_at(cc.index());
2022 }
2023 return generate_class_cast_message(caster_klass, target_klass, target_klass_name);
2024 }
2025
2026
2027 // The caller of generate_class_cast_message() (or one of its callers)
2028 // must use a ResourceMark in order to correctly free the result.
2029 char* SharedRuntime::generate_class_cast_message(
2030 Klass* caster_klass, Klass* target_klass, Symbol* target_klass_name) {
2031 const char* caster_name = caster_klass->external_name();
2032
2033 assert(target_klass != NULL || target_klass_name != NULL, "one must be provided");
2034 const char* target_name = target_klass == NULL ? target_klass_name->as_klass_external_name() :
2035 target_klass->external_name();
2036
2037 size_t msglen = strlen(caster_name) + strlen("class ") + strlen(" cannot be cast to class ") + strlen(target_name) + 1;
2038
2039 const char* caster_klass_description = "";
2040 const char* target_klass_description = "";
2041 const char* klass_separator = "";
2042 if (target_klass != NULL && caster_klass->module() == target_klass->module()) {
2043 caster_klass_description = caster_klass->joint_in_module_of_loader(target_klass);
2044 } else {
2045 caster_klass_description = caster_klass->class_in_module_of_loader();
2046 target_klass_description = (target_klass != NULL) ? target_klass->class_in_module_of_loader() : "";
2047 klass_separator = (target_klass != NULL) ? "; " : "";
2048 }
2049
2050 // add 3 for parenthesis and preceeding space
2051 msglen += strlen(caster_klass_description) + strlen(target_klass_description) + strlen(klass_separator) + 3;
2052
2053 char* message = NEW_RESOURCE_ARRAY_RETURN_NULL(char, msglen);
2054 if (message == NULL) {
2055 // Shouldn't happen, but don't cause even more problems if it does
2056 message = const_cast<char*>(caster_klass->external_name());
2057 } else {
2058 jio_snprintf(message,
2059 msglen,
2060 "class %s cannot be cast to class %s (%s%s%s)",
2061 caster_name,
2062 target_name,
2063 caster_klass_description,
2064 klass_separator,
2065 target_klass_description
2066 );
2067 }
2068 return message;
2069 }
2070
2071 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
2072 (void) JavaThread::current()->reguard_stack();
2073 JRT_END
2074
2075
2076 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
2077 JRT_BLOCK_ENTRY(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
2078 if (!SafepointSynchronize::is_synchronizing()) {
2079 // Only try quick_enter() if we're not trying to reach a safepoint
2080 // so that the calling thread reaches the safepoint more quickly.
2081 if (ObjectSynchronizer::quick_enter(_obj, thread, lock)) return;
2082 }
2083 // NO_ASYNC required because an async exception on the state transition destructor
2084 // would leave you with the lock held and it would never be released.
2085 // The normal monitorenter NullPointerException is thrown without acquiring a lock
2086 // and the model is that an exception implies the method failed.
2087 JRT_BLOCK_NO_ASYNC
2088 oop obj(_obj);
2089 if (PrintBiasedLockingStatistics) {
2090 Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
2091 }
2092 Handle h_obj(THREAD, obj);
2093 ObjectSynchronizer::enter(h_obj, lock, CHECK);
2094 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
2095 JRT_BLOCK_END
2096 JRT_END
2097
2098 // Handles the uncommon cases of monitor unlocking in compiled code
2099 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock, JavaThread * THREAD))
2100 oop obj(_obj);
2101 assert(JavaThread::current() == THREAD, "invariant");
2102 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore
2103 // testing was unable to ever fire the assert that guarded it so I have removed it.
2104 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?");
2105 #undef MIGHT_HAVE_PENDING
2106 #ifdef MIGHT_HAVE_PENDING
2107 // Save and restore any pending_exception around the exception mark.
2108 // While the slow_exit must not throw an exception, we could come into
2109 // this routine with one set.
2110 oop pending_excep = NULL;
2111 const char* pending_file;
2112 int pending_line;
2113 if (HAS_PENDING_EXCEPTION) {
2114 pending_excep = PENDING_EXCEPTION;
2115 pending_file = THREAD->exception_file();
2116 pending_line = THREAD->exception_line();
2117 CLEAR_PENDING_EXCEPTION;
2118 }
2119 #endif /* MIGHT_HAVE_PENDING */
2120
2121 {
2122 // Exit must be non-blocking, and therefore no exceptions can be thrown.
2123 EXCEPTION_MARK;
2124 ObjectSynchronizer::exit(obj, lock, THREAD);
2125 }
2126
2127 #ifdef MIGHT_HAVE_PENDING
2128 if (pending_excep != NULL) {
2129 THREAD->set_pending_exception(pending_excep, pending_file, pending_line);
2130 }
2131 #endif /* MIGHT_HAVE_PENDING */
2132 JRT_END
2133
2134 #ifndef PRODUCT
2135
2136 void SharedRuntime::print_statistics() {
2137 ttyLocker ttyl;
2138 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'");
2139
2140 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr);
2141
2142 SharedRuntime::print_ic_miss_histogram();
2143
2144 if (CountRemovableExceptions) {
2145 if (_nof_removable_exceptions > 0) {
2146 Unimplemented(); // this counter is not yet incremented
2147 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions);
2148 }
2149 }
2150
2151 // Dump the JRT_ENTRY counters
2152 if (_new_instance_ctr) tty->print_cr("%5d new instance requires GC", _new_instance_ctr);
2153 if (_new_array_ctr) tty->print_cr("%5d new array requires GC", _new_array_ctr);
2154 if (_multi1_ctr) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr);
2155 if (_multi2_ctr) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr);
2156 if (_multi3_ctr) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr);
2157 if (_multi4_ctr) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr);
2158 if (_multi5_ctr) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr);
2159
2160 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr);
2161 tty->print_cr("%5d wrong method", _wrong_method_ctr);
2162 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr);
2163 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr);
2164 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr);
2165
2166 if (_mon_enter_stub_ctr) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr);
2167 if (_mon_exit_stub_ctr) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr);
2168 if (_mon_enter_ctr) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr);
2169 if (_mon_exit_ctr) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr);
2170 if (_partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr);
2171 if (_jbyte_array_copy_ctr) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr);
2172 if (_jshort_array_copy_ctr) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr);
2173 if (_jint_array_copy_ctr) tty->print_cr("%5d int array copies", _jint_array_copy_ctr);
2174 if (_jlong_array_copy_ctr) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr);
2175 if (_oop_array_copy_ctr) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr);
2176 if (_checkcast_array_copy_ctr) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr);
2177 if (_unsafe_array_copy_ctr) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr);
2178 if (_generic_array_copy_ctr) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr);
2179 if (_slow_array_copy_ctr) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr);
2180 if (_find_handler_ctr) tty->print_cr("%5d find exception handler", _find_handler_ctr);
2181 if (_rethrow_ctr) tty->print_cr("%5d rethrow handler", _rethrow_ctr);
2182
2183 AdapterHandlerLibrary::print_statistics();
2184
2185 if (xtty != NULL) xtty->tail("statistics");
2186 }
2187
2188 inline double percent(int x, int y) {
2189 return 100.0 * x / MAX2(y, 1);
2190 }
2191
2192 class MethodArityHistogram {
2193 public:
2194 enum { MAX_ARITY = 256 };
2195 private:
2196 static int _arity_histogram[MAX_ARITY]; // histogram of #args
2197 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words
2198 static int _max_arity; // max. arity seen
2199 static int _max_size; // max. arg size seen
2200
2201 static void add_method_to_histogram(nmethod* nm) {
2202 if (CompiledMethod::nmethod_access_is_safe(nm)) {
2203 Method* method = nm->method();
2204 ArgumentCount args(method->signature());
2205 int arity = args.size() + (method->is_static() ? 0 : 1);
2206 int argsize = method->size_of_parameters();
2207 arity = MIN2(arity, MAX_ARITY-1);
2208 argsize = MIN2(argsize, MAX_ARITY-1);
2209 int count = method->compiled_invocation_count();
2210 _arity_histogram[arity] += count;
2211 _size_histogram[argsize] += count;
2212 _max_arity = MAX2(_max_arity, arity);
2213 _max_size = MAX2(_max_size, argsize);
2214 }
2215 }
2216
2217 void print_histogram_helper(int n, int* histo, const char* name) {
2218 const int N = MIN2(5, n);
2219 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2220 double sum = 0;
2221 double weighted_sum = 0;
2222 int i;
2223 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; }
2224 double rest = sum;
2225 double percent = sum / 100;
2226 for (i = 0; i <= N; i++) {
2227 rest -= histo[i];
2228 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent);
2229 }
2230 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent);
2231 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
2232 }
2233
2234 void print_histogram() {
2235 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2236 print_histogram_helper(_max_arity, _arity_histogram, "arity");
2237 tty->print_cr("\nSame for parameter size (in words):");
2238 print_histogram_helper(_max_size, _size_histogram, "size");
2239 tty->cr();
2240 }
2241
2242 public:
2243 MethodArityHistogram() {
2244 MutexLocker mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2245 _max_arity = _max_size = 0;
2246 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram[i] = 0;
2247 CodeCache::nmethods_do(add_method_to_histogram);
2248 print_histogram();
2249 }
2250 };
2251
2252 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
2253 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
2254 int MethodArityHistogram::_max_arity;
2255 int MethodArityHistogram::_max_size;
2256
2257 void SharedRuntime::print_call_statistics(int comp_total) {
2258 tty->print_cr("Calls from compiled code:");
2259 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
2260 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls;
2261 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls;
2262 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total));
2263 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total));
2264 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
2265 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls));
2266 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls));
2267 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
2268 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total));
2269 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
2270 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls));
2271 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls));
2272 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls));
2273 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
2274 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
2275 tty->cr();
2276 tty->print_cr("Note 1: counter updates are not MT-safe.");
2277 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
2278 tty->print_cr(" %% in nested categories are relative to their category");
2279 tty->print_cr(" (and thus add up to more than 100%% with inlining)");
2280 tty->cr();
2281
2282 MethodArityHistogram h;
2283 }
2284 #endif
2285
2286
2287 // A simple wrapper class around the calling convention information
2288 // that allows sharing of adapters for the same calling convention.
2289 class AdapterFingerPrint : public CHeapObj<mtCode> {
2290 private:
2291 enum {
2292 _basic_type_bits = 4,
2293 _basic_type_mask = right_n_bits(_basic_type_bits),
2294 _basic_types_per_int = BitsPerInt / _basic_type_bits,
2295 _compact_int_count = 3
2296 };
2297 // TO DO: Consider integrating this with a more global scheme for compressing signatures.
2298 // For now, 4 bits per components (plus T_VOID gaps after double/long) is not excessive.
2299
2300 union {
2301 int _compact[_compact_int_count];
2302 int* _fingerprint;
2303 } _value;
2304 int _length; // A negative length indicates the fingerprint is in the compact form,
2305 // Otherwise _value._fingerprint is the array.
2306
2307 // Remap BasicTypes that are handled equivalently by the adapters.
2308 // These are correct for the current system but someday it might be
2309 // necessary to make this mapping platform dependent.
2310 static int adapter_encoding(BasicType in) {
2311 switch (in) {
2312 case T_BOOLEAN:
2313 case T_BYTE:
2314 case T_SHORT:
2315 case T_CHAR:
2316 // There are all promoted to T_INT in the calling convention
2317 return T_INT;
2318
2319 case T_OBJECT:
2320 case T_ARRAY:
2321 // In other words, we assume that any register good enough for
2322 // an int or long is good enough for a managed pointer.
2323 #ifdef _LP64
2324 return T_LONG;
2325 #else
2326 return T_INT;
2327 #endif
2328
2329 case T_INT:
2330 case T_LONG:
2331 case T_FLOAT:
2332 case T_DOUBLE:
2333 case T_VOID:
2334 return in;
2335
2336 default:
2337 ShouldNotReachHere();
2338 return T_CONFLICT;
2339 }
2340 }
2341
2342 public:
2343 AdapterFingerPrint(int total_args_passed, BasicType* sig_bt) {
2344 // The fingerprint is based on the BasicType signature encoded
2345 // into an array of ints with eight entries per int.
2346 int* ptr;
2347 int len = (total_args_passed + (_basic_types_per_int-1)) / _basic_types_per_int;
2348 if (len <= _compact_int_count) {
2349 assert(_compact_int_count == 3, "else change next line");
2350 _value._compact[0] = _value._compact[1] = _value._compact[2] = 0;
2351 // Storing the signature encoded as signed chars hits about 98%
2352 // of the time.
2353 _length = -len;
2354 ptr = _value._compact;
2355 } else {
2356 _length = len;
2357 _value._fingerprint = NEW_C_HEAP_ARRAY(int, _length, mtCode);
2358 ptr = _value._fingerprint;
2359 }
2360
2361 // Now pack the BasicTypes with 8 per int
2362 int sig_index = 0;
2363 for (int index = 0; index < len; index++) {
2364 int value = 0;
2365 for (int byte = 0; byte < _basic_types_per_int; byte++) {
2366 int bt = ((sig_index < total_args_passed)
2367 ? adapter_encoding(sig_bt[sig_index++])
2368 : 0);
2369 assert((bt & _basic_type_mask) == bt, "must fit in 4 bits");
2370 value = (value << _basic_type_bits) | bt;
2371 }
2372 ptr[index] = value;
2373 }
2374 }
2375
2376 ~AdapterFingerPrint() {
2377 if (_length > 0) {
2378 FREE_C_HEAP_ARRAY(int, _value._fingerprint);
2379 }
2380 }
2381
2382 int value(int index) {
2383 if (_length < 0) {
2384 return _value._compact[index];
2385 }
2386 return _value._fingerprint[index];
2387 }
2388 int length() {
2389 if (_length < 0) return -_length;
2390 return _length;
2391 }
2392
2393 bool is_compact() {
2394 return _length <= 0;
2395 }
2396
2397 unsigned int compute_hash() {
2398 int hash = 0;
2399 for (int i = 0; i < length(); i++) {
2400 int v = value(i);
2401 hash = (hash << 8) ^ v ^ (hash >> 5);
2402 }
2403 return (unsigned int)hash;
2404 }
2405
2406 const char* as_string() {
2407 stringStream st;
2408 st.print("0x");
2409 for (int i = 0; i < length(); i++) {
2410 st.print("%08x", value(i));
2411 }
2412 return st.as_string();
2413 }
2414
2415 bool equals(AdapterFingerPrint* other) {
2416 if (other->_length != _length) {
2417 return false;
2418 }
2419 if (_length < 0) {
2420 assert(_compact_int_count == 3, "else change next line");
2421 return _value._compact[0] == other->_value._compact[0] &&
2422 _value._compact[1] == other->_value._compact[1] &&
2423 _value._compact[2] == other->_value._compact[2];
2424 } else {
2425 for (int i = 0; i < _length; i++) {
2426 if (_value._fingerprint[i] != other->_value._fingerprint[i]) {
2427 return false;
2428 }
2429 }
2430 }
2431 return true;
2432 }
2433 };
2434
2435
2436 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries
2437 class AdapterHandlerTable : public BasicHashtable<mtCode> {
2438 friend class AdapterHandlerTableIterator;
2439
2440 private:
2441
2442 #ifndef PRODUCT
2443 static int _lookups; // number of calls to lookup
2444 static int _buckets; // number of buckets checked
2445 static int _equals; // number of buckets checked with matching hash
2446 static int _hits; // number of successful lookups
2447 static int _compact; // number of equals calls with compact signature
2448 #endif
2449
2450 AdapterHandlerEntry* bucket(int i) {
2451 return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i);
2452 }
2453
2454 public:
2455 AdapterHandlerTable()
2456 : BasicHashtable<mtCode>(293, (DumpSharedSpaces ? sizeof(CDSAdapterHandlerEntry) : sizeof(AdapterHandlerEntry))) { }
2457
2458 // Create a new entry suitable for insertion in the table
2459 AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry, address c2i_no_clinit_check_entry) {
2460 AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable<mtCode>::new_entry(fingerprint->compute_hash());
2461 entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry, c2i_no_clinit_check_entry);
2462 if (DumpSharedSpaces) {
2463 ((CDSAdapterHandlerEntry*)entry)->init();
2464 }
2465 return entry;
2466 }
2467
2468 // Insert an entry into the table
2469 void add(AdapterHandlerEntry* entry) {
2470 int index = hash_to_index(entry->hash());
2471 add_entry(index, entry);
2472 }
2473
2474 void free_entry(AdapterHandlerEntry* entry) {
2475 entry->deallocate();
2476 BasicHashtable<mtCode>::free_entry(entry);
2477 }
2478
2479 // Find a entry with the same fingerprint if it exists
2480 AdapterHandlerEntry* lookup(int total_args_passed, BasicType* sig_bt) {
2481 NOT_PRODUCT(_lookups++);
2482 AdapterFingerPrint fp(total_args_passed, sig_bt);
2483 unsigned int hash = fp.compute_hash();
2484 int index = hash_to_index(hash);
2485 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2486 NOT_PRODUCT(_buckets++);
2487 if (e->hash() == hash) {
2488 NOT_PRODUCT(_equals++);
2489 if (fp.equals(e->fingerprint())) {
2490 #ifndef PRODUCT
2491 if (fp.is_compact()) _compact++;
2492 _hits++;
2493 #endif
2494 return e;
2495 }
2496 }
2497 }
2498 return NULL;
2499 }
2500
2501 #ifndef PRODUCT
2502 void print_statistics() {
2503 ResourceMark rm;
2504 int longest = 0;
2505 int empty = 0;
2506 int total = 0;
2507 int nonempty = 0;
2508 for (int index = 0; index < table_size(); index++) {
2509 int count = 0;
2510 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2511 count++;
2512 }
2513 if (count != 0) nonempty++;
2514 if (count == 0) empty++;
2515 if (count > longest) longest = count;
2516 total += count;
2517 }
2518 tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f",
2519 empty, longest, total, total / (double)nonempty);
2520 tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d",
2521 _lookups, _buckets, _equals, _hits, _compact);
2522 }
2523 #endif
2524 };
2525
2526
2527 #ifndef PRODUCT
2528
2529 int AdapterHandlerTable::_lookups;
2530 int AdapterHandlerTable::_buckets;
2531 int AdapterHandlerTable::_equals;
2532 int AdapterHandlerTable::_hits;
2533 int AdapterHandlerTable::_compact;
2534
2535 #endif
2536
2537 class AdapterHandlerTableIterator : public StackObj {
2538 private:
2539 AdapterHandlerTable* _table;
2540 int _index;
2541 AdapterHandlerEntry* _current;
2542
2543 void scan() {
2544 while (_index < _table->table_size()) {
2545 AdapterHandlerEntry* a = _table->bucket(_index);
2546 _index++;
2547 if (a != NULL) {
2548 _current = a;
2549 return;
2550 }
2551 }
2552 }
2553
2554 public:
2555 AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) {
2556 scan();
2557 }
2558 bool has_next() {
2559 return _current != NULL;
2560 }
2561 AdapterHandlerEntry* next() {
2562 if (_current != NULL) {
2563 AdapterHandlerEntry* result = _current;
2564 _current = _current->next();
2565 if (_current == NULL) scan();
2566 return result;
2567 } else {
2568 return NULL;
2569 }
2570 }
2571 };
2572
2573
2574 // ---------------------------------------------------------------------------
2575 // Implementation of AdapterHandlerLibrary
2576 AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL;
2577 AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL;
2578 const int AdapterHandlerLibrary_size = 16*K;
2579 BufferBlob* AdapterHandlerLibrary::_buffer = NULL;
2580
2581 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
2582 // Should be called only when AdapterHandlerLibrary_lock is active.
2583 if (_buffer == NULL) // Initialize lazily
2584 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
2585 return _buffer;
2586 }
2587
2588 extern "C" void unexpected_adapter_call() {
2589 ShouldNotCallThis();
2590 }
2591
2592 void AdapterHandlerLibrary::initialize() {
2593 if (_adapters != NULL) return;
2594 _adapters = new AdapterHandlerTable();
2595
2596 // Create a special handler for abstract methods. Abstract methods
2597 // are never compiled so an i2c entry is somewhat meaningless, but
2598 // throw AbstractMethodError just in case.
2599 // Pass wrong_method_abstract for the c2i transitions to return
2600 // AbstractMethodError for invalid invocations.
2601 address wrong_method_abstract = SharedRuntime::get_handle_wrong_method_abstract_stub();
2602 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL),
2603 StubRoutines::throw_AbstractMethodError_entry(),
2604 wrong_method_abstract, wrong_method_abstract);
2605 }
2606
2607 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint,
2608 address i2c_entry,
2609 address c2i_entry,
2610 address c2i_unverified_entry,
2611 address c2i_no_clinit_check_entry) {
2612 return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry, c2i_no_clinit_check_entry);
2613 }
2614
2615 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(const methodHandle& method) {
2616 AdapterHandlerEntry* entry = get_adapter0(method);
2617 if (entry != NULL && method->is_shared()) {
2618 // See comments around Method::link_method()
2619 MutexLocker mu(AdapterHandlerLibrary_lock);
2620 if (method->adapter() == NULL) {
2621 method->update_adapter_trampoline(entry);
2622 }
2623 address trampoline = method->from_compiled_entry();
2624 if (*(int*)trampoline == 0) {
2625 CodeBuffer buffer(trampoline, (int)SharedRuntime::trampoline_size());
2626 MacroAssembler _masm(&buffer);
2627 SharedRuntime::generate_trampoline(&_masm, entry->get_c2i_entry());
2628 assert(*(int*)trampoline != 0, "Instruction(s) for trampoline must not be encoded as zeros.");
2629 _masm.flush();
2630
2631 if (PrintInterpreter) {
2632 Disassembler::decode(buffer.insts_begin(), buffer.insts_end());
2633 }
2634 }
2635 }
2636
2637 return entry;
2638 }
2639
2640 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter0(const methodHandle& method) {
2641 // Use customized signature handler. Need to lock around updates to
2642 // the AdapterHandlerTable (it is not safe for concurrent readers
2643 // and a single writer: this could be fixed if it becomes a
2644 // problem).
2645
2646 ResourceMark rm;
2647
2648 NOT_PRODUCT(int insts_size);
2649 AdapterBlob* new_adapter = NULL;
2650 AdapterHandlerEntry* entry = NULL;
2651 AdapterFingerPrint* fingerprint = NULL;
2652 {
2653 MutexLocker mu(AdapterHandlerLibrary_lock);
2654 // make sure data structure is initialized
2655 initialize();
2656
2657 if (method->is_abstract()) {
2658 return _abstract_method_handler;
2659 }
2660
2661 // Fill in the signature array, for the calling-convention call.
2662 int total_args_passed = method->size_of_parameters(); // All args on stack
2663
2664 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2665 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2666 int i = 0;
2667 if (!method->is_static()) // Pass in receiver first
2668 sig_bt[i++] = T_OBJECT;
2669 for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) {
2670 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2671 if (ss.type() == T_LONG || ss.type() == T_DOUBLE)
2672 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2673 }
2674 assert(i == total_args_passed, "");
2675
2676 // Lookup method signature's fingerprint
2677 entry = _adapters->lookup(total_args_passed, sig_bt);
2678
2679 #ifdef ASSERT
2680 AdapterHandlerEntry* shared_entry = NULL;
2681 // Start adapter sharing verification only after the VM is booted.
2682 if (VerifyAdapterSharing && (entry != NULL)) {
2683 shared_entry = entry;
2684 entry = NULL;
2685 }
2686 #endif
2687
2688 if (entry != NULL) {
2689 return entry;
2690 }
2691
2692 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
2693 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false);
2694
2695 // Make a C heap allocated version of the fingerprint to store in the adapter
2696 fingerprint = new AdapterFingerPrint(total_args_passed, sig_bt);
2697
2698 // StubRoutines::code2() is initialized after this function can be called. As a result,
2699 // VerifyAdapterCalls and VerifyAdapterSharing can fail if we re-use code that generated
2700 // prior to StubRoutines::code2() being set. Checks refer to checks generated in an I2C
2701 // stub that ensure that an I2C stub is called from an interpreter frame.
2702 bool contains_all_checks = StubRoutines::code2() != NULL;
2703
2704 // Create I2C & C2I handlers
2705 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2706 if (buf != NULL) {
2707 CodeBuffer buffer(buf);
2708 short buffer_locs[20];
2709 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
2710 sizeof(buffer_locs)/sizeof(relocInfo));
2711
2712 MacroAssembler _masm(&buffer);
2713 entry = SharedRuntime::generate_i2c2i_adapters(&_masm,
2714 total_args_passed,
2715 comp_args_on_stack,
2716 sig_bt,
2717 regs,
2718 fingerprint);
2719 #ifdef ASSERT
2720 if (VerifyAdapterSharing) {
2721 if (shared_entry != NULL) {
2722 assert(shared_entry->compare_code(buf->code_begin(), buffer.insts_size()), "code must match");
2723 // Release the one just created and return the original
2724 _adapters->free_entry(entry);
2725 return shared_entry;
2726 } else {
2727 entry->save_code(buf->code_begin(), buffer.insts_size());
2728 }
2729 }
2730 #endif
2731
2732 new_adapter = AdapterBlob::create(&buffer);
2733 NOT_PRODUCT(insts_size = buffer.insts_size());
2734 }
2735 if (new_adapter == NULL) {
2736 // CodeCache is full, disable compilation
2737 // Ought to log this but compile log is only per compile thread
2738 // and we're some non descript Java thread.
2739 return NULL; // Out of CodeCache space
2740 }
2741 entry->relocate(new_adapter->content_begin());
2742 #ifndef PRODUCT
2743 // debugging suppport
2744 if (PrintAdapterHandlers || PrintStubCode) {
2745 ttyLocker ttyl;
2746 entry->print_adapter_on(tty);
2747 tty->print_cr("i2c argument handler #%d for: %s %s %s (%d bytes generated)",
2748 _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"),
2749 method->signature()->as_C_string(), fingerprint->as_string(), insts_size);
2750 tty->print_cr("c2i argument handler starts at %p", entry->get_c2i_entry());
2751 if (Verbose || PrintStubCode) {
2752 address first_pc = entry->base_address();
2753 if (first_pc != NULL) {
2754 Disassembler::decode(first_pc, first_pc + insts_size);
2755 tty->cr();
2756 }
2757 }
2758 }
2759 #endif
2760 // Add the entry only if the entry contains all required checks (see sharedRuntime_xxx.cpp)
2761 // The checks are inserted only if -XX:+VerifyAdapterCalls is specified.
2762 if (contains_all_checks || !VerifyAdapterCalls) {
2763 _adapters->add(entry);
2764 }
2765 }
2766 // Outside of the lock
2767 if (new_adapter != NULL) {
2768 char blob_id[256];
2769 jio_snprintf(blob_id,
2770 sizeof(blob_id),
2771 "%s(%s)@" PTR_FORMAT,
2772 new_adapter->name(),
2773 fingerprint->as_string(),
2774 new_adapter->content_begin());
2775 Forte::register_stub(blob_id, new_adapter->content_begin(), new_adapter->content_end());
2776
2777 if (JvmtiExport::should_post_dynamic_code_generated()) {
2778 JvmtiExport::post_dynamic_code_generated(blob_id, new_adapter->content_begin(), new_adapter->content_end());
2779 }
2780 }
2781 return entry;
2782 }
2783
2784 address AdapterHandlerEntry::base_address() {
2785 address base = _i2c_entry;
2786 if (base == NULL) base = _c2i_entry;
2787 assert(base <= _c2i_entry || _c2i_entry == NULL, "");
2788 assert(base <= _c2i_unverified_entry || _c2i_unverified_entry == NULL, "");
2789 assert(base <= _c2i_no_clinit_check_entry || _c2i_no_clinit_check_entry == NULL, "");
2790 return base;
2791 }
2792
2793 void AdapterHandlerEntry::relocate(address new_base) {
2794 address old_base = base_address();
2795 assert(old_base != NULL, "");
2796 ptrdiff_t delta = new_base - old_base;
2797 if (_i2c_entry != NULL)
2798 _i2c_entry += delta;
2799 if (_c2i_entry != NULL)
2800 _c2i_entry += delta;
2801 if (_c2i_unverified_entry != NULL)
2802 _c2i_unverified_entry += delta;
2803 if (_c2i_no_clinit_check_entry != NULL)
2804 _c2i_no_clinit_check_entry += delta;
2805 assert(base_address() == new_base, "");
2806 }
2807
2808
2809 void AdapterHandlerEntry::deallocate() {
2810 delete _fingerprint;
2811 #ifdef ASSERT
2812 FREE_C_HEAP_ARRAY(unsigned char, _saved_code);
2813 #endif
2814 }
2815
2816
2817 #ifdef ASSERT
2818 // Capture the code before relocation so that it can be compared
2819 // against other versions. If the code is captured after relocation
2820 // then relative instructions won't be equivalent.
2821 void AdapterHandlerEntry::save_code(unsigned char* buffer, int length) {
2822 _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode);
2823 _saved_code_length = length;
2824 memcpy(_saved_code, buffer, length);
2825 }
2826
2827
2828 bool AdapterHandlerEntry::compare_code(unsigned char* buffer, int length) {
2829 if (length != _saved_code_length) {
2830 return false;
2831 }
2832
2833 return (memcmp(buffer, _saved_code, length) == 0) ? true : false;
2834 }
2835 #endif
2836
2837
2838 /**
2839 * Create a native wrapper for this native method. The wrapper converts the
2840 * Java-compiled calling convention to the native convention, handles
2841 * arguments, and transitions to native. On return from the native we transition
2842 * back to java blocking if a safepoint is in progress.
2843 */
2844 void AdapterHandlerLibrary::create_native_wrapper(const methodHandle& method) {
2845 ResourceMark rm;
2846 nmethod* nm = NULL;
2847 address critical_entry = NULL;
2848
2849 assert(method->is_native(), "must be native");
2850 assert(method->is_method_handle_intrinsic() ||
2851 method->has_native_function(), "must have something valid to call!");
2852
2853 if (CriticalJNINatives && !method->is_method_handle_intrinsic()) {
2854 // We perform the I/O with transition to native before acquiring AdapterHandlerLibrary_lock.
2855 critical_entry = NativeLookup::lookup_critical_entry(method);
2856 }
2857
2858 {
2859 // Perform the work while holding the lock, but perform any printing outside the lock
2860 MutexLocker mu(AdapterHandlerLibrary_lock);
2861 // See if somebody beat us to it
2862 if (method->code() != NULL) {
2863 return;
2864 }
2865
2866 const int compile_id = CompileBroker::assign_compile_id(method, CompileBroker::standard_entry_bci);
2867 assert(compile_id > 0, "Must generate native wrapper");
2868
2869
2870 ResourceMark rm;
2871 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2872 if (buf != NULL) {
2873 CodeBuffer buffer(buf);
2874 double locs_buf[20];
2875 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2876 MacroAssembler _masm(&buffer);
2877
2878 // Fill in the signature array, for the calling-convention call.
2879 const int total_args_passed = method->size_of_parameters();
2880
2881 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2882 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2883 int i=0;
2884 if (!method->is_static()) // Pass in receiver first
2885 sig_bt[i++] = T_OBJECT;
2886 SignatureStream ss(method->signature());
2887 for (; !ss.at_return_type(); ss.next()) {
2888 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
2889 if (ss.type() == T_LONG || ss.type() == T_DOUBLE)
2890 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
2891 }
2892 assert(i == total_args_passed, "");
2893 BasicType ret_type = ss.type();
2894
2895 // Now get the compiled-Java layout as input (or output) arguments.
2896 // NOTE: Stubs for compiled entry points of method handle intrinsics
2897 // are just trampolines so the argument registers must be outgoing ones.
2898 const bool is_outgoing = method->is_method_handle_intrinsic();
2899 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, is_outgoing);
2900
2901 // Generate the compiled-to-native wrapper code
2902 nm = SharedRuntime::generate_native_wrapper(&_masm, method, compile_id, sig_bt, regs, ret_type, critical_entry);
2903
2904 if (nm != NULL) {
2905 {
2906 MutexLocker pl(CompiledMethod_lock, Mutex::_no_safepoint_check_flag);
2907 if (nm->make_in_use()) {
2908 method->set_code(method, nm);
2909 }
2910 }
2911
2912 DirectiveSet* directive = DirectivesStack::getDefaultDirective(CompileBroker::compiler(CompLevel_simple));
2913 if (directive->PrintAssemblyOption) {
2914 nm->print_code();
2915 }
2916 DirectivesStack::release(directive);
2917 }
2918 }
2919 } // Unlock AdapterHandlerLibrary_lock
2920
2921
2922 // Install the generated code.
2923 if (nm != NULL) {
2924 const char *msg = method->is_static() ? "(static)" : "";
2925 CompileTask::print_ul(nm, msg);
2926 if (PrintCompilation) {
2927 ttyLocker ttyl;
2928 CompileTask::print(tty, nm, msg);
2929 }
2930 nm->post_compiled_method_load_event();
2931 }
2932 }
2933
2934 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::block_for_jni_critical(JavaThread* thread))
2935 assert(thread == JavaThread::current(), "must be");
2936 // The code is about to enter a JNI lazy critical native method and
2937 // _needs_gc is true, so if this thread is already in a critical
2938 // section then just return, otherwise this thread should block
2939 // until needs_gc has been cleared.
2940 if (thread->in_critical()) {
2941 return;
2942 }
2943 // Lock and unlock a critical section to give the system a chance to block
2944 GCLocker::lock_critical(thread);
2945 GCLocker::unlock_critical(thread);
2946 JRT_END
2947
2948 JRT_LEAF(oopDesc*, SharedRuntime::pin_object(JavaThread* thread, oopDesc* obj))
2949 assert(Universe::heap()->supports_object_pinning(), "Why we are here?");
2950 assert(obj != NULL, "Should not be null");
2951 oop o(obj);
2952 o = Universe::heap()->pin_object(thread, o);
2953 assert(o != NULL, "Should not be null");
2954 return o;
2955 JRT_END
2956
2957 JRT_LEAF(void, SharedRuntime::unpin_object(JavaThread* thread, oopDesc* obj))
2958 assert(Universe::heap()->supports_object_pinning(), "Why we are here?");
2959 assert(obj != NULL, "Should not be null");
2960 oop o(obj);
2961 Universe::heap()->unpin_object(thread, o);
2962 JRT_END
2963
2964 // -------------------------------------------------------------------------
2965 // Java-Java calling convention
2966 // (what you use when Java calls Java)
2967
2968 //------------------------------name_for_receiver----------------------------------
2969 // For a given signature, return the VMReg for parameter 0.
2970 VMReg SharedRuntime::name_for_receiver() {
2971 VMRegPair regs;
2972 BasicType sig_bt = T_OBJECT;
2973 (void) java_calling_convention(&sig_bt, ®s, 1, true);
2974 // Return argument 0 register. In the LP64 build pointers
2975 // take 2 registers, but the VM wants only the 'main' name.
2976 return regs.first();
2977 }
2978
2979 VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) {
2980 // This method is returning a data structure allocating as a
2981 // ResourceObject, so do not put any ResourceMarks in here.
2982 char *s = sig->as_C_string();
2983 int len = (int)strlen(s);
2984 s++; len--; // Skip opening paren
2985
2986 BasicType *sig_bt = NEW_RESOURCE_ARRAY(BasicType, 256);
2987 VMRegPair *regs = NEW_RESOURCE_ARRAY(VMRegPair, 256);
2988 int cnt = 0;
2989 if (has_receiver) {
2990 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
2991 }
2992
2993 while (*s != JVM_SIGNATURE_ENDFUNC) { // Find closing right paren
2994 switch (*s++) { // Switch on signature character
2995 case JVM_SIGNATURE_BYTE: sig_bt[cnt++] = T_BYTE; break;
2996 case JVM_SIGNATURE_CHAR: sig_bt[cnt++] = T_CHAR; break;
2997 case JVM_SIGNATURE_DOUBLE: sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break;
2998 case JVM_SIGNATURE_FLOAT: sig_bt[cnt++] = T_FLOAT; break;
2999 case JVM_SIGNATURE_INT: sig_bt[cnt++] = T_INT; break;
3000 case JVM_SIGNATURE_LONG: sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break;
3001 case JVM_SIGNATURE_SHORT: sig_bt[cnt++] = T_SHORT; break;
3002 case JVM_SIGNATURE_BOOLEAN: sig_bt[cnt++] = T_BOOLEAN; break;
3003 case JVM_SIGNATURE_VOID: sig_bt[cnt++] = T_VOID; break;
3004 case JVM_SIGNATURE_CLASS: // Oop
3005 while (*s++ != JVM_SIGNATURE_ENDCLASS); // Skip signature
3006 sig_bt[cnt++] = T_OBJECT;
3007 break;
3008 case JVM_SIGNATURE_ARRAY: { // Array
3009 do { // Skip optional size
3010 while (*s >= '0' && *s <= '9') s++;
3011 } while (*s++ == JVM_SIGNATURE_ARRAY); // Nested arrays?
3012 // Skip element type
3013 if (s[-1] == JVM_SIGNATURE_CLASS)
3014 while (*s++ != JVM_SIGNATURE_ENDCLASS); // Skip signature
3015 sig_bt[cnt++] = T_ARRAY;
3016 break;
3017 }
3018 default : ShouldNotReachHere();
3019 }
3020 }
3021
3022 if (has_appendix) {
3023 sig_bt[cnt++] = T_OBJECT;
3024 }
3025
3026 assert(cnt < 256, "grow table size");
3027
3028 int comp_args_on_stack;
3029 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true);
3030
3031 // the calling convention doesn't count out_preserve_stack_slots so
3032 // we must add that in to get "true" stack offsets.
3033
3034 if (comp_args_on_stack) {
3035 for (int i = 0; i < cnt; i++) {
3036 VMReg reg1 = regs[i].first();
3037 if (reg1->is_stack()) {
3038 // Yuck
3039 reg1 = reg1->bias(out_preserve_stack_slots());
3040 }
3041 VMReg reg2 = regs[i].second();
3042 if (reg2->is_stack()) {
3043 // Yuck
3044 reg2 = reg2->bias(out_preserve_stack_slots());
3045 }
3046 regs[i].set_pair(reg2, reg1);
3047 }
3048 }
3049
3050 // results
3051 *arg_size = cnt;
3052 return regs;
3053 }
3054
3055 // OSR Migration Code
3056 //
3057 // This code is used convert interpreter frames into compiled frames. It is
3058 // called from very start of a compiled OSR nmethod. A temp array is
3059 // allocated to hold the interesting bits of the interpreter frame. All
3060 // active locks are inflated to allow them to move. The displaced headers and
3061 // active interpreter locals are copied into the temp buffer. Then we return
3062 // back to the compiled code. The compiled code then pops the current
3063 // interpreter frame off the stack and pushes a new compiled frame. Then it
3064 // copies the interpreter locals and displaced headers where it wants.
3065 // Finally it calls back to free the temp buffer.
3066 //
3067 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
3068
3069 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) )
3070
3071 //
3072 // This code is dependent on the memory layout of the interpreter local
3073 // array and the monitors. On all of our platforms the layout is identical
3074 // so this code is shared. If some platform lays the their arrays out
3075 // differently then this code could move to platform specific code or
3076 // the code here could be modified to copy items one at a time using
3077 // frame accessor methods and be platform independent.
3078
3079 frame fr = thread->last_frame();
3080 assert(fr.is_interpreted_frame(), "");
3081 assert(fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks");
3082
3083 // Figure out how many monitors are active.
3084 int active_monitor_count = 0;
3085 for (BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
3086 kptr < fr.interpreter_frame_monitor_begin();
3087 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
3088 if (kptr->obj() != NULL) active_monitor_count++;
3089 }
3090
3091 // QQQ we could place number of active monitors in the array so that compiled code
3092 // could double check it.
3093
3094 Method* moop = fr.interpreter_frame_method();
3095 int max_locals = moop->max_locals();
3096 // Allocate temp buffer, 1 word per local & 2 per active monitor
3097 int buf_size_words = max_locals + active_monitor_count * BasicObjectLock::size();
3098 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode);
3099
3100 // Copy the locals. Order is preserved so that loading of longs works.
3101 // Since there's no GC I can copy the oops blindly.
3102 assert(sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
3103 Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
3104 (HeapWord*)&buf[0],
3105 max_locals);
3106
3107 // Inflate locks. Copy the displaced headers. Be careful, there can be holes.
3108 int i = max_locals;
3109 for (BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
3110 kptr2 < fr.interpreter_frame_monitor_begin();
3111 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
3112 if (kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array
3113 BasicLock *lock = kptr2->lock();
3114 // Inflate so the displaced header becomes position-independent
3115 if (lock->displaced_header().is_unlocked())
3116 ObjectSynchronizer::inflate_helper(kptr2->obj());
3117 // Now the displaced header is free to move
3118 buf[i++] = (intptr_t)lock->displaced_header().value();
3119 buf[i++] = cast_from_oop<intptr_t>(kptr2->obj());
3120 }
3121 }
3122 assert(i - max_locals == active_monitor_count*2, "found the expected number of monitors");
3123
3124 return buf;
3125 JRT_END
3126
3127 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
3128 FREE_C_HEAP_ARRAY(intptr_t, buf);
3129 JRT_END
3130
3131 bool AdapterHandlerLibrary::contains(const CodeBlob* b) {
3132 AdapterHandlerTableIterator iter(_adapters);
3133 while (iter.has_next()) {
3134 AdapterHandlerEntry* a = iter.next();
3135 if (b == CodeCache::find_blob(a->get_i2c_entry())) return true;
3136 }
3137 return false;
3138 }
3139
3140 void AdapterHandlerLibrary::print_handler_on(outputStream* st, const CodeBlob* b) {
3141 AdapterHandlerTableIterator iter(_adapters);
3142 while (iter.has_next()) {
3143 AdapterHandlerEntry* a = iter.next();
3144 if (b == CodeCache::find_blob(a->get_i2c_entry())) {
3145 st->print("Adapter for signature: ");
3146 a->print_adapter_on(tty);
3147 return;
3148 }
3149 }
3150 assert(false, "Should have found handler");
3151 }
3152
3153 void AdapterHandlerEntry::print_adapter_on(outputStream* st) const {
3154 st->print("AHE@" INTPTR_FORMAT ": %s", p2i(this), fingerprint()->as_string());
3155 if (get_i2c_entry() != NULL) {
3156 st->print(" i2c: " INTPTR_FORMAT, p2i(get_i2c_entry()));
3157 }
3158 if (get_c2i_entry() != NULL) {
3159 st->print(" c2i: " INTPTR_FORMAT, p2i(get_c2i_entry()));
3160 }
3161 if (get_c2i_unverified_entry() != NULL) {
3162 st->print(" c2iUV: " INTPTR_FORMAT, p2i(get_c2i_unverified_entry()));
3163 }
3164 if (get_c2i_no_clinit_check_entry() != NULL) {
3165 st->print(" c2iNCI: " INTPTR_FORMAT, p2i(get_c2i_no_clinit_check_entry()));
3166 }
3167 st->cr();
3168 }
3169
3170 #if INCLUDE_CDS
3171
3172 void CDSAdapterHandlerEntry::init() {
3173 assert(DumpSharedSpaces, "used during dump time only");
3174 _c2i_entry_trampoline = (address)MetaspaceShared::misc_code_space_alloc(SharedRuntime::trampoline_size());
3175 _adapter_trampoline = (AdapterHandlerEntry**)MetaspaceShared::misc_code_space_alloc(sizeof(AdapterHandlerEntry*));
3176 };
3177
3178 #endif // INCLUDE_CDS
3179
3180
3181 #ifndef PRODUCT
3182
3183 void AdapterHandlerLibrary::print_statistics() {
3184 _adapters->print_statistics();
3185 }
3186
3187 #endif /* PRODUCT */
3188
3189 JRT_LEAF(void, SharedRuntime::enable_stack_reserved_zone(JavaThread* thread))
3190 assert(thread->is_Java_thread(), "Only Java threads have a stack reserved zone");
3191 if (thread->stack_reserved_zone_disabled()) {
3192 thread->enable_stack_reserved_zone();
3193 }
3194 thread->set_reserved_stack_activation(thread->stack_base());
3195 JRT_END
3196
3197 frame SharedRuntime::look_for_reserved_stack_annotated_method(JavaThread* thread, frame fr) {
3198 ResourceMark rm(thread);
3199 frame activation;
3200 CompiledMethod* nm = NULL;
3201 int count = 1;
3202
3203 assert(fr.is_java_frame(), "Must start on Java frame");
3204
3205 while (true) {
3206 Method* method = NULL;
3207 bool found = false;
3208 if (fr.is_interpreted_frame()) {
3209 method = fr.interpreter_frame_method();
3210 if (method != NULL && method->has_reserved_stack_access()) {
3211 found = true;
3212 }
3213 } else {
3214 CodeBlob* cb = fr.cb();
3215 if (cb != NULL && cb->is_compiled()) {
3216 nm = cb->as_compiled_method();
3217 method = nm->method();
3218 // scope_desc_near() must be used, instead of scope_desc_at() because on
3219 // SPARC, the pcDesc can be on the delay slot after the call instruction.
3220 for (ScopeDesc *sd = nm->scope_desc_near(fr.pc()); sd != NULL; sd = sd->sender()) {
3221 method = sd->method();
3222 if (method != NULL && method->has_reserved_stack_access()) {
3223 found = true;
3224 }
3225 }
3226 }
3227 }
3228 if (found) {
3229 activation = fr;
3230 warning("Potentially dangerous stack overflow in "
3231 "ReservedStackAccess annotated method %s [%d]",
3232 method->name_and_sig_as_C_string(), count++);
3233 EventReservedStackActivation event;
3234 if (event.should_commit()) {
3235 event.set_method(method);
3236 event.commit();
3237 }
3238 }
3239 if (fr.is_first_java_frame()) {
3240 break;
3241 } else {
3242 fr = fr.java_sender();
3243 }
3244 }
3245 return activation;
3246 }
3247
3248 void SharedRuntime::on_slowpath_allocation_exit(JavaThread* thread) {
3249 // After any safepoint, just before going back to compiled code,
3250 // we inform the GC that we will be doing initializing writes to
3251 // this object in the future without emitting card-marks, so
3252 // GC may take any compensating steps.
3253
3254 oop new_obj = thread->vm_result();
3255 if (new_obj == NULL) return;
3256
3257 BarrierSet *bs = BarrierSet::barrier_set();
3258 bs->on_slowpath_allocation_exit(thread, new_obj);
3259 }