src/cpu/x86/vm/interp_masm_x86_32.cpp

Mon, 09 Mar 2009 13:28:46 -0700

author
xdono
date
Mon, 09 Mar 2009 13:28:46 -0700
changeset 1014
0fbdb4381b99
parent 968
dc3ad84615cf
child 1063
7bb995fbd3c0
permissions
-rw-r--r--

6814575: Update copyright year
Summary: Update copyright for files that have been modified in 2009, up to 03/09
Reviewed-by: katleman, tbell, ohair

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

mercurial