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