annotate src/share/vm/oops/klass.hpp @ 5820:87ee5ee27509

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