duke@435: /* coleenp@6316: * Copyright (c) 1997, 2014, 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_KLASS_HPP stefank@2314: #define SHARE_VM_OOPS_KLASS_HPP stefank@2314: stefank@2314: #include "memory/genOopClosures.hpp" stefank@2314: #include "memory/iterator.hpp" stefank@2314: #include "memory/memRegion.hpp" stefank@2314: #include "memory/specialized_oop_closures.hpp" stefank@2314: #include "oops/klassPS.hpp" coleenp@4037: #include "oops/metadata.hpp" stefank@2314: #include "oops/oop.hpp" phh@3427: #include "trace/traceMacros.hpp" stefank@2314: #include "utilities/accessFlags.hpp" jprovino@4542: #include "utilities/macros.hpp" jprovino@4542: #if INCLUDE_ALL_GCS stefank@2314: #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.hpp" stefank@2314: #include "gc_implementation/g1/g1OopClosures.hpp" stefank@2314: #include "gc_implementation/parNew/parOopClosures.hpp" jprovino@4542: #endif // INCLUDE_ALL_GCS stefank@2314: coleenp@4037: // coleenp@4037: // A Klass provides: duke@435: // 1: language level class object (method dictionary etc.) duke@435: // 2: provide vm dispatch behavior for the object coleenp@4037: // Both functions are combined into one C++ class. duke@435: duke@435: // One reason for the oop/klass dichotomy in the implementation is duke@435: // that we don't want a C++ vtbl pointer in every object. Thus, duke@435: // normal oops don't have any virtual functions. Instead, they duke@435: // forward all "virtual" functions to their klass, which does have duke@435: // a vtbl and does the C++ dispatch depending on the object's duke@435: // actual type. (See oop.inline.hpp for some of the forwarding code.) duke@435: // ALL FUNCTIONS IMPLEMENTING THIS DISPATCH ARE PREFIXED WITH "oop_"! duke@435: duke@435: // Klass layout: coleenp@4037: // [C++ vtbl ptr ] (contained in Metadata) duke@435: // [layout_helper ] duke@435: // [super_check_offset ] for fast subtype checks coleenp@4037: // [name ] duke@435: // [secondary_super_cache] for fast subtype checks duke@435: // [secondary_supers ] array of 2ndary supertypes duke@435: // [primary_supers 0] duke@435: // [primary_supers 1] duke@435: // [primary_supers 2] duke@435: // ... duke@435: // [primary_supers 7] duke@435: // [java_mirror ] duke@435: // [super ] coleenp@4037: // [subklass ] first subclass duke@435: // [next_sibling ] link to chain additional subklasses coleenp@4037: // [next_link ] coleenp@4037: // [class_loader_data] duke@435: // [modifier_flags] duke@435: // [access_flags ] duke@435: // [last_biased_lock_bulk_revocation_time] (64 bits) duke@435: // [prototype_header] duke@435: // [biased_lock_revocation_count] coleenp@4037: // [_modified_oops] coleenp@4037: // [_accumulated_modified_oops] phh@3427: // [trace_id] duke@435: duke@435: duke@435: // Forward declarations. coleenp@4037: template class Array; coleenp@4037: template class GrowableArray; coleenp@4037: class ClassLoaderData; duke@435: class klassVtable; coleenp@4037: class ParCompactionManager; acorn@4497: class KlassSizeStats; duke@435: coleenp@4037: class Klass : public Metadata { duke@435: friend class VMStructs; duke@435: protected: duke@435: // note: put frequently-used fields together at start of klass structure duke@435: // for better cache behavior (may not make much of a difference but sure won't hurt) duke@435: enum { _primary_super_limit = 8 }; duke@435: duke@435: // The "layout helper" is a combined descriptor of object layout. duke@435: // For klasses which are neither instance nor array, the value is zero. duke@435: // duke@435: // For instances, layout helper is a positive number, the instance size. duke@435: // This size is already passed through align_object_size and scaled to bytes. duke@435: // The low order bit is set if instances of this class cannot be duke@435: // allocated using the fastpath. duke@435: // duke@435: // For arrays, layout helper is a negative number, containing four duke@435: // distinct bytes, as follows: duke@435: // MSB:[tag, hsz, ebt, log2(esz)]:LSB duke@435: // where: duke@435: // tag is 0x80 if the elements are oops, 0xC0 if non-oops duke@435: // hsz is array header size in bytes (i.e., offset of first element) duke@435: // ebt is the BasicType of the elements duke@435: // esz is the element size in bytes duke@435: // This packed word is arranged so as to be quickly unpacked by the duke@435: // various fast paths that use the various subfields. duke@435: // duke@435: // The esz bits can be used directly by a SLL instruction, without masking. duke@435: // duke@435: // Note that the array-kind tag looks like 0x00 for instance klasses, duke@435: // since their length in bytes is always less than 24Mb. duke@435: // coleenp@4037: // Final note: This comes first, immediately after C++ vtable, duke@435: // because it is frequently queried. duke@435: jint _layout_helper; duke@435: duke@435: // The fields _super_check_offset, _secondary_super_cache, _secondary_supers duke@435: // and _primary_supers all help make fast subtype checks. See big discussion duke@435: // in doc/server_compiler/checktype.txt duke@435: // duke@435: // Where to look to observe a supertype (it is &_secondary_super_cache for duke@435: // secondary supers, else is &_primary_supers[depth()]. duke@435: juint _super_check_offset; duke@435: coleenp@2497: // Class name. Instance classes: java/lang/String, etc. Array classes: [I, coleenp@2497: // [Ljava/lang/String;, etc. Set to zero for all other kinds of classes. coleenp@2497: Symbol* _name; coleenp@2497: duke@435: // Cache of last observed secondary supertype coleenp@4037: Klass* _secondary_super_cache; duke@435: // Array of all secondary supertypes coleenp@4037: Array* _secondary_supers; duke@435: // Ordered list of all primary supertypes coleenp@4037: Klass* _primary_supers[_primary_super_limit]; duke@435: // java/lang/Class instance mirroring this class duke@435: oop _java_mirror; duke@435: // Superclass coleenp@4037: Klass* _super; duke@435: // First subclass (NULL if none); _subklass->next_sibling() is next one coleenp@4037: Klass* _subklass; duke@435: // Sibling link (or NULL); links all subklasses of a klass coleenp@4037: Klass* _next_sibling; duke@435: coleenp@4037: // All klasses loaded by a class loader are chained through these links coleenp@4037: Klass* _next_link; coleenp@4037: coleenp@4037: // The VM's representation of the ClassLoader used to load this class. coleenp@4037: // Provide access the corresponding instance java.lang.ClassLoader. coleenp@4037: ClassLoaderData* _class_loader_data; duke@435: duke@435: jint _modifier_flags; // Processed access flags, for use by Class.getModifiers. duke@435: AccessFlags _access_flags; // Access flags. The class/interface distinction is stored here. duke@435: iklam@4509: // Biased locking implementation and statistics iklam@4509: // (the 64-bit chunk goes first, to avoid some fragmentation) iklam@4509: jlong _last_biased_lock_bulk_revocation_time; iklam@4509: markOop _prototype_header; // Used when biased locking is both enabled and disabled for this type iklam@4509: jint _biased_lock_revocation_count; iklam@4509: phh@3427: TRACE_DEFINE_KLASS_TRACE_ID; duke@435: coleenp@4037: // Remembered sets support for the oops in the klasses. coleenp@4037: jbyte _modified_oops; // Card Table Equivalent (YC/CMS support) coleenp@4037: jbyte _accumulated_modified_oops; // Mod Union Equivalent (CMS support) coleenp@4037: coleenp@4037: // Constructor coleenp@4037: Klass(); coleenp@4037: coleenp@5614: void* operator new(size_t size, ClassLoaderData* loader_data, size_t word_size, TRAPS) throw(); duke@435: duke@435: public: lfoltan@6632: enum MethodLookupMode { normal, skip_overpass, skip_defaults }; lfoltan@6632: coleenp@4037: bool is_klass() const volatile { return true; } duke@435: duke@435: // super coleenp@4037: Klass* super() const { return _super; } coleenp@4037: void set_super(Klass* k) { _super = k; } duke@435: duke@435: // initializes _super link, _primary_supers & _secondary_supers arrays coleenp@4037: void initialize_supers(Klass* k, TRAPS); coleenp@4037: void initialize_supers_impl1(Klass* k); coleenp@4037: void initialize_supers_impl2(Klass* k); duke@435: duke@435: // klass-specific helper for initializing _secondary_supers coleenp@4037: virtual GrowableArray* compute_secondary_supers(int num_extra_slots); duke@435: duke@435: // java_super is the Java-level super type as specified by Class.getSuperClass. coleenp@4037: virtual Klass* java_super() const { return NULL; } duke@435: duke@435: juint super_check_offset() const { return _super_check_offset; } duke@435: void set_super_check_offset(juint o) { _super_check_offset = o; } duke@435: coleenp@4037: Klass* secondary_super_cache() const { return _secondary_super_cache; } coleenp@4037: void set_secondary_super_cache(Klass* k) { _secondary_super_cache = k; } duke@435: coleenp@4037: Array* secondary_supers() const { return _secondary_supers; } coleenp@4037: void set_secondary_supers(Array* k) { _secondary_supers = k; } duke@435: duke@435: // Return the element of the _super chain of the given depth. duke@435: // If there is no such element, return either NULL or this. coleenp@4037: Klass* primary_super_of_depth(juint i) const { duke@435: assert(i < primary_super_limit(), "oob"); coleenp@4037: Klass* super = _primary_supers[i]; coleenp@4037: assert(super == NULL || super->super_depth() == i, "correct display"); duke@435: return super; duke@435: } duke@435: duke@435: // Can this klass be a primary super? False for interfaces and arrays of duke@435: // interfaces. False also for arrays or classes with long super chains. duke@435: bool can_be_primary_super() const { stefank@3391: const juint secondary_offset = in_bytes(secondary_super_cache_offset()); duke@435: return super_check_offset() != secondary_offset; duke@435: } duke@435: virtual bool can_be_primary_super_slow() const; duke@435: duke@435: // Returns number of primary supers; may be a number in the inclusive range [0, primary_super_limit]. duke@435: juint super_depth() const { duke@435: if (!can_be_primary_super()) { duke@435: return primary_super_limit(); duke@435: } else { coleenp@4037: juint d = (super_check_offset() - in_bytes(primary_supers_offset())) / sizeof(Klass*); duke@435: assert(d < primary_super_limit(), "oob"); coleenp@4037: assert(_primary_supers[d] == this, "proper init"); duke@435: return d; duke@435: } duke@435: } duke@435: coleenp@4037: // store an oop into a field of a Klass coleenp@4037: void klass_oop_store(oop* p, oop v); coleenp@4037: void klass_oop_store(volatile oop* p, oop v); coleenp@4037: duke@435: // java mirror duke@435: oop java_mirror() const { return _java_mirror; } coleenp@4037: void set_java_mirror(oop m) { klass_oop_store(&_java_mirror, m); } duke@435: duke@435: // modifier flags duke@435: jint modifier_flags() const { return _modifier_flags; } duke@435: void set_modifier_flags(jint flags) { _modifier_flags = flags; } duke@435: duke@435: // size helper duke@435: int layout_helper() const { return _layout_helper; } duke@435: void set_layout_helper(int lh) { _layout_helper = lh; } duke@435: duke@435: // Note: for instances layout_helper() may include padding. coleenp@4037: // Use InstanceKlass::contains_field_offset to classify field offsets. duke@435: duke@435: // sub/superklass links coleenp@4037: InstanceKlass* superklass() const; duke@435: Klass* subklass() const; duke@435: Klass* next_sibling() const; duke@435: void append_to_sibling_list(); // add newly created receiver to superklass' subklass list coleenp@4037: coleenp@4037: void set_next_link(Klass* k) { _next_link = k; } coleenp@4037: Klass* next_link() const { return _next_link; } // The next klass defined by the class loader. coleenp@4037: coleenp@4037: // class loader data coleenp@4037: ClassLoaderData* class_loader_data() const { return _class_loader_data; } coleenp@4037: void set_class_loader_data(ClassLoaderData* loader_data) { _class_loader_data = loader_data; } coleenp@4037: coleenp@4037: // The Klasses are not placed in the Heap, so the Card Table or coleenp@4037: // the Mod Union Table can't be used to mark when klasses have modified oops. coleenp@4037: // The CT and MUT bits saves this information for the individual Klasses. coleenp@4037: void record_modified_oops() { _modified_oops = 1; } coleenp@4037: void clear_modified_oops() { _modified_oops = 0; } coleenp@4037: bool has_modified_oops() { return _modified_oops == 1; } coleenp@4037: coleenp@4037: void accumulate_modified_oops() { if (has_modified_oops()) _accumulated_modified_oops = 1; } coleenp@4037: void clear_accumulated_modified_oops() { _accumulated_modified_oops = 0; } coleenp@4037: bool has_accumulated_modified_oops() { return _accumulated_modified_oops == 1; } coleenp@4037: duke@435: protected: // internal accessors coleenp@4037: Klass* subklass_oop() const { return _subklass; } coleenp@4037: Klass* next_sibling_oop() const { return _next_sibling; } coleenp@4037: void set_subklass(Klass* s); coleenp@4037: void set_next_sibling(Klass* s); duke@435: duke@435: public: duke@435: duke@435: // Compiler support coleenp@4037: static ByteSize super_offset() { return in_ByteSize(offset_of(Klass, _super)); } coleenp@4037: static ByteSize super_check_offset_offset() { return in_ByteSize(offset_of(Klass, _super_check_offset)); } coleenp@4037: static ByteSize primary_supers_offset() { return in_ByteSize(offset_of(Klass, _primary_supers)); } coleenp@4037: static ByteSize secondary_super_cache_offset() { return in_ByteSize(offset_of(Klass, _secondary_super_cache)); } coleenp@4037: static ByteSize secondary_supers_offset() { return in_ByteSize(offset_of(Klass, _secondary_supers)); } coleenp@4037: static ByteSize java_mirror_offset() { return in_ByteSize(offset_of(Klass, _java_mirror)); } coleenp@4037: static ByteSize modifier_flags_offset() { return in_ByteSize(offset_of(Klass, _modifier_flags)); } coleenp@4037: static ByteSize layout_helper_offset() { return in_ByteSize(offset_of(Klass, _layout_helper)); } coleenp@4037: static ByteSize access_flags_offset() { return in_ByteSize(offset_of(Klass, _access_flags)); } duke@435: duke@435: // Unpacking layout_helper: duke@435: enum { duke@435: _lh_neutral_value = 0, // neutral non-array non-instance value duke@435: _lh_instance_slow_path_bit = 0x01, duke@435: _lh_log2_element_size_shift = BitsPerByte*0, duke@435: _lh_log2_element_size_mask = BitsPerLong-1, duke@435: _lh_element_type_shift = BitsPerByte*1, duke@435: _lh_element_type_mask = right_n_bits(BitsPerByte), // shifted mask duke@435: _lh_header_size_shift = BitsPerByte*2, duke@435: _lh_header_size_mask = right_n_bits(BitsPerByte), // shifted mask duke@435: _lh_array_tag_bits = 2, duke@435: _lh_array_tag_shift = BitsPerInt - _lh_array_tag_bits, duke@435: _lh_array_tag_type_value = ~0x00, // 0xC0000000 >> 30 duke@435: _lh_array_tag_obj_value = ~0x01 // 0x80000000 >> 30 duke@435: }; duke@435: duke@435: static int layout_helper_size_in_bytes(jint lh) { duke@435: assert(lh > (jint)_lh_neutral_value, "must be instance"); duke@435: return (int) lh & ~_lh_instance_slow_path_bit; duke@435: } duke@435: static bool layout_helper_needs_slow_path(jint lh) { duke@435: assert(lh > (jint)_lh_neutral_value, "must be instance"); duke@435: return (lh & _lh_instance_slow_path_bit) != 0; duke@435: } duke@435: static bool layout_helper_is_instance(jint lh) { duke@435: return (jint)lh > (jint)_lh_neutral_value; duke@435: } coleenp@4037: static bool layout_helper_is_array(jint lh) { duke@435: return (jint)lh < (jint)_lh_neutral_value; duke@435: } duke@435: static bool layout_helper_is_typeArray(jint lh) { duke@435: // _lh_array_tag_type_value == (lh >> _lh_array_tag_shift); duke@435: return (juint)lh >= (juint)(_lh_array_tag_type_value << _lh_array_tag_shift); duke@435: } duke@435: static bool layout_helper_is_objArray(jint lh) { duke@435: // _lh_array_tag_obj_value == (lh >> _lh_array_tag_shift); duke@435: return (jint)lh < (jint)(_lh_array_tag_type_value << _lh_array_tag_shift); duke@435: } duke@435: static int layout_helper_header_size(jint lh) { duke@435: assert(lh < (jint)_lh_neutral_value, "must be array"); duke@435: int hsize = (lh >> _lh_header_size_shift) & _lh_header_size_mask; duke@435: assert(hsize > 0 && hsize < (int)sizeof(oopDesc)*3, "sanity"); duke@435: return hsize; duke@435: } duke@435: static BasicType layout_helper_element_type(jint lh) { duke@435: assert(lh < (jint)_lh_neutral_value, "must be array"); duke@435: int btvalue = (lh >> _lh_element_type_shift) & _lh_element_type_mask; duke@435: assert(btvalue >= T_BOOLEAN && btvalue <= T_OBJECT, "sanity"); duke@435: return (BasicType) btvalue; duke@435: } duke@435: static int layout_helper_log2_element_size(jint lh) { duke@435: assert(lh < (jint)_lh_neutral_value, "must be array"); duke@435: int l2esz = (lh >> _lh_log2_element_size_shift) & _lh_log2_element_size_mask; stefank@5551: assert(l2esz <= LogBitsPerLong, stefank@5551: err_msg("sanity. l2esz: 0x%x for lh: 0x%x", (uint)l2esz, (uint)lh)); duke@435: return l2esz; duke@435: } duke@435: static jint array_layout_helper(jint tag, int hsize, BasicType etype, int log2_esize) { duke@435: return (tag << _lh_array_tag_shift) duke@435: | (hsize << _lh_header_size_shift) duke@435: | ((int)etype << _lh_element_type_shift) duke@435: | (log2_esize << _lh_log2_element_size_shift); duke@435: } duke@435: static jint instance_layout_helper(jint size, bool slow_path_flag) { duke@435: return (size << LogHeapWordSize) duke@435: | (slow_path_flag ? _lh_instance_slow_path_bit : 0); duke@435: } duke@435: static int layout_helper_to_size_helper(jint lh) { duke@435: assert(lh > (jint)_lh_neutral_value, "must be instance"); duke@435: // Note that the following expression discards _lh_instance_slow_path_bit. duke@435: return lh >> LogHeapWordSize; duke@435: } duke@435: // Out-of-line version computes everything based on the etype: duke@435: static jint array_layout_helper(BasicType etype); duke@435: duke@435: // What is the maximum number of primary superclasses any klass can have? duke@435: #ifdef PRODUCT duke@435: static juint primary_super_limit() { return _primary_super_limit; } duke@435: #else duke@435: static juint primary_super_limit() { duke@435: assert(FastSuperclassLimit <= _primary_super_limit, "parameter oob"); duke@435: return FastSuperclassLimit; duke@435: } duke@435: #endif duke@435: duke@435: // vtables duke@435: virtual klassVtable* vtable() const { return NULL; } coleenp@5100: virtual int vtable_length() const { return 0; } duke@435: duke@435: // subclass check minqi@5097: bool is_subclass_of(const Klass* k) const; duke@435: // subtype check: true if is_subclass_of, or if k is interface and receiver implements it coleenp@4037: bool is_subtype_of(Klass* k) const { coleenp@4037: juint off = k->super_check_offset(); coleenp@4037: Klass* sup = *(Klass**)( (address)this + off ); stefank@3391: const juint secondary_offset = in_bytes(secondary_super_cache_offset()); duke@435: if (sup == k) { duke@435: return true; duke@435: } else if (off != secondary_offset) { duke@435: return false; duke@435: } else { duke@435: return search_secondary_supers(k); duke@435: } duke@435: } coleenp@4037: bool search_secondary_supers(Klass* k) const; duke@435: twisti@1040: // Find LCA in class hierarchy duke@435: Klass *LCA( Klass *k ); duke@435: duke@435: // Check whether reflection/jni/jvm code is allowed to instantiate this class; duke@435: // if not, throw either an Error or an Exception. duke@435: virtual void check_valid_for_instantiation(bool throwError, TRAPS); duke@435: duke@435: // array copying duke@435: virtual void copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS); duke@435: duke@435: // tells if the class should be initialized duke@435: virtual bool should_be_initialized() const { return false; } duke@435: // initializes the klass duke@435: virtual void initialize(TRAPS); duke@435: // lookup operation for MethodLookupCache duke@435: friend class MethodLookupCache; lfoltan@6632: virtual Method* uncached_lookup_method(Symbol* name, Symbol* signature, MethodLookupMode mode) const; duke@435: public: coleenp@4037: Method* lookup_method(Symbol* name, Symbol* signature) const { lfoltan@6632: return uncached_lookup_method(name, signature, normal); duke@435: } duke@435: duke@435: // array class with specific rank coleenp@4037: Klass* array_klass(int rank, TRAPS) { return array_klass_impl(false, rank, THREAD); } duke@435: duke@435: // array class with this klass as element type coleenp@4037: Klass* array_klass(TRAPS) { return array_klass_impl(false, THREAD); } duke@435: duke@435: // These will return NULL instead of allocating on the heap: duke@435: // NB: these can block for a mutex, like other functions with TRAPS arg. coleenp@4037: Klass* array_klass_or_null(int rank); coleenp@4037: Klass* array_klass_or_null(); duke@435: coleenp@5176: virtual oop protection_domain() const = 0; coleenp@4037: coleenp@4037: oop class_loader() const; duke@435: coleenp@4345: virtual oop klass_holder() const { return class_loader(); } coleenp@4345: duke@435: protected: coleenp@4037: virtual Klass* array_klass_impl(bool or_null, int rank, TRAPS); coleenp@4037: virtual Klass* array_klass_impl(bool or_null, TRAPS); duke@435: duke@435: public: coleenp@4037: // CDS support - remove and restore oops from metadata. Oops are not shared. duke@435: virtual void remove_unshareable_info(); coleenp@4037: virtual void restore_unshareable_info(TRAPS); duke@435: duke@435: protected: duke@435: // computes the subtype relationship coleenp@4037: virtual bool compute_is_subtype_of(Klass* k); duke@435: public: duke@435: // subclass accessor (here for convenience; undefined for non-klass objects) duke@435: virtual bool is_leaf_class() const { fatal("not a class"); return false; } duke@435: public: duke@435: // ALL FUNCTIONS BELOW THIS POINT ARE DISPATCHED FROM AN OOP duke@435: // These functions describe behavior for the oop not the KLASS. duke@435: duke@435: // actual oop size of obj in memory duke@435: virtual int oop_size(oop obj) const = 0; duke@435: coleenp@4037: // Size of klass in word size. coleenp@4037: virtual int size() const = 0; acorn@4497: #if INCLUDE_SERVICES acorn@4497: virtual void collect_statistics(KlassSizeStats *sz) const; acorn@4497: #endif duke@435: duke@435: // Returns the Java name for a class (Resource allocated) duke@435: // For arrays, this returns the name of the element with a leading '['. duke@435: // For classes, this returns the name with the package separators duke@435: // turned into '.'s. duke@435: const char* external_name() const; duke@435: // Returns the name for a class (Resource allocated) as the class duke@435: // would appear in a signature. duke@435: // For arrays, this returns the name of the element with a leading '['. duke@435: // For classes, this returns the name with a leading 'L' and a trailing ';' duke@435: // and the package separators as '/'. jrose@1474: virtual const char* signature_name() const; duke@435: duke@435: // garbage collection support duke@435: virtual void oop_follow_contents(oop obj) = 0; duke@435: virtual int oop_adjust_pointers(oop obj) = 0; duke@435: duke@435: // Parallel Scavenge and Parallel Old duke@435: PARALLEL_GC_DECLS_PV duke@435: coleenp@4037: // type testing operations coleenp@4037: protected: coleenp@4037: virtual bool oop_is_instance_slow() const { return false; } coleenp@4037: virtual bool oop_is_array_slow() const { return false; } coleenp@4037: virtual bool oop_is_objArray_slow() const { return false; } coleenp@4037: virtual bool oop_is_typeArray_slow() const { return false; } duke@435: public: stefank@6976: virtual bool oop_is_instanceClassLoader() const { return false; } never@2658: virtual bool oop_is_instanceMirror() const { return false; } duke@435: virtual bool oop_is_instanceRef() const { return false; } duke@435: coleenp@4037: // Fast non-virtual versions duke@435: #ifndef ASSERT duke@435: #define assert_same_query(xval, xcheck) xval duke@435: #else duke@435: private: duke@435: static bool assert_same_query(bool xval, bool xslow) { duke@435: assert(xval == xslow, "slow and fast queries agree"); duke@435: return xval; duke@435: } duke@435: public: duke@435: #endif duke@435: inline bool oop_is_instance() const { return assert_same_query( duke@435: layout_helper_is_instance(layout_helper()), duke@435: oop_is_instance_slow()); } coleenp@4037: inline bool oop_is_array() const { return assert_same_query( coleenp@4037: layout_helper_is_array(layout_helper()), coleenp@4037: oop_is_array_slow()); } duke@435: inline bool oop_is_objArray() const { return assert_same_query( duke@435: layout_helper_is_objArray(layout_helper()), duke@435: oop_is_objArray_slow()); } duke@435: inline bool oop_is_typeArray() const { return assert_same_query( duke@435: layout_helper_is_typeArray(layout_helper()), duke@435: oop_is_typeArray_slow()); } duke@435: #undef assert_same_query duke@435: duke@435: // Access flags duke@435: AccessFlags access_flags() const { return _access_flags; } duke@435: void set_access_flags(AccessFlags flags) { _access_flags = flags; } duke@435: duke@435: bool is_public() const { return _access_flags.is_public(); } duke@435: bool is_final() const { return _access_flags.is_final(); } duke@435: bool is_interface() const { return _access_flags.is_interface(); } duke@435: bool is_abstract() const { return _access_flags.is_abstract(); } duke@435: bool is_super() const { return _access_flags.is_super(); } duke@435: bool is_synthetic() const { return _access_flags.is_synthetic(); } duke@435: void set_is_synthetic() { _access_flags.set_is_synthetic(); } duke@435: bool has_finalizer() const { return _access_flags.has_finalizer(); } duke@435: bool has_final_method() const { return _access_flags.has_final_method(); } duke@435: void set_has_finalizer() { _access_flags.set_has_finalizer(); } duke@435: void set_has_final_method() { _access_flags.set_has_final_method(); } duke@435: bool is_cloneable() const { return _access_flags.is_cloneable(); } duke@435: void set_is_cloneable() { _access_flags.set_is_cloneable(); } duke@435: bool has_vanilla_constructor() const { return _access_flags.has_vanilla_constructor(); } duke@435: void set_has_vanilla_constructor() { _access_flags.set_has_vanilla_constructor(); } duke@435: bool has_miranda_methods () const { return access_flags().has_miranda_methods(); } duke@435: void set_has_miranda_methods() { _access_flags.set_has_miranda_methods(); } duke@435: duke@435: // Biased locking support duke@435: // Note: the prototype header is always set up to be at least the duke@435: // prototype markOop. If biased locking is enabled it may further be duke@435: // biasable and have an epoch. duke@435: markOop prototype_header() const { return _prototype_header; } duke@435: // NOTE: once instances of this klass are floating around in the duke@435: // system, this header must only be updated at a safepoint. duke@435: // NOTE 2: currently we only ever set the prototype header to the duke@435: // biasable prototype for instanceKlasses. There is no technical duke@435: // reason why it could not be done for arrayKlasses aside from duke@435: // wanting to reduce the initial scope of this optimization. There duke@435: // are potential problems in setting the bias pattern for duke@435: // JVM-internal oops. duke@435: inline void set_prototype_header(markOop header); coleenp@4037: static ByteSize prototype_header_offset() { return in_ByteSize(offset_of(Klass, _prototype_header)); } duke@435: duke@435: int biased_lock_revocation_count() const { return (int) _biased_lock_revocation_count; } duke@435: // Atomically increments biased_lock_revocation_count and returns updated value duke@435: int atomic_incr_biased_lock_revocation_count(); duke@435: void set_biased_lock_revocation_count(int val) { _biased_lock_revocation_count = (jint) val; } duke@435: jlong last_biased_lock_bulk_revocation_time() { return _last_biased_lock_bulk_revocation_time; } duke@435: void set_last_biased_lock_bulk_revocation_time(jlong cur_time) { _last_biased_lock_bulk_revocation_time = cur_time; } duke@435: phh@3427: TRACE_DEFINE_KLASS_METHODS; duke@435: duke@435: // garbage collection support coleenp@4037: virtual void oops_do(OopClosure* cl); coleenp@4037: coleenp@4304: // Iff the class loader (or mirror for anonymous classes) is alive the coleenp@4304: // Klass is considered alive. coleenp@4037: // The is_alive closure passed in depends on the Garbage Collector used. coleenp@4037: bool is_loader_alive(BoolObjectClosure* is_alive); coleenp@4037: coleenp@4037: static void clean_weak_klass_links(BoolObjectClosure* is_alive); duke@435: duke@435: // iterators coleenp@4037: virtual int oop_oop_iterate(oop obj, ExtendedOopClosure* blk) = 0; coleenp@4037: virtual int oop_oop_iterate_v(oop obj, ExtendedOopClosure* blk) { duke@435: return oop_oop_iterate(obj, blk); duke@435: } duke@435: jprovino@4542: #if INCLUDE_ALL_GCS ysr@777: // In case we don't have a specialized backward scanner use forward ysr@777: // iteration. coleenp@4037: virtual int oop_oop_iterate_backwards_v(oop obj, ExtendedOopClosure* blk) { ysr@777: return oop_oop_iterate_v(obj, blk); ysr@777: } jprovino@4542: #endif // INCLUDE_ALL_GCS ysr@777: duke@435: // Iterates "blk" over all the oops in "obj" (of type "this") within "mr". duke@435: // (I don't see why the _m should be required, but without it the Solaris duke@435: // C++ gives warning messages about overridings of the "oop_oop_iterate" duke@435: // defined above "hiding" this virtual function. (DLD, 6/20/00)) */ coleenp@4037: virtual int oop_oop_iterate_m(oop obj, ExtendedOopClosure* blk, MemRegion mr) = 0; coleenp@4037: virtual int oop_oop_iterate_v_m(oop obj, ExtendedOopClosure* blk, MemRegion mr) { duke@435: return oop_oop_iterate_m(obj, blk, mr); duke@435: } duke@435: duke@435: // Versions of the above iterators specialized to particular subtypes duke@435: // of OopClosure, to avoid closure virtual calls. duke@435: #define Klass_OOP_OOP_ITERATE_DECL(OopClosureType, nv_suffix) \ duke@435: virtual int oop_oop_iterate##nv_suffix(oop obj, OopClosureType* blk) { \ duke@435: /* Default implementation reverts to general version. */ \ duke@435: return oop_oop_iterate(obj, blk); \ duke@435: } \ duke@435: \ duke@435: /* Iterates "blk" over all the oops in "obj" (of type "this") within "mr". \ duke@435: (I don't see why the _m should be required, but without it the Solaris \ duke@435: C++ gives warning messages about overridings of the "oop_oop_iterate" \ duke@435: defined above "hiding" this virtual function. (DLD, 6/20/00)) */ \ duke@435: virtual int oop_oop_iterate##nv_suffix##_m(oop obj, \ duke@435: OopClosureType* blk, \ duke@435: MemRegion mr) { \ duke@435: return oop_oop_iterate_m(obj, blk, mr); \ duke@435: } duke@435: duke@435: SPECIALIZED_OOP_OOP_ITERATE_CLOSURES_1(Klass_OOP_OOP_ITERATE_DECL) ysr@777: SPECIALIZED_OOP_OOP_ITERATE_CLOSURES_2(Klass_OOP_OOP_ITERATE_DECL) ysr@777: jprovino@4542: #if INCLUDE_ALL_GCS ysr@777: #define Klass_OOP_OOP_ITERATE_BACKWARDS_DECL(OopClosureType, nv_suffix) \ ysr@777: virtual int oop_oop_iterate_backwards##nv_suffix(oop obj, \ ysr@777: OopClosureType* blk) { \ ysr@777: /* Default implementation reverts to general version. */ \ ysr@777: return oop_oop_iterate_backwards_v(obj, blk); \ ysr@777: } ysr@777: ysr@777: SPECIALIZED_OOP_OOP_ITERATE_CLOSURES_1(Klass_OOP_OOP_ITERATE_BACKWARDS_DECL) ysr@777: SPECIALIZED_OOP_OOP_ITERATE_CLOSURES_2(Klass_OOP_OOP_ITERATE_BACKWARDS_DECL) jprovino@4542: #endif // INCLUDE_ALL_GCS duke@435: coleenp@4037: virtual void array_klasses_do(void f(Klass* k)) {} duke@435: duke@435: // Return self, except for abstract classes with exactly 1 duke@435: // implementor. Then return the 1 concrete implementation. duke@435: Klass *up_cast_abstract(); duke@435: duke@435: // klass name coleenp@2497: Symbol* name() const { return _name; } coleenp@2497: void set_name(Symbol* n); duke@435: duke@435: public: duke@435: // jvm support duke@435: virtual jint compute_modifier_flags(TRAPS) const; duke@435: duke@435: // JVMTI support duke@435: virtual jint jvmti_class_status() const; duke@435: duke@435: // Printing coleenp@4037: virtual void print_on(outputStream* st) const; coleenp@4037: jrose@1590: virtual void oop_print_value_on(oop obj, outputStream* st); duke@435: virtual void oop_print_on (oop obj, outputStream* st); duke@435: coleenp@4037: virtual const char* internal_name() const = 0; coleenp@4037: duke@435: // Verification coleenp@6316: virtual void verify_on(outputStream* st); coleenp@6316: void verify() { verify_on(tty); } duke@435: duke@435: #ifndef PRODUCT drchase@5732: bool verify_vtable_index(int index); drchase@5732: bool verify_itable_index(int index); duke@435: #endif coleenp@4037: coleenp@4037: virtual void oop_verify_on(oop obj, outputStream* st); coleenp@4037: hseigel@5528: static bool is_null(narrowKlass obj); hseigel@5528: static bool is_null(Klass* obj); hseigel@5528: hseigel@5528: // klass encoding for klass pointer in objects. hseigel@5528: static narrowKlass encode_klass_not_null(Klass* v); hseigel@5528: static narrowKlass encode_klass(Klass* v); hseigel@5528: hseigel@5528: static Klass* decode_klass_not_null(narrowKlass v); hseigel@5528: static Klass* decode_klass(narrowKlass v); hseigel@5528: coleenp@4037: private: coleenp@4037: // barriers used by klass_oop_store coleenp@4037: void klass_update_barrier_set(oop v); coleenp@4037: void klass_update_barrier_set_pre(void* p, oop v); duke@435: }; stefank@2314: stefank@2314: #endif // SHARE_VM_OOPS_KLASS_HPP