1 /*
2 * Copyright (c) 1997, 2017, 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 "code/codeCache.hpp"
27 #include "code/vmreg.inline.hpp"
28 #include "compiler/abstractCompiler.hpp"
29 #include "compiler/disassembler.hpp"
30 #include "gc/shared/collectedHeap.inline.hpp"
31 #include "interpreter/interpreter.hpp"
32 #include "interpreter/oopMapCache.hpp"
33 #include "memory/resourceArea.hpp"
34 #include "memory/universe.inline.hpp"
35 #include "oops/markOop.hpp"
36 #include "oops/method.hpp"
37 #include "oops/methodData.hpp"
38 #include "oops/oop.inline.hpp"
39 #include "oops/verifyOopClosure.hpp"
40 #include "prims/methodHandles.hpp"
41 #include "runtime/frame.inline.hpp"
42 #include "runtime/handles.inline.hpp"
43 #include "runtime/javaCalls.hpp"
44 #include "runtime/monitorChunk.hpp"
45 #include "runtime/os.hpp"
46 #include "runtime/sharedRuntime.hpp"
47 #include "runtime/signature.hpp"
48 #include "runtime/stubCodeGenerator.hpp"
49 #include "runtime/stubRoutines.hpp"
50 #include "runtime/thread.inline.hpp"
51 #include "utilities/debug.hpp"
52 #include "utilities/decoder.hpp"
53 #include "utilities/formatBuffer.hpp"
54
55 RegisterMap::RegisterMap(JavaThread *thread, bool update_map) {
56 _thread = thread;
57 _update_map = update_map;
58 clear();
59 debug_only(_update_for_id = NULL;)
60 #ifndef PRODUCT
61 for (int i = 0; i < reg_count ; i++ ) _location[i] = NULL;
62 #endif /* PRODUCT */
63 }
64
65 RegisterMap::RegisterMap(const RegisterMap* map) {
66 assert(map != this, "bad initialization parameter");
67 assert(map != NULL, "RegisterMap must be present");
68 _thread = map->thread();
69 _update_map = map->update_map();
70 _include_argument_oops = map->include_argument_oops();
71 debug_only(_update_for_id = map->_update_for_id;)
72 pd_initialize_from(map);
73 if (update_map()) {
74 for(int i = 0; i < location_valid_size; i++) {
75 LocationValidType bits = !update_map() ? 0 : map->_location_valid[i];
76 _location_valid[i] = bits;
77 // for whichever bits are set, pull in the corresponding map->_location
78 int j = i*location_valid_type_size;
79 while (bits != 0) {
80 if ((bits & 1) != 0) {
81 assert(0 <= j && j < reg_count, "range check");
82 _location[j] = map->_location[j];
83 }
84 bits >>= 1;
85 j += 1;
86 }
87 }
88 }
89 }
90
91 void RegisterMap::clear() {
92 set_include_argument_oops(true);
93 if (_update_map) {
94 for(int i = 0; i < location_valid_size; i++) {
95 _location_valid[i] = 0;
96 }
97 pd_clear();
98 } else {
99 pd_initialize();
100 }
101 }
102
103 #ifndef PRODUCT
104
105 void RegisterMap::print_on(outputStream* st) const {
106 st->print_cr("Register map");
107 for(int i = 0; i < reg_count; i++) {
108
109 VMReg r = VMRegImpl::as_VMReg(i);
110 intptr_t* src = (intptr_t*) location(r);
111 if (src != NULL) {
112
113 r->print_on(st);
114 st->print(" [" INTPTR_FORMAT "] = ", p2i(src));
115 if (((uintptr_t)src & (sizeof(*src)-1)) != 0) {
116 st->print_cr("<misaligned>");
117 } else {
118 st->print_cr(INTPTR_FORMAT, *src);
119 }
120 }
121 }
122 }
123
124 void RegisterMap::print() const {
125 print_on(tty);
126 }
127
128 #endif
129 // This returns the pc that if you were in the debugger you'd see. Not
130 // the idealized value in the frame object. This undoes the magic conversion
131 // that happens for deoptimized frames. In addition it makes the value the
132 // hardware would want to see in the native frame. The only user (at this point)
133 // is deoptimization. It likely no one else should ever use it.
134
135 address frame::raw_pc() const {
136 if (is_deoptimized_frame()) {
137 CompiledMethod* cm = cb()->as_compiled_method_or_null();
138 if (cm->is_method_handle_return(pc()))
139 return cm->deopt_mh_handler_begin() - pc_return_offset;
140 else
141 return cm->deopt_handler_begin() - pc_return_offset;
142 } else {
143 return (pc() - pc_return_offset);
144 }
145 }
146
147 // Change the pc in a frame object. This does not change the actual pc in
148 // actual frame. To do that use patch_pc.
149 //
150 void frame::set_pc(address newpc ) {
151 #ifdef ASSERT
152 if (_cb != NULL && _cb->is_nmethod()) {
153 assert(!((nmethod*)_cb)->is_deopt_pc(_pc), "invariant violation");
154 }
155 #endif // ASSERT
156
157 // Unsafe to use the is_deoptimzed tester after changing pc
158 _deopt_state = unknown;
159 _pc = newpc;
160 _cb = CodeCache::find_blob_unsafe(_pc);
161
162 }
163
164 // type testers
165 bool frame::is_ignored_frame() const {
166 return false; // FIXME: some LambdaForm frames should be ignored
167 }
168 bool frame::is_deoptimized_frame() const {
169 assert(_deopt_state != unknown, "not answerable");
170 return _deopt_state == is_deoptimized;
171 }
172
173 bool frame::is_native_frame() const {
174 return (_cb != NULL &&
175 _cb->is_nmethod() &&
176 ((nmethod*)_cb)->is_native_method());
177 }
178
179 bool frame::is_java_frame() const {
180 if (is_interpreted_frame()) return true;
181 if (is_compiled_frame()) return true;
182 return false;
183 }
184
185
186 bool frame::is_compiled_frame() const {
187 if (_cb != NULL &&
188 _cb->is_compiled() &&
189 ((CompiledMethod*)_cb)->is_java_method()) {
190 return true;
191 }
192 return false;
193 }
194
195
196 bool frame::is_runtime_frame() const {
197 return (_cb != NULL && _cb->is_runtime_stub());
198 }
199
200 bool frame::is_safepoint_blob_frame() const {
201 return (_cb != NULL && _cb->is_safepoint_stub());
202 }
203
204 // testers
205
206 bool frame::is_first_java_frame() const {
207 RegisterMap map(JavaThread::current(), false); // No update
208 frame s;
209 for (s = sender(&map); !(s.is_java_frame() || s.is_first_frame()); s = s.sender(&map));
210 return s.is_first_frame();
211 }
212
213
214 bool frame::entry_frame_is_first() const {
215 return entry_frame_call_wrapper()->is_first_frame();
216 }
217
218 JavaCallWrapper* frame::entry_frame_call_wrapper_if_safe(JavaThread* thread) const {
219 JavaCallWrapper** jcw = entry_frame_call_wrapper_addr();
220 address addr = (address) jcw;
221
222 // addr must be within the usable part of the stack
223 if (thread->is_in_usable_stack(addr)) {
224 return *jcw;
225 }
226
227 return NULL;
228 }
229
230 bool frame::is_entry_frame_valid(JavaThread* thread) const {
231 // Validate the JavaCallWrapper an entry frame must have
232 address jcw = (address)entry_frame_call_wrapper();
233 bool jcw_safe = (jcw < thread->stack_base()) && (jcw > (address)fp()); // less than stack base
234 if (!jcw_safe) {
235 return false;
236 }
237
238 // Validate sp saved in the java frame anchor
239 JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor();
240 return (jfa->last_Java_sp() > sp());
241 }
242
243 bool frame::should_be_deoptimized() const {
244 if (_deopt_state == is_deoptimized ||
245 !is_compiled_frame() ) return false;
246 assert(_cb != NULL && _cb->is_compiled(), "must be an nmethod");
247 CompiledMethod* nm = (CompiledMethod *)_cb;
248 if (TraceDependencies) {
249 tty->print("checking (%s) ", nm->is_marked_for_deoptimization() ? "true" : "false");
250 nm->print_value_on(tty);
251 tty->cr();
252 }
253
254 if( !nm->is_marked_for_deoptimization() )
255 return false;
256
257 // If at the return point, then the frame has already been popped, and
258 // only the return needs to be executed. Don't deoptimize here.
259 return !nm->is_at_poll_return(pc());
260 }
261
262 bool frame::can_be_deoptimized() const {
263 if (!is_compiled_frame()) return false;
264 CompiledMethod* nm = (CompiledMethod*)_cb;
265
266 if( !nm->can_be_deoptimized() )
267 return false;
268
269 return !nm->is_at_poll_return(pc());
270 }
271
272 void frame::deoptimize(JavaThread* thread) {
273 // Schedule deoptimization of an nmethod activation with this frame.
274 assert(_cb != NULL && _cb->is_compiled(), "must be");
275
276 // This is a fix for register window patching race
277 if (NeedsDeoptSuspend && Thread::current() != thread) {
278 assert(SafepointSynchronize::is_at_safepoint(),
279 "patching other threads for deopt may only occur at a safepoint");
280
281 // It is possible especially with DeoptimizeALot/DeoptimizeRandom that
282 // we could see the frame again and ask for it to be deoptimized since
283 // it might move for a long time. That is harmless and we just ignore it.
284 if (id() == thread->must_deopt_id()) {
285 assert(thread->is_deopt_suspend(), "lost suspension");
286 return;
287 }
288
289 // We are at a safepoint so the target thread can only be
290 // in 4 states:
291 // blocked - no problem
292 // blocked_trans - no problem (i.e. could have woken up from blocked
293 // during a safepoint).
294 // native - register window pc patching race
295 // native_trans - momentary state
296 //
297 // We could just wait out a thread in native_trans to block.
298 // Then we'd have all the issues that the safepoint code has as to
299 // whether to spin or block. It isn't worth it. Just treat it like
300 // native and be done with it.
301 //
302 // Examine the state of the thread at the start of safepoint since
303 // threads that were in native at the start of the safepoint could
304 // come to a halt during the safepoint, changing the current value
305 // of the safepoint_state.
306 JavaThreadState state = thread->safepoint_state()->orig_thread_state();
307 if (state == _thread_in_native || state == _thread_in_native_trans) {
308 // Since we are at a safepoint the target thread will stop itself
309 // before it can return to java as long as we remain at the safepoint.
310 // Therefore we can put an additional request for the thread to stop
311 // no matter what no (like a suspend). This will cause the thread
312 // to notice it needs to do the deopt on its own once it leaves native.
313 //
314 // The only reason we must do this is because on machine with register
315 // windows we have a race with patching the return address and the
316 // window coming live as the thread returns to the Java code (but still
317 // in native mode) and then blocks. It is only this top most frame
318 // that is at risk. So in truth we could add an additional check to
319 // see if this frame is one that is at risk.
320 RegisterMap map(thread, false);
321 frame at_risk = thread->last_frame().sender(&map);
322 if (id() == at_risk.id()) {
323 thread->set_must_deopt_id(id());
324 thread->set_deopt_suspend();
325 return;
326 }
327 }
328 } // NeedsDeoptSuspend
329
330
331 // If the call site is a MethodHandle call site use the MH deopt
332 // handler.
333 CompiledMethod* cm = (CompiledMethod*) _cb;
334 address deopt = cm->is_method_handle_return(pc()) ?
335 cm->deopt_mh_handler_begin() :
336 cm->deopt_handler_begin();
337
338 // Save the original pc before we patch in the new one
339 cm->set_original_pc(this, pc());
340 patch_pc(thread, deopt);
341
342 #ifdef ASSERT
343 {
344 RegisterMap map(thread, false);
345 frame check = thread->last_frame();
346 while (id() != check.id()) {
347 check = check.sender(&map);
348 }
349 assert(check.is_deoptimized_frame(), "missed deopt");
350 }
351 #endif // ASSERT
352 }
353
354 frame frame::java_sender() const {
355 RegisterMap map(JavaThread::current(), false);
356 frame s;
357 for (s = sender(&map); !(s.is_java_frame() || s.is_first_frame()); s = s.sender(&map)) ;
358 guarantee(s.is_java_frame(), "tried to get caller of first java frame");
359 return s;
360 }
361
362 frame frame::real_sender(RegisterMap* map) const {
363 frame result = sender(map);
364 while (result.is_runtime_frame() ||
365 result.is_ignored_frame()) {
366 result = result.sender(map);
367 }
368 return result;
369 }
370
371 // Note: called by profiler - NOT for current thread
372 frame frame::profile_find_Java_sender_frame(JavaThread *thread) {
373 // If we don't recognize this frame, walk back up the stack until we do
374 RegisterMap map(thread, false);
375 frame first_java_frame = frame();
376
377 // Find the first Java frame on the stack starting with input frame
378 if (is_java_frame()) {
379 // top frame is compiled frame or deoptimized frame
380 first_java_frame = *this;
381 } else if (safe_for_sender(thread)) {
382 for (frame sender_frame = sender(&map);
383 sender_frame.safe_for_sender(thread) && !sender_frame.is_first_frame();
384 sender_frame = sender_frame.sender(&map)) {
385 if (sender_frame.is_java_frame()) {
386 first_java_frame = sender_frame;
387 break;
388 }
389 }
390 }
391 return first_java_frame;
392 }
393
394 // Interpreter frames
395
396
397 void frame::interpreter_frame_set_locals(intptr_t* locs) {
398 assert(is_interpreted_frame(), "Not an interpreted frame");
399 *interpreter_frame_locals_addr() = locs;
400 }
401
402 Method* frame::interpreter_frame_method() const {
403 assert(is_interpreted_frame(), "interpreted frame expected");
404 Method* m = *interpreter_frame_method_addr();
405 assert(m->is_method(), "not a Method*");
406 return m;
407 }
408
409 void frame::interpreter_frame_set_method(Method* method) {
410 assert(is_interpreted_frame(), "interpreted frame expected");
411 *interpreter_frame_method_addr() = method;
412 }
413
414 void frame::interpreter_frame_set_mirror(oop mirror) {
415 assert(is_interpreted_frame(), "interpreted frame expected");
416 *interpreter_frame_mirror_addr() = mirror;
417 }
418
419 jint frame::interpreter_frame_bci() const {
420 assert(is_interpreted_frame(), "interpreted frame expected");
421 address bcp = interpreter_frame_bcp();
422 return interpreter_frame_method()->bci_from(bcp);
423 }
424
425 address frame::interpreter_frame_bcp() const {
426 assert(is_interpreted_frame(), "interpreted frame expected");
427 address bcp = (address)*interpreter_frame_bcp_addr();
428 return interpreter_frame_method()->bcp_from(bcp);
429 }
430
431 void frame::interpreter_frame_set_bcp(address bcp) {
432 assert(is_interpreted_frame(), "interpreted frame expected");
433 *interpreter_frame_bcp_addr() = (intptr_t)bcp;
434 }
435
436 address frame::interpreter_frame_mdp() const {
437 assert(ProfileInterpreter, "must be profiling interpreter");
438 assert(is_interpreted_frame(), "interpreted frame expected");
439 return (address)*interpreter_frame_mdp_addr();
440 }
441
442 void frame::interpreter_frame_set_mdp(address mdp) {
443 assert(is_interpreted_frame(), "interpreted frame expected");
444 assert(ProfileInterpreter, "must be profiling interpreter");
445 *interpreter_frame_mdp_addr() = (intptr_t)mdp;
446 }
447
448 intptr_t* frame::interpreter_frame_vt_alloc_ptr() const {
449 assert(is_interpreted_frame(), "interpreted frame expected");
450 return (intptr_t*)*interpreter_frame_vt_alloc_ptr_addr();
451 }
452
453 void frame::interpreter_frame_set_vt_alloc_ptr(intptr_t* ptr) {
454 assert(is_interpreted_frame(), "interpreted frame expected");
455 *interpreter_frame_vt_alloc_ptr_addr() = ptr;
456 }
457
458 BasicObjectLock* frame::next_monitor_in_interpreter_frame(BasicObjectLock* current) const {
459 assert(is_interpreted_frame(), "Not an interpreted frame");
460 #ifdef ASSERT
461 interpreter_frame_verify_monitor(current);
462 #endif
463 BasicObjectLock* next = (BasicObjectLock*) (((intptr_t*) current) + interpreter_frame_monitor_size());
464 return next;
465 }
466
467 BasicObjectLock* frame::previous_monitor_in_interpreter_frame(BasicObjectLock* current) const {
468 assert(is_interpreted_frame(), "Not an interpreted frame");
469 #ifdef ASSERT
470 // // This verification needs to be checked before being enabled
471 // interpreter_frame_verify_monitor(current);
472 #endif
473 BasicObjectLock* previous = (BasicObjectLock*) (((intptr_t*) current) - interpreter_frame_monitor_size());
474 return previous;
475 }
476
477 // Interpreter locals and expression stack locations.
478
479 intptr_t* frame::interpreter_frame_local_at(int index) const {
480 const int n = Interpreter::local_offset_in_bytes(index)/wordSize;
481 return &((*interpreter_frame_locals_addr())[n]);
482 }
483
484 intptr_t* frame::interpreter_frame_expression_stack_at(jint offset) const {
485 const int i = offset * interpreter_frame_expression_stack_direction();
486 const int n = i * Interpreter::stackElementWords;
487 return &(interpreter_frame_expression_stack()[n]);
488 }
489
490 jint frame::interpreter_frame_expression_stack_size() const {
491 // Number of elements on the interpreter expression stack
492 // Callers should span by stackElementWords
493 int element_size = Interpreter::stackElementWords;
494 size_t stack_size = 0;
495 if (frame::interpreter_frame_expression_stack_direction() < 0) {
496 stack_size = (interpreter_frame_expression_stack() -
497 interpreter_frame_tos_address() + 1)/element_size;
498 } else {
499 stack_size = (interpreter_frame_tos_address() -
500 interpreter_frame_expression_stack() + 1)/element_size;
501 }
502 assert( stack_size <= (size_t)max_jint, "stack size too big");
503 return ((jint)stack_size);
504 }
505
506
507 // (frame::interpreter_frame_sender_sp accessor is in frame_<arch>.cpp)
508
509 const char* frame::print_name() const {
510 if (is_native_frame()) return "Native";
511 if (is_interpreted_frame()) return "Interpreted";
512 if (is_compiled_frame()) {
513 if (is_deoptimized_frame()) return "Deoptimized";
514 return "Compiled";
515 }
516 if (sp() == NULL) return "Empty";
517 return "C";
518 }
519
520 void frame::print_value_on(outputStream* st, JavaThread *thread) const {
521 NOT_PRODUCT(address begin = pc()-40;)
522 NOT_PRODUCT(address end = NULL;)
523
524 st->print("%s frame (sp=" INTPTR_FORMAT " unextended sp=" INTPTR_FORMAT, print_name(), p2i(sp()), p2i(unextended_sp()));
525 if (sp() != NULL)
526 st->print(", fp=" INTPTR_FORMAT ", real_fp=" INTPTR_FORMAT ", pc=" INTPTR_FORMAT,
527 p2i(fp()), p2i(real_fp()), p2i(pc()));
528
529 if (StubRoutines::contains(pc())) {
530 st->print_cr(")");
531 st->print("(");
532 StubCodeDesc* desc = StubCodeDesc::desc_for(pc());
533 st->print("~Stub::%s", desc->name());
534 NOT_PRODUCT(begin = desc->begin(); end = desc->end();)
535 } else if (Interpreter::contains(pc())) {
536 st->print_cr(")");
537 st->print("(");
538 InterpreterCodelet* desc = Interpreter::codelet_containing(pc());
539 if (desc != NULL) {
540 st->print("~");
541 desc->print_on(st);
542 NOT_PRODUCT(begin = desc->code_begin(); end = desc->code_end();)
543 } else {
544 st->print("~interpreter");
545 }
546 }
547 st->print_cr(")");
548
549 if (_cb != NULL) {
550 st->print(" ");
551 _cb->print_value_on(st);
552 st->cr();
553 #ifndef PRODUCT
554 if (end == NULL) {
555 begin = _cb->code_begin();
556 end = _cb->code_end();
557 }
558 #endif
559 }
560 NOT_PRODUCT(if (WizardMode && Verbose) Disassembler::decode(begin, end);)
561 }
562
563
564 void frame::print_on(outputStream* st) const {
565 print_value_on(st,NULL);
566 if (is_interpreted_frame()) {
567 interpreter_frame_print_on(st);
568 }
569 }
570
571
572 void frame::interpreter_frame_print_on(outputStream* st) const {
573 #ifndef PRODUCT
574 assert(is_interpreted_frame(), "Not an interpreted frame");
575 jint i;
576 for (i = 0; i < interpreter_frame_method()->max_locals(); i++ ) {
577 intptr_t x = *interpreter_frame_local_at(i);
578 st->print(" - local [" INTPTR_FORMAT "]", x);
579 st->fill_to(23);
580 st->print_cr("; #%d", i);
581 }
582 for (i = interpreter_frame_expression_stack_size() - 1; i >= 0; --i ) {
583 intptr_t x = *interpreter_frame_expression_stack_at(i);
584 st->print(" - stack [" INTPTR_FORMAT "]", x);
585 st->fill_to(23);
586 st->print_cr("; #%d", i);
587 }
588 // locks for synchronization
589 for (BasicObjectLock* current = interpreter_frame_monitor_end();
590 current < interpreter_frame_monitor_begin();
591 current = next_monitor_in_interpreter_frame(current)) {
592 st->print(" - obj [");
593 current->obj()->print_value_on(st);
594 st->print_cr("]");
595 st->print(" - lock [");
596 current->lock()->print_on(st);
597 st->print_cr("]");
598 }
599 // monitor
600 st->print_cr(" - monitor[" INTPTR_FORMAT "]", p2i(interpreter_frame_monitor_begin()));
601 // bcp
602 st->print(" - bcp [" INTPTR_FORMAT "]", p2i(interpreter_frame_bcp()));
603 st->fill_to(23);
604 st->print_cr("; @%d", interpreter_frame_bci());
605 // locals
606 st->print_cr(" - locals [" INTPTR_FORMAT "]", p2i(interpreter_frame_local_at(0)));
607 // method
608 st->print(" - method [" INTPTR_FORMAT "]", p2i(interpreter_frame_method()));
609 st->fill_to(23);
610 st->print("; ");
611 interpreter_frame_method()->print_name(st);
612 st->cr();
613 #endif
614 }
615
616 // Print whether the frame is in the VM or OS indicating a HotSpot problem.
617 // Otherwise, it's likely a bug in the native library that the Java code calls,
618 // hopefully indicating where to submit bugs.
619 void frame::print_C_frame(outputStream* st, char* buf, int buflen, address pc) {
620 // C/C++ frame
621 bool in_vm = os::address_is_in_vm(pc);
622 st->print(in_vm ? "V" : "C");
623
624 int offset;
625 bool found;
626
627 // libname
628 found = os::dll_address_to_library_name(pc, buf, buflen, &offset);
629 if (found) {
630 // skip directory names
631 const char *p1, *p2;
632 p1 = buf;
633 int len = (int)strlen(os::file_separator());
634 while ((p2 = strstr(p1, os::file_separator())) != NULL) p1 = p2 + len;
635 st->print(" [%s+0x%x]", p1, offset);
636 } else {
637 st->print(" " PTR_FORMAT, p2i(pc));
638 }
639
640 // function name - os::dll_address_to_function_name() may return confusing
641 // names if pc is within jvm.dll or libjvm.so, because JVM only has
642 // JVM_xxxx and a few other symbols in the dynamic symbol table. Do this
643 // only for native libraries.
644 if (!in_vm || Decoder::can_decode_C_frame_in_vm()) {
645 found = os::dll_address_to_function_name(pc, buf, buflen, &offset);
646
647 if (found) {
648 st->print(" %s+0x%x", buf, offset);
649 }
650 }
651 }
652
653 // frame::print_on_error() is called by fatal error handler. Notice that we may
654 // crash inside this function if stack frame is corrupted. The fatal error
655 // handler can catch and handle the crash. Here we assume the frame is valid.
656 //
657 // First letter indicates type of the frame:
658 // J: Java frame (compiled)
659 // A: Java frame (aot compiled)
660 // j: Java frame (interpreted)
661 // V: VM frame (C/C++)
662 // v: Other frames running VM generated code (e.g. stubs, adapters, etc.)
663 // C: C/C++ frame
664 //
665 // We don't need detailed frame type as that in frame::print_name(). "C"
666 // suggests the problem is in user lib; everything else is likely a VM bug.
667
668 void frame::print_on_error(outputStream* st, char* buf, int buflen, bool verbose) const {
669 if (_cb != NULL) {
670 if (Interpreter::contains(pc())) {
671 Method* m = this->interpreter_frame_method();
672 if (m != NULL) {
673 m->name_and_sig_as_C_string(buf, buflen);
674 st->print("j %s", buf);
675 st->print("+%d", this->interpreter_frame_bci());
676 ModuleEntry* module = m->method_holder()->module();
677 if (module->is_named()) {
678 module->name()->as_C_string(buf, buflen);
679 st->print(" %s", buf);
680 if (module->version() != NULL) {
681 module->version()->as_C_string(buf, buflen);
682 st->print("@%s", buf);
683 }
684 }
685 } else {
686 st->print("j " PTR_FORMAT, p2i(pc()));
687 }
688 } else if (StubRoutines::contains(pc())) {
689 StubCodeDesc* desc = StubCodeDesc::desc_for(pc());
690 if (desc != NULL) {
691 st->print("v ~StubRoutines::%s", desc->name());
692 } else {
693 st->print("v ~StubRoutines::" PTR_FORMAT, p2i(pc()));
694 }
695 } else if (_cb->is_buffer_blob()) {
696 st->print("v ~BufferBlob::%s", ((BufferBlob *)_cb)->name());
697 } else if (_cb->is_compiled()) {
698 CompiledMethod* cm = (CompiledMethod*)_cb;
699 Method* m = cm->method();
700 if (m != NULL) {
701 if (cm->is_aot()) {
702 st->print("A %d ", cm->compile_id());
703 } else if (cm->is_nmethod()) {
704 nmethod* nm = cm->as_nmethod();
705 st->print("J %d%s", nm->compile_id(), (nm->is_osr_method() ? "%" : ""));
706 st->print(" %s", nm->compiler_name());
707 }
708 m->name_and_sig_as_C_string(buf, buflen);
709 st->print(" %s", buf);
710 ModuleEntry* module = m->method_holder()->module();
711 if (module->is_named()) {
712 module->name()->as_C_string(buf, buflen);
713 st->print(" %s", buf);
714 if (module->version() != NULL) {
715 module->version()->as_C_string(buf, buflen);
716 st->print("@%s", buf);
717 }
718 }
719 st->print(" (%d bytes) @ " PTR_FORMAT " [" PTR_FORMAT "+" INTPTR_FORMAT "]",
720 m->code_size(), p2i(_pc), p2i(_cb->code_begin()), _pc - _cb->code_begin());
721 #if INCLUDE_JVMCI
722 if (cm->is_nmethod()) {
723 nmethod* nm = cm->as_nmethod();
724 char* jvmciName = nm->jvmci_installed_code_name(buf, buflen);
725 if (jvmciName != NULL) {
726 st->print(" (%s)", jvmciName);
727 }
728 }
729 #endif
730 } else {
731 st->print("J " PTR_FORMAT, p2i(pc()));
732 }
733 } else if (_cb->is_runtime_stub()) {
734 st->print("v ~RuntimeStub::%s", ((RuntimeStub *)_cb)->name());
735 } else if (_cb->is_deoptimization_stub()) {
736 st->print("v ~DeoptimizationBlob");
737 } else if (_cb->is_exception_stub()) {
738 st->print("v ~ExceptionBlob");
739 } else if (_cb->is_safepoint_stub()) {
740 st->print("v ~SafepointBlob");
741 } else {
742 st->print("v blob " PTR_FORMAT, p2i(pc()));
743 }
744 } else {
745 print_C_frame(st, buf, buflen, pc());
746 }
747 }
748
749
750 /*
751 The interpreter_frame_expression_stack_at method in the case of SPARC needs the
752 max_stack value of the method in order to compute the expression stack address.
753 It uses the Method* in order to get the max_stack value but during GC this
754 Method* value saved on the frame is changed by reverse_and_push and hence cannot
755 be used. So we save the max_stack value in the FrameClosure object and pass it
756 down to the interpreter_frame_expression_stack_at method
757 */
758 class InterpreterFrameClosure : public OffsetClosure {
759 private:
760 frame* _fr;
761 OopClosure* _f;
762 BufferedValueClosure* _bvt_f;
763 int _max_locals;
764 int _max_stack;
765
766 public:
767 InterpreterFrameClosure(frame* fr, int max_locals, int max_stack,
768 OopClosure* f, BufferedValueClosure* bvt_f) {
769 _fr = fr;
770 _max_locals = max_locals;
771 _max_stack = max_stack;
772 _f = f;
773 _bvt_f = bvt_f;
774 }
775
776 void offset_do(int offset) {
777 oop* addr;
778 if (offset < _max_locals) {
779 addr = (oop*) _fr->interpreter_frame_local_at(offset);
780 assert((intptr_t*)addr >= _fr->sp(), "must be inside the frame");
781 if (Universe::heap()->is_in_reserved_or_null(*addr)) {
782 if (_f != NULL) {
783 _f->do_oop(addr);
784 }
785 } else { // Buffered value types case
786 if (_f != NULL) {
787 oop* addr_mirror = (oop*)(*addr)->mark_addr();
788 _f->do_oop(addr_mirror);
789 }
790 if (_bvt_f != NULL) {
791 _bvt_f->do_buffered_value(addr);
792 }
793 }
794 } else {
795 addr = (oop*) _fr->interpreter_frame_expression_stack_at((offset - _max_locals));
796 // In case of exceptions, the expression stack is invalid and the esp will be reset to express
797 // this condition. Therefore, we call f only if addr is 'inside' the stack (i.e., addr >= esp for Intel).
798 bool in_stack;
799 if (frame::interpreter_frame_expression_stack_direction() > 0) {
800 in_stack = (intptr_t*)addr <= _fr->interpreter_frame_tos_address();
801 } else {
802 in_stack = (intptr_t*)addr >= _fr->interpreter_frame_tos_address();
803 }
804 if (in_stack) {
805 if (Universe::heap()->is_in_reserved_or_null(*addr)) {
806 if (_f != NULL) {
807 _f->do_oop(addr);
808 }
809 } else { // Buffered value types case
810 if (_f != NULL) {
811 oop* addr_mirror = (oop*)(*addr)->mark_addr();
812 _f->do_oop(addr_mirror);
813 }
814 if (_bvt_f != NULL) {
815 _bvt_f->do_buffered_value(addr);
816 }
817 }
818 }
819 }
820 }
821
822 int max_locals() { return _max_locals; }
823 frame* fr() { return _fr; }
824 };
825
826
827 class InterpretedArgumentOopFinder: public SignatureInfo {
828 private:
829 OopClosure* _f; // Closure to invoke
830 int _offset; // TOS-relative offset, decremented with each argument
831 bool _has_receiver; // true if the callee has a receiver
832 frame* _fr;
833
834 void set(int size, BasicType type) {
835 _offset -= size;
836 if (type == T_OBJECT || type == T_ARRAY || type == T_VALUETYPE) oop_offset_do();
837 }
838
839 void oop_offset_do() {
840 oop* addr;
841 addr = (oop*)_fr->interpreter_frame_tos_at(_offset);
842 _f->do_oop(addr);
843 }
844
845 public:
846 InterpretedArgumentOopFinder(Symbol* signature, bool has_receiver, frame* fr, OopClosure* f) : SignatureInfo(signature), _has_receiver(has_receiver) {
847 // compute size of arguments
848 int args_size = ArgumentSizeComputer(signature).size() + (has_receiver ? 1 : 0);
849 assert(!fr->is_interpreted_frame() ||
850 args_size <= fr->interpreter_frame_expression_stack_size(),
851 "args cannot be on stack anymore");
852 // initialize InterpretedArgumentOopFinder
853 _f = f;
854 _fr = fr;
855 _offset = args_size;
856 }
857
858 void oops_do() {
859 if (_has_receiver) {
860 --_offset;
861 oop_offset_do();
862 }
863 iterate_parameters();
864 }
865 };
866
867
868 // Entry frame has following form (n arguments)
869 // +-----------+
870 // sp -> | last arg |
871 // +-----------+
872 // : ::: :
873 // +-----------+
874 // (sp+n)->| first arg|
875 // +-----------+
876
877
878
879 // visits and GC's all the arguments in entry frame
880 class EntryFrameOopFinder: public SignatureInfo {
881 private:
882 bool _is_static;
883 int _offset;
884 frame* _fr;
885 OopClosure* _f;
886
887 void set(int size, BasicType type) {
888 assert (_offset >= 0, "illegal offset");
889 if (type == T_OBJECT || type == T_ARRAY || type == T_VALUETYPE) oop_at_offset_do(_offset);
890 _offset -= size;
891 }
892
893 void oop_at_offset_do(int offset) {
894 assert (offset >= 0, "illegal offset");
895 oop* addr = (oop*) _fr->entry_frame_argument_at(offset);
896 _f->do_oop(addr);
897 }
898
899 public:
900 EntryFrameOopFinder(frame* frame, Symbol* signature, bool is_static) : SignatureInfo(signature) {
901 _f = NULL; // will be set later
902 _fr = frame;
903 _is_static = is_static;
904 _offset = ArgumentSizeComputer(signature).size() - 1; // last parameter is at index 0
905 }
906
907 void arguments_do(OopClosure* f) {
908 _f = f;
909 if (!_is_static) oop_at_offset_do(_offset+1); // do the receiver
910 iterate_parameters();
911 }
912
913 };
914
915 oop* frame::interpreter_callee_receiver_addr(Symbol* signature) {
916 ArgumentSizeComputer asc(signature);
917 int size = asc.size();
918 return (oop *)interpreter_frame_tos_at(size);
919 }
920
921
922 void frame::oops_interpreted_do(OopClosure* f, const RegisterMap* map, bool query_oop_map_cache) {
923 assert(is_interpreted_frame(), "Not an interpreted frame");
924 assert(map != NULL, "map must be set");
925 Thread *thread = Thread::current();
926 methodHandle m (thread, interpreter_frame_method());
927 jint bci = interpreter_frame_bci();
928
929 assert(!Universe::heap()->is_in(m()),
930 "must be valid oop");
931 assert(m->is_method(), "checking frame value");
932 assert((m->is_native() && bci == 0) ||
933 (!m->is_native() && bci >= 0 && bci < m->code_size()),
934 "invalid bci value");
935
936 // Handle the monitor elements in the activation
937 for (
938 BasicObjectLock* current = interpreter_frame_monitor_end();
939 current < interpreter_frame_monitor_begin();
940 current = next_monitor_in_interpreter_frame(current)
941 ) {
942 #ifdef ASSERT
943 interpreter_frame_verify_monitor(current);
944 #endif
945 current->oops_do(f);
946 }
947
948 if (m->is_native()) {
949 f->do_oop(interpreter_frame_temp_oop_addr());
950 }
951
952 // The method pointer in the frame might be the only path to the method's
953 // klass, and the klass needs to be kept alive while executing. The GCs
954 // don't trace through method pointers, so the mirror of the method's klass
955 // is installed as a GC root.
956 f->do_oop(interpreter_frame_mirror_addr());
957
958 int max_locals = m->is_native() ? m->size_of_parameters() : m->max_locals();
959
960 Symbol* signature = NULL;
961 bool has_receiver = false;
962
963 // Process a callee's arguments if we are at a call site
964 // (i.e., if we are at an invoke bytecode)
965 // This is used sometimes for calling into the VM, not for another
966 // interpreted or compiled frame.
967 if (!m->is_native()) {
968 Bytecode_invoke call = Bytecode_invoke_check(m, bci);
969 if (call.is_valid()) {
970 signature = call.signature();
971 has_receiver = call.has_receiver();
972 if (map->include_argument_oops() &&
973 interpreter_frame_expression_stack_size() > 0) {
974 ResourceMark rm(thread); // is this right ???
975 // we are at a call site & the expression stack is not empty
976 // => process callee's arguments
977 //
978 // Note: The expression stack can be empty if an exception
979 // occurred during method resolution/execution. In all
980 // cases we empty the expression stack completely be-
981 // fore handling the exception (the exception handling
982 // code in the interpreter calls a blocking runtime
983 // routine which can cause this code to be executed).
984 // (was bug gri 7/27/98)
985 oops_interpreted_arguments_do(signature, has_receiver, f);
986 }
987 }
988 }
989
990 InterpreterFrameClosure blk(this, max_locals, m->max_stack(), f, NULL);
991
992 // process locals & expression stack
993 InterpreterOopMap mask;
994 if (query_oop_map_cache) {
995 m->mask_for(bci, &mask);
996 } else {
997 OopMapCache::compute_one_oop_map(m, bci, &mask);
998 }
999 mask.iterate_oop(&blk);
1000 }
1001
1002 void frame::buffered_values_interpreted_do(BufferedValueClosure* f) {
1003 assert(is_interpreted_frame(), "Not an interpreted frame");
1004 Thread *thread = Thread::current();
1005 methodHandle m (thread, interpreter_frame_method());
1006 jint bci = interpreter_frame_bci();
1007
1008 assert(m->is_method(), "checking frame value");
1009 assert(!m->is_native() && bci >= 0 && bci < m->code_size(),
1010 "invalid bci value");
1011
1012 InterpreterFrameClosure blk(this, m->max_locals(), m->max_stack(), NULL, f);
1013
1014 // process locals & expression stack
1015 InterpreterOopMap mask;
1016 m->mask_for(bci, &mask);
1017 mask.iterate_oop(&blk);
1018 }
1019
1020 void frame::oops_interpreted_arguments_do(Symbol* signature, bool has_receiver, OopClosure* f) {
1021 InterpretedArgumentOopFinder finder(signature, has_receiver, this, f);
1022 finder.oops_do();
1023 }
1024
1025 void frame::oops_code_blob_do(OopClosure* f, CodeBlobClosure* cf, const RegisterMap* reg_map) {
1026 assert(_cb != NULL, "sanity check");
1027 if (_cb->oop_maps() != NULL) {
1028 OopMapSet::oops_do(this, reg_map, f);
1029
1030 // Preserve potential arguments for a callee. We handle this by dispatching
1031 // on the codeblob. For c2i, we do
1032 if (reg_map->include_argument_oops()) {
1033 _cb->preserve_callee_argument_oops(*this, reg_map, f);
1034 }
1035 }
1036 // In cases where perm gen is collected, GC will want to mark
1037 // oops referenced from nmethods active on thread stacks so as to
1038 // prevent them from being collected. However, this visit should be
1039 // restricted to certain phases of the collection only. The
1040 // closure decides how it wants nmethods to be traced.
1041 if (cf != NULL)
1042 cf->do_code_blob(_cb);
1043 }
1044
1045 class CompiledArgumentOopFinder: public SignatureInfo {
1046 protected:
1047 OopClosure* _f;
1048 int _offset; // the current offset, incremented with each argument
1049 bool _has_receiver; // true if the callee has a receiver
1050 bool _has_appendix; // true if the call has an appendix
1051 frame _fr;
1052 RegisterMap* _reg_map;
1053 int _arg_size;
1054 VMRegPair* _regs; // VMReg list of arguments
1055
1056 void set(int size, BasicType type) {
1057 if (type == T_OBJECT || type == T_ARRAY || type == T_VALUETYPE) handle_oop_offset();
1058 _offset += size;
1059 }
1060
1061 virtual void handle_oop_offset() {
1062 // Extract low order register number from register array.
1063 // In LP64-land, the high-order bits are valid but unhelpful.
1064 assert(_offset < _arg_size, "out of bounds");
1065 VMReg reg = _regs[_offset].first();
1066 oop *loc = _fr.oopmapreg_to_location(reg, _reg_map);
1067 _f->do_oop(loc);
1068 }
1069
1070 public:
1071 CompiledArgumentOopFinder(Symbol* signature, bool has_receiver, bool has_appendix, OopClosure* f, frame fr, const RegisterMap* reg_map)
1072 : SignatureInfo(signature) {
1073
1074 // initialize CompiledArgumentOopFinder
1075 _f = f;
1076 _offset = 0;
1077 _has_receiver = has_receiver;
1078 _has_appendix = has_appendix;
1079 _fr = fr;
1080 _reg_map = (RegisterMap*)reg_map;
1081 _regs = SharedRuntime::find_callee_arguments(signature, has_receiver, has_appendix, &_arg_size);
1082 }
1083
1084 void oops_do() {
1085 if (_has_receiver) {
1086 handle_oop_offset();
1087 _offset++;
1088 }
1089 iterate_parameters();
1090 if (_has_appendix) {
1091 handle_oop_offset();
1092 _offset++;
1093 }
1094 }
1095 };
1096
1097 void frame::oops_compiled_arguments_do(Symbol* signature, bool has_receiver, bool has_appendix,
1098 const RegisterMap* reg_map, OopClosure* f) {
1099 ResourceMark rm;
1100 CompiledArgumentOopFinder finder(signature, has_receiver, has_appendix, f, *this, reg_map);
1101 finder.oops_do();
1102 }
1103
1104
1105 // Get receiver out of callers frame, i.e. find parameter 0 in callers
1106 // frame. Consult ADLC for where parameter 0 is to be found. Then
1107 // check local reg_map for it being a callee-save register or argument
1108 // register, both of which are saved in the local frame. If not found
1109 // there, it must be an in-stack argument of the caller.
1110 // Note: caller.sp() points to callee-arguments
1111 oop frame::retrieve_receiver(RegisterMap* reg_map) {
1112 frame caller = *this;
1113
1114 // First consult the ADLC on where it puts parameter 0 for this signature.
1115 VMReg reg = SharedRuntime::name_for_receiver();
1116 oop* oop_adr = caller.oopmapreg_to_location(reg, reg_map);
1117 if (oop_adr == NULL) {
1118 guarantee(oop_adr != NULL, "bad register save location");
1119 return NULL;
1120 }
1121 oop r = *oop_adr;
1122 assert(Universe::heap()->is_in_or_null(r), "bad receiver: " INTPTR_FORMAT " (" INTX_FORMAT ")", p2i(r), p2i(r));
1123 return r;
1124 }
1125
1126
1127 BasicLock* frame::get_native_monitor() {
1128 nmethod* nm = (nmethod*)_cb;
1129 assert(_cb != NULL && _cb->is_nmethod() && nm->method()->is_native(),
1130 "Should not call this unless it's a native nmethod");
1131 int byte_offset = in_bytes(nm->native_basic_lock_sp_offset());
1132 assert(byte_offset >= 0, "should not see invalid offset");
1133 return (BasicLock*) &sp()[byte_offset / wordSize];
1134 }
1135
1136 oop frame::get_native_receiver() {
1137 nmethod* nm = (nmethod*)_cb;
1138 assert(_cb != NULL && _cb->is_nmethod() && nm->method()->is_native(),
1139 "Should not call this unless it's a native nmethod");
1140 int byte_offset = in_bytes(nm->native_receiver_sp_offset());
1141 assert(byte_offset >= 0, "should not see invalid offset");
1142 oop owner = ((oop*) sp())[byte_offset / wordSize];
1143 assert( Universe::heap()->is_in(owner), "bad receiver" );
1144 return owner;
1145 }
1146
1147 void frame::oops_entry_do(OopClosure* f, const RegisterMap* map) {
1148 assert(map != NULL, "map must be set");
1149 if (map->include_argument_oops()) {
1150 // must collect argument oops, as nobody else is doing it
1151 Thread *thread = Thread::current();
1152 methodHandle m (thread, entry_frame_call_wrapper()->callee_method());
1153 EntryFrameOopFinder finder(this, m->signature(), m->is_static());
1154 finder.arguments_do(f);
1155 }
1156 // Traverse the Handle Block saved in the entry frame
1157 entry_frame_call_wrapper()->oops_do(f);
1158 }
1159
1160
1161 void frame::oops_do_internal(OopClosure* f, CodeBlobClosure* cf, RegisterMap* map, bool use_interpreter_oop_map_cache) {
1162 #ifndef PRODUCT
1163 // simulate GC crash here to dump java thread in error report
1164 if (CrashGCForDumpingJavaThread) {
1165 char *t = NULL;
1166 *t = 'c';
1167 }
1168 #endif
1169 if (is_interpreted_frame()) {
1170 oops_interpreted_do(f, map, use_interpreter_oop_map_cache);
1171 } else if (is_entry_frame()) {
1172 oops_entry_do(f, map);
1173 } else if (CodeCache::contains(pc())) {
1174 oops_code_blob_do(f, cf, map);
1175 #ifdef SHARK
1176 } else if (is_fake_stub_frame()) {
1177 // nothing to do
1178 #endif // SHARK
1179 } else {
1180 ShouldNotReachHere();
1181 }
1182 }
1183
1184 void frame::nmethods_do(CodeBlobClosure* cf) {
1185 if (_cb != NULL && _cb->is_nmethod()) {
1186 cf->do_code_blob(_cb);
1187 }
1188 }
1189
1190
1191 // call f() on the interpreted Method*s in the stack.
1192 // Have to walk the entire code cache for the compiled frames Yuck.
1193 void frame::metadata_do(void f(Metadata*)) {
1194 if (is_interpreted_frame()) {
1195 Method* m = this->interpreter_frame_method();
1196 assert(m != NULL, "expecting a method in this frame");
1197 f(m);
1198 }
1199 }
1200
1201 void frame::verify(const RegisterMap* map) {
1202 // for now make sure receiver type is correct
1203 if (is_interpreted_frame()) {
1204 Method* method = interpreter_frame_method();
1205 guarantee(method->is_method(), "method is wrong in frame::verify");
1206 if (!method->is_static()) {
1207 // fetch the receiver
1208 oop* p = (oop*) interpreter_frame_local_at(0);
1209 // make sure we have the right receiver type
1210 }
1211 }
1212 #if defined(COMPILER2) || INCLUDE_JVMCI
1213 assert(DerivedPointerTable::is_empty(), "must be empty before verify");
1214 #endif
1215 oops_do_internal(&VerifyOopClosure::verify_oop, NULL, (RegisterMap*)map, false);
1216 }
1217
1218
1219 #ifdef ASSERT
1220 bool frame::verify_return_pc(address x) {
1221 if (StubRoutines::returns_to_call_stub(x)) {
1222 return true;
1223 }
1224 if (CodeCache::contains(x)) {
1225 return true;
1226 }
1227 if (Interpreter::contains(x)) {
1228 return true;
1229 }
1230 return false;
1231 }
1232 #endif
1233
1234 #ifdef ASSERT
1235 void frame::interpreter_frame_verify_monitor(BasicObjectLock* value) const {
1236 assert(is_interpreted_frame(), "Not an interpreted frame");
1237 // verify that the value is in the right part of the frame
1238 address low_mark = (address) interpreter_frame_monitor_end();
1239 address high_mark = (address) interpreter_frame_monitor_begin();
1240 address current = (address) value;
1241
1242 const int monitor_size = frame::interpreter_frame_monitor_size();
1243 guarantee((high_mark - current) % monitor_size == 0 , "Misaligned top of BasicObjectLock*");
1244 guarantee( high_mark > current , "Current BasicObjectLock* higher than high_mark");
1245
1246 guarantee((current - low_mark) % monitor_size == 0 , "Misaligned bottom of BasicObjectLock*");
1247 guarantee( current >= low_mark , "Current BasicObjectLock* below than low_mark");
1248 }
1249 #endif
1250
1251 #ifndef PRODUCT
1252 void frame::describe(FrameValues& values, int frame_no) {
1253 // boundaries: sp and the 'real' frame pointer
1254 values.describe(-1, sp(), err_msg("sp for #%d", frame_no), 1);
1255 intptr_t* frame_pointer = real_fp(); // Note: may differ from fp()
1256
1257 // print frame info at the highest boundary
1258 intptr_t* info_address = MAX2(sp(), frame_pointer);
1259
1260 if (info_address != frame_pointer) {
1261 // print frame_pointer explicitly if not marked by the frame info
1262 values.describe(-1, frame_pointer, err_msg("frame pointer for #%d", frame_no), 1);
1263 }
1264
1265 if (is_entry_frame() || is_compiled_frame() || is_interpreted_frame() || is_native_frame()) {
1266 // Label values common to most frames
1267 values.describe(-1, unextended_sp(), err_msg("unextended_sp for #%d", frame_no));
1268 }
1269
1270 if (is_interpreted_frame()) {
1271 Method* m = interpreter_frame_method();
1272 int bci = interpreter_frame_bci();
1273
1274 // Label the method and current bci
1275 values.describe(-1, info_address,
1276 FormatBuffer<1024>("#%d method %s @ %d", frame_no, m->name_and_sig_as_C_string(), bci), 2);
1277 values.describe(-1, info_address,
1278 err_msg("- %d locals %d max stack", m->max_locals(), m->max_stack()), 1);
1279 if (m->max_locals() > 0) {
1280 intptr_t* l0 = interpreter_frame_local_at(0);
1281 intptr_t* ln = interpreter_frame_local_at(m->max_locals() - 1);
1282 values.describe(-1, MAX2(l0, ln), err_msg("locals for #%d", frame_no), 1);
1283 // Report each local and mark as owned by this frame
1284 for (int l = 0; l < m->max_locals(); l++) {
1285 intptr_t* l0 = interpreter_frame_local_at(l);
1286 values.describe(frame_no, l0, err_msg("local %d", l));
1287 }
1288 }
1289
1290 // Compute the actual expression stack size
1291 InterpreterOopMap mask;
1292 OopMapCache::compute_one_oop_map(m, bci, &mask);
1293 intptr_t* tos = NULL;
1294 // Report each stack element and mark as owned by this frame
1295 for (int e = 0; e < mask.expression_stack_size(); e++) {
1296 tos = MAX2(tos, interpreter_frame_expression_stack_at(e));
1297 values.describe(frame_no, interpreter_frame_expression_stack_at(e),
1298 err_msg("stack %d", e));
1299 }
1300 if (tos != NULL) {
1301 values.describe(-1, tos, err_msg("expression stack for #%d", frame_no), 1);
1302 }
1303 if (interpreter_frame_monitor_begin() != interpreter_frame_monitor_end()) {
1304 values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_begin(), "monitors begin");
1305 values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_end(), "monitors end");
1306 }
1307 } else if (is_entry_frame()) {
1308 // For now just label the frame
1309 values.describe(-1, info_address, err_msg("#%d entry frame", frame_no), 2);
1310 } else if (is_compiled_frame()) {
1311 // For now just label the frame
1312 CompiledMethod* cm = (CompiledMethod*)cb();
1313 values.describe(-1, info_address,
1314 FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for method %s%s%s", frame_no,
1315 p2i(cm),
1316 (cm->is_aot() ? "A ": "J "),
1317 cm->method()->name_and_sig_as_C_string(),
1318 (_deopt_state == is_deoptimized) ?
1319 " (deoptimized)" :
1320 ((_deopt_state == unknown) ? " (state unknown)" : "")),
1321 2);
1322 } else if (is_native_frame()) {
1323 // For now just label the frame
1324 nmethod* nm = cb()->as_nmethod_or_null();
1325 values.describe(-1, info_address,
1326 FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for native method %s", frame_no,
1327 p2i(nm), nm->method()->name_and_sig_as_C_string()), 2);
1328 } else {
1329 // provide default info if not handled before
1330 char *info = (char *) "special frame";
1331 if ((_cb != NULL) &&
1332 (_cb->name() != NULL)) {
1333 info = (char *)_cb->name();
1334 }
1335 values.describe(-1, info_address, err_msg("#%d <%s>", frame_no, info), 2);
1336 }
1337
1338 // platform dependent additional data
1339 describe_pd(values, frame_no);
1340 }
1341
1342 #endif
1343
1344
1345 //-----------------------------------------------------------------------------------
1346 // StackFrameStream implementation
1347
1348 StackFrameStream::StackFrameStream(JavaThread *thread, bool update) : _reg_map(thread, update) {
1349 assert(thread->has_last_Java_frame(), "sanity check");
1350 _fr = thread->last_frame();
1351 _is_done = false;
1352 }
1353
1354
1355 #ifndef PRODUCT
1356
1357 void FrameValues::describe(int owner, intptr_t* location, const char* description, int priority) {
1358 FrameValue fv;
1359 fv.location = location;
1360 fv.owner = owner;
1361 fv.priority = priority;
1362 fv.description = NEW_RESOURCE_ARRAY(char, strlen(description) + 1);
1363 strcpy(fv.description, description);
1364 _values.append(fv);
1365 }
1366
1367
1368 #ifdef ASSERT
1369 void FrameValues::validate() {
1370 _values.sort(compare);
1371 bool error = false;
1372 FrameValue prev;
1373 prev.owner = -1;
1374 for (int i = _values.length() - 1; i >= 0; i--) {
1375 FrameValue fv = _values.at(i);
1376 if (fv.owner == -1) continue;
1377 if (prev.owner == -1) {
1378 prev = fv;
1379 continue;
1380 }
1381 if (prev.location == fv.location) {
1382 if (fv.owner != prev.owner) {
1383 tty->print_cr("overlapping storage");
1384 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(prev.location), *prev.location, prev.description);
1385 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(fv.location), *fv.location, fv.description);
1386 error = true;
1387 }
1388 } else {
1389 prev = fv;
1390 }
1391 }
1392 assert(!error, "invalid layout");
1393 }
1394 #endif // ASSERT
1395
1396 void FrameValues::print(JavaThread* thread) {
1397 _values.sort(compare);
1398
1399 // Sometimes values like the fp can be invalid values if the
1400 // register map wasn't updated during the walk. Trim out values
1401 // that aren't actually in the stack of the thread.
1402 int min_index = 0;
1403 int max_index = _values.length() - 1;
1404 intptr_t* v0 = _values.at(min_index).location;
1405 intptr_t* v1 = _values.at(max_index).location;
1406
1407 if (thread == Thread::current()) {
1408 while (!thread->is_in_stack((address)v0)) {
1409 v0 = _values.at(++min_index).location;
1410 }
1411 while (!thread->is_in_stack((address)v1)) {
1412 v1 = _values.at(--max_index).location;
1413 }
1414 } else {
1415 while (!thread->on_local_stack((address)v0)) {
1416 v0 = _values.at(++min_index).location;
1417 }
1418 while (!thread->on_local_stack((address)v1)) {
1419 v1 = _values.at(--max_index).location;
1420 }
1421 }
1422 intptr_t* min = MIN2(v0, v1);
1423 intptr_t* max = MAX2(v0, v1);
1424 intptr_t* cur = max;
1425 intptr_t* last = NULL;
1426 for (int i = max_index; i >= min_index; i--) {
1427 FrameValue fv = _values.at(i);
1428 while (cur > fv.location) {
1429 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT, p2i(cur), *cur);
1430 cur--;
1431 }
1432 if (last == fv.location) {
1433 const char* spacer = " " LP64_ONLY(" ");
1434 tty->print_cr(" %s %s %s", spacer, spacer, fv.description);
1435 } else {
1436 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(fv.location), *fv.location, fv.description);
1437 last = fv.location;
1438 cur--;
1439 }
1440 }
1441 }
1442
1443 #endif // ndef PRODUCT