1 /*
2 * Copyright (c) 2003, 2016, Oracle and/or its affiliates. All rights reserved.
3 * Copyright 2007, 2008, 2009, 2010, 2011 Red Hat, Inc.
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/assembler.hpp"
28 #include "interpreter/bytecodeHistogram.hpp"
29 #include "interpreter/cppInterpreter.hpp"
30 #include "interpreter/cppInterpreterGenerator.hpp"
31 #include "interpreter/interpreter.hpp"
32 #include "interpreter/interpreterRuntime.hpp"
33 #include "oops/arrayOop.hpp"
34 #include "oops/methodData.hpp"
35 #include "oops/method.hpp"
36 #include "oops/oop.inline.hpp"
37 #include "prims/jvmtiExport.hpp"
38 #include "prims/jvmtiThreadState.hpp"
39 #include "runtime/arguments.hpp"
40 #include "runtime/atomic.hpp"
41 #include "runtime/deoptimization.hpp"
42 #include "runtime/frame.inline.hpp"
43 #include "runtime/interfaceSupport.hpp"
44 #include "runtime/orderAccess.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 "stack_zero.inline.hpp"
51 #include "utilities/debug.hpp"
52 #include "utilities/macros.hpp"
53 #ifdef SHARK
54 #include "shark/shark_globals.hpp"
55 #endif
56
57 #ifdef CC_INTERP
58
59 #define fixup_after_potential_safepoint() \
60 method = istate->method()
61
62 #define CALL_VM_NOCHECK_NOFIX(func) \
63 thread->set_last_Java_frame(); \
64 func; \
65 thread->reset_last_Java_frame();
66
67 #define CALL_VM_NOCHECK(func) \
68 CALL_VM_NOCHECK_NOFIX(func) \
69 fixup_after_potential_safepoint()
70
71 int CppInterpreter::normal_entry(Method* method, intptr_t UNUSED, TRAPS) {
72 JavaThread *thread = (JavaThread *) THREAD;
73
74 // Allocate and initialize our frame.
75 InterpreterFrame *frame = InterpreterFrame::build(method, CHECK_0);
76 thread->push_zero_frame(frame);
77
78 // Execute those bytecodes!
79 main_loop(0, THREAD);
80
81 // No deoptimized frames on the stack
82 return 0;
83 }
84
85 intptr_t narrow(BasicType type, intptr_t result) {
86 // mask integer result to narrower return type.
87 switch (type) {
88 case T_BOOLEAN:
89 return result&1;
90 case T_BYTE:
91 return (intptr_t)(jbyte)result;
92 case T_CHAR:
93 return (intptr_t)(uintptr_t)(jchar)result;
94 case T_SHORT:
95 return (intptr_t)(jshort)result;
96 case T_OBJECT: // nothing to do fall through
97 case T_ARRAY:
98 case T_LONG:
99 case T_INT:
100 case T_FLOAT:
101 case T_DOUBLE:
102 case T_VOID:
103 return result;
104 default : ShouldNotReachHere();
105 }
106 }
107
108
109 void CppInterpreter::main_loop(int recurse, TRAPS) {
110 JavaThread *thread = (JavaThread *) THREAD;
111 ZeroStack *stack = thread->zero_stack();
112
113 // If we are entering from a deopt we may need to call
114 // ourself a few times in order to get to our frame.
115 if (recurse)
116 main_loop(recurse - 1, THREAD);
117
118 InterpreterFrame *frame = thread->top_zero_frame()->as_interpreter_frame();
119 interpreterState istate = frame->interpreter_state();
120 Method* method = istate->method();
121
122 intptr_t *result = NULL;
123 int result_slots = 0;
124
125 while (true) {
126 // We can set up the frame anchor with everything we want at
127 // this point as we are thread_in_Java and no safepoints can
128 // occur until we go to vm mode. We do have to clear flags
129 // on return from vm but that is it.
130 thread->set_last_Java_frame();
131
132 // Call the interpreter
133 if (JvmtiExport::can_post_interpreter_events())
134 BytecodeInterpreter::runWithChecks(istate);
135 else
136 BytecodeInterpreter::run(istate);
137 fixup_after_potential_safepoint();
138
139 // Clear the frame anchor
140 thread->reset_last_Java_frame();
141
142 // Examine the message from the interpreter to decide what to do
143 if (istate->msg() == BytecodeInterpreter::call_method) {
144 Method* callee = istate->callee();
145
146 // Trim back the stack to put the parameters at the top
147 stack->set_sp(istate->stack() + 1);
148
149 // Make the call
150 Interpreter::invoke_method(callee, istate->callee_entry_point(), THREAD);
151 fixup_after_potential_safepoint();
152
153 // Convert the result
154 istate->set_stack(stack->sp() - 1);
155
156 // Restore the stack
157 stack->set_sp(istate->stack_limit() + 1);
158
159 // Resume the interpreter
160 istate->set_msg(BytecodeInterpreter::method_resume);
161 }
162 else if (istate->msg() == BytecodeInterpreter::more_monitors) {
163 int monitor_words = frame::interpreter_frame_monitor_size();
164
165 // Allocate the space
166 stack->overflow_check(monitor_words, THREAD);
167 if (HAS_PENDING_EXCEPTION)
168 break;
169 stack->alloc(monitor_words * wordSize);
170
171 // Move the expression stack contents
172 for (intptr_t *p = istate->stack() + 1; p < istate->stack_base(); p++)
173 *(p - monitor_words) = *p;
174
175 // Move the expression stack pointers
176 istate->set_stack_limit(istate->stack_limit() - monitor_words);
177 istate->set_stack(istate->stack() - monitor_words);
178 istate->set_stack_base(istate->stack_base() - monitor_words);
179
180 // Zero the new monitor so the interpreter can find it.
181 ((BasicObjectLock *) istate->stack_base())->set_obj(NULL);
182
183 // Resume the interpreter
184 istate->set_msg(BytecodeInterpreter::got_monitors);
185 }
186 else if (istate->msg() == BytecodeInterpreter::return_from_method) {
187 // Copy the result into the caller's frame
188 result_slots = type2size[method->result_type()];
189 assert(result_slots >= 0 && result_slots <= 2, "what?");
190 result = istate->stack() + result_slots;
191 break;
192 }
193 else if (istate->msg() == BytecodeInterpreter::throwing_exception) {
194 assert(HAS_PENDING_EXCEPTION, "should do");
195 break;
196 }
197 else if (istate->msg() == BytecodeInterpreter::do_osr) {
198 // Unwind the current frame
199 thread->pop_zero_frame();
200
201 // Remove any extension of the previous frame
202 int extra_locals = method->max_locals() - method->size_of_parameters();
203 stack->set_sp(stack->sp() + extra_locals);
204
205 // Jump into the OSR method
206 Interpreter::invoke_osr(
207 method, istate->osr_entry(), istate->osr_buf(), THREAD);
208 return;
209 }
210 else {
211 ShouldNotReachHere();
212 }
213 }
214
215 // Unwind the current frame
216 thread->pop_zero_frame();
217
218 // Pop our local variables
219 stack->set_sp(stack->sp() + method->max_locals());
220
221 // Push our result
222 for (int i = 0; i < result_slots; i++) {
223 // Adjust result to smaller
224 union {
225 intptr_t res;
226 jint res_jint;
227 };
228 res = result[-i];
229 if (result_slots == 1) {
230 BasicType t = method->result_type();
231 if (is_subword_type(t)) {
232 res_jint = (jint)narrow(t, res_jint);
233 }
234 }
235 stack->push(res);
236 }
237 }
238
239 int CppInterpreter::native_entry(Method* method, intptr_t UNUSED, TRAPS) {
240 // Make sure method is native and not abstract
241 assert(method->is_native() && !method->is_abstract(), "should be");
242
243 JavaThread *thread = (JavaThread *) THREAD;
244 ZeroStack *stack = thread->zero_stack();
245
246 // Allocate and initialize our frame
247 InterpreterFrame *frame = InterpreterFrame::build(method, CHECK_0);
248 thread->push_zero_frame(frame);
249 interpreterState istate = frame->interpreter_state();
250 intptr_t *locals = istate->locals();
251
252 // Update the invocation counter
253 if ((UseCompiler || CountCompiledCalls) && !method->is_synchronized()) {
254 MethodCounters* mcs = method->method_counters();
255 if (mcs == NULL) {
256 CALL_VM_NOCHECK(mcs = InterpreterRuntime::build_method_counters(thread, method));
257 if (HAS_PENDING_EXCEPTION)
258 goto unwind_and_return;
259 }
260 InvocationCounter *counter = mcs->invocation_counter();
261 counter->increment();
262 if (counter->reached_InvocationLimit(mcs->backedge_counter())) {
263 CALL_VM_NOCHECK(
264 InterpreterRuntime::frequency_counter_overflow(thread, NULL));
265 if (HAS_PENDING_EXCEPTION)
266 goto unwind_and_return;
267 }
268 }
269
270 // Lock if necessary
271 BasicObjectLock *monitor;
272 monitor = NULL;
273 if (method->is_synchronized()) {
274 monitor = (BasicObjectLock*) istate->stack_base();
275 oop lockee = monitor->obj();
276 markOop disp = lockee->mark()->set_unlocked();
277
278 monitor->lock()->set_displaced_header(disp);
279 if (Atomic::cmpxchg_ptr(monitor, lockee->mark_addr(), disp) != disp) {
280 if (thread->is_lock_owned((address) disp->clear_lock_bits())) {
281 monitor->lock()->set_displaced_header(NULL);
282 }
283 else {
284 CALL_VM_NOCHECK(InterpreterRuntime::monitorenter(thread, monitor));
285 if (HAS_PENDING_EXCEPTION)
286 goto unwind_and_return;
287 }
288 }
289 }
290
291 // Get the signature handler
292 InterpreterRuntime::SignatureHandler *handler; {
293 address handlerAddr = method->signature_handler();
294 if (handlerAddr == NULL) {
295 CALL_VM_NOCHECK(InterpreterRuntime::prepare_native_call(thread, method));
296 if (HAS_PENDING_EXCEPTION)
297 goto unlock_unwind_and_return;
298
299 handlerAddr = method->signature_handler();
300 assert(handlerAddr != NULL, "eh?");
301 }
302 if (handlerAddr == (address) InterpreterRuntime::slow_signature_handler) {
303 CALL_VM_NOCHECK(handlerAddr =
304 InterpreterRuntime::slow_signature_handler(thread, method, NULL,NULL));
305 if (HAS_PENDING_EXCEPTION)
306 goto unlock_unwind_and_return;
307 }
308 handler = \
309 InterpreterRuntime::SignatureHandler::from_handlerAddr(handlerAddr);
310 }
311
312 // Get the native function entry point
313 address function;
314 function = method->native_function();
315 assert(function != NULL, "should be set if signature handler is");
316
317 // Build the argument list
318 stack->overflow_check(handler->argument_count() * 2, THREAD);
319 if (HAS_PENDING_EXCEPTION)
320 goto unlock_unwind_and_return;
321
322 void **arguments;
323 void *mirror; {
324 arguments =
325 (void **) stack->alloc(handler->argument_count() * sizeof(void **));
326 void **dst = arguments;
327
328 void *env = thread->jni_environment();
329 *(dst++) = &env;
330
331 if (method->is_static()) {
332 istate->set_oop_temp(
333 method->constants()->pool_holder()->java_mirror());
334 mirror = istate->oop_temp_addr();
335 *(dst++) = &mirror;
336 }
337
338 intptr_t *src = locals;
339 for (int i = dst - arguments; i < handler->argument_count(); i++) {
340 ffi_type *type = handler->argument_type(i);
341 if (type == &ffi_type_pointer) {
342 if (*src) {
343 stack->push((intptr_t) src);
344 *(dst++) = stack->sp();
345 }
346 else {
347 *(dst++) = src;
348 }
349 src--;
350 }
351 else if (type->size == 4) {
352 *(dst++) = src--;
353 }
354 else if (type->size == 8) {
355 src--;
356 *(dst++) = src--;
357 }
358 else {
359 ShouldNotReachHere();
360 }
361 }
362 }
363
364 // Set up the Java frame anchor
365 thread->set_last_Java_frame();
366
367 // Change the thread state to _thread_in_native
368 ThreadStateTransition::transition_from_java(thread, _thread_in_native);
369
370 // Make the call
371 intptr_t result[4 - LogBytesPerWord];
372 ffi_call(handler->cif(), (void (*)()) function, result, arguments);
373
374 // Change the thread state back to _thread_in_Java.
375 // ThreadStateTransition::transition_from_native() cannot be used
376 // here because it does not check for asynchronous exceptions.
377 // We have to manage the transition ourself.
378 thread->set_thread_state(_thread_in_native_trans);
379
380 // Make sure new state is visible in the GC thread
381 if (os::is_MP()) {
382 if (UseMembar) {
383 OrderAccess::fence();
384 }
385 else {
386 InterfaceSupport::serialize_memory(thread);
387 }
388 }
389
390 // Handle safepoint operations, pending suspend requests,
391 // and pending asynchronous exceptions.
392 if (SafepointSynchronize::do_call_back() ||
393 thread->has_special_condition_for_native_trans()) {
394 JavaThread::check_special_condition_for_native_trans(thread);
395 CHECK_UNHANDLED_OOPS_ONLY(thread->clear_unhandled_oops());
396 }
397
398 // Finally we can change the thread state to _thread_in_Java.
399 thread->set_thread_state(_thread_in_Java);
400 fixup_after_potential_safepoint();
401
402 // Clear the frame anchor
403 thread->reset_last_Java_frame();
404
405 // If the result was an oop then unbox it and store it in
406 // oop_temp where the garbage collector can see it before
407 // we release the handle it might be protected by.
408 if (handler->result_type() == &ffi_type_pointer) {
409 if (result[0])
410 istate->set_oop_temp(*(oop *) result[0]);
411 else
412 istate->set_oop_temp(NULL);
413 }
414
415 // Reset handle block
416 thread->active_handles()->clear();
417
418 unlock_unwind_and_return:
419
420 // Unlock if necessary
421 if (monitor) {
422 BasicLock *lock = monitor->lock();
423 markOop header = lock->displaced_header();
424 oop rcvr = monitor->obj();
425 monitor->set_obj(NULL);
426
427 if (header != NULL) {
428 if (Atomic::cmpxchg_ptr(header, rcvr->mark_addr(), lock) != lock) {
429 monitor->set_obj(rcvr); {
430 HandleMark hm(thread);
431 CALL_VM_NOCHECK(InterpreterRuntime::monitorexit(thread, monitor));
432 }
433 }
434 }
435 }
436
437 unwind_and_return:
438
439 // Unwind the current activation
440 thread->pop_zero_frame();
441
442 // Pop our parameters
443 stack->set_sp(stack->sp() + method->size_of_parameters());
444
445 // Push our result
446 if (!HAS_PENDING_EXCEPTION) {
447 BasicType type = method->result_type();
448 stack->set_sp(stack->sp() - type2size[type]);
449
450 switch (type) {
451 case T_VOID:
452 break;
453
454 case T_BOOLEAN:
455 #ifndef VM_LITTLE_ENDIAN
456 result[0] <<= (BitsPerWord - BitsPerByte);
457 #endif
458 SET_LOCALS_INT(*(jboolean *) result != 0, 0);
459 break;
460
461 case T_CHAR:
462 #ifndef VM_LITTLE_ENDIAN
463 result[0] <<= (BitsPerWord - BitsPerShort);
464 #endif
465 SET_LOCALS_INT(*(jchar *) result, 0);
466 break;
467
468 case T_BYTE:
469 #ifndef VM_LITTLE_ENDIAN
470 result[0] <<= (BitsPerWord - BitsPerByte);
471 #endif
472 SET_LOCALS_INT(*(jbyte *) result, 0);
473 break;
474
475 case T_SHORT:
476 #ifndef VM_LITTLE_ENDIAN
477 result[0] <<= (BitsPerWord - BitsPerShort);
478 #endif
479 SET_LOCALS_INT(*(jshort *) result, 0);
480 break;
481
482 case T_INT:
483 #ifndef VM_LITTLE_ENDIAN
484 result[0] <<= (BitsPerWord - BitsPerInt);
485 #endif
486 SET_LOCALS_INT(*(jint *) result, 0);
487 break;
488
489 case T_LONG:
490 SET_LOCALS_LONG(*(jlong *) result, 0);
491 break;
492
493 case T_FLOAT:
494 SET_LOCALS_FLOAT(*(jfloat *) result, 0);
495 break;
496
497 case T_DOUBLE:
498 SET_LOCALS_DOUBLE(*(jdouble *) result, 0);
499 break;
500
501 case T_OBJECT:
502 case T_ARRAY:
503 SET_LOCALS_OBJECT(istate->oop_temp(), 0);
504 break;
505
506 default:
507 ShouldNotReachHere();
508 }
509 }
510
511 // No deoptimized frames on the stack
512 return 0;
513 }
514
515 int CppInterpreter::accessor_entry(Method* method, intptr_t UNUSED, TRAPS) {
516 JavaThread *thread = (JavaThread *) THREAD;
517 ZeroStack *stack = thread->zero_stack();
518 intptr_t *locals = stack->sp();
519
520 // Drop into the slow path if we need a safepoint check
521 if (SafepointSynchronize::do_call_back()) {
522 return normal_entry(method, 0, THREAD);
523 }
524
525 // Load the object pointer and drop into the slow path
526 // if we have a NullPointerException
527 oop object = LOCALS_OBJECT(0);
528 if (object == NULL) {
529 return normal_entry(method, 0, THREAD);
530 }
531
532 // Read the field index from the bytecode, which looks like this:
533 // 0: aload_0
534 // 1: getfield
535 // 2: index
536 // 3: index
537 // 4: ireturn/areturn/freturn/lreturn/dreturn
538 // NB this is not raw bytecode: index is in machine order
539 u1 *code = method->code_base();
540 assert(code[0] == Bytecodes::_aload_0 &&
541 code[1] == Bytecodes::_getfield &&
542 (code[4] == Bytecodes::_ireturn ||
543 code[4] == Bytecodes::_freturn ||
544 code[4] == Bytecodes::_lreturn ||
545 code[4] == Bytecodes::_dreturn ||
546 code[4] == Bytecodes::_areturn), "should do");
547 u2 index = Bytes::get_native_u2(&code[2]);
548
549 // Get the entry from the constant pool cache, and drop into
550 // the slow path if it has not been resolved
551 ConstantPoolCache* cache = method->constants()->cache();
552 ConstantPoolCacheEntry* entry = cache->entry_at(index);
553 if (!entry->is_resolved(Bytecodes::_getfield)) {
554 return normal_entry(method, 0, THREAD);
555 }
556
557 // Get the result and push it onto the stack
558 switch (entry->flag_state()) {
559 case ltos:
560 case dtos:
561 stack->overflow_check(1, CHECK_0);
562 stack->alloc(wordSize);
563 break;
564 }
565 if (entry->is_volatile()) {
566 switch (entry->flag_state()) {
567 case ctos:
568 SET_LOCALS_INT(object->char_field_acquire(entry->f2_as_index()), 0);
569 break;
570
571 case btos:
572 case ztos:
573 SET_LOCALS_INT(object->byte_field_acquire(entry->f2_as_index()), 0);
574 break;
575
576 case stos:
577 SET_LOCALS_INT(object->short_field_acquire(entry->f2_as_index()), 0);
578 break;
579
580 case itos:
581 SET_LOCALS_INT(object->int_field_acquire(entry->f2_as_index()), 0);
582 break;
583
584 case ltos:
585 SET_LOCALS_LONG(object->long_field_acquire(entry->f2_as_index()), 0);
586 break;
587
588 case ftos:
589 SET_LOCALS_FLOAT(object->float_field_acquire(entry->f2_as_index()), 0);
590 break;
591
592 case dtos:
593 SET_LOCALS_DOUBLE(object->double_field_acquire(entry->f2_as_index()), 0);
594 break;
595
596 case atos:
597 SET_LOCALS_OBJECT(object->obj_field_acquire(entry->f2_as_index()), 0);
598 break;
599
600 default:
601 ShouldNotReachHere();
602 }
603 }
604 else {
605 switch (entry->flag_state()) {
606 case ctos:
607 SET_LOCALS_INT(object->char_field(entry->f2_as_index()), 0);
608 break;
609
610 case btos:
611 case ztos:
612 SET_LOCALS_INT(object->byte_field(entry->f2_as_index()), 0);
613 break;
614
615 case stos:
616 SET_LOCALS_INT(object->short_field(entry->f2_as_index()), 0);
617 break;
618
619 case itos:
620 SET_LOCALS_INT(object->int_field(entry->f2_as_index()), 0);
621 break;
622
623 case ltos:
624 SET_LOCALS_LONG(object->long_field(entry->f2_as_index()), 0);
625 break;
626
627 case ftos:
628 SET_LOCALS_FLOAT(object->float_field(entry->f2_as_index()), 0);
629 break;
630
631 case dtos:
632 SET_LOCALS_DOUBLE(object->double_field(entry->f2_as_index()), 0);
633 break;
634
635 case atos:
636 SET_LOCALS_OBJECT(object->obj_field(entry->f2_as_index()), 0);
637 break;
638
639 default:
640 ShouldNotReachHere();
641 }
642 }
643
644 // No deoptimized frames on the stack
645 return 0;
646 }
647
648 int CppInterpreter::empty_entry(Method* method, intptr_t UNUSED, TRAPS) {
649 JavaThread *thread = (JavaThread *) THREAD;
650 ZeroStack *stack = thread->zero_stack();
651
652 // Drop into the slow path if we need a safepoint check
653 if (SafepointSynchronize::do_call_back()) {
654 return normal_entry(method, 0, THREAD);
655 }
656
657 // Pop our parameters
658 stack->set_sp(stack->sp() + method->size_of_parameters());
659
660 // No deoptimized frames on the stack
661 return 0;
662 }
663
664 // The new slots will be inserted before slot insert_before.
665 // Slots < insert_before will have the same slot number after the insert.
666 // Slots >= insert_before will become old_slot + num_slots.
667 void CppInterpreter::insert_vmslots(int insert_before, int num_slots, TRAPS) {
668 JavaThread *thread = (JavaThread *) THREAD;
669 ZeroStack *stack = thread->zero_stack();
670
671 // Allocate the space
672 stack->overflow_check(num_slots, CHECK);
673 stack->alloc(num_slots * wordSize);
674 intptr_t *vmslots = stack->sp();
675
676 // Shuffle everything up
677 for (int i = 0; i < insert_before; i++)
678 SET_VMSLOTS_SLOT(VMSLOTS_SLOT(i + num_slots), i);
679 }
680
681 void CppInterpreter::remove_vmslots(int first_slot, int num_slots, TRAPS) {
682 JavaThread *thread = (JavaThread *) THREAD;
683 ZeroStack *stack = thread->zero_stack();
684 intptr_t *vmslots = stack->sp();
685
686 // Move everything down
687 for (int i = first_slot - 1; i >= 0; i--)
688 SET_VMSLOTS_SLOT(VMSLOTS_SLOT(i), i + num_slots);
689
690 // Deallocate the space
691 stack->set_sp(stack->sp() + num_slots);
692 }
693
694 BasicType CppInterpreter::result_type_of_handle(oop method_handle) {
695 oop method_type = java_lang_invoke_MethodHandle::type(method_handle);
696 oop return_type = java_lang_invoke_MethodType::rtype(method_type);
697 return java_lang_Class::as_BasicType(return_type, (Klass* *) NULL);
698 }
699
700 intptr_t* CppInterpreter::calculate_unwind_sp(ZeroStack* stack,
701 oop method_handle) {
702 oop method_type = java_lang_invoke_MethodHandle::type(method_handle);
703 int argument_slots = java_lang_invoke_MethodType::ptype_slot_count(method_type);
704
705 return stack->sp() + argument_slots;
706 }
707
708 IRT_ENTRY(void, CppInterpreter::throw_exception(JavaThread* thread,
709 Symbol* name,
710 char* message))
711 THROW_MSG(name, message);
712 IRT_END
713
714 InterpreterFrame *InterpreterFrame::build(Method* const method, TRAPS) {
715 JavaThread *thread = (JavaThread *) THREAD;
716 ZeroStack *stack = thread->zero_stack();
717
718 // Calculate the size of the frame we'll build, including
719 // any adjustments to the caller's frame that we'll make.
720 int extra_locals = 0;
721 int monitor_words = 0;
722 int stack_words = 0;
723
724 if (!method->is_native()) {
725 extra_locals = method->max_locals() - method->size_of_parameters();
726 stack_words = method->max_stack();
727 }
728 if (method->is_synchronized()) {
729 monitor_words = frame::interpreter_frame_monitor_size();
730 }
731 stack->overflow_check(
732 extra_locals + header_words + monitor_words + stack_words, CHECK_NULL);
733
734 // Adjust the caller's stack frame to accomodate any additional
735 // local variables we have contiguously with our parameters.
736 for (int i = 0; i < extra_locals; i++)
737 stack->push(0);
738
739 intptr_t *locals;
740 if (method->is_native())
741 locals = stack->sp() + (method->size_of_parameters() - 1);
742 else
743 locals = stack->sp() + (method->max_locals() - 1);
744
745 stack->push(0); // next_frame, filled in later
746 intptr_t *fp = stack->sp();
747 assert(fp - stack->sp() == next_frame_off, "should be");
748
749 stack->push(INTERPRETER_FRAME);
750 assert(fp - stack->sp() == frame_type_off, "should be");
751
752 interpreterState istate =
753 (interpreterState) stack->alloc(sizeof(BytecodeInterpreter));
754 assert(fp - stack->sp() == istate_off, "should be");
755
756 istate->set_locals(locals);
757 istate->set_method(method);
758 istate->set_mirror(method->method_holder()->java_mirror());
759 istate->set_self_link(istate);
760 istate->set_prev_link(NULL);
761 istate->set_thread(thread);
762 istate->set_bcp(method->is_native() ? NULL : method->code_base());
763 istate->set_constants(method->constants()->cache());
764 istate->set_msg(BytecodeInterpreter::method_entry);
765 istate->set_oop_temp(NULL);
766 istate->set_mdx(NULL);
767 istate->set_callee(NULL);
768
769 istate->set_monitor_base((BasicObjectLock *) stack->sp());
770 if (method->is_synchronized()) {
771 BasicObjectLock *monitor =
772 (BasicObjectLock *) stack->alloc(monitor_words * wordSize);
773 oop object;
774 if (method->is_static())
775 object = method->constants()->pool_holder()->java_mirror();
776 else
777 object = (oop) (void*)locals[0];
778 monitor->set_obj(object);
779 }
780
781 istate->set_stack_base(stack->sp());
782 istate->set_stack(stack->sp() - 1);
783 if (stack_words)
784 stack->alloc(stack_words * wordSize);
785 istate->set_stack_limit(stack->sp() - 1);
786
787 return (InterpreterFrame *) fp;
788 }
789
790 InterpreterFrame *InterpreterFrame::build(int size, TRAPS) {
791 ZeroStack *stack = ((JavaThread *) THREAD)->zero_stack();
792
793 int size_in_words = size >> LogBytesPerWord;
794 assert(size_in_words * wordSize == size, "unaligned");
795 assert(size_in_words >= header_words, "too small");
796 stack->overflow_check(size_in_words, CHECK_NULL);
797
798 stack->push(0); // next_frame, filled in later
799 intptr_t *fp = stack->sp();
800 assert(fp - stack->sp() == next_frame_off, "should be");
801
802 stack->push(INTERPRETER_FRAME);
803 assert(fp - stack->sp() == frame_type_off, "should be");
804
805 interpreterState istate =
806 (interpreterState) stack->alloc(sizeof(BytecodeInterpreter));
807 assert(fp - stack->sp() == istate_off, "should be");
808 istate->set_self_link(NULL); // mark invalid
809
810 stack->alloc((size_in_words - header_words) * wordSize);
811
812 return (InterpreterFrame *) fp;
813 }
814
815 address CppInterpreter::return_entry(TosState state, int length, Bytecodes::Code code) {
816 ShouldNotCallThis();
817 return NULL;
818 }
819
820 address CppInterpreter::deopt_entry(TosState state, int length) {
821 return NULL;
822 }
823
824 // Helper for figuring out if frames are interpreter frames
825
826 bool CppInterpreter::contains(address pc) {
827 return false; // make frame::print_value_on work
828 }
829 #endif // CC_INTERP