src/cpu/x86/vm/interp_masm_x86_32.cpp

Wed, 17 Jun 2015 17:48:25 -0700

author
ascarpino
date
Wed, 17 Jun 2015 17:48:25 -0700
changeset 9788
44ef77ad417c
parent 9604
da2e98c027fd
child 9637
eef07cd490d4
permissions
-rw-r--r--

8073108: Use x86 and SPARC CPU instructions for GHASH acceleration
Reviewed-by: kvn, jrose, phh

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

mercurial