1 /* 2 * Copyright (c) 1997, 2023, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "compiler/disassembler.hpp" 27 #include "interpreter/interpreter.hpp" 28 #include "interpreter/interpreterRuntime.hpp" 29 #include "interpreter/interp_masm.hpp" 30 #include "interpreter/templateInterpreter.hpp" 31 #include "interpreter/templateInterpreterGenerator.hpp" 32 #include "interpreter/templateTable.hpp" 33 #include "oops/methodData.hpp" 34 35 #define __ Disassembler::hook<InterpreterMacroAssembler>(__FILE__, __LINE__, _masm)-> 36 37 TemplateInterpreterGenerator::TemplateInterpreterGenerator(): AbstractInterpreterGenerator() { 38 _unimplemented_bytecode = nullptr; 39 _illegal_bytecode_sequence = nullptr; 40 generate_all(); 41 } 42 43 static const BasicType types[Interpreter::number_of_result_handlers] = { 44 T_BOOLEAN, 45 T_CHAR , 46 T_BYTE , 47 T_SHORT , 48 T_INT , 49 T_LONG , 50 T_VOID , 51 T_FLOAT , 52 T_DOUBLE , 53 T_OBJECT 54 }; 55 56 void TemplateInterpreterGenerator::generate_all() { 57 { CodeletMark cm(_masm, "slow signature handler"); 58 AbstractInterpreter::_slow_signature_handler = generate_slow_signature_handler(); 59 } 60 61 { CodeletMark cm(_masm, "error exits"); 62 _unimplemented_bytecode = generate_error_exit("unimplemented bytecode"); 63 _illegal_bytecode_sequence = generate_error_exit("illegal bytecode sequence - method not verified"); 64 } 65 66 #ifndef PRODUCT 67 if (TraceBytecodes) { 68 CodeletMark cm(_masm, "bytecode tracing support"); 69 Interpreter::_trace_code = 70 EntryPoint( 71 generate_trace_code(atos), 72 generate_trace_code(itos), 73 generate_trace_code(ltos), 74 generate_trace_code(ftos), 75 generate_trace_code(dtos), 76 generate_trace_code(vtos) 77 ); 78 } 79 #endif // !PRODUCT 80 81 { CodeletMark cm(_masm, "return entry points"); 82 Interpreter::_return_entry[0] = EntryPoint(); 83 for (int i = 1; i < Interpreter::number_of_return_entries; i++) { 84 Interpreter::_return_entry[i] = 85 EntryPoint( 86 generate_return_entry_for(atos, i, sizeof(u2)), 87 generate_return_entry_for(itos, i, sizeof(u2)), 88 generate_return_entry_for(ltos, i, sizeof(u2)), 89 generate_return_entry_for(ftos, i, sizeof(u2)), 90 generate_return_entry_for(dtos, i, sizeof(u2)), 91 generate_return_entry_for(vtos, i, sizeof(u2)) 92 ); 93 } 94 } 95 96 { CodeletMark cm(_masm, "invoke return entry points"); 97 // These states are in order specified in TosState, except btos/ztos/ctos/stos which 98 // are the same as itos since there is no top of stack optimization for these types 99 const TosState states[] = {ilgl, ilgl, ilgl, ilgl, itos, ltos, ftos, dtos, atos, vtos, ilgl}; 100 const int invoke_length = Bytecodes::length_for(Bytecodes::_invokestatic); 101 const int invokeinterface_length = Bytecodes::length_for(Bytecodes::_invokeinterface); 102 const int invokedynamic_length = Bytecodes::length_for(Bytecodes::_invokedynamic); 103 104 assert(invoke_length >= 0 && invoke_length < Interpreter::number_of_return_entries, "invariant"); 105 assert(invokeinterface_length >= 0 && invokeinterface_length < Interpreter::number_of_return_entries, "invariant"); 106 107 for (int i = itos; i < Interpreter::number_of_return_addrs; i++) { 108 TosState state = states[i]; 109 assert(state != ilgl, "states array is wrong above"); 110 111 // Reuse generated entry points 112 Interpreter::_invoke_return_entry[i] = Interpreter::_return_entry[invoke_length].entry(state); 113 Interpreter::_invokeinterface_return_entry[i] = Interpreter::_return_entry[invokeinterface_length].entry(state); 114 115 Interpreter::_invokedynamic_return_entry[i] = generate_return_entry_for(state, invokedynamic_length, sizeof(u4)); 116 } 117 118 // set itos entry points for btos/ztos/ctos/stos 119 for (int i = 0; i < itos; i++) { 120 Interpreter::_invoke_return_entry[i] = Interpreter::_invoke_return_entry[itos]; 121 Interpreter::_invokeinterface_return_entry[i] = Interpreter::_invokeinterface_return_entry[itos]; 122 Interpreter::_invokedynamic_return_entry[i] = Interpreter::_invokedynamic_return_entry[itos]; 123 } 124 } 125 126 { CodeletMark cm(_masm, "earlyret entry points"); 127 Interpreter::_earlyret_entry = 128 EntryPoint( 129 generate_earlyret_entry_for(atos), 130 generate_earlyret_entry_for(itos), 131 generate_earlyret_entry_for(ltos), 132 generate_earlyret_entry_for(ftos), 133 generate_earlyret_entry_for(dtos), 134 generate_earlyret_entry_for(vtos) 135 ); 136 } 137 138 { CodeletMark cm(_masm, "result handlers for native calls"); 139 // The various result converter stublets. 140 int is_generated[Interpreter::number_of_result_handlers]; 141 memset(is_generated, 0, sizeof(is_generated)); 142 143 for (int i = 0; i < Interpreter::number_of_result_handlers; i++) { 144 BasicType type = types[i]; 145 if (!is_generated[Interpreter::BasicType_as_index(type)]++) { 146 Interpreter::_native_abi_to_tosca[Interpreter::BasicType_as_index(type)] = generate_result_handler_for(type); 147 } 148 } 149 } 150 151 152 { CodeletMark cm(_masm, "safepoint entry points"); 153 Interpreter::_safept_entry = 154 EntryPoint( 155 generate_safept_entry_for(atos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 156 generate_safept_entry_for(itos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 157 generate_safept_entry_for(ltos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 158 generate_safept_entry_for(ftos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 159 generate_safept_entry_for(dtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 160 generate_safept_entry_for(vtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)) 161 ); 162 } 163 164 { CodeletMark cm(_masm, "exception handling"); 165 // (Note: this is not safepoint safe because thread may return to compiled code) 166 generate_throw_exception(); 167 } 168 169 { CodeletMark cm(_masm, "throw exception entrypoints"); 170 Interpreter::_throw_ArrayIndexOutOfBoundsException_entry = generate_ArrayIndexOutOfBounds_handler(); 171 Interpreter::_throw_ArrayStoreException_entry = generate_klass_exception_handler("java/lang/ArrayStoreException"); 172 Interpreter::_throw_ArithmeticException_entry = generate_exception_handler("java/lang/ArithmeticException", "/ by zero"); 173 Interpreter::_throw_ClassCastException_entry = generate_ClassCastException_handler(); 174 Interpreter::_throw_NullPointerException_entry = generate_exception_handler("java/lang/NullPointerException", nullptr); 175 Interpreter::_throw_StackOverflowError_entry = generate_StackOverflowError_handler(); 176 } 177 178 { CodeletMark cm(_masm, "preemption rerun adapter"); 179 Interpreter::_cont_preempt_rerun_interpreter_adapter = generate_cont_preempt_rerun_interpreter_adapter(); 180 } 181 182 #define method_entry(kind) \ 183 { CodeletMark cm(_masm, "method entry point (kind = " #kind ")"); \ 184 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind, false); \ 185 } 186 187 // all non-native method kinds 188 method_entry(zerolocals) 189 method_entry(zerolocals_synchronized) 190 method_entry(empty) 191 method_entry(getter) 192 method_entry(setter) 193 method_entry(abstract) 194 method_entry(java_lang_math_sin ) 195 method_entry(java_lang_math_cos ) 196 method_entry(java_lang_math_tan ) 197 method_entry(java_lang_math_abs ) 198 method_entry(java_lang_math_sqrt ) 199 method_entry(java_lang_math_sqrt_strict) 200 method_entry(java_lang_math_log ) 201 method_entry(java_lang_math_log10) 202 method_entry(java_lang_math_exp ) 203 method_entry(java_lang_math_pow ) 204 method_entry(java_lang_math_fmaF ) 205 method_entry(java_lang_math_fmaD ) 206 method_entry(java_lang_ref_reference_get) 207 AbstractInterpreter::initialize_method_handle_entries(); 208 209 method_entry(java_util_zip_CRC32C_updateBytes) 210 method_entry(java_util_zip_CRC32C_updateDirectByteBuffer) 211 212 method_entry(java_lang_Float_float16ToFloat); 213 method_entry(java_lang_Float_floatToFloat16); 214 215 #undef method_entry 216 217 // all native method kinds 218 #define native_method_entry(kind) \ 219 { CodeletMark cm(_masm, "native method entry point (kind = " #kind ")"); \ 220 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind, true); \ 221 } 222 223 native_method_entry(native) 224 native_method_entry(native_synchronized) 225 226 // Entries to intrinsics for native methods should follow 227 // entries for `native` methods to use the same address in case 228 // intrinsic is disabled. 229 native_method_entry(java_lang_Thread_currentThread) 230 231 native_method_entry(java_util_zip_CRC32_update) 232 native_method_entry(java_util_zip_CRC32_updateBytes) 233 native_method_entry(java_util_zip_CRC32_updateByteBuffer) 234 235 native_method_entry(java_lang_Float_intBitsToFloat) 236 native_method_entry(java_lang_Float_floatToRawIntBits) 237 native_method_entry(java_lang_Double_longBitsToDouble) 238 native_method_entry(java_lang_Double_doubleToRawLongBits) 239 240 #undef native_method_entry 241 242 // Bytecodes 243 set_entry_points_for_all_bytes(); 244 245 // installation of code in other places in the runtime 246 // (ExcutableCodeManager calls not needed to copy the entries) 247 set_safepoints_for_all_bytes(); 248 249 { CodeletMark cm(_masm, "deoptimization entry points"); 250 Interpreter::_deopt_entry[0] = EntryPoint(); 251 Interpreter::_deopt_entry[0].set_entry(vtos, generate_deopt_entry_for(vtos, 0)); 252 for (int i = 1; i < Interpreter::number_of_deopt_entries; i++) { 253 Interpreter::_deopt_entry[i] = 254 EntryPoint( 255 generate_deopt_entry_for(atos, i), 256 generate_deopt_entry_for(itos, i), 257 generate_deopt_entry_for(ltos, i), 258 generate_deopt_entry_for(ftos, i), 259 generate_deopt_entry_for(dtos, i), 260 generate_deopt_entry_for(vtos, i) 261 ); 262 } 263 address return_continuation = Interpreter::_normal_table.entry(Bytecodes::_return).entry(vtos); 264 vmassert(return_continuation != nullptr, "return entry not generated yet"); 265 Interpreter::_deopt_reexecute_return_entry = generate_deopt_entry_for(vtos, 0, return_continuation); 266 } 267 268 } 269 270 //------------------------------------------------------------------------------------------------------------------------ 271 272 address TemplateInterpreterGenerator::generate_error_exit(const char* msg) { 273 address entry = __ pc(); 274 __ stop(msg); 275 return entry; 276 } 277 278 279 //------------------------------------------------------------------------------------------------------------------------ 280 281 void TemplateInterpreterGenerator::set_entry_points_for_all_bytes() { 282 for (int i = 0; i < DispatchTable::length; i++) { 283 Bytecodes::Code code = (Bytecodes::Code)i; 284 if (Bytecodes::is_defined(code)) { 285 set_entry_points(code); 286 } else { 287 set_unimplemented(i); 288 } 289 } 290 } 291 292 293 void TemplateInterpreterGenerator::set_safepoints_for_all_bytes() { 294 for (int i = 0; i < DispatchTable::length; i++) { 295 Bytecodes::Code code = (Bytecodes::Code)i; 296 if (Bytecodes::is_defined(code)) Interpreter::_safept_table.set_entry(code, Interpreter::_safept_entry); 297 } 298 } 299 300 301 void TemplateInterpreterGenerator::set_unimplemented(int i) { 302 address e = _unimplemented_bytecode; 303 EntryPoint entry(e, e, e, e, e, e, e, e, e, e); 304 Interpreter::_normal_table.set_entry(i, entry); 305 Interpreter::_wentry_point[i] = _unimplemented_bytecode; 306 } 307 308 309 void TemplateInterpreterGenerator::set_entry_points(Bytecodes::Code code) { 310 CodeletMark cm(_masm, Bytecodes::name(code), code); 311 // initialize entry points 312 assert(_unimplemented_bytecode != nullptr, "should have been generated before"); 313 assert(_illegal_bytecode_sequence != nullptr, "should have been generated before"); 314 address bep = _illegal_bytecode_sequence; 315 address zep = _illegal_bytecode_sequence; 316 address cep = _illegal_bytecode_sequence; 317 address sep = _illegal_bytecode_sequence; 318 address aep = _illegal_bytecode_sequence; 319 address iep = _illegal_bytecode_sequence; 320 address lep = _illegal_bytecode_sequence; 321 address fep = _illegal_bytecode_sequence; 322 address dep = _illegal_bytecode_sequence; 323 address vep = _unimplemented_bytecode; 324 address wep = _unimplemented_bytecode; 325 // code for short & wide version of bytecode 326 if (Bytecodes::is_defined(code)) { 327 Template* t = TemplateTable::template_for(code); 328 assert(t->is_valid(), "just checking"); 329 set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); 330 } 331 if (Bytecodes::wide_is_defined(code)) { 332 Template* t = TemplateTable::template_for_wide(code); 333 assert(t->is_valid(), "just checking"); 334 set_wide_entry_point(t, wep); 335 } 336 // set entry points 337 EntryPoint entry(bep, zep, cep, sep, aep, iep, lep, fep, dep, vep); 338 Interpreter::_normal_table.set_entry(code, entry); 339 Interpreter::_wentry_point[code] = wep; 340 } 341 342 343 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) { 344 assert(t->is_valid(), "template must exist"); 345 assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions"); 346 wep = __ pc(); generate_and_dispatch(t); 347 } 348 349 350 void TemplateInterpreterGenerator::set_short_entry_points(Template* t, address& bep, address& cep, address& sep, address& aep, address& iep, address& lep, address& fep, address& dep, address& vep) { 351 assert(t->is_valid(), "template must exist"); 352 switch (t->tos_in()) { 353 case btos: 354 case ztos: 355 case ctos: 356 case stos: 357 ShouldNotReachHere(); // btos/ctos/stos should use itos. 358 break; 359 case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break; 360 case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break; 361 case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break; 362 case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break; 363 case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break; 364 case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); break; 365 default : ShouldNotReachHere(); break; 366 } 367 } 368 369 370 //------------------------------------------------------------------------------------------------------------------------ 371 372 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) { 373 #ifndef PRODUCT 374 // debugging code 375 if (CountBytecodes || TraceBytecodes || StopInterpreterAt > 0) count_bytecode(); 376 if (PrintBytecodeHistogram) histogram_bytecode(t); 377 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t); 378 if (TraceBytecodes) trace_bytecode(t); 379 if (StopInterpreterAt > 0) stop_interpreter_at(); 380 __ verify_FPU(1, t->tos_in()); 381 #endif // !PRODUCT 382 int step = 0; 383 if (!t->does_dispatch()) { 384 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode()); 385 if (tos_out == ilgl) tos_out = t->tos_out(); 386 // compute bytecode size 387 assert(step > 0, "just checkin'"); 388 // setup stuff for dispatching next bytecode 389 if (ProfileInterpreter && VerifyDataPointer 390 && MethodData::bytecode_has_profile(t->bytecode())) { 391 __ verify_method_data_pointer(); 392 } 393 __ dispatch_prolog(tos_out, step); 394 } 395 // generate template 396 t->generate(_masm); 397 // advance 398 if (t->does_dispatch()) { 399 #ifdef ASSERT 400 // make sure execution doesn't go beyond this point if code is broken 401 __ should_not_reach_here(); 402 #endif // ASSERT 403 } else { 404 // dispatch to next bytecode 405 __ dispatch_epilog(tos_out, step); 406 } 407 } 408 409 // Generate method entries 410 address TemplateInterpreterGenerator::generate_method_entry( 411 AbstractInterpreter::MethodKind kind, bool native) { 412 // determine code generation flags 413 bool synchronized = false; 414 address entry_point = nullptr; 415 416 switch (kind) { 417 case Interpreter::zerolocals : break; 418 case Interpreter::zerolocals_synchronized: synchronized = true; break; 419 case Interpreter::native : break; 420 case Interpreter::native_synchronized : synchronized = true; break; 421 case Interpreter::empty : break; 422 case Interpreter::getter : break; 423 case Interpreter::setter : break; 424 case Interpreter::abstract : entry_point = generate_abstract_entry(); break; 425 default: 426 entry_point = generate_intrinsic_entry(kind); // process the rest 427 break; 428 } 429 430 if (entry_point) { 431 return entry_point; 432 } 433 434 // We expect the normal and native entry points to be generated first so we can reuse them. 435 if (native) { 436 entry_point = Interpreter::entry_for_kind(synchronized ? Interpreter::native_synchronized : Interpreter::native); 437 if (entry_point == nullptr) { 438 entry_point = generate_native_entry(synchronized); 439 } 440 } else { 441 entry_point = Interpreter::entry_for_kind(synchronized ? Interpreter::zerolocals_synchronized : Interpreter::zerolocals); 442 if (entry_point == nullptr) { 443 entry_point = generate_normal_entry(synchronized); 444 } 445 } 446 447 return entry_point; 448 } 449 450 // Generate intrinsic method entries 451 address TemplateInterpreterGenerator::generate_intrinsic_entry(AbstractInterpreter::MethodKind kind) { 452 if (!InlineIntrinsics || !vmIntrinsics::is_intrinsic_available(AbstractInterpreter::method_intrinsic(kind))) { 453 return nullptr; 454 } 455 456 address entry_point = nullptr; 457 458 switch (kind) { 459 case Interpreter::java_lang_math_sin : // fall thru 460 case Interpreter::java_lang_math_cos : // fall thru 461 case Interpreter::java_lang_math_tan : // fall thru 462 case Interpreter::java_lang_math_abs : // fall thru 463 case Interpreter::java_lang_math_log : // fall thru 464 case Interpreter::java_lang_math_log10 : // fall thru 465 case Interpreter::java_lang_math_sqrt : // fall thru 466 case Interpreter::java_lang_math_pow : // fall thru 467 case Interpreter::java_lang_math_exp : // fall thru 468 case Interpreter::java_lang_math_fmaD : // fall thru 469 case Interpreter::java_lang_math_fmaF : entry_point = generate_math_entry(kind); break; 470 case Interpreter::java_lang_math_sqrt_strict 471 : entry_point = generate_math_entry(Interpreter::java_lang_math_sqrt); break; 472 case Interpreter::java_lang_ref_reference_get 473 : entry_point = generate_Reference_get_entry(); break; 474 case Interpreter::java_util_zip_CRC32_update 475 : entry_point = generate_CRC32_update_entry(); break; 476 case Interpreter::java_util_zip_CRC32_updateBytes 477 : // fall thru 478 case Interpreter::java_util_zip_CRC32_updateByteBuffer 479 : entry_point = generate_CRC32_updateBytes_entry(kind); break; 480 case Interpreter::java_util_zip_CRC32C_updateBytes 481 : // fall thru 482 case Interpreter::java_util_zip_CRC32C_updateDirectByteBuffer 483 : entry_point = generate_CRC32C_updateBytes_entry(kind); break; 484 case Interpreter::java_lang_Thread_currentThread 485 : entry_point = generate_currentThread(); break; 486 case Interpreter::java_lang_Float_float16ToFloat 487 : entry_point = generate_Float_float16ToFloat_entry(); break; 488 case Interpreter::java_lang_Float_floatToFloat16 489 : entry_point = generate_Float_floatToFloat16_entry(); break; 490 491 // On x86_32 platforms, a special entry is generated for the following four methods. 492 // On other platforms the native entry is used to enter these methods. 493 case Interpreter::java_lang_Float_intBitsToFloat 494 : entry_point = generate_Float_intBitsToFloat_entry(); break; 495 case Interpreter::java_lang_Float_floatToRawIntBits 496 : entry_point = generate_Float_floatToRawIntBits_entry(); break; 497 case Interpreter::java_lang_Double_longBitsToDouble 498 : entry_point = generate_Double_longBitsToDouble_entry(); break; 499 case Interpreter::java_lang_Double_doubleToRawLongBits 500 : entry_point = generate_Double_doubleToRawLongBits_entry(); break; 501 default: 502 fatal("unexpected intrinsic method kind: %d", kind); 503 break; 504 } 505 return entry_point; 506 } 507