Tue, 02 Sep 2014 12:48:45 -0700
8055494: Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
Summary: Add new C2 intrinsic for BigInteger::multiplyToLen() on x86 in 64-bit VM.
Reviewed-by: roland
duke@435 | 1 | /* |
jiangli@4936 | 2 | * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
twisti@4318 | 26 | #include "asm/macroAssembler.hpp" |
stefank@2314 | 27 | #include "interpreter/bytecodeHistogram.hpp" |
stefank@2314 | 28 | #include "interpreter/interpreter.hpp" |
stefank@2314 | 29 | #include "interpreter/interpreterGenerator.hpp" |
stefank@2314 | 30 | #include "interpreter/interpreterRuntime.hpp" |
stefank@2314 | 31 | #include "interpreter/templateTable.hpp" |
stefank@2314 | 32 | #include "oops/arrayOop.hpp" |
coleenp@4037 | 33 | #include "oops/methodData.hpp" |
coleenp@4037 | 34 | #include "oops/method.hpp" |
stefank@2314 | 35 | #include "oops/oop.inline.hpp" |
stefank@2314 | 36 | #include "prims/jvmtiExport.hpp" |
stefank@2314 | 37 | #include "prims/jvmtiThreadState.hpp" |
stefank@2314 | 38 | #include "runtime/arguments.hpp" |
stefank@2314 | 39 | #include "runtime/deoptimization.hpp" |
stefank@2314 | 40 | #include "runtime/frame.inline.hpp" |
stefank@2314 | 41 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 42 | #include "runtime/stubRoutines.hpp" |
stefank@2314 | 43 | #include "runtime/synchronizer.hpp" |
stefank@2314 | 44 | #include "runtime/timer.hpp" |
stefank@2314 | 45 | #include "runtime/vframeArray.hpp" |
stefank@2314 | 46 | #include "utilities/debug.hpp" |
jprovino@4542 | 47 | #include "utilities/macros.hpp" |
duke@435 | 48 | |
duke@435 | 49 | #define __ _masm-> |
duke@435 | 50 | |
duke@435 | 51 | |
duke@435 | 52 | #ifndef CC_INTERP |
duke@435 | 53 | const int method_offset = frame::interpreter_frame_method_offset * wordSize; |
duke@435 | 54 | const int bci_offset = frame::interpreter_frame_bcx_offset * wordSize; |
duke@435 | 55 | const int locals_offset = frame::interpreter_frame_locals_offset * wordSize; |
duke@435 | 56 | |
duke@435 | 57 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 58 | |
duke@435 | 59 | address TemplateInterpreterGenerator::generate_StackOverflowError_handler() { |
duke@435 | 60 | address entry = __ pc(); |
duke@435 | 61 | |
duke@435 | 62 | // Note: There should be a minimal interpreter frame set up when stack |
duke@435 | 63 | // overflow occurs since we check explicitly for it now. |
duke@435 | 64 | // |
duke@435 | 65 | #ifdef ASSERT |
duke@435 | 66 | { Label L; |
never@739 | 67 | __ lea(rax, Address(rbp, |
duke@435 | 68 | frame::interpreter_frame_monitor_block_top_offset * wordSize)); |
never@739 | 69 | __ cmpptr(rax, rsp); // rax, = maximal rsp for current rbp, |
duke@435 | 70 | // (stack grows negative) |
duke@435 | 71 | __ jcc(Assembler::aboveEqual, L); // check if frame is complete |
duke@435 | 72 | __ stop ("interpreter frame not set up"); |
duke@435 | 73 | __ bind(L); |
duke@435 | 74 | } |
duke@435 | 75 | #endif // ASSERT |
duke@435 | 76 | // Restore bcp under the assumption that the current frame is still |
duke@435 | 77 | // interpreted |
duke@435 | 78 | __ restore_bcp(); |
duke@435 | 79 | |
duke@435 | 80 | // expression stack must be empty before entering the VM if an exception |
duke@435 | 81 | // happened |
duke@435 | 82 | __ empty_expression_stack(); |
duke@435 | 83 | __ empty_FPU_stack(); |
duke@435 | 84 | // throw exception |
duke@435 | 85 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_StackOverflowError)); |
duke@435 | 86 | return entry; |
duke@435 | 87 | } |
duke@435 | 88 | |
duke@435 | 89 | address TemplateInterpreterGenerator::generate_ArrayIndexOutOfBounds_handler(const char* name) { |
duke@435 | 90 | address entry = __ pc(); |
duke@435 | 91 | // expression stack must be empty before entering the VM if an exception happened |
duke@435 | 92 | __ empty_expression_stack(); |
duke@435 | 93 | __ empty_FPU_stack(); |
duke@435 | 94 | // setup parameters |
duke@435 | 95 | // ??? convention: expect aberrant index in register rbx, |
duke@435 | 96 | __ lea(rax, ExternalAddress((address)name)); |
duke@435 | 97 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_ArrayIndexOutOfBoundsException), rax, rbx); |
duke@435 | 98 | return entry; |
duke@435 | 99 | } |
duke@435 | 100 | |
duke@435 | 101 | address TemplateInterpreterGenerator::generate_ClassCastException_handler() { |
duke@435 | 102 | address entry = __ pc(); |
duke@435 | 103 | // object is at TOS |
never@739 | 104 | __ pop(rax); |
duke@435 | 105 | // expression stack must be empty before entering the VM if an exception |
duke@435 | 106 | // happened |
duke@435 | 107 | __ empty_expression_stack(); |
duke@435 | 108 | __ empty_FPU_stack(); |
duke@435 | 109 | __ call_VM(noreg, |
duke@435 | 110 | CAST_FROM_FN_PTR(address, |
duke@435 | 111 | InterpreterRuntime::throw_ClassCastException), |
duke@435 | 112 | rax); |
duke@435 | 113 | return entry; |
duke@435 | 114 | } |
duke@435 | 115 | |
duke@435 | 116 | address TemplateInterpreterGenerator::generate_exception_handler_common(const char* name, const char* message, bool pass_oop) { |
duke@435 | 117 | assert(!pass_oop || message == NULL, "either oop or message but not both"); |
duke@435 | 118 | address entry = __ pc(); |
duke@435 | 119 | if (pass_oop) { |
duke@435 | 120 | // object is at TOS |
never@739 | 121 | __ pop(rbx); |
duke@435 | 122 | } |
duke@435 | 123 | // expression stack must be empty before entering the VM if an exception happened |
duke@435 | 124 | __ empty_expression_stack(); |
duke@435 | 125 | __ empty_FPU_stack(); |
duke@435 | 126 | // setup parameters |
duke@435 | 127 | __ lea(rax, ExternalAddress((address)name)); |
duke@435 | 128 | if (pass_oop) { |
duke@435 | 129 | __ call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::create_klass_exception), rax, rbx); |
duke@435 | 130 | } else { |
duke@435 | 131 | if (message != NULL) { |
duke@435 | 132 | __ lea(rbx, ExternalAddress((address)message)); |
duke@435 | 133 | } else { |
xlu@947 | 134 | __ movptr(rbx, NULL_WORD); |
duke@435 | 135 | } |
duke@435 | 136 | __ call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::create_exception), rax, rbx); |
duke@435 | 137 | } |
duke@435 | 138 | // throw exception |
duke@435 | 139 | __ jump(ExternalAddress(Interpreter::throw_exception_entry())); |
duke@435 | 140 | return entry; |
duke@435 | 141 | } |
duke@435 | 142 | |
duke@435 | 143 | |
duke@435 | 144 | address TemplateInterpreterGenerator::generate_continuation_for(TosState state) { |
duke@435 | 145 | address entry = __ pc(); |
duke@435 | 146 | // NULL last_sp until next java call |
xlu@947 | 147 | __ movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), NULL_WORD); |
duke@435 | 148 | __ dispatch_next(state); |
duke@435 | 149 | return entry; |
duke@435 | 150 | } |
duke@435 | 151 | |
duke@435 | 152 | |
twisti@6039 | 153 | address TemplateInterpreterGenerator::generate_return_entry_for(TosState state, int step, size_t index_size) { |
twisti@2552 | 154 | address entry = __ pc(); |
duke@435 | 155 | |
duke@435 | 156 | #ifdef COMPILER2 |
duke@435 | 157 | // The FPU stack is clean if UseSSE >= 2 but must be cleaned in other cases |
twisti@6039 | 158 | if ((state == ftos && UseSSE < 1) || (state == dtos && UseSSE < 2)) { |
duke@435 | 159 | for (int i = 1; i < 8; i++) { |
duke@435 | 160 | __ ffree(i); |
duke@435 | 161 | } |
duke@435 | 162 | } else if (UseSSE < 2) { |
duke@435 | 163 | __ empty_FPU_stack(); |
duke@435 | 164 | } |
duke@435 | 165 | #endif |
twisti@6039 | 166 | if ((state == ftos && UseSSE < 1) || (state == dtos && UseSSE < 2)) { |
duke@435 | 167 | __ MacroAssembler::verify_FPU(1, "generate_return_entry_for compiled"); |
duke@435 | 168 | } else { |
duke@435 | 169 | __ MacroAssembler::verify_FPU(0, "generate_return_entry_for compiled"); |
duke@435 | 170 | } |
duke@435 | 171 | |
duke@435 | 172 | // In SSE mode, interpreter returns FP results in xmm0 but they need |
duke@435 | 173 | // to end up back on the FPU so it can operate on them. |
twisti@6039 | 174 | if (state == ftos && UseSSE >= 1) { |
never@739 | 175 | __ subptr(rsp, wordSize); |
duke@435 | 176 | __ movflt(Address(rsp, 0), xmm0); |
duke@435 | 177 | __ fld_s(Address(rsp, 0)); |
never@739 | 178 | __ addptr(rsp, wordSize); |
twisti@6039 | 179 | } else if (state == dtos && UseSSE >= 2) { |
never@739 | 180 | __ subptr(rsp, 2*wordSize); |
duke@435 | 181 | __ movdbl(Address(rsp, 0), xmm0); |
duke@435 | 182 | __ fld_d(Address(rsp, 0)); |
never@739 | 183 | __ addptr(rsp, 2*wordSize); |
duke@435 | 184 | } |
duke@435 | 185 | |
duke@435 | 186 | __ MacroAssembler::verify_FPU(state == ftos || state == dtos ? 1 : 0, "generate_return_entry_for in interpreter"); |
duke@435 | 187 | |
duke@435 | 188 | // Restore stack bottom in case i2c adjusted stack |
never@739 | 189 | __ movptr(rsp, Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize)); |
duke@435 | 190 | // and NULL it as marker that rsp is now tos until next java call |
xlu@947 | 191 | __ movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), NULL_WORD); |
duke@435 | 192 | |
duke@435 | 193 | __ restore_bcp(); |
duke@435 | 194 | __ restore_locals(); |
jrose@1161 | 195 | |
twisti@6039 | 196 | if (state == atos) { |
roland@5921 | 197 | Register mdp = rbx; |
roland@5921 | 198 | Register tmp = rcx; |
roland@5921 | 199 | __ profile_return_type(mdp, rax, tmp); |
roland@5921 | 200 | } |
roland@5921 | 201 | |
twisti@6039 | 202 | const Register cache = rbx; |
twisti@6039 | 203 | const Register index = rcx; |
twisti@6039 | 204 | __ get_cache_and_index_at_bcp(cache, index, 1, index_size); |
twisti@6039 | 205 | |
twisti@6039 | 206 | const Register flags = cache; |
twisti@6039 | 207 | __ movl(flags, Address(cache, index, Address::times_ptr, ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::flags_offset())); |
twisti@6039 | 208 | __ andl(flags, ConstantPoolCacheEntry::parameter_size_mask); |
twisti@6039 | 209 | __ lea(rsp, Address(rsp, flags, Interpreter::stackElementScale())); |
duke@435 | 210 | __ dispatch_next(state, step); |
jrose@1161 | 211 | |
duke@435 | 212 | return entry; |
duke@435 | 213 | } |
duke@435 | 214 | |
duke@435 | 215 | |
duke@435 | 216 | address TemplateInterpreterGenerator::generate_deopt_entry_for(TosState state, int step) { |
duke@435 | 217 | address entry = __ pc(); |
duke@435 | 218 | |
duke@435 | 219 | // In SSE mode, FP results are in xmm0 |
duke@435 | 220 | if (state == ftos && UseSSE > 0) { |
never@739 | 221 | __ subptr(rsp, wordSize); |
duke@435 | 222 | __ movflt(Address(rsp, 0), xmm0); |
duke@435 | 223 | __ fld_s(Address(rsp, 0)); |
never@739 | 224 | __ addptr(rsp, wordSize); |
duke@435 | 225 | } else if (state == dtos && UseSSE >= 2) { |
never@739 | 226 | __ subptr(rsp, 2*wordSize); |
duke@435 | 227 | __ movdbl(Address(rsp, 0), xmm0); |
duke@435 | 228 | __ fld_d(Address(rsp, 0)); |
never@739 | 229 | __ addptr(rsp, 2*wordSize); |
duke@435 | 230 | } |
duke@435 | 231 | |
duke@435 | 232 | __ MacroAssembler::verify_FPU(state == ftos || state == dtos ? 1 : 0, "generate_deopt_entry_for in interpreter"); |
duke@435 | 233 | |
duke@435 | 234 | // The stack is not extended by deopt but we must NULL last_sp as this |
duke@435 | 235 | // entry is like a "return". |
xlu@947 | 236 | __ movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), NULL_WORD); |
duke@435 | 237 | __ restore_bcp(); |
duke@435 | 238 | __ restore_locals(); |
duke@435 | 239 | // handle exceptions |
duke@435 | 240 | { Label L; |
duke@435 | 241 | const Register thread = rcx; |
duke@435 | 242 | __ get_thread(thread); |
never@739 | 243 | __ cmpptr(Address(thread, Thread::pending_exception_offset()), (int32_t)NULL_WORD); |
duke@435 | 244 | __ jcc(Assembler::zero, L); |
duke@435 | 245 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_pending_exception)); |
duke@435 | 246 | __ should_not_reach_here(); |
duke@435 | 247 | __ bind(L); |
duke@435 | 248 | } |
duke@435 | 249 | __ dispatch_next(state, step); |
duke@435 | 250 | return entry; |
duke@435 | 251 | } |
duke@435 | 252 | |
duke@435 | 253 | |
duke@435 | 254 | int AbstractInterpreter::BasicType_as_index(BasicType type) { |
duke@435 | 255 | int i = 0; |
duke@435 | 256 | switch (type) { |
duke@435 | 257 | case T_BOOLEAN: i = 0; break; |
duke@435 | 258 | case T_CHAR : i = 1; break; |
duke@435 | 259 | case T_BYTE : i = 2; break; |
duke@435 | 260 | case T_SHORT : i = 3; break; |
duke@435 | 261 | case T_INT : // fall through |
duke@435 | 262 | case T_LONG : // fall through |
duke@435 | 263 | case T_VOID : i = 4; break; |
duke@435 | 264 | case T_FLOAT : i = 5; break; // have to treat float and double separately for SSE |
duke@435 | 265 | case T_DOUBLE : i = 6; break; |
duke@435 | 266 | case T_OBJECT : // fall through |
duke@435 | 267 | case T_ARRAY : i = 7; break; |
duke@435 | 268 | default : ShouldNotReachHere(); |
duke@435 | 269 | } |
duke@435 | 270 | assert(0 <= i && i < AbstractInterpreter::number_of_result_handlers, "index out of bounds"); |
duke@435 | 271 | return i; |
duke@435 | 272 | } |
duke@435 | 273 | |
duke@435 | 274 | |
duke@435 | 275 | address TemplateInterpreterGenerator::generate_result_handler_for(BasicType type) { |
duke@435 | 276 | address entry = __ pc(); |
duke@435 | 277 | switch (type) { |
duke@435 | 278 | case T_BOOLEAN: __ c2bool(rax); break; |
never@739 | 279 | case T_CHAR : __ andptr(rax, 0xFFFF); break; |
duke@435 | 280 | case T_BYTE : __ sign_extend_byte (rax); break; |
duke@435 | 281 | case T_SHORT : __ sign_extend_short(rax); break; |
duke@435 | 282 | case T_INT : /* nothing to do */ break; |
duke@435 | 283 | case T_DOUBLE : |
duke@435 | 284 | case T_FLOAT : |
duke@435 | 285 | { const Register t = InterpreterRuntime::SignatureHandlerGenerator::temp(); |
never@739 | 286 | __ pop(t); // remove return address first |
duke@435 | 287 | // Must return a result for interpreter or compiler. In SSE |
duke@435 | 288 | // mode, results are returned in xmm0 and the FPU stack must |
duke@435 | 289 | // be empty. |
duke@435 | 290 | if (type == T_FLOAT && UseSSE >= 1) { |
duke@435 | 291 | // Load ST0 |
duke@435 | 292 | __ fld_d(Address(rsp, 0)); |
duke@435 | 293 | // Store as float and empty fpu stack |
duke@435 | 294 | __ fstp_s(Address(rsp, 0)); |
duke@435 | 295 | // and reload |
duke@435 | 296 | __ movflt(xmm0, Address(rsp, 0)); |
duke@435 | 297 | } else if (type == T_DOUBLE && UseSSE >= 2 ) { |
duke@435 | 298 | __ movdbl(xmm0, Address(rsp, 0)); |
duke@435 | 299 | } else { |
duke@435 | 300 | // restore ST0 |
duke@435 | 301 | __ fld_d(Address(rsp, 0)); |
duke@435 | 302 | } |
duke@435 | 303 | // and pop the temp |
never@739 | 304 | __ addptr(rsp, 2 * wordSize); |
never@739 | 305 | __ push(t); // restore return address |
duke@435 | 306 | } |
duke@435 | 307 | break; |
duke@435 | 308 | case T_OBJECT : |
duke@435 | 309 | // retrieve result from frame |
never@739 | 310 | __ movptr(rax, Address(rbp, frame::interpreter_frame_oop_temp_offset*wordSize)); |
duke@435 | 311 | // and verify it |
duke@435 | 312 | __ verify_oop(rax); |
duke@435 | 313 | break; |
duke@435 | 314 | default : ShouldNotReachHere(); |
duke@435 | 315 | } |
duke@435 | 316 | __ ret(0); // return from result handler |
duke@435 | 317 | return entry; |
duke@435 | 318 | } |
duke@435 | 319 | |
duke@435 | 320 | address TemplateInterpreterGenerator::generate_safept_entry_for(TosState state, address runtime_entry) { |
duke@435 | 321 | address entry = __ pc(); |
duke@435 | 322 | __ push(state); |
duke@435 | 323 | __ call_VM(noreg, runtime_entry); |
duke@435 | 324 | __ dispatch_via(vtos, Interpreter::_normal_table.table_for(vtos)); |
duke@435 | 325 | return entry; |
duke@435 | 326 | } |
duke@435 | 327 | |
duke@435 | 328 | |
duke@435 | 329 | // Helpers for commoning out cases in the various type of method entries. |
duke@435 | 330 | // |
duke@435 | 331 | |
duke@435 | 332 | // increment invocation count & check for overflow |
duke@435 | 333 | // |
duke@435 | 334 | // Note: checking for negative value instead of overflow |
duke@435 | 335 | // so we have a 'sticky' overflow test |
duke@435 | 336 | // |
duke@435 | 337 | // rbx,: method |
duke@435 | 338 | // rcx: invocation counter |
duke@435 | 339 | // |
duke@435 | 340 | void InterpreterGenerator::generate_counter_incr(Label* overflow, Label* profile_method, Label* profile_method_continue) { |
jiangli@4936 | 341 | Label done; |
jiangli@4936 | 342 | // Note: In tiered we increment either counters in MethodCounters* or in MDO |
jiangli@4936 | 343 | // depending if we're profiling or not. |
iveresov@2138 | 344 | if (TieredCompilation) { |
iveresov@2138 | 345 | int increment = InvocationCounter::count_increment; |
iveresov@2138 | 346 | int mask = ((1 << Tier0InvokeNotifyFreqLog) - 1) << InvocationCounter::count_shift; |
jiangli@4936 | 347 | Label no_mdo; |
iveresov@2138 | 348 | if (ProfileInterpreter) { |
iveresov@2138 | 349 | // Are we profiling? |
coleenp@4037 | 350 | __ movptr(rax, Address(rbx, Method::method_data_offset())); |
iveresov@2138 | 351 | __ testptr(rax, rax); |
iveresov@2138 | 352 | __ jccb(Assembler::zero, no_mdo); |
iveresov@2138 | 353 | // Increment counter in the MDO |
coleenp@4037 | 354 | const Address mdo_invocation_counter(rax, in_bytes(MethodData::invocation_counter_offset()) + |
iveresov@2138 | 355 | in_bytes(InvocationCounter::counter_offset())); |
iveresov@2138 | 356 | __ increment_mask_and_jump(mdo_invocation_counter, increment, mask, rcx, false, Assembler::zero, overflow); |
jiangli@4973 | 357 | __ jmp(done); |
iveresov@2138 | 358 | } |
iveresov@2138 | 359 | __ bind(no_mdo); |
jiangli@4936 | 360 | // Increment counter in MethodCounters |
jiangli@4936 | 361 | const Address invocation_counter(rax, |
jiangli@4936 | 362 | MethodCounters::invocation_counter_offset() + |
jiangli@4936 | 363 | InvocationCounter::counter_offset()); |
jiangli@4936 | 364 | |
jiangli@4936 | 365 | __ get_method_counters(rbx, rax, done); |
jiangli@4936 | 366 | __ increment_mask_and_jump(invocation_counter, increment, mask, |
jiangli@4936 | 367 | rcx, false, Assembler::zero, overflow); |
iveresov@2138 | 368 | __ bind(done); |
iveresov@2138 | 369 | } else { |
jiangli@4936 | 370 | const Address backedge_counter (rax, |
jiangli@4936 | 371 | MethodCounters::backedge_counter_offset() + |
jiangli@4936 | 372 | InvocationCounter::counter_offset()); |
jiangli@4936 | 373 | const Address invocation_counter(rax, |
jiangli@4936 | 374 | MethodCounters::invocation_counter_offset() + |
jiangli@4936 | 375 | InvocationCounter::counter_offset()); |
duke@435 | 376 | |
jiangli@4936 | 377 | __ get_method_counters(rbx, rax, done); |
jiangli@4936 | 378 | |
jiangli@4936 | 379 | if (ProfileInterpreter) { |
jiangli@4936 | 380 | __ incrementl(Address(rax, |
jiangli@4936 | 381 | MethodCounters::interpreter_invocation_counter_offset())); |
iveresov@2138 | 382 | } |
jiangli@4936 | 383 | |
iveresov@2138 | 384 | // Update standard invocation counters |
jiangli@4936 | 385 | __ movl(rcx, invocation_counter); |
jiangli@4936 | 386 | __ incrementl(rcx, InvocationCounter::count_increment); |
jiangli@4936 | 387 | __ movl(invocation_counter, rcx); // save invocation count |
jiangli@4936 | 388 | |
iveresov@2138 | 389 | __ movl(rax, backedge_counter); // load backedge counter |
iveresov@2138 | 390 | __ andl(rax, InvocationCounter::count_mask_value); // mask out the status bits |
iveresov@2138 | 391 | |
iveresov@2138 | 392 | __ addl(rcx, rax); // add both counters |
iveresov@2138 | 393 | |
iveresov@2138 | 394 | // profile_method is non-null only for interpreted method so |
iveresov@2138 | 395 | // profile_method != NULL == !native_call |
iveresov@2138 | 396 | // BytecodeInterpreter only calls for native so code is elided. |
iveresov@2138 | 397 | |
iveresov@2138 | 398 | if (ProfileInterpreter && profile_method != NULL) { |
iveresov@2138 | 399 | // Test to see if we should create a method data oop |
iveresov@2138 | 400 | __ cmp32(rcx, |
iveresov@2138 | 401 | ExternalAddress((address)&InvocationCounter::InterpreterProfileLimit)); |
iveresov@2138 | 402 | __ jcc(Assembler::less, *profile_method_continue); |
iveresov@2138 | 403 | |
iveresov@2138 | 404 | // if no method data exists, go to profile_method |
iveresov@2138 | 405 | __ test_method_data_pointer(rax, *profile_method); |
iveresov@2138 | 406 | } |
iveresov@2138 | 407 | |
iveresov@2138 | 408 | __ cmp32(rcx, |
iveresov@2138 | 409 | ExternalAddress((address)&InvocationCounter::InterpreterInvocationLimit)); |
iveresov@2138 | 410 | __ jcc(Assembler::aboveEqual, *overflow); |
jiangli@4936 | 411 | __ bind(done); |
duke@435 | 412 | } |
duke@435 | 413 | } |
duke@435 | 414 | |
duke@435 | 415 | void InterpreterGenerator::generate_counter_overflow(Label* do_continue) { |
duke@435 | 416 | |
duke@435 | 417 | // Asm interpreter on entry |
duke@435 | 418 | // rdi - locals |
duke@435 | 419 | // rsi - bcp |
duke@435 | 420 | // rbx, - method |
duke@435 | 421 | // rdx - cpool |
duke@435 | 422 | // rbp, - interpreter frame |
duke@435 | 423 | |
duke@435 | 424 | // C++ interpreter on entry |
duke@435 | 425 | // rsi - new interpreter state pointer |
duke@435 | 426 | // rbp - interpreter frame pointer |
duke@435 | 427 | // rbx - method |
duke@435 | 428 | |
duke@435 | 429 | // On return (i.e. jump to entry_point) [ back to invocation of interpreter ] |
duke@435 | 430 | // rbx, - method |
duke@435 | 431 | // rcx - rcvr (assuming there is one) |
duke@435 | 432 | // top of stack return address of interpreter caller |
duke@435 | 433 | // rsp - sender_sp |
duke@435 | 434 | |
duke@435 | 435 | // C++ interpreter only |
duke@435 | 436 | // rsi - previous interpreter state pointer |
duke@435 | 437 | |
duke@435 | 438 | // InterpreterRuntime::frequency_counter_overflow takes one argument |
duke@435 | 439 | // indicating if the counter overflow occurs at a backwards branch (non-NULL bcp). |
duke@435 | 440 | // The call returns the address of the verified entry point for the method or NULL |
duke@435 | 441 | // if the compilation did not complete (either went background or bailed out). |
xlu@968 | 442 | __ movptr(rax, (intptr_t)false); |
duke@435 | 443 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::frequency_counter_overflow), rax); |
duke@435 | 444 | |
coleenp@4037 | 445 | __ movptr(rbx, Address(rbp, method_offset)); // restore Method* |
duke@435 | 446 | |
duke@435 | 447 | // Preserve invariant that rsi/rdi contain bcp/locals of sender frame |
duke@435 | 448 | // and jump to the interpreted entry. |
duke@435 | 449 | __ jmp(*do_continue, relocInfo::none); |
duke@435 | 450 | |
duke@435 | 451 | } |
duke@435 | 452 | |
duke@435 | 453 | void InterpreterGenerator::generate_stack_overflow_check(void) { |
duke@435 | 454 | // see if we've got enough room on the stack for locals plus overhead. |
duke@435 | 455 | // the expression stack grows down incrementally, so the normal guard |
duke@435 | 456 | // page mechanism will work for that. |
duke@435 | 457 | // |
duke@435 | 458 | // Registers live on entry: |
duke@435 | 459 | // |
duke@435 | 460 | // Asm interpreter |
duke@435 | 461 | // rdx: number of additional locals this frame needs (what we must check) |
coleenp@4037 | 462 | // rbx,: Method* |
duke@435 | 463 | |
duke@435 | 464 | // destroyed on exit |
duke@435 | 465 | // rax, |
duke@435 | 466 | |
duke@435 | 467 | // NOTE: since the additional locals are also always pushed (wasn't obvious in |
duke@435 | 468 | // generate_method_entry) so the guard should work for them too. |
duke@435 | 469 | // |
duke@435 | 470 | |
duke@435 | 471 | // monitor entry size: see picture of stack set (generate_method_entry) and frame_x86.hpp |
duke@435 | 472 | const int entry_size = frame::interpreter_frame_monitor_size() * wordSize; |
duke@435 | 473 | |
duke@435 | 474 | // total overhead size: entry_size + (saved rbp, thru expr stack bottom). |
duke@435 | 475 | // be sure to change this if you add/subtract anything to/from the overhead area |
duke@435 | 476 | const int overhead_size = -(frame::interpreter_frame_initial_sp_offset*wordSize) + entry_size; |
duke@435 | 477 | |
duke@435 | 478 | const int page_size = os::vm_page_size(); |
duke@435 | 479 | |
duke@435 | 480 | Label after_frame_check; |
duke@435 | 481 | |
duke@435 | 482 | // see if the frame is greater than one page in size. If so, |
duke@435 | 483 | // then we need to verify there is enough stack space remaining |
duke@435 | 484 | // for the additional locals. |
twisti@1861 | 485 | __ cmpl(rdx, (page_size - overhead_size)/Interpreter::stackElementSize); |
duke@435 | 486 | __ jcc(Assembler::belowEqual, after_frame_check); |
duke@435 | 487 | |
duke@435 | 488 | // compute rsp as if this were going to be the last frame on |
duke@435 | 489 | // the stack before the red zone |
duke@435 | 490 | |
duke@435 | 491 | Label after_frame_check_pop; |
duke@435 | 492 | |
never@739 | 493 | __ push(rsi); |
duke@435 | 494 | |
duke@435 | 495 | const Register thread = rsi; |
duke@435 | 496 | |
duke@435 | 497 | __ get_thread(thread); |
duke@435 | 498 | |
duke@435 | 499 | const Address stack_base(thread, Thread::stack_base_offset()); |
duke@435 | 500 | const Address stack_size(thread, Thread::stack_size_offset()); |
duke@435 | 501 | |
duke@435 | 502 | // locals + overhead, in bytes |
never@739 | 503 | __ lea(rax, Address(noreg, rdx, Interpreter::stackElementScale(), overhead_size)); |
duke@435 | 504 | |
duke@435 | 505 | #ifdef ASSERT |
duke@435 | 506 | Label stack_base_okay, stack_size_okay; |
duke@435 | 507 | // verify that thread stack base is non-zero |
never@739 | 508 | __ cmpptr(stack_base, (int32_t)NULL_WORD); |
duke@435 | 509 | __ jcc(Assembler::notEqual, stack_base_okay); |
duke@435 | 510 | __ stop("stack base is zero"); |
duke@435 | 511 | __ bind(stack_base_okay); |
duke@435 | 512 | // verify that thread stack size is non-zero |
never@739 | 513 | __ cmpptr(stack_size, 0); |
duke@435 | 514 | __ jcc(Assembler::notEqual, stack_size_okay); |
duke@435 | 515 | __ stop("stack size is zero"); |
duke@435 | 516 | __ bind(stack_size_okay); |
duke@435 | 517 | #endif |
duke@435 | 518 | |
duke@435 | 519 | // Add stack base to locals and subtract stack size |
never@739 | 520 | __ addptr(rax, stack_base); |
never@739 | 521 | __ subptr(rax, stack_size); |
duke@435 | 522 | |
duke@435 | 523 | // Use the maximum number of pages we might bang. |
duke@435 | 524 | const int max_pages = StackShadowPages > (StackRedPages+StackYellowPages) ? StackShadowPages : |
duke@435 | 525 | (StackRedPages+StackYellowPages); |
never@739 | 526 | __ addptr(rax, max_pages * page_size); |
duke@435 | 527 | |
duke@435 | 528 | // check against the current stack bottom |
never@739 | 529 | __ cmpptr(rsp, rax); |
duke@435 | 530 | __ jcc(Assembler::above, after_frame_check_pop); |
duke@435 | 531 | |
never@739 | 532 | __ pop(rsi); // get saved bcp / (c++ prev state ). |
duke@435 | 533 | |
bdelsart@3372 | 534 | // Restore sender's sp as SP. This is necessary if the sender's |
bdelsart@3372 | 535 | // frame is an extended compiled frame (see gen_c2i_adapter()) |
bdelsart@3372 | 536 | // and safer anyway in case of JSR292 adaptations. |
duke@435 | 537 | |
bdelsart@3372 | 538 | __ pop(rax); // return address must be moved if SP is changed |
bdelsart@3372 | 539 | __ mov(rsp, rsi); |
bdelsart@3372 | 540 | __ push(rax); |
bdelsart@3372 | 541 | |
bdelsart@3372 | 542 | // Note: the restored frame is not necessarily interpreted. |
bdelsart@3372 | 543 | // Use the shared runtime version of the StackOverflowError. |
bdelsart@3372 | 544 | assert(StubRoutines::throw_StackOverflowError_entry() != NULL, "stub not yet generated"); |
bdelsart@3372 | 545 | __ jump(ExternalAddress(StubRoutines::throw_StackOverflowError_entry())); |
duke@435 | 546 | // all done with frame size check |
duke@435 | 547 | __ bind(after_frame_check_pop); |
never@739 | 548 | __ pop(rsi); |
duke@435 | 549 | |
duke@435 | 550 | __ bind(after_frame_check); |
duke@435 | 551 | } |
duke@435 | 552 | |
duke@435 | 553 | // Allocate monitor and lock method (asm interpreter) |
coleenp@4037 | 554 | // rbx, - Method* |
duke@435 | 555 | // |
duke@435 | 556 | void InterpreterGenerator::lock_method(void) { |
duke@435 | 557 | // synchronize method |
coleenp@4037 | 558 | const Address access_flags (rbx, Method::access_flags_offset()); |
duke@435 | 559 | const Address monitor_block_top (rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize); |
duke@435 | 560 | const int entry_size = frame::interpreter_frame_monitor_size() * wordSize; |
duke@435 | 561 | |
duke@435 | 562 | #ifdef ASSERT |
duke@435 | 563 | { Label L; |
duke@435 | 564 | __ movl(rax, access_flags); |
duke@435 | 565 | __ testl(rax, JVM_ACC_SYNCHRONIZED); |
duke@435 | 566 | __ jcc(Assembler::notZero, L); |
duke@435 | 567 | __ stop("method doesn't need synchronization"); |
duke@435 | 568 | __ bind(L); |
duke@435 | 569 | } |
duke@435 | 570 | #endif // ASSERT |
duke@435 | 571 | // get synchronization object |
duke@435 | 572 | { Label done; |
stefank@3391 | 573 | const int mirror_offset = in_bytes(Klass::java_mirror_offset()); |
duke@435 | 574 | __ movl(rax, access_flags); |
duke@435 | 575 | __ testl(rax, JVM_ACC_STATIC); |
never@739 | 576 | __ movptr(rax, Address(rdi, Interpreter::local_offset_in_bytes(0))); // get receiver (assume this is frequent case) |
duke@435 | 577 | __ jcc(Assembler::zero, done); |
coleenp@4037 | 578 | __ movptr(rax, Address(rbx, Method::const_offset())); |
coleenp@4037 | 579 | __ movptr(rax, Address(rax, ConstMethod::constants_offset())); |
coleenp@4037 | 580 | __ movptr(rax, Address(rax, ConstantPool::pool_holder_offset_in_bytes())); |
never@739 | 581 | __ movptr(rax, Address(rax, mirror_offset)); |
duke@435 | 582 | __ bind(done); |
duke@435 | 583 | } |
duke@435 | 584 | // add space for monitor & lock |
never@739 | 585 | __ subptr(rsp, entry_size); // add space for a monitor entry |
never@739 | 586 | __ movptr(monitor_block_top, rsp); // set new monitor block top |
never@739 | 587 | __ movptr(Address(rsp, BasicObjectLock::obj_offset_in_bytes()), rax); // store object |
never@739 | 588 | __ mov(rdx, rsp); // object address |
duke@435 | 589 | __ lock_object(rdx); |
duke@435 | 590 | } |
duke@435 | 591 | |
duke@435 | 592 | // |
duke@435 | 593 | // Generate a fixed interpreter frame. This is identical setup for interpreted methods |
duke@435 | 594 | // and for native methods hence the shared code. |
duke@435 | 595 | |
duke@435 | 596 | void TemplateInterpreterGenerator::generate_fixed_frame(bool native_call) { |
duke@435 | 597 | // initialize fixed part of activation frame |
never@739 | 598 | __ push(rax); // save return address |
duke@435 | 599 | __ enter(); // save old & set new rbp, |
duke@435 | 600 | |
duke@435 | 601 | |
never@739 | 602 | __ push(rsi); // set sender sp |
never@739 | 603 | __ push((int32_t)NULL_WORD); // leave last_sp as null |
coleenp@4037 | 604 | __ movptr(rsi, Address(rbx,Method::const_offset())); // get ConstMethod* |
coleenp@4037 | 605 | __ lea(rsi, Address(rsi,ConstMethod::codes_offset())); // get codebase |
coleenp@4037 | 606 | __ push(rbx); // save Method* |
duke@435 | 607 | if (ProfileInterpreter) { |
duke@435 | 608 | Label method_data_continue; |
coleenp@4037 | 609 | __ movptr(rdx, Address(rbx, in_bytes(Method::method_data_offset()))); |
never@739 | 610 | __ testptr(rdx, rdx); |
duke@435 | 611 | __ jcc(Assembler::zero, method_data_continue); |
coleenp@4037 | 612 | __ addptr(rdx, in_bytes(MethodData::data_offset())); |
duke@435 | 613 | __ bind(method_data_continue); |
never@739 | 614 | __ push(rdx); // set the mdp (method data pointer) |
duke@435 | 615 | } else { |
never@739 | 616 | __ push(0); |
duke@435 | 617 | } |
duke@435 | 618 | |
coleenp@4037 | 619 | __ movptr(rdx, Address(rbx, Method::const_offset())); |
coleenp@4037 | 620 | __ movptr(rdx, Address(rdx, ConstMethod::constants_offset())); |
coleenp@4037 | 621 | __ movptr(rdx, Address(rdx, ConstantPool::cache_offset_in_bytes())); |
never@739 | 622 | __ push(rdx); // set constant pool cache |
never@739 | 623 | __ push(rdi); // set locals pointer |
duke@435 | 624 | if (native_call) { |
never@739 | 625 | __ push(0); // no bcp |
duke@435 | 626 | } else { |
never@739 | 627 | __ push(rsi); // set bcp |
duke@435 | 628 | } |
never@739 | 629 | __ push(0); // reserve word for pointer to expression stack bottom |
never@739 | 630 | __ movptr(Address(rsp, 0), rsp); // set expression stack bottom |
duke@435 | 631 | } |
duke@435 | 632 | |
duke@435 | 633 | // End of helpers |
duke@435 | 634 | |
duke@435 | 635 | // |
duke@435 | 636 | // Various method entries |
duke@435 | 637 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 638 | // |
duke@435 | 639 | // |
duke@435 | 640 | |
duke@435 | 641 | // Call an accessor method (assuming it is resolved, otherwise drop into vanilla (slow path) entry |
duke@435 | 642 | |
duke@435 | 643 | address InterpreterGenerator::generate_accessor_entry(void) { |
duke@435 | 644 | |
coleenp@4037 | 645 | // rbx,: Method* |
duke@435 | 646 | // rcx: receiver (preserve for slow entry into asm interpreter) |
duke@435 | 647 | |
duke@435 | 648 | // rsi: senderSP must preserved for slow path, set SP to it on fast path |
duke@435 | 649 | |
duke@435 | 650 | address entry_point = __ pc(); |
duke@435 | 651 | Label xreturn_path; |
duke@435 | 652 | |
duke@435 | 653 | // do fastpath for resolved accessor methods |
duke@435 | 654 | if (UseFastAccessorMethods) { |
duke@435 | 655 | Label slow_path; |
duke@435 | 656 | // If we need a safepoint check, generate full interpreter entry. |
duke@435 | 657 | ExternalAddress state(SafepointSynchronize::address_of_state()); |
duke@435 | 658 | __ cmp32(ExternalAddress(SafepointSynchronize::address_of_state()), |
duke@435 | 659 | SafepointSynchronize::_not_synchronized); |
duke@435 | 660 | |
duke@435 | 661 | __ jcc(Assembler::notEqual, slow_path); |
duke@435 | 662 | // ASM/C++ Interpreter |
duke@435 | 663 | // Code: _aload_0, _(i|a)getfield, _(i|a)return or any rewrites thereof; parameter size = 1 |
duke@435 | 664 | // Note: We can only use this code if the getfield has been resolved |
duke@435 | 665 | // and if we don't have a null-pointer exception => check for |
duke@435 | 666 | // these conditions first and use slow path if necessary. |
duke@435 | 667 | // rbx,: method |
duke@435 | 668 | // rcx: receiver |
never@739 | 669 | __ movptr(rax, Address(rsp, wordSize)); |
duke@435 | 670 | |
duke@435 | 671 | // check if local 0 != NULL and read field |
never@739 | 672 | __ testptr(rax, rax); |
duke@435 | 673 | __ jcc(Assembler::zero, slow_path); |
duke@435 | 674 | |
duke@435 | 675 | // read first instruction word and extract bytecode @ 1 and index @ 2 |
coleenp@4037 | 676 | __ movptr(rdx, Address(rbx, Method::const_offset())); |
coleenp@4037 | 677 | __ movptr(rdi, Address(rdx, ConstMethod::constants_offset())); |
coleenp@4037 | 678 | __ movl(rdx, Address(rdx, ConstMethod::codes_offset())); |
duke@435 | 679 | // Shift codes right to get the index on the right. |
duke@435 | 680 | // The bytecode fetched looks like <index><0xb4><0x2a> |
duke@435 | 681 | __ shrl(rdx, 2*BitsPerByte); |
duke@435 | 682 | __ shll(rdx, exact_log2(in_words(ConstantPoolCacheEntry::size()))); |
coleenp@4037 | 683 | __ movptr(rdi, Address(rdi, ConstantPool::cache_offset_in_bytes())); |
duke@435 | 684 | |
duke@435 | 685 | // rax,: local 0 |
duke@435 | 686 | // rbx,: method |
duke@435 | 687 | // rcx: receiver - do not destroy since it is needed for slow path! |
duke@435 | 688 | // rcx: scratch |
duke@435 | 689 | // rdx: constant pool cache index |
duke@435 | 690 | // rdi: constant pool cache |
duke@435 | 691 | // rsi: sender sp |
duke@435 | 692 | |
duke@435 | 693 | // check if getfield has been resolved and read constant pool cache entry |
duke@435 | 694 | // check the validity of the cache entry by testing whether _indices field |
duke@435 | 695 | // contains Bytecode::_getfield in b1 byte. |
duke@435 | 696 | assert(in_words(ConstantPoolCacheEntry::size()) == 4, "adjust shift below"); |
duke@435 | 697 | __ movl(rcx, |
duke@435 | 698 | Address(rdi, |
duke@435 | 699 | rdx, |
coleenp@4037 | 700 | Address::times_ptr, ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::indices_offset())); |
duke@435 | 701 | __ shrl(rcx, 2*BitsPerByte); |
duke@435 | 702 | __ andl(rcx, 0xFF); |
duke@435 | 703 | __ cmpl(rcx, Bytecodes::_getfield); |
duke@435 | 704 | __ jcc(Assembler::notEqual, slow_path); |
duke@435 | 705 | |
duke@435 | 706 | // Note: constant pool entry is not valid before bytecode is resolved |
never@739 | 707 | __ movptr(rcx, |
never@739 | 708 | Address(rdi, |
never@739 | 709 | rdx, |
coleenp@4037 | 710 | Address::times_ptr, ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::f2_offset())); |
duke@435 | 711 | __ movl(rdx, |
duke@435 | 712 | Address(rdi, |
duke@435 | 713 | rdx, |
coleenp@4037 | 714 | Address::times_ptr, ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::flags_offset())); |
duke@435 | 715 | |
duke@435 | 716 | Label notByte, notShort, notChar; |
duke@435 | 717 | const Address field_address (rax, rcx, Address::times_1); |
duke@435 | 718 | |
duke@435 | 719 | // Need to differentiate between igetfield, agetfield, bgetfield etc. |
duke@435 | 720 | // because they are different sizes. |
duke@435 | 721 | // Use the type from the constant pool cache |
twisti@3969 | 722 | __ shrl(rdx, ConstantPoolCacheEntry::tos_state_shift); |
twisti@3969 | 723 | // Make sure we don't need to mask rdx after the above shift |
twisti@3969 | 724 | ConstantPoolCacheEntry::verify_tos_state_shift(); |
duke@435 | 725 | __ cmpl(rdx, btos); |
duke@435 | 726 | __ jcc(Assembler::notEqual, notByte); |
duke@435 | 727 | __ load_signed_byte(rax, field_address); |
duke@435 | 728 | __ jmp(xreturn_path); |
duke@435 | 729 | |
duke@435 | 730 | __ bind(notByte); |
duke@435 | 731 | __ cmpl(rdx, stos); |
duke@435 | 732 | __ jcc(Assembler::notEqual, notShort); |
jrose@1057 | 733 | __ load_signed_short(rax, field_address); |
duke@435 | 734 | __ jmp(xreturn_path); |
duke@435 | 735 | |
duke@435 | 736 | __ bind(notShort); |
duke@435 | 737 | __ cmpl(rdx, ctos); |
duke@435 | 738 | __ jcc(Assembler::notEqual, notChar); |
jrose@1057 | 739 | __ load_unsigned_short(rax, field_address); |
duke@435 | 740 | __ jmp(xreturn_path); |
duke@435 | 741 | |
duke@435 | 742 | __ bind(notChar); |
duke@435 | 743 | #ifdef ASSERT |
duke@435 | 744 | Label okay; |
duke@435 | 745 | __ cmpl(rdx, atos); |
duke@435 | 746 | __ jcc(Assembler::equal, okay); |
duke@435 | 747 | __ cmpl(rdx, itos); |
duke@435 | 748 | __ jcc(Assembler::equal, okay); |
duke@435 | 749 | __ stop("what type is this?"); |
duke@435 | 750 | __ bind(okay); |
duke@435 | 751 | #endif // ASSERT |
duke@435 | 752 | // All the rest are a 32 bit wordsize |
never@739 | 753 | // This is ok for now. Since fast accessors should be going away |
never@739 | 754 | __ movptr(rax, field_address); |
duke@435 | 755 | |
duke@435 | 756 | __ bind(xreturn_path); |
duke@435 | 757 | |
duke@435 | 758 | // _ireturn/_areturn |
never@739 | 759 | __ pop(rdi); // get return address |
never@739 | 760 | __ mov(rsp, rsi); // set sp to sender sp |
duke@435 | 761 | __ jmp(rdi); |
duke@435 | 762 | |
duke@435 | 763 | // generate a vanilla interpreter entry as the slow path |
duke@435 | 764 | __ bind(slow_path); |
duke@435 | 765 | |
duke@435 | 766 | (void) generate_normal_entry(false); |
duke@435 | 767 | return entry_point; |
duke@435 | 768 | } |
duke@435 | 769 | return NULL; |
duke@435 | 770 | |
duke@435 | 771 | } |
duke@435 | 772 | |
johnc@2781 | 773 | // Method entry for java.lang.ref.Reference.get. |
johnc@2781 | 774 | address InterpreterGenerator::generate_Reference_get_entry(void) { |
jprovino@4542 | 775 | #if INCLUDE_ALL_GCS |
johnc@2781 | 776 | // Code: _aload_0, _getfield, _areturn |
johnc@2781 | 777 | // parameter size = 1 |
johnc@2781 | 778 | // |
johnc@2781 | 779 | // The code that gets generated by this routine is split into 2 parts: |
johnc@2781 | 780 | // 1. The "intrinsified" code for G1 (or any SATB based GC), |
johnc@2781 | 781 | // 2. The slow path - which is an expansion of the regular method entry. |
johnc@2781 | 782 | // |
johnc@2781 | 783 | // Notes:- |
johnc@2781 | 784 | // * In the G1 code we do not check whether we need to block for |
johnc@2781 | 785 | // a safepoint. If G1 is enabled then we must execute the specialized |
johnc@2781 | 786 | // code for Reference.get (except when the Reference object is null) |
johnc@2781 | 787 | // so that we can log the value in the referent field with an SATB |
johnc@2781 | 788 | // update buffer. |
johnc@2781 | 789 | // If the code for the getfield template is modified so that the |
johnc@2781 | 790 | // G1 pre-barrier code is executed when the current method is |
johnc@2781 | 791 | // Reference.get() then going through the normal method entry |
johnc@2781 | 792 | // will be fine. |
johnc@2781 | 793 | // * The G1 code below can, however, check the receiver object (the instance |
johnc@2781 | 794 | // of java.lang.Reference) and jump to the slow path if null. If the |
johnc@2781 | 795 | // Reference object is null then we obviously cannot fetch the referent |
johnc@2781 | 796 | // and so we don't need to call the G1 pre-barrier. Thus we can use the |
johnc@2781 | 797 | // regular method entry code to generate the NPE. |
johnc@2781 | 798 | // |
johnc@2781 | 799 | // This code is based on generate_accessor_enty. |
johnc@2781 | 800 | |
coleenp@4037 | 801 | // rbx,: Method* |
johnc@2781 | 802 | // rcx: receiver (preserve for slow entry into asm interpreter) |
johnc@2781 | 803 | |
johnc@2781 | 804 | // rsi: senderSP must preserved for slow path, set SP to it on fast path |
johnc@2781 | 805 | |
johnc@2781 | 806 | address entry = __ pc(); |
johnc@2781 | 807 | |
johnc@2781 | 808 | const int referent_offset = java_lang_ref_Reference::referent_offset; |
johnc@2781 | 809 | guarantee(referent_offset > 0, "referent offset not initialized"); |
johnc@2781 | 810 | |
johnc@2781 | 811 | if (UseG1GC) { |
johnc@2781 | 812 | Label slow_path; |
johnc@2781 | 813 | |
johnc@2781 | 814 | // Check if local 0 != NULL |
johnc@2781 | 815 | // If the receiver is null then it is OK to jump to the slow path. |
johnc@2781 | 816 | __ movptr(rax, Address(rsp, wordSize)); |
johnc@2781 | 817 | __ testptr(rax, rax); |
johnc@2781 | 818 | __ jcc(Assembler::zero, slow_path); |
johnc@2781 | 819 | |
johnc@2781 | 820 | // rax: local 0 (must be preserved across the G1 barrier call) |
johnc@2781 | 821 | // |
johnc@2781 | 822 | // rbx: method (at this point it's scratch) |
johnc@2781 | 823 | // rcx: receiver (at this point it's scratch) |
johnc@2781 | 824 | // rdx: scratch |
johnc@2781 | 825 | // rdi: scratch |
johnc@2781 | 826 | // |
johnc@2781 | 827 | // rsi: sender sp |
johnc@2781 | 828 | |
johnc@2781 | 829 | // Preserve the sender sp in case the pre-barrier |
johnc@2781 | 830 | // calls the runtime |
johnc@2781 | 831 | __ push(rsi); |
johnc@2781 | 832 | |
johnc@2781 | 833 | // Load the value of the referent field. |
johnc@2781 | 834 | const Address field_address(rax, referent_offset); |
johnc@2781 | 835 | __ movptr(rax, field_address); |
johnc@2781 | 836 | |
johnc@2781 | 837 | // Generate the G1 pre-barrier code to log the value of |
johnc@2781 | 838 | // the referent field in an SATB buffer. |
johnc@2781 | 839 | __ get_thread(rcx); |
johnc@2781 | 840 | __ g1_write_barrier_pre(noreg /* obj */, |
johnc@2781 | 841 | rax /* pre_val */, |
johnc@2781 | 842 | rcx /* thread */, |
johnc@2781 | 843 | rbx /* tmp */, |
johnc@2781 | 844 | true /* tosca_save */, |
johnc@2781 | 845 | true /* expand_call */); |
johnc@2781 | 846 | |
johnc@2781 | 847 | // _areturn |
johnc@2781 | 848 | __ pop(rsi); // get sender sp |
johnc@2781 | 849 | __ pop(rdi); // get return address |
johnc@2781 | 850 | __ mov(rsp, rsi); // set sp to sender sp |
johnc@2781 | 851 | __ jmp(rdi); |
johnc@2781 | 852 | |
johnc@2781 | 853 | __ bind(slow_path); |
johnc@2781 | 854 | (void) generate_normal_entry(false); |
johnc@2781 | 855 | |
johnc@2781 | 856 | return entry; |
johnc@2781 | 857 | } |
jprovino@4542 | 858 | #endif // INCLUDE_ALL_GCS |
johnc@2781 | 859 | |
johnc@2781 | 860 | // If G1 is not enabled then attempt to go through the accessor entry point |
johnc@2781 | 861 | // Reference.get is an accessor |
johnc@2781 | 862 | return generate_accessor_entry(); |
johnc@2781 | 863 | } |
johnc@2781 | 864 | |
drchase@5353 | 865 | /** |
drchase@5353 | 866 | * Method entry for static native methods: |
drchase@5353 | 867 | * int java.util.zip.CRC32.update(int crc, int b) |
drchase@5353 | 868 | */ |
drchase@5353 | 869 | address InterpreterGenerator::generate_CRC32_update_entry() { |
drchase@5353 | 870 | if (UseCRC32Intrinsics) { |
drchase@5353 | 871 | address entry = __ pc(); |
drchase@5353 | 872 | |
drchase@5353 | 873 | // rbx,: Method* |
drchase@5353 | 874 | // rsi: senderSP must preserved for slow path, set SP to it on fast path |
drchase@5353 | 875 | // rdx: scratch |
drchase@5353 | 876 | // rdi: scratch |
drchase@5353 | 877 | |
drchase@5353 | 878 | Label slow_path; |
drchase@5353 | 879 | // If we need a safepoint check, generate full interpreter entry. |
drchase@5353 | 880 | ExternalAddress state(SafepointSynchronize::address_of_state()); |
drchase@5353 | 881 | __ cmp32(ExternalAddress(SafepointSynchronize::address_of_state()), |
drchase@5353 | 882 | SafepointSynchronize::_not_synchronized); |
drchase@5353 | 883 | __ jcc(Assembler::notEqual, slow_path); |
drchase@5353 | 884 | |
drchase@5353 | 885 | // We don't generate local frame and don't align stack because |
drchase@5353 | 886 | // we call stub code and there is no safepoint on this path. |
drchase@5353 | 887 | |
drchase@5353 | 888 | // Load parameters |
drchase@5353 | 889 | const Register crc = rax; // crc |
drchase@5353 | 890 | const Register val = rdx; // source java byte value |
drchase@5353 | 891 | const Register tbl = rdi; // scratch |
drchase@5353 | 892 | |
drchase@5353 | 893 | // Arguments are reversed on java expression stack |
drchase@5353 | 894 | __ movl(val, Address(rsp, wordSize)); // byte value |
drchase@5353 | 895 | __ movl(crc, Address(rsp, 2*wordSize)); // Initial CRC |
drchase@5353 | 896 | |
drchase@5353 | 897 | __ lea(tbl, ExternalAddress(StubRoutines::crc_table_addr())); |
drchase@5353 | 898 | __ notl(crc); // ~crc |
drchase@5353 | 899 | __ update_byte_crc32(crc, val, tbl); |
drchase@5353 | 900 | __ notl(crc); // ~crc |
drchase@5353 | 901 | // result in rax |
drchase@5353 | 902 | |
drchase@5353 | 903 | // _areturn |
drchase@5353 | 904 | __ pop(rdi); // get return address |
drchase@5353 | 905 | __ mov(rsp, rsi); // set sp to sender sp |
drchase@5353 | 906 | __ jmp(rdi); |
drchase@5353 | 907 | |
drchase@5353 | 908 | // generate a vanilla native entry as the slow path |
drchase@5353 | 909 | __ bind(slow_path); |
drchase@5353 | 910 | |
drchase@5353 | 911 | (void) generate_native_entry(false); |
drchase@5353 | 912 | |
drchase@5353 | 913 | return entry; |
drchase@5353 | 914 | } |
drchase@5353 | 915 | return generate_native_entry(false); |
drchase@5353 | 916 | } |
drchase@5353 | 917 | |
drchase@5353 | 918 | /** |
drchase@5353 | 919 | * Method entry for static native methods: |
drchase@5353 | 920 | * int java.util.zip.CRC32.updateBytes(int crc, byte[] b, int off, int len) |
drchase@5353 | 921 | * int java.util.zip.CRC32.updateByteBuffer(int crc, long buf, int off, int len) |
drchase@5353 | 922 | */ |
drchase@5353 | 923 | address InterpreterGenerator::generate_CRC32_updateBytes_entry(AbstractInterpreter::MethodKind kind) { |
drchase@5353 | 924 | if (UseCRC32Intrinsics) { |
drchase@5353 | 925 | address entry = __ pc(); |
drchase@5353 | 926 | |
drchase@5353 | 927 | // rbx,: Method* |
drchase@5353 | 928 | // rsi: senderSP must preserved for slow path, set SP to it on fast path |
drchase@5353 | 929 | // rdx: scratch |
drchase@5353 | 930 | // rdi: scratch |
drchase@5353 | 931 | |
drchase@5353 | 932 | Label slow_path; |
drchase@5353 | 933 | // If we need a safepoint check, generate full interpreter entry. |
drchase@5353 | 934 | ExternalAddress state(SafepointSynchronize::address_of_state()); |
drchase@5353 | 935 | __ cmp32(ExternalAddress(SafepointSynchronize::address_of_state()), |
drchase@5353 | 936 | SafepointSynchronize::_not_synchronized); |
drchase@5353 | 937 | __ jcc(Assembler::notEqual, slow_path); |
drchase@5353 | 938 | |
drchase@5353 | 939 | // We don't generate local frame and don't align stack because |
drchase@5353 | 940 | // we call stub code and there is no safepoint on this path. |
drchase@5353 | 941 | |
drchase@5353 | 942 | // Load parameters |
drchase@5353 | 943 | const Register crc = rax; // crc |
drchase@5353 | 944 | const Register buf = rdx; // source java byte array address |
drchase@5353 | 945 | const Register len = rdi; // length |
drchase@5353 | 946 | |
drchase@5353 | 947 | // Arguments are reversed on java expression stack |
drchase@5353 | 948 | __ movl(len, Address(rsp, wordSize)); // Length |
drchase@5353 | 949 | // Calculate address of start element |
drchase@5353 | 950 | if (kind == Interpreter::java_util_zip_CRC32_updateByteBuffer) { |
drchase@5353 | 951 | __ movptr(buf, Address(rsp, 3*wordSize)); // long buf |
drchase@5353 | 952 | __ addptr(buf, Address(rsp, 2*wordSize)); // + offset |
drchase@5353 | 953 | __ movl(crc, Address(rsp, 5*wordSize)); // Initial CRC |
drchase@5353 | 954 | } else { |
drchase@5353 | 955 | __ movptr(buf, Address(rsp, 3*wordSize)); // byte[] array |
drchase@5353 | 956 | __ addptr(buf, arrayOopDesc::base_offset_in_bytes(T_BYTE)); // + header size |
drchase@5353 | 957 | __ addptr(buf, Address(rsp, 2*wordSize)); // + offset |
drchase@5353 | 958 | __ movl(crc, Address(rsp, 4*wordSize)); // Initial CRC |
drchase@5353 | 959 | } |
drchase@5353 | 960 | |
drchase@5353 | 961 | __ super_call_VM_leaf(CAST_FROM_FN_PTR(address, StubRoutines::updateBytesCRC32()), crc, buf, len); |
drchase@5353 | 962 | // result in rax |
drchase@5353 | 963 | |
drchase@5353 | 964 | // _areturn |
drchase@5353 | 965 | __ pop(rdi); // get return address |
drchase@5353 | 966 | __ mov(rsp, rsi); // set sp to sender sp |
drchase@5353 | 967 | __ jmp(rdi); |
drchase@5353 | 968 | |
drchase@5353 | 969 | // generate a vanilla native entry as the slow path |
drchase@5353 | 970 | __ bind(slow_path); |
drchase@5353 | 971 | |
drchase@5353 | 972 | (void) generate_native_entry(false); |
drchase@5353 | 973 | |
drchase@5353 | 974 | return entry; |
drchase@5353 | 975 | } |
drchase@5353 | 976 | return generate_native_entry(false); |
drchase@5353 | 977 | } |
drchase@5353 | 978 | |
duke@435 | 979 | // |
duke@435 | 980 | // Interpreter stub for calling a native method. (asm interpreter) |
duke@435 | 981 | // This sets up a somewhat different looking stack for calling the native method |
duke@435 | 982 | // than the typical interpreter frame setup. |
duke@435 | 983 | // |
duke@435 | 984 | |
duke@435 | 985 | address InterpreterGenerator::generate_native_entry(bool synchronized) { |
duke@435 | 986 | // determine code generation flags |
duke@435 | 987 | bool inc_counter = UseCompiler || CountCompiledCalls; |
duke@435 | 988 | |
coleenp@4037 | 989 | // rbx,: Method* |
duke@435 | 990 | // rsi: sender sp |
duke@435 | 991 | // rsi: previous interpreter state (C++ interpreter) must preserve |
duke@435 | 992 | address entry_point = __ pc(); |
duke@435 | 993 | |
jiangli@4338 | 994 | const Address constMethod (rbx, Method::const_offset()); |
coleenp@4037 | 995 | const Address access_flags (rbx, Method::access_flags_offset()); |
jiangli@4338 | 996 | const Address size_of_parameters(rcx, ConstMethod::size_of_parameters_offset()); |
duke@435 | 997 | |
duke@435 | 998 | // get parameter size (always needed) |
jiangli@4338 | 999 | __ movptr(rcx, constMethod); |
jrose@1057 | 1000 | __ load_unsigned_short(rcx, size_of_parameters); |
duke@435 | 1001 | |
duke@435 | 1002 | // native calls don't need the stack size check since they have no expression stack |
duke@435 | 1003 | // and the arguments are already on the stack and we only add a handful of words |
duke@435 | 1004 | // to the stack |
duke@435 | 1005 | |
coleenp@4037 | 1006 | // rbx,: Method* |
duke@435 | 1007 | // rcx: size of parameters |
duke@435 | 1008 | // rsi: sender sp |
duke@435 | 1009 | |
never@739 | 1010 | __ pop(rax); // get return address |
duke@435 | 1011 | // for natives the size of locals is zero |
duke@435 | 1012 | |
duke@435 | 1013 | // compute beginning of parameters (rdi) |
never@739 | 1014 | __ lea(rdi, Address(rsp, rcx, Interpreter::stackElementScale(), -wordSize)); |
duke@435 | 1015 | |
duke@435 | 1016 | |
duke@435 | 1017 | // add 2 zero-initialized slots for native calls |
duke@435 | 1018 | // NULL result handler |
never@739 | 1019 | __ push((int32_t)NULL_WORD); |
duke@435 | 1020 | // NULL oop temp (mirror or jni oop result) |
never@739 | 1021 | __ push((int32_t)NULL_WORD); |
duke@435 | 1022 | |
duke@435 | 1023 | // initialize fixed part of activation frame |
duke@435 | 1024 | generate_fixed_frame(true); |
duke@435 | 1025 | |
duke@435 | 1026 | // make sure method is native & not abstract |
duke@435 | 1027 | #ifdef ASSERT |
duke@435 | 1028 | __ movl(rax, access_flags); |
duke@435 | 1029 | { |
duke@435 | 1030 | Label L; |
duke@435 | 1031 | __ testl(rax, JVM_ACC_NATIVE); |
duke@435 | 1032 | __ jcc(Assembler::notZero, L); |
duke@435 | 1033 | __ stop("tried to execute non-native method as native"); |
duke@435 | 1034 | __ bind(L); |
duke@435 | 1035 | } |
duke@435 | 1036 | { Label L; |
duke@435 | 1037 | __ testl(rax, JVM_ACC_ABSTRACT); |
duke@435 | 1038 | __ jcc(Assembler::zero, L); |
duke@435 | 1039 | __ stop("tried to execute abstract method in interpreter"); |
duke@435 | 1040 | __ bind(L); |
duke@435 | 1041 | } |
duke@435 | 1042 | #endif |
duke@435 | 1043 | |
duke@435 | 1044 | // Since at this point in the method invocation the exception handler |
duke@435 | 1045 | // would try to exit the monitor of synchronized methods which hasn't |
duke@435 | 1046 | // been entered yet, we set the thread local variable |
duke@435 | 1047 | // _do_not_unlock_if_synchronized to true. The remove_activation will |
duke@435 | 1048 | // check this flag. |
duke@435 | 1049 | |
duke@435 | 1050 | __ get_thread(rax); |
duke@435 | 1051 | const Address do_not_unlock_if_synchronized(rax, |
duke@435 | 1052 | in_bytes(JavaThread::do_not_unlock_if_synchronized_offset())); |
duke@435 | 1053 | __ movbool(do_not_unlock_if_synchronized, true); |
duke@435 | 1054 | |
duke@435 | 1055 | // increment invocation count & check for overflow |
duke@435 | 1056 | Label invocation_counter_overflow; |
duke@435 | 1057 | if (inc_counter) { |
duke@435 | 1058 | generate_counter_incr(&invocation_counter_overflow, NULL, NULL); |
duke@435 | 1059 | } |
duke@435 | 1060 | |
duke@435 | 1061 | Label continue_after_compile; |
duke@435 | 1062 | __ bind(continue_after_compile); |
duke@435 | 1063 | |
duke@435 | 1064 | bang_stack_shadow_pages(true); |
duke@435 | 1065 | |
duke@435 | 1066 | // reset the _do_not_unlock_if_synchronized flag |
duke@435 | 1067 | __ get_thread(rax); |
duke@435 | 1068 | __ movbool(do_not_unlock_if_synchronized, false); |
duke@435 | 1069 | |
duke@435 | 1070 | // check for synchronized methods |
duke@435 | 1071 | // Must happen AFTER invocation_counter check and stack overflow check, |
duke@435 | 1072 | // so method is not locked if overflows. |
duke@435 | 1073 | // |
duke@435 | 1074 | if (synchronized) { |
duke@435 | 1075 | lock_method(); |
duke@435 | 1076 | } else { |
duke@435 | 1077 | // no synchronization necessary |
duke@435 | 1078 | #ifdef ASSERT |
duke@435 | 1079 | { Label L; |
duke@435 | 1080 | __ movl(rax, access_flags); |
duke@435 | 1081 | __ testl(rax, JVM_ACC_SYNCHRONIZED); |
duke@435 | 1082 | __ jcc(Assembler::zero, L); |
duke@435 | 1083 | __ stop("method needs synchronization"); |
duke@435 | 1084 | __ bind(L); |
duke@435 | 1085 | } |
duke@435 | 1086 | #endif |
duke@435 | 1087 | } |
duke@435 | 1088 | |
duke@435 | 1089 | // start execution |
duke@435 | 1090 | #ifdef ASSERT |
duke@435 | 1091 | { Label L; |
duke@435 | 1092 | const Address monitor_block_top (rbp, |
duke@435 | 1093 | frame::interpreter_frame_monitor_block_top_offset * wordSize); |
never@739 | 1094 | __ movptr(rax, monitor_block_top); |
never@739 | 1095 | __ cmpptr(rax, rsp); |
duke@435 | 1096 | __ jcc(Assembler::equal, L); |
duke@435 | 1097 | __ stop("broken stack frame setup in interpreter"); |
duke@435 | 1098 | __ bind(L); |
duke@435 | 1099 | } |
duke@435 | 1100 | #endif |
duke@435 | 1101 | |
duke@435 | 1102 | // jvmti/dtrace support |
duke@435 | 1103 | __ notify_method_entry(); |
duke@435 | 1104 | |
duke@435 | 1105 | // work registers |
duke@435 | 1106 | const Register method = rbx; |
duke@435 | 1107 | const Register thread = rdi; |
duke@435 | 1108 | const Register t = rcx; |
duke@435 | 1109 | |
duke@435 | 1110 | // allocate space for parameters |
duke@435 | 1111 | __ get_method(method); |
jiangli@4338 | 1112 | __ movptr(t, Address(method, Method::const_offset())); |
jiangli@4338 | 1113 | __ load_unsigned_short(t, Address(t, ConstMethod::size_of_parameters_offset())); |
jiangli@4338 | 1114 | |
twisti@1861 | 1115 | __ shlptr(t, Interpreter::logStackElementSize); |
never@739 | 1116 | __ addptr(t, 2*wordSize); // allocate two more slots for JNIEnv and possible mirror |
never@739 | 1117 | __ subptr(rsp, t); |
never@739 | 1118 | __ andptr(rsp, -(StackAlignmentInBytes)); // gcc needs 16 byte aligned stacks to do XMM intrinsics |
duke@435 | 1119 | |
duke@435 | 1120 | // get signature handler |
duke@435 | 1121 | { Label L; |
coleenp@4037 | 1122 | __ movptr(t, Address(method, Method::signature_handler_offset())); |
never@739 | 1123 | __ testptr(t, t); |
duke@435 | 1124 | __ jcc(Assembler::notZero, L); |
duke@435 | 1125 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::prepare_native_call), method); |
duke@435 | 1126 | __ get_method(method); |
coleenp@4037 | 1127 | __ movptr(t, Address(method, Method::signature_handler_offset())); |
duke@435 | 1128 | __ bind(L); |
duke@435 | 1129 | } |
duke@435 | 1130 | |
duke@435 | 1131 | // call signature handler |
duke@435 | 1132 | assert(InterpreterRuntime::SignatureHandlerGenerator::from() == rdi, "adjust this code"); |
duke@435 | 1133 | assert(InterpreterRuntime::SignatureHandlerGenerator::to () == rsp, "adjust this code"); |
duke@435 | 1134 | assert(InterpreterRuntime::SignatureHandlerGenerator::temp() == t , "adjust this code"); |
duke@435 | 1135 | // The generated handlers do not touch RBX (the method oop). |
duke@435 | 1136 | // However, large signatures cannot be cached and are generated |
duke@435 | 1137 | // each time here. The slow-path generator will blow RBX |
duke@435 | 1138 | // sometime, so we must reload it after the call. |
duke@435 | 1139 | __ call(t); |
duke@435 | 1140 | __ get_method(method); // slow path call blows RBX on DevStudio 5.0 |
duke@435 | 1141 | |
duke@435 | 1142 | // result handler is in rax, |
duke@435 | 1143 | // set result handler |
never@739 | 1144 | __ movptr(Address(rbp, frame::interpreter_frame_result_handler_offset*wordSize), rax); |
duke@435 | 1145 | |
duke@435 | 1146 | // pass mirror handle if static call |
duke@435 | 1147 | { Label L; |
stefank@3391 | 1148 | const int mirror_offset = in_bytes(Klass::java_mirror_offset()); |
coleenp@4037 | 1149 | __ movl(t, Address(method, Method::access_flags_offset())); |
duke@435 | 1150 | __ testl(t, JVM_ACC_STATIC); |
duke@435 | 1151 | __ jcc(Assembler::zero, L); |
duke@435 | 1152 | // get mirror |
coleenp@4037 | 1153 | __ movptr(t, Address(method, Method:: const_offset())); |
coleenp@4037 | 1154 | __ movptr(t, Address(t, ConstMethod::constants_offset())); |
coleenp@4037 | 1155 | __ movptr(t, Address(t, ConstantPool::pool_holder_offset_in_bytes())); |
never@739 | 1156 | __ movptr(t, Address(t, mirror_offset)); |
duke@435 | 1157 | // copy mirror into activation frame |
never@739 | 1158 | __ movptr(Address(rbp, frame::interpreter_frame_oop_temp_offset * wordSize), t); |
duke@435 | 1159 | // pass handle to mirror |
never@739 | 1160 | __ lea(t, Address(rbp, frame::interpreter_frame_oop_temp_offset * wordSize)); |
never@739 | 1161 | __ movptr(Address(rsp, wordSize), t); |
duke@435 | 1162 | __ bind(L); |
duke@435 | 1163 | } |
duke@435 | 1164 | |
duke@435 | 1165 | // get native function entry point |
duke@435 | 1166 | { Label L; |
coleenp@4037 | 1167 | __ movptr(rax, Address(method, Method::native_function_offset())); |
duke@435 | 1168 | ExternalAddress unsatisfied(SharedRuntime::native_method_throw_unsatisfied_link_error_entry()); |
never@739 | 1169 | __ cmpptr(rax, unsatisfied.addr()); |
duke@435 | 1170 | __ jcc(Assembler::notEqual, L); |
duke@435 | 1171 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::prepare_native_call), method); |
duke@435 | 1172 | __ get_method(method); |
coleenp@4037 | 1173 | __ movptr(rax, Address(method, Method::native_function_offset())); |
duke@435 | 1174 | __ bind(L); |
duke@435 | 1175 | } |
duke@435 | 1176 | |
duke@435 | 1177 | // pass JNIEnv |
duke@435 | 1178 | __ get_thread(thread); |
never@739 | 1179 | __ lea(t, Address(thread, JavaThread::jni_environment_offset())); |
never@739 | 1180 | __ movptr(Address(rsp, 0), t); |
duke@435 | 1181 | |
duke@435 | 1182 | // set_last_Java_frame_before_call |
duke@435 | 1183 | // It is enough that the pc() |
duke@435 | 1184 | // points into the right code segment. It does not have to be the correct return pc. |
duke@435 | 1185 | __ set_last_Java_frame(thread, noreg, rbp, __ pc()); |
duke@435 | 1186 | |
duke@435 | 1187 | // change thread state |
duke@435 | 1188 | #ifdef ASSERT |
duke@435 | 1189 | { Label L; |
duke@435 | 1190 | __ movl(t, Address(thread, JavaThread::thread_state_offset())); |
duke@435 | 1191 | __ cmpl(t, _thread_in_Java); |
duke@435 | 1192 | __ jcc(Assembler::equal, L); |
duke@435 | 1193 | __ stop("Wrong thread state in native stub"); |
duke@435 | 1194 | __ bind(L); |
duke@435 | 1195 | } |
duke@435 | 1196 | #endif |
duke@435 | 1197 | |
duke@435 | 1198 | // Change state to native |
duke@435 | 1199 | __ movl(Address(thread, JavaThread::thread_state_offset()), _thread_in_native); |
duke@435 | 1200 | __ call(rax); |
duke@435 | 1201 | |
duke@435 | 1202 | // result potentially in rdx:rax or ST0 |
duke@435 | 1203 | |
kvn@4873 | 1204 | // Verify or restore cpu control state after JNI call |
kvn@4873 | 1205 | __ restore_cpu_control_state_after_jni(); |
duke@435 | 1206 | |
duke@435 | 1207 | // save potential result in ST(0) & rdx:rax |
duke@435 | 1208 | // (if result handler is the T_FLOAT or T_DOUBLE handler, result must be in ST0 - |
duke@435 | 1209 | // the check is necessary to avoid potential Intel FPU overflow problems by saving/restoring 'empty' FPU registers) |
duke@435 | 1210 | // It is safe to do this push because state is _thread_in_native and return address will be found |
duke@435 | 1211 | // via _last_native_pc and not via _last_jave_sp |
duke@435 | 1212 | |
duke@435 | 1213 | // NOTE: the order of theses push(es) is known to frame::interpreter_frame_result. |
duke@435 | 1214 | // If the order changes or anything else is added to the stack the code in |
duke@435 | 1215 | // interpreter_frame_result will have to be changed. |
duke@435 | 1216 | |
duke@435 | 1217 | { Label L; |
duke@435 | 1218 | Label push_double; |
duke@435 | 1219 | ExternalAddress float_handler(AbstractInterpreter::result_handler(T_FLOAT)); |
duke@435 | 1220 | ExternalAddress double_handler(AbstractInterpreter::result_handler(T_DOUBLE)); |
duke@435 | 1221 | __ cmpptr(Address(rbp, (frame::interpreter_frame_oop_temp_offset + 1)*wordSize), |
duke@435 | 1222 | float_handler.addr()); |
duke@435 | 1223 | __ jcc(Assembler::equal, push_double); |
duke@435 | 1224 | __ cmpptr(Address(rbp, (frame::interpreter_frame_oop_temp_offset + 1)*wordSize), |
duke@435 | 1225 | double_handler.addr()); |
duke@435 | 1226 | __ jcc(Assembler::notEqual, L); |
duke@435 | 1227 | __ bind(push_double); |
duke@435 | 1228 | __ push(dtos); |
duke@435 | 1229 | __ bind(L); |
duke@435 | 1230 | } |
duke@435 | 1231 | __ push(ltos); |
duke@435 | 1232 | |
duke@435 | 1233 | // change thread state |
duke@435 | 1234 | __ get_thread(thread); |
duke@435 | 1235 | __ movl(Address(thread, JavaThread::thread_state_offset()), _thread_in_native_trans); |
duke@435 | 1236 | if(os::is_MP()) { |
duke@435 | 1237 | if (UseMembar) { |
never@739 | 1238 | // Force this write out before the read below |
never@739 | 1239 | __ membar(Assembler::Membar_mask_bits( |
never@739 | 1240 | Assembler::LoadLoad | Assembler::LoadStore | |
never@739 | 1241 | Assembler::StoreLoad | Assembler::StoreStore)); |
duke@435 | 1242 | } else { |
duke@435 | 1243 | // Write serialization page so VM thread can do a pseudo remote membar. |
duke@435 | 1244 | // We use the current thread pointer to calculate a thread specific |
duke@435 | 1245 | // offset to write to within the page. This minimizes bus traffic |
duke@435 | 1246 | // due to cache line collision. |
duke@435 | 1247 | __ serialize_memory(thread, rcx); |
duke@435 | 1248 | } |
duke@435 | 1249 | } |
duke@435 | 1250 | |
duke@435 | 1251 | if (AlwaysRestoreFPU) { |
duke@435 | 1252 | // Make sure the control word is correct. |
duke@435 | 1253 | __ fldcw(ExternalAddress(StubRoutines::addr_fpu_cntrl_wrd_std())); |
duke@435 | 1254 | } |
duke@435 | 1255 | |
duke@435 | 1256 | // check for safepoint operation in progress and/or pending suspend requests |
duke@435 | 1257 | { Label Continue; |
duke@435 | 1258 | |
duke@435 | 1259 | __ cmp32(ExternalAddress(SafepointSynchronize::address_of_state()), |
duke@435 | 1260 | SafepointSynchronize::_not_synchronized); |
duke@435 | 1261 | |
duke@435 | 1262 | Label L; |
duke@435 | 1263 | __ jcc(Assembler::notEqual, L); |
duke@435 | 1264 | __ cmpl(Address(thread, JavaThread::suspend_flags_offset()), 0); |
duke@435 | 1265 | __ jcc(Assembler::equal, Continue); |
duke@435 | 1266 | __ bind(L); |
duke@435 | 1267 | |
duke@435 | 1268 | // Don't use call_VM as it will see a possible pending exception and forward it |
duke@435 | 1269 | // and never return here preventing us from clearing _last_native_pc down below. |
duke@435 | 1270 | // Also can't use call_VM_leaf either as it will check to see if rsi & rdi are |
duke@435 | 1271 | // preserved and correspond to the bcp/locals pointers. So we do a runtime call |
duke@435 | 1272 | // by hand. |
duke@435 | 1273 | // |
never@739 | 1274 | __ push(thread); |
duke@435 | 1275 | __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, |
duke@435 | 1276 | JavaThread::check_special_condition_for_native_trans))); |
duke@435 | 1277 | __ increment(rsp, wordSize); |
duke@435 | 1278 | __ get_thread(thread); |
duke@435 | 1279 | |
duke@435 | 1280 | __ bind(Continue); |
duke@435 | 1281 | } |
duke@435 | 1282 | |
duke@435 | 1283 | // change thread state |
duke@435 | 1284 | __ movl(Address(thread, JavaThread::thread_state_offset()), _thread_in_Java); |
duke@435 | 1285 | |
duke@435 | 1286 | __ reset_last_Java_frame(thread, true, true); |
duke@435 | 1287 | |
duke@435 | 1288 | // reset handle block |
never@739 | 1289 | __ movptr(t, Address(thread, JavaThread::active_handles_offset())); |
goetz@6558 | 1290 | __ movl(Address(t, JNIHandleBlock::top_offset_in_bytes()), NULL_WORD); |
duke@435 | 1291 | |
duke@435 | 1292 | // If result was an oop then unbox and save it in the frame |
duke@435 | 1293 | { Label L; |
duke@435 | 1294 | Label no_oop, store_result; |
duke@435 | 1295 | ExternalAddress handler(AbstractInterpreter::result_handler(T_OBJECT)); |
duke@435 | 1296 | __ cmpptr(Address(rbp, frame::interpreter_frame_result_handler_offset*wordSize), |
duke@435 | 1297 | handler.addr()); |
duke@435 | 1298 | __ jcc(Assembler::notEqual, no_oop); |
never@739 | 1299 | __ cmpptr(Address(rsp, 0), (int32_t)NULL_WORD); |
duke@435 | 1300 | __ pop(ltos); |
never@739 | 1301 | __ testptr(rax, rax); |
duke@435 | 1302 | __ jcc(Assembler::zero, store_result); |
duke@435 | 1303 | // unbox |
never@739 | 1304 | __ movptr(rax, Address(rax, 0)); |
duke@435 | 1305 | __ bind(store_result); |
never@739 | 1306 | __ movptr(Address(rbp, (frame::interpreter_frame_oop_temp_offset)*wordSize), rax); |
duke@435 | 1307 | // keep stack depth as expected by pushing oop which will eventually be discarded |
duke@435 | 1308 | __ push(ltos); |
duke@435 | 1309 | __ bind(no_oop); |
duke@435 | 1310 | } |
duke@435 | 1311 | |
duke@435 | 1312 | { |
duke@435 | 1313 | Label no_reguard; |
duke@435 | 1314 | __ cmpl(Address(thread, JavaThread::stack_guard_state_offset()), JavaThread::stack_guard_yellow_disabled); |
duke@435 | 1315 | __ jcc(Assembler::notEqual, no_reguard); |
duke@435 | 1316 | |
never@739 | 1317 | __ pusha(); |
duke@435 | 1318 | __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, SharedRuntime::reguard_yellow_pages))); |
never@739 | 1319 | __ popa(); |
duke@435 | 1320 | |
duke@435 | 1321 | __ bind(no_reguard); |
duke@435 | 1322 | } |
duke@435 | 1323 | |
duke@435 | 1324 | // restore rsi to have legal interpreter frame, |
duke@435 | 1325 | // i.e., bci == 0 <=> rsi == code_base() |
duke@435 | 1326 | // Can't call_VM until bcp is within reasonable. |
duke@435 | 1327 | __ get_method(method); // method is junk from thread_in_native to now. |
coleenp@4037 | 1328 | __ movptr(rsi, Address(method,Method::const_offset())); // get ConstMethod* |
coleenp@4037 | 1329 | __ lea(rsi, Address(rsi,ConstMethod::codes_offset())); // get codebase |
duke@435 | 1330 | |
duke@435 | 1331 | // handle exceptions (exception handling will handle unlocking!) |
duke@435 | 1332 | { Label L; |
never@739 | 1333 | __ cmpptr(Address(thread, Thread::pending_exception_offset()), (int32_t)NULL_WORD); |
duke@435 | 1334 | __ jcc(Assembler::zero, L); |
duke@435 | 1335 | // Note: At some point we may want to unify this with the code used in call_VM_base(); |
duke@435 | 1336 | // i.e., we should use the StubRoutines::forward_exception code. For now this |
duke@435 | 1337 | // doesn't work here because the rsp is not correctly set at this point. |
duke@435 | 1338 | __ MacroAssembler::call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_pending_exception)); |
duke@435 | 1339 | __ should_not_reach_here(); |
duke@435 | 1340 | __ bind(L); |
duke@435 | 1341 | } |
duke@435 | 1342 | |
duke@435 | 1343 | // do unlocking if necessary |
duke@435 | 1344 | { Label L; |
coleenp@4037 | 1345 | __ movl(t, Address(method, Method::access_flags_offset())); |
duke@435 | 1346 | __ testl(t, JVM_ACC_SYNCHRONIZED); |
duke@435 | 1347 | __ jcc(Assembler::zero, L); |
duke@435 | 1348 | // the code below should be shared with interpreter macro assembler implementation |
duke@435 | 1349 | { Label unlock; |
duke@435 | 1350 | // BasicObjectLock will be first in list, since this is a synchronized method. However, need |
duke@435 | 1351 | // to check that the object has not been unlocked by an explicit monitorexit bytecode. |
duke@435 | 1352 | const Address monitor(rbp, frame::interpreter_frame_initial_sp_offset * wordSize - (int)sizeof(BasicObjectLock)); |
duke@435 | 1353 | |
never@739 | 1354 | __ lea(rdx, monitor); // address of first monitor |
duke@435 | 1355 | |
never@739 | 1356 | __ movptr(t, Address(rdx, BasicObjectLock::obj_offset_in_bytes())); |
never@739 | 1357 | __ testptr(t, t); |
duke@435 | 1358 | __ jcc(Assembler::notZero, unlock); |
duke@435 | 1359 | |
duke@435 | 1360 | // Entry already unlocked, need to throw exception |
duke@435 | 1361 | __ MacroAssembler::call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_illegal_monitor_state_exception)); |
duke@435 | 1362 | __ should_not_reach_here(); |
duke@435 | 1363 | |
duke@435 | 1364 | __ bind(unlock); |
duke@435 | 1365 | __ unlock_object(rdx); |
duke@435 | 1366 | } |
duke@435 | 1367 | __ bind(L); |
duke@435 | 1368 | } |
duke@435 | 1369 | |
duke@435 | 1370 | // jvmti/dtrace support |
duke@435 | 1371 | // Note: This must happen _after_ handling/throwing any exceptions since |
duke@435 | 1372 | // the exception handler code notifies the runtime of method exits |
duke@435 | 1373 | // too. If this happens before, method entry/exit notifications are |
duke@435 | 1374 | // not properly paired (was bug - gri 11/22/99). |
duke@435 | 1375 | __ notify_method_exit(vtos, InterpreterMacroAssembler::NotifyJVMTI); |
duke@435 | 1376 | |
duke@435 | 1377 | // restore potential result in rdx:rax, call result handler to restore potential result in ST0 & handle result |
duke@435 | 1378 | __ pop(ltos); |
never@739 | 1379 | __ movptr(t, Address(rbp, frame::interpreter_frame_result_handler_offset*wordSize)); |
duke@435 | 1380 | __ call(t); |
duke@435 | 1381 | |
duke@435 | 1382 | // remove activation |
never@739 | 1383 | __ movptr(t, Address(rbp, frame::interpreter_frame_sender_sp_offset * wordSize)); // get sender sp |
duke@435 | 1384 | __ leave(); // remove frame anchor |
never@739 | 1385 | __ pop(rdi); // get return address |
never@739 | 1386 | __ mov(rsp, t); // set sp to sender sp |
duke@435 | 1387 | __ jmp(rdi); |
duke@435 | 1388 | |
duke@435 | 1389 | if (inc_counter) { |
duke@435 | 1390 | // Handle overflow of counter and compile method |
duke@435 | 1391 | __ bind(invocation_counter_overflow); |
duke@435 | 1392 | generate_counter_overflow(&continue_after_compile); |
duke@435 | 1393 | } |
duke@435 | 1394 | |
duke@435 | 1395 | return entry_point; |
duke@435 | 1396 | } |
duke@435 | 1397 | |
duke@435 | 1398 | // |
duke@435 | 1399 | // Generic interpreted method entry to (asm) interpreter |
duke@435 | 1400 | // |
duke@435 | 1401 | address InterpreterGenerator::generate_normal_entry(bool synchronized) { |
duke@435 | 1402 | // determine code generation flags |
duke@435 | 1403 | bool inc_counter = UseCompiler || CountCompiledCalls; |
duke@435 | 1404 | |
coleenp@4037 | 1405 | // rbx,: Method* |
duke@435 | 1406 | // rsi: sender sp |
duke@435 | 1407 | address entry_point = __ pc(); |
duke@435 | 1408 | |
jiangli@4338 | 1409 | const Address constMethod (rbx, Method::const_offset()); |
coleenp@4037 | 1410 | const Address access_flags (rbx, Method::access_flags_offset()); |
jiangli@4338 | 1411 | const Address size_of_parameters(rdx, ConstMethod::size_of_parameters_offset()); |
jiangli@4338 | 1412 | const Address size_of_locals (rdx, ConstMethod::size_of_locals_offset()); |
duke@435 | 1413 | |
duke@435 | 1414 | // get parameter size (always needed) |
jiangli@4338 | 1415 | __ movptr(rdx, constMethod); |
jrose@1057 | 1416 | __ load_unsigned_short(rcx, size_of_parameters); |
duke@435 | 1417 | |
coleenp@4037 | 1418 | // rbx,: Method* |
duke@435 | 1419 | // rcx: size of parameters |
duke@435 | 1420 | |
duke@435 | 1421 | // rsi: sender_sp (could differ from sp+wordSize if we were called via c2i ) |
duke@435 | 1422 | |
jrose@1057 | 1423 | __ load_unsigned_short(rdx, size_of_locals); // get size of locals in words |
duke@435 | 1424 | __ subl(rdx, rcx); // rdx = no. of additional locals |
duke@435 | 1425 | |
duke@435 | 1426 | // see if we've got enough room on the stack for locals plus overhead. |
duke@435 | 1427 | generate_stack_overflow_check(); |
duke@435 | 1428 | |
duke@435 | 1429 | // get return address |
never@739 | 1430 | __ pop(rax); |
duke@435 | 1431 | |
duke@435 | 1432 | // compute beginning of parameters (rdi) |
never@739 | 1433 | __ lea(rdi, Address(rsp, rcx, Interpreter::stackElementScale(), -wordSize)); |
duke@435 | 1434 | |
duke@435 | 1435 | // rdx - # of additional locals |
duke@435 | 1436 | // allocate space for locals |
duke@435 | 1437 | // explicitly initialize locals |
duke@435 | 1438 | { |
duke@435 | 1439 | Label exit, loop; |
duke@435 | 1440 | __ testl(rdx, rdx); |
duke@435 | 1441 | __ jcc(Assembler::lessEqual, exit); // do nothing if rdx <= 0 |
duke@435 | 1442 | __ bind(loop); |
never@739 | 1443 | __ push((int32_t)NULL_WORD); // initialize local variables |
duke@435 | 1444 | __ decrement(rdx); // until everything initialized |
duke@435 | 1445 | __ jcc(Assembler::greater, loop); |
duke@435 | 1446 | __ bind(exit); |
duke@435 | 1447 | } |
duke@435 | 1448 | |
duke@435 | 1449 | // initialize fixed part of activation frame |
duke@435 | 1450 | generate_fixed_frame(false); |
duke@435 | 1451 | |
duke@435 | 1452 | // make sure method is not native & not abstract |
duke@435 | 1453 | #ifdef ASSERT |
duke@435 | 1454 | __ movl(rax, access_flags); |
duke@435 | 1455 | { |
duke@435 | 1456 | Label L; |
duke@435 | 1457 | __ testl(rax, JVM_ACC_NATIVE); |
duke@435 | 1458 | __ jcc(Assembler::zero, L); |
duke@435 | 1459 | __ stop("tried to execute native method as non-native"); |
duke@435 | 1460 | __ bind(L); |
duke@435 | 1461 | } |
duke@435 | 1462 | { Label L; |
duke@435 | 1463 | __ testl(rax, JVM_ACC_ABSTRACT); |
duke@435 | 1464 | __ jcc(Assembler::zero, L); |
duke@435 | 1465 | __ stop("tried to execute abstract method in interpreter"); |
duke@435 | 1466 | __ bind(L); |
duke@435 | 1467 | } |
duke@435 | 1468 | #endif |
duke@435 | 1469 | |
duke@435 | 1470 | // Since at this point in the method invocation the exception handler |
duke@435 | 1471 | // would try to exit the monitor of synchronized methods which hasn't |
duke@435 | 1472 | // been entered yet, we set the thread local variable |
duke@435 | 1473 | // _do_not_unlock_if_synchronized to true. The remove_activation will |
duke@435 | 1474 | // check this flag. |
duke@435 | 1475 | |
duke@435 | 1476 | __ get_thread(rax); |
duke@435 | 1477 | const Address do_not_unlock_if_synchronized(rax, |
duke@435 | 1478 | in_bytes(JavaThread::do_not_unlock_if_synchronized_offset())); |
duke@435 | 1479 | __ movbool(do_not_unlock_if_synchronized, true); |
duke@435 | 1480 | |
roland@5987 | 1481 | __ profile_parameters_type(rax, rcx, rdx); |
duke@435 | 1482 | // increment invocation count & check for overflow |
duke@435 | 1483 | Label invocation_counter_overflow; |
duke@435 | 1484 | Label profile_method; |
duke@435 | 1485 | Label profile_method_continue; |
duke@435 | 1486 | if (inc_counter) { |
duke@435 | 1487 | generate_counter_incr(&invocation_counter_overflow, &profile_method, &profile_method_continue); |
duke@435 | 1488 | if (ProfileInterpreter) { |
duke@435 | 1489 | __ bind(profile_method_continue); |
duke@435 | 1490 | } |
duke@435 | 1491 | } |
duke@435 | 1492 | Label continue_after_compile; |
duke@435 | 1493 | __ bind(continue_after_compile); |
duke@435 | 1494 | |
duke@435 | 1495 | bang_stack_shadow_pages(false); |
duke@435 | 1496 | |
duke@435 | 1497 | // reset the _do_not_unlock_if_synchronized flag |
duke@435 | 1498 | __ get_thread(rax); |
duke@435 | 1499 | __ movbool(do_not_unlock_if_synchronized, false); |
duke@435 | 1500 | |
duke@435 | 1501 | // check for synchronized methods |
duke@435 | 1502 | // Must happen AFTER invocation_counter check and stack overflow check, |
duke@435 | 1503 | // so method is not locked if overflows. |
duke@435 | 1504 | // |
duke@435 | 1505 | if (synchronized) { |
duke@435 | 1506 | // Allocate monitor and lock method |
duke@435 | 1507 | lock_method(); |
duke@435 | 1508 | } else { |
duke@435 | 1509 | // no synchronization necessary |
duke@435 | 1510 | #ifdef ASSERT |
duke@435 | 1511 | { Label L; |
duke@435 | 1512 | __ movl(rax, access_flags); |
duke@435 | 1513 | __ testl(rax, JVM_ACC_SYNCHRONIZED); |
duke@435 | 1514 | __ jcc(Assembler::zero, L); |
duke@435 | 1515 | __ stop("method needs synchronization"); |
duke@435 | 1516 | __ bind(L); |
duke@435 | 1517 | } |
duke@435 | 1518 | #endif |
duke@435 | 1519 | } |
duke@435 | 1520 | |
duke@435 | 1521 | // start execution |
duke@435 | 1522 | #ifdef ASSERT |
duke@435 | 1523 | { Label L; |
duke@435 | 1524 | const Address monitor_block_top (rbp, |
duke@435 | 1525 | frame::interpreter_frame_monitor_block_top_offset * wordSize); |
never@739 | 1526 | __ movptr(rax, monitor_block_top); |
never@739 | 1527 | __ cmpptr(rax, rsp); |
duke@435 | 1528 | __ jcc(Assembler::equal, L); |
duke@435 | 1529 | __ stop("broken stack frame setup in interpreter"); |
duke@435 | 1530 | __ bind(L); |
duke@435 | 1531 | } |
duke@435 | 1532 | #endif |
duke@435 | 1533 | |
duke@435 | 1534 | // jvmti support |
duke@435 | 1535 | __ notify_method_entry(); |
duke@435 | 1536 | |
duke@435 | 1537 | __ dispatch_next(vtos); |
duke@435 | 1538 | |
duke@435 | 1539 | // invocation counter overflow |
duke@435 | 1540 | if (inc_counter) { |
duke@435 | 1541 | if (ProfileInterpreter) { |
duke@435 | 1542 | // We have decided to profile this method in the interpreter |
duke@435 | 1543 | __ bind(profile_method); |
iveresov@2438 | 1544 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::profile_method)); |
iveresov@2438 | 1545 | __ set_method_data_pointer_for_bcp(); |
iveresov@2461 | 1546 | __ get_method(rbx); |
duke@435 | 1547 | __ jmp(profile_method_continue); |
duke@435 | 1548 | } |
duke@435 | 1549 | // Handle overflow of counter and compile method |
duke@435 | 1550 | __ bind(invocation_counter_overflow); |
duke@435 | 1551 | generate_counter_overflow(&continue_after_compile); |
duke@435 | 1552 | } |
duke@435 | 1553 | |
duke@435 | 1554 | return entry_point; |
duke@435 | 1555 | } |
duke@435 | 1556 | |
duke@435 | 1557 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 1558 | // Entry points |
duke@435 | 1559 | // |
duke@435 | 1560 | // Here we generate the various kind of entries into the interpreter. |
duke@435 | 1561 | // The two main entry type are generic bytecode methods and native call method. |
duke@435 | 1562 | // These both come in synchronized and non-synchronized versions but the |
duke@435 | 1563 | // frame layout they create is very similar. The other method entry |
duke@435 | 1564 | // types are really just special purpose entries that are really entry |
duke@435 | 1565 | // and interpretation all in one. These are for trivial methods like |
duke@435 | 1566 | // accessor, empty, or special math methods. |
duke@435 | 1567 | // |
duke@435 | 1568 | // When control flow reaches any of the entry types for the interpreter |
duke@435 | 1569 | // the following holds -> |
duke@435 | 1570 | // |
duke@435 | 1571 | // Arguments: |
duke@435 | 1572 | // |
coleenp@4037 | 1573 | // rbx,: Method* |
duke@435 | 1574 | // rcx: receiver |
duke@435 | 1575 | // |
duke@435 | 1576 | // |
duke@435 | 1577 | // Stack layout immediately at entry |
duke@435 | 1578 | // |
duke@435 | 1579 | // [ return address ] <--- rsp |
duke@435 | 1580 | // [ parameter n ] |
duke@435 | 1581 | // ... |
duke@435 | 1582 | // [ parameter 1 ] |
duke@435 | 1583 | // [ expression stack ] (caller's java expression stack) |
duke@435 | 1584 | |
duke@435 | 1585 | // Assuming that we don't go to one of the trivial specialized |
duke@435 | 1586 | // entries the stack will look like below when we are ready to execute |
duke@435 | 1587 | // the first bytecode (or call the native routine). The register usage |
duke@435 | 1588 | // will be as the template based interpreter expects (see interpreter_x86.hpp). |
duke@435 | 1589 | // |
duke@435 | 1590 | // local variables follow incoming parameters immediately; i.e. |
duke@435 | 1591 | // the return address is moved to the end of the locals). |
duke@435 | 1592 | // |
duke@435 | 1593 | // [ monitor entry ] <--- rsp |
duke@435 | 1594 | // ... |
duke@435 | 1595 | // [ monitor entry ] |
duke@435 | 1596 | // [ expr. stack bottom ] |
duke@435 | 1597 | // [ saved rsi ] |
duke@435 | 1598 | // [ current rdi ] |
coleenp@4037 | 1599 | // [ Method* ] |
duke@435 | 1600 | // [ saved rbp, ] <--- rbp, |
duke@435 | 1601 | // [ return address ] |
duke@435 | 1602 | // [ local variable m ] |
duke@435 | 1603 | // ... |
duke@435 | 1604 | // [ local variable 1 ] |
duke@435 | 1605 | // [ parameter n ] |
duke@435 | 1606 | // ... |
duke@435 | 1607 | // [ parameter 1 ] <--- rdi |
duke@435 | 1608 | |
duke@435 | 1609 | address AbstractInterpreterGenerator::generate_method_entry(AbstractInterpreter::MethodKind kind) { |
duke@435 | 1610 | // determine code generation flags |
duke@435 | 1611 | bool synchronized = false; |
duke@435 | 1612 | address entry_point = NULL; |
drchase@5353 | 1613 | InterpreterGenerator* ig_this = (InterpreterGenerator*)this; |
duke@435 | 1614 | |
duke@435 | 1615 | switch (kind) { |
drchase@5353 | 1616 | case Interpreter::zerolocals : break; |
drchase@5353 | 1617 | case Interpreter::zerolocals_synchronized: synchronized = true; break; |
drchase@5353 | 1618 | case Interpreter::native : entry_point = ig_this->generate_native_entry(false); break; |
drchase@5353 | 1619 | case Interpreter::native_synchronized : entry_point = ig_this->generate_native_entry(true); break; |
drchase@5353 | 1620 | case Interpreter::empty : entry_point = ig_this->generate_empty_entry(); break; |
drchase@5353 | 1621 | case Interpreter::accessor : entry_point = ig_this->generate_accessor_entry(); break; |
drchase@5353 | 1622 | case Interpreter::abstract : entry_point = ig_this->generate_abstract_entry(); break; |
duke@435 | 1623 | |
duke@435 | 1624 | case Interpreter::java_lang_math_sin : // fall thru |
duke@435 | 1625 | case Interpreter::java_lang_math_cos : // fall thru |
duke@435 | 1626 | case Interpreter::java_lang_math_tan : // fall thru |
duke@435 | 1627 | case Interpreter::java_lang_math_abs : // fall thru |
duke@435 | 1628 | case Interpreter::java_lang_math_log : // fall thru |
duke@435 | 1629 | case Interpreter::java_lang_math_log10 : // fall thru |
roland@3787 | 1630 | case Interpreter::java_lang_math_sqrt : // fall thru |
roland@3787 | 1631 | case Interpreter::java_lang_math_pow : // fall thru |
drchase@5353 | 1632 | case Interpreter::java_lang_math_exp : entry_point = ig_this->generate_math_entry(kind); break; |
johnc@2781 | 1633 | case Interpreter::java_lang_ref_reference_get |
drchase@5353 | 1634 | : entry_point = ig_this->generate_Reference_get_entry(); break; |
drchase@5353 | 1635 | case Interpreter::java_util_zip_CRC32_update |
drchase@5353 | 1636 | : entry_point = ig_this->generate_CRC32_update_entry(); break; |
drchase@5353 | 1637 | case Interpreter::java_util_zip_CRC32_updateBytes |
drchase@5353 | 1638 | : // fall thru |
drchase@5353 | 1639 | case Interpreter::java_util_zip_CRC32_updateByteBuffer |
drchase@5353 | 1640 | : entry_point = ig_this->generate_CRC32_updateBytes_entry(kind); break; |
twisti@3969 | 1641 | default: |
twisti@3969 | 1642 | fatal(err_msg("unexpected method kind: %d", kind)); |
twisti@3969 | 1643 | break; |
duke@435 | 1644 | } |
duke@435 | 1645 | |
duke@435 | 1646 | if (entry_point) return entry_point; |
duke@435 | 1647 | |
drchase@5353 | 1648 | return ig_this->generate_normal_entry(synchronized); |
duke@435 | 1649 | |
duke@435 | 1650 | } |
duke@435 | 1651 | |
never@1609 | 1652 | // These should never be compiled since the interpreter will prefer |
never@1609 | 1653 | // the compiled version to the intrinsic version. |
never@1609 | 1654 | bool AbstractInterpreter::can_be_compiled(methodHandle m) { |
never@1609 | 1655 | switch (method_kind(m)) { |
never@1609 | 1656 | case Interpreter::java_lang_math_sin : // fall thru |
never@1609 | 1657 | case Interpreter::java_lang_math_cos : // fall thru |
never@1609 | 1658 | case Interpreter::java_lang_math_tan : // fall thru |
never@1609 | 1659 | case Interpreter::java_lang_math_abs : // fall thru |
never@1609 | 1660 | case Interpreter::java_lang_math_log : // fall thru |
never@1609 | 1661 | case Interpreter::java_lang_math_log10 : // fall thru |
roland@3787 | 1662 | case Interpreter::java_lang_math_sqrt : // fall thru |
roland@3787 | 1663 | case Interpreter::java_lang_math_pow : // fall thru |
roland@3787 | 1664 | case Interpreter::java_lang_math_exp : |
never@1609 | 1665 | return false; |
never@1609 | 1666 | default: |
never@1609 | 1667 | return true; |
never@1609 | 1668 | } |
never@1609 | 1669 | } |
never@1609 | 1670 | |
duke@435 | 1671 | // How much stack a method activation needs in words. |
coleenp@4037 | 1672 | int AbstractInterpreter::size_top_interpreter_activation(Method* method) { |
duke@435 | 1673 | |
duke@435 | 1674 | const int stub_code = 4; // see generate_call_stub |
duke@435 | 1675 | // Save space for one monitor to get into the interpreted method in case |
duke@435 | 1676 | // the method is synchronized |
duke@435 | 1677 | int monitor_size = method->is_synchronized() ? |
duke@435 | 1678 | 1*frame::interpreter_frame_monitor_size() : 0; |
duke@435 | 1679 | |
duke@435 | 1680 | // total overhead size: entry_size + (saved rbp, thru expr stack bottom). |
duke@435 | 1681 | // be sure to change this if you add/subtract anything to/from the overhead area |
duke@435 | 1682 | const int overhead_size = -frame::interpreter_frame_initial_sp_offset; |
duke@435 | 1683 | |
roland@5225 | 1684 | const int method_stack = (method->max_locals() + method->max_stack()) * |
twisti@1861 | 1685 | Interpreter::stackElementWords; |
duke@435 | 1686 | return overhead_size + method_stack + stub_code; |
duke@435 | 1687 | } |
duke@435 | 1688 | |
duke@435 | 1689 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 1690 | // Exceptions |
duke@435 | 1691 | |
duke@435 | 1692 | void TemplateInterpreterGenerator::generate_throw_exception() { |
duke@435 | 1693 | // Entry point in previous activation (i.e., if the caller was interpreted) |
duke@435 | 1694 | Interpreter::_rethrow_exception_entry = __ pc(); |
twisti@1730 | 1695 | const Register thread = rcx; |
duke@435 | 1696 | |
duke@435 | 1697 | // Restore sp to interpreter_frame_last_sp even though we are going |
duke@435 | 1698 | // to empty the expression stack for the exception processing. |
xlu@947 | 1699 | __ movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), NULL_WORD); |
duke@435 | 1700 | // rax,: exception |
duke@435 | 1701 | // rdx: return address/pc that threw exception |
duke@435 | 1702 | __ restore_bcp(); // rsi points to call/send |
duke@435 | 1703 | __ restore_locals(); |
duke@435 | 1704 | |
duke@435 | 1705 | // Entry point for exceptions thrown within interpreter code |
duke@435 | 1706 | Interpreter::_throw_exception_entry = __ pc(); |
duke@435 | 1707 | // expression stack is undefined here |
duke@435 | 1708 | // rax,: exception |
duke@435 | 1709 | // rsi: exception bcp |
duke@435 | 1710 | __ verify_oop(rax); |
duke@435 | 1711 | |
duke@435 | 1712 | // expression stack must be empty before entering the VM in case of an exception |
duke@435 | 1713 | __ empty_expression_stack(); |
duke@435 | 1714 | __ empty_FPU_stack(); |
duke@435 | 1715 | // find exception handler address and preserve exception oop |
duke@435 | 1716 | __ call_VM(rdx, CAST_FROM_FN_PTR(address, InterpreterRuntime::exception_handler_for_exception), rax); |
duke@435 | 1717 | // rax,: exception handler entry point |
duke@435 | 1718 | // rdx: preserved exception oop |
duke@435 | 1719 | // rsi: bcp for exception handler |
duke@435 | 1720 | __ push_ptr(rdx); // push exception which is now the only value on the stack |
duke@435 | 1721 | __ jmp(rax); // jump to exception handler (may be _remove_activation_entry!) |
duke@435 | 1722 | |
duke@435 | 1723 | // If the exception is not handled in the current frame the frame is removed and |
duke@435 | 1724 | // the exception is rethrown (i.e. exception continuation is _rethrow_exception). |
duke@435 | 1725 | // |
duke@435 | 1726 | // Note: At this point the bci is still the bxi for the instruction which caused |
duke@435 | 1727 | // the exception and the expression stack is empty. Thus, for any VM calls |
duke@435 | 1728 | // at this point, GC will find a legal oop map (with empty expression stack). |
duke@435 | 1729 | |
duke@435 | 1730 | // In current activation |
duke@435 | 1731 | // tos: exception |
duke@435 | 1732 | // rsi: exception bcp |
duke@435 | 1733 | |
duke@435 | 1734 | // |
duke@435 | 1735 | // JVMTI PopFrame support |
duke@435 | 1736 | // |
duke@435 | 1737 | |
duke@435 | 1738 | Interpreter::_remove_activation_preserving_args_entry = __ pc(); |
duke@435 | 1739 | __ empty_expression_stack(); |
duke@435 | 1740 | __ empty_FPU_stack(); |
duke@435 | 1741 | // Set the popframe_processing bit in pending_popframe_condition indicating that we are |
duke@435 | 1742 | // currently handling popframe, so that call_VMs that may happen later do not trigger new |
duke@435 | 1743 | // popframe handling cycles. |
twisti@1730 | 1744 | __ get_thread(thread); |
twisti@1730 | 1745 | __ movl(rdx, Address(thread, JavaThread::popframe_condition_offset())); |
duke@435 | 1746 | __ orl(rdx, JavaThread::popframe_processing_bit); |
twisti@1730 | 1747 | __ movl(Address(thread, JavaThread::popframe_condition_offset()), rdx); |
duke@435 | 1748 | |
duke@435 | 1749 | { |
duke@435 | 1750 | // Check to see whether we are returning to a deoptimized frame. |
duke@435 | 1751 | // (The PopFrame call ensures that the caller of the popped frame is |
duke@435 | 1752 | // either interpreted or compiled and deoptimizes it if compiled.) |
duke@435 | 1753 | // In this case, we can't call dispatch_next() after the frame is |
duke@435 | 1754 | // popped, but instead must save the incoming arguments and restore |
duke@435 | 1755 | // them after deoptimization has occurred. |
duke@435 | 1756 | // |
duke@435 | 1757 | // Note that we don't compare the return PC against the |
duke@435 | 1758 | // deoptimization blob's unpack entry because of the presence of |
duke@435 | 1759 | // adapter frames in C2. |
duke@435 | 1760 | Label caller_not_deoptimized; |
never@739 | 1761 | __ movptr(rdx, Address(rbp, frame::return_addr_offset * wordSize)); |
duke@435 | 1762 | __ super_call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::interpreter_contains), rdx); |
duke@435 | 1763 | __ testl(rax, rax); |
duke@435 | 1764 | __ jcc(Assembler::notZero, caller_not_deoptimized); |
duke@435 | 1765 | |
duke@435 | 1766 | // Compute size of arguments for saving when returning to deoptimized caller |
duke@435 | 1767 | __ get_method(rax); |
jiangli@4338 | 1768 | __ movptr(rax, Address(rax, Method::const_offset())); |
jiangli@4338 | 1769 | __ load_unsigned_short(rax, Address(rax, ConstMethod::size_of_parameters_offset())); |
twisti@1861 | 1770 | __ shlptr(rax, Interpreter::logStackElementSize); |
duke@435 | 1771 | __ restore_locals(); |
never@739 | 1772 | __ subptr(rdi, rax); |
never@739 | 1773 | __ addptr(rdi, wordSize); |
duke@435 | 1774 | // Save these arguments |
twisti@1730 | 1775 | __ get_thread(thread); |
twisti@1730 | 1776 | __ super_call_VM_leaf(CAST_FROM_FN_PTR(address, Deoptimization::popframe_preserve_args), thread, rax, rdi); |
duke@435 | 1777 | |
duke@435 | 1778 | __ remove_activation(vtos, rdx, |
duke@435 | 1779 | /* throw_monitor_exception */ false, |
duke@435 | 1780 | /* install_monitor_exception */ false, |
duke@435 | 1781 | /* notify_jvmdi */ false); |
duke@435 | 1782 | |
duke@435 | 1783 | // Inform deoptimization that it is responsible for restoring these arguments |
twisti@1730 | 1784 | __ get_thread(thread); |
twisti@1730 | 1785 | __ movl(Address(thread, JavaThread::popframe_condition_offset()), JavaThread::popframe_force_deopt_reexecution_bit); |
duke@435 | 1786 | |
duke@435 | 1787 | // Continue in deoptimization handler |
duke@435 | 1788 | __ jmp(rdx); |
duke@435 | 1789 | |
duke@435 | 1790 | __ bind(caller_not_deoptimized); |
duke@435 | 1791 | } |
duke@435 | 1792 | |
duke@435 | 1793 | __ remove_activation(vtos, rdx, |
duke@435 | 1794 | /* throw_monitor_exception */ false, |
duke@435 | 1795 | /* install_monitor_exception */ false, |
duke@435 | 1796 | /* notify_jvmdi */ false); |
duke@435 | 1797 | |
duke@435 | 1798 | // Finish with popframe handling |
duke@435 | 1799 | // A previous I2C followed by a deoptimization might have moved the |
duke@435 | 1800 | // outgoing arguments further up the stack. PopFrame expects the |
duke@435 | 1801 | // mutations to those outgoing arguments to be preserved and other |
duke@435 | 1802 | // constraints basically require this frame to look exactly as |
duke@435 | 1803 | // though it had previously invoked an interpreted activation with |
duke@435 | 1804 | // no space between the top of the expression stack (current |
duke@435 | 1805 | // last_sp) and the top of stack. Rather than force deopt to |
duke@435 | 1806 | // maintain this kind of invariant all the time we call a small |
duke@435 | 1807 | // fixup routine to move the mutated arguments onto the top of our |
duke@435 | 1808 | // expression stack if necessary. |
never@739 | 1809 | __ mov(rax, rsp); |
never@739 | 1810 | __ movptr(rbx, Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize)); |
twisti@1730 | 1811 | __ get_thread(thread); |
duke@435 | 1812 | // PC must point into interpreter here |
twisti@1730 | 1813 | __ set_last_Java_frame(thread, noreg, rbp, __ pc()); |
twisti@1730 | 1814 | __ super_call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::popframe_move_outgoing_args), thread, rax, rbx); |
twisti@1730 | 1815 | __ get_thread(thread); |
twisti@1730 | 1816 | __ reset_last_Java_frame(thread, true, true); |
duke@435 | 1817 | // Restore the last_sp and null it out |
never@739 | 1818 | __ movptr(rsp, Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize)); |
xlu@947 | 1819 | __ movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), NULL_WORD); |
duke@435 | 1820 | |
duke@435 | 1821 | __ restore_bcp(); |
duke@435 | 1822 | __ restore_locals(); |
duke@435 | 1823 | // The method data pointer was incremented already during |
duke@435 | 1824 | // call profiling. We have to restore the mdp for the current bcp. |
duke@435 | 1825 | if (ProfileInterpreter) { |
duke@435 | 1826 | __ set_method_data_pointer_for_bcp(); |
duke@435 | 1827 | } |
duke@435 | 1828 | |
duke@435 | 1829 | // Clear the popframe condition flag |
twisti@1730 | 1830 | __ get_thread(thread); |
twisti@1730 | 1831 | __ movl(Address(thread, JavaThread::popframe_condition_offset()), JavaThread::popframe_inactive); |
duke@435 | 1832 | |
sspitsyn@5496 | 1833 | #if INCLUDE_JVMTI |
sspitsyn@5496 | 1834 | if (EnableInvokeDynamic) { |
sspitsyn@5496 | 1835 | Label L_done; |
sspitsyn@5496 | 1836 | const Register local0 = rdi; |
sspitsyn@5496 | 1837 | |
sspitsyn@5496 | 1838 | __ cmpb(Address(rsi, 0), Bytecodes::_invokestatic); |
sspitsyn@5496 | 1839 | __ jcc(Assembler::notEqual, L_done); |
sspitsyn@5496 | 1840 | |
sspitsyn@5496 | 1841 | // The member name argument must be restored if _invokestatic is re-executed after a PopFrame call. |
sspitsyn@5496 | 1842 | // Detect such a case in the InterpreterRuntime function and return the member name argument, or NULL. |
sspitsyn@5496 | 1843 | |
sspitsyn@5496 | 1844 | __ get_method(rdx); |
sspitsyn@5496 | 1845 | __ movptr(rax, Address(local0, 0)); |
sspitsyn@5496 | 1846 | __ call_VM(rax, CAST_FROM_FN_PTR(address, InterpreterRuntime::member_name_arg_or_null), rax, rdx, rsi); |
sspitsyn@5496 | 1847 | |
sspitsyn@5496 | 1848 | __ testptr(rax, rax); |
sspitsyn@5496 | 1849 | __ jcc(Assembler::zero, L_done); |
sspitsyn@5496 | 1850 | |
sspitsyn@5496 | 1851 | __ movptr(Address(rbx, 0), rax); |
sspitsyn@5496 | 1852 | __ bind(L_done); |
sspitsyn@5496 | 1853 | } |
sspitsyn@5496 | 1854 | #endif // INCLUDE_JVMTI |
sspitsyn@5496 | 1855 | |
duke@435 | 1856 | __ dispatch_next(vtos); |
duke@435 | 1857 | // end of PopFrame support |
duke@435 | 1858 | |
duke@435 | 1859 | Interpreter::_remove_activation_entry = __ pc(); |
duke@435 | 1860 | |
duke@435 | 1861 | // preserve exception over this code sequence |
duke@435 | 1862 | __ pop_ptr(rax); |
twisti@1730 | 1863 | __ get_thread(thread); |
twisti@1730 | 1864 | __ movptr(Address(thread, JavaThread::vm_result_offset()), rax); |
duke@435 | 1865 | // remove the activation (without doing throws on illegalMonitorExceptions) |
duke@435 | 1866 | __ remove_activation(vtos, rdx, false, true, false); |
duke@435 | 1867 | // restore exception |
twisti@1730 | 1868 | __ get_thread(thread); |
coleenp@4037 | 1869 | __ get_vm_result(rax, thread); |
duke@435 | 1870 | |
duke@435 | 1871 | // Inbetween activations - previous activation type unknown yet |
duke@435 | 1872 | // compute continuation point - the continuation point expects |
duke@435 | 1873 | // the following registers set up: |
duke@435 | 1874 | // |
twisti@1730 | 1875 | // rax: exception |
duke@435 | 1876 | // rdx: return address/pc that threw exception |
duke@435 | 1877 | // rsp: expression stack of caller |
twisti@1730 | 1878 | // rbp: rbp, of caller |
never@739 | 1879 | __ push(rax); // save exception |
never@739 | 1880 | __ push(rdx); // save return address |
twisti@1730 | 1881 | __ super_call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::exception_handler_for_return_address), thread, rdx); |
never@739 | 1882 | __ mov(rbx, rax); // save exception handler |
never@739 | 1883 | __ pop(rdx); // restore return address |
never@739 | 1884 | __ pop(rax); // restore exception |
duke@435 | 1885 | // Note that an "issuing PC" is actually the next PC after the call |
duke@435 | 1886 | __ jmp(rbx); // jump to exception handler of caller |
duke@435 | 1887 | } |
duke@435 | 1888 | |
duke@435 | 1889 | |
duke@435 | 1890 | // |
duke@435 | 1891 | // JVMTI ForceEarlyReturn support |
duke@435 | 1892 | // |
duke@435 | 1893 | address TemplateInterpreterGenerator::generate_earlyret_entry_for(TosState state) { |
duke@435 | 1894 | address entry = __ pc(); |
twisti@1730 | 1895 | const Register thread = rcx; |
duke@435 | 1896 | |
duke@435 | 1897 | __ restore_bcp(); |
duke@435 | 1898 | __ restore_locals(); |
duke@435 | 1899 | __ empty_expression_stack(); |
duke@435 | 1900 | __ empty_FPU_stack(); |
duke@435 | 1901 | __ load_earlyret_value(state); |
duke@435 | 1902 | |
twisti@1730 | 1903 | __ get_thread(thread); |
twisti@1730 | 1904 | __ movptr(rcx, Address(thread, JavaThread::jvmti_thread_state_offset())); |
duke@435 | 1905 | const Address cond_addr(rcx, JvmtiThreadState::earlyret_state_offset()); |
duke@435 | 1906 | |
duke@435 | 1907 | // Clear the earlyret state |
duke@435 | 1908 | __ movl(cond_addr, JvmtiThreadState::earlyret_inactive); |
duke@435 | 1909 | |
duke@435 | 1910 | __ remove_activation(state, rsi, |
duke@435 | 1911 | false, /* throw_monitor_exception */ |
duke@435 | 1912 | false, /* install_monitor_exception */ |
duke@435 | 1913 | true); /* notify_jvmdi */ |
duke@435 | 1914 | __ jmp(rsi); |
duke@435 | 1915 | return entry; |
duke@435 | 1916 | } // end of ForceEarlyReturn support |
duke@435 | 1917 | |
duke@435 | 1918 | |
duke@435 | 1919 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 1920 | // Helper for vtos entry point generation |
duke@435 | 1921 | |
duke@435 | 1922 | void TemplateInterpreterGenerator::set_vtos_entry_points (Template* t, address& bep, address& cep, address& sep, address& aep, address& iep, address& lep, address& fep, address& dep, address& vep) { |
duke@435 | 1923 | assert(t->is_valid() && t->tos_in() == vtos, "illegal template"); |
duke@435 | 1924 | Label L; |
duke@435 | 1925 | fep = __ pc(); __ push(ftos); __ jmp(L); |
duke@435 | 1926 | dep = __ pc(); __ push(dtos); __ jmp(L); |
duke@435 | 1927 | lep = __ pc(); __ push(ltos); __ jmp(L); |
duke@435 | 1928 | aep = __ pc(); __ push(atos); __ jmp(L); |
duke@435 | 1929 | bep = cep = sep = // fall through |
duke@435 | 1930 | iep = __ pc(); __ push(itos); // fall through |
duke@435 | 1931 | vep = __ pc(); __ bind(L); // fall through |
duke@435 | 1932 | generate_and_dispatch(t); |
duke@435 | 1933 | } |
duke@435 | 1934 | |
duke@435 | 1935 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 1936 | // Generation of individual instructions |
duke@435 | 1937 | |
duke@435 | 1938 | // helpers for generate_and_dispatch |
duke@435 | 1939 | |
duke@435 | 1940 | |
duke@435 | 1941 | |
duke@435 | 1942 | InterpreterGenerator::InterpreterGenerator(StubQueue* code) |
duke@435 | 1943 | : TemplateInterpreterGenerator(code) { |
duke@435 | 1944 | generate_all(); // down here so it can be "virtual" |
duke@435 | 1945 | } |
duke@435 | 1946 | |
duke@435 | 1947 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 1948 | |
duke@435 | 1949 | // Non-product code |
duke@435 | 1950 | #ifndef PRODUCT |
duke@435 | 1951 | address TemplateInterpreterGenerator::generate_trace_code(TosState state) { |
duke@435 | 1952 | address entry = __ pc(); |
duke@435 | 1953 | |
duke@435 | 1954 | // prepare expression stack |
never@739 | 1955 | __ pop(rcx); // pop return address so expression stack is 'pure' |
duke@435 | 1956 | __ push(state); // save tosca |
duke@435 | 1957 | |
duke@435 | 1958 | // pass tosca registers as arguments & call tracer |
duke@435 | 1959 | __ call_VM(noreg, CAST_FROM_FN_PTR(address, SharedRuntime::trace_bytecode), rcx, rax, rdx); |
never@739 | 1960 | __ mov(rcx, rax); // make sure return address is not destroyed by pop(state) |
duke@435 | 1961 | __ pop(state); // restore tosca |
duke@435 | 1962 | |
duke@435 | 1963 | // return |
duke@435 | 1964 | __ jmp(rcx); |
duke@435 | 1965 | |
duke@435 | 1966 | return entry; |
duke@435 | 1967 | } |
duke@435 | 1968 | |
duke@435 | 1969 | |
duke@435 | 1970 | void TemplateInterpreterGenerator::count_bytecode() { |
never@739 | 1971 | __ incrementl(ExternalAddress((address) &BytecodeCounter::_counter_value)); |
duke@435 | 1972 | } |
duke@435 | 1973 | |
duke@435 | 1974 | |
duke@435 | 1975 | void TemplateInterpreterGenerator::histogram_bytecode(Template* t) { |
never@739 | 1976 | __ incrementl(ExternalAddress((address) &BytecodeHistogram::_counters[t->bytecode()])); |
duke@435 | 1977 | } |
duke@435 | 1978 | |
duke@435 | 1979 | |
duke@435 | 1980 | void TemplateInterpreterGenerator::histogram_bytecode_pair(Template* t) { |
duke@435 | 1981 | __ mov32(ExternalAddress((address) &BytecodePairHistogram::_index), rbx); |
duke@435 | 1982 | __ shrl(rbx, BytecodePairHistogram::log2_number_of_codes); |
duke@435 | 1983 | __ orl(rbx, ((int)t->bytecode()) << BytecodePairHistogram::log2_number_of_codes); |
duke@435 | 1984 | ExternalAddress table((address) BytecodePairHistogram::_counters); |
duke@435 | 1985 | Address index(noreg, rbx, Address::times_4); |
never@739 | 1986 | __ incrementl(ArrayAddress(table, index)); |
duke@435 | 1987 | } |
duke@435 | 1988 | |
duke@435 | 1989 | |
duke@435 | 1990 | void TemplateInterpreterGenerator::trace_bytecode(Template* t) { |
duke@435 | 1991 | // Call a little run-time stub to avoid blow-up for each bytecode. |
duke@435 | 1992 | // The run-time runtime saves the right registers, depending on |
duke@435 | 1993 | // the tosca in-state for the given template. |
duke@435 | 1994 | assert(Interpreter::trace_code(t->tos_in()) != NULL, |
duke@435 | 1995 | "entry must have been generated"); |
duke@435 | 1996 | __ call(RuntimeAddress(Interpreter::trace_code(t->tos_in()))); |
duke@435 | 1997 | } |
duke@435 | 1998 | |
duke@435 | 1999 | |
duke@435 | 2000 | void TemplateInterpreterGenerator::stop_interpreter_at() { |
duke@435 | 2001 | Label L; |
duke@435 | 2002 | __ cmp32(ExternalAddress((address) &BytecodeCounter::_counter_value), |
duke@435 | 2003 | StopInterpreterAt); |
duke@435 | 2004 | __ jcc(Assembler::notEqual, L); |
duke@435 | 2005 | __ int3(); |
duke@435 | 2006 | __ bind(L); |
duke@435 | 2007 | } |
duke@435 | 2008 | #endif // !PRODUCT |
duke@435 | 2009 | #endif // CC_INTERP |