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