|
/*
* Copyright (c) 1997, 2022, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#ifndef SHARE_RUNTIME_FRAME_HPP
#define SHARE_RUNTIME_FRAME_HPP
#include "code/vmregTypes.hpp"
#include "compiler/oopMap.hpp"
#include "oops/oopsHierarchy.hpp"
#include "runtime/basicLock.hpp"
#include "runtime/monitorChunk.hpp"
#include "utilities/growableArray.hpp"
#include "utilities/macros.hpp"
#ifdef ZERO
# include "stack_zero.hpp"
#endif
typedef class BytecodeInterpreter* interpreterState;
class CodeBlob;
class CompiledMethod;
class FrameValues;
class InterpreterOopMap;
class JavaCallWrapper;
class Method;
class methodHandle;
class RegisterMap;
class vframeArray;
enum class DerivedPointerIterationMode {
_with_table,
_directly,
_ignore
};
// A frame represents a physical stack frame (an activation). Frames
// can be C or Java frames, and the Java frames can be interpreted or
// compiled. In contrast, vframes represent source-level activations,
// so that one physical frame can correspond to multiple source level
// frames because of inlining.
class frame {
private:
// Instance variables:
union {
intptr_t* _sp; // stack pointer (from Thread::last_Java_sp)
int _offset_sp; // used by frames in stack chunks
};
address _pc; // program counter (the next instruction after the call)
mutable CodeBlob* _cb; // CodeBlob that "owns" pc
mutable const ImmutableOopMap* _oop_map; // oop map, for compiled/stubs frames only
enum deopt_state {
not_deoptimized,
is_deoptimized,
unknown
};
deopt_state _deopt_state;
// Do internal pointers in interpreter frames use absolute adddresses or relative (to fp)?
// Frames in stack chunks are on the Java heap and use relative addressing; on the stack
// they use absolute addressing
bool _on_heap; // This frame represents a frame on the heap.
DEBUG_ONLY(int _frame_index;) // the frame index in a stack chunk; -1 when on a thread stack
// We use different assertions to allow for intermediate states (e.g. during thawing or relativizing the frame)
void assert_on_heap() const { assert(is_heap_frame(), "Using offset with a non-chunk frame"); }
void assert_offset() const { assert(_frame_index >= 0, "Using offset with a non-chunk frame"); assert_on_heap(); }
void assert_absolute() const { assert(_frame_index == -1, "Using absolute addresses with a chunk frame"); }
public:
// Constructors
frame();
explicit frame(bool dummy) {} // no initialization
explicit frame(intptr_t* sp);
#ifndef PRODUCT
// This is a generic constructor which is only used by pns() in debug.cpp.
// pns (i.e. print native stack) uses this constructor to create a starting
// frame for stack walking. The implementation of this constructor is platform
// dependent (i.e. SPARC doesn't need an 'fp' argument an will ignore it) but
// we want to keep the signature generic because pns() is shared code.
frame(void* sp, void* fp, void* pc);
#endif
// Accessors
// pc: Returns the pc at which this frame will continue normally.
// It must point at the beginning of the next instruction to execute.
address pc() const { return _pc; }
// This returns the pc that if you were in the debugger you'd see. Not
// the idealized value in the frame object. This undoes the magic conversion
// that happens for deoptimized frames. In addition it makes the value the
// hardware would want to see in the native frame. The only user (at this point)
// is deoptimization. It likely no one else should ever use it.
address raw_pc() const;
void set_pc(address newpc);
intptr_t* sp() const { assert_absolute(); return _sp; }
void set_sp( intptr_t* newsp ) { _sp = newsp; }
int offset_sp() const { assert_offset(); return _offset_sp; }
void set_offset_sp( int newsp ) { assert_on_heap(); _offset_sp = newsp; }
int frame_index() const {
#ifdef ASSERT
return _frame_index;
#else
return -1;
#endif
}
void set_frame_index( int index ) {
#ifdef ASSERT
_frame_index = index;
#endif
}
static int sender_sp_ret_address_offset();
CodeBlob* cb() const { return _cb; }
inline CodeBlob* get_cb() const;
// inline void set_cb(CodeBlob* cb);
const ImmutableOopMap* oop_map() const {
if (_oop_map == NULL) {
_oop_map = get_oop_map();
}
return _oop_map;
}
// patching operations
void patch_pc(Thread* thread, address pc);
// Every frame needs to return a unique id which distinguishes it from all other frames.
// For sparc and ia32 use sp. ia64 can have memory frames that are empty so multiple frames
// will have identical sp values. For ia64 the bsp (fp) value will serve. No real frame
// should have an id() of NULL so it is a distinguishing value for an unmatchable frame.
// We also have relationals which allow comparing a frame to anoth frame's id() allow
// us to distinguish younger (more recent activation) from older (less recent activations)
// A NULL id is only valid when comparing for equality.
intptr_t* id(void) const;
bool is_younger(intptr_t* id) const;
bool is_older(intptr_t* id) const;
// testers
// Compares for strict equality. Rarely used or needed.
// It can return a different result than f1.id() == f2.id()
bool equal(frame other) const;
// type testers
bool is_empty() const { return _pc == NULL; }
bool is_interpreted_frame() const;
bool is_java_frame() const;
bool is_entry_frame() const; // Java frame called from C?
bool is_stub_frame() const;
bool is_ignored_frame() const;
bool is_native_frame() const;
bool is_runtime_frame() const;
bool is_compiled_frame() const;
bool is_safepoint_blob_frame() const;
bool is_deoptimized_frame() const;
bool is_upcall_stub_frame() const;
bool is_heap_frame() const { return _on_heap; }
// testers
bool is_first_frame() const; // oldest frame? (has no sender)
bool is_first_java_frame() const; // same for Java frame
bool is_first_vthread_frame(JavaThread* thread) const;
bool is_interpreted_frame_valid(JavaThread* thread) const; // performs sanity checks on interpreted frames.
// is this frame doing a call using the compiled calling convention?
bool is_compiled_caller() const {
return is_compiled_frame() || is_upcall_stub_frame();
}
// tells whether this frame is marked for deoptimization
bool should_be_deoptimized() const;
// tells whether this frame can be deoptimized
bool can_be_deoptimized() const;
// the frame size in machine words
inline int frame_size() const;
// the size, in words, of stack-passed arguments
inline int compiled_frame_stack_argsize() const;
inline void interpreted_frame_oop_map(InterpreterOopMap* mask) const;
// returns the sending frame
inline frame sender(RegisterMap* map) const;
bool safe_for_sender(JavaThread *thread);
// returns the sender, but skips conversion frames
frame real_sender(RegisterMap* map) const;
// returns the sending Java frame, skipping any intermediate C frames
// NB: receiver must not be first frame
frame java_sender() const;
private:
// Helper methods for better factored code in frame::sender
inline frame sender_for_compiled_frame(RegisterMap* map) const;
frame sender_for_entry_frame(RegisterMap* map) const;
frame sender_for_interpreter_frame(RegisterMap* map) const;
frame sender_for_upcall_stub_frame(RegisterMap* map) const;
bool is_entry_frame_valid(JavaThread* thread) const;
// All frames:
// A low-level interface for vframes:
public:
intptr_t* addr_at(int index) const { return &fp()[index]; }
intptr_t at_absolute(int index) const { return *addr_at(index); }
// Interpreter frames in continuation stacks are on the heap, and internal addresses are relative to fp.
intptr_t at_relative(int index) const { return (intptr_t)(fp() + fp()[index]); }
intptr_t at(int index) const {
return _on_heap ? at_relative(index) : at_absolute(index);
}
public:
// Link (i.e., the pointer to the previous frame)
// might crash if the frame has no parent
intptr_t* link() const;
// Link (i.e., the pointer to the previous frame) or null if the link cannot be accessed
intptr_t* link_or_null() const;
// Return address
address sender_pc() const;
// Support for deoptimization
void deoptimize(JavaThread* thread);
// The frame's original SP, before any extension by an interpreted callee;
// used for packing debug info into vframeArray objects and vframeArray lookup.
intptr_t* unextended_sp() const;
void set_unextended_sp(intptr_t* value);
int offset_unextended_sp() const;
void set_offset_unextended_sp(int value);
// returns the stack pointer of the calling frame
intptr_t* sender_sp() const;
// Returns the real 'frame pointer' for the current frame.
// This is the value expected by the platform ABI when it defines a
// frame pointer register. It may differ from the effective value of
// the FP register when that register is used in the JVM for other
// purposes (like compiled frames on some platforms).
// On other platforms, it is defined so that the stack area used by
// this frame goes from real_fp() to sp().
intptr_t* real_fp() const;
// Deoptimization info, if needed (platform dependent).
// Stored in the initial_info field of the unroll info, to be used by
// the platform dependent deoptimization blobs.
intptr_t *initial_deoptimization_info();
// Interpreter frames:
private:
intptr_t** interpreter_frame_locals_addr() const;
intptr_t* interpreter_frame_bcp_addr() const;
intptr_t* interpreter_frame_mdp_addr() const;
public:
// Locals
// The _at version returns a pointer because the address is used for GC.
intptr_t* interpreter_frame_local_at(int index) const;
void interpreter_frame_set_locals(intptr_t* locs);
// byte code index
jint interpreter_frame_bci() const;
// byte code pointer
address interpreter_frame_bcp() const;
void interpreter_frame_set_bcp(address bcp);
// method data pointer
address interpreter_frame_mdp() const;
void interpreter_frame_set_mdp(address dp);
// Find receiver out of caller's (compiled) argument list
oop retrieve_receiver(RegisterMap *reg_map);
// Return the monitor owner and BasicLock for compiled synchronized
// native methods. Used by JVMTI's GetLocalInstance method
// (via VM_GetReceiver) to retrieve the receiver from a native wrapper frame.
BasicLock* get_native_monitor();
oop get_native_receiver();
// Find receiver for an invoke when arguments are just pushed on stack (i.e., callee stack-frame is
// not setup)
oop interpreter_callee_receiver(Symbol* signature);
oop* interpreter_callee_receiver_addr(Symbol* signature);
// expression stack (may go up or down, direction == 1 or -1)
public:
intptr_t* interpreter_frame_expression_stack() const;
// The _at version returns a pointer because the address is used for GC.
intptr_t* interpreter_frame_expression_stack_at(jint offset) const;
// top of expression stack
intptr_t* interpreter_frame_tos_at(jint offset) const;
intptr_t* interpreter_frame_tos_address() const;
jint interpreter_frame_expression_stack_size() const;
intptr_t* interpreter_frame_sender_sp() const;
// template based interpreter deoptimization support
void set_interpreter_frame_sender_sp(intptr_t* sender_sp);
void interpreter_frame_set_monitor_end(BasicObjectLock* value);
// Address of the temp oop in the frame. Needed as GC root.
oop* interpreter_frame_temp_oop_addr() const;
// BasicObjectLocks:
//
// interpreter_frame_monitor_begin is higher in memory than interpreter_frame_monitor_end
// Interpreter_frame_monitor_begin points to one element beyond the oldest one,
// interpreter_frame_monitor_end points to the youngest one, or if there are none,
// it points to one beyond where the first element will be.
// interpreter_frame_monitor_size reports the allocation size of a monitor in the interpreter stack.
// this value is >= BasicObjectLock::size(), and may be rounded up
BasicObjectLock* interpreter_frame_monitor_begin() const;
BasicObjectLock* interpreter_frame_monitor_end() const;
BasicObjectLock* next_monitor_in_interpreter_frame(BasicObjectLock* current) const;
BasicObjectLock* previous_monitor_in_interpreter_frame(BasicObjectLock* current) const;
static int interpreter_frame_monitor_size();
void interpreter_frame_verify_monitor(BasicObjectLock* value) const;
// Return/result value from this interpreter frame
// If the method return type is T_OBJECT or T_ARRAY populates oop_result
// For other (non-T_VOID) the appropriate field in the jvalue is populated
// with the result value.
// Should only be called when at method exit when the method is not
// exiting due to an exception.
BasicType interpreter_frame_result(oop* oop_result, jvalue* value_result);
public:
// Method & constant pool cache
Method* interpreter_frame_method() const;
void interpreter_frame_set_method(Method* method);
Method** interpreter_frame_method_addr() const;
ConstantPoolCache** interpreter_frame_cache_addr() const;
oop* interpreter_frame_mirror_addr() const;
void interpreter_frame_set_mirror(oop mirror);
public:
// Entry frames
JavaCallWrapper* entry_frame_call_wrapper() const { return *entry_frame_call_wrapper_addr(); }
JavaCallWrapper* entry_frame_call_wrapper_if_safe(JavaThread* thread) const;
JavaCallWrapper** entry_frame_call_wrapper_addr() const;
intptr_t* entry_frame_argument_at(int offset) const;
// tells whether there is another chunk of Delta stack above
bool entry_frame_is_first() const;
bool upcall_stub_frame_is_first() const;
// Safepoints
public:
oop saved_oop_result(RegisterMap* map) const;
void set_saved_oop_result(RegisterMap* map, oop obj);
// For debugging
private:
const char* print_name() const;
void describe_pd(FrameValues& values, int frame_no);
public:
void print_value() const { print_value_on(tty,NULL); }
void print_value_on(outputStream* st, JavaThread *thread) const;
void print_on(outputStream* st) const;
void interpreter_frame_print_on(outputStream* st) const;
void print_on_error(outputStream* st, char* buf, int buflen, bool verbose = false) const;
static void print_C_frame(outputStream* st, char* buf, int buflen, address pc);
// Add annotated descriptions of memory locations belonging to this frame to values
void describe(FrameValues& values, int frame_no, const RegisterMap* reg_map=NULL);
// Conversion from a VMReg to physical stack location
template <typename RegisterMapT>
address oopmapreg_to_location(VMReg reg, const RegisterMapT* reg_map) const;
template <typename RegisterMapT>
oop* oopmapreg_to_oop_location(VMReg reg, const RegisterMapT* reg_map) const;
// Oops-do's
void oops_compiled_arguments_do(Symbol* signature, bool has_receiver, bool has_appendix, const RegisterMap* reg_map, OopClosure* f) const;
void oops_interpreted_do(OopClosure* f, const RegisterMap* map, bool query_oop_map_cache = true) const;
private:
void oops_interpreted_arguments_do(Symbol* signature, bool has_receiver, OopClosure* f) const;
// Iteration of oops
void oops_do_internal(OopClosure* f, CodeBlobClosure* cf,
DerivedOopClosure* df, DerivedPointerIterationMode derived_mode,
const RegisterMap* map, bool use_interpreter_oop_map_cache) const;
void oops_entry_do(OopClosure* f, const RegisterMap* map) const;
void oops_code_blob_do(OopClosure* f, CodeBlobClosure* cf,
DerivedOopClosure* df, DerivedPointerIterationMode derived_mode,
const RegisterMap* map) const;
public:
// Memory management
void oops_do(OopClosure* f, CodeBlobClosure* cf, const RegisterMap* map) {
#if COMPILER2_OR_JVMCI
DerivedPointerIterationMode dpim = DerivedPointerTable::is_active() ?
DerivedPointerIterationMode::_with_table :
DerivedPointerIterationMode::_ignore;
#else
DerivedPointerIterationMode dpim = DerivedPointerIterationMode::_ignore;;
#endif
oops_do_internal(f, cf, NULL, dpim, map, true);
}
void oops_do(OopClosure* f, CodeBlobClosure* cf, DerivedOopClosure* df, const RegisterMap* map) {
oops_do_internal(f, cf, df, DerivedPointerIterationMode::_ignore, map, true);
}
void oops_do(OopClosure* f, CodeBlobClosure* cf, const RegisterMap* map,
DerivedPointerIterationMode derived_mode) const {
oops_do_internal(f, cf, NULL, derived_mode, map, true);
}
void nmethods_do(CodeBlobClosure* cf) const;
// RedefineClasses support for finding live interpreted methods on the stack
void metadata_do(MetadataClosure* f) const;
// Verification
void verify(const RegisterMap* map) const;
static bool verify_return_pc(address x);
// Usage:
// assert(frame::verify_return_pc(return_address), "must be a return pc");
#include CPU_HEADER(frame)
};
#ifndef PRODUCT
// A simple class to describe a location on the stack
class FrameValue {
public:
intptr_t* location;
char* description;
int owner;
int priority;
FrameValue() {
location = NULL;
description = NULL;
owner = -1;
priority = 0;
}
};
// A collection of described stack values that can print a symbolic
// description of the stack memory. Interpreter frame values can be
// in the caller frames so all the values are collected first and then
// sorted before being printed.
class FrameValues {
private:
GrowableArray<FrameValue> _values;
static int compare(FrameValue* a, FrameValue* b) {
if (a->location == b->location) {
return a->priority - b->priority;
}
return a->location - b->location;
}
void print_on(outputStream* out, int min_index, int max_index, intptr_t* v0, intptr_t* v1,
bool on_heap = false);
public:
// Used by frame functions to describe locations.
void describe(int owner, intptr_t* location, const char* description, int priority = 0);
#ifdef ASSERT
void validate();
#endif
void print(JavaThread* thread) { print_on(thread, tty); }
void print_on(JavaThread* thread, outputStream* out);
void print(stackChunkOop chunk) { print_on(chunk, tty); }
void print_on(stackChunkOop chunk, outputStream* out);
};
#endif
#endif // SHARE_RUNTIME_FRAME_HPP
¤ Dauer der Verarbeitung: 0.24 Sekunden
(vorverarbeitet)
¤
|
schauen Sie vor die Tür
Fenster
Die Firma ist wie angegeben erreichbar.
Die farbliche Syntaxdarstellung ist noch experimentell.
|
