duke@435: /* never@2462: * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #ifndef SHARE_VM_OOPS_METHODOOP_HPP stefank@2314: #define SHARE_VM_OOPS_METHODOOP_HPP stefank@2314: stefank@2314: #include "classfile/vmSymbols.hpp" stefank@2314: #include "code/compressedStream.hpp" stefank@2314: #include "compiler/oopMap.hpp" stefank@2314: #include "interpreter/invocationCounter.hpp" stefank@2314: #include "oops/constMethodOop.hpp" stefank@2314: #include "oops/constantPoolOop.hpp" stefank@2314: #include "oops/instanceKlass.hpp" stefank@2314: #include "oops/oop.hpp" stefank@2314: #include "oops/typeArrayOop.hpp" stefank@2314: #include "utilities/accessFlags.hpp" stefank@2314: #include "utilities/growableArray.hpp" stefank@2314: duke@435: // A methodOop represents a Java method. duke@435: // duke@435: // Memory layout (each line represents a word). Note that most applications load thousands of methods, duke@435: // so keeping the size of this structure small has a big impact on footprint. duke@435: // duke@435: // We put all oops and method_size first for better gc cache locality. duke@435: // duke@435: // The actual bytecodes are inlined after the end of the methodOopDesc struct. duke@435: // duke@435: // There are bits in the access_flags telling whether inlined tables are present. duke@435: // Note that accessing the line number and local variable tables is not performance critical at all. duke@435: // Accessing the checked exceptions table is used by reflection, so we put that last to make access duke@435: // to it fast. duke@435: // duke@435: // The line number table is compressed and inlined following the byte codes. It is found as the first duke@435: // byte following the byte codes. The checked exceptions table and the local variable table are inlined duke@435: // after the line number table, and indexed from the end of the method. We do not compress the checked duke@435: // exceptions table since the average length is less than 2, and do not bother to compress the local duke@435: // variable table either since it is mostly absent. duke@435: // duke@435: // Note that native_function and signature_handler has to be at fixed offsets (required by the interpreter) duke@435: // duke@435: // |------------------------------------------------------| duke@435: // | header | duke@435: // | klass | duke@435: // |------------------------------------------------------| duke@435: // | constMethodOop (oop) | duke@435: // | constants (oop) | duke@435: // |------------------------------------------------------| duke@435: // | methodData (oop) | duke@435: // | interp_invocation_count | duke@435: // |------------------------------------------------------| duke@435: // | access_flags | duke@435: // | vtable_index | duke@435: // |------------------------------------------------------| duke@435: // | result_index (C++ interpreter only) | duke@435: // |------------------------------------------------------| duke@435: // | method_size | max_stack | duke@435: // | max_locals | size_of_parameters | duke@435: // |------------------------------------------------------| phh@3427: // |intrinsic_id| flags | throwout_count | duke@435: // |------------------------------------------------------| iveresov@2138: // | num_breakpoints | (unused) | duke@435: // |------------------------------------------------------| duke@435: // | invocation_counter | duke@435: // | backedge_counter | duke@435: // |------------------------------------------------------| iveresov@2630: // | prev_time (tiered only, 64 bit wide) | iveresov@2630: // | | iveresov@2630: // |------------------------------------------------------| iveresov@2630: // | rate (tiered) | iveresov@2630: // |------------------------------------------------------| duke@435: // | code (pointer) | duke@435: // | i2i (pointer) | duke@435: // | adapter (pointer) | duke@435: // | from_compiled_entry (pointer) | duke@435: // | from_interpreted_entry (pointer) | duke@435: // |------------------------------------------------------| duke@435: // | native_function (present only if native) | duke@435: // | signature_handler (present only if native) | duke@435: // |------------------------------------------------------| duke@435: duke@435: duke@435: class CheckedExceptionElement; duke@435: class LocalVariableTableElement; duke@435: class AdapterHandlerEntry; duke@435: class methodDataOopDesc; duke@435: duke@435: class methodOopDesc : public oopDesc { duke@435: friend class methodKlass; duke@435: friend class VMStructs; duke@435: private: duke@435: constMethodOop _constMethod; // Method read-only data. duke@435: constantPoolOop _constants; // Constant pool duke@435: methodDataOop _method_data; iveresov@2138: int _interpreter_invocation_count; // Count of times invoked (reused as prev_event_count in tiered) duke@435: AccessFlags _access_flags; // Access flags duke@435: int _vtable_index; // vtable index of this method (see VtableIndexFlag) duke@435: // note: can have vtables with >2**16 elements (because of inheritance) duke@435: #ifdef CC_INTERP duke@435: int _result_index; // C++ interpreter needs for converting results to/from stack duke@435: #endif duke@435: u2 _method_size; // size of this object duke@435: u2 _max_stack; // Maximum number of entries on the expression stack duke@435: u2 _max_locals; // Number of local variables used by this method duke@435: u2 _size_of_parameters; // size of the parameter block (receiver + arguments) in words jrose@1291: u1 _intrinsic_id; // vmSymbols::intrinsic_id (0 == _none) phh@3427: u1 _jfr_towrite : 1, // Flags phh@3427: : 7; duke@435: u2 _interpreter_throwout_count; // Count of times method was exited via exception while interpreting duke@435: u2 _number_of_breakpoints; // fullspeed debugging support duke@435: InvocationCounter _invocation_counter; // Incremented before each activation of the method - used to trigger frequency-based optimizations duke@435: InvocationCounter _backedge_counter; // Incremented before each backedge taken - used to trigger frequencey-based optimizations iveresov@2138: iveresov@2630: #ifdef TIERED iveresov@2630: jlong _prev_time; // Previous time the rate was acquired iveresov@2630: float _rate; // Events (invocation and backedge counter increments) per millisecond iveresov@2630: #endif iveresov@2630: duke@435: #ifndef PRODUCT duke@435: int _compiled_invocation_count; // Number of nmethod invocations so far (for perf. debugging) duke@435: #endif duke@435: // Entry point for calling both from and to the interpreter. duke@435: address _i2i_entry; // All-args-on-stack calling convention duke@435: // Adapter blob (i2c/c2i) for this methodOop. Set once when method is linked. duke@435: AdapterHandlerEntry* _adapter; duke@435: // Entry point for calling from compiled code, to compiled code if it exists duke@435: // or else the interpreter. duke@435: volatile address _from_compiled_entry; // Cache of: _code ? _code->entry_point() : _adapter->c2i_entry() duke@435: // The entry point for calling both from and to compiled code is duke@435: // "_code->entry_point()". Because of tiered compilation and de-opt, this duke@435: // field can come and go. It can transition from NULL to not-null at any duke@435: // time (whenever a compile completes). It can transition from not-null to duke@435: // NULL only at safepoints (because of a de-opt). duke@435: nmethod* volatile _code; // Points to the corresponding piece of native code duke@435: volatile address _from_interpreted_entry; // Cache of _code ? _adapter->i2c_entry() : _i2i_entry duke@435: duke@435: public: jmasa@953: duke@435: // accessors for instance variables duke@435: constMethodOop constMethod() const { return _constMethod; } duke@435: void set_constMethod(constMethodOop xconst) { oop_store_without_check((oop*)&_constMethod, (oop)xconst); } duke@435: duke@435: duke@435: static address make_adapters(methodHandle mh, TRAPS); duke@435: volatile address from_compiled_entry() const { return (address)OrderAccess::load_ptr_acquire(&_from_compiled_entry); } duke@435: volatile address from_interpreted_entry() const{ return (address)OrderAccess::load_ptr_acquire(&_from_interpreted_entry); } duke@435: duke@435: // access flag duke@435: AccessFlags access_flags() const { return _access_flags; } duke@435: void set_access_flags(AccessFlags flags) { _access_flags = flags; } duke@435: duke@435: // name coleenp@2497: Symbol* name() const { return _constants->symbol_at(name_index()); } duke@435: int name_index() const { return constMethod()->name_index(); } duke@435: void set_name_index(int index) { constMethod()->set_name_index(index); } duke@435: duke@435: // signature coleenp@2497: Symbol* signature() const { return _constants->symbol_at(signature_index()); } duke@435: int signature_index() const { return constMethod()->signature_index(); } duke@435: void set_signature_index(int index) { constMethod()->set_signature_index(index); } duke@435: duke@435: // generics support coleenp@2497: Symbol* generic_signature() const { int idx = generic_signature_index(); return ((idx != 0) ? _constants->symbol_at(idx) : (Symbol*)NULL); } duke@435: int generic_signature_index() const { return constMethod()->generic_signature_index(); } duke@435: void set_generic_signature_index(int index) { constMethod()->set_generic_signature_index(index); } duke@435: duke@435: // annotations support duke@435: typeArrayOop annotations() const { return instanceKlass::cast(method_holder())->get_method_annotations_of(method_idnum()); } duke@435: typeArrayOop parameter_annotations() const { return instanceKlass::cast(method_holder())->get_method_parameter_annotations_of(method_idnum()); } duke@435: typeArrayOop annotation_default() const { return instanceKlass::cast(method_holder())->get_method_default_annotations_of(method_idnum()); } duke@435: duke@435: #ifdef CC_INTERP duke@435: void set_result_index(BasicType type); duke@435: int result_index() { return _result_index; } duke@435: #endif duke@435: duke@435: // Helper routine: get klass name + "." + method name + signature as duke@435: // C string, for the purpose of providing more useful NoSuchMethodErrors duke@435: // and fatal error handling. The string is allocated in resource duke@435: // area if a buffer is not provided by the caller. duke@435: char* name_and_sig_as_C_string(); duke@435: char* name_and_sig_as_C_string(char* buf, int size); duke@435: duke@435: // Static routine in the situations we don't have a methodOop coleenp@2497: static char* name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature); coleenp@2497: static char* name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature, char* buf, int size); duke@435: never@2462: Bytecodes::Code java_code_at(int bci) const { never@2462: return Bytecodes::java_code_at(this, bcp_from(bci)); never@2462: } never@2462: Bytecodes::Code code_at(int bci) const { never@2462: return Bytecodes::code_at(this, bcp_from(bci)); never@2462: } never@2462: duke@435: // JVMTI breakpoints never@2462: Bytecodes::Code orig_bytecode_at(int bci) const; duke@435: void set_orig_bytecode_at(int bci, Bytecodes::Code code); duke@435: void set_breakpoint(int bci); duke@435: void clear_breakpoint(int bci); duke@435: void clear_all_breakpoints(); duke@435: // Tracking number of breakpoints, for fullspeed debugging. duke@435: // Only mutated by VM thread. duke@435: u2 number_of_breakpoints() const { return _number_of_breakpoints; } duke@435: void incr_number_of_breakpoints() { ++_number_of_breakpoints; } duke@435: void decr_number_of_breakpoints() { --_number_of_breakpoints; } duke@435: // Initialization only duke@435: void clear_number_of_breakpoints() { _number_of_breakpoints = 0; } duke@435: duke@435: // index into instanceKlass methods() array phh@3427: // note: also used by jfr duke@435: u2 method_idnum() const { return constMethod()->method_idnum(); } duke@435: void set_method_idnum(u2 idnum) { constMethod()->set_method_idnum(idnum); } duke@435: duke@435: // code size duke@435: int code_size() const { return constMethod()->code_size(); } duke@435: duke@435: // method size duke@435: int method_size() const { return _method_size; } duke@435: void set_method_size(int size) { duke@435: assert(0 <= size && size < (1 << 16), "invalid method size"); duke@435: _method_size = size; duke@435: } duke@435: duke@435: // constant pool for klassOop holding this method duke@435: constantPoolOop constants() const { return _constants; } duke@435: void set_constants(constantPoolOop c) { oop_store_without_check((oop*)&_constants, c); } duke@435: duke@435: // max stack duke@435: int max_stack() const { return _max_stack; } duke@435: void set_max_stack(int size) { _max_stack = size; } duke@435: duke@435: // max locals duke@435: int max_locals() const { return _max_locals; } duke@435: void set_max_locals(int size) { _max_locals = size; } iveresov@2138: iveresov@2138: int highest_comp_level() const; iveresov@2138: void set_highest_comp_level(int level); iveresov@2138: int highest_osr_comp_level() const; iveresov@2138: void set_highest_osr_comp_level(int level); duke@435: duke@435: // Count of times method was exited via exception while interpreting duke@435: void interpreter_throwout_increment() { duke@435: if (_interpreter_throwout_count < 65534) { duke@435: _interpreter_throwout_count++; duke@435: } duke@435: } duke@435: duke@435: int interpreter_throwout_count() const { return _interpreter_throwout_count; } duke@435: void set_interpreter_throwout_count(int count) { _interpreter_throwout_count = count; } duke@435: duke@435: // size of parameters duke@435: int size_of_parameters() const { return _size_of_parameters; } duke@435: duke@435: bool has_stackmap_table() const { duke@435: return constMethod()->has_stackmap_table(); duke@435: } duke@435: duke@435: typeArrayOop stackmap_data() const { duke@435: return constMethod()->stackmap_data(); duke@435: } duke@435: kamg@2232: void set_stackmap_data(typeArrayOop sd) { kamg@2232: constMethod()->set_stackmap_data(sd); kamg@2232: } kamg@2232: duke@435: // exception handler table duke@435: typeArrayOop exception_table() const duke@435: { return constMethod()->exception_table(); } duke@435: void set_exception_table(typeArrayOop e) duke@435: { constMethod()->set_exception_table(e); } duke@435: bool has_exception_handler() const duke@435: { return constMethod()->has_exception_handler(); } duke@435: duke@435: // Finds the first entry point bci of an exception handler for an duke@435: // exception of klass ex_klass thrown at throw_bci. A value of NULL duke@435: // for ex_klass indicates that the exception klass is not known; in duke@435: // this case it matches any constraint class. Returns -1 if the duke@435: // exception cannot be handled in this method. The handler duke@435: // constraint classes are loaded if necessary. Note that this may duke@435: // throw an exception if loading of the constraint classes causes duke@435: // an IllegalAccessError (bugid 4307310) or an OutOfMemoryError. duke@435: // If an exception is thrown, returns the bci of the duke@435: // exception handler which caused the exception to be thrown, which duke@435: // is needed for proper retries. See, for example, duke@435: // InterpreterRuntime::exception_handler_for_exception. duke@435: int fast_exception_handler_bci_for(KlassHandle ex_klass, int throw_bci, TRAPS); duke@435: duke@435: // method data access duke@435: methodDataOop method_data() const { duke@435: return _method_data; duke@435: } duke@435: void set_method_data(methodDataOop data) { duke@435: oop_store_without_check((oop*)&_method_data, (oop)data); duke@435: } duke@435: duke@435: // invocation counter iveresov@2138: InvocationCounter* invocation_counter() { return &_invocation_counter; } iveresov@2138: InvocationCounter* backedge_counter() { return &_backedge_counter; } iveresov@2138: iveresov@2630: #ifdef TIERED iveresov@2630: // We are reusing interpreter_invocation_count as a holder for the previous event count! iveresov@2630: // We can do that since interpreter_invocation_count is not used in tiered. iveresov@2630: int prev_event_count() const { return _interpreter_invocation_count; } iveresov@2630: void set_prev_event_count(int count) { _interpreter_invocation_count = count; } iveresov@2630: jlong prev_time() const { return _prev_time; } iveresov@2630: void set_prev_time(jlong time) { _prev_time = time; } iveresov@2630: float rate() const { return _rate; } iveresov@2630: void set_rate(float rate) { _rate = rate; } iveresov@2630: #endif iveresov@2630: iveresov@2138: int invocation_count(); iveresov@2138: int backedge_count(); iveresov@2138: iveresov@2138: bool was_executed_more_than(int n); iveresov@2138: bool was_never_executed() { return !was_executed_more_than(0); } duke@435: duke@435: static void build_interpreter_method_data(methodHandle method, TRAPS); duke@435: iveresov@2138: int interpreter_invocation_count() { iveresov@2138: if (TieredCompilation) return invocation_count(); iveresov@2138: else return _interpreter_invocation_count; iveresov@2138: } duke@435: void set_interpreter_invocation_count(int count) { _interpreter_invocation_count = count; } iveresov@2138: int increment_interpreter_invocation_count() { iveresov@2138: if (TieredCompilation) ShouldNotReachHere(); iveresov@2138: return ++_interpreter_invocation_count; iveresov@2138: } duke@435: duke@435: #ifndef PRODUCT iveresov@2138: int compiled_invocation_count() const { return _compiled_invocation_count; } duke@435: void set_compiled_invocation_count(int count) { _compiled_invocation_count = count; } duke@435: #endif // not PRODUCT duke@435: twisti@1040: // Clear (non-shared space) pointers which could not be relevant duke@435: // if this (shared) method were mapped into another JVM. duke@435: void remove_unshareable_info(); duke@435: duke@435: // nmethod/verified compiler entry duke@435: address verified_code_entry(); duke@435: bool check_code() const; // Not inline to avoid circular ref duke@435: nmethod* volatile code() const { assert( check_code(), "" ); return (nmethod *)OrderAccess::load_ptr_acquire(&_code); } duke@435: void clear_code(); // Clear out any compiled code kvn@1637: static void set_code(methodHandle mh, nmethod* code); duke@435: void set_adapter_entry(AdapterHandlerEntry* adapter) { _adapter = adapter; } duke@435: address get_i2c_entry(); duke@435: address get_c2i_entry(); duke@435: address get_c2i_unverified_entry(); duke@435: AdapterHandlerEntry* adapter() { return _adapter; } duke@435: // setup entry points duke@435: void link_method(methodHandle method, TRAPS); duke@435: // clear entry points. Used by sharing code duke@435: void unlink_method(); duke@435: duke@435: // vtable index duke@435: enum VtableIndexFlag { duke@435: // Valid vtable indexes are non-negative (>= 0). duke@435: // These few negative values are used as sentinels. jrose@1145: highest_unused_vtable_index_value = -5, duke@435: invalid_vtable_index = -4, // distinct from any valid vtable index duke@435: garbage_vtable_index = -3, // not yet linked; no vtable layout yet duke@435: nonvirtual_vtable_index = -2 // there is no need for vtable dispatch duke@435: // 6330203 Note: Do not use -1, which was overloaded with many meanings. duke@435: }; duke@435: DEBUG_ONLY(bool valid_vtable_index() const { return _vtable_index >= nonvirtual_vtable_index; }) duke@435: int vtable_index() const { assert(valid_vtable_index(), ""); duke@435: return _vtable_index; } duke@435: void set_vtable_index(int index) { _vtable_index = index; } duke@435: duke@435: // interpreter entry duke@435: address interpreter_entry() const { return _i2i_entry; } duke@435: // Only used when first initialize so we can set _i2i_entry and _from_interpreted_entry duke@435: void set_interpreter_entry(address entry) { _i2i_entry = entry; _from_interpreted_entry = entry; } duke@435: int interpreter_kind(void) { duke@435: return constMethod()->interpreter_kind(); duke@435: } duke@435: void set_interpreter_kind(); duke@435: void set_interpreter_kind(int kind) { duke@435: constMethod()->set_interpreter_kind(kind); duke@435: } duke@435: duke@435: // native function (used for native methods only) duke@435: enum { duke@435: native_bind_event_is_interesting = true duke@435: }; duke@435: address native_function() const { return *(native_function_addr()); } duke@435: // Must specify a real function (not NULL). duke@435: // Use clear_native_function() to unregister. duke@435: void set_native_function(address function, bool post_event_flag); duke@435: bool has_native_function() const; duke@435: void clear_native_function(); duke@435: duke@435: // signature handler (used for native methods only) duke@435: address signature_handler() const { return *(signature_handler_addr()); } duke@435: void set_signature_handler(address handler); duke@435: duke@435: // Interpreter oopmap support duke@435: void mask_for(int bci, InterpreterOopMap* mask); duke@435: duke@435: #ifndef PRODUCT duke@435: // operations on invocation counter iveresov@2138: void print_invocation_count(); duke@435: #endif duke@435: duke@435: // byte codes twisti@1573: void set_code(address code) { return constMethod()->set_code(code); } duke@435: address code_base() const { return constMethod()->code_base(); } duke@435: bool contains(address bcp) const { return constMethod()->contains(bcp); } duke@435: duke@435: // prints byte codes duke@435: void print_codes() const { print_codes_on(tty); } duke@435: void print_codes_on(outputStream* st) const PRODUCT_RETURN; duke@435: void print_codes_on(int from, int to, outputStream* st) const PRODUCT_RETURN; duke@435: duke@435: // checked exceptions duke@435: int checked_exceptions_length() const duke@435: { return constMethod()->checked_exceptions_length(); } duke@435: CheckedExceptionElement* checked_exceptions_start() const duke@435: { return constMethod()->checked_exceptions_start(); } duke@435: duke@435: // localvariable table duke@435: bool has_localvariable_table() const duke@435: { return constMethod()->has_localvariable_table(); } duke@435: int localvariable_table_length() const duke@435: { return constMethod()->localvariable_table_length(); } duke@435: LocalVariableTableElement* localvariable_table_start() const duke@435: { return constMethod()->localvariable_table_start(); } duke@435: duke@435: bool has_linenumber_table() const duke@435: { return constMethod()->has_linenumber_table(); } duke@435: u_char* compressed_linenumber_table() const duke@435: { return constMethod()->compressed_linenumber_table(); } duke@435: duke@435: // method holder (the klassOop holding this method) duke@435: klassOop method_holder() const { return _constants->pool_holder(); } duke@435: duke@435: void compute_size_of_parameters(Thread *thread); // word size of parameters (receiver if any + arguments) coleenp@2497: Symbol* klass_name() const; // returns the name of the method holder duke@435: BasicType result_type() const; // type of the method result duke@435: int result_type_index() const; // type index of the method result duke@435: bool is_returning_oop() const { BasicType r = result_type(); return (r == T_OBJECT || r == T_ARRAY); } duke@435: bool is_returning_fp() const { BasicType r = result_type(); return (r == T_FLOAT || r == T_DOUBLE); } duke@435: duke@435: // Checked exceptions thrown by this method (resolved to mirrors) duke@435: objArrayHandle resolved_checked_exceptions(TRAPS) { return resolved_checked_exceptions_impl(this, THREAD); } duke@435: duke@435: // Access flags duke@435: bool is_public() const { return access_flags().is_public(); } duke@435: bool is_private() const { return access_flags().is_private(); } duke@435: bool is_protected() const { return access_flags().is_protected(); } duke@435: bool is_package_private() const { return !is_public() && !is_private() && !is_protected(); } duke@435: bool is_static() const { return access_flags().is_static(); } duke@435: bool is_final() const { return access_flags().is_final(); } duke@435: bool is_synchronized() const { return access_flags().is_synchronized();} duke@435: bool is_native() const { return access_flags().is_native(); } duke@435: bool is_abstract() const { return access_flags().is_abstract(); } duke@435: bool is_strict() const { return access_flags().is_strict(); } duke@435: bool is_synthetic() const { return access_flags().is_synthetic(); } duke@435: duke@435: // returns true if contains only return operation duke@435: bool is_empty_method() const; duke@435: duke@435: // returns true if this is a vanilla constructor duke@435: bool is_vanilla_constructor() const; duke@435: duke@435: // checks method and its method holder duke@435: bool is_final_method() const; duke@435: bool is_strict_method() const; duke@435: duke@435: // true if method needs no dynamic dispatch (final and/or no vtable entry) duke@435: bool can_be_statically_bound() const; duke@435: duke@435: // returns true if the method has any backward branches. duke@435: bool has_loops() { duke@435: return access_flags().loops_flag_init() ? access_flags().has_loops() : compute_has_loops_flag(); duke@435: }; duke@435: duke@435: bool compute_has_loops_flag(); duke@435: duke@435: bool has_jsrs() { duke@435: return access_flags().has_jsrs(); duke@435: }; duke@435: void set_has_jsrs() { duke@435: _access_flags.set_has_jsrs(); duke@435: } duke@435: duke@435: // returns true if the method has any monitors. duke@435: bool has_monitors() const { return is_synchronized() || access_flags().has_monitor_bytecodes(); } duke@435: bool has_monitor_bytecodes() const { return access_flags().has_monitor_bytecodes(); } duke@435: duke@435: void set_has_monitor_bytecodes() { _access_flags.set_has_monitor_bytecodes(); } duke@435: duke@435: // monitor matching. This returns a conservative estimate of whether the monitorenter/monitorexit bytecodes duke@435: // propererly nest in the method. It might return false, even though they actually nest properly, since the info. duke@435: // has not been computed yet. duke@435: bool guaranteed_monitor_matching() const { return access_flags().is_monitor_matching(); } duke@435: void set_guaranteed_monitor_matching() { _access_flags.set_monitor_matching(); } duke@435: duke@435: // returns true if the method is an accessor function (setter/getter). duke@435: bool is_accessor() const; duke@435: duke@435: // returns true if the method is an initializer ( or ). duke@435: bool is_initializer() const; duke@435: kamg@2616: // returns true if the method is static OR if the classfile version < 51 kamg@2616: bool has_valid_initializer_flags() const; kamg@2616: kamg@2616: // returns true if the method name is and the method has kamg@2616: // valid static initializer flags. kamg@2616: bool is_static_initializer() const; kamg@2616: duke@435: // compiled code support duke@435: // NOTE: code() is inherently racy as deopt can be clearing code duke@435: // simultaneously. Use with caution. duke@435: bool has_compiled_code() const { return code() != NULL; } duke@435: duke@435: // sizing duke@435: static int object_size(bool is_native); duke@435: static int header_size() { return sizeof(methodOopDesc)/HeapWordSize; } duke@435: int object_size() const { return method_size(); } duke@435: duke@435: bool object_is_parsable() const { return method_size() > 0; } duke@435: duke@435: // interpreter support duke@435: static ByteSize const_offset() { return byte_offset_of(methodOopDesc, _constMethod ); } duke@435: static ByteSize constants_offset() { return byte_offset_of(methodOopDesc, _constants ); } duke@435: static ByteSize access_flags_offset() { return byte_offset_of(methodOopDesc, _access_flags ); } duke@435: #ifdef CC_INTERP duke@435: static ByteSize result_index_offset() { return byte_offset_of(methodOopDesc, _result_index ); } duke@435: #endif /* CC_INTERP */ duke@435: static ByteSize size_of_locals_offset() { return byte_offset_of(methodOopDesc, _max_locals ); } duke@435: static ByteSize size_of_parameters_offset() { return byte_offset_of(methodOopDesc, _size_of_parameters); } duke@435: static ByteSize from_compiled_offset() { return byte_offset_of(methodOopDesc, _from_compiled_entry); } duke@435: static ByteSize code_offset() { return byte_offset_of(methodOopDesc, _code); } duke@435: static ByteSize invocation_counter_offset() { return byte_offset_of(methodOopDesc, _invocation_counter); } duke@435: static ByteSize backedge_counter_offset() { return byte_offset_of(methodOopDesc, _backedge_counter); } duke@435: static ByteSize method_data_offset() { duke@435: return byte_offset_of(methodOopDesc, _method_data); duke@435: } duke@435: static ByteSize interpreter_invocation_counter_offset() { return byte_offset_of(methodOopDesc, _interpreter_invocation_count); } duke@435: #ifndef PRODUCT duke@435: static ByteSize compiled_invocation_counter_offset() { return byte_offset_of(methodOopDesc, _compiled_invocation_count); } duke@435: #endif // not PRODUCT duke@435: static ByteSize native_function_offset() { return in_ByteSize(sizeof(methodOopDesc)); } duke@435: static ByteSize from_interpreted_offset() { return byte_offset_of(methodOopDesc, _from_interpreted_entry ); } duke@435: static ByteSize interpreter_entry_offset() { return byte_offset_of(methodOopDesc, _i2i_entry ); } duke@435: static ByteSize signature_handler_offset() { return in_ByteSize(sizeof(methodOopDesc) + wordSize); } duke@435: static ByteSize max_stack_offset() { return byte_offset_of(methodOopDesc, _max_stack ); } duke@435: duke@435: // for code generation duke@435: static int method_data_offset_in_bytes() { return offset_of(methodOopDesc, _method_data); } duke@435: static int interpreter_invocation_counter_offset_in_bytes() duke@435: { return offset_of(methodOopDesc, _interpreter_invocation_count); } jrose@2148: static int intrinsic_id_offset_in_bytes() { return offset_of(methodOopDesc, _intrinsic_id); } jrose@2148: static int intrinsic_id_size_in_bytes() { return sizeof(u1); } duke@435: duke@435: // Static methods that are used to implement member methods where an exposed this pointer duke@435: // is needed due to possible GCs duke@435: static objArrayHandle resolved_checked_exceptions_impl(methodOop this_oop, TRAPS); duke@435: duke@435: // Returns the byte code index from the byte code pointer duke@435: int bci_from(address bcp) const; duke@435: address bcp_from(int bci) const; duke@435: int validate_bci_from_bcx(intptr_t bcx) const; duke@435: duke@435: // Returns the line number for a bci if debugging information for the method is prowided, duke@435: // -1 is returned otherwise. duke@435: int line_number_from_bci(int bci) const; duke@435: duke@435: // Reflection support duke@435: bool is_overridden_in(klassOop k) const; duke@435: jrose@1145: // JSR 292 support jrose@1145: bool is_method_handle_invoke() const { return access_flags().is_method_handle_invoke(); } jrose@1862: static bool is_method_handle_invoke_name(vmSymbols::SID name_sid); coleenp@2497: static bool is_method_handle_invoke_name(Symbol* name) { jrose@1862: return is_method_handle_invoke_name(vmSymbols::find_sid(name)); jrose@1862: } twisti@1587: // Tests if this method is an internal adapter frame from the twisti@1587: // MethodHandleCompiler. twisti@1587: bool is_method_handle_adapter() const; jrose@1145: static methodHandle make_invoke_method(KlassHandle holder, coleenp@2497: Symbol* name, //invokeExact or invokeGeneric coleenp@2497: Symbol* signature, //anything at all jrose@1145: Handle method_type, jrose@1145: TRAPS); jrose@2982: static klassOop check_non_bcp_klass(klassOop klass); jrose@1145: // these operate only on invoke methods: jrose@1145: oop method_handle_type() const; jrose@1145: static jint* method_type_offsets_chain(); // series of pointer-offsets, terminated by -1 jrose@1145: // presize interpreter frames for extra interpreter stack entries, if needed jrose@1161: // method handles want to be able to push a few extra values (e.g., a bound receiver), and jrose@1161: // invokedynamic sometimes needs to push a bootstrap method, call site, and arglist, jrose@1161: // all without checking for a stack overflow twisti@2698: static int extra_stack_entries() { return EnableInvokeDynamic ? (int) MethodHandlePushLimit + 3 : 0; } jrose@1145: static int extra_stack_words(); // = extra_stack_entries() * Interpreter::stackElementSize() twisti@1587: duke@435: // RedefineClasses() support: duke@435: bool is_old() const { return access_flags().is_old(); } duke@435: void set_is_old() { _access_flags.set_is_old(); } duke@435: bool is_obsolete() const { return access_flags().is_obsolete(); } duke@435: void set_is_obsolete() { _access_flags.set_is_obsolete(); } dcubed@483: // see the definition in methodOop.cpp for the gory details dcubed@483: bool should_not_be_cached() const; duke@435: duke@435: // JVMTI Native method prefixing support: duke@435: bool is_prefixed_native() const { return access_flags().is_prefixed_native(); } duke@435: void set_is_prefixed_native() { _access_flags.set_is_prefixed_native(); } duke@435: duke@435: // Rewriting support duke@435: static methodHandle clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length, duke@435: u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS); duke@435: duke@435: // Get this method's jmethodID -- allocate if it doesn't exist duke@435: jmethodID jmethod_id() { methodHandle this_h(this); dcubed@1412: return instanceKlass::get_jmethod_id(method_holder(), this_h); } duke@435: duke@435: // Lookup the jmethodID for this method. Return NULL if not found. duke@435: // NOTE that this function can be called from a signal handler duke@435: // (see AsyncGetCallTrace support for Forte Analyzer) and this duke@435: // needs to be async-safe. No allocation should be done and duke@435: // so handles are not used to avoid deadlock. duke@435: jmethodID find_jmethod_id_or_null() { return instanceKlass::cast(method_holder())->jmethod_id_or_null(this); } duke@435: duke@435: // JNI static invoke cached itable index accessors duke@435: int cached_itable_index() { return instanceKlass::cast(method_holder())->cached_itable_index(method_idnum()); } duke@435: void set_cached_itable_index(int index) { instanceKlass::cast(method_holder())->set_cached_itable_index(method_idnum(), index); } duke@435: duke@435: // Support for inlining of intrinsic methods jrose@1291: vmIntrinsics::ID intrinsic_id() const { return (vmIntrinsics::ID) _intrinsic_id; } jrose@1291: void set_intrinsic_id(vmIntrinsics::ID id) { _intrinsic_id = (u1) id; } jrose@1291: jrose@1291: // Helper routines for intrinsic_id() and vmIntrinsics::method(). jrose@1291: void init_intrinsic_id(); // updates from _none if a match jrose@1291: static vmSymbols::SID klass_id_for_intrinsics(klassOop holder); duke@435: phh@3427: bool jfr_towrite() { return _jfr_towrite; } phh@3427: void set_jfr_towrite(bool towrite) { _jfr_towrite = towrite; } phh@3427: duke@435: // On-stack replacement support iveresov@2138: bool has_osr_nmethod(int level, bool match_level) { iveresov@2138: return instanceKlass::cast(method_holder())->lookup_osr_nmethod(this, InvocationEntryBci, level, match_level) != NULL; iveresov@2138: } iveresov@2138: iveresov@2138: nmethod* lookup_osr_nmethod_for(int bci, int level, bool match_level) { iveresov@2138: return instanceKlass::cast(method_holder())->lookup_osr_nmethod(this, bci, level, match_level); iveresov@2138: } duke@435: duke@435: // Inline cache support duke@435: void cleanup_inline_caches(); duke@435: duke@435: // Find if klass for method is loaded duke@435: bool is_klass_loaded_by_klass_index(int klass_index) const; duke@435: bool is_klass_loaded(int refinfo_index, bool must_be_resolved = false) const; duke@435: duke@435: // Indicates whether compilation failed earlier for this method, or duke@435: // whether it is not compilable for another reason like having a duke@435: // breakpoint set in it. iveresov@2138: bool is_not_compilable(int comp_level = CompLevel_any) const; iveresov@2138: void set_not_compilable(int comp_level = CompLevel_all, bool report = true); iveresov@2138: void set_not_compilable_quietly(int comp_level = CompLevel_all) { kvn@1643: set_not_compilable(comp_level, false); kvn@1643: } iveresov@2138: bool is_not_osr_compilable(int comp_level = CompLevel_any) const { iveresov@2138: return is_not_compilable(comp_level) || access_flags().is_not_osr_compilable(); iveresov@2138: } iveresov@2138: void set_not_osr_compilable() { _access_flags.set_not_osr_compilable(); } iveresov@2138: bool is_not_c1_compilable() const { return access_flags().is_not_c1_compilable(); } iveresov@2138: void set_not_c1_compilable() { _access_flags.set_not_c1_compilable(); } iveresov@2138: bool is_not_c2_compilable() const { return access_flags().is_not_c2_compilable(); } iveresov@2138: void set_not_c2_compilable() { _access_flags.set_not_c2_compilable(); } duke@435: duke@435: // Background compilation support iveresov@2138: bool queued_for_compilation() const { return access_flags().queued_for_compilation(); } iveresov@2138: void set_queued_for_compilation() { _access_flags.set_queued_for_compilation(); } iveresov@2138: void clear_queued_for_compilation() { _access_flags.clear_queued_for_compilation(); } duke@435: duke@435: // Resolve all classes in signature, return 'true' if successful duke@435: static bool load_signature_classes(methodHandle m, TRAPS); duke@435: duke@435: // Return if true if not all classes references in signature, including return type, has been loaded duke@435: static bool has_unloaded_classes_in_signature(methodHandle m, TRAPS); duke@435: duke@435: // Printing duke@435: void print_short_name(outputStream* st) /*PRODUCT_RETURN*/; // prints as klassname::methodname; Exposed so field engineers can debug VM duke@435: void print_name(outputStream* st) PRODUCT_RETURN; // prints as "virtual void foo(int)" duke@435: duke@435: // Helper routine used for method sorting duke@435: static void sort_methods(objArrayOop methods, duke@435: objArrayOop methods_annotations, duke@435: objArrayOop methods_parameter_annotations, duke@435: objArrayOop methods_default_annotations, duke@435: bool idempotent = false); duke@435: duke@435: // size of parameters duke@435: void set_size_of_parameters(int size) { _size_of_parameters = size; } duke@435: private: duke@435: duke@435: // Inlined elements duke@435: address* native_function_addr() const { assert(is_native(), "must be native"); return (address*) (this+1); } duke@435: address* signature_handler_addr() const { return native_function_addr() + 1; } duke@435: duke@435: // Garbage collection support duke@435: oop* adr_constMethod() const { return (oop*)&_constMethod; } duke@435: oop* adr_constants() const { return (oop*)&_constants; } duke@435: oop* adr_method_data() const { return (oop*)&_method_data; } duke@435: }; duke@435: duke@435: duke@435: // Utility class for compressing line number tables duke@435: duke@435: class CompressedLineNumberWriteStream: public CompressedWriteStream { duke@435: private: duke@435: int _bci; duke@435: int _line; duke@435: public: duke@435: // Constructor duke@435: CompressedLineNumberWriteStream(int initial_size) : CompressedWriteStream(initial_size), _bci(0), _line(0) {} duke@435: CompressedLineNumberWriteStream(u_char* buffer, int initial_size) : CompressedWriteStream(buffer, initial_size), _bci(0), _line(0) {} duke@435: duke@435: // Write (bci, line number) pair to stream duke@435: void write_pair_regular(int bci_delta, int line_delta); duke@435: duke@435: inline void write_pair_inline(int bci, int line) { duke@435: int bci_delta = bci - _bci; duke@435: int line_delta = line - _line; duke@435: _bci = bci; duke@435: _line = line; duke@435: // Skip (0,0) deltas - they do not add information and conflict with terminator. duke@435: if (bci_delta == 0 && line_delta == 0) return; duke@435: // Check if bci is 5-bit and line number 3-bit unsigned. duke@435: if (((bci_delta & ~0x1F) == 0) && ((line_delta & ~0x7) == 0)) { duke@435: // Compress into single byte. duke@435: jubyte value = ((jubyte) bci_delta << 3) | (jubyte) line_delta; duke@435: // Check that value doesn't match escape character. duke@435: if (value != 0xFF) { duke@435: write_byte(value); duke@435: return; duke@435: } duke@435: } duke@435: write_pair_regular(bci_delta, line_delta); duke@435: } duke@435: duke@435: // Windows AMD64 + Apr 2005 PSDK with /O2 generates bad code for write_pair. duke@435: // Disabling optimization doesn't work for methods in header files duke@435: // so we force it to call through the non-optimized version in the .cpp. duke@435: // It's gross, but it's the only way we can ensure that all callers are sla@2540: // fixed. _MSC_VER is defined by the windows compiler sla@2540: #if defined(_M_AMD64) && _MSC_VER >= 1400 duke@435: void write_pair(int bci, int line); duke@435: #else duke@435: void write_pair(int bci, int line) { write_pair_inline(bci, line); } duke@435: #endif duke@435: duke@435: // Write end-of-stream marker duke@435: void write_terminator() { write_byte(0); } duke@435: }; duke@435: duke@435: duke@435: // Utility class for decompressing line number tables duke@435: duke@435: class CompressedLineNumberReadStream: public CompressedReadStream { duke@435: private: duke@435: int _bci; duke@435: int _line; duke@435: public: duke@435: // Constructor duke@435: CompressedLineNumberReadStream(u_char* buffer); duke@435: // Read (bci, line number) pair from stream. Returns false at end-of-stream. duke@435: bool read_pair(); duke@435: // Accessing bci and line number (after calling read_pair) duke@435: int bci() const { return _bci; } duke@435: int line() const { return _line; } duke@435: }; duke@435: duke@435: duke@435: /// Fast Breakpoints. duke@435: duke@435: // If this structure gets more complicated (because bpts get numerous), duke@435: // move it into its own header. duke@435: duke@435: // There is presently no provision for concurrent access duke@435: // to breakpoint lists, which is only OK for JVMTI because duke@435: // breakpoints are written only at safepoints, and are read duke@435: // concurrently only outside of safepoints. duke@435: duke@435: class BreakpointInfo : public CHeapObj { duke@435: friend class VMStructs; duke@435: private: duke@435: Bytecodes::Code _orig_bytecode; duke@435: int _bci; duke@435: u2 _name_index; // of method duke@435: u2 _signature_index; // of method duke@435: BreakpointInfo* _next; // simple storage allocation duke@435: duke@435: public: duke@435: BreakpointInfo(methodOop m, int bci); duke@435: duke@435: // accessors duke@435: Bytecodes::Code orig_bytecode() { return _orig_bytecode; } duke@435: void set_orig_bytecode(Bytecodes::Code code) { _orig_bytecode = code; } duke@435: int bci() { return _bci; } duke@435: duke@435: BreakpointInfo* next() const { return _next; } duke@435: void set_next(BreakpointInfo* n) { _next = n; } duke@435: duke@435: // helps for searchers never@2462: bool match(const methodOopDesc* m, int bci) { duke@435: return bci == _bci && match(m); duke@435: } duke@435: never@2462: bool match(const methodOopDesc* m) { duke@435: return _name_index == m->name_index() && duke@435: _signature_index == m->signature_index(); duke@435: } duke@435: duke@435: void set(methodOop method); duke@435: void clear(methodOop method); duke@435: }; stefank@2314: stefank@2314: #endif // SHARE_VM_OOPS_METHODOOP_HPP