Mercurial > hg > graal-compiler
annotate src/share/vm/oops/klass.hpp @ 1941:79d04223b8a5
Added caching for resolved types and resolved fields.
This is crucial, because the local load elimination will lead to wrong results, if field equality (of two RiField objects with the same object and the same RiType) is not given. The caching makes sure that the default equals implementation is sufficient.
| author | Thomas Wuerthinger <wuerthinger@ssw.jku.at> |
|---|---|
| date | Tue, 28 Dec 2010 18:33:26 +0100 |
| parents | 126ea7725993 |
| children | 06f017f7daa7 |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1155
diff
changeset
|
2 * Copyright (c) 1997, 2009, Oracle and/or its affiliates. All rights reserved. |
| 0 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1155
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1155
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1155
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 25 // A Klass is the part of the klassOop that provides: | |
| 26 // 1: language level class object (method dictionary etc.) | |
| 27 // 2: provide vm dispatch behavior for the object | |
| 28 // Both functions are combined into one C++ class. The toplevel class "Klass" | |
| 29 // implements purpose 1 whereas all subclasses provide extra virtual functions | |
| 30 // for purpose 2. | |
| 31 | |
| 32 // One reason for the oop/klass dichotomy in the implementation is | |
| 33 // that we don't want a C++ vtbl pointer in every object. Thus, | |
| 34 // normal oops don't have any virtual functions. Instead, they | |
| 35 // forward all "virtual" functions to their klass, which does have | |
| 36 // a vtbl and does the C++ dispatch depending on the object's | |
| 37 // actual type. (See oop.inline.hpp for some of the forwarding code.) | |
| 38 // ALL FUNCTIONS IMPLEMENTING THIS DISPATCH ARE PREFIXED WITH "oop_"! | |
| 39 | |
| 40 // Klass layout: | |
| 41 // [header ] klassOop | |
| 42 // [klass pointer ] klassOop | |
| 43 // [C++ vtbl ptr ] (contained in Klass_vtbl) | |
| 44 // [layout_helper ] | |
| 45 // [super_check_offset ] for fast subtype checks | |
| 46 // [secondary_super_cache] for fast subtype checks | |
| 47 // [secondary_supers ] array of 2ndary supertypes | |
| 48 // [primary_supers 0] | |
| 49 // [primary_supers 1] | |
| 50 // [primary_supers 2] | |
| 51 // ... | |
| 52 // [primary_supers 7] | |
| 53 // [java_mirror ] | |
| 54 // [super ] | |
| 55 // [name ] | |
| 56 // [first subklass] | |
| 57 // [next_sibling ] link to chain additional subklasses | |
| 58 // [modifier_flags] | |
| 59 // [access_flags ] | |
| 60 // [verify_count ] - not in product | |
| 61 // [alloc_count ] | |
| 62 // [last_biased_lock_bulk_revocation_time] (64 bits) | |
| 63 // [prototype_header] | |
| 64 // [biased_lock_revocation_count] | |
| 65 | |
| 66 | |
| 67 // Forward declarations. | |
| 68 class klassVtable; | |
| 69 class KlassHandle; | |
| 70 class OrderAccess; | |
| 71 | |
| 72 // Holder (or cage) for the C++ vtable of each kind of Klass. | |
| 73 // We want to tightly constrain the location of the C++ vtable in the overall layout. | |
| 74 class Klass_vtbl { | |
| 75 protected: | |
| 76 // The following virtual exists only to force creation of a C++ vtable, | |
| 77 // so that this class truly is the location of the vtable of all Klasses. | |
| 78 virtual void unused_initial_virtual() { } | |
| 79 | |
| 80 public: | |
| 81 // The following virtual makes Klass_vtbl play a second role as a | |
| 82 // factory protocol for subclasses of Klass ("sub-Klasses"). | |
| 83 // Here's how it works.... | |
| 84 // | |
| 85 // This VM uses metaobjects as factories for their instances. | |
| 86 // | |
| 87 // In order to initialize the C++ vtable of a new instance, its | |
| 88 // metaobject is forced to use the C++ placed new operator to | |
| 89 // allocate the instance. In a typical C++-based system, each | |
| 90 // sub-class would have its own factory routine which | |
| 91 // directly uses the placed new operator on the desired class, | |
| 92 // and then calls the appropriate chain of C++ constructors. | |
| 93 // | |
| 94 // However, this system uses shared code to performs the first | |
| 95 // allocation and initialization steps for all sub-Klasses. | |
| 96 // (See base_create_klass() and base_create_array_klass().) | |
| 97 // This does not factor neatly into a hierarchy of C++ constructors. | |
| 98 // Each caller of these shared "base_create" routines knows | |
| 99 // exactly which sub-Klass it is creating, but the shared routine | |
| 100 // does not, even though it must perform the actual allocation. | |
| 101 // | |
| 102 // Therefore, the caller of the shared "base_create" must wrap | |
| 103 // the specific placed new call in a virtual function which | |
| 104 // performs the actual allocation and vtable set-up. That | |
| 105 // virtual function is here, Klass_vtbl::allocate_permanent. | |
| 106 // | |
| 107 // The arguments to Universe::allocate_permanent() are passed | |
| 108 // straight through the placed new operator, which in turn | |
| 109 // obtains them directly from this virtual call. | |
| 110 // | |
| 111 // This virtual is called on a temporary "example instance" of the | |
| 112 // sub-Klass being instantiated, a C++ auto variable. The "real" | |
| 113 // instance created by this virtual is on the VM heap, where it is | |
| 114 // equipped with a klassOopDesc header. | |
| 115 // | |
| 116 // It is merely an accident of implementation that we use "example | |
| 117 // instances", but that is why the virtual function which implements | |
| 118 // each sub-Klass factory happens to be defined by the same sub-Klass | |
| 119 // for which it creates instances. | |
| 120 // | |
| 121 // The vtbl_value() call (see below) is used to strip away the | |
| 122 // accidental Klass-ness from an "example instance" and present it as | |
| 123 // a factory. Think of each factory object as a mere container of the | |
| 124 // C++ vtable for the desired sub-Klass. Since C++ does not allow | |
| 125 // direct references to vtables, the factory must also be delegated | |
| 126 // the task of allocating the instance, but the essential point is | |
| 127 // that the factory knows how to initialize the C++ vtable with the | |
| 128 // right pointer value. All other common initializations are handled | |
| 129 // by the shared "base_create" subroutines. | |
| 130 // | |
| 131 virtual void* allocate_permanent(KlassHandle& klass, int size, TRAPS) const = 0; | |
| 132 void post_new_init_klass(KlassHandle& klass, klassOop obj, int size) const; | |
| 133 | |
| 134 // Every subclass on which vtbl_value is called must include this macro. | |
| 135 // Delay the installation of the klassKlass pointer until after the | |
| 136 // the vtable for a new klass has been installed (after the call to new()). | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
137 #define DEFINE_ALLOCATE_PERMANENT(thisKlass) \ |
| 0 | 138 void* allocate_permanent(KlassHandle& klass_klass, int size, TRAPS) const { \ |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
139 void* result = new(klass_klass, size, THREAD) thisKlass(); \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
140 if (HAS_PENDING_EXCEPTION) return NULL; \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
141 klassOop new_klass = ((Klass*) result)->as_klassOop(); \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
142 OrderAccess::storestore(); \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
143 post_new_init_klass(klass_klass, new_klass, size); \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
144 return result; \ |
| 0 | 145 } |
| 146 | |
| 147 bool null_vtbl() { return *(intptr_t*)this == 0; } | |
| 148 | |
| 149 protected: | |
| 150 void* operator new(size_t ignored, KlassHandle& klass, int size, TRAPS); | |
| 151 }; | |
| 152 | |
| 153 | |
| 154 class Klass : public Klass_vtbl { | |
| 155 friend class VMStructs; | |
| 156 protected: | |
| 157 // note: put frequently-used fields together at start of klass structure | |
| 158 // for better cache behavior (may not make much of a difference but sure won't hurt) | |
| 159 enum { _primary_super_limit = 8 }; | |
| 160 | |
| 161 // The "layout helper" is a combined descriptor of object layout. | |
| 162 // For klasses which are neither instance nor array, the value is zero. | |
| 163 // | |
| 164 // For instances, layout helper is a positive number, the instance size. | |
| 165 // This size is already passed through align_object_size and scaled to bytes. | |
| 166 // The low order bit is set if instances of this class cannot be | |
| 167 // allocated using the fastpath. | |
| 168 // | |
| 169 // For arrays, layout helper is a negative number, containing four | |
| 170 // distinct bytes, as follows: | |
| 171 // MSB:[tag, hsz, ebt, log2(esz)]:LSB | |
| 172 // where: | |
| 173 // tag is 0x80 if the elements are oops, 0xC0 if non-oops | |
| 174 // hsz is array header size in bytes (i.e., offset of first element) | |
| 175 // ebt is the BasicType of the elements | |
| 176 // esz is the element size in bytes | |
| 177 // This packed word is arranged so as to be quickly unpacked by the | |
| 178 // various fast paths that use the various subfields. | |
| 179 // | |
| 180 // The esz bits can be used directly by a SLL instruction, without masking. | |
| 181 // | |
| 182 // Note that the array-kind tag looks like 0x00 for instance klasses, | |
| 183 // since their length in bytes is always less than 24Mb. | |
| 184 // | |
| 185 // Final note: This comes first, immediately after Klass_vtbl, | |
| 186 // because it is frequently queried. | |
| 187 jint _layout_helper; | |
| 188 | |
| 189 // The fields _super_check_offset, _secondary_super_cache, _secondary_supers | |
| 190 // and _primary_supers all help make fast subtype checks. See big discussion | |
| 191 // in doc/server_compiler/checktype.txt | |
| 192 // | |
| 193 // Where to look to observe a supertype (it is &_secondary_super_cache for | |
| 194 // secondary supers, else is &_primary_supers[depth()]. | |
| 195 juint _super_check_offset; | |
| 196 | |
| 197 public: | |
| 198 oop* oop_block_beg() const { return adr_secondary_super_cache(); } | |
| 199 oop* oop_block_end() const { return adr_next_sibling() + 1; } | |
| 200 | |
| 201 protected: | |
| 202 // | |
| 203 // The oop block. All oop fields must be declared here and only oop fields | |
| 204 // may be declared here. In addition, the first and last fields in this block | |
| 205 // must remain first and last, unless oop_block_beg() and/or oop_block_end() | |
| 206 // are updated. Grouping the oop fields in a single block simplifies oop | |
| 207 // iteration. | |
| 208 // | |
| 209 | |
| 210 // Cache of last observed secondary supertype | |
| 211 klassOop _secondary_super_cache; | |
| 212 // Array of all secondary supertypes | |
| 213 objArrayOop _secondary_supers; | |
| 214 // Ordered list of all primary supertypes | |
| 215 klassOop _primary_supers[_primary_super_limit]; | |
| 216 // java/lang/Class instance mirroring this class | |
| 217 oop _java_mirror; | |
|
1941
79d04223b8a5
Added caching for resolved types and resolved fields.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1681
diff
changeset
|
218 // com/sun/hotspot/c1x/HotSpotTypeResolved mirroring this class |
|
79d04223b8a5
Added caching for resolved types and resolved fields.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1681
diff
changeset
|
219 oop _c1x_mirror; |
| 0 | 220 // Superclass |
| 221 klassOop _super; | |
| 222 // Class name. Instance classes: java/lang/String, etc. Array classes: [I, | |
| 223 // [Ljava/lang/String;, etc. Set to zero for all other kinds of classes. | |
| 224 symbolOop _name; | |
| 225 // First subclass (NULL if none); _subklass->next_sibling() is next one | |
| 226 klassOop _subklass; | |
| 227 // Sibling link (or NULL); links all subklasses of a klass | |
| 228 klassOop _next_sibling; | |
| 229 | |
| 230 // | |
| 231 // End of the oop block. | |
| 232 // | |
| 233 | |
| 234 jint _modifier_flags; // Processed access flags, for use by Class.getModifiers. | |
| 235 AccessFlags _access_flags; // Access flags. The class/interface distinction is stored here. | |
| 236 | |
| 237 #ifndef PRODUCT | |
| 238 int _verify_count; // to avoid redundant verifies | |
| 239 #endif | |
| 240 | |
| 241 juint _alloc_count; // allocation profiling support - update klass_size_in_bytes() if moved/deleted | |
| 242 | |
| 243 // Biased locking implementation and statistics | |
| 244 // (the 64-bit chunk goes first, to avoid some fragmentation) | |
| 245 jlong _last_biased_lock_bulk_revocation_time; | |
| 246 markOop _prototype_header; // Used when biased locking is both enabled and disabled for this type | |
| 247 jint _biased_lock_revocation_count; | |
| 248 | |
| 249 public: | |
| 250 | |
| 251 // returns the enclosing klassOop | |
| 252 klassOop as_klassOop() const { | |
| 253 // see klassOop.hpp for layout. | |
| 254 return (klassOop) (((char*) this) - sizeof(klassOopDesc)); | |
| 255 } | |
| 256 | |
| 257 public: | |
| 258 // Allocation | |
| 259 const Klass_vtbl& vtbl_value() const { return *this; } // used only on "example instances" | |
| 260 static KlassHandle base_create_klass(KlassHandle& klass, int size, const Klass_vtbl& vtbl, TRAPS); | |
| 261 static klassOop base_create_klass_oop(KlassHandle& klass, int size, const Klass_vtbl& vtbl, TRAPS); | |
| 262 | |
| 263 // super | |
| 264 klassOop super() const { return _super; } | |
| 265 void set_super(klassOop k) { oop_store_without_check((oop*) &_super, (oop) k); } | |
| 266 | |
| 267 // initializes _super link, _primary_supers & _secondary_supers arrays | |
| 268 void initialize_supers(klassOop k, TRAPS); | |
| 269 void initialize_supers_impl1(klassOop k); | |
| 270 void initialize_supers_impl2(klassOop k); | |
| 271 | |
| 272 // klass-specific helper for initializing _secondary_supers | |
| 273 virtual objArrayOop compute_secondary_supers(int num_extra_slots, TRAPS); | |
| 274 | |
| 275 // java_super is the Java-level super type as specified by Class.getSuperClass. | |
| 276 virtual klassOop java_super() const { return NULL; } | |
| 277 | |
| 278 juint super_check_offset() const { return _super_check_offset; } | |
| 279 void set_super_check_offset(juint o) { _super_check_offset = o; } | |
| 280 | |
| 281 klassOop secondary_super_cache() const { return _secondary_super_cache; } | |
| 282 void set_secondary_super_cache(klassOop k) { oop_store_without_check((oop*) &_secondary_super_cache, (oop) k); } | |
| 283 | |
| 284 objArrayOop secondary_supers() const { return _secondary_supers; } | |
| 285 void set_secondary_supers(objArrayOop k) { oop_store_without_check((oop*) &_secondary_supers, (oop) k); } | |
| 286 | |
| 287 // Return the element of the _super chain of the given depth. | |
| 288 // If there is no such element, return either NULL or this. | |
| 289 klassOop primary_super_of_depth(juint i) const { | |
| 290 assert(i < primary_super_limit(), "oob"); | |
| 291 klassOop super = _primary_supers[i]; | |
| 292 assert(super == NULL || super->klass_part()->super_depth() == i, "correct display"); | |
| 293 return super; | |
| 294 } | |
| 295 | |
| 296 // Can this klass be a primary super? False for interfaces and arrays of | |
| 297 // interfaces. False also for arrays or classes with long super chains. | |
| 298 bool can_be_primary_super() const { | |
| 299 const juint secondary_offset = secondary_super_cache_offset_in_bytes() + sizeof(oopDesc); | |
| 300 return super_check_offset() != secondary_offset; | |
| 301 } | |
| 302 virtual bool can_be_primary_super_slow() const; | |
| 303 | |
| 304 // Returns number of primary supers; may be a number in the inclusive range [0, primary_super_limit]. | |
| 305 juint super_depth() const { | |
| 306 if (!can_be_primary_super()) { | |
| 307 return primary_super_limit(); | |
| 308 } else { | |
| 309 juint d = (super_check_offset() - (primary_supers_offset_in_bytes() + sizeof(oopDesc))) / sizeof(klassOop); | |
| 310 assert(d < primary_super_limit(), "oob"); | |
| 311 assert(_primary_supers[d] == as_klassOop(), "proper init"); | |
| 312 return d; | |
| 313 } | |
| 314 } | |
| 315 | |
| 316 // java mirror | |
| 317 oop java_mirror() const { return _java_mirror; } | |
| 318 void set_java_mirror(oop m) { oop_store((oop*) &_java_mirror, m); } | |
| 319 | |
|
1941
79d04223b8a5
Added caching for resolved types and resolved fields.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1681
diff
changeset
|
320 // c1x mirror |
|
79d04223b8a5
Added caching for resolved types and resolved fields.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1681
diff
changeset
|
321 oop c1x_mirror() const { return _c1x_mirror; } |
|
79d04223b8a5
Added caching for resolved types and resolved fields.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1681
diff
changeset
|
322 void set_c1x_mirror(oop m) { oop_store((oop*) &_c1x_mirror, m); } |
|
79d04223b8a5
Added caching for resolved types and resolved fields.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1681
diff
changeset
|
323 |
| 0 | 324 // modifier flags |
| 325 jint modifier_flags() const { return _modifier_flags; } | |
| 326 void set_modifier_flags(jint flags) { _modifier_flags = flags; } | |
| 327 | |
| 328 // size helper | |
| 329 int layout_helper() const { return _layout_helper; } | |
| 330 void set_layout_helper(int lh) { _layout_helper = lh; } | |
| 331 | |
| 332 // Note: for instances layout_helper() may include padding. | |
| 333 // Use instanceKlass::contains_field_offset to classify field offsets. | |
| 334 | |
| 335 // sub/superklass links | |
| 336 instanceKlass* superklass() const; | |
| 337 Klass* subklass() const; | |
| 338 Klass* next_sibling() const; | |
| 339 void append_to_sibling_list(); // add newly created receiver to superklass' subklass list | |
| 340 void remove_from_sibling_list(); // remove receiver from sibling list | |
| 341 protected: // internal accessors | |
| 342 klassOop subklass_oop() const { return _subklass; } | |
| 343 klassOop next_sibling_oop() const { return _next_sibling; } | |
| 344 void set_subklass(klassOop s); | |
| 345 void set_next_sibling(klassOop s); | |
| 346 | |
| 347 oop* adr_super() const { return (oop*)&_super; } | |
| 348 oop* adr_primary_supers() const { return (oop*)&_primary_supers[0]; } | |
| 349 oop* adr_secondary_super_cache() const { return (oop*)&_secondary_super_cache; } | |
| 350 oop* adr_secondary_supers()const { return (oop*)&_secondary_supers; } | |
| 351 oop* adr_java_mirror() const { return (oop*)&_java_mirror; } | |
|
1941
79d04223b8a5
Added caching for resolved types and resolved fields.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1681
diff
changeset
|
352 oop* adr_c1x_mirror() const { return (oop*)&_c1x_mirror; } |
| 0 | 353 oop* adr_name() const { return (oop*)&_name; } |
| 354 oop* adr_subklass() const { return (oop*)&_subklass; } | |
| 355 oop* adr_next_sibling() const { return (oop*)&_next_sibling; } | |
| 356 | |
| 357 public: | |
| 358 // Allocation profiling support | |
| 359 juint alloc_count() const { return _alloc_count; } | |
| 360 void set_alloc_count(juint n) { _alloc_count = n; } | |
| 361 virtual juint alloc_size() const = 0; | |
| 362 virtual void set_alloc_size(juint n) = 0; | |
| 363 | |
| 364 // Compiler support | |
| 365 static int super_offset_in_bytes() { return offset_of(Klass, _super); } | |
| 366 static int super_check_offset_offset_in_bytes() { return offset_of(Klass, _super_check_offset); } | |
| 367 static int primary_supers_offset_in_bytes(){ return offset_of(Klass, _primary_supers); } | |
| 368 static int secondary_super_cache_offset_in_bytes() { return offset_of(Klass, _secondary_super_cache); } | |
| 369 static int secondary_supers_offset_in_bytes() { return offset_of(Klass, _secondary_supers); } | |
| 370 static int java_mirror_offset_in_bytes() { return offset_of(Klass, _java_mirror); } | |
| 371 static int modifier_flags_offset_in_bytes(){ return offset_of(Klass, _modifier_flags); } | |
| 372 static int layout_helper_offset_in_bytes() { return offset_of(Klass, _layout_helper); } | |
| 373 static int access_flags_offset_in_bytes() { return offset_of(Klass, _access_flags); } | |
| 374 | |
| 375 // Unpacking layout_helper: | |
| 376 enum { | |
| 377 _lh_neutral_value = 0, // neutral non-array non-instance value | |
| 378 _lh_instance_slow_path_bit = 0x01, | |
| 379 _lh_log2_element_size_shift = BitsPerByte*0, | |
| 380 _lh_log2_element_size_mask = BitsPerLong-1, | |
| 381 _lh_element_type_shift = BitsPerByte*1, | |
| 382 _lh_element_type_mask = right_n_bits(BitsPerByte), // shifted mask | |
| 383 _lh_header_size_shift = BitsPerByte*2, | |
| 384 _lh_header_size_mask = right_n_bits(BitsPerByte), // shifted mask | |
| 385 _lh_array_tag_bits = 2, | |
| 386 _lh_array_tag_shift = BitsPerInt - _lh_array_tag_bits, | |
| 387 _lh_array_tag_type_value = ~0x00, // 0xC0000000 >> 30 | |
| 388 _lh_array_tag_obj_value = ~0x01 // 0x80000000 >> 30 | |
| 389 }; | |
| 390 | |
| 391 static int layout_helper_size_in_bytes(jint lh) { | |
| 392 assert(lh > (jint)_lh_neutral_value, "must be instance"); | |
| 393 return (int) lh & ~_lh_instance_slow_path_bit; | |
| 394 } | |
| 395 static bool layout_helper_needs_slow_path(jint lh) { | |
| 396 assert(lh > (jint)_lh_neutral_value, "must be instance"); | |
| 397 return (lh & _lh_instance_slow_path_bit) != 0; | |
| 398 } | |
| 399 static bool layout_helper_is_instance(jint lh) { | |
| 400 return (jint)lh > (jint)_lh_neutral_value; | |
| 401 } | |
| 402 static bool layout_helper_is_javaArray(jint lh) { | |
| 403 return (jint)lh < (jint)_lh_neutral_value; | |
| 404 } | |
| 405 static bool layout_helper_is_typeArray(jint lh) { | |
| 406 // _lh_array_tag_type_value == (lh >> _lh_array_tag_shift); | |
| 407 return (juint)lh >= (juint)(_lh_array_tag_type_value << _lh_array_tag_shift); | |
| 408 } | |
| 409 static bool layout_helper_is_objArray(jint lh) { | |
| 410 // _lh_array_tag_obj_value == (lh >> _lh_array_tag_shift); | |
| 411 return (jint)lh < (jint)(_lh_array_tag_type_value << _lh_array_tag_shift); | |
| 412 } | |
| 413 static int layout_helper_header_size(jint lh) { | |
| 414 assert(lh < (jint)_lh_neutral_value, "must be array"); | |
| 415 int hsize = (lh >> _lh_header_size_shift) & _lh_header_size_mask; | |
| 416 assert(hsize > 0 && hsize < (int)sizeof(oopDesc)*3, "sanity"); | |
| 417 return hsize; | |
| 418 } | |
| 419 static BasicType layout_helper_element_type(jint lh) { | |
| 420 assert(lh < (jint)_lh_neutral_value, "must be array"); | |
| 421 int btvalue = (lh >> _lh_element_type_shift) & _lh_element_type_mask; | |
| 422 assert(btvalue >= T_BOOLEAN && btvalue <= T_OBJECT, "sanity"); | |
| 423 return (BasicType) btvalue; | |
| 424 } | |
| 425 static int layout_helper_log2_element_size(jint lh) { | |
| 426 assert(lh < (jint)_lh_neutral_value, "must be array"); | |
| 427 int l2esz = (lh >> _lh_log2_element_size_shift) & _lh_log2_element_size_mask; | |
| 428 assert(l2esz <= LogBitsPerLong, "sanity"); | |
| 429 return l2esz; | |
| 430 } | |
| 431 static jint array_layout_helper(jint tag, int hsize, BasicType etype, int log2_esize) { | |
| 432 return (tag << _lh_array_tag_shift) | |
| 433 | (hsize << _lh_header_size_shift) | |
| 434 | ((int)etype << _lh_element_type_shift) | |
| 435 | (log2_esize << _lh_log2_element_size_shift); | |
| 436 } | |
| 437 static jint instance_layout_helper(jint size, bool slow_path_flag) { | |
| 438 return (size << LogHeapWordSize) | |
| 439 | (slow_path_flag ? _lh_instance_slow_path_bit : 0); | |
| 440 } | |
| 441 static int layout_helper_to_size_helper(jint lh) { | |
| 442 assert(lh > (jint)_lh_neutral_value, "must be instance"); | |
| 443 // Note that the following expression discards _lh_instance_slow_path_bit. | |
| 444 return lh >> LogHeapWordSize; | |
| 445 } | |
| 446 // Out-of-line version computes everything based on the etype: | |
| 447 static jint array_layout_helper(BasicType etype); | |
| 448 | |
| 449 // What is the maximum number of primary superclasses any klass can have? | |
| 450 #ifdef PRODUCT | |
| 451 static juint primary_super_limit() { return _primary_super_limit; } | |
| 452 #else | |
| 453 static juint primary_super_limit() { | |
| 454 assert(FastSuperclassLimit <= _primary_super_limit, "parameter oob"); | |
| 455 return FastSuperclassLimit; | |
| 456 } | |
| 457 #endif | |
| 458 | |
| 459 // vtables | |
| 460 virtual klassVtable* vtable() const { return NULL; } | |
| 461 | |
| 462 static int klass_size_in_bytes() { return offset_of(Klass, _alloc_count) + sizeof(juint); } // all "visible" fields | |
| 463 | |
| 464 // subclass check | |
| 465 bool is_subclass_of(klassOop k) const; | |
| 466 // subtype check: true if is_subclass_of, or if k is interface and receiver implements it | |
| 467 bool is_subtype_of(klassOop k) const { | |
| 468 juint off = k->klass_part()->super_check_offset(); | |
| 469 klassOop sup = *(klassOop*)( (address)as_klassOop() + off ); | |
| 470 const juint secondary_offset = secondary_super_cache_offset_in_bytes() + sizeof(oopDesc); | |
| 471 if (sup == k) { | |
| 472 return true; | |
| 473 } else if (off != secondary_offset) { | |
| 474 return false; | |
| 475 } else { | |
| 476 return search_secondary_supers(k); | |
| 477 } | |
| 478 } | |
| 479 bool search_secondary_supers(klassOop k) const; | |
| 480 | |
| 605 | 481 // Find LCA in class hierarchy |
| 0 | 482 Klass *LCA( Klass *k ); |
| 483 | |
| 484 // Check whether reflection/jni/jvm code is allowed to instantiate this class; | |
| 485 // if not, throw either an Error or an Exception. | |
| 486 virtual void check_valid_for_instantiation(bool throwError, TRAPS); | |
| 487 | |
| 488 // Casting | |
| 489 static Klass* cast(klassOop k) { | |
| 490 assert(k->is_klass(), "cast to Klass"); | |
| 491 return k->klass_part(); | |
| 492 } | |
| 493 | |
| 494 // array copying | |
| 495 virtual void copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS); | |
| 496 | |
| 497 // tells if the class should be initialized | |
| 498 virtual bool should_be_initialized() const { return false; } | |
| 499 // initializes the klass | |
| 500 virtual void initialize(TRAPS); | |
| 501 // lookup operation for MethodLookupCache | |
| 502 friend class MethodLookupCache; | |
| 503 virtual methodOop uncached_lookup_method(symbolOop name, symbolOop signature) const; | |
| 504 public: | |
| 505 methodOop lookup_method(symbolOop name, symbolOop signature) const { | |
| 506 return uncached_lookup_method(name, signature); | |
| 507 } | |
| 508 | |
| 509 // array class with specific rank | |
| 510 klassOop array_klass(int rank, TRAPS) { return array_klass_impl(false, rank, THREAD); } | |
| 511 | |
| 512 // array class with this klass as element type | |
| 513 klassOop array_klass(TRAPS) { return array_klass_impl(false, THREAD); } | |
| 514 | |
| 515 // These will return NULL instead of allocating on the heap: | |
| 516 // NB: these can block for a mutex, like other functions with TRAPS arg. | |
| 517 klassOop array_klass_or_null(int rank); | |
| 518 klassOop array_klass_or_null(); | |
| 519 | |
| 520 virtual oop protection_domain() { return NULL; } | |
| 521 virtual oop class_loader() const { return NULL; } | |
| 522 | |
| 523 protected: | |
| 524 virtual klassOop array_klass_impl(bool or_null, int rank, TRAPS); | |
| 525 virtual klassOop array_klass_impl(bool or_null, TRAPS); | |
| 526 | |
| 527 public: | |
| 528 virtual void remove_unshareable_info(); | |
| 529 | |
| 530 protected: | |
| 531 // computes the subtype relationship | |
| 532 virtual bool compute_is_subtype_of(klassOop k); | |
| 533 public: | |
| 534 // subclass accessor (here for convenience; undefined for non-klass objects) | |
| 535 virtual bool is_leaf_class() const { fatal("not a class"); return false; } | |
| 536 public: | |
| 537 // ALL FUNCTIONS BELOW THIS POINT ARE DISPATCHED FROM AN OOP | |
| 538 // These functions describe behavior for the oop not the KLASS. | |
| 539 | |
| 540 // actual oop size of obj in memory | |
| 541 virtual int oop_size(oop obj) const = 0; | |
| 542 | |
| 543 // actual oop size of this klass in memory | |
| 544 virtual int klass_oop_size() const = 0; | |
| 545 | |
| 546 // Returns the Java name for a class (Resource allocated) | |
| 547 // For arrays, this returns the name of the element with a leading '['. | |
| 548 // For classes, this returns the name with the package separators | |
| 549 // turned into '.'s. | |
| 550 const char* external_name() const; | |
| 551 // Returns the name for a class (Resource allocated) as the class | |
| 552 // would appear in a signature. | |
| 553 // For arrays, this returns the name of the element with a leading '['. | |
| 554 // For classes, this returns the name with a leading 'L' and a trailing ';' | |
| 555 // and the package separators as '/'. | |
|
1039
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
628
diff
changeset
|
556 virtual const char* signature_name() const; |
| 0 | 557 |
| 558 // garbage collection support | |
| 559 virtual void oop_follow_contents(oop obj) = 0; | |
| 560 virtual int oop_adjust_pointers(oop obj) = 0; | |
| 561 | |
| 562 // Parallel Scavenge and Parallel Old | |
| 563 PARALLEL_GC_DECLS_PV | |
| 564 | |
| 565 public: | |
| 566 // type testing operations | |
| 567 virtual bool oop_is_instance_slow() const { return false; } | |
| 568 virtual bool oop_is_instanceRef() const { return false; } | |
| 569 virtual bool oop_is_array() const { return false; } | |
| 570 virtual bool oop_is_objArray_slow() const { return false; } | |
| 571 virtual bool oop_is_symbol() const { return false; } | |
| 572 virtual bool oop_is_klass() const { return false; } | |
| 573 virtual bool oop_is_thread() const { return false; } | |
| 574 virtual bool oop_is_method() const { return false; } | |
| 575 virtual bool oop_is_constMethod() const { return false; } | |
| 576 virtual bool oop_is_methodData() const { return false; } | |
| 577 virtual bool oop_is_constantPool() const { return false; } | |
| 578 virtual bool oop_is_constantPoolCache() const { return false; } | |
| 579 virtual bool oop_is_typeArray_slow() const { return false; } | |
| 580 virtual bool oop_is_arrayKlass() const { return false; } | |
| 581 virtual bool oop_is_objArrayKlass() const { return false; } | |
| 582 virtual bool oop_is_typeArrayKlass() const { return false; } | |
| 583 virtual bool oop_is_compiledICHolder() const { return false; } | |
| 584 virtual bool oop_is_instanceKlass() const { return false; } | |
| 585 | |
| 586 bool oop_is_javaArray_slow() const { | |
| 587 return oop_is_objArray_slow() || oop_is_typeArray_slow(); | |
| 588 } | |
| 589 | |
| 590 // Fast non-virtual versions, used by oop.inline.hpp and elsewhere: | |
| 591 #ifndef ASSERT | |
| 592 #define assert_same_query(xval, xcheck) xval | |
| 593 #else | |
| 594 private: | |
| 595 static bool assert_same_query(bool xval, bool xslow) { | |
| 596 assert(xval == xslow, "slow and fast queries agree"); | |
| 597 return xval; | |
| 598 } | |
| 599 public: | |
| 600 #endif | |
| 601 inline bool oop_is_instance() const { return assert_same_query( | |
| 602 layout_helper_is_instance(layout_helper()), | |
| 603 oop_is_instance_slow()); } | |
| 604 inline bool oop_is_javaArray() const { return assert_same_query( | |
| 605 layout_helper_is_javaArray(layout_helper()), | |
| 606 oop_is_javaArray_slow()); } | |
| 607 inline bool oop_is_objArray() const { return assert_same_query( | |
| 608 layout_helper_is_objArray(layout_helper()), | |
| 609 oop_is_objArray_slow()); } | |
| 610 inline bool oop_is_typeArray() const { return assert_same_query( | |
| 611 layout_helper_is_typeArray(layout_helper()), | |
| 612 oop_is_typeArray_slow()); } | |
| 613 #undef assert_same_query | |
| 614 | |
| 615 // Unless overridden, oop is parsable if it has a klass pointer. | |
|
518
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
616 // Parsability of an object is object specific. |
| 0 | 617 virtual bool oop_is_parsable(oop obj) const { return true; } |
| 618 | |
|
518
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
619 // Unless overridden, oop is safe for concurrent GC processing |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
620 // after its allocation is complete. The exception to |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
621 // this is the case where objects are changed after allocation. |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
622 // Class redefinition is one of the known exceptions. During |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
623 // class redefinition, an allocated class can changed in order |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
624 // order to create a merged class (the combiniation of the |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
625 // old class definition that has to be perserved and the new class |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
626 // definition which is being created. |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
627 virtual bool oop_is_conc_safe(oop obj) const { return true; } |
|
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
356
diff
changeset
|
628 |
| 0 | 629 // Access flags |
| 630 AccessFlags access_flags() const { return _access_flags; } | |
| 631 void set_access_flags(AccessFlags flags) { _access_flags = flags; } | |
| 632 | |
| 633 bool is_public() const { return _access_flags.is_public(); } | |
| 634 bool is_final() const { return _access_flags.is_final(); } | |
| 635 bool is_interface() const { return _access_flags.is_interface(); } | |
| 636 bool is_abstract() const { return _access_flags.is_abstract(); } | |
| 637 bool is_super() const { return _access_flags.is_super(); } | |
| 638 bool is_synthetic() const { return _access_flags.is_synthetic(); } | |
| 639 void set_is_synthetic() { _access_flags.set_is_synthetic(); } | |
| 640 bool has_finalizer() const { return _access_flags.has_finalizer(); } | |
| 641 bool has_final_method() const { return _access_flags.has_final_method(); } | |
| 642 void set_has_finalizer() { _access_flags.set_has_finalizer(); } | |
| 643 void set_has_final_method() { _access_flags.set_has_final_method(); } | |
| 644 bool is_cloneable() const { return _access_flags.is_cloneable(); } | |
| 645 void set_is_cloneable() { _access_flags.set_is_cloneable(); } | |
| 646 bool has_vanilla_constructor() const { return _access_flags.has_vanilla_constructor(); } | |
| 647 void set_has_vanilla_constructor() { _access_flags.set_has_vanilla_constructor(); } | |
| 648 bool has_miranda_methods () const { return access_flags().has_miranda_methods(); } | |
| 649 void set_has_miranda_methods() { _access_flags.set_has_miranda_methods(); } | |
| 650 | |
| 651 // Biased locking support | |
| 652 // Note: the prototype header is always set up to be at least the | |
| 653 // prototype markOop. If biased locking is enabled it may further be | |
| 654 // biasable and have an epoch. | |
| 655 markOop prototype_header() const { return _prototype_header; } | |
| 656 // NOTE: once instances of this klass are floating around in the | |
| 657 // system, this header must only be updated at a safepoint. | |
| 658 // NOTE 2: currently we only ever set the prototype header to the | |
| 659 // biasable prototype for instanceKlasses. There is no technical | |
| 660 // reason why it could not be done for arrayKlasses aside from | |
| 661 // wanting to reduce the initial scope of this optimization. There | |
| 662 // are potential problems in setting the bias pattern for | |
| 663 // JVM-internal oops. | |
| 664 inline void set_prototype_header(markOop header); | |
| 665 static int prototype_header_offset_in_bytes() { return offset_of(Klass, _prototype_header); } | |
| 666 | |
| 667 int biased_lock_revocation_count() const { return (int) _biased_lock_revocation_count; } | |
| 668 // Atomically increments biased_lock_revocation_count and returns updated value | |
| 669 int atomic_incr_biased_lock_revocation_count(); | |
| 670 void set_biased_lock_revocation_count(int val) { _biased_lock_revocation_count = (jint) val; } | |
| 671 jlong last_biased_lock_bulk_revocation_time() { return _last_biased_lock_bulk_revocation_time; } | |
| 672 void set_last_biased_lock_bulk_revocation_time(jlong cur_time) { _last_biased_lock_bulk_revocation_time = cur_time; } | |
| 673 | |
| 674 | |
| 675 // garbage collection support | |
| 676 virtual void follow_weak_klass_links( | |
| 677 BoolObjectClosure* is_alive, OopClosure* keep_alive); | |
| 678 | |
| 679 // Prefetch within oop iterators. This is a macro because we | |
| 680 // can't guarantee that the compiler will inline it. In 64-bit | |
| 681 // it generally doesn't. Signature is | |
| 682 // | |
| 683 // static void prefetch_beyond(oop* const start, | |
| 684 // oop* const end, | |
| 685 // const intx foffset, | |
| 686 // const Prefetch::style pstyle); | |
| 687 #define prefetch_beyond(start, end, foffset, pstyle) { \ | |
| 688 const intx foffset_ = (foffset); \ | |
| 689 const Prefetch::style pstyle_ = (pstyle); \ | |
| 690 assert(foffset_ > 0, "prefetch beyond, not behind"); \ | |
| 691 if (pstyle_ != Prefetch::do_none) { \ | |
| 692 oop* ref = (start); \ | |
| 693 if (ref < (end)) { \ | |
| 694 switch (pstyle_) { \ | |
| 695 case Prefetch::do_read: \ | |
| 696 Prefetch::read(*ref, foffset_); \ | |
| 697 break; \ | |
| 698 case Prefetch::do_write: \ | |
| 699 Prefetch::write(*ref, foffset_); \ | |
| 700 break; \ | |
| 701 default: \ | |
| 702 ShouldNotReachHere(); \ | |
| 703 break; \ | |
| 704 } \ | |
| 705 } \ | |
| 706 } \ | |
| 707 } | |
| 708 | |
| 709 // iterators | |
| 710 virtual int oop_oop_iterate(oop obj, OopClosure* blk) = 0; | |
| 711 virtual int oop_oop_iterate_v(oop obj, OopClosure* blk) { | |
| 712 return oop_oop_iterate(obj, blk); | |
| 713 } | |
| 714 | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
715 #ifndef SERIALGC |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
716 // In case we don't have a specialized backward scanner use forward |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
717 // iteration. |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
718 virtual int oop_oop_iterate_backwards_v(oop obj, OopClosure* blk) { |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
719 return oop_oop_iterate_v(obj, blk); |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
720 } |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
721 #endif // !SERIALGC |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
722 |
| 0 | 723 // Iterates "blk" over all the oops in "obj" (of type "this") within "mr". |
| 724 // (I don't see why the _m should be required, but without it the Solaris | |
| 725 // C++ gives warning messages about overridings of the "oop_oop_iterate" | |
| 726 // defined above "hiding" this virtual function. (DLD, 6/20/00)) */ | |
| 727 virtual int oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) = 0; | |
| 728 virtual int oop_oop_iterate_v_m(oop obj, OopClosure* blk, MemRegion mr) { | |
| 729 return oop_oop_iterate_m(obj, blk, mr); | |
| 730 } | |
| 731 | |
| 732 // Versions of the above iterators specialized to particular subtypes | |
| 733 // of OopClosure, to avoid closure virtual calls. | |
| 734 #define Klass_OOP_OOP_ITERATE_DECL(OopClosureType, nv_suffix) \ | |
| 735 virtual int oop_oop_iterate##nv_suffix(oop obj, OopClosureType* blk) { \ | |
| 736 /* Default implementation reverts to general version. */ \ | |
| 737 return oop_oop_iterate(obj, blk); \ | |
| 738 } \ | |
| 739 \ | |
| 740 /* Iterates "blk" over all the oops in "obj" (of type "this") within "mr". \ | |
| 741 (I don't see why the _m should be required, but without it the Solaris \ | |
| 742 C++ gives warning messages about overridings of the "oop_oop_iterate" \ | |
| 743 defined above "hiding" this virtual function. (DLD, 6/20/00)) */ \ | |
| 744 virtual int oop_oop_iterate##nv_suffix##_m(oop obj, \ | |
| 745 OopClosureType* blk, \ | |
| 746 MemRegion mr) { \ | |
| 747 return oop_oop_iterate_m(obj, blk, mr); \ | |
| 748 } | |
| 749 | |
| 750 SPECIALIZED_OOP_OOP_ITERATE_CLOSURES_1(Klass_OOP_OOP_ITERATE_DECL) | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
751 SPECIALIZED_OOP_OOP_ITERATE_CLOSURES_2(Klass_OOP_OOP_ITERATE_DECL) |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
752 |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
753 #ifndef SERIALGC |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
754 #define Klass_OOP_OOP_ITERATE_BACKWARDS_DECL(OopClosureType, nv_suffix) \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
755 virtual int oop_oop_iterate_backwards##nv_suffix(oop obj, \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
756 OopClosureType* blk) { \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
757 /* Default implementation reverts to general version. */ \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
758 return oop_oop_iterate_backwards_v(obj, blk); \ |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
759 } |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
760 |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
761 SPECIALIZED_OOP_OOP_ITERATE_CLOSURES_1(Klass_OOP_OOP_ITERATE_BACKWARDS_DECL) |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
762 SPECIALIZED_OOP_OOP_ITERATE_CLOSURES_2(Klass_OOP_OOP_ITERATE_BACKWARDS_DECL) |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
763 #endif // !SERIALGC |
| 0 | 764 |
| 765 virtual void array_klasses_do(void f(klassOop k)) {} | |
| 766 virtual void with_array_klasses_do(void f(klassOop k)); | |
| 767 | |
| 768 // Return self, except for abstract classes with exactly 1 | |
| 769 // implementor. Then return the 1 concrete implementation. | |
| 770 Klass *up_cast_abstract(); | |
| 771 | |
| 772 // klass name | |
| 773 symbolOop name() const { return _name; } | |
| 774 void set_name(symbolOop n) { oop_store_without_check((oop*) &_name, (oop) n); } | |
| 775 | |
| 776 friend class klassKlass; | |
| 777 | |
| 778 public: | |
| 779 // jvm support | |
| 780 virtual jint compute_modifier_flags(TRAPS) const; | |
| 781 | |
| 782 // JVMTI support | |
| 783 virtual jint jvmti_class_status() const; | |
| 784 | |
| 785 // Printing | |
|
1155
4e6abf09f540
6912062: disassembler plugin needs to produce symbolic information in product mode
jrose
parents:
1039
diff
changeset
|
786 virtual void oop_print_value_on(oop obj, outputStream* st); |
| 0 | 787 virtual void oop_print_on (oop obj, outputStream* st); |
| 788 | |
| 789 // Verification | |
| 790 virtual const char* internal_name() const = 0; | |
| 791 virtual void oop_verify_on(oop obj, outputStream* st); | |
| 792 virtual void oop_verify_old_oop(oop obj, oop* p, bool allow_dirty); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
793 virtual void oop_verify_old_oop(oop obj, narrowOop* p, bool allow_dirty); |
| 0 | 794 // tells whether obj is partially constructed (gc during class loading) |
| 795 virtual bool oop_partially_loaded(oop obj) const { return false; } | |
| 796 virtual void oop_set_partially_loaded(oop obj) {}; | |
| 797 | |
| 798 #ifndef PRODUCT | |
| 799 void verify_vtable_index(int index); | |
| 800 #endif | |
| 801 }; |