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