src/cpu/x86/vm/interp_masm_x86_32.cpp

Thu, 08 Sep 2011 10:12:25 +0200

author
bdelsart
date
Thu, 08 Sep 2011 10:12:25 +0200
changeset 3130
5432047c7db7
parent 3050
fdb992d83a87
child 3156
f08d439fab8c
permissions
-rw-r--r--

7087445: Improve platform independence of JSR292 shared code
Summary: changes necessary for some JSR292 ports
Reviewed-by: jrose, dholmes

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

mercurial