src/cpu/x86/vm/interp_masm_x86_32.cpp

Sat, 29 Sep 2012 06:40:00 -0400

author
coleenp
date
Sat, 29 Sep 2012 06:40:00 -0400
changeset 4142
d8ce2825b193
parent 4037
da91efe96a93
child 4299
f34d701e952e
permissions
-rw-r--r--

8000213: NPG: Should have renamed arrayKlass and typeArrayKlass
Summary: Capitalize these metadata types (and objArrayKlass)
Reviewed-by: stefank, twisti, kvn

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

mercurial