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