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