1 /*
2 * Copyright (c) 1997, 2020, 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 "classfile/classLoaderData.hpp"
29 #include "memory/iterator.hpp"
30 #include "memory/memRegion.hpp"
31 #include "oops/markWord.hpp"
32 #include "oops/metadata.hpp"
33 #include "oops/oop.hpp"
34 #include "oops/oopHandle.hpp"
35 #include "utilities/accessFlags.hpp"
36 #include "utilities/macros.hpp"
37 #if INCLUDE_JFR
38 #include "jfr/support/jfrTraceIdExtension.hpp"
39 #endif
40
41 // Klass IDs for all subclasses of Klass
42 enum KlassID {
43 InstanceKlassID,
44 InstanceRefKlassID,
45 InstanceMirrorKlassID,
46 InstanceClassLoaderKlassID,
47 TypeArrayKlassID,
48 ObjArrayKlassID
49 };
50
51 const uint KLASS_ID_COUNT = 6;
52
53 //
54 // A Klass provides:
55 // 1: language level class object (method dictionary etc.)
56 // 2: provide vm dispatch behavior for the object
57 // Both functions are combined into one C++ class.
58
59 // One reason for the oop/klass dichotomy in the implementation is
60 // that we don't want a C++ vtbl pointer in every object. Thus,
61 // normal oops don't have any virtual functions. Instead, they
62 // forward all "virtual" functions to their klass, which does have
63 // a vtbl and does the C++ dispatch depending on the object's
64 // actual type. (See oop.inline.hpp for some of the forwarding code.)
65 // ALL FUNCTIONS IMPLEMENTING THIS DISPATCH ARE PREFIXED WITH "oop_"!
66
67 // Forward declarations.
68 template <class T> class Array;
69 template <class T> class GrowableArray;
70 class fieldDescriptor;
71 class klassVtable;
72 class ModuleEntry;
73 class PackageEntry;
74 class ParCompactionManager;
75 class PSPromotionManager;
76 class vtableEntry;
77
78 class Klass : public Metadata {
79 friend class VMStructs;
80 friend class JVMCIVMStructs;
81 protected:
82 // If you add a new field that points to any metaspace object, you
83 // must add this field to Klass::metaspace_pointers_do().
84
85 // note: put frequently-used fields together at start of klass structure
86 // for better cache behavior (may not make much of a difference but sure won't hurt)
87 enum { _primary_super_limit = 8 };
88
89 // The "layout helper" is a combined descriptor of object layout.
90 // For klasses which are neither instance nor array, the value is zero.
91 //
92 // For instances, layout helper is a positive number, the instance size.
93 // This size is already passed through align_object_size and scaled to bytes.
94 // The low order bit is set if instances of this class cannot be
95 // allocated using the fastpath.
96 //
97 // For arrays, layout helper is a negative number, containing four
98 // distinct bytes, as follows:
99 // MSB:[tag, hsz, ebt, log2(esz)]:LSB
100 // where:
101 // tag is 0x80 if the elements are oops, 0xC0 if non-oops
102 // hsz is array header size in bytes (i.e., offset of first element)
103 // ebt is the BasicType of the elements
104 // esz is the element size in bytes
105 // This packed word is arranged so as to be quickly unpacked by the
106 // various fast paths that use the various subfields.
107 //
108 // The esz bits can be used directly by a SLL instruction, without masking.
109 //
110 // Note that the array-kind tag looks like 0x00 for instance klasses,
111 // since their length in bytes is always less than 24Mb.
112 //
113 // Final note: This comes first, immediately after C++ vtable,
114 // because it is frequently queried.
115 jint _layout_helper;
116
117 // Klass identifier used to implement devirtualized oop closure dispatching.
118 const KlassID _id;
119
120 // vtable length
121 int _vtable_len;
122
123 // The fields _super_check_offset, _secondary_super_cache, _secondary_supers
124 // and _primary_supers all help make fast subtype checks. See big discussion
125 // in doc/server_compiler/checktype.txt
126 //
127 // Where to look to observe a supertype (it is &_secondary_super_cache for
128 // secondary supers, else is &_primary_supers[depth()].
129 juint _super_check_offset;
130
131 // Class name. Instance classes: java/lang/String, etc. Array classes: [I,
132 // [Ljava/lang/String;, etc. Set to zero for all other kinds of classes.
133 Symbol* _name;
134
135 // Cache of last observed secondary supertype
136 Klass* _secondary_super_cache;
137 // Array of all secondary supertypes
138 Array<Klass*>* _secondary_supers;
139 // Ordered list of all primary supertypes
140 Klass* _primary_supers[_primary_super_limit];
141 // java/lang/Class instance mirroring this class
142 OopHandle _java_mirror;
143 // Superclass
144 Klass* _super;
145 // First subclass (NULL if none); _subklass->next_sibling() is next one
146 Klass* volatile _subklass;
147 // Sibling link (or NULL); links all subklasses of a klass
148 Klass* volatile _next_sibling;
149
150 // All klasses loaded by a class loader are chained through these links
151 Klass* _next_link;
152
153 // The VM's representation of the ClassLoader used to load this class.
154 // Provide access the corresponding instance java.lang.ClassLoader.
155 ClassLoaderData* _class_loader_data;
156
157 jint _modifier_flags; // Processed access flags, for use by Class.getModifiers.
158 AccessFlags _access_flags; // Access flags. The class/interface distinction is stored here.
159
160 JFR_ONLY(DEFINE_TRACE_ID_FIELD;)
161
162 // Biased locking implementation and statistics
163 // (the 64-bit chunk goes first, to avoid some fragmentation)
164 jlong _last_biased_lock_bulk_revocation_time;
165 markWord _prototype_header; // Used when biased locking is both enabled and disabled for this type
166 jint _biased_lock_revocation_count;
167
168 private:
169 // This is an index into FileMapHeader::_shared_path_table[], to
170 // associate this class with the JAR file where it's loaded from during
171 // dump time. If a class is not loaded from the shared archive, this field is
172 // -1.
173 jshort _shared_class_path_index;
174
175 #if INCLUDE_CDS
176 // Flags of the current shared class.
177 u2 _shared_class_flags;
178 enum {
179 _has_raw_archived_mirror = 1
180 };
181 #endif
182
183 // The _archived_mirror is set at CDS dump time pointing to the cached mirror
184 // in the open archive heap region when archiving java object is supported.
185 CDS_JAVA_HEAP_ONLY(narrowOop _archived_mirror;)
186
187 protected:
188
189 // Constructor
190 Klass(KlassID id);
191 Klass() : _id(KlassID(-1)) { assert(DumpSharedSpaces || UseSharedSpaces, "only for cds"); }
192
193 void* operator new(size_t size, ClassLoaderData* loader_data, size_t word_size, TRAPS) throw();
194
195 public:
196 int id() { return _id; }
197
198 enum DefaultsLookupMode { find_defaults, skip_defaults };
199 enum OverpassLookupMode { find_overpass, skip_overpass };
200 enum StaticLookupMode { find_static, skip_static };
201 enum PrivateLookupMode { find_private, skip_private };
202
203 bool is_klass() const volatile { return true; }
204
205 // super() cannot be InstanceKlass* -- Java arrays are covariant, and _super is used
206 // to implement that. NB: the _super of "[Ljava/lang/Integer;" is "[Ljava/lang/Number;"
207 // If this is not what your code expects, you're probably looking for Klass::java_super().
208 Klass* super() const { return _super; }
209 void set_super(Klass* k) { _super = k; }
210
211 // initializes _super link, _primary_supers & _secondary_supers arrays
212 void initialize_supers(Klass* k, Array<InstanceKlass*>* transitive_interfaces, TRAPS);
213
214 // klass-specific helper for initializing _secondary_supers
215 virtual GrowableArray<Klass*>* compute_secondary_supers(int num_extra_slots,
216 Array<InstanceKlass*>* transitive_interfaces);
217
218 // java_super is the Java-level super type as specified by Class.getSuperClass.
219 virtual InstanceKlass* java_super() const { return NULL; }
220
221 juint super_check_offset() const { return _super_check_offset; }
222 void set_super_check_offset(juint o) { _super_check_offset = o; }
223
224 Klass* secondary_super_cache() const { return _secondary_super_cache; }
225 void set_secondary_super_cache(Klass* k) { _secondary_super_cache = k; }
226
227 Array<Klass*>* secondary_supers() const { return _secondary_supers; }
228 void set_secondary_supers(Array<Klass*>* k) { _secondary_supers = k; }
229
230 // Return the element of the _super chain of the given depth.
231 // If there is no such element, return either NULL or this.
232 Klass* primary_super_of_depth(juint i) const {
233 assert(i < primary_super_limit(), "oob");
234 Klass* super = _primary_supers[i];
235 assert(super == NULL || super->super_depth() == i, "correct display");
236 return super;
237 }
238
239 // Can this klass be a primary super? False for interfaces and arrays of
240 // interfaces. False also for arrays or classes with long super chains.
241 bool can_be_primary_super() const {
242 const juint secondary_offset = in_bytes(secondary_super_cache_offset());
243 return super_check_offset() != secondary_offset;
244 }
245 virtual bool can_be_primary_super_slow() const;
246
247 // Returns number of primary supers; may be a number in the inclusive range [0, primary_super_limit].
248 juint super_depth() const {
249 if (!can_be_primary_super()) {
250 return primary_super_limit();
251 } else {
252 juint d = (super_check_offset() - in_bytes(primary_supers_offset())) / sizeof(Klass*);
253 assert(d < primary_super_limit(), "oob");
254 assert(_primary_supers[d] == this, "proper init");
255 return d;
256 }
257 }
258
259 // java mirror
260 oop java_mirror() const;
261 oop java_mirror_no_keepalive() const;
262 void set_java_mirror(Handle m);
263
264 oop archived_java_mirror_raw() NOT_CDS_JAVA_HEAP_RETURN_(NULL); // no GC barrier
265 narrowOop archived_java_mirror_raw_narrow() NOT_CDS_JAVA_HEAP_RETURN_(0); // no GC barrier
266 void set_archived_java_mirror_raw(oop m) NOT_CDS_JAVA_HEAP_RETURN; // no GC barrier
267
268 // Temporary mirror switch used by RedefineClasses
269 // Both mirrors are on the ClassLoaderData::_handles list already so no
270 // barriers are needed.
271 void set_java_mirror_handle(OopHandle mirror) { _java_mirror = mirror; }
272 OopHandle java_mirror_handle() const {
273 return _java_mirror;
274 }
275
276 // modifier flags
277 jint modifier_flags() const { return _modifier_flags; }
278 void set_modifier_flags(jint flags) { _modifier_flags = flags; }
279
280 // size helper
281 int layout_helper() const { return _layout_helper; }
282 void set_layout_helper(int lh) { _layout_helper = lh; }
283
284 // Note: for instances layout_helper() may include padding.
285 // Use InstanceKlass::contains_field_offset to classify field offsets.
286
287 // sub/superklass links
288 Klass* subklass(bool log = false) const;
289 Klass* next_sibling(bool log = false) const;
290
291 InstanceKlass* superklass() const;
292 void append_to_sibling_list(); // add newly created receiver to superklass' subklass list
293
294 void set_next_link(Klass* k) { _next_link = k; }
295 Klass* next_link() const { return _next_link; } // The next klass defined by the class loader.
296
297 // class loader data
298 ClassLoaderData* class_loader_data() const { return _class_loader_data; }
299 void set_class_loader_data(ClassLoaderData* loader_data) { _class_loader_data = loader_data; }
300
301 int shared_classpath_index() const {
302 return _shared_class_path_index;
303 };
304
305 void set_shared_classpath_index(int index) {
306 _shared_class_path_index = index;
307 };
308
309 void set_has_raw_archived_mirror() {
310 CDS_ONLY(_shared_class_flags |= _has_raw_archived_mirror;)
311 }
312 void clear_has_raw_archived_mirror() {
313 CDS_ONLY(_shared_class_flags &= ~_has_raw_archived_mirror;)
314 }
315 bool has_raw_archived_mirror() const {
316 CDS_ONLY(return (_shared_class_flags & _has_raw_archived_mirror) != 0;)
317 NOT_CDS(return false;)
318 }
319
320 // Obtain the module or package for this class
321 virtual ModuleEntry* module() const = 0;
322 virtual PackageEntry* package() const = 0;
323
324 protected: // internal accessors
325 void set_subklass(Klass* s);
326 void set_next_sibling(Klass* s);
327
328 public:
329
330 // Compiler support
331 static ByteSize super_offset() { return in_ByteSize(offset_of(Klass, _super)); }
332 static ByteSize super_check_offset_offset() { return in_ByteSize(offset_of(Klass, _super_check_offset)); }
333 static ByteSize primary_supers_offset() { return in_ByteSize(offset_of(Klass, _primary_supers)); }
334 static ByteSize secondary_super_cache_offset() { return in_ByteSize(offset_of(Klass, _secondary_super_cache)); }
335 static ByteSize secondary_supers_offset() { return in_ByteSize(offset_of(Klass, _secondary_supers)); }
336 static ByteSize java_mirror_offset() { return in_ByteSize(offset_of(Klass, _java_mirror)); }
337 static ByteSize class_loader_data_offset() { return in_ByteSize(offset_of(Klass, _class_loader_data)); }
338 static ByteSize modifier_flags_offset() { return in_ByteSize(offset_of(Klass, _modifier_flags)); }
339 static ByteSize layout_helper_offset() { return in_ByteSize(offset_of(Klass, _layout_helper)); }
340 static ByteSize access_flags_offset() { return in_ByteSize(offset_of(Klass, _access_flags)); }
341
342 // Unpacking layout_helper:
343 static const int _lh_neutral_value = 0; // neutral non-array non-instance value
344 static const int _lh_instance_slow_path_bit = 0x01;
345 static const int _lh_log2_element_size_shift = BitsPerByte*0;
346 static const int _lh_log2_element_size_mask = BitsPerLong-1;
347 static const int _lh_element_type_shift = BitsPerByte*1;
348 static const int _lh_element_type_mask = right_n_bits(BitsPerByte); // shifted mask
349 static const int _lh_header_size_shift = BitsPerByte*2;
350 static const int _lh_header_size_mask = right_n_bits(BitsPerByte); // shifted mask
351 static const int _lh_array_tag_bits = 2;
352 static const int _lh_array_tag_shift = BitsPerInt - _lh_array_tag_bits;
353 static const int _lh_array_tag_obj_value = ~0x01; // 0x80000000 >> 30
354
355 static const unsigned int _lh_array_tag_type_value = 0Xffffffff; // ~0x00, // 0xC0000000 >> 30
356
357 static int layout_helper_size_in_bytes(jint lh) {
358 assert(lh > (jint)_lh_neutral_value, "must be instance");
359 return (int) lh & ~_lh_instance_slow_path_bit;
360 }
361 static bool layout_helper_needs_slow_path(jint lh) {
362 assert(lh > (jint)_lh_neutral_value, "must be instance");
363 return (lh & _lh_instance_slow_path_bit) != 0;
364 }
365 static bool layout_helper_is_instance(jint lh) {
366 return (jint)lh > (jint)_lh_neutral_value;
367 }
368 static bool layout_helper_is_array(jint lh) {
369 return (jint)lh < (jint)_lh_neutral_value;
370 }
371 static bool layout_helper_is_typeArray(jint lh) {
372 // _lh_array_tag_type_value == (lh >> _lh_array_tag_shift);
373 return (juint)lh >= (juint)(_lh_array_tag_type_value << _lh_array_tag_shift);
374 }
375 static bool layout_helper_is_objArray(jint lh) {
376 // _lh_array_tag_obj_value == (lh >> _lh_array_tag_shift);
377 return (jint)lh < (jint)(_lh_array_tag_type_value << _lh_array_tag_shift);
378 }
379 static int layout_helper_header_size(jint lh) {
380 assert(lh < (jint)_lh_neutral_value, "must be array");
381 int hsize = (lh >> _lh_header_size_shift) & _lh_header_size_mask;
382 assert(hsize > 0 && hsize < (int)sizeof(oopDesc)*3, "sanity");
383 return hsize;
384 }
385 static BasicType layout_helper_element_type(jint lh) {
386 assert(lh < (jint)_lh_neutral_value, "must be array");
387 int btvalue = (lh >> _lh_element_type_shift) & _lh_element_type_mask;
388 assert(btvalue >= T_BOOLEAN && btvalue <= T_OBJECT, "sanity");
389 return (BasicType) btvalue;
390 }
391
392 // Want a pattern to quickly diff against layout header in register
393 // find something less clever!
394 static int layout_helper_boolean_diffbit() {
395 jint zlh = array_layout_helper(T_BOOLEAN);
396 jint blh = array_layout_helper(T_BYTE);
397 assert(zlh != blh, "array layout helpers must differ");
398 int diffbit = 1;
399 while ((diffbit & (zlh ^ blh)) == 0 && (diffbit & zlh) == 0) {
400 diffbit <<= 1;
401 assert(diffbit != 0, "make sure T_BOOLEAN has a different bit than T_BYTE");
402 }
403 return diffbit;
404 }
405
406 static int layout_helper_log2_element_size(jint lh) {
407 assert(lh < (jint)_lh_neutral_value, "must be array");
408 int l2esz = (lh >> _lh_log2_element_size_shift) & _lh_log2_element_size_mask;
409 assert(l2esz <= LogBytesPerLong,
410 "sanity. l2esz: 0x%x for lh: 0x%x", (uint)l2esz, (uint)lh);
411 return l2esz;
412 }
413 static jint array_layout_helper(jint tag, int hsize, BasicType etype, int log2_esize) {
414 return (tag << _lh_array_tag_shift)
415 | (hsize << _lh_header_size_shift)
416 | ((int)etype << _lh_element_type_shift)
417 | (log2_esize << _lh_log2_element_size_shift);
418 }
419 static jint instance_layout_helper(jint size, bool slow_path_flag) {
420 return (size << LogBytesPerWord)
421 | (slow_path_flag ? _lh_instance_slow_path_bit : 0);
422 }
423 static int layout_helper_to_size_helper(jint lh) {
424 assert(lh > (jint)_lh_neutral_value, "must be instance");
425 // Note that the following expression discards _lh_instance_slow_path_bit.
426 return lh >> LogBytesPerWord;
427 }
428 // Out-of-line version computes everything based on the etype:
429 static jint array_layout_helper(BasicType etype);
430
431 // What is the maximum number of primary superclasses any klass can have?
432 static juint primary_super_limit() { return _primary_super_limit; }
433
434 // vtables
435 klassVtable vtable() const;
436 int vtable_length() const { return _vtable_len; }
437
438 // subclass check
439 bool is_subclass_of(const Klass* k) const;
440 // subtype check: true if is_subclass_of, or if k is interface and receiver implements it
441 bool is_subtype_of(Klass* k) const {
442 juint off = k->super_check_offset();
443 Klass* sup = *(Klass**)( (address)this + off );
444 const juint secondary_offset = in_bytes(secondary_super_cache_offset());
445 if (sup == k) {
446 return true;
447 } else if (off != secondary_offset) {
448 return false;
449 } else {
450 return search_secondary_supers(k);
451 }
452 }
453
454 bool search_secondary_supers(Klass* k) const;
455
456 // Find LCA in class hierarchy
457 Klass *LCA( Klass *k );
458
459 // Check whether reflection/jni/jvm code is allowed to instantiate this class;
460 // if not, throw either an Error or an Exception.
461 virtual void check_valid_for_instantiation(bool throwError, TRAPS);
462
463 // array copying
464 virtual void copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS);
465
466 // tells if the class should be initialized
467 virtual bool should_be_initialized() const { return false; }
468 // initializes the klass
469 virtual void initialize(TRAPS);
470 virtual Klass* find_field(Symbol* name, Symbol* signature, fieldDescriptor* fd) const;
471 virtual Method* uncached_lookup_method(const Symbol* name, const Symbol* signature,
472 OverpassLookupMode overpass_mode,
473 PrivateLookupMode = find_private) const;
474 public:
475 Method* lookup_method(const Symbol* name, const Symbol* signature) const {
476 return uncached_lookup_method(name, signature, find_overpass);
477 }
478
479 // array class with specific rank
480 Klass* array_klass(int rank, TRAPS) { return array_klass_impl(false, rank, THREAD); }
481
482 // array class with this klass as element type
483 Klass* array_klass(TRAPS) { return array_klass_impl(false, THREAD); }
484
485 // These will return NULL instead of allocating on the heap:
486 // NB: these can block for a mutex, like other functions with TRAPS arg.
487 Klass* array_klass_or_null(int rank);
488 Klass* array_klass_or_null();
489
490 virtual oop protection_domain() const = 0;
491
492 oop class_loader() const;
493
494 // This loads the klass's holder as a phantom. This is useful when a weak Klass
495 // pointer has been "peeked" and then must be kept alive before it may
496 // be used safely. All uses of klass_holder need to apply the appropriate barriers,
497 // except during GC.
498 oop klass_holder() const { return class_loader_data()->holder_phantom(); }
499
500 protected:
501 virtual Klass* array_klass_impl(bool or_null, int rank, TRAPS);
502 virtual Klass* array_klass_impl(bool or_null, TRAPS);
503
504 // Error handling when length > max_length or length < 0
505 static void check_array_allocation_length(int length, int max_length, TRAPS);
506
507 void set_vtable_length(int len) { _vtable_len= len; }
508
509 vtableEntry* start_of_vtable() const;
510 void restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS);
511 public:
512 Method* method_at_vtable(int index);
513
514 static ByteSize vtable_start_offset();
515 static ByteSize vtable_length_offset() {
516 return byte_offset_of(Klass, _vtable_len);
517 }
518
519 // CDS support - remove and restore oops from metadata. Oops are not shared.
520 virtual void remove_unshareable_info();
521 virtual void remove_java_mirror();
522
523 bool is_unshareable_info_restored() const {
524 assert(is_shared(), "use this for shared classes only");
525 if (has_raw_archived_mirror()) {
526 // _java_mirror is not a valid OopHandle but rather an encoded reference in the shared heap
527 return false;
528 } else if (_java_mirror.ptr_raw() == NULL) {
529 return false;
530 } else {
531 return true;
532 }
533 }
534
535 public:
536 // ALL FUNCTIONS BELOW THIS POINT ARE DISPATCHED FROM AN OOP
537 // These functions describe behavior for the oop not the KLASS.
538
539 // actual oop size of obj in memory
540 virtual int oop_size(oop obj) const = 0;
541
542 // Size of klass in word size.
543 virtual int size() const = 0;
544
545 // Returns the Java name for a class (Resource allocated)
546 // For arrays, this returns the name of the element with a leading '['.
547 // For classes, this returns the name with the package separators
548 // turned into '.'s.
549 const char* external_name() const;
550 // Returns the name for a class (Resource allocated) as the class
551 // would appear in a signature.
552 // For arrays, this returns the name of the element with a leading '['.
553 // For classes, this returns the name with a leading 'L' and a trailing ';'
554 // and the package separators as '/'.
555 virtual const char* signature_name() const;
556
557 const char* joint_in_module_of_loader(const Klass* class2, bool include_parent_loader = false) const;
558 const char* class_in_module_of_loader(bool use_are = false, bool include_parent_loader = false) const;
559
560 // Returns "interface", "abstract class" or "class".
561 const char* external_kind() const;
562
563 // type testing operations
564 #ifdef ASSERT
565 protected:
566 virtual bool is_instance_klass_slow() const { return false; }
567 virtual bool is_array_klass_slow() const { return false; }
568 virtual bool is_objArray_klass_slow() const { return false; }
569 virtual bool is_typeArray_klass_slow() const { return false; }
570 #endif // ASSERT
571 public:
572
573 // Fast non-virtual versions
574 #ifndef ASSERT
575 #define assert_same_query(xval, xcheck) xval
576 #else
577 private:
578 static bool assert_same_query(bool xval, bool xslow) {
579 assert(xval == xslow, "slow and fast queries agree");
580 return xval;
581 }
582 public:
583 #endif
584 inline bool is_instance_klass() const { return assert_same_query(
585 layout_helper_is_instance(layout_helper()),
586 is_instance_klass_slow()); }
587 inline bool is_array_klass() const { return assert_same_query(
588 layout_helper_is_array(layout_helper()),
589 is_array_klass_slow()); }
590 inline bool is_objArray_klass() const { return assert_same_query(
591 layout_helper_is_objArray(layout_helper()),
592 is_objArray_klass_slow()); }
593 inline bool is_typeArray_klass() const { return assert_same_query(
594 layout_helper_is_typeArray(layout_helper()),
595 is_typeArray_klass_slow()); }
596 #undef assert_same_query
597
598 // Access flags
599 AccessFlags access_flags() const { return _access_flags; }
600 void set_access_flags(AccessFlags flags) { _access_flags = flags; }
601
602 bool is_public() const { return _access_flags.is_public(); }
603 bool is_final() const { return _access_flags.is_final(); }
604 bool is_interface() const { return _access_flags.is_interface(); }
605 bool is_abstract() const { return _access_flags.is_abstract(); }
606 bool is_super() const { return _access_flags.is_super(); }
607 bool is_synthetic() const { return _access_flags.is_synthetic(); }
608 void set_is_synthetic() { _access_flags.set_is_synthetic(); }
609 bool has_finalizer() const { return _access_flags.has_finalizer(); }
610 bool has_final_method() const { return _access_flags.has_final_method(); }
611 void set_has_finalizer() { _access_flags.set_has_finalizer(); }
612 void set_has_final_method() { _access_flags.set_has_final_method(); }
613 bool has_vanilla_constructor() const { return _access_flags.has_vanilla_constructor(); }
614 void set_has_vanilla_constructor() { _access_flags.set_has_vanilla_constructor(); }
615 bool has_miranda_methods () const { return access_flags().has_miranda_methods(); }
616 void set_has_miranda_methods() { _access_flags.set_has_miranda_methods(); }
617 bool is_shared() const { return access_flags().is_shared_class(); } // shadows MetaspaceObj::is_shared)()
618 void set_is_shared() { _access_flags.set_is_shared_class(); }
619 bool is_hidden() const { return access_flags().is_hidden_class(); }
620 void set_is_hidden() { _access_flags.set_is_hidden_class(); }
621 bool is_non_strong_hidden() const { return access_flags().is_hidden_class() &&
622 class_loader_data()->has_class_mirror_holder(); }
623
624 bool is_cloneable() const;
625 void set_is_cloneable();
626
627 // Biased locking support
628 // Note: the prototype header is always set up to be at least the
629 // prototype markWord. If biased locking is enabled it may further be
630 // biasable and have an epoch.
631 markWord prototype_header() const { return _prototype_header; }
632 // NOTE: once instances of this klass are floating around in the
633 // system, this header must only be updated at a safepoint.
634 // NOTE 2: currently we only ever set the prototype header to the
635 // biasable prototype for instanceKlasses. There is no technical
636 // reason why it could not be done for arrayKlasses aside from
637 // wanting to reduce the initial scope of this optimization. There
638 // are potential problems in setting the bias pattern for
639 // JVM-internal oops.
640 inline void set_prototype_header(markWord header);
641 static ByteSize prototype_header_offset() { return in_ByteSize(offset_of(Klass, _prototype_header)); }
642
643 int biased_lock_revocation_count() const { return (int) _biased_lock_revocation_count; }
644 // Atomically increments biased_lock_revocation_count and returns updated value
645 int atomic_incr_biased_lock_revocation_count();
646 void set_biased_lock_revocation_count(int val) { _biased_lock_revocation_count = (jint) val; }
647 jlong last_biased_lock_bulk_revocation_time() { return _last_biased_lock_bulk_revocation_time; }
648 void set_last_biased_lock_bulk_revocation_time(jlong cur_time) { _last_biased_lock_bulk_revocation_time = cur_time; }
649
650 JFR_ONLY(DEFINE_TRACE_ID_METHODS;)
651
652 virtual void metaspace_pointers_do(MetaspaceClosure* iter);
653 virtual MetaspaceObj::Type type() const { return ClassType; }
654
655 // Iff the class loader (or mirror for unsafe anonymous classes) is alive the
656 // Klass is considered alive. This is safe to call before the CLD is marked as
657 // unloading, and hence during concurrent class unloading.
658 bool is_loader_alive() const { return class_loader_data()->is_alive(); }
659
660 void clean_subklass();
661
662 static void clean_weak_klass_links(bool unloading_occurred, bool clean_alive_klasses = true);
663 static void clean_subklass_tree() {
664 clean_weak_klass_links(/*unloading_occurred*/ true , /* clean_alive_klasses */ false);
665 }
666
667 virtual void array_klasses_do(void f(Klass* k)) {}
668
669 // Return self, except for abstract classes with exactly 1
670 // implementor. Then return the 1 concrete implementation.
671 Klass *up_cast_abstract();
672
673 // klass name
674 Symbol* name() const { return _name; }
675 void set_name(Symbol* n);
676
677 public:
678 // jvm support
679 virtual jint compute_modifier_flags(TRAPS) const;
680
681 // JVMTI support
682 virtual jint jvmti_class_status() const;
683
684 // Printing
685 virtual void print_on(outputStream* st) const;
686
687 virtual void oop_print_value_on(oop obj, outputStream* st);
688 virtual void oop_print_on (oop obj, outputStream* st);
689
690 virtual const char* internal_name() const = 0;
691
692 // Verification
693 virtual void verify_on(outputStream* st);
694 void verify() { verify_on(tty); }
695
696 #ifndef PRODUCT
697 bool verify_vtable_index(int index);
698 #endif
699
700 virtual void oop_verify_on(oop obj, outputStream* st);
701
702 // for error reporting
703 static bool is_valid(Klass* k);
704 };
705
706 #endif // SHARE_OOPS_KLASS_HPP