1 /*
2 * Copyright (c) 2003, 2016, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2014, 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.hpp"
28 #include "interpreter/bytecodeHistogram.hpp"
29 #include "interpreter/interpreter.hpp"
30 #include "interpreter/interpreterRuntime.hpp"
31 #include "interpreter/interp_masm.hpp"
32 #include "interpreter/templateInterpreterGenerator.hpp"
33 #include "interpreter/templateTable.hpp"
34 #include "interpreter/bytecodeTracer.hpp"
35 #include "memory/resourceArea.hpp"
36 #include "oops/arrayOop.hpp"
37 #include "oops/methodData.hpp"
38 #include "oops/method.hpp"
39 #include "oops/oop.inline.hpp"
40 #include "prims/jvmtiExport.hpp"
41 #include "prims/jvmtiThreadState.hpp"
42 #include "runtime/arguments.hpp"
43 #include "runtime/deoptimization.hpp"
44 #include "runtime/frame.inline.hpp"
45 #include "runtime/sharedRuntime.hpp"
46 #include "runtime/stubRoutines.hpp"
47 #include "runtime/synchronizer.hpp"
48 #include "runtime/timer.hpp"
49 #include "runtime/vframeArray.hpp"
50 #include "utilities/debug.hpp"
51 #include <sys/types.h>
52
53 #ifndef PRODUCT
54 #include "oops/method.hpp"
55 #endif // !PRODUCT
56
57 #ifdef BUILTIN_SIM
58 #include "../../../../../../simulator/simulator.hpp"
59 #endif
60
61 // Size of interpreter code. Increase if too small. Interpreter will
62 // fail with a guarantee ("not enough space for interpreter generation");
63 // if too small.
64 // Run with +PrintInterpreter to get the VM to print out the size.
65 // Max size with JVMTI
66 int TemplateInterpreter::InterpreterCodeSize = 200 * 1024;
67
68 #define __ _masm->
69
70 //-----------------------------------------------------------------------------
71
72 extern "C" void entry(CodeBuffer*);
73
74 //-----------------------------------------------------------------------------
75
76 address TemplateInterpreterGenerator::generate_slow_signature_handler() {
77 address entry = __ pc();
78
79 __ andr(esp, esp, -16);
80 __ mov(c_rarg3, esp);
81 // rmethod
82 // rlocals
83 // c_rarg3: first stack arg - wordSize
84
85 // adjust sp
86 __ sub(sp, c_rarg3, 18 * wordSize);
87 __ str(lr, Address(__ pre(sp, -2 * wordSize)));
88 __ call_VM(noreg,
89 CAST_FROM_FN_PTR(address,
90 InterpreterRuntime::slow_signature_handler),
91 rmethod, rlocals, c_rarg3);
92
93 // r0: result handler
94
95 // Stack layout:
96 // rsp: return address <- sp
97 // 1 garbage
98 // 8 integer args (if static first is unused)
99 // 1 float/double identifiers
100 // 8 double args
101 // stack args <- esp
102 // garbage
103 // expression stack bottom
104 // bcp (NULL)
105 // ...
106
107 // Restore LR
108 __ ldr(lr, Address(__ post(sp, 2 * wordSize)));
109
110 // Do FP first so we can use c_rarg3 as temp
111 __ ldrw(c_rarg3, Address(sp, 9 * wordSize)); // float/double identifiers
112
113 for (int i = 0; i < Argument::n_float_register_parameters_c; i++) {
114 const FloatRegister r = as_FloatRegister(i);
115
116 Label d, done;
117
118 __ tbnz(c_rarg3, i, d);
119 __ ldrs(r, Address(sp, (10 + i) * wordSize));
120 __ b(done);
121 __ bind(d);
122 __ ldrd(r, Address(sp, (10 + i) * wordSize));
123 __ bind(done);
124 }
125
126 // c_rarg0 contains the result from the call of
127 // InterpreterRuntime::slow_signature_handler so we don't touch it
128 // here. It will be loaded with the JNIEnv* later.
129 __ ldr(c_rarg1, Address(sp, 1 * wordSize));
130 for (int i = c_rarg2->encoding(); i <= c_rarg7->encoding(); i += 2) {
131 Register rm = as_Register(i), rn = as_Register(i+1);
132 __ ldp(rm, rn, Address(sp, i * wordSize));
133 }
134
135 __ add(sp, sp, 18 * wordSize);
136 __ ret(lr);
137
138 return entry;
139 }
140
141
142 //
143 // Various method entries
144 //
145
146 address TemplateInterpreterGenerator::generate_math_entry(AbstractInterpreter::MethodKind kind) {
147 // rmethod: Method*
148 // r13: sender sp
149 // esp: args
150
151 if (!InlineIntrinsics) return NULL; // Generate a vanilla entry
152
153 // These don't need a safepoint check because they aren't virtually
154 // callable. We won't enter these intrinsics from compiled code.
155 // If in the future we added an intrinsic which was virtually callable
156 // we'd have to worry about how to safepoint so that this code is used.
157
158 // mathematical functions inlined by compiler
159 // (interpreter must provide identical implementation
160 // in order to avoid monotonicity bugs when switching
161 // from interpreter to compiler in the middle of some
162 // computation)
163 //
164 // stack:
165 // [ arg ] <-- esp
166 // [ arg ]
167 // retaddr in lr
168
169 address entry_point = NULL;
170 Register continuation = lr;
171 switch (kind) {
172 case Interpreter::java_lang_math_abs:
173 entry_point = __ pc();
174 __ ldrd(v0, Address(esp));
175 __ fabsd(v0, v0);
176 __ mov(sp, r13); // Restore caller's SP
177 break;
178 case Interpreter::java_lang_math_sqrt:
179 entry_point = __ pc();
180 __ ldrd(v0, Address(esp));
181 __ fsqrtd(v0, v0);
182 __ mov(sp, r13);
183 break;
184 case Interpreter::java_lang_math_sin :
185 case Interpreter::java_lang_math_cos :
186 case Interpreter::java_lang_math_tan :
187 case Interpreter::java_lang_math_log :
188 case Interpreter::java_lang_math_log10 :
189 case Interpreter::java_lang_math_exp :
190 entry_point = __ pc();
191 __ ldrd(v0, Address(esp));
192 __ mov(sp, r13);
193 __ mov(r19, lr);
194 continuation = r19; // The first callee-saved register
195 generate_transcendental_entry(kind, 1);
196 break;
197 case Interpreter::java_lang_math_pow :
198 entry_point = __ pc();
199 __ mov(r19, lr);
200 continuation = r19;
201 __ ldrd(v0, Address(esp, 2 * Interpreter::stackElementSize));
202 __ ldrd(v1, Address(esp));
203 __ mov(sp, r13);
204 generate_transcendental_entry(kind, 2);
205 break;
206 default:
207 ;
208 }
209 if (entry_point) {
210 __ br(continuation);
211 }
212
213 return entry_point;
214 }
215
216 // double trigonometrics and transcendentals
217 // static jdouble dsin(jdouble x);
218 // static jdouble dcos(jdouble x);
219 // static jdouble dtan(jdouble x);
220 // static jdouble dlog(jdouble x);
221 // static jdouble dlog10(jdouble x);
222 // static jdouble dexp(jdouble x);
223 // static jdouble dpow(jdouble x, jdouble y);
224
225 void TemplateInterpreterGenerator::generate_transcendental_entry(AbstractInterpreter::MethodKind kind, int fpargs) {
226 address fn;
227 switch (kind) {
228 case Interpreter::java_lang_math_sin :
229 fn = CAST_FROM_FN_PTR(address, SharedRuntime::dsin);
230 break;
231 case Interpreter::java_lang_math_cos :
232 fn = CAST_FROM_FN_PTR(address, SharedRuntime::dcos);
233 break;
234 case Interpreter::java_lang_math_tan :
235 fn = CAST_FROM_FN_PTR(address, SharedRuntime::dtan);
236 break;
237 case Interpreter::java_lang_math_log :
238 fn = CAST_FROM_FN_PTR(address, SharedRuntime::dlog);
239 break;
240 case Interpreter::java_lang_math_log10 :
241 fn = CAST_FROM_FN_PTR(address, SharedRuntime::dlog10);
242 break;
243 case Interpreter::java_lang_math_exp :
244 fn = CAST_FROM_FN_PTR(address, SharedRuntime::dexp);
245 break;
246 case Interpreter::java_lang_math_pow :
247 fpargs = 2;
248 fn = CAST_FROM_FN_PTR(address, SharedRuntime::dpow);
249 break;
250 default:
251 ShouldNotReachHere();
252 fn = NULL; // unreachable
253 }
254 const int gpargs = 0, rtype = 3;
255 __ mov(rscratch1, fn);
256 __ blrt(rscratch1, gpargs, fpargs, rtype);
257 }
258
259 // Abstract method entry
260 // Attempt to execute abstract method. Throw exception
261 address TemplateInterpreterGenerator::generate_abstract_entry(void) {
262 // rmethod: Method*
263 // r13: sender SP
264
265 address entry_point = __ pc();
266
267 // abstract method entry
268
269 // pop return address, reset last_sp to NULL
270 __ empty_expression_stack();
271 __ restore_bcp(); // bcp must be correct for exception handler (was destroyed)
272 __ restore_locals(); // make sure locals pointer is correct as well (was destroyed)
273
274 // throw exception
275 __ call_VM(noreg, CAST_FROM_FN_PTR(address,
276 InterpreterRuntime::throw_AbstractMethodError));
277 // the call_VM checks for exception, so we should never return here.
278 __ should_not_reach_here();
279
280 return entry_point;
281 }
282
283 address TemplateInterpreterGenerator::generate_StackOverflowError_handler() {
284 address entry = __ pc();
285
286 #ifdef ASSERT
287 {
288 Label L;
289 __ ldr(rscratch1, Address(rfp,
290 frame::interpreter_frame_monitor_block_top_offset *
291 wordSize));
292 __ mov(rscratch2, sp);
293 __ cmp(rscratch1, rscratch2); // maximal rsp for current rfp (stack
294 // grows negative)
295 __ br(Assembler::HS, L); // check if frame is complete
296 __ stop ("interpreter frame not set up");
297 __ bind(L);
298 }
299 #endif // ASSERT
300 // Restore bcp under the assumption that the current frame is still
301 // interpreted
302 __ restore_bcp();
303
304 // expression stack must be empty before entering the VM if an
305 // exception happened
306 __ empty_expression_stack();
307 // throw exception
308 __ call_VM(noreg,
309 CAST_FROM_FN_PTR(address,
310 InterpreterRuntime::throw_StackOverflowError));
311 return entry;
312 }
313
314 address TemplateInterpreterGenerator::generate_ArrayIndexOutOfBounds_handler(
315 const char* name) {
316 address entry = __ pc();
317 // expression stack must be empty before entering the VM if an
318 // exception happened
319 __ empty_expression_stack();
320 // setup parameters
321 // ??? convention: expect aberrant index in register r1
322 __ movw(c_rarg2, r1);
323 __ mov(c_rarg1, (address)name);
324 __ call_VM(noreg,
325 CAST_FROM_FN_PTR(address,
326 InterpreterRuntime::
327 throw_ArrayIndexOutOfBoundsException),
328 c_rarg1, c_rarg2);
329 return entry;
330 }
331
332 address TemplateInterpreterGenerator::generate_ClassCastException_handler() {
333 address entry = __ pc();
334
335 // object is at TOS
336 __ pop(c_rarg1);
337
338 // expression stack must be empty before entering the VM if an
339 // exception happened
340 __ empty_expression_stack();
341
342 __ call_VM(noreg,
343 CAST_FROM_FN_PTR(address,
344 InterpreterRuntime::
345 throw_ClassCastException),
346 c_rarg1);
347 return entry;
348 }
349
350 address TemplateInterpreterGenerator::generate_exception_handler_common(
351 const char* name, const char* message, bool pass_oop) {
352 assert(!pass_oop || message == NULL, "either oop or message but not both");
353 address entry = __ pc();
354 if (pass_oop) {
355 // object is at TOS
356 __ pop(c_rarg2);
357 }
358 // expression stack must be empty before entering the VM if an
359 // exception happened
360 __ empty_expression_stack();
361 // setup parameters
362 __ lea(c_rarg1, Address((address)name));
363 if (pass_oop) {
364 __ call_VM(r0, CAST_FROM_FN_PTR(address,
365 InterpreterRuntime::
366 create_klass_exception),
367 c_rarg1, c_rarg2);
368 } else {
369 // kind of lame ExternalAddress can't take NULL because
370 // external_word_Relocation will assert.
371 if (message != NULL) {
372 __ lea(c_rarg2, Address((address)message));
373 } else {
374 __ mov(c_rarg2, NULL_WORD);
375 }
376 __ call_VM(r0,
377 CAST_FROM_FN_PTR(address, InterpreterRuntime::create_exception),
378 c_rarg1, c_rarg2);
379 }
380 // throw exception
381 __ b(address(Interpreter::throw_exception_entry()));
382 return entry;
383 }
384
385 address TemplateInterpreterGenerator::generate_continuation_for(TosState state) {
386 address entry = __ pc();
387 // NULL last_sp until next java call
388 __ str(zr, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize));
389 __ dispatch_next(state);
390 return entry;
391 }
392
393 address TemplateInterpreterGenerator::generate_return_entry_for(TosState state, int step, size_t index_size) {
394 address entry = __ pc();
395
396 // Restore stack bottom in case i2c adjusted stack
397 __ ldr(esp, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize));
398 // and NULL it as marker that esp is now tos until next java call
399 __ str(zr, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize));
400 __ restore_bcp();
401 __ restore_locals();
402 __ restore_constant_pool_cache();
403 __ get_method(rmethod);
404
405 // Pop N words from the stack
406 __ get_cache_and_index_at_bcp(r1, r2, 1, index_size);
407 __ ldr(r1, Address(r1, ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::flags_offset()));
408 __ andr(r1, r1, ConstantPoolCacheEntry::parameter_size_mask);
409
410 __ add(esp, esp, r1, Assembler::LSL, 3);
411
412 // Restore machine SP
413 __ ldr(rscratch1, Address(rmethod, Method::const_offset()));
414 __ ldrh(rscratch1, Address(rscratch1, ConstMethod::max_stack_offset()));
415 __ add(rscratch1, rscratch1, frame::interpreter_frame_monitor_size() + 2);
416 __ ldr(rscratch2,
417 Address(rfp, frame::interpreter_frame_initial_sp_offset * wordSize));
418 __ sub(rscratch1, rscratch2, rscratch1, ext::uxtw, 3);
419 __ andr(sp, rscratch1, -16);
420
421 #ifndef PRODUCT
422 // tell the simulator that the method has been reentered
423 if (NotifySimulator) {
424 __ notify(Assembler::method_reentry);
425 }
426 #endif
427 __ get_dispatch();
428 __ dispatch_next(state, step);
429
430 return entry;
431 }
432
433 address TemplateInterpreterGenerator::generate_deopt_entry_for(TosState state,
434 int step) {
435 address entry = __ pc();
436 __ restore_bcp();
437 __ restore_locals();
438 __ restore_constant_pool_cache();
439 __ get_method(rmethod);
440 __ get_dispatch();
441
442 // Calculate stack limit
443 __ ldr(rscratch1, Address(rmethod, Method::const_offset()));
444 __ ldrh(rscratch1, Address(rscratch1, ConstMethod::max_stack_offset()));
445 __ add(rscratch1, rscratch1, frame::interpreter_frame_monitor_size() + 2);
446 __ ldr(rscratch2,
447 Address(rfp, frame::interpreter_frame_initial_sp_offset * wordSize));
448 __ sub(rscratch1, rscratch2, rscratch1, ext::uxtx, 3);
449 __ andr(sp, rscratch1, -16);
450
451 // Restore expression stack pointer
452 __ ldr(esp, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize));
453 // NULL last_sp until next java call
454 __ str(zr, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize));
455
456 #if INCLUDE_JVMCI
457 // Check if we need to take lock at entry of synchronized method.
458 if (UseJVMCICompiler) {
459 Label L;
460 __ ldr(rscratch1, Address(rthread, Thread::pending_exception_offset()));
461 __ cbz(rscratch1, L);
462 // Clear flag.
463 __ strb(zr, Address(rthread, JavaThread::pending_monitorenter_offset()));
464 // Take lock.
465 lock_method();
466 __ bind(L);
467 }
468 #endif
469 // handle exceptions
470 {
471 Label L;
472 __ ldr(rscratch1, Address(rthread, Thread::pending_exception_offset()));
473 __ cbz(rscratch1, L);
474 __ call_VM(noreg,
475 CAST_FROM_FN_PTR(address,
476 InterpreterRuntime::throw_pending_exception));
477 __ should_not_reach_here();
478 __ bind(L);
479 }
480
481 __ dispatch_next(state, step);
482 return entry;
483 }
484
485 address TemplateInterpreterGenerator::generate_result_handler_for(
486 BasicType type) {
487 address entry = __ pc();
488 switch (type) {
489 case T_BOOLEAN: __ uxtb(r0, r0); break;
490 case T_CHAR : __ uxth(r0, r0); break;
491 case T_BYTE : __ sxtb(r0, r0); break;
492 case T_SHORT : __ sxth(r0, r0); break;
493 case T_INT : __ uxtw(r0, r0); break; // FIXME: We almost certainly don't need this
494 case T_LONG : /* nothing to do */ break;
495 case T_VOID : /* nothing to do */ break;
496 case T_FLOAT : /* nothing to do */ break;
497 case T_DOUBLE : /* nothing to do */ break;
498 case T_OBJECT :
499 // retrieve result from frame
500 __ ldr(r0, Address(rfp, frame::interpreter_frame_oop_temp_offset*wordSize));
501 // and verify it
502 __ verify_oop(r0);
503 break;
504 default : ShouldNotReachHere();
505 }
506 __ ret(lr); // return from result handler
507 return entry;
508 }
509
510 address TemplateInterpreterGenerator::generate_safept_entry_for(
511 TosState state,
512 address runtime_entry) {
513 address entry = __ pc();
514 __ push(state);
515 __ call_VM(noreg, runtime_entry);
516 __ membar(Assembler::AnyAny);
517 __ dispatch_via(vtos, Interpreter::_normal_table.table_for(vtos));
518 return entry;
519 }
520
521 // Helpers for commoning out cases in the various type of method entries.
522 //
523
524
525 // increment invocation count & check for overflow
526 //
527 // Note: checking for negative value instead of overflow
528 // so we have a 'sticky' overflow test
529 //
530 // rmethod: method
531 //
532 void TemplateInterpreterGenerator::generate_counter_incr(
533 Label* overflow,
534 Label* profile_method,
535 Label* profile_method_continue) {
536 Label done;
537 // Note: In tiered we increment either counters in Method* or in MDO depending if we're profiling or not.
538 if (TieredCompilation) {
539 int increment = InvocationCounter::count_increment;
540 Label no_mdo;
541 if (ProfileInterpreter) {
542 // Are we profiling?
543 __ ldr(r0, Address(rmethod, Method::method_data_offset()));
544 __ cbz(r0, no_mdo);
545 // Increment counter in the MDO
546 const Address mdo_invocation_counter(r0, in_bytes(MethodData::invocation_counter_offset()) +
547 in_bytes(InvocationCounter::counter_offset()));
548 const Address mask(r0, in_bytes(MethodData::invoke_mask_offset()));
549 __ increment_mask_and_jump(mdo_invocation_counter, increment, mask, rscratch1, rscratch2, false, Assembler::EQ, overflow);
550 __ b(done);
551 }
552 __ bind(no_mdo);
553 // Increment counter in MethodCounters
554 const Address invocation_counter(rscratch2,
555 MethodCounters::invocation_counter_offset() +
556 InvocationCounter::counter_offset());
557 __ get_method_counters(rmethod, rscratch2, done);
558 const Address mask(rscratch2, in_bytes(MethodCounters::invoke_mask_offset()));
559 __ increment_mask_and_jump(invocation_counter, increment, mask, rscratch1, r1, false, Assembler::EQ, overflow);
560 __ bind(done);
561 } else { // not TieredCompilation
562 const Address backedge_counter(rscratch2,
563 MethodCounters::backedge_counter_offset() +
564 InvocationCounter::counter_offset());
565 const Address invocation_counter(rscratch2,
566 MethodCounters::invocation_counter_offset() +
567 InvocationCounter::counter_offset());
568
569 __ get_method_counters(rmethod, rscratch2, done);
570
571 if (ProfileInterpreter) { // %%% Merge this into MethodData*
572 __ ldrw(r1, Address(rscratch2, MethodCounters::interpreter_invocation_counter_offset()));
573 __ addw(r1, r1, 1);
574 __ strw(r1, Address(rscratch2, MethodCounters::interpreter_invocation_counter_offset()));
575 }
576 // Update standard invocation counters
577 __ ldrw(r1, invocation_counter);
578 __ ldrw(r0, backedge_counter);
579
580 __ addw(r1, r1, InvocationCounter::count_increment);
581 __ andw(r0, r0, InvocationCounter::count_mask_value);
582
583 __ strw(r1, invocation_counter);
584 __ addw(r0, r0, r1); // add both counters
585
586 // profile_method is non-null only for interpreted method so
587 // profile_method != NULL == !native_call
588
589 if (ProfileInterpreter && profile_method != NULL) {
590 // Test to see if we should create a method data oop
591 __ ldr(rscratch2, Address(rmethod, Method::method_counters_offset()));
592 __ ldrw(rscratch2, Address(rscratch2, in_bytes(MethodCounters::interpreter_profile_limit_offset())));
593 __ cmpw(r0, rscratch2);
594 __ br(Assembler::LT, *profile_method_continue);
595
596 // if no method data exists, go to profile_method
597 __ test_method_data_pointer(rscratch2, *profile_method);
598 }
599
600 {
601 __ ldr(rscratch2, Address(rmethod, Method::method_counters_offset()));
602 __ ldrw(rscratch2, Address(rscratch2, in_bytes(MethodCounters::interpreter_invocation_limit_offset())));
603 __ cmpw(r0, rscratch2);
604 __ br(Assembler::HS, *overflow);
605 }
606 __ bind(done);
607 }
608 }
609
610 void TemplateInterpreterGenerator::generate_counter_overflow(Label& do_continue) {
611
612 // Asm interpreter on entry
613 // On return (i.e. jump to entry_point) [ back to invocation of interpreter ]
614 // Everything as it was on entry
615
616 // InterpreterRuntime::frequency_counter_overflow takes two
617 // arguments, the first (thread) is passed by call_VM, the second
618 // indicates if the counter overflow occurs at a backwards branch
619 // (NULL bcp). We pass zero for it. The call returns the address
620 // of the verified entry point for the method or NULL if the
621 // compilation did not complete (either went background or bailed
622 // out).
623 __ mov(c_rarg1, 0);
624 __ call_VM(noreg,
625 CAST_FROM_FN_PTR(address,
626 InterpreterRuntime::frequency_counter_overflow),
627 c_rarg1);
628
629 __ b(do_continue);
630 }
631
632 // See if we've got enough room on the stack for locals plus overhead
633 // below JavaThread::stack_overflow_limit(). If not, throw a StackOverflowError
634 // without going through the signal handler, i.e., reserved and yellow zones
635 // will not be made usable. The shadow zone must suffice to handle the
636 // overflow.
637 // The expression stack grows down incrementally, so the normal guard
638 // page mechanism will work for that.
639 //
640 // NOTE: Since the additional locals are also always pushed (wasn't
641 // obvious in generate_method_entry) so the guard should work for them
642 // too.
643 //
644 // Args:
645 // r3: number of additional locals this frame needs (what we must check)
646 // rmethod: Method*
647 //
648 // Kills:
649 // r0
650 void TemplateInterpreterGenerator::generate_stack_overflow_check(void) {
651
652 // monitor entry size: see picture of stack set
653 // (generate_method_entry) and frame_amd64.hpp
654 const int entry_size = frame::interpreter_frame_monitor_size() * wordSize;
655
656 // total overhead size: entry_size + (saved rbp through expr stack
657 // bottom). be sure to change this if you add/subtract anything
658 // to/from the overhead area
659 const int overhead_size =
660 -(frame::interpreter_frame_initial_sp_offset * wordSize) + entry_size;
661
662 const int page_size = os::vm_page_size();
663
664 Label after_frame_check;
665
666 // see if the frame is greater than one page in size. If so,
667 // then we need to verify there is enough stack space remaining
668 // for the additional locals.
669 //
670 // Note that we use SUBS rather than CMP here because the immediate
671 // field of this instruction may overflow. SUBS can cope with this
672 // because it is a macro that will expand to some number of MOV
673 // instructions and a register operation.
674 __ subs(rscratch1, r3, (page_size - overhead_size) / Interpreter::stackElementSize);
675 __ br(Assembler::LS, after_frame_check);
676
677 // compute rsp as if this were going to be the last frame on
678 // the stack before the red zone
679
680 // locals + overhead, in bytes
681 __ mov(r0, overhead_size);
682 __ add(r0, r0, r3, Assembler::LSL, Interpreter::logStackElementSize); // 2 slots per parameter.
683
684 const Address stack_limit(rthread, JavaThread::stack_overflow_limit_offset());
685 __ ldr(rscratch1, stack_limit);
686
687 #ifdef ASSERT
688 Label limit_okay;
689 // Verify that thread stack limit is non-zero.
690 __ cbnz(rscratch1, limit_okay);
691 __ stop("stack overflow limit is zero");
692 __ bind(limit_okay);
693 #endif
694
695 // Add stack limit to locals.
696 __ add(r0, r0, rscratch1);
697
698 // Check against the current stack bottom.
699 __ cmp(sp, r0);
700 __ br(Assembler::HI, after_frame_check);
701
702 // Remove the incoming args, peeling the machine SP back to where it
703 // was in the caller. This is not strictly necessary, but unless we
704 // do so the stack frame may have a garbage FP; this ensures a
705 // correct call stack that we can always unwind. The ANDR should be
706 // unnecessary because the sender SP in r13 is always aligned, but
707 // it doesn't hurt.
708 __ andr(sp, r13, -16);
709
710 // Note: the restored frame is not necessarily interpreted.
711 // Use the shared runtime version of the StackOverflowError.
712 assert(StubRoutines::throw_StackOverflowError_entry() != NULL, "stub not yet generated");
713 __ far_jump(RuntimeAddress(StubRoutines::throw_StackOverflowError_entry()));
714
715 // all done with frame size check
716 __ bind(after_frame_check);
717 }
718
719 // Allocate monitor and lock method (asm interpreter)
720 //
721 // Args:
722 // rmethod: Method*
723 // rlocals: locals
724 //
725 // Kills:
726 // r0
727 // c_rarg0, c_rarg1, c_rarg2, c_rarg3, ...(param regs)
728 // rscratch1, rscratch2 (scratch regs)
729 void TemplateInterpreterGenerator::lock_method() {
730 // synchronize method
731 const Address access_flags(rmethod, Method::access_flags_offset());
732 const Address monitor_block_top(
733 rfp,
734 frame::interpreter_frame_monitor_block_top_offset * wordSize);
735 const int entry_size = frame::interpreter_frame_monitor_size() * wordSize;
736
737 #ifdef ASSERT
738 {
739 Label L;
740 __ ldrw(r0, access_flags);
741 __ tst(r0, JVM_ACC_SYNCHRONIZED);
742 __ br(Assembler::NE, L);
743 __ stop("method doesn't need synchronization");
744 __ bind(L);
745 }
746 #endif // ASSERT
747
748 // get synchronization object
749 {
750 Label done;
751 __ ldrw(r0, access_flags);
752 __ tst(r0, JVM_ACC_STATIC);
753 // get receiver (assume this is frequent case)
754 __ ldr(r0, Address(rlocals, Interpreter::local_offset_in_bytes(0)));
755 __ br(Assembler::EQ, done);
756 __ load_mirror(r0, rmethod);
757
758 #ifdef ASSERT
759 {
760 Label L;
761 __ cbnz(r0, L);
762 __ stop("synchronization object is NULL");
763 __ bind(L);
764 }
765 #endif // ASSERT
766
767 __ bind(done);
768 oopDesc::bs()->interpreter_write_barrier(_masm, r0);
769 }
770
771 // add space for monitor & lock
772 __ sub(sp, sp, entry_size); // add space for a monitor entry
773 __ sub(esp, esp, entry_size);
774 __ mov(rscratch1, esp);
775 __ str(rscratch1, monitor_block_top); // set new monitor block top
776 // store object
777 __ str(r0, Address(esp, BasicObjectLock::obj_offset_in_bytes()));
778 __ mov(c_rarg1, esp); // object address
779 __ lock_object(c_rarg1);
780 }
781
782 // Generate a fixed interpreter frame. This is identical setup for
783 // interpreted methods and for native methods hence the shared code.
784 //
785 // Args:
786 // lr: return address
787 // rmethod: Method*
788 // rlocals: pointer to locals
789 // rcpool: cp cache
790 // stack_pointer: previous sp
791 void TemplateInterpreterGenerator::generate_fixed_frame(bool native_call) {
792 // initialize fixed part of activation frame
793 if (native_call) {
794 __ sub(esp, sp, 14 * wordSize);
795 __ mov(rbcp, zr);
796 __ stp(esp, zr, Address(__ pre(sp, -14 * wordSize)));
797 // add 2 zero-initialized slots for native calls
798 __ stp(zr, zr, Address(sp, 12 * wordSize));
799 } else {
800 __ sub(esp, sp, 12 * wordSize);
801 __ ldr(rscratch1, Address(rmethod, Method::const_offset())); // get ConstMethod
802 __ add(rbcp, rscratch1, in_bytes(ConstMethod::codes_offset())); // get codebase
803 __ stp(esp, rbcp, Address(__ pre(sp, -12 * wordSize)));
804 }
805
806 if (ProfileInterpreter) {
807 Label method_data_continue;
808 __ ldr(rscratch1, Address(rmethod, Method::method_data_offset()));
809 __ cbz(rscratch1, method_data_continue);
810 __ lea(rscratch1, Address(rscratch1, in_bytes(MethodData::data_offset())));
811 __ bind(method_data_continue);
812 __ stp(rscratch1, rmethod, Address(sp, 6 * wordSize)); // save Method* and mdp (method data pointer)
813 } else {
814 __ stp(zr, rmethod, Address(sp, 6 * wordSize)); // save Method* (no mdp)
815 }
816
817 // Get mirror and store it in the frame as GC root for this Method*
818 __ load_mirror(rscratch1, rmethod);
819 __ stp(rscratch1, zr, Address(sp, 4 * wordSize));
820
821 __ ldr(rcpool, Address(rmethod, Method::const_offset()));
822 __ ldr(rcpool, Address(rcpool, ConstMethod::constants_offset()));
823 __ ldr(rcpool, Address(rcpool, ConstantPool::cache_offset_in_bytes()));
824 __ stp(rlocals, rcpool, Address(sp, 2 * wordSize));
825
826 __ stp(rfp, lr, Address(sp, 10 * wordSize));
827 __ lea(rfp, Address(sp, 10 * wordSize));
828
829 // set sender sp
830 // leave last_sp as null
831 __ stp(zr, r13, Address(sp, 8 * wordSize));
832
833 // Move SP out of the way
834 if (! native_call) {
835 __ ldr(rscratch1, Address(rmethod, Method::const_offset()));
836 __ ldrh(rscratch1, Address(rscratch1, ConstMethod::max_stack_offset()));
837 __ add(rscratch1, rscratch1, frame::interpreter_frame_monitor_size() + 2);
838 __ sub(rscratch1, sp, rscratch1, ext::uxtw, 3);
839 __ andr(sp, rscratch1, -16);
840 }
841 }
842
843 // End of helpers
844
845 // Various method entries
846 //------------------------------------------------------------------------------------------------------------------------
847 //
848 //
849
850 // Method entry for java.lang.ref.Reference.get.
851 address TemplateInterpreterGenerator::generate_Reference_get_entry(void) {
852 #if INCLUDE_ALL_GCS
853 // Code: _aload_0, _getfield, _areturn
854 // parameter size = 1
855 //
856 // The code that gets generated by this routine is split into 2 parts:
857 // 1. The "intrinsified" code for G1 (or any SATB based GC),
858 // 2. The slow path - which is an expansion of the regular method entry.
859 //
860 // Notes:-
861 // * In the G1 code we do not check whether we need to block for
862 // a safepoint. If G1 is enabled then we must execute the specialized
863 // code for Reference.get (except when the Reference object is null)
864 // so that we can log the value in the referent field with an SATB
865 // update buffer.
866 // If the code for the getfield template is modified so that the
867 // G1 pre-barrier code is executed when the current method is
868 // Reference.get() then going through the normal method entry
869 // will be fine.
870 // * The G1 code can, however, check the receiver object (the instance
871 // of java.lang.Reference) and jump to the slow path if null. If the
872 // Reference object is null then we obviously cannot fetch the referent
873 // and so we don't need to call the G1 pre-barrier. Thus we can use the
874 // regular method entry code to generate the NPE.
875 //
876 // This code is based on generate_accessor_enty.
877 //
878 // rmethod: Method*
879 // r13: senderSP must preserve for slow path, set SP to it on fast path
880
881 address entry = __ pc();
882
883 const int referent_offset = java_lang_ref_Reference::referent_offset;
884 guarantee(referent_offset > 0, "referent offset not initialized");
885
886 if (UseG1GC || UseShenandoahGC) {
887 Label slow_path;
888 const Register local_0 = c_rarg0;
889 // Check if local 0 != NULL
890 // If the receiver is null then it is OK to jump to the slow path.
891 __ ldr(local_0, Address(esp, 0));
892 __ cbz(local_0, slow_path);
893
894 oopDesc::bs()->interpreter_read_barrier_not_null(_masm, local_0);
895
896 // Load the value of the referent field.
897 const Address field_address(local_0, referent_offset);
898 __ load_heap_oop(local_0, field_address);
899
900 // Generate the G1 pre-barrier code to log the value of
901 // the referent field in an SATB buffer.
902 __ enter(); // g1_write may call runtime
903 __ g1_write_barrier_pre(noreg /* obj */,
904 local_0 /* pre_val */,
905 rthread /* thread */,
906 rscratch2 /* tmp */,
907 true /* tosca_live */,
908 true /* expand_call */);
909 __ leave();
910 // areturn
911 __ andr(sp, r13, -16); // done with stack
912 __ ret(lr);
913
914 // generate a vanilla interpreter entry as the slow path
915 __ bind(slow_path);
916 __ jump_to_entry(Interpreter::entry_for_kind(Interpreter::zerolocals));
917 return entry;
918 }
919 #endif // INCLUDE_ALL_GCS
920
921 // If G1 is not enabled then attempt to go through the accessor entry point
922 // Reference.get is an accessor
923 return NULL;
924 }
925
926 /**
927 * Method entry for static native methods:
928 * int java.util.zip.CRC32.update(int crc, int b)
929 */
930 address TemplateInterpreterGenerator::generate_CRC32_update_entry() {
931 if (UseCRC32Intrinsics) {
932 address entry = __ pc();
933
934 // rmethod: Method*
935 // r13: senderSP must preserved for slow path
936 // esp: args
937
938 Label slow_path;
939 // If we need a safepoint check, generate full interpreter entry.
940 ExternalAddress state(SafepointSynchronize::address_of_state());
941 unsigned long offset;
942 __ adrp(rscratch1, ExternalAddress(SafepointSynchronize::address_of_state()), offset);
943 __ ldrw(rscratch1, Address(rscratch1, offset));
944 assert(SafepointSynchronize::_not_synchronized == 0, "rewrite this code");
945 __ cbnz(rscratch1, slow_path);
946
947 // We don't generate local frame and don't align stack because
948 // we call stub code and there is no safepoint on this path.
949
950 // Load parameters
951 const Register crc = c_rarg0; // crc
952 const Register val = c_rarg1; // source java byte value
953 const Register tbl = c_rarg2; // scratch
954
955 // Arguments are reversed on java expression stack
956 __ ldrw(val, Address(esp, 0)); // byte value
957 __ ldrw(crc, Address(esp, wordSize)); // Initial CRC
958
959 __ adrp(tbl, ExternalAddress(StubRoutines::crc_table_addr()), offset);
960 __ add(tbl, tbl, offset);
961
962 __ ornw(crc, zr, crc); // ~crc
963 __ update_byte_crc32(crc, val, tbl);
964 __ ornw(crc, zr, crc); // ~crc
965
966 // result in c_rarg0
967
968 __ andr(sp, r13, -16);
969 __ ret(lr);
970
971 // generate a vanilla native entry as the slow path
972 __ bind(slow_path);
973 __ jump_to_entry(Interpreter::entry_for_kind(Interpreter::native));
974 return entry;
975 }
976 return NULL;
977 }
978
979 /**
980 * Method entry for static native methods:
981 * int java.util.zip.CRC32.updateBytes(int crc, byte[] b, int off, int len)
982 * int java.util.zip.CRC32.updateByteBuffer(int crc, long buf, int off, int len)
983 */
984 address TemplateInterpreterGenerator::generate_CRC32_updateBytes_entry(AbstractInterpreter::MethodKind kind) {
985 if (UseCRC32Intrinsics) {
986 address entry = __ pc();
987
988 // rmethod,: Method*
989 // r13: senderSP must preserved for slow path
990
991 Label slow_path;
992 // If we need a safepoint check, generate full interpreter entry.
993 ExternalAddress state(SafepointSynchronize::address_of_state());
994 unsigned long offset;
995 __ adrp(rscratch1, ExternalAddress(SafepointSynchronize::address_of_state()), offset);
996 __ ldrw(rscratch1, Address(rscratch1, offset));
997 assert(SafepointSynchronize::_not_synchronized == 0, "rewrite this code");
998 __ cbnz(rscratch1, slow_path);
999
1000 // We don't generate local frame and don't align stack because
1001 // we call stub code and there is no safepoint on this path.
1002
1003 // Load parameters
1004 const Register crc = c_rarg0; // crc
1005 const Register buf = c_rarg1; // source java byte array address
1006 const Register len = c_rarg2; // length
1007 const Register off = len; // offset (never overlaps with 'len')
1008
1009 // Arguments are reversed on java expression stack
1010 // Calculate address of start element
1011 if (kind == Interpreter::java_util_zip_CRC32_updateByteBuffer) {
1012 __ ldr(buf, Address(esp, 2*wordSize)); // long buf
1013 __ ldrw(off, Address(esp, wordSize)); // offset
1014 __ add(buf, buf, off); // + offset
1015 __ ldrw(crc, Address(esp, 4*wordSize)); // Initial CRC
1016 } else {
1017 __ ldr(buf, Address(esp, 2*wordSize)); // byte[] array
1018 oopDesc::bs()->interpreter_read_barrier_not_null(_masm, buf);
1019 __ add(buf, buf, arrayOopDesc::base_offset_in_bytes(T_BYTE)); // + header size
1020 __ ldrw(off, Address(esp, wordSize)); // offset
1021 __ add(buf, buf, off); // + offset
1022 __ ldrw(crc, Address(esp, 3*wordSize)); // Initial CRC
1023 }
1024 // Can now load 'len' since we're finished with 'off'
1025 __ ldrw(len, Address(esp, 0x0)); // Length
1026
1027 __ andr(sp, r13, -16); // Restore the caller's SP
1028
1029 // We are frameless so we can just jump to the stub.
1030 __ b(CAST_FROM_FN_PTR(address, StubRoutines::updateBytesCRC32()));
1031
1032 // generate a vanilla native entry as the slow path
1033 __ bind(slow_path);
1034 __ jump_to_entry(Interpreter::entry_for_kind(Interpreter::native));
1035 return entry;
1036 }
1037 return NULL;
1038 }
1039
1040 // Not supported
1041 address TemplateInterpreterGenerator::generate_CRC32C_updateBytes_entry(AbstractInterpreter::MethodKind kind) {
1042 return NULL;
1043 }
1044
1045 void TemplateInterpreterGenerator::bang_stack_shadow_pages(bool native_call) {
1046 // Bang each page in the shadow zone. We can't assume it's been done for
1047 // an interpreter frame with greater than a page of locals, so each page
1048 // needs to be checked. Only true for non-native.
1049 if (UseStackBanging) {
1050 const int n_shadow_pages = JavaThread::stack_shadow_zone_size() / os::vm_page_size();
1051 const int start_page = native_call ? n_shadow_pages : 1;
1052 const int page_size = os::vm_page_size();
1053 for (int pages = start_page; pages <= n_shadow_pages ; pages++) {
1054 __ sub(rscratch2, sp, pages*page_size);
1055 __ str(zr, Address(rscratch2));
1056 }
1057 }
1058 }
1059
1060
1061 // Interpreter stub for calling a native method. (asm interpreter)
1062 // This sets up a somewhat different looking stack for calling the
1063 // native method than the typical interpreter frame setup.
1064 address TemplateInterpreterGenerator::generate_native_entry(bool synchronized) {
1065 // determine code generation flags
1066 bool inc_counter = UseCompiler || CountCompiledCalls || LogTouchedMethods;
1067
1068 // r1: Method*
1069 // rscratch1: sender sp
1070
1071 address entry_point = __ pc();
1072
1073 const Address constMethod (rmethod, Method::const_offset());
1074 const Address access_flags (rmethod, Method::access_flags_offset());
1075 const Address size_of_parameters(r2, ConstMethod::
1076 size_of_parameters_offset());
1077
1078 // get parameter size (always needed)
1079 __ ldr(r2, constMethod);
1080 __ load_unsigned_short(r2, size_of_parameters);
1081
1082 // Native calls don't need the stack size check since they have no
1083 // expression stack and the arguments are already on the stack and
1084 // we only add a handful of words to the stack.
1085
1086 // rmethod: Method*
1087 // r2: size of parameters
1088 // rscratch1: sender sp
1089
1090 // for natives the size of locals is zero
1091
1092 // compute beginning of parameters (rlocals)
1093 __ add(rlocals, esp, r2, ext::uxtx, 3);
1094 __ add(rlocals, rlocals, -wordSize);
1095
1096 // Pull SP back to minimum size: this avoids holes in the stack
1097 __ andr(sp, esp, -16);
1098
1099 // initialize fixed part of activation frame
1100 generate_fixed_frame(true);
1101 #ifndef PRODUCT
1102 // tell the simulator that a method has been entered
1103 if (NotifySimulator) {
1104 __ notify(Assembler::method_entry);
1105 }
1106 #endif
1107
1108 // make sure method is native & not abstract
1109 #ifdef ASSERT
1110 __ ldrw(r0, access_flags);
1111 {
1112 Label L;
1113 __ tst(r0, JVM_ACC_NATIVE);
1114 __ br(Assembler::NE, L);
1115 __ stop("tried to execute non-native method as native");
1116 __ bind(L);
1117 }
1118 {
1119 Label L;
1120 __ tst(r0, JVM_ACC_ABSTRACT);
1121 __ br(Assembler::EQ, L);
1122 __ stop("tried to execute abstract method in interpreter");
1123 __ bind(L);
1124 }
1125 #endif
1126
1127 // Since at this point in the method invocation the exception
1128 // handler would try to exit the monitor of synchronized methods
1129 // which hasn't been entered yet, we set the thread local variable
1130 // _do_not_unlock_if_synchronized to true. The remove_activation
1131 // will check this flag.
1132
1133 const Address do_not_unlock_if_synchronized(rthread,
1134 in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()));
1135 __ mov(rscratch2, true);
1136 __ strb(rscratch2, do_not_unlock_if_synchronized);
1137
1138 // increment invocation count & check for overflow
1139 Label invocation_counter_overflow;
1140 if (inc_counter) {
1141 generate_counter_incr(&invocation_counter_overflow, NULL, NULL);
1142 }
1143
1144 Label continue_after_compile;
1145 __ bind(continue_after_compile);
1146
1147 bang_stack_shadow_pages(true);
1148
1149 // reset the _do_not_unlock_if_synchronized flag
1150 __ strb(zr, do_not_unlock_if_synchronized);
1151
1152 // check for synchronized methods
1153 // Must happen AFTER invocation_counter check and stack overflow check,
1154 // so method is not locked if overflows.
1155 if (synchronized) {
1156 lock_method();
1157 } else {
1158 // no synchronization necessary
1159 #ifdef ASSERT
1160 {
1161 Label L;
1162 __ ldrw(r0, access_flags);
1163 __ tst(r0, JVM_ACC_SYNCHRONIZED);
1164 __ br(Assembler::EQ, L);
1165 __ stop("method needs synchronization");
1166 __ bind(L);
1167 }
1168 #endif
1169 }
1170
1171 // start execution
1172 #ifdef ASSERT
1173 {
1174 Label L;
1175 const Address monitor_block_top(rfp,
1176 frame::interpreter_frame_monitor_block_top_offset * wordSize);
1177 __ ldr(rscratch1, monitor_block_top);
1178 __ cmp(esp, rscratch1);
1179 __ br(Assembler::EQ, L);
1180 __ stop("broken stack frame setup in interpreter");
1181 __ bind(L);
1182 }
1183 #endif
1184
1185 // jvmti support
1186 __ notify_method_entry();
1187
1188 // work registers
1189 const Register t = r17;
1190 const Register result_handler = r19;
1191
1192 // allocate space for parameters
1193 __ ldr(t, Address(rmethod, Method::const_offset()));
1194 __ load_unsigned_short(t, Address(t, ConstMethod::size_of_parameters_offset()));
1195
1196 __ sub(rscratch1, esp, t, ext::uxtx, Interpreter::logStackElementSize);
1197 __ andr(sp, rscratch1, -16);
1198 __ mov(esp, rscratch1);
1199
1200 // get signature handler
1201 {
1202 Label L;
1203 __ ldr(t, Address(rmethod, Method::signature_handler_offset()));
1204 __ cbnz(t, L);
1205 __ call_VM(noreg,
1206 CAST_FROM_FN_PTR(address,
1207 InterpreterRuntime::prepare_native_call),
1208 rmethod);
1209 __ ldr(t, Address(rmethod, Method::signature_handler_offset()));
1210 __ bind(L);
1211 }
1212
1213 // call signature handler
1214 assert(InterpreterRuntime::SignatureHandlerGenerator::from() == rlocals,
1215 "adjust this code");
1216 assert(InterpreterRuntime::SignatureHandlerGenerator::to() == sp,
1217 "adjust this code");
1218 assert(InterpreterRuntime::SignatureHandlerGenerator::temp() == rscratch1,
1219 "adjust this code");
1220
1221 // The generated handlers do not touch rmethod (the method).
1222 // However, large signatures cannot be cached and are generated
1223 // each time here. The slow-path generator can do a GC on return,
1224 // so we must reload it after the call.
1225 __ blr(t);
1226 __ get_method(rmethod); // slow path can do a GC, reload rmethod
1227
1228
1229 // result handler is in r0
1230 // set result handler
1231 __ mov(result_handler, r0);
1232 // pass mirror handle if static call
1233 {
1234 Label L;
1235 __ ldrw(t, Address(rmethod, Method::access_flags_offset()));
1236 __ tbz(t, exact_log2(JVM_ACC_STATIC), L);
1237 // get mirror
1238 __ load_mirror(t, rmethod);
1239 // copy mirror into activation frame
1240 __ str(t, Address(rfp, frame::interpreter_frame_oop_temp_offset * wordSize));
1241 // pass handle to mirror
1242 __ add(c_rarg1, rfp, frame::interpreter_frame_oop_temp_offset * wordSize);
1243 __ bind(L);
1244 }
1245
1246 // get native function entry point in r10
1247 {
1248 Label L;
1249 __ ldr(r10, Address(rmethod, Method::native_function_offset()));
1250 address unsatisfied = (SharedRuntime::native_method_throw_unsatisfied_link_error_entry());
1251 __ mov(rscratch2, unsatisfied);
1252 __ ldr(rscratch2, rscratch2);
1253 __ cmp(r10, rscratch2);
1254 __ br(Assembler::NE, L);
1255 __ call_VM(noreg,
1256 CAST_FROM_FN_PTR(address,
1257 InterpreterRuntime::prepare_native_call),
1258 rmethod);
1259 __ get_method(rmethod);
1260 __ ldr(r10, Address(rmethod, Method::native_function_offset()));
1261 __ bind(L);
1262 }
1263
1264 // pass JNIEnv
1265 __ add(c_rarg0, rthread, in_bytes(JavaThread::jni_environment_offset()));
1266
1267 // It is enough that the pc() points into the right code
1268 // segment. It does not have to be the correct return pc.
1269 __ set_last_Java_frame(esp, rfp, (address)NULL, rscratch1);
1270
1271 // change thread state
1272 #ifdef ASSERT
1273 {
1274 Label L;
1275 __ ldrw(t, Address(rthread, JavaThread::thread_state_offset()));
1276 __ cmp(t, _thread_in_Java);
1277 __ br(Assembler::EQ, L);
1278 __ stop("Wrong thread state in native stub");
1279 __ bind(L);
1280 }
1281 #endif
1282
1283 // Change state to native
1284 __ mov(rscratch1, _thread_in_native);
1285 __ lea(rscratch2, Address(rthread, JavaThread::thread_state_offset()));
1286 __ stlrw(rscratch1, rscratch2);
1287
1288 // Call the native method.
1289 __ blrt(r10, rscratch1);
1290 __ maybe_isb();
1291 __ get_method(rmethod);
1292 // result potentially in r0 or v0
1293
1294 // make room for the pushes we're about to do
1295 __ sub(rscratch1, esp, 4 * wordSize);
1296 __ andr(sp, rscratch1, -16);
1297
1298 // NOTE: The order of these pushes is known to frame::interpreter_frame_result
1299 // in order to extract the result of a method call. If the order of these
1300 // pushes change or anything else is added to the stack then the code in
1301 // interpreter_frame_result must also change.
1302 __ push(dtos);
1303 __ push(ltos);
1304
1305 // change thread state
1306 __ mov(rscratch1, _thread_in_native_trans);
1307 __ lea(rscratch2, Address(rthread, JavaThread::thread_state_offset()));
1308 __ stlrw(rscratch1, rscratch2);
1309
1310 if (os::is_MP()) {
1311 if (UseMembar) {
1312 // Force this write out before the read below
1313 __ dsb(Assembler::SY);
1314 } else {
1315 // Write serialization page so VM thread can do a pseudo remote membar.
1316 // We use the current thread pointer to calculate a thread specific
1317 // offset to write to within the page. This minimizes bus traffic
1318 // due to cache line collision.
1319 __ serialize_memory(rthread, rscratch2);
1320 }
1321 }
1322
1323 // check for safepoint operation in progress and/or pending suspend requests
1324 {
1325 Label Continue;
1326 {
1327 unsigned long offset;
1328 __ adrp(rscratch2, SafepointSynchronize::address_of_state(), offset);
1329 __ ldrw(rscratch2, Address(rscratch2, offset));
1330 }
1331 assert(SafepointSynchronize::_not_synchronized == 0,
1332 "SafepointSynchronize::_not_synchronized");
1333 Label L;
1334 __ cbnz(rscratch2, L);
1335 __ ldrw(rscratch2, Address(rthread, JavaThread::suspend_flags_offset()));
1336 __ cbz(rscratch2, Continue);
1337 __ bind(L);
1338
1339 // Don't use call_VM as it will see a possible pending exception
1340 // and forward it and never return here preventing us from
1341 // clearing _last_native_pc down below. So we do a runtime call by
1342 // hand.
1343 //
1344 __ mov(c_rarg0, rthread);
1345 __ mov(rscratch2, CAST_FROM_FN_PTR(address, JavaThread::check_special_condition_for_native_trans));
1346 __ blrt(rscratch2, 1, 0, 0);
1347 __ maybe_isb();
1348 __ get_method(rmethod);
1349 __ reinit_heapbase();
1350 __ bind(Continue);
1351 }
1352
1353 // change thread state
1354 __ mov(rscratch1, _thread_in_Java);
1355 __ lea(rscratch2, Address(rthread, JavaThread::thread_state_offset()));
1356 __ stlrw(rscratch1, rscratch2);
1357
1358 // reset_last_Java_frame
1359 __ reset_last_Java_frame(true);
1360
1361 // reset handle block
1362 __ ldr(t, Address(rthread, JavaThread::active_handles_offset()));
1363 __ str(zr, Address(t, JNIHandleBlock::top_offset_in_bytes()));
1364
1365 // If result is an oop unbox and store it in frame where gc will see it
1366 // and result handler will pick it up
1367
1368 {
1369 Label no_oop, store_result;
1370 __ adr(t, ExternalAddress(AbstractInterpreter::result_handler(T_OBJECT)));
1371 __ cmp(t, result_handler);
1372 __ br(Assembler::NE, no_oop);
1373 // retrieve result
1374 __ pop(ltos);
1375 __ cbz(r0, store_result);
1376 __ ldr(r0, Address(r0, 0));
1377 __ bind(store_result);
1378 __ str(r0, Address(rfp, frame::interpreter_frame_oop_temp_offset*wordSize));
1379 // keep stack depth as expected by pushing oop which will eventually be discarded
1380 __ push(ltos);
1381 __ bind(no_oop);
1382 }
1383
1384 {
1385 Label no_reguard;
1386 __ lea(rscratch1, Address(rthread, in_bytes(JavaThread::stack_guard_state_offset())));
1387 __ ldrw(rscratch1, Address(rscratch1));
1388 __ cmp(rscratch1, JavaThread::stack_guard_yellow_reserved_disabled);
1389 __ br(Assembler::NE, no_reguard);
1390
1391 __ pusha(); // XXX only save smashed registers
1392 __ mov(c_rarg0, rthread);
1393 __ mov(rscratch2, CAST_FROM_FN_PTR(address, SharedRuntime::reguard_yellow_pages));
1394 __ blrt(rscratch2, 0, 0, 0);
1395 __ popa(); // XXX only restore smashed registers
1396 __ bind(no_reguard);
1397 }
1398
1399 // The method register is junk from after the thread_in_native transition
1400 // until here. Also can't call_VM until the bcp has been
1401 // restored. Need bcp for throwing exception below so get it now.
1402 __ get_method(rmethod);
1403
1404 // restore bcp to have legal interpreter frame, i.e., bci == 0 <=>
1405 // rbcp == code_base()
1406 __ ldr(rbcp, Address(rmethod, Method::const_offset())); // get ConstMethod*
1407 __ add(rbcp, rbcp, in_bytes(ConstMethod::codes_offset())); // get codebase
1408 // handle exceptions (exception handling will handle unlocking!)
1409 {
1410 Label L;
1411 __ ldr(rscratch1, Address(rthread, Thread::pending_exception_offset()));
1412 __ cbz(rscratch1, L);
1413 // Note: At some point we may want to unify this with the code
1414 // used in call_VM_base(); i.e., we should use the
1415 // StubRoutines::forward_exception code. For now this doesn't work
1416 // here because the rsp is not correctly set at this point.
1417 __ MacroAssembler::call_VM(noreg,
1418 CAST_FROM_FN_PTR(address,
1419 InterpreterRuntime::throw_pending_exception));
1420 __ should_not_reach_here();
1421 __ bind(L);
1422 }
1423
1424 // do unlocking if necessary
1425 {
1426 Label L;
1427 __ ldrw(t, Address(rmethod, Method::access_flags_offset()));
1428 __ tbz(t, exact_log2(JVM_ACC_SYNCHRONIZED), L);
1429 // the code below should be shared with interpreter macro
1430 // assembler implementation
1431 {
1432 Label unlock;
1433 // BasicObjectLock will be first in list, since this is a
1434 // synchronized method. However, need to check that the object
1435 // has not been unlocked by an explicit monitorexit bytecode.
1436
1437 // monitor expect in c_rarg1 for slow unlock path
1438 __ lea (c_rarg1, Address(rfp, // address of first monitor
1439 (intptr_t)(frame::interpreter_frame_initial_sp_offset *
1440 wordSize - sizeof(BasicObjectLock))));
1441
1442 __ ldr(t, Address(c_rarg1, BasicObjectLock::obj_offset_in_bytes()));
1443 __ cbnz(t, unlock);
1444
1445 // Entry already unlocked, need to throw exception
1446 __ MacroAssembler::call_VM(noreg,
1447 CAST_FROM_FN_PTR(address,
1448 InterpreterRuntime::throw_illegal_monitor_state_exception));
1449 __ should_not_reach_here();
1450
1451 __ bind(unlock);
1452 __ unlock_object(c_rarg1);
1453 }
1454 __ bind(L);
1455 }
1456
1457 // jvmti support
1458 // Note: This must happen _after_ handling/throwing any exceptions since
1459 // the exception handler code notifies the runtime of method exits
1460 // too. If this happens before, method entry/exit notifications are
1461 // not properly paired (was bug - gri 11/22/99).
1462 __ notify_method_exit(vtos, InterpreterMacroAssembler::NotifyJVMTI);
1463
1464 // restore potential result in r0:d0, call result handler to
1465 // restore potential result in ST0 & handle result
1466
1467 __ pop(ltos);
1468 __ pop(dtos);
1469
1470 __ blr(result_handler);
1471
1472 // remove activation
1473 __ ldr(esp, Address(rfp,
1474 frame::interpreter_frame_sender_sp_offset *
1475 wordSize)); // get sender sp
1476 // remove frame anchor
1477 __ leave();
1478
1479 // resture sender sp
1480 __ mov(sp, esp);
1481
1482 __ ret(lr);
1483
1484 if (inc_counter) {
1485 // Handle overflow of counter and compile method
1486 __ bind(invocation_counter_overflow);
1487 generate_counter_overflow(continue_after_compile);
1488 }
1489
1490 return entry_point;
1491 }
1492
1493 //
1494 // Generic interpreted method entry to (asm) interpreter
1495 //
1496 address TemplateInterpreterGenerator::generate_normal_entry(bool synchronized) {
1497 // determine code generation flags
1498 bool inc_counter = UseCompiler || CountCompiledCalls || LogTouchedMethods;
1499
1500 // rscratch1: sender sp
1501 address entry_point = __ pc();
1502
1503 const Address constMethod(rmethod, Method::const_offset());
1504 const Address access_flags(rmethod, Method::access_flags_offset());
1505 const Address size_of_parameters(r3,
1506 ConstMethod::size_of_parameters_offset());
1507 const Address size_of_locals(r3, ConstMethod::size_of_locals_offset());
1508
1509 // get parameter size (always needed)
1510 // need to load the const method first
1511 __ ldr(r3, constMethod);
1512 __ load_unsigned_short(r2, size_of_parameters);
1513
1514 // r2: size of parameters
1515
1516 __ load_unsigned_short(r3, size_of_locals); // get size of locals in words
1517 __ sub(r3, r3, r2); // r3 = no. of additional locals
1518
1519 // see if we've got enough room on the stack for locals plus overhead.
1520 generate_stack_overflow_check();
1521
1522 // compute beginning of parameters (rlocals)
1523 __ add(rlocals, esp, r2, ext::uxtx, 3);
1524 __ sub(rlocals, rlocals, wordSize);
1525
1526 // Make room for locals
1527 __ sub(rscratch1, esp, r3, ext::uxtx, 3);
1528 __ andr(sp, rscratch1, -16);
1529
1530 // r3 - # of additional locals
1531 // allocate space for locals
1532 // explicitly initialize locals
1533 {
1534 Label exit, loop;
1535 __ ands(zr, r3, r3);
1536 __ br(Assembler::LE, exit); // do nothing if r3 <= 0
1537 __ bind(loop);
1538 __ str(zr, Address(__ post(rscratch1, wordSize)));
1539 __ sub(r3, r3, 1); // until everything initialized
1540 __ cbnz(r3, loop);
1541 __ bind(exit);
1542 }
1543
1544 // And the base dispatch table
1545 __ get_dispatch();
1546
1547 // initialize fixed part of activation frame
1548 generate_fixed_frame(false);
1549 #ifndef PRODUCT
1550 // tell the simulator that a method has been entered
1551 if (NotifySimulator) {
1552 __ notify(Assembler::method_entry);
1553 }
1554 #endif
1555 // make sure method is not native & not abstract
1556 #ifdef ASSERT
1557 __ ldrw(r0, access_flags);
1558 {
1559 Label L;
1560 __ tst(r0, JVM_ACC_NATIVE);
1561 __ br(Assembler::EQ, L);
1562 __ stop("tried to execute native method as non-native");
1563 __ bind(L);
1564 }
1565 {
1566 Label L;
1567 __ tst(r0, JVM_ACC_ABSTRACT);
1568 __ br(Assembler::EQ, L);
1569 __ stop("tried to execute abstract method in interpreter");
1570 __ bind(L);
1571 }
1572 #endif
1573
1574 // Since at this point in the method invocation the exception
1575 // handler would try to exit the monitor of synchronized methods
1576 // which hasn't been entered yet, we set the thread local variable
1577 // _do_not_unlock_if_synchronized to true. The remove_activation
1578 // will check this flag.
1579
1580 const Address do_not_unlock_if_synchronized(rthread,
1581 in_bytes(JavaThread::do_not_unlock_if_synchronized_offset()));
1582 __ mov(rscratch2, true);
1583 __ strb(rscratch2, do_not_unlock_if_synchronized);
1584
1585 // increment invocation count & check for overflow
1586 Label invocation_counter_overflow;
1587 Label profile_method;
1588 Label profile_method_continue;
1589 if (inc_counter) {
1590 generate_counter_incr(&invocation_counter_overflow,
1591 &profile_method,
1592 &profile_method_continue);
1593 if (ProfileInterpreter) {
1594 __ bind(profile_method_continue);
1595 }
1596 }
1597
1598 Label continue_after_compile;
1599 __ bind(continue_after_compile);
1600
1601 bang_stack_shadow_pages(false);
1602
1603 // reset the _do_not_unlock_if_synchronized flag
1604 __ strb(zr, do_not_unlock_if_synchronized);
1605
1606 // check for synchronized methods
1607 // Must happen AFTER invocation_counter check and stack overflow check,
1608 // so method is not locked if overflows.
1609 if (synchronized) {
1610 // Allocate monitor and lock method
1611 lock_method();
1612 } else {
1613 // no synchronization necessary
1614 #ifdef ASSERT
1615 {
1616 Label L;
1617 __ ldrw(r0, access_flags);
1618 __ tst(r0, JVM_ACC_SYNCHRONIZED);
1619 __ br(Assembler::EQ, L);
1620 __ stop("method needs synchronization");
1621 __ bind(L);
1622 }
1623 #endif
1624 }
1625
1626 // start execution
1627 #ifdef ASSERT
1628 {
1629 Label L;
1630 const Address monitor_block_top (rfp,
1631 frame::interpreter_frame_monitor_block_top_offset * wordSize);
1632 __ ldr(rscratch1, monitor_block_top);
1633 __ cmp(esp, rscratch1);
1634 __ br(Assembler::EQ, L);
1635 __ stop("broken stack frame setup in interpreter");
1636 __ bind(L);
1637 }
1638 #endif
1639
1640 // jvmti support
1641 __ notify_method_entry();
1642
1643 __ dispatch_next(vtos);
1644
1645 // invocation counter overflow
1646 if (inc_counter) {
1647 if (ProfileInterpreter) {
1648 // We have decided to profile this method in the interpreter
1649 __ bind(profile_method);
1650 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::profile_method));
1651 __ set_method_data_pointer_for_bcp();
1652 // don't think we need this
1653 __ get_method(r1);
1654 __ b(profile_method_continue);
1655 }
1656 // Handle overflow of counter and compile method
1657 __ bind(invocation_counter_overflow);
1658 generate_counter_overflow(continue_after_compile);
1659 }
1660
1661 return entry_point;
1662 }
1663
1664 //-----------------------------------------------------------------------------
1665 // Exceptions
1666
1667 void TemplateInterpreterGenerator::generate_throw_exception() {
1668 // Entry point in previous activation (i.e., if the caller was
1669 // interpreted)
1670 Interpreter::_rethrow_exception_entry = __ pc();
1671 // Restore sp to interpreter_frame_last_sp even though we are going
1672 // to empty the expression stack for the exception processing.
1673 __ str(zr, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize));
1674 // r0: exception
1675 // r3: return address/pc that threw exception
1676 __ restore_bcp(); // rbcp points to call/send
1677 __ restore_locals();
1678 __ restore_constant_pool_cache();
1679 __ reinit_heapbase(); // restore rheapbase as heapbase.
1680 __ get_dispatch();
1681
1682 #ifndef PRODUCT
1683 // tell the simulator that the caller method has been reentered
1684 if (NotifySimulator) {
1685 __ get_method(rmethod);
1686 __ notify(Assembler::method_reentry);
1687 }
1688 #endif
1689 // Entry point for exceptions thrown within interpreter code
1690 Interpreter::_throw_exception_entry = __ pc();
1691 // If we came here via a NullPointerException on the receiver of a
1692 // method, rmethod may be corrupt.
1693 __ get_method(rmethod);
1694 // expression stack is undefined here
1695 // r0: exception
1696 // rbcp: exception bcp
1697 __ verify_oop(r0);
1698 __ mov(c_rarg1, r0);
1699
1700 // expression stack must be empty before entering the VM in case of
1701 // an exception
1702 __ empty_expression_stack();
1703 // find exception handler address and preserve exception oop
1704 __ call_VM(r3,
1705 CAST_FROM_FN_PTR(address,
1706 InterpreterRuntime::exception_handler_for_exception),
1707 c_rarg1);
1708
1709 // Calculate stack limit
1710 __ ldr(rscratch1, Address(rmethod, Method::const_offset()));
1711 __ ldrh(rscratch1, Address(rscratch1, ConstMethod::max_stack_offset()));
1712 __ add(rscratch1, rscratch1, frame::interpreter_frame_monitor_size() + 4);
1713 __ ldr(rscratch2,
1714 Address(rfp, frame::interpreter_frame_initial_sp_offset * wordSize));
1715 __ sub(rscratch1, rscratch2, rscratch1, ext::uxtx, 3);
1716 __ andr(sp, rscratch1, -16);
1717
1718 // r0: exception handler entry point
1719 // r3: preserved exception oop
1720 // rbcp: bcp for exception handler
1721 __ push_ptr(r3); // push exception which is now the only value on the stack
1722 __ br(r0); // jump to exception handler (may be _remove_activation_entry!)
1723
1724 // If the exception is not handled in the current frame the frame is
1725 // removed and the exception is rethrown (i.e. exception
1726 // continuation is _rethrow_exception).
1727 //
1728 // Note: At this point the bci is still the bxi for the instruction
1729 // which caused the exception and the expression stack is
1730 // empty. Thus, for any VM calls at this point, GC will find a legal
1731 // oop map (with empty expression stack).
1732
1733 //
1734 // JVMTI PopFrame support
1735 //
1736
1737 Interpreter::_remove_activation_preserving_args_entry = __ pc();
1738 __ empty_expression_stack();
1739 // Set the popframe_processing bit in pending_popframe_condition
1740 // indicating that we are currently handling popframe, so that
1741 // call_VMs that may happen later do not trigger new popframe
1742 // handling cycles.
1743 __ ldrw(r3, Address(rthread, JavaThread::popframe_condition_offset()));
1744 __ orr(r3, r3, JavaThread::popframe_processing_bit);
1745 __ strw(r3, Address(rthread, JavaThread::popframe_condition_offset()));
1746
1747 {
1748 // Check to see whether we are returning to a deoptimized frame.
1749 // (The PopFrame call ensures that the caller of the popped frame is
1750 // either interpreted or compiled and deoptimizes it if compiled.)
1751 // In this case, we can't call dispatch_next() after the frame is
1752 // popped, but instead must save the incoming arguments and restore
1753 // them after deoptimization has occurred.
1754 //
1755 // Note that we don't compare the return PC against the
1756 // deoptimization blob's unpack entry because of the presence of
1757 // adapter frames in C2.
1758 Label caller_not_deoptimized;
1759 __ ldr(c_rarg1, Address(rfp, frame::return_addr_offset * wordSize));
1760 __ super_call_VM_leaf(CAST_FROM_FN_PTR(address,
1761 InterpreterRuntime::interpreter_contains), c_rarg1);
1762 __ cbnz(r0, caller_not_deoptimized);
1763
1764 // Compute size of arguments for saving when returning to
1765 // deoptimized caller
1766 __ get_method(r0);
1767 __ ldr(r0, Address(r0, Method::const_offset()));
1768 __ load_unsigned_short(r0, Address(r0, in_bytes(ConstMethod::
1769 size_of_parameters_offset())));
1770 __ lsl(r0, r0, Interpreter::logStackElementSize);
1771 __ restore_locals(); // XXX do we need this?
1772 __ sub(rlocals, rlocals, r0);
1773 __ add(rlocals, rlocals, wordSize);
1774 // Save these arguments
1775 __ super_call_VM_leaf(CAST_FROM_FN_PTR(address,
1776 Deoptimization::
1777 popframe_preserve_args),
1778 rthread, r0, rlocals);
1779
1780 __ remove_activation(vtos,
1781 /* throw_monitor_exception */ false,
1782 /* install_monitor_exception */ false,
1783 /* notify_jvmdi */ false);
1784
1785 // Inform deoptimization that it is responsible for restoring
1786 // these arguments
1787 __ mov(rscratch1, JavaThread::popframe_force_deopt_reexecution_bit);
1788 __ strw(rscratch1, Address(rthread, JavaThread::popframe_condition_offset()));
1789
1790 // Continue in deoptimization handler
1791 __ ret(lr);
1792
1793 __ bind(caller_not_deoptimized);
1794 }
1795
1796 __ remove_activation(vtos,
1797 /* throw_monitor_exception */ false,
1798 /* install_monitor_exception */ false,
1799 /* notify_jvmdi */ false);
1800
1801 // Restore the last_sp and null it out
1802 __ ldr(esp, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize));
1803 __ str(zr, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize));
1804
1805 __ restore_bcp();
1806 __ restore_locals();
1807 __ restore_constant_pool_cache();
1808 __ get_method(rmethod);
1809
1810 // The method data pointer was incremented already during
1811 // call profiling. We have to restore the mdp for the current bcp.
1812 if (ProfileInterpreter) {
1813 __ set_method_data_pointer_for_bcp();
1814 }
1815
1816 // Clear the popframe condition flag
1817 __ strw(zr, Address(rthread, JavaThread::popframe_condition_offset()));
1818 assert(JavaThread::popframe_inactive == 0, "fix popframe_inactive");
1819
1820 #if INCLUDE_JVMTI
1821 {
1822 Label L_done;
1823
1824 __ ldrb(rscratch1, Address(rbcp, 0));
1825 __ cmpw(r1, Bytecodes::_invokestatic);
1826 __ br(Assembler::EQ, L_done);
1827
1828 // The member name argument must be restored if _invokestatic is re-executed after a PopFrame call.
1829 // Detect such a case in the InterpreterRuntime function and return the member name argument, or NULL.
1830
1831 __ ldr(c_rarg0, Address(rlocals, 0));
1832 __ call_VM(r0, CAST_FROM_FN_PTR(address, InterpreterRuntime::member_name_arg_or_null), c_rarg0, rmethod, rbcp);
1833
1834 __ cbz(r0, L_done);
1835
1836 __ str(r0, Address(esp, 0));
1837 __ bind(L_done);
1838 }
1839 #endif // INCLUDE_JVMTI
1840
1841 // Restore machine SP
1842 __ ldr(rscratch1, Address(rmethod, Method::const_offset()));
1843 __ ldrh(rscratch1, Address(rscratch1, ConstMethod::max_stack_offset()));
1844 __ add(rscratch1, rscratch1, frame::interpreter_frame_monitor_size() + 4);
1845 __ ldr(rscratch2,
1846 Address(rfp, frame::interpreter_frame_initial_sp_offset * wordSize));
1847 __ sub(rscratch1, rscratch2, rscratch1, ext::uxtw, 3);
1848 __ andr(sp, rscratch1, -16);
1849
1850 __ dispatch_next(vtos);
1851 // end of PopFrame support
1852
1853 Interpreter::_remove_activation_entry = __ pc();
1854
1855 // preserve exception over this code sequence
1856 __ pop_ptr(r0);
1857 __ str(r0, Address(rthread, JavaThread::vm_result_offset()));
1858 // remove the activation (without doing throws on illegalMonitorExceptions)
1859 __ remove_activation(vtos, false, true, false);
1860 // restore exception
1861 // restore exception
1862 __ get_vm_result(r0, rthread);
1863
1864 // In between activations - previous activation type unknown yet
1865 // compute continuation point - the continuation point expects the
1866 // following registers set up:
1867 //
1868 // r0: exception
1869 // lr: return address/pc that threw exception
1870 // rsp: expression stack of caller
1871 // rfp: fp of caller
1872 // FIXME: There's no point saving LR here because VM calls don't trash it
1873 __ stp(r0, lr, Address(__ pre(sp, -2 * wordSize))); // save exception & return address
1874 __ super_call_VM_leaf(CAST_FROM_FN_PTR(address,
1875 SharedRuntime::exception_handler_for_return_address),
1876 rthread, lr);
1877 __ mov(r1, r0); // save exception handler
1878 __ ldp(r0, lr, Address(__ post(sp, 2 * wordSize))); // restore exception & return address
1879 // We might be returning to a deopt handler that expects r3 to
1880 // contain the exception pc
1881 __ mov(r3, lr);
1882 // Note that an "issuing PC" is actually the next PC after the call
1883 __ br(r1); // jump to exception
1884 // handler of caller
1885 }
1886
1887
1888 //
1889 // JVMTI ForceEarlyReturn support
1890 //
1891 address TemplateInterpreterGenerator::generate_earlyret_entry_for(TosState state) {
1892 address entry = __ pc();
1893
1894 __ restore_bcp();
1895 __ restore_locals();
1896 __ empty_expression_stack();
1897 __ load_earlyret_value(state);
1898
1899 __ ldr(rscratch1, Address(rthread, JavaThread::jvmti_thread_state_offset()));
1900 Address cond_addr(rscratch1, JvmtiThreadState::earlyret_state_offset());
1901
1902 // Clear the earlyret state
1903 assert(JvmtiThreadState::earlyret_inactive == 0, "should be");
1904 __ str(zr, cond_addr);
1905
1906 __ remove_activation(state,
1907 false, /* throw_monitor_exception */
1908 false, /* install_monitor_exception */
1909 true); /* notify_jvmdi */
1910 __ ret(lr);
1911
1912 return entry;
1913 } // end of ForceEarlyReturn support
1914
1915
1916
1917 //-----------------------------------------------------------------------------
1918 // Helper for vtos entry point generation
1919
1920 void TemplateInterpreterGenerator::set_vtos_entry_points(Template* t,
1921 address& bep,
1922 address& cep,
1923 address& sep,
1924 address& aep,
1925 address& iep,
1926 address& lep,
1927 address& fep,
1928 address& dep,
1929 address& vep) {
1930 assert(t->is_valid() && t->tos_in() == vtos, "illegal template");
1931 Label L;
1932 aep = __ pc(); __ push_ptr(); __ b(L);
1933 fep = __ pc(); __ push_f(); __ b(L);
1934 dep = __ pc(); __ push_d(); __ b(L);
1935 lep = __ pc(); __ push_l(); __ b(L);
1936 bep = cep = sep =
1937 iep = __ pc(); __ push_i();
1938 vep = __ pc();
1939 __ bind(L);
1940 generate_and_dispatch(t);
1941 }
1942
1943 //-----------------------------------------------------------------------------
1944
1945 // Non-product code
1946 #ifndef PRODUCT
1947 address TemplateInterpreterGenerator::generate_trace_code(TosState state) {
1948 address entry = __ pc();
1949
1950 __ push(lr);
1951 __ push(state);
1952 __ push(RegSet::range(r0, r15), sp);
1953 __ mov(c_rarg2, r0); // Pass itos
1954 __ call_VM(noreg,
1955 CAST_FROM_FN_PTR(address, InterpreterRuntime::trace_bytecode),
1956 c_rarg1, c_rarg2, c_rarg3);
1957 __ pop(RegSet::range(r0, r15), sp);
1958 __ pop(state);
1959 __ pop(lr);
1960 __ ret(lr); // return from result handler
1961
1962 return entry;
1963 }
1964
1965 void TemplateInterpreterGenerator::count_bytecode() {
1966 Register rscratch3 = r0;
1967 __ push(rscratch1);
1968 __ push(rscratch2);
1969 __ push(rscratch3);
1970 __ mov(rscratch3, (address) &BytecodeCounter::_counter_value);
1971 __ atomic_add(noreg, 1, rscratch3);
1972 __ pop(rscratch3);
1973 __ pop(rscratch2);
1974 __ pop(rscratch1);
1975 }
1976
1977 void TemplateInterpreterGenerator::histogram_bytecode(Template* t) { ; }
1978
1979 void TemplateInterpreterGenerator::histogram_bytecode_pair(Template* t) { ; }
1980
1981
1982 void TemplateInterpreterGenerator::trace_bytecode(Template* t) {
1983 // Call a little run-time stub to avoid blow-up for each bytecode.
1984 // The run-time runtime saves the right registers, depending on
1985 // the tosca in-state for the given template.
1986
1987 assert(Interpreter::trace_code(t->tos_in()) != NULL,
1988 "entry must have been generated");
1989 __ bl(Interpreter::trace_code(t->tos_in()));
1990 __ reinit_heapbase();
1991 }
1992
1993
1994 void TemplateInterpreterGenerator::stop_interpreter_at() {
1995 Label L;
1996 __ push(rscratch1);
1997 __ mov(rscratch1, (address) &BytecodeCounter::_counter_value);
1998 __ ldr(rscratch1, Address(rscratch1));
1999 __ mov(rscratch2, StopInterpreterAt);
2000 __ cmpw(rscratch1, rscratch2);
2001 __ br(Assembler::NE, L);
2002 __ brk(0);
2003 __ bind(L);
2004 __ pop(rscratch1);
2005 }
2006
2007 #ifdef BUILTIN_SIM
2008
2009 #include <sys/mman.h>
2010 #include <unistd.h>
2011
2012 extern "C" {
2013 static int PAGESIZE = getpagesize();
2014 int is_mapped_address(u_int64_t address)
2015 {
2016 address = (address & ~((u_int64_t)PAGESIZE - 1));
2017 if (msync((void *)address, PAGESIZE, MS_ASYNC) == 0) {
2018 return true;
2019 }
2020 if (errno != ENOMEM) {
2021 return true;
2022 }
2023 return false;
2024 }
2025
2026 void bccheck1(u_int64_t pc, u_int64_t fp, char *method, int *bcidx, int *framesize, char *decode)
2027 {
2028 if (method != 0) {
2029 method[0] = '\0';
2030 }
2031 if (bcidx != 0) {
2032 *bcidx = -2;
2033 }
2034 if (decode != 0) {
2035 decode[0] = 0;
2036 }
2037
2038 if (framesize != 0) {
2039 *framesize = -1;
2040 }
2041
2042 if (Interpreter::contains((address)pc)) {
2043 AArch64Simulator *sim = AArch64Simulator::get_current(UseSimulatorCache, DisableBCCheck);
2044 Method* meth;
2045 address bcp;
2046 if (fp) {
2047 #define FRAME_SLOT_METHOD 3
2048 #define FRAME_SLOT_BCP 7
2049 meth = (Method*)sim->getMemory()->loadU64(fp - (FRAME_SLOT_METHOD << 3));
2050 bcp = (address)sim->getMemory()->loadU64(fp - (FRAME_SLOT_BCP << 3));
2051 #undef FRAME_SLOT_METHOD
2052 #undef FRAME_SLOT_BCP
2053 } else {
2054 meth = (Method*)sim->getCPUState().xreg(RMETHOD, 0);
2055 bcp = (address)sim->getCPUState().xreg(RBCP, 0);
2056 }
2057 if (meth->is_native()) {
2058 return;
2059 }
2060 if(method && meth->is_method()) {
2061 ResourceMark rm;
2062 method[0] = 'I';
2063 method[1] = ' ';
2064 meth->name_and_sig_as_C_string(method + 2, 398);
2065 }
2066 if (bcidx) {
2067 if (meth->contains(bcp)) {
2068 *bcidx = meth->bci_from(bcp);
2069 } else {
2070 *bcidx = -2;
2071 }
2072 }
2073 if (decode) {
2074 if (!BytecodeTracer::closure()) {
2075 BytecodeTracer::set_closure(BytecodeTracer::std_closure());
2076 }
2077 stringStream str(decode, 400);
2078 BytecodeTracer::trace(meth, bcp, &str);
2079 }
2080 } else {
2081 if (method) {
2082 CodeBlob *cb = CodeCache::find_blob((address)pc);
2083 if (cb != NULL) {
2084 if (cb->is_nmethod()) {
2085 ResourceMark rm;
2086 nmethod* nm = (nmethod*)cb;
2087 method[0] = 'C';
2088 method[1] = ' ';
2089 nm->method()->name_and_sig_as_C_string(method + 2, 398);
2090 } else if (cb->is_adapter_blob()) {
2091 strcpy(method, "B adapter blob");
2092 } else if (cb->is_runtime_stub()) {
2093 strcpy(method, "B runtime stub");
2094 } else if (cb->is_exception_stub()) {
2095 strcpy(method, "B exception stub");
2096 } else if (cb->is_deoptimization_stub()) {
2097 strcpy(method, "B deoptimization stub");
2098 } else if (cb->is_safepoint_stub()) {
2099 strcpy(method, "B safepoint stub");
2100 } else if (cb->is_uncommon_trap_stub()) {
2101 strcpy(method, "B uncommon trap stub");
2102 } else if (cb->contains((address)StubRoutines::call_stub())) {
2103 strcpy(method, "B call stub");
2104 } else {
2105 strcpy(method, "B unknown blob : ");
2106 strcat(method, cb->name());
2107 }
2108 if (framesize != NULL) {
2109 *framesize = cb->frame_size();
2110 }
2111 }
2112 }
2113 }
2114 }
2115
2116
2117 JNIEXPORT void bccheck(u_int64_t pc, u_int64_t fp, char *method, int *bcidx, int *framesize, char *decode)
2118 {
2119 bccheck1(pc, fp, method, bcidx, framesize, decode);
2120 }
2121 }
2122
2123 #endif // BUILTIN_SIM
2124 #endif // !PRODUCT