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