Mon, 09 Jun 2008 11:51:19 -0400
6687581: Make CMS work with compressed oops
Summary: Make FreeChunk read markword instead of LSB in _klass pointer to indicate that it's a FreeChunk for compressed oops.
Reviewed-by: ysr, jmasa
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2006 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/_klassVtable.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | inline instanceKlass* klassVtable::ik() const { |
duke@435 | 29 | Klass* k = _klass()->klass_part(); |
duke@435 | 30 | assert(k->oop_is_instance(), "not an instanceKlass"); |
duke@435 | 31 | return (instanceKlass*)k; |
duke@435 | 32 | } |
duke@435 | 33 | |
duke@435 | 34 | |
duke@435 | 35 | // this function computes the vtable size (including the size needed for miranda |
duke@435 | 36 | // methods) and the number of miranda methods in this class |
duke@435 | 37 | // Note on Miranda methods: Let's say there is a class C that implements |
duke@435 | 38 | // interface I. Let's say there is a method m in I that neither C nor any |
duke@435 | 39 | // of its super classes implement (i.e there is no method of any access, with |
duke@435 | 40 | // the same name and signature as m), then m is a Miranda method which is |
duke@435 | 41 | // entered as a public abstract method in C's vtable. From then on it should |
duke@435 | 42 | // treated as any other public method in C for method over-ride purposes. |
duke@435 | 43 | void klassVtable::compute_vtable_size_and_num_mirandas(int &vtable_length, |
duke@435 | 44 | int &num_miranda_methods, |
duke@435 | 45 | klassOop super, |
duke@435 | 46 | objArrayOop methods, |
duke@435 | 47 | AccessFlags class_flags, |
duke@435 | 48 | oop classloader, |
duke@435 | 49 | symbolOop classname, |
duke@435 | 50 | objArrayOop local_interfaces |
duke@435 | 51 | ) { |
duke@435 | 52 | |
duke@435 | 53 | No_Safepoint_Verifier nsv; |
duke@435 | 54 | |
duke@435 | 55 | // set up default result values |
duke@435 | 56 | vtable_length = 0; |
duke@435 | 57 | num_miranda_methods = 0; |
duke@435 | 58 | |
duke@435 | 59 | // start off with super's vtable length |
duke@435 | 60 | instanceKlass* sk = (instanceKlass*)super->klass_part(); |
duke@435 | 61 | vtable_length = super == NULL ? 0 : sk->vtable_length(); |
duke@435 | 62 | |
duke@435 | 63 | // go thru each method in the methods table to see if it needs a new entry |
duke@435 | 64 | int len = methods->length(); |
duke@435 | 65 | for (int i = 0; i < len; i++) { |
duke@435 | 66 | assert(methods->obj_at(i)->is_method(), "must be a methodOop"); |
duke@435 | 67 | methodOop m = methodOop(methods->obj_at(i)); |
duke@435 | 68 | |
duke@435 | 69 | if (needs_new_vtable_entry(m, super, classloader, classname, class_flags)) { |
duke@435 | 70 | vtable_length += vtableEntry::size(); // we need a new entry |
duke@435 | 71 | } |
duke@435 | 72 | } |
duke@435 | 73 | |
duke@435 | 74 | // compute the number of mirandas methods that must be added to the end |
duke@435 | 75 | num_miranda_methods = get_num_mirandas(super, methods, local_interfaces); |
duke@435 | 76 | vtable_length += (num_miranda_methods * vtableEntry::size()); |
duke@435 | 77 | |
duke@435 | 78 | if (Universe::is_bootstrapping() && vtable_length == 0) { |
duke@435 | 79 | // array classes don't have their superclass set correctly during |
duke@435 | 80 | // bootstrapping |
duke@435 | 81 | vtable_length = Universe::base_vtable_size(); |
duke@435 | 82 | } |
duke@435 | 83 | |
duke@435 | 84 | if (super == NULL && !Universe::is_bootstrapping() && |
duke@435 | 85 | vtable_length != Universe::base_vtable_size()) { |
duke@435 | 86 | // Someone is attempting to redefine java.lang.Object incorrectly. The |
duke@435 | 87 | // only way this should happen is from |
duke@435 | 88 | // SystemDictionary::resolve_from_stream(), which will detect this later |
duke@435 | 89 | // and throw a security exception. So don't assert here to let |
duke@435 | 90 | // the exception occur. |
duke@435 | 91 | vtable_length = Universe::base_vtable_size(); |
duke@435 | 92 | } |
duke@435 | 93 | assert(super != NULL || vtable_length == Universe::base_vtable_size(), |
duke@435 | 94 | "bad vtable size for class Object"); |
duke@435 | 95 | assert(vtable_length % vtableEntry::size() == 0, "bad vtable length"); |
duke@435 | 96 | assert(vtable_length >= Universe::base_vtable_size(), "vtable too small"); |
duke@435 | 97 | } |
duke@435 | 98 | |
duke@435 | 99 | int klassVtable::index_of(methodOop m, int len) const { |
duke@435 | 100 | assert(m->vtable_index() >= 0, "do not ask this of non-vtable methods"); |
duke@435 | 101 | return m->vtable_index(); |
duke@435 | 102 | } |
duke@435 | 103 | |
duke@435 | 104 | int klassVtable::initialize_from_super(KlassHandle super) { |
duke@435 | 105 | if (super.is_null()) { |
duke@435 | 106 | return 0; |
duke@435 | 107 | } else { |
duke@435 | 108 | // copy methods from superKlass |
duke@435 | 109 | // can't inherit from array class, so must be instanceKlass |
duke@435 | 110 | assert(super->oop_is_instance(), "must be instance klass"); |
duke@435 | 111 | instanceKlass* sk = (instanceKlass*)super()->klass_part(); |
duke@435 | 112 | klassVtable* superVtable = sk->vtable(); |
duke@435 | 113 | assert(superVtable->length() <= _length, "vtable too short"); |
duke@435 | 114 | #ifdef ASSERT |
duke@435 | 115 | superVtable->verify(tty, true); |
duke@435 | 116 | #endif |
duke@435 | 117 | superVtable->copy_vtable_to(table()); |
duke@435 | 118 | #ifndef PRODUCT |
duke@435 | 119 | if (PrintVtables && Verbose) { |
duke@435 | 120 | tty->print_cr("copy vtable from %s to %s size %d", sk->internal_name(), klass()->internal_name(), _length); |
duke@435 | 121 | } |
duke@435 | 122 | #endif |
duke@435 | 123 | return superVtable->length(); |
duke@435 | 124 | } |
duke@435 | 125 | } |
duke@435 | 126 | |
duke@435 | 127 | // Revised lookup semantics introduced 1.3 (Kestral beta) |
duke@435 | 128 | void klassVtable::initialize_vtable(bool checkconstraints, TRAPS) { |
duke@435 | 129 | |
duke@435 | 130 | // Note: Arrays can have intermediate array supers. Use java_super to skip them. |
duke@435 | 131 | KlassHandle super (THREAD, klass()->java_super()); |
duke@435 | 132 | int nofNewEntries = 0; |
duke@435 | 133 | |
duke@435 | 134 | |
duke@435 | 135 | if (PrintVtables && !klass()->oop_is_array()) { |
duke@435 | 136 | ResourceMark rm(THREAD); |
duke@435 | 137 | tty->print_cr("Initializing: %s", _klass->name()->as_C_string()); |
duke@435 | 138 | } |
duke@435 | 139 | |
duke@435 | 140 | #ifdef ASSERT |
duke@435 | 141 | oop* end_of_obj = (oop*)_klass() + _klass()->size(); |
duke@435 | 142 | oop* end_of_vtable = (oop*)&table()[_length]; |
duke@435 | 143 | assert(end_of_vtable <= end_of_obj, "vtable extends beyond end"); |
duke@435 | 144 | #endif |
duke@435 | 145 | |
duke@435 | 146 | if (Universe::is_bootstrapping()) { |
duke@435 | 147 | // just clear everything |
duke@435 | 148 | for (int i = 0; i < _length; i++) table()[i].clear(); |
duke@435 | 149 | return; |
duke@435 | 150 | } |
duke@435 | 151 | |
duke@435 | 152 | int super_vtable_len = initialize_from_super(super); |
duke@435 | 153 | if (klass()->oop_is_array()) { |
duke@435 | 154 | assert(super_vtable_len == _length, "arrays shouldn't introduce new methods"); |
duke@435 | 155 | } else { |
duke@435 | 156 | assert(_klass->oop_is_instance(), "must be instanceKlass"); |
duke@435 | 157 | |
duke@435 | 158 | objArrayHandle methods(THREAD, ik()->methods()); |
duke@435 | 159 | int len = methods()->length(); |
duke@435 | 160 | int initialized = super_vtable_len; |
duke@435 | 161 | |
duke@435 | 162 | // update_super_vtable can stop for gc - ensure using handles |
duke@435 | 163 | for (int i = 0; i < len; i++) { |
duke@435 | 164 | HandleMark hm(THREAD); |
duke@435 | 165 | assert(methods()->obj_at(i)->is_method(), "must be a methodOop"); |
duke@435 | 166 | methodHandle mh(THREAD, (methodOop)methods()->obj_at(i)); |
duke@435 | 167 | |
duke@435 | 168 | bool needs_new_entry = update_super_vtable(ik(), mh, super_vtable_len, checkconstraints, CHECK); |
duke@435 | 169 | |
duke@435 | 170 | if (needs_new_entry) { |
duke@435 | 171 | put_method_at(mh(), initialized); |
duke@435 | 172 | mh()->set_vtable_index(initialized); // set primary vtable index |
duke@435 | 173 | initialized++; |
duke@435 | 174 | } |
duke@435 | 175 | } |
duke@435 | 176 | |
duke@435 | 177 | // add miranda methods; it will also update the value of initialized |
duke@435 | 178 | fill_in_mirandas(initialized); |
duke@435 | 179 | |
duke@435 | 180 | // In class hierachieswhere the accesibility is not increasing (i.e., going from private -> |
duke@435 | 181 | // package_private -> publicprotected), the vtable might actually be smaller than our initial |
duke@435 | 182 | // calculation. |
duke@435 | 183 | assert(initialized <= _length, "vtable initialization failed"); |
duke@435 | 184 | for(;initialized < _length; initialized++) { |
duke@435 | 185 | put_method_at(NULL, initialized); |
duke@435 | 186 | } |
duke@435 | 187 | NOT_PRODUCT(verify(tty, true)); |
duke@435 | 188 | } |
duke@435 | 189 | } |
duke@435 | 190 | |
duke@435 | 191 | // Interates through the vtables to find the broadest access level. This |
duke@435 | 192 | // will always be monotomic for valid Java programs - but not neccesarily |
duke@435 | 193 | // for incompatible class files. |
duke@435 | 194 | klassVtable::AccessType klassVtable::vtable_accessibility_at(int i) { |
duke@435 | 195 | // This vtable is not implementing the specific method |
duke@435 | 196 | if (i >= length()) return acc_private; |
duke@435 | 197 | |
duke@435 | 198 | // Compute AccessType for current method. public or protected we are done. |
duke@435 | 199 | methodOop m = method_at(i); |
duke@435 | 200 | if (m->is_protected() || m->is_public()) return acc_publicprotected; |
duke@435 | 201 | |
duke@435 | 202 | AccessType acc = m->is_package_private() ? acc_package_private : acc_private; |
duke@435 | 203 | |
duke@435 | 204 | // Compute AccessType for method in super classes |
duke@435 | 205 | klassOop super = klass()->super(); |
duke@435 | 206 | AccessType super_acc = (super != NULL) ? instanceKlass::cast(klass()->super())->vtable()->vtable_accessibility_at(i) |
duke@435 | 207 | : acc_private; |
duke@435 | 208 | |
duke@435 | 209 | // Merge |
duke@435 | 210 | return (AccessType)MAX2((int)acc, (int)super_acc); |
duke@435 | 211 | } |
duke@435 | 212 | |
duke@435 | 213 | |
duke@435 | 214 | // Update child's copy of super vtable for overrides |
duke@435 | 215 | // OR return true if a new vtable entry is required |
duke@435 | 216 | // Only called for instanceKlass's, i.e. not for arrays |
duke@435 | 217 | // If that changed, could not use _klass as handle for klass |
duke@435 | 218 | bool klassVtable::update_super_vtable(instanceKlass* klass, methodHandle target_method, int super_vtable_len, bool checkconstraints, TRAPS) { |
duke@435 | 219 | ResourceMark rm; |
duke@435 | 220 | bool allocate_new = true; |
duke@435 | 221 | assert(klass->oop_is_instance(), "must be instanceKlass"); |
duke@435 | 222 | |
duke@435 | 223 | // Initialize the method's vtable index to "nonvirtual". |
duke@435 | 224 | // If we allocate a vtable entry, we will update it to a non-negative number. |
duke@435 | 225 | target_method()->set_vtable_index(methodOopDesc::nonvirtual_vtable_index); |
duke@435 | 226 | |
duke@435 | 227 | // Static and <init> methods are never in |
duke@435 | 228 | if (target_method()->is_static() || target_method()->name() == vmSymbols::object_initializer_name()) { |
duke@435 | 229 | return false; |
duke@435 | 230 | } |
duke@435 | 231 | |
duke@435 | 232 | if (klass->is_final() || target_method()->is_final()) { |
duke@435 | 233 | // a final method never needs a new entry; final methods can be statically |
duke@435 | 234 | // resolved and they have to be present in the vtable only if they override |
duke@435 | 235 | // a super's method, in which case they re-use its entry |
duke@435 | 236 | allocate_new = false; |
duke@435 | 237 | } |
duke@435 | 238 | |
duke@435 | 239 | // we need a new entry if there is no superclass |
duke@435 | 240 | if (klass->super() == NULL) { |
duke@435 | 241 | return allocate_new; |
duke@435 | 242 | } |
duke@435 | 243 | |
duke@435 | 244 | // private methods always have a new entry in the vtable |
duke@435 | 245 | if (target_method()->is_private()) { |
duke@435 | 246 | return allocate_new; |
duke@435 | 247 | } |
duke@435 | 248 | |
duke@435 | 249 | // search through the vtable and update overridden entries |
duke@435 | 250 | // Since check_signature_loaders acquires SystemDictionary_lock |
duke@435 | 251 | // which can block for gc, once we are in this loop, use handles, not |
duke@435 | 252 | // unhandled oops unless they are reinitialized for each loop |
duke@435 | 253 | // handles for name, signature, klass, target_method |
duke@435 | 254 | // not for match_method, holder |
duke@435 | 255 | |
duke@435 | 256 | symbolHandle name(THREAD,target_method()->name()); |
duke@435 | 257 | symbolHandle signature(THREAD,target_method()->signature()); |
duke@435 | 258 | for(int i = 0; i < super_vtable_len; i++) { |
duke@435 | 259 | methodOop match_method = method_at(i); |
duke@435 | 260 | // Check if method name matches |
duke@435 | 261 | if (match_method->name() == name() && match_method->signature() == signature()) { |
duke@435 | 262 | |
duke@435 | 263 | instanceKlass* holder = (THREAD, instanceKlass::cast(match_method->method_holder())); |
duke@435 | 264 | |
duke@435 | 265 | // Check if the match_method is accessable from current class |
duke@435 | 266 | |
duke@435 | 267 | bool same_package_init = false; |
duke@435 | 268 | bool same_package_flag = false; |
duke@435 | 269 | bool simple_match = match_method->is_public() || match_method->is_protected(); |
duke@435 | 270 | if (!simple_match) { |
duke@435 | 271 | same_package_init = true; |
duke@435 | 272 | same_package_flag = holder->is_same_class_package(_klass->class_loader(), _klass->name()); |
duke@435 | 273 | |
duke@435 | 274 | simple_match = match_method->is_package_private() && same_package_flag; |
duke@435 | 275 | } |
duke@435 | 276 | // match_method is the superclass' method. Note we can't override |
duke@435 | 277 | // and shouldn't access superclass' ACC_PRIVATE methods |
duke@435 | 278 | // (although they have been copied into our vtable) |
duke@435 | 279 | // A simple form of this statement is: |
duke@435 | 280 | // if ( (match_method->is_public() || match_method->is_protected()) || |
duke@435 | 281 | // (match_method->is_package_private() && holder->is_same_class_package(klass->class_loader(), klass->name()))) { |
duke@435 | 282 | // |
duke@435 | 283 | // The complexity is introduced it avoid recomputing 'is_same_class_package' which is expensive. |
duke@435 | 284 | if (simple_match) { |
duke@435 | 285 | // Check if target_method and match_method has same level of accessibility. The accesibility of the |
duke@435 | 286 | // match method is the "most-general" visibility of all entries at it's particular vtable index for |
duke@435 | 287 | // all superclasses. This check must be done before we override the current entry in the vtable. |
duke@435 | 288 | AccessType at = vtable_accessibility_at(i); |
duke@435 | 289 | bool same_access = false; |
duke@435 | 290 | |
duke@435 | 291 | if ( (at == acc_publicprotected && (target_method()->is_public() || target_method()->is_protected()) |
duke@435 | 292 | || (at == acc_package_private && (target_method()->is_package_private() && |
duke@435 | 293 | (( same_package_init && same_package_flag) || |
duke@435 | 294 | (!same_package_init && holder->is_same_class_package(_klass->class_loader(), _klass->name()))))))) { |
duke@435 | 295 | same_access = true; |
duke@435 | 296 | } |
duke@435 | 297 | |
duke@435 | 298 | if (checkconstraints) { |
duke@435 | 299 | // Override vtable entry if passes loader constraint check |
duke@435 | 300 | // if loader constraint checking requested |
duke@435 | 301 | // No need to visit his super, since he and his super |
duke@435 | 302 | // have already made any needed loader constraints. |
duke@435 | 303 | // Since loader constraints are transitive, it is enough |
duke@435 | 304 | // to link to the first super, and we get all the others. |
duke@435 | 305 | symbolHandle signature(THREAD, target_method()->signature()); |
duke@435 | 306 | Handle this_loader(THREAD, _klass->class_loader()); |
duke@435 | 307 | instanceKlassHandle super_klass(THREAD, _klass->super()); |
duke@435 | 308 | Handle super_loader(THREAD, super_klass->class_loader()); |
duke@435 | 309 | |
duke@435 | 310 | if (this_loader() != super_loader()) { |
duke@435 | 311 | ResourceMark rm(THREAD); |
duke@435 | 312 | char* failed_type_name = |
duke@435 | 313 | SystemDictionary::check_signature_loaders(signature, this_loader, |
duke@435 | 314 | super_loader, true, |
duke@435 | 315 | CHECK_(false)); |
duke@435 | 316 | if (failed_type_name != NULL) { |
duke@435 | 317 | const char* msg = "loader constraint violation: when resolving " |
duke@435 | 318 | "overridden method \"%s\" the class loader (instance" |
duke@435 | 319 | " of %s) of the current class, %s, and its superclass loader " |
duke@435 | 320 | "(instance of %s), have different Class objects for the type " |
duke@435 | 321 | "%s used in the signature"; |
duke@435 | 322 | char* sig = target_method()->name_and_sig_as_C_string(); |
duke@435 | 323 | const char* loader1 = SystemDictionary::loader_name(this_loader()); |
duke@435 | 324 | char* current = _klass->name()->as_C_string(); |
duke@435 | 325 | const char* loader2 = SystemDictionary::loader_name(super_loader()); |
duke@435 | 326 | size_t buflen = strlen(msg) + strlen(sig) + strlen(loader1) + |
duke@435 | 327 | strlen(current) + strlen(loader2) + strlen(failed_type_name); |
duke@435 | 328 | char* buf = NEW_RESOURCE_ARRAY_IN_THREAD(THREAD, char, buflen); |
duke@435 | 329 | jio_snprintf(buf, buflen, msg, sig, loader1, current, loader2, |
duke@435 | 330 | failed_type_name); |
duke@435 | 331 | THROW_MSG_(vmSymbols::java_lang_LinkageError(), buf, false); |
duke@435 | 332 | } |
duke@435 | 333 | } |
duke@435 | 334 | } |
duke@435 | 335 | put_method_at(target_method(), i); |
duke@435 | 336 | |
duke@435 | 337 | |
duke@435 | 338 | if (same_access) { |
duke@435 | 339 | // target and match has same accessiblity - share entry |
duke@435 | 340 | allocate_new = false; |
duke@435 | 341 | target_method()->set_vtable_index(i); |
duke@435 | 342 | #ifndef PRODUCT |
duke@435 | 343 | if (PrintVtables && Verbose) { |
duke@435 | 344 | AccessType targetacc; |
duke@435 | 345 | if (target_method()->is_protected() || |
duke@435 | 346 | target_method()->is_public()) { |
duke@435 | 347 | targetacc = acc_publicprotected; |
duke@435 | 348 | } else { |
duke@435 | 349 | targetacc = target_method()->is_package_private() ? acc_package_private : acc_private; |
duke@435 | 350 | } |
duke@435 | 351 | tty->print_cr("overriding with %s::%s index %d, original flags: %x overriders flags: %x", |
duke@435 | 352 | _klass->internal_name(), (target_method() != NULL) ? |
duke@435 | 353 | target_method()->name()->as_C_string() : "<NULL>", i, |
duke@435 | 354 | at, targetacc); |
duke@435 | 355 | } |
duke@435 | 356 | #endif /*PRODUCT*/ |
duke@435 | 357 | } else { |
duke@435 | 358 | #ifndef PRODUCT |
duke@435 | 359 | if (PrintVtables && Verbose) { |
duke@435 | 360 | AccessType targetacc; |
duke@435 | 361 | if (target_method()->is_protected() || |
duke@435 | 362 | target_method()->is_public()) { |
duke@435 | 363 | targetacc = acc_publicprotected; |
duke@435 | 364 | } else { |
duke@435 | 365 | targetacc = target_method()->is_package_private() ? acc_package_private : acc_private; |
duke@435 | 366 | } |
duke@435 | 367 | tty->print_cr("override %s %s::%s at index %d, original flags: %x overriders flags: %x", |
duke@435 | 368 | allocate_new ? "+ new" : "only", |
duke@435 | 369 | _klass->internal_name(), (target_method() != NULL) ? |
duke@435 | 370 | target_method()->name()->as_C_string() : "<NULL>", i, |
duke@435 | 371 | at, targetacc); |
duke@435 | 372 | } |
duke@435 | 373 | #endif /*PRODUCT*/ |
duke@435 | 374 | } |
duke@435 | 375 | } |
duke@435 | 376 | } |
duke@435 | 377 | } |
duke@435 | 378 | return allocate_new; |
duke@435 | 379 | } |
duke@435 | 380 | |
duke@435 | 381 | |
duke@435 | 382 | |
duke@435 | 383 | void klassVtable::put_method_at(methodOop m, int index) { |
duke@435 | 384 | assert(m->is_oop_or_null(), "Not an oop or null"); |
duke@435 | 385 | #ifndef PRODUCT |
duke@435 | 386 | if (PrintVtables && Verbose) { |
duke@435 | 387 | tty->print_cr("adding %s::%s at index %d", _klass->internal_name(), |
duke@435 | 388 | (m != NULL) ? m->name()->as_C_string() : "<NULL>", index); |
duke@435 | 389 | } |
duke@435 | 390 | assert(unchecked_method_at(index)->is_oop_or_null(), "Not an oop or null"); |
duke@435 | 391 | #endif |
duke@435 | 392 | table()[index].set(m); |
duke@435 | 393 | } |
duke@435 | 394 | |
duke@435 | 395 | // Find out if a method "m" with superclass "super", loader "classloader" and |
duke@435 | 396 | // name "classname" needs a new vtable entry. Let P be a class package defined |
duke@435 | 397 | // by "classloader" and "classname". |
duke@435 | 398 | // NOTE: The logic used here is very similar to the one used for computing |
duke@435 | 399 | // the vtables indices for a method. We cannot directly use that function because, |
duke@435 | 400 | // when the Universe is boostrapping, a super's vtable might not be initialized. |
duke@435 | 401 | bool klassVtable::needs_new_vtable_entry(methodOop target_method, |
duke@435 | 402 | klassOop super, |
duke@435 | 403 | oop classloader, |
duke@435 | 404 | symbolOop classname, |
duke@435 | 405 | AccessFlags class_flags) { |
duke@435 | 406 | if ((class_flags.is_final() || target_method->is_final()) || |
duke@435 | 407 | // a final method never needs a new entry; final methods can be statically |
duke@435 | 408 | // resolved and they have to be present in the vtable only if they override |
duke@435 | 409 | // a super's method, in which case they re-use its entry |
duke@435 | 410 | (target_method->is_static()) || |
duke@435 | 411 | // static methods don't need to be in vtable |
duke@435 | 412 | (target_method->name() == vmSymbols::object_initializer_name()) |
duke@435 | 413 | // <init> is never called dynamically-bound |
duke@435 | 414 | ) { |
duke@435 | 415 | return false; |
duke@435 | 416 | } |
duke@435 | 417 | |
duke@435 | 418 | // we need a new entry if there is no superclass |
duke@435 | 419 | if (super == NULL) { |
duke@435 | 420 | return true; |
duke@435 | 421 | } |
duke@435 | 422 | |
duke@435 | 423 | // private methods always have a new entry in the vtable |
duke@435 | 424 | if (target_method->is_private()) { |
duke@435 | 425 | return true; |
duke@435 | 426 | } |
duke@435 | 427 | |
duke@435 | 428 | // search through the super class hierarchy to see if we need |
duke@435 | 429 | // a new entry |
duke@435 | 430 | symbolOop name = target_method->name(); |
duke@435 | 431 | symbolOop signature = target_method->signature(); |
duke@435 | 432 | klassOop k = super; |
duke@435 | 433 | methodOop match_method = NULL; |
duke@435 | 434 | instanceKlass *holder = NULL; |
duke@435 | 435 | while (k != NULL) { |
duke@435 | 436 | // lookup through the hierarchy for a method with matching name and sign. |
duke@435 | 437 | match_method = instanceKlass::cast(k)->lookup_method(name, signature); |
duke@435 | 438 | if (match_method == NULL) { |
duke@435 | 439 | break; // we still have to search for a matching miranda method |
duke@435 | 440 | } |
duke@435 | 441 | // get the class holding the matching method |
duke@435 | 442 | holder = instanceKlass::cast(match_method->method_holder()); |
duke@435 | 443 | |
duke@435 | 444 | if (!match_method->is_static()) { // we want only instance method matches |
duke@435 | 445 | if ((target_method->is_public() || target_method->is_protected()) && |
duke@435 | 446 | (match_method->is_public() || match_method->is_protected())) { |
duke@435 | 447 | // target and match are public/protected; we do not need a new entry |
duke@435 | 448 | return false; |
duke@435 | 449 | } |
duke@435 | 450 | |
duke@435 | 451 | if (target_method->is_package_private() && |
duke@435 | 452 | match_method->is_package_private() && |
duke@435 | 453 | holder->is_same_class_package(classloader, classname)) { |
duke@435 | 454 | // target and match are P private; we do not need a new entry |
duke@435 | 455 | return false; |
duke@435 | 456 | } |
duke@435 | 457 | } |
duke@435 | 458 | |
duke@435 | 459 | k = holder->super(); // haven't found a match yet; continue to look |
duke@435 | 460 | } |
duke@435 | 461 | |
duke@435 | 462 | // if the target method is public or protected it may have a matching |
duke@435 | 463 | // miranda method in the super, whose entry it should re-use. |
duke@435 | 464 | if (target_method->is_public() || target_method->is_protected()) { |
duke@435 | 465 | instanceKlass *sk = instanceKlass::cast(super); |
duke@435 | 466 | if (sk->has_miranda_methods()) { |
duke@435 | 467 | if (sk->lookup_method_in_all_interfaces(name, signature) != NULL) { |
duke@435 | 468 | return false; // found a matching miranda; we do not need a new entry |
duke@435 | 469 | } |
duke@435 | 470 | } |
duke@435 | 471 | } |
duke@435 | 472 | |
duke@435 | 473 | return true; // found no match; we need a new entry |
duke@435 | 474 | } |
duke@435 | 475 | |
duke@435 | 476 | // Support for miranda methods |
duke@435 | 477 | |
duke@435 | 478 | // get the vtable index of a miranda method with matching "name" and "signature" |
duke@435 | 479 | int klassVtable::index_of_miranda(symbolOop name, symbolOop signature) { |
duke@435 | 480 | // search from the bottom, might be faster |
duke@435 | 481 | for (int i = (length() - 1); i >= 0; i--) { |
duke@435 | 482 | methodOop m = table()[i].method(); |
duke@435 | 483 | if (is_miranda_entry_at(i) && |
duke@435 | 484 | m->name() == name && m->signature() == signature) { |
duke@435 | 485 | return i; |
duke@435 | 486 | } |
duke@435 | 487 | } |
duke@435 | 488 | return methodOopDesc::invalid_vtable_index; |
duke@435 | 489 | } |
duke@435 | 490 | |
duke@435 | 491 | // check if an entry is miranda |
duke@435 | 492 | bool klassVtable::is_miranda_entry_at(int i) { |
duke@435 | 493 | methodOop m = method_at(i); |
duke@435 | 494 | klassOop method_holder = m->method_holder(); |
duke@435 | 495 | instanceKlass *mhk = instanceKlass::cast(method_holder); |
duke@435 | 496 | |
duke@435 | 497 | // miranda methods are interface methods in a class's vtable |
duke@435 | 498 | if (mhk->is_interface()) { |
duke@435 | 499 | assert(m->is_public() && m->is_abstract(), "should be public and abstract"); |
duke@435 | 500 | assert(ik()->implements_interface(method_holder) , "this class should implement the interface"); |
duke@435 | 501 | assert(is_miranda(m, ik()->methods(), ik()->super()), "should be a miranda_method"); |
duke@435 | 502 | return true; |
duke@435 | 503 | } |
duke@435 | 504 | return false; |
duke@435 | 505 | } |
duke@435 | 506 | |
duke@435 | 507 | // check if a method is a miranda method, given a class's methods table and it's super |
duke@435 | 508 | // the caller must make sure that the method belongs to an interface implemented by the class |
duke@435 | 509 | bool klassVtable::is_miranda(methodOop m, objArrayOop class_methods, klassOop super) { |
duke@435 | 510 | symbolOop name = m->name(); |
duke@435 | 511 | symbolOop signature = m->signature(); |
duke@435 | 512 | if (instanceKlass::find_method(class_methods, name, signature) == NULL) { |
duke@435 | 513 | // did not find it in the method table of the current class |
duke@435 | 514 | if (super == NULL) { |
duke@435 | 515 | // super doesn't exist |
duke@435 | 516 | return true; |
duke@435 | 517 | } else { |
duke@435 | 518 | if (instanceKlass::cast(super)->lookup_method(name, signature) == NULL) { |
duke@435 | 519 | // super class hierarchy does not implement it |
duke@435 | 520 | return true; |
duke@435 | 521 | } |
duke@435 | 522 | } |
duke@435 | 523 | } |
duke@435 | 524 | return false; |
duke@435 | 525 | } |
duke@435 | 526 | |
duke@435 | 527 | void klassVtable::add_new_mirandas_to_list(GrowableArray<methodOop>* list_of_current_mirandas, |
duke@435 | 528 | objArrayOop current_interface_methods, |
duke@435 | 529 | objArrayOop class_methods, |
duke@435 | 530 | klassOop super) { |
duke@435 | 531 | // iterate thru the current interface's method to see if it a miranda |
duke@435 | 532 | int num_methods = current_interface_methods->length(); |
duke@435 | 533 | for (int i = 0; i < num_methods; i++) { |
duke@435 | 534 | methodOop im = methodOop(current_interface_methods->obj_at(i)); |
duke@435 | 535 | bool is_duplicate = false; |
duke@435 | 536 | int num_of_current_mirandas = list_of_current_mirandas->length(); |
duke@435 | 537 | // check for duplicate mirandas in different interfaces we implement |
duke@435 | 538 | for (int j = 0; j < num_of_current_mirandas; j++) { |
duke@435 | 539 | methodOop miranda = list_of_current_mirandas->at(j); |
duke@435 | 540 | if ((im->name() == miranda->name()) && |
duke@435 | 541 | (im->signature() == miranda->signature())) { |
duke@435 | 542 | is_duplicate = true; |
duke@435 | 543 | break; |
duke@435 | 544 | } |
duke@435 | 545 | } |
duke@435 | 546 | |
duke@435 | 547 | if (!is_duplicate) { // we don't want duplicate miranda entries in the vtable |
duke@435 | 548 | if (is_miranda(im, class_methods, super)) { // is it a miranda at all? |
duke@435 | 549 | instanceKlass *sk = instanceKlass::cast(super); |
duke@435 | 550 | // check if it is a duplicate of a super's miranda |
duke@435 | 551 | if (sk->lookup_method_in_all_interfaces(im->name(), im->signature()) == NULL) { |
duke@435 | 552 | list_of_current_mirandas->append(im); |
duke@435 | 553 | } |
duke@435 | 554 | } |
duke@435 | 555 | } |
duke@435 | 556 | } |
duke@435 | 557 | } |
duke@435 | 558 | |
duke@435 | 559 | void klassVtable::get_mirandas(GrowableArray<methodOop>* mirandas, |
duke@435 | 560 | klassOop super, objArrayOop class_methods, |
duke@435 | 561 | objArrayOop local_interfaces) { |
duke@435 | 562 | assert((mirandas->length() == 0) , "current mirandas must be 0"); |
duke@435 | 563 | |
duke@435 | 564 | // iterate thru the local interfaces looking for a miranda |
duke@435 | 565 | int num_local_ifs = local_interfaces->length(); |
duke@435 | 566 | for (int i = 0; i < num_local_ifs; i++) { |
duke@435 | 567 | instanceKlass *ik = instanceKlass::cast(klassOop(local_interfaces->obj_at(i))); |
duke@435 | 568 | add_new_mirandas_to_list(mirandas, ik->methods(), class_methods, super); |
duke@435 | 569 | // iterate thru each local's super interfaces |
duke@435 | 570 | objArrayOop super_ifs = ik->transitive_interfaces(); |
duke@435 | 571 | int num_super_ifs = super_ifs->length(); |
duke@435 | 572 | for (int j = 0; j < num_super_ifs; j++) { |
duke@435 | 573 | instanceKlass *sik = instanceKlass::cast(klassOop(super_ifs->obj_at(j))); |
duke@435 | 574 | add_new_mirandas_to_list(mirandas, sik->methods(), class_methods, super); |
duke@435 | 575 | } |
duke@435 | 576 | } |
duke@435 | 577 | } |
duke@435 | 578 | |
duke@435 | 579 | // get number of mirandas |
duke@435 | 580 | int klassVtable::get_num_mirandas(klassOop super, objArrayOop class_methods, objArrayOop local_interfaces) { |
duke@435 | 581 | ResourceMark rm; |
duke@435 | 582 | GrowableArray<methodOop>* mirandas = new GrowableArray<methodOop>(20); |
duke@435 | 583 | get_mirandas(mirandas, super, class_methods, local_interfaces); |
duke@435 | 584 | return mirandas->length(); |
duke@435 | 585 | } |
duke@435 | 586 | |
duke@435 | 587 | // fill in mirandas |
duke@435 | 588 | void klassVtable::fill_in_mirandas(int& initialized) { |
duke@435 | 589 | ResourceMark rm; |
duke@435 | 590 | GrowableArray<methodOop>* mirandas = new GrowableArray<methodOop>(20); |
duke@435 | 591 | instanceKlass *this_ik = ik(); |
duke@435 | 592 | get_mirandas(mirandas, this_ik->super(), this_ik->methods(), this_ik->local_interfaces()); |
duke@435 | 593 | int num_mirandas = mirandas->length(); |
duke@435 | 594 | for (int i = 0; i < num_mirandas; i++) { |
duke@435 | 595 | put_method_at(mirandas->at(i), initialized); |
duke@435 | 596 | initialized++; |
duke@435 | 597 | } |
duke@435 | 598 | } |
duke@435 | 599 | |
duke@435 | 600 | void klassVtable::copy_vtable_to(vtableEntry* start) { |
duke@435 | 601 | Copy::disjoint_words((HeapWord*)table(), (HeapWord*)start, _length * vtableEntry::size()); |
duke@435 | 602 | } |
duke@435 | 603 | |
duke@435 | 604 | void klassVtable::adjust_method_entries(methodOop* old_methods, methodOop* new_methods, |
duke@435 | 605 | int methods_length, bool * trace_name_printed) { |
duke@435 | 606 | // search the vtable for uses of either obsolete or EMCP methods |
duke@435 | 607 | for (int j = 0; j < methods_length; j++) { |
duke@435 | 608 | methodOop old_method = old_methods[j]; |
duke@435 | 609 | methodOop new_method = new_methods[j]; |
duke@435 | 610 | |
duke@435 | 611 | // In the vast majority of cases we could get the vtable index |
duke@435 | 612 | // by using: old_method->vtable_index() |
duke@435 | 613 | // However, there are rare cases, eg. sun.awt.X11.XDecoratedPeer.getX() |
duke@435 | 614 | // in sun.awt.X11.XFramePeer where methods occur more than once in the |
duke@435 | 615 | // vtable, so, alas, we must do an exhaustive search. |
duke@435 | 616 | for (int index = 0; index < length(); index++) { |
duke@435 | 617 | if (unchecked_method_at(index) == old_method) { |
duke@435 | 618 | put_method_at(new_method, index); |
duke@435 | 619 | |
duke@435 | 620 | if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) { |
duke@435 | 621 | if (!(*trace_name_printed)) { |
duke@435 | 622 | // RC_TRACE_MESG macro has an embedded ResourceMark |
duke@435 | 623 | RC_TRACE_MESG(("adjust: name=%s", |
duke@435 | 624 | Klass::cast(old_method->method_holder())->external_name())); |
duke@435 | 625 | *trace_name_printed = true; |
duke@435 | 626 | } |
duke@435 | 627 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 628 | RC_TRACE(0x00100000, ("vtable method update: %s(%s)", |
duke@435 | 629 | new_method->name()->as_C_string(), |
duke@435 | 630 | new_method->signature()->as_C_string())); |
duke@435 | 631 | } |
duke@435 | 632 | } |
duke@435 | 633 | } |
duke@435 | 634 | } |
duke@435 | 635 | } |
duke@435 | 636 | |
duke@435 | 637 | |
duke@435 | 638 | // Garbage collection |
duke@435 | 639 | void klassVtable::oop_follow_contents() { |
duke@435 | 640 | int len = length(); |
duke@435 | 641 | for (int i = 0; i < len; i++) { |
duke@435 | 642 | MarkSweep::mark_and_push(adr_method_at(i)); |
duke@435 | 643 | } |
duke@435 | 644 | } |
duke@435 | 645 | |
duke@435 | 646 | #ifndef SERIALGC |
duke@435 | 647 | void klassVtable::oop_follow_contents(ParCompactionManager* cm) { |
duke@435 | 648 | int len = length(); |
duke@435 | 649 | for (int i = 0; i < len; i++) { |
duke@435 | 650 | PSParallelCompact::mark_and_push(cm, adr_method_at(i)); |
duke@435 | 651 | } |
duke@435 | 652 | } |
duke@435 | 653 | #endif // SERIALGC |
duke@435 | 654 | |
duke@435 | 655 | void klassVtable::oop_adjust_pointers() { |
duke@435 | 656 | int len = length(); |
duke@435 | 657 | for (int i = 0; i < len; i++) { |
duke@435 | 658 | MarkSweep::adjust_pointer(adr_method_at(i)); |
duke@435 | 659 | } |
duke@435 | 660 | } |
duke@435 | 661 | |
duke@435 | 662 | #ifndef SERIALGC |
duke@435 | 663 | void klassVtable::oop_update_pointers(ParCompactionManager* cm) { |
duke@435 | 664 | const int n = length(); |
duke@435 | 665 | for (int i = 0; i < n; i++) { |
duke@435 | 666 | PSParallelCompact::adjust_pointer(adr_method_at(i)); |
duke@435 | 667 | } |
duke@435 | 668 | } |
duke@435 | 669 | |
duke@435 | 670 | void klassVtable::oop_update_pointers(ParCompactionManager* cm, |
duke@435 | 671 | HeapWord* beg_addr, HeapWord* end_addr) { |
duke@435 | 672 | const int n = length(); |
duke@435 | 673 | const int entry_size = vtableEntry::size(); |
duke@435 | 674 | |
duke@435 | 675 | int beg_idx = 0; |
duke@435 | 676 | HeapWord* const method_0 = (HeapWord*)adr_method_at(0); |
duke@435 | 677 | if (beg_addr > method_0) { |
duke@435 | 678 | // it's safe to use cast, as we have guarantees on vtable size to be sane |
duke@435 | 679 | beg_idx = int((pointer_delta(beg_addr, method_0) + entry_size - 1) / entry_size); |
duke@435 | 680 | } |
duke@435 | 681 | |
duke@435 | 682 | oop* const beg_oop = adr_method_at(beg_idx); |
duke@435 | 683 | oop* const end_oop = MIN2((oop*)end_addr, adr_method_at(n)); |
duke@435 | 684 | for (oop* cur_oop = beg_oop; cur_oop < end_oop; cur_oop += entry_size) { |
duke@435 | 685 | PSParallelCompact::adjust_pointer(cur_oop); |
duke@435 | 686 | } |
duke@435 | 687 | } |
duke@435 | 688 | #endif // SERIALGC |
duke@435 | 689 | |
duke@435 | 690 | // Iterators |
duke@435 | 691 | void klassVtable::oop_oop_iterate(OopClosure* blk) { |
duke@435 | 692 | int len = length(); |
duke@435 | 693 | for (int i = 0; i < len; i++) { |
duke@435 | 694 | blk->do_oop(adr_method_at(i)); |
duke@435 | 695 | } |
duke@435 | 696 | } |
duke@435 | 697 | |
duke@435 | 698 | void klassVtable::oop_oop_iterate_m(OopClosure* blk, MemRegion mr) { |
duke@435 | 699 | int len = length(); |
duke@435 | 700 | int i; |
duke@435 | 701 | for (i = 0; i < len; i++) { |
duke@435 | 702 | if ((HeapWord*)adr_method_at(i) >= mr.start()) break; |
duke@435 | 703 | } |
duke@435 | 704 | for (; i < len; i++) { |
duke@435 | 705 | oop* adr = adr_method_at(i); |
duke@435 | 706 | if ((HeapWord*)adr < mr.end()) blk->do_oop(adr); |
duke@435 | 707 | } |
duke@435 | 708 | } |
duke@435 | 709 | |
duke@435 | 710 | //----------------------------------------------------------------------------------------- |
duke@435 | 711 | // Itable code |
duke@435 | 712 | |
duke@435 | 713 | // Initialize a itableMethodEntry |
duke@435 | 714 | void itableMethodEntry::initialize(methodOop m) { |
duke@435 | 715 | if (m == NULL) return; |
duke@435 | 716 | |
duke@435 | 717 | _method = m; |
duke@435 | 718 | } |
duke@435 | 719 | |
duke@435 | 720 | klassItable::klassItable(instanceKlassHandle klass) { |
duke@435 | 721 | _klass = klass; |
duke@435 | 722 | |
duke@435 | 723 | if (klass->itable_length() > 0) { |
duke@435 | 724 | itableOffsetEntry* offset_entry = (itableOffsetEntry*)klass->start_of_itable(); |
duke@435 | 725 | if (offset_entry != NULL && offset_entry->interface_klass() != NULL) { // Check that itable is initialized |
duke@435 | 726 | // First offset entry points to the first method_entry |
duke@435 | 727 | intptr_t* method_entry = (intptr_t *)(((address)klass->as_klassOop()) + offset_entry->offset()); |
duke@435 | 728 | intptr_t* end = klass->end_of_itable(); |
duke@435 | 729 | |
duke@435 | 730 | _table_offset = (intptr_t*)offset_entry - (intptr_t*)klass->as_klassOop(); |
duke@435 | 731 | _size_offset_table = (method_entry - ((intptr_t*)offset_entry)) / itableOffsetEntry::size(); |
duke@435 | 732 | _size_method_table = (end - method_entry) / itableMethodEntry::size(); |
duke@435 | 733 | assert(_table_offset >= 0 && _size_offset_table >= 0 && _size_method_table >= 0, "wrong computation"); |
duke@435 | 734 | return; |
duke@435 | 735 | } |
duke@435 | 736 | } |
duke@435 | 737 | |
dcubed@451 | 738 | // The length of the itable was either zero, or it has not yet been initialized. |
duke@435 | 739 | _table_offset = 0; |
duke@435 | 740 | _size_offset_table = 0; |
duke@435 | 741 | _size_method_table = 0; |
duke@435 | 742 | } |
duke@435 | 743 | |
duke@435 | 744 | // Garbage Collection |
duke@435 | 745 | |
duke@435 | 746 | void klassItable::oop_follow_contents() { |
duke@435 | 747 | // offset table |
duke@435 | 748 | itableOffsetEntry* ioe = offset_entry(0); |
duke@435 | 749 | for(int i = 0; i < _size_offset_table; i++) { |
duke@435 | 750 | MarkSweep::mark_and_push((oop*)&ioe->_interface); |
duke@435 | 751 | ioe++; |
duke@435 | 752 | } |
duke@435 | 753 | |
duke@435 | 754 | // method table |
duke@435 | 755 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 756 | for(int j = 0; j < _size_method_table; j++) { |
duke@435 | 757 | MarkSweep::mark_and_push((oop*)&ime->_method); |
duke@435 | 758 | ime++; |
duke@435 | 759 | } |
duke@435 | 760 | } |
duke@435 | 761 | |
duke@435 | 762 | #ifndef SERIALGC |
duke@435 | 763 | void klassItable::oop_follow_contents(ParCompactionManager* cm) { |
duke@435 | 764 | // offset table |
duke@435 | 765 | itableOffsetEntry* ioe = offset_entry(0); |
duke@435 | 766 | for(int i = 0; i < _size_offset_table; i++) { |
duke@435 | 767 | PSParallelCompact::mark_and_push(cm, (oop*)&ioe->_interface); |
duke@435 | 768 | ioe++; |
duke@435 | 769 | } |
duke@435 | 770 | |
duke@435 | 771 | // method table |
duke@435 | 772 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 773 | for(int j = 0; j < _size_method_table; j++) { |
duke@435 | 774 | PSParallelCompact::mark_and_push(cm, (oop*)&ime->_method); |
duke@435 | 775 | ime++; |
duke@435 | 776 | } |
duke@435 | 777 | } |
duke@435 | 778 | #endif // SERIALGC |
duke@435 | 779 | |
duke@435 | 780 | void klassItable::oop_adjust_pointers() { |
duke@435 | 781 | // offset table |
duke@435 | 782 | itableOffsetEntry* ioe = offset_entry(0); |
duke@435 | 783 | for(int i = 0; i < _size_offset_table; i++) { |
duke@435 | 784 | MarkSweep::adjust_pointer((oop*)&ioe->_interface); |
duke@435 | 785 | ioe++; |
duke@435 | 786 | } |
duke@435 | 787 | |
duke@435 | 788 | // method table |
duke@435 | 789 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 790 | for(int j = 0; j < _size_method_table; j++) { |
duke@435 | 791 | MarkSweep::adjust_pointer((oop*)&ime->_method); |
duke@435 | 792 | ime++; |
duke@435 | 793 | } |
duke@435 | 794 | } |
duke@435 | 795 | |
duke@435 | 796 | #ifndef SERIALGC |
duke@435 | 797 | void klassItable::oop_update_pointers(ParCompactionManager* cm) { |
duke@435 | 798 | // offset table |
duke@435 | 799 | itableOffsetEntry* ioe = offset_entry(0); |
duke@435 | 800 | for(int i = 0; i < _size_offset_table; i++) { |
duke@435 | 801 | PSParallelCompact::adjust_pointer((oop*)&ioe->_interface); |
duke@435 | 802 | ioe++; |
duke@435 | 803 | } |
duke@435 | 804 | |
duke@435 | 805 | // method table |
duke@435 | 806 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 807 | for(int j = 0; j < _size_method_table; j++) { |
duke@435 | 808 | PSParallelCompact::adjust_pointer((oop*)&ime->_method); |
duke@435 | 809 | ime++; |
duke@435 | 810 | } |
duke@435 | 811 | } |
duke@435 | 812 | |
duke@435 | 813 | void klassItable::oop_update_pointers(ParCompactionManager* cm, |
duke@435 | 814 | HeapWord* beg_addr, HeapWord* end_addr) { |
duke@435 | 815 | // offset table |
duke@435 | 816 | itableOffsetEntry* ioe = offset_entry(0); |
duke@435 | 817 | for(int i = 0; i < _size_offset_table; i++) { |
duke@435 | 818 | oop* p = (oop*)&ioe->_interface; |
duke@435 | 819 | PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); |
duke@435 | 820 | ioe++; |
duke@435 | 821 | } |
duke@435 | 822 | |
duke@435 | 823 | // method table |
duke@435 | 824 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 825 | for(int j = 0; j < _size_method_table; j++) { |
duke@435 | 826 | oop* p = (oop*)&ime->_method; |
duke@435 | 827 | PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); |
duke@435 | 828 | ime++; |
duke@435 | 829 | } |
duke@435 | 830 | } |
duke@435 | 831 | #endif // SERIALGC |
duke@435 | 832 | |
duke@435 | 833 | // Iterators |
duke@435 | 834 | void klassItable::oop_oop_iterate(OopClosure* blk) { |
duke@435 | 835 | // offset table |
duke@435 | 836 | itableOffsetEntry* ioe = offset_entry(0); |
duke@435 | 837 | for(int i = 0; i < _size_offset_table; i++) { |
duke@435 | 838 | blk->do_oop((oop*)&ioe->_interface); |
duke@435 | 839 | ioe++; |
duke@435 | 840 | } |
duke@435 | 841 | |
duke@435 | 842 | // method table |
duke@435 | 843 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 844 | for(int j = 0; j < _size_method_table; j++) { |
duke@435 | 845 | blk->do_oop((oop*)&ime->_method); |
duke@435 | 846 | ime++; |
duke@435 | 847 | } |
duke@435 | 848 | } |
duke@435 | 849 | |
duke@435 | 850 | void klassItable::oop_oop_iterate_m(OopClosure* blk, MemRegion mr) { |
duke@435 | 851 | // offset table |
duke@435 | 852 | itableOffsetEntry* ioe = offset_entry(0); |
duke@435 | 853 | for(int i = 0; i < _size_offset_table; i++) { |
duke@435 | 854 | oop* adr = (oop*)&ioe->_interface; |
duke@435 | 855 | if (mr.contains(adr)) blk->do_oop(adr); |
duke@435 | 856 | ioe++; |
duke@435 | 857 | } |
duke@435 | 858 | |
duke@435 | 859 | // method table |
duke@435 | 860 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 861 | for(int j = 0; j < _size_method_table; j++) { |
duke@435 | 862 | oop* adr = (oop*)&ime->_method; |
duke@435 | 863 | if (mr.contains(adr)) blk->do_oop(adr); |
duke@435 | 864 | ime++; |
duke@435 | 865 | } |
duke@435 | 866 | } |
duke@435 | 867 | |
duke@435 | 868 | |
duke@435 | 869 | static int initialize_count = 0; |
duke@435 | 870 | |
duke@435 | 871 | // Initialization |
duke@435 | 872 | void klassItable::initialize_itable(bool checkconstraints, TRAPS) { |
dcubed@451 | 873 | // Cannot be setup doing bootstrapping, interfaces don't have |
dcubed@451 | 874 | // itables, and klass with only ones entry have empty itables |
dcubed@451 | 875 | if (Universe::is_bootstrapping() || |
dcubed@451 | 876 | _klass->is_interface() || |
dcubed@451 | 877 | _klass->itable_length() == itableOffsetEntry::size()) return; |
duke@435 | 878 | |
dcubed@451 | 879 | // There's alway an extra itable entry so we can null-terminate it. |
dcubed@451 | 880 | guarantee(size_offset_table() >= 1, "too small"); |
dcubed@451 | 881 | int num_interfaces = size_offset_table() - 1; |
duke@435 | 882 | if (num_interfaces > 0) { |
dcubed@451 | 883 | if (TraceItables) tty->print_cr("%3d: Initializing itables for %s", ++initialize_count, |
dcubed@451 | 884 | _klass->name()->as_C_string()); |
duke@435 | 885 | |
duke@435 | 886 | |
duke@435 | 887 | // Interate through all interfaces |
duke@435 | 888 | int i; |
duke@435 | 889 | for(i = 0; i < num_interfaces; i++) { |
duke@435 | 890 | itableOffsetEntry* ioe = offset_entry(i); |
duke@435 | 891 | KlassHandle interf_h (THREAD, ioe->interface_klass()); |
duke@435 | 892 | assert(interf_h() != NULL && ioe->offset() != 0, "bad offset entry in itable"); |
duke@435 | 893 | initialize_itable_for_interface(ioe->offset(), interf_h, checkconstraints, CHECK); |
duke@435 | 894 | } |
duke@435 | 895 | |
duke@435 | 896 | } |
dcubed@451 | 897 | // Check that the last entry is empty |
dcubed@451 | 898 | itableOffsetEntry* ioe = offset_entry(size_offset_table() - 1); |
dcubed@451 | 899 | guarantee(ioe->interface_klass() == NULL && ioe->offset() == 0, "terminator entry missing"); |
duke@435 | 900 | } |
duke@435 | 901 | |
duke@435 | 902 | |
duke@435 | 903 | void klassItable::initialize_itable_for_interface(int method_table_offset, KlassHandle interf_h, bool checkconstraints, TRAPS) { |
duke@435 | 904 | objArrayHandle methods(THREAD, instanceKlass::cast(interf_h())->methods()); |
duke@435 | 905 | int nof_methods = methods()->length(); |
duke@435 | 906 | HandleMark hm; |
duke@435 | 907 | KlassHandle klass = _klass; |
duke@435 | 908 | assert(nof_methods > 0, "at least one method must exist for interface to be in vtable") |
duke@435 | 909 | Handle interface_loader (THREAD, instanceKlass::cast(interf_h())->class_loader()); |
duke@435 | 910 | int ime_num = 0; |
duke@435 | 911 | |
duke@435 | 912 | // Skip first methodOop if it is a class initializer |
duke@435 | 913 | int i = ((methodOop)methods()->obj_at(0))->name() != vmSymbols::class_initializer_name() ? 0 : 1; |
duke@435 | 914 | |
duke@435 | 915 | // m, method_name, method_signature, klass reset each loop so they |
duke@435 | 916 | // don't need preserving across check_signature_loaders call |
duke@435 | 917 | // methods needs a handle in case of gc from check_signature_loaders |
duke@435 | 918 | for(; i < nof_methods; i++) { |
duke@435 | 919 | methodOop m = (methodOop)methods()->obj_at(i); |
duke@435 | 920 | symbolOop method_name = m->name(); |
duke@435 | 921 | symbolOop method_signature = m->signature(); |
duke@435 | 922 | |
duke@435 | 923 | // This is same code as in Linkresolver::lookup_instance_method_in_klasses |
duke@435 | 924 | methodOop target = klass->uncached_lookup_method(method_name, method_signature); |
duke@435 | 925 | while (target != NULL && target->is_static()) { |
duke@435 | 926 | // continue with recursive lookup through the superclass |
duke@435 | 927 | klassOop super = Klass::cast(target->method_holder())->super(); |
duke@435 | 928 | target = (super == NULL) ? methodOop(NULL) : Klass::cast(super)->uncached_lookup_method(method_name, method_signature); |
duke@435 | 929 | } |
duke@435 | 930 | if (target == NULL || !target->is_public() || target->is_abstract()) { |
duke@435 | 931 | // Entry do not resolve. Leave it empty |
duke@435 | 932 | } else { |
duke@435 | 933 | // Entry did resolve, check loader constraints before initializing |
duke@435 | 934 | // if checkconstraints requested |
duke@435 | 935 | methodHandle target_h (THREAD, target); // preserve across gc |
duke@435 | 936 | if (checkconstraints) { |
duke@435 | 937 | Handle method_holder_loader (THREAD, instanceKlass::cast(target->method_holder())->class_loader()); |
duke@435 | 938 | if (method_holder_loader() != interface_loader()) { |
duke@435 | 939 | ResourceMark rm(THREAD); |
duke@435 | 940 | char* failed_type_name = |
duke@435 | 941 | SystemDictionary::check_signature_loaders(method_signature, |
duke@435 | 942 | method_holder_loader, |
duke@435 | 943 | interface_loader, |
duke@435 | 944 | true, CHECK); |
duke@435 | 945 | if (failed_type_name != NULL) { |
duke@435 | 946 | const char* msg = "loader constraint violation in interface " |
duke@435 | 947 | "itable initialization: when resolving method \"%s\" the class" |
duke@435 | 948 | " loader (instance of %s) of the current class, %s, " |
duke@435 | 949 | "and the class loader (instance of %s) for interface " |
duke@435 | 950 | "%s have different Class objects for the type %s " |
duke@435 | 951 | "used in the signature"; |
duke@435 | 952 | char* sig = target_h()->name_and_sig_as_C_string(); |
duke@435 | 953 | const char* loader1 = SystemDictionary::loader_name(method_holder_loader()); |
duke@435 | 954 | char* current = klass->name()->as_C_string(); |
duke@435 | 955 | const char* loader2 = SystemDictionary::loader_name(interface_loader()); |
duke@435 | 956 | char* iface = instanceKlass::cast(interf_h())->name()->as_C_string(); |
duke@435 | 957 | size_t buflen = strlen(msg) + strlen(sig) + strlen(loader1) + |
duke@435 | 958 | strlen(current) + strlen(loader2) + strlen(iface) + |
duke@435 | 959 | strlen(failed_type_name); |
duke@435 | 960 | char* buf = NEW_RESOURCE_ARRAY_IN_THREAD(THREAD, char, buflen); |
duke@435 | 961 | jio_snprintf(buf, buflen, msg, sig, loader1, current, loader2, |
duke@435 | 962 | iface, failed_type_name); |
duke@435 | 963 | THROW_MSG(vmSymbols::java_lang_LinkageError(), buf); |
duke@435 | 964 | } |
duke@435 | 965 | } |
duke@435 | 966 | } |
duke@435 | 967 | |
duke@435 | 968 | // ime may have moved during GC so recalculate address |
duke@435 | 969 | itableOffsetEntry::method_entry(_klass(), method_table_offset)[ime_num].initialize(target_h()); |
duke@435 | 970 | } |
duke@435 | 971 | // Progress to next entry |
duke@435 | 972 | ime_num++; |
duke@435 | 973 | } |
duke@435 | 974 | } |
duke@435 | 975 | |
dcubed@451 | 976 | // Update entry for specific methodOop |
duke@435 | 977 | void klassItable::initialize_with_method(methodOop m) { |
duke@435 | 978 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 979 | for(int i = 0; i < _size_method_table; i++) { |
duke@435 | 980 | if (ime->method() == m) { |
duke@435 | 981 | ime->initialize(m); |
duke@435 | 982 | } |
duke@435 | 983 | ime++; |
duke@435 | 984 | } |
duke@435 | 985 | } |
duke@435 | 986 | |
duke@435 | 987 | void klassItable::adjust_method_entries(methodOop* old_methods, methodOop* new_methods, |
duke@435 | 988 | int methods_length, bool * trace_name_printed) { |
duke@435 | 989 | // search the itable for uses of either obsolete or EMCP methods |
duke@435 | 990 | for (int j = 0; j < methods_length; j++) { |
duke@435 | 991 | methodOop old_method = old_methods[j]; |
duke@435 | 992 | methodOop new_method = new_methods[j]; |
duke@435 | 993 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 994 | |
duke@435 | 995 | for (int i = 0; i < _size_method_table; i++) { |
duke@435 | 996 | if (ime->method() == old_method) { |
duke@435 | 997 | ime->initialize(new_method); |
duke@435 | 998 | |
duke@435 | 999 | if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) { |
duke@435 | 1000 | if (!(*trace_name_printed)) { |
duke@435 | 1001 | // RC_TRACE_MESG macro has an embedded ResourceMark |
duke@435 | 1002 | RC_TRACE_MESG(("adjust: name=%s", |
duke@435 | 1003 | Klass::cast(old_method->method_holder())->external_name())); |
duke@435 | 1004 | *trace_name_printed = true; |
duke@435 | 1005 | } |
duke@435 | 1006 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 1007 | RC_TRACE(0x00200000, ("itable method update: %s(%s)", |
duke@435 | 1008 | new_method->name()->as_C_string(), |
duke@435 | 1009 | new_method->signature()->as_C_string())); |
duke@435 | 1010 | } |
duke@435 | 1011 | break; |
duke@435 | 1012 | } |
duke@435 | 1013 | ime++; |
duke@435 | 1014 | } |
duke@435 | 1015 | } |
duke@435 | 1016 | } |
duke@435 | 1017 | |
duke@435 | 1018 | |
duke@435 | 1019 | // Setup |
duke@435 | 1020 | class InterfaceVisiterClosure : public StackObj { |
duke@435 | 1021 | public: |
duke@435 | 1022 | virtual void doit(klassOop intf, int method_count) = 0; |
duke@435 | 1023 | }; |
duke@435 | 1024 | |
duke@435 | 1025 | // Visit all interfaces with at-least one method (excluding <clinit>) |
duke@435 | 1026 | void visit_all_interfaces(objArrayOop transitive_intf, InterfaceVisiterClosure *blk) { |
duke@435 | 1027 | // Handle array argument |
duke@435 | 1028 | for(int i = 0; i < transitive_intf->length(); i++) { |
duke@435 | 1029 | klassOop intf = (klassOop)transitive_intf->obj_at(i); |
duke@435 | 1030 | assert(Klass::cast(intf)->is_interface(), "sanity check"); |
duke@435 | 1031 | |
duke@435 | 1032 | // Find no. of methods excluding a <clinit> |
duke@435 | 1033 | int method_count = instanceKlass::cast(intf)->methods()->length(); |
duke@435 | 1034 | if (method_count > 0) { |
duke@435 | 1035 | methodOop m = (methodOop)instanceKlass::cast(intf)->methods()->obj_at(0); |
duke@435 | 1036 | assert(m != NULL && m->is_method(), "sanity check"); |
duke@435 | 1037 | if (m->name() == vmSymbols::object_initializer_name()) { |
duke@435 | 1038 | method_count--; |
duke@435 | 1039 | } |
duke@435 | 1040 | } |
duke@435 | 1041 | |
duke@435 | 1042 | // Only count interfaces with at least one method |
duke@435 | 1043 | if (method_count > 0) { |
duke@435 | 1044 | blk->doit(intf, method_count); |
duke@435 | 1045 | } |
duke@435 | 1046 | } |
duke@435 | 1047 | } |
duke@435 | 1048 | |
duke@435 | 1049 | class CountInterfacesClosure : public InterfaceVisiterClosure { |
duke@435 | 1050 | private: |
duke@435 | 1051 | int _nof_methods; |
duke@435 | 1052 | int _nof_interfaces; |
duke@435 | 1053 | public: |
duke@435 | 1054 | CountInterfacesClosure() { _nof_methods = 0; _nof_interfaces = 0; } |
duke@435 | 1055 | |
duke@435 | 1056 | int nof_methods() const { return _nof_methods; } |
duke@435 | 1057 | int nof_interfaces() const { return _nof_interfaces; } |
duke@435 | 1058 | |
duke@435 | 1059 | void doit(klassOop intf, int method_count) { _nof_methods += method_count; _nof_interfaces++; } |
duke@435 | 1060 | }; |
duke@435 | 1061 | |
duke@435 | 1062 | class SetupItableClosure : public InterfaceVisiterClosure { |
duke@435 | 1063 | private: |
duke@435 | 1064 | itableOffsetEntry* _offset_entry; |
duke@435 | 1065 | itableMethodEntry* _method_entry; |
duke@435 | 1066 | address _klass_begin; |
duke@435 | 1067 | public: |
duke@435 | 1068 | SetupItableClosure(address klass_begin, itableOffsetEntry* offset_entry, itableMethodEntry* method_entry) { |
duke@435 | 1069 | _klass_begin = klass_begin; |
duke@435 | 1070 | _offset_entry = offset_entry; |
duke@435 | 1071 | _method_entry = method_entry; |
duke@435 | 1072 | } |
duke@435 | 1073 | |
duke@435 | 1074 | itableMethodEntry* method_entry() const { return _method_entry; } |
duke@435 | 1075 | |
duke@435 | 1076 | void doit(klassOop intf, int method_count) { |
duke@435 | 1077 | int offset = ((address)_method_entry) - _klass_begin; |
duke@435 | 1078 | _offset_entry->initialize(intf, offset); |
duke@435 | 1079 | _offset_entry++; |
duke@435 | 1080 | _method_entry += method_count; |
duke@435 | 1081 | } |
duke@435 | 1082 | }; |
duke@435 | 1083 | |
duke@435 | 1084 | int klassItable::compute_itable_size(objArrayHandle transitive_interfaces) { |
duke@435 | 1085 | // Count no of interfaces and total number of interface methods |
duke@435 | 1086 | CountInterfacesClosure cic; |
duke@435 | 1087 | visit_all_interfaces(transitive_interfaces(), &cic); |
duke@435 | 1088 | |
dcubed@451 | 1089 | // There's alway an extra itable entry so we can null-terminate it. |
dcubed@451 | 1090 | int itable_size = calc_itable_size(cic.nof_interfaces() + 1, cic.nof_methods()); |
duke@435 | 1091 | |
duke@435 | 1092 | // Statistics |
duke@435 | 1093 | update_stats(itable_size * HeapWordSize); |
duke@435 | 1094 | |
duke@435 | 1095 | return itable_size; |
duke@435 | 1096 | } |
duke@435 | 1097 | |
duke@435 | 1098 | |
duke@435 | 1099 | // Fill out offset table and interface klasses into the itable space |
duke@435 | 1100 | void klassItable::setup_itable_offset_table(instanceKlassHandle klass) { |
duke@435 | 1101 | if (klass->itable_length() == 0) return; |
duke@435 | 1102 | assert(!klass->is_interface(), "Should have zero length itable"); |
duke@435 | 1103 | |
duke@435 | 1104 | // Count no of interfaces and total number of interface methods |
duke@435 | 1105 | CountInterfacesClosure cic; |
duke@435 | 1106 | visit_all_interfaces(klass->transitive_interfaces(), &cic); |
duke@435 | 1107 | int nof_methods = cic.nof_methods(); |
duke@435 | 1108 | int nof_interfaces = cic.nof_interfaces(); |
duke@435 | 1109 | |
dcubed@451 | 1110 | // Add one extra entry so we can null-terminate the table |
dcubed@451 | 1111 | nof_interfaces++; |
duke@435 | 1112 | |
duke@435 | 1113 | assert(compute_itable_size(objArrayHandle(klass->transitive_interfaces())) == |
duke@435 | 1114 | calc_itable_size(nof_interfaces, nof_methods), |
duke@435 | 1115 | "mismatch calculation of itable size"); |
duke@435 | 1116 | |
duke@435 | 1117 | // Fill-out offset table |
duke@435 | 1118 | itableOffsetEntry* ioe = (itableOffsetEntry*)klass->start_of_itable(); |
duke@435 | 1119 | itableMethodEntry* ime = (itableMethodEntry*)(ioe + nof_interfaces); |
duke@435 | 1120 | intptr_t* end = klass->end_of_itable(); |
coleenp@548 | 1121 | assert((oop*)(ime + nof_methods) <= (oop*)klass->start_of_static_fields(), "wrong offset calculation (1)"); |
coleenp@548 | 1122 | assert((oop*)(end) == (oop*)(ime + nof_methods), "wrong offset calculation (2)"); |
duke@435 | 1123 | |
duke@435 | 1124 | // Visit all interfaces and initialize itable offset table |
duke@435 | 1125 | SetupItableClosure sic((address)klass->as_klassOop(), ioe, ime); |
duke@435 | 1126 | visit_all_interfaces(klass->transitive_interfaces(), &sic); |
duke@435 | 1127 | |
duke@435 | 1128 | #ifdef ASSERT |
duke@435 | 1129 | ime = sic.method_entry(); |
duke@435 | 1130 | oop* v = (oop*) klass->end_of_itable(); |
duke@435 | 1131 | assert( (oop*)(ime) == v, "wrong offset calculation (2)"); |
duke@435 | 1132 | #endif |
duke@435 | 1133 | } |
duke@435 | 1134 | |
duke@435 | 1135 | |
duke@435 | 1136 | // m must be a method in an interface |
duke@435 | 1137 | int klassItable::compute_itable_index(methodOop m) { |
duke@435 | 1138 | klassOop intf = m->method_holder(); |
duke@435 | 1139 | assert(instanceKlass::cast(intf)->is_interface(), "sanity check"); |
duke@435 | 1140 | objArrayOop methods = instanceKlass::cast(intf)->methods(); |
duke@435 | 1141 | int index = 0; |
duke@435 | 1142 | while(methods->obj_at(index) != m) { |
duke@435 | 1143 | index++; |
duke@435 | 1144 | assert(index < methods->length(), "should find index for resolve_invoke"); |
duke@435 | 1145 | } |
duke@435 | 1146 | // Adjust for <clinit>, which is left out of table if first method |
duke@435 | 1147 | if (methods->length() > 0 && ((methodOop)methods->obj_at(0))->name() == vmSymbols::class_initializer_name()) { |
duke@435 | 1148 | index--; |
duke@435 | 1149 | } |
duke@435 | 1150 | return index; |
duke@435 | 1151 | } |
duke@435 | 1152 | |
duke@435 | 1153 | void klassVtable::verify(outputStream* st, bool forced) { |
duke@435 | 1154 | // make sure table is initialized |
duke@435 | 1155 | if (!Universe::is_fully_initialized()) return; |
duke@435 | 1156 | #ifndef PRODUCT |
duke@435 | 1157 | // avoid redundant verifies |
duke@435 | 1158 | if (!forced && _verify_count == Universe::verify_count()) return; |
duke@435 | 1159 | _verify_count = Universe::verify_count(); |
duke@435 | 1160 | #endif |
duke@435 | 1161 | oop* end_of_obj = (oop*)_klass() + _klass()->size(); |
duke@435 | 1162 | oop* end_of_vtable = (oop *)&table()[_length]; |
duke@435 | 1163 | if (end_of_vtable > end_of_obj) { |
duke@435 | 1164 | fatal1("klass %s: klass object too short (vtable extends beyond end)", |
duke@435 | 1165 | _klass->internal_name()); |
duke@435 | 1166 | } |
duke@435 | 1167 | |
duke@435 | 1168 | for (int i = 0; i < _length; i++) table()[i].verify(this, st); |
duke@435 | 1169 | // verify consistency with superKlass vtable |
duke@435 | 1170 | klassOop super = _klass->super(); |
duke@435 | 1171 | if (super != NULL) { |
duke@435 | 1172 | instanceKlass* sk = instanceKlass::cast(super); |
duke@435 | 1173 | klassVtable* vt = sk->vtable(); |
duke@435 | 1174 | for (int i = 0; i < vt->length(); i++) { |
duke@435 | 1175 | verify_against(st, vt, i); |
duke@435 | 1176 | } |
duke@435 | 1177 | } |
duke@435 | 1178 | } |
duke@435 | 1179 | |
duke@435 | 1180 | void klassVtable::verify_against(outputStream* st, klassVtable* vt, int index) { |
duke@435 | 1181 | vtableEntry* vte = &vt->table()[index]; |
duke@435 | 1182 | if (vte->method()->name() != table()[index].method()->name() || |
duke@435 | 1183 | vte->method()->signature() != table()[index].method()->signature()) { |
duke@435 | 1184 | fatal("mismatched name/signature of vtable entries"); |
duke@435 | 1185 | } |
duke@435 | 1186 | } |
duke@435 | 1187 | |
duke@435 | 1188 | #ifndef PRODUCT |
duke@435 | 1189 | void klassVtable::print() { |
duke@435 | 1190 | ResourceMark rm; |
duke@435 | 1191 | tty->print("klassVtable for klass %s (length %d):\n", _klass->internal_name(), length()); |
duke@435 | 1192 | for (int i = 0; i < length(); i++) { |
duke@435 | 1193 | table()[i].print(); |
duke@435 | 1194 | tty->cr(); |
duke@435 | 1195 | } |
duke@435 | 1196 | } |
duke@435 | 1197 | #endif |
duke@435 | 1198 | |
duke@435 | 1199 | void vtableEntry::verify(klassVtable* vt, outputStream* st) { |
duke@435 | 1200 | NOT_PRODUCT(FlagSetting fs(IgnoreLockingAssertions, true)); |
duke@435 | 1201 | assert(method() != NULL, "must have set method"); |
duke@435 | 1202 | method()->verify(); |
duke@435 | 1203 | // we sub_type, because it could be a miranda method |
duke@435 | 1204 | if (!vt->klass()->is_subtype_of(method()->method_holder())) { |
duke@435 | 1205 | #ifndef PRODUCT |
duke@435 | 1206 | print(); |
duke@435 | 1207 | #endif |
duke@435 | 1208 | fatal1("vtableEntry %#lx: method is from subclass", this); |
duke@435 | 1209 | } |
duke@435 | 1210 | } |
duke@435 | 1211 | |
duke@435 | 1212 | #ifndef PRODUCT |
duke@435 | 1213 | |
duke@435 | 1214 | void vtableEntry::print() { |
duke@435 | 1215 | ResourceMark rm; |
duke@435 | 1216 | tty->print("vtableEntry %s: ", method()->name()->as_C_string()); |
duke@435 | 1217 | if (Verbose) { |
duke@435 | 1218 | tty->print("m %#lx ", (address)method()); |
duke@435 | 1219 | } |
duke@435 | 1220 | } |
duke@435 | 1221 | |
duke@435 | 1222 | class VtableStats : AllStatic { |
duke@435 | 1223 | public: |
duke@435 | 1224 | static int no_klasses; // # classes with vtables |
duke@435 | 1225 | static int no_array_klasses; // # array classes |
duke@435 | 1226 | static int no_instance_klasses; // # instanceKlasses |
duke@435 | 1227 | static int sum_of_vtable_len; // total # of vtable entries |
duke@435 | 1228 | static int sum_of_array_vtable_len; // total # of vtable entries in array klasses only |
duke@435 | 1229 | static int fixed; // total fixed overhead in bytes |
duke@435 | 1230 | static int filler; // overhead caused by filler bytes |
duke@435 | 1231 | static int entries; // total bytes consumed by vtable entries |
duke@435 | 1232 | static int array_entries; // total bytes consumed by array vtable entries |
duke@435 | 1233 | |
duke@435 | 1234 | static void do_class(klassOop k) { |
duke@435 | 1235 | Klass* kl = k->klass_part(); |
duke@435 | 1236 | klassVtable* vt = kl->vtable(); |
duke@435 | 1237 | if (vt == NULL) return; |
duke@435 | 1238 | no_klasses++; |
duke@435 | 1239 | if (kl->oop_is_instance()) { |
duke@435 | 1240 | no_instance_klasses++; |
duke@435 | 1241 | kl->array_klasses_do(do_class); |
duke@435 | 1242 | } |
duke@435 | 1243 | if (kl->oop_is_array()) { |
duke@435 | 1244 | no_array_klasses++; |
duke@435 | 1245 | sum_of_array_vtable_len += vt->length(); |
duke@435 | 1246 | } |
duke@435 | 1247 | sum_of_vtable_len += vt->length(); |
duke@435 | 1248 | } |
duke@435 | 1249 | |
duke@435 | 1250 | static void compute() { |
duke@435 | 1251 | SystemDictionary::classes_do(do_class); |
duke@435 | 1252 | fixed = no_klasses * oopSize; // vtable length |
duke@435 | 1253 | // filler size is a conservative approximation |
duke@435 | 1254 | filler = oopSize * (no_klasses - no_instance_klasses) * (sizeof(instanceKlass) - sizeof(arrayKlass) - 1); |
duke@435 | 1255 | entries = sizeof(vtableEntry) * sum_of_vtable_len; |
duke@435 | 1256 | array_entries = sizeof(vtableEntry) * sum_of_array_vtable_len; |
duke@435 | 1257 | } |
duke@435 | 1258 | }; |
duke@435 | 1259 | |
duke@435 | 1260 | int VtableStats::no_klasses = 0; |
duke@435 | 1261 | int VtableStats::no_array_klasses = 0; |
duke@435 | 1262 | int VtableStats::no_instance_klasses = 0; |
duke@435 | 1263 | int VtableStats::sum_of_vtable_len = 0; |
duke@435 | 1264 | int VtableStats::sum_of_array_vtable_len = 0; |
duke@435 | 1265 | int VtableStats::fixed = 0; |
duke@435 | 1266 | int VtableStats::filler = 0; |
duke@435 | 1267 | int VtableStats::entries = 0; |
duke@435 | 1268 | int VtableStats::array_entries = 0; |
duke@435 | 1269 | |
duke@435 | 1270 | void klassVtable::print_statistics() { |
duke@435 | 1271 | ResourceMark rm; |
duke@435 | 1272 | HandleMark hm; |
duke@435 | 1273 | VtableStats::compute(); |
duke@435 | 1274 | tty->print_cr("vtable statistics:"); |
duke@435 | 1275 | tty->print_cr("%6d classes (%d instance, %d array)", VtableStats::no_klasses, VtableStats::no_instance_klasses, VtableStats::no_array_klasses); |
duke@435 | 1276 | int total = VtableStats::fixed + VtableStats::filler + VtableStats::entries; |
duke@435 | 1277 | tty->print_cr("%6d bytes fixed overhead (refs + vtable object header)", VtableStats::fixed); |
duke@435 | 1278 | tty->print_cr("%6d bytes filler overhead", VtableStats::filler); |
duke@435 | 1279 | tty->print_cr("%6d bytes for vtable entries (%d for arrays)", VtableStats::entries, VtableStats::array_entries); |
duke@435 | 1280 | tty->print_cr("%6d bytes total", total); |
duke@435 | 1281 | } |
duke@435 | 1282 | |
duke@435 | 1283 | bool klassVtable::check_no_old_entries() { |
duke@435 | 1284 | // Check that there really is no entry |
duke@435 | 1285 | for (int i = 0; i < length(); i++) { |
duke@435 | 1286 | methodOop m = unchecked_method_at(i); |
duke@435 | 1287 | if (m != NULL) { |
duke@435 | 1288 | if (m->is_old()) { |
duke@435 | 1289 | return false; |
duke@435 | 1290 | } |
duke@435 | 1291 | } |
duke@435 | 1292 | } |
duke@435 | 1293 | return true; |
duke@435 | 1294 | } |
duke@435 | 1295 | |
duke@435 | 1296 | void klassVtable::dump_vtable() { |
duke@435 | 1297 | tty->print_cr("vtable dump --"); |
duke@435 | 1298 | for (int i = 0; i < length(); i++) { |
duke@435 | 1299 | methodOop m = unchecked_method_at(i); |
duke@435 | 1300 | if (m != NULL) { |
duke@435 | 1301 | tty->print(" (%5d) ", i); |
duke@435 | 1302 | m->access_flags().print_on(tty); |
duke@435 | 1303 | tty->print(" -- "); |
duke@435 | 1304 | m->print_name(tty); |
duke@435 | 1305 | tty->cr(); |
duke@435 | 1306 | } |
duke@435 | 1307 | } |
duke@435 | 1308 | } |
duke@435 | 1309 | |
duke@435 | 1310 | int klassItable::_total_classes; // Total no. of classes with itables |
duke@435 | 1311 | long klassItable::_total_size; // Total no. of bytes used for itables |
duke@435 | 1312 | |
duke@435 | 1313 | void klassItable::print_statistics() { |
duke@435 | 1314 | tty->print_cr("itable statistics:"); |
duke@435 | 1315 | tty->print_cr("%6d classes with itables", _total_classes); |
duke@435 | 1316 | tty->print_cr("%6d K uses for itables (average by class: %d bytes)", _total_size / K, _total_size / _total_classes); |
duke@435 | 1317 | } |
duke@435 | 1318 | |
duke@435 | 1319 | #endif // PRODUCT |