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