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