1 /* 2 * Copyright (c) 1997, 2015, 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(ctos), 78 generate_trace_code(stos), 79 generate_trace_code(atos), 80 generate_trace_code(itos), 81 generate_trace_code(ltos), 82 generate_trace_code(ftos), 83 generate_trace_code(dtos), 84 generate_trace_code(vtos) 85 ); 86 } 87 #endif // !PRODUCT 88 89 { CodeletMark cm(_masm, "return entry points"); 90 const int index_size = sizeof(u2); 91 for (int i = 0; i < Interpreter::number_of_return_entries; i++) { 92 Interpreter::_return_entry[i] = 93 EntryPoint( 94 generate_return_entry_for(itos, i, index_size), 95 generate_return_entry_for(itos, i, index_size), 96 generate_return_entry_for(itos, i, index_size), 97 generate_return_entry_for(atos, i, index_size), 98 generate_return_entry_for(itos, i, index_size), 99 generate_return_entry_for(ltos, i, index_size), 100 generate_return_entry_for(ftos, i, index_size), 101 generate_return_entry_for(dtos, i, index_size), 102 generate_return_entry_for(vtos, i, index_size) 103 ); 104 } 105 } 106 107 { CodeletMark cm(_masm, "invoke return entry points"); 108 const TosState states[] = {itos, itos, itos, itos, ltos, ftos, dtos, atos, vtos}; 109 const int invoke_length = Bytecodes::length_for(Bytecodes::_invokestatic); 110 const int invokeinterface_length = Bytecodes::length_for(Bytecodes::_invokeinterface); 111 const int invokedynamic_length = Bytecodes::length_for(Bytecodes::_invokedynamic); 112 113 for (int i = 0; i < Interpreter::number_of_return_addrs; i++) { 114 TosState state = states[i]; 115 Interpreter::_invoke_return_entry[i] = generate_return_entry_for(state, invoke_length, sizeof(u2)); 116 Interpreter::_invokeinterface_return_entry[i] = generate_return_entry_for(state, invokeinterface_length, sizeof(u2)); 117 Interpreter::_invokedynamic_return_entry[i] = generate_return_entry_for(state, invokedynamic_length, sizeof(u4)); 118 } 119 } 120 121 { CodeletMark cm(_masm, "earlyret entry points"); 122 Interpreter::_earlyret_entry = 123 EntryPoint( 124 generate_earlyret_entry_for(btos), 125 generate_earlyret_entry_for(ctos), 126 generate_earlyret_entry_for(stos), 127 generate_earlyret_entry_for(atos), 128 generate_earlyret_entry_for(itos), 129 generate_earlyret_entry_for(ltos), 130 generate_earlyret_entry_for(ftos), 131 generate_earlyret_entry_for(dtos), 132 generate_earlyret_entry_for(vtos) 133 ); 134 } 135 136 { CodeletMark cm(_masm, "deoptimization entry points"); 137 for (int i = 0; i < Interpreter::number_of_deopt_entries; i++) { 138 Interpreter::_deopt_entry[i] = 139 EntryPoint( 140 generate_deopt_entry_for(itos, i), 141 generate_deopt_entry_for(itos, i), 142 generate_deopt_entry_for(itos, i), 143 generate_deopt_entry_for(atos, i), 144 generate_deopt_entry_for(itos, i), 145 generate_deopt_entry_for(ltos, i), 146 generate_deopt_entry_for(ftos, i), 147 generate_deopt_entry_for(dtos, i), 148 generate_deopt_entry_for(vtos, i) 149 ); 150 } 151 } 152 153 { CodeletMark cm(_masm, "result handlers for native calls"); 154 // The various result converter stublets. 155 int is_generated[Interpreter::number_of_result_handlers]; 156 memset(is_generated, 0, sizeof(is_generated)); 157 158 for (int i = 0; i < Interpreter::number_of_result_handlers; i++) { 159 BasicType type = types[i]; 160 if (!is_generated[Interpreter::BasicType_as_index(type)]++) { 161 Interpreter::_native_abi_to_tosca[Interpreter::BasicType_as_index(type)] = generate_result_handler_for(type); 162 } 163 } 164 } 165 166 { CodeletMark cm(_masm, "continuation entry points"); 167 Interpreter::_continuation_entry = 168 EntryPoint( 169 generate_continuation_for(btos), 170 generate_continuation_for(ctos), 171 generate_continuation_for(stos), 172 generate_continuation_for(atos), 173 generate_continuation_for(itos), 174 generate_continuation_for(ltos), 175 generate_continuation_for(ftos), 176 generate_continuation_for(dtos), 177 generate_continuation_for(vtos) 178 ); 179 } 180 181 { CodeletMark cm(_masm, "safepoint entry points"); 182 Interpreter::_safept_entry = 183 EntryPoint( 184 generate_safept_entry_for(btos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 185 generate_safept_entry_for(ctos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 186 generate_safept_entry_for(stos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 187 generate_safept_entry_for(atos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 188 generate_safept_entry_for(itos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 189 generate_safept_entry_for(ltos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 190 generate_safept_entry_for(ftos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 191 generate_safept_entry_for(dtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)), 192 generate_safept_entry_for(vtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)) 193 ); 194 } 195 196 { CodeletMark cm(_masm, "exception handling"); 197 // (Note: this is not safepoint safe because thread may return to compiled code) 198 generate_throw_exception(); 199 } 200 201 { CodeletMark cm(_masm, "throw exception entrypoints"); 202 Interpreter::_throw_ArrayIndexOutOfBoundsException_entry = generate_ArrayIndexOutOfBounds_handler("java/lang/ArrayIndexOutOfBoundsException"); 203 Interpreter::_throw_ArrayStoreException_entry = generate_klass_exception_handler("java/lang/ArrayStoreException" ); 204 Interpreter::_throw_ArithmeticException_entry = generate_exception_handler("java/lang/ArithmeticException" , "/ by zero"); 205 Interpreter::_throw_ClassCastException_entry = generate_ClassCastException_handler(); 206 Interpreter::_throw_NullPointerException_entry = generate_exception_handler("java/lang/NullPointerException" , NULL ); 207 Interpreter::_throw_StackOverflowError_entry = generate_StackOverflowError_handler(); 208 } 209 210 211 212 #define method_entry(kind) \ 213 { CodeletMark cm(_masm, "method entry point (kind = " #kind ")"); \ 214 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind); \ 215 } 216 217 // all non-native method kinds 218 method_entry(zerolocals) 219 method_entry(zerolocals_synchronized) 220 method_entry(empty) 221 method_entry(accessor) 222 method_entry(abstract) 223 method_entry(java_lang_math_sin ) 224 method_entry(java_lang_math_cos ) 225 method_entry(java_lang_math_tan ) 226 method_entry(java_lang_math_abs ) 227 method_entry(java_lang_math_sqrt ) 228 method_entry(java_lang_math_log ) 229 method_entry(java_lang_math_log10) 230 method_entry(java_lang_math_exp ) 231 method_entry(java_lang_math_pow ) 232 method_entry(java_lang_ref_reference_get) 233 234 AbstractInterpreter::initialize_method_handle_entries(); 235 236 // all native method kinds (must be one contiguous block) 237 Interpreter::_native_entry_begin = Interpreter::code()->code_end(); 238 method_entry(native) 239 method_entry(native_synchronized) 240 Interpreter::_native_entry_end = Interpreter::code()->code_end(); 241 242 if (UseCRC32Intrinsics) { 243 method_entry(java_util_zip_CRC32_update) 244 method_entry(java_util_zip_CRC32_updateBytes) 245 method_entry(java_util_zip_CRC32_updateByteBuffer) 246 } 247 248 if (UseCRC32CIntrinsics) { 249 method_entry(java_util_zip_CRC32C_updateBytes) 250 method_entry(java_util_zip_CRC32C_updateDirectByteBuffer) 251 } 252 253 method_entry(java_lang_Float_intBitsToFloat); 254 method_entry(java_lang_Float_floatToRawIntBits); 255 method_entry(java_lang_Double_longBitsToDouble); 256 method_entry(java_lang_Double_doubleToRawLongBits); 257 258 #undef method_entry 259 260 // Bytecodes 261 set_entry_points_for_all_bytes(); 262 } 263 } while (CodeCacheExtensions::needs_other_interpreter_variant()); 264 265 // installation of code in other places in the runtime 266 // (ExcutableCodeManager calls not needed to copy the entries) 267 set_safepoints_for_all_bytes(); 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); 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 if (CodeCacheExtensions::skip_template_interpreter_entries(code)) { 311 return; 312 } 313 CodeletMark cm(_masm, Bytecodes::name(code), code); 314 // initialize entry points 315 assert(_unimplemented_bytecode != NULL, "should have been generated before"); 316 assert(_illegal_bytecode_sequence != NULL, "should have been generated before"); 317 address bep = _illegal_bytecode_sequence; 318 address cep = _illegal_bytecode_sequence; 319 address sep = _illegal_bytecode_sequence; 320 address aep = _illegal_bytecode_sequence; 321 address iep = _illegal_bytecode_sequence; 322 address lep = _illegal_bytecode_sequence; 323 address fep = _illegal_bytecode_sequence; 324 address dep = _illegal_bytecode_sequence; 325 address vep = _unimplemented_bytecode; 326 address wep = _unimplemented_bytecode; 327 // code for short & wide version of bytecode 328 if (Bytecodes::is_defined(code)) { 329 Template* t = TemplateTable::template_for(code); 330 assert(t->is_valid(), "just checking"); 331 set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); 332 } 333 if (Bytecodes::wide_is_defined(code)) { 334 Template* t = TemplateTable::template_for_wide(code); 335 assert(t->is_valid(), "just checking"); 336 set_wide_entry_point(t, wep); 337 } 338 // set entry points 339 EntryPoint entry(bep, cep, sep, aep, iep, lep, fep, dep, vep); 340 Interpreter::_normal_table.set_entry(code, entry); 341 Interpreter::_wentry_point[code] = wep; 342 CodeCacheExtensions::completed_template_interpreter_entries(_masm, code); 343 } 344 345 346 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) { 347 assert(t->is_valid(), "template must exist"); 348 assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions"); 349 wep = __ pc(); generate_and_dispatch(t); 350 } 351 352 353 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) { 354 assert(t->is_valid(), "template must exist"); 355 switch (t->tos_in()) { 356 case btos: 357 case ctos: 358 case stos: 359 ShouldNotReachHere(); // btos/ctos/stos should use itos. 360 break; 361 case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break; 362 case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break; 363 case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break; 364 case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break; 365 case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break; 366 case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); break; 367 default : ShouldNotReachHere(); break; 368 } 369 } 370 371 372 //------------------------------------------------------------------------------------------------------------------------ 373 374 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) { 375 if (PrintBytecodeHistogram) histogram_bytecode(t); 376 #ifndef PRODUCT 377 // debugging code 378 if (CountBytecodes || TraceBytecodes || StopInterpreterAt > 0) count_bytecode(); 379 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t); 380 if (TraceBytecodes) trace_bytecode(t); 381 if (StopInterpreterAt > 0) stop_interpreter_at(); 382 __ verify_FPU(1, t->tos_in()); 383 #endif // !PRODUCT 384 int step = 0; 385 if (!t->does_dispatch()) { 386 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode()); 387 if (tos_out == ilgl) tos_out = t->tos_out(); 388 // compute bytecode size 389 assert(step > 0, "just checkin'"); 390 // setup stuff for dispatching next bytecode 391 if (ProfileInterpreter && VerifyDataPointer 392 && MethodData::bytecode_has_profile(t->bytecode())) { 393 __ verify_method_data_pointer(); 394 } 395 __ dispatch_prolog(tos_out, step); 396 } 397 // generate template 398 t->generate(_masm); 399 // advance 400 if (t->does_dispatch()) { 401 #ifdef ASSERT 402 // make sure execution doesn't go beyond this point if code is broken 403 __ should_not_reach_here(); 404 #endif // ASSERT 405 } else { 406 // dispatch to next bytecode 407 __ dispatch_epilog(tos_out, step); 408 } 409 } 410 411 // Generate method entries 412 address TemplateInterpreterGenerator::generate_method_entry( 413 AbstractInterpreter::MethodKind kind) { 414 // determine code generation flags 415 bool native = false; 416 bool synchronized = false; 417 address entry_point = NULL; 418 419 switch (kind) { 420 case Interpreter::zerolocals : break; 421 case Interpreter::zerolocals_synchronized: synchronized = true; break; 422 case Interpreter::native : native = true; break; 423 case Interpreter::native_synchronized : native = true; synchronized = true; break; 424 case Interpreter::empty : break; 425 case Interpreter::accessor : break; 426 case Interpreter::abstract : entry_point = generate_abstract_entry(); break; 427 428 case Interpreter::java_lang_math_sin : // fall thru 429 case Interpreter::java_lang_math_cos : // fall thru 430 case Interpreter::java_lang_math_tan : // fall thru 431 case Interpreter::java_lang_math_abs : // fall thru 432 case Interpreter::java_lang_math_log : // fall thru 433 case Interpreter::java_lang_math_log10 : // fall thru 434 case Interpreter::java_lang_math_sqrt : // fall thru 435 case Interpreter::java_lang_math_pow : // fall thru 436 case Interpreter::java_lang_math_exp : 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 // defined(TARGET_ARCH_x86) && !defined(_LP64) 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