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