1 /*
  2  * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
  3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  4  *
  5  * This code is free software; you can redistribute it and/or modify it
  6  * under the terms of the GNU General Public License version 2 only, as
  7  * published by the Free Software Foundation.
  8  *
  9  * This code is distributed in the hope that it will be useful, but WITHOUT
 10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 12  * version 2 for more details (a copy is included in the LICENSE file that
 13  * accompanied this code).
 14  *
 15  * You should have received a copy of the GNU General Public License version
 16  * 2 along with this work; if not, write to the Free Software Foundation,
 17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 18  *
 19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 20  * or visit www.oracle.com if you need additional information or have any
 21  * questions.
 22  *
 23  */
 24 
 25 #ifndef SHARE_OOPS_KLASS_HPP
 26 #define SHARE_OOPS_KLASS_HPP
 27 
 28 #include "oops/klassFlags.hpp"
 29 #include "oops/markWord.hpp"
 30 #include "oops/metadata.hpp"
 31 #include "oops/oop.hpp"
 32 #include "oops/oopHandle.hpp"
 33 #include "utilities/accessFlags.hpp"
 34 #include "utilities/macros.hpp"
 35 #if INCLUDE_JFR
 36 #include "jfr/support/jfrTraceIdExtension.hpp"
 37 #endif
 38 
 39 //
 40 // A Klass provides:
 41 //  1: language level class object (method dictionary etc.)
 42 //  2: provide vm dispatch behavior for the object
 43 // Both functions are combined into one C++ class.
 44 
 45 // One reason for the oop/klass dichotomy in the implementation is
 46 // that we don't want a C++ vtbl pointer in every object.  Thus,
 47 // normal oops don't have any virtual functions.  Instead, they
 48 // forward all "virtual" functions to their klass, which does have
 49 // a vtbl and does the C++ dispatch depending on the object's
 50 // actual type.  (See oop.inline.hpp for some of the forwarding code.)
 51 // ALL FUNCTIONS IMPLEMENTING THIS DISPATCH ARE PREFIXED WITH "oop_"!
 52 
 53 // Forward declarations.
 54 template <class T> class Array;
 55 template <class T> class GrowableArray;
 56 class ClassLoaderData;
 57 class fieldDescriptor;
 58 class klassVtable;
 59 class ModuleEntry;
 60 class PackageEntry;
 61 class vtableEntry;
 62 
 63 class Klass : public Metadata {
 64 
 65   friend class VMStructs;
 66   friend class JVMCIVMStructs;
 67  public:
 68   // Klass Kinds for all subclasses of Klass
 69   enum KlassKind : u2 {
 70     InstanceKlassKind,
 71     InstanceRefKlassKind,
 72     InstanceMirrorKlassKind,
 73     InstanceClassLoaderKlassKind,
 74     InstanceStackChunkKlassKind,
 75     TypeArrayKlassKind,
 76     ObjArrayKlassKind,
 77     UnknownKlassKind
 78   };
 79 
 80   static const uint KLASS_KIND_COUNT = ObjArrayKlassKind + 1;
 81  protected:
 82 
 83   // If you add a new field that points to any metaspace object, you
 84   // must add this field to Klass::metaspace_pointers_do().
 85 
 86   // note: put frequently-used fields together at start of klass structure
 87   // for better cache behavior (may not make much of a difference but sure won't hurt)
 88   enum { _primary_super_limit = 8 };
 89 
 90   // The "layout helper" is a combined descriptor of object layout.
 91   // For klasses which are neither instance nor array, the value is zero.
 92   //
 93   // For instances, layout helper is a positive number, the instance size.
 94   // This size is already passed through align_object_size and scaled to bytes.
 95   // The low order bit is set if instances of this class cannot be
 96   // allocated using the fastpath.
 97   //
 98   // For arrays, layout helper is a negative number, containing four
 99   // distinct bytes, as follows:
100   //    MSB:[tag, hsz, ebt, log2(esz)]:LSB
101   // where:
102   //    tag is 0x80 if the elements are oops, 0xC0 if non-oops
103   //    hsz is array header size in bytes (i.e., offset of first element)
104   //    ebt is the BasicType of the elements
105   //    esz is the element size in bytes
106   // This packed word is arranged so as to be quickly unpacked by the
107   // various fast paths that use the various subfields.
108   //
109   // The esz bits can be used directly by a SLL instruction, without masking.
110   //
111   // Note that the array-kind tag looks like 0x00 for instance klasses,
112   // since their length in bytes is always less than 24Mb.
113   //
114   // Final note:  This comes first, immediately after C++ vtable,
115   // because it is frequently queried.
116   jint _layout_helper;
117 
118   // Klass kind used to resolve the runtime type of the instance.
119   //  - Used to implement devirtualized oop closure dispatching.
120   //  - Various type checking in the JVM
121   const KlassKind _kind;
122 
123   AccessFlags _access_flags;    // Access flags. The class/interface distinction is stored here.
124                                 // Some flags created by the JVM, not in the class file itself,
125                                 // are in _misc_flags below.
126   KlassFlags  _misc_flags;
127 
128   // The fields _super_check_offset, _secondary_super_cache, _secondary_supers
129   // and _primary_supers all help make fast subtype checks.  See big discussion
130   // in doc/server_compiler/checktype.txt
131   //
132   // Where to look to observe a supertype (it is &_secondary_super_cache for
133   // secondary supers, else is &_primary_supers[depth()].
134   juint       _super_check_offset;
135 
136   // Class name.  Instance classes: java/lang/String, etc.  Array classes: [I,
137   // [Ljava/lang/String;, etc.  Set to zero for all other kinds of classes.
138   Symbol*     _name;
139 
140   // Cache of last observed secondary supertype
141   Klass*      _secondary_super_cache;
142   // Array of all secondary supertypes
143   Array<Klass*>* _secondary_supers;
144   // Ordered list of all primary supertypes
145   Klass*      _primary_supers[_primary_super_limit];
146   // java/lang/Class instance mirroring this class
147   OopHandle   _java_mirror;
148   // Superclass
149   Klass*      _super;
150   // First subclass (null if none); _subklass->next_sibling() is next one
151   Klass* volatile _subklass;
152   // Sibling link (or null); links all subklasses of a klass
153   Klass* volatile _next_sibling;
154 
155   // All klasses loaded by a class loader are chained through these links
156   Klass*      _next_link;
157 
158   // The VM's representation of the ClassLoader used to load this class.
159   // Provide access the corresponding instance java.lang.ClassLoader.
160   ClassLoaderData* _class_loader_data;
161 
162   markWord _prototype_header;   // Used to initialize objects' header
163 
164   // Bitmap and hash code used by hashed secondary supers.
165   uintx    _secondary_supers_bitmap;
166   uint8_t  _hash_slot;
167 
168 private:
169   // This is an index into AOTClassLocationConfig::class_locations(), to
170   // indicate the AOTClassLocation where this class is loaded from during
171   // dump time. If a class is not loaded from the AOT cache, this field is
172   // -1.
173   s2 _shared_class_path_index;
174 
175 #if INCLUDE_CDS
176   // Various attributes for shared classes. Should be zero for a non-shared class.
177   u2 _shared_class_flags;
178   enum CDSSharedClassFlags {
179     _in_aot_cache                          = 1 << 0,
180     _archived_lambda_proxy_is_available    = 1 << 1,
181     _has_value_based_class_annotation      = 1 << 2,
182     _verified_at_dump_time                 = 1 << 3,
183     _has_archived_enum_objs                = 1 << 4,
184     // This class was not loaded from a classfile in the module image
185     // or classpath.
186     _is_generated_shared_class             = 1 << 5,
187     // archived mirror already initialized by AOT-cache assembly: no further need to call <clinit>
188     _has_aot_initialized_mirror            = 1 << 6,
189   };
190 #endif
191 
192   int _vtable_len;              // vtable length. This field may be read very often when we
193                                 // have lots of itable dispatches (e.g., lambdas and streams).
194                                 // Keep it away from the beginning of a Klass to avoid cacheline
195                                 // contention that may happen when a nearby object is modified.
196 
197   CDS_JAVA_HEAP_ONLY(int _archived_mirror_index;)
198 
199 public:
200 
201   JFR_ONLY(DEFINE_TRACE_ID_FIELD;)
202 
203 protected:
204 
205   Klass(KlassKind kind);
206   Klass();
207 
208  public:
209   int kind() { return _kind; }
210 
211   enum class DefaultsLookupMode { find, skip };
212   enum class OverpassLookupMode { find, skip };
213   enum class StaticLookupMode   { find, skip };
214   enum class PrivateLookupMode  { find, skip };
215 
216   virtual bool is_klass() const { return true; }
217 
218   // super() cannot be InstanceKlass* -- Java arrays are covariant, and _super is used
219   // to implement that. NB: the _super of "[Ljava/lang/Integer;" is "[Ljava/lang/Number;"
220   // If this is not what your code expects, you're probably looking for:
221   // - Klass::java_super() - if you have a Klass*
222   // - InstanceKlass::super() - if you have an InstanceKlass* ik, ik->super() returns InstanceKlass*.
223   Klass* super() const               { return _super; }
224   void set_super(Klass* k)           { _super = k; }
225 
226   // initializes _super link, _primary_supers & _secondary_supers arrays
227   void initialize_supers(Klass* k, Array<InstanceKlass*>* transitive_interfaces, TRAPS);
228 
229   // klass-specific helper for initializing _secondary_supers
230   virtual GrowableArray<Klass*>* compute_secondary_supers(int num_extra_slots,
231                                                           Array<InstanceKlass*>* transitive_interfaces);
232 
233   // java_super is the Java-level super type as specified by Class.getSuperClass.
234   virtual InstanceKlass* java_super() const  { return nullptr; }
235 
236   juint    super_check_offset() const  { return _super_check_offset; }
237   void set_super_check_offset(juint o) { _super_check_offset = o; }
238 
239   Klass* secondary_super_cache() const     { return _secondary_super_cache; }
240   void set_secondary_super_cache(Klass* k) { _secondary_super_cache = k; }
241 
242   Array<Klass*>* secondary_supers() const { return _secondary_supers; }
243   void set_secondary_supers(Array<Klass*>* k, uintx bitmap);
244 
245   uint8_t hash_slot() const { return _hash_slot; }
246 
247   // Return the element of the _super chain of the given depth.
248   // If there is no such element, return either null or this.
249   Klass* primary_super_of_depth(juint i) const {
250     assert(i < primary_super_limit(), "oob");
251     Klass* super = _primary_supers[i];
252     assert(super == nullptr || super->super_depth() == i, "correct display");
253     return super;
254   }
255 
256   // Can this klass be a primary super?  False for interfaces and arrays of
257   // interfaces.  False also for arrays or classes with long super chains.
258   bool can_be_primary_super() const {
259     const juint secondary_offset = in_bytes(secondary_super_cache_offset());
260     return super_check_offset() != secondary_offset;
261   }
262   virtual bool can_be_primary_super_slow() const;
263 
264   // Returns number of primary supers; may be a number in the inclusive range [0, primary_super_limit].
265   juint super_depth() const {
266     if (!can_be_primary_super()) {
267       return primary_super_limit();
268     } else {
269       juint d = (super_check_offset() - in_bytes(primary_supers_offset())) / sizeof(Klass*);
270       assert(d < primary_super_limit(), "oob");
271       assert(_primary_supers[d] == this, "proper init");
272       return d;
273     }
274   }
275 
276   // java mirror
277   oop java_mirror() const;
278   oop java_mirror_no_keepalive() const;
279   void set_java_mirror(Handle m);
280 
281   oop archived_java_mirror() NOT_CDS_JAVA_HEAP_RETURN_(nullptr);
282 
283   // Temporary mirror switch used by RedefineClasses
284   OopHandle java_mirror_handle() const { return _java_mirror; }
285   void swap_java_mirror_handle(OopHandle& mirror) { _java_mirror.swap(mirror); }
286 
287   // Set java mirror OopHandle to null for CDS
288   // This leaves the OopHandle in the CLD, but that's ok, you can't release them.
289   void clear_java_mirror_handle() { _java_mirror = OopHandle(); }
290 
291   // size helper
292   int layout_helper() const            { return _layout_helper; }
293   void set_layout_helper(int lh)       { _layout_helper = lh; }
294 
295   // Note: for instances layout_helper() may include padding.
296   // Use InstanceKlass::contains_field_offset to classify field offsets.
297 
298   // sub/superklass links
299   Klass* subklass(bool log = false) const;
300   Klass* next_sibling(bool log = false) const;
301 
302   void append_to_sibling_list();           // add newly created receiver to superklass' subklass list
303 
304   void set_next_link(Klass* k) { _next_link = k; }
305   Klass* next_link() const { return _next_link; }   // The next klass defined by the class loader.
306   Klass** next_link_addr() { return &_next_link; }
307 
308   // class loader data
309   ClassLoaderData* class_loader_data() const               { return _class_loader_data; }
310   void set_class_loader_data(ClassLoaderData* loader_data) {  _class_loader_data = loader_data; }
311 
312   s2 shared_classpath_index() const   {
313     return _shared_class_path_index;
314   };
315 
316   void set_shared_classpath_index(s2 index) {
317     _shared_class_path_index = index;
318   };
319 
320   bool has_archived_mirror_index() const {
321     CDS_JAVA_HEAP_ONLY(return _archived_mirror_index >= 0;)
322     NOT_CDS_JAVA_HEAP(return false);
323   }
324 
325   void clear_archived_mirror_index() NOT_CDS_JAVA_HEAP_RETURN;
326 
327   void set_lambda_proxy_is_available() {
328     CDS_ONLY(_shared_class_flags |= _archived_lambda_proxy_is_available;)
329   }
330   void clear_lambda_proxy_is_available() {
331     CDS_ONLY(_shared_class_flags &= (u2)(~_archived_lambda_proxy_is_available);)
332   }
333   bool lambda_proxy_is_available() const {
334     CDS_ONLY(return (_shared_class_flags & _archived_lambda_proxy_is_available) != 0;)
335     NOT_CDS(return false;)
336   }
337 
338   void set_has_value_based_class_annotation() {
339     CDS_ONLY(_shared_class_flags |= _has_value_based_class_annotation;)
340   }
341   void clear_has_value_based_class_annotation() {
342     CDS_ONLY(_shared_class_flags &= (u2)(~_has_value_based_class_annotation);)
343   }
344   bool has_value_based_class_annotation() const {
345     CDS_ONLY(return (_shared_class_flags & _has_value_based_class_annotation) != 0;)
346     NOT_CDS(return false;)
347   }
348 
349   void set_verified_at_dump_time() {
350     CDS_ONLY(_shared_class_flags |= _verified_at_dump_time;)
351   }
352   bool verified_at_dump_time() const {
353     CDS_ONLY(return (_shared_class_flags & _verified_at_dump_time) != 0;)
354     NOT_CDS(return false;)
355   }
356 
357   void set_has_archived_enum_objs() {
358     CDS_ONLY(_shared_class_flags |= _has_archived_enum_objs;)
359   }
360   bool has_archived_enum_objs() const {
361     CDS_ONLY(return (_shared_class_flags & _has_archived_enum_objs) != 0;)
362     NOT_CDS(return false;)
363   }
364 
365   void set_is_generated_shared_class() {
366     CDS_ONLY(_shared_class_flags |= _is_generated_shared_class;)
367   }
368   bool is_generated_shared_class() const {
369     CDS_ONLY(return (_shared_class_flags & _is_generated_shared_class) != 0;)
370     NOT_CDS(return false;)
371   }
372 
373   void set_has_aot_initialized_mirror() {
374     CDS_ONLY(_shared_class_flags |= _has_aot_initialized_mirror;)
375   }
376   bool has_aot_initialized_mirror() const {
377     CDS_ONLY(return (_shared_class_flags & _has_aot_initialized_mirror) != 0;)
378     NOT_CDS(return false;)
379   }
380 
381   bool in_aot_cache() const                { // shadows MetaspaceObj::in_aot_cache)()
382     CDS_ONLY(return (_shared_class_flags & _in_aot_cache) != 0;)
383     NOT_CDS(return false;)
384   }
385 
386   void set_in_aot_cache() {
387     CDS_ONLY(_shared_class_flags |= _in_aot_cache;)
388   }
389 
390   // Obtain the module or package for this class
391   virtual ModuleEntry* module() const = 0;
392   virtual PackageEntry* package() const = 0;
393 
394  protected:                                // internal accessors
395   void     set_subklass(Klass* s);
396   void     set_next_sibling(Klass* s);
397 
398  private:
399   static uint8_t compute_hash_slot(Symbol* s);
400   static void  hash_insert(Klass* klass, GrowableArray<Klass*>* secondaries, uintx& bitmap);
401   static uintx hash_secondary_supers(Array<Klass*>* secondaries, bool rewrite);
402 
403   bool search_secondary_supers(Klass* k) const;
404   bool lookup_secondary_supers_table(Klass *k) const;
405   bool linear_search_secondary_supers(const Klass* k) const;
406   bool fallback_search_secondary_supers(const Klass* k, int index, uintx rotated_bitmap) const;
407 
408  public:
409   // Secondary supers table support
410   static Array<Klass*>* pack_secondary_supers(ClassLoaderData* loader_data,
411                                               GrowableArray<Klass*>* primaries,
412                                               GrowableArray<Klass*>* secondaries,
413                                               uintx& bitmap,
414                                               TRAPS);
415 
416   static uintx   compute_secondary_supers_bitmap(Array<Klass*>* secondary_supers);
417   static uint8_t compute_home_slot(Klass* k, uintx bitmap);
418 
419   static constexpr int SECONDARY_SUPERS_TABLE_SIZE = sizeof(_secondary_supers_bitmap) * 8;
420   static constexpr int SECONDARY_SUPERS_TABLE_MASK = SECONDARY_SUPERS_TABLE_SIZE - 1;
421 
422   static constexpr uintx SECONDARY_SUPERS_BITMAP_EMPTY    = 0;
423   static constexpr uintx SECONDARY_SUPERS_BITMAP_FULL     = ~(uintx)0;
424 
425   // Compiler support
426   static ByteSize super_offset()                 { return byte_offset_of(Klass, _super); }
427   static ByteSize super_check_offset_offset()    { return byte_offset_of(Klass, _super_check_offset); }
428   static ByteSize primary_supers_offset()        { return byte_offset_of(Klass, _primary_supers); }
429   static ByteSize secondary_super_cache_offset() { return byte_offset_of(Klass, _secondary_super_cache); }
430   static ByteSize secondary_supers_offset()      { return byte_offset_of(Klass, _secondary_supers); }
431   static ByteSize java_mirror_offset()           { return byte_offset_of(Klass, _java_mirror); }
432   static ByteSize class_loader_data_offset()     { return byte_offset_of(Klass, _class_loader_data); }
433   static ByteSize layout_helper_offset()         { return byte_offset_of(Klass, _layout_helper); }
434   static ByteSize access_flags_offset()          { return byte_offset_of(Klass, _access_flags); }
435 #if INCLUDE_JVMCI
436   static ByteSize subklass_offset()              { return byte_offset_of(Klass, _subklass); }
437   static ByteSize next_sibling_offset()          { return byte_offset_of(Klass, _next_sibling); }
438 #endif
439   static ByteSize secondary_supers_bitmap_offset()
440                                                  { return byte_offset_of(Klass, _secondary_supers_bitmap); }
441   static ByteSize hash_slot_offset()             { return byte_offset_of(Klass, _hash_slot); }
442   static ByteSize misc_flags_offset()            { return byte_offset_of(Klass, _misc_flags._flags); }
443 
444   // Unpacking layout_helper:
445   static const int _lh_neutral_value           = 0;  // neutral non-array non-instance value
446   static const int _lh_instance_slow_path_bit  = 0x01;
447   static const int _lh_log2_element_size_shift = BitsPerByte*0;
448   static const int _lh_log2_element_size_mask  = BitsPerLong-1;
449   static const int _lh_element_type_shift      = BitsPerByte*1;
450   static const int _lh_element_type_mask       = right_n_bits(BitsPerByte);  // shifted mask
451   static const int _lh_header_size_shift       = BitsPerByte*2;
452   static const int _lh_header_size_mask        = right_n_bits(BitsPerByte);  // shifted mask
453   static const int _lh_array_tag_bits          = 2;
454   static const int _lh_array_tag_shift         = BitsPerInt - _lh_array_tag_bits;
455   static const int _lh_array_tag_obj_value     = ~0x01;   // 0x80000000 >> 30
456 
457   static const unsigned int _lh_array_tag_type_value = 0Xffffffff; // ~0x00,  // 0xC0000000 >> 30
458 
459   static int layout_helper_size_in_bytes(jint lh) {
460     assert(lh > (jint)_lh_neutral_value, "must be instance");
461     return (int) lh & ~_lh_instance_slow_path_bit;
462   }
463   static bool layout_helper_needs_slow_path(jint lh) {
464     assert(lh > (jint)_lh_neutral_value, "must be instance");
465     return (lh & _lh_instance_slow_path_bit) != 0;
466   }
467   static bool layout_helper_is_instance(jint lh) {
468     return (jint)lh > (jint)_lh_neutral_value;
469   }
470   static bool layout_helper_is_array(jint lh) {
471     return (jint)lh < (jint)_lh_neutral_value;
472   }
473   static bool layout_helper_is_typeArray(jint lh) {
474     // _lh_array_tag_type_value == (lh >> _lh_array_tag_shift);
475     return (juint)lh >= (juint)(_lh_array_tag_type_value << _lh_array_tag_shift);
476   }
477   static bool layout_helper_is_objArray(jint lh) {
478     // _lh_array_tag_obj_value == (lh >> _lh_array_tag_shift);
479     return (jint)lh < (jint)(_lh_array_tag_type_value << _lh_array_tag_shift);
480   }
481   static int layout_helper_header_size(jint lh) {
482     assert(lh < (jint)_lh_neutral_value, "must be array");
483     int hsize = (lh >> _lh_header_size_shift) & _lh_header_size_mask;
484     assert(hsize > 0 && hsize < (int)sizeof(oopDesc)*3, "sanity");
485     return hsize;
486   }
487   static BasicType layout_helper_element_type(jint lh) {
488     assert(lh < (jint)_lh_neutral_value, "must be array");
489     int btvalue = (lh >> _lh_element_type_shift) & _lh_element_type_mask;
490     assert(btvalue >= T_BOOLEAN && btvalue <= T_OBJECT, "sanity");
491     return (BasicType) btvalue;
492   }
493 
494   // Want a pattern to quickly diff against layout header in register
495   // find something less clever!
496   static int layout_helper_boolean_diffbit() {
497     jint zlh = array_layout_helper(T_BOOLEAN);
498     jint blh = array_layout_helper(T_BYTE);
499     assert(zlh != blh, "array layout helpers must differ");
500     int diffbit = 1;
501     while ((diffbit & (zlh ^ blh)) == 0 && (diffbit & zlh) == 0) {
502       diffbit <<= 1;
503       assert(diffbit != 0, "make sure T_BOOLEAN has a different bit than T_BYTE");
504     }
505     return diffbit;
506   }
507 
508   static int layout_helper_log2_element_size(jint lh) {
509     assert(lh < (jint)_lh_neutral_value, "must be array");
510     int l2esz = (lh >> _lh_log2_element_size_shift) & _lh_log2_element_size_mask;
511     assert(l2esz <= LogBytesPerLong,
512            "sanity. l2esz: 0x%x for lh: 0x%x", (uint)l2esz, (uint)lh);
513     return l2esz;
514   }
515   static jint array_layout_helper(jint tag, int hsize, BasicType etype, int log2_esize) {
516     return (tag        << _lh_array_tag_shift)
517       |    (hsize      << _lh_header_size_shift)
518       |    ((int)etype << _lh_element_type_shift)
519       |    (log2_esize << _lh_log2_element_size_shift);
520   }
521   static jint instance_layout_helper(jint size, bool slow_path_flag) {
522     return (size << LogBytesPerWord)
523       |    (slow_path_flag ? _lh_instance_slow_path_bit : 0);
524   }
525   static int layout_helper_to_size_helper(jint lh) {
526     assert(lh > (jint)_lh_neutral_value, "must be instance");
527     // Note that the following expression discards _lh_instance_slow_path_bit.
528     return lh >> LogBytesPerWord;
529   }
530   // Out-of-line version computes everything based on the etype:
531   static jint array_layout_helper(BasicType etype);
532 
533   // What is the maximum number of primary superclasses any klass can have?
534   static juint primary_super_limit()         { return _primary_super_limit; }
535 
536   // vtables
537   klassVtable vtable() const;
538   int vtable_length() const { return _vtable_len; }
539 
540   // subclass check
541   bool is_subclass_of(const Klass* k) const;
542 
543   // subtype check: true if is_subclass_of, or if k is interface and receiver implements it
544   bool is_subtype_of(Klass* k) const;
545 
546 public:
547   // Find LCA in class hierarchy
548   Klass *LCA( Klass *k );
549 
550   // Check whether reflection/jni/jvm code is allowed to instantiate this class;
551   // if not, throw either an Error or an Exception.
552   virtual void check_valid_for_instantiation(bool throwError, TRAPS);
553 
554   // array copying
555   virtual void  copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS);
556 
557   // tells if the class should be initialized
558   virtual bool should_be_initialized() const    { return false; }
559   // initializes the klass
560   virtual void initialize(TRAPS);
561   virtual Klass* find_field(Symbol* name, Symbol* signature, fieldDescriptor* fd) const;
562   virtual Method* uncached_lookup_method(const Symbol* name, const Symbol* signature,
563                                          OverpassLookupMode overpass_mode,
564                                          PrivateLookupMode = PrivateLookupMode::find) const;
565  public:
566   Method* lookup_method(const Symbol* name, const Symbol* signature) const {
567     return uncached_lookup_method(name, signature, OverpassLookupMode::find);
568   }
569 
570   // array class with specific rank
571   virtual ArrayKlass* array_klass(int rank, TRAPS) = 0;
572 
573   // array class with this klass as element type
574   virtual ArrayKlass* array_klass(TRAPS) = 0;
575 
576   // These will return null instead of allocating on the heap:
577   virtual ArrayKlass* array_klass_or_null(int rank) = 0;
578   virtual ArrayKlass* array_klass_or_null() = 0;
579 
580   virtual oop protection_domain() const = 0;
581 
582   oop class_loader() const;
583 
584   inline oop klass_holder() const;
585 
586   inline void keep_alive() const;
587 
588  protected:
589 
590   // Error handling when length > max_length or length < 0
591   static void check_array_allocation_length(int length, int max_length, TRAPS);
592 
593   void set_vtable_length(int len) { _vtable_len= len; }
594 
595   vtableEntry* start_of_vtable() const;
596 #if INCLUDE_CDS
597   void restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS);
598 #endif
599  public:
600   Method* method_at_vtable(int index);
601 
602   static ByteSize vtable_start_offset();
603   static ByteSize vtable_length_offset() {
604     return byte_offset_of(Klass, _vtable_len);
605   }
606 
607 #if INCLUDE_CDS
608   // CDS support - remove and restore oops from metadata. Oops are not shared.
609   virtual void remove_unshareable_info();
610   virtual void remove_java_mirror();
611 
612   bool is_unshareable_info_restored() const {
613     assert(in_aot_cache(), "use this for shared classes only");
614     if (has_archived_mirror_index()) {
615       // _java_mirror is not a valid OopHandle but rather an encoded reference in the shared heap
616       return false;
617     } else if (_java_mirror.is_empty()) {
618       return false;
619     } else {
620       return true;
621     }
622   }
623 #endif // INCLUDE_CDS
624 
625  public:
626   // ALL FUNCTIONS BELOW THIS POINT ARE DISPATCHED FROM AN OOP
627   // These functions describe behavior for the oop not the KLASS.
628 
629   // actual oop size of obj in memory in word size.
630   virtual size_t oop_size(oop obj) const = 0;
631 
632   // Size of klass in word size.
633   virtual int size() const = 0;
634 
635   // Returns the Java name for a class (Resource allocated)
636   // For arrays, this returns the name of the element with a leading '['.
637   // For classes, this returns the name with the package separators
638   //     turned into '.'s.
639   const char* external_name() const;
640   // Returns the name for a class (Resource allocated) as the class
641   // would appear in a signature.
642   // For arrays, this returns the name of the element with a leading '['.
643   // For classes, this returns the name with a leading 'L' and a trailing ';'
644   //     and the package separators as '/'.
645   virtual const char* signature_name() const;
646 
647   const char* joint_in_module_of_loader(const Klass* class2, bool include_parent_loader = false) const;
648   const char* class_in_module_of_loader(bool use_are = false, bool include_parent_loader = false) const;
649 
650   // Returns "interface", "abstract class" or "class".
651   const char* external_kind() const;
652 
653   // type testing operations
654 #ifdef ASSERT
655  protected:
656   virtual bool is_instance_klass_slow()     const { return false; }
657   virtual bool is_array_klass_slow()        const { return false; }
658   virtual bool is_objArray_klass_slow()     const { return false; }
659   virtual bool is_typeArray_klass_slow()    const { return false; }
660 #endif // ASSERT
661  public:
662 
663   // Fast non-virtual versions
664   #ifndef ASSERT
665   #define assert_same_query(xval, xcheck) xval
666   #else
667  private:
668   static bool assert_same_query(bool xval, bool xslow) {
669     assert(xval == xslow, "slow and fast queries agree");
670     return xval;
671   }
672  public:
673   #endif
674 
675   bool is_instance_klass()              const { return assert_same_query(_kind <= InstanceStackChunkKlassKind, is_instance_klass_slow()); }
676   // Other is anything that is not one of the more specialized kinds of InstanceKlass.
677   bool is_other_instance_klass()        const { return _kind == InstanceKlassKind; }
678   bool is_reference_instance_klass()    const { return _kind == InstanceRefKlassKind; }
679   bool is_mirror_instance_klass()       const { return _kind == InstanceMirrorKlassKind; }
680   bool is_class_loader_instance_klass() const { return _kind == InstanceClassLoaderKlassKind; }
681   bool is_array_klass()                 const { return assert_same_query( _kind >= TypeArrayKlassKind, is_array_klass_slow()); }
682   bool is_stack_chunk_instance_klass()  const { return _kind == InstanceStackChunkKlassKind; }
683   bool is_objArray_klass()              const { return assert_same_query( _kind == ObjArrayKlassKind,  is_objArray_klass_slow()); }
684   bool is_typeArray_klass()             const { return assert_same_query( _kind == TypeArrayKlassKind, is_typeArray_klass_slow()); }
685   #undef assert_same_query
686 
687   // Access flags
688   AccessFlags access_flags() const         { return _access_flags;  }
689   void set_access_flags(AccessFlags flags) { _access_flags = flags; }
690 
691   bool is_public() const                { return _access_flags.is_public(); }
692   bool is_final() const                 { return _access_flags.is_final(); }
693   bool is_interface() const             { return _access_flags.is_interface(); }
694   bool is_abstract() const              { return _access_flags.is_abstract(); }
695   bool is_super() const                 { return _access_flags.is_super(); }
696   bool is_synthetic() const             { return _access_flags.is_synthetic(); }
697   void set_is_synthetic()               { _access_flags.set_is_synthetic(); }
698   bool has_finalizer() const            { return _misc_flags.has_finalizer(); }
699   void set_has_finalizer()              { _misc_flags.set_has_finalizer(true); }
700   bool is_hidden() const                { return _misc_flags.is_hidden_class(); }
701   void set_is_hidden()                  { _misc_flags.set_is_hidden_class(true); }
702   bool is_value_based() const           { return _misc_flags.is_value_based_class(); }
703   void set_is_value_based()             { _misc_flags.set_is_value_based_class(true); }
704 
705   klass_flags_t misc_flags() const      { return _misc_flags.value(); }
706 
707   inline bool is_non_strong_hidden() const;
708 
709   bool is_cloneable() const;
710   void set_is_cloneable();
711 
712   inline markWord prototype_header() const;
713   inline void set_prototype_header(markWord header);
714   static ByteSize prototype_header_offset() { return in_ByteSize(offset_of(Klass, _prototype_header)); }
715 
716   JFR_ONLY(DEFINE_TRACE_ID_METHODS;)
717 
718   virtual void metaspace_pointers_do(MetaspaceClosure* iter);
719   virtual MetaspaceObj::Type type() const { return ClassType; }
720 
721   inline bool is_loader_alive() const;
722   inline bool is_loader_present_and_alive() const;
723 
724   void clean_subklass();
725 
726   // Clean out unnecessary weak klass links from the whole klass hierarchy.
727   static void clean_weak_klass_links(bool unloading_occurred, bool clean_alive_klasses = true);
728   // Clean out unnecessary weak klass links from the given InstanceKlass.
729   static void clean_weak_instanceklass_links(InstanceKlass* ik);
730 
731   // Return self, except for abstract classes with exactly 1
732   // implementor.  Then return the 1 concrete implementation.
733   Klass *up_cast_abstract();
734 
735   // klass name
736   Symbol* name() const                   { return _name; }
737   void set_name(Symbol* n);
738 
739   virtual void release_C_heap_structures(bool release_constant_pool = true);
740 
741  public:
742   // Get modifier flags from Java mirror cache.
743   int modifier_flags() const;
744 
745   // Compute modifier flags from the original data. This also allows
746   // accessing flags when Java mirror is already dead, e.g. during class
747   // unloading.
748   virtual u2 compute_modifier_flags() const = 0;
749 
750   // JVMTI support
751   virtual jint jvmti_class_status() const;
752 
753   // Printing
754   virtual void print_on(outputStream* st) const;
755 
756   virtual void oop_print_value_on(oop obj, outputStream* st);
757   virtual void oop_print_on      (oop obj, outputStream* st);
758 
759   void print_secondary_supers_on(outputStream* st) const;
760 
761   virtual const char* internal_name() const = 0;
762 
763   // Verification
764   virtual void verify_on(outputStream* st);
765   void verify() { verify_on(tty); }
766 
767 #ifndef PRODUCT
768   bool verify_vtable_index(int index);
769 #endif
770 
771   virtual void oop_verify_on(oop obj, outputStream* st);
772 
773   // for error reporting
774   static bool is_valid(Klass* k);
775 
776   static void on_secondary_supers_verification_failure(Klass* super, Klass* sub, bool linear_result, bool table_result, const char* msg);
777 
778   // Returns true if this Klass needs to be addressable via narrow Klass ID.
779   inline bool needs_narrow_id() const;
780 
781 };
782 
783 #endif // SHARE_OOPS_KLASS_HPP