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