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