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