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