1 /*
2 * Copyright (c) 1997, 2025, 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 "classfile/moduleEntry.hpp"
26 #include "code/codeCache.hpp"
27 #include "code/scopeDesc.hpp"
28 #include "code/vmreg.inline.hpp"
29 #include "compiler/abstractCompiler.hpp"
30 #include "compiler/disassembler.hpp"
31 #include "compiler/oopMap.hpp"
32 #include "gc/shared/collectedHeap.inline.hpp"
33 #include "interpreter/interpreter.hpp"
34 #include "interpreter/oopMapCache.hpp"
35 #include "logging/log.hpp"
36 #include "memory/resourceArea.hpp"
37 #include "memory/universe.hpp"
38 #include "oops/markWord.hpp"
39 #include "oops/method.inline.hpp"
40 #include "oops/methodData.hpp"
41 #include "oops/oop.inline.hpp"
42 #include "oops/inlineKlass.hpp"
43 #include "oops/stackChunkOop.inline.hpp"
44 #include "oops/verifyOopClosure.hpp"
45 #include "prims/methodHandles.hpp"
46 #include "runtime/continuation.hpp"
47 #include "runtime/continuationEntry.inline.hpp"
48 #include "runtime/frame.inline.hpp"
49 #include "runtime/handles.inline.hpp"
50 #include "runtime/javaCalls.hpp"
51 #include "runtime/javaThread.hpp"
52 #include "runtime/monitorChunk.hpp"
53 #include "runtime/os.hpp"
54 #include "runtime/sharedRuntime.hpp"
55 #include "runtime/safefetch.hpp"
56 #include "runtime/signature.hpp"
57 #include "runtime/stackValue.hpp"
58 #include "runtime/stubCodeGenerator.hpp"
59 #include "runtime/stubRoutines.hpp"
60 #include "utilities/debug.hpp"
61 #include "utilities/decoder.hpp"
62 #include "utilities/formatBuffer.hpp"
63 #ifdef COMPILER1
64 #include "c1/c1_Runtime1.hpp"
65 #endif
66
67 RegisterMap::RegisterMap(JavaThread *thread, UpdateMap update_map, ProcessFrames process_frames, WalkContinuation walk_cont) {
68 _thread = thread;
69 _update_map = update_map == UpdateMap::include;
70 _process_frames = process_frames == ProcessFrames::include;
71 _walk_cont = walk_cont == WalkContinuation::include;
72 clear();
73 DEBUG_ONLY (_update_for_id = nullptr;)
74 NOT_PRODUCT(_skip_missing = false;)
75 NOT_PRODUCT(_async = false;)
76
77 if (walk_cont == WalkContinuation::include && thread != nullptr && thread->last_continuation() != nullptr) {
78 _chunk = stackChunkHandle(Thread::current()->handle_area()->allocate_null_handle(), true /* dummy */);
79 }
80 _chunk_index = -1;
81
82 #ifndef PRODUCT
83 for (int i = 0; i < reg_count ; i++ ) _location[i] = nullptr;
84 #endif /* PRODUCT */
85 }
86
87 RegisterMap::RegisterMap(oop continuation, UpdateMap update_map) {
88 _thread = nullptr;
89 _update_map = update_map == UpdateMap::include;
90 _process_frames = false;
91 _walk_cont = true;
92 clear();
93 DEBUG_ONLY (_update_for_id = nullptr;)
94 NOT_PRODUCT(_skip_missing = false;)
95 NOT_PRODUCT(_async = false;)
96
97 _chunk = stackChunkHandle(Thread::current()->handle_area()->allocate_null_handle(), true /* dummy */);
98 _chunk_index = -1;
99
100 #ifndef PRODUCT
101 for (int i = 0; i < reg_count ; i++ ) _location[i] = nullptr;
102 #endif /* PRODUCT */
103 }
104
105 RegisterMap::RegisterMap(const RegisterMap* map) {
106 assert(map != this, "bad initialization parameter");
107 assert(map != nullptr, "RegisterMap must be present");
108 _thread = map->thread();
109 _update_map = map->update_map();
110 _process_frames = map->process_frames();
111 _walk_cont = map->_walk_cont;
112 _include_argument_oops = map->include_argument_oops();
113 DEBUG_ONLY (_update_for_id = map->_update_for_id;)
114 NOT_PRODUCT(_skip_missing = map->_skip_missing;)
115 NOT_PRODUCT(_async = map->_async;)
116
117 // only the original RegisterMap's handle lives long enough for StackWalker; this is bound to cause trouble with nested continuations.
118 _chunk = map->_chunk;
119 _chunk_index = map->_chunk_index;
120
121 pd_initialize_from(map);
122 if (update_map()) {
123 for(int i = 0; i < location_valid_size; i++) {
124 LocationValidType bits = map->_location_valid[i];
125 _location_valid[i] = bits;
126 // for whichever bits are set, pull in the corresponding map->_location
127 int j = i*location_valid_type_size;
128 while (bits != 0) {
129 if ((bits & 1) != 0) {
130 assert(0 <= j && j < reg_count, "range check");
131 _location[j] = map->_location[j];
132 }
133 bits >>= 1;
134 j += 1;
135 }
136 }
137 }
138 }
139
140 oop RegisterMap::cont() const {
141 return _chunk() != nullptr ? _chunk()->cont() : (oop)nullptr;
142 }
143
144 void RegisterMap::set_stack_chunk(stackChunkOop chunk) {
145 assert(chunk == nullptr || _walk_cont, "");
146 assert(chunk == nullptr || _chunk.not_null(), "");
147 if (_chunk.is_null()) return;
148 log_trace(continuations)("set_stack_chunk: " INTPTR_FORMAT " this: " INTPTR_FORMAT, p2i((oopDesc*)chunk), p2i(this));
149 _chunk.replace(chunk); // reuse handle. see comment above in the constructor
150 if (chunk == nullptr) {
151 _chunk_index = -1;
152 } else {
153 _chunk_index++;
154 }
155 }
156
157 void RegisterMap::clear() {
158 set_include_argument_oops(true);
159 if (update_map()) {
160 for(int i = 0; i < location_valid_size; i++) {
161 _location_valid[i] = 0;
162 }
163 pd_clear();
164 } else {
165 pd_initialize();
166 }
167 }
168
169 #ifndef PRODUCT
170
171 VMReg RegisterMap::find_register_spilled_here(void* p, intptr_t* sp) {
172 for(int i = 0; i < RegisterMap::reg_count; i++) {
173 VMReg r = VMRegImpl::as_VMReg(i);
174 if (p == location(r, sp)) return r;
175 }
176 return nullptr;
177 }
178
179 void RegisterMap::print_on(outputStream* st) const {
180 st->print_cr("Register map");
181 for(int i = 0; i < reg_count; i++) {
182
183 VMReg r = VMRegImpl::as_VMReg(i);
184 intptr_t* src = (intptr_t*) location(r, nullptr);
185 if (src != nullptr) {
186
187 r->print_on(st);
188 st->print(" [" INTPTR_FORMAT "] = ", p2i(src));
189 if (((uintptr_t)src & (sizeof(*src)-1)) != 0) {
190 st->print_cr("<misaligned>");
191 } else {
192 st->print_cr(INTPTR_FORMAT, *src);
193 }
194 }
195 }
196 }
197
198 void RegisterMap::print() const {
199 print_on(tty);
200 }
201
202 #endif
203 // This returns the pc that if you were in the debugger you'd see. Not
204 // the idealized value in the frame object. This undoes the magic conversion
205 // that happens for deoptimized frames. In addition it makes the value the
206 // hardware would want to see in the native frame. The only user (at this point)
207 // is deoptimization. It likely no one else should ever use it.
208
209 address frame::raw_pc() const {
210 if (is_deoptimized_frame()) {
211 nmethod* nm = cb()->as_nmethod_or_null();
212 assert(nm != nullptr, "only nmethod is expected here");
213 if (nm->is_method_handle_return(pc()))
214 return nm->deopt_mh_handler_begin() - pc_return_offset;
215 else
216 return nm->deopt_handler_begin() - pc_return_offset;
217 } else {
218 return (pc() - pc_return_offset);
219 }
220 }
221
222 // Change the pc in a frame object. This does not change the actual pc in
223 // actual frame. To do that use patch_pc.
224 //
225 void frame::set_pc(address newpc) {
226 #ifdef ASSERT
227 if (_cb != nullptr && _cb->is_nmethod()) {
228 assert(!((nmethod*)_cb)->is_deopt_pc(_pc), "invariant violation");
229 }
230 #endif // ASSERT
231
232 // Unsafe to use the is_deoptimized tester after changing pc
233 _deopt_state = unknown;
234 _pc = newpc;
235 _cb = CodeCache::find_blob(_pc);
236
237 }
238
239 // type testers
240 bool frame::is_ignored_frame() const {
241 return false; // FIXME: some LambdaForm frames should be ignored
242 }
243
244 bool frame::is_native_frame() const {
245 return (_cb != nullptr &&
246 _cb->is_nmethod() &&
247 ((nmethod*)_cb)->is_native_method());
248 }
249
250 bool frame::is_java_frame() const {
251 if (is_interpreted_frame()) return true;
252 if (is_compiled_frame()) return true;
253 return false;
254 }
255
256 bool frame::is_runtime_frame() const {
257 return (_cb != nullptr && _cb->is_runtime_stub());
258 }
259
260 bool frame::is_safepoint_blob_frame() const {
261 return (_cb != nullptr && _cb->is_safepoint_stub());
262 }
263
264 // testers
265
266 bool frame::is_first_java_frame() const {
267 RegisterMap map(JavaThread::current(),
268 RegisterMap::UpdateMap::skip,
269 RegisterMap::ProcessFrames::include,
270 RegisterMap::WalkContinuation::skip); // No update
271 frame s;
272 for (s = sender(&map); !(s.is_java_frame() || s.is_first_frame()); s = s.sender(&map));
273 return s.is_first_frame();
274 }
275
276 bool frame::is_first_vthread_frame(JavaThread* thread) const {
277 return Continuation::is_continuation_enterSpecial(*this)
278 && Continuation::get_continuation_entry_for_entry_frame(thread, *this)->is_virtual_thread();
279 }
280
281 bool frame::entry_frame_is_first() const {
282 return entry_frame_call_wrapper()->is_first_frame();
283 }
284
285 JavaCallWrapper* frame::entry_frame_call_wrapper_if_safe(JavaThread* thread) const {
286 JavaCallWrapper** jcw = entry_frame_call_wrapper_addr();
287 address addr = (address) jcw;
288
289 // addr must be within the usable part of the stack
290 if (thread->is_in_usable_stack(addr)) {
291 return *jcw;
292 }
293
294 return nullptr;
295 }
296
297 bool frame::is_entry_frame_valid(JavaThread* thread) const {
298 // Validate the JavaCallWrapper an entry frame must have
299 address jcw = (address)entry_frame_call_wrapper();
300 if (!thread->is_in_stack_range_excl(jcw, (address)fp())) {
301 return false;
302 }
303
304 // Validate sp saved in the java frame anchor
305 JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor();
306 return (jfa->last_Java_sp() > sp());
307 }
308
309 Method* frame::safe_interpreter_frame_method() const {
310 Method** m_addr = interpreter_frame_method_addr();
311 if (m_addr == nullptr) {
312 return nullptr;
313 }
314 return (Method*) SafeFetchN((intptr_t*) m_addr, 0);
315 }
316
317 bool frame::should_be_deoptimized() const {
318 if (_deopt_state == is_deoptimized ||
319 !is_compiled_frame() ) return false;
320 assert(_cb != nullptr && _cb->is_nmethod(), "must be an nmethod");
321 nmethod* nm = _cb->as_nmethod();
322 LogTarget(Debug, dependencies) lt;
323 if (lt.is_enabled()) {
324 LogStream ls(<);
325 ls.print("checking (%s) ", nm->is_marked_for_deoptimization() ? "true" : "false");
326 nm->print_value_on(&ls);
327 ls.cr();
328 }
329
330 if( !nm->is_marked_for_deoptimization() )
331 return false;
332
333 // If at the return point, then the frame has already been popped, and
334 // only the return needs to be executed. Don't deoptimize here.
335 return !nm->is_at_poll_return(pc());
336 }
337
338 bool frame::can_be_deoptimized() const {
339 if (!is_compiled_frame()) return false;
340 nmethod* nm = _cb->as_nmethod();
341
342 if(!nm->can_be_deoptimized())
343 return false;
344
345 return !nm->is_at_poll_return(pc());
346 }
347
348 void frame::deoptimize(JavaThread* thread) {
349 assert(thread == nullptr
350 || (thread->frame_anchor()->has_last_Java_frame() &&
351 thread->frame_anchor()->walkable()), "must be");
352 // Schedule deoptimization of an nmethod activation with this frame.
353 assert(_cb != nullptr && _cb->is_nmethod(), "must be");
354
355 // If the call site is a MethodHandle call site use the MH deopt handler.
356 nmethod* nm = _cb->as_nmethod();
357 address deopt = nm->is_method_handle_return(pc()) ?
358 nm->deopt_mh_handler_begin() :
359 nm->deopt_handler_begin();
360
361 NativePostCallNop* inst = nativePostCallNop_at(pc());
362
363 // Save the original pc before we patch in the new one
364 nm->set_original_pc(this, pc());
365
366 #ifdef COMPILER1
367 if (nm->is_compiled_by_c1() && nm->method()->has_scalarized_args() &&
368 pc() < nm->verified_inline_entry_point()) {
369 // The VEP and VIEP(RO) of C1-compiled methods call into the runtime to buffer scalarized value
370 // type args. We can't deoptimize at that point because the buffers have not yet been initialized.
371 // Also, if the method is synchronized, we first need to acquire the lock.
372 // Don't patch the return pc to delay deoptimization until we enter the method body (the check
373 // added in LIRGenerator::do_Base will detect the pending deoptimization by checking the original_pc).
374 #if defined ASSERT && !defined AARCH64 // Stub call site does not look like NativeCall on AArch64
375 NativeCall* call = nativeCall_before(this->pc());
376 address dest = call->destination();
377 assert(dest == Runtime1::entry_for(C1StubId::buffer_inline_args_no_receiver_id) ||
378 dest == Runtime1::entry_for(C1StubId::buffer_inline_args_id), "unexpected safepoint in entry point");
379 #endif
380 return;
381 }
382 #endif
383
384 patch_pc(thread, deopt);
385 assert(is_deoptimized_frame(), "must be");
386
387 #ifdef ASSERT
388 if (thread != nullptr) {
389 frame check = thread->last_frame();
390 if (is_older(check.id())) {
391 RegisterMap map(thread,
392 RegisterMap::UpdateMap::skip,
393 RegisterMap::ProcessFrames::include,
394 RegisterMap::WalkContinuation::skip);
395 while (id() != check.id()) {
396 check = check.sender(&map);
397 }
398 assert(check.is_deoptimized_frame(), "missed deopt");
399 }
400 }
401 #endif // ASSERT
402 }
403
404 frame frame::java_sender() const {
405 RegisterMap map(JavaThread::current(),
406 RegisterMap::UpdateMap::skip,
407 RegisterMap::ProcessFrames::include,
408 RegisterMap::WalkContinuation::skip);
409 frame s;
410 for (s = sender(&map); !(s.is_java_frame() || s.is_first_frame()); s = s.sender(&map)) ;
411 guarantee(s.is_java_frame(), "tried to get caller of first java frame");
412 return s;
413 }
414
415 frame frame::real_sender(RegisterMap* map) const {
416 frame result = sender(map);
417 while (result.is_runtime_frame() ||
418 result.is_ignored_frame()) {
419 result = result.sender(map);
420 }
421 return result;
422 }
423
424 // Interpreter frames
425
426
427 Method* frame::interpreter_frame_method() const {
428 assert(is_interpreted_frame(), "interpreted frame expected");
429 Method* m = *interpreter_frame_method_addr();
430 assert(m->is_method(), "not a Method*");
431 return m;
432 }
433
434 void frame::interpreter_frame_set_method(Method* method) {
435 assert(is_interpreted_frame(), "interpreted frame expected");
436 *interpreter_frame_method_addr() = method;
437 }
438
439 void frame::interpreter_frame_set_mirror(oop mirror) {
440 assert(is_interpreted_frame(), "interpreted frame expected");
441 *interpreter_frame_mirror_addr() = mirror;
442 }
443
444 jint frame::interpreter_frame_bci() const {
445 assert(is_interpreted_frame(), "interpreted frame expected");
446 address bcp = interpreter_frame_bcp();
447 return interpreter_frame_method()->bci_from(bcp);
448 }
449
450 address frame::interpreter_frame_bcp() const {
451 assert(is_interpreted_frame(), "interpreted frame expected");
452 address bcp = (address)*interpreter_frame_bcp_addr();
453 return interpreter_frame_method()->bcp_from(bcp);
454 }
455
456 void frame::interpreter_frame_set_bcp(address bcp) {
457 assert(is_interpreted_frame(), "interpreted frame expected");
458 *interpreter_frame_bcp_addr() = (intptr_t)bcp;
459 }
460
461 address frame::interpreter_frame_mdp() const {
462 assert(ProfileInterpreter, "must be profiling interpreter");
463 assert(is_interpreted_frame(), "interpreted frame expected");
464 return (address)*interpreter_frame_mdp_addr();
465 }
466
467 void frame::interpreter_frame_set_mdp(address mdp) {
468 assert(is_interpreted_frame(), "interpreted frame expected");
469 assert(ProfileInterpreter, "must be profiling interpreter");
470 *interpreter_frame_mdp_addr() = (intptr_t)mdp;
471 }
472
473 BasicObjectLock* frame::next_monitor_in_interpreter_frame(BasicObjectLock* current) const {
474 assert(is_interpreted_frame(), "Not an interpreted frame");
475 #ifdef ASSERT
476 interpreter_frame_verify_monitor(current);
477 #endif
478 BasicObjectLock* next = (BasicObjectLock*) (((intptr_t*) current) + interpreter_frame_monitor_size());
479 return next;
480 }
481
482 BasicObjectLock* frame::previous_monitor_in_interpreter_frame(BasicObjectLock* current) const {
483 assert(is_interpreted_frame(), "Not an interpreted frame");
484 #ifdef ASSERT
485 // // This verification needs to be checked before being enabled
486 // interpreter_frame_verify_monitor(current);
487 #endif
488 BasicObjectLock* previous = (BasicObjectLock*) (((intptr_t*) current) - interpreter_frame_monitor_size());
489 return previous;
490 }
491
492 // Interpreter locals and expression stack locations.
493
494 intptr_t* frame::interpreter_frame_local_at(int index) const {
495 const int n = Interpreter::local_offset_in_bytes(index)/wordSize;
496 intptr_t* first = interpreter_frame_locals();
497 return &(first[n]);
498 }
499
500 intptr_t* frame::interpreter_frame_expression_stack_at(jint offset) const {
501 const int i = offset * interpreter_frame_expression_stack_direction();
502 const int n = i * Interpreter::stackElementWords;
503 return &(interpreter_frame_expression_stack()[n]);
504 }
505
506 jint frame::interpreter_frame_expression_stack_size() const {
507 // Number of elements on the interpreter expression stack
508 // Callers should span by stackElementWords
509 int element_size = Interpreter::stackElementWords;
510 size_t stack_size = 0;
511 if (frame::interpreter_frame_expression_stack_direction() < 0) {
512 stack_size = (interpreter_frame_expression_stack() -
513 interpreter_frame_tos_address() + 1)/element_size;
514 } else {
515 stack_size = (interpreter_frame_tos_address() -
516 interpreter_frame_expression_stack() + 1)/element_size;
517 }
518 assert(stack_size <= (size_t)max_jint, "stack size too big");
519 return (jint)stack_size;
520 }
521
522 // (frame::interpreter_frame_sender_sp accessor is in frame_<arch>.cpp)
523
524 const char* frame::print_name() const {
525 if (is_native_frame()) return "Native";
526 if (is_interpreted_frame()) return "Interpreted";
527 if (is_compiled_frame()) {
528 if (is_deoptimized_frame()) return "Deoptimized";
529 return "Compiled";
530 }
531 if (sp() == nullptr) return "Empty";
532 return "C";
533 }
534
535 void frame::print_value_on(outputStream* st) const {
536 NOT_PRODUCT(address begin = pc()-40;)
537 NOT_PRODUCT(address end = nullptr;)
538
539 st->print("%s frame (sp=" INTPTR_FORMAT " unextended sp=" INTPTR_FORMAT, print_name(), p2i(sp()), p2i(unextended_sp()));
540 if (sp() != nullptr)
541 st->print(", fp=" INTPTR_FORMAT ", real_fp=" INTPTR_FORMAT ", pc=" INTPTR_FORMAT,
542 p2i(fp()), p2i(real_fp()), p2i(pc()));
543 st->print_cr(")");
544
545 if (StubRoutines::contains(pc())) {
546 StubCodeDesc* desc = StubCodeDesc::desc_for(pc());
547 st->print("~Stub::%s", desc->name());
548 NOT_PRODUCT(begin = desc->begin(); end = desc->end();)
549 } else if (Interpreter::contains(pc())) {
550 InterpreterCodelet* desc = Interpreter::codelet_containing(pc());
551 if (desc != nullptr) {
552 st->print("~");
553 desc->print_on(st);
554 NOT_PRODUCT(begin = desc->code_begin(); end = desc->code_end();)
555 } else {
556 st->print("~interpreter");
557 }
558 }
559
560 #ifndef PRODUCT
561 if (_cb != nullptr) {
562 st->print(" ");
563 _cb->print_value_on(st);
564 if (end == nullptr) {
565 begin = _cb->code_begin();
566 end = _cb->code_end();
567 }
568 }
569 if (WizardMode && Verbose) Disassembler::decode(begin, end);
570 #endif
571 }
572
573 void frame::print_on(outputStream* st) const {
574 print_value_on(st);
575 if (is_interpreted_frame()) {
576 interpreter_frame_print_on(st);
577 }
578 }
579
580 void frame::interpreter_frame_print_on(outputStream* st) const {
581 #ifndef PRODUCT
582 assert(is_interpreted_frame(), "Not an interpreted frame");
583 jint i;
584 for (i = 0; i < interpreter_frame_method()->max_locals(); i++ ) {
585 intptr_t x = *interpreter_frame_local_at(i);
586 st->print(" - local [" INTPTR_FORMAT "]", x);
587 st->fill_to(23);
588 st->print_cr("; #%d", i);
589 }
590 for (i = interpreter_frame_expression_stack_size() - 1; i >= 0; --i ) {
591 intptr_t x = *interpreter_frame_expression_stack_at(i);
592 st->print(" - stack [" INTPTR_FORMAT "]", x);
593 st->fill_to(23);
594 st->print_cr("; #%d", i);
595 }
596 // locks for synchronization
597 for (BasicObjectLock* current = interpreter_frame_monitor_end();
598 current < interpreter_frame_monitor_begin();
599 current = next_monitor_in_interpreter_frame(current)) {
600 st->print(" - obj [%s", current->obj() == nullptr ? "null" : "");
601 oop obj = current->obj();
602 if (obj != nullptr) {
603 if (!is_heap_frame()) {
604 obj->print_value_on(st);
605 } else {
606 // Might be an invalid oop. We don't have the
607 // stackChunk to correct it so just print address.
608 st->print(INTPTR_FORMAT, p2i(obj));
609 }
610 }
611 st->print_cr("]");
612 st->print(" - lock [");
613 if (!is_heap_frame()) {
614 current->lock()->print_on(st, obj);
615 }
616 st->print_cr("]");
617 }
618 // monitor
619 st->print_cr(" - monitor[" INTPTR_FORMAT "]", p2i(interpreter_frame_monitor_begin()));
620 // bcp
621 st->print(" - bcp [" INTPTR_FORMAT "]", p2i(interpreter_frame_bcp()));
622 st->fill_to(23);
623 st->print_cr("; @%d", interpreter_frame_bci());
624 // locals
625 st->print_cr(" - locals [" INTPTR_FORMAT "]", p2i(interpreter_frame_local_at(0)));
626 // method
627 st->print(" - method [" INTPTR_FORMAT "]", p2i(interpreter_frame_method()));
628 st->fill_to(23);
629 st->print("; ");
630 interpreter_frame_method()->print_name(st);
631 st->cr();
632 #endif
633 }
634
635 // Print whether the frame is in the VM or OS indicating a HotSpot problem.
636 // Otherwise, it's likely a bug in the native library that the Java code calls,
637 // hopefully indicating where to submit bugs.
638 void frame::print_C_frame(outputStream* st, char* buf, int buflen, address pc) {
639 // C/C++ frame
640 bool in_vm = os::address_is_in_vm(pc);
641 st->print(in_vm ? "V" : "C");
642
643 int offset;
644 bool found;
645
646 if (buf == nullptr || buflen < 1) return;
647 // libname
648 buf[0] = '\0';
649 found = os::dll_address_to_library_name(pc, buf, buflen, &offset);
650 if (found && buf[0] != '\0') {
651 // skip directory names
652 const char *p1, *p2;
653 p1 = buf;
654 int len = (int)strlen(os::file_separator());
655 while ((p2 = strstr(p1, os::file_separator())) != nullptr) p1 = p2 + len;
656 st->print(" [%s+0x%x]", p1, offset);
657 } else {
658 st->print(" " PTR_FORMAT, p2i(pc));
659 }
660
661 found = os::dll_address_to_function_name(pc, buf, buflen, &offset);
662 if (found) {
663 st->print(" %s+0x%x", buf, offset);
664 }
665 }
666
667 // frame::print_on_error() is called by fatal error handler. Notice that we may
668 // crash inside this function if stack frame is corrupted. The fatal error
669 // handler can catch and handle the crash. Here we assume the frame is valid.
670 //
671 // First letter indicates type of the frame:
672 // J: Java frame (compiled)
673 // j: Java frame (interpreted)
674 // V: VM frame (C/C++)
675 // v: Other frames running VM generated code (e.g. stubs, adapters, etc.)
676 // C: C/C++ frame
677 //
678 // We don't need detailed frame type as that in frame::print_name(). "C"
679 // suggests the problem is in user lib; everything else is likely a VM bug.
680
681 void frame::print_on_error(outputStream* st, char* buf, int buflen, bool verbose) const {
682 if (_cb != nullptr) {
683 if (Interpreter::contains(pc())) {
684 Method* m = this->interpreter_frame_method();
685 if (m != nullptr) {
686 m->name_and_sig_as_C_string(buf, buflen);
687 st->print("j %s", buf);
688 st->print("+%d", this->interpreter_frame_bci());
689 ModuleEntry* module = m->method_holder()->module();
690 if (module->is_named()) {
691 module->name()->as_C_string(buf, buflen);
692 st->print(" %s", buf);
693 if (module->version() != nullptr) {
694 module->version()->as_C_string(buf, buflen);
695 st->print("@%s", buf);
696 }
697 }
698 } else {
699 st->print("j " PTR_FORMAT, p2i(pc()));
700 }
701 } else if (StubRoutines::contains(pc())) {
702 StubCodeDesc* desc = StubCodeDesc::desc_for(pc());
703 if (desc != nullptr) {
704 st->print("v ~StubRoutines::%s " PTR_FORMAT, desc->name(), p2i(pc()));
705 } else {
706 st->print("v ~StubRoutines::" PTR_FORMAT, p2i(pc()));
707 }
708 } else if (_cb->is_buffer_blob()) {
709 st->print("v ~BufferBlob::%s " PTR_FORMAT, ((BufferBlob *)_cb)->name(), p2i(pc()));
710 } else if (_cb->is_nmethod()) {
711 nmethod* nm = _cb->as_nmethod();
712 Method* m = nm->method();
713 if (m != nullptr) {
714 st->print("J %d%s", nm->compile_id(), (nm->is_osr_method() ? "%" : ""));
715 st->print(" %s", nm->compiler_name());
716 m->name_and_sig_as_C_string(buf, buflen);
717 st->print(" %s", buf);
718 ModuleEntry* module = m->method_holder()->module();
719 if (module->is_named()) {
720 module->name()->as_C_string(buf, buflen);
721 st->print(" %s", buf);
722 if (module->version() != nullptr) {
723 module->version()->as_C_string(buf, buflen);
724 st->print("@%s", buf);
725 }
726 }
727 st->print(" (%d bytes) @ " PTR_FORMAT " [" PTR_FORMAT "+" INTPTR_FORMAT "]",
728 m->code_size(), p2i(_pc), p2i(_cb->code_begin()), _pc - _cb->code_begin());
729 #if INCLUDE_JVMCI
730 const char* jvmciName = nm->jvmci_name();
731 if (jvmciName != nullptr) {
732 st->print(" (%s)", jvmciName);
733 }
734 #endif
735 } else {
736 st->print("J " PTR_FORMAT, p2i(pc()));
737 }
738 } else if (_cb->is_runtime_stub()) {
739 st->print("v ~RuntimeStub::%s " PTR_FORMAT, ((RuntimeStub *)_cb)->name(), p2i(pc()));
740 } else if (_cb->is_deoptimization_stub()) {
741 st->print("v ~DeoptimizationBlob " PTR_FORMAT, p2i(pc()));
742 } else if (_cb->is_exception_stub()) {
743 st->print("v ~ExceptionBlob " PTR_FORMAT, p2i(pc()));
744 } else if (_cb->is_safepoint_stub()) {
745 st->print("v ~SafepointBlob " PTR_FORMAT, p2i(pc()));
746 } else if (_cb->is_adapter_blob()) {
747 st->print("v ~AdapterBlob " PTR_FORMAT, p2i(pc()));
748 } else if (_cb->is_vtable_blob()) {
749 st->print("v ~VtableBlob " PTR_FORMAT, p2i(pc()));
750 } else if (_cb->is_method_handles_adapter_blob()) {
751 st->print("v ~MethodHandlesAdapterBlob " PTR_FORMAT, p2i(pc()));
752 } else if (_cb->is_uncommon_trap_stub()) {
753 st->print("v ~UncommonTrapBlob " PTR_FORMAT, p2i(pc()));
754 } else if (_cb->is_upcall_stub()) {
755 st->print("v ~UpcallStub::%s " PTR_FORMAT, _cb->name(), p2i(pc()));
756 } else {
757 st->print("v blob " PTR_FORMAT, p2i(pc()));
758 }
759 } else {
760 print_C_frame(st, buf, buflen, pc());
761 }
762 }
763
764
765 /*
766 The interpreter_frame_expression_stack_at method in the case of SPARC needs the
767 max_stack value of the method in order to compute the expression stack address.
768 It uses the Method* in order to get the max_stack value but during GC this
769 Method* value saved on the frame is changed by reverse_and_push and hence cannot
770 be used. So we save the max_stack value in the FrameClosure object and pass it
771 down to the interpreter_frame_expression_stack_at method
772 */
773 class InterpreterFrameClosure : public OffsetClosure {
774 private:
775 const frame* _fr;
776 OopClosure* _f;
777 int _max_locals;
778 int _max_stack;
779
780 public:
781 InterpreterFrameClosure(const frame* fr, int max_locals, int max_stack,
782 OopClosure* f, BufferedValueClosure* bvt_f) {
783 _fr = fr;
784 _max_locals = max_locals;
785 _max_stack = max_stack;
786 _f = f;
787 }
788
789 void offset_do(int offset) {
790 oop* addr;
791 if (offset < _max_locals) {
792 addr = (oop*) _fr->interpreter_frame_local_at(offset);
793 assert((intptr_t*)addr >= _fr->sp(), "must be inside the frame");
794 if (_f != nullptr) {
795 _f->do_oop(addr);
796 }
797 } else {
798 addr = (oop*) _fr->interpreter_frame_expression_stack_at((offset - _max_locals));
799 // In case of exceptions, the expression stack is invalid and the esp will be reset to express
800 // this condition. Therefore, we call f only if addr is 'inside' the stack (i.e., addr >= esp for Intel).
801 bool in_stack;
802 if (frame::interpreter_frame_expression_stack_direction() > 0) {
803 in_stack = (intptr_t*)addr <= _fr->interpreter_frame_tos_address();
804 } else {
805 in_stack = (intptr_t*)addr >= _fr->interpreter_frame_tos_address();
806 }
807 if (in_stack) {
808 if (_f != nullptr) {
809 _f->do_oop(addr);
810 }
811 }
812 }
813 }
814 };
815
816
817 class InterpretedArgumentOopFinder: public SignatureIterator {
818 private:
819 OopClosure* _f; // Closure to invoke
820 int _offset; // TOS-relative offset, decremented with each argument
821 bool _has_receiver; // true if the callee has a receiver
822 const frame* _fr;
823
824 friend class SignatureIterator; // so do_parameters_on can call do_type
825 void do_type(BasicType type) {
826 _offset -= parameter_type_word_count(type);
827 if (is_reference_type(type)) oop_offset_do();
828 }
829
830 void oop_offset_do() {
831 oop* addr;
832 addr = (oop*)_fr->interpreter_frame_tos_at(_offset);
833 _f->do_oop(addr);
834 }
835
836 public:
837 InterpretedArgumentOopFinder(Symbol* signature, bool has_receiver, const frame* fr, OopClosure* f) : SignatureIterator(signature), _has_receiver(has_receiver) {
838 // compute size of arguments
839 int args_size = ArgumentSizeComputer(signature).size() + (has_receiver ? 1 : 0);
840 assert(!fr->is_interpreted_frame() ||
841 args_size <= fr->interpreter_frame_expression_stack_size(),
842 "args cannot be on stack anymore");
843 // initialize InterpretedArgumentOopFinder
844 _f = f;
845 _fr = fr;
846 _offset = args_size;
847 }
848
849 void oops_do() {
850 if (_has_receiver) {
851 --_offset;
852 oop_offset_do();
853 }
854 do_parameters_on(this);
855 }
856 };
857
858
859 // Entry frame has following form (n arguments)
860 // +-----------+
861 // sp -> | last arg |
862 // +-----------+
863 // : ::: :
864 // +-----------+
865 // (sp+n)->| first arg|
866 // +-----------+
867
868
869
870 // visits and GC's all the arguments in entry frame
871 class EntryFrameOopFinder: public SignatureIterator {
872 private:
873 bool _is_static;
874 int _offset;
875 const frame* _fr;
876 OopClosure* _f;
877
878 friend class SignatureIterator; // so do_parameters_on can call do_type
879 void do_type(BasicType type) {
880 // decrement offset before processing the type
881 _offset -= parameter_type_word_count(type);
882 assert (_offset >= 0, "illegal offset");
883 if (is_reference_type(type)) oop_at_offset_do(_offset);
884 }
885
886 void oop_at_offset_do(int offset) {
887 assert (offset >= 0, "illegal offset");
888 oop* addr = (oop*) _fr->entry_frame_argument_at(offset);
889 _f->do_oop(addr);
890 }
891
892 public:
893 EntryFrameOopFinder(const frame* frame, Symbol* signature, bool is_static) : SignatureIterator(signature) {
894 _f = nullptr; // will be set later
895 _fr = frame;
896 _is_static = is_static;
897 _offset = ArgumentSizeComputer(signature).size(); // pre-decremented down to zero
898 }
899
900 void arguments_do(OopClosure* f) {
901 _f = f;
902 if (!_is_static) oop_at_offset_do(_offset); // do the receiver
903 do_parameters_on(this);
904 }
905
906 };
907
908 oop* frame::interpreter_callee_receiver_addr(Symbol* signature) {
909 ArgumentSizeComputer asc(signature);
910 int size = asc.size();
911 return (oop *)interpreter_frame_tos_at(size);
912 }
913
914 oop frame::interpreter_callee_receiver(Symbol* signature) {
915 return *interpreter_callee_receiver_addr(signature);
916 }
917
918 void frame::oops_interpreted_do(OopClosure* f, const RegisterMap* map, bool query_oop_map_cache) const {
919 assert(is_interpreted_frame(), "Not an interpreted frame");
920 Thread *thread = Thread::current();
921 methodHandle m (thread, interpreter_frame_method());
922 jint bci = interpreter_frame_bci();
923
924 assert(!Universe::heap()->is_in(m()),
925 "must be valid oop");
926 assert(m->is_method(), "checking frame value");
927 assert((m->is_native() && bci == 0) ||
928 (!m->is_native() && bci >= 0 && bci < m->code_size()),
929 "invalid bci value");
930
931 // Handle the monitor elements in the activation
932 for (
933 BasicObjectLock* current = interpreter_frame_monitor_end();
934 current < interpreter_frame_monitor_begin();
935 current = next_monitor_in_interpreter_frame(current)
936 ) {
937 #ifdef ASSERT
938 interpreter_frame_verify_monitor(current);
939 #endif
940 current->oops_do(f);
941 }
942
943 if (m->is_native()) {
944 f->do_oop(interpreter_frame_temp_oop_addr());
945 }
946
947 // The method pointer in the frame might be the only path to the method's
948 // klass, and the klass needs to be kept alive while executing. The GCs
949 // don't trace through method pointers, so the mirror of the method's klass
950 // is installed as a GC root.
951 f->do_oop(interpreter_frame_mirror_addr());
952
953 int max_locals = m->is_native() ? m->size_of_parameters() : m->max_locals();
954
955 Symbol* signature = nullptr;
956 bool has_receiver = false;
957
958 // Process a callee's arguments if we are at a call site
959 // (i.e., if we are at an invoke bytecode)
960 // This is used sometimes for calling into the VM, not for another
961 // interpreted or compiled frame.
962 if (!m->is_native()) {
963 Bytecode_invoke call = Bytecode_invoke_check(m, bci);
964 if (map != nullptr && call.is_valid()) {
965 signature = call.signature();
966 has_receiver = call.has_receiver();
967 if (map->include_argument_oops() &&
968 interpreter_frame_expression_stack_size() > 0) {
969 ResourceMark rm(thread); // is this right ???
970 // we are at a call site & the expression stack is not empty
971 // => process callee's arguments
972 //
973 // Note: The expression stack can be empty if an exception
974 // occurred during method resolution/execution. In all
975 // cases we empty the expression stack completely be-
976 // fore handling the exception (the exception handling
977 // code in the interpreter calls a blocking runtime
978 // routine which can cause this code to be executed).
979 // (was bug gri 7/27/98)
980 oops_interpreted_arguments_do(signature, has_receiver, f);
981 }
982 }
983 }
984
985 InterpreterFrameClosure blk(this, max_locals, m->max_stack(), f, nullptr);
986
987 // process locals & expression stack
988 InterpreterOopMap mask;
989 if (query_oop_map_cache) {
990 m->mask_for(m, bci, &mask);
991 } else {
992 OopMapCache::compute_one_oop_map(m, bci, &mask);
993 }
994 mask.iterate_oop(&blk);
995 }
996
997 void frame::buffered_values_interpreted_do(BufferedValueClosure* f) {
998 assert(is_interpreted_frame(), "Not an interpreted frame");
999 Thread *thread = Thread::current();
1000 methodHandle m (thread, interpreter_frame_method());
1001 jint bci = interpreter_frame_bci();
1002
1003 assert(m->is_method(), "checking frame value");
1004 assert(!m->is_native() && bci >= 0 && bci < m->code_size(),
1005 "invalid bci value");
1006
1007 InterpreterFrameClosure blk(this, m->max_locals(), m->max_stack(), nullptr, f);
1008
1009 // process locals & expression stack
1010 InterpreterOopMap mask;
1011 m->mask_for(bci, &mask);
1012 mask.iterate_oop(&blk);
1013 }
1014
1015 void frame::oops_interpreted_arguments_do(Symbol* signature, bool has_receiver, OopClosure* f) const {
1016 InterpretedArgumentOopFinder finder(signature, has_receiver, this, f);
1017 finder.oops_do();
1018 }
1019
1020 void frame::oops_nmethod_do(OopClosure* f, NMethodClosure* cf, DerivedOopClosure* df, DerivedPointerIterationMode derived_mode, const RegisterMap* reg_map) const {
1021 assert(_cb != nullptr, "sanity check");
1022 assert((oop_map() == nullptr) == (_cb->oop_maps() == nullptr), "frame and _cb must agree that oopmap is set or not");
1023 if (oop_map() != nullptr) {
1024 if (df != nullptr) {
1025 _oop_map->oops_do(this, reg_map, f, df);
1026 } else {
1027 _oop_map->oops_do(this, reg_map, f, derived_mode);
1028 }
1029
1030 // Preserve potential arguments for a callee. We handle this by dispatching
1031 // on the codeblob. For c2i, we do
1032 if (reg_map->include_argument_oops() && _cb->is_nmethod()) {
1033 // Only nmethod preserves outgoing arguments at call.
1034 _cb->as_nmethod()->preserve_callee_argument_oops(*this, reg_map, f);
1035 }
1036 }
1037 // In cases where perm gen is collected, GC will want to mark
1038 // oops referenced from nmethods active on thread stacks so as to
1039 // prevent them from being collected. However, this visit should be
1040 // restricted to certain phases of the collection only. The
1041 // closure decides how it wants nmethods to be traced.
1042 if (cf != nullptr && _cb->is_nmethod())
1043 cf->do_nmethod(_cb->as_nmethod());
1044 }
1045
1046 class CompiledArgumentOopFinder: public SignatureIterator {
1047 protected:
1048 OopClosure* _f;
1049 int _offset; // the current offset, incremented with each argument
1050 bool _has_receiver; // true if the callee has a receiver
1051 bool _has_appendix; // true if the call has an appendix
1052 frame _fr;
1053 RegisterMap* _reg_map;
1054 int _arg_size;
1055 VMRegPair* _regs; // VMReg list of arguments
1056
1057 friend class SignatureIterator; // so do_parameters_on can call do_type
1058 void do_type(BasicType type) {
1059 if (is_reference_type(type)) handle_oop_offset();
1060 _offset += parameter_type_word_count(type);
1061 }
1062
1063 virtual void handle_oop_offset() {
1064 // Extract low order register number from register array.
1065 // In LP64-land, the high-order bits are valid but unhelpful.
1066 assert(_offset < _arg_size, "out of bounds");
1067 VMReg reg = _regs[_offset].first();
1068 oop *loc = _fr.oopmapreg_to_oop_location(reg, _reg_map);
1069 #ifdef ASSERT
1070 if (loc == nullptr) {
1071 if (_reg_map->should_skip_missing()) {
1072 return;
1073 }
1074 tty->print_cr("Error walking frame oops:");
1075 _fr.print_on(tty);
1076 assert(loc != nullptr, "missing register map entry reg: %d %s loc: " INTPTR_FORMAT, reg->value(), reg->name(), p2i(loc));
1077 }
1078 #endif
1079 _f->do_oop(loc);
1080 }
1081
1082 public:
1083 CompiledArgumentOopFinder(Symbol* signature, bool has_receiver, bool has_appendix, OopClosure* f, frame fr, const RegisterMap* reg_map)
1084 : SignatureIterator(signature) {
1085
1086 // initialize CompiledArgumentOopFinder
1087 _f = f;
1088 _offset = 0;
1089 _has_receiver = has_receiver;
1090 _has_appendix = has_appendix;
1091 _fr = fr;
1092 _reg_map = (RegisterMap*)reg_map;
1093 _regs = SharedRuntime::find_callee_arguments(signature, has_receiver, has_appendix, &_arg_size);
1094 }
1095
1096 void oops_do() {
1097 if (_has_receiver) {
1098 handle_oop_offset();
1099 _offset++;
1100 }
1101 do_parameters_on(this);
1102 if (_has_appendix) {
1103 handle_oop_offset();
1104 _offset++;
1105 }
1106 }
1107 };
1108
1109 void frame::oops_compiled_arguments_do(Symbol* signature, bool has_receiver, bool has_appendix,
1110 const RegisterMap* reg_map, OopClosure* f) const {
1111 // ResourceMark rm;
1112 CompiledArgumentOopFinder finder(signature, has_receiver, has_appendix, f, *this, reg_map);
1113 finder.oops_do();
1114 }
1115
1116 // Get receiver out of callers frame, i.e. find parameter 0 in callers
1117 // frame. Consult ADLC for where parameter 0 is to be found. Then
1118 // check local reg_map for it being a callee-save register or argument
1119 // register, both of which are saved in the local frame. If not found
1120 // there, it must be an in-stack argument of the caller.
1121 // Note: caller.sp() points to callee-arguments
1122 oop frame::retrieve_receiver(RegisterMap* reg_map) {
1123 frame caller = *this;
1124
1125 // First consult the ADLC on where it puts parameter 0 for this signature.
1126 VMReg reg = SharedRuntime::name_for_receiver();
1127 oop* oop_adr = caller.oopmapreg_to_oop_location(reg, reg_map);
1128 if (oop_adr == nullptr) {
1129 guarantee(oop_adr != nullptr, "bad register save location");
1130 return nullptr;
1131 }
1132 oop r = *oop_adr;
1133 assert(Universe::heap()->is_in_or_null(r), "bad receiver: " INTPTR_FORMAT " (%zd)", p2i(r), p2i(r));
1134 return r;
1135 }
1136
1137
1138 BasicLock* frame::get_native_monitor() const {
1139 nmethod* nm = (nmethod*)_cb;
1140 assert(_cb != nullptr && _cb->is_nmethod() && nm->method()->is_native(),
1141 "Should not call this unless it's a native nmethod");
1142 int byte_offset = in_bytes(nm->native_basic_lock_sp_offset());
1143 assert(byte_offset >= 0, "should not see invalid offset");
1144 return (BasicLock*) &sp()[byte_offset / wordSize];
1145 }
1146
1147 oop frame::get_native_receiver() const {
1148 nmethod* nm = (nmethod*)_cb;
1149 assert(_cb != nullptr && _cb->is_nmethod() && nm->method()->is_native(),
1150 "Should not call this unless it's a native nmethod");
1151 int byte_offset = in_bytes(nm->native_receiver_sp_offset());
1152 assert(byte_offset >= 0, "should not see invalid offset");
1153 oop owner = ((oop*) sp())[byte_offset / wordSize];
1154 assert( Universe::heap()->is_in(owner), "bad receiver" );
1155 return owner;
1156 }
1157
1158 void frame::oops_entry_do(OopClosure* f, const RegisterMap* map) const {
1159 assert(map != nullptr, "map must be set");
1160 if (map->include_argument_oops()) {
1161 // must collect argument oops, as nobody else is doing it
1162 Thread *thread = Thread::current();
1163 methodHandle m (thread, entry_frame_call_wrapper()->callee_method());
1164 EntryFrameOopFinder finder(this, m->signature(), m->is_static());
1165 finder.arguments_do(f);
1166 }
1167 // Traverse the Handle Block saved in the entry frame
1168 entry_frame_call_wrapper()->oops_do(f);
1169 }
1170
1171 void frame::oops_upcall_do(OopClosure* f, const RegisterMap* map) const {
1172 assert(map != nullptr, "map must be set");
1173 if (map->include_argument_oops()) {
1174 // Upcall stubs call a MethodHandle impl method of which only the receiver
1175 // is ever an oop.
1176 // Currently we should not be able to get here, since there are no
1177 // safepoints in the one resolve stub we can get into (handle_wrong_method)
1178 // Leave this here as a trap in case we ever do:
1179 ShouldNotReachHere(); // not implemented
1180 }
1181 _cb->as_upcall_stub()->oops_do(f, *this);
1182 }
1183
1184 bool frame::is_deoptimized_frame() const {
1185 assert(_deopt_state != unknown, "not answerable");
1186 if (_deopt_state == is_deoptimized) {
1187 return true;
1188 }
1189
1190 /* This method only checks if the frame is deoptimized
1191 * as in return address being patched.
1192 * It doesn't care if the OP that we return to is a
1193 * deopt instruction */
1194 /*if (_cb != nullptr && _cb->is_nmethod()) {
1195 return NativeDeoptInstruction::is_deopt_at(_pc);
1196 }*/
1197 return false;
1198 }
1199
1200 void frame::oops_do_internal(OopClosure* f, NMethodClosure* cf,
1201 DerivedOopClosure* df, DerivedPointerIterationMode derived_mode,
1202 const RegisterMap* map, bool use_interpreter_oop_map_cache) const {
1203 #ifndef PRODUCT
1204 // simulate GC crash here to dump java thread in error report
1205 guarantee(!CrashGCForDumpingJavaThread, "");
1206 #endif
1207 if (is_interpreted_frame()) {
1208 oops_interpreted_do(f, map, use_interpreter_oop_map_cache);
1209 } else if (is_entry_frame()) {
1210 oops_entry_do(f, map);
1211 } else if (is_upcall_stub_frame()) {
1212 oops_upcall_do(f, map);
1213 } else if (CodeCache::contains(pc())) {
1214 oops_nmethod_do(f, cf, df, derived_mode, map);
1215 } else {
1216 ShouldNotReachHere();
1217 }
1218 }
1219
1220 void frame::nmethod_do(NMethodClosure* cf) const {
1221 if (_cb != nullptr && _cb->is_nmethod()) {
1222 cf->do_nmethod(_cb->as_nmethod());
1223 }
1224 }
1225
1226
1227 // Call f closure on the interpreted Method*s in the stack.
1228 void frame::metadata_do(MetadataClosure* f) const {
1229 ResourceMark rm;
1230 if (is_interpreted_frame()) {
1231 Method* m = this->interpreter_frame_method();
1232 assert(m != nullptr, "expecting a method in this frame");
1233 f->do_metadata(m);
1234 }
1235 }
1236
1237 void frame::verify(const RegisterMap* map) const {
1238 #ifndef PRODUCT
1239 if (TraceCodeBlobStacks) {
1240 tty->print_cr("*** verify");
1241 print_on(tty);
1242 }
1243 #endif
1244
1245 // for now make sure receiver type is correct
1246 if (is_interpreted_frame()) {
1247 Method* method = interpreter_frame_method();
1248 guarantee(method->is_method(), "method is wrong in frame::verify");
1249 if (!method->is_static()) {
1250 // fetch the receiver
1251 oop* p = (oop*) interpreter_frame_local_at(0);
1252 // make sure we have the right receiver type
1253 }
1254 }
1255 #if COMPILER2_OR_JVMCI
1256 assert(DerivedPointerTable::is_empty(), "must be empty before verify");
1257 #endif
1258
1259 if (map->update_map()) { // The map has to be up-to-date for the current frame
1260 oops_do_internal(&VerifyOopClosure::verify_oop, nullptr, nullptr, DerivedPointerIterationMode::_ignore, map, false);
1261 }
1262 }
1263
1264
1265 #ifdef ASSERT
1266 bool frame::verify_return_pc(address x) {
1267 #ifdef TARGET_ARCH_aarch64
1268 if (!pauth_ptr_is_raw(x)) {
1269 return false;
1270 }
1271 #endif
1272 if (StubRoutines::returns_to_call_stub(x)) {
1273 return true;
1274 }
1275 if (CodeCache::contains(x)) {
1276 return true;
1277 }
1278 if (Interpreter::contains(x)) {
1279 return true;
1280 }
1281 return false;
1282 }
1283 #endif
1284
1285 #ifdef ASSERT
1286 void frame::interpreter_frame_verify_monitor(BasicObjectLock* value) const {
1287 assert(is_interpreted_frame(), "Not an interpreted frame");
1288 // verify that the value is in the right part of the frame
1289 address low_mark = (address) interpreter_frame_monitor_end();
1290 address high_mark = (address) interpreter_frame_monitor_begin();
1291 address current = (address) value;
1292
1293 const int monitor_size = frame::interpreter_frame_monitor_size();
1294 guarantee((high_mark - current) % monitor_size == 0 , "Misaligned top of BasicObjectLock*");
1295 guarantee( high_mark > current , "Current BasicObjectLock* higher than high_mark");
1296
1297 guarantee((current - low_mark) % monitor_size == 0 , "Misaligned bottom of BasicObjectLock*");
1298 guarantee( current >= low_mark , "Current BasicObjectLock* below than low_mark");
1299 }
1300 #endif
1301
1302 #ifndef PRODUCT
1303
1304 // Returns true iff the address p is readable and *(intptr_t*)p != errvalue
1305 extern "C" bool dbg_is_safe(const void* p, intptr_t errvalue);
1306
1307 class FrameValuesOopClosure: public OopClosure, public DerivedOopClosure {
1308 private:
1309 GrowableArray<oop*>* _oops;
1310 GrowableArray<narrowOop*>* _narrow_oops;
1311 GrowableArray<derived_base*>* _base;
1312 GrowableArray<derived_pointer*>* _derived;
1313 NoSafepointVerifier nsv;
1314
1315 public:
1316 FrameValuesOopClosure() {
1317 _oops = new (mtThread) GrowableArray<oop*>(100, mtThread);
1318 _narrow_oops = new (mtThread) GrowableArray<narrowOop*>(100, mtThread);
1319 _base = new (mtThread) GrowableArray<derived_base*>(100, mtThread);
1320 _derived = new (mtThread) GrowableArray<derived_pointer*>(100, mtThread);
1321 }
1322 ~FrameValuesOopClosure() {
1323 delete _oops;
1324 delete _narrow_oops;
1325 delete _base;
1326 delete _derived;
1327 }
1328
1329 virtual void do_oop(oop* p) override { _oops->push(p); }
1330 virtual void do_oop(narrowOop* p) override { _narrow_oops->push(p); }
1331 virtual void do_derived_oop(derived_base* base_loc, derived_pointer* derived_loc) override {
1332 _base->push(base_loc);
1333 _derived->push(derived_loc);
1334 }
1335
1336 bool is_good(oop* p) {
1337 return *p == nullptr || (dbg_is_safe(*p, -1) && dbg_is_safe((*p)->klass(), -1) && oopDesc::is_oop_or_null(*p));
1338 }
1339 void describe(FrameValues& values, int frame_no) {
1340 for (int i = 0; i < _oops->length(); i++) {
1341 oop* p = _oops->at(i);
1342 values.describe(frame_no, (intptr_t*)p, err_msg("oop%s for #%d", is_good(p) ? "" : " (BAD)", frame_no));
1343 }
1344 for (int i = 0; i < _narrow_oops->length(); i++) {
1345 narrowOop* p = _narrow_oops->at(i);
1346 // we can't check for bad compressed oops, as decoding them might crash
1347 values.describe(frame_no, (intptr_t*)p, err_msg("narrow oop for #%d", frame_no));
1348 }
1349 assert(_base->length() == _derived->length(), "should be the same");
1350 for (int i = 0; i < _base->length(); i++) {
1351 derived_base* base = _base->at(i);
1352 derived_pointer* derived = _derived->at(i);
1353 values.describe(frame_no, (intptr_t*)derived, err_msg("derived pointer (base: " INTPTR_FORMAT ") for #%d", p2i(base), frame_no));
1354 }
1355 }
1356 };
1357
1358 class FrameValuesOopMapClosure: public OopMapClosure {
1359 private:
1360 const frame* _fr;
1361 const RegisterMap* _reg_map;
1362 FrameValues& _values;
1363 int _frame_no;
1364
1365 public:
1366 FrameValuesOopMapClosure(const frame* fr, const RegisterMap* reg_map, FrameValues& values, int frame_no)
1367 : _fr(fr), _reg_map(reg_map), _values(values), _frame_no(frame_no) {}
1368
1369 virtual void do_value(VMReg reg, OopMapValue::oop_types type) override {
1370 intptr_t* p = (intptr_t*)_fr->oopmapreg_to_location(reg, _reg_map);
1371 if (p != nullptr && (((intptr_t)p & WordAlignmentMask) == 0)) {
1372 const char* type_name = nullptr;
1373 switch(type) {
1374 case OopMapValue::oop_value: type_name = "oop"; break;
1375 case OopMapValue::narrowoop_value: type_name = "narrow oop"; break;
1376 case OopMapValue::callee_saved_value: type_name = "callee-saved"; break;
1377 case OopMapValue::derived_oop_value: type_name = "derived"; break;
1378 // case OopMapValue::live_value: type_name = "live"; break;
1379 default: break;
1380 }
1381 if (type_name != nullptr) {
1382 _values.describe(_frame_no, p, err_msg("%s for #%d", type_name, _frame_no));
1383 }
1384 }
1385 }
1386 };
1387
1388 // callers need a ResourceMark because of name_and_sig_as_C_string() usage,
1389 // RA allocated string is returned to the caller
1390 void frame::describe(FrameValues& values, int frame_no, const RegisterMap* reg_map, bool top) {
1391 // boundaries: sp and the 'real' frame pointer
1392 values.describe(-1, sp(), err_msg("sp for #%d", frame_no), 0);
1393 if (top) {
1394 values.describe(-1, sp() - 1, err_msg("sp[-1] for #%d", frame_no), 0);
1395 values.describe(-1, sp() - 2, err_msg("sp[-2] for #%d", frame_no), 0);
1396 }
1397
1398 intptr_t* frame_pointer = real_fp(); // Note: may differ from fp()
1399
1400 // print frame info at the highest boundary
1401 intptr_t* info_address = MAX2(sp(), frame_pointer);
1402
1403 if (info_address != frame_pointer) {
1404 // print frame_pointer explicitly if not marked by the frame info
1405 values.describe(-1, frame_pointer, err_msg("frame pointer for #%d", frame_no), 1);
1406 }
1407
1408 if (is_entry_frame() || is_compiled_frame() || is_interpreted_frame() || is_native_frame()) {
1409 // Label values common to most frames
1410 values.describe(-1, unextended_sp(), err_msg("unextended_sp for #%d", frame_no), 0);
1411 }
1412
1413 if (is_interpreted_frame()) {
1414 Method* m = interpreter_frame_method();
1415 int bci = interpreter_frame_bci();
1416 InterpreterCodelet* desc = Interpreter::codelet_containing(pc());
1417
1418 // Label the method and current bci
1419 values.describe(-1, info_address,
1420 FormatBuffer<1024>("#%d method %s @ %d", frame_no, m->name_and_sig_as_C_string(), bci), 3);
1421 if (desc != nullptr) {
1422 values.describe(-1, info_address, err_msg("- %s codelet: %s",
1423 desc->bytecode() >= 0 ? Bytecodes::name(desc->bytecode()) : "",
1424 desc->description() != nullptr ? desc->description() : "?"), 2);
1425 }
1426 values.describe(-1, info_address,
1427 err_msg("- %d locals %d max stack", m->max_locals(), m->max_stack()), 2);
1428 // return address will be emitted by caller in describe_pd
1429 // values.describe(frame_no, (intptr_t*)sender_pc_addr(), Continuation::is_return_barrier_entry(*sender_pc_addr()) ? "return address (return barrier)" : "return address");
1430
1431 if (m->max_locals() > 0) {
1432 intptr_t* l0 = interpreter_frame_local_at(0);
1433 intptr_t* ln = interpreter_frame_local_at(m->max_locals() - 1);
1434 values.describe(-1, MAX2(l0, ln), err_msg("locals for #%d", frame_no), 2);
1435 // Report each local and mark as owned by this frame
1436 for (int l = 0; l < m->max_locals(); l++) {
1437 intptr_t* l0 = interpreter_frame_local_at(l);
1438 values.describe(frame_no, l0, err_msg("local %d", l), 1);
1439 }
1440 }
1441
1442 if (interpreter_frame_monitor_begin() != interpreter_frame_monitor_end()) {
1443 values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_begin(), "monitors begin");
1444 values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_end(), "monitors end");
1445 }
1446
1447 // Compute the actual expression stack size
1448 InterpreterOopMap mask;
1449 OopMapCache::compute_one_oop_map(methodHandle(Thread::current(), m), bci, &mask);
1450 intptr_t* tos = nullptr;
1451 // Report each stack element and mark as owned by this frame
1452 for (int e = 0; e < mask.expression_stack_size(); e++) {
1453 tos = MAX2(tos, interpreter_frame_expression_stack_at(e));
1454 values.describe(frame_no, interpreter_frame_expression_stack_at(e),
1455 err_msg("stack %d", e), 1);
1456 }
1457 if (tos != nullptr) {
1458 values.describe(-1, tos, err_msg("expression stack for #%d", frame_no), 2);
1459 }
1460
1461 if (reg_map != nullptr) {
1462 FrameValuesOopClosure oopsFn;
1463 oops_do(&oopsFn, nullptr, &oopsFn, reg_map);
1464 oopsFn.describe(values, frame_no);
1465 }
1466 } else if (is_entry_frame()) {
1467 // For now just label the frame
1468 values.describe(-1, info_address, err_msg("#%d entry frame", frame_no), 2);
1469 } else if (is_compiled_frame()) {
1470 // For now just label the frame
1471 nmethod* nm = cb()->as_nmethod();
1472 values.describe(-1, info_address,
1473 FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for method J %s%s", frame_no,
1474 p2i(nm),
1475 nm->method()->name_and_sig_as_C_string(),
1476 (_deopt_state == is_deoptimized) ?
1477 " (deoptimized)" :
1478 ((_deopt_state == unknown) ? " (state unknown)" : "")),
1479 3);
1480
1481 { // mark arguments (see nmethod::print_nmethod_labels)
1482 Method* m = nm->method();
1483
1484 int stack_slot_offset = nm->frame_size() * wordSize; // offset, in bytes, to caller sp
1485 int sizeargs = m->size_of_parameters();
1486
1487 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sizeargs);
1488 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, sizeargs);
1489 {
1490 int sig_index = 0;
1491 if (!m->is_static()) {
1492 sig_bt[sig_index++] = T_OBJECT; // 'this'
1493 }
1494 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ss.next()) {
1495 BasicType t = ss.type();
1496 assert(type2size[t] == 1 || type2size[t] == 2, "size is 1 or 2");
1497 sig_bt[sig_index++] = t;
1498 if (type2size[t] == 2) {
1499 sig_bt[sig_index++] = T_VOID;
1500 }
1501 }
1502 assert(sig_index == sizeargs, "");
1503 }
1504 int stack_arg_slots = SharedRuntime::java_calling_convention(sig_bt, regs, sizeargs);
1505 assert(stack_arg_slots == nm->as_nmethod()->num_stack_arg_slots(false /* rounded */) || nm->is_osr_method(), "");
1506 int out_preserve = SharedRuntime::out_preserve_stack_slots();
1507 int sig_index = 0;
1508 int arg_index = (m->is_static() ? 0 : -1);
1509 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ) {
1510 bool at_this = (arg_index == -1);
1511 bool at_old_sp = false;
1512 BasicType t = (at_this ? T_OBJECT : ss.type());
1513 assert(t == sig_bt[sig_index], "sigs in sync");
1514 VMReg fst = regs[sig_index].first();
1515 if (fst->is_stack()) {
1516 assert(((int)fst->reg2stack()) >= 0, "reg2stack: %d", fst->reg2stack());
1517 int offset = (fst->reg2stack() + out_preserve) * VMRegImpl::stack_slot_size + stack_slot_offset;
1518 intptr_t* stack_address = (intptr_t*)((address)unextended_sp() + offset);
1519 if (at_this) {
1520 values.describe(frame_no, stack_address, err_msg("this for #%d", frame_no), 1);
1521 } else {
1522 values.describe(frame_no, stack_address, err_msg("param %d %s for #%d", arg_index, type2name(t), frame_no), 1);
1523 }
1524 }
1525 sig_index += type2size[t];
1526 arg_index += 1;
1527 if (!at_this) {
1528 ss.next();
1529 }
1530 }
1531 }
1532
1533 if (reg_map != nullptr && is_java_frame()) {
1534 int scope_no = 0;
1535 for (ScopeDesc* scope = nm->scope_desc_at(pc()); scope != nullptr; scope = scope->sender(), scope_no++) {
1536 Method* m = scope->method();
1537 int bci = scope->bci();
1538 values.describe(-1, info_address, err_msg("- #%d scope %s @ %d", scope_no, m->name_and_sig_as_C_string(), bci), 2);
1539
1540 { // mark locals
1541 GrowableArray<ScopeValue*>* scvs = scope->locals();
1542 int scvs_length = scvs != nullptr ? scvs->length() : 0;
1543 for (int i = 0; i < scvs_length; i++) {
1544 intptr_t* stack_address = (intptr_t*)StackValue::stack_value_address(this, reg_map, scvs->at(i));
1545 if (stack_address != nullptr) {
1546 values.describe(frame_no, stack_address, err_msg("local %d for #%d (scope %d)", i, frame_no, scope_no), 1);
1547 }
1548 }
1549 }
1550 { // mark expression stack
1551 GrowableArray<ScopeValue*>* scvs = scope->expressions();
1552 int scvs_length = scvs != nullptr ? scvs->length() : 0;
1553 for (int i = 0; i < scvs_length; i++) {
1554 intptr_t* stack_address = (intptr_t*)StackValue::stack_value_address(this, reg_map, scvs->at(i));
1555 if (stack_address != nullptr) {
1556 values.describe(frame_no, stack_address, err_msg("stack %d for #%d (scope %d)", i, frame_no, scope_no), 1);
1557 }
1558 }
1559 }
1560 }
1561
1562 FrameValuesOopClosure oopsFn;
1563 oops_do(&oopsFn, nullptr, &oopsFn, reg_map);
1564 oopsFn.describe(values, frame_no);
1565
1566 if (oop_map() != nullptr) {
1567 FrameValuesOopMapClosure valuesFn(this, reg_map, values, frame_no);
1568 // also OopMapValue::live_value ??
1569 oop_map()->all_type_do(this, OopMapValue::callee_saved_value, &valuesFn);
1570 }
1571 }
1572 } else if (is_native_frame()) {
1573 // For now just label the frame
1574 nmethod* nm = cb()->as_nmethod_or_null();
1575 values.describe(-1, info_address,
1576 FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for native method %s", frame_no,
1577 p2i(nm), nm->method()->name_and_sig_as_C_string()), 2);
1578 if (nm->method()->is_continuation_enter_intrinsic()) {
1579 ContinuationEntry* ce = Continuation::get_continuation_entry_for_entry_frame(reg_map->thread(), *this); // (ContinuationEntry*)unextended_sp();
1580 ce->describe(values, frame_no);
1581 }
1582 } else {
1583 // provide default info if not handled before
1584 char *info = (char *) "special frame";
1585 if ((_cb != nullptr) &&
1586 (_cb->name() != nullptr)) {
1587 info = (char *)_cb->name();
1588 }
1589 values.describe(-1, info_address, err_msg("#%d <%s>", frame_no, info), 2);
1590 }
1591
1592 // platform dependent additional data
1593 describe_pd(values, frame_no);
1594 }
1595
1596 #endif
1597
1598 /**
1599 * Gets the caller frame of `fr` for thread `t`.
1600 *
1601 * @returns an invalid frame (i.e. fr.pc() === 0) if the caller cannot be obtained
1602 */
1603 frame frame::next_frame(frame fr, Thread* t) {
1604 // Compiled code may use EBP register on x86 so it looks like
1605 // non-walkable C frame. Use frame.sender() for java frames.
1606 frame invalid;
1607 if (t != nullptr && t->is_Java_thread()) {
1608 // Catch very first native frame by using stack address.
1609 // For JavaThread stack_base and stack_size should be set.
1610 if (!t->is_in_full_stack((address)(fr.real_fp() + 1))) {
1611 return invalid;
1612 }
1613 if (fr.is_interpreted_frame() || (fr.cb() != nullptr && fr.cb()->frame_size() > 0)) {
1614 RegisterMap map(JavaThread::cast(t),
1615 RegisterMap::UpdateMap::skip,
1616 RegisterMap::ProcessFrames::include,
1617 RegisterMap::WalkContinuation::skip); // No update
1618 return fr.sender(&map);
1619 } else {
1620 // is_first_C_frame() does only simple checks for frame pointer,
1621 // it will pass if java compiled code has a pointer in EBP.
1622 if (os::is_first_C_frame(&fr)) return invalid;
1623 return os::get_sender_for_C_frame(&fr);
1624 }
1625 } else {
1626 if (os::is_first_C_frame(&fr)) return invalid;
1627 return os::get_sender_for_C_frame(&fr);
1628 }
1629 }
1630
1631 #ifndef PRODUCT
1632
1633 void FrameValues::describe(int owner, intptr_t* location, const char* description, int priority) {
1634 FrameValue fv;
1635 fv.location = location;
1636 fv.owner = owner;
1637 fv.priority = priority;
1638 fv.description = NEW_RESOURCE_ARRAY(char, strlen(description) + 1);
1639 strcpy(fv.description, description);
1640 _values.append(fv);
1641 }
1642
1643
1644 #ifdef ASSERT
1645 void FrameValues::validate() {
1646 _values.sort(compare);
1647 bool error = false;
1648 FrameValue prev;
1649 prev.owner = -1;
1650 for (int i = _values.length() - 1; i >= 0; i--) {
1651 FrameValue fv = _values.at(i);
1652 if (fv.owner == -1) continue;
1653 if (prev.owner == -1) {
1654 prev = fv;
1655 continue;
1656 }
1657 if (prev.location == fv.location) {
1658 if (fv.owner != prev.owner) {
1659 tty->print_cr("overlapping storage");
1660 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(prev.location), *prev.location, prev.description);
1661 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(fv.location), *fv.location, fv.description);
1662 error = true;
1663 }
1664 } else {
1665 prev = fv;
1666 }
1667 }
1668 // if (error) { tty->cr(); print_on(static_cast<JavaThread*>(nullptr), tty); }
1669 assert(!error, "invalid layout");
1670 }
1671 #endif // ASSERT
1672
1673 void FrameValues::print_on(JavaThread* thread, outputStream* st) {
1674 _values.sort(compare);
1675
1676 // Sometimes values like the fp can be invalid values if the
1677 // register map wasn't updated during the walk. Trim out values
1678 // that aren't actually in the stack of the thread.
1679 int min_index = 0;
1680 int max_index = _values.length() - 1;
1681 intptr_t* v0 = _values.at(min_index).location;
1682 intptr_t* v1 = _values.at(max_index).location;
1683
1684 if (thread != nullptr) {
1685 if (thread == Thread::current()) {
1686 while (!thread->is_in_live_stack((address)v0)) v0 = _values.at(++min_index).location;
1687 while (!thread->is_in_live_stack((address)v1)) v1 = _values.at(--max_index).location;
1688 } else {
1689 while (!thread->is_in_full_stack((address)v0)) v0 = _values.at(++min_index).location;
1690 while (!thread->is_in_full_stack((address)v1)) v1 = _values.at(--max_index).location;
1691 }
1692 }
1693
1694 print_on(st, min_index, max_index, v0, v1);
1695 }
1696
1697 void FrameValues::print_on(stackChunkOop chunk, outputStream* st) {
1698 _values.sort(compare);
1699
1700 intptr_t* start = chunk->start_address();
1701 intptr_t* end = chunk->end_address() + 1;
1702
1703 int min_index = 0;
1704 int max_index = _values.length() - 1;
1705 intptr_t* v0 = _values.at(min_index).location;
1706 intptr_t* v1 = _values.at(max_index).location;
1707 while (!(start <= v0 && v0 <= end)) v0 = _values.at(++min_index).location;
1708 while (!(start <= v1 && v1 <= end)) v1 = _values.at(--max_index).location;
1709
1710 print_on(st, min_index, max_index, v0, v1);
1711 }
1712
1713 void FrameValues::print_on(outputStream* st, int min_index, int max_index, intptr_t* v0, intptr_t* v1) {
1714 intptr_t* min = MIN2(v0, v1);
1715 intptr_t* max = MAX2(v0, v1);
1716 intptr_t* cur = max;
1717 intptr_t* last = nullptr;
1718 intptr_t* fp = nullptr;
1719 for (int i = max_index; i >= min_index; i--) {
1720 FrameValue fv = _values.at(i);
1721 while (cur > fv.location) {
1722 st->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT, p2i(cur), *cur);
1723 cur--;
1724 }
1725 if (last == fv.location) {
1726 const char* spacer = " " LP64_ONLY(" ");
1727 st->print_cr(" %s %s %s", spacer, spacer, fv.description);
1728 } else {
1729 if (*fv.description == '#' && isdigit(fv.description[1])) {
1730 // The fv.description string starting with a '#' is the line for the
1731 // saved frame pointer eg. "#10 method java.lang.invoke.LambdaForm..."
1732 // basicaly means frame 10.
1733 fp = fv.location;
1734 }
1735 // To print a fp-relative value:
1736 // 1. The content of *fv.location must be such that we think it's a
1737 // fp-relative number, i.e [-100..100].
1738 // 2. We must have found the frame pointer.
1739 // 3. The line can not be the line for the saved frame pointer.
1740 // 4. Recognize it as being part of the "fixed frame".
1741 if (*fv.location != 0 && *fv.location > -100 && *fv.location < 100
1742 && fp != nullptr && *fv.description != '#'
1743 #if !defined(PPC64)
1744 && (strncmp(fv.description, "interpreter_frame_", 18) == 0 || strstr(fv.description, " method "))
1745 #else // !defined(PPC64)
1746 && (strcmp(fv.description, "sender_sp") == 0 || strcmp(fv.description, "top_frame_sp") == 0 ||
1747 strcmp(fv.description, "esp") == 0 || strcmp(fv.description, "monitors") == 0 ||
1748 strcmp(fv.description, "locals") == 0 || strstr(fv.description, " method "))
1749 #endif //!defined(PPC64)
1750 ) {
1751 st->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %-32s (relativized: fp%+d)",
1752 p2i(fv.location), p2i(&fp[*fv.location]), fv.description, (int)*fv.location);
1753 } else {
1754 st->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(fv.location), *fv.location, fv.description);
1755 }
1756 last = fv.location;
1757 cur--;
1758 }
1759 }
1760 }
1761
1762 #endif // ndef PRODUCT