1 /*
2 * Copyright (c) 1997, 2024, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "compiler/compiler_globals.hpp"
27 #include "interp_masm_x86.hpp"
28 #include "interpreter/interpreter.hpp"
29 #include "interpreter/interpreterRuntime.hpp"
30 #include "logging/log.hpp"
31 #include "oops/arrayOop.hpp"
32 #include "oops/markWord.hpp"
33 #include "oops/methodData.hpp"
34 #include "oops/method.hpp"
35 #include "oops/resolvedFieldEntry.hpp"
36 #include "oops/resolvedIndyEntry.hpp"
37 #include "oops/resolvedMethodEntry.hpp"
38 #include "prims/jvmtiExport.hpp"
39 #include "prims/jvmtiThreadState.hpp"
40 #include "runtime/basicLock.hpp"
41 #include "runtime/frame.inline.hpp"
42 #include "runtime/javaThread.hpp"
43 #include "runtime/safepointMechanism.hpp"
44 #include "runtime/sharedRuntime.hpp"
45 #include "utilities/powerOfTwo.hpp"
46
47 // Implementation of InterpreterMacroAssembler
48
49 void InterpreterMacroAssembler::jump_to_entry(address entry) {
50 assert(entry, "Entry must have been generated by now");
51 jump(RuntimeAddress(entry));
52 }
53
54 void InterpreterMacroAssembler::profile_obj_type(Register obj, const Address& mdo_addr) {
55 Label update, next, none;
56
57 #ifdef _LP64
58 assert_different_registers(obj, rscratch1, mdo_addr.base(), mdo_addr.index());
59 #else
60 assert_different_registers(obj, mdo_addr.base(), mdo_addr.index());
61 #endif
62
63 interp_verify_oop(obj, atos);
64
65 testptr(obj, obj);
66 jccb(Assembler::notZero, update);
67 testptr(mdo_addr, TypeEntries::null_seen);
68 jccb(Assembler::notZero, next); // null already seen. Nothing to do anymore.
69 // atomic update to prevent overwriting Klass* with 0
70 lock();
71 orptr(mdo_addr, TypeEntries::null_seen);
72 jmpb(next);
73
74 bind(update);
75 load_klass(obj, obj, rscratch1);
76 #ifdef _LP64
77 mov(rscratch1, obj);
78 #endif
79
80 xorptr(obj, mdo_addr);
81 testptr(obj, TypeEntries::type_klass_mask);
82 jccb(Assembler::zero, next); // klass seen before, nothing to
83 // do. The unknown bit may have been
84 // set already but no need to check.
85
86 testptr(obj, TypeEntries::type_unknown);
87 jccb(Assembler::notZero, next); // already unknown. Nothing to do anymore.
88
89 cmpptr(mdo_addr, 0);
90 jccb(Assembler::equal, none);
91 cmpptr(mdo_addr, TypeEntries::null_seen);
92 jccb(Assembler::equal, none);
93 #ifdef _LP64
94 // There is a chance that the checks above (re-reading profiling
95 // data from memory) fail if another thread has just set the
96 // profiling to this obj's klass
97 mov(obj, rscratch1);
98 xorptr(obj, mdo_addr);
99 testptr(obj, TypeEntries::type_klass_mask);
100 jccb(Assembler::zero, next);
101 #endif
102
103 // different than before. Cannot keep accurate profile.
104 orptr(mdo_addr, TypeEntries::type_unknown);
105 jmpb(next);
106
107 bind(none);
108 // first time here. Set profile type.
109 movptr(mdo_addr, obj);
110 #ifdef ASSERT
111 andptr(obj, TypeEntries::type_klass_mask);
112 verify_klass_ptr(obj);
113 #endif
114
115 bind(next);
116 }
117
118 void InterpreterMacroAssembler::profile_arguments_type(Register mdp, Register callee, Register tmp, bool is_virtual) {
119 if (!ProfileInterpreter) {
120 return;
121 }
122
123 if (MethodData::profile_arguments() || MethodData::profile_return()) {
124 Label profile_continue;
125
126 test_method_data_pointer(mdp, profile_continue);
127
128 int off_to_start = is_virtual ? in_bytes(VirtualCallData::virtual_call_data_size()) : in_bytes(CounterData::counter_data_size());
129
130 cmpb(Address(mdp, in_bytes(DataLayout::tag_offset()) - off_to_start), is_virtual ? DataLayout::virtual_call_type_data_tag : DataLayout::call_type_data_tag);
131 jcc(Assembler::notEqual, profile_continue);
132
133 if (MethodData::profile_arguments()) {
134 Label done;
135 int off_to_args = in_bytes(TypeEntriesAtCall::args_data_offset());
136 addptr(mdp, off_to_args);
137
138 for (int i = 0; i < TypeProfileArgsLimit; i++) {
139 if (i > 0 || MethodData::profile_return()) {
140 // If return value type is profiled we may have no argument to profile
141 movptr(tmp, Address(mdp, in_bytes(TypeEntriesAtCall::cell_count_offset())-off_to_args));
142 subl(tmp, i*TypeStackSlotEntries::per_arg_count());
143 cmpl(tmp, TypeStackSlotEntries::per_arg_count());
144 jcc(Assembler::less, done);
145 }
146 movptr(tmp, Address(callee, Method::const_offset()));
147 load_unsigned_short(tmp, Address(tmp, ConstMethod::size_of_parameters_offset()));
148 // stack offset o (zero based) from the start of the argument
149 // list, for n arguments translates into offset n - o - 1 from
150 // the end of the argument list
151 subptr(tmp, Address(mdp, in_bytes(TypeEntriesAtCall::stack_slot_offset(i))-off_to_args));
152 subl(tmp, 1);
153 Address arg_addr = argument_address(tmp);
154 movptr(tmp, arg_addr);
155
156 Address mdo_arg_addr(mdp, in_bytes(TypeEntriesAtCall::argument_type_offset(i))-off_to_args);
157 profile_obj_type(tmp, mdo_arg_addr);
158
159 int to_add = in_bytes(TypeStackSlotEntries::per_arg_size());
160 addptr(mdp, to_add);
161 off_to_args += to_add;
162 }
163
164 if (MethodData::profile_return()) {
165 movptr(tmp, Address(mdp, in_bytes(TypeEntriesAtCall::cell_count_offset())-off_to_args));
166 subl(tmp, TypeProfileArgsLimit*TypeStackSlotEntries::per_arg_count());
167 }
168
169 bind(done);
170
171 if (MethodData::profile_return()) {
172 // We're right after the type profile for the last
173 // argument. tmp is the number of cells left in the
174 // CallTypeData/VirtualCallTypeData to reach its end. Non null
175 // if there's a return to profile.
176 assert(ReturnTypeEntry::static_cell_count() < TypeStackSlotEntries::per_arg_count(), "can't move past ret type");
177 shll(tmp, log2i_exact((int)DataLayout::cell_size));
178 addptr(mdp, tmp);
179 }
180 movptr(Address(rbp, frame::interpreter_frame_mdp_offset * wordSize), mdp);
181 } else {
182 assert(MethodData::profile_return(), "either profile call args or call ret");
183 update_mdp_by_constant(mdp, in_bytes(TypeEntriesAtCall::return_only_size()));
184 }
185
186 // mdp points right after the end of the
187 // CallTypeData/VirtualCallTypeData, right after the cells for the
188 // return value type if there's one
189
190 bind(profile_continue);
191 }
192 }
193
194 void InterpreterMacroAssembler::profile_return_type(Register mdp, Register ret, Register tmp) {
195 assert_different_registers(mdp, ret, tmp, _bcp_register);
196 if (ProfileInterpreter && MethodData::profile_return()) {
197 Label profile_continue;
198
199 test_method_data_pointer(mdp, profile_continue);
200
201 if (MethodData::profile_return_jsr292_only()) {
202 assert(Method::intrinsic_id_size_in_bytes() == 2, "assuming Method::_intrinsic_id is u2");
203
204 // If we don't profile all invoke bytecodes we must make sure
205 // it's a bytecode we indeed profile. We can't go back to the
206 // beginning of the ProfileData we intend to update to check its
207 // type because we're right after it and we don't known its
208 // length
209 Label do_profile;
210 cmpb(Address(_bcp_register, 0), Bytecodes::_invokedynamic);
211 jcc(Assembler::equal, do_profile);
212 cmpb(Address(_bcp_register, 0), Bytecodes::_invokehandle);
213 jcc(Assembler::equal, do_profile);
214 get_method(tmp);
215 cmpw(Address(tmp, Method::intrinsic_id_offset()), static_cast<int>(vmIntrinsics::_compiledLambdaForm));
216 jcc(Assembler::notEqual, profile_continue);
217
218 bind(do_profile);
219 }
220
221 Address mdo_ret_addr(mdp, -in_bytes(ReturnTypeEntry::size()));
222 mov(tmp, ret);
223 profile_obj_type(tmp, mdo_ret_addr);
224
225 bind(profile_continue);
226 }
227 }
228
229 void InterpreterMacroAssembler::profile_parameters_type(Register mdp, Register tmp1, Register tmp2) {
230 if (ProfileInterpreter && MethodData::profile_parameters()) {
231 Label profile_continue;
232
233 test_method_data_pointer(mdp, profile_continue);
234
235 // Load the offset of the area within the MDO used for
236 // parameters. If it's negative we're not profiling any parameters
237 movl(tmp1, Address(mdp, in_bytes(MethodData::parameters_type_data_di_offset()) - in_bytes(MethodData::data_offset())));
238 testl(tmp1, tmp1);
239 jcc(Assembler::negative, profile_continue);
240
241 // Compute a pointer to the area for parameters from the offset
242 // and move the pointer to the slot for the last
243 // parameters. Collect profiling from last parameter down.
244 // mdo start + parameters offset + array length - 1
245 addptr(mdp, tmp1);
246 movptr(tmp1, Address(mdp, ArrayData::array_len_offset()));
247 decrement(tmp1, TypeStackSlotEntries::per_arg_count());
248
249 Label loop;
250 bind(loop);
251
252 int off_base = in_bytes(ParametersTypeData::stack_slot_offset(0));
253 int type_base = in_bytes(ParametersTypeData::type_offset(0));
254 Address::ScaleFactor per_arg_scale = Address::times(DataLayout::cell_size);
255 Address arg_off(mdp, tmp1, per_arg_scale, off_base);
256 Address arg_type(mdp, tmp1, per_arg_scale, type_base);
257
258 // load offset on the stack from the slot for this parameter
259 movptr(tmp2, arg_off);
260 negptr(tmp2);
261 // read the parameter from the local area
262 movptr(tmp2, Address(_locals_register, tmp2, Interpreter::stackElementScale()));
263
264 // profile the parameter
265 profile_obj_type(tmp2, arg_type);
266
267 // go to next parameter
268 decrement(tmp1, TypeStackSlotEntries::per_arg_count());
269 jcc(Assembler::positive, loop);
270
271 bind(profile_continue);
272 }
273 }
274
275 void InterpreterMacroAssembler::call_VM_leaf_base(address entry_point,
276 int number_of_arguments) {
277 // interpreter specific
278 //
279 // Note: No need to save/restore bcp & locals registers
280 // since these are callee saved registers and no blocking/
281 // GC can happen in leaf calls.
282 // Further Note: DO NOT save/restore bcp/locals. If a caller has
283 // already saved them so that it can use rsi/rdi as temporaries
284 // then a save/restore here will DESTROY the copy the caller
285 // saved! There used to be a save_bcp() that only happened in
286 // the ASSERT path (no restore_bcp). Which caused bizarre failures
287 // when jvm built with ASSERTs.
288 #ifdef ASSERT
289 {
290 Label L;
291 cmpptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), NULL_WORD);
292 jcc(Assembler::equal, L);
293 stop("InterpreterMacroAssembler::call_VM_leaf_base:"
294 " last_sp != null");
295 bind(L);
296 }
297 #endif
298 // super call
299 MacroAssembler::call_VM_leaf_base(entry_point, number_of_arguments);
300 // interpreter specific
301 // LP64: Used to ASSERT that r13/r14 were equal to frame's bcp/locals
302 // but since they may not have been saved (and we don't want to
303 // save them here (see note above) the assert is invalid.
304 }
305
306 void InterpreterMacroAssembler::call_VM_base(Register oop_result,
307 Register java_thread,
308 Register last_java_sp,
309 address entry_point,
310 int number_of_arguments,
311 bool check_exceptions) {
312 // interpreter specific
313 //
314 // Note: Could avoid restoring locals ptr (callee saved) - however doesn't
315 // really make a difference for these runtime calls, since they are
316 // slow anyway. Btw., bcp must be saved/restored since it may change
317 // due to GC.
318 NOT_LP64(assert(java_thread == noreg , "not expecting a precomputed java thread");)
319 save_bcp();
320 #ifdef ASSERT
321 {
322 Label L;
323 cmpptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), NULL_WORD);
324 jcc(Assembler::equal, L);
325 stop("InterpreterMacroAssembler::call_VM_base:"
326 " last_sp isn't null");
327 bind(L);
328 }
329 #endif /* ASSERT */
330 // super call
331 MacroAssembler::call_VM_base(oop_result, noreg, last_java_sp,
332 entry_point, number_of_arguments,
333 check_exceptions);
334 // interpreter specific
335 restore_bcp();
336 restore_locals();
337 }
338
339 void InterpreterMacroAssembler::check_and_handle_popframe(Register java_thread) {
340 if (JvmtiExport::can_pop_frame()) {
341 Label L;
342 // Initiate popframe handling only if it is not already being
343 // processed. If the flag has the popframe_processing bit set, it
344 // means that this code is called *during* popframe handling - we
345 // don't want to reenter.
346 // This method is only called just after the call into the vm in
347 // call_VM_base, so the arg registers are available.
348 Register pop_cond = NOT_LP64(java_thread) // Not clear if any other register is available on 32 bit
349 LP64_ONLY(c_rarg0);
350 movl(pop_cond, Address(java_thread, JavaThread::popframe_condition_offset()));
351 testl(pop_cond, JavaThread::popframe_pending_bit);
352 jcc(Assembler::zero, L);
353 testl(pop_cond, JavaThread::popframe_processing_bit);
354 jcc(Assembler::notZero, L);
355 // Call Interpreter::remove_activation_preserving_args_entry() to get the
356 // address of the same-named entrypoint in the generated interpreter code.
357 call_VM_leaf(CAST_FROM_FN_PTR(address, Interpreter::remove_activation_preserving_args_entry));
358 jmp(rax);
359 bind(L);
360 NOT_LP64(get_thread(java_thread);)
361 }
362 }
363
364 void InterpreterMacroAssembler::load_earlyret_value(TosState state) {
365 Register thread = LP64_ONLY(r15_thread) NOT_LP64(rcx);
366 NOT_LP64(get_thread(thread);)
367 movptr(rcx, Address(thread, JavaThread::jvmti_thread_state_offset()));
368 const Address tos_addr(rcx, JvmtiThreadState::earlyret_tos_offset());
369 const Address oop_addr(rcx, JvmtiThreadState::earlyret_oop_offset());
370 const Address val_addr(rcx, JvmtiThreadState::earlyret_value_offset());
371 #ifdef _LP64
372 switch (state) {
373 case atos: movptr(rax, oop_addr);
374 movptr(oop_addr, NULL_WORD);
375 interp_verify_oop(rax, state); break;
376 case ltos: movptr(rax, val_addr); break;
377 case btos: // fall through
378 case ztos: // fall through
379 case ctos: // fall through
380 case stos: // fall through
381 case itos: movl(rax, val_addr); break;
382 case ftos: load_float(val_addr); break;
383 case dtos: load_double(val_addr); break;
384 case vtos: /* nothing to do */ break;
385 default : ShouldNotReachHere();
386 }
387 // Clean up tos value in the thread object
388 movl(tos_addr, ilgl);
389 movl(val_addr, NULL_WORD);
390 #else
391 const Address val_addr1(rcx, JvmtiThreadState::earlyret_value_offset()
392 + in_ByteSize(wordSize));
393 switch (state) {
394 case atos: movptr(rax, oop_addr);
395 movptr(oop_addr, NULL_WORD);
396 interp_verify_oop(rax, state); break;
397 case ltos:
398 movl(rdx, val_addr1); // fall through
399 case btos: // fall through
400 case ztos: // fall through
401 case ctos: // fall through
402 case stos: // fall through
403 case itos: movl(rax, val_addr); break;
404 case ftos: load_float(val_addr); break;
405 case dtos: load_double(val_addr); break;
406 case vtos: /* nothing to do */ break;
407 default : ShouldNotReachHere();
408 }
409 #endif // _LP64
410 // Clean up tos value in the thread object
411 movl(tos_addr, ilgl);
412 movptr(val_addr, NULL_WORD);
413 NOT_LP64(movptr(val_addr1, NULL_WORD);)
414 }
415
416
417 void InterpreterMacroAssembler::check_and_handle_earlyret(Register java_thread) {
418 if (JvmtiExport::can_force_early_return()) {
419 Label L;
420 Register tmp = LP64_ONLY(c_rarg0) NOT_LP64(java_thread);
421 Register rthread = LP64_ONLY(r15_thread) NOT_LP64(java_thread);
422
423 movptr(tmp, Address(rthread, JavaThread::jvmti_thread_state_offset()));
424 testptr(tmp, tmp);
425 jcc(Assembler::zero, L); // if (thread->jvmti_thread_state() == nullptr) exit;
426
427 // Initiate earlyret handling only if it is not already being processed.
428 // If the flag has the earlyret_processing bit set, it means that this code
429 // is called *during* earlyret handling - we don't want to reenter.
430 movl(tmp, Address(tmp, JvmtiThreadState::earlyret_state_offset()));
431 cmpl(tmp, JvmtiThreadState::earlyret_pending);
432 jcc(Assembler::notEqual, L);
433
434 // Call Interpreter::remove_activation_early_entry() to get the address of the
435 // same-named entrypoint in the generated interpreter code.
436 NOT_LP64(get_thread(java_thread);)
437 movptr(tmp, Address(rthread, JavaThread::jvmti_thread_state_offset()));
438 #ifdef _LP64
439 movl(tmp, Address(tmp, JvmtiThreadState::earlyret_tos_offset()));
440 call_VM_leaf(CAST_FROM_FN_PTR(address, Interpreter::remove_activation_early_entry), tmp);
441 #else
442 pushl(Address(tmp, JvmtiThreadState::earlyret_tos_offset()));
443 call_VM_leaf(CAST_FROM_FN_PTR(address, Interpreter::remove_activation_early_entry), 1);
444 #endif // _LP64
445 jmp(rax);
446 bind(L);
447 NOT_LP64(get_thread(java_thread);)
448 }
449 }
450
451 void InterpreterMacroAssembler::get_unsigned_2_byte_index_at_bcp(Register reg, int bcp_offset) {
452 assert(bcp_offset >= 0, "bcp is still pointing to start of bytecode");
453 load_unsigned_short(reg, Address(_bcp_register, bcp_offset));
454 bswapl(reg);
455 shrl(reg, 16);
456 }
457
458 void InterpreterMacroAssembler::get_cache_index_at_bcp(Register index,
459 int bcp_offset,
460 size_t index_size) {
461 assert(bcp_offset > 0, "bcp is still pointing to start of bytecode");
462 if (index_size == sizeof(u2)) {
463 load_unsigned_short(index, Address(_bcp_register, bcp_offset));
464 } else if (index_size == sizeof(u4)) {
465 movl(index, Address(_bcp_register, bcp_offset));
466 // Check if the secondary index definition is still ~x, otherwise
467 // we have to change the following assembler code to calculate the
468 // plain index.
469 assert(ConstantPool::decode_invokedynamic_index(~123) == 123, "else change next line");
470 notl(index); // convert to plain index
471 } else if (index_size == sizeof(u1)) {
472 load_unsigned_byte(index, Address(_bcp_register, bcp_offset));
473 } else {
474 ShouldNotReachHere();
475 }
476 }
477
478 // Load object from cpool->resolved_references(index)
479 void InterpreterMacroAssembler::load_resolved_reference_at_index(Register result,
480 Register index,
481 Register tmp) {
482 assert_different_registers(result, index);
483
484 get_constant_pool(result);
485 // load pointer for resolved_references[] objArray
486 movptr(result, Address(result, ConstantPool::cache_offset()));
487 movptr(result, Address(result, ConstantPoolCache::resolved_references_offset()));
488 resolve_oop_handle(result, tmp);
489 load_heap_oop(result, Address(result, index,
490 UseCompressedOops ? Address::times_4 : Address::times_ptr,
491 arrayOopDesc::base_offset_in_bytes(T_OBJECT)), tmp);
492 }
493
494 // load cpool->resolved_klass_at(index)
495 void InterpreterMacroAssembler::load_resolved_klass_at_index(Register klass,
496 Register cpool,
497 Register index) {
498 assert_different_registers(cpool, index);
499
500 movw(index, Address(cpool, index, Address::times_ptr, sizeof(ConstantPool)));
501 Register resolved_klasses = cpool;
502 movptr(resolved_klasses, Address(cpool, ConstantPool::resolved_klasses_offset()));
503 movptr(klass, Address(resolved_klasses, index, Address::times_ptr, Array<Klass*>::base_offset_in_bytes()));
504 }
505
506 // Generate a subtype check: branch to ok_is_subtype if sub_klass is a
507 // subtype of super_klass.
508 //
509 // Args:
510 // rax: superklass
511 // Rsub_klass: subklass
512 //
513 // Kills:
514 // rcx, rdi
515 void InterpreterMacroAssembler::gen_subtype_check(Register Rsub_klass,
516 Label& ok_is_subtype) {
517 assert(Rsub_klass != rax, "rax holds superklass");
518 LP64_ONLY(assert(Rsub_klass != r14, "r14 holds locals");)
519 LP64_ONLY(assert(Rsub_klass != r13, "r13 holds bcp");)
520 assert(Rsub_klass != rcx, "rcx holds 2ndary super array length");
521 assert(Rsub_klass != rdi, "rdi holds 2ndary super array scan ptr");
522
523 // Profile the not-null value's klass.
524 profile_typecheck(rcx, Rsub_klass, rdi); // blows rcx, reloads rdi
525
526 // Do the check.
527 check_klass_subtype(Rsub_klass, rax, rcx, ok_is_subtype); // blows rcx
528 }
529
530
531 #ifndef _LP64
532 void InterpreterMacroAssembler::f2ieee() {
533 if (IEEEPrecision) {
534 fstp_s(Address(rsp, 0));
535 fld_s(Address(rsp, 0));
536 }
537 }
538
539
540 void InterpreterMacroAssembler::d2ieee() {
541 if (IEEEPrecision) {
542 fstp_d(Address(rsp, 0));
543 fld_d(Address(rsp, 0));
544 }
545 }
546 #endif // _LP64
547
548 // Java Expression Stack
549
550 void InterpreterMacroAssembler::pop_ptr(Register r) {
551 pop(r);
552 }
553
554 void InterpreterMacroAssembler::push_ptr(Register r) {
555 push(r);
556 }
557
558 void InterpreterMacroAssembler::push_i(Register r) {
559 push(r);
560 }
561
562 void InterpreterMacroAssembler::push_i_or_ptr(Register r) {
563 push(r);
564 }
565
566 void InterpreterMacroAssembler::push_f(XMMRegister r) {
567 subptr(rsp, wordSize);
568 movflt(Address(rsp, 0), r);
569 }
570
571 void InterpreterMacroAssembler::pop_f(XMMRegister r) {
572 movflt(r, Address(rsp, 0));
573 addptr(rsp, wordSize);
574 }
575
576 void InterpreterMacroAssembler::push_d(XMMRegister r) {
577 subptr(rsp, 2 * wordSize);
578 movdbl(Address(rsp, 0), r);
579 }
580
581 void InterpreterMacroAssembler::pop_d(XMMRegister r) {
582 movdbl(r, Address(rsp, 0));
583 addptr(rsp, 2 * Interpreter::stackElementSize);
584 }
585
586 #ifdef _LP64
587 void InterpreterMacroAssembler::pop_i(Register r) {
588 // XXX can't use pop currently, upper half non clean
589 movl(r, Address(rsp, 0));
590 addptr(rsp, wordSize);
591 }
592
593 void InterpreterMacroAssembler::pop_l(Register r) {
594 movq(r, Address(rsp, 0));
595 addptr(rsp, 2 * Interpreter::stackElementSize);
596 }
597
598 void InterpreterMacroAssembler::push_l(Register r) {
599 subptr(rsp, 2 * wordSize);
600 movptr(Address(rsp, Interpreter::expr_offset_in_bytes(0)), r );
601 movptr(Address(rsp, Interpreter::expr_offset_in_bytes(1)), NULL_WORD );
602 }
603
604 void InterpreterMacroAssembler::pop(TosState state) {
605 switch (state) {
606 case atos: pop_ptr(); break;
607 case btos:
608 case ztos:
609 case ctos:
610 case stos:
611 case itos: pop_i(); break;
612 case ltos: pop_l(); break;
613 case ftos: pop_f(xmm0); break;
614 case dtos: pop_d(xmm0); break;
615 case vtos: /* nothing to do */ break;
616 default: ShouldNotReachHere();
617 }
618 interp_verify_oop(rax, state);
619 }
620
621 void InterpreterMacroAssembler::push(TosState state) {
622 interp_verify_oop(rax, state);
623 switch (state) {
624 case atos: push_ptr(); break;
625 case btos:
626 case ztos:
627 case ctos:
628 case stos:
629 case itos: push_i(); break;
630 case ltos: push_l(); break;
631 case ftos: push_f(xmm0); break;
632 case dtos: push_d(xmm0); break;
633 case vtos: /* nothing to do */ break;
634 default : ShouldNotReachHere();
635 }
636 }
637 #else
638 void InterpreterMacroAssembler::pop_i(Register r) {
639 pop(r);
640 }
641
642 void InterpreterMacroAssembler::pop_l(Register lo, Register hi) {
643 pop(lo);
644 pop(hi);
645 }
646
647 void InterpreterMacroAssembler::pop_f() {
648 fld_s(Address(rsp, 0));
649 addptr(rsp, 1 * wordSize);
650 }
651
652 void InterpreterMacroAssembler::pop_d() {
653 fld_d(Address(rsp, 0));
654 addptr(rsp, 2 * wordSize);
655 }
656
657
658 void InterpreterMacroAssembler::pop(TosState state) {
659 switch (state) {
660 case atos: pop_ptr(rax); break;
661 case btos: // fall through
662 case ztos: // fall through
663 case ctos: // fall through
664 case stos: // fall through
665 case itos: pop_i(rax); break;
666 case ltos: pop_l(rax, rdx); break;
667 case ftos:
668 if (UseSSE >= 1) {
669 pop_f(xmm0);
670 } else {
671 pop_f();
672 }
673 break;
674 case dtos:
675 if (UseSSE >= 2) {
676 pop_d(xmm0);
677 } else {
678 pop_d();
679 }
680 break;
681 case vtos: /* nothing to do */ break;
682 default : ShouldNotReachHere();
683 }
684 interp_verify_oop(rax, state);
685 }
686
687
688 void InterpreterMacroAssembler::push_l(Register lo, Register hi) {
689 push(hi);
690 push(lo);
691 }
692
693 void InterpreterMacroAssembler::push_f() {
694 // Do not schedule for no AGI! Never write beyond rsp!
695 subptr(rsp, 1 * wordSize);
696 fstp_s(Address(rsp, 0));
697 }
698
699 void InterpreterMacroAssembler::push_d() {
700 // Do not schedule for no AGI! Never write beyond rsp!
701 subptr(rsp, 2 * wordSize);
702 fstp_d(Address(rsp, 0));
703 }
704
705
706 void InterpreterMacroAssembler::push(TosState state) {
707 interp_verify_oop(rax, state);
708 switch (state) {
709 case atos: push_ptr(rax); break;
710 case btos: // fall through
711 case ztos: // fall through
712 case ctos: // fall through
713 case stos: // fall through
714 case itos: push_i(rax); break;
715 case ltos: push_l(rax, rdx); break;
716 case ftos:
717 if (UseSSE >= 1) {
718 push_f(xmm0);
719 } else {
720 push_f();
721 }
722 break;
723 case dtos:
724 if (UseSSE >= 2) {
725 push_d(xmm0);
726 } else {
727 push_d();
728 }
729 break;
730 case vtos: /* nothing to do */ break;
731 default : ShouldNotReachHere();
732 }
733 }
734 #endif // _LP64
735
736
737 // Helpers for swap and dup
738 void InterpreterMacroAssembler::load_ptr(int n, Register val) {
739 movptr(val, Address(rsp, Interpreter::expr_offset_in_bytes(n)));
740 }
741
742 void InterpreterMacroAssembler::store_ptr(int n, Register val) {
743 movptr(Address(rsp, Interpreter::expr_offset_in_bytes(n)), val);
744 }
745
746
747 void InterpreterMacroAssembler::prepare_to_jump_from_interpreted() {
748 // set sender sp
749 lea(_bcp_register, Address(rsp, wordSize));
750 // record last_sp
751 mov(rcx, _bcp_register);
752 subptr(rcx, rbp);
753 sarptr(rcx, LogBytesPerWord);
754 movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), rcx);
755 }
756
757
758 // Jump to from_interpreted entry of a call unless single stepping is possible
759 // in this thread in which case we must call the i2i entry
760 void InterpreterMacroAssembler::jump_from_interpreted(Register method, Register temp) {
761 prepare_to_jump_from_interpreted();
762
763 if (JvmtiExport::can_post_interpreter_events()) {
764 Label run_compiled_code;
765 // JVMTI events, such as single-stepping, are implemented partly by avoiding running
766 // compiled code in threads for which the event is enabled. Check here for
767 // interp_only_mode if these events CAN be enabled.
768 // interp_only is an int, on little endian it is sufficient to test the byte only
769 // Is a cmpl faster?
770 LP64_ONLY(temp = r15_thread;)
771 NOT_LP64(get_thread(temp);)
772 cmpb(Address(temp, JavaThread::interp_only_mode_offset()), 0);
773 jccb(Assembler::zero, run_compiled_code);
774 jmp(Address(method, Method::interpreter_entry_offset()));
775 bind(run_compiled_code);
776 }
777
778 jmp(Address(method, Method::from_interpreted_offset()));
779 }
780
781 // The following two routines provide a hook so that an implementation
782 // can schedule the dispatch in two parts. x86 does not do this.
783 void InterpreterMacroAssembler::dispatch_prolog(TosState state, int step) {
784 // Nothing x86 specific to be done here
785 }
786
787 void InterpreterMacroAssembler::dispatch_epilog(TosState state, int step) {
788 dispatch_next(state, step);
789 }
790
791 void InterpreterMacroAssembler::dispatch_base(TosState state,
792 address* table,
793 bool verifyoop,
794 bool generate_poll) {
795 verify_FPU(1, state);
796 if (VerifyActivationFrameSize) {
797 Label L;
798 mov(rcx, rbp);
799 subptr(rcx, rsp);
800 int32_t min_frame_size =
801 (frame::link_offset - frame::interpreter_frame_initial_sp_offset) *
802 wordSize;
803 cmpptr(rcx, min_frame_size);
804 jcc(Assembler::greaterEqual, L);
805 stop("broken stack frame");
806 bind(L);
807 }
808 if (verifyoop) {
809 interp_verify_oop(rax, state);
810 }
811
812 address* const safepoint_table = Interpreter::safept_table(state);
813 #ifdef _LP64
814 Label no_safepoint, dispatch;
815 if (table != safepoint_table && generate_poll) {
816 NOT_PRODUCT(block_comment("Thread-local Safepoint poll"));
817 testb(Address(r15_thread, JavaThread::polling_word_offset()), SafepointMechanism::poll_bit());
818
819 jccb(Assembler::zero, no_safepoint);
820 lea(rscratch1, ExternalAddress((address)safepoint_table));
821 jmpb(dispatch);
822 }
823
824 bind(no_safepoint);
825 lea(rscratch1, ExternalAddress((address)table));
826 bind(dispatch);
827 jmp(Address(rscratch1, rbx, Address::times_8));
828
829 #else
830 Address index(noreg, rbx, Address::times_ptr);
831 if (table != safepoint_table && generate_poll) {
832 NOT_PRODUCT(block_comment("Thread-local Safepoint poll"));
833 Label no_safepoint;
834 const Register thread = rcx;
835 get_thread(thread);
836 testb(Address(thread, JavaThread::polling_word_offset()), SafepointMechanism::poll_bit());
837
838 jccb(Assembler::zero, no_safepoint);
839 ArrayAddress dispatch_addr(ExternalAddress((address)safepoint_table), index);
840 jump(dispatch_addr, noreg);
841 bind(no_safepoint);
842 }
843
844 {
845 ArrayAddress dispatch_addr(ExternalAddress((address)table), index);
846 jump(dispatch_addr, noreg);
847 }
848 #endif // _LP64
849 }
850
851 void InterpreterMacroAssembler::dispatch_only(TosState state, bool generate_poll) {
852 dispatch_base(state, Interpreter::dispatch_table(state), true, generate_poll);
853 }
854
855 void InterpreterMacroAssembler::dispatch_only_normal(TosState state) {
856 dispatch_base(state, Interpreter::normal_table(state));
857 }
858
859 void InterpreterMacroAssembler::dispatch_only_noverify(TosState state) {
860 dispatch_base(state, Interpreter::normal_table(state), false);
861 }
862
863
864 void InterpreterMacroAssembler::dispatch_next(TosState state, int step, bool generate_poll) {
865 // load next bytecode (load before advancing _bcp_register to prevent AGI)
866 load_unsigned_byte(rbx, Address(_bcp_register, step));
867 // advance _bcp_register
868 increment(_bcp_register, step);
869 dispatch_base(state, Interpreter::dispatch_table(state), true, generate_poll);
870 }
871
872 void InterpreterMacroAssembler::dispatch_via(TosState state, address* table) {
873 // load current bytecode
874 load_unsigned_byte(rbx, Address(_bcp_register, 0));
875 dispatch_base(state, table);
876 }
877
878 void InterpreterMacroAssembler::narrow(Register result) {
879
880 // Get method->_constMethod->_result_type
881 movptr(rcx, Address(rbp, frame::interpreter_frame_method_offset * wordSize));
882 movptr(rcx, Address(rcx, Method::const_offset()));
883 load_unsigned_byte(rcx, Address(rcx, ConstMethod::result_type_offset()));
884
885 Label done, notBool, notByte, notChar;
886
887 // common case first
888 cmpl(rcx, T_INT);
889 jcc(Assembler::equal, done);
890
891 // mask integer result to narrower return type.
892 cmpl(rcx, T_BOOLEAN);
893 jcc(Assembler::notEqual, notBool);
894 andl(result, 0x1);
895 jmp(done);
896
897 bind(notBool);
898 cmpl(rcx, T_BYTE);
899 jcc(Assembler::notEqual, notByte);
900 LP64_ONLY(movsbl(result, result);)
901 NOT_LP64(shll(result, 24);) // truncate upper 24 bits
902 NOT_LP64(sarl(result, 24);) // and sign-extend byte
903 jmp(done);
904
905 bind(notByte);
906 cmpl(rcx, T_CHAR);
907 jcc(Assembler::notEqual, notChar);
908 LP64_ONLY(movzwl(result, result);)
909 NOT_LP64(andl(result, 0xFFFF);) // truncate upper 16 bits
910 jmp(done);
911
912 bind(notChar);
913 // cmpl(rcx, T_SHORT); // all that's left
914 // jcc(Assembler::notEqual, done);
915 LP64_ONLY(movswl(result, result);)
916 NOT_LP64(shll(result, 16);) // truncate upper 16 bits
917 NOT_LP64(sarl(result, 16);) // and sign-extend short
918
919 // Nothing to do for T_INT
920 bind(done);
921 }
922
923 // remove activation
924 //
925 // Apply stack watermark barrier.
926 // Unlock the receiver if this is a synchronized method.
927 // Unlock any Java monitors from synchronized blocks.
928 // Remove the activation from the stack.
929 //
930 // If there are locked Java monitors
931 // If throw_monitor_exception
932 // throws IllegalMonitorStateException
933 // Else if install_monitor_exception
934 // installs IllegalMonitorStateException
935 // Else
936 // no error processing
937 void InterpreterMacroAssembler::remove_activation(
938 TosState state,
939 Register ret_addr,
940 bool throw_monitor_exception,
941 bool install_monitor_exception,
942 bool notify_jvmdi) {
943 // Note: Registers rdx xmm0 may be in use for the
944 // result check if synchronized method
945 Label unlocked, unlock, no_unlock;
946
947 const Register rthread = LP64_ONLY(r15_thread) NOT_LP64(rcx);
948 const Register robj = LP64_ONLY(c_rarg1) NOT_LP64(rdx);
949 const Register rmon = LP64_ONLY(c_rarg1) NOT_LP64(rcx);
950 // monitor pointers need different register
951 // because rdx may have the result in it
952 NOT_LP64(get_thread(rthread);)
953
954 // The below poll is for the stack watermark barrier. It allows fixing up frames lazily,
955 // that would normally not be safe to use. Such bad returns into unsafe territory of
956 // the stack, will call InterpreterRuntime::at_unwind.
957 Label slow_path;
958 Label fast_path;
959 safepoint_poll(slow_path, rthread, true /* at_return */, false /* in_nmethod */);
960 jmp(fast_path);
961 bind(slow_path);
962 push(state);
963 set_last_Java_frame(rthread, noreg, rbp, (address)pc(), rscratch1);
964 super_call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::at_unwind), rthread);
965 NOT_LP64(get_thread(rthread);) // call_VM clobbered it, restore
966 reset_last_Java_frame(rthread, true);
967 pop(state);
968 bind(fast_path);
969
970 // get the value of _do_not_unlock_if_synchronized into rdx
971 const Address do_not_unlock_if_synchronized(rthread,
972 in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()));
973 movbool(rbx, do_not_unlock_if_synchronized);
974 movbool(do_not_unlock_if_synchronized, false); // reset the flag
975
976 // get method access flags
977 movptr(rcx, Address(rbp, frame::interpreter_frame_method_offset * wordSize));
978 movl(rcx, Address(rcx, Method::access_flags_offset()));
979 testl(rcx, JVM_ACC_SYNCHRONIZED);
980 jcc(Assembler::zero, unlocked);
981
982 // Don't unlock anything if the _do_not_unlock_if_synchronized flag
983 // is set.
984 testbool(rbx);
985 jcc(Assembler::notZero, no_unlock);
986
987 // unlock monitor
988 push(state); // save result
989
990 // BasicObjectLock will be first in list, since this is a
991 // synchronized method. However, need to check that the object has
992 // not been unlocked by an explicit monitorexit bytecode.
993 const Address monitor(rbp, frame::interpreter_frame_initial_sp_offset *
994 wordSize - (int) sizeof(BasicObjectLock));
995 // We use c_rarg1/rdx so that if we go slow path it will be the correct
996 // register for unlock_object to pass to VM directly
997 lea(robj, monitor); // address of first monitor
998
999 movptr(rax, Address(robj, BasicObjectLock::obj_offset()));
1000 testptr(rax, rax);
1001 jcc(Assembler::notZero, unlock);
1002
1003 pop(state);
1004 if (throw_monitor_exception) {
1005 // Entry already unlocked, need to throw exception
1006 NOT_LP64(empty_FPU_stack();) // remove possible return value from FPU-stack, otherwise stack could overflow
1007 call_VM(noreg, CAST_FROM_FN_PTR(address,
1008 InterpreterRuntime::throw_illegal_monitor_state_exception));
1009 should_not_reach_here();
1010 } else {
1011 // Monitor already unlocked during a stack unroll. If requested,
1012 // install an illegal_monitor_state_exception. Continue with
1013 // stack unrolling.
1014 if (install_monitor_exception) {
1015 NOT_LP64(empty_FPU_stack();)
1016 call_VM(noreg, CAST_FROM_FN_PTR(address,
1017 InterpreterRuntime::new_illegal_monitor_state_exception));
1018 }
1019 jmp(unlocked);
1020 }
1021
1022 bind(unlock);
1023 unlock_object(robj);
1024 pop(state);
1025
1026 // Check that for block-structured locking (i.e., that all locked
1027 // objects has been unlocked)
1028 bind(unlocked);
1029
1030 // rax, rdx: Might contain return value
1031
1032 // Check that all monitors are unlocked
1033 {
1034 Label loop, exception, entry, restart;
1035 const int entry_size = frame::interpreter_frame_monitor_size_in_bytes();
1036 const Address monitor_block_top(
1037 rbp, frame::interpreter_frame_monitor_block_top_offset * wordSize);
1038 const Address monitor_block_bot(
1039 rbp, frame::interpreter_frame_initial_sp_offset * wordSize);
1040
1041 bind(restart);
1042 // We use c_rarg1 so that if we go slow path it will be the correct
1043 // register for unlock_object to pass to VM directly
1044 movptr(rmon, monitor_block_top); // derelativize pointer
1045 lea(rmon, Address(rbp, rmon, Address::times_ptr));
1046 // c_rarg1 points to current entry, starting with top-most entry
1047
1048 lea(rbx, monitor_block_bot); // points to word before bottom of
1049 // monitor block
1050 jmp(entry);
1051
1052 // Entry already locked, need to throw exception
1053 bind(exception);
1054
1055 if (throw_monitor_exception) {
1056 // Throw exception
1057 NOT_LP64(empty_FPU_stack();)
1058 MacroAssembler::call_VM(noreg,
1059 CAST_FROM_FN_PTR(address, InterpreterRuntime::
1060 throw_illegal_monitor_state_exception));
1061 should_not_reach_here();
1062 } else {
1063 // Stack unrolling. Unlock object and install illegal_monitor_exception.
1064 // Unlock does not block, so don't have to worry about the frame.
1065 // We don't have to preserve c_rarg1 since we are going to throw an exception.
1066
1067 push(state);
1068 mov(robj, rmon); // nop if robj and rmon are the same
1069 unlock_object(robj);
1070 pop(state);
1071
1072 if (install_monitor_exception) {
1073 NOT_LP64(empty_FPU_stack();)
1074 call_VM(noreg, CAST_FROM_FN_PTR(address,
1075 InterpreterRuntime::
1076 new_illegal_monitor_state_exception));
1077 }
1078
1079 jmp(restart);
1080 }
1081
1082 bind(loop);
1083 // check if current entry is used
1084 cmpptr(Address(rmon, BasicObjectLock::obj_offset()), NULL_WORD);
1085 jcc(Assembler::notEqual, exception);
1086
1087 addptr(rmon, entry_size); // otherwise advance to next entry
1088 bind(entry);
1089 cmpptr(rmon, rbx); // check if bottom reached
1090 jcc(Assembler::notEqual, loop); // if not at bottom then check this entry
1091 }
1092
1093 bind(no_unlock);
1094
1095 // jvmti support
1096 if (notify_jvmdi) {
1097 notify_method_exit(state, NotifyJVMTI); // preserve TOSCA
1098 } else {
1099 notify_method_exit(state, SkipNotifyJVMTI); // preserve TOSCA
1100 }
1101
1102 // remove activation
1103 // get sender sp
1104 movptr(rbx,
1105 Address(rbp, frame::interpreter_frame_sender_sp_offset * wordSize));
1106 if (StackReservedPages > 0) {
1107 // testing if reserved zone needs to be re-enabled
1108 Register rthread = LP64_ONLY(r15_thread) NOT_LP64(rcx);
1109 Label no_reserved_zone_enabling;
1110
1111 NOT_LP64(get_thread(rthread);)
1112
1113 // check if already enabled - if so no re-enabling needed
1114 assert(sizeof(StackOverflow::StackGuardState) == 4, "unexpected size");
1115 cmpl(Address(rthread, JavaThread::stack_guard_state_offset()), StackOverflow::stack_guard_enabled);
1116 jcc(Assembler::equal, no_reserved_zone_enabling);
1117
1118 cmpptr(rbx, Address(rthread, JavaThread::reserved_stack_activation_offset()));
1119 jcc(Assembler::lessEqual, no_reserved_zone_enabling);
1120
1121 call_VM_leaf(
1122 CAST_FROM_FN_PTR(address, SharedRuntime::enable_stack_reserved_zone), rthread);
1123 call_VM(noreg, CAST_FROM_FN_PTR(address,
1124 InterpreterRuntime::throw_delayed_StackOverflowError));
1125 should_not_reach_here();
1126
1127 bind(no_reserved_zone_enabling);
1128 }
1129 leave(); // remove frame anchor
1130 pop(ret_addr); // get return address
1131 mov(rsp, rbx); // set sp to sender sp
1132 pop_cont_fastpath();
1133 }
1134
1135 void InterpreterMacroAssembler::get_method_counters(Register method,
1136 Register mcs, Label& skip) {
1137 Label has_counters;
1138 movptr(mcs, Address(method, Method::method_counters_offset()));
1139 testptr(mcs, mcs);
1140 jcc(Assembler::notZero, has_counters);
1141 call_VM(noreg, CAST_FROM_FN_PTR(address,
1142 InterpreterRuntime::build_method_counters), method);
1143 movptr(mcs, Address(method,Method::method_counters_offset()));
1144 testptr(mcs, mcs);
1145 jcc(Assembler::zero, skip); // No MethodCounters allocated, OutOfMemory
1146 bind(has_counters);
1147 }
1148
1149
1150 // Lock object
1151 //
1152 // Args:
1153 // rdx, c_rarg1: BasicObjectLock to be used for locking
1154 //
1155 // Kills:
1156 // rax, rbx
1157 void InterpreterMacroAssembler::lock_object(Register lock_reg) {
1158 assert(lock_reg == LP64_ONLY(c_rarg1) NOT_LP64(rdx),
1159 "The argument is only for looks. It must be c_rarg1");
1160
1161 if (LockingMode == LM_MONITOR) {
1162 push_cont_fastpath();
1163 call_VM(noreg,
1164 CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorenter),
1165 lock_reg);
1166 pop_cont_fastpath();
1167 } else {
1168 Label count_locking, done, slow_case;
1169
1170 const Register swap_reg = rax; // Must use rax for cmpxchg instruction
1171 const Register tmp_reg = rbx;
1172 const Register obj_reg = LP64_ONLY(c_rarg3) NOT_LP64(rcx); // Will contain the oop
1173 const Register rklass_decode_tmp = rscratch1;
1174
1175 const int obj_offset = in_bytes(BasicObjectLock::obj_offset());
1176 const int lock_offset = in_bytes(BasicObjectLock::lock_offset());
1177 const int mark_offset = lock_offset +
1178 BasicLock::displaced_header_offset_in_bytes();
1179
1180 // Load object pointer into obj_reg
1181 movptr(obj_reg, Address(lock_reg, obj_offset));
1182
1183 if (DiagnoseSyncOnValueBasedClasses != 0) {
1184 load_klass(tmp_reg, obj_reg, rklass_decode_tmp);
1185 movl(tmp_reg, Address(tmp_reg, Klass::access_flags_offset()));
1186 testl(tmp_reg, JVM_ACC_IS_VALUE_BASED_CLASS);
1187 jcc(Assembler::notZero, slow_case);
1188 }
1189
1190 if (LockingMode == LM_LIGHTWEIGHT) {
1191 #ifdef _LP64
1192 const Register thread = r15_thread;
1193 #else
1194 const Register thread = lock_reg;
1195 get_thread(thread);
1196 #endif
1197 lightweight_lock(obj_reg, swap_reg, thread, tmp_reg, slow_case);
1198 } else if (LockingMode == LM_LEGACY) {
1199 // Load immediate 1 into swap_reg %rax
1200 movl(swap_reg, 1);
1201
1202 // Load (object->mark() | 1) into swap_reg %rax
1203 orptr(swap_reg, Address(obj_reg, oopDesc::mark_offset_in_bytes()));
1204
1205 // Save (object->mark() | 1) into BasicLock's displaced header
1206 movptr(Address(lock_reg, mark_offset), swap_reg);
1207
1208 assert(lock_offset == 0,
1209 "displaced header must be first word in BasicObjectLock");
1210
1211 lock();
1212 cmpxchgptr(lock_reg, Address(obj_reg, oopDesc::mark_offset_in_bytes()));
1213 jcc(Assembler::zero, count_locking);
1214
1215 const int zero_bits = LP64_ONLY(7) NOT_LP64(3);
1216
1217 // Fast check for recursive lock.
1218 //
1219 // Can apply the optimization only if this is a stack lock
1220 // allocated in this thread. For efficiency, we can focus on
1221 // recently allocated stack locks (instead of reading the stack
1222 // base and checking whether 'mark' points inside the current
1223 // thread stack):
1224 // 1) (mark & zero_bits) == 0, and
1225 // 2) rsp <= mark < mark + os::pagesize()
1226 //
1227 // Warning: rsp + os::pagesize can overflow the stack base. We must
1228 // neither apply the optimization for an inflated lock allocated
1229 // just above the thread stack (this is why condition 1 matters)
1230 // nor apply the optimization if the stack lock is inside the stack
1231 // of another thread. The latter is avoided even in case of overflow
1232 // because we have guard pages at the end of all stacks. Hence, if
1233 // we go over the stack base and hit the stack of another thread,
1234 // this should not be in a writeable area that could contain a
1235 // stack lock allocated by that thread. As a consequence, a stack
1236 // lock less than page size away from rsp is guaranteed to be
1237 // owned by the current thread.
1238 //
1239 // These 3 tests can be done by evaluating the following
1240 // expression: ((mark - rsp) & (zero_bits - os::vm_page_size())),
1241 // assuming both stack pointer and pagesize have their
1242 // least significant bits clear.
1243 // NOTE: the mark is in swap_reg %rax as the result of cmpxchg
1244 subptr(swap_reg, rsp);
1245 andptr(swap_reg, zero_bits - (int)os::vm_page_size());
1246
1247 // Save the test result, for recursive case, the result is zero
1248 movptr(Address(lock_reg, mark_offset), swap_reg);
1249 jcc(Assembler::notZero, slow_case);
1250 }
1251 jmp(done);
1252
1253 bind(count_locking);
1254 inc_held_monitor_count();
1255 jmp(done);
1256
1257 bind(slow_case);
1258
1259 push_cont_fastpath();
1260 // Call the runtime routine for slow case
1261 if (LockingMode == LM_LIGHTWEIGHT) {
1262 call_VM(noreg,
1263 CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorenter_obj),
1264 obj_reg);
1265 } else {
1266 call_VM(noreg,
1267 CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorenter),
1268 lock_reg);
1269 }
1270 pop_cont_fastpath();
1271 bind(done);
1272 }
1273 }
1274
1275
1276 // Unlocks an object. Used in monitorexit bytecode and
1277 // remove_activation. Throws an IllegalMonitorException if object is
1278 // not locked by current thread.
1279 //
1280 // Args:
1281 // rdx, c_rarg1: BasicObjectLock for lock
1282 //
1283 // Kills:
1284 // rax
1285 // c_rarg0, c_rarg1, c_rarg2, c_rarg3, ... (param regs)
1286 // rscratch1 (scratch reg)
1287 // rax, rbx, rcx, rdx
1288 void InterpreterMacroAssembler::unlock_object(Register lock_reg) {
1289 assert(lock_reg == LP64_ONLY(c_rarg1) NOT_LP64(rdx),
1290 "The argument is only for looks. It must be c_rarg1");
1291
1292 if (LockingMode == LM_MONITOR) {
1293 call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorexit), lock_reg);
1294 } else {
1295 Label done, slow_case;
1296
1297 const Register swap_reg = rax; // Must use rax for cmpxchg instruction
1298 const Register header_reg = LP64_ONLY(c_rarg2) NOT_LP64(rbx); // Will contain the old oopMark
1299 const Register obj_reg = LP64_ONLY(c_rarg3) NOT_LP64(rcx); // Will contain the oop
1300
1301 save_bcp(); // Save in case of exception
1302
1303 if (LockingMode != LM_LIGHTWEIGHT) {
1304 // Convert from BasicObjectLock structure to object and BasicLock
1305 // structure Store the BasicLock address into %rax
1306 lea(swap_reg, Address(lock_reg, BasicObjectLock::lock_offset()));
1307 }
1308
1309 // Load oop into obj_reg(%c_rarg3)
1310 movptr(obj_reg, Address(lock_reg, BasicObjectLock::obj_offset()));
1311
1312 // Free entry
1313 movptr(Address(lock_reg, BasicObjectLock::obj_offset()), NULL_WORD);
1314
1315 if (LockingMode == LM_LIGHTWEIGHT) {
1316 #ifdef _LP64
1317 lightweight_unlock(obj_reg, swap_reg, r15_thread, header_reg, slow_case);
1318 #else
1319 // This relies on the implementation of lightweight_unlock being able to handle
1320 // that the reg_rax and thread Register parameters may alias each other.
1321 get_thread(swap_reg);
1322 lightweight_unlock(obj_reg, swap_reg, swap_reg, header_reg, slow_case);
1323 #endif
1324 } else if (LockingMode == LM_LEGACY) {
1325 // Load the old header from BasicLock structure
1326 movptr(header_reg, Address(swap_reg,
1327 BasicLock::displaced_header_offset_in_bytes()));
1328
1329 // Test for recursion
1330 testptr(header_reg, header_reg);
1331
1332 // zero for recursive case
1333 jcc(Assembler::zero, done);
1334
1335 // Atomic swap back the old header
1336 lock();
1337 cmpxchgptr(header_reg, Address(obj_reg, oopDesc::mark_offset_in_bytes()));
1338
1339 // zero for simple unlock of a stack-lock case
1340 jcc(Assembler::notZero, slow_case);
1341 dec_held_monitor_count();
1342 }
1343 jmp(done);
1344
1345 bind(slow_case);
1346 // Call the runtime routine for slow case.
1347 movptr(Address(lock_reg, BasicObjectLock::obj_offset()), obj_reg); // restore obj
1348 call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::monitorexit), lock_reg);
1349
1350 bind(done);
1351
1352 restore_bcp();
1353 }
1354 }
1355
1356 void InterpreterMacroAssembler::test_method_data_pointer(Register mdp,
1357 Label& zero_continue) {
1358 assert(ProfileInterpreter, "must be profiling interpreter");
1359 movptr(mdp, Address(rbp, frame::interpreter_frame_mdp_offset * wordSize));
1360 testptr(mdp, mdp);
1361 jcc(Assembler::zero, zero_continue);
1362 }
1363
1364
1365 // Set the method data pointer for the current bcp.
1366 void InterpreterMacroAssembler::set_method_data_pointer_for_bcp() {
1367 assert(ProfileInterpreter, "must be profiling interpreter");
1368 Label set_mdp;
1369 push(rax);
1370 push(rbx);
1371
1372 get_method(rbx);
1373 // Test MDO to avoid the call if it is null.
1374 movptr(rax, Address(rbx, in_bytes(Method::method_data_offset())));
1375 testptr(rax, rax);
1376 jcc(Assembler::zero, set_mdp);
1377 // rbx: method
1378 // _bcp_register: bcp
1379 call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::bcp_to_di), rbx, _bcp_register);
1380 // rax: mdi
1381 // mdo is guaranteed to be non-zero here, we checked for it before the call.
1382 movptr(rbx, Address(rbx, in_bytes(Method::method_data_offset())));
1383 addptr(rbx, in_bytes(MethodData::data_offset()));
1384 addptr(rax, rbx);
1385 bind(set_mdp);
1386 movptr(Address(rbp, frame::interpreter_frame_mdp_offset * wordSize), rax);
1387 pop(rbx);
1388 pop(rax);
1389 }
1390
1391 void InterpreterMacroAssembler::verify_method_data_pointer() {
1392 assert(ProfileInterpreter, "must be profiling interpreter");
1393 #ifdef ASSERT
1394 Label verify_continue;
1395 push(rax);
1396 push(rbx);
1397 Register arg3_reg = LP64_ONLY(c_rarg3) NOT_LP64(rcx);
1398 Register arg2_reg = LP64_ONLY(c_rarg2) NOT_LP64(rdx);
1399 push(arg3_reg);
1400 push(arg2_reg);
1401 test_method_data_pointer(arg3_reg, verify_continue); // If mdp is zero, continue
1402 get_method(rbx);
1403
1404 // If the mdp is valid, it will point to a DataLayout header which is
1405 // consistent with the bcp. The converse is highly probable also.
1406 load_unsigned_short(arg2_reg,
1407 Address(arg3_reg, in_bytes(DataLayout::bci_offset())));
1408 addptr(arg2_reg, Address(rbx, Method::const_offset()));
1409 lea(arg2_reg, Address(arg2_reg, ConstMethod::codes_offset()));
1410 cmpptr(arg2_reg, _bcp_register);
1411 jcc(Assembler::equal, verify_continue);
1412 // rbx: method
1413 // _bcp_register: bcp
1414 // c_rarg3: mdp
1415 call_VM_leaf(CAST_FROM_FN_PTR(address, InterpreterRuntime::verify_mdp),
1416 rbx, _bcp_register, arg3_reg);
1417 bind(verify_continue);
1418 pop(arg2_reg);
1419 pop(arg3_reg);
1420 pop(rbx);
1421 pop(rax);
1422 #endif // ASSERT
1423 }
1424
1425
1426 void InterpreterMacroAssembler::set_mdp_data_at(Register mdp_in,
1427 int constant,
1428 Register value) {
1429 assert(ProfileInterpreter, "must be profiling interpreter");
1430 Address data(mdp_in, constant);
1431 movptr(data, value);
1432 }
1433
1434
1435 void InterpreterMacroAssembler::increment_mdp_data_at(Register mdp_in,
1436 int constant,
1437 bool decrement) {
1438 // Counter address
1439 Address data(mdp_in, constant);
1440
1441 increment_mdp_data_at(data, decrement);
1442 }
1443
1444 void InterpreterMacroAssembler::increment_mdp_data_at(Address data,
1445 bool decrement) {
1446 assert(ProfileInterpreter, "must be profiling interpreter");
1447 // %%% this does 64bit counters at best it is wasting space
1448 // at worst it is a rare bug when counters overflow
1449
1450 if (decrement) {
1451 // Decrement the register. Set condition codes.
1452 addptr(data, -DataLayout::counter_increment);
1453 // If the decrement causes the counter to overflow, stay negative
1454 Label L;
1455 jcc(Assembler::negative, L);
1456 addptr(data, DataLayout::counter_increment);
1457 bind(L);
1458 } else {
1459 assert(DataLayout::counter_increment == 1,
1460 "flow-free idiom only works with 1");
1461 // Increment the register. Set carry flag.
1462 addptr(data, DataLayout::counter_increment);
1463 // If the increment causes the counter to overflow, pull back by 1.
1464 sbbptr(data, 0);
1465 }
1466 }
1467
1468
1469 void InterpreterMacroAssembler::increment_mdp_data_at(Register mdp_in,
1470 Register reg,
1471 int constant,
1472 bool decrement) {
1473 Address data(mdp_in, reg, Address::times_1, constant);
1474
1475 increment_mdp_data_at(data, decrement);
1476 }
1477
1478 void InterpreterMacroAssembler::set_mdp_flag_at(Register mdp_in,
1479 int flag_byte_constant) {
1480 assert(ProfileInterpreter, "must be profiling interpreter");
1481 int header_offset = in_bytes(DataLayout::flags_offset());
1482 int header_bits = flag_byte_constant;
1483 // Set the flag
1484 orb(Address(mdp_in, header_offset), header_bits);
1485 }
1486
1487
1488
1489 void InterpreterMacroAssembler::test_mdp_data_at(Register mdp_in,
1490 int offset,
1491 Register value,
1492 Register test_value_out,
1493 Label& not_equal_continue) {
1494 assert(ProfileInterpreter, "must be profiling interpreter");
1495 if (test_value_out == noreg) {
1496 cmpptr(value, Address(mdp_in, offset));
1497 } else {
1498 // Put the test value into a register, so caller can use it:
1499 movptr(test_value_out, Address(mdp_in, offset));
1500 cmpptr(test_value_out, value);
1501 }
1502 jcc(Assembler::notEqual, not_equal_continue);
1503 }
1504
1505
1506 void InterpreterMacroAssembler::update_mdp_by_offset(Register mdp_in,
1507 int offset_of_disp) {
1508 assert(ProfileInterpreter, "must be profiling interpreter");
1509 Address disp_address(mdp_in, offset_of_disp);
1510 addptr(mdp_in, disp_address);
1511 movptr(Address(rbp, frame::interpreter_frame_mdp_offset * wordSize), mdp_in);
1512 }
1513
1514
1515 void InterpreterMacroAssembler::update_mdp_by_offset(Register mdp_in,
1516 Register reg,
1517 int offset_of_disp) {
1518 assert(ProfileInterpreter, "must be profiling interpreter");
1519 Address disp_address(mdp_in, reg, Address::times_1, offset_of_disp);
1520 addptr(mdp_in, disp_address);
1521 movptr(Address(rbp, frame::interpreter_frame_mdp_offset * wordSize), mdp_in);
1522 }
1523
1524
1525 void InterpreterMacroAssembler::update_mdp_by_constant(Register mdp_in,
1526 int constant) {
1527 assert(ProfileInterpreter, "must be profiling interpreter");
1528 addptr(mdp_in, constant);
1529 movptr(Address(rbp, frame::interpreter_frame_mdp_offset * wordSize), mdp_in);
1530 }
1531
1532
1533 void InterpreterMacroAssembler::update_mdp_for_ret(Register return_bci) {
1534 assert(ProfileInterpreter, "must be profiling interpreter");
1535 push(return_bci); // save/restore across call_VM
1536 call_VM(noreg,
1537 CAST_FROM_FN_PTR(address, InterpreterRuntime::update_mdp_for_ret),
1538 return_bci);
1539 pop(return_bci);
1540 }
1541
1542
1543 void InterpreterMacroAssembler::profile_taken_branch(Register mdp,
1544 Register bumped_count) {
1545 if (ProfileInterpreter) {
1546 Label profile_continue;
1547
1548 // If no method data exists, go to profile_continue.
1549 // Otherwise, assign to mdp
1550 test_method_data_pointer(mdp, profile_continue);
1551
1552 // We are taking a branch. Increment the taken count.
1553 // We inline increment_mdp_data_at to return bumped_count in a register
1554 //increment_mdp_data_at(mdp, in_bytes(JumpData::taken_offset()));
1555 Address data(mdp, in_bytes(JumpData::taken_offset()));
1556 movptr(bumped_count, data);
1557 assert(DataLayout::counter_increment == 1,
1558 "flow-free idiom only works with 1");
1559 addptr(bumped_count, DataLayout::counter_increment);
1560 sbbptr(bumped_count, 0);
1561 movptr(data, bumped_count); // Store back out
1562
1563 // The method data pointer needs to be updated to reflect the new target.
1564 update_mdp_by_offset(mdp, in_bytes(JumpData::displacement_offset()));
1565 bind(profile_continue);
1566 }
1567 }
1568
1569
1570 void InterpreterMacroAssembler::profile_not_taken_branch(Register mdp) {
1571 if (ProfileInterpreter) {
1572 Label profile_continue;
1573
1574 // If no method data exists, go to profile_continue.
1575 test_method_data_pointer(mdp, profile_continue);
1576
1577 // We are taking a branch. Increment the not taken count.
1578 increment_mdp_data_at(mdp, in_bytes(BranchData::not_taken_offset()));
1579
1580 // The method data pointer needs to be updated to correspond to
1581 // the next bytecode
1582 update_mdp_by_constant(mdp, in_bytes(BranchData::branch_data_size()));
1583 bind(profile_continue);
1584 }
1585 }
1586
1587 void InterpreterMacroAssembler::profile_call(Register mdp) {
1588 if (ProfileInterpreter) {
1589 Label profile_continue;
1590
1591 // If no method data exists, go to profile_continue.
1592 test_method_data_pointer(mdp, profile_continue);
1593
1594 // We are making a call. Increment the count.
1595 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
1596
1597 // The method data pointer needs to be updated to reflect the new target.
1598 update_mdp_by_constant(mdp, in_bytes(CounterData::counter_data_size()));
1599 bind(profile_continue);
1600 }
1601 }
1602
1603
1604 void InterpreterMacroAssembler::profile_final_call(Register mdp) {
1605 if (ProfileInterpreter) {
1606 Label profile_continue;
1607
1608 // If no method data exists, go to profile_continue.
1609 test_method_data_pointer(mdp, profile_continue);
1610
1611 // We are making a call. Increment the count.
1612 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
1613
1614 // The method data pointer needs to be updated to reflect the new target.
1615 update_mdp_by_constant(mdp,
1616 in_bytes(VirtualCallData::
1617 virtual_call_data_size()));
1618 bind(profile_continue);
1619 }
1620 }
1621
1622
1623 void InterpreterMacroAssembler::profile_virtual_call(Register receiver,
1624 Register mdp,
1625 Register reg2,
1626 bool receiver_can_be_null) {
1627 if (ProfileInterpreter) {
1628 Label profile_continue;
1629
1630 // If no method data exists, go to profile_continue.
1631 test_method_data_pointer(mdp, profile_continue);
1632
1633 Label skip_receiver_profile;
1634 if (receiver_can_be_null) {
1635 Label not_null;
1636 testptr(receiver, receiver);
1637 jccb(Assembler::notZero, not_null);
1638 // We are making a call. Increment the count for null receiver.
1639 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
1640 jmp(skip_receiver_profile);
1641 bind(not_null);
1642 }
1643
1644 // Record the receiver type.
1645 record_klass_in_profile(receiver, mdp, reg2, true);
1646 bind(skip_receiver_profile);
1647
1648 // The method data pointer needs to be updated to reflect the new target.
1649 update_mdp_by_constant(mdp, in_bytes(VirtualCallData::virtual_call_data_size()));
1650 bind(profile_continue);
1651 }
1652 }
1653
1654 // This routine creates a state machine for updating the multi-row
1655 // type profile at a virtual call site (or other type-sensitive bytecode).
1656 // The machine visits each row (of receiver/count) until the receiver type
1657 // is found, or until it runs out of rows. At the same time, it remembers
1658 // the location of the first empty row. (An empty row records null for its
1659 // receiver, and can be allocated for a newly-observed receiver type.)
1660 // Because there are two degrees of freedom in the state, a simple linear
1661 // search will not work; it must be a decision tree. Hence this helper
1662 // function is recursive, to generate the required tree structured code.
1663 // It's the interpreter, so we are trading off code space for speed.
1664 // See below for example code.
1665 void InterpreterMacroAssembler::record_klass_in_profile_helper(
1666 Register receiver, Register mdp,
1667 Register reg2, int start_row,
1668 Label& done, bool is_virtual_call) {
1669 if (TypeProfileWidth == 0) {
1670 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
1671 } else {
1672 record_item_in_profile_helper(receiver, mdp, reg2, 0, done, TypeProfileWidth,
1673 &VirtualCallData::receiver_offset, &VirtualCallData::receiver_count_offset);
1674 }
1675 }
1676
1677 void InterpreterMacroAssembler::record_item_in_profile_helper(Register item, Register mdp, Register reg2, int start_row,
1678 Label& done, int total_rows,
1679 OffsetFunction item_offset_fn,
1680 OffsetFunction item_count_offset_fn) {
1681 int last_row = total_rows - 1;
1682 assert(start_row <= last_row, "must be work left to do");
1683 // Test this row for both the item and for null.
1684 // Take any of three different outcomes:
1685 // 1. found item => increment count and goto done
1686 // 2. found null => keep looking for case 1, maybe allocate this cell
1687 // 3. found something else => keep looking for cases 1 and 2
1688 // Case 3 is handled by a recursive call.
1689 for (int row = start_row; row <= last_row; row++) {
1690 Label next_test;
1691 bool test_for_null_also = (row == start_row);
1692
1693 // See if the item is item[n].
1694 int item_offset = in_bytes(item_offset_fn(row));
1695 test_mdp_data_at(mdp, item_offset, item,
1696 (test_for_null_also ? reg2 : noreg),
1697 next_test);
1698 // (Reg2 now contains the item from the CallData.)
1699
1700 // The item is item[n]. Increment count[n].
1701 int count_offset = in_bytes(item_count_offset_fn(row));
1702 increment_mdp_data_at(mdp, count_offset);
1703 jmp(done);
1704 bind(next_test);
1705
1706 if (test_for_null_also) {
1707 // Failed the equality check on item[n]... Test for null.
1708 testptr(reg2, reg2);
1709 if (start_row == last_row) {
1710 // The only thing left to do is handle the null case.
1711 Label found_null;
1712 jccb(Assembler::zero, found_null);
1713 // Item did not match any saved item and there is no empty row for it.
1714 // Increment total counter to indicate polymorphic case.
1715 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
1716 jmp(done);
1717 bind(found_null);
1718 break;
1719 }
1720 Label found_null;
1721 // Since null is rare, make it be the branch-taken case.
1722 jcc(Assembler::zero, found_null);
1723
1724 // Put all the "Case 3" tests here.
1725 record_item_in_profile_helper(item, mdp, reg2, start_row + 1, done, total_rows,
1726 item_offset_fn, item_count_offset_fn);
1727
1728 // Found a null. Keep searching for a matching item,
1729 // but remember that this is an empty (unused) slot.
1730 bind(found_null);
1731 }
1732 }
1733
1734 // In the fall-through case, we found no matching item, but we
1735 // observed the item[start_row] is null.
1736
1737 // Fill in the item field and increment the count.
1738 int item_offset = in_bytes(item_offset_fn(start_row));
1739 set_mdp_data_at(mdp, item_offset, item);
1740 int count_offset = in_bytes(item_count_offset_fn(start_row));
1741 movl(reg2, DataLayout::counter_increment);
1742 set_mdp_data_at(mdp, count_offset, reg2);
1743 if (start_row > 0) {
1744 jmp(done);
1745 }
1746 }
1747
1748 // Example state machine code for three profile rows:
1749 // // main copy of decision tree, rooted at row[1]
1750 // if (row[0].rec == rec) { row[0].incr(); goto done; }
1751 // if (row[0].rec != nullptr) {
1752 // // inner copy of decision tree, rooted at row[1]
1753 // if (row[1].rec == rec) { row[1].incr(); goto done; }
1754 // if (row[1].rec != nullptr) {
1755 // // degenerate decision tree, rooted at row[2]
1756 // if (row[2].rec == rec) { row[2].incr(); goto done; }
1757 // if (row[2].rec != nullptr) { count.incr(); goto done; } // overflow
1758 // row[2].init(rec); goto done;
1759 // } else {
1760 // // remember row[1] is empty
1761 // if (row[2].rec == rec) { row[2].incr(); goto done; }
1762 // row[1].init(rec); goto done;
1763 // }
1764 // } else {
1765 // // remember row[0] is empty
1766 // if (row[1].rec == rec) { row[1].incr(); goto done; }
1767 // if (row[2].rec == rec) { row[2].incr(); goto done; }
1768 // row[0].init(rec); goto done;
1769 // }
1770 // done:
1771
1772 void InterpreterMacroAssembler::record_klass_in_profile(Register receiver,
1773 Register mdp, Register reg2,
1774 bool is_virtual_call) {
1775 assert(ProfileInterpreter, "must be profiling");
1776 Label done;
1777
1778 record_klass_in_profile_helper(receiver, mdp, reg2, 0, done, is_virtual_call);
1779
1780 bind (done);
1781 }
1782
1783 void InterpreterMacroAssembler::profile_ret(Register return_bci,
1784 Register mdp) {
1785 if (ProfileInterpreter) {
1786 Label profile_continue;
1787 uint row;
1788
1789 // If no method data exists, go to profile_continue.
1790 test_method_data_pointer(mdp, profile_continue);
1791
1792 // Update the total ret count.
1793 increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
1794
1795 for (row = 0; row < RetData::row_limit(); row++) {
1796 Label next_test;
1797
1798 // See if return_bci is equal to bci[n]:
1799 test_mdp_data_at(mdp,
1800 in_bytes(RetData::bci_offset(row)),
1801 return_bci, noreg,
1802 next_test);
1803
1804 // return_bci is equal to bci[n]. Increment the count.
1805 increment_mdp_data_at(mdp, in_bytes(RetData::bci_count_offset(row)));
1806
1807 // The method data pointer needs to be updated to reflect the new target.
1808 update_mdp_by_offset(mdp,
1809 in_bytes(RetData::bci_displacement_offset(row)));
1810 jmp(profile_continue);
1811 bind(next_test);
1812 }
1813
1814 update_mdp_for_ret(return_bci);
1815
1816 bind(profile_continue);
1817 }
1818 }
1819
1820
1821 void InterpreterMacroAssembler::profile_null_seen(Register mdp) {
1822 if (ProfileInterpreter) {
1823 Label profile_continue;
1824
1825 // If no method data exists, go to profile_continue.
1826 test_method_data_pointer(mdp, profile_continue);
1827
1828 set_mdp_flag_at(mdp, BitData::null_seen_byte_constant());
1829
1830 // The method data pointer needs to be updated.
1831 int mdp_delta = in_bytes(BitData::bit_data_size());
1832 if (TypeProfileCasts) {
1833 mdp_delta = in_bytes(VirtualCallData::virtual_call_data_size());
1834 }
1835 update_mdp_by_constant(mdp, mdp_delta);
1836
1837 bind(profile_continue);
1838 }
1839 }
1840
1841
1842 void InterpreterMacroAssembler::profile_typecheck(Register mdp, Register klass, Register reg2) {
1843 if (ProfileInterpreter) {
1844 Label profile_continue;
1845
1846 // If no method data exists, go to profile_continue.
1847 test_method_data_pointer(mdp, profile_continue);
1848
1849 // The method data pointer needs to be updated.
1850 int mdp_delta = in_bytes(BitData::bit_data_size());
1851 if (TypeProfileCasts) {
1852 mdp_delta = in_bytes(VirtualCallData::virtual_call_data_size());
1853
1854 // Record the object type.
1855 record_klass_in_profile(klass, mdp, reg2, false);
1856 NOT_LP64(assert(reg2 == rdi, "we know how to fix this blown reg");)
1857 NOT_LP64(restore_locals();) // Restore EDI
1858 }
1859 update_mdp_by_constant(mdp, mdp_delta);
1860
1861 bind(profile_continue);
1862 }
1863 }
1864
1865
1866 void InterpreterMacroAssembler::profile_switch_default(Register mdp) {
1867 if (ProfileInterpreter) {
1868 Label profile_continue;
1869
1870 // If no method data exists, go to profile_continue.
1871 test_method_data_pointer(mdp, profile_continue);
1872
1873 // Update the default case count
1874 increment_mdp_data_at(mdp,
1875 in_bytes(MultiBranchData::default_count_offset()));
1876
1877 // The method data pointer needs to be updated.
1878 update_mdp_by_offset(mdp,
1879 in_bytes(MultiBranchData::
1880 default_displacement_offset()));
1881
1882 bind(profile_continue);
1883 }
1884 }
1885
1886
1887 void InterpreterMacroAssembler::profile_switch_case(Register index,
1888 Register mdp,
1889 Register reg2) {
1890 if (ProfileInterpreter) {
1891 Label profile_continue;
1892
1893 // If no method data exists, go to profile_continue.
1894 test_method_data_pointer(mdp, profile_continue);
1895
1896 // Build the base (index * per_case_size_in_bytes()) +
1897 // case_array_offset_in_bytes()
1898 movl(reg2, in_bytes(MultiBranchData::per_case_size()));
1899 imulptr(index, reg2); // XXX l ?
1900 addptr(index, in_bytes(MultiBranchData::case_array_offset())); // XXX l ?
1901
1902 // Update the case count
1903 increment_mdp_data_at(mdp,
1904 index,
1905 in_bytes(MultiBranchData::relative_count_offset()));
1906
1907 // The method data pointer needs to be updated.
1908 update_mdp_by_offset(mdp,
1909 index,
1910 in_bytes(MultiBranchData::
1911 relative_displacement_offset()));
1912
1913 bind(profile_continue);
1914 }
1915 }
1916
1917
1918
1919 void InterpreterMacroAssembler::_interp_verify_oop(Register reg, TosState state, const char* file, int line) {
1920 if (state == atos) {
1921 MacroAssembler::_verify_oop_checked(reg, "broken oop", file, line);
1922 }
1923 }
1924
1925 void InterpreterMacroAssembler::verify_FPU(int stack_depth, TosState state) {
1926 #ifndef _LP64
1927 if ((state == ftos && UseSSE < 1) ||
1928 (state == dtos && UseSSE < 2)) {
1929 MacroAssembler::verify_FPU(stack_depth);
1930 }
1931 #endif
1932 }
1933
1934 // Jump if ((*counter_addr += increment) & mask) == 0
1935 void InterpreterMacroAssembler::increment_mask_and_jump(Address counter_addr, Address mask,
1936 Register scratch, Label* where) {
1937 // This update is actually not atomic and can lose a number of updates
1938 // under heavy contention, but the alternative of using the (contended)
1939 // atomic update here penalizes profiling paths too much.
1940 movl(scratch, counter_addr);
1941 incrementl(scratch, InvocationCounter::count_increment);
1942 movl(counter_addr, scratch);
1943 andl(scratch, mask);
1944 if (where != nullptr) {
1945 jcc(Assembler::zero, *where);
1946 }
1947 }
1948
1949 void InterpreterMacroAssembler::notify_method_entry() {
1950 // Whenever JVMTI is interp_only_mode, method entry/exit events are sent to
1951 // track stack depth. If it is possible to enter interp_only_mode we add
1952 // the code to check if the event should be sent.
1953 Register rthread = LP64_ONLY(r15_thread) NOT_LP64(rcx);
1954 Register rarg = LP64_ONLY(c_rarg1) NOT_LP64(rbx);
1955 if (JvmtiExport::can_post_interpreter_events()) {
1956 Label L;
1957 NOT_LP64(get_thread(rthread);)
1958 movl(rdx, Address(rthread, JavaThread::interp_only_mode_offset()));
1959 testl(rdx, rdx);
1960 jcc(Assembler::zero, L);
1961 call_VM(noreg, CAST_FROM_FN_PTR(address,
1962 InterpreterRuntime::post_method_entry));
1963 bind(L);
1964 }
1965
1966 {
1967 SkipIfEqual skip(this, &DTraceMethodProbes, false, rscratch1);
1968 NOT_LP64(get_thread(rthread);)
1969 get_method(rarg);
1970 call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry),
1971 rthread, rarg);
1972 }
1973
1974 // RedefineClasses() tracing support for obsolete method entry
1975 if (log_is_enabled(Trace, redefine, class, obsolete)) {
1976 NOT_LP64(get_thread(rthread);)
1977 get_method(rarg);
1978 call_VM_leaf(
1979 CAST_FROM_FN_PTR(address, SharedRuntime::rc_trace_method_entry),
1980 rthread, rarg);
1981 }
1982 }
1983
1984
1985 void InterpreterMacroAssembler::notify_method_exit(
1986 TosState state, NotifyMethodExitMode mode) {
1987 // Whenever JVMTI is interp_only_mode, method entry/exit events are sent to
1988 // track stack depth. If it is possible to enter interp_only_mode we add
1989 // the code to check if the event should be sent.
1990 Register rthread = LP64_ONLY(r15_thread) NOT_LP64(rcx);
1991 Register rarg = LP64_ONLY(c_rarg1) NOT_LP64(rbx);
1992 if (mode == NotifyJVMTI && JvmtiExport::can_post_interpreter_events()) {
1993 Label L;
1994 // Note: frame::interpreter_frame_result has a dependency on how the
1995 // method result is saved across the call to post_method_exit. If this
1996 // is changed then the interpreter_frame_result implementation will
1997 // need to be updated too.
1998
1999 // template interpreter will leave the result on the top of the stack.
2000 push(state);
2001 NOT_LP64(get_thread(rthread);)
2002 movl(rdx, Address(rthread, JavaThread::interp_only_mode_offset()));
2003 testl(rdx, rdx);
2004 jcc(Assembler::zero, L);
2005 call_VM(noreg,
2006 CAST_FROM_FN_PTR(address, InterpreterRuntime::post_method_exit));
2007 bind(L);
2008 pop(state);
2009 }
2010
2011 {
2012 SkipIfEqual skip(this, &DTraceMethodProbes, false, rscratch1);
2013 push(state);
2014 NOT_LP64(get_thread(rthread);)
2015 get_method(rarg);
2016 call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit),
2017 rthread, rarg);
2018 pop(state);
2019 }
2020 }
2021
2022 void InterpreterMacroAssembler::load_resolved_indy_entry(Register cache, Register index) {
2023 // Get index out of bytecode pointer
2024 get_cache_index_at_bcp(index, 1, sizeof(u4));
2025 // Get address of invokedynamic array
2026 movptr(cache, Address(rbp, frame::interpreter_frame_cache_offset * wordSize));
2027 movptr(cache, Address(cache, in_bytes(ConstantPoolCache::invokedynamic_entries_offset())));
2028 if (is_power_of_2(sizeof(ResolvedIndyEntry))) {
2029 shll(index, log2i_exact(sizeof(ResolvedIndyEntry))); // Scale index by power of 2
2030 } else {
2031 imull(index, index, sizeof(ResolvedIndyEntry)); // Scale the index to be the entry index * sizeof(ResolvedIndyEntry)
2032 }
2033 lea(cache, Address(cache, index, Address::times_1, Array<ResolvedIndyEntry>::base_offset_in_bytes()));
2034 }
2035
2036 void InterpreterMacroAssembler::load_field_entry(Register cache, Register index, int bcp_offset) {
2037 // Get index out of bytecode pointer
2038 movptr(cache, Address(rbp, frame::interpreter_frame_cache_offset * wordSize));
2039 get_cache_index_at_bcp(index, bcp_offset, sizeof(u2));
2040
2041 movptr(cache, Address(cache, ConstantPoolCache::field_entries_offset()));
2042 // Take shortcut if the size is a power of 2
2043 if (is_power_of_2(sizeof(ResolvedFieldEntry))) {
2044 shll(index, log2i_exact(sizeof(ResolvedFieldEntry))); // Scale index by power of 2
2045 } else {
2046 imull(index, index, sizeof(ResolvedFieldEntry)); // Scale the index to be the entry index * sizeof(ResolvedFieldEntry)
2047 }
2048 lea(cache, Address(cache, index, Address::times_1, Array<ResolvedFieldEntry>::base_offset_in_bytes()));
2049 }
2050
2051 void InterpreterMacroAssembler::load_method_entry(Register cache, Register index, int bcp_offset) {
2052 // Get index out of bytecode pointer
2053 movptr(cache, Address(rbp, frame::interpreter_frame_cache_offset * wordSize));
2054 get_cache_index_at_bcp(index, bcp_offset, sizeof(u2));
2055
2056 movptr(cache, Address(cache, ConstantPoolCache::method_entries_offset()));
2057 imull(index, index, sizeof(ResolvedMethodEntry)); // Scale the index to be the entry index * sizeof(ResolvedMethodEntry)
2058 lea(cache, Address(cache, index, Address::times_1, Array<ResolvedMethodEntry>::base_offset_in_bytes()));
2059 }