Thu, 07 Sep 2017 09:17:43 -0400
8072428: Enable UseLoopCounter ergonomically if on-stack-replacement is enabled
Summary: Set UseLoopCounter ergonomically if on-stack-replacement is enabled. Print warning.
Reviewed-by: kvn
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 */
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"
49 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
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 }
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 }
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 }
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 }
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 }
85 // External frame
86 return new externalVFrame(f, reg_map, thread);
87 }
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 }
98 vframe* vframe::top() const {
99 vframe* vf = (vframe*) this;
100 while (!vf->is_top()) vf = vf->sender();
101 return vf;
102 }
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 }
114 // ------------- javaVFrame --------------
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");
120 GrowableArray<MonitorInfo*>* mons = monitors();
121 GrowableArray<MonitorInfo*>* result = new GrowableArray<MonitorInfo*>(mons->length());
122 if (mons->is_empty()) return result;
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);
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 }
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 st->print_cr("(a java.lang.Class for %s)", java_lang_Class::as_external_name(obj()));
152 } else {
153 Klass* k = obj->klass();
154 st->print_cr("(a %s)", k->external_name());
155 }
156 }
157 }
159 void javaVFrame::print_lock_info_on(outputStream* st, int frame_count) {
160 ResourceMark rm;
162 // If this is the first frame, and java.lang.Object.wait(...) then print out the receiver.
163 if (frame_count == 0) {
164 if (method()->name() == vmSymbols::wait_name() &&
165 method()->method_holder()->name() == vmSymbols::java_lang_Object()) {
166 StackValueCollection* locs = locals();
167 if (!locs->is_empty()) {
168 StackValue* sv = locs->at(0);
169 if (sv->type() == T_OBJECT) {
170 Handle o = locs->at(0)->get_obj();
171 print_locked_object_class_name(st, o, "waiting on");
172 }
173 }
174 } else if (thread()->current_park_blocker() != NULL) {
175 oop obj = thread()->current_park_blocker();
176 Klass* k = obj->klass();
177 st->print_cr("\t- %s <" INTPTR_FORMAT "> (a %s)", "parking to wait for ", (address)obj, k->external_name());
178 }
179 }
182 // Print out all monitors that we have locked or are trying to lock
183 GrowableArray<MonitorInfo*>* mons = monitors();
184 if (!mons->is_empty()) {
185 bool found_first_monitor = false;
186 for (int index = (mons->length()-1); index >= 0; index--) {
187 MonitorInfo* monitor = mons->at(index);
188 if (monitor->eliminated() && is_compiled_frame()) { // Eliminated in compiled code
189 if (monitor->owner_is_scalar_replaced()) {
190 Klass* k = java_lang_Class::as_Klass(monitor->owner_klass());
191 // format below for lockbits matches this one.
192 st->print("\t- eliminated <owner is scalar replaced> (a %s)", k->external_name());
193 } else {
194 oop obj = monitor->owner();
195 if (obj != NULL) {
196 print_locked_object_class_name(st, obj, "eliminated");
197 }
198 }
199 continue;
200 }
201 if (monitor->owner() != NULL) {
202 // the monitor is associated with an object, i.e., it is locked
204 // First, assume we have the monitor locked. If we haven't found an
205 // owned monitor before and this is the first frame, then we need to
206 // see if we have completed the lock or we are blocked trying to
207 // acquire it - we can only be blocked if the monitor is inflated
209 markOop mark = NULL;
210 const char *lock_state = "locked"; // assume we have the monitor locked
211 if (!found_first_monitor && frame_count == 0) {
212 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 } else {
221 mark = NULL; // Disable printing below
222 }
223 }
224 print_locked_object_class_name(st, monitor->owner(), lock_state);
225 if (Verbose && mark != NULL) {
226 // match with format above, replacing "-" with " ".
227 st->print("\t lockbits=");
228 mark->print_on(st);
229 st->cr();
230 }
232 found_first_monitor = true;
233 }
234 }
235 }
236 }
238 // ------------- interpretedVFrame --------------
240 u_char* interpretedVFrame::bcp() const {
241 return fr().interpreter_frame_bcp();
242 }
244 void interpretedVFrame::set_bcp(u_char* bcp) {
245 fr().interpreter_frame_set_bcp(bcp);
246 }
248 intptr_t* interpretedVFrame::locals_addr_at(int offset) const {
249 assert(fr().is_interpreted_frame(), "frame should be an interpreted frame");
250 return fr().interpreter_frame_local_at(offset);
251 }
254 GrowableArray<MonitorInfo*>* interpretedVFrame::monitors() const {
255 GrowableArray<MonitorInfo*>* result = new GrowableArray<MonitorInfo*>(5);
256 for (BasicObjectLock* current = (fr().previous_monitor_in_interpreter_frame(fr().interpreter_frame_monitor_begin()));
257 current >= fr().interpreter_frame_monitor_end();
258 current = fr().previous_monitor_in_interpreter_frame(current)) {
259 result->push(new MonitorInfo(current->obj(), current->lock(), false, false));
260 }
261 return result;
262 }
264 int interpretedVFrame::bci() const {
265 return method()->bci_from(bcp());
266 }
268 Method* interpretedVFrame::method() const {
269 return fr().interpreter_frame_method();
270 }
272 static StackValue* create_stack_value_from_oop_map(const InterpreterOopMap& oop_mask,
273 int index,
274 const intptr_t* const addr) {
276 assert(index >= 0 &&
277 index < oop_mask.number_of_entries(), "invariant");
279 // categorize using oop_mask
280 if (oop_mask.is_oop(index)) {
281 // reference (oop) "r"
282 Handle h(addr != NULL ? (*(oop*)addr) : (oop)NULL);
283 return new StackValue(h);
284 }
285 // value (integer) "v"
286 return new StackValue(addr != NULL ? *addr : 0);
287 }
289 static bool is_in_expression_stack(const frame& fr, const intptr_t* const addr) {
290 assert(addr != NULL, "invariant");
292 // Ensure to be 'inside' the expresion stack (i.e., addr >= sp for Intel).
293 // In case of exceptions, the expression stack is invalid and the sp
294 // will be reset to express this condition.
295 if (frame::interpreter_frame_expression_stack_direction() > 0) {
296 return addr <= fr.interpreter_frame_tos_address();
297 }
299 return addr >= fr.interpreter_frame_tos_address();
300 }
302 static void stack_locals(StackValueCollection* result,
303 int length,
304 const InterpreterOopMap& oop_mask,
305 const frame& fr) {
307 assert(result != NULL, "invariant");
309 for (int i = 0; i < length; ++i) {
310 const intptr_t* const addr = fr.interpreter_frame_local_at(i);
311 assert(addr != NULL, "invariant");
312 assert(addr >= fr.sp(), "must be inside the frame");
314 StackValue* const sv = create_stack_value_from_oop_map(oop_mask, i, addr);
315 assert(sv != NULL, "sanity check");
317 result->add(sv);
318 }
319 }
321 static void stack_expressions(StackValueCollection* result,
322 int length,
323 int max_locals,
324 const InterpreterOopMap& oop_mask,
325 const frame& fr) {
327 assert(result != NULL, "invariant");
329 for (int i = 0; i < length; ++i) {
330 const intptr_t* addr = fr.interpreter_frame_expression_stack_at(i);
331 assert(addr != NULL, "invariant");
332 if (!is_in_expression_stack(fr, addr)) {
333 // Need to ensure no bogus escapes.
334 addr = NULL;
335 }
337 StackValue* const sv = create_stack_value_from_oop_map(oop_mask,
338 i + max_locals,
339 addr);
340 assert(sv != NULL, "sanity check");
342 result->add(sv);
343 }
344 }
346 StackValueCollection* interpretedVFrame::locals() const {
347 return stack_data(false);
348 }
350 StackValueCollection* interpretedVFrame::expressions() const {
351 return stack_data(true);
352 }
354 /*
355 * Worker routine for fetching references and/or values
356 * for a particular bci in the interpretedVFrame.
357 *
358 * Returns data for either "locals" or "expressions",
359 * using bci relative oop_map (oop_mask) information.
360 *
361 * @param expressions bool switch controlling what data to return
362 (false == locals / true == expressions)
363 *
364 */
365 StackValueCollection* interpretedVFrame::stack_data(bool expressions) const {
367 InterpreterOopMap oop_mask;
368 // oopmap for current bci
369 if (TraceDeoptimization && Verbose) {
370 methodHandle m_h(Thread::current(), method());
371 OopMapCache::compute_one_oop_map(m_h, bci(), &oop_mask);
372 } else {
373 method()->mask_for(bci(), &oop_mask);
374 }
376 const int mask_len = oop_mask.number_of_entries();
378 // If the method is native, method()->max_locals() is not telling the truth.
379 // For our purposes, max locals instead equals the size of parameters.
380 const int max_locals = method()->is_native() ?
381 method()->size_of_parameters() : method()->max_locals();
383 assert(mask_len >= max_locals, "invariant");
385 const int length = expressions ? mask_len - max_locals : max_locals;
386 assert(length >= 0, "invariant");
388 StackValueCollection* const result = new StackValueCollection(length);
390 if (0 == length) {
391 return result;
392 }
394 if (expressions) {
395 stack_expressions(result, length, max_locals, oop_mask, fr());
396 } else {
397 stack_locals(result, length, oop_mask, fr());
398 }
400 assert(length == result->size(), "invariant");
402 return result;
403 }
405 void interpretedVFrame::set_locals(StackValueCollection* values) const {
406 if (values == NULL || values->size() == 0) return;
408 // If the method is native, max_locals is not telling the truth.
409 // maxlocals then equals the size of parameters
410 const int max_locals = method()->is_native() ?
411 method()->size_of_parameters() : method()->max_locals();
413 assert(max_locals == values->size(), "Mismatch between actual stack format and supplied data");
415 // handle locals
416 for (int i = 0; i < max_locals; i++) {
417 // Find stack location
418 intptr_t *addr = locals_addr_at(i);
420 // Depending on oop/int put it in the right package
421 const StackValue* const sv = values->at(i);
422 assert(sv != NULL, "sanity check");
423 if (sv->type() == T_OBJECT) {
424 *(oop *) addr = (sv->get_obj())();
425 } else { // integer
426 *addr = sv->get_int();
427 }
428 }
429 }
431 // ------------- cChunk --------------
433 entryVFrame::entryVFrame(const frame* fr, const RegisterMap* reg_map, JavaThread* thread)
434 : externalVFrame(fr, reg_map, thread) {}
437 void vframeStreamCommon::found_bad_method_frame() {
438 // 6379830 Cut point for an assertion that occasionally fires when
439 // we are using the performance analyzer.
440 // Disable this assert when testing the analyzer with fastdebug.
441 // -XX:SuppressErrorAt=vframe.cpp:XXX (XXX=following line number)
442 assert(false, "invalid bci or invalid scope desc");
443 }
445 // top-frame will be skipped
446 vframeStream::vframeStream(JavaThread* thread, frame top_frame,
447 bool stop_at_java_call_stub) : vframeStreamCommon(thread) {
448 _stop_at_java_call_stub = stop_at_java_call_stub;
450 // skip top frame, as it may not be at safepoint
451 _frame = top_frame.sender(&_reg_map);
452 while (!fill_from_frame()) {
453 _frame = _frame.sender(&_reg_map);
454 }
455 }
458 // Step back n frames, skip any pseudo frames in between.
459 // This function is used in Class.forName, Class.newInstance, Method.Invoke,
460 // AccessController.doPrivileged.
461 void vframeStreamCommon::security_get_caller_frame(int depth) {
462 assert(depth >= 0, err_msg("invalid depth: %d", depth));
463 for (int n = 0; !at_end(); security_next()) {
464 if (!method()->is_ignored_by_security_stack_walk()) {
465 if (n == depth) {
466 // We have reached the desired depth; return.
467 return;
468 }
469 n++; // this is a non-skipped frame; count it against the depth
470 }
471 }
472 // NOTE: At this point there were not enough frames on the stack
473 // to walk to depth. Callers of this method have to check for at_end.
474 }
477 void vframeStreamCommon::security_next() {
478 if (method()->is_prefixed_native()) {
479 skip_prefixed_method_and_wrappers(); // calls next()
480 } else {
481 next();
482 }
483 }
486 void vframeStreamCommon::skip_prefixed_method_and_wrappers() {
487 ResourceMark rm;
488 HandleMark hm;
490 int method_prefix_count = 0;
491 char** method_prefixes = JvmtiExport::get_all_native_method_prefixes(&method_prefix_count);
492 KlassHandle prefixed_klass(method()->method_holder());
493 const char* prefixed_name = method()->name()->as_C_string();
494 size_t prefixed_name_len = strlen(prefixed_name);
495 int prefix_index = method_prefix_count-1;
497 while (!at_end()) {
498 next();
499 if (method()->method_holder() != prefixed_klass()) {
500 break; // classes don't match, can't be a wrapper
501 }
502 const char* name = method()->name()->as_C_string();
503 size_t name_len = strlen(name);
504 size_t prefix_len = prefixed_name_len - name_len;
505 if (prefix_len <= 0 || strcmp(name, prefixed_name + prefix_len) != 0) {
506 break; // prefixed name isn't prefixed version of method name, can't be a wrapper
507 }
508 for (; prefix_index >= 0; --prefix_index) {
509 const char* possible_prefix = method_prefixes[prefix_index];
510 size_t possible_prefix_len = strlen(possible_prefix);
511 if (possible_prefix_len == prefix_len &&
512 strncmp(possible_prefix, prefixed_name, prefix_len) == 0) {
513 break; // matching prefix found
514 }
515 }
516 if (prefix_index < 0) {
517 break; // didn't find the prefix, can't be a wrapper
518 }
519 prefixed_name = name;
520 prefixed_name_len = name_len;
521 }
522 }
525 void vframeStreamCommon::skip_reflection_related_frames() {
526 while (!at_end() &&
527 (JDK_Version::is_gte_jdk14x_version() && UseNewReflection &&
528 (method()->method_holder()->is_subclass_of(SystemDictionary::reflect_MethodAccessorImpl_klass()) ||
529 method()->method_holder()->is_subclass_of(SystemDictionary::reflect_ConstructorAccessorImpl_klass())))) {
530 next();
531 }
532 }
535 #ifndef PRODUCT
536 void vframe::print() {
537 if (WizardMode) _fr.print_value_on(tty,NULL);
538 }
541 void vframe::print_value() const {
542 ((vframe*)this)->print();
543 }
546 void entryVFrame::print_value() const {
547 ((entryVFrame*)this)->print();
548 }
550 void entryVFrame::print() {
551 vframe::print();
552 tty->print_cr("C Chunk inbetween Java");
553 tty->print_cr("C link " INTPTR_FORMAT, _fr.link());
554 }
557 // ------------- javaVFrame --------------
559 static void print_stack_values(const char* title, StackValueCollection* values) {
560 if (values->is_empty()) return;
561 tty->print_cr("\t%s:", title);
562 values->print();
563 }
566 void javaVFrame::print() {
567 ResourceMark rm;
568 vframe::print();
569 tty->print("\t");
570 method()->print_value();
571 tty->cr();
572 tty->print_cr("\tbci: %d", bci());
574 print_stack_values("locals", locals());
575 print_stack_values("expressions", expressions());
577 GrowableArray<MonitorInfo*>* list = monitors();
578 if (list->is_empty()) return;
579 tty->print_cr("\tmonitor list:");
580 for (int index = (list->length()-1); index >= 0; index--) {
581 MonitorInfo* monitor = list->at(index);
582 tty->print("\t obj\t");
583 if (monitor->owner_is_scalar_replaced()) {
584 Klass* k = java_lang_Class::as_Klass(monitor->owner_klass());
585 tty->print("( is scalar replaced %s)", k->external_name());
586 } else if (monitor->owner() == NULL) {
587 tty->print("( null )");
588 } else {
589 monitor->owner()->print_value();
590 tty->print("(owner=" INTPTR_FORMAT ")", (address)monitor->owner());
591 }
592 if (monitor->eliminated()) {
593 if(is_compiled_frame()) {
594 tty->print(" ( lock is eliminated in compiled frame )");
595 } else {
596 tty->print(" ( lock is eliminated, frame not compiled )");
597 }
598 }
599 tty->cr();
600 tty->print("\t ");
601 monitor->lock()->print_on(tty);
602 tty->cr();
603 }
604 }
607 void javaVFrame::print_value() const {
608 Method* m = method();
609 InstanceKlass* k = m->method_holder();
610 tty->print_cr("frame( sp=" INTPTR_FORMAT ", unextended_sp=" INTPTR_FORMAT ", fp=" INTPTR_FORMAT ", pc=" INTPTR_FORMAT ")",
611 _fr.sp(), _fr.unextended_sp(), _fr.fp(), _fr.pc());
612 tty->print("%s.%s", k->internal_name(), m->name()->as_C_string());
614 if (!m->is_native()) {
615 Symbol* source_name = k->source_file_name();
616 int line_number = m->line_number_from_bci(bci());
617 if (source_name != NULL && (line_number != -1)) {
618 tty->print("(%s:%d)", source_name->as_C_string(), line_number);
619 }
620 } else {
621 tty->print("(Native Method)");
622 }
623 // Check frame size and print warning if it looks suspiciously large
624 if (fr().sp() != NULL) {
625 RegisterMap map = *register_map();
626 uint size = fr().frame_size(&map);
627 #ifdef _LP64
628 if (size > 8*K) warning("SUSPICIOUSLY LARGE FRAME (%d)", size);
629 #else
630 if (size > 4*K) warning("SUSPICIOUSLY LARGE FRAME (%d)", size);
631 #endif
632 }
633 }
636 bool javaVFrame::structural_compare(javaVFrame* other) {
637 // Check static part
638 if (method() != other->method()) return false;
639 if (bci() != other->bci()) return false;
641 // Check locals
642 StackValueCollection *locs = locals();
643 StackValueCollection *other_locs = other->locals();
644 assert(locs->size() == other_locs->size(), "sanity check");
645 int i;
646 for(i = 0; i < locs->size(); i++) {
647 // it might happen the compiler reports a conflict and
648 // the interpreter reports a bogus int.
649 if ( is_compiled_frame() && locs->at(i)->type() == T_CONFLICT) continue;
650 if (other->is_compiled_frame() && other_locs->at(i)->type() == T_CONFLICT) continue;
652 if (!locs->at(i)->equal(other_locs->at(i)))
653 return false;
654 }
656 // Check expressions
657 StackValueCollection* exprs = expressions();
658 StackValueCollection* other_exprs = other->expressions();
659 assert(exprs->size() == other_exprs->size(), "sanity check");
660 for(i = 0; i < exprs->size(); i++) {
661 if (!exprs->at(i)->equal(other_exprs->at(i)))
662 return false;
663 }
665 return true;
666 }
669 void javaVFrame::print_activation(int index) const {
670 // frame number and method
671 tty->print("%2d - ", index);
672 ((vframe*)this)->print_value();
673 tty->cr();
675 if (WizardMode) {
676 ((vframe*)this)->print();
677 tty->cr();
678 }
679 }
682 void javaVFrame::verify() const {
683 }
686 void interpretedVFrame::verify() const {
687 }
690 // ------------- externalVFrame --------------
692 void externalVFrame::print() {
693 _fr.print_value_on(tty,NULL);
694 }
697 void externalVFrame::print_value() const {
698 ((vframe*)this)->print();
699 }
700 #endif // PRODUCT