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