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