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