src/cpu/x86/vm/interp_masm_x86_64.cpp

Sun, 07 Feb 2010 12:15:06 -0800

author
kvn
date
Sun, 07 Feb 2010 12:15:06 -0800
changeset 1686
576e77447e3c
parent 1641
87684f1a88b5
child 1861
2338d41fbd81
permissions
-rw-r--r--

6923002: assert(false,"this call site should not be polymorphic")
Summary: Clear the total count when a receiver information is cleared.
Reviewed-by: never, jrose

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

mercurial