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