annotate src/cpu/x86/vm/interp_masm_x86_64.cpp @ 1108:85f13cdfbc1d

6829192: JSR 292 needs to support 64-bit x86 Summary: changes for method handles and invokedynamic Reviewed-by: kvn
author twisti
date Wed, 16 Dec 2009 12:48:04 +0100
parents 6918603297f7
children
rev   line source
duke@0 1 /*
xdono@579 2 * Copyright 2003-2009 Sun Microsystems, Inc. All Rights Reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
duke@0 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@0 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@0 21 * have any questions.
duke@0 22 *
duke@0 23 */
duke@0 24
duke@0 25 #include "incls/_precompiled.incl"
duke@0 26 #include "incls/_interp_masm_x86_64.cpp.incl"
duke@0 27
duke@0 28
duke@0 29 // Implementation of InterpreterMacroAssembler
duke@0 30
never@304 31 #ifdef CC_INTERP
never@304 32 void InterpreterMacroAssembler::get_method(Register reg) {
coleenp@520 33 movptr(reg, Address(rbp, -((int)sizeof(BytecodeInterpreter) + 2 * wordSize)));
never@304 34 movptr(reg, Address(reg, byte_offset_of(BytecodeInterpreter, _method)));
never@304 35 }
never@304 36 #endif // CC_INTERP
never@304 37
never@304 38 #ifndef CC_INTERP
never@304 39
duke@0 40 void InterpreterMacroAssembler::call_VM_leaf_base(address entry_point,
duke@0 41 int number_of_arguments) {
duke@0 42 // interpreter specific
duke@0 43 //
duke@0 44 // Note: No need to save/restore bcp & locals (r13 & r14) pointer
duke@0 45 // since these are callee saved registers and no blocking/
duke@0 46 // GC can happen in leaf calls.
ysr@342 47 // Further Note: DO NOT save/restore bcp/locals. If a caller has
ysr@342 48 // already saved them so that it can use esi/edi as temporaries
ysr@342 49 // then a save/restore here will DESTROY the copy the caller
ysr@342 50 // saved! There used to be a save_bcp() that only happened in
ysr@342 51 // the ASSERT path (no restore_bcp). Which caused bizarre failures
ysr@342 52 // when jvm built with ASSERTs.
duke@0 53 #ifdef ASSERT
duke@0 54 {
duke@0 55 Label L;
never@304 56 cmpptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), (int32_t)NULL_WORD);
duke@0 57 jcc(Assembler::equal, L);
duke@0 58 stop("InterpreterMacroAssembler::call_VM_leaf_base:"
duke@0 59 " last_sp != NULL");
duke@0 60 bind(L);
duke@0 61 }
duke@0 62 #endif
duke@0 63 // super call
duke@0 64 MacroAssembler::call_VM_leaf_base(entry_point, number_of_arguments);
duke@0 65 // interpreter specific
ysr@342 66 // Used to ASSERT that r13/r14 were equal to frame's bcp/locals
ysr@342 67 // but since they may not have been saved (and we don't want to
ysr@342 68 // save thme here (see note above) the assert is invalid.
duke@0 69 }
duke@0 70
duke@0 71 void InterpreterMacroAssembler::call_VM_base(Register oop_result,
duke@0 72 Register java_thread,
duke@0 73 Register last_java_sp,
duke@0 74 address entry_point,
duke@0 75 int number_of_arguments,
duke@0 76 bool check_exceptions) {
duke@0 77 // interpreter specific
duke@0 78 //
duke@0 79 // Note: Could avoid restoring locals ptr (callee saved) - however doesn't
duke@0 80 // really make a difference for these runtime calls, since they are
duke@0 81 // slow anyway. Btw., bcp must be saved/restored since it may change
duke@0 82 // due to GC.
duke@0 83 // assert(java_thread == noreg , "not expecting a precomputed java thread");
duke@0 84 save_bcp();
duke@0 85 #ifdef ASSERT
duke@0 86 {
duke@0 87 Label L;
never@304 88 cmpptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), (int32_t)NULL_WORD);
duke@0 89 jcc(Assembler::equal, L);
duke@0 90 stop("InterpreterMacroAssembler::call_VM_leaf_base:"
duke@0 91 " last_sp != NULL");
duke@0 92 bind(L);
duke@0 93 }
duke@0 94 #endif /* ASSERT */
duke@0 95 // super call
duke@0 96 MacroAssembler::call_VM_base(oop_result, noreg, last_java_sp,
duke@0 97 entry_point, number_of_arguments,
duke@0 98 check_exceptions);
duke@0 99 // interpreter specific
duke@0 100 restore_bcp();
duke@0 101 restore_locals();
duke@0 102 }
duke@0 103
duke@0 104
duke@0 105 void InterpreterMacroAssembler::check_and_handle_popframe(Register java_thread) {
duke@0 106 if (JvmtiExport::can_pop_frame()) {
duke@0 107 Label L;
duke@0 108 // Initiate popframe handling only if it is not already being
duke@0 109 // processed. If the flag has the popframe_processing bit set, it
duke@0 110 // means that this code is called *during* popframe handling - we
duke@0 111 // don't want to reenter.
duke@0 112 // This method is only called just after the call into the vm in
duke@0 113 // call_VM_base, so the arg registers are available.
duke@0 114 movl(c_rarg0, Address(r15_thread, JavaThread::popframe_condition_offset()));
duke@0 115 testl(c_rarg0, JavaThread::popframe_pending_bit);
duke@0 116 jcc(Assembler::zero, L);
duke@0 117 testl(c_rarg0, JavaThread::popframe_processing_bit);
duke@0 118 jcc(Assembler::notZero, L);
duke@0 119 // Call Interpreter::remove_activation_preserving_args_entry() to get the
duke@0 120 // address of the same-named entrypoint in the generated interpreter code.
duke@0 121 call_VM_leaf(CAST_FROM_FN_PTR(address, Interpreter::remove_activation_preserving_args_entry));
duke@0 122 jmp(rax);
duke@0 123 bind(L);
duke@0 124 }
duke@0 125 }
duke@0 126
duke@0 127
duke@0 128 void InterpreterMacroAssembler::load_earlyret_value(TosState state) {
never@304 129 movptr(rcx, Address(r15_thread, JavaThread::jvmti_thread_state_offset()));
duke@0 130 const Address tos_addr(rcx, JvmtiThreadState::earlyret_tos_offset());
duke@0 131 const Address oop_addr(rcx, JvmtiThreadState::earlyret_oop_offset());
duke@0 132 const Address val_addr(rcx, JvmtiThreadState::earlyret_value_offset());
duke@0 133 switch (state) {
never@304 134 case atos: movptr(rax, oop_addr);
never@304 135 movptr(oop_addr, (int32_t)NULL_WORD);
duke@0 136 verify_oop(rax, state); break;
never@304 137 case ltos: movptr(rax, val_addr); break;
duke@0 138 case btos: // fall through
duke@0 139 case ctos: // fall through
duke@0 140 case stos: // fall through
duke@0 141 case itos: movl(rax, val_addr); break;
duke@0 142 case ftos: movflt(xmm0, val_addr); break;
duke@0 143 case dtos: movdbl(xmm0, val_addr); break;
duke@0 144 case vtos: /* nothing to do */ break;
duke@0 145 default : ShouldNotReachHere();
duke@0 146 }
duke@0 147 // Clean up tos value in the thread object
duke@0 148 movl(tos_addr, (int) ilgl);
never@304 149 movl(val_addr, (int32_t) NULL_WORD);
duke@0 150 }
duke@0 151
duke@0 152
duke@0 153 void InterpreterMacroAssembler::check_and_handle_earlyret(Register java_thread) {
duke@0 154 if (JvmtiExport::can_force_early_return()) {
duke@0 155 Label L;
never@304 156 movptr(c_rarg0, Address(r15_thread, JavaThread::jvmti_thread_state_offset()));
never@304 157 testptr(c_rarg0, c_rarg0);
duke@0 158 jcc(Assembler::zero, L); // if (thread->jvmti_thread_state() == NULL) exit;
duke@0 159
duke@0 160 // Initiate earlyret handling only if it is not already being processed.
duke@0 161 // If the flag has the earlyret_processing bit set, it means that this code
duke@0 162 // is called *during* earlyret handling - we don't want to reenter.
duke@0 163 movl(c_rarg0, Address(c_rarg0, JvmtiThreadState::earlyret_state_offset()));
duke@0 164 cmpl(c_rarg0, JvmtiThreadState::earlyret_pending);
duke@0 165 jcc(Assembler::notEqual, L);
duke@0 166
duke@0 167 // Call Interpreter::remove_activation_early_entry() to get the address of the
duke@0 168 // same-named entrypoint in the generated interpreter code.
never@304 169 movptr(c_rarg0, Address(r15_thread, JavaThread::jvmti_thread_state_offset()));
duke@0 170 movl(c_rarg0, Address(c_rarg0, JvmtiThreadState::earlyret_tos_offset()));
duke@0 171 call_VM_leaf(CAST_FROM_FN_PTR(address, Interpreter::remove_activation_early_entry), c_rarg0);
duke@0 172 jmp(rax);
duke@0 173 bind(L);
duke@0 174 }
duke@0 175 }
duke@0 176
duke@0 177
duke@0 178 void InterpreterMacroAssembler::get_unsigned_2_byte_index_at_bcp(
duke@0 179 Register reg,
duke@0 180 int bcp_offset) {
duke@0 181 assert(bcp_offset >= 0, "bcp is still pointing to start of bytecode");
duke@0 182 movl(reg, Address(r13, bcp_offset));
duke@0 183 bswapl(reg);
duke@0 184 shrl(reg, 16);
duke@0 185 }
duke@0 186
duke@0 187
twisti@1108 188 void InterpreterMacroAssembler::get_cache_index_at_bcp(Register index,
twisti@1108 189 int bcp_offset,
twisti@1108 190 bool giant_index) {
twisti@1108 191 assert(bcp_offset > 0, "bcp is still pointing to start of bytecode");
twisti@1108 192 if (!giant_index) {
twisti@1108 193 load_unsigned_short(index, Address(r13, bcp_offset));
twisti@1108 194 } else {
twisti@1108 195 assert(EnableInvokeDynamic, "giant index used only for EnableInvokeDynamic");
twisti@1108 196 movl(index, Address(r13, bcp_offset));
twisti@1108 197 // Check if the secondary index definition is still ~x, otherwise
twisti@1108 198 // we have to change the following assembler code to calculate the
twisti@1108 199 // plain index.
twisti@1108 200 assert(constantPoolCacheOopDesc::decode_secondary_index(~123) == 123, "else change next line");
twisti@1108 201 notl(index); // convert to plain index
twisti@1108 202 }
twisti@1108 203 }
twisti@1108 204
twisti@1108 205
duke@0 206 void InterpreterMacroAssembler::get_cache_and_index_at_bcp(Register cache,
duke@0 207 Register index,
twisti@1108 208 int bcp_offset,
twisti@1108 209 bool giant_index) {
duke@0 210 assert(cache != index, "must use different registers");
twisti@1108 211 get_cache_index_at_bcp(index, bcp_offset, giant_index);
never@304 212 movptr(cache, Address(rbp, frame::interpreter_frame_cache_offset * wordSize));
duke@0 213 assert(sizeof(ConstantPoolCacheEntry) == 4 * wordSize, "adjust code below");
duke@0 214 // convert from field index to ConstantPoolCacheEntry index
duke@0 215 shll(index, 2);
duke@0 216 }
duke@0 217
duke@0 218
duke@0 219 void InterpreterMacroAssembler::get_cache_entry_pointer_at_bcp(Register cache,
duke@0 220 Register tmp,
twisti@1108 221 int bcp_offset,
twisti@1108 222 bool giant_index) {
duke@0 223 assert(cache != tmp, "must use different register");
twisti@1108 224 get_cache_index_at_bcp(tmp, bcp_offset, giant_index);
duke@0 225 assert(sizeof(ConstantPoolCacheEntry) == 4 * wordSize, "adjust code below");
duke@0 226 // convert from field index to ConstantPoolCacheEntry index
duke@0 227 // and from word offset to byte offset
duke@0 228 shll(tmp, 2 + LogBytesPerWord);
never@304 229 movptr(cache, Address(rbp, frame::interpreter_frame_cache_offset * wordSize));
duke@0 230 // skip past the header
never@304 231 addptr(cache, in_bytes(constantPoolCacheOopDesc::base_offset()));
never@304 232 addptr(cache, tmp); // construct pointer to cache entry
duke@0 233 }
duke@0 234
duke@0 235
duke@0 236 // Generate a subtype check: branch to ok_is_subtype if sub_klass is a
duke@0 237 // subtype of super_klass.
duke@0 238 //
duke@0 239 // Args:
duke@0 240 // rax: superklass
duke@0 241 // Rsub_klass: subklass
duke@0 242 //
duke@0 243 // Kills:
duke@0 244 // rcx, rdi
duke@0 245 void InterpreterMacroAssembler::gen_subtype_check(Register Rsub_klass,
duke@0 246 Label& ok_is_subtype) {
duke@0 247 assert(Rsub_klass != rax, "rax holds superklass");
duke@0 248 assert(Rsub_klass != r14, "r14 holds locals");
duke@0 249 assert(Rsub_klass != r13, "r13 holds bcp");
duke@0 250 assert(Rsub_klass != rcx, "rcx holds 2ndary super array length");
duke@0 251 assert(Rsub_klass != rdi, "rdi holds 2ndary super array scan ptr");
duke@0 252
jrose@644 253 // Profile the not-null value's klass.
jrose@644 254 profile_typecheck(rcx, Rsub_klass, rdi); // blows rcx, reloads rdi
duke@0 255
jrose@644 256 // Do the check.
jrose@644 257 check_klass_subtype(Rsub_klass, rax, rcx, ok_is_subtype); // blows rcx
duke@0 258
jrose@644 259 // Profile the failure of the check.
duke@0 260 profile_typecheck_failed(rcx); // blows rcx
duke@0 261 }
duke@0 262
duke@0 263
never@304 264
duke@0 265 // Java Expression Stack
duke@0 266
duke@0 267 #ifdef ASSERT
duke@0 268 // Verifies that the stack tag matches. Must be called before the stack
duke@0 269 // value is popped off the stack.
duke@0 270 void InterpreterMacroAssembler::verify_stack_tag(frame::Tag t) {
duke@0 271 if (TaggedStackInterpreter) {
duke@0 272 frame::Tag tag = t;
duke@0 273 if (t == frame::TagCategory2) {
duke@0 274 tag = frame::TagValue;
duke@0 275 Label hokay;
never@304 276 cmpptr(Address(rsp, 3*wordSize), (int32_t)tag);
duke@0 277 jcc(Assembler::equal, hokay);
duke@0 278 stop("Java Expression stack tag high value is bad");
duke@0 279 bind(hokay);
duke@0 280 }
duke@0 281 Label okay;
never@304 282 cmpptr(Address(rsp, wordSize), (int32_t)tag);
duke@0 283 jcc(Assembler::equal, okay);
duke@0 284 // Also compare if the stack value is zero, then the tag might
duke@0 285 // not have been set coming from deopt.
never@304 286 cmpptr(Address(rsp, 0), 0);
duke@0 287 jcc(Assembler::equal, okay);
duke@0 288 stop("Java Expression stack tag value is bad");
duke@0 289 bind(okay);
duke@0 290 }
duke@0 291 }
duke@0 292 #endif // ASSERT
duke@0 293
duke@0 294 void InterpreterMacroAssembler::pop_ptr(Register r) {
duke@0 295 debug_only(verify_stack_tag(frame::TagReference));
never@304 296 pop(r);
never@304 297 if (TaggedStackInterpreter) addptr(rsp, 1 * wordSize);
duke@0 298 }
duke@0 299
duke@0 300 void InterpreterMacroAssembler::pop_ptr(Register r, Register tag) {
never@304 301 pop(r);
never@304 302 if (TaggedStackInterpreter) pop(tag);
duke@0 303 }
duke@0 304
duke@0 305 void InterpreterMacroAssembler::pop_i(Register r) {
never@304 306 // XXX can't use pop currently, upper half non clean
duke@0 307 debug_only(verify_stack_tag(frame::TagValue));
duke@0 308 movl(r, Address(rsp, 0));
never@304 309 addptr(rsp, wordSize);
never@304 310 if (TaggedStackInterpreter) addptr(rsp, 1 * wordSize);
duke@0 311 }
duke@0 312
duke@0 313 void InterpreterMacroAssembler::pop_l(Register r) {
duke@0 314 debug_only(verify_stack_tag(frame::TagCategory2));
duke@0 315 movq(r, Address(rsp, 0));
never@304 316 addptr(rsp, 2 * Interpreter::stackElementSize());
duke@0 317 }
duke@0 318
duke@0 319 void InterpreterMacroAssembler::pop_f(XMMRegister r) {
duke@0 320 debug_only(verify_stack_tag(frame::TagValue));
duke@0 321 movflt(r, Address(rsp, 0));
never@304 322 addptr(rsp, wordSize);
never@304 323 if (TaggedStackInterpreter) addptr(rsp, 1 * wordSize);
duke@0 324 }
duke@0 325
duke@0 326 void InterpreterMacroAssembler::pop_d(XMMRegister r) {
duke@0 327 debug_only(verify_stack_tag(frame::TagCategory2));
duke@0 328 movdbl(r, Address(rsp, 0));
never@304 329 addptr(rsp, 2 * Interpreter::stackElementSize());
duke@0 330 }
duke@0 331
duke@0 332 void InterpreterMacroAssembler::push_ptr(Register r) {
never@304 333 if (TaggedStackInterpreter) push(frame::TagReference);
never@304 334 push(r);
duke@0 335 }
duke@0 336
duke@0 337 void InterpreterMacroAssembler::push_ptr(Register r, Register tag) {
never@304 338 if (TaggedStackInterpreter) push(tag);
never@304 339 push(r);
duke@0 340 }
duke@0 341
duke@0 342 void InterpreterMacroAssembler::push_i(Register r) {
never@304 343 if (TaggedStackInterpreter) push(frame::TagValue);
never@304 344 push(r);
duke@0 345 }
duke@0 346
duke@0 347 void InterpreterMacroAssembler::push_l(Register r) {
duke@0 348 if (TaggedStackInterpreter) {
never@304 349 push(frame::TagValue);
never@304 350 subptr(rsp, 1 * wordSize);
never@304 351 push(frame::TagValue);
never@304 352 subptr(rsp, 1 * wordSize);
duke@0 353 } else {
never@304 354 subptr(rsp, 2 * wordSize);
duke@0 355 }
duke@0 356 movq(Address(rsp, 0), r);
duke@0 357 }
duke@0 358
duke@0 359 void InterpreterMacroAssembler::push_f(XMMRegister r) {
never@304 360 if (TaggedStackInterpreter) push(frame::TagValue);
never@304 361 subptr(rsp, wordSize);
duke@0 362 movflt(Address(rsp, 0), r);
duke@0 363 }
duke@0 364
duke@0 365 void InterpreterMacroAssembler::push_d(XMMRegister r) {
duke@0 366 if (TaggedStackInterpreter) {
never@304 367 push(frame::TagValue);
never@304 368 subptr(rsp, 1 * wordSize);
never@304 369 push(frame::TagValue);
never@304 370 subptr(rsp, 1 * wordSize);
duke@0 371 } else {
never@304 372 subptr(rsp, 2 * wordSize);
duke@0 373 }
duke@0 374 movdbl(Address(rsp, 0), r);
duke@0 375 }
duke@0 376
duke@0 377 void InterpreterMacroAssembler::pop(TosState state) {
duke@0 378 switch (state) {
duke@0 379 case atos: pop_ptr(); break;
duke@0 380 case btos:
duke@0 381 case ctos:
duke@0 382 case stos:
duke@0 383 case itos: pop_i(); break;
duke@0 384 case ltos: pop_l(); break;
duke@0 385 case ftos: pop_f(); break;
duke@0 386 case dtos: pop_d(); break;
duke@0 387 case vtos: /* nothing to do */ break;
duke@0 388 default: ShouldNotReachHere();
duke@0 389 }
duke@0 390 verify_oop(rax, state);
duke@0 391 }
duke@0 392
duke@0 393 void InterpreterMacroAssembler::push(TosState state) {
duke@0 394 verify_oop(rax, state);
duke@0 395 switch (state) {
duke@0 396 case atos: push_ptr(); break;
duke@0 397 case btos:
duke@0 398 case ctos:
duke@0 399 case stos:
duke@0 400 case itos: push_i(); break;
duke@0 401 case ltos: push_l(); break;
duke@0 402 case ftos: push_f(); break;
duke@0 403 case dtos: push_d(); break;
duke@0 404 case vtos: /* nothing to do */ break;
duke@0 405 default : ShouldNotReachHere();
duke@0 406 }
duke@0 407 }
duke@0 408
duke@0 409
never@304 410
never@304 411
duke@0 412 // Tagged stack helpers for swap and dup
duke@0 413 void InterpreterMacroAssembler::load_ptr_and_tag(int n, Register val,
duke@0 414 Register tag) {
never@304 415 movptr(val, Address(rsp, Interpreter::expr_offset_in_bytes(n)));
duke@0 416 if (TaggedStackInterpreter) {
never@304 417 movptr(tag, Address(rsp, Interpreter::expr_tag_offset_in_bytes(n)));
duke@0 418 }
duke@0 419 }
duke@0 420
duke@0 421 void InterpreterMacroAssembler::store_ptr_and_tag(int n, Register val,
duke@0 422 Register tag) {
never@304 423 movptr(Address(rsp, Interpreter::expr_offset_in_bytes(n)), val);
duke@0 424 if (TaggedStackInterpreter) {
never@304 425 movptr(Address(rsp, Interpreter::expr_tag_offset_in_bytes(n)), tag);
duke@0 426 }
duke@0 427 }
duke@0 428
duke@0 429
duke@0 430 // Tagged local support
duke@0 431 void InterpreterMacroAssembler::tag_local(frame::Tag tag, int n) {
duke@0 432 if (TaggedStackInterpreter) {
duke@0 433 if (tag == frame::TagCategory2) {
never@304 434 movptr(Address(r14, Interpreter::local_tag_offset_in_bytes(n+1)),
never@304 435 (int32_t)frame::TagValue);
never@304 436 movptr(Address(r14, Interpreter::local_tag_offset_in_bytes(n)),
never@304 437 (int32_t)frame::TagValue);
duke@0 438 } else {
never@304 439 movptr(Address(r14, Interpreter::local_tag_offset_in_bytes(n)), (int32_t)tag);
duke@0 440 }
duke@0 441 }
duke@0 442 }
duke@0 443
duke@0 444 void InterpreterMacroAssembler::tag_local(frame::Tag tag, Register idx) {
duke@0 445 if (TaggedStackInterpreter) {
duke@0 446 if (tag == frame::TagCategory2) {
never@304 447 movptr(Address(r14, idx, Address::times_8,
never@304 448 Interpreter::local_tag_offset_in_bytes(1)), (int32_t)frame::TagValue);
never@304 449 movptr(Address(r14, idx, Address::times_8,
never@304 450 Interpreter::local_tag_offset_in_bytes(0)), (int32_t)frame::TagValue);
duke@0 451 } else {
never@304 452 movptr(Address(r14, idx, Address::times_8, Interpreter::local_tag_offset_in_bytes(0)),
never@304 453 (int32_t)tag);
duke@0 454 }
duke@0 455 }
duke@0 456 }
duke@0 457
duke@0 458 void InterpreterMacroAssembler::tag_local(Register tag, Register idx) {
duke@0 459 if (TaggedStackInterpreter) {
duke@0 460 // can only be TagValue or TagReference
never@304 461 movptr(Address(r14, idx, Address::times_8, Interpreter::local_tag_offset_in_bytes(0)), tag);
duke@0 462 }
duke@0 463 }
duke@0 464
duke@0 465
duke@0 466 void InterpreterMacroAssembler::tag_local(Register tag, int n) {
duke@0 467 if (TaggedStackInterpreter) {
duke@0 468 // can only be TagValue or TagReference
never@304 469 movptr(Address(r14, Interpreter::local_tag_offset_in_bytes(n)), tag);
duke@0 470 }
duke@0 471 }
duke@0 472
duke@0 473 #ifdef ASSERT
duke@0 474 void InterpreterMacroAssembler::verify_local_tag(frame::Tag tag, int n) {
duke@0 475 if (TaggedStackInterpreter) {
duke@0 476 frame::Tag t = tag;
duke@0 477 if (tag == frame::TagCategory2) {
duke@0 478 Label nbl;
duke@0 479 t = frame::TagValue; // change to what is stored in locals
never@304 480 cmpptr(Address(r14, Interpreter::local_tag_offset_in_bytes(n+1)), (int32_t)t);
duke@0 481 jcc(Assembler::equal, nbl);
duke@0 482 stop("Local tag is bad for long/double");
duke@0 483 bind(nbl);
duke@0 484 }
duke@0 485 Label notBad;
never@304 486 cmpq(Address(r14, Interpreter::local_tag_offset_in_bytes(n)), (int32_t)t);
duke@0 487 jcc(Assembler::equal, notBad);
duke@0 488 // Also compare if the local value is zero, then the tag might
duke@0 489 // not have been set coming from deopt.
never@304 490 cmpptr(Address(r14, Interpreter::local_offset_in_bytes(n)), 0);
duke@0 491 jcc(Assembler::equal, notBad);
duke@0 492 stop("Local tag is bad");
duke@0 493 bind(notBad);
duke@0 494 }
duke@0 495 }
duke@0 496
duke@0 497 void InterpreterMacroAssembler::verify_local_tag(frame::Tag tag, Register idx) {
duke@0 498 if (TaggedStackInterpreter) {
duke@0 499 frame::Tag t = tag;
duke@0 500 if (tag == frame::TagCategory2) {
duke@0 501 Label nbl;
duke@0 502 t = frame::TagValue; // change to what is stored in locals
never@304 503 cmpptr(Address(r14, idx, Address::times_8, Interpreter::local_tag_offset_in_bytes(1)), (int32_t)t);
duke@0 504 jcc(Assembler::equal, nbl);
duke@0 505 stop("Local tag is bad for long/double");
duke@0 506 bind(nbl);
duke@0 507 }
duke@0 508 Label notBad;
never@304 509 cmpptr(Address(r14, idx, Address::times_8, Interpreter::local_tag_offset_in_bytes(0)), (int32_t)t);
duke@0 510 jcc(Assembler::equal, notBad);
duke@0 511 // Also compare if the local value is zero, then the tag might
duke@0 512 // not have been set coming from deopt.
never@304 513 cmpptr(Address(r14, idx, Address::times_8, Interpreter::local_offset_in_bytes(0)), 0);
duke@0 514 jcc(Assembler::equal, notBad);
duke@0 515 stop("Local tag is bad");
duke@0 516 bind(notBad);
duke@0 517 }
duke@0 518 }
duke@0 519 #endif // ASSERT
duke@0 520
duke@0 521
duke@0 522 void InterpreterMacroAssembler::super_call_VM_leaf(address entry_point) {
duke@0 523 MacroAssembler::call_VM_leaf_base(entry_point, 0);
duke@0 524 }
duke@0 525
duke@0 526
duke@0 527 void InterpreterMacroAssembler::super_call_VM_leaf(address entry_point,
duke@0 528 Register arg_1) {
duke@0 529 if (c_rarg0 != arg_1) {
never@304 530 mov(c_rarg0, arg_1);
duke@0 531 }
duke@0 532 MacroAssembler::call_VM_leaf_base(entry_point, 1);
duke@0 533 }
duke@0 534
duke@0 535
duke@0 536 void InterpreterMacroAssembler::super_call_VM_leaf(address entry_point,
duke@0 537 Register arg_1,
duke@0 538 Register arg_2) {
duke@0 539 assert(c_rarg0 != arg_2, "smashed argument");
duke@0 540 assert(c_rarg1 != arg_1, "smashed argument");
duke@0 541 if (c_rarg0 != arg_1) {
never@304 542 mov(c_rarg0, arg_1);
duke@0 543 }
duke@0 544 if (c_rarg1 != arg_2) {
never@304 545 mov(c_rarg1, arg_2);
duke@0 546 }
duke@0 547 MacroAssembler::call_VM_leaf_base(entry_point, 2);
duke@0 548 }
duke@0 549
duke@0 550 void InterpreterMacroAssembler::super_call_VM_leaf(address entry_point,
duke@0 551 Register arg_1,
duke@0 552 Register arg_2,
duke@0 553 Register arg_3) {
duke@0 554 assert(c_rarg0 != arg_2, "smashed argument");
duke@0 555 assert(c_rarg0 != arg_3, "smashed argument");
duke@0 556 assert(c_rarg1 != arg_1, "smashed argument");
duke@0 557 assert(c_rarg1 != arg_3, "smashed argument");
duke@0 558 assert(c_rarg2 != arg_1, "smashed argument");
duke@0 559 assert(c_rarg2 != arg_2, "smashed argument");
duke@0 560 if (c_rarg0 != arg_1) {
never@304 561 mov(c_rarg0, arg_1);
duke@0 562 }
duke@0 563 if (c_rarg1 != arg_2) {
never@304 564 mov(c_rarg1, arg_2);
duke@0 565 }
duke@0 566 if (c_rarg2 != arg_3) {
never@304 567 mov(c_rarg2, arg_3);
duke@0 568 }
duke@0 569 MacroAssembler::call_VM_leaf_base(entry_point, 3);
duke@0 570 }
duke@0 571
jrose@710 572 void InterpreterMacroAssembler::prepare_to_jump_from_interpreted() {
duke@0 573 // set sender sp
never@304 574 lea(r13, Address(rsp, wordSize));
duke@0 575 // record last_sp
never@304 576 movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), r13);
jrose@710 577 }
jrose@710 578
jrose@710 579
jrose@710 580 // Jump to from_interpreted entry of a call unless single stepping is possible
jrose@710 581 // in this thread in which case we must call the i2i entry
jrose@710 582 void InterpreterMacroAssembler::jump_from_interpreted(Register method, Register temp) {
jrose@710 583 prepare_to_jump_from_interpreted();
duke@0 584
duke@0 585 if (JvmtiExport::can_post_interpreter_events()) {
duke@0 586 Label run_compiled_code;
duke@0 587 // JVMTI events, such as single-stepping, are implemented partly by avoiding running
duke@0 588 // compiled code in threads for which the event is enabled. Check here for
duke@0 589 // interp_only_mode if these events CAN be enabled.
duke@0 590 get_thread(temp);
duke@0 591 // interp_only is an int, on little endian it is sufficient to test the byte only
duke@0 592 // Is a cmpl faster (ce
duke@0 593 cmpb(Address(temp, JavaThread::interp_only_mode_offset()), 0);
duke@0 594 jcc(Assembler::zero, run_compiled_code);
duke@0 595 jmp(Address(method, methodOopDesc::interpreter_entry_offset()));
duke@0 596 bind(run_compiled_code);
duke@0 597 }
duke@0 598
duke@0 599 jmp(Address(method, methodOopDesc::from_interpreted_offset()));
duke@0 600
duke@0 601 }
duke@0 602
duke@0 603
duke@0 604 // The following two routines provide a hook so that an implementation
duke@0 605 // can schedule the dispatch in two parts. amd64 does not do this.
duke@0 606 void InterpreterMacroAssembler::dispatch_prolog(TosState state, int step) {
duke@0 607 // Nothing amd64 specific to be done here
duke@0 608 }
duke@0 609
duke@0 610 void InterpreterMacroAssembler::dispatch_epilog(TosState state, int step) {
duke@0 611 dispatch_next(state, step);
duke@0 612 }
duke@0 613
duke@0 614 void InterpreterMacroAssembler::dispatch_base(TosState state,
duke@0 615 address* table,
duke@0 616 bool verifyoop) {
duke@0 617 verify_FPU(1, state);
duke@0 618 if (VerifyActivationFrameSize) {
duke@0 619 Label L;
never@304 620 mov(rcx, rbp);
never@304 621 subptr(rcx, rsp);
never@304 622 int32_t min_frame_size =
duke@0 623 (frame::link_offset - frame::interpreter_frame_initial_sp_offset) *
duke@0 624 wordSize;
never@304 625 cmpptr(rcx, (int32_t)min_frame_size);
duke@0 626 jcc(Assembler::greaterEqual, L);
duke@0 627 stop("broken stack frame");
duke@0 628 bind(L);
duke@0 629 }
duke@0 630 if (verifyoop) {
duke@0 631 verify_oop(rax, state);
duke@0 632 }
duke@0 633 lea(rscratch1, ExternalAddress((address)table));
duke@0 634 jmp(Address(rscratch1, rbx, Address::times_8));
duke@0 635 }
duke@0 636
duke@0 637 void InterpreterMacroAssembler::dispatch_only(TosState state) {
duke@0 638 dispatch_base(state, Interpreter::dispatch_table(state));
duke@0 639 }
duke@0 640
duke@0 641 void InterpreterMacroAssembler::dispatch_only_normal(TosState state) {
duke@0 642 dispatch_base(state, Interpreter::normal_table(state));
duke@0 643 }
duke@0 644
duke@0 645 void InterpreterMacroAssembler::dispatch_only_noverify(TosState state) {
duke@0 646 dispatch_base(state, Interpreter::normal_table(state), false);
duke@0 647 }
duke@0 648
duke@0 649
duke@0 650 void InterpreterMacroAssembler::dispatch_next(TosState state, int step) {
duke@0 651 // load next bytecode (load before advancing r13 to prevent AGI)
duke@0 652 load_unsigned_byte(rbx, Address(r13, step));
duke@0 653 // advance r13
never@304 654 increment(r13, step);
duke@0 655 dispatch_base(state, Interpreter::dispatch_table(state));
duke@0 656 }
duke@0 657
duke@0 658 void InterpreterMacroAssembler::dispatch_via(TosState state, address* table) {
duke@0 659 // load current bytecode
duke@0 660 load_unsigned_byte(rbx, Address(r13, 0));
duke@0 661 dispatch_base(state, table);
duke@0 662 }
duke@0 663
duke@0 664 // remove activation
duke@0 665 //
duke@0 666 // Unlock the receiver if this is a synchronized method.
duke@0 667 // Unlock any Java monitors from syncronized blocks.
duke@0 668 // Remove the activation from the stack.
duke@0 669 //
duke@0 670 // If there are locked Java monitors
duke@0 671 // If throw_monitor_exception
duke@0 672 // throws IllegalMonitorStateException
duke@0 673 // Else if install_monitor_exception
duke@0 674 // installs IllegalMonitorStateException
duke@0 675 // Else
duke@0 676 // no error processing
duke@0 677 void InterpreterMacroAssembler::remove_activation(
duke@0 678 TosState state,
duke@0 679 Register ret_addr,
duke@0 680 bool throw_monitor_exception,
duke@0 681 bool install_monitor_exception,
duke@0 682 bool notify_jvmdi) {
duke@0 683 // Note: Registers rdx xmm0 may be in use for the
duke@0 684 // result check if synchronized method
duke@0 685 Label unlocked, unlock, no_unlock;
duke@0 686
duke@0 687 // get the value of _do_not_unlock_if_synchronized into rdx
duke@0 688 const Address do_not_unlock_if_synchronized(r15_thread,
duke@0 689 in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()));
duke@0 690 movbool(rdx, do_not_unlock_if_synchronized);
duke@0 691 movbool(do_not_unlock_if_synchronized, false); // reset the flag
duke@0 692
duke@0 693 // get method access flags
never@304 694 movptr(rbx, Address(rbp, frame::interpreter_frame_method_offset * wordSize));
duke@0 695 movl(rcx, Address(rbx, methodOopDesc::access_flags_offset()));
duke@0 696 testl(rcx, JVM_ACC_SYNCHRONIZED);
duke@0 697 jcc(Assembler::zero, unlocked);
duke@0 698
duke@0 699 // Don't unlock anything if the _do_not_unlock_if_synchronized flag
duke@0 700 // is set.
duke@0 701 testbool(rdx);
duke@0 702 jcc(Assembler::notZero, no_unlock);
duke@0 703
duke@0 704 // unlock monitor
duke@0 705 push(state); // save result
duke@0 706
duke@0 707 // BasicObjectLock will be first in list, since this is a
duke@0 708 // synchronized method. However, need to check that the object has
duke@0 709 // not been unlocked by an explicit monitorexit bytecode.
duke@0 710 const Address monitor(rbp, frame::interpreter_frame_initial_sp_offset *
duke@0 711 wordSize - (int) sizeof(BasicObjectLock));
duke@0 712 // We use c_rarg1 so that if we go slow path it will be the correct
duke@0 713 // register for unlock_object to pass to VM directly
never@304 714 lea(c_rarg1, monitor); // address of first monitor
duke@0 715
never@304 716 movptr(rax, Address(c_rarg1, BasicObjectLock::obj_offset_in_bytes()));
never@304 717 testptr(rax, rax);
duke@0 718 jcc(Assembler::notZero, unlock);
duke@0 719
duke@0 720 pop(state);
duke@0 721 if (throw_monitor_exception) {
duke@0 722 // Entry already unlocked, need to throw exception
duke@0 723 call_VM(noreg, CAST_FROM_FN_PTR(address,
duke@0 724 InterpreterRuntime::throw_illegal_monitor_state_exception));
duke@0 725 should_not_reach_here();
duke@0 726 } else {
duke@0 727 // Monitor already unlocked during a stack unroll. If requested,
duke@0 728 // install an illegal_monitor_state_exception. Continue with
duke@0 729 // stack unrolling.
duke@0 730 if (install_monitor_exception) {
duke@0 731 call_VM(noreg, CAST_FROM_FN_PTR(address,
duke@0 732 InterpreterRuntime::new_illegal_monitor_state_exception));
duke@0 733 }
duke@0 734 jmp(unlocked);
duke@0 735 }
duke@0 736
duke@0 737 bind(unlock);
duke@0 738 unlock_object(c_rarg1);
duke@0 739 pop(state);
duke@0 740
duke@0 741 // Check that for block-structured locking (i.e., that all locked
duke@0 742 // objects has been unlocked)
duke@0 743 bind(unlocked);
duke@0 744
duke@0 745 // rax: Might contain return value
duke@0 746
duke@0 747 // Check that all monitors are unlocked
duke@0 748 {
duke@0 749 Label loop, exception, entry, restart;
duke@0 750 const int entry_size = frame::interpreter_frame_monitor_size() * wordSize;
duke@0 751 const Address monitor_block_top(
duke@0 752 rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize);
duke@0 753 const Address monitor_block_bot(
duke@0 754 rbp, frame::interpreter_frame_initial_sp_offset * wordSize);
duke@0 755
duke@0 756 bind(restart);
duke@0 757 // We use c_rarg1 so that if we go slow path it will be the correct
duke@0 758 // register for unlock_object to pass to VM directly
never@304 759 movptr(c_rarg1, monitor_block_top); // points to current entry, starting
duke@0 760 // with top-most entry
never@304 761 lea(rbx, monitor_block_bot); // points to word before bottom of
duke@0 762 // monitor block
duke@0 763 jmp(entry);
duke@0 764
duke@0 765 // Entry already locked, need to throw exception
duke@0 766 bind(exception);
duke@0 767
duke@0 768 if (throw_monitor_exception) {
duke@0 769 // Throw exception
duke@0 770 MacroAssembler::call_VM(noreg,
duke@0 771 CAST_FROM_FN_PTR(address, InterpreterRuntime::
duke@0 772 throw_illegal_monitor_state_exception));
duke@0 773 should_not_reach_here();
duke@0 774 } else {
duke@0 775 // Stack unrolling. Unlock object and install illegal_monitor_exception.
duke@0 776 // Unlock does not block, so don't have to worry about the frame.
duke@0 777 // We don't have to preserve c_rarg1 since we are going to throw an exception.
duke@0 778
duke@0 779 push(state);
duke@0 780 unlock_object(c_rarg1);
duke@0 781 pop(state);
duke@0 782
duke@0 783 if (install_monitor_exception) {
duke@0 784 call_VM(noreg, CAST_FROM_FN_PTR(address,
duke@0 785 InterpreterRuntime::
duke@0 786 new_illegal_monitor_state_exception));
duke@0 787 }
duke@0 788
duke@0 789 jmp(restart);
duke@0 790 }
duke@0 791
duke@0 792 bind(loop);
duke@0 793 // check if current entry is used
never@304 794 cmpptr(Address(c_rarg1, BasicObjectLock::obj_offset_in_bytes()), (int32_t) NULL);
duke@0 795 jcc(Assembler::notEqual, exception);
duke@0 796
never@304 797 addptr(c_rarg1, entry_size); // otherwise advance to next entry
duke@0 798 bind(entry);
never@304 799 cmpptr(c_rarg1, rbx); // check if bottom reached
duke@0 800 jcc(Assembler::notEqual, loop); // if not at bottom then check this entry
duke@0 801 }
duke@0 802
duke@0 803 bind(no_unlock);
duke@0 804
duke@0 805 // jvmti support
duke@0 806 if (notify_jvmdi) {
duke@0 807 notify_method_exit(state, NotifyJVMTI); // preserve TOSCA
duke@0 808 } else {
duke@0 809 notify_method_exit(state, SkipNotifyJVMTI); // preserve TOSCA
duke@0 810 }
duke@0 811
duke@0 812 // remove activation
duke@0 813 // get sender sp
never@304 814 movptr(rbx,
never@304 815 Address(rbp, frame::interpreter_frame_sender_sp_offset * wordSize));
duke@0 816 leave(); // remove frame anchor
never@304 817 pop(ret_addr); // get return address
never@304 818 mov(rsp, rbx); // set sp to sender sp
duke@0 819 }
duke@0 820
never@304 821 #endif // C_INTERP
never@304 822
duke@0 823 // Lock object
duke@0 824 //
duke@0 825 // Args:
duke@0 826 // c_rarg1: BasicObjectLock to be used for locking
duke@0 827 //
duke@0 828 // Kills:
duke@0 829 // rax
duke@0 830 // c_rarg0, c_rarg1, c_rarg2, c_rarg3, .. (param regs)
duke@0 831 // rscratch1, rscratch2 (scratch regs)
duke@0 832 void InterpreterMacroAssembler::lock_object(Register lock_reg) {
duke@0 833 assert(lock_reg == c_rarg1, "The argument is only for looks. It must be c_rarg1");
duke@0 834
duke@0 835 if (UseHeavyMonitors) {
duke@0 836 call_VM(noreg,
duke@0 837 CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorenter),
duke@0 838 lock_reg);
duke@0 839 } else {
duke@0 840 Label done;
duke@0 841
duke@0 842 const Register swap_reg = rax; // Must use rax for cmpxchg instruction
duke@0 843 const Register obj_reg = c_rarg3; // Will contain the oop
duke@0 844
duke@0 845 const int obj_offset = BasicObjectLock::obj_offset_in_bytes();
duke@0 846 const int lock_offset = BasicObjectLock::lock_offset_in_bytes ();
duke@0 847 const int mark_offset = lock_offset +
duke@0 848 BasicLock::displaced_header_offset_in_bytes();
duke@0 849
duke@0 850 Label slow_case;
duke@0 851
duke@0 852 // Load object pointer into obj_reg %c_rarg3
never@304 853 movptr(obj_reg, Address(lock_reg, obj_offset));
duke@0 854
duke@0 855 if (UseBiasedLocking) {
duke@0 856 biased_locking_enter(lock_reg, obj_reg, swap_reg, rscratch1, false, done, &slow_case);
duke@0 857 }
duke@0 858
duke@0 859 // Load immediate 1 into swap_reg %rax
duke@0 860 movl(swap_reg, 1);
duke@0 861
duke@0 862 // Load (object->mark() | 1) into swap_reg %rax
never@304 863 orptr(swap_reg, Address(obj_reg, 0));
duke@0 864
duke@0 865 // Save (object->mark() | 1) into BasicLock's displaced header
never@304 866 movptr(Address(lock_reg, mark_offset), swap_reg);
duke@0 867
duke@0 868 assert(lock_offset == 0,
duke@0 869 "displached header must be first word in BasicObjectLock");
duke@0 870
duke@0 871 if (os::is_MP()) lock();
never@304 872 cmpxchgptr(lock_reg, Address(obj_reg, 0));
duke@0 873 if (PrintBiasedLockingStatistics) {
duke@0 874 cond_inc32(Assembler::zero,
duke@0 875 ExternalAddress((address) BiasedLocking::fast_path_entry_count_addr()));
duke@0 876 }
duke@0 877 jcc(Assembler::zero, done);
duke@0 878
duke@0 879 // Test if the oopMark is an obvious stack pointer, i.e.,
duke@0 880 // 1) (mark & 7) == 0, and
duke@0 881 // 2) rsp <= mark < mark + os::pagesize()
duke@0 882 //
duke@0 883 // These 3 tests can be done by evaluating the following
duke@0 884 // expression: ((mark - rsp) & (7 - os::vm_page_size())),
duke@0 885 // assuming both stack pointer and pagesize have their
duke@0 886 // least significant 3 bits clear.
duke@0 887 // NOTE: the oopMark is in swap_reg %rax as the result of cmpxchg
never@304 888 subptr(swap_reg, rsp);
never@304 889 andptr(swap_reg, 7 - os::vm_page_size());
duke@0 890
duke@0 891 // Save the test result, for recursive case, the result is zero
never@304 892 movptr(Address(lock_reg, mark_offset), swap_reg);
duke@0 893
duke@0 894 if (PrintBiasedLockingStatistics) {
duke@0 895 cond_inc32(Assembler::zero,
duke@0 896 ExternalAddress((address) BiasedLocking::fast_path_entry_count_addr()));
duke@0 897 }
duke@0 898 jcc(Assembler::zero, done);
duke@0 899
duke@0 900 bind(slow_case);
duke@0 901
duke@0 902 // Call the runtime routine for slow case
duke@0 903 call_VM(noreg,
duke@0 904 CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorenter),
duke@0 905 lock_reg);
duke@0 906
duke@0 907 bind(done);
duke@0 908 }
duke@0 909 }
duke@0 910
duke@0 911
duke@0 912 // Unlocks an object. Used in monitorexit bytecode and
duke@0 913 // remove_activation. Throws an IllegalMonitorException if object is
duke@0 914 // not locked by current thread.
duke@0 915 //
duke@0 916 // Args:
duke@0 917 // c_rarg1: BasicObjectLock for lock
duke@0 918 //
duke@0 919 // Kills:
duke@0 920 // rax
duke@0 921 // c_rarg0, c_rarg1, c_rarg2, c_rarg3, ... (param regs)
duke@0 922 // rscratch1, rscratch2 (scratch regs)
duke@0 923 void InterpreterMacroAssembler::unlock_object(Register lock_reg) {
duke@0 924 assert(lock_reg == c_rarg1, "The argument is only for looks. It must be rarg1");
duke@0 925
duke@0 926 if (UseHeavyMonitors) {
duke@0 927 call_VM(noreg,
duke@0 928 CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorexit),
duke@0 929 lock_reg);
duke@0 930 } else {
duke@0 931 Label done;
duke@0 932
duke@0 933 const Register swap_reg = rax; // Must use rax for cmpxchg instruction
duke@0 934 const Register header_reg = c_rarg2; // Will contain the old oopMark
duke@0 935 const Register obj_reg = c_rarg3; // Will contain the oop
duke@0 936
duke@0 937 save_bcp(); // Save in case of exception
duke@0 938
duke@0 939 // Convert from BasicObjectLock structure to object and BasicLock
duke@0 940 // structure Store the BasicLock address into %rax
never@304 941 lea(swap_reg, Address(lock_reg, BasicObjectLock::lock_offset_in_bytes()));
duke@0 942
duke@0 943 // Load oop into obj_reg(%c_rarg3)
never@304 944 movptr(obj_reg, Address(lock_reg, BasicObjectLock::obj_offset_in_bytes()));
duke@0 945
duke@0 946 // Free entry
never@304 947 movptr(Address(lock_reg, BasicObjectLock::obj_offset_in_bytes()), (int32_t)NULL_WORD);
duke@0 948
duke@0 949 if (UseBiasedLocking) {
duke@0 950 biased_locking_exit(obj_reg, header_reg, done);
duke@0 951 }
duke@0 952
duke@0 953 // Load the old header from BasicLock structure
never@304 954 movptr(header_reg, Address(swap_reg,
never@304 955 BasicLock::displaced_header_offset_in_bytes()));
duke@0 956
duke@0 957 // Test for recursion
never@304 958 testptr(header_reg, header_reg);
duke@0 959
duke@0 960 // zero for recursive case
duke@0 961 jcc(Assembler::zero, done);
duke@0 962
duke@0 963 // Atomic swap back the old header
duke@0 964 if (os::is_MP()) lock();
never@304 965 cmpxchgptr(header_reg, Address(obj_reg, 0));
duke@0 966
duke@0 967 // zero for recursive case
duke@0 968 jcc(Assembler::zero, done);
duke@0 969
duke@0 970 // Call the runtime routine for slow case.
never@304 971 movptr(Address(lock_reg, BasicObjectLock::obj_offset_in_bytes()),
duke@0 972 obj_reg); // restore obj
duke@0 973 call_VM(noreg,
duke@0 974 CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorexit),
duke@0 975 lock_reg);
duke@0 976
duke@0 977 bind(done);
duke@0 978
duke@0 979 restore_bcp();
duke@0 980 }
duke@0 981 }
duke@0 982
never@304 983 #ifndef CC_INTERP
duke@0 984
duke@0 985 void InterpreterMacroAssembler::test_method_data_pointer(Register mdp,
duke@0 986 Label& zero_continue) {
duke@0 987 assert(ProfileInterpreter, "must be profiling interpreter");
never@304 988 movptr(mdp, Address(rbp, frame::interpreter_frame_mdx_offset * wordSize));
never@304 989 testptr(mdp, mdp);
duke@0 990 jcc(Assembler::zero, zero_continue);
duke@0 991 }
duke@0 992
duke@0 993
duke@0 994 // Set the method data pointer for the current bcp.
duke@0 995 void InterpreterMacroAssembler::set_method_data_pointer_for_bcp() {
duke@0 996 assert(ProfileInterpreter, "must be profiling interpreter");
duke@0 997 Label zero_continue;
never@304 998 push(rax);
never@304 999 push(rbx);
duke@0 1000
duke@0 1001 get_method(rbx);
duke@0 1002 // Test MDO to avoid the call if it is NULL.
never@304 1003 movptr(rax, Address(rbx, in_bytes(methodOopDesc::method_data_offset())));
never@304 1004 testptr(rax, rax);
duke@0 1005 jcc(Assembler::zero, zero_continue);
duke@0 1006
duke@0 1007 // rbx: method
duke@0 1008 // r13: bcp
duke@0 1009 call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::bcp_to_di), rbx, r13);
duke@0 1010 // rax: mdi
duke@0 1011
never@304 1012 movptr(rbx, Address(rbx, in_bytes(methodOopDesc::method_data_offset())));
never@304 1013 testptr(rbx, rbx);
duke@0 1014 jcc(Assembler::zero, zero_continue);
never@304 1015 addptr(rbx, in_bytes(methodDataOopDesc::data_offset()));
never@304 1016 addptr(rbx, rax);
never@304 1017 movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize), rbx);
duke@0 1018
duke@0 1019 bind(zero_continue);
never@304 1020 pop(rbx);
never@304 1021 pop(rax);
duke@0 1022 }
duke@0 1023
duke@0 1024 void InterpreterMacroAssembler::verify_method_data_pointer() {
duke@0 1025 assert(ProfileInterpreter, "must be profiling interpreter");
duke@0 1026 #ifdef ASSERT
duke@0 1027 Label verify_continue;
never@304 1028 push(rax);
never@304 1029 push(rbx);
never@304 1030 push(c_rarg3);
never@304 1031 push(c_rarg2);
duke@0 1032 test_method_data_pointer(c_rarg3, verify_continue); // If mdp is zero, continue
duke@0 1033 get_method(rbx);
duke@0 1034
duke@0 1035 // If the mdp is valid, it will point to a DataLayout header which is
duke@0 1036 // consistent with the bcp. The converse is highly probable also.
jrose@622 1037 load_unsigned_short(c_rarg2,
jrose@622 1038 Address(c_rarg3, in_bytes(DataLayout::bci_offset())));
never@304 1039 addptr(c_rarg2, Address(rbx, methodOopDesc::const_offset()));
never@304 1040 lea(c_rarg2, Address(c_rarg2, constMethodOopDesc::codes_offset()));
never@304 1041 cmpptr(c_rarg2, r13);
duke@0 1042 jcc(Assembler::equal, verify_continue);
duke@0 1043 // rbx: method
duke@0 1044 // r13: bcp
duke@0 1045 // c_rarg3: mdp
duke@0 1046 call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::verify_mdp),
duke@0 1047 rbx, r13, c_rarg3);
duke@0 1048 bind(verify_continue);
never@304 1049 pop(c_rarg2);
never@304 1050 pop(c_rarg3);
never@304 1051 pop(rbx);
never@304 1052 pop(rax);
duke@0 1053 #endif // ASSERT
duke@0 1054 }
duke@0 1055
duke@0 1056
duke@0 1057 void InterpreterMacroAssembler::set_mdp_data_at(Register mdp_in,
duke@0 1058 int constant,
duke@0 1059 Register value) {
duke@0 1060 assert(ProfileInterpreter, "must be profiling interpreter");
duke@0 1061 Address data(mdp_in, constant);
never@304 1062 movptr(data, value);
duke@0 1063 }
duke@0 1064
duke@0 1065
duke@0 1066 void InterpreterMacroAssembler::increment_mdp_data_at(Register mdp_in,
duke@0 1067 int constant,
duke@0 1068 bool decrement) {
duke@0 1069 // Counter address
duke@0 1070 Address data(mdp_in, constant);
duke@0 1071
duke@0 1072 increment_mdp_data_at(data, decrement);
duke@0 1073 }
duke@0 1074
duke@0 1075 void InterpreterMacroAssembler::increment_mdp_data_at(Address data,
duke@0 1076 bool decrement) {
duke@0 1077 assert(ProfileInterpreter, "must be profiling interpreter");
never@304 1078 // %%% this does 64bit counters at best it is wasting space
never@304 1079 // at worst it is a rare bug when counters overflow
duke@0 1080
duke@0 1081 if (decrement) {
duke@0 1082 // Decrement the register. Set condition codes.
never@304 1083 addptr(data, (int32_t) -DataLayout::counter_increment);
duke@0 1084 // If the decrement causes the counter to overflow, stay negative
duke@0 1085 Label L;
duke@0 1086 jcc(Assembler::negative, L);
never@304 1087 addptr(data, (int32_t) DataLayout::counter_increment);
duke@0 1088 bind(L);
duke@0 1089 } else {
duke@0 1090 assert(DataLayout::counter_increment == 1,
duke@0 1091 "flow-free idiom only works with 1");
duke@0 1092 // Increment the register. Set carry flag.
never@304 1093 addptr(data, DataLayout::counter_increment);
duke@0 1094 // If the increment causes the counter to overflow, pull back by 1.
never@304 1095 sbbptr(data, (int32_t)0);
duke@0 1096 }
duke@0 1097 }
duke@0 1098
duke@0 1099
duke@0 1100 void InterpreterMacroAssembler::increment_mdp_data_at(Register mdp_in,
duke@0 1101 Register reg,
duke@0 1102 int constant,
duke@0 1103 bool decrement) {
duke@0 1104 Address data(mdp_in, reg, Address::times_1, constant);
duke@0 1105
duke@0 1106 increment_mdp_data_at(data, decrement);
duke@0 1107 }
duke@0 1108
duke@0 1109 void InterpreterMacroAssembler::set_mdp_flag_at(Register mdp_in,
duke@0 1110 int flag_byte_constant) {
duke@0 1111 assert(ProfileInterpreter, "must be profiling interpreter");
duke@0 1112 int header_offset = in_bytes(DataLayout::header_offset());
duke@0 1113 int header_bits = DataLayout::flag_mask_to_header_mask(flag_byte_constant);
duke@0 1114 // Set the flag
duke@0 1115 orl(Address(mdp_in, header_offset), header_bits);
duke@0 1116 }
duke@0 1117
duke@0 1118
duke@0 1119
duke@0 1120 void InterpreterMacroAssembler::test_mdp_data_at(Register mdp_in,
duke@0 1121 int offset,
duke@0 1122 Register value,
duke@0 1123 Register test_value_out,
duke@0 1124 Label& not_equal_continue) {
duke@0 1125 assert(ProfileInterpreter, "must be profiling interpreter");
duke@0 1126 if (test_value_out == noreg) {
never@304 1127 cmpptr(value, Address(mdp_in, offset));
duke@0 1128 } else {
duke@0 1129 // Put the test value into a register, so caller can use it:
never@304 1130 movptr(test_value_out, Address(mdp_in, offset));
never@304 1131 cmpptr(test_value_out, value);
duke@0 1132 }
duke@0 1133 jcc(Assembler::notEqual, not_equal_continue);
duke@0 1134 }
duke@0 1135
duke@0 1136
duke@0 1137 void InterpreterMacroAssembler::update_mdp_by_offset(Register mdp_in,
duke@0 1138 int offset_of_disp) {
duke@0 1139 assert(ProfileInterpreter, "must be profiling interpreter");
duke@0 1140 Address disp_address(mdp_in, offset_of_disp);
never@304 1141 addptr(mdp_in, disp_address);
never@304 1142 movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize), mdp_in);
duke@0 1143 }
duke@0 1144
duke@0 1145
duke@0 1146 void InterpreterMacroAssembler::update_mdp_by_offset(Register mdp_in,
duke@0 1147 Register reg,
duke@0 1148 int offset_of_disp) {
duke@0 1149 assert(ProfileInterpreter, "must be profiling interpreter");
duke@0 1150 Address disp_address(mdp_in, reg, Address::times_1, offset_of_disp);
never@304 1151 addptr(mdp_in, disp_address);
never@304 1152 movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize), mdp_in);
duke@0 1153 }
duke@0 1154
duke@0 1155
duke@0 1156 void InterpreterMacroAssembler::update_mdp_by_constant(Register mdp_in,
duke@0 1157 int constant) {
duke@0 1158 assert(ProfileInterpreter, "must be profiling interpreter");
never@304 1159 addptr(mdp_in, constant);
never@304 1160 movptr(Address(rbp, frame::interpreter_frame_mdx_offset * wordSize), mdp_in);
duke@0 1161 }
duke@0 1162
duke@0 1163
duke@0 1164 void InterpreterMacroAssembler::update_mdp_for_ret(Register return_bci) {
duke@0 1165 assert(ProfileInterpreter, "must be profiling interpreter");
never@304 1166 push(return_bci); // save/restore across call_VM
duke@0 1167 call_VM(noreg,
duke@0 1168 CAST_FROM_FN_PTR(address, InterpreterRuntime::update_mdp_for_ret),
duke@0 1169 return_bci);
never@304 1170 pop(return_bci);
duke@0 1171 }
duke@0 1172
duke@0 1173
duke@0 1174 void InterpreterMacroAssembler::profile_taken_branch(Register mdp,
duke@0 1175 Register bumped_count) {
duke@0 1176 if (ProfileInterpreter) {
duke@0 1177 Label profile_continue;
duke@0 1178
duke@0 1179 // If no method data exists, go to profile_continue.
duke@0 1180 // Otherwise, assign to mdp
duke@0 1181 test_method_data_pointer(mdp, profile_continue);
duke@0 1182
duke@0 1183 // We are taking a branch. Increment the taken count.
duke@0 1184 // We inline increment_mdp_data_at to return bumped_count in a register
duke@0 1185 //increment_mdp_data_at(mdp, in_bytes(JumpData::taken_offset()));
duke@0 1186 Address data(mdp, in_bytes(JumpData::taken_offset()));
never@304 1187 movptr(bumped_count, data);
duke@0 1188 assert(DataLayout::counter_increment == 1,
duke@0 1189 "flow-free idiom only works with 1");
never@304 1190 addptr(bumped_count, DataLayout::counter_increment);
never@304 1191 sbbptr(bumped_count, 0);
never@304 1192 movptr(data, bumped_count); // Store back out
duke@0 1193
duke@0 1194 // The method data pointer needs to be updated to reflect the new target.
duke@0 1195 update_mdp_by_offset(mdp, in_bytes(JumpData::displacement_offset()));
duke@0 1196 bind(profile_continue);
duke@0 1197 }
duke@0 1198 }
duke@0 1199
duke@0 1200
duke@0 1201 void InterpreterMacroAssembler::profile_not_taken_branch(Register mdp) {
duke@0 1202 if (ProfileInterpreter) {
duke@0 1203 Label profile_continue;
duke@0 1204
duke@0 1205 // If no method data exists, go to profile_continue.
duke@0 1206 test_method_data_pointer(mdp, profile_continue);
duke@0 1207
duke@0 1208 // We are taking a branch. Increment the not taken count.
duke@0 1209 increment_mdp_data_at(mdp, in_bytes(BranchData::not_taken_offset()));
duke@0 1210
duke@0 1211 // The method data pointer needs to be updated to correspond to
duke@0 1212 // the next bytecode
duke@0 1213 update_mdp_by_constant(mdp, in_bytes(BranchData::branch_data_size()));
duke@0 1214 bind(profile_continue);
duke@0 1215 }
duke@0 1216 }
duke@0 1217
duke@0 1218
duke@0 1219 void InterpreterMacroAssembler::profile_call(Register mdp) {
duke@0 1220 if (ProfileInterpreter) {
duke@0 1221 Label profile_continue;
duke@0 1222
duke@0 1223 // If no method data exists, go to profile_continue.
duke@0 1224 test_method_data_pointer(mdp, profile_continue);
duke@0 1225
duke@0 1226 // We are making a call. Increment the count.
duke@0 1227 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
duke@0 1228
duke@0 1229 // The method data pointer needs to be updated to reflect the new target.
duke@0 1230 update_mdp_by_constant(mdp, in_bytes(CounterData::counter_data_size()));
duke@0 1231 bind(profile_continue);
duke@0 1232 }
duke@0 1233 }
duke@0 1234
duke@0 1235
duke@0 1236 void InterpreterMacroAssembler::profile_final_call(Register mdp) {
duke@0 1237 if (ProfileInterpreter) {
duke@0 1238 Label profile_continue;
duke@0 1239
duke@0 1240 // If no method data exists, go to profile_continue.
duke@0 1241 test_method_data_pointer(mdp, profile_continue);
duke@0 1242
duke@0 1243 // We are making a call. Increment the count.
duke@0 1244 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
duke@0 1245
duke@0 1246 // The method data pointer needs to be updated to reflect the new target.
duke@0 1247 update_mdp_by_constant(mdp,
duke@0 1248 in_bytes(VirtualCallData::
duke@0 1249 virtual_call_data_size()));
duke@0 1250 bind(profile_continue);
duke@0 1251 }
duke@0 1252 }
duke@0 1253
duke@0 1254
duke@0 1255 void InterpreterMacroAssembler::profile_virtual_call(Register receiver,
duke@0 1256 Register mdp,
twisti@1108 1257 Register reg2,
twisti@1108 1258 bool receiver_can_be_null) {
duke@0 1259 if (ProfileInterpreter) {
duke@0 1260 Label profile_continue;
duke@0 1261
duke@0 1262 // If no method data exists, go to profile_continue.
duke@0 1263 test_method_data_pointer(mdp, profile_continue);
duke@0 1264
duke@0 1265 // We are making a call. Increment the count.
duke@0 1266 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
duke@0 1267
twisti@1108 1268 Label skip_receiver_profile;
twisti@1108 1269 if (receiver_can_be_null) {
twisti@1108 1270 testptr(receiver, receiver);
twisti@1108 1271 jcc(Assembler::zero, skip_receiver_profile);
twisti@1108 1272 }
twisti@1108 1273
duke@0 1274 // Record the receiver type.
duke@0 1275 record_klass_in_profile(receiver, mdp, reg2);
twisti@1108 1276 bind(skip_receiver_profile);
duke@0 1277
duke@0 1278 // The method data pointer needs to be updated to reflect the new target.
duke@0 1279 update_mdp_by_constant(mdp,
duke@0 1280 in_bytes(VirtualCallData::
duke@0 1281 virtual_call_data_size()));
duke@0 1282 bind(profile_continue);
duke@0 1283 }
duke@0 1284 }
duke@0 1285
duke@0 1286 // This routine creates a state machine for updating the multi-row
duke@0 1287 // type profile at a virtual call site (or other type-sensitive bytecode).
duke@0 1288 // The machine visits each row (of receiver/count) until the receiver type
duke@0 1289 // is found, or until it runs out of rows. At the same time, it remembers
duke@0 1290 // the location of the first empty row. (An empty row records null for its
duke@0 1291 // receiver, and can be allocated for a newly-observed receiver type.)
duke@0 1292 // Because there are two degrees of freedom in the state, a simple linear
duke@0 1293 // search will not work; it must be a decision tree. Hence this helper
duke@0 1294 // function is recursive, to generate the required tree structured code.
duke@0 1295 // It's the interpreter, so we are trading off code space for speed.
duke@0 1296 // See below for example code.
duke@0 1297 void InterpreterMacroAssembler::record_klass_in_profile_helper(
duke@0 1298 Register receiver, Register mdp,
duke@0 1299 Register reg2,
duke@0 1300 int start_row, Label& done) {
poonam@967 1301 if (TypeProfileWidth == 0)
poonam@967 1302 return;
poonam@967 1303
duke@0 1304 int last_row = VirtualCallData::row_limit() - 1;
duke@0 1305 assert(start_row <= last_row, "must be work left to do");
duke@0 1306 // Test this row for both the receiver and for null.
duke@0 1307 // Take any of three different outcomes:
duke@0 1308 // 1. found receiver => increment count and goto done
duke@0 1309 // 2. found null => keep looking for case 1, maybe allocate this cell
duke@0 1310 // 3. found something else => keep looking for cases 1 and 2
duke@0 1311 // Case 3 is handled by a recursive call.
duke@0 1312 for (int row = start_row; row <= last_row; row++) {
duke@0 1313 Label next_test;
duke@0 1314 bool test_for_null_also = (row == start_row);
duke@0 1315
duke@0 1316 // See if the receiver is receiver[n].
duke@0 1317 int recvr_offset = in_bytes(VirtualCallData::receiver_offset(row));
duke@0 1318 test_mdp_data_at(mdp, recvr_offset, receiver,
duke@0 1319 (test_for_null_also ? reg2 : noreg),
duke@0 1320 next_test);
duke@0 1321 // (Reg2 now contains the receiver from the CallData.)
duke@0 1322
duke@0 1323 // The receiver is receiver[n]. Increment count[n].
duke@0 1324 int count_offset = in_bytes(VirtualCallData::receiver_count_offset(row));
duke@0 1325 increment_mdp_data_at(mdp, count_offset);
duke@0 1326 jmp(done);
duke@0 1327 bind(next_test);
duke@0 1328
duke@0 1329 if (test_for_null_also) {
duke@0 1330 // Failed the equality check on receiver[n]... Test for null.
never@304 1331 testptr(reg2, reg2);
duke@0 1332 if (start_row == last_row) {
duke@0 1333 // The only thing left to do is handle the null case.
duke@0 1334 jcc(Assembler::notZero, done);
duke@0 1335 break;
duke@0 1336 }
duke@0 1337 // Since null is rare, make it be the branch-taken case.
duke@0 1338 Label found_null;
duke@0 1339 jcc(Assembler::zero, found_null);
duke@0 1340
duke@0 1341 // Put all the "Case 3" tests here.
duke@0 1342 record_klass_in_profile_helper(receiver, mdp, reg2, start_row + 1, done);
duke@0 1343
duke@0 1344 // Found a null. Keep searching for a matching receiver,
duke@0 1345 // but remember that this is an empty (unused) slot.
duke@0 1346 bind(found_null);
duke@0 1347 }
duke@0 1348 }
duke@0 1349
duke@0 1350 // In the fall-through case, we found no matching receiver, but we
duke@0 1351 // observed the receiver[start_row] is NULL.
duke@0 1352
duke@0 1353 // Fill in the receiver field and increment the count.
duke@0 1354 int recvr_offset = in_bytes(VirtualCallData::receiver_offset(start_row));
duke@0 1355 set_mdp_data_at(mdp, recvr_offset, receiver);
duke@0 1356 int count_offset = in_bytes(VirtualCallData::receiver_count_offset(start_row));
duke@0 1357 movl(reg2, DataLayout::counter_increment);
duke@0 1358 set_mdp_data_at(mdp, count_offset, reg2);
duke@0 1359 jmp(done);
duke@0 1360 }
duke@0 1361
duke@0 1362 // Example state machine code for three profile rows:
duke@0 1363 // // main copy of decision tree, rooted at row[1]
duke@0 1364 // if (row[0].rec == rec) { row[0].incr(); goto done; }
duke@0 1365 // if (row[0].rec != NULL) {
duke@0 1366 // // inner copy of decision tree, rooted at row[1]
duke@0 1367 // if (row[1].rec == rec) { row[1].incr(); goto done; }
duke@0 1368 // if (row[1].rec != NULL) {
duke@0 1369 // // degenerate decision tree, rooted at row[2]
duke@0 1370 // if (row[2].rec == rec) { row[2].incr(); goto done; }
duke@0 1371 // if (row[2].rec != NULL) { goto done; } // overflow
duke@0 1372 // row[2].init(rec); goto done;
duke@0 1373 // } else {
duke@0 1374 // // remember row[1] is empty
duke@0 1375 // if (row[2].rec == rec) { row[2].incr(); goto done; }
duke@0 1376 // row[1].init(rec); goto done;
duke@0 1377 // }
duke@0 1378 // } else {
duke@0 1379 // // remember row[0] is empty
duke@0 1380 // if (row[1].rec == rec) { row[1].incr(); goto done; }
duke@0 1381 // if (row[2].rec == rec) { row[2].incr(); goto done; }
duke@0 1382 // row[0].init(rec); goto done;
duke@0 1383 // }
duke@0 1384
duke@0 1385 void InterpreterMacroAssembler::record_klass_in_profile(Register receiver,
duke@0 1386 Register mdp,
duke@0 1387 Register reg2) {
duke@0 1388 assert(ProfileInterpreter, "must be profiling");
duke@0 1389 Label done;
duke@0 1390
duke@0 1391 record_klass_in_profile_helper(receiver, mdp, reg2, 0, done);
duke@0 1392
duke@0 1393 bind (done);
duke@0 1394 }
duke@0 1395
duke@0 1396 void InterpreterMacroAssembler::profile_ret(Register return_bci,
duke@0 1397 Register mdp) {
duke@0 1398 if (ProfileInterpreter) {
duke@0 1399 Label profile_continue;
duke@0 1400 uint row;
duke@0 1401
duke@0 1402 // If no method data exists, go to profile_continue.
duke@0 1403 test_method_data_pointer(mdp, profile_continue);
duke@0 1404
duke@0 1405 // Update the total ret count.
duke@0 1406 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
duke@0 1407
duke@0 1408 for (row = 0; row < RetData::row_limit(); row++) {
duke@0 1409 Label next_test;
duke@0 1410
duke@0 1411 // See if return_bci is equal to bci[n]:
duke@0 1412 test_mdp_data_at(mdp,
duke@0 1413 in_bytes(RetData::bci_offset(row)),
duke@0 1414 return_bci, noreg,
duke@0 1415 next_test);
duke@0 1416
duke@0 1417 // return_bci is equal to bci[n]. Increment the count.
duke@0 1418 increment_mdp_data_at(mdp, in_bytes(RetData::bci_count_offset(row)));
duke@0 1419
duke@0 1420 // The method data pointer needs to be updated to reflect the new target.
duke@0 1421 update_mdp_by_offset(mdp,
duke@0 1422 in_bytes(RetData::bci_displacement_offset(row)));
duke@0 1423 jmp(profile_continue);
duke@0 1424 bind(next_test);
duke@0 1425 }
duke@0 1426
duke@0 1427 update_mdp_for_ret(return_bci);
duke@0 1428
duke@0 1429 bind(profile_continue);
duke@0 1430 }
duke@0 1431 }
duke@0 1432
duke@0 1433
duke@0 1434 void InterpreterMacroAssembler::profile_null_seen(Register mdp) {
duke@0 1435 if (ProfileInterpreter) {
duke@0 1436 Label profile_continue;
duke@0 1437
duke@0 1438 // If no method data exists, go to profile_continue.
duke@0 1439 test_method_data_pointer(mdp, profile_continue);
duke@0 1440
never@826 1441 set_mdp_flag_at(mdp, BitData::null_seen_byte_constant());
never@826 1442
duke@0 1443 // The method data pointer needs to be updated.
duke@0 1444 int mdp_delta = in_bytes(BitData::bit_data_size());
duke@0 1445 if (TypeProfileCasts) {
duke@0 1446 mdp_delta = in_bytes(VirtualCallData::virtual_call_data_size());
duke@0 1447 }
duke@0 1448 update_mdp_by_constant(mdp, mdp_delta);
duke@0 1449
duke@0 1450 bind(profile_continue);
duke@0 1451 }
duke@0 1452 }
duke@0 1453
duke@0 1454
duke@0 1455 void InterpreterMacroAssembler::profile_typecheck_failed(Register mdp) {
duke@0 1456 if (ProfileInterpreter && TypeProfileCasts) {
duke@0 1457 Label profile_continue;
duke@0 1458
duke@0 1459 // If no method data exists, go to profile_continue.
duke@0 1460 test_method_data_pointer(mdp, profile_continue);
duke@0 1461
duke@0 1462 int count_offset = in_bytes(CounterData::count_offset());
duke@0 1463 // Back up the address, since we have already bumped the mdp.
duke@0 1464 count_offset -= in_bytes(VirtualCallData::virtual_call_data_size());
duke@0 1465
duke@0 1466 // *Decrement* the counter. We expect to see zero or small negatives.
duke@0 1467 increment_mdp_data_at(mdp, count_offset, true);
duke@0 1468
duke@0 1469 bind (profile_continue);
duke@0 1470 }
duke@0 1471 }
duke@0 1472
duke@0 1473
duke@0 1474 void InterpreterMacroAssembler::profile_typecheck(Register mdp, Register klass, Register reg2) {
duke@0 1475 if (ProfileInterpreter) {
duke@0 1476 Label profile_continue;
duke@0 1477
duke@0 1478 // If no method data exists, go to profile_continue.
duke@0 1479 test_method_data_pointer(mdp, profile_continue);
duke@0 1480
duke@0 1481 // The method data pointer needs to be updated.
duke@0 1482 int mdp_delta = in_bytes(BitData::bit_data_size());
duke@0 1483 if (TypeProfileCasts) {
duke@0 1484 mdp_delta = in_bytes(VirtualCallData::virtual_call_data_size());
duke@0 1485
duke@0 1486 // Record the object type.
duke@0 1487 record_klass_in_profile(klass, mdp, reg2);
duke@0 1488 }
duke@0 1489 update_mdp_by_constant(mdp, mdp_delta);
duke@0 1490
duke@0 1491 bind(profile_continue);
duke@0 1492 }
duke@0 1493 }
duke@0 1494
duke@0 1495
duke@0 1496 void InterpreterMacroAssembler::profile_switch_default(Register mdp) {
duke@0 1497 if (ProfileInterpreter) {
duke@0 1498 Label profile_continue;
duke@0 1499
duke@0 1500 // If no method data exists, go to profile_continue.
duke@0 1501 test_method_data_pointer(mdp, profile_continue);
duke@0 1502
duke@0 1503 // Update the default case count
duke@0 1504 increment_mdp_data_at(mdp,
duke@0 1505 in_bytes(MultiBranchData::default_count_offset()));
duke@0 1506
duke@0 1507 // The method data pointer needs to be updated.
duke@0 1508 update_mdp_by_offset(mdp,
duke@0 1509 in_bytes(MultiBranchData::
duke@0 1510 default_displacement_offset()));
duke@0 1511
duke@0 1512 bind(profile_continue);
duke@0 1513 }
duke@0 1514 }
duke@0 1515
duke@0 1516
duke@0 1517 void InterpreterMacroAssembler::profile_switch_case(Register index,
duke@0 1518 Register mdp,
duke@0 1519 Register reg2) {
duke@0 1520 if (ProfileInterpreter) {
duke@0 1521 Label profile_continue;
duke@0 1522
duke@0 1523 // If no method data exists, go to profile_continue.
duke@0 1524 test_method_data_pointer(mdp, profile_continue);
duke@0 1525
duke@0 1526 // Build the base (index * per_case_size_in_bytes()) +
duke@0 1527 // case_array_offset_in_bytes()
duke@0 1528 movl(reg2, in_bytes(MultiBranchData::per_case_size()));
never@304 1529 imulptr(index, reg2); // XXX l ?
never@304 1530 addptr(index, in_bytes(MultiBranchData::case_array_offset())); // XXX l ?
duke@0 1531
duke@0 1532 // Update the case count
duke@0 1533 increment_mdp_data_at(mdp,
duke@0 1534 index,
duke@0 1535 in_bytes(MultiBranchData::relative_count_offset()));
duke@0 1536
duke@0 1537 // The method data pointer needs to be updated.
duke@0 1538 update_mdp_by_offset(mdp,
duke@0 1539 index,
duke@0 1540 in_bytes(MultiBranchData::
duke@0 1541 relative_displacement_offset()));
duke@0 1542
duke@0 1543 bind(profile_continue);
duke@0 1544 }
duke@0 1545 }
duke@0 1546
duke@0 1547
never@304 1548
duke@0 1549 void InterpreterMacroAssembler::verify_oop(Register reg, TosState state) {
duke@0 1550 if (state == atos) {
duke@0 1551 MacroAssembler::verify_oop(reg);
duke@0 1552 }
duke@0 1553 }
duke@0 1554
duke@0 1555 void InterpreterMacroAssembler::verify_FPU(int stack_depth, TosState state) {
duke@0 1556 }
never@304 1557 #endif // !CC_INTERP
duke@0 1558
duke@0 1559
duke@0 1560 void InterpreterMacroAssembler::notify_method_entry() {
duke@0 1561 // Whenever JVMTI is interp_only_mode, method entry/exit events are sent to
duke@0 1562 // track stack depth. If it is possible to enter interp_only_mode we add
duke@0 1563 // the code to check if the event should be sent.
duke@0 1564 if (JvmtiExport::can_post_interpreter_events()) {
duke@0 1565 Label L;
duke@0 1566 movl(rdx, Address(r15_thread, JavaThread::interp_only_mode_offset()));
duke@0 1567 testl(rdx, rdx);
duke@0 1568 jcc(Assembler::zero, L);
duke@0 1569 call_VM(noreg, CAST_FROM_FN_PTR(address,
duke@0 1570 InterpreterRuntime::post_method_entry));
duke@0 1571 bind(L);
duke@0 1572 }
duke@0 1573
duke@0 1574 {
duke@0 1575 SkipIfEqual skip(this, &DTraceMethodProbes, false);
duke@0 1576 get_method(c_rarg1);
duke@0 1577 call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry),
duke@0 1578 r15_thread, c_rarg1);
duke@0 1579 }
dcubed@610 1580
dcubed@610 1581 // RedefineClasses() tracing support for obsolete method entry
dcubed@610 1582 if (RC_TRACE_IN_RANGE(0x00001000, 0x00002000)) {
dcubed@610 1583 get_method(c_rarg1);
dcubed@610 1584 call_VM_leaf(
dcubed@610 1585 CAST_FROM_FN_PTR(address, SharedRuntime::rc_trace_method_entry),
dcubed@610 1586 r15_thread, c_rarg1);
dcubed@610 1587 }
duke@0 1588 }
duke@0 1589
duke@0 1590
duke@0 1591 void InterpreterMacroAssembler::notify_method_exit(
duke@0 1592 TosState state, NotifyMethodExitMode mode) {
duke@0 1593 // Whenever JVMTI is interp_only_mode, method entry/exit events are sent to
duke@0 1594 // track stack depth. If it is possible to enter interp_only_mode we add
duke@0 1595 // the code to check if the event should be sent.
duke@0 1596 if (mode == NotifyJVMTI && JvmtiExport::can_post_interpreter_events()) {
duke@0 1597 Label L;
duke@0 1598 // Note: frame::interpreter_frame_result has a dependency on how the
duke@0 1599 // method result is saved across the call to post_method_exit. If this
duke@0 1600 // is changed then the interpreter_frame_result implementation will
duke@0 1601 // need to be updated too.
never@304 1602
never@304 1603 // For c++ interpreter the result is always stored at a known location in the frame
never@304 1604 // template interpreter will leave it on the top of the stack.
never@304 1605 NOT_CC_INTERP(push(state);)
duke@0 1606 movl(rdx, Address(r15_thread, JavaThread::interp_only_mode_offset()));
duke@0 1607 testl(rdx, rdx);
duke@0 1608 jcc(Assembler::zero, L);
duke@0 1609 call_VM(noreg,
duke@0 1610 CAST_FROM_FN_PTR(address, InterpreterRuntime::post_method_exit));
duke@0 1611 bind(L);
never@304 1612 NOT_CC_INTERP(pop(state));
duke@0 1613 }
duke@0 1614
duke@0 1615 {
duke@0 1616 SkipIfEqual skip(this, &DTraceMethodProbes, false);
never@304 1617 NOT_CC_INTERP(push(state));
duke@0 1618 get_method(c_rarg1);
duke@0 1619 call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit),
duke@0 1620 r15_thread, c_rarg1);
never@304 1621 NOT_CC_INTERP(pop(state));
duke@0 1622 }
duke@0 1623 }