1 /*
2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "interpreter/interpreter.hpp"
27 #include "memory/resourceArea.hpp"
28 #include "oops/markOop.hpp"
29 #include "oops/method.hpp"
30 #include "oops/oop.inline.hpp"
31 #include "prims/methodHandles.hpp"
32 #include "runtime/frame.inline.hpp"
33 #include "runtime/handles.inline.hpp"
34 #include "runtime/javaCalls.hpp"
35 #include "runtime/monitorChunk.hpp"
36 #include "runtime/os.hpp"
37 #include "runtime/signature.hpp"
38 #include "runtime/stubCodeGenerator.hpp"
39 #include "runtime/stubRoutines.hpp"
40 #include "vmreg_x86.inline.hpp"
41 #ifdef COMPILER1
42 #include "c1/c1_Runtime1.hpp"
43 #include "runtime/vframeArray.hpp"
44 #endif
45
46 #ifdef ASSERT
47 void RegisterMap::check_location_valid() {
48 }
49 #endif
50
51 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
52
53 // Profiling/safepoint support
54
55 bool frame::safe_for_sender(JavaThread *thread) {
56 address sp = (address)_sp;
57 address fp = (address)_fp;
58 address unextended_sp = (address)_unextended_sp;
59
60 // consider stack guards when trying to determine "safe" stack pointers
61 static size_t stack_guard_size = os::uses_stack_guard_pages() ? (StackYellowPages + StackRedPages) * os::vm_page_size() : 0;
62 size_t usable_stack_size = thread->stack_size() - stack_guard_size;
63
64 // sp must be within the usable part of the stack (not in guards)
65 bool sp_safe = (sp < thread->stack_base()) &&
66 (sp >= thread->stack_base() - usable_stack_size);
67
68
69 if (!sp_safe) {
70 return false;
71 }
72
73 // unextended sp must be within the stack and above or equal sp
74 bool unextended_sp_safe = (unextended_sp < thread->stack_base()) &&
75 (unextended_sp >= sp);
76
77 if (!unextended_sp_safe) {
78 return false;
79 }
80
81 // an fp must be within the stack and above (but not equal) sp
82 // second evaluation on fp+ is added to handle situation where fp is -1
83 bool fp_safe = (fp < thread->stack_base() && (fp > sp) && (((fp + (return_addr_offset * sizeof(void*))) < thread->stack_base())));
84
85 // We know sp/unextended_sp are safe only fp is questionable here
86
87 // If the current frame is known to the code cache then we can attempt to
88 // to construct the sender and do some validation of it. This goes a long way
89 // toward eliminating issues when we get in frame construction code
90
91 if (_cb != NULL ) {
92
93 // First check if frame is complete and tester is reliable
94 // Unfortunately we can only check frame complete for runtime stubs and nmethod
95 // other generic buffer blobs are more problematic so we just assume they are
96 // ok. adapter blobs never have a frame complete and are never ok.
97
98 if (!_cb->is_frame_complete_at(_pc)) {
99 if (_cb->is_nmethod() || _cb->is_adapter_blob() || _cb->is_runtime_stub()) {
100 return false;
101 }
102 }
103
104 // Could just be some random pointer within the codeBlob
105 if (!_cb->code_contains(_pc)) {
106 return false;
107 }
108
109 // Entry frame checks
110 if (is_entry_frame()) {
111 // an entry frame must have a valid fp.
112
113 if (!fp_safe) return false;
114
115 // Validate the JavaCallWrapper an entry frame must have
116
117 address jcw = (address)entry_frame_call_wrapper();
118
119 bool jcw_safe = (jcw < thread->stack_base()) && ( jcw > fp);
120
121 return jcw_safe;
122
123 }
124
125 intptr_t* sender_sp = NULL;
126 address sender_pc = NULL;
127
128 if (is_interpreted_frame()) {
129 // fp must be safe
130 if (!fp_safe) {
131 return false;
132 }
133
134 sender_pc = (address) this->fp()[return_addr_offset];
135 sender_sp = (intptr_t*) addr_at(sender_sp_offset);
136
137 } else {
138 // must be some sort of compiled/runtime frame
139 // fp does not have to be safe (although it could be check for c1?)
140
141 // check for a valid frame_size, otherwise we are unlikely to get a valid sender_pc
142 if (_cb->frame_size() <= 0) {
143 return false;
144 }
145
146 sender_sp = _unextended_sp + _cb->frame_size();
147 // On Intel the return_address is always the word on the stack
148 sender_pc = (address) *(sender_sp-1);
149 }
150
151
152 // If the potential sender is the interpreter then we can do some more checking
153 if (Interpreter::contains(sender_pc)) {
154
155 // ebp is always saved in a recognizable place in any code we generate. However
156 // only if the sender is interpreted/call_stub (c1 too?) are we certain that the saved ebp
157 // is really a frame pointer.
158
159 intptr_t *saved_fp = (intptr_t*)*(sender_sp - frame::sender_sp_offset);
160 bool saved_fp_safe = ((address)saved_fp < thread->stack_base()) && (saved_fp > sender_sp);
161
162 if (!saved_fp_safe) {
163 return false;
164 }
165
166 // construct the potential sender
167
168 frame sender(sender_sp, saved_fp, sender_pc);
169
170 return sender.is_interpreted_frame_valid(thread);
171
172 }
173
174 // We must always be able to find a recognizable pc
175 CodeBlob* sender_blob = CodeCache::find_blob_unsafe(sender_pc);
176 if (sender_pc == NULL || sender_blob == NULL) {
177 return false;
178 }
179
180 // Could be a zombie method
181 if (sender_blob->is_zombie() || sender_blob->is_unloaded()) {
182 return false;
183 }
184
185 // Could just be some random pointer within the codeBlob
186 if (!sender_blob->code_contains(sender_pc)) {
187 return false;
188 }
189
190 // We should never be able to see an adapter if the current frame is something from code cache
191 if (sender_blob->is_adapter_blob()) {
192 return false;
193 }
194
195 // Could be the call_stub
196 if (StubRoutines::returns_to_call_stub(sender_pc)) {
197 intptr_t *saved_fp = (intptr_t*)*(sender_sp - frame::sender_sp_offset);
198 bool saved_fp_safe = ((address)saved_fp < thread->stack_base()) && (saved_fp > sender_sp);
199
200 if (!saved_fp_safe) {
201 return false;
202 }
203
204 // construct the potential sender
205
206 frame sender(sender_sp, saved_fp, sender_pc);
207
208 // Validate the JavaCallWrapper an entry frame must have
209 address jcw = (address)sender.entry_frame_call_wrapper();
210
211 bool jcw_safe = (jcw < thread->stack_base()) && ( jcw > (address)sender.fp());
212
213 return jcw_safe;
214 }
215
216 if (sender_blob->is_nmethod()) {
217 nmethod* nm = sender_blob->as_nmethod_or_null();
218 if (nm != NULL) {
219 if (nm->is_deopt_mh_entry(sender_pc) || nm->is_deopt_entry(sender_pc) ||
220 nm->method()->is_method_handle_intrinsic()) {
221 return false;
222 }
223 }
224 }
225
226 // If the frame size is 0 something (or less) is bad because every nmethod has a non-zero frame size
227 // because the return address counts against the callee's frame.
228
229 if (sender_blob->frame_size() <= 0) {
230 assert(!sender_blob->is_nmethod(), "should count return address at least");
231 return false;
232 }
233
234 // We should never be able to see anything here except an nmethod. If something in the
235 // code cache (current frame) is called by an entity within the code cache that entity
236 // should not be anything but the call stub (already covered), the interpreter (already covered)
237 // or an nmethod.
238
239 if (!sender_blob->is_nmethod()) {
240 return false;
241 }
242
243 // Could put some more validation for the potential non-interpreted sender
244 // frame we'd create by calling sender if I could think of any. Wait for next crash in forte...
245
246 // One idea is seeing if the sender_pc we have is one that we'd expect to call to current cb
247
248 // We've validated the potential sender that would be created
249 return true;
250 }
251
252 // Must be native-compiled frame. Since sender will try and use fp to find
253 // linkages it must be safe
254
255 if (!fp_safe) {
256 return false;
257 }
258
259 // Will the pc we fetch be non-zero (which we'll find at the oldest frame)
260
261 if ( (address) this->fp()[return_addr_offset] == NULL) return false;
262
263
264 // could try and do some more potential verification of native frame if we could think of some...
265
266 return true;
267
268 }
269
270
271 void frame::patch_pc(Thread* thread, address pc) {
272 address* pc_addr = &(((address*) sp())[-1]);
273 if (TracePcPatching) {
274 tty->print_cr("patch_pc at address " INTPTR_FORMAT " [" INTPTR_FORMAT " -> " INTPTR_FORMAT "]",
275 pc_addr, *pc_addr, pc);
276 }
277 // Either the return address is the original one or we are going to
278 // patch in the same address that's already there.
279 assert(_pc == *pc_addr || pc == *pc_addr, "must be");
280 *pc_addr = pc;
281 _cb = CodeCache::find_blob(pc);
282 address original_pc = nmethod::get_deopt_original_pc(this);
283 if (original_pc != NULL) {
284 assert(original_pc == _pc, "expected original PC to be stored before patching");
285 _deopt_state = is_deoptimized;
286 // leave _pc as is
287 } else {
288 _deopt_state = not_deoptimized;
289 _pc = pc;
290 }
291 }
292
293 bool frame::is_interpreted_frame() const {
294 return Interpreter::contains(pc());
295 }
296
297 int frame::frame_size(RegisterMap* map) const {
298 frame sender = this->sender(map);
299 return sender.sp() - sp();
300 }
301
302 intptr_t* frame::entry_frame_argument_at(int offset) const {
303 // convert offset to index to deal with tsi
304 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize);
305 // Entry frame's arguments are always in relation to unextended_sp()
306 return &unextended_sp()[index];
307 }
308
309 // sender_sp
310 #ifdef CC_INTERP
311 intptr_t* frame::interpreter_frame_sender_sp() const {
312 assert(is_interpreted_frame(), "interpreted frame expected");
313 // QQQ why does this specialize method exist if frame::sender_sp() does same thing?
314 // seems odd and if we always know interpreted vs. non then sender_sp() is really
315 // doing too much work.
316 return get_interpreterState()->sender_sp();
317 }
318
319 // monitor elements
320
321 BasicObjectLock* frame::interpreter_frame_monitor_begin() const {
322 return get_interpreterState()->monitor_base();
323 }
324
325 BasicObjectLock* frame::interpreter_frame_monitor_end() const {
326 return (BasicObjectLock*) get_interpreterState()->stack_base();
327 }
328
329 #else // CC_INTERP
330
331 intptr_t* frame::interpreter_frame_sender_sp() const {
332 assert(is_interpreted_frame(), "interpreted frame expected");
333 return (intptr_t*) at(interpreter_frame_sender_sp_offset);
334 }
335
336 void frame::set_interpreter_frame_sender_sp(intptr_t* sender_sp) {
337 assert(is_interpreted_frame(), "interpreted frame expected");
338 ptr_at_put(interpreter_frame_sender_sp_offset, (intptr_t) sender_sp);
339 }
340
341
342 // monitor elements
343
344 BasicObjectLock* frame::interpreter_frame_monitor_begin() const {
345 return (BasicObjectLock*) addr_at(interpreter_frame_monitor_block_bottom_offset);
346 }
347
348 BasicObjectLock* frame::interpreter_frame_monitor_end() const {
349 BasicObjectLock* result = (BasicObjectLock*) *addr_at(interpreter_frame_monitor_block_top_offset);
350 // make sure the pointer points inside the frame
351 assert(sp() <= (intptr_t*) result, "monitor end should be above the stack pointer");
352 assert((intptr_t*) result < fp(), "monitor end should be strictly below the frame pointer");
353 return result;
354 }
355
356 void frame::interpreter_frame_set_monitor_end(BasicObjectLock* value) {
357 *((BasicObjectLock**)addr_at(interpreter_frame_monitor_block_top_offset)) = value;
358 }
359
360 // Used by template based interpreter deoptimization
361 void frame::interpreter_frame_set_last_sp(intptr_t* sp) {
362 *((intptr_t**)addr_at(interpreter_frame_last_sp_offset)) = sp;
363 }
364 #endif // CC_INTERP
365
366 frame frame::sender_for_entry_frame(RegisterMap* map) const {
367 assert(map != NULL, "map must be set");
368 // Java frame called from C; skip all C frames and return top C
369 // frame of that chunk as the sender
370 JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor();
371 assert(!entry_frame_is_first(), "next Java fp must be non zero");
372 assert(jfa->last_Java_sp() > sp(), "must be above this frame on stack");
373 map->clear();
374 assert(map->include_argument_oops(), "should be set by clear");
375 if (jfa->last_Java_pc() != NULL ) {
376 frame fr(jfa->last_Java_sp(), jfa->last_Java_fp(), jfa->last_Java_pc());
377 return fr;
378 }
379 frame fr(jfa->last_Java_sp(), jfa->last_Java_fp());
380 return fr;
381 }
382
383 //------------------------------------------------------------------------------
384 // frame::verify_deopt_original_pc
385 //
386 // Verifies the calculated original PC of a deoptimization PC for the
387 // given unextended SP.
388 #ifdef ASSERT
389 void frame::verify_deopt_original_pc(nmethod* nm, intptr_t* unextended_sp) {
390 frame fr;
391
392 // This is ugly but it's better than to change {get,set}_original_pc
393 // to take an SP value as argument. And it's only a debugging
394 // method anyway.
395 fr._unextended_sp = unextended_sp;
396
397 address original_pc = nm->get_original_pc(&fr);
398 assert(nm->insts_contains(original_pc), "original PC must be in nmethod");
399 }
400 #endif
401
402 //------------------------------------------------------------------------------
403 // frame::adjust_unextended_sp
404 void frame::adjust_unextended_sp() {
405 // On x86, sites calling method handle intrinsics and lambda forms are treated
406 // as any other call site. Therefore, no special action is needed when we are
407 // returning to any of these call sites.
408
409 nmethod* sender_nm = (_cb == NULL) ? NULL : _cb->as_nmethod_or_null();
410 if (sender_nm != NULL) {
411 // If the sender PC is a deoptimization point, get the original PC.
412 if (sender_nm->is_deopt_entry(_pc) ||
413 sender_nm->is_deopt_mh_entry(_pc)) {
414 DEBUG_ONLY(verify_deopt_original_pc(sender_nm, _unextended_sp));
415 }
416 }
417 }
418
419 //------------------------------------------------------------------------------
420 // frame::update_map_with_saved_link
421 void frame::update_map_with_saved_link(RegisterMap* map, intptr_t** link_addr) {
422 // The interpreter and compiler(s) always save EBP/RBP in a known
423 // location on entry. We must record where that location is
424 // so this if EBP/RBP was live on callout from c2 we can find
425 // the saved copy no matter what it called.
426
427 // Since the interpreter always saves EBP/RBP if we record where it is then
428 // we don't have to always save EBP/RBP on entry and exit to c2 compiled
429 // code, on entry will be enough.
430 map->set_location(rbp->as_VMReg(), (address) link_addr);
431 #ifdef AMD64
432 // this is weird "H" ought to be at a higher address however the
433 // oopMaps seems to have the "H" regs at the same address and the
434 // vanilla register.
435 // XXXX make this go away
436 if (true) {
437 map->set_location(rbp->as_VMReg()->next(), (address) link_addr);
438 }
439 #endif // AMD64
440 }
441
442
443 //------------------------------------------------------------------------------
444 // frame::sender_for_interpreter_frame
445 frame frame::sender_for_interpreter_frame(RegisterMap* map) const {
446 // SP is the raw SP from the sender after adapter or interpreter
447 // extension.
448 intptr_t* sender_sp = this->sender_sp();
449
450 // This is the sp before any possible extension (adapter/locals).
451 intptr_t* unextended_sp = interpreter_frame_sender_sp();
452
453 #ifdef COMPILER2
454 if (map->update_map()) {
455 update_map_with_saved_link(map, (intptr_t**) addr_at(link_offset));
456 }
457 #endif // COMPILER2
458
459 return frame(sender_sp, unextended_sp, link(), sender_pc());
460 }
461
462
463 //------------------------------------------------------------------------------
464 // frame::sender_for_compiled_frame
465 frame frame::sender_for_compiled_frame(RegisterMap* map) const {
466 assert(map != NULL, "map must be set");
467
468 // frame owned by optimizing compiler
469 assert(_cb->frame_size() >= 0, "must have non-zero frame size");
470 intptr_t* sender_sp = unextended_sp() + _cb->frame_size();
471 intptr_t* unextended_sp = sender_sp;
472
473 // On Intel the return_address is always the word on the stack
474 address sender_pc = (address) *(sender_sp-1);
475
476 // This is the saved value of EBP which may or may not really be an FP.
477 // It is only an FP if the sender is an interpreter frame (or C1?).
478 intptr_t** saved_fp_addr = (intptr_t**) (sender_sp - frame::sender_sp_offset);
479
480 if (map->update_map()) {
481 // Tell GC to use argument oopmaps for some runtime stubs that need it.
482 // For C1, the runtime stub might not have oop maps, so set this flag
483 // outside of update_register_map.
484 map->set_include_argument_oops(_cb->caller_must_gc_arguments(map->thread()));
485 if (_cb->oop_maps() != NULL) {
486 OopMapSet::update_register_map(this, map);
487 }
488
489 // Since the prolog does the save and restore of EBP there is no oopmap
490 // for it so we must fill in its location as if there was an oopmap entry
491 // since if our caller was compiled code there could be live jvm state in it.
492 update_map_with_saved_link(map, saved_fp_addr);
493 }
494
495 assert(sender_sp != sp(), "must have changed");
496 return frame(sender_sp, unextended_sp, *saved_fp_addr, sender_pc);
497 }
498
499
500 //------------------------------------------------------------------------------
501 // frame::sender
502 frame frame::sender(RegisterMap* map) const {
503 // Default is we done have to follow them. The sender_for_xxx will
504 // update it accordingly
505 map->set_include_argument_oops(false);
506
507 if (is_entry_frame()) return sender_for_entry_frame(map);
508 if (is_interpreted_frame()) return sender_for_interpreter_frame(map);
509 assert(_cb == CodeCache::find_blob(pc()),"Must be the same");
510
511 if (_cb != NULL) {
512 return sender_for_compiled_frame(map);
513 }
514 // Must be native-compiled frame, i.e. the marshaling code for native
515 // methods that exists in the core system.
516 return frame(sender_sp(), link(), sender_pc());
517 }
518
519
520 bool frame::interpreter_frame_equals_unpacked_fp(intptr_t* fp) {
521 assert(is_interpreted_frame(), "must be interpreter frame");
522 Method* method = interpreter_frame_method();
523 // When unpacking an optimized frame the frame pointer is
524 // adjusted with:
525 int diff = (method->max_locals() - method->size_of_parameters()) *
526 Interpreter::stackElementWords;
527 return _fp == (fp - diff);
528 }
529
530 void frame::pd_gc_epilog() {
531 // nothing done here now
532 }
533
534 bool frame::is_interpreted_frame_valid(JavaThread* thread) const {
535 // QQQ
536 #ifdef CC_INTERP
537 #else
538 assert(is_interpreted_frame(), "Not an interpreted frame");
539 // These are reasonable sanity checks
540 if (fp() == 0 || (intptr_t(fp()) & (wordSize-1)) != 0) {
541 return false;
542 }
543 if (sp() == 0 || (intptr_t(sp()) & (wordSize-1)) != 0) {
544 return false;
545 }
546 if (fp() + interpreter_frame_initial_sp_offset < sp()) {
547 return false;
548 }
549 // These are hacks to keep us out of trouble.
550 // The problem with these is that they mask other problems
551 if (fp() <= sp()) { // this attempts to deal with unsigned comparison above
552 return false;
553 }
554
555 // do some validation of frame elements
556
557 // first the method
558
559 Method* m = *interpreter_frame_method_addr();
560
561 // validate the method we'd find in this potential sender
562 if (!m->is_valid_method()) return false;
563
564 // stack frames shouldn't be much larger than max_stack elements
565
566 if (fp() - sp() > 1024 + m->max_stack()*Interpreter::stackElementSize) {
567 return false;
568 }
569
570 // validate bci/bcx
571
572 intptr_t bcx = interpreter_frame_bcx();
573 if (m->validate_bci_from_bcx(bcx) < 0) {
574 return false;
575 }
576
577 // validate ConstantPoolCache*
578 ConstantPoolCache* cp = *interpreter_frame_cache_addr();
579 if (cp == NULL || !cp->is_metaspace_object()) return false;
580
581 // validate locals
582
583 address locals = (address) *interpreter_frame_locals_addr();
584
585 if (locals > thread->stack_base() || locals < (address) fp()) return false;
586
587 // We'd have to be pretty unlucky to be mislead at this point
588
589 #endif // CC_INTERP
590 return true;
591 }
592
593 BasicType frame::interpreter_frame_result(oop* oop_result, jvalue* value_result) {
594 #ifdef CC_INTERP
595 // Needed for JVMTI. The result should always be in the
596 // interpreterState object
597 interpreterState istate = get_interpreterState();
598 #endif // CC_INTERP
599 assert(is_interpreted_frame(), "interpreted frame expected");
600 Method* method = interpreter_frame_method();
601 BasicType type = method->result_type();
602
603 intptr_t* tos_addr;
604 if (method->is_native()) {
605 // Prior to calling into the runtime to report the method_exit the possible
606 // return value is pushed to the native stack. If the result is a jfloat/jdouble
607 // then ST0 is saved before EAX/EDX. See the note in generate_native_result
608 tos_addr = (intptr_t*)sp();
609 if (type == T_FLOAT || type == T_DOUBLE) {
610 // QQQ seems like this code is equivalent on the two platforms
611 #ifdef AMD64
612 // This is times two because we do a push(ltos) after pushing XMM0
613 // and that takes two interpreter stack slots.
614 tos_addr += 2 * Interpreter::stackElementWords;
615 #else
616 tos_addr += 2;
617 #endif // AMD64
618 }
619 } else {
620 tos_addr = (intptr_t*)interpreter_frame_tos_address();
621 }
622
623 switch (type) {
624 case T_OBJECT :
625 case T_ARRAY : {
626 oop obj;
627 if (method->is_native()) {
628 #ifdef CC_INTERP
629 obj = istate->_oop_temp;
630 #else
631 obj = cast_to_oop(at(interpreter_frame_oop_temp_offset));
632 #endif // CC_INTERP
633 } else {
634 oop* obj_p = (oop*)tos_addr;
635 obj = (obj_p == NULL) ? (oop)NULL : *obj_p;
636 }
637 assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check");
638 *oop_result = obj;
639 break;
640 }
641 case T_BOOLEAN : value_result->z = *(jboolean*)tos_addr; break;
642 case T_BYTE : value_result->b = *(jbyte*)tos_addr; break;
643 case T_CHAR : value_result->c = *(jchar*)tos_addr; break;
644 case T_SHORT : value_result->s = *(jshort*)tos_addr; break;
645 case T_INT : value_result->i = *(jint*)tos_addr; break;
646 case T_LONG : value_result->j = *(jlong*)tos_addr; break;
647 case T_FLOAT : {
648 #ifdef AMD64
649 value_result->f = *(jfloat*)tos_addr;
650 #else
651 if (method->is_native()) {
652 jdouble d = *(jdouble*)tos_addr; // Result was in ST0 so need to convert to jfloat
653 value_result->f = (jfloat)d;
654 } else {
655 value_result->f = *(jfloat*)tos_addr;
656 }
657 #endif // AMD64
658 break;
659 }
660 case T_DOUBLE : value_result->d = *(jdouble*)tos_addr; break;
661 case T_VOID : /* Nothing to do */ break;
662 default : ShouldNotReachHere();
663 }
664
665 return type;
666 }
667
668
669 intptr_t* frame::interpreter_frame_tos_at(jint offset) const {
670 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize);
671 return &interpreter_frame_tos_address()[index];
672 }
673
674 #ifndef PRODUCT
675
676 #define DESCRIBE_FP_OFFSET(name) \
677 values.describe(frame_no, fp() + frame::name##_offset, #name)
678
679 void frame::describe_pd(FrameValues& values, int frame_no) {
680 if (is_interpreted_frame()) {
681 DESCRIBE_FP_OFFSET(interpreter_frame_sender_sp);
682 DESCRIBE_FP_OFFSET(interpreter_frame_last_sp);
683 DESCRIBE_FP_OFFSET(interpreter_frame_method);
684 DESCRIBE_FP_OFFSET(interpreter_frame_mdx);
685 DESCRIBE_FP_OFFSET(interpreter_frame_cache);
686 DESCRIBE_FP_OFFSET(interpreter_frame_locals);
687 DESCRIBE_FP_OFFSET(interpreter_frame_bcx);
688 DESCRIBE_FP_OFFSET(interpreter_frame_initial_sp);
689 }
690 }
691 #endif
692
693 intptr_t *frame::initial_deoptimization_info() {
694 // used to reset the saved FP
695 return fp();
696 }
697
698 intptr_t* frame::real_fp() const {
699 if (_cb != NULL) {
700 // use the frame size if valid
701 int size = _cb->frame_size();
702 if (size > 0) {
703 return unextended_sp() + size;
704 }
705 }
706 // else rely on fp()
707 assert(! is_compiled_frame(), "unknown compiled frame size");
708 return fp();
709 }
710
711 #ifndef PRODUCT
712 // This is a generic constructor which is only used by pns() in debug.cpp.
713 frame::frame(void* sp, void* fp, void* pc) {
714 init((intptr_t*)sp, (intptr_t*)fp, (address)pc);
715 }
716 #endif