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 void frame::interpreter_frame_set_bcx(intptr_t bcx) {
416 assert(is_interpreted_frame(), "Not an interpreted frame");
417 if (ProfileInterpreter) {
418 bool formerly_bci = is_bci(interpreter_frame_bcx());
419 bool is_now_bci = is_bci(bcx);
420 *interpreter_frame_bcx_addr() = bcx;
421
422 intptr_t mdx = interpreter_frame_mdx();
423
424 if (mdx != 0) {
425 if (formerly_bci) {
426 if (!is_now_bci) {
427 // The bcx was just converted from bci to bcp.
428 // Convert the mdx in parallel.
429 MethodData* mdo = interpreter_frame_method()->method_data();
430 assert(mdo != NULL, "");
431 int mdi = mdx - 1; // We distinguish valid mdi from zero by adding one.
432 address mdp = mdo->di_to_dp(mdi);
433 interpreter_frame_set_mdx((intptr_t)mdp);
434 }
435 } else {
436 if (is_now_bci) {
437 // The bcx was just converted from bcp to bci.
438 // Convert the mdx in parallel.
439 MethodData* mdo = interpreter_frame_method()->method_data();
440 assert(mdo != NULL, "");
441 int mdi = mdo->dp_to_di((address)mdx);
442 interpreter_frame_set_mdx((intptr_t)mdi + 1); // distinguish valid from 0.
443 }
444 }
445 }
446 } else {
447 *interpreter_frame_bcx_addr() = bcx;
448 }
449 }
450
451 jint frame::interpreter_frame_bci() const {
452 assert(is_interpreted_frame(), "interpreted frame expected");
453 intptr_t bcx = interpreter_frame_bcx();
454 return is_bci(bcx) ? bcx : interpreter_frame_method()->bci_from((address)bcx);
455 }
456
457 void frame::interpreter_frame_set_bci(jint bci) {
458 assert(is_interpreted_frame(), "interpreted frame expected");
459 assert(!is_bci(interpreter_frame_bcx()), "should not set bci during GC");
460 interpreter_frame_set_bcx((intptr_t)interpreter_frame_method()->bcp_from(bci));
461 }
462
463 address frame::interpreter_frame_bcp() const {
464 assert(is_interpreted_frame(), "interpreted frame expected");
465 intptr_t bcx = interpreter_frame_bcx();
466 return is_bci(bcx) ? interpreter_frame_method()->bcp_from(bcx) : (address)bcx;
467 }
468
469 void frame::interpreter_frame_set_bcp(address bcp) {
470 assert(is_interpreted_frame(), "interpreted frame expected");
471 assert(!is_bci(interpreter_frame_bcx()), "should not set bcp during GC");
472 interpreter_frame_set_bcx((intptr_t)bcp);
473 }
474
475 void frame::interpreter_frame_set_mdx(intptr_t mdx) {
476 assert(is_interpreted_frame(), "Not an interpreted frame");
477 assert(ProfileInterpreter, "must be profiling interpreter");
478 *interpreter_frame_mdx_addr() = mdx;
479 }
480
481 address frame::interpreter_frame_mdp() const {
482 assert(ProfileInterpreter, "must be profiling interpreter");
483 assert(is_interpreted_frame(), "interpreted frame expected");
484 intptr_t bcx = interpreter_frame_bcx();
485 intptr_t mdx = interpreter_frame_mdx();
486
487 assert(!is_bci(bcx), "should not access mdp during GC");
488 return (address)mdx;
489 }
490
491 void frame::interpreter_frame_set_mdp(address mdp) {
492 assert(is_interpreted_frame(), "interpreted frame expected");
493 if (mdp == NULL) {
494 // Always allow the mdp to be cleared.
495 interpreter_frame_set_mdx((intptr_t)mdp);
496 }
497 intptr_t bcx = interpreter_frame_bcx();
498 assert(!is_bci(bcx), "should not set mdp during GC");
499 interpreter_frame_set_mdx((intptr_t)mdp);
500 }
501
502 BasicObjectLock* frame::next_monitor_in_interpreter_frame(BasicObjectLock* current) const {
503 assert(is_interpreted_frame(), "Not an interpreted frame");
504 #ifdef ASSERT
505 interpreter_frame_verify_monitor(current);
506 #endif
507 BasicObjectLock* next = (BasicObjectLock*) (((intptr_t*) current) + interpreter_frame_monitor_size());
508 return next;
509 }
510
511 BasicObjectLock* frame::previous_monitor_in_interpreter_frame(BasicObjectLock* current) const {
512 assert(is_interpreted_frame(), "Not an interpreted frame");
513 #ifdef ASSERT
514 // // This verification needs to be checked before being enabled
515 // interpreter_frame_verify_monitor(current);
516 #endif
517 BasicObjectLock* previous = (BasicObjectLock*) (((intptr_t*) current) - interpreter_frame_monitor_size());
518 return previous;
519 }
520
521 // Interpreter locals and expression stack locations.
522
523 intptr_t* frame::interpreter_frame_local_at(int index) const {
524 const int n = Interpreter::local_offset_in_bytes(index)/wordSize;
525 return &((*interpreter_frame_locals_addr())[n]);
526 }
527
528 intptr_t* frame::interpreter_frame_expression_stack_at(jint offset) const {
529 const int i = offset * interpreter_frame_expression_stack_direction();
530 const int n = i * Interpreter::stackElementWords;
531 return &(interpreter_frame_expression_stack()[n]);
532 }
533
534 jint frame::interpreter_frame_expression_stack_size() const {
535 // Number of elements on the interpreter expression stack
536 // Callers should span by stackElementWords
537 int element_size = Interpreter::stackElementWords;
538 size_t stack_size = 0;
539 if (frame::interpreter_frame_expression_stack_direction() < 0) {
540 stack_size = (interpreter_frame_expression_stack() -
541 interpreter_frame_tos_address() + 1)/element_size;
542 } else {
543 stack_size = (interpreter_frame_tos_address() -
544 interpreter_frame_expression_stack() + 1)/element_size;
545 }
546 assert( stack_size <= (size_t)max_jint, "stack size too big");
547 return ((jint)stack_size);
548 }
549
550
551 // (frame::interpreter_frame_sender_sp accessor is in frame_<arch>.cpp)
552
553 const char* frame::print_name() const {
554 if (is_native_frame()) return "Native";
555 if (is_interpreted_frame()) return "Interpreted";
556 if (is_compiled_frame()) {
557 if (is_deoptimized_frame()) return "Deoptimized";
558 return "Compiled";
559 }
560 if (sp() == NULL) return "Empty";
561 return "C";
562 }
563
564 void frame::print_value_on(outputStream* st, JavaThread *thread) const {
565 NOT_PRODUCT(address begin = pc()-40;)
566 NOT_PRODUCT(address end = NULL;)
567
568 st->print("%s frame (sp=" INTPTR_FORMAT " unextended sp=" INTPTR_FORMAT, print_name(), sp(), unextended_sp());
569 if (sp() != NULL)
570 st->print(", fp=" INTPTR_FORMAT ", real_fp=" INTPTR_FORMAT ", pc=" INTPTR_FORMAT, fp(), real_fp(), pc());
571
572 if (StubRoutines::contains(pc())) {
573 st->print_cr(")");
574 st->print("(");
575 StubCodeDesc* desc = StubCodeDesc::desc_for(pc());
576 st->print("~Stub::%s", desc->name());
577 NOT_PRODUCT(begin = desc->begin(); end = desc->end();)
578 } else if (Interpreter::contains(pc())) {
579 st->print_cr(")");
580 st->print("(");
581 InterpreterCodelet* desc = Interpreter::codelet_containing(pc());
582 if (desc != NULL) {
583 st->print("~");
584 desc->print_on(st);
585 NOT_PRODUCT(begin = desc->code_begin(); end = desc->code_end();)
586 } else {
587 st->print("~interpreter");
588 }
589 }
590 st->print_cr(")");
591
592 if (_cb != NULL) {
593 st->print(" ");
594 _cb->print_value_on(st);
595 st->cr();
596 #ifndef PRODUCT
597 if (end == NULL) {
598 begin = _cb->code_begin();
599 end = _cb->code_end();
600 }
601 #endif
602 }
603 NOT_PRODUCT(if (WizardMode && Verbose) Disassembler::decode(begin, end);)
604 }
605
606
607 void frame::print_on(outputStream* st) const {
608 print_value_on(st,NULL);
609 if (is_interpreted_frame()) {
610 interpreter_frame_print_on(st);
611 }
612 }
613
614
615 void frame::interpreter_frame_print_on(outputStream* st) const {
616 #ifndef PRODUCT
617 assert(is_interpreted_frame(), "Not an interpreted frame");
618 jint i;
619 for (i = 0; i < interpreter_frame_method()->max_locals(); i++ ) {
620 intptr_t x = *interpreter_frame_local_at(i);
621 st->print(" - local [" INTPTR_FORMAT "]", x);
622 st->fill_to(23);
623 st->print_cr("; #%d", i);
624 }
625 for (i = interpreter_frame_expression_stack_size() - 1; i >= 0; --i ) {
626 intptr_t x = *interpreter_frame_expression_stack_at(i);
627 st->print(" - stack [" INTPTR_FORMAT "]", x);
628 st->fill_to(23);
629 st->print_cr("; #%d", i);
630 }
631 // locks for synchronization
632 for (BasicObjectLock* current = interpreter_frame_monitor_end();
633 current < interpreter_frame_monitor_begin();
634 current = next_monitor_in_interpreter_frame(current)) {
635 st->print(" - obj [");
636 current->obj()->print_value_on(st);
637 st->print_cr("]");
638 st->print(" - lock [");
639 current->lock()->print_on(st);
640 st->print_cr("]");
641 }
642 // monitor
643 st->print_cr(" - monitor[" INTPTR_FORMAT "]", interpreter_frame_monitor_begin());
644 // bcp
645 st->print(" - bcp [" INTPTR_FORMAT "]", interpreter_frame_bcp());
646 st->fill_to(23);
647 st->print_cr("; @%d", interpreter_frame_bci());
648 // locals
649 st->print_cr(" - locals [" INTPTR_FORMAT "]", interpreter_frame_local_at(0));
650 // method
651 st->print(" - method [" INTPTR_FORMAT "]", (address)interpreter_frame_method());
652 st->fill_to(23);
653 st->print("; ");
654 interpreter_frame_method()->print_name(st);
655 st->cr();
656 #endif
657 }
658
659 // Print whether the frame is in the VM or OS indicating a HotSpot problem.
660 // Otherwise, it's likely a bug in the native library that the Java code calls,
661 // hopefully indicating where to submit bugs.
662 void frame::print_C_frame(outputStream* st, char* buf, int buflen, address pc) {
663 // C/C++ frame
664 bool in_vm = os::address_is_in_vm(pc);
665 st->print(in_vm ? "V" : "C");
666
667 int offset;
668 bool found;
669
670 // libname
671 found = os::dll_address_to_library_name(pc, buf, buflen, &offset);
672 if (found) {
673 // skip directory names
674 const char *p1, *p2;
675 p1 = buf;
676 int len = (int)strlen(os::file_separator());
677 while ((p2 = strstr(p1, os::file_separator())) != NULL) p1 = p2 + len;
678 st->print(" [%s+0x%x]", p1, offset);
679 } else {
680 st->print(" " PTR_FORMAT, pc);
681 }
682
683 // function name - os::dll_address_to_function_name() may return confusing
684 // names if pc is within jvm.dll or libjvm.so, because JVM only has
685 // JVM_xxxx and a few other symbols in the dynamic symbol table. Do this
686 // only for native libraries.
687 if (!in_vm || Decoder::can_decode_C_frame_in_vm()) {
688 found = os::dll_address_to_function_name(pc, buf, buflen, &offset);
689
690 if (found) {
691 st->print(" %s+0x%x", buf, offset);
692 }
693 }
694 }
695
696 // frame::print_on_error() is called by fatal error handler. Notice that we may
697 // crash inside this function if stack frame is corrupted. The fatal error
698 // handler can catch and handle the crash. Here we assume the frame is valid.
699 //
700 // First letter indicates type of the frame:
701 // J: Java frame (compiled)
702 // j: Java frame (interpreted)
703 // V: VM frame (C/C++)
704 // v: Other frames running VM generated code (e.g. stubs, adapters, etc.)
705 // C: C/C++ frame
706 //
707 // We don't need detailed frame type as that in frame::print_name(). "C"
708 // suggests the problem is in user lib; everything else is likely a VM bug.
709
710 void frame::print_on_error(outputStream* st, char* buf, int buflen, bool verbose) const {
711 if (_cb != NULL) {
712 if (Interpreter::contains(pc())) {
713 Method* m = this->interpreter_frame_method();
714 if (m != NULL) {
715 m->name_and_sig_as_C_string(buf, buflen);
716 st->print("j %s", buf);
717 st->print("+%d", this->interpreter_frame_bci());
718 } else {
719 st->print("j " PTR_FORMAT, pc());
720 }
721 } else if (StubRoutines::contains(pc())) {
722 StubCodeDesc* desc = StubCodeDesc::desc_for(pc());
723 if (desc != NULL) {
724 st->print("v ~StubRoutines::%s", desc->name());
725 } else {
726 st->print("v ~StubRoutines::" PTR_FORMAT, pc());
727 }
728 } else if (_cb->is_buffer_blob()) {
729 st->print("v ~BufferBlob::%s", ((BufferBlob *)_cb)->name());
730 } else if (_cb->is_nmethod()) {
731 nmethod* nm = (nmethod*)_cb;
732 Method* m = nm->method();
733 if (m != NULL) {
734 m->name_and_sig_as_C_string(buf, buflen);
735 st->print("J %d%s %s %s (%d bytes) @ " PTR_FORMAT " [" PTR_FORMAT "+0x%x]",
736 nm->compile_id(), (nm->is_osr_method() ? "%" : ""),
737 ((nm->compiler() != NULL) ? nm->compiler()->name() : ""),
738 buf, m->code_size(), _pc, _cb->code_begin(), _pc - _cb->code_begin());
739 } else {
740 st->print("J " PTR_FORMAT, pc());
741 }
742 } else if (_cb->is_runtime_stub()) {
743 st->print("v ~RuntimeStub::%s", ((RuntimeStub *)_cb)->name());
744 } else if (_cb->is_deoptimization_stub()) {
745 st->print("v ~DeoptimizationBlob");
746 } else if (_cb->is_exception_stub()) {
747 st->print("v ~ExceptionBlob");
748 } else if (_cb->is_safepoint_stub()) {
749 st->print("v ~SafepointBlob");
750 } else {
751 st->print("v blob " PTR_FORMAT, pc());
752 }
753 } else {
754 print_C_frame(st, buf, buflen, pc());
755 }
756 }
757
758
759 /*
760 The interpreter_frame_expression_stack_at method in the case of SPARC needs the
761 max_stack value of the method in order to compute the expression stack address.
762 It uses the Method* in order to get the max_stack value but during GC this
763 Method* value saved on the frame is changed by reverse_and_push and hence cannot
764 be used. So we save the max_stack value in the FrameClosure object and pass it
765 down to the interpreter_frame_expression_stack_at method
766 */
767 class InterpreterFrameClosure : public OffsetClosure {
768 private:
769 frame* _fr;
770 OopClosure* _f;
771 int _max_locals;
772 int _max_stack;
773
774 public:
775 InterpreterFrameClosure(frame* fr, int max_locals, int max_stack,
776 OopClosure* f) {
777 _fr = fr;
778 _max_locals = max_locals;
779 _max_stack = max_stack;
780 _f = f;
781 }
782
783 void offset_do(int offset) {
784 oop* addr;
785 if (offset < _max_locals) {
786 addr = (oop*) _fr->interpreter_frame_local_at(offset);
787 assert((intptr_t*)addr >= _fr->sp(), "must be inside the frame");
788 _f->do_oop(addr);
789 } else {
790 addr = (oop*) _fr->interpreter_frame_expression_stack_at((offset - _max_locals));
791 // In case of exceptions, the expression stack is invalid and the esp will be reset to express
792 // this condition. Therefore, we call f only if addr is 'inside' the stack (i.e., addr >= esp for Intel).
793 bool in_stack;
794 if (frame::interpreter_frame_expression_stack_direction() > 0) {
795 in_stack = (intptr_t*)addr <= _fr->interpreter_frame_tos_address();
796 } else {
797 in_stack = (intptr_t*)addr >= _fr->interpreter_frame_tos_address();
798 }
799 if (in_stack) {
800 _f->do_oop(addr);
801 }
802 }
803 }
804
805 int max_locals() { return _max_locals; }
806 frame* fr() { return _fr; }
807 };
808
809
810 class InterpretedArgumentOopFinder: public SignatureInfo {
811 private:
812 OopClosure* _f; // Closure to invoke
813 int _offset; // TOS-relative offset, decremented with each argument
814 bool _has_receiver; // true if the callee has a receiver
815 frame* _fr;
816
817 void set(int size, BasicType type) {
818 _offset -= size;
819 if (type == T_OBJECT || type == T_ARRAY) oop_offset_do();
820 }
821
822 void oop_offset_do() {
823 oop* addr;
824 addr = (oop*)_fr->interpreter_frame_tos_at(_offset);
825 _f->do_oop(addr);
826 }
827
828 public:
829 InterpretedArgumentOopFinder(Symbol* signature, bool has_receiver, frame* fr, OopClosure* f) : SignatureInfo(signature), _has_receiver(has_receiver) {
830 // compute size of arguments
831 int args_size = ArgumentSizeComputer(signature).size() + (has_receiver ? 1 : 0);
832 assert(!fr->is_interpreted_frame() ||
833 args_size <= fr->interpreter_frame_expression_stack_size(),
834 "args cannot be on stack anymore");
835 // initialize InterpretedArgumentOopFinder
836 _f = f;
837 _fr = fr;
838 _offset = args_size;
839 }
840
841 void oops_do() {
842 if (_has_receiver) {
843 --_offset;
844 oop_offset_do();
845 }
846 iterate_parameters();
847 }
848 };
849
850
851 // Entry frame has following form (n arguments)
852 // +-----------+
853 // sp -> | last arg |
854 // +-----------+
855 // : ::: :
856 // +-----------+
857 // (sp+n)->| first arg|
858 // +-----------+
859
860
861
862 // visits and GC's all the arguments in entry frame
863 class EntryFrameOopFinder: public SignatureInfo {
864 private:
865 bool _is_static;
866 int _offset;
867 frame* _fr;
868 OopClosure* _f;
869
870 void set(int size, BasicType type) {
871 assert (_offset >= 0, "illegal offset");
872 if (type == T_OBJECT || type == T_ARRAY) oop_at_offset_do(_offset);
873 _offset -= size;
874 }
875
876 void oop_at_offset_do(int offset) {
877 assert (offset >= 0, "illegal offset");
878 oop* addr = (oop*) _fr->entry_frame_argument_at(offset);
879 _f->do_oop(addr);
880 }
881
882 public:
883 EntryFrameOopFinder(frame* frame, Symbol* signature, bool is_static) : SignatureInfo(signature) {
884 _f = NULL; // will be set later
885 _fr = frame;
886 _is_static = is_static;
887 _offset = ArgumentSizeComputer(signature).size() - 1; // last parameter is at index 0
888 }
889
890 void arguments_do(OopClosure* f) {
891 _f = f;
892 if (!_is_static) oop_at_offset_do(_offset+1); // do the receiver
893 iterate_parameters();
894 }
895
896 };
897
898 oop* frame::interpreter_callee_receiver_addr(Symbol* signature) {
899 ArgumentSizeComputer asc(signature);
900 int size = asc.size();
901 return (oop *)interpreter_frame_tos_at(size);
902 }
903
904
905 void frame::oops_interpreted_do(OopClosure* f, CLDClosure* cld_f,
906 const RegisterMap* map, bool query_oop_map_cache) {
907 assert(is_interpreted_frame(), "Not an interpreted frame");
908 assert(map != NULL, "map must be set");
909 Thread *thread = Thread::current();
910 methodHandle m (thread, interpreter_frame_method());
911 jint bci = interpreter_frame_bci();
912
913 assert(!Universe::heap()->is_in(m()),
914 "must be valid oop");
915 assert(m->is_method(), "checking frame value");
916 assert((m->is_native() && bci == 0) ||
917 (!m->is_native() && bci >= 0 && bci < m->code_size()),
918 "invalid bci value");
919
920 // Handle the monitor elements in the activation
921 for (
922 BasicObjectLock* current = interpreter_frame_monitor_end();
923 current < interpreter_frame_monitor_begin();
924 current = next_monitor_in_interpreter_frame(current)
925 ) {
926 #ifdef ASSERT
927 interpreter_frame_verify_monitor(current);
928 #endif
929 current->oops_do(f);
930 }
931
932 // process fixed part
933 if (cld_f != NULL) {
934 // The method pointer in the frame might be the only path to the method's
935 // klass, and the klass needs to be kept alive while executing. The GCs
936 // don't trace through method pointers, so typically in similar situations
937 // the mirror or the class loader of the klass are installed as a GC root.
938 // To minimize the overhead of doing that here, we ask the GC to pass down a
939 // closure that knows how to keep klasses alive given a ClassLoaderData.
940 cld_f->do_cld(m->method_holder()->class_loader_data());
941 }
942
943 if (m->is_native() PPC32_ONLY(&& m->is_static())) {
944 f->do_oop(interpreter_frame_temp_oop_addr());
945 }
946
947 int max_locals = m->is_native() ? m->size_of_parameters() : m->max_locals();
948
949 Symbol* signature = NULL;
950 bool has_receiver = false;
951
952 // Process a callee's arguments if we are at a call site
953 // (i.e., if we are at an invoke bytecode)
954 // This is used sometimes for calling into the VM, not for another
955 // interpreted or compiled frame.
956 if (!m->is_native()) {
957 Bytecode_invoke call = Bytecode_invoke_check(m, bci);
958 if (call.is_valid()) {
959 signature = call.signature();
960 has_receiver = call.has_receiver();
961 if (map->include_argument_oops() &&
962 interpreter_frame_expression_stack_size() > 0) {
963 ResourceMark rm(thread); // is this right ???
964 // we are at a call site & the expression stack is not empty
965 // => process callee's arguments
966 //
967 // Note: The expression stack can be empty if an exception
968 // occurred during method resolution/execution. In all
969 // cases we empty the expression stack completely be-
970 // fore handling the exception (the exception handling
971 // code in the interpreter calls a blocking runtime
972 // routine which can cause this code to be executed).
973 // (was bug gri 7/27/98)
974 oops_interpreted_arguments_do(signature, has_receiver, f);
975 }
976 }
977 }
978
979 InterpreterFrameClosure blk(this, max_locals, m->max_stack(), f);
980
981 // process locals & expression stack
982 InterpreterOopMap mask;
983 if (query_oop_map_cache) {
984 m->mask_for(bci, &mask);
985 } else {
986 OopMapCache::compute_one_oop_map(m, bci, &mask);
987 }
988 mask.iterate_oop(&blk);
989 }
990
991
992 void frame::oops_interpreted_arguments_do(Symbol* signature, bool has_receiver, OopClosure* f) {
993 InterpretedArgumentOopFinder finder(signature, has_receiver, this, f);
994 finder.oops_do();
995 }
996
997 void frame::oops_code_blob_do(OopClosure* f, CodeBlobClosure* cf, const RegisterMap* reg_map) {
998 assert(_cb != NULL, "sanity check");
999 if (_cb->oop_maps() != NULL) {
1000 OopMapSet::oops_do(this, reg_map, f);
1001
1002 // Preserve potential arguments for a callee. We handle this by dispatching
1003 // on the codeblob. For c2i, we do
1004 if (reg_map->include_argument_oops()) {
1005 _cb->preserve_callee_argument_oops(*this, reg_map, f);
1006 }
1007 }
1008 // In cases where perm gen is collected, GC will want to mark
1009 // oops referenced from nmethods active on thread stacks so as to
1010 // prevent them from being collected. However, this visit should be
1011 // restricted to certain phases of the collection only. The
1012 // closure decides how it wants nmethods to be traced.
1013 if (cf != NULL)
1014 cf->do_code_blob(_cb);
1015 }
1016
1017 class CompiledArgumentOopFinder: public SignatureInfo {
1018 protected:
1019 OopClosure* _f;
1020 int _offset; // the current offset, incremented with each argument
1021 bool _has_receiver; // true if the callee has a receiver
1022 bool _has_appendix; // true if the call has an appendix
1023 frame _fr;
1024 RegisterMap* _reg_map;
1025 int _arg_size;
1026 VMRegPair* _regs; // VMReg list of arguments
1027
1028 void set(int size, BasicType type) {
1029 if (type == T_OBJECT || type == T_ARRAY) handle_oop_offset();
1030 _offset += size;
1031 }
1032
1033 virtual void handle_oop_offset() {
1034 // Extract low order register number from register array.
1035 // In LP64-land, the high-order bits are valid but unhelpful.
1036 VMReg reg = _regs[_offset].first();
1037 oop *loc = _fr.oopmapreg_to_location(reg, _reg_map);
1038 _f->do_oop(loc);
1039 }
1040
1041 public:
1042 CompiledArgumentOopFinder(Symbol* signature, bool has_receiver, bool has_appendix, OopClosure* f, frame fr, const RegisterMap* reg_map)
1043 : SignatureInfo(signature) {
1044
1045 // initialize CompiledArgumentOopFinder
1046 _f = f;
1047 _offset = 0;
1048 _has_receiver = has_receiver;
1049 _has_appendix = has_appendix;
1050 _fr = fr;
1051 _reg_map = (RegisterMap*)reg_map;
1052 _arg_size = ArgumentSizeComputer(signature).size() + (has_receiver ? 1 : 0) + (has_appendix ? 1 : 0);
1053
1054 int arg_size;
1055 _regs = SharedRuntime::find_callee_arguments(signature, has_receiver, has_appendix, &arg_size);
1056 assert(arg_size == _arg_size, "wrong arg size");
1057 }
1058
1059 void oops_do() {
1060 if (_has_receiver) {
1061 handle_oop_offset();
1062 _offset++;
1063 }
1064 iterate_parameters();
1065 if (_has_appendix) {
1066 handle_oop_offset();
1067 _offset++;
1068 }
1069 }
1070 };
1071
1072 void frame::oops_compiled_arguments_do(Symbol* signature, bool has_receiver, bool has_appendix, const RegisterMap* reg_map, OopClosure* f) {
1073 ResourceMark rm;
1074 CompiledArgumentOopFinder finder(signature, has_receiver, has_appendix, f, *this, reg_map);
1075 finder.oops_do();
1076 }
1077
1078
1079 // Get receiver out of callers frame, i.e. find parameter 0 in callers
1080 // frame. Consult ADLC for where parameter 0 is to be found. Then
1081 // check local reg_map for it being a callee-save register or argument
1082 // register, both of which are saved in the local frame. If not found
1083 // there, it must be an in-stack argument of the caller.
1084 // Note: caller.sp() points to callee-arguments
1085 oop frame::retrieve_receiver(RegisterMap* reg_map) {
1086 frame caller = *this;
1087
1088 // First consult the ADLC on where it puts parameter 0 for this signature.
1089 VMReg reg = SharedRuntime::name_for_receiver();
1090 oop* oop_adr = caller.oopmapreg_to_location(reg, reg_map);
1091 if (oop_adr == NULL) {
1092 guarantee(oop_adr != NULL, "bad register save location");
1093 return NULL;
1094 }
1095 oop r = *oop_adr;
1096 assert(Universe::heap()->is_in_or_null(r), err_msg("bad receiver: " INTPTR_FORMAT " (" INTX_FORMAT ")", (void *) r, (void *) r));
1097 return r;
1098 }
1099
1100
1101 oop* frame::oopmapreg_to_location(VMReg reg, const RegisterMap* reg_map) const {
1102 if(reg->is_reg()) {
1103 // If it is passed in a register, it got spilled in the stub frame.
1104 return (oop *)reg_map->location(reg);
1105 } else {
1106 int sp_offset_in_bytes = reg->reg2stack() * VMRegImpl::stack_slot_size;
1107 return (oop*)(((address)unextended_sp()) + sp_offset_in_bytes);
1108 }
1109 }
1110
1111 BasicLock* frame::get_native_monitor() {
1112 nmethod* nm = (nmethod*)_cb;
1113 assert(_cb != NULL && _cb->is_nmethod() && nm->method()->is_native(),
1114 "Should not call this unless it's a native nmethod");
1115 int byte_offset = in_bytes(nm->native_basic_lock_sp_offset());
1116 assert(byte_offset >= 0, "should not see invalid offset");
1117 return (BasicLock*) &sp()[byte_offset / wordSize];
1118 }
1119
1120 oop frame::get_native_receiver() {
1121 nmethod* nm = (nmethod*)_cb;
1122 assert(_cb != NULL && _cb->is_nmethod() && nm->method()->is_native(),
1123 "Should not call this unless it's a native nmethod");
1124 int byte_offset = in_bytes(nm->native_receiver_sp_offset());
1125 assert(byte_offset >= 0, "should not see invalid offset");
1126 oop owner = ((oop*) sp())[byte_offset / wordSize];
1127 assert( Universe::heap()->is_in(owner), "bad receiver" );
1128 return owner;
1129 }
1130
1131 void frame::oops_entry_do(OopClosure* f, const RegisterMap* map) {
1132 assert(map != NULL, "map must be set");
1133 if (map->include_argument_oops()) {
1134 // must collect argument oops, as nobody else is doing it
1135 Thread *thread = Thread::current();
1136 methodHandle m (thread, entry_frame_call_wrapper()->callee_method());
1137 EntryFrameOopFinder finder(this, m->signature(), m->is_static());
1138 finder.arguments_do(f);
1139 }
1140 // Traverse the Handle Block saved in the entry frame
1141 entry_frame_call_wrapper()->oops_do(f);
1142 }
1143
1144
1145 void frame::oops_do_internal(OopClosure* f, CLDClosure* cld_f, CodeBlobClosure* cf, RegisterMap* map, bool use_interpreter_oop_map_cache) {
1146 #ifndef PRODUCT
1147 // simulate GC crash here to dump java thread in error report
1148 if (CrashGCForDumpingJavaThread) {
1149 char *t = NULL;
1150 *t = 'c';
1151 }
1152 #endif
1153 if (is_interpreted_frame()) {
1154 oops_interpreted_do(f, cld_f, map, use_interpreter_oop_map_cache);
1155 } else if (is_entry_frame()) {
1156 oops_entry_do(f, map);
1157 } else if (CodeCache::contains(pc())) {
1158 oops_code_blob_do(f, cf, map);
1159 #ifdef SHARK
1160 } else if (is_fake_stub_frame()) {
1161 // nothing to do
1162 #endif // SHARK
1163 } else {
1164 ShouldNotReachHere();
1165 }
1166 }
1167
1168 void frame::nmethods_do(CodeBlobClosure* cf) {
1169 if (_cb != NULL && _cb->is_nmethod()) {
1170 cf->do_code_blob(_cb);
1171 }
1172 }
1173
1174
1175 // call f() on the interpreted Method*s in the stack.
1176 // Have to walk the entire code cache for the compiled frames Yuck.
1177 void frame::metadata_do(void f(Metadata*)) {
1178 if (_cb != NULL && Interpreter::contains(pc())) {
1179 Method* m = this->interpreter_frame_method();
1180 assert(m != NULL, "huh?");
1181 f(m);
1182 }
1183 }
1184
1185 void frame::gc_prologue() {
1186 if (is_interpreted_frame()) {
1187 // set bcx to bci to become Method* position independent during GC
1188 interpreter_frame_set_bcx(interpreter_frame_bci());
1189 }
1190 }
1191
1192
1193 void frame::gc_epilogue() {
1194 if (is_interpreted_frame()) {
1195 // set bcx back to bcp for interpreter
1196 interpreter_frame_set_bcx((intptr_t)interpreter_frame_bcp());
1197 }
1198 // call processor specific epilog function
1199 pd_gc_epilog();
1200 }
1201
1202
1203 # ifdef ENABLE_ZAP_DEAD_LOCALS
1204
1205 void frame::CheckValueClosure::do_oop(oop* p) {
1206 if (CheckOopishValues && Universe::heap()->is_in_reserved(*p)) {
1207 warning("value @ " INTPTR_FORMAT " looks oopish (" INTPTR_FORMAT ") (thread = " INTPTR_FORMAT ")", p, (address)*p, Thread::current());
1208 }
1209 }
1210 frame::CheckValueClosure frame::_check_value;
1211
1212
1213 void frame::CheckOopClosure::do_oop(oop* p) {
1214 if (*p != NULL && !(*p)->is_oop()) {
1215 warning("value @ " INTPTR_FORMAT " should be an oop (" INTPTR_FORMAT ") (thread = " INTPTR_FORMAT ")", p, (address)*p, Thread::current());
1216 }
1217 }
1218 frame::CheckOopClosure frame::_check_oop;
1219
1220 void frame::check_derived_oop(oop* base, oop* derived) {
1221 _check_oop.do_oop(base);
1222 }
1223
1224
1225 void frame::ZapDeadClosure::do_oop(oop* p) {
1226 if (TraceZapDeadLocals) tty->print_cr("zapping @ " INTPTR_FORMAT " containing " INTPTR_FORMAT, p, (address)*p);
1227 *p = cast_to_oop<intptr_t>(0xbabebabe);
1228 }
1229 frame::ZapDeadClosure frame::_zap_dead;
1230
1231 void frame::zap_dead_locals(JavaThread* thread, const RegisterMap* map) {
1232 assert(thread == Thread::current(), "need to synchronize to do this to another thread");
1233 // Tracing - part 1
1234 if (TraceZapDeadLocals) {
1235 ResourceMark rm(thread);
1236 tty->print_cr("--------------------------------------------------------------------------------");
1237 tty->print("Zapping dead locals in ");
1238 print_on(tty);
1239 tty->cr();
1240 }
1241 // Zapping
1242 if (is_entry_frame ()) zap_dead_entry_locals (thread, map);
1243 else if (is_interpreted_frame()) zap_dead_interpreted_locals(thread, map);
1244 else if (is_compiled_frame()) zap_dead_compiled_locals (thread, map);
1245
1246 else
1247 // could be is_runtime_frame
1248 // so remove error: ShouldNotReachHere();
1249 ;
1250 // Tracing - part 2
1251 if (TraceZapDeadLocals) {
1252 tty->cr();
1253 }
1254 }
1255
1256
1257 void frame::zap_dead_interpreted_locals(JavaThread *thread, const RegisterMap* map) {
1258 // get current interpreter 'pc'
1259 assert(is_interpreted_frame(), "Not an interpreted frame");
1260 Method* m = interpreter_frame_method();
1261 int bci = interpreter_frame_bci();
1262
1263 int max_locals = m->is_native() ? m->size_of_parameters() : m->max_locals();
1264
1265 // process dynamic part
1266 InterpreterFrameClosure value_blk(this, max_locals, m->max_stack(),
1267 &_check_value);
1268 InterpreterFrameClosure oop_blk(this, max_locals, m->max_stack(),
1269 &_check_oop );
1270 InterpreterFrameClosure dead_blk(this, max_locals, m->max_stack(),
1271 &_zap_dead );
1272
1273 // get frame map
1274 InterpreterOopMap mask;
1275 m->mask_for(bci, &mask);
1276 mask.iterate_all( &oop_blk, &value_blk, &dead_blk);
1277 }
1278
1279
1280 void frame::zap_dead_compiled_locals(JavaThread* thread, const RegisterMap* reg_map) {
1281
1282 ResourceMark rm(thread);
1283 assert(_cb != NULL, "sanity check");
1284 if (_cb->oop_maps() != NULL) {
1285 OopMapSet::all_do(this, reg_map, &_check_oop, check_derived_oop, &_check_value);
1286 }
1287 }
1288
1289
1290 void frame::zap_dead_entry_locals(JavaThread*, const RegisterMap*) {
1291 if (TraceZapDeadLocals) warning("frame::zap_dead_entry_locals unimplemented");
1292 }
1293
1294
1295 void frame::zap_dead_deoptimized_locals(JavaThread*, const RegisterMap*) {
1296 if (TraceZapDeadLocals) warning("frame::zap_dead_deoptimized_locals unimplemented");
1297 }
1298
1299 # endif // ENABLE_ZAP_DEAD_LOCALS
1300
1301 void frame::verify(const RegisterMap* map) {
1302 // for now make sure receiver type is correct
1303 if (is_interpreted_frame()) {
1304 Method* method = interpreter_frame_method();
1305 guarantee(method->is_method(), "method is wrong in frame::verify");
1306 if (!method->is_static()) {
1307 // fetch the receiver
1308 oop* p = (oop*) interpreter_frame_local_at(0);
1309 // make sure we have the right receiver type
1310 }
1311 }
1312 COMPILER2_PRESENT(assert(DerivedPointerTable::is_empty(), "must be empty before verify");)
1313 oops_do_internal(&VerifyOopClosure::verify_oop, NULL, NULL, (RegisterMap*)map, false);
1314 }
1315
1316
1317 #ifdef ASSERT
1318 bool frame::verify_return_pc(address x) {
1319 if (StubRoutines::returns_to_call_stub(x)) {
1320 return true;
1321 }
1322 if (CodeCache::contains(x)) {
1323 return true;
1324 }
1325 if (Interpreter::contains(x)) {
1326 return true;
1327 }
1328 return false;
1329 }
1330 #endif
1331
1332 #ifdef ASSERT
1333 void frame::interpreter_frame_verify_monitor(BasicObjectLock* value) const {
1334 assert(is_interpreted_frame(), "Not an interpreted frame");
1335 // verify that the value is in the right part of the frame
1336 address low_mark = (address) interpreter_frame_monitor_end();
1337 address high_mark = (address) interpreter_frame_monitor_begin();
1338 address current = (address) value;
1339
1340 const int monitor_size = frame::interpreter_frame_monitor_size();
1341 guarantee((high_mark - current) % monitor_size == 0 , "Misaligned top of BasicObjectLock*");
1342 guarantee( high_mark > current , "Current BasicObjectLock* higher than high_mark");
1343
1344 guarantee((current - low_mark) % monitor_size == 0 , "Misaligned bottom of BasicObjectLock*");
1345 guarantee( current >= low_mark , "Current BasicObjectLock* below than low_mark");
1346 }
1347 #endif
1348
1349 #ifndef PRODUCT
1350 void frame::describe(FrameValues& values, int frame_no) {
1351 // boundaries: sp and the 'real' frame pointer
1352 values.describe(-1, sp(), err_msg("sp for #%d", frame_no), 1);
1353 intptr_t* frame_pointer = real_fp(); // Note: may differ from fp()
1354
1355 // print frame info at the highest boundary
1356 intptr_t* info_address = MAX2(sp(), frame_pointer);
1357
1358 if (info_address != frame_pointer) {
1359 // print frame_pointer explicitly if not marked by the frame info
1360 values.describe(-1, frame_pointer, err_msg("frame pointer for #%d", frame_no), 1);
1361 }
1362
1363 if (is_entry_frame() || is_compiled_frame() || is_interpreted_frame() || is_native_frame()) {
1364 // Label values common to most frames
1365 values.describe(-1, unextended_sp(), err_msg("unextended_sp for #%d", frame_no));
1366 }
1367
1368 if (is_interpreted_frame()) {
1369 Method* m = interpreter_frame_method();
1370 int bci = interpreter_frame_bci();
1371
1372 // Label the method and current bci
1373 values.describe(-1, info_address,
1374 FormatBuffer<1024>("#%d method %s @ %d", frame_no, m->name_and_sig_as_C_string(), bci), 2);
1375 values.describe(-1, info_address,
1376 err_msg("- %d locals %d max stack", m->max_locals(), m->max_stack()), 1);
1377 if (m->max_locals() > 0) {
1378 intptr_t* l0 = interpreter_frame_local_at(0);
1379 intptr_t* ln = interpreter_frame_local_at(m->max_locals() - 1);
1380 values.describe(-1, MAX2(l0, ln), err_msg("locals for #%d", frame_no), 1);
1381 // Report each local and mark as owned by this frame
1382 for (int l = 0; l < m->max_locals(); l++) {
1383 intptr_t* l0 = interpreter_frame_local_at(l);
1384 values.describe(frame_no, l0, err_msg("local %d", l));
1385 }
1386 }
1387
1388 // Compute the actual expression stack size
1389 InterpreterOopMap mask;
1390 OopMapCache::compute_one_oop_map(m, bci, &mask);
1391 intptr_t* tos = NULL;
1392 // Report each stack element and mark as owned by this frame
1393 for (int e = 0; e < mask.expression_stack_size(); e++) {
1394 tos = MAX2(tos, interpreter_frame_expression_stack_at(e));
1395 values.describe(frame_no, interpreter_frame_expression_stack_at(e),
1396 err_msg("stack %d", e));
1397 }
1398 if (tos != NULL) {
1399 values.describe(-1, tos, err_msg("expression stack for #%d", frame_no), 1);
1400 }
1401 if (interpreter_frame_monitor_begin() != interpreter_frame_monitor_end()) {
1402 values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_begin(), "monitors begin");
1403 values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_end(), "monitors end");
1404 }
1405 } else if (is_entry_frame()) {
1406 // For now just label the frame
1407 values.describe(-1, info_address, err_msg("#%d entry frame", frame_no), 2);
1408 } else if (is_compiled_frame()) {
1409 // For now just label the frame
1410 nmethod* nm = cb()->as_nmethod_or_null();
1411 values.describe(-1, info_address,
1412 FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for method %s%s", frame_no,
1413 nm, nm->method()->name_and_sig_as_C_string(),
1414 (_deopt_state == is_deoptimized) ?
1415 " (deoptimized)" :
1416 ((_deopt_state == unknown) ? " (state unknown)" : "")),
1417 2);
1418 } else if (is_native_frame()) {
1419 // For now just label the frame
1420 nmethod* nm = cb()->as_nmethod_or_null();
1421 values.describe(-1, info_address,
1422 FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for native method %s", frame_no,
1423 nm, nm->method()->name_and_sig_as_C_string()), 2);
1424 } else {
1425 // provide default info if not handled before
1426 char *info = (char *) "special frame";
1427 if ((_cb != NULL) &&
1428 (_cb->name() != NULL)) {
1429 info = (char *)_cb->name();
1430 }
1431 values.describe(-1, info_address, err_msg("#%d <%s>", frame_no, info), 2);
1432 }
1433
1434 // platform dependent additional data
1435 describe_pd(values, frame_no);
1436 }
1437
1438 #endif
1439
1440
1441 //-----------------------------------------------------------------------------------
1442 // StackFrameStream implementation
1443
1444 StackFrameStream::StackFrameStream(JavaThread *thread, bool update) : _reg_map(thread, update) {
1445 assert(thread->has_last_Java_frame(), "sanity check");
1446 _fr = thread->last_frame();
1447 _is_done = false;
1448 }
1449
1450
1451 #ifndef PRODUCT
1452
1453 void FrameValues::describe(int owner, intptr_t* location, const char* description, int priority) {
1454 FrameValue fv;
1455 fv.location = location;
1456 fv.owner = owner;
1457 fv.priority = priority;
1458 fv.description = NEW_RESOURCE_ARRAY(char, strlen(description) + 1);
1459 strcpy(fv.description, description);
1460 _values.append(fv);
1461 }
1462
1463
1464 #ifdef ASSERT
1465 void FrameValues::validate() {
1466 _values.sort(compare);
1467 bool error = false;
1468 FrameValue prev;
1469 prev.owner = -1;
1470 for (int i = _values.length() - 1; i >= 0; i--) {
1471 FrameValue fv = _values.at(i);
1472 if (fv.owner == -1) continue;
1473 if (prev.owner == -1) {
1474 prev = fv;
1475 continue;
1476 }
1477 if (prev.location == fv.location) {
1478 if (fv.owner != prev.owner) {
1479 tty->print_cr("overlapping storage");
1480 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", prev.location, *prev.location, prev.description);
1481 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", fv.location, *fv.location, fv.description);
1482 error = true;
1483 }
1484 } else {
1485 prev = fv;
1486 }
1487 }
1488 assert(!error, "invalid layout");
1489 }
1490 #endif // ASSERT
1491
1492 void FrameValues::print(JavaThread* thread) {
1493 _values.sort(compare);
1494
1495 // Sometimes values like the fp can be invalid values if the
1496 // register map wasn't updated during the walk. Trim out values
1497 // that aren't actually in the stack of the thread.
1498 int min_index = 0;
1499 int max_index = _values.length() - 1;
1500 intptr_t* v0 = _values.at(min_index).location;
1501 intptr_t* v1 = _values.at(max_index).location;
1502
1503 if (thread == Thread::current()) {
1504 while (!thread->is_in_stack((address)v0)) {
1505 v0 = _values.at(++min_index).location;
1506 }
1507 while (!thread->is_in_stack((address)v1)) {
1508 v1 = _values.at(--max_index).location;
1509 }
1510 } else {
1511 while (!thread->on_local_stack((address)v0)) {
1512 v0 = _values.at(++min_index).location;
1513 }
1514 while (!thread->on_local_stack((address)v1)) {
1515 v1 = _values.at(--max_index).location;
1516 }
1517 }
1518 intptr_t* min = MIN2(v0, v1);
1519 intptr_t* max = MAX2(v0, v1);
1520 intptr_t* cur = max;
1521 intptr_t* last = NULL;
1522 for (int i = max_index; i >= min_index; i--) {
1523 FrameValue fv = _values.at(i);
1524 while (cur > fv.location) {
1525 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT, cur, *cur);
1526 cur--;
1527 }
1528 if (last == fv.location) {
1529 const char* spacer = " " LP64_ONLY(" ");
1530 tty->print_cr(" %s %s %s", spacer, spacer, fv.description);
1531 } else {
1532 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", fv.location, *fv.location, fv.description);
1533 last = fv.location;
1534 cur--;
1535 }
1536 }
1537 }
1538
1539 #endif // ndef PRODUCT