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