1 /*
2 * Copyright (c) 1997, 2026, 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 "cds/aotCompressedPointers.hpp"
26 #include "cds/archiveBuilder.hpp"
27 #include "cds/archiveUtils.inline.hpp"
28 #include "classfile/classLoader.hpp"
29 #include "classfile/compactHashtable.hpp"
30 #include "classfile/javaClasses.inline.hpp"
31 #include "classfile/stringTable.hpp"
32 #include "classfile/vmClasses.hpp"
33 #include "classfile/vmSymbols.hpp"
34 #include "code/aotCodeCache.hpp"
35 #include "code/codeCache.hpp"
36 #include "code/compiledIC.hpp"
37 #include "code/nmethod.inline.hpp"
38 #include "code/scopeDesc.hpp"
39 #include "code/vtableStubs.hpp"
40 #include "compiler/abstractCompiler.hpp"
41 #include "compiler/compileBroker.hpp"
42 #include "compiler/disassembler.hpp"
43 #include "gc/shared/barrierSet.hpp"
44 #include "gc/shared/collectedHeap.hpp"
45 #include "interpreter/interpreter.hpp"
46 #include "interpreter/interpreterRuntime.hpp"
47 #include "jfr/jfrEvents.hpp"
48 #include "jvm.h"
49 #include "logging/log.hpp"
50 #include "memory/oopFactory.hpp"
51 #include "memory/resourceArea.hpp"
52 #include "memory/universe.hpp"
53 #include "metaprogramming/primitiveConversions.hpp"
54 #include "oops/access.hpp"
55 #include "oops/fieldStreams.inline.hpp"
56 #include "oops/inlineKlass.inline.hpp"
57 #include "oops/klass.hpp"
58 #include "oops/method.inline.hpp"
59 #include "oops/objArrayKlass.hpp"
60 #include "oops/objArrayOop.inline.hpp"
61 #include "oops/oop.inline.hpp"
62 #include "prims/forte.hpp"
63 #include "prims/jvmtiExport.hpp"
64 #include "prims/jvmtiThreadState.hpp"
65 #include "prims/methodHandles.hpp"
66 #include "prims/nativeLookup.hpp"
67 #include "runtime/arguments.hpp"
68 #include "runtime/atomicAccess.hpp"
69 #include "runtime/basicLock.inline.hpp"
70 #include "runtime/frame.inline.hpp"
71 #include "runtime/handles.inline.hpp"
72 #include "runtime/init.hpp"
73 #include "runtime/interfaceSupport.inline.hpp"
74 #include "runtime/java.hpp"
75 #include "runtime/javaCalls.hpp"
76 #include "runtime/jniHandles.inline.hpp"
77 #include "runtime/osThread.hpp"
78 #include "runtime/perfData.hpp"
79 #include "runtime/sharedRuntime.hpp"
80 #include "runtime/signature.hpp"
81 #include "runtime/stackWatermarkSet.hpp"
82 #include "runtime/stubRoutines.hpp"
83 #include "runtime/synchronizer.hpp"
84 #include "runtime/timerTrace.hpp"
85 #include "runtime/vframe.inline.hpp"
86 #include "runtime/vframeArray.hpp"
87 #include "runtime/vm_version.hpp"
88 #include "utilities/copy.hpp"
89 #include "utilities/dtrace.hpp"
90 #include "utilities/events.hpp"
91 #include "utilities/exceptions.hpp"
92 #include "utilities/globalDefinitions.hpp"
93 #include "utilities/hashTable.hpp"
94 #include "utilities/macros.hpp"
95 #include "utilities/xmlstream.hpp"
96 #ifdef COMPILER1
97 #include "c1/c1_Runtime1.hpp"
98 #endif
99 #ifdef COMPILER2
100 #include "opto/runtime.hpp"
101 #endif
102 #if INCLUDE_JFR
103 #include "jfr/jfr.inline.hpp"
104 #endif
105
106 // Shared runtime stub routines reside in their own unique blob with a
107 // single entry point
108
109
110 #define SHARED_STUB_FIELD_DEFINE(name, type) \
111 type* SharedRuntime::BLOB_FIELD_NAME(name);
112 SHARED_STUBS_DO(SHARED_STUB_FIELD_DEFINE)
113 #undef SHARED_STUB_FIELD_DEFINE
114
115 nmethod* SharedRuntime::_cont_doYield_stub;
116
117 #if 0
118 // TODO tweak global stub name generation to match this
119 #define SHARED_STUB_NAME_DECLARE(name, type) "Shared Runtime " # name "_blob",
120 const char *SharedRuntime::_stub_names[] = {
121 SHARED_STUBS_DO(SHARED_STUB_NAME_DECLARE)
122 };
123 #endif
124
125 //----------------------------generate_stubs-----------------------------------
126 void SharedRuntime::generate_initial_stubs() {
127 // Build this early so it's available for the interpreter.
128 _throw_StackOverflowError_blob =
129 generate_throw_exception(StubId::shared_throw_StackOverflowError_id,
130 CAST_FROM_FN_PTR(address, SharedRuntime::throw_StackOverflowError));
131 }
132
133 void SharedRuntime::generate_stubs() {
134 _wrong_method_blob =
135 generate_resolve_blob(StubId::shared_wrong_method_id,
136 CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method));
137 _wrong_method_abstract_blob =
138 generate_resolve_blob(StubId::shared_wrong_method_abstract_id,
139 CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_abstract));
140 _ic_miss_blob =
141 generate_resolve_blob(StubId::shared_ic_miss_id,
142 CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_ic_miss));
143 _resolve_opt_virtual_call_blob =
144 generate_resolve_blob(StubId::shared_resolve_opt_virtual_call_id,
145 CAST_FROM_FN_PTR(address, SharedRuntime::resolve_opt_virtual_call_C));
146 _resolve_virtual_call_blob =
147 generate_resolve_blob(StubId::shared_resolve_virtual_call_id,
148 CAST_FROM_FN_PTR(address, SharedRuntime::resolve_virtual_call_C));
149 _resolve_static_call_blob =
150 generate_resolve_blob(StubId::shared_resolve_static_call_id,
151 CAST_FROM_FN_PTR(address, SharedRuntime::resolve_static_call_C));
152
153 _throw_delayed_StackOverflowError_blob =
154 generate_throw_exception(StubId::shared_throw_delayed_StackOverflowError_id,
155 CAST_FROM_FN_PTR(address, SharedRuntime::throw_delayed_StackOverflowError));
156
157 _throw_AbstractMethodError_blob =
158 generate_throw_exception(StubId::shared_throw_AbstractMethodError_id,
159 CAST_FROM_FN_PTR(address, SharedRuntime::throw_AbstractMethodError));
160
161 _throw_IncompatibleClassChangeError_blob =
162 generate_throw_exception(StubId::shared_throw_IncompatibleClassChangeError_id,
163 CAST_FROM_FN_PTR(address, SharedRuntime::throw_IncompatibleClassChangeError));
164
165 _throw_NullPointerException_at_call_blob =
166 generate_throw_exception(StubId::shared_throw_NullPointerException_at_call_id,
167 CAST_FROM_FN_PTR(address, SharedRuntime::throw_NullPointerException_at_call));
168
169 #ifdef COMPILER2
170 // Vectors are generated only by C2.
171 bool support_wide = is_wide_vector(MaxVectorSize);
172 if (support_wide) {
173 _polling_page_vectors_safepoint_handler_blob =
174 generate_handler_blob(StubId::shared_polling_page_vectors_safepoint_handler_id,
175 CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception));
176 }
177 #endif // COMPILER2
178 _polling_page_safepoint_handler_blob =
179 generate_handler_blob(StubId::shared_polling_page_safepoint_handler_id,
180 CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception));
181 _polling_page_return_handler_blob =
182 generate_handler_blob(StubId::shared_polling_page_return_handler_id,
183 CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception));
184
185 generate_deopt_blob();
186
187 #if INCLUDE_CDS
188 // disallow any further generation of runtime stubs
189 AOTCodeCache::set_shared_stubs_complete();
190 #endif // INCLUDE_CDS
191 }
192
193 void SharedRuntime::init_adapter_library() {
194 AdapterHandlerLibrary::initialize();
195 }
196
197 #if INCLUDE_JFR
198 //------------------------------generate jfr runtime stubs ------
199 void SharedRuntime::generate_jfr_stubs() {
200 ResourceMark rm;
201 const char* timer_msg = "SharedRuntime generate_jfr_stubs";
202 TraceTime timer(timer_msg, TRACETIME_LOG(Info, startuptime));
203
204 _jfr_write_checkpoint_blob = generate_jfr_write_checkpoint();
205 _jfr_return_lease_blob = generate_jfr_return_lease();
206 }
207
208 #endif // INCLUDE_JFR
209
210 #include <math.h>
211
212 // Implementation of SharedRuntime
213
214 #ifndef PRODUCT
215 // For statistics
216 uint SharedRuntime::_ic_miss_ctr = 0;
217 uint SharedRuntime::_wrong_method_ctr = 0;
218 uint SharedRuntime::_resolve_static_ctr = 0;
219 uint SharedRuntime::_resolve_virtual_ctr = 0;
220 uint SharedRuntime::_resolve_opt_virtual_ctr = 0;
221 uint SharedRuntime::_implicit_null_throws = 0;
222 uint SharedRuntime::_implicit_div0_throws = 0;
223
224 int64_t SharedRuntime::_nof_normal_calls = 0;
225 int64_t SharedRuntime::_nof_inlined_calls = 0;
226 int64_t SharedRuntime::_nof_megamorphic_calls = 0;
227 int64_t SharedRuntime::_nof_static_calls = 0;
228 int64_t SharedRuntime::_nof_inlined_static_calls = 0;
229 int64_t SharedRuntime::_nof_interface_calls = 0;
230 int64_t SharedRuntime::_nof_inlined_interface_calls = 0;
231
232 uint SharedRuntime::_new_instance_ctr=0;
233 uint SharedRuntime::_new_array_ctr=0;
234 uint SharedRuntime::_multi2_ctr=0;
235 uint SharedRuntime::_multi3_ctr=0;
236 uint SharedRuntime::_multi4_ctr=0;
237 uint SharedRuntime::_multi5_ctr=0;
238 uint SharedRuntime::_mon_enter_stub_ctr=0;
239 uint SharedRuntime::_mon_exit_stub_ctr=0;
240 uint SharedRuntime::_mon_enter_ctr=0;
241 uint SharedRuntime::_mon_exit_ctr=0;
242 uint SharedRuntime::_partial_subtype_ctr=0;
243 uint SharedRuntime::_jbyte_array_copy_ctr=0;
244 uint SharedRuntime::_jshort_array_copy_ctr=0;
245 uint SharedRuntime::_jint_array_copy_ctr=0;
246 uint SharedRuntime::_jlong_array_copy_ctr=0;
247 uint SharedRuntime::_oop_array_copy_ctr=0;
248 uint SharedRuntime::_checkcast_array_copy_ctr=0;
249 uint SharedRuntime::_unsafe_array_copy_ctr=0;
250 uint SharedRuntime::_generic_array_copy_ctr=0;
251 uint SharedRuntime::_slow_array_copy_ctr=0;
252 uint SharedRuntime::_find_handler_ctr=0;
253 uint SharedRuntime::_rethrow_ctr=0;
254 uint SharedRuntime::_unsafe_set_memory_ctr=0;
255
256 int SharedRuntime::_ICmiss_index = 0;
257 int SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count];
258 address SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count];
259
260
261 void SharedRuntime::trace_ic_miss(address at) {
262 for (int i = 0; i < _ICmiss_index; i++) {
263 if (_ICmiss_at[i] == at) {
264 _ICmiss_count[i]++;
265 return;
266 }
267 }
268 int index = _ICmiss_index++;
269 if (_ICmiss_index >= maxICmiss_count) _ICmiss_index = maxICmiss_count - 1;
270 _ICmiss_at[index] = at;
271 _ICmiss_count[index] = 1;
272 }
273
274 void SharedRuntime::print_ic_miss_histogram() {
275 if (ICMissHistogram) {
276 tty->print_cr("IC Miss Histogram:");
277 int tot_misses = 0;
278 for (int i = 0; i < _ICmiss_index; i++) {
279 tty->print_cr(" at: " INTPTR_FORMAT " nof: %d", p2i(_ICmiss_at[i]), _ICmiss_count[i]);
280 tot_misses += _ICmiss_count[i];
281 }
282 tty->print_cr("Total IC misses: %7d", tot_misses);
283 }
284 }
285
286 #ifdef COMPILER2
287 // Runtime methods for printf-style debug nodes (same printing format as fieldDescriptor::print_on_for)
288 void SharedRuntime::debug_print_value(jboolean x) {
289 tty->print_cr("boolean %d", x);
290 }
291
292 void SharedRuntime::debug_print_value(jbyte x) {
293 tty->print_cr("byte %d", x);
294 }
295
296 void SharedRuntime::debug_print_value(jshort x) {
297 tty->print_cr("short %d", x);
298 }
299
300 void SharedRuntime::debug_print_value(jchar x) {
301 tty->print_cr("char %c %d", isprint(x) ? x : ' ', x);
302 }
303
304 void SharedRuntime::debug_print_value(jint x) {
305 tty->print_cr("int %d", x);
306 }
307
308 void SharedRuntime::debug_print_value(jlong x) {
309 tty->print_cr("long " JLONG_FORMAT, x);
310 }
311
312 void SharedRuntime::debug_print_value(jfloat x) {
313 tty->print_cr("float %f", x);
314 }
315
316 void SharedRuntime::debug_print_value(jdouble x) {
317 tty->print_cr("double %lf", x);
318 }
319
320 void SharedRuntime::debug_print_value(oopDesc* x) {
321 x->print();
322 }
323 #endif // COMPILER2
324
325 #endif // PRODUCT
326
327
328 JRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x))
329 return x * y;
330 JRT_END
331
332
333 JRT_LEAF(jlong, SharedRuntime::ldiv(jlong y, jlong x))
334 if (x == min_jlong && y == CONST64(-1)) {
335 return x;
336 } else {
337 return x / y;
338 }
339 JRT_END
340
341
342 JRT_LEAF(jlong, SharedRuntime::lrem(jlong y, jlong x))
343 if (x == min_jlong && y == CONST64(-1)) {
344 return 0;
345 } else {
346 return x % y;
347 }
348 JRT_END
349
350
351 #ifdef _WIN64
352 const juint float_sign_mask = 0x7FFFFFFF;
353 const juint float_infinity = 0x7F800000;
354 const julong double_sign_mask = CONST64(0x7FFFFFFFFFFFFFFF);
355 const julong double_infinity = CONST64(0x7FF0000000000000);
356 #endif
357
358 #if !defined(X86)
359 JRT_LEAF(jfloat, SharedRuntime::frem(jfloat x, jfloat y))
360 #ifdef _WIN64
361 // 64-bit Windows on amd64 returns the wrong values for
362 // infinity operands.
363 juint xbits = PrimitiveConversions::cast<juint>(x);
364 juint ybits = PrimitiveConversions::cast<juint>(y);
365 // x Mod Infinity == x unless x is infinity
366 if (((xbits & float_sign_mask) != float_infinity) &&
367 ((ybits & float_sign_mask) == float_infinity) ) {
368 return x;
369 }
370 return ((jfloat)fmod_winx64((double)x, (double)y));
371 #else
372 return ((jfloat)fmod((double)x,(double)y));
373 #endif
374 JRT_END
375
376 JRT_LEAF(jdouble, SharedRuntime::drem(jdouble x, jdouble y))
377 #ifdef _WIN64
378 julong xbits = PrimitiveConversions::cast<julong>(x);
379 julong ybits = PrimitiveConversions::cast<julong>(y);
380 // x Mod Infinity == x unless x is infinity
381 if (((xbits & double_sign_mask) != double_infinity) &&
382 ((ybits & double_sign_mask) == double_infinity) ) {
383 return x;
384 }
385 return ((jdouble)fmod_winx64((double)x, (double)y));
386 #else
387 return ((jdouble)fmod((double)x,(double)y));
388 #endif
389 JRT_END
390 #endif // !X86
391
392 JRT_LEAF(jfloat, SharedRuntime::i2f(jint x))
393 return (jfloat)x;
394 JRT_END
395
396 #ifdef __SOFTFP__
397 JRT_LEAF(jfloat, SharedRuntime::fadd(jfloat x, jfloat y))
398 return x + y;
399 JRT_END
400
401 JRT_LEAF(jfloat, SharedRuntime::fsub(jfloat x, jfloat y))
402 return x - y;
403 JRT_END
404
405 JRT_LEAF(jfloat, SharedRuntime::fmul(jfloat x, jfloat y))
406 return x * y;
407 JRT_END
408
409 JRT_LEAF(jfloat, SharedRuntime::fdiv(jfloat x, jfloat y))
410 return x / y;
411 JRT_END
412
413 JRT_LEAF(jdouble, SharedRuntime::dadd(jdouble x, jdouble y))
414 return x + y;
415 JRT_END
416
417 JRT_LEAF(jdouble, SharedRuntime::dsub(jdouble x, jdouble y))
418 return x - y;
419 JRT_END
420
421 JRT_LEAF(jdouble, SharedRuntime::dmul(jdouble x, jdouble y))
422 return x * y;
423 JRT_END
424
425 JRT_LEAF(jdouble, SharedRuntime::ddiv(jdouble x, jdouble y))
426 return x / y;
427 JRT_END
428
429 JRT_LEAF(jdouble, SharedRuntime::i2d(jint x))
430 return (jdouble)x;
431 JRT_END
432
433 JRT_LEAF(jdouble, SharedRuntime::f2d(jfloat x))
434 return (jdouble)x;
435 JRT_END
436
437 JRT_LEAF(int, SharedRuntime::fcmpl(float x, float y))
438 return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan*/
439 JRT_END
440
441 JRT_LEAF(int, SharedRuntime::fcmpg(float x, float y))
442 return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */
443 JRT_END
444
445 JRT_LEAF(int, SharedRuntime::dcmpl(double x, double y))
446 return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan */
447 JRT_END
448
449 JRT_LEAF(int, SharedRuntime::dcmpg(double x, double y))
450 return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */
451 JRT_END
452
453 // Functions to return the opposite of the aeabi functions for nan.
454 JRT_LEAF(int, SharedRuntime::unordered_fcmplt(float x, float y))
455 return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
456 JRT_END
457
458 JRT_LEAF(int, SharedRuntime::unordered_dcmplt(double x, double y))
459 return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
460 JRT_END
461
462 JRT_LEAF(int, SharedRuntime::unordered_fcmple(float x, float y))
463 return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
464 JRT_END
465
466 JRT_LEAF(int, SharedRuntime::unordered_dcmple(double x, double y))
467 return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
468 JRT_END
469
470 JRT_LEAF(int, SharedRuntime::unordered_fcmpge(float x, float y))
471 return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
472 JRT_END
473
474 JRT_LEAF(int, SharedRuntime::unordered_dcmpge(double x, double y))
475 return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
476 JRT_END
477
478 JRT_LEAF(int, SharedRuntime::unordered_fcmpgt(float x, float y))
479 return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
480 JRT_END
481
482 JRT_LEAF(int, SharedRuntime::unordered_dcmpgt(double x, double y))
483 return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
484 JRT_END
485
486 // Intrinsics make gcc generate code for these.
487 float SharedRuntime::fneg(float f) {
488 return -f;
489 }
490
491 double SharedRuntime::dneg(double f) {
492 return -f;
493 }
494
495 #endif // __SOFTFP__
496
497 #if defined(__SOFTFP__) || defined(E500V2)
498 // Intrinsics make gcc generate code for these.
499 double SharedRuntime::dabs(double f) {
500 return (f <= (double)0.0) ? (double)0.0 - f : f;
501 }
502
503 #endif
504
505 #if defined(__SOFTFP__)
506 double SharedRuntime::dsqrt(double f) {
507 return sqrt(f);
508 }
509 #endif
510
511 JRT_LEAF(jint, SharedRuntime::f2i(jfloat x))
512 if (g_isnan(x))
513 return 0;
514 if (x >= (jfloat) max_jint)
515 return max_jint;
516 if (x <= (jfloat) min_jint)
517 return min_jint;
518 return (jint) x;
519 JRT_END
520
521
522 JRT_LEAF(jlong, SharedRuntime::f2l(jfloat x))
523 if (g_isnan(x))
524 return 0;
525 if (x >= (jfloat) max_jlong)
526 return max_jlong;
527 if (x <= (jfloat) min_jlong)
528 return min_jlong;
529 return (jlong) x;
530 JRT_END
531
532
533 JRT_LEAF(jint, SharedRuntime::d2i(jdouble x))
534 if (g_isnan(x))
535 return 0;
536 if (x >= (jdouble) max_jint)
537 return max_jint;
538 if (x <= (jdouble) min_jint)
539 return min_jint;
540 return (jint) x;
541 JRT_END
542
543
544 JRT_LEAF(jlong, SharedRuntime::d2l(jdouble x))
545 if (g_isnan(x))
546 return 0;
547 if (x >= (jdouble) max_jlong)
548 return max_jlong;
549 if (x <= (jdouble) min_jlong)
550 return min_jlong;
551 return (jlong) x;
552 JRT_END
553
554
555 JRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x))
556 return (jfloat)x;
557 JRT_END
558
559
560 JRT_LEAF(jfloat, SharedRuntime::l2f(jlong x))
561 return (jfloat)x;
562 JRT_END
563
564
565 JRT_LEAF(jdouble, SharedRuntime::l2d(jlong x))
566 return (jdouble)x;
567 JRT_END
568
569
570 // Exception handling across interpreter/compiler boundaries
571 //
572 // exception_handler_for_return_address(...) returns the continuation address.
573 // The continuation address is the entry point of the exception handler of the
574 // previous frame depending on the return address.
575
576 address SharedRuntime::raw_exception_handler_for_return_address(JavaThread* current, address return_address) {
577 // Note: This is called when we have unwound the frame of the callee that did
578 // throw an exception. So far, no check has been performed by the StackWatermarkSet.
579 // Notably, the stack is not walkable at this point, and hence the check must
580 // be deferred until later. Specifically, any of the handlers returned here in
581 // this function, will get dispatched to, and call deferred checks to
582 // StackWatermarkSet::after_unwind at a point where the stack is walkable.
583 assert(frame::verify_return_pc(return_address), "must be a return address: " INTPTR_FORMAT, p2i(return_address));
584 assert(current->frames_to_pop_failed_realloc() == 0 || Interpreter::contains(return_address), "missed frames to pop?");
585
586 if (Continuation::is_return_barrier_entry(return_address)) {
587 return StubRoutines::cont_returnBarrierExc();
588 }
589
590 // The fastest case first
591 CodeBlob* blob = CodeCache::find_blob(return_address);
592 nmethod* nm = (blob != nullptr) ? blob->as_nmethod_or_null() : nullptr;
593 if (nm != nullptr) {
594 // native nmethods don't have exception handlers
595 assert(!nm->is_native_method() || nm->method()->is_continuation_enter_intrinsic(), "no exception handler");
596 assert(nm->header_begin() != nm->exception_begin(), "no exception handler");
597 if (nm->is_deopt_pc(return_address)) {
598 // If we come here because of a stack overflow, the stack may be
599 // unguarded. Reguard the stack otherwise if we return to the
600 // deopt blob and the stack bang causes a stack overflow we
601 // crash.
602 StackOverflow* overflow_state = current->stack_overflow_state();
603 bool guard_pages_enabled = overflow_state->reguard_stack_if_needed();
604 if (overflow_state->reserved_stack_activation() != current->stack_base()) {
605 overflow_state->set_reserved_stack_activation(current->stack_base());
606 }
607 assert(guard_pages_enabled, "stack banging in deopt blob may cause crash");
608 // The deferred StackWatermarkSet::after_unwind check will be performed in
609 // Deoptimization::fetch_unroll_info (with exec_mode == Unpack_exception)
610 return SharedRuntime::deopt_blob()->unpack_with_exception();
611 } else {
612 // The deferred StackWatermarkSet::after_unwind check will be performed in
613 // * OptoRuntime::handle_exception_C_helper for C2 code
614 // * exception_handler_for_pc_helper via Runtime1::handle_exception_from_callee_id for C1 code
615 #ifdef COMPILER2
616 if (nm->compiler_type() == compiler_c2) {
617 return OptoRuntime::exception_blob()->entry_point();
618 }
619 #endif // COMPILER2
620 return nm->exception_begin();
621 }
622 }
623
624 // Entry code
625 if (StubRoutines::returns_to_call_stub(return_address)) {
626 // The deferred StackWatermarkSet::after_unwind check will be performed in
627 // JavaCallWrapper::~JavaCallWrapper
628 assert (StubRoutines::catch_exception_entry() != nullptr, "must be generated before");
629 return StubRoutines::catch_exception_entry();
630 }
631 if (blob != nullptr && blob->is_upcall_stub()) {
632 return StubRoutines::upcall_stub_exception_handler();
633 }
634 // Interpreted code
635 if (Interpreter::contains(return_address)) {
636 // The deferred StackWatermarkSet::after_unwind check will be performed in
637 // InterpreterRuntime::exception_handler_for_exception
638 return Interpreter::rethrow_exception_entry();
639 }
640
641 guarantee(blob == nullptr || !blob->is_runtime_stub(), "caller should have skipped stub");
642 guarantee(!VtableStubs::contains(return_address), "null exceptions in vtables should have been handled already!");
643
644 #ifndef PRODUCT
645 { ResourceMark rm;
646 tty->print_cr("No exception handler found for exception at " INTPTR_FORMAT " - potential problems:", p2i(return_address));
647 os::print_location(tty, (intptr_t)return_address);
648 tty->print_cr("a) exception happened in (new?) code stubs/buffers that is not handled here");
649 tty->print_cr("b) other problem");
650 }
651 #endif // PRODUCT
652 ShouldNotReachHere();
653 return nullptr;
654 }
655
656
657 JRT_LEAF(address, SharedRuntime::exception_handler_for_return_address(JavaThread* current, address return_address))
658 return raw_exception_handler_for_return_address(current, return_address);
659 JRT_END
660
661
662 address SharedRuntime::get_poll_stub(address pc) {
663 address stub;
664 // Look up the code blob
665 CodeBlob *cb = CodeCache::find_blob(pc);
666
667 // Should be an nmethod
668 guarantee(cb != nullptr && cb->is_nmethod(), "safepoint polling: pc must refer to an nmethod");
669
670 // Look up the relocation information
671 assert(cb->as_nmethod()->is_at_poll_or_poll_return(pc),
672 "safepoint polling: type must be poll at pc " INTPTR_FORMAT, p2i(pc));
673
674 #ifdef ASSERT
675 if (!((NativeInstruction*)pc)->is_safepoint_poll()) {
676 tty->print_cr("bad pc: " PTR_FORMAT, p2i(pc));
677 Disassembler::decode(cb);
678 fatal("Only polling locations are used for safepoint");
679 }
680 #endif
681
682 bool at_poll_return = cb->as_nmethod()->is_at_poll_return(pc);
683 bool has_wide_vectors = cb->as_nmethod()->has_wide_vectors();
684 if (at_poll_return) {
685 assert(SharedRuntime::polling_page_return_handler_blob() != nullptr,
686 "polling page return stub not created yet");
687 stub = SharedRuntime::polling_page_return_handler_blob()->entry_point();
688 } else if (has_wide_vectors) {
689 assert(SharedRuntime::polling_page_vectors_safepoint_handler_blob() != nullptr,
690 "polling page vectors safepoint stub not created yet");
691 stub = SharedRuntime::polling_page_vectors_safepoint_handler_blob()->entry_point();
692 } else {
693 assert(SharedRuntime::polling_page_safepoint_handler_blob() != nullptr,
694 "polling page safepoint stub not created yet");
695 stub = SharedRuntime::polling_page_safepoint_handler_blob()->entry_point();
696 }
697 log_trace(safepoint)("Polling page exception: thread = " INTPTR_FORMAT " [%d], pc = "
698 INTPTR_FORMAT " (%s), stub = " INTPTR_FORMAT,
699 p2i(Thread::current()),
700 Thread::current()->osthread()->thread_id(),
701 p2i(pc),
702 at_poll_return ? "return" : "loop",
703 p2i(stub));
704 return stub;
705 }
706
707 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread* current, Handle h_exception) {
708 if (JvmtiExport::can_post_on_exceptions()) {
709 vframeStream vfst(current, true);
710 methodHandle method = methodHandle(current, vfst.method());
711 address bcp = method()->bcp_from(vfst.bci());
712 JvmtiExport::post_exception_throw(current, method(), bcp, h_exception());
713 }
714
715 Exceptions::_throw(current, __FILE__, __LINE__, h_exception);
716 }
717
718 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread* current, Symbol* name, const char *message) {
719 Handle h_exception = Exceptions::new_exception(current, name, message);
720 throw_and_post_jvmti_exception(current, h_exception);
721 }
722
723 // The interpreter code to call this tracing function is only
724 // called/generated when UL is on for redefine, class and has the right level
725 // and tags. Since obsolete methods are never compiled, we don't have
726 // to modify the compilers to generate calls to this function.
727 //
728 JRT_LEAF(int, SharedRuntime::rc_trace_method_entry(
729 JavaThread* thread, Method* method))
730 if (method->is_obsolete()) {
731 // We are calling an obsolete method, but this is not necessarily
732 // an error. Our method could have been redefined just after we
733 // fetched the Method* from the constant pool.
734 ResourceMark rm;
735 log_trace(redefine, class, obsolete)("calling obsolete method '%s'", method->name_and_sig_as_C_string());
736 }
737 return 0;
738 JRT_END
739
740 // ret_pc points into caller; we are returning caller's exception handler
741 // for given exception
742 // Note that the implementation of this method assumes it's only called when an exception has actually occured
743 address SharedRuntime::compute_compiled_exc_handler(nmethod* nm, address ret_pc, Handle& exception,
744 bool force_unwind, bool top_frame_only, bool& recursive_exception_occurred) {
745 assert(nm != nullptr, "must exist");
746 ResourceMark rm;
747
748 ScopeDesc* sd = nm->scope_desc_at(ret_pc);
749 // determine handler bci, if any
750 EXCEPTION_MARK;
751
752 Handle orig_exception(THREAD, exception());
753
754 int handler_bci = -1;
755 int scope_depth = 0;
756 if (!force_unwind) {
757 int bci = sd->bci();
758 bool recursive_exception = false;
759 do {
760 bool skip_scope_increment = false;
761 // exception handler lookup
762 Klass* ek = exception->klass();
763 methodHandle mh(THREAD, sd->method());
764 handler_bci = Method::fast_exception_handler_bci_for(mh, ek, bci, THREAD);
765 if (HAS_PENDING_EXCEPTION) {
766 recursive_exception = true;
767 // We threw an exception while trying to find the exception handler.
768 // Transfer the new exception to the exception handle which will
769 // be set into thread local storage, and do another lookup for an
770 // exception handler for this exception, this time starting at the
771 // BCI of the exception handler which caused the exception to be
772 // thrown (bugs 4307310 and 4546590). Set "exception" reference
773 // argument to ensure that the correct exception is thrown (4870175).
774 recursive_exception_occurred = true;
775 exception.replace(PENDING_EXCEPTION);
776 CLEAR_PENDING_EXCEPTION;
777 if (handler_bci >= 0) {
778 bci = handler_bci;
779 handler_bci = -1;
780 skip_scope_increment = true;
781 }
782 }
783 else {
784 recursive_exception = false;
785 }
786 if (!top_frame_only && handler_bci < 0 && !skip_scope_increment) {
787 sd = sd->sender();
788 if (sd != nullptr) {
789 bci = sd->bci();
790 }
791 ++scope_depth;
792 }
793 } while (recursive_exception || (!top_frame_only && handler_bci < 0 && sd != nullptr));
794 }
795
796 // found handling method => lookup exception handler
797 int catch_pco = pointer_delta_as_int(ret_pc, nm->code_begin());
798
799 ExceptionHandlerTable table(nm);
800 HandlerTableEntry *t = table.entry_for(catch_pco, handler_bci, scope_depth);
801
802 // If the compiler did not anticipate a recursive exception, resulting in an exception
803 // thrown from the catch bci, then the compiled exception handler might be missing.
804 // This is rare. Just deoptimize and let the interpreter rethrow the original
805 // exception at the original bci.
806 if (t == nullptr && recursive_exception_occurred) {
807 exception.replace(orig_exception()); // restore original exception
808 bool make_not_entrant = false;
809 return Deoptimization::deoptimize_for_missing_exception_handler(nm, make_not_entrant);
810 }
811
812 if (t == nullptr && (nm->is_compiled_by_c1() || handler_bci != -1)) {
813 // Allow abbreviated catch tables. The idea is to allow a method
814 // to materialize its exceptions without committing to the exact
815 // routing of exceptions. In particular this is needed for adding
816 // a synthetic handler to unlock monitors when inlining
817 // synchronized methods since the unlock path isn't represented in
818 // the bytecodes.
819 t = table.entry_for(catch_pco, -1, 0);
820 }
821
822 #ifdef COMPILER1
823 if (t == nullptr && nm->is_compiled_by_c1()) {
824 assert(nm->unwind_handler_begin() != nullptr, "");
825 return nm->unwind_handler_begin();
826 }
827 #endif
828
829 if (t == nullptr) {
830 ttyLocker ttyl;
831 tty->print_cr("MISSING EXCEPTION HANDLER for pc " INTPTR_FORMAT " and handler bci %d, catch_pco: %d", p2i(ret_pc), handler_bci, catch_pco);
832 tty->print_cr(" Exception:");
833 exception->print();
834 tty->cr();
835 tty->print_cr(" Compiled exception table :");
836 table.print();
837 nm->print();
838 nm->print_code();
839 guarantee(false, "missing exception handler");
840 return nullptr;
841 }
842
843 if (handler_bci != -1) { // did we find a handler in this method?
844 sd->method()->set_exception_handler_entered(handler_bci); // profile
845 }
846 return nm->code_begin() + t->pco();
847 }
848
849 JRT_ENTRY(void, SharedRuntime::throw_AbstractMethodError(JavaThread* current))
850 // These errors occur only at call sites
851 throw_and_post_jvmti_exception(current, vmSymbols::java_lang_AbstractMethodError());
852 JRT_END
853
854 JRT_ENTRY(void, SharedRuntime::throw_IncompatibleClassChangeError(JavaThread* current))
855 // These errors occur only at call sites
856 throw_and_post_jvmti_exception(current, vmSymbols::java_lang_IncompatibleClassChangeError(), "vtable stub");
857 JRT_END
858
859 JRT_ENTRY(void, SharedRuntime::throw_ArithmeticException(JavaThread* current))
860 throw_and_post_jvmti_exception(current, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
861 JRT_END
862
863 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* current))
864 throw_and_post_jvmti_exception(current, vmSymbols::java_lang_NullPointerException(), nullptr);
865 JRT_END
866
867 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException_at_call(JavaThread* current))
868 // This entry point is effectively only used for NullPointerExceptions which occur at inline
869 // cache sites (when the callee activation is not yet set up) so we are at a call site
870 throw_and_post_jvmti_exception(current, vmSymbols::java_lang_NullPointerException(), nullptr);
871 JRT_END
872
873 JRT_ENTRY(void, SharedRuntime::throw_StackOverflowError(JavaThread* current))
874 throw_StackOverflowError_common(current, false);
875 JRT_END
876
877 JRT_ENTRY(void, SharedRuntime::throw_delayed_StackOverflowError(JavaThread* current))
878 throw_StackOverflowError_common(current, true);
879 JRT_END
880
881 void SharedRuntime::throw_StackOverflowError_common(JavaThread* current, bool delayed) {
882 // We avoid using the normal exception construction in this case because
883 // it performs an upcall to Java, and we're already out of stack space.
884 JavaThread* THREAD = current; // For exception macros.
885 InstanceKlass* k = vmClasses::StackOverflowError_klass();
886 oop exception_oop = k->allocate_instance(CHECK);
887 if (delayed) {
888 java_lang_Throwable::set_message(exception_oop,
889 Universe::delayed_stack_overflow_error_message());
890 }
891 Handle exception (current, exception_oop);
892 if (StackTraceInThrowable) {
893 java_lang_Throwable::fill_in_stack_trace(exception);
894 }
895 // Remove the ScopedValue bindings in case we got a
896 // StackOverflowError while we were trying to remove ScopedValue
897 // bindings.
898 current->clear_scopedValueBindings();
899 // Increment counter for hs_err file reporting
900 Exceptions::increment_stack_overflow_errors();
901 throw_and_post_jvmti_exception(current, exception);
902 }
903
904 address SharedRuntime::continuation_for_implicit_exception(JavaThread* current,
905 address pc,
906 ImplicitExceptionKind exception_kind)
907 {
908 address target_pc = nullptr;
909
910 if (Interpreter::contains(pc)) {
911 switch (exception_kind) {
912 case IMPLICIT_NULL: return Interpreter::throw_NullPointerException_entry();
913 case IMPLICIT_DIVIDE_BY_ZERO: return Interpreter::throw_ArithmeticException_entry();
914 case STACK_OVERFLOW: return Interpreter::throw_StackOverflowError_entry();
915 default: ShouldNotReachHere();
916 }
917 } else {
918 switch (exception_kind) {
919 case STACK_OVERFLOW: {
920 // Stack overflow only occurs upon frame setup; the callee is
921 // going to be unwound. Dispatch to a shared runtime stub
922 // which will cause the StackOverflowError to be fabricated
923 // and processed.
924 // Stack overflow should never occur during deoptimization:
925 // the compiled method bangs the stack by as much as the
926 // interpreter would need in case of a deoptimization. The
927 // deoptimization blob and uncommon trap blob bang the stack
928 // in a debug VM to verify the correctness of the compiled
929 // method stack banging.
930 assert(current->deopt_mark() == nullptr, "no stack overflow from deopt blob/uncommon trap");
931 Events::log_exception(current, "StackOverflowError at " INTPTR_FORMAT, p2i(pc));
932 return SharedRuntime::throw_StackOverflowError_entry();
933 }
934
935 case IMPLICIT_NULL: {
936 if (VtableStubs::contains(pc)) {
937 // We haven't yet entered the callee frame. Fabricate an
938 // exception and begin dispatching it in the caller. Since
939 // the caller was at a call site, it's safe to destroy all
940 // caller-saved registers, as these entry points do.
941 VtableStub* vt_stub = VtableStubs::stub_containing(pc);
942
943 // If vt_stub is null, then return null to signal handler to report the SEGV error.
944 if (vt_stub == nullptr) return nullptr;
945
946 if (vt_stub->is_abstract_method_error(pc)) {
947 assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs");
948 Events::log_exception(current, "AbstractMethodError at " INTPTR_FORMAT, p2i(pc));
949 // Instead of throwing the abstract method error here directly, we re-resolve
950 // and will throw the AbstractMethodError during resolve. As a result, we'll
951 // get a more detailed error message.
952 return SharedRuntime::get_handle_wrong_method_stub();
953 } else {
954 Events::log_exception(current, "NullPointerException at vtable entry " INTPTR_FORMAT, p2i(pc));
955 // Assert that the signal comes from the expected location in stub code.
956 assert(vt_stub->is_null_pointer_exception(pc),
957 "obtained signal from unexpected location in stub code");
958 return SharedRuntime::throw_NullPointerException_at_call_entry();
959 }
960 } else {
961 CodeBlob* cb = CodeCache::find_blob(pc);
962
963 // If code blob is null, then return null to signal handler to report the SEGV error.
964 if (cb == nullptr) return nullptr;
965
966 // Exception happened in CodeCache. Must be either:
967 // 1. Inline-cache check in C2I handler blob,
968 // 2. Inline-cache check in nmethod, or
969 // 3. Implicit null exception in nmethod
970
971 if (!cb->is_nmethod()) {
972 bool is_in_blob = cb->is_adapter_blob() || cb->is_method_handles_adapter_blob();
973 if (!is_in_blob) {
974 // Allow normal crash reporting to handle this
975 return nullptr;
976 }
977 Events::log_exception(current, "NullPointerException in code blob at " INTPTR_FORMAT, p2i(pc));
978 // There is no handler here, so we will simply unwind.
979 return SharedRuntime::throw_NullPointerException_at_call_entry();
980 }
981
982 // Otherwise, it's a compiled method. Consult its exception handlers.
983 nmethod* nm = cb->as_nmethod();
984 if (nm->inlinecache_check_contains(pc)) {
985 // exception happened inside inline-cache check code
986 // => the nmethod is not yet active (i.e., the frame
987 // is not set up yet) => use return address pushed by
988 // caller => don't push another return address
989 Events::log_exception(current, "NullPointerException in IC check " INTPTR_FORMAT, p2i(pc));
990 return SharedRuntime::throw_NullPointerException_at_call_entry();
991 }
992
993 if (nm->method()->is_method_handle_intrinsic()) {
994 // exception happened inside MH dispatch code, similar to a vtable stub
995 Events::log_exception(current, "NullPointerException in MH adapter " INTPTR_FORMAT, p2i(pc));
996 return SharedRuntime::throw_NullPointerException_at_call_entry();
997 }
998
999 #ifndef PRODUCT
1000 _implicit_null_throws++;
1001 #endif
1002 target_pc = nm->continuation_for_implicit_exception(pc);
1003 // If there's an unexpected fault, target_pc might be null,
1004 // in which case we want to fall through into the normal
1005 // error handling code.
1006 }
1007
1008 break; // fall through
1009 }
1010
1011
1012 case IMPLICIT_DIVIDE_BY_ZERO: {
1013 nmethod* nm = CodeCache::find_nmethod(pc);
1014 guarantee(nm != nullptr, "must have containing compiled method for implicit division-by-zero exceptions");
1015 #ifndef PRODUCT
1016 _implicit_div0_throws++;
1017 #endif
1018 target_pc = nm->continuation_for_implicit_exception(pc);
1019 // If there's an unexpected fault, target_pc might be null,
1020 // in which case we want to fall through into the normal
1021 // error handling code.
1022 break; // fall through
1023 }
1024
1025 default: ShouldNotReachHere();
1026 }
1027
1028 assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind");
1029
1030 if (exception_kind == IMPLICIT_NULL) {
1031 #ifndef PRODUCT
1032 // for AbortVMOnException flag
1033 Exceptions::debug_check_abort("java.lang.NullPointerException");
1034 #endif //PRODUCT
1035 Events::log_exception(current, "Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, p2i(pc), p2i(target_pc));
1036 } else {
1037 #ifndef PRODUCT
1038 // for AbortVMOnException flag
1039 Exceptions::debug_check_abort("java.lang.ArithmeticException");
1040 #endif //PRODUCT
1041 Events::log_exception(current, "Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, p2i(pc), p2i(target_pc));
1042 }
1043 return target_pc;
1044 }
1045
1046 ShouldNotReachHere();
1047 return nullptr;
1048 }
1049
1050
1051 /**
1052 * Throws an java/lang/UnsatisfiedLinkError. The address of this method is
1053 * installed in the native function entry of all native Java methods before
1054 * they get linked to their actual native methods.
1055 *
1056 * \note
1057 * This method actually never gets called! The reason is because
1058 * the interpreter's native entries call NativeLookup::lookup() which
1059 * throws the exception when the lookup fails. The exception is then
1060 * caught and forwarded on the return from NativeLookup::lookup() call
1061 * before the call to the native function. This might change in the future.
1062 */
1063 JNI_ENTRY(void*, throw_unsatisfied_link_error(JNIEnv* env, ...))
1064 {
1065 // We return a bad value here to make sure that the exception is
1066 // forwarded before we look at the return value.
1067 THROW_(vmSymbols::java_lang_UnsatisfiedLinkError(), (void*)badAddress);
1068 }
1069 JNI_END
1070
1071 address SharedRuntime::native_method_throw_unsatisfied_link_error_entry() {
1072 return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error);
1073 }
1074
1075 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* current, oopDesc* obj))
1076 assert(oopDesc::is_oop(obj), "must be a valid oop");
1077 assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
1078 InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
1079 JRT_END
1080
1081 jlong SharedRuntime::get_java_tid(JavaThread* thread) {
1082 assert(thread != nullptr, "No thread");
1083 if (thread == nullptr) {
1084 return 0;
1085 }
1086 guarantee(Thread::current() != thread || thread->is_oop_safe(),
1087 "current cannot touch oops after its GC barrier is detached.");
1088 oop obj = thread->threadObj();
1089 return (obj == nullptr) ? 0 : java_lang_Thread::thread_id(obj);
1090 }
1091
1092 /**
1093 * This function ought to be a void function, but cannot be because
1094 * it gets turned into a tail-call on sparc, which runs into dtrace bug
1095 * 6254741. Once that is fixed we can remove the dummy return value.
1096 */
1097 int SharedRuntime::dtrace_object_alloc(oopDesc* o) {
1098 return dtrace_object_alloc(JavaThread::current(), o, o->size());
1099 }
1100
1101 int SharedRuntime::dtrace_object_alloc(JavaThread* thread, oopDesc* o) {
1102 return dtrace_object_alloc(thread, o, o->size());
1103 }
1104
1105 int SharedRuntime::dtrace_object_alloc(JavaThread* thread, oopDesc* o, size_t size) {
1106 assert(DTraceAllocProbes, "wrong call");
1107 Klass* klass = o->klass();
1108 Symbol* name = klass->name();
1109 HOTSPOT_OBJECT_ALLOC(
1110 get_java_tid(thread),
1111 (char *) name->bytes(), name->utf8_length(), size * HeapWordSize);
1112 return 0;
1113 }
1114
1115 JRT_LEAF(int, SharedRuntime::dtrace_method_entry(
1116 JavaThread* current, Method* method))
1117 assert(current == JavaThread::current(), "pre-condition");
1118
1119 assert(DTraceMethodProbes, "wrong call");
1120 Symbol* kname = method->klass_name();
1121 Symbol* name = method->name();
1122 Symbol* sig = method->signature();
1123 HOTSPOT_METHOD_ENTRY(
1124 get_java_tid(current),
1125 (char *) kname->bytes(), kname->utf8_length(),
1126 (char *) name->bytes(), name->utf8_length(),
1127 (char *) sig->bytes(), sig->utf8_length());
1128 return 0;
1129 JRT_END
1130
1131 JRT_LEAF(int, SharedRuntime::dtrace_method_exit(
1132 JavaThread* current, Method* method))
1133 assert(current == JavaThread::current(), "pre-condition");
1134 assert(DTraceMethodProbes, "wrong call");
1135 Symbol* kname = method->klass_name();
1136 Symbol* name = method->name();
1137 Symbol* sig = method->signature();
1138 HOTSPOT_METHOD_RETURN(
1139 get_java_tid(current),
1140 (char *) kname->bytes(), kname->utf8_length(),
1141 (char *) name->bytes(), name->utf8_length(),
1142 (char *) sig->bytes(), sig->utf8_length());
1143 return 0;
1144 JRT_END
1145
1146
1147 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode)
1148 // for a call current in progress, i.e., arguments has been pushed on stack
1149 // put callee has not been invoked yet. Used by: resolve virtual/static,
1150 // vtable updates, etc. Caller frame must be compiled.
1151 Handle SharedRuntime::find_callee_info(Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) {
1152 JavaThread* current = THREAD;
1153 ResourceMark rm(current);
1154
1155 // last java frame on stack (which includes native call frames)
1156 vframeStream vfst(current, true); // Do not skip and javaCalls
1157
1158 return find_callee_info_helper(vfst, bc, callinfo, THREAD);
1159 }
1160
1161 Method* SharedRuntime::extract_attached_method(vframeStream& vfst) {
1162 nmethod* caller = vfst.nm();
1163
1164 address pc = vfst.frame_pc();
1165 { // Get call instruction under lock because another thread may be busy patching it.
1166 CompiledICLocker ic_locker(caller);
1167 return caller->attached_method_before_pc(pc);
1168 }
1169 return nullptr;
1170 }
1171
1172 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode
1173 // for a call current in progress, i.e., arguments has been pushed on stack
1174 // but callee has not been invoked yet. Caller frame must be compiled.
1175 Handle SharedRuntime::find_callee_info_helper(vframeStream& vfst, Bytecodes::Code& bc,
1176 CallInfo& callinfo, TRAPS) {
1177 Handle receiver;
1178 Handle nullHandle; // create a handy null handle for exception returns
1179 JavaThread* current = THREAD;
1180
1181 assert(!vfst.at_end(), "Java frame must exist");
1182
1183 // Find caller and bci from vframe
1184 methodHandle caller(current, vfst.method());
1185 int bci = vfst.bci();
1186
1187 if (caller->is_continuation_enter_intrinsic()) {
1188 bc = Bytecodes::_invokestatic;
1189 LinkResolver::resolve_continuation_enter(callinfo, CHECK_NH);
1190 return receiver;
1191 }
1192
1193 // Substitutability test implementation piggy backs on static call resolution
1194 Bytecodes::Code code = caller->java_code_at(bci);
1195 if (code == Bytecodes::_if_acmpeq || code == Bytecodes::_if_acmpne) {
1196 bc = Bytecodes::_invokestatic;
1197 methodHandle attached_method(THREAD, extract_attached_method(vfst));
1198 assert(attached_method.not_null(), "must have attached method");
1199 vmClasses::ValueObjectMethods_klass()->initialize(CHECK_NH);
1200 LinkResolver::resolve_invoke(callinfo, receiver, attached_method, bc, false, CHECK_NH);
1201 #ifdef ASSERT
1202 Symbol* subst_method_name = vmSymbols::isSubstitutable_name();
1203 Method* is_subst = vmClasses::ValueObjectMethods_klass()->find_method(subst_method_name, vmSymbols::object_object_boolean_signature());
1204 assert(callinfo.selected_method() == is_subst, "must be isSubstitutable method");
1205 #endif
1206 return receiver;
1207 }
1208
1209 Bytecode_invoke bytecode(caller, bci);
1210 int bytecode_index = bytecode.index();
1211 bc = bytecode.invoke_code();
1212
1213 methodHandle attached_method(current, extract_attached_method(vfst));
1214 if (attached_method.not_null()) {
1215 Method* callee = bytecode.static_target(CHECK_NH);
1216 vmIntrinsics::ID id = callee->intrinsic_id();
1217 // When VM replaces MH.invokeBasic/linkTo* call with a direct/virtual call,
1218 // it attaches statically resolved method to the call site.
1219 if (MethodHandles::is_signature_polymorphic(id) &&
1220 MethodHandles::is_signature_polymorphic_intrinsic(id)) {
1221 bc = MethodHandles::signature_polymorphic_intrinsic_bytecode(id);
1222
1223 // Adjust invocation mode according to the attached method.
1224 switch (bc) {
1225 case Bytecodes::_invokevirtual:
1226 if (attached_method->method_holder()->is_interface()) {
1227 bc = Bytecodes::_invokeinterface;
1228 }
1229 break;
1230 case Bytecodes::_invokeinterface:
1231 if (!attached_method->method_holder()->is_interface()) {
1232 bc = Bytecodes::_invokevirtual;
1233 }
1234 break;
1235 case Bytecodes::_invokehandle:
1236 if (!MethodHandles::is_signature_polymorphic_method(attached_method())) {
1237 bc = attached_method->is_static() ? Bytecodes::_invokestatic
1238 : Bytecodes::_invokevirtual;
1239 }
1240 break;
1241 default:
1242 break;
1243 }
1244 } else {
1245 assert(attached_method->has_scalarized_args(), "invalid use of attached method");
1246 if (!attached_method->method_holder()->is_inline_klass() || attached_method->is_static()) {
1247 // Ignore the attached method in this case to not confuse below code
1248 attached_method = methodHandle(current, nullptr);
1249 }
1250 }
1251 }
1252
1253 assert(bc != Bytecodes::_illegal, "not initialized");
1254
1255 bool has_receiver = bc != Bytecodes::_invokestatic &&
1256 bc != Bytecodes::_invokedynamic &&
1257 bc != Bytecodes::_invokehandle;
1258 bool check_null_and_abstract = true;
1259
1260 // Find receiver for non-static call
1261 if (has_receiver) {
1262 // This register map must be update since we need to find the receiver for
1263 // compiled frames. The receiver might be in a register.
1264 RegisterMap reg_map2(current,
1265 RegisterMap::UpdateMap::include,
1266 RegisterMap::ProcessFrames::include,
1267 RegisterMap::WalkContinuation::skip);
1268 frame stubFrame = current->last_frame();
1269 // Caller-frame is a compiled frame
1270 frame callerFrame = stubFrame.sender(®_map2);
1271
1272 Method* callee = attached_method();
1273 if (callee == nullptr) {
1274 callee = bytecode.static_target(CHECK_NH);
1275 if (callee == nullptr) {
1276 THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle);
1277 }
1278 }
1279 bool caller_is_c1 = callerFrame.is_compiled_frame() && callerFrame.cb()->as_nmethod()->is_compiled_by_c1();
1280 if (!caller_is_c1 && callee->is_scalarized_arg(0)) {
1281 // If the receiver is an inline type that is passed as fields, no oop is available
1282 // Resolve the call without receiver null checking.
1283 assert(!callee->mismatch(), "calls with inline type receivers should never mismatch");
1284 assert(attached_method.not_null() && !attached_method->is_abstract(), "must have non-abstract attached method");
1285 if (bc == Bytecodes::_invokeinterface) {
1286 bc = Bytecodes::_invokevirtual; // C2 optimistically replaces interface calls by virtual calls
1287 }
1288 check_null_and_abstract = false;
1289 } else {
1290 // Retrieve from a compiled argument list
1291 receiver = Handle(current, callerFrame.retrieve_receiver(®_map2));
1292 assert(oopDesc::is_oop_or_null(receiver()), "");
1293 if (receiver.is_null()) {
1294 THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle);
1295 }
1296 }
1297 }
1298
1299 // Resolve method
1300 if (attached_method.not_null()) {
1301 // Parameterized by attached method.
1302 LinkResolver::resolve_invoke(callinfo, receiver, attached_method, bc, check_null_and_abstract, CHECK_NH);
1303 } else {
1304 // Parameterized by bytecode.
1305 constantPoolHandle constants(current, caller->constants());
1306 LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_NH);
1307 }
1308
1309 #ifdef ASSERT
1310 // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls
1311 if (has_receiver && check_null_and_abstract) {
1312 assert(receiver.not_null(), "should have thrown exception");
1313 Klass* receiver_klass = receiver->klass();
1314 Klass* rk = nullptr;
1315 if (attached_method.not_null()) {
1316 // In case there's resolved method attached, use its holder during the check.
1317 rk = attached_method->method_holder();
1318 } else {
1319 // Klass is already loaded.
1320 constantPoolHandle constants(current, caller->constants());
1321 rk = constants->klass_ref_at(bytecode_index, bc, CHECK_NH);
1322 }
1323 Klass* static_receiver_klass = rk;
1324 assert(receiver_klass->is_subtype_of(static_receiver_klass),
1325 "actual receiver must be subclass of static receiver klass");
1326 if (receiver_klass->is_instance_klass()) {
1327 if (InstanceKlass::cast(receiver_klass)->is_not_initialized()) {
1328 tty->print_cr("ERROR: Klass not yet initialized!!");
1329 receiver_klass->print();
1330 }
1331 assert(!InstanceKlass::cast(receiver_klass)->is_not_initialized(), "receiver_klass must be initialized");
1332 }
1333 }
1334 #endif
1335
1336 return receiver;
1337 }
1338
1339 methodHandle SharedRuntime::find_callee_method(bool& caller_does_not_scalarize, TRAPS) {
1340 JavaThread* current = THREAD;
1341 ResourceMark rm(current);
1342 // We need first to check if any Java activations (compiled, interpreted)
1343 // exist on the stack since last JavaCall. If not, we need
1344 // to get the target method from the JavaCall wrapper.
1345 vframeStream vfst(current, true); // Do not skip any javaCalls
1346 methodHandle callee_method;
1347 if (vfst.at_end()) {
1348 // No Java frames were found on stack since we did the JavaCall.
1349 // Hence the stack can only contain an entry_frame. We need to
1350 // find the target method from the stub frame.
1351 RegisterMap reg_map(current,
1352 RegisterMap::UpdateMap::skip,
1353 RegisterMap::ProcessFrames::include,
1354 RegisterMap::WalkContinuation::skip);
1355 frame fr = current->last_frame();
1356 assert(fr.is_runtime_frame(), "must be a runtimeStub");
1357 fr = fr.sender(®_map);
1358 assert(fr.is_entry_frame(), "must be");
1359 // fr is now pointing to the entry frame.
1360 callee_method = methodHandle(current, fr.entry_frame_call_wrapper()->callee_method());
1361 } else {
1362 Bytecodes::Code bc;
1363 CallInfo callinfo;
1364 find_callee_info_helper(vfst, bc, callinfo, CHECK_(methodHandle()));
1365 // Calls via mismatching methods are always non-scalarized
1366 if (callinfo.resolved_method()->mismatch()) {
1367 caller_does_not_scalarize = true;
1368 }
1369 callee_method = methodHandle(current, callinfo.selected_method());
1370 }
1371 assert(callee_method()->is_method(), "must be");
1372 return callee_method;
1373 }
1374
1375 // Resolves a call.
1376 methodHandle SharedRuntime::resolve_helper(bool is_virtual, bool is_optimized, bool& caller_does_not_scalarize, TRAPS) {
1377 JavaThread* current = THREAD;
1378 ResourceMark rm(current);
1379 RegisterMap cbl_map(current,
1380 RegisterMap::UpdateMap::skip,
1381 RegisterMap::ProcessFrames::include,
1382 RegisterMap::WalkContinuation::skip);
1383 frame caller_frame = current->last_frame().sender(&cbl_map);
1384
1385 CodeBlob* caller_cb = caller_frame.cb();
1386 guarantee(caller_cb != nullptr && caller_cb->is_nmethod(), "must be called from compiled method");
1387 nmethod* caller_nm = caller_cb->as_nmethod();
1388
1389 // determine call info & receiver
1390 // note: a) receiver is null for static calls
1391 // b) an exception is thrown if receiver is null for non-static calls
1392 CallInfo call_info;
1393 Bytecodes::Code invoke_code = Bytecodes::_illegal;
1394 Handle receiver = find_callee_info(invoke_code, call_info, CHECK_(methodHandle()));
1395
1396 NoSafepointVerifier nsv;
1397
1398 methodHandle callee_method(current, call_info.selected_method());
1399 // Calls via mismatching methods are always non-scalarized
1400 bool mismatch = is_optimized ? call_info.selected_method()->mismatch() : call_info.resolved_method()->mismatch();
1401 if (caller_nm->is_compiled_by_c1() || mismatch) {
1402 caller_does_not_scalarize = true;
1403 }
1404
1405 assert((!is_virtual && invoke_code == Bytecodes::_invokestatic ) ||
1406 (!is_virtual && invoke_code == Bytecodes::_invokespecial) ||
1407 (!is_virtual && invoke_code == Bytecodes::_invokehandle ) ||
1408 (!is_virtual && invoke_code == Bytecodes::_invokedynamic) ||
1409 ( is_virtual && invoke_code != Bytecodes::_invokestatic ), "inconsistent bytecode");
1410
1411 assert(!caller_nm->is_unloading(), "It should not be unloading");
1412
1413 #ifndef PRODUCT
1414 // tracing/debugging/statistics
1415 uint *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
1416 (is_virtual) ? (&_resolve_virtual_ctr) :
1417 (&_resolve_static_ctr);
1418 AtomicAccess::inc(addr);
1419
1420 if (TraceCallFixup) {
1421 ResourceMark rm(current);
1422 tty->print("resolving %s%s (%s) %s call to",
1423 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
1424 Bytecodes::name(invoke_code), (caller_does_not_scalarize) ? "non-scalar" : "");
1425 callee_method->print_short_name(tty);
1426 tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT,
1427 p2i(caller_frame.pc()), p2i(callee_method->code()));
1428 }
1429 #endif
1430
1431 if (invoke_code == Bytecodes::_invokestatic) {
1432 assert(callee_method->method_holder()->is_initialized() ||
1433 callee_method->method_holder()->is_reentrant_initialization(current),
1434 "invalid class initialization state for invoke_static");
1435 if (!VM_Version::supports_fast_class_init_checks() && callee_method->needs_clinit_barrier()) {
1436 // In order to keep class initialization check, do not patch call
1437 // site for static call when the class is not fully initialized.
1438 // Proper check is enforced by call site re-resolution on every invocation.
1439 //
1440 // When fast class initialization checks are supported (VM_Version::supports_fast_class_init_checks() == true),
1441 // explicit class initialization check is put in nmethod entry (VEP).
1442 assert(callee_method->method_holder()->is_linked(), "must be");
1443 return callee_method;
1444 }
1445 }
1446
1447
1448 // JSR 292 key invariant:
1449 // If the resolved method is a MethodHandle invoke target, the call
1450 // site must be a MethodHandle call site, because the lambda form might tail-call
1451 // leaving the stack in a state unknown to either caller or callee
1452
1453 // Compute entry points. The computation of the entry points is independent of
1454 // patching the call.
1455
1456 // Make sure the callee nmethod does not get deoptimized and removed before
1457 // we are done patching the code.
1458
1459
1460 CompiledICLocker ml(caller_nm);
1461 if (is_virtual && !is_optimized) {
1462 CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc());
1463 inline_cache->update(&call_info, receiver->klass(), caller_does_not_scalarize);
1464 } else {
1465 // Callsite is a direct call - set it to the destination method
1466 CompiledDirectCall* callsite = CompiledDirectCall::before(caller_frame.pc());
1467 callsite->set(callee_method, caller_does_not_scalarize);
1468 }
1469
1470 return callee_method;
1471 }
1472
1473 // Inline caches exist only in compiled code
1474 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* current))
1475 #ifdef ASSERT
1476 RegisterMap reg_map(current,
1477 RegisterMap::UpdateMap::skip,
1478 RegisterMap::ProcessFrames::include,
1479 RegisterMap::WalkContinuation::skip);
1480 frame stub_frame = current->last_frame();
1481 assert(stub_frame.is_runtime_frame(), "sanity check");
1482 frame caller_frame = stub_frame.sender(®_map);
1483 assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame() && !caller_frame.is_upcall_stub_frame(), "unexpected frame");
1484 #endif /* ASSERT */
1485
1486 methodHandle callee_method;
1487 bool caller_does_not_scalarize = false;
1488 JRT_BLOCK
1489 callee_method = SharedRuntime::handle_ic_miss_helper(caller_does_not_scalarize, CHECK_NULL);
1490 // Return Method* through TLS
1491 current->set_vm_result_metadata(callee_method());
1492 JRT_BLOCK_END
1493 // return compiled code entry point after potential safepoints
1494 return get_resolved_entry(current, callee_method, false, false, caller_does_not_scalarize);
1495 JRT_END
1496
1497
1498 // Handle call site that has been made non-entrant
1499 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* current))
1500 // 6243940 We might end up in here if the callee is deoptimized
1501 // as we race to call it. We don't want to take a safepoint if
1502 // the caller was interpreted because the caller frame will look
1503 // interpreted to the stack walkers and arguments are now
1504 // "compiled" so it is much better to make this transition
1505 // invisible to the stack walking code. The i2c path will
1506 // place the callee method in the callee_target. It is stashed
1507 // there because if we try and find the callee by normal means a
1508 // safepoint is possible and have trouble gc'ing the compiled args.
1509 RegisterMap reg_map(current,
1510 RegisterMap::UpdateMap::skip,
1511 RegisterMap::ProcessFrames::include,
1512 RegisterMap::WalkContinuation::skip);
1513 frame stub_frame = current->last_frame();
1514 assert(stub_frame.is_runtime_frame(), "sanity check");
1515 frame caller_frame = stub_frame.sender(®_map);
1516
1517 if (caller_frame.is_interpreted_frame() ||
1518 caller_frame.is_entry_frame() ||
1519 caller_frame.is_upcall_stub_frame()) {
1520 Method* callee = current->callee_target();
1521 guarantee(callee != nullptr && callee->is_method(), "bad handshake");
1522 current->set_vm_result_metadata(callee);
1523 current->set_callee_target(nullptr);
1524 if (caller_frame.is_entry_frame() && VM_Version::supports_fast_class_init_checks()) {
1525 // Bypass class initialization checks in c2i when caller is in native.
1526 // JNI calls to static methods don't have class initialization checks.
1527 // Fast class initialization checks are present in c2i adapters and call into
1528 // SharedRuntime::handle_wrong_method() on the slow path.
1529 //
1530 // JVM upcalls may land here as well, but there's a proper check present in
1531 // LinkResolver::resolve_static_call (called from JavaCalls::call_static),
1532 // so bypassing it in c2i adapter is benign.
1533 return callee->get_c2i_no_clinit_check_entry();
1534 } else {
1535 if (caller_frame.is_interpreted_frame()) {
1536 return callee->get_c2i_inline_entry();
1537 } else {
1538 return callee->get_c2i_entry();
1539 }
1540 }
1541 }
1542
1543 // Must be compiled to compiled path which is safe to stackwalk
1544 methodHandle callee_method;
1545 bool is_static_call = false;
1546 bool is_optimized = false;
1547 bool caller_does_not_scalarize = false;
1548 JRT_BLOCK
1549 // Force resolving of caller (if we called from compiled frame)
1550 callee_method = SharedRuntime::reresolve_call_site(is_optimized, caller_does_not_scalarize, CHECK_NULL);
1551 current->set_vm_result_metadata(callee_method());
1552 JRT_BLOCK_END
1553 // return compiled code entry point after potential safepoints
1554 return get_resolved_entry(current, callee_method, callee_method->is_static(), is_optimized, caller_does_not_scalarize);
1555 JRT_END
1556
1557 // Handle abstract method call
1558 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_abstract(JavaThread* current))
1559 // Verbose error message for AbstractMethodError.
1560 // Get the called method from the invoke bytecode.
1561 vframeStream vfst(current, true);
1562 assert(!vfst.at_end(), "Java frame must exist");
1563 methodHandle caller(current, vfst.method());
1564 Bytecode_invoke invoke(caller, vfst.bci());
1565 DEBUG_ONLY( invoke.verify(); )
1566
1567 // Find the compiled caller frame.
1568 RegisterMap reg_map(current,
1569 RegisterMap::UpdateMap::include,
1570 RegisterMap::ProcessFrames::include,
1571 RegisterMap::WalkContinuation::skip);
1572 frame stubFrame = current->last_frame();
1573 assert(stubFrame.is_runtime_frame(), "must be");
1574 frame callerFrame = stubFrame.sender(®_map);
1575 assert(callerFrame.is_compiled_frame(), "must be");
1576
1577 // Install exception and return forward entry.
1578 address res = SharedRuntime::throw_AbstractMethodError_entry();
1579 JRT_BLOCK
1580 methodHandle callee(current, invoke.static_target(current));
1581 if (!callee.is_null()) {
1582 oop recv = callerFrame.retrieve_receiver(®_map);
1583 Klass *recv_klass = (recv != nullptr) ? recv->klass() : nullptr;
1584 res = StubRoutines::forward_exception_entry();
1585 LinkResolver::throw_abstract_method_error(callee, recv_klass, CHECK_(res));
1586 }
1587 JRT_BLOCK_END
1588 return res;
1589 JRT_END
1590
1591 // return verified_code_entry if interp_only_mode is not set for the current thread;
1592 // otherwise return c2i entry.
1593 address SharedRuntime::get_resolved_entry(JavaThread* current, methodHandle callee_method,
1594 bool is_static_call, bool is_optimized, bool caller_does_not_scalarize) {
1595 bool is_interp_only_mode = (StressCallingConvention && (os::random() % (1 << 10)) == 0) || current->is_interp_only_mode();
1596 // In interp_only_mode we need to go to the interpreted entry
1597 // The c2i won't patch in this mode -- see fixup_callers_callsite
1598 bool go_to_interpreter = is_interp_only_mode && !callee_method->is_special_native_intrinsic();
1599
1600 if (caller_does_not_scalarize) {
1601 if (go_to_interpreter) {
1602 return callee_method->get_c2i_inline_entry();
1603 }
1604 assert(callee_method->verified_inline_code_entry() != nullptr, "Jump to zero!");
1605 return callee_method->verified_inline_code_entry();
1606 } else if (is_static_call || is_optimized) {
1607 if (go_to_interpreter) {
1608 return callee_method->get_c2i_entry();
1609 }
1610 assert(callee_method->verified_code_entry() != nullptr, "Jump to zero!");
1611 return callee_method->verified_code_entry();
1612 } else {
1613 if (go_to_interpreter) {
1614 return callee_method->get_c2i_inline_ro_entry();
1615 }
1616 assert(callee_method->verified_inline_ro_code_entry() != nullptr, "Jump to zero!");
1617 return callee_method->verified_inline_ro_code_entry();
1618 }
1619 }
1620
1621 // resolve a static call and patch code
1622 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread* current ))
1623 methodHandle callee_method;
1624 bool caller_does_not_scalarize = false;
1625 bool enter_special = false;
1626 JRT_BLOCK
1627 callee_method = SharedRuntime::resolve_helper(false, false, caller_does_not_scalarize, CHECK_NULL);
1628 current->set_vm_result_metadata(callee_method());
1629 JRT_BLOCK_END
1630 // return compiled code entry point after potential safepoints
1631 return get_resolved_entry(current, callee_method, true, false, caller_does_not_scalarize);
1632 JRT_END
1633
1634 // resolve virtual call and update inline cache to monomorphic
1635 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread* current))
1636 methodHandle callee_method;
1637 bool caller_does_not_scalarize = false;
1638 JRT_BLOCK
1639 callee_method = SharedRuntime::resolve_helper(true, false, caller_does_not_scalarize, CHECK_NULL);
1640 current->set_vm_result_metadata(callee_method());
1641 JRT_BLOCK_END
1642 // return compiled code entry point after potential safepoints
1643 return get_resolved_entry(current, callee_method, false, false, caller_does_not_scalarize);
1644 JRT_END
1645
1646
1647 // Resolve a virtual call that can be statically bound (e.g., always
1648 // monomorphic, so it has no inline cache). Patch code to resolved target.
1649 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread* current))
1650 methodHandle callee_method;
1651 bool caller_does_not_scalarize = false;
1652 JRT_BLOCK
1653 callee_method = SharedRuntime::resolve_helper(true, true, caller_does_not_scalarize, CHECK_NULL);
1654 current->set_vm_result_metadata(callee_method());
1655 JRT_BLOCK_END
1656 // return compiled code entry point after potential safepoints
1657 return get_resolved_entry(current, callee_method, false, true, caller_does_not_scalarize);
1658 JRT_END
1659
1660 methodHandle SharedRuntime::handle_ic_miss_helper(bool& caller_does_not_scalarize, TRAPS) {
1661 JavaThread* current = THREAD;
1662 ResourceMark rm(current);
1663 CallInfo call_info;
1664 Bytecodes::Code bc;
1665
1666 // receiver is null for static calls. An exception is thrown for null
1667 // receivers for non-static calls
1668 Handle receiver = find_callee_info(bc, call_info, CHECK_(methodHandle()));
1669
1670 methodHandle callee_method(current, call_info.selected_method());
1671
1672 #ifndef PRODUCT
1673 AtomicAccess::inc(&_ic_miss_ctr);
1674
1675 // Statistics & Tracing
1676 if (TraceCallFixup) {
1677 ResourceMark rm(current);
1678 tty->print("IC miss (%s) %s call to", Bytecodes::name(bc), (caller_does_not_scalarize) ? "non-scalar" : "");
1679 callee_method->print_short_name(tty);
1680 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1681 }
1682
1683 if (ICMissHistogram) {
1684 MutexLocker m(VMStatistic_lock);
1685 RegisterMap reg_map(current,
1686 RegisterMap::UpdateMap::skip,
1687 RegisterMap::ProcessFrames::include,
1688 RegisterMap::WalkContinuation::skip);
1689 frame f = current->last_frame().real_sender(®_map);// skip runtime stub
1690 // produce statistics under the lock
1691 trace_ic_miss(f.pc());
1692 }
1693 #endif
1694
1695 // install an event collector so that when a vtable stub is created the
1696 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The
1697 // event can't be posted when the stub is created as locks are held
1698 // - instead the event will be deferred until the event collector goes
1699 // out of scope.
1700 JvmtiDynamicCodeEventCollector event_collector;
1701
1702 // Update inline cache to megamorphic. Skip update if we are called from interpreted.
1703 RegisterMap reg_map(current,
1704 RegisterMap::UpdateMap::skip,
1705 RegisterMap::ProcessFrames::include,
1706 RegisterMap::WalkContinuation::skip);
1707 frame caller_frame = current->last_frame().sender(®_map);
1708 CodeBlob* cb = caller_frame.cb();
1709 nmethod* caller_nm = cb->as_nmethod();
1710 // Calls via mismatching methods are always non-scalarized
1711 if (caller_nm->is_compiled_by_c1() || call_info.resolved_method()->mismatch()) {
1712 caller_does_not_scalarize = true;
1713 }
1714
1715 CompiledICLocker ml(caller_nm);
1716 CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc());
1717 inline_cache->update(&call_info, receiver()->klass(), caller_does_not_scalarize);
1718
1719 return callee_method;
1720 }
1721
1722 //
1723 // Resets a call-site in compiled code so it will get resolved again.
1724 // This routines handles both virtual call sites, optimized virtual call
1725 // sites, and static call sites. Typically used to change a call sites
1726 // destination from compiled to interpreted.
1727 //
1728 methodHandle SharedRuntime::reresolve_call_site(bool& is_optimized, bool& caller_does_not_scalarize, TRAPS) {
1729 JavaThread* current = THREAD;
1730 ResourceMark rm(current);
1731 RegisterMap reg_map(current,
1732 RegisterMap::UpdateMap::skip,
1733 RegisterMap::ProcessFrames::include,
1734 RegisterMap::WalkContinuation::skip);
1735 frame stub_frame = current->last_frame();
1736 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1737 frame caller = stub_frame.sender(®_map);
1738 if (caller.is_compiled_frame()) {
1739 caller_does_not_scalarize = caller.cb()->as_nmethod()->is_compiled_by_c1();
1740 }
1741 assert(!caller.is_interpreted_frame(), "must be compiled");
1742
1743 // If the frame isn't a live compiled frame (i.e. deoptimized by the time we get here), no IC clearing must be done
1744 // for the caller. However, when the caller is C2 compiled and the callee a C1 or C2 compiled method, then we still
1745 // need to figure out whether it was an optimized virtual call with an inline type receiver. Otherwise, we end up
1746 // using the wrong method entry point and accidentally skip the buffering of the receiver.
1747 methodHandle callee_method = find_callee_method(caller_does_not_scalarize, CHECK_(methodHandle()));
1748 const bool caller_is_compiled_and_not_deoptimized = caller.is_compiled_frame() && !caller.is_deoptimized_frame();
1749 const bool caller_is_continuation_enter_intrinsic =
1750 caller.is_native_frame() && caller.cb()->as_nmethod()->method()->is_continuation_enter_intrinsic();
1751 const bool do_IC_clearing = caller_is_compiled_and_not_deoptimized || caller_is_continuation_enter_intrinsic;
1752
1753 const bool callee_compiled_with_scalarized_receiver = callee_method->has_compiled_code() &&
1754 !callee_method()->is_static() &&
1755 callee_method()->is_scalarized_arg(0);
1756 const bool compute_is_optimized = !caller_does_not_scalarize && callee_compiled_with_scalarized_receiver;
1757
1758 if (do_IC_clearing || compute_is_optimized) {
1759 address pc = caller.pc();
1760
1761 nmethod* caller_nm = CodeCache::find_nmethod(pc);
1762 assert(caller_nm != nullptr, "did not find caller nmethod");
1763
1764 // Default call_addr is the location of the "basic" call.
1765 // Determine the address of the call we a reresolving. With
1766 // Inline Caches we will always find a recognizable call.
1767 // With Inline Caches disabled we may or may not find a
1768 // recognizable call. We will always find a call for static
1769 // calls and for optimized virtual calls. For vanilla virtual
1770 // calls it depends on the state of the UseInlineCaches switch.
1771 //
1772 // With Inline Caches disabled we can get here for a virtual call
1773 // for two reasons:
1774 // 1 - calling an abstract method. The vtable for abstract methods
1775 // will run us thru handle_wrong_method and we will eventually
1776 // end up in the interpreter to throw the ame.
1777 // 2 - a racing deoptimization. We could be doing a vanilla vtable
1778 // call and between the time we fetch the entry address and
1779 // we jump to it the target gets deoptimized. Similar to 1
1780 // we will wind up in the interprter (thru a c2i with c2).
1781 //
1782 CompiledICLocker ml(caller_nm);
1783 address call_addr = caller_nm->call_instruction_address(pc);
1784
1785 if (call_addr != nullptr) {
1786 // On x86 the logic for finding a call instruction is blindly checking for a call opcode 5
1787 // bytes back in the instruction stream so we must also check for reloc info.
1788 RelocIterator iter(caller_nm, call_addr, call_addr+1);
1789 bool ret = iter.next(); // Get item
1790 if (ret) {
1791 is_optimized = false;
1792 switch (iter.type()) {
1793 case relocInfo::static_call_type:
1794 assert(callee_method->is_static(), "must be");
1795 case relocInfo::opt_virtual_call_type: {
1796 is_optimized = (iter.type() == relocInfo::opt_virtual_call_type);
1797 if (do_IC_clearing) {
1798 CompiledDirectCall* cdc = CompiledDirectCall::at(call_addr);
1799 cdc->set_to_clean();
1800 }
1801 break;
1802 }
1803
1804 case relocInfo::virtual_call_type: {
1805 if (do_IC_clearing) {
1806 // compiled, dispatched call (which used to call an interpreted method)
1807 CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr);
1808 inline_cache->set_to_clean();
1809 }
1810 break;
1811 }
1812 default:
1813 break;
1814 }
1815 }
1816 }
1817 }
1818
1819 #ifndef PRODUCT
1820 AtomicAccess::inc(&_wrong_method_ctr);
1821
1822 if (TraceCallFixup) {
1823 ResourceMark rm(current);
1824 tty->print("handle_wrong_method reresolving %s call to", (caller_does_not_scalarize) ? "non-scalar" : "");
1825 callee_method->print_short_name(tty);
1826 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1827 }
1828 #endif
1829
1830 return callee_method;
1831 }
1832
1833 address SharedRuntime::handle_unsafe_access(JavaThread* thread, address next_pc) {
1834 // The faulting unsafe accesses should be changed to throw the error
1835 // synchronously instead. Meanwhile the faulting instruction will be
1836 // skipped over (effectively turning it into a no-op) and an
1837 // asynchronous exception will be raised which the thread will
1838 // handle at a later point. If the instruction is a load it will
1839 // return garbage.
1840
1841 // Request an async exception.
1842 thread->set_pending_unsafe_access_error();
1843
1844 // Return address of next instruction to execute.
1845 return next_pc;
1846 }
1847
1848 #ifdef ASSERT
1849 void SharedRuntime::check_member_name_argument_is_last_argument(const methodHandle& method,
1850 const BasicType* sig_bt,
1851 const VMRegPair* regs) {
1852 ResourceMark rm;
1853 const int total_args_passed = method->size_of_parameters();
1854 const VMRegPair* regs_with_member_name = regs;
1855 VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1);
1856
1857 const int member_arg_pos = total_args_passed - 1;
1858 assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob");
1859 assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object");
1860
1861 java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1);
1862
1863 for (int i = 0; i < member_arg_pos; i++) {
1864 VMReg a = regs_with_member_name[i].first();
1865 VMReg b = regs_without_member_name[i].first();
1866 assert(a->value() == b->value(), "register allocation mismatch: a= %d, b= %d", a->value(), b->value());
1867 }
1868 assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg");
1869 }
1870 #endif
1871
1872 // ---------------------------------------------------------------------------
1873 // We are calling the interpreter via a c2i. Normally this would mean that
1874 // we were called by a compiled method. However we could have lost a race
1875 // where we went int -> i2c -> c2i and so the caller could in fact be
1876 // interpreted. If the caller is compiled we attempt to patch the caller
1877 // so he no longer calls into the interpreter.
1878 JRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc))
1879 AARCH64_PORT_ONLY(assert(pauth_ptr_is_raw(caller_pc), "should be raw"));
1880
1881 // It's possible that deoptimization can occur at a call site which hasn't
1882 // been resolved yet, in which case this function will be called from
1883 // an nmethod that has been patched for deopt and we can ignore the
1884 // request for a fixup.
1885 // Also it is possible that we lost a race in that from_compiled_entry
1886 // is now back to the i2c in that case we don't need to patch and if
1887 // we did we'd leap into space because the callsite needs to use
1888 // "to interpreter" stub in order to load up the Method*. Don't
1889 // ask me how I know this...
1890
1891 // Result from nmethod::is_unloading is not stable across safepoints.
1892 NoSafepointVerifier nsv;
1893
1894 nmethod* callee = method->code();
1895 if (callee == nullptr) {
1896 return;
1897 }
1898
1899 // write lock needed because we might patch call site by set_to_clean()
1900 // and is_unloading() can modify nmethod's state
1901 MACOS_AARCH64_ONLY(ThreadWXEnable __wx(WXWrite, JavaThread::current()));
1902
1903 CodeBlob* cb = CodeCache::find_blob(caller_pc);
1904 if (cb == nullptr || !cb->is_nmethod() || !callee->is_in_use() || callee->is_unloading()) {
1905 return;
1906 }
1907
1908 // The check above makes sure this is an nmethod.
1909 nmethod* caller = cb->as_nmethod();
1910
1911 // Get the return PC for the passed caller PC.
1912 address return_pc = caller_pc + frame::pc_return_offset;
1913
1914 if (!caller->is_in_use() || !NativeCall::is_call_before(return_pc)) {
1915 return;
1916 }
1917
1918 // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1919 CompiledICLocker ic_locker(caller);
1920 ResourceMark rm;
1921
1922 // If we got here through a static call or opt_virtual call, then we know where the
1923 // call address would be; let's peek at it
1924 address callsite_addr = (address)nativeCall_before(return_pc);
1925 RelocIterator iter(caller, callsite_addr, callsite_addr + 1);
1926 if (!iter.next()) {
1927 // No reloc entry found; not a static or optimized virtual call
1928 return;
1929 }
1930
1931 relocInfo::relocType type = iter.reloc()->type();
1932 if (type != relocInfo::static_call_type &&
1933 type != relocInfo::opt_virtual_call_type) {
1934 return;
1935 }
1936
1937 CompiledDirectCall* callsite = CompiledDirectCall::before(return_pc);
1938 callsite->set_to_clean();
1939 JRT_END
1940
1941
1942 // same as JVM_Arraycopy, but called directly from compiled code
1943 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos,
1944 oopDesc* dest, jint dest_pos,
1945 jint length,
1946 JavaThread* current)) {
1947 #ifndef PRODUCT
1948 _slow_array_copy_ctr++;
1949 #endif
1950 // Check if we have null pointers
1951 if (src == nullptr || dest == nullptr) {
1952 THROW(vmSymbols::java_lang_NullPointerException());
1953 }
1954 // Do the copy. The casts to arrayOop are necessary to the copy_array API,
1955 // even though the copy_array API also performs dynamic checks to ensure
1956 // that src and dest are truly arrays (and are conformable).
1957 // The copy_array mechanism is awkward and could be removed, but
1958 // the compilers don't call this function except as a last resort,
1959 // so it probably doesn't matter.
1960 src->klass()->copy_array((arrayOopDesc*)src, src_pos,
1961 (arrayOopDesc*)dest, dest_pos,
1962 length, current);
1963 }
1964 JRT_END
1965
1966 // The caller of generate_class_cast_message() (or one of its callers)
1967 // must use a ResourceMark in order to correctly free the result.
1968 char* SharedRuntime::generate_class_cast_message(
1969 JavaThread* thread, Klass* caster_klass) {
1970
1971 // Get target class name from the checkcast instruction
1972 vframeStream vfst(thread, true);
1973 assert(!vfst.at_end(), "Java frame must exist");
1974 Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci()));
1975 constantPoolHandle cpool(thread, vfst.method()->constants());
1976 Klass* target_klass = ConstantPool::klass_at_if_loaded(cpool, cc.index());
1977 Symbol* target_klass_name = nullptr;
1978 if (target_klass == nullptr) {
1979 // This klass should be resolved, but just in case, get the name in the klass slot.
1980 target_klass_name = cpool->klass_name_at(cc.index());
1981 }
1982 return generate_class_cast_message(caster_klass, target_klass, target_klass_name);
1983 }
1984
1985
1986 // The caller of generate_class_cast_message() (or one of its callers)
1987 // must use a ResourceMark in order to correctly free the result.
1988 char* SharedRuntime::generate_class_cast_message(
1989 Klass* caster_klass, Klass* target_klass, Symbol* target_klass_name) {
1990 const char* caster_name = caster_klass->external_name();
1991
1992 assert(target_klass != nullptr || target_klass_name != nullptr, "one must be provided");
1993 const char* target_name = target_klass == nullptr ? target_klass_name->as_klass_external_name() :
1994 target_klass->external_name();
1995
1996 size_t msglen = strlen(caster_name) + strlen("class ") + strlen(" cannot be cast to class ") + strlen(target_name) + 1;
1997
1998 const char* caster_klass_description = "";
1999 const char* target_klass_description = "";
2000 const char* klass_separator = "";
2001 if (target_klass != nullptr && caster_klass->module() == target_klass->module()) {
2002 caster_klass_description = caster_klass->joint_in_module_of_loader(target_klass);
2003 } else {
2004 caster_klass_description = caster_klass->class_in_module_of_loader();
2005 target_klass_description = (target_klass != nullptr) ? target_klass->class_in_module_of_loader() : "";
2006 klass_separator = (target_klass != nullptr) ? "; " : "";
2007 }
2008
2009 // add 3 for parenthesis and preceding space
2010 msglen += strlen(caster_klass_description) + strlen(target_klass_description) + strlen(klass_separator) + 3;
2011
2012 char* message = NEW_RESOURCE_ARRAY_RETURN_NULL(char, msglen);
2013 if (message == nullptr) {
2014 // Shouldn't happen, but don't cause even more problems if it does
2015 message = const_cast<char*>(caster_klass->external_name());
2016 } else {
2017 jio_snprintf(message,
2018 msglen,
2019 "class %s cannot be cast to class %s (%s%s%s)",
2020 caster_name,
2021 target_name,
2022 caster_klass_description,
2023 klass_separator,
2024 target_klass_description
2025 );
2026 }
2027 return message;
2028 }
2029
2030 char* SharedRuntime::generate_identity_exception_message(JavaThread* current, Klass* klass) {
2031 assert(klass->is_inline_klass(), "Must be a concrete value class");
2032 const char* desc = "Cannot synchronize on an instance of value class ";
2033 const char* className = klass->external_name();
2034 size_t msglen = strlen(desc) + strlen(className) + 1;
2035 char* message = NEW_RESOURCE_ARRAY(char, msglen);
2036 if (nullptr == message) {
2037 // Out of memory: can't create detailed error message
2038 message = const_cast<char*>(klass->external_name());
2039 } else {
2040 jio_snprintf(message, msglen, "%s%s", desc, className);
2041 }
2042 return message;
2043 }
2044
2045 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
2046 (void) JavaThread::current()->stack_overflow_state()->reguard_stack();
2047 JRT_END
2048
2049 void SharedRuntime::monitor_enter_helper(oopDesc* obj, BasicLock* lock, JavaThread* current) {
2050 if (!SafepointSynchronize::is_synchronizing()) {
2051 // Only try quick_enter() if we're not trying to reach a safepoint
2052 // so that the calling thread reaches the safepoint more quickly.
2053 if (ObjectSynchronizer::quick_enter(obj, lock, current)) {
2054 return;
2055 }
2056 }
2057 // NO_ASYNC required because an async exception on the state transition destructor
2058 // would leave you with the lock held and it would never be released.
2059 // The normal monitorenter NullPointerException is thrown without acquiring a lock
2060 // and the model is that an exception implies the method failed.
2061 JRT_BLOCK_NO_ASYNC
2062 Handle h_obj(THREAD, obj);
2063 ObjectSynchronizer::enter(h_obj, lock, current);
2064 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
2065 JRT_BLOCK_END
2066 }
2067
2068 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
2069 JRT_BLOCK_ENTRY(void, SharedRuntime::complete_monitor_locking_C(oopDesc* obj, BasicLock* lock, JavaThread* current))
2070 SharedRuntime::monitor_enter_helper(obj, lock, current);
2071 JRT_END
2072
2073 void SharedRuntime::monitor_exit_helper(oopDesc* obj, BasicLock* lock, JavaThread* current) {
2074 assert(JavaThread::current() == current, "invariant");
2075 // Exit must be non-blocking, and therefore no exceptions can be thrown.
2076 ExceptionMark em(current);
2077
2078 // Check if C2_MacroAssembler::fast_unlock() or
2079 // C2_MacroAssembler::fast_unlock() unlocked an inflated
2080 // monitor before going slow path. Since there is no safepoint
2081 // polling when calling into the VM, we can be sure that the monitor
2082 // hasn't been deallocated.
2083 ObjectMonitor* m = current->unlocked_inflated_monitor();
2084 if (m != nullptr) {
2085 assert(!m->has_owner(current), "must be");
2086 current->clear_unlocked_inflated_monitor();
2087
2088 // We need to reacquire the lock before we can call ObjectSynchronizer::exit().
2089 if (!m->try_enter(current, /*check_for_recursion*/ false)) {
2090 // Some other thread acquired the lock (or the monitor was
2091 // deflated). Either way we are done.
2092 return;
2093 }
2094 }
2095
2096 // The object could become unlocked through a JNI call, which we have no other checks for.
2097 // Give a fatal message if CheckJNICalls. Otherwise we ignore it.
2098 if (obj->is_unlocked()) {
2099 if (CheckJNICalls) {
2100 fatal("Object has been unlocked by JNI");
2101 }
2102 return;
2103 }
2104 ObjectSynchronizer::exit(obj, lock, current);
2105 }
2106
2107 // Handles the uncommon cases of monitor unlocking in compiled code
2108 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* obj, BasicLock* lock, JavaThread* current))
2109 assert(current == JavaThread::current(), "pre-condition");
2110 SharedRuntime::monitor_exit_helper(obj, lock, current);
2111 JRT_END
2112
2113 #ifndef PRODUCT
2114
2115 void SharedRuntime::print_statistics() {
2116 ttyLocker ttyl;
2117 if (xtty != nullptr) xtty->head("statistics type='SharedRuntime'");
2118
2119 SharedRuntime::print_ic_miss_histogram();
2120
2121 // Dump the JRT_ENTRY counters
2122 if (_new_instance_ctr) tty->print_cr("%5u new instance requires GC", _new_instance_ctr);
2123 if (_new_array_ctr) tty->print_cr("%5u new array requires GC", _new_array_ctr);
2124 if (_multi2_ctr) tty->print_cr("%5u multianewarray 2 dim", _multi2_ctr);
2125 if (_multi3_ctr) tty->print_cr("%5u multianewarray 3 dim", _multi3_ctr);
2126 if (_multi4_ctr) tty->print_cr("%5u multianewarray 4 dim", _multi4_ctr);
2127 if (_multi5_ctr) tty->print_cr("%5u multianewarray 5 dim", _multi5_ctr);
2128
2129 tty->print_cr("%5u inline cache miss in compiled", _ic_miss_ctr);
2130 tty->print_cr("%5u wrong method", _wrong_method_ctr);
2131 tty->print_cr("%5u unresolved static call site", _resolve_static_ctr);
2132 tty->print_cr("%5u unresolved virtual call site", _resolve_virtual_ctr);
2133 tty->print_cr("%5u unresolved opt virtual call site", _resolve_opt_virtual_ctr);
2134
2135 if (_mon_enter_stub_ctr) tty->print_cr("%5u monitor enter stub", _mon_enter_stub_ctr);
2136 if (_mon_exit_stub_ctr) tty->print_cr("%5u monitor exit stub", _mon_exit_stub_ctr);
2137 if (_mon_enter_ctr) tty->print_cr("%5u monitor enter slow", _mon_enter_ctr);
2138 if (_mon_exit_ctr) tty->print_cr("%5u monitor exit slow", _mon_exit_ctr);
2139 if (_partial_subtype_ctr) tty->print_cr("%5u slow partial subtype", _partial_subtype_ctr);
2140 if (_jbyte_array_copy_ctr) tty->print_cr("%5u byte array copies", _jbyte_array_copy_ctr);
2141 if (_jshort_array_copy_ctr) tty->print_cr("%5u short array copies", _jshort_array_copy_ctr);
2142 if (_jint_array_copy_ctr) tty->print_cr("%5u int array copies", _jint_array_copy_ctr);
2143 if (_jlong_array_copy_ctr) tty->print_cr("%5u long array copies", _jlong_array_copy_ctr);
2144 if (_oop_array_copy_ctr) tty->print_cr("%5u oop array copies", _oop_array_copy_ctr);
2145 if (_checkcast_array_copy_ctr) tty->print_cr("%5u checkcast array copies", _checkcast_array_copy_ctr);
2146 if (_unsafe_array_copy_ctr) tty->print_cr("%5u unsafe array copies", _unsafe_array_copy_ctr);
2147 if (_generic_array_copy_ctr) tty->print_cr("%5u generic array copies", _generic_array_copy_ctr);
2148 if (_slow_array_copy_ctr) tty->print_cr("%5u slow array copies", _slow_array_copy_ctr);
2149 if (_find_handler_ctr) tty->print_cr("%5u find exception handler", _find_handler_ctr);
2150 if (_rethrow_ctr) tty->print_cr("%5u rethrow handler", _rethrow_ctr);
2151 if (_unsafe_set_memory_ctr) tty->print_cr("%5u unsafe set memorys", _unsafe_set_memory_ctr);
2152
2153 AdapterHandlerLibrary::print_statistics();
2154
2155 if (xtty != nullptr) xtty->tail("statistics");
2156 }
2157
2158 inline double percent(int64_t x, int64_t y) {
2159 return 100.0 * (double)x / (double)MAX2(y, (int64_t)1);
2160 }
2161
2162 class MethodArityHistogram {
2163 public:
2164 enum { MAX_ARITY = 256 };
2165 private:
2166 static uint64_t _arity_histogram[MAX_ARITY]; // histogram of #args
2167 static uint64_t _size_histogram[MAX_ARITY]; // histogram of arg size in words
2168 static uint64_t _total_compiled_calls;
2169 static uint64_t _max_compiled_calls_per_method;
2170 static int _max_arity; // max. arity seen
2171 static int _max_size; // max. arg size seen
2172
2173 static void add_method_to_histogram(nmethod* nm) {
2174 Method* method = (nm == nullptr) ? nullptr : nm->method();
2175 if (method != nullptr) {
2176 ArgumentCount args(method->signature());
2177 int arity = args.size() + (method->is_static() ? 0 : 1);
2178 int argsize = method->size_of_parameters();
2179 arity = MIN2(arity, MAX_ARITY-1);
2180 argsize = MIN2(argsize, MAX_ARITY-1);
2181 uint64_t count = (uint64_t)method->compiled_invocation_count();
2182 _max_compiled_calls_per_method = count > _max_compiled_calls_per_method ? count : _max_compiled_calls_per_method;
2183 _total_compiled_calls += count;
2184 _arity_histogram[arity] += count;
2185 _size_histogram[argsize] += count;
2186 _max_arity = MAX2(_max_arity, arity);
2187 _max_size = MAX2(_max_size, argsize);
2188 }
2189 }
2190
2191 void print_histogram_helper(int n, uint64_t* histo, const char* name) {
2192 const int N = MIN2(9, n);
2193 double sum = 0;
2194 double weighted_sum = 0;
2195 for (int i = 0; i <= n; i++) { sum += (double)histo[i]; weighted_sum += (double)(i*histo[i]); }
2196 if (sum >= 1) { // prevent divide by zero or divide overflow
2197 double rest = sum;
2198 double percent = sum / 100;
2199 for (int i = 0; i <= N; i++) {
2200 rest -= (double)histo[i];
2201 tty->print_cr("%4d: " UINT64_FORMAT_W(12) " (%5.1f%%)", i, histo[i], (double)histo[i] / percent);
2202 }
2203 tty->print_cr("rest: " INT64_FORMAT_W(12) " (%5.1f%%)", (int64_t)rest, rest / percent);
2204 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
2205 tty->print_cr("(total # of compiled calls = " INT64_FORMAT_W(14) ")", _total_compiled_calls);
2206 tty->print_cr("(max # of compiled calls = " INT64_FORMAT_W(14) ")", _max_compiled_calls_per_method);
2207 } else {
2208 tty->print_cr("Histogram generation failed for %s. n = %d, sum = %7.5f", name, n, sum);
2209 }
2210 }
2211
2212 void print_histogram() {
2213 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2214 print_histogram_helper(_max_arity, _arity_histogram, "arity");
2215 tty->print_cr("\nHistogram of parameter block size (in words, incl. rcvr):");
2216 print_histogram_helper(_max_size, _size_histogram, "size");
2217 tty->cr();
2218 }
2219
2220 public:
2221 MethodArityHistogram() {
2222 // Take the Compile_lock to protect against changes in the CodeBlob structures
2223 MutexLocker mu1(Compile_lock, Mutex::_safepoint_check_flag);
2224 // Take the CodeCache_lock to protect against changes in the CodeHeap structure
2225 MutexLocker mu2(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2226 _max_arity = _max_size = 0;
2227 _total_compiled_calls = 0;
2228 _max_compiled_calls_per_method = 0;
2229 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram[i] = 0;
2230 CodeCache::nmethods_do(add_method_to_histogram);
2231 print_histogram();
2232 }
2233 };
2234
2235 uint64_t MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
2236 uint64_t MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
2237 uint64_t MethodArityHistogram::_total_compiled_calls;
2238 uint64_t MethodArityHistogram::_max_compiled_calls_per_method;
2239 int MethodArityHistogram::_max_arity;
2240 int MethodArityHistogram::_max_size;
2241
2242 void SharedRuntime::print_call_statistics(uint64_t comp_total) {
2243 tty->print_cr("Calls from compiled code:");
2244 int64_t total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
2245 int64_t mono_c = _nof_normal_calls - _nof_megamorphic_calls;
2246 int64_t mono_i = _nof_interface_calls;
2247 tty->print_cr("\t" INT64_FORMAT_W(12) " (100%%) total non-inlined ", total);
2248 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.1f%%) |- virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total));
2249 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.0f%%) | |- inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
2250 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.0f%%) | |- monomorphic ", mono_c, percent(mono_c, _nof_normal_calls));
2251 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.0f%%) | |- megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
2252 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.1f%%) |- interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total));
2253 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.0f%%) | |- inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
2254 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.0f%%) | |- monomorphic ", mono_i, percent(mono_i, _nof_interface_calls));
2255 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.1f%%) |- static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
2256 tty->print_cr("\t" INT64_FORMAT_W(12) " (%4.0f%%) | |- inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
2257 tty->cr();
2258 tty->print_cr("Note 1: counter updates are not MT-safe.");
2259 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
2260 tty->print_cr(" %% in nested categories are relative to their category");
2261 tty->print_cr(" (and thus add up to more than 100%% with inlining)");
2262 tty->cr();
2263
2264 MethodArityHistogram h;
2265 }
2266 #endif
2267
2268 #ifndef PRODUCT
2269 static int _lookups; // number of calls to lookup
2270 static int _equals; // number of buckets checked with matching hash
2271 static int _archived_hits; // number of successful lookups in archived table
2272 static int _runtime_hits; // number of successful lookups in runtime table
2273 #endif
2274
2275 // A simple wrapper class around the calling convention information
2276 // that allows sharing of adapters for the same calling convention.
2277 class AdapterFingerPrint : public MetaspaceObj {
2278 public:
2279 class Element {
2280 private:
2281 // The highest byte is the type of the argument. The remaining bytes contain the offset of the
2282 // field if it is flattened in the calling convention, -1 otherwise.
2283 juint _payload;
2284
2285 static constexpr int offset_bit_width = 24;
2286 static constexpr juint offset_bit_mask = (1 << offset_bit_width) - 1;
2287 public:
2288 Element(BasicType bt, int offset) : _payload((static_cast<juint>(bt) << offset_bit_width) | (juint(offset) & offset_bit_mask)) {
2289 assert(offset >= -1 && offset < jint(offset_bit_mask), "invalid offset %d", offset);
2290 }
2291
2292 BasicType bt() const {
2293 return static_cast<BasicType>(_payload >> offset_bit_width);
2294 }
2295
2296 int offset() const {
2297 juint res = _payload & offset_bit_mask;
2298 return res == offset_bit_mask ? -1 : res;
2299 }
2300
2301 juint hash() const {
2302 return _payload;
2303 }
2304
2305 bool operator!=(const Element& other) const {
2306 return _payload != other._payload;
2307 }
2308 };
2309
2310 private:
2311 const bool _has_ro_adapter;
2312 const int _length;
2313
2314 static int data_offset() { return sizeof(AdapterFingerPrint); }
2315 Element* data_pointer() {
2316 return reinterpret_cast<Element*>(reinterpret_cast<address>(this) + data_offset());
2317 }
2318
2319 const Element& element_at(int index) {
2320 assert(index < length(), "index %d out of bounds for length %d", index, length());
2321 Element* data = data_pointer();
2322 return data[index];
2323 }
2324
2325 // Private construtor. Use allocate() to get an instance.
2326 AdapterFingerPrint(const GrowableArray<SigEntry>* sig, bool has_ro_adapter)
2327 : _has_ro_adapter(has_ro_adapter), _length(total_args_passed_in_sig(sig)) {
2328 Element* data = data_pointer();
2329 BasicType prev_bt = T_ILLEGAL;
2330 int vt_count = 0;
2331 for (int index = 0; index < _length; index++) {
2332 const SigEntry& sig_entry = sig->at(index);
2333 BasicType bt = sig_entry._bt;
2334 if (bt == T_METADATA) {
2335 // Found start of inline type in signature
2336 assert(InlineTypePassFieldsAsArgs, "unexpected start of inline type");
2337 vt_count++;
2338 } else if (bt == T_VOID && prev_bt != T_LONG && prev_bt != T_DOUBLE) {
2339 // Found end of inline type in signature
2340 assert(InlineTypePassFieldsAsArgs, "unexpected end of inline type");
2341 vt_count--;
2342 assert(vt_count >= 0, "invalid vt_count");
2343 } else if (vt_count == 0) {
2344 // Widen fields that are not part of a scalarized inline type argument
2345 assert(sig_entry._offset == -1, "invalid offset for argument that is not a flattened field %d", sig_entry._offset);
2346 bt = adapter_encoding(bt);
2347 }
2348
2349 ::new(&data[index]) Element(bt, sig_entry._offset);
2350 prev_bt = bt;
2351 }
2352 assert(vt_count == 0, "invalid vt_count");
2353 }
2354
2355 // Call deallocate instead
2356 ~AdapterFingerPrint() {
2357 ShouldNotCallThis();
2358 }
2359
2360 static int total_args_passed_in_sig(const GrowableArray<SigEntry>* sig) {
2361 return (sig != nullptr) ? sig->length() : 0;
2362 }
2363
2364 static int compute_size_in_words(int len) {
2365 return (int)heap_word_size(sizeof(AdapterFingerPrint) + (len * sizeof(Element)));
2366 }
2367
2368 // Remap BasicTypes that are handled equivalently by the adapters.
2369 // These are correct for the current system but someday it might be
2370 // necessary to make this mapping platform dependent.
2371 static BasicType adapter_encoding(BasicType in) {
2372 switch (in) {
2373 case T_BOOLEAN:
2374 case T_BYTE:
2375 case T_SHORT:
2376 case T_CHAR:
2377 // They are all promoted to T_INT in the calling convention
2378 return T_INT;
2379
2380 case T_OBJECT:
2381 case T_ARRAY:
2382 // In other words, we assume that any register good enough for
2383 // an int or long is good enough for a managed pointer.
2384 #ifdef _LP64
2385 return T_LONG;
2386 #else
2387 return T_INT;
2388 #endif
2389
2390 case T_INT:
2391 case T_LONG:
2392 case T_FLOAT:
2393 case T_DOUBLE:
2394 case T_VOID:
2395 return in;
2396
2397 default:
2398 ShouldNotReachHere();
2399 return T_CONFLICT;
2400 }
2401 }
2402
2403 void* operator new(size_t size, size_t fp_size) throw() {
2404 assert(fp_size >= size, "sanity check");
2405 void* p = AllocateHeap(fp_size, mtCode);
2406 memset(p, 0, fp_size);
2407 return p;
2408 }
2409
2410 public:
2411 template<typename Function>
2412 void iterate_args(Function function) {
2413 for (int i = 0; i < length(); i++) {
2414 function(element_at(i));
2415 }
2416 }
2417
2418 static AdapterFingerPrint* allocate(const GrowableArray<SigEntry>* sig, bool has_ro_adapter = false) {
2419 int len = total_args_passed_in_sig(sig);
2420 int size_in_bytes = BytesPerWord * compute_size_in_words(len);
2421 AdapterFingerPrint* afp = new (size_in_bytes) AdapterFingerPrint(sig, has_ro_adapter);
2422 assert((afp->size() * BytesPerWord) == size_in_bytes, "should match");
2423 return afp;
2424 }
2425
2426 static void deallocate(AdapterFingerPrint* fp) {
2427 FreeHeap(fp);
2428 }
2429
2430 bool has_ro_adapter() const {
2431 return _has_ro_adapter;
2432 }
2433
2434 int length() const {
2435 return _length;
2436 }
2437
2438 unsigned int compute_hash() {
2439 int hash = 0;
2440 for (int i = 0; i < length(); i++) {
2441 const Element& v = element_at(i);
2442 //Add arithmetic operation to the hash, like +3 to improve hashing
2443 hash = ((hash << 8) ^ v.hash() ^ (hash >> 5)) + 3;
2444 }
2445 return (unsigned int)hash;
2446 }
2447
2448 const char* as_string() {
2449 stringStream st;
2450 st.print("{");
2451 if (_has_ro_adapter) {
2452 st.print("has_ro_adapter");
2453 } else {
2454 st.print("no_ro_adapter");
2455 }
2456 for (int i = 0; i < length(); i++) {
2457 st.print(", ");
2458 const Element& elem = element_at(i);
2459 st.print("{%s, %d}", type2name(elem.bt()), elem.offset());
2460 }
2461 st.print("}");
2462 return st.as_string();
2463 }
2464
2465 const char* as_basic_args_string() {
2466 stringStream st;
2467 bool long_prev = false;
2468 iterate_args([&] (const Element& arg) {
2469 if (long_prev) {
2470 long_prev = false;
2471 if (arg.bt() == T_VOID) {
2472 st.print("J");
2473 } else {
2474 st.print("L");
2475 }
2476 }
2477 if (arg.bt() == T_LONG) {
2478 long_prev = true;
2479 } else if (arg.bt() != T_VOID) {
2480 st.print("%c", type2char(arg.bt()));
2481 }
2482 });
2483 if (long_prev) {
2484 st.print("L");
2485 }
2486 return st.as_string();
2487 }
2488
2489 bool equals(AdapterFingerPrint* other) {
2490 if (other->_has_ro_adapter != _has_ro_adapter) {
2491 return false;
2492 } else if (other->_length != _length) {
2493 return false;
2494 } else {
2495 for (int i = 0; i < _length; i++) {
2496 if (element_at(i) != other->element_at(i)) {
2497 return false;
2498 }
2499 }
2500 }
2501 return true;
2502 }
2503
2504 // methods required by virtue of being a MetaspaceObj
2505 void metaspace_pointers_do(MetaspaceClosure* it) { return; /* nothing to do here */ }
2506 int size() const { return compute_size_in_words(_length); }
2507 MetaspaceObj::Type type() const { return AdapterFingerPrintType; }
2508
2509 static bool equals(AdapterFingerPrint* const& fp1, AdapterFingerPrint* const& fp2) {
2510 NOT_PRODUCT(_equals++);
2511 return fp1->equals(fp2);
2512 }
2513
2514 static unsigned int compute_hash(AdapterFingerPrint* const& fp) {
2515 return fp->compute_hash();
2516 }
2517 };
2518
2519 #if INCLUDE_CDS
2520 static inline bool adapter_fp_equals_compact_hashtable_entry(AdapterHandlerEntry* entry, AdapterFingerPrint* fp, int len_unused) {
2521 return AdapterFingerPrint::equals(entry->fingerprint(), fp);
2522 }
2523
2524 class ArchivedAdapterTable : public OffsetCompactHashtable<
2525 AdapterFingerPrint*,
2526 AdapterHandlerEntry*,
2527 adapter_fp_equals_compact_hashtable_entry> {};
2528 #endif // INCLUDE_CDS
2529
2530 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries
2531 using AdapterHandlerTable = HashTable<AdapterFingerPrint*, AdapterHandlerEntry*, 293,
2532 AnyObj::C_HEAP, mtCode,
2533 AdapterFingerPrint::compute_hash,
2534 AdapterFingerPrint::equals>;
2535 static AdapterHandlerTable* _adapter_handler_table;
2536 static GrowableArray<AdapterHandlerEntry*>* _adapter_handler_list = nullptr;
2537
2538 // Find a entry with the same fingerprint if it exists
2539 AdapterHandlerEntry* AdapterHandlerLibrary::lookup(const GrowableArray<SigEntry>* sig, bool has_ro_adapter) {
2540 NOT_PRODUCT(_lookups++);
2541 assert_lock_strong(AdapterHandlerLibrary_lock);
2542 AdapterFingerPrint* fp = AdapterFingerPrint::allocate(sig, has_ro_adapter);
2543 AdapterHandlerEntry* entry = nullptr;
2544 #if INCLUDE_CDS
2545 // if we are building the archive then the archived adapter table is
2546 // not valid and we need to use the ones added to the runtime table
2547 if (AOTCodeCache::is_using_adapter()) {
2548 // Search archived table first. It is read-only table so can be searched without lock
2549 entry = _aot_adapter_handler_table.lookup(fp, fp->compute_hash(), 0 /* unused */);
2550 #ifndef PRODUCT
2551 if (entry != nullptr) {
2552 _archived_hits++;
2553 }
2554 #endif
2555 }
2556 #endif // INCLUDE_CDS
2557 if (entry == nullptr) {
2558 assert_lock_strong(AdapterHandlerLibrary_lock);
2559 AdapterHandlerEntry** entry_p = _adapter_handler_table->get(fp);
2560 if (entry_p != nullptr) {
2561 entry = *entry_p;
2562 assert(entry->fingerprint()->equals(fp), "fingerprint mismatch key fp %s %s (hash=%d) != found fp %s %s (hash=%d)",
2563 entry->fingerprint()->as_basic_args_string(), entry->fingerprint()->as_string(), entry->fingerprint()->compute_hash(),
2564 fp->as_basic_args_string(), fp->as_string(), fp->compute_hash());
2565 #ifndef PRODUCT
2566 _runtime_hits++;
2567 #endif
2568 }
2569 }
2570 AdapterFingerPrint::deallocate(fp);
2571 return entry;
2572 }
2573
2574 #ifndef PRODUCT
2575 static void print_table_statistics() {
2576 auto size = [&] (AdapterFingerPrint* key, AdapterHandlerEntry* a) {
2577 return sizeof(*key) + sizeof(*a);
2578 };
2579 TableStatistics ts = _adapter_handler_table->statistics_calculate(size);
2580 ts.print(tty, "AdapterHandlerTable");
2581 tty->print_cr("AdapterHandlerTable (table_size=%d, entries=%d)",
2582 _adapter_handler_table->table_size(), _adapter_handler_table->number_of_entries());
2583 int total_hits = _archived_hits + _runtime_hits;
2584 tty->print_cr("AdapterHandlerTable: lookups %d equals %d hits %d (archived=%d+runtime=%d)",
2585 _lookups, _equals, total_hits, _archived_hits, _runtime_hits);
2586 }
2587 #endif
2588
2589 // ---------------------------------------------------------------------------
2590 // Implementation of AdapterHandlerLibrary
2591 AdapterHandlerEntry* AdapterHandlerLibrary::_no_arg_handler = nullptr;
2592 AdapterHandlerEntry* AdapterHandlerLibrary::_int_arg_handler = nullptr;
2593 AdapterHandlerEntry* AdapterHandlerLibrary::_obj_arg_handler = nullptr;
2594 AdapterHandlerEntry* AdapterHandlerLibrary::_obj_int_arg_handler = nullptr;
2595 AdapterHandlerEntry* AdapterHandlerLibrary::_obj_obj_arg_handler = nullptr;
2596 #if INCLUDE_CDS
2597 ArchivedAdapterTable AdapterHandlerLibrary::_aot_adapter_handler_table;
2598 #endif // INCLUDE_CDS
2599 static const int AdapterHandlerLibrary_size = 48*K;
2600 BufferBlob* AdapterHandlerLibrary::_buffer = nullptr;
2601 volatile uint AdapterHandlerLibrary::_id_counter = 0;
2602
2603 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
2604 assert(_buffer != nullptr, "should be initialized");
2605 return _buffer;
2606 }
2607
2608 static void post_adapter_creation(const AdapterHandlerEntry* entry) {
2609 if (Forte::is_enabled() || JvmtiExport::should_post_dynamic_code_generated()) {
2610 AdapterBlob* adapter_blob = entry->adapter_blob();
2611 char blob_id[256];
2612 jio_snprintf(blob_id,
2613 sizeof(blob_id),
2614 "%s(%s)",
2615 adapter_blob->name(),
2616 entry->fingerprint()->as_string());
2617 if (Forte::is_enabled()) {
2618 Forte::register_stub(blob_id, adapter_blob->content_begin(), adapter_blob->content_end());
2619 }
2620
2621 if (JvmtiExport::should_post_dynamic_code_generated()) {
2622 JvmtiExport::post_dynamic_code_generated(blob_id, adapter_blob->content_begin(), adapter_blob->content_end());
2623 }
2624 }
2625 }
2626
2627 void AdapterHandlerLibrary::initialize() {
2628 {
2629 ResourceMark rm;
2630 _adapter_handler_table = new (mtCode) AdapterHandlerTable();
2631 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
2632 }
2633
2634 #if INCLUDE_CDS
2635 // Link adapters in AOT Cache to their code in AOT Code Cache
2636 if (AOTCodeCache::is_using_adapter() && !_aot_adapter_handler_table.empty()) {
2637 link_aot_adapters();
2638 lookup_simple_adapters();
2639 return;
2640 }
2641 #endif // INCLUDE_CDS
2642
2643 ResourceMark rm;
2644 {
2645 MutexLocker mu(AdapterHandlerLibrary_lock);
2646
2647 CompiledEntrySignature no_args;
2648 no_args.compute_calling_conventions();
2649 _no_arg_handler = create_adapter(no_args, true);
2650
2651 CompiledEntrySignature obj_args;
2652 SigEntry::add_entry(obj_args.sig(), T_OBJECT);
2653 obj_args.compute_calling_conventions();
2654 _obj_arg_handler = create_adapter(obj_args, true);
2655
2656 CompiledEntrySignature int_args;
2657 SigEntry::add_entry(int_args.sig(), T_INT);
2658 int_args.compute_calling_conventions();
2659 _int_arg_handler = create_adapter(int_args, true);
2660
2661 CompiledEntrySignature obj_int_args;
2662 SigEntry::add_entry(obj_int_args.sig(), T_OBJECT);
2663 SigEntry::add_entry(obj_int_args.sig(), T_INT);
2664 obj_int_args.compute_calling_conventions();
2665 _obj_int_arg_handler = create_adapter(obj_int_args, true);
2666
2667 CompiledEntrySignature obj_obj_args;
2668 SigEntry::add_entry(obj_obj_args.sig(), T_OBJECT);
2669 SigEntry::add_entry(obj_obj_args.sig(), T_OBJECT);
2670 obj_obj_args.compute_calling_conventions();
2671 _obj_obj_arg_handler = create_adapter(obj_obj_args, true);
2672
2673 // we should always get an entry back but we don't have any
2674 // associated blob on Zero
2675 assert(_no_arg_handler != nullptr &&
2676 _obj_arg_handler != nullptr &&
2677 _int_arg_handler != nullptr &&
2678 _obj_int_arg_handler != nullptr &&
2679 _obj_obj_arg_handler != nullptr, "Initial adapter handlers must be properly created");
2680 }
2681
2682 // Outside of the lock
2683 #ifndef ZERO
2684 // no blobs to register when we are on Zero
2685 post_adapter_creation(_no_arg_handler);
2686 post_adapter_creation(_obj_arg_handler);
2687 post_adapter_creation(_int_arg_handler);
2688 post_adapter_creation(_obj_int_arg_handler);
2689 post_adapter_creation(_obj_obj_arg_handler);
2690 #endif // ZERO
2691 }
2692
2693 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint) {
2694 uint id = (uint)AtomicAccess::add((int*)&_id_counter, 1);
2695 assert(id > 0, "we can never overflow because AOT cache cannot contain more than 2^32 methods");
2696 return AdapterHandlerEntry::allocate(id, fingerprint);
2697 }
2698
2699 AdapterHandlerEntry* AdapterHandlerLibrary::get_simple_adapter(const methodHandle& method) {
2700 int total_args_passed = method->size_of_parameters(); // All args on stack
2701 if (total_args_passed == 0) {
2702 return _no_arg_handler;
2703 } else if (total_args_passed == 1) {
2704 if (!method->is_static()) {
2705 if (InlineTypePassFieldsAsArgs && method->method_holder()->is_inline_klass()) {
2706 return nullptr;
2707 }
2708 return _obj_arg_handler;
2709 }
2710 switch (method->signature()->char_at(1)) {
2711 case JVM_SIGNATURE_CLASS: {
2712 if (InlineTypePassFieldsAsArgs) {
2713 SignatureStream ss(method->signature());
2714 InlineKlass* vk = ss.as_inline_klass(method->method_holder());
2715 if (vk != nullptr) {
2716 return nullptr;
2717 }
2718 }
2719 return _obj_arg_handler;
2720 }
2721 case JVM_SIGNATURE_ARRAY:
2722 return _obj_arg_handler;
2723 case JVM_SIGNATURE_INT:
2724 case JVM_SIGNATURE_BOOLEAN:
2725 case JVM_SIGNATURE_CHAR:
2726 case JVM_SIGNATURE_BYTE:
2727 case JVM_SIGNATURE_SHORT:
2728 return _int_arg_handler;
2729 }
2730 } else if (total_args_passed == 2 &&
2731 !method->is_static() && (!InlineTypePassFieldsAsArgs || !method->method_holder()->is_inline_klass())) {
2732 switch (method->signature()->char_at(1)) {
2733 case JVM_SIGNATURE_CLASS: {
2734 if (InlineTypePassFieldsAsArgs) {
2735 SignatureStream ss(method->signature());
2736 InlineKlass* vk = ss.as_inline_klass(method->method_holder());
2737 if (vk != nullptr) {
2738 return nullptr;
2739 }
2740 }
2741 return _obj_obj_arg_handler;
2742 }
2743 case JVM_SIGNATURE_ARRAY:
2744 return _obj_obj_arg_handler;
2745 case JVM_SIGNATURE_INT:
2746 case JVM_SIGNATURE_BOOLEAN:
2747 case JVM_SIGNATURE_CHAR:
2748 case JVM_SIGNATURE_BYTE:
2749 case JVM_SIGNATURE_SHORT:
2750 return _obj_int_arg_handler;
2751 }
2752 }
2753 return nullptr;
2754 }
2755
2756 CompiledEntrySignature::CompiledEntrySignature(Method* method) :
2757 _method(method), _num_inline_args(0), _has_inline_recv(false),
2758 _regs(nullptr), _regs_cc(nullptr), _regs_cc_ro(nullptr),
2759 _args_on_stack(0), _args_on_stack_cc(0), _args_on_stack_cc_ro(0),
2760 _c1_needs_stack_repair(false), _c2_needs_stack_repair(false), _supers(nullptr) {
2761 _sig = new GrowableArray<SigEntry>((method != nullptr) ? method->size_of_parameters() : 1);
2762 _sig_cc = new GrowableArray<SigEntry>((method != nullptr) ? method->size_of_parameters() : 1);
2763 _sig_cc_ro = new GrowableArray<SigEntry>((method != nullptr) ? method->size_of_parameters() : 1);
2764 }
2765
2766 // See if we can save space by sharing the same entry for VIEP and VIEP(RO),
2767 // or the same entry for VEP and VIEP(RO).
2768 CodeOffsets::Entries CompiledEntrySignature::c1_inline_ro_entry_type() const {
2769 if (!has_scalarized_args()) {
2770 // VEP/VIEP/VIEP(RO) all share the same entry. There's no packing.
2771 return CodeOffsets::Verified_Entry;
2772 }
2773 if (_method->is_static()) {
2774 // Static methods don't need VIEP(RO)
2775 return CodeOffsets::Verified_Entry;
2776 }
2777
2778 if (has_inline_recv()) {
2779 if (num_inline_args() == 1) {
2780 // Share same entry for VIEP and VIEP(RO).
2781 // This is quite common: we have an instance method in an InlineKlass that has
2782 // no inline type args other than <this>.
2783 return CodeOffsets::Verified_Inline_Entry;
2784 } else {
2785 assert(num_inline_args() > 1, "must be");
2786 // No sharing:
2787 // VIEP(RO) -- <this> is passed as object
2788 // VEP -- <this> is passed as fields
2789 return CodeOffsets::Verified_Inline_Entry_RO;
2790 }
2791 }
2792
2793 // Either a static method, or <this> is not an inline type
2794 if (args_on_stack_cc() != args_on_stack_cc_ro()) {
2795 // No sharing:
2796 // Some arguments are passed on the stack, and we have inserted reserved entries
2797 // into the VEP, but we never insert reserved entries into the VIEP(RO).
2798 return CodeOffsets::Verified_Inline_Entry_RO;
2799 } else {
2800 // Share same entry for VEP and VIEP(RO).
2801 return CodeOffsets::Verified_Entry;
2802 }
2803 }
2804
2805 // Returns all super methods (transitive) in classes and interfaces that are overridden by the current method.
2806 GrowableArray<Method*>* CompiledEntrySignature::get_supers() {
2807 if (_supers != nullptr) {
2808 return _supers;
2809 }
2810 _supers = new GrowableArray<Method*>();
2811 // Skip private, static, and <init> methods
2812 if (_method->is_private() || _method->is_static() || _method->is_object_constructor()) {
2813 return _supers;
2814 }
2815 Symbol* name = _method->name();
2816 Symbol* signature = _method->signature();
2817 const Klass* holder = _method->method_holder()->super();
2818 Symbol* holder_name = holder->name();
2819 JavaThread* current = JavaThread::current();
2820 HandleMark hm(current);
2821 Handle loader(current, _method->method_holder()->class_loader());
2822
2823 // Walk up the class hierarchy and search for super methods
2824 while (holder != nullptr) {
2825 Method* super_method = holder->lookup_method(name, signature);
2826 if (super_method == nullptr) {
2827 break;
2828 }
2829 if (!super_method->is_static() && !super_method->is_private() &&
2830 (!super_method->is_package_private() ||
2831 super_method->method_holder()->is_same_class_package(loader(), holder_name))) {
2832 _supers->push(super_method);
2833 }
2834 holder = super_method->method_holder()->super();
2835 }
2836 // Search interfaces for super methods
2837 Array<InstanceKlass*>* interfaces = _method->method_holder()->transitive_interfaces();
2838 for (int i = 0; i < interfaces->length(); ++i) {
2839 Method* m = interfaces->at(i)->lookup_method(name, signature);
2840 if (m != nullptr && !m->is_static() && m->is_public()) {
2841 _supers->push(m);
2842 }
2843 }
2844 return _supers;
2845 }
2846
2847 bool CompiledEntrySignature::check_supers_and_deoptimize(int arg_num) {
2848 assert(JavaThread::current()->thread_state() == _thread_in_vm, "must be in vm state");
2849
2850 bool scalar_super = false;
2851 bool non_scalar_super = false;
2852
2853 GrowableArray<Method*>* supers = get_supers();
2854 for (int i = 0; i < supers->length(); ++i) {
2855 Method* super_method = supers->at(i);
2856 if (super_method->is_scalarized_arg(arg_num)) {
2857 scalar_super = true;
2858 } else {
2859 non_scalar_super = true;
2860 }
2861 }
2862 #ifdef ASSERT
2863 // Randomly enable below code paths for stress testing
2864 bool stress = StressCallingConvention;
2865 if (stress && (os::random() & 1) == 1) {
2866 non_scalar_super = true;
2867 if ((os::random() & 1) == 1) {
2868 scalar_super = true;
2869 }
2870 }
2871 #endif
2872 if (non_scalar_super) {
2873 // Found a super method with a non-scalarized argument. Fall back to the non-scalarized calling convention.
2874 if (scalar_super) {
2875 // Found non-scalar *and* scalar super methods. We can't handle both.
2876 // Mark the scalar method as mismatch and re-compile call sites to use non-scalarized calling convention.
2877 for (int i = 0; i < supers->length(); ++i) {
2878 Method* super_method = supers->at(i);
2879 if (super_method->is_scalarized_arg(arg_num) DEBUG_ONLY(|| (stress && (os::random() & 1) == 1))) {
2880 JavaThread* thread = JavaThread::current();
2881 HandleMark hm(thread);
2882 methodHandle mh(thread, super_method);
2883 DeoptimizationScope deopt_scope;
2884 {
2885 // Keep the lock scope minimal. Prevent interference with other
2886 // dependency checks by setting mismatch and marking within the lock.
2887 MutexLocker ml(Compile_lock, Mutex::_safepoint_check_flag);
2888 super_method->set_mismatch();
2889 CodeCache::mark_for_deoptimization(&deopt_scope, mh());
2890 }
2891 deopt_scope.deoptimize_marked();
2892 }
2893 }
2894 }
2895 }
2896
2897 return non_scalar_super;
2898 }
2899
2900 // Iterate over arguments and compute scalarized and non-scalarized signatures
2901 void CompiledEntrySignature::compute_calling_conventions(bool link_time) {
2902 assert(JavaThread::current()->thread_state() != _thread_in_native, "must not be in native");
2903 assert(link_time || (_method != nullptr && _method->adapter() != nullptr), "invariant");
2904 bool has_scalarized = false;
2905 if (_method != nullptr) {
2906 InstanceKlass* holder = _method->method_holder();
2907 int arg_num = 0;
2908 if (!_method->is_static()) {
2909 // We shouldn't scalarize 'this' in a value class constructor
2910 if (holder->is_inline_klass() && InlineKlass::cast(holder)->can_be_passed_as_fields() &&
2911 !_method->is_object_constructor() && (link_time || _method->is_scalarized_arg(arg_num))) {
2912 _sig_cc->appendAll(InlineKlass::cast(holder)->extended_sig());
2913 _sig_cc->insert_before(1, SigEntry(T_OBJECT, 0, nullptr, false, true)); // buffer argument
2914 has_scalarized = true;
2915 _has_inline_recv = true;
2916 _num_inline_args++;
2917 } else {
2918 SigEntry::add_entry(_sig_cc, T_OBJECT, holder->name());
2919 }
2920 SigEntry::add_entry(_sig, T_OBJECT, holder->name());
2921 SigEntry::add_entry(_sig_cc_ro, T_OBJECT, holder->name());
2922 arg_num++;
2923 }
2924 for (SignatureStream ss(_method->signature()); !ss.at_return_type(); ss.next()) {
2925 const BasicType bt = ss.type();
2926 if (InlineTypePassFieldsAsArgs && bt == T_OBJECT) {
2927 InlineKlass* vk = ss.as_inline_klass(holder);
2928 if (vk != nullptr && vk->can_be_passed_as_fields() && (link_time || _method->is_scalarized_arg(arg_num))) {
2929 // Check for a calling convention mismatch with super method(s)
2930 if (link_time && check_supers_and_deoptimize(arg_num)) {
2931 // Fall back to non-scalarized calling convention
2932 SigEntry::add_entry(_sig_cc, T_OBJECT, ss.as_symbol());
2933 SigEntry::add_entry(_sig_cc_ro, T_OBJECT, ss.as_symbol());
2934 } else {
2935 _num_inline_args++;
2936 has_scalarized = true;
2937 int last = _sig_cc->length();
2938 int last_ro = _sig_cc_ro->length();
2939 _sig_cc->appendAll(vk->extended_sig());
2940 _sig_cc_ro->appendAll(vk->extended_sig());
2941 // buffer argument
2942 _sig_cc->insert_before(last + 1, SigEntry(T_OBJECT, 0, nullptr, false, true));
2943 _sig_cc_ro->insert_before(last_ro + 1, SigEntry(T_OBJECT, 0, nullptr, false, true));
2944 // Insert InlineTypeNode::NullMarker field right after T_METADATA delimiter
2945 _sig_cc->insert_before(last + 2, SigEntry(T_BOOLEAN, -1, nullptr, true, false));
2946 _sig_cc_ro->insert_before(last_ro + 2, SigEntry(T_BOOLEAN, -1, nullptr, true, false));
2947 }
2948 } else {
2949 SigEntry::add_entry(_sig_cc, T_OBJECT, ss.as_symbol());
2950 SigEntry::add_entry(_sig_cc_ro, T_OBJECT, ss.as_symbol());
2951 }
2952 } else {
2953 SigEntry::add_entry(_sig_cc, ss.type(), ss.as_symbol());
2954 SigEntry::add_entry(_sig_cc_ro, ss.type(), ss.as_symbol());
2955 }
2956 SigEntry::add_entry(_sig, bt, ss.as_symbol());
2957 if (bt != T_VOID) {
2958 arg_num++;
2959 }
2960 }
2961 }
2962
2963 // Compute the non-scalarized calling convention
2964 _regs = NEW_RESOURCE_ARRAY(VMRegPair, _sig->length());
2965 _args_on_stack = SharedRuntime::java_calling_convention(_sig, _regs);
2966
2967 // Compute the scalarized calling conventions if there are scalarized inline types in the signature
2968 if (has_scalarized && !_method->is_native()) {
2969 _regs_cc = NEW_RESOURCE_ARRAY(VMRegPair, _sig_cc->length());
2970 _args_on_stack_cc = SharedRuntime::java_calling_convention(_sig_cc, _regs_cc);
2971
2972 _regs_cc_ro = NEW_RESOURCE_ARRAY(VMRegPair, _sig_cc_ro->length());
2973 _args_on_stack_cc_ro = SharedRuntime::java_calling_convention(_sig_cc_ro, _regs_cc_ro);
2974
2975 _c1_needs_stack_repair = (_args_on_stack_cc < _args_on_stack) || (_args_on_stack_cc_ro < _args_on_stack);
2976 _c2_needs_stack_repair = (_args_on_stack_cc > _args_on_stack) || (_args_on_stack_cc > _args_on_stack_cc_ro);
2977
2978 // Upper bound on stack arguments to avoid hitting the argument limit and
2979 // bailing out of compilation ("unsupported incoming calling sequence").
2980 // TODO 8281260 We need a reasonable limit (flag?) here
2981 if (MAX2(_args_on_stack_cc, _args_on_stack_cc_ro) <= 75) {
2982 return; // Success
2983 }
2984 }
2985
2986 // No scalarized args
2987 _sig_cc = _sig;
2988 _regs_cc = _regs;
2989 _args_on_stack_cc = _args_on_stack;
2990
2991 _sig_cc_ro = _sig;
2992 _regs_cc_ro = _regs;
2993 _args_on_stack_cc_ro = _args_on_stack;
2994 }
2995
2996 void CompiledEntrySignature::initialize_from_fingerprint(AdapterFingerPrint* fingerprint) {
2997 _has_inline_recv = fingerprint->has_ro_adapter();
2998
2999 int value_object_count = 0;
3000 BasicType prev_bt = T_ILLEGAL;
3001 bool has_scalarized_arguments = false;
3002 bool long_prev = false;
3003 int long_prev_offset = -1;
3004 bool skipping_inline_recv = false;
3005 bool receiver_handled = false;
3006
3007 fingerprint->iterate_args([&] (const AdapterFingerPrint::Element& arg) {
3008 BasicType bt = arg.bt();
3009 int offset = arg.offset();
3010
3011 if (long_prev) {
3012 long_prev = false;
3013 BasicType bt_to_add;
3014 if (bt == T_VOID) {
3015 bt_to_add = T_LONG;
3016 } else {
3017 bt_to_add = T_OBJECT;
3018 }
3019 if (value_object_count == 0) {
3020 SigEntry::add_entry(_sig, bt_to_add);
3021 }
3022 assert(long_prev_offset != 0, "no buffer argument here");
3023 SigEntry::add_entry(_sig_cc, bt_to_add, nullptr, long_prev_offset);
3024 if (!skipping_inline_recv) {
3025 SigEntry::add_entry(_sig_cc_ro, bt_to_add, nullptr, long_prev_offset);
3026 }
3027 }
3028
3029 switch (bt) {
3030 case T_VOID:
3031 if (prev_bt != T_LONG && prev_bt != T_DOUBLE) {
3032 assert(InlineTypePassFieldsAsArgs, "unexpected end of inline type");
3033 value_object_count--;
3034 SigEntry::add_entry(_sig_cc, T_VOID, nullptr, offset);
3035 if (!skipping_inline_recv) {
3036 SigEntry::add_entry(_sig_cc_ro, T_VOID, nullptr, offset);
3037 } else if (value_object_count == 0) {
3038 skipping_inline_recv = false;
3039 }
3040 assert(value_object_count >= 0, "invalid value object count");
3041 } else {
3042 // Nothing to add for _sig: We already added an addition T_VOID in add_entry() when adding T_LONG or T_DOUBLE.
3043 }
3044 break;
3045 case T_INT:
3046 case T_FLOAT:
3047 case T_DOUBLE:
3048 if (value_object_count == 0) {
3049 SigEntry::add_entry(_sig, bt);
3050 }
3051 SigEntry::add_entry(_sig_cc, bt, nullptr, offset);
3052 if (!skipping_inline_recv) {
3053 SigEntry::add_entry(_sig_cc_ro, bt, nullptr, offset);
3054 }
3055 break;
3056 case T_LONG:
3057 long_prev = true;
3058 long_prev_offset = offset;
3059 break;
3060 case T_BOOLEAN:
3061 case T_CHAR:
3062 case T_BYTE:
3063 case T_SHORT:
3064 case T_OBJECT:
3065 case T_ARRAY:
3066 assert(value_object_count > 0, "must be value object field");
3067 assert(offset != 0 || (bt == T_OBJECT && prev_bt == T_METADATA), "buffer input expected here");
3068 SigEntry::add_entry(_sig_cc, bt, nullptr, offset, offset == -1, offset == 0);
3069 if (!skipping_inline_recv) {
3070 SigEntry::add_entry(_sig_cc_ro, bt, nullptr, offset, offset == -1, offset == 0);
3071 }
3072 break;
3073 case T_METADATA:
3074 assert(InlineTypePassFieldsAsArgs, "unexpected start of inline type");
3075 if (value_object_count == 0) {
3076 SigEntry::add_entry(_sig, T_OBJECT);
3077 }
3078 SigEntry::add_entry(_sig_cc, T_METADATA, nullptr, offset);
3079 if (!skipping_inline_recv) {
3080 if (!receiver_handled && _has_inline_recv && value_object_count == 0) {
3081 SigEntry::add_entry(_sig_cc_ro, T_OBJECT);
3082 skipping_inline_recv = true;
3083 receiver_handled = true;
3084 } else {
3085 SigEntry::add_entry(_sig_cc_ro, T_METADATA, nullptr, offset);
3086 }
3087 }
3088 value_object_count++;
3089 has_scalarized_arguments = true;
3090 break;
3091 default: {
3092 fatal("Unexpected BasicType: %s", basictype_to_str(bt));
3093 }
3094 }
3095 prev_bt = bt;
3096 });
3097
3098 if (long_prev) {
3099 // If previous bt was T_LONG and we reached the end of the signature, we know that it must be a T_OBJECT.
3100 SigEntry::add_entry(_sig, T_OBJECT);
3101 SigEntry::add_entry(_sig_cc, T_OBJECT);
3102 SigEntry::add_entry(_sig_cc_ro, T_OBJECT);
3103 }
3104 assert(value_object_count == 0, "invalid value object count");
3105
3106 #ifdef ASSERT
3107 if (_has_inline_recv) {
3108 // In RO signatures, inline receivers must be represented as a single T_OBJECT
3109 assert(_sig_cc_ro->length() >= 1, "sig_cc_ro must include receiver");
3110 assert(_sig_cc_ro->at(0)._bt == T_OBJECT,
3111 "sig_cc_ro must represent inline receiver as T_OBJECT");
3112 assert(_sig_cc_ro->length() <= _sig_cc->length(),
3113 "sig_cc_ro must not be longer than sig_cc");
3114 }
3115 #endif
3116
3117 _regs = NEW_RESOURCE_ARRAY(VMRegPair, _sig->length());
3118 _args_on_stack = SharedRuntime::java_calling_convention(_sig, _regs);
3119
3120 // Compute the scalarized calling conventions if there are scalarized inline types in the signature
3121 if (has_scalarized_arguments) {
3122 _regs_cc = NEW_RESOURCE_ARRAY(VMRegPair, _sig_cc->length());
3123 _args_on_stack_cc = SharedRuntime::java_calling_convention(_sig_cc, _regs_cc);
3124
3125 _regs_cc_ro = NEW_RESOURCE_ARRAY(VMRegPair, _sig_cc_ro->length());
3126 _args_on_stack_cc_ro = SharedRuntime::java_calling_convention(_sig_cc_ro, _regs_cc_ro);
3127
3128 _c1_needs_stack_repair = (_args_on_stack_cc < _args_on_stack) || (_args_on_stack_cc_ro < _args_on_stack);
3129 _c2_needs_stack_repair = (_args_on_stack_cc > _args_on_stack) || (_args_on_stack_cc > _args_on_stack_cc_ro);
3130 } else {
3131 // No scalarized args
3132 _sig_cc = _sig;
3133 _regs_cc = _regs;
3134 _args_on_stack_cc = _args_on_stack;
3135
3136 _sig_cc_ro = _sig;
3137 _regs_cc_ro = _regs;
3138 _args_on_stack_cc_ro = _args_on_stack;
3139 }
3140
3141 #ifdef ASSERT
3142 {
3143 AdapterFingerPrint* compare_fp = AdapterFingerPrint::allocate(_sig_cc, _has_inline_recv);
3144 assert(fingerprint->equals(compare_fp), "%s - %s", fingerprint->as_string(), compare_fp->as_string());
3145 AdapterFingerPrint::deallocate(compare_fp);
3146 }
3147 #endif
3148 }
3149
3150 const char* AdapterHandlerEntry::_entry_names[] = {
3151 "i2c", "c2i", "c2i_unverified", "c2i_no_clinit_check"
3152 };
3153
3154 #ifdef ASSERT
3155 void AdapterHandlerLibrary::verify_adapter_sharing(CompiledEntrySignature& ces, AdapterHandlerEntry* cached_entry) {
3156 // we can only check for the same code if there is any
3157 #ifndef ZERO
3158 AdapterHandlerEntry* comparison_entry = create_adapter(ces, false, true);
3159 assert(comparison_entry->adapter_blob() == nullptr, "no blob should be created when creating an adapter for comparison");
3160 assert(comparison_entry->compare_code(cached_entry), "code must match");
3161 // Release the one just created
3162 AdapterHandlerEntry::deallocate(comparison_entry);
3163 # endif // ZERO
3164 }
3165 #endif /* ASSERT*/
3166
3167 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(const methodHandle& method) {
3168 assert(!method->is_abstract() || InlineTypePassFieldsAsArgs, "abstract methods do not have adapters");
3169 // Use customized signature handler. Need to lock around updates to
3170 // the _adapter_handler_table (it is not safe for concurrent readers
3171 // and a single writer: this could be fixed if it becomes a
3172 // problem).
3173
3174 // Fast-path for trivial adapters
3175 AdapterHandlerEntry* entry = get_simple_adapter(method);
3176 if (entry != nullptr) {
3177 return entry;
3178 }
3179
3180 ResourceMark rm;
3181 bool new_entry = false;
3182
3183 CompiledEntrySignature ces(method());
3184 ces.compute_calling_conventions();
3185 if (ces.has_scalarized_args()) {
3186 if (!method->has_scalarized_args()) {
3187 method->set_has_scalarized_args();
3188 }
3189 if (ces.c1_needs_stack_repair()) {
3190 method->set_c1_needs_stack_repair();
3191 }
3192 if (ces.c2_needs_stack_repair() && !method->c2_needs_stack_repair()) {
3193 method->set_c2_needs_stack_repair();
3194 }
3195 }
3196
3197 {
3198 MutexLocker mu(AdapterHandlerLibrary_lock);
3199
3200 // Lookup method signature's fingerprint
3201 entry = lookup(ces.sig_cc(), ces.has_inline_recv());
3202
3203 if (entry != nullptr) {
3204 #ifndef ZERO
3205 assert(entry->is_linked(), "AdapterHandlerEntry must have been linked");
3206 #endif
3207 #ifdef ASSERT
3208 if (!entry->in_aot_cache() && VerifyAdapterSharing) {
3209 verify_adapter_sharing(ces, entry);
3210 }
3211 #endif
3212 } else {
3213 entry = create_adapter(ces, /* allocate_code_blob */ true);
3214 if (entry != nullptr) {
3215 new_entry = true;
3216 }
3217 }
3218 }
3219
3220 // Outside of the lock
3221 if (new_entry) {
3222 post_adapter_creation(entry);
3223 }
3224 return entry;
3225 }
3226
3227 void AdapterHandlerLibrary::lookup_aot_cache(AdapterHandlerEntry* handler) {
3228 ResourceMark rm;
3229 const char* name = AdapterHandlerLibrary::name(handler);
3230 const uint32_t id = AdapterHandlerLibrary::id(handler);
3231
3232 CodeBlob* blob = AOTCodeCache::load_code_blob(AOTCodeEntry::Adapter, id, name);
3233 if (blob != nullptr) {
3234 handler->set_adapter_blob(blob->as_adapter_blob());
3235 }
3236 }
3237
3238 #ifndef PRODUCT
3239 void AdapterHandlerLibrary::print_adapter_handler_info(outputStream* st, AdapterHandlerEntry* handler) {
3240 ttyLocker ttyl;
3241 ResourceMark rm;
3242 int insts_size;
3243 // on Zero the blob may be null
3244 handler->print_adapter_on(tty);
3245 AdapterBlob* adapter_blob = handler->adapter_blob();
3246 if (adapter_blob == nullptr) {
3247 return;
3248 }
3249 insts_size = adapter_blob->code_size();
3250 st->print_cr("i2c argument handler for: %s %s (%d bytes generated)",
3251 handler->fingerprint()->as_basic_args_string(),
3252 handler->fingerprint()->as_string(), insts_size);
3253 st->print_cr("c2i argument handler starts at " INTPTR_FORMAT, p2i(handler->get_c2i_entry()));
3254 if (Verbose || PrintStubCode) {
3255 address first_pc = adapter_blob->content_begin();
3256 if (first_pc != nullptr) {
3257 Disassembler::decode(first_pc, first_pc + insts_size, st, &adapter_blob->asm_remarks());
3258 st->cr();
3259 }
3260 }
3261 }
3262 #endif // PRODUCT
3263
3264 void AdapterHandlerLibrary::address_to_offset(address entry_address[AdapterBlob::ENTRY_COUNT],
3265 int entry_offset[AdapterBlob::ENTRY_COUNT]) {
3266 entry_offset[AdapterBlob::I2C] = 0;
3267 entry_offset[AdapterBlob::C2I] = entry_address[AdapterBlob::C2I] - entry_address[AdapterBlob::I2C];
3268 entry_offset[AdapterBlob::C2I_Inline] = entry_address[AdapterBlob::C2I_Inline] - entry_address[AdapterBlob::I2C];
3269 entry_offset[AdapterBlob::C2I_Inline_RO] = entry_address[AdapterBlob::C2I_Inline_RO] - entry_address[AdapterBlob::I2C];
3270 entry_offset[AdapterBlob::C2I_Unverified] = entry_address[AdapterBlob::C2I_Unverified] - entry_address[AdapterBlob::I2C];
3271 entry_offset[AdapterBlob::C2I_Unverified_Inline] = entry_address[AdapterBlob::C2I_Unverified_Inline] - entry_address[AdapterBlob::I2C];
3272 if (entry_address[AdapterBlob::C2I_No_Clinit_Check] == nullptr) {
3273 entry_offset[AdapterBlob::C2I_No_Clinit_Check] = -1;
3274 } else {
3275 entry_offset[AdapterBlob::C2I_No_Clinit_Check] = entry_address[AdapterBlob::C2I_No_Clinit_Check] - entry_address[AdapterBlob::I2C];
3276 }
3277 }
3278
3279 bool AdapterHandlerLibrary::generate_adapter_code(AdapterHandlerEntry* handler,
3280 CompiledEntrySignature& ces,
3281 bool allocate_code_blob,
3282 bool is_transient) {
3283 if (log_is_enabled(Info, perf, class, link)) {
3284 ClassLoader::perf_method_adapters_count()->inc();
3285 }
3286
3287 #ifndef ZERO
3288 AdapterBlob* adapter_blob = nullptr;
3289 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
3290 CodeBuffer buffer(buf);
3291 short buffer_locs[20];
3292 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
3293 sizeof(buffer_locs)/sizeof(relocInfo));
3294 MacroAssembler masm(&buffer);
3295 address entry_address[AdapterBlob::ENTRY_COUNT];
3296
3297 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
3298 SharedRuntime::generate_i2c2i_adapters(&masm,
3299 ces.args_on_stack(),
3300 ces.sig(),
3301 ces.regs(),
3302 ces.sig_cc(),
3303 ces.regs_cc(),
3304 ces.sig_cc_ro(),
3305 ces.regs_cc_ro(),
3306 entry_address,
3307 adapter_blob,
3308 allocate_code_blob);
3309
3310 if (ces.has_scalarized_args()) {
3311 // Save a C heap allocated version of the scalarized signature and store it in the adapter
3312 GrowableArray<SigEntry>* heap_sig = new (mtCode) GrowableArray<SigEntry>(ces.sig_cc()->length(), mtCode);
3313 heap_sig->appendAll(ces.sig_cc());
3314 handler->set_sig_cc(heap_sig);
3315 heap_sig = new (mtCode) GrowableArray<SigEntry>(ces.sig_cc_ro()->length(), mtCode);
3316 heap_sig->appendAll(ces.sig_cc_ro());
3317 handler->set_sig_cc_ro(heap_sig);
3318 }
3319 // On zero there is no code to save and no need to create a blob and
3320 // or relocate the handler.
3321 int entry_offset[AdapterBlob::ENTRY_COUNT];
3322 address_to_offset(entry_address, entry_offset);
3323 #ifdef ASSERT
3324 if (VerifyAdapterSharing) {
3325 handler->save_code(buf->code_begin(), buffer.insts_size());
3326 if (is_transient) {
3327 return true;
3328 }
3329 }
3330 #endif
3331 if (adapter_blob == nullptr) {
3332 // CodeCache is full, disable compilation
3333 // Ought to log this but compile log is only per compile thread
3334 // and we're some non descript Java thread.
3335 return false;
3336 }
3337 handler->set_adapter_blob(adapter_blob);
3338 if (!is_transient && AOTCodeCache::is_dumping_adapter()) {
3339 // try to save generated code
3340 const char* name = AdapterHandlerLibrary::name(handler);
3341 const uint32_t id = AdapterHandlerLibrary::id(handler);
3342 bool success = AOTCodeCache::store_code_blob(*adapter_blob, AOTCodeEntry::Adapter, id, name);
3343 assert(success || !AOTCodeCache::is_dumping_adapter(), "caching of adapter must be disabled");
3344 }
3345 #endif // ZERO
3346
3347 #ifndef PRODUCT
3348 // debugging support
3349 if (PrintAdapterHandlers || PrintStubCode) {
3350 print_adapter_handler_info(tty, handler);
3351 }
3352 #endif
3353
3354 return true;
3355 }
3356
3357 AdapterHandlerEntry* AdapterHandlerLibrary::create_adapter(CompiledEntrySignature& ces,
3358 bool allocate_code_blob,
3359 bool is_transient) {
3360 AdapterFingerPrint* fp = AdapterFingerPrint::allocate(ces.sig_cc(), ces.has_inline_recv());
3361 #ifdef ASSERT
3362 // Verify that we can successfully restore the compiled entry signature object.
3363 CompiledEntrySignature ces_verify;
3364 ces_verify.initialize_from_fingerprint(fp);
3365 #endif
3366 AdapterHandlerEntry* handler = AdapterHandlerLibrary::new_entry(fp);
3367 if (!generate_adapter_code(handler, ces, allocate_code_blob, is_transient)) {
3368 AdapterHandlerEntry::deallocate(handler);
3369 return nullptr;
3370 }
3371 if (!is_transient) {
3372 assert_lock_strong(AdapterHandlerLibrary_lock);
3373 _adapter_handler_table->put(fp, handler);
3374 }
3375 return handler;
3376 }
3377
3378 #if INCLUDE_CDS
3379 void AdapterHandlerEntry::remove_unshareable_info() {
3380 #ifdef ASSERT
3381 _saved_code = nullptr;
3382 _saved_code_length = 0;
3383 #endif // ASSERT
3384 _adapter_blob = nullptr;
3385 _linked = false;
3386 _sig_cc = nullptr;
3387 _sig_cc_ro = nullptr;
3388 }
3389
3390 class CopyAdapterTableToArchive : StackObj {
3391 private:
3392 CompactHashtableWriter* _writer;
3393 ArchiveBuilder* _builder;
3394 public:
3395 CopyAdapterTableToArchive(CompactHashtableWriter* writer) : _writer(writer),
3396 _builder(ArchiveBuilder::current())
3397 {}
3398
3399 bool do_entry(AdapterFingerPrint* fp, AdapterHandlerEntry* entry) {
3400 LogStreamHandle(Trace, aot) lsh;
3401 if (ArchiveBuilder::current()->has_been_archived((address)entry)) {
3402 assert(ArchiveBuilder::current()->has_been_archived((address)fp), "must be");
3403 AdapterFingerPrint* buffered_fp = ArchiveBuilder::current()->get_buffered_addr(fp);
3404 assert(buffered_fp != nullptr,"sanity check");
3405 AdapterHandlerEntry* buffered_entry = ArchiveBuilder::current()->get_buffered_addr(entry);
3406 assert(buffered_entry != nullptr,"sanity check");
3407
3408 uint hash = fp->compute_hash();
3409 _writer->add(hash, AOTCompressedPointers::encode_not_null(buffered_entry));
3410 if (lsh.is_enabled()) {
3411 address fp_runtime_addr = (address)buffered_fp + ArchiveBuilder::current()->buffer_to_requested_delta();
3412 address entry_runtime_addr = (address)buffered_entry + ArchiveBuilder::current()->buffer_to_requested_delta();
3413 log_trace(aot)("Added fp=%p (%s), entry=%p to the archived adater table", buffered_fp, buffered_fp->as_basic_args_string(), buffered_entry);
3414 }
3415 } else {
3416 if (lsh.is_enabled()) {
3417 log_trace(aot)("Skipping adapter handler %p (fp=%s) as it is not archived", entry, fp->as_basic_args_string());
3418 }
3419 }
3420 return true;
3421 }
3422 };
3423
3424 void AdapterHandlerLibrary::dump_aot_adapter_table() {
3425 CompactHashtableStats stats;
3426 CompactHashtableWriter writer(_adapter_handler_table->number_of_entries(), &stats);
3427 CopyAdapterTableToArchive copy(&writer);
3428 _adapter_handler_table->iterate(©);
3429 writer.dump(&_aot_adapter_handler_table, "archived adapter table");
3430 }
3431
3432 void AdapterHandlerLibrary::serialize_shared_table_header(SerializeClosure* soc) {
3433 _aot_adapter_handler_table.serialize_header(soc);
3434 }
3435
3436 void AdapterHandlerLibrary::link_aot_adapter_handler(AdapterHandlerEntry* handler) {
3437 #ifdef ASSERT
3438 if (TestAOTAdapterLinkFailure) {
3439 return;
3440 }
3441 #endif
3442 lookup_aot_cache(handler);
3443 #ifndef PRODUCT
3444 // debugging support
3445 if (PrintAdapterHandlers || PrintStubCode) {
3446 print_adapter_handler_info(tty, handler);
3447 }
3448 #endif
3449 }
3450
3451 // This method is used during production run to link archived adapters (stored in AOT Cache)
3452 // to their code in AOT Code Cache
3453 void AdapterHandlerEntry::link() {
3454 ResourceMark rm;
3455 assert(_fingerprint != nullptr, "_fingerprint must not be null");
3456 bool generate_code = false;
3457 // Generate code only if AOTCodeCache is not available, or
3458 // caching adapters is disabled, or we fail to link
3459 // the AdapterHandlerEntry to its code in the AOTCodeCache
3460 if (AOTCodeCache::is_using_adapter()) {
3461 AdapterHandlerLibrary::link_aot_adapter_handler(this);
3462 // If link_aot_adapter_handler() succeeds, _adapter_blob will be non-null
3463 if (_adapter_blob == nullptr) {
3464 log_warning(aot)("Failed to link AdapterHandlerEntry (fp=%s) to its code in the AOT code cache", _fingerprint->as_basic_args_string());
3465 generate_code = true;
3466 }
3467
3468 if (get_sig_cc() == nullptr) {
3469 // Calling conventions have to be regenerated at runtime and are accessed through method adapters,
3470 // which are archived in the AOT code cache. If the adapters are not regenerated, the
3471 // calling conventions should be regenerated here.
3472 CompiledEntrySignature ces;
3473 ces.initialize_from_fingerprint(_fingerprint);
3474 if (ces.has_scalarized_args()) {
3475 // Save a C heap allocated version of the scalarized signature and store it in the adapter
3476 GrowableArray<SigEntry>* heap_sig = new (mtCode) GrowableArray<SigEntry>(ces.sig_cc()->length(), mtCode);
3477 heap_sig->appendAll(ces.sig_cc());
3478 set_sig_cc(heap_sig);
3479 heap_sig = new (mtCode) GrowableArray<SigEntry>(ces.sig_cc_ro()->length(), mtCode);
3480 heap_sig->appendAll(ces.sig_cc_ro());
3481 set_sig_cc_ro(heap_sig);
3482 }
3483 }
3484 } else {
3485 generate_code = true;
3486 }
3487 if (generate_code) {
3488 CompiledEntrySignature ces;
3489 ces.initialize_from_fingerprint(_fingerprint);
3490 if (!AdapterHandlerLibrary::generate_adapter_code(this, ces, true, false)) {
3491 // Don't throw exceptions during VM initialization because java.lang.* classes
3492 // might not have been initialized, causing problems when constructing the
3493 // Java exception object.
3494 vm_exit_during_initialization("Out of space in CodeCache for adapters");
3495 }
3496 }
3497 if (_adapter_blob != nullptr) {
3498 post_adapter_creation(this);
3499 }
3500 assert(_linked, "AdapterHandlerEntry must now be linked");
3501 }
3502
3503 void AdapterHandlerLibrary::link_aot_adapters() {
3504 uint max_id = 0;
3505 assert(AOTCodeCache::is_using_adapter(), "AOT adapters code should be available");
3506 /* It is possible that some adapters generated in assembly phase are not stored in the cache.
3507 * That implies adapter ids of the adapters in the cache may not be contiguous.
3508 * If the size of the _aot_adapter_handler_table is used to initialize _id_counter, then it may
3509 * result in collision of adapter ids between AOT stored handlers and runtime generated handlers.
3510 * To avoid such situation, initialize the _id_counter with the largest adapter id among the AOT stored handlers.
3511 */
3512 _aot_adapter_handler_table.iterate_all([&](AdapterHandlerEntry* entry) {
3513 assert(!entry->is_linked(), "AdapterHandlerEntry is already linked!");
3514 entry->link();
3515 max_id = MAX2(max_id, entry->id());
3516 });
3517 // Set adapter id to the maximum id found in the AOTCache
3518 assert(_id_counter == 0, "Did not expect new AdapterHandlerEntry to be created at this stage");
3519 _id_counter = max_id;
3520 }
3521
3522 // This method is called during production run to lookup simple adapters
3523 // in the archived adapter handler table
3524 void AdapterHandlerLibrary::lookup_simple_adapters() {
3525 assert(!_aot_adapter_handler_table.empty(), "archived adapter handler table is empty");
3526
3527 MutexLocker mu(AdapterHandlerLibrary_lock);
3528 ResourceMark rm;
3529 CompiledEntrySignature no_args;
3530 no_args.compute_calling_conventions();
3531 _no_arg_handler = lookup(no_args.sig_cc(), no_args.has_inline_recv());
3532
3533 CompiledEntrySignature obj_args;
3534 SigEntry::add_entry(obj_args.sig(), T_OBJECT);
3535 obj_args.compute_calling_conventions();
3536 _obj_arg_handler = lookup(obj_args.sig_cc(), obj_args.has_inline_recv());
3537
3538 CompiledEntrySignature int_args;
3539 SigEntry::add_entry(int_args.sig(), T_INT);
3540 int_args.compute_calling_conventions();
3541 _int_arg_handler = lookup(int_args.sig_cc(), int_args.has_inline_recv());
3542
3543 CompiledEntrySignature obj_int_args;
3544 SigEntry::add_entry(obj_int_args.sig(), T_OBJECT);
3545 SigEntry::add_entry(obj_int_args.sig(), T_INT);
3546 obj_int_args.compute_calling_conventions();
3547 _obj_int_arg_handler = lookup(obj_int_args.sig_cc(), obj_int_args.has_inline_recv());
3548
3549 CompiledEntrySignature obj_obj_args;
3550 SigEntry::add_entry(obj_obj_args.sig(), T_OBJECT);
3551 SigEntry::add_entry(obj_obj_args.sig(), T_OBJECT);
3552 obj_obj_args.compute_calling_conventions();
3553 _obj_obj_arg_handler = lookup(obj_obj_args.sig_cc(), obj_obj_args.has_inline_recv());
3554
3555 assert(_no_arg_handler != nullptr &&
3556 _obj_arg_handler != nullptr &&
3557 _int_arg_handler != nullptr &&
3558 _obj_int_arg_handler != nullptr &&
3559 _obj_obj_arg_handler != nullptr, "Initial adapters not found in archived adapter handler table");
3560 assert(_no_arg_handler->is_linked() &&
3561 _obj_arg_handler->is_linked() &&
3562 _int_arg_handler->is_linked() &&
3563 _obj_int_arg_handler->is_linked() &&
3564 _obj_obj_arg_handler->is_linked(), "Initial adapters not in linked state");
3565 }
3566 #endif // INCLUDE_CDS
3567
3568 void AdapterHandlerEntry::metaspace_pointers_do(MetaspaceClosure* it) {
3569 LogStreamHandle(Trace, aot) lsh;
3570 if (lsh.is_enabled()) {
3571 lsh.print("Iter(AdapterHandlerEntry): %p(%s)", this, _fingerprint->as_basic_args_string());
3572 lsh.cr();
3573 }
3574 it->push(&_fingerprint);
3575 }
3576
3577 AdapterHandlerEntry::~AdapterHandlerEntry() {
3578 if (_fingerprint != nullptr) {
3579 AdapterFingerPrint::deallocate(_fingerprint);
3580 _fingerprint = nullptr;
3581 }
3582 if (_sig_cc != nullptr) {
3583 delete _sig_cc;
3584 }
3585 if (_sig_cc_ro != nullptr) {
3586 delete _sig_cc_ro;
3587 }
3588 #ifdef ASSERT
3589 FREE_C_HEAP_ARRAY(_saved_code);
3590 #endif
3591 FreeHeap(this);
3592 }
3593
3594
3595 #ifdef ASSERT
3596 // Capture the code before relocation so that it can be compared
3597 // against other versions. If the code is captured after relocation
3598 // then relative instructions won't be equivalent.
3599 void AdapterHandlerEntry::save_code(unsigned char* buffer, int length) {
3600 _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode);
3601 _saved_code_length = length;
3602 memcpy(_saved_code, buffer, length);
3603 }
3604
3605
3606 bool AdapterHandlerEntry::compare_code(AdapterHandlerEntry* other) {
3607 assert(_saved_code != nullptr && other->_saved_code != nullptr, "code not saved");
3608
3609 if (other->_saved_code_length != _saved_code_length) {
3610 return false;
3611 }
3612
3613 return memcmp(other->_saved_code, _saved_code, _saved_code_length) == 0;
3614 }
3615 #endif
3616
3617
3618 /**
3619 * Create a native wrapper for this native method. The wrapper converts the
3620 * Java-compiled calling convention to the native convention, handles
3621 * arguments, and transitions to native. On return from the native we transition
3622 * back to java blocking if a safepoint is in progress.
3623 */
3624 void AdapterHandlerLibrary::create_native_wrapper(const methodHandle& method) {
3625 ResourceMark rm;
3626 nmethod* nm = nullptr;
3627
3628 // Check if memory should be freed before allocation
3629 CodeCache::gc_on_allocation();
3630
3631 assert(method->is_native(), "must be native");
3632 assert(method->is_special_native_intrinsic() ||
3633 method->has_native_function(), "must have something valid to call!");
3634
3635 {
3636 // Perform the work while holding the lock, but perform any printing outside the lock
3637 MutexLocker mu(AdapterHandlerLibrary_lock);
3638 // See if somebody beat us to it
3639 if (method->code() != nullptr) {
3640 return;
3641 }
3642
3643 const int compile_id = CompileBroker::assign_compile_id(method, CompileBroker::standard_entry_bci);
3644 assert(compile_id > 0, "Must generate native wrapper");
3645
3646
3647 ResourceMark rm;
3648 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
3649 if (buf != nullptr) {
3650 CodeBuffer buffer(buf);
3651
3652 if (method->is_continuation_enter_intrinsic()) {
3653 buffer.initialize_stubs_size(192);
3654 }
3655
3656 struct { double data[20]; } locs_buf;
3657 struct { double data[20]; } stubs_locs_buf;
3658 buffer.insts()->initialize_shared_locs((relocInfo*)&locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
3659 #if defined(AARCH64) || defined(PPC64)
3660 // On AArch64 with ZGC and nmethod entry barriers, we need all oops to be
3661 // in the constant pool to ensure ordering between the barrier and oops
3662 // accesses. For native_wrappers we need a constant.
3663 // On PPC64 the continuation enter intrinsic needs the constant pool for the compiled
3664 // static java call that is resolved in the runtime.
3665 if (PPC64_ONLY(method->is_continuation_enter_intrinsic() &&) true) {
3666 buffer.initialize_consts_size(8 PPC64_ONLY(+ 24));
3667 }
3668 #endif
3669 buffer.stubs()->initialize_shared_locs((relocInfo*)&stubs_locs_buf, sizeof(stubs_locs_buf) / sizeof(relocInfo));
3670 MacroAssembler _masm(&buffer);
3671
3672 // Fill in the signature array, for the calling-convention call.
3673 const int total_args_passed = method->size_of_parameters();
3674
3675 BasicType stack_sig_bt[16];
3676 VMRegPair stack_regs[16];
3677 BasicType* sig_bt = (total_args_passed <= 16) ? stack_sig_bt : NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
3678 VMRegPair* regs = (total_args_passed <= 16) ? stack_regs : NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
3679
3680 int i = 0;
3681 if (!method->is_static()) { // Pass in receiver first
3682 sig_bt[i++] = T_OBJECT;
3683 }
3684 SignatureStream ss(method->signature());
3685 for (; !ss.at_return_type(); ss.next()) {
3686 sig_bt[i++] = ss.type(); // Collect remaining bits of signature
3687 if (ss.type() == T_LONG || ss.type() == T_DOUBLE) {
3688 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots
3689 }
3690 }
3691 assert(i == total_args_passed, "");
3692 BasicType ret_type = ss.type();
3693
3694 // Now get the compiled-Java arguments layout.
3695 SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed);
3696
3697 // Generate the compiled-to-native wrapper code
3698 nm = SharedRuntime::generate_native_wrapper(&_masm, method, compile_id, sig_bt, regs, ret_type);
3699
3700 if (nm != nullptr) {
3701 {
3702 MutexLocker pl(NMethodState_lock, Mutex::_no_safepoint_check_flag);
3703 if (nm->make_in_use()) {
3704 method->set_code(method, nm);
3705 }
3706 }
3707
3708 CompilerDirectiveMatcher matcher(method, CompLevel_simple);
3709 if (matcher.directive_set()->PrintAssemblyOption) {
3710 nm->print_code();
3711 }
3712 }
3713 }
3714 } // Unlock AdapterHandlerLibrary_lock
3715
3716
3717 // Install the generated code.
3718 if (nm != nullptr) {
3719 const char *msg = method->is_static() ? "(static)" : "";
3720 CompileTask::print_ul(nm, msg);
3721 if (PrintCompilation) {
3722 ttyLocker ttyl;
3723 CompileTask::print(tty, nm, msg);
3724 }
3725 nm->post_compiled_method_load_event();
3726 }
3727 }
3728
3729 // -------------------------------------------------------------------------
3730 // Java-Java calling convention
3731 // (what you use when Java calls Java)
3732
3733 //------------------------------name_for_receiver----------------------------------
3734 // For a given signature, return the VMReg for parameter 0.
3735 VMReg SharedRuntime::name_for_receiver() {
3736 VMRegPair regs;
3737 BasicType sig_bt = T_OBJECT;
3738 (void) java_calling_convention(&sig_bt, ®s, 1);
3739 // Return argument 0 register. In the LP64 build pointers
3740 // take 2 registers, but the VM wants only the 'main' name.
3741 return regs.first();
3742 }
3743
3744 VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) {
3745 // This method is returning a data structure allocating as a
3746 // ResourceObject, so do not put any ResourceMarks in here.
3747
3748 BasicType *sig_bt = NEW_RESOURCE_ARRAY(BasicType, 256);
3749 VMRegPair *regs = NEW_RESOURCE_ARRAY(VMRegPair, 256);
3750 int cnt = 0;
3751 if (has_receiver) {
3752 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
3753 }
3754
3755 for (SignatureStream ss(sig); !ss.at_return_type(); ss.next()) {
3756 BasicType type = ss.type();
3757 sig_bt[cnt++] = type;
3758 if (is_double_word_type(type))
3759 sig_bt[cnt++] = T_VOID;
3760 }
3761
3762 if (has_appendix) {
3763 sig_bt[cnt++] = T_OBJECT;
3764 }
3765
3766 assert(cnt < 256, "grow table size");
3767
3768 int comp_args_on_stack;
3769 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt);
3770
3771 // the calling convention doesn't count out_preserve_stack_slots so
3772 // we must add that in to get "true" stack offsets.
3773
3774 if (comp_args_on_stack) {
3775 for (int i = 0; i < cnt; i++) {
3776 VMReg reg1 = regs[i].first();
3777 if (reg1->is_stack()) {
3778 // Yuck
3779 reg1 = reg1->bias(out_preserve_stack_slots());
3780 }
3781 VMReg reg2 = regs[i].second();
3782 if (reg2->is_stack()) {
3783 // Yuck
3784 reg2 = reg2->bias(out_preserve_stack_slots());
3785 }
3786 regs[i].set_pair(reg2, reg1);
3787 }
3788 }
3789
3790 // results
3791 *arg_size = cnt;
3792 return regs;
3793 }
3794
3795 // OSR Migration Code
3796 //
3797 // This code is used convert interpreter frames into compiled frames. It is
3798 // called from very start of a compiled OSR nmethod. A temp array is
3799 // allocated to hold the interesting bits of the interpreter frame. All
3800 // active locks are inflated to allow them to move. The displaced headers and
3801 // active interpreter locals are copied into the temp buffer. Then we return
3802 // back to the compiled code. The compiled code then pops the current
3803 // interpreter frame off the stack and pushes a new compiled frame. Then it
3804 // copies the interpreter locals and displaced headers where it wants.
3805 // Finally it calls back to free the temp buffer.
3806 //
3807 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
3808
3809 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *current) )
3810 assert(current == JavaThread::current(), "pre-condition");
3811 JFR_ONLY(Jfr::check_and_process_sample_request(current);)
3812 // During OSR migration, we unwind the interpreted frame and replace it with a compiled
3813 // frame. The stack watermark code below ensures that the interpreted frame is processed
3814 // before it gets unwound. This is helpful as the size of the compiled frame could be
3815 // larger than the interpreted frame, which could result in the new frame not being
3816 // processed correctly.
3817 StackWatermarkSet::before_unwind(current);
3818
3819 //
3820 // This code is dependent on the memory layout of the interpreter local
3821 // array and the monitors. On all of our platforms the layout is identical
3822 // so this code is shared. If some platform lays the their arrays out
3823 // differently then this code could move to platform specific code or
3824 // the code here could be modified to copy items one at a time using
3825 // frame accessor methods and be platform independent.
3826
3827 frame fr = current->last_frame();
3828 assert(fr.is_interpreted_frame(), "");
3829 assert(fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks");
3830
3831 // Figure out how many monitors are active.
3832 int active_monitor_count = 0;
3833 for (BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
3834 kptr < fr.interpreter_frame_monitor_begin();
3835 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
3836 if (kptr->obj() != nullptr) active_monitor_count++;
3837 }
3838
3839 // QQQ we could place number of active monitors in the array so that compiled code
3840 // could double check it.
3841
3842 Method* moop = fr.interpreter_frame_method();
3843 int max_locals = moop->max_locals();
3844 // Allocate temp buffer, 1 word per local & 2 per active monitor
3845 int buf_size_words = max_locals + active_monitor_count * BasicObjectLock::size();
3846 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode);
3847
3848 // Copy the locals. Order is preserved so that loading of longs works.
3849 // Since there's no GC I can copy the oops blindly.
3850 assert(sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
3851 Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
3852 (HeapWord*)&buf[0],
3853 max_locals);
3854
3855 // Inflate locks. Copy the displaced headers. Be careful, there can be holes.
3856 int i = max_locals;
3857 for (BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
3858 kptr2 < fr.interpreter_frame_monitor_begin();
3859 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
3860 if (kptr2->obj() != nullptr) { // Avoid 'holes' in the monitor array
3861 BasicLock *lock = kptr2->lock();
3862 if (UseObjectMonitorTable) {
3863 buf[i] = (intptr_t)lock->object_monitor_cache();
3864 }
3865 #ifdef ASSERT
3866 else {
3867 buf[i] = badDispHeaderOSR;
3868 }
3869 #endif
3870 i++;
3871 buf[i++] = cast_from_oop<intptr_t>(kptr2->obj());
3872 }
3873 }
3874 assert(i - max_locals == active_monitor_count*2, "found the expected number of monitors");
3875
3876 RegisterMap map(current,
3877 RegisterMap::UpdateMap::skip,
3878 RegisterMap::ProcessFrames::include,
3879 RegisterMap::WalkContinuation::skip);
3880 frame sender = fr.sender(&map);
3881 if (sender.is_interpreted_frame()) {
3882 current->push_cont_fastpath(sender.unextended_sp());
3883 }
3884
3885 return buf;
3886 JRT_END
3887
3888 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
3889 FREE_C_HEAP_ARRAY(buf);
3890 JRT_END
3891
3892 const char* AdapterHandlerLibrary::name(AdapterHandlerEntry* handler) {
3893 return handler->fingerprint()->as_basic_args_string();
3894 }
3895
3896 uint32_t AdapterHandlerLibrary::id(AdapterHandlerEntry* handler) {
3897 return handler->id();
3898 }
3899
3900 void AdapterHandlerLibrary::print_handler_on(outputStream* st, const CodeBlob* b) {
3901 bool found = false;
3902 #if INCLUDE_CDS
3903 if (AOTCodeCache::is_using_adapter()) {
3904 auto findblob_archived_table = [&] (AdapterHandlerEntry* handler) {
3905 if (b == handler->adapter_blob()) {
3906 found = true;
3907 st->print("Adapter for signature: ");
3908 handler->print_adapter_on(st);
3909 return false; // abort iteration
3910 } else {
3911 return true; // keep looking
3912 }
3913 };
3914 _aot_adapter_handler_table.iterate(findblob_archived_table);
3915 }
3916 #endif // INCLUDE_CDS
3917 if (!found) {
3918 auto findblob_runtime_table = [&] (AdapterFingerPrint* key, AdapterHandlerEntry* handler) {
3919 if (b == handler->adapter_blob()) {
3920 found = true;
3921 st->print("Adapter for signature: ");
3922 handler->print_adapter_on(st);
3923 return false; // abort iteration
3924 } else {
3925 return true; // keep looking
3926 }
3927 };
3928 assert_locked_or_safepoint(AdapterHandlerLibrary_lock);
3929 _adapter_handler_table->iterate(findblob_runtime_table);
3930 }
3931 assert(found, "Should have found handler");
3932 }
3933
3934 void AdapterHandlerEntry::print_adapter_on(outputStream* st) const {
3935 st->print("AHE@" INTPTR_FORMAT ": %s", p2i(this), fingerprint()->as_string());
3936 if (adapter_blob() != nullptr) {
3937 st->print(" i2c: " INTPTR_FORMAT, p2i(get_i2c_entry()));
3938 st->print(" c2i: " INTPTR_FORMAT, p2i(get_c2i_entry()));
3939 st->print(" c2iVE: " INTPTR_FORMAT, p2i(get_c2i_inline_entry()));
3940 st->print(" c2iVROE: " INTPTR_FORMAT, p2i(get_c2i_inline_ro_entry()));
3941 st->print(" c2iUE: " INTPTR_FORMAT, p2i(get_c2i_unverified_entry()));
3942 st->print(" c2iUVE: " INTPTR_FORMAT, p2i(get_c2i_unverified_inline_entry()));
3943 if (get_c2i_no_clinit_check_entry() != nullptr) {
3944 st->print(" c2iNCI: " INTPTR_FORMAT, p2i(get_c2i_no_clinit_check_entry()));
3945 }
3946 }
3947 st->cr();
3948 }
3949
3950 #ifndef PRODUCT
3951
3952 void AdapterHandlerLibrary::print_statistics() {
3953 print_table_statistics();
3954 }
3955
3956 #endif /* PRODUCT */
3957
3958 JRT_LEAF(void, SharedRuntime::enable_stack_reserved_zone(JavaThread* current))
3959 assert(current == JavaThread::current(), "pre-condition");
3960 StackOverflow* overflow_state = current->stack_overflow_state();
3961 overflow_state->enable_stack_reserved_zone(/*check_if_disabled*/true);
3962 overflow_state->set_reserved_stack_activation(current->stack_base());
3963 JRT_END
3964
3965 frame SharedRuntime::look_for_reserved_stack_annotated_method(JavaThread* current, frame fr) {
3966 ResourceMark rm(current);
3967 frame activation;
3968 nmethod* nm = nullptr;
3969 int count = 1;
3970
3971 assert(fr.is_java_frame(), "Must start on Java frame");
3972
3973 RegisterMap map(JavaThread::current(),
3974 RegisterMap::UpdateMap::skip,
3975 RegisterMap::ProcessFrames::skip,
3976 RegisterMap::WalkContinuation::skip); // don't walk continuations
3977 for (; !fr.is_first_frame(); fr = fr.sender(&map)) {
3978 if (!fr.is_java_frame()) {
3979 continue;
3980 }
3981
3982 Method* method = nullptr;
3983 bool found = false;
3984 if (fr.is_interpreted_frame()) {
3985 method = fr.interpreter_frame_method();
3986 if (method != nullptr && method->has_reserved_stack_access()) {
3987 found = true;
3988 }
3989 } else {
3990 CodeBlob* cb = fr.cb();
3991 if (cb != nullptr && cb->is_nmethod()) {
3992 nm = cb->as_nmethod();
3993 method = nm->method();
3994 for (ScopeDesc *sd = nm->scope_desc_near(fr.pc()); sd != nullptr; sd = sd->sender()) {
3995 method = sd->method();
3996 if (method != nullptr && method->has_reserved_stack_access()) {
3997 found = true;
3998 }
3999 }
4000 }
4001 }
4002 if (found) {
4003 activation = fr;
4004 warning("Potentially dangerous stack overflow in "
4005 "ReservedStackAccess annotated method %s [%d]",
4006 method->name_and_sig_as_C_string(), count++);
4007 EventReservedStackActivation event;
4008 if (event.should_commit()) {
4009 event.set_method(method);
4010 event.commit();
4011 }
4012 }
4013 }
4014 return activation;
4015 }
4016
4017 void SharedRuntime::on_slowpath_allocation_exit(JavaThread* current) {
4018 // After any safepoint, just before going back to compiled code,
4019 // we inform the GC that we will be doing initializing writes to
4020 // this object in the future without emitting card-marks, so
4021 // GC may take any compensating steps.
4022
4023 oop new_obj = current->vm_result_oop();
4024 if (new_obj == nullptr) return;
4025
4026 BarrierSet *bs = BarrierSet::barrier_set();
4027 bs->on_slowpath_allocation_exit(current, new_obj);
4028 }
4029
4030 // We are at a compiled code to interpreter call. We need backing
4031 // buffers for all inline type arguments. Allocate an object array to
4032 // hold them (convenient because once we're done with it we don't have
4033 // to worry about freeing it).
4034 oop SharedRuntime::allocate_inline_types_impl(JavaThread* current, methodHandle callee, bool allocate_receiver, bool from_c1, TRAPS) {
4035 assert(InlineTypePassFieldsAsArgs, "no reason to call this");
4036 ResourceMark rm;
4037
4038 // Retrieve arguments passed at the call
4039 RegisterMap reg_map2(THREAD,
4040 RegisterMap::UpdateMap::include,
4041 RegisterMap::ProcessFrames::include,
4042 RegisterMap::WalkContinuation::skip);
4043 frame stubFrame = THREAD->last_frame();
4044 frame callerFrame = stubFrame.sender(®_map2);
4045 if (from_c1) {
4046 callerFrame = callerFrame.sender(®_map2);
4047 }
4048 int arg_size;
4049 const GrowableArray<SigEntry>* sig = allocate_receiver ? callee->adapter()->get_sig_cc() : callee->adapter()->get_sig_cc_ro();
4050 assert(sig != nullptr, "sig should never be null");
4051 TempNewSymbol tmp_sig = SigEntry::create_symbol(sig);
4052 VMRegPair* reg_pairs = find_callee_arguments(tmp_sig, false, false, &arg_size);
4053
4054 int nb_slots = 0;
4055 InstanceKlass* holder = callee->method_holder();
4056 allocate_receiver &= !callee->is_static() && holder->is_inline_klass() && callee->is_scalarized_arg(0);
4057 if (allocate_receiver) {
4058 nb_slots++;
4059 }
4060 int arg_num = callee->is_static() ? 0 : 1;
4061 for (SignatureStream ss(callee->signature()); !ss.at_return_type(); ss.next()) {
4062 BasicType bt = ss.type();
4063 if (bt == T_OBJECT && callee->is_scalarized_arg(arg_num)) {
4064 nb_slots++;
4065 }
4066 if (bt != T_VOID) {
4067 arg_num++;
4068 }
4069 }
4070 objArrayOop array_oop = nullptr;
4071 objArrayHandle array;
4072 arg_num = callee->is_static() ? 0 : 1;
4073 int i = 0;
4074 uint pos = 0;
4075 uint depth = 0;
4076 uint ignored = 0;
4077 if (allocate_receiver) {
4078 assert(sig->at(pos)._bt == T_METADATA, "scalarized value expected");
4079 pos++;
4080 ignored++;
4081 depth++;
4082 assert(sig->at(pos)._bt == T_OBJECT, "buffer argument");
4083 uint reg_pos = 0;
4084 assert(reg_pos < (uint)arg_size, "");
4085 VMRegPair reg_pair = reg_pairs[reg_pos];
4086 oop* buffer = callerFrame.oopmapreg_to_oop_location(reg_pair.first(), ®_map2);
4087 instanceHandle h_buffer(THREAD, (instanceOop)*buffer);
4088 InlineKlass* vk = InlineKlass::cast(holder);
4089 if (h_buffer.not_null()) {
4090 assert(h_buffer->klass() == vk, "buffer not of expected class");
4091 } else {
4092 // Only allocate if buffer passed at the call is null
4093 if (array_oop == nullptr) {
4094 array_oop = oopFactory::new_objectArray(nb_slots, CHECK_NULL);
4095 array = objArrayHandle(THREAD, array_oop);
4096 }
4097 oop res = vk->allocate_instance(CHECK_NULL);
4098 array->obj_at_put(i, res);
4099 }
4100 i++;
4101 }
4102 for (SignatureStream ss(callee->signature()); !ss.at_return_type(); ss.next()) {
4103 BasicType bt = ss.type();
4104 if (bt == T_OBJECT && callee->is_scalarized_arg(arg_num)) {
4105 while (true) {
4106 BasicType bt = sig->at(pos)._bt;
4107 if (bt == T_METADATA) {
4108 depth++;
4109 ignored++;
4110 if (depth == 1) {
4111 break;
4112 }
4113 } else if (bt == T_VOID && sig->at(pos - 1)._bt != T_LONG && sig->at(pos - 1)._bt != T_DOUBLE) {
4114 ignored++;
4115 depth--;
4116 }
4117 pos++;
4118 }
4119 pos++;
4120 assert(sig->at(pos)._bt == T_OBJECT, "buffer argument expected");
4121 uint reg_pos = pos - ignored;
4122 assert(reg_pos < (uint)arg_size, "out of bound register?");
4123 VMRegPair reg_pair = reg_pairs[reg_pos];
4124 oop* buffer = callerFrame.oopmapreg_to_oop_location(reg_pair.first(), ®_map2);
4125 instanceHandle h_buffer(THREAD, (instanceOop)*buffer);
4126 InlineKlass* vk = ss.as_inline_klass(holder);
4127 assert(vk != nullptr, "Unexpected klass");
4128 if (h_buffer.not_null()) {
4129 assert(h_buffer->klass() == vk, "buffer not of expected class");
4130 } else {
4131 // Only allocate if buffer passed at the call is null
4132 if (array_oop == nullptr) {
4133 array_oop = oopFactory::new_objectArray(nb_slots, CHECK_NULL);
4134 array = objArrayHandle(THREAD, array_oop);
4135 }
4136 oop res = vk->allocate_instance(CHECK_NULL);
4137 array->obj_at_put(i, res);
4138 }
4139 i++;
4140 }
4141 if (bt != T_VOID) {
4142 arg_num++;
4143 }
4144 }
4145 return array();
4146 }
4147
4148 JRT_ENTRY(void, SharedRuntime::allocate_inline_types(JavaThread* current, Method* callee_method, bool allocate_receiver))
4149 methodHandle callee(current, callee_method);
4150 oop array = SharedRuntime::allocate_inline_types_impl(current, callee, allocate_receiver, false, CHECK);
4151 current->set_vm_result_oop(array);
4152 JRT_END
4153
4154 // We're returning from an interpreted method: load each field into a
4155 // register following the calling convention
4156 JRT_LEAF(void, SharedRuntime::load_inline_type_fields_in_regs(JavaThread* current, oopDesc* res))
4157 {
4158 assert(res->klass()->is_inline_klass(), "only inline types here");
4159 ResourceMark rm;
4160 RegisterMap reg_map(current,
4161 RegisterMap::UpdateMap::include,
4162 RegisterMap::ProcessFrames::include,
4163 RegisterMap::WalkContinuation::skip);
4164 frame stubFrame = current->last_frame();
4165 frame callerFrame = stubFrame.sender(®_map);
4166 assert(callerFrame.is_interpreted_frame(), "should be coming from interpreter");
4167
4168 InlineKlass* vk = InlineKlass::cast(res->klass());
4169
4170 const Array<SigEntry>* sig_vk = vk->extended_sig();
4171 const Array<VMRegPair>* regs = vk->return_regs();
4172
4173 if (regs == nullptr) {
4174 // The fields of the inline klass don't fit in registers, bail out
4175 return;
4176 }
4177
4178 int j = 1;
4179 for (int i = 0; i < sig_vk->length(); i++) {
4180 BasicType bt = sig_vk->at(i)._bt;
4181 if (bt == T_METADATA) {
4182 continue;
4183 }
4184 if (bt == T_VOID) {
4185 if (sig_vk->at(i-1)._bt == T_LONG ||
4186 sig_vk->at(i-1)._bt == T_DOUBLE) {
4187 j++;
4188 }
4189 continue;
4190 }
4191 int off = sig_vk->at(i)._offset;
4192 assert(off > 0, "offset in object should be positive");
4193 VMRegPair pair = regs->at(j);
4194 address loc = reg_map.location(pair.first(), nullptr);
4195 guarantee(loc != nullptr, "bad register save location");
4196 switch(bt) {
4197 case T_BOOLEAN:
4198 *(jboolean*)loc = res->bool_field(off);
4199 break;
4200 case T_CHAR:
4201 *(jchar*)loc = res->char_field(off);
4202 break;
4203 case T_BYTE:
4204 *(jbyte*)loc = res->byte_field(off);
4205 break;
4206 case T_SHORT:
4207 *(jshort*)loc = res->short_field(off);
4208 break;
4209 case T_INT: {
4210 *(jint*)loc = res->int_field(off);
4211 break;
4212 }
4213 case T_LONG:
4214 #ifdef _LP64
4215 *(intptr_t*)loc = res->long_field(off);
4216 #else
4217 Unimplemented();
4218 #endif
4219 break;
4220 case T_OBJECT:
4221 case T_ARRAY: {
4222 *(oop*)loc = res->obj_field(off);
4223 break;
4224 }
4225 case T_FLOAT:
4226 *(jfloat*)loc = res->float_field(off);
4227 break;
4228 case T_DOUBLE:
4229 *(jdouble*)loc = res->double_field(off);
4230 break;
4231 default:
4232 ShouldNotReachHere();
4233 }
4234 j++;
4235 }
4236 assert(j == regs->length(), "missed a field?");
4237
4238 #ifdef ASSERT
4239 VMRegPair pair = regs->at(0);
4240 address loc = reg_map.location(pair.first(), nullptr);
4241 assert(*(oopDesc**)loc == res, "overwritten object");
4242 #endif
4243
4244 current->set_vm_result_oop(res);
4245 }
4246 JRT_END
4247
4248 // We've returned to an interpreted method, the interpreter needs a
4249 // reference to an inline type instance. Allocate it and initialize it
4250 // from field's values in registers.
4251 JRT_BLOCK_ENTRY(void, SharedRuntime::store_inline_type_fields_to_buf(JavaThread* current, intptr_t res))
4252 {
4253 if (!is_set_nth_bit(res, 0)) {
4254 // We're not returning with inline type fields in registers (the
4255 // calling convention didn't allow it for this inline klass)
4256 assert(!Metaspace::contains((void*)res), "should be oop or pointer in buffer area");
4257 current->set_vm_result_oop((oopDesc*)res);
4258 current->set_vm_result_metadata(nullptr);
4259 return;
4260 }
4261
4262 clear_nth_bit(res, 0);
4263 InlineKlass* vk = (InlineKlass*)res;
4264 assert(Metaspace::contains((void*)res), "should be klass");
4265
4266 if (!vk->contains_oops()) {
4267 // No oop fields. Initialize the fields by calling the pack handler from
4268 // the stub which is much faster (see 'generate_return_value_stub').
4269 // Signal this by setting the metadata result to the value klass.
4270 JRT_BLOCK;
4271 {
4272 oop vt = vk->allocate_instance(CHECK);
4273 current->set_vm_result_oop(vt);
4274 current->set_vm_result_metadata(vk);
4275 }
4276 JRT_BLOCK_END;
4277 return;
4278 }
4279
4280 ResourceMark rm;
4281 RegisterMap reg_map(current,
4282 RegisterMap::UpdateMap::include,
4283 RegisterMap::ProcessFrames::include,
4284 RegisterMap::WalkContinuation::skip);
4285 frame stubFrame = current->last_frame();
4286 stubFrame.sender(®_map);
4287
4288 assert(vk == InlineKlass::returned_inline_klass(reg_map), "broken calling convention");
4289
4290 // Allocate handles for every oop field so they are safe in case of
4291 // a safepoint when allocating
4292 GrowableArray<Handle> handles;
4293 vk->save_oop_fields(reg_map, handles);
4294
4295 // It's unsafe to safepoint until we are here
4296 JRT_BLOCK;
4297 {
4298 oop vt = vk->realloc_result(reg_map, handles, CHECK);
4299 current->set_vm_result_oop(vt);
4300 current->set_vm_result_metadata(nullptr);
4301 }
4302 JRT_BLOCK_END;
4303 }
4304 JRT_END