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 "asm/macroAssembler.hpp" 27 #include "asm/macroAssembler.inline.hpp" 28 #include "compiler/disassembler.hpp" 29 #include "interpreter/bytecodeHistogram.hpp" 30 #include "interpreter/bytecodeInterpreter.hpp" 31 #include "interpreter/interpreter.hpp" 32 #include "interpreter/interpreterRuntime.hpp" 33 #include "interpreter/interp_masm.hpp" 34 #include "interpreter/templateTable.hpp" 35 #include "memory/allocation.inline.hpp" 36 #include "memory/metaspaceShared.hpp" 37 #include "memory/resourceArea.hpp" 38 #include "oops/arrayOop.hpp" 39 #include "oops/methodData.hpp" 40 #include "oops/method.hpp" 41 #include "oops/oop.inline.hpp" 42 #include "prims/forte.hpp" 43 #include "prims/jvmtiExport.hpp" 44 #include "prims/methodHandles.hpp" 45 #include "runtime/handles.inline.hpp" 46 #include "runtime/sharedRuntime.hpp" 47 #include "runtime/stubRoutines.hpp" 48 #include "runtime/timer.hpp" 49 50 # define __ _masm-> 51 52 //------------------------------------------------------------------------------------------------------------------------ 53 // Implementation of platform independent aspects of Interpreter 54 55 void AbstractInterpreter::initialize() { 56 if (_code != NULL) return; 57 58 // make sure 'imported' classes are initialized 59 if (CountBytecodes || TraceBytecodes || StopInterpreterAt) BytecodeCounter::reset(); 60 if (PrintBytecodeHistogram) BytecodeHistogram::reset(); 61 if (PrintBytecodePairHistogram) BytecodePairHistogram::reset(); 62 63 InvocationCounter::reinitialize(DelayCompilationDuringStartup); 64 65 } 66 67 void AbstractInterpreter::print() { 68 tty->cr(); 69 tty->print_cr("----------------------------------------------------------------------"); 70 tty->print_cr("Interpreter"); 71 tty->cr(); 72 tty->print_cr("code size = %6dK bytes", (int)_code->used_space()/1024); 73 tty->print_cr("total space = %6dK bytes", (int)_code->total_space()/1024); 74 tty->print_cr("wasted space = %6dK bytes", (int)_code->available_space()/1024); 75 tty->cr(); 76 tty->print_cr("# of codelets = %6d" , _code->number_of_stubs()); 77 if (_code->number_of_stubs() != 0) { 78 tty->print_cr("avg codelet size = %6d bytes", _code->used_space() / _code->number_of_stubs()); 79 tty->cr(); 80 } 81 _code->print(); 82 tty->print_cr("----------------------------------------------------------------------"); 83 tty->cr(); 84 } 85 86 87 //------------------------------------------------------------------------------------------------------------------------ 88 // Implementation of interpreter 89 90 StubQueue* AbstractInterpreter::_code = NULL; 91 bool AbstractInterpreter::_notice_safepoints = false; 92 address AbstractInterpreter::_rethrow_exception_entry = NULL; 93 94 address AbstractInterpreter::_native_entry_begin = NULL; 95 address AbstractInterpreter::_native_entry_end = NULL; 96 address AbstractInterpreter::_slow_signature_handler; 97 address AbstractInterpreter::_entry_table [AbstractInterpreter::number_of_method_entries]; 98 address AbstractInterpreter::_cds_entry_table [AbstractInterpreter::number_of_method_entries]; 99 address AbstractInterpreter::_native_abi_to_tosca [AbstractInterpreter::number_of_result_handlers]; 100 101 //------------------------------------------------------------------------------------------------------------------------ 102 // Generation of complete interpreter 103 104 AbstractInterpreterGenerator::AbstractInterpreterGenerator(StubQueue* _code) { 105 _masm = NULL; 106 } 107 108 109 //------------------------------------------------------------------------------------------------------------------------ 110 // Entry points 111 112 AbstractInterpreter::MethodKind AbstractInterpreter::method_kind(methodHandle m) { 113 // Abstract method? 114 if (m->is_abstract()) return abstract; 115 116 // Method handle primitive? 117 if (m->is_method_handle_intrinsic()) { 118 vmIntrinsics::ID id = m->intrinsic_id(); 119 assert(MethodHandles::is_signature_polymorphic(id), "must match an intrinsic"); 120 MethodKind kind = (MethodKind)( method_handle_invoke_FIRST + 121 ((int)id - vmIntrinsics::FIRST_MH_SIG_POLY) ); 122 assert(kind <= method_handle_invoke_LAST, "parallel enum ranges"); 123 return kind; 124 } 125 126 #ifndef CC_INTERP 127 if (UseCRC32Intrinsics && m->is_native()) { 128 // Use optimized stub code for CRC32 native methods. 129 switch (m->intrinsic_id()) { 130 case vmIntrinsics::_updateCRC32 : return java_util_zip_CRC32_update; 131 case vmIntrinsics::_updateBytesCRC32 : return java_util_zip_CRC32_updateBytes; 132 case vmIntrinsics::_updateByteBufferCRC32 : return java_util_zip_CRC32_updateByteBuffer; 133 } 134 } 135 if (UseCRC32CIntrinsics) { 136 // Use optimized stub code for CRC32C methods. 137 switch (m->intrinsic_id()) { 138 case vmIntrinsics::_updateBytesCRC32C : return java_util_zip_CRC32C_updateBytes; 139 case vmIntrinsics::_updateDirectByteBufferCRC32C : return java_util_zip_CRC32C_updateDirectByteBuffer; 140 } 141 } 142 143 switch(m->intrinsic_id()) { 144 case vmIntrinsics::_intBitsToFloat: return java_lang_Float_intBitsToFloat; 145 case vmIntrinsics::_floatToRawIntBits: return java_lang_Float_floatToRawIntBits; 146 case vmIntrinsics::_longBitsToDouble: return java_lang_Double_longBitsToDouble; 147 case vmIntrinsics::_doubleToRawLongBits: return java_lang_Double_doubleToRawLongBits; 148 } 149 150 #endif // CC_INTERP 151 152 // Native method? 153 // Note: This test must come _before_ the test for intrinsic 154 // methods. See also comments below. 155 if (m->is_native()) { 156 assert(!m->is_method_handle_intrinsic(), "overlapping bits here, watch out"); 157 return m->is_synchronized() ? native_synchronized : native; 158 } 159 160 // Synchronized? 161 if (m->is_synchronized()) { 162 return zerolocals_synchronized; 163 } 164 165 if (RegisterFinalizersAtInit && m->code_size() == 1 && 166 m->intrinsic_id() == vmIntrinsics::_Object_init) { 167 // We need to execute the special return bytecode to check for 168 // finalizer registration so create a normal frame. 169 return zerolocals; 170 } 171 172 // Empty method? 173 if (m->is_empty_method()) { 174 return empty; 175 } 176 177 // Special intrinsic method? 178 // Note: This test must come _after_ the test for native methods, 179 // otherwise we will run into problems with JDK 1.2, see also 180 // TemplateInterpreterGenerator::generate_method_entry() for 181 // for details. 182 switch (m->intrinsic_id()) { 183 case vmIntrinsics::_dsin : return java_lang_math_sin ; 184 case vmIntrinsics::_dcos : return java_lang_math_cos ; 185 case vmIntrinsics::_dtan : return java_lang_math_tan ; 186 case vmIntrinsics::_dabs : return java_lang_math_abs ; 187 case vmIntrinsics::_dsqrt : return java_lang_math_sqrt ; 188 case vmIntrinsics::_dlog : return java_lang_math_log ; 189 case vmIntrinsics::_dlog10: return java_lang_math_log10; 190 case vmIntrinsics::_dpow : return java_lang_math_pow ; 191 case vmIntrinsics::_dexp : return java_lang_math_exp ; 192 193 case vmIntrinsics::_Reference_get: 194 return java_lang_ref_reference_get; 195 } 196 197 // Accessor method? 198 if (m->is_getter()) { 199 // TODO: We should have used ::is_accessor above, but fast accessors in Zero expect only getters. 200 // See CppInterpreter::accessor_entry in cppInterpreter_zero.cpp. This should be fixed in Zero, 201 // then the call above updated to ::is_accessor 202 assert(m->size_of_parameters() == 1, "fast code for accessors assumes parameter size = 1"); 203 return accessor; 204 } 205 206 // Note: for now: zero locals for all non-empty methods 207 return zerolocals; 208 } 209 210 #if INCLUDE_CDS 211 212 address AbstractInterpreter::get_trampoline_code_buffer(AbstractInterpreter::MethodKind kind) { 213 const size_t trampoline_size = SharedRuntime::trampoline_size(); 214 address addr = MetaspaceShared::cds_i2i_entry_code_buffers((size_t)(AbstractInterpreter::number_of_method_entries) * trampoline_size); 215 addr += (size_t)(kind) * trampoline_size; 216 217 return addr; 218 } 219 220 void AbstractInterpreter::update_cds_entry_table(AbstractInterpreter::MethodKind kind) { 221 if (DumpSharedSpaces || UseSharedSpaces) { 222 address trampoline = get_trampoline_code_buffer(kind); 223 _cds_entry_table[kind] = trampoline; 224 225 CodeBuffer buffer(trampoline, (int)(SharedRuntime::trampoline_size())); 226 MacroAssembler _masm(&buffer); 227 SharedRuntime::generate_trampoline(&_masm, _entry_table[kind]); 228 229 if (PrintInterpreter) { 230 Disassembler::decode(buffer.insts_begin(), buffer.insts_end()); 231 } 232 } 233 } 234 235 #endif 236 237 void AbstractInterpreter::set_entry_for_kind(AbstractInterpreter::MethodKind kind, address entry) { 238 assert(kind >= method_handle_invoke_FIRST && 239 kind <= method_handle_invoke_LAST, "late initialization only for MH entry points"); 240 assert(_entry_table[kind] == _entry_table[abstract], "previous value must be AME entry"); 241 _entry_table[kind] = entry; 242 243 update_cds_entry_table(kind); 244 } 245 246 // Return true if the interpreter can prove that the given bytecode has 247 // not yet been executed (in Java semantics, not in actual operation). 248 bool AbstractInterpreter::is_not_reached(const methodHandle& method, int bci) { 249 Bytecodes::Code code = method()->code_at(bci); 250 251 if (!Bytecodes::must_rewrite(code)) { 252 // might have been reached 253 return false; 254 } 255 256 // the bytecode might not be rewritten if the method is an accessor, etc. 257 address ientry = method->interpreter_entry(); 258 if (ientry != entry_for_kind(AbstractInterpreter::zerolocals) && 259 ientry != entry_for_kind(AbstractInterpreter::zerolocals_synchronized)) 260 return false; // interpreter does not run this method! 261 262 // otherwise, we can be sure this bytecode has never been executed 263 return true; 264 } 265 266 267 #ifndef PRODUCT 268 void AbstractInterpreter::print_method_kind(MethodKind kind) { 269 switch (kind) { 270 case zerolocals : tty->print("zerolocals" ); break; 271 case zerolocals_synchronized: tty->print("zerolocals_synchronized"); break; 272 case native : tty->print("native" ); break; 273 case native_synchronized : tty->print("native_synchronized" ); break; 274 case empty : tty->print("empty" ); break; 275 case accessor : tty->print("accessor" ); break; 276 case abstract : tty->print("abstract" ); break; 277 case java_lang_math_sin : tty->print("java_lang_math_sin" ); break; 278 case java_lang_math_cos : tty->print("java_lang_math_cos" ); break; 279 case java_lang_math_tan : tty->print("java_lang_math_tan" ); break; 280 case java_lang_math_abs : tty->print("java_lang_math_abs" ); break; 281 case java_lang_math_sqrt : tty->print("java_lang_math_sqrt" ); break; 282 case java_lang_math_log : tty->print("java_lang_math_log" ); break; 283 case java_lang_math_log10 : tty->print("java_lang_math_log10" ); break; 284 case java_util_zip_CRC32_update : tty->print("java_util_zip_CRC32_update"); break; 285 case java_util_zip_CRC32_updateBytes : tty->print("java_util_zip_CRC32_updateBytes"); break; 286 case java_util_zip_CRC32_updateByteBuffer : tty->print("java_util_zip_CRC32_updateByteBuffer"); break; 287 case java_util_zip_CRC32C_updateBytes : tty->print("java_util_zip_CRC32C_updateBytes"); break; 288 case java_util_zip_CRC32C_updateDirectByteBuffer: tty->print("java_util_zip_CRC32C_updateDirectByteByffer"); break; 289 default: 290 if (kind >= method_handle_invoke_FIRST && 291 kind <= method_handle_invoke_LAST) { 292 const char* kind_name = vmIntrinsics::name_at(method_handle_intrinsic(kind)); 293 if (kind_name[0] == '_') kind_name = &kind_name[1]; // '_invokeExact' => 'invokeExact' 294 tty->print("method_handle_%s", kind_name); 295 break; 296 } 297 ShouldNotReachHere(); 298 break; 299 } 300 } 301 #endif // PRODUCT 302 303 304 //------------------------------------------------------------------------------------------------------------------------ 305 // Deoptimization support 306 307 /** 308 * If a deoptimization happens, this function returns the point of next bytecode to continue execution. 309 */ 310 address AbstractInterpreter::deopt_continue_after_entry(Method* method, address bcp, int callee_parameters, bool is_top_frame) { 311 assert(method->contains(bcp), "just checkin'"); 312 313 // Get the original and rewritten bytecode. 314 Bytecodes::Code code = Bytecodes::java_code_at(method, bcp); 315 assert(!Interpreter::bytecode_should_reexecute(code), "should not reexecute"); 316 317 const int bci = method->bci_from(bcp); 318 319 // compute continuation length 320 const int length = Bytecodes::length_at(method, bcp); 321 322 // compute result type 323 BasicType type = T_ILLEGAL; 324 325 switch (code) { 326 case Bytecodes::_invokevirtual : 327 case Bytecodes::_invokespecial : 328 case Bytecodes::_invokestatic : 329 case Bytecodes::_invokeinterface: { 330 Thread *thread = Thread::current(); 331 ResourceMark rm(thread); 332 methodHandle mh(thread, method); 333 type = Bytecode_invoke(mh, bci).result_type(); 334 // since the cache entry might not be initialized: 335 // (NOT needed for the old calling convension) 336 if (!is_top_frame) { 337 int index = Bytes::get_native_u2(bcp+1); 338 method->constants()->cache()->entry_at(index)->set_parameter_size(callee_parameters); 339 } 340 break; 341 } 342 343 case Bytecodes::_invokedynamic: { 344 Thread *thread = Thread::current(); 345 ResourceMark rm(thread); 346 methodHandle mh(thread, method); 347 type = Bytecode_invoke(mh, bci).result_type(); 348 // since the cache entry might not be initialized: 349 // (NOT needed for the old calling convension) 350 if (!is_top_frame) { 351 int index = Bytes::get_native_u4(bcp+1); 352 method->constants()->invokedynamic_cp_cache_entry_at(index)->set_parameter_size(callee_parameters); 353 } 354 break; 355 } 356 357 case Bytecodes::_ldc : 358 case Bytecodes::_ldc_w : // fall through 359 case Bytecodes::_ldc2_w: 360 { 361 Thread *thread = Thread::current(); 362 ResourceMark rm(thread); 363 methodHandle mh(thread, method); 364 type = Bytecode_loadconstant(mh, bci).result_type(); 365 break; 366 } 367 368 default: 369 type = Bytecodes::result_type(code); 370 break; 371 } 372 373 // return entry point for computed continuation state & bytecode length 374 return 375 is_top_frame 376 ? Interpreter::deopt_entry (as_TosState(type), length) 377 : Interpreter::return_entry(as_TosState(type), length, code); 378 } 379 380 // If deoptimization happens, this function returns the point where the interpreter reexecutes 381 // the bytecode. 382 // Note: Bytecodes::_athrow is a special case in that it does not return 383 // Interpreter::deopt_entry(vtos, 0) like others 384 address AbstractInterpreter::deopt_reexecute_entry(Method* method, address bcp) { 385 assert(method->contains(bcp), "just checkin'"); 386 Bytecodes::Code code = Bytecodes::java_code_at(method, bcp); 387 #if defined(COMPILER1) || INCLUDE_JVMCI 388 if(code == Bytecodes::_athrow ) { 389 return Interpreter::rethrow_exception_entry(); 390 } 391 #endif /* COMPILER1 || INCLUDE_JVMCI */ 392 return Interpreter::deopt_entry(vtos, 0); 393 } 394 395 // If deoptimization happens, the interpreter should reexecute these bytecodes. 396 // This function mainly helps the compilers to set up the reexecute bit. 397 bool AbstractInterpreter::bytecode_should_reexecute(Bytecodes::Code code) { 398 switch (code) { 399 case Bytecodes::_lookupswitch: 400 case Bytecodes::_tableswitch: 401 case Bytecodes::_fast_binaryswitch: 402 case Bytecodes::_fast_linearswitch: 403 // recompute condtional expression folded into _if<cond> 404 case Bytecodes::_lcmp : 405 case Bytecodes::_fcmpl : 406 case Bytecodes::_fcmpg : 407 case Bytecodes::_dcmpl : 408 case Bytecodes::_dcmpg : 409 case Bytecodes::_ifnull : 410 case Bytecodes::_ifnonnull : 411 case Bytecodes::_goto : 412 case Bytecodes::_goto_w : 413 case Bytecodes::_ifeq : 414 case Bytecodes::_ifne : 415 case Bytecodes::_iflt : 416 case Bytecodes::_ifge : 417 case Bytecodes::_ifgt : 418 case Bytecodes::_ifle : 419 case Bytecodes::_if_icmpeq : 420 case Bytecodes::_if_icmpne : 421 case Bytecodes::_if_icmplt : 422 case Bytecodes::_if_icmpge : 423 case Bytecodes::_if_icmpgt : 424 case Bytecodes::_if_icmple : 425 case Bytecodes::_if_acmpeq : 426 case Bytecodes::_if_acmpne : 427 // special cases 428 case Bytecodes::_getfield : 429 case Bytecodes::_putfield : 430 case Bytecodes::_getstatic : 431 case Bytecodes::_putstatic : 432 case Bytecodes::_aastore : 433 #ifdef COMPILER1 434 //special case of reexecution 435 case Bytecodes::_athrow : 436 #endif 437 return true; 438 439 default: 440 return false; 441 } 442 } 443 444 void AbstractInterpreter::initialize_method_handle_entries() { 445 // method handle entry kinds are generated later in MethodHandlesAdapterGenerator::generate: 446 for (int i = method_handle_invoke_FIRST; i <= method_handle_invoke_LAST; i++) { 447 MethodKind kind = (MethodKind) i; 448 _entry_table[kind] = _entry_table[Interpreter::abstract]; 449 Interpreter::update_cds_entry_table(kind); 450 } 451 }