Wed, 06 Jan 2010 22:21:39 -0800
Merge
duke@435 | 1 | /* |
xdono@631 | 2 | * Copyright 1997-2008 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_klass.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | |
duke@435 | 29 | bool Klass::is_subclass_of(klassOop k) const { |
duke@435 | 30 | // Run up the super chain and check |
duke@435 | 31 | klassOop t = as_klassOop(); |
duke@435 | 32 | |
duke@435 | 33 | if (t == k) return true; |
duke@435 | 34 | t = Klass::cast(t)->super(); |
duke@435 | 35 | |
duke@435 | 36 | while (t != NULL) { |
duke@435 | 37 | if (t == k) return true; |
duke@435 | 38 | t = Klass::cast(t)->super(); |
duke@435 | 39 | } |
duke@435 | 40 | return false; |
duke@435 | 41 | } |
duke@435 | 42 | |
duke@435 | 43 | bool Klass::search_secondary_supers(klassOop k) const { |
duke@435 | 44 | // Put some extra logic here out-of-line, before the search proper. |
duke@435 | 45 | // This cuts down the size of the inline method. |
duke@435 | 46 | |
duke@435 | 47 | // This is necessary, since I am never in my own secondary_super list. |
duke@435 | 48 | if (this->as_klassOop() == k) |
duke@435 | 49 | return true; |
duke@435 | 50 | // Scan the array-of-objects for a match |
duke@435 | 51 | int cnt = secondary_supers()->length(); |
duke@435 | 52 | for (int i = 0; i < cnt; i++) { |
duke@435 | 53 | if (secondary_supers()->obj_at(i) == k) { |
duke@435 | 54 | ((Klass*)this)->set_secondary_super_cache(k); |
duke@435 | 55 | return true; |
duke@435 | 56 | } |
duke@435 | 57 | } |
duke@435 | 58 | return false; |
duke@435 | 59 | } |
duke@435 | 60 | |
duke@435 | 61 | // Return self, except for abstract classes with exactly 1 |
duke@435 | 62 | // implementor. Then return the 1 concrete implementation. |
duke@435 | 63 | Klass *Klass::up_cast_abstract() { |
duke@435 | 64 | Klass *r = this; |
duke@435 | 65 | while( r->is_abstract() ) { // Receiver is abstract? |
duke@435 | 66 | Klass *s = r->subklass(); // Check for exactly 1 subklass |
duke@435 | 67 | if( !s || s->next_sibling() ) // Oops; wrong count; give up |
duke@435 | 68 | return this; // Return 'this' as a no-progress flag |
duke@435 | 69 | r = s; // Loop till find concrete class |
duke@435 | 70 | } |
duke@435 | 71 | return r; // Return the 1 concrete class |
duke@435 | 72 | } |
duke@435 | 73 | |
twisti@1040 | 74 | // Find LCA in class hierarchy |
duke@435 | 75 | Klass *Klass::LCA( Klass *k2 ) { |
duke@435 | 76 | Klass *k1 = this; |
duke@435 | 77 | while( 1 ) { |
duke@435 | 78 | if( k1->is_subtype_of(k2->as_klassOop()) ) return k2; |
duke@435 | 79 | if( k2->is_subtype_of(k1->as_klassOop()) ) return k1; |
duke@435 | 80 | k1 = k1->super()->klass_part(); |
duke@435 | 81 | k2 = k2->super()->klass_part(); |
duke@435 | 82 | } |
duke@435 | 83 | } |
duke@435 | 84 | |
duke@435 | 85 | |
duke@435 | 86 | void Klass::check_valid_for_instantiation(bool throwError, TRAPS) { |
duke@435 | 87 | ResourceMark rm(THREAD); |
duke@435 | 88 | THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError() |
duke@435 | 89 | : vmSymbols::java_lang_InstantiationException(), external_name()); |
duke@435 | 90 | } |
duke@435 | 91 | |
duke@435 | 92 | |
duke@435 | 93 | void Klass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) { |
duke@435 | 94 | THROW(vmSymbols::java_lang_ArrayStoreException()); |
duke@435 | 95 | } |
duke@435 | 96 | |
duke@435 | 97 | |
duke@435 | 98 | void Klass::initialize(TRAPS) { |
duke@435 | 99 | ShouldNotReachHere(); |
duke@435 | 100 | } |
duke@435 | 101 | |
duke@435 | 102 | bool Klass::compute_is_subtype_of(klassOop k) { |
duke@435 | 103 | assert(k->is_klass(), "argument must be a class"); |
duke@435 | 104 | return is_subclass_of(k); |
duke@435 | 105 | } |
duke@435 | 106 | |
duke@435 | 107 | |
duke@435 | 108 | methodOop Klass::uncached_lookup_method(symbolOop name, symbolOop signature) const { |
duke@435 | 109 | #ifdef ASSERT |
duke@435 | 110 | tty->print_cr("Error: uncached_lookup_method called on a klass oop." |
duke@435 | 111 | " Likely error: reflection method does not correctly" |
duke@435 | 112 | " wrap return value in a mirror object."); |
duke@435 | 113 | #endif |
duke@435 | 114 | ShouldNotReachHere(); |
duke@435 | 115 | return NULL; |
duke@435 | 116 | } |
duke@435 | 117 | |
duke@435 | 118 | klassOop Klass::base_create_klass_oop(KlassHandle& klass, int size, |
duke@435 | 119 | const Klass_vtbl& vtbl, TRAPS) { |
duke@435 | 120 | size = align_object_size(size); |
duke@435 | 121 | // allocate and initialize vtable |
duke@435 | 122 | Klass* kl = (Klass*) vtbl.allocate_permanent(klass, size, CHECK_NULL); |
duke@435 | 123 | klassOop k = kl->as_klassOop(); |
duke@435 | 124 | |
duke@435 | 125 | { // Preinitialize supertype information. |
duke@435 | 126 | // A later call to initialize_supers() may update these settings: |
duke@435 | 127 | kl->set_super(NULL); |
duke@435 | 128 | for (juint i = 0; i < Klass::primary_super_limit(); i++) { |
duke@435 | 129 | kl->_primary_supers[i] = NULL; |
duke@435 | 130 | } |
duke@435 | 131 | kl->set_secondary_supers(NULL); |
duke@435 | 132 | oop_store_without_check((oop*) &kl->_primary_supers[0], k); |
duke@435 | 133 | kl->set_super_check_offset(primary_supers_offset_in_bytes() + sizeof(oopDesc)); |
duke@435 | 134 | } |
duke@435 | 135 | |
duke@435 | 136 | kl->set_java_mirror(NULL); |
duke@435 | 137 | kl->set_modifier_flags(0); |
duke@435 | 138 | kl->set_layout_helper(Klass::_lh_neutral_value); |
duke@435 | 139 | kl->set_name(NULL); |
duke@435 | 140 | AccessFlags af; |
duke@435 | 141 | af.set_flags(0); |
duke@435 | 142 | kl->set_access_flags(af); |
duke@435 | 143 | kl->set_subklass(NULL); |
duke@435 | 144 | kl->set_next_sibling(NULL); |
duke@435 | 145 | kl->set_alloc_count(0); |
duke@435 | 146 | kl->set_alloc_size(0); |
duke@435 | 147 | |
duke@435 | 148 | kl->set_prototype_header(markOopDesc::prototype()); |
duke@435 | 149 | kl->set_biased_lock_revocation_count(0); |
duke@435 | 150 | kl->set_last_biased_lock_bulk_revocation_time(0); |
duke@435 | 151 | |
duke@435 | 152 | return k; |
duke@435 | 153 | } |
duke@435 | 154 | |
duke@435 | 155 | KlassHandle Klass::base_create_klass(KlassHandle& klass, int size, |
duke@435 | 156 | const Klass_vtbl& vtbl, TRAPS) { |
duke@435 | 157 | klassOop ek = base_create_klass_oop(klass, size, vtbl, THREAD); |
duke@435 | 158 | return KlassHandle(THREAD, ek); |
duke@435 | 159 | } |
duke@435 | 160 | |
duke@435 | 161 | void Klass_vtbl::post_new_init_klass(KlassHandle& klass, |
duke@435 | 162 | klassOop new_klass, |
duke@435 | 163 | int size) const { |
duke@435 | 164 | assert(!new_klass->klass_part()->null_vtbl(), "Not a complete klass"); |
duke@435 | 165 | CollectedHeap::post_allocation_install_obj_klass(klass, new_klass, size); |
duke@435 | 166 | } |
duke@435 | 167 | |
duke@435 | 168 | void* Klass_vtbl::operator new(size_t ignored, KlassHandle& klass, |
duke@435 | 169 | int size, TRAPS) { |
duke@435 | 170 | // The vtable pointer is installed during the execution of |
duke@435 | 171 | // constructors in the call to permanent_obj_allocate(). Delay |
duke@435 | 172 | // the installation of the klass pointer into the new klass "k" |
duke@435 | 173 | // until after the vtable pointer has been installed (i.e., until |
duke@435 | 174 | // after the return of permanent_obj_allocate(). |
duke@435 | 175 | klassOop k = |
duke@435 | 176 | (klassOop) CollectedHeap::permanent_obj_allocate_no_klass_install(klass, |
duke@435 | 177 | size, CHECK_NULL); |
duke@435 | 178 | return k->klass_part(); |
duke@435 | 179 | } |
duke@435 | 180 | |
duke@435 | 181 | jint Klass::array_layout_helper(BasicType etype) { |
duke@435 | 182 | assert(etype >= T_BOOLEAN && etype <= T_OBJECT, "valid etype"); |
duke@435 | 183 | // Note that T_ARRAY is not allowed here. |
duke@435 | 184 | int hsize = arrayOopDesc::base_offset_in_bytes(etype); |
kvn@464 | 185 | int esize = type2aelembytes(etype); |
duke@435 | 186 | bool isobj = (etype == T_OBJECT); |
duke@435 | 187 | int tag = isobj ? _lh_array_tag_obj_value : _lh_array_tag_type_value; |
duke@435 | 188 | int lh = array_layout_helper(tag, hsize, etype, exact_log2(esize)); |
duke@435 | 189 | |
duke@435 | 190 | assert(lh < (int)_lh_neutral_value, "must look like an array layout"); |
duke@435 | 191 | assert(layout_helper_is_javaArray(lh), "correct kind"); |
duke@435 | 192 | assert(layout_helper_is_objArray(lh) == isobj, "correct kind"); |
duke@435 | 193 | assert(layout_helper_is_typeArray(lh) == !isobj, "correct kind"); |
duke@435 | 194 | assert(layout_helper_header_size(lh) == hsize, "correct decode"); |
duke@435 | 195 | assert(layout_helper_element_type(lh) == etype, "correct decode"); |
duke@435 | 196 | assert(1 << layout_helper_log2_element_size(lh) == esize, "correct decode"); |
duke@435 | 197 | |
duke@435 | 198 | return lh; |
duke@435 | 199 | } |
duke@435 | 200 | |
duke@435 | 201 | bool Klass::can_be_primary_super_slow() const { |
duke@435 | 202 | if (super() == NULL) |
duke@435 | 203 | return true; |
duke@435 | 204 | else if (super()->klass_part()->super_depth() >= primary_super_limit()-1) |
duke@435 | 205 | return false; |
duke@435 | 206 | else |
duke@435 | 207 | return true; |
duke@435 | 208 | } |
duke@435 | 209 | |
duke@435 | 210 | void Klass::initialize_supers(klassOop k, TRAPS) { |
duke@435 | 211 | if (FastSuperclassLimit == 0) { |
duke@435 | 212 | // None of the other machinery matters. |
duke@435 | 213 | set_super(k); |
duke@435 | 214 | return; |
duke@435 | 215 | } |
duke@435 | 216 | if (k == NULL) { |
duke@435 | 217 | set_super(NULL); |
duke@435 | 218 | oop_store_without_check((oop*) &_primary_supers[0], (oop) this->as_klassOop()); |
duke@435 | 219 | assert(super_depth() == 0, "Object must already be initialized properly"); |
never@1577 | 220 | } else if (k != super() || k == SystemDictionary::Object_klass()) { |
never@1577 | 221 | assert(super() == NULL || super() == SystemDictionary::Object_klass(), |
duke@435 | 222 | "initialize this only once to a non-trivial value"); |
duke@435 | 223 | set_super(k); |
duke@435 | 224 | Klass* sup = k->klass_part(); |
duke@435 | 225 | int sup_depth = sup->super_depth(); |
duke@435 | 226 | juint my_depth = MIN2(sup_depth + 1, (int)primary_super_limit()); |
duke@435 | 227 | if (!can_be_primary_super_slow()) |
duke@435 | 228 | my_depth = primary_super_limit(); |
duke@435 | 229 | for (juint i = 0; i < my_depth; i++) { |
duke@435 | 230 | oop_store_without_check((oop*) &_primary_supers[i], (oop) sup->_primary_supers[i]); |
duke@435 | 231 | } |
duke@435 | 232 | klassOop *super_check_cell; |
duke@435 | 233 | if (my_depth < primary_super_limit()) { |
duke@435 | 234 | oop_store_without_check((oop*) &_primary_supers[my_depth], (oop) this->as_klassOop()); |
duke@435 | 235 | super_check_cell = &_primary_supers[my_depth]; |
duke@435 | 236 | } else { |
duke@435 | 237 | // Overflow of the primary_supers array forces me to be secondary. |
duke@435 | 238 | super_check_cell = &_secondary_super_cache; |
duke@435 | 239 | } |
duke@435 | 240 | set_super_check_offset((address)super_check_cell - (address) this->as_klassOop()); |
duke@435 | 241 | |
duke@435 | 242 | #ifdef ASSERT |
duke@435 | 243 | { |
duke@435 | 244 | juint j = super_depth(); |
duke@435 | 245 | assert(j == my_depth, "computed accessor gets right answer"); |
duke@435 | 246 | klassOop t = as_klassOop(); |
duke@435 | 247 | while (!Klass::cast(t)->can_be_primary_super()) { |
duke@435 | 248 | t = Klass::cast(t)->super(); |
duke@435 | 249 | j = Klass::cast(t)->super_depth(); |
duke@435 | 250 | } |
duke@435 | 251 | for (juint j1 = j+1; j1 < primary_super_limit(); j1++) { |
duke@435 | 252 | assert(primary_super_of_depth(j1) == NULL, "super list padding"); |
duke@435 | 253 | } |
duke@435 | 254 | while (t != NULL) { |
duke@435 | 255 | assert(primary_super_of_depth(j) == t, "super list initialization"); |
duke@435 | 256 | t = Klass::cast(t)->super(); |
duke@435 | 257 | --j; |
duke@435 | 258 | } |
duke@435 | 259 | assert(j == (juint)-1, "correct depth count"); |
duke@435 | 260 | } |
duke@435 | 261 | #endif |
duke@435 | 262 | } |
duke@435 | 263 | |
duke@435 | 264 | if (secondary_supers() == NULL) { |
duke@435 | 265 | KlassHandle this_kh (THREAD, this); |
duke@435 | 266 | |
duke@435 | 267 | // Now compute the list of secondary supertypes. |
duke@435 | 268 | // Secondaries can occasionally be on the super chain, |
duke@435 | 269 | // if the inline "_primary_supers" array overflows. |
duke@435 | 270 | int extras = 0; |
duke@435 | 271 | klassOop p; |
duke@435 | 272 | for (p = super(); !(p == NULL || p->klass_part()->can_be_primary_super()); p = p->klass_part()->super()) { |
duke@435 | 273 | ++extras; |
duke@435 | 274 | } |
duke@435 | 275 | |
duke@435 | 276 | // Compute the "real" non-extra secondaries. |
duke@435 | 277 | objArrayOop secondary_oops = compute_secondary_supers(extras, CHECK); |
duke@435 | 278 | objArrayHandle secondaries (THREAD, secondary_oops); |
duke@435 | 279 | |
duke@435 | 280 | // Store the extra secondaries in the first array positions: |
duke@435 | 281 | int fillp = extras; |
duke@435 | 282 | for (p = this_kh->super(); !(p == NULL || p->klass_part()->can_be_primary_super()); p = p->klass_part()->super()) { |
duke@435 | 283 | int i; // Scan for overflow primaries being duplicates of 2nd'arys |
duke@435 | 284 | |
duke@435 | 285 | // This happens frequently for very deeply nested arrays: the |
duke@435 | 286 | // primary superclass chain overflows into the secondary. The |
duke@435 | 287 | // secondary list contains the element_klass's secondaries with |
duke@435 | 288 | // an extra array dimension added. If the element_klass's |
duke@435 | 289 | // secondary list already contains some primary overflows, they |
duke@435 | 290 | // (with the extra level of array-ness) will collide with the |
duke@435 | 291 | // normal primary superclass overflows. |
duke@435 | 292 | for( i = extras; i < secondaries->length(); i++ ) |
duke@435 | 293 | if( secondaries->obj_at(i) == p ) |
duke@435 | 294 | break; |
duke@435 | 295 | if( i < secondaries->length() ) |
duke@435 | 296 | continue; // It's a dup, don't put it in |
duke@435 | 297 | secondaries->obj_at_put(--fillp, p); |
duke@435 | 298 | } |
duke@435 | 299 | // See if we had some dup's, so the array has holes in it. |
duke@435 | 300 | if( fillp > 0 ) { |
duke@435 | 301 | // Pack the array. Drop the old secondaries array on the floor |
duke@435 | 302 | // and let GC reclaim it. |
duke@435 | 303 | objArrayOop s2 = oopFactory::new_system_objArray(secondaries->length() - fillp, CHECK); |
duke@435 | 304 | for( int i = 0; i < s2->length(); i++ ) |
duke@435 | 305 | s2->obj_at_put( i, secondaries->obj_at(i+fillp) ); |
duke@435 | 306 | secondaries = objArrayHandle(THREAD, s2); |
duke@435 | 307 | } |
duke@435 | 308 | |
duke@435 | 309 | #ifdef ASSERT |
duke@435 | 310 | if (secondaries() != Universe::the_array_interfaces_array()) { |
duke@435 | 311 | // We must not copy any NULL placeholders left over from bootstrap. |
duke@435 | 312 | for (int j = 0; j < secondaries->length(); j++) { |
duke@435 | 313 | assert(secondaries->obj_at(j) != NULL, "correct bootstrapping order"); |
duke@435 | 314 | } |
duke@435 | 315 | } |
duke@435 | 316 | #endif |
duke@435 | 317 | |
duke@435 | 318 | this_kh->set_secondary_supers(secondaries()); |
duke@435 | 319 | } |
duke@435 | 320 | } |
duke@435 | 321 | |
duke@435 | 322 | objArrayOop Klass::compute_secondary_supers(int num_extra_slots, TRAPS) { |
duke@435 | 323 | assert(num_extra_slots == 0, "override for complex klasses"); |
duke@435 | 324 | return Universe::the_empty_system_obj_array(); |
duke@435 | 325 | } |
duke@435 | 326 | |
duke@435 | 327 | |
duke@435 | 328 | Klass* Klass::subklass() const { |
duke@435 | 329 | return _subklass == NULL ? NULL : Klass::cast(_subklass); |
duke@435 | 330 | } |
duke@435 | 331 | |
duke@435 | 332 | instanceKlass* Klass::superklass() const { |
duke@435 | 333 | assert(super() == NULL || super()->klass_part()->oop_is_instance(), "must be instance klass"); |
duke@435 | 334 | return _super == NULL ? NULL : instanceKlass::cast(_super); |
duke@435 | 335 | } |
duke@435 | 336 | |
duke@435 | 337 | Klass* Klass::next_sibling() const { |
duke@435 | 338 | return _next_sibling == NULL ? NULL : Klass::cast(_next_sibling); |
duke@435 | 339 | } |
duke@435 | 340 | |
duke@435 | 341 | void Klass::set_subklass(klassOop s) { |
duke@435 | 342 | assert(s != as_klassOop(), "sanity check"); |
duke@435 | 343 | oop_store_without_check((oop*)&_subklass, s); |
duke@435 | 344 | } |
duke@435 | 345 | |
duke@435 | 346 | void Klass::set_next_sibling(klassOop s) { |
duke@435 | 347 | assert(s != as_klassOop(), "sanity check"); |
duke@435 | 348 | oop_store_without_check((oop*)&_next_sibling, s); |
duke@435 | 349 | } |
duke@435 | 350 | |
duke@435 | 351 | void Klass::append_to_sibling_list() { |
duke@435 | 352 | debug_only(if (!SharedSkipVerify) as_klassOop()->verify();) |
duke@435 | 353 | // add ourselves to superklass' subklass list |
duke@435 | 354 | instanceKlass* super = superklass(); |
duke@435 | 355 | if (super == NULL) return; // special case: class Object |
duke@435 | 356 | assert(SharedSkipVerify || |
duke@435 | 357 | (!super->is_interface() // interfaces cannot be supers |
duke@435 | 358 | && (super->superklass() == NULL || !is_interface())), |
duke@435 | 359 | "an interface can only be a subklass of Object"); |
duke@435 | 360 | klassOop prev_first_subklass = super->subklass_oop(); |
duke@435 | 361 | if (prev_first_subklass != NULL) { |
duke@435 | 362 | // set our sibling to be the superklass' previous first subklass |
duke@435 | 363 | set_next_sibling(prev_first_subklass); |
duke@435 | 364 | } |
duke@435 | 365 | // make ourselves the superklass' first subklass |
duke@435 | 366 | super->set_subklass(as_klassOop()); |
duke@435 | 367 | debug_only(if (!SharedSkipVerify) as_klassOop()->verify();) |
duke@435 | 368 | } |
duke@435 | 369 | |
duke@435 | 370 | void Klass::remove_from_sibling_list() { |
duke@435 | 371 | // remove receiver from sibling list |
duke@435 | 372 | instanceKlass* super = superklass(); |
never@1577 | 373 | assert(super != NULL || as_klassOop() == SystemDictionary::Object_klass(), "should have super"); |
duke@435 | 374 | if (super == NULL) return; // special case: class Object |
duke@435 | 375 | if (super->subklass() == this) { |
duke@435 | 376 | // first subklass |
duke@435 | 377 | super->set_subklass(_next_sibling); |
duke@435 | 378 | } else { |
duke@435 | 379 | Klass* sib = super->subklass(); |
duke@435 | 380 | while (sib->next_sibling() != this) { |
duke@435 | 381 | sib = sib->next_sibling(); |
duke@435 | 382 | }; |
duke@435 | 383 | sib->set_next_sibling(_next_sibling); |
duke@435 | 384 | } |
duke@435 | 385 | } |
duke@435 | 386 | |
duke@435 | 387 | void Klass::follow_weak_klass_links( BoolObjectClosure* is_alive, OopClosure* keep_alive) { |
duke@435 | 388 | // This klass is alive but the subklass and siblings are not followed/updated. |
duke@435 | 389 | // We update the subklass link and the subklass' sibling links here. |
duke@435 | 390 | // Our own sibling link will be updated by our superclass (which must be alive |
duke@435 | 391 | // since we are). |
duke@435 | 392 | assert(is_alive->do_object_b(as_klassOop()), "just checking, this should be live"); |
duke@435 | 393 | if (ClassUnloading) { |
duke@435 | 394 | klassOop sub = subklass_oop(); |
duke@435 | 395 | if (sub != NULL && !is_alive->do_object_b(sub)) { |
duke@435 | 396 | // first subklass not alive, find first one alive |
duke@435 | 397 | do { |
duke@435 | 398 | #ifndef PRODUCT |
duke@435 | 399 | if (TraceClassUnloading && WizardMode) { |
duke@435 | 400 | ResourceMark rm; |
duke@435 | 401 | tty->print_cr("[Unlinking class (subclass) %s]", sub->klass_part()->external_name()); |
duke@435 | 402 | } |
duke@435 | 403 | #endif |
duke@435 | 404 | sub = sub->klass_part()->next_sibling_oop(); |
duke@435 | 405 | } while (sub != NULL && !is_alive->do_object_b(sub)); |
duke@435 | 406 | set_subklass(sub); |
duke@435 | 407 | } |
duke@435 | 408 | // now update the subklass' sibling list |
duke@435 | 409 | while (sub != NULL) { |
duke@435 | 410 | klassOop next = sub->klass_part()->next_sibling_oop(); |
duke@435 | 411 | if (next != NULL && !is_alive->do_object_b(next)) { |
duke@435 | 412 | // first sibling not alive, find first one alive |
duke@435 | 413 | do { |
duke@435 | 414 | #ifndef PRODUCT |
duke@435 | 415 | if (TraceClassUnloading && WizardMode) { |
duke@435 | 416 | ResourceMark rm; |
duke@435 | 417 | tty->print_cr("[Unlinking class (sibling) %s]", next->klass_part()->external_name()); |
duke@435 | 418 | } |
duke@435 | 419 | #endif |
duke@435 | 420 | next = next->klass_part()->next_sibling_oop(); |
duke@435 | 421 | } while (next != NULL && !is_alive->do_object_b(next)); |
duke@435 | 422 | sub->klass_part()->set_next_sibling(next); |
duke@435 | 423 | } |
duke@435 | 424 | sub = next; |
duke@435 | 425 | } |
duke@435 | 426 | } else { |
duke@435 | 427 | // Always follow subklass and sibling link. This will prevent any klasses from |
duke@435 | 428 | // being unloaded (all classes are transitively linked from java.lang.Object). |
duke@435 | 429 | keep_alive->do_oop(adr_subklass()); |
duke@435 | 430 | keep_alive->do_oop(adr_next_sibling()); |
duke@435 | 431 | } |
duke@435 | 432 | } |
duke@435 | 433 | |
duke@435 | 434 | |
duke@435 | 435 | void Klass::remove_unshareable_info() { |
duke@435 | 436 | if (oop_is_instance()) { |
duke@435 | 437 | instanceKlass* ik = (instanceKlass*)this; |
duke@435 | 438 | if (ik->is_linked()) { |
duke@435 | 439 | ik->unlink_class(); |
duke@435 | 440 | } |
duke@435 | 441 | } |
duke@435 | 442 | set_subklass(NULL); |
duke@435 | 443 | set_next_sibling(NULL); |
duke@435 | 444 | } |
duke@435 | 445 | |
duke@435 | 446 | |
duke@435 | 447 | klassOop Klass::array_klass_or_null(int rank) { |
duke@435 | 448 | EXCEPTION_MARK; |
duke@435 | 449 | // No exception can be thrown by array_klass_impl when called with or_null == true. |
duke@435 | 450 | // (In anycase, the execption mark will fail if it do so) |
duke@435 | 451 | return array_klass_impl(true, rank, THREAD); |
duke@435 | 452 | } |
duke@435 | 453 | |
duke@435 | 454 | |
duke@435 | 455 | klassOop Klass::array_klass_or_null() { |
duke@435 | 456 | EXCEPTION_MARK; |
duke@435 | 457 | // No exception can be thrown by array_klass_impl when called with or_null == true. |
duke@435 | 458 | // (In anycase, the execption mark will fail if it do so) |
duke@435 | 459 | return array_klass_impl(true, THREAD); |
duke@435 | 460 | } |
duke@435 | 461 | |
duke@435 | 462 | |
duke@435 | 463 | klassOop Klass::array_klass_impl(bool or_null, int rank, TRAPS) { |
duke@435 | 464 | fatal("array_klass should be dispatched to instanceKlass, objArrayKlass or typeArrayKlass"); |
duke@435 | 465 | return NULL; |
duke@435 | 466 | } |
duke@435 | 467 | |
duke@435 | 468 | |
duke@435 | 469 | klassOop Klass::array_klass_impl(bool or_null, TRAPS) { |
duke@435 | 470 | fatal("array_klass should be dispatched to instanceKlass, objArrayKlass or typeArrayKlass"); |
duke@435 | 471 | return NULL; |
duke@435 | 472 | } |
duke@435 | 473 | |
duke@435 | 474 | |
duke@435 | 475 | void Klass::with_array_klasses_do(void f(klassOop k)) { |
duke@435 | 476 | f(as_klassOop()); |
duke@435 | 477 | } |
duke@435 | 478 | |
duke@435 | 479 | |
duke@435 | 480 | const char* Klass::external_name() const { |
jrose@866 | 481 | if (oop_is_instance()) { |
jrose@866 | 482 | instanceKlass* ik = (instanceKlass*) this; |
jrose@866 | 483 | if (ik->is_anonymous()) { |
jrose@866 | 484 | assert(AnonymousClasses, ""); |
jrose@866 | 485 | intptr_t hash = ik->java_mirror()->identity_hash(); |
jrose@866 | 486 | char hash_buf[40]; |
jrose@866 | 487 | sprintf(hash_buf, "/" UINTX_FORMAT, (uintx)hash); |
jrose@866 | 488 | size_t hash_len = strlen(hash_buf); |
jrose@866 | 489 | |
jrose@866 | 490 | size_t result_len = name()->utf8_length(); |
jrose@866 | 491 | char* result = NEW_RESOURCE_ARRAY(char, result_len + hash_len + 1); |
jrose@866 | 492 | name()->as_klass_external_name(result, (int) result_len + 1); |
jrose@866 | 493 | assert(strlen(result) == result_len, ""); |
jrose@866 | 494 | strcpy(result + result_len, hash_buf); |
jrose@866 | 495 | assert(strlen(result) == result_len + hash_len, ""); |
jrose@866 | 496 | return result; |
jrose@866 | 497 | } |
jrose@866 | 498 | } |
jrose@1474 | 499 | if (name() == NULL) return "<unknown>"; |
duke@435 | 500 | return name()->as_klass_external_name(); |
duke@435 | 501 | } |
duke@435 | 502 | |
duke@435 | 503 | |
jrose@1474 | 504 | const char* Klass::signature_name() const { |
jrose@1474 | 505 | if (name() == NULL) return "<unknown>"; |
duke@435 | 506 | return name()->as_C_string(); |
duke@435 | 507 | } |
duke@435 | 508 | |
duke@435 | 509 | // Unless overridden, modifier_flags is 0. |
duke@435 | 510 | jint Klass::compute_modifier_flags(TRAPS) const { |
duke@435 | 511 | return 0; |
duke@435 | 512 | } |
duke@435 | 513 | |
duke@435 | 514 | int Klass::atomic_incr_biased_lock_revocation_count() { |
duke@435 | 515 | return (int) Atomic::add(1, &_biased_lock_revocation_count); |
duke@435 | 516 | } |
duke@435 | 517 | |
duke@435 | 518 | // Unless overridden, jvmti_class_status has no flags set. |
duke@435 | 519 | jint Klass::jvmti_class_status() const { |
duke@435 | 520 | return 0; |
duke@435 | 521 | } |
duke@435 | 522 | |
duke@435 | 523 | #ifndef PRODUCT |
duke@435 | 524 | |
duke@435 | 525 | // Printing |
duke@435 | 526 | |
duke@435 | 527 | void Klass::oop_print_on(oop obj, outputStream* st) { |
duke@435 | 528 | ResourceMark rm; |
duke@435 | 529 | // print title |
duke@435 | 530 | st->print_cr("%s ", internal_name()); |
duke@435 | 531 | obj->print_address_on(st); |
duke@435 | 532 | |
duke@435 | 533 | if (WizardMode) { |
duke@435 | 534 | // print header |
duke@435 | 535 | obj->mark()->print_on(st); |
duke@435 | 536 | } |
duke@435 | 537 | |
duke@435 | 538 | // print class |
duke@435 | 539 | st->print(" - klass: "); |
duke@435 | 540 | obj->klass()->print_value_on(st); |
duke@435 | 541 | st->cr(); |
duke@435 | 542 | } |
duke@435 | 543 | |
duke@435 | 544 | |
duke@435 | 545 | void Klass::oop_print_value_on(oop obj, outputStream* st) { |
duke@435 | 546 | // print title |
duke@435 | 547 | ResourceMark rm; // Cannot print in debug mode without this |
duke@435 | 548 | st->print("%s", internal_name()); |
duke@435 | 549 | obj->print_address_on(st); |
duke@435 | 550 | } |
duke@435 | 551 | |
duke@435 | 552 | #endif |
duke@435 | 553 | |
duke@435 | 554 | // Verification |
duke@435 | 555 | |
duke@435 | 556 | void Klass::oop_verify_on(oop obj, outputStream* st) { |
duke@435 | 557 | guarantee(obj->is_oop(), "should be oop"); |
duke@435 | 558 | guarantee(obj->klass()->is_perm(), "should be in permspace"); |
duke@435 | 559 | guarantee(obj->klass()->is_klass(), "klass field is not a klass"); |
duke@435 | 560 | } |
duke@435 | 561 | |
duke@435 | 562 | |
duke@435 | 563 | void Klass::oop_verify_old_oop(oop obj, oop* p, bool allow_dirty) { |
duke@435 | 564 | /* $$$ I think this functionality should be handled by verification of |
duke@435 | 565 | RememberedSet::verify_old_oop(obj, p, allow_dirty, false); |
duke@435 | 566 | the card table. */ |
duke@435 | 567 | } |
coleenp@548 | 568 | void Klass::oop_verify_old_oop(oop obj, narrowOop* p, bool allow_dirty) { } |
duke@435 | 569 | |
duke@435 | 570 | #ifndef PRODUCT |
duke@435 | 571 | |
duke@435 | 572 | void Klass::verify_vtable_index(int i) { |
duke@435 | 573 | assert(oop_is_instance() || oop_is_array(), "only instanceKlass and arrayKlass have vtables"); |
duke@435 | 574 | if (oop_is_instance()) { |
duke@435 | 575 | assert(i>=0 && i<((instanceKlass*)this)->vtable_length()/vtableEntry::size(), "index out of bounds"); |
duke@435 | 576 | } else { |
duke@435 | 577 | assert(i>=0 && i<((arrayKlass*)this)->vtable_length()/vtableEntry::size(), "index out of bounds"); |
duke@435 | 578 | } |
duke@435 | 579 | } |
duke@435 | 580 | |
duke@435 | 581 | #endif |