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