1 /*
2 * Copyright (c) 1997, 2015, 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 "classfile/javaClasses.hpp"
27 #include "classfile/systemDictionary.hpp"
28 #include "classfile/vmSymbols.hpp"
29 #include "code/codeCache.hpp"
30 #include "code/debugInfoRec.hpp"
31 #include "code/nmethod.hpp"
32 #include "code/pcDesc.hpp"
33 #include "code/scopeDesc.hpp"
34 #include "interpreter/interpreter.hpp"
35 #include "interpreter/oopMapCache.hpp"
36 #include "memory/resourceArea.hpp"
37 #include "oops/instanceKlass.hpp"
38 #include "oops/oop.inline.hpp"
39 #include "runtime/handles.inline.hpp"
40 #include "runtime/objectMonitor.hpp"
41 #include "runtime/objectMonitor.inline.hpp"
42 #include "runtime/signature.hpp"
43 #include "runtime/stubRoutines.hpp"
44 #include "runtime/synchronizer.hpp"
45 #include "runtime/vframe.hpp"
46 #include "runtime/vframeArray.hpp"
47 #include "runtime/vframe_hp.hpp"
48
49 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
50
51 vframe::vframe(const frame* fr, const RegisterMap* reg_map, JavaThread* thread)
52 : _reg_map(reg_map), _thread(thread) {
53 assert(fr != NULL, "must have frame");
54 _fr = *fr;
55 }
56
57 vframe::vframe(const frame* fr, JavaThread* thread)
58 : _reg_map(thread), _thread(thread) {
59 assert(fr != NULL, "must have frame");
60 _fr = *fr;
61 }
62
63 vframe* vframe::new_vframe(const frame* f, const RegisterMap* reg_map, JavaThread* thread) {
64 // Interpreter frame
65 if (f->is_interpreted_frame()) {
66 return new interpretedVFrame(f, reg_map, thread);
67 }
68
69 // Compiled frame
70 CodeBlob* cb = f->cb();
71 if (cb != NULL) {
72 if (cb->is_nmethod()) {
73 nmethod* nm = (nmethod*)cb;
74 return new compiledVFrame(f, reg_map, thread, nm);
75 }
76
77 if (f->is_runtime_frame()) {
78 // Skip this frame and try again.
79 RegisterMap temp_map = *reg_map;
80 frame s = f->sender(&temp_map);
81 return new_vframe(&s, &temp_map, thread);
82 }
83 }
84
85 // External frame
86 return new externalVFrame(f, reg_map, thread);
87 }
88
89 vframe* vframe::sender() const {
90 RegisterMap temp_map = *register_map();
91 assert(is_top(), "just checking");
92 if (_fr.is_entry_frame() && _fr.is_first_frame()) return NULL;
93 frame s = _fr.real_sender(&temp_map);
94 if (s.is_first_frame()) return NULL;
95 return vframe::new_vframe(&s, &temp_map, thread());
96 }
97
98 vframe* vframe::top() const {
99 vframe* vf = (vframe*) this;
100 while (!vf->is_top()) vf = vf->sender();
101 return vf;
102 }
103
104
105 javaVFrame* vframe::java_sender() const {
106 vframe* f = sender();
107 while (f != NULL) {
108 if (f->is_java_frame()) return javaVFrame::cast(f);
109 f = f->sender();
110 }
111 return NULL;
112 }
113
114 // ------------- javaVFrame --------------
115
116 GrowableArray<MonitorInfo*>* javaVFrame::locked_monitors() {
117 assert(SafepointSynchronize::is_at_safepoint() || JavaThread::current() == thread(),
118 "must be at safepoint or it's a java frame of the current thread");
119
120 GrowableArray<MonitorInfo*>* mons = monitors();
121 GrowableArray<MonitorInfo*>* result = new GrowableArray<MonitorInfo*>(mons->length());
122 if (mons->is_empty()) return result;
123
124 bool found_first_monitor = false;
125 ObjectMonitor *pending_monitor = thread()->current_pending_monitor();
126 ObjectMonitor *waiting_monitor = thread()->current_waiting_monitor();
127 oop pending_obj = (pending_monitor != NULL ? (oop) pending_monitor->object() : (oop) NULL);
128 oop waiting_obj = (waiting_monitor != NULL ? (oop) waiting_monitor->object() : (oop) NULL);
129
130 for (int index = (mons->length()-1); index >= 0; index--) {
131 MonitorInfo* monitor = mons->at(index);
132 if (monitor->eliminated() && is_compiled_frame()) continue; // skip eliminated monitor
133 oop obj = monitor->owner();
134 if (obj == NULL) continue; // skip unowned monitor
135 //
136 // Skip the monitor that the thread is blocked to enter or waiting on
137 //
138 if (!found_first_monitor && (obj == pending_obj || obj == waiting_obj)) {
139 continue;
140 }
141 found_first_monitor = true;
142 result->append(monitor);
143 }
144 return result;
145 }
146
147 static void print_locked_object_class_name(outputStream* st, Handle obj, const char* lock_state) {
148 if (obj.not_null()) {
149 st->print("\t- %s <" INTPTR_FORMAT "> ", lock_state, (address)obj());
150 if (obj->klass() == SystemDictionary::Class_klass()) {
151 Klass* target_klass = java_lang_Class::as_Klass(obj());
152 st->print_cr("(a java.lang.Class for %s)", InstanceKlass::cast(target_klass)->external_name());
153 } else {
154 Klass* k = obj->klass();
155 st->print_cr("(a %s)", k->external_name());
156 }
157 }
158 }
159
160 void javaVFrame::print_lock_info_on(outputStream* st, int frame_count) {
161 ResourceMark rm;
162
163 // If this is the first frame, and java.lang.Object.wait(...) then print out the receiver.
164 if (frame_count == 0) {
165 if (method()->name() == vmSymbols::wait_name() &&
166 method()->method_holder()->name() == vmSymbols::java_lang_Object()) {
167 StackValueCollection* locs = locals();
168 if (!locs->is_empty()) {
169 StackValue* sv = locs->at(0);
170 if (sv->type() == T_OBJECT) {
171 Handle o = locs->at(0)->get_obj();
172 print_locked_object_class_name(st, o, "waiting on");
173 }
174 }
175 } else if (thread()->current_park_blocker() != NULL) {
176 oop obj = thread()->current_park_blocker();
177 Klass* k = obj->klass();
178 st->print_cr("\t- %s <" INTPTR_FORMAT "> (a %s)", "parking to wait for ", (address)obj, k->external_name());
179 }
180 }
181
182
183 // Print out all monitors that we have locked or are trying to lock
184 GrowableArray<MonitorInfo*>* mons = monitors();
185 if (!mons->is_empty()) {
186 bool found_first_monitor = false;
187 for (int index = (mons->length()-1); index >= 0; index--) {
188 MonitorInfo* monitor = mons->at(index);
189 if (monitor->eliminated() && is_compiled_frame()) { // Eliminated in compiled code
190 if (monitor->owner_is_scalar_replaced()) {
191 Klass* k = java_lang_Class::as_Klass(monitor->owner_klass());
192 // format below for lockbits matches this one.
193 st->print("\t- eliminated <owner is scalar replaced> (a %s)", k->external_name());
194 } else {
195 oop obj = monitor->owner();
196 if (obj != NULL) {
197 print_locked_object_class_name(st, obj, "eliminated");
198 }
199 }
200 continue;
201 }
202 if (monitor->owner() != NULL) {
203 // the monitor is associated with an object, i.e., it is locked
204
205 // First, assume we have the monitor locked. If we haven't found an
206 // owned monitor before and this is the first frame, then we need to
207 // see if we have completed the lock or we are blocked trying to
208 // acquire it - we can only be blocked if the monitor is inflated
209
210 const char *lock_state = "locked"; // assume we have the monitor locked
211 if (!found_first_monitor && frame_count == 0) {
212 markOop mark = monitor->owner()->mark();
213 if (mark->has_monitor() &&
214 ( // we have marked ourself as pending on this monitor
215 mark->monitor() == thread()->current_pending_monitor() ||
216 // we are not the owner of this monitor
217 !mark->monitor()->is_entered(thread())
218 )) {
219 lock_state = "waiting to lock";
220 print_locked_object_class_name(st, monitor->owner(), lock_state);
221 if (Verbose) {
222 // match with format above, replacing "-" with " ".
223 st->print("\t lockbits="); mark->print_on(st); st->print_cr("");
224 }
225 } else {
226 print_locked_object_class_name(st, monitor->owner(), lock_state);
227 }
228 } else {
229 print_locked_object_class_name(st, monitor->owner(), lock_state);
230 }
231 found_first_monitor = true;
232 }
233 }
234 }
235 }
236
237 // ------------- interpretedVFrame --------------
238
239 u_char* interpretedVFrame::bcp() const {
240 return fr().interpreter_frame_bcp();
241 }
242
243 void interpretedVFrame::set_bcp(u_char* bcp) {
244 fr().interpreter_frame_set_bcp(bcp);
245 }
246
247 intptr_t* interpretedVFrame::locals_addr_at(int offset) const {
248 assert(fr().is_interpreted_frame(), "frame should be an interpreted frame");
249 return fr().interpreter_frame_local_at(offset);
250 }
251
252
253 GrowableArray<MonitorInfo*>* interpretedVFrame::monitors() const {
254 GrowableArray<MonitorInfo*>* result = new GrowableArray<MonitorInfo*>(5);
255 for (BasicObjectLock* current = (fr().previous_monitor_in_interpreter_frame(fr().interpreter_frame_monitor_begin()));
256 current >= fr().interpreter_frame_monitor_end();
257 current = fr().previous_monitor_in_interpreter_frame(current)) {
258 result->push(new MonitorInfo(current->obj(), current->lock(), false, false));
259 }
260 return result;
261 }
262
263 int interpretedVFrame::bci() const {
264 return method()->bci_from(bcp());
265 }
266
267 Method* interpretedVFrame::method() const {
268 return fr().interpreter_frame_method();
269 }
270
271 static StackValue* create_stack_value_from_oop_map(const InterpreterOopMap& oop_mask,
272 int index,
273 const intptr_t* const addr) {
274
275 assert(index >= 0 &&
276 index < oop_mask.number_of_entries(), "invariant");
277
278 // categorize using oop_mask
279 if (oop_mask.is_oop(index)) {
280 // reference (oop) "r"
281 Handle h(addr != NULL ? (*(oop*)addr) : (oop)NULL);
282 return new StackValue(h);
283 }
284 // value (integer) "v"
285 return new StackValue(addr != NULL ? *addr : 0);
286 }
287
288 static bool is_in_expression_stack(const frame& fr, const intptr_t* const addr) {
289 assert(addr != NULL, "invariant");
290
291 // Ensure to be 'inside' the expresion stack (i.e., addr >= sp for Intel).
292 // In case of exceptions, the expression stack is invalid and the sp
293 // will be reset to express this condition.
294 if (frame::interpreter_frame_expression_stack_direction() > 0) {
295 return addr <= fr.interpreter_frame_tos_address();
296 }
297
298 return addr >= fr.interpreter_frame_tos_address();
299 }
300
301 static void stack_locals(StackValueCollection* result,
302 int length,
303 const InterpreterOopMap& oop_mask,
304 const frame& fr) {
305
306 assert(result != NULL, "invariant");
307
308 for (int i = 0; i < length; ++i) {
309 const intptr_t* const addr = fr.interpreter_frame_local_at(i);
310 assert(addr != NULL, "invariant");
311 assert(addr >= fr.sp(), "must be inside the frame");
312
313 StackValue* const sv = create_stack_value_from_oop_map(oop_mask, i, addr);
314 assert(sv != NULL, "sanity check");
315
316 result->add(sv);
317 }
318 }
319
320 static void stack_expressions(StackValueCollection* result,
321 int length,
322 int max_locals,
323 const InterpreterOopMap& oop_mask,
324 const frame& fr) {
325
326 assert(result != NULL, "invariant");
327
328 for (int i = 0; i < length; ++i) {
329 const intptr_t* addr = fr.interpreter_frame_expression_stack_at(i);
330 assert(addr != NULL, "invariant");
331 if (!is_in_expression_stack(fr, addr)) {
332 // Need to ensure no bogus escapes.
333 addr = NULL;
334 }
335
336 StackValue* const sv = create_stack_value_from_oop_map(oop_mask,
337 i + max_locals,
338 addr);
339 assert(sv != NULL, "sanity check");
340
341 result->add(sv);
342 }
343 }
344
345 StackValueCollection* interpretedVFrame::locals() const {
346 return stack_data(false);
347 }
348
349 StackValueCollection* interpretedVFrame::expressions() const {
350 return stack_data(true);
351 }
352
353 /*
354 * Worker routine for fetching references and/or values
355 * for a particular bci in the interpretedVFrame.
356 *
357 * Returns data for either "locals" or "expressions",
358 * using bci relative oop_map (oop_mask) information.
359 *
360 * @param expressions bool switch controlling what data to return
361 (false == locals / true == expression)
362 *
363 */
364 StackValueCollection* interpretedVFrame::stack_data(bool expressions) const {
365
366 InterpreterOopMap oop_mask;
367 // oopmap for current bci
368 if (TraceDeoptimization && Verbose) {
369 methodHandle m_h(Thread::current(), method());
370 OopMapCache::compute_one_oop_map(m_h, bci(), &oop_mask);
371 } else {
372 method()->mask_for(bci(), &oop_mask);
373 }
374
375 const int mask_len = oop_mask.number_of_entries();
376
377 // If the method is native, method()->max_locals() is not telling the truth.
378 // For our purposes, max locals instead equals the size of parameters.
379 const int max_locals = method()->is_native() ?
380 method()->size_of_parameters() : method()->max_locals();
381
382 assert(mask_len >= max_locals, "invariant");
383
384 const int length = expressions ? mask_len - max_locals : max_locals;
385 assert(length >= 0, "invariant");
386
387 StackValueCollection* const result = new StackValueCollection(length);
388
389 if (0 == length) {
390 return result;
391 }
392
393 if (expressions) {
394 stack_expressions(result, length, max_locals, oop_mask, fr());
395 } else {
396 stack_locals(result, length, oop_mask, fr());
397 }
398
399 assert(length == result->size(), "invariant");
400
401 return result;
402 }
403
404 void interpretedVFrame::set_locals(StackValueCollection* values) const {
405 if (values == NULL || values->size() == 0) return;
406
407 // If the method is native, max_locals is not telling the truth.
408 // maxlocals then equals the size of parameters
409 const int max_locals = method()->is_native() ?
410 method()->size_of_parameters() : method()->max_locals();
411
412 assert(max_locals == values->size(), "Mismatch between actual stack format and supplied data");
413
414 // handle locals
415 for (int i = 0; i < max_locals; i++) {
416 // Find stack location
417 intptr_t *addr = locals_addr_at(i);
418
419 // Depending on oop/int put it in the right package
420 const StackValue* const sv = values->at(i);
421 assert(sv != NULL, "sanity check");
422 if (sv->type() == T_OBJECT) {
423 *(oop *) addr = (sv->get_obj())();
424 } else { // integer
425 *addr = sv->get_int();
426 }
427 }
428 }
429
430 // ------------- cChunk --------------
431
432 entryVFrame::entryVFrame(const frame* fr, const RegisterMap* reg_map, JavaThread* thread)
433 : externalVFrame(fr, reg_map, thread) {}
434
435
436 void vframeStreamCommon::found_bad_method_frame() {
437 // 6379830 Cut point for an assertion that occasionally fires when
438 // we are using the performance analyzer.
439 // Disable this assert when testing the analyzer with fastdebug.
440 // -XX:SuppressErrorAt=vframe.cpp:XXX (XXX=following line number)
441 assert(false, "invalid bci or invalid scope desc");
442 }
443
444 // top-frame will be skipped
445 vframeStream::vframeStream(JavaThread* thread, frame top_frame,
446 bool stop_at_java_call_stub) : vframeStreamCommon(thread) {
447 _stop_at_java_call_stub = stop_at_java_call_stub;
448
449 // skip top frame, as it may not be at safepoint
450 _frame = top_frame.sender(&_reg_map);
451 while (!fill_from_frame()) {
452 _frame = _frame.sender(&_reg_map);
453 }
454 }
455
456
457 // Step back n frames, skip any pseudo frames in between.
458 // This function is used in Class.forName, Class.newInstance, Method.Invoke,
459 // AccessController.doPrivileged.
460 void vframeStreamCommon::security_get_caller_frame(int depth) {
461 assert(depth >= 0, err_msg("invalid depth: %d", depth));
462 for (int n = 0; !at_end(); security_next()) {
463 if (!method()->is_ignored_by_security_stack_walk()) {
464 if (n == depth) {
465 // We have reached the desired depth; return.
466 return;
467 }
468 n++; // this is a non-skipped frame; count it against the depth
469 }
470 }
471 // NOTE: At this point there were not enough frames on the stack
472 // to walk to depth. Callers of this method have to check for at_end.
473 }
474
475
476 void vframeStreamCommon::security_next() {
477 if (method()->is_prefixed_native()) {
478 skip_prefixed_method_and_wrappers(); // calls next()
479 } else {
480 next();
481 }
482 }
483
484
485 void vframeStreamCommon::skip_prefixed_method_and_wrappers() {
486 ResourceMark rm;
487 HandleMark hm;
488
489 int method_prefix_count = 0;
490 char** method_prefixes = JvmtiExport::get_all_native_method_prefixes(&method_prefix_count);
491 KlassHandle prefixed_klass(method()->method_holder());
492 const char* prefixed_name = method()->name()->as_C_string();
493 size_t prefixed_name_len = strlen(prefixed_name);
494 int prefix_index = method_prefix_count-1;
495
496 while (!at_end()) {
497 next();
498 if (method()->method_holder() != prefixed_klass()) {
499 break; // classes don't match, can't be a wrapper
500 }
501 const char* name = method()->name()->as_C_string();
502 size_t name_len = strlen(name);
503 size_t prefix_len = prefixed_name_len - name_len;
504 if (prefix_len <= 0 || strcmp(name, prefixed_name + prefix_len) != 0) {
505 break; // prefixed name isn't prefixed version of method name, can't be a wrapper
506 }
507 for (; prefix_index >= 0; --prefix_index) {
508 const char* possible_prefix = method_prefixes[prefix_index];
509 size_t possible_prefix_len = strlen(possible_prefix);
510 if (possible_prefix_len == prefix_len &&
511 strncmp(possible_prefix, prefixed_name, prefix_len) == 0) {
512 break; // matching prefix found
513 }
514 }
515 if (prefix_index < 0) {
516 break; // didn't find the prefix, can't be a wrapper
517 }
518 prefixed_name = name;
519 prefixed_name_len = name_len;
520 }
521 }
522
523
524 void vframeStreamCommon::skip_reflection_related_frames() {
525 while (!at_end() &&
526 (method()->method_holder()->is_subclass_of(SystemDictionary::reflect_MethodAccessorImpl_klass()) ||
527 method()->method_holder()->is_subclass_of(SystemDictionary::reflect_ConstructorAccessorImpl_klass()))) {
528 next();
529 }
530 }
531
532
533 #ifndef PRODUCT
534 void vframe::print() {
535 if (WizardMode) _fr.print_value_on(tty,NULL);
536 }
537
538
539 void vframe::print_value() const {
540 ((vframe*)this)->print();
541 }
542
543
544 void entryVFrame::print_value() const {
545 ((entryVFrame*)this)->print();
546 }
547
548 void entryVFrame::print() {
549 vframe::print();
550 tty->print_cr("C Chunk inbetween Java");
551 tty->print_cr("C link " INTPTR_FORMAT, _fr.link());
552 }
553
554
555 // ------------- javaVFrame --------------
556
557 static void print_stack_values(const char* title, StackValueCollection* values) {
558 if (values->is_empty()) return;
559 tty->print_cr("\t%s:", title);
560 values->print();
561 }
562
563
564 void javaVFrame::print() {
565 ResourceMark rm;
566 vframe::print();
567 tty->print("\t");
568 method()->print_value();
569 tty->cr();
570 tty->print_cr("\tbci: %d", bci());
571
572 print_stack_values("locals", locals());
573 print_stack_values("expressions", expressions());
574
575 GrowableArray<MonitorInfo*>* list = monitors();
576 if (list->is_empty()) return;
577 tty->print_cr("\tmonitor list:");
578 for (int index = (list->length()-1); index >= 0; index--) {
579 MonitorInfo* monitor = list->at(index);
580 tty->print("\t obj\t");
581 if (monitor->owner_is_scalar_replaced()) {
582 Klass* k = java_lang_Class::as_Klass(monitor->owner_klass());
583 tty->print("( is scalar replaced %s)", k->external_name());
584 } else if (monitor->owner() == NULL) {
585 tty->print("( null )");
586 } else {
587 monitor->owner()->print_value();
588 tty->print("(owner=" INTPTR_FORMAT ")", (address)monitor->owner());
589 }
590 if (monitor->eliminated())
591 if(is_compiled_frame())
592 tty->print(" ( lock is eliminated in compiled frame )");
593 else
594 tty->print(" ( lock is eliminated, frame not compiled )");
595 tty->cr();
596 tty->print("\t ");
597 monitor->lock()->print_on(tty);
598 tty->cr();
599 }
600 }
601
602
603 void javaVFrame::print_value() const {
604 Method* m = method();
605 InstanceKlass* k = m->method_holder();
606 tty->print_cr("frame( sp=" INTPTR_FORMAT ", unextended_sp=" INTPTR_FORMAT ", fp=" INTPTR_FORMAT ", pc=" INTPTR_FORMAT ")",
607 _fr.sp(), _fr.unextended_sp(), _fr.fp(), _fr.pc());
608 tty->print("%s.%s", k->internal_name(), m->name()->as_C_string());
609
610 if (!m->is_native()) {
611 Symbol* source_name = k->source_file_name();
612 int line_number = m->line_number_from_bci(bci());
613 if (source_name != NULL && (line_number != -1)) {
614 tty->print("(%s:%d)", source_name->as_C_string(), line_number);
615 }
616 } else {
617 tty->print("(Native Method)");
618 }
619 // Check frame size and print warning if it looks suspiciously large
620 if (fr().sp() != NULL) {
621 RegisterMap map = *register_map();
622 uint size = fr().frame_size(&map);
623 #ifdef _LP64
624 if (size > 8*K) warning("SUSPICIOUSLY LARGE FRAME (%d)", size);
625 #else
626 if (size > 4*K) warning("SUSPICIOUSLY LARGE FRAME (%d)", size);
627 #endif
628 }
629 }
630
631
632 bool javaVFrame::structural_compare(javaVFrame* other) {
633 // Check static part
634 if (method() != other->method()) return false;
635 if (bci() != other->bci()) return false;
636
637 // Check locals
638 StackValueCollection *locs = locals();
639 StackValueCollection *other_locs = other->locals();
640 assert(locs->size() == other_locs->size(), "sanity check");
641 int i;
642 for(i = 0; i < locs->size(); i++) {
643 // it might happen the compiler reports a conflict and
644 // the interpreter reports a bogus int.
645 if ( is_compiled_frame() && locs->at(i)->type() == T_CONFLICT) continue;
646 if (other->is_compiled_frame() && other_locs->at(i)->type() == T_CONFLICT) continue;
647
648 if (!locs->at(i)->equal(other_locs->at(i)))
649 return false;
650 }
651
652 // Check expressions
653 StackValueCollection* exprs = expressions();
654 StackValueCollection* other_exprs = other->expressions();
655 assert(exprs->size() == other_exprs->size(), "sanity check");
656 for(i = 0; i < exprs->size(); i++) {
657 if (!exprs->at(i)->equal(other_exprs->at(i)))
658 return false;
659 }
660
661 return true;
662 }
663
664
665 void javaVFrame::print_activation(int index) const {
666 // frame number and method
667 tty->print("%2d - ", index);
668 ((vframe*)this)->print_value();
669 tty->cr();
670
671 if (WizardMode) {
672 ((vframe*)this)->print();
673 tty->cr();
674 }
675 }
676
677
678 void javaVFrame::verify() const {
679 }
680
681
682 void interpretedVFrame::verify() const {
683 }
684
685
686 // ------------- externalVFrame --------------
687
688 void externalVFrame::print() {
689 _fr.print_value_on(tty,NULL);
690 }
691
692
693 void externalVFrame::print_value() const {
694 ((vframe*)this)->print();
695 }
696 #endif // PRODUCT