Tue, 09 Oct 2012 07:41:27 +0200
Merge
duke@435 | 1 | /* |
coleenp@4037 | 2 | * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 27 | #include "classfile/vmSymbols.hpp" |
stefank@2314 | 28 | #include "gc_implementation/shared/markSweep.inline.hpp" |
stefank@2314 | 29 | #include "memory/gcLocker.hpp" |
stefank@2314 | 30 | #include "memory/resourceArea.hpp" |
stefank@2314 | 31 | #include "memory/universe.inline.hpp" |
stefank@2314 | 32 | #include "oops/instanceKlass.hpp" |
stefank@2314 | 33 | #include "oops/klassVtable.hpp" |
coleenp@4037 | 34 | #include "oops/method.hpp" |
stefank@2314 | 35 | #include "oops/objArrayOop.hpp" |
stefank@2314 | 36 | #include "oops/oop.inline.hpp" |
stefank@2314 | 37 | #include "prims/jvmtiRedefineClassesTrace.hpp" |
stefank@2314 | 38 | #include "runtime/arguments.hpp" |
stefank@2314 | 39 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 40 | #include "utilities/copy.hpp" |
duke@435 | 41 | |
coleenp@4037 | 42 | inline InstanceKlass* klassVtable::ik() const { |
coleenp@4037 | 43 | Klass* k = _klass(); |
coleenp@4037 | 44 | assert(k->oop_is_instance(), "not an InstanceKlass"); |
coleenp@4037 | 45 | return (InstanceKlass*)k; |
duke@435 | 46 | } |
duke@435 | 47 | |
duke@435 | 48 | |
duke@435 | 49 | // this function computes the vtable size (including the size needed for miranda |
duke@435 | 50 | // methods) and the number of miranda methods in this class |
duke@435 | 51 | // Note on Miranda methods: Let's say there is a class C that implements |
duke@435 | 52 | // interface I. Let's say there is a method m in I that neither C nor any |
duke@435 | 53 | // of its super classes implement (i.e there is no method of any access, with |
duke@435 | 54 | // the same name and signature as m), then m is a Miranda method which is |
duke@435 | 55 | // entered as a public abstract method in C's vtable. From then on it should |
duke@435 | 56 | // treated as any other public method in C for method over-ride purposes. |
duke@435 | 57 | void klassVtable::compute_vtable_size_and_num_mirandas(int &vtable_length, |
duke@435 | 58 | int &num_miranda_methods, |
coleenp@4037 | 59 | Klass* super, |
coleenp@4037 | 60 | Array<Method*>* methods, |
duke@435 | 61 | AccessFlags class_flags, |
acorn@1087 | 62 | Handle classloader, |
coleenp@2497 | 63 | Symbol* classname, |
coleenp@4037 | 64 | Array<Klass*>* local_interfaces, |
acorn@1087 | 65 | TRAPS |
duke@435 | 66 | ) { |
duke@435 | 67 | |
duke@435 | 68 | No_Safepoint_Verifier nsv; |
duke@435 | 69 | |
duke@435 | 70 | // set up default result values |
duke@435 | 71 | vtable_length = 0; |
duke@435 | 72 | num_miranda_methods = 0; |
duke@435 | 73 | |
duke@435 | 74 | // start off with super's vtable length |
coleenp@4037 | 75 | InstanceKlass* sk = (InstanceKlass*)super; |
duke@435 | 76 | vtable_length = super == NULL ? 0 : sk->vtable_length(); |
duke@435 | 77 | |
duke@435 | 78 | // go thru each method in the methods table to see if it needs a new entry |
duke@435 | 79 | int len = methods->length(); |
duke@435 | 80 | for (int i = 0; i < len; i++) { |
coleenp@4037 | 81 | assert(methods->at(i)->is_method(), "must be a Method*"); |
coleenp@4037 | 82 | methodHandle mh(THREAD, methods->at(i)); |
duke@435 | 83 | |
acorn@1087 | 84 | if (needs_new_vtable_entry(mh, super, classloader, classname, class_flags, THREAD)) { |
duke@435 | 85 | vtable_length += vtableEntry::size(); // we need a new entry |
duke@435 | 86 | } |
duke@435 | 87 | } |
duke@435 | 88 | |
duke@435 | 89 | // compute the number of mirandas methods that must be added to the end |
duke@435 | 90 | num_miranda_methods = get_num_mirandas(super, methods, local_interfaces); |
duke@435 | 91 | vtable_length += (num_miranda_methods * vtableEntry::size()); |
duke@435 | 92 | |
duke@435 | 93 | if (Universe::is_bootstrapping() && vtable_length == 0) { |
duke@435 | 94 | // array classes don't have their superclass set correctly during |
duke@435 | 95 | // bootstrapping |
duke@435 | 96 | vtable_length = Universe::base_vtable_size(); |
duke@435 | 97 | } |
duke@435 | 98 | |
duke@435 | 99 | if (super == NULL && !Universe::is_bootstrapping() && |
duke@435 | 100 | vtable_length != Universe::base_vtable_size()) { |
duke@435 | 101 | // Someone is attempting to redefine java.lang.Object incorrectly. The |
duke@435 | 102 | // only way this should happen is from |
duke@435 | 103 | // SystemDictionary::resolve_from_stream(), which will detect this later |
duke@435 | 104 | // and throw a security exception. So don't assert here to let |
duke@435 | 105 | // the exception occur. |
duke@435 | 106 | vtable_length = Universe::base_vtable_size(); |
duke@435 | 107 | } |
duke@435 | 108 | assert(super != NULL || vtable_length == Universe::base_vtable_size(), |
duke@435 | 109 | "bad vtable size for class Object"); |
duke@435 | 110 | assert(vtable_length % vtableEntry::size() == 0, "bad vtable length"); |
duke@435 | 111 | assert(vtable_length >= Universe::base_vtable_size(), "vtable too small"); |
duke@435 | 112 | } |
duke@435 | 113 | |
coleenp@4037 | 114 | int klassVtable::index_of(Method* m, int len) const { |
duke@435 | 115 | assert(m->vtable_index() >= 0, "do not ask this of non-vtable methods"); |
duke@435 | 116 | return m->vtable_index(); |
duke@435 | 117 | } |
duke@435 | 118 | |
duke@435 | 119 | int klassVtable::initialize_from_super(KlassHandle super) { |
duke@435 | 120 | if (super.is_null()) { |
duke@435 | 121 | return 0; |
duke@435 | 122 | } else { |
duke@435 | 123 | // copy methods from superKlass |
coleenp@4037 | 124 | // can't inherit from array class, so must be InstanceKlass |
duke@435 | 125 | assert(super->oop_is_instance(), "must be instance klass"); |
coleenp@4037 | 126 | InstanceKlass* sk = (InstanceKlass*)super(); |
duke@435 | 127 | klassVtable* superVtable = sk->vtable(); |
duke@435 | 128 | assert(superVtable->length() <= _length, "vtable too short"); |
duke@435 | 129 | #ifdef ASSERT |
duke@435 | 130 | superVtable->verify(tty, true); |
duke@435 | 131 | #endif |
duke@435 | 132 | superVtable->copy_vtable_to(table()); |
duke@435 | 133 | #ifndef PRODUCT |
duke@435 | 134 | if (PrintVtables && Verbose) { |
acorn@1087 | 135 | ResourceMark rm; |
duke@435 | 136 | tty->print_cr("copy vtable from %s to %s size %d", sk->internal_name(), klass()->internal_name(), _length); |
duke@435 | 137 | } |
duke@435 | 138 | #endif |
duke@435 | 139 | return superVtable->length(); |
duke@435 | 140 | } |
duke@435 | 141 | } |
duke@435 | 142 | |
duke@435 | 143 | // Revised lookup semantics introduced 1.3 (Kestral beta) |
duke@435 | 144 | void klassVtable::initialize_vtable(bool checkconstraints, TRAPS) { |
duke@435 | 145 | |
duke@435 | 146 | // Note: Arrays can have intermediate array supers. Use java_super to skip them. |
duke@435 | 147 | KlassHandle super (THREAD, klass()->java_super()); |
duke@435 | 148 | int nofNewEntries = 0; |
duke@435 | 149 | |
duke@435 | 150 | |
duke@435 | 151 | if (PrintVtables && !klass()->oop_is_array()) { |
duke@435 | 152 | ResourceMark rm(THREAD); |
duke@435 | 153 | tty->print_cr("Initializing: %s", _klass->name()->as_C_string()); |
duke@435 | 154 | } |
duke@435 | 155 | |
duke@435 | 156 | #ifdef ASSERT |
duke@435 | 157 | oop* end_of_obj = (oop*)_klass() + _klass()->size(); |
duke@435 | 158 | oop* end_of_vtable = (oop*)&table()[_length]; |
duke@435 | 159 | assert(end_of_vtable <= end_of_obj, "vtable extends beyond end"); |
duke@435 | 160 | #endif |
duke@435 | 161 | |
duke@435 | 162 | if (Universe::is_bootstrapping()) { |
duke@435 | 163 | // just clear everything |
duke@435 | 164 | for (int i = 0; i < _length; i++) table()[i].clear(); |
duke@435 | 165 | return; |
duke@435 | 166 | } |
duke@435 | 167 | |
duke@435 | 168 | int super_vtable_len = initialize_from_super(super); |
duke@435 | 169 | if (klass()->oop_is_array()) { |
duke@435 | 170 | assert(super_vtable_len == _length, "arrays shouldn't introduce new methods"); |
duke@435 | 171 | } else { |
coleenp@4037 | 172 | assert(_klass->oop_is_instance(), "must be InstanceKlass"); |
duke@435 | 173 | |
coleenp@4037 | 174 | Array<Method*>* methods = ik()->methods(); |
coleenp@4037 | 175 | int len = methods->length(); |
duke@435 | 176 | int initialized = super_vtable_len; |
duke@435 | 177 | |
acorn@1087 | 178 | // update_inherited_vtable can stop for gc - ensure using handles |
duke@435 | 179 | for (int i = 0; i < len; i++) { |
duke@435 | 180 | HandleMark hm(THREAD); |
coleenp@4037 | 181 | assert(methods->at(i)->is_method(), "must be a Method*"); |
coleenp@4037 | 182 | methodHandle mh(THREAD, methods->at(i)); |
duke@435 | 183 | |
acorn@1087 | 184 | bool needs_new_entry = update_inherited_vtable(ik(), mh, super_vtable_len, checkconstraints, CHECK); |
duke@435 | 185 | |
duke@435 | 186 | if (needs_new_entry) { |
duke@435 | 187 | put_method_at(mh(), initialized); |
duke@435 | 188 | mh()->set_vtable_index(initialized); // set primary vtable index |
duke@435 | 189 | initialized++; |
duke@435 | 190 | } |
duke@435 | 191 | } |
duke@435 | 192 | |
duke@435 | 193 | // add miranda methods; it will also update the value of initialized |
duke@435 | 194 | fill_in_mirandas(initialized); |
duke@435 | 195 | |
acorn@1087 | 196 | // In class hierarchies where the accessibility is not increasing (i.e., going from private -> |
duke@435 | 197 | // package_private -> publicprotected), the vtable might actually be smaller than our initial |
duke@435 | 198 | // calculation. |
duke@435 | 199 | assert(initialized <= _length, "vtable initialization failed"); |
duke@435 | 200 | for(;initialized < _length; initialized++) { |
duke@435 | 201 | put_method_at(NULL, initialized); |
duke@435 | 202 | } |
duke@435 | 203 | NOT_PRODUCT(verify(tty, true)); |
duke@435 | 204 | } |
duke@435 | 205 | } |
duke@435 | 206 | |
acorn@1087 | 207 | // Called for cases where a method does not override its superclass' vtable entry |
acorn@1087 | 208 | // For bytecodes not produced by javac together it is possible that a method does not override |
acorn@1087 | 209 | // the superclass's method, but might indirectly override a super-super class's vtable entry |
acorn@1087 | 210 | // If none found, return a null superk, else return the superk of the method this does override |
coleenp@4037 | 211 | InstanceKlass* klassVtable::find_transitive_override(InstanceKlass* initialsuper, methodHandle target_method, |
coleenp@2497 | 212 | int vtable_index, Handle target_loader, Symbol* target_classname, Thread * THREAD) { |
coleenp@4037 | 213 | InstanceKlass* superk = initialsuper; |
acorn@1087 | 214 | while (superk != NULL && superk->super() != NULL) { |
coleenp@4037 | 215 | InstanceKlass* supersuperklass = InstanceKlass::cast(superk->super()); |
acorn@1087 | 216 | klassVtable* ssVtable = supersuperklass->vtable(); |
acorn@1087 | 217 | if (vtable_index < ssVtable->length()) { |
coleenp@4037 | 218 | Method* super_method = ssVtable->method_at(vtable_index); |
acorn@1087 | 219 | #ifndef PRODUCT |
coleenp@2497 | 220 | Symbol* name= target_method()->name(); |
coleenp@2497 | 221 | Symbol* signature = target_method()->signature(); |
coleenp@2497 | 222 | assert(super_method->name() == name && super_method->signature() == signature, "vtable entry name/sig mismatch"); |
acorn@1087 | 223 | #endif |
acorn@1087 | 224 | if (supersuperklass->is_override(super_method, target_loader, target_classname, THREAD)) { |
acorn@1087 | 225 | #ifndef PRODUCT |
acorn@1087 | 226 | if (PrintVtables && Verbose) { |
acorn@1087 | 227 | ResourceMark rm(THREAD); |
acorn@1087 | 228 | tty->print("transitive overriding superclass %s with %s::%s index %d, original flags: ", |
acorn@1087 | 229 | supersuperklass->internal_name(), |
acorn@1087 | 230 | _klass->internal_name(), (target_method() != NULL) ? |
acorn@1087 | 231 | target_method()->name()->as_C_string() : "<NULL>", vtable_index); |
acorn@1087 | 232 | super_method->access_flags().print_on(tty); |
acorn@1087 | 233 | tty->print("overriders flags: "); |
acorn@1087 | 234 | target_method->access_flags().print_on(tty); |
acorn@1087 | 235 | tty->cr(); |
acorn@1087 | 236 | } |
acorn@1087 | 237 | #endif /*PRODUCT*/ |
acorn@1087 | 238 | break; // return found superk |
acorn@1087 | 239 | } |
acorn@1087 | 240 | } else { |
acorn@1087 | 241 | // super class has no vtable entry here, stop transitive search |
coleenp@4037 | 242 | superk = (InstanceKlass*)NULL; |
acorn@1087 | 243 | break; |
acorn@1087 | 244 | } |
acorn@1087 | 245 | // if no override found yet, continue to search up |
coleenp@4037 | 246 | superk = InstanceKlass::cast(superk->super()); |
acorn@1087 | 247 | } |
duke@435 | 248 | |
acorn@1087 | 249 | return superk; |
duke@435 | 250 | } |
duke@435 | 251 | |
duke@435 | 252 | |
duke@435 | 253 | // Update child's copy of super vtable for overrides |
duke@435 | 254 | // OR return true if a new vtable entry is required |
coleenp@4037 | 255 | // Only called for InstanceKlass's, i.e. not for arrays |
duke@435 | 256 | // If that changed, could not use _klass as handle for klass |
coleenp@4037 | 257 | bool klassVtable::update_inherited_vtable(InstanceKlass* klass, methodHandle target_method, int super_vtable_len, |
acorn@1087 | 258 | bool checkconstraints, TRAPS) { |
duke@435 | 259 | ResourceMark rm; |
duke@435 | 260 | bool allocate_new = true; |
coleenp@4037 | 261 | assert(klass->oop_is_instance(), "must be InstanceKlass"); |
duke@435 | 262 | |
duke@435 | 263 | // Initialize the method's vtable index to "nonvirtual". |
duke@435 | 264 | // If we allocate a vtable entry, we will update it to a non-negative number. |
coleenp@4037 | 265 | target_method()->set_vtable_index(Method::nonvirtual_vtable_index); |
duke@435 | 266 | |
duke@435 | 267 | // Static and <init> methods are never in |
duke@435 | 268 | if (target_method()->is_static() || target_method()->name() == vmSymbols::object_initializer_name()) { |
duke@435 | 269 | return false; |
duke@435 | 270 | } |
duke@435 | 271 | |
duke@435 | 272 | if (klass->is_final() || target_method()->is_final()) { |
duke@435 | 273 | // a final method never needs a new entry; final methods can be statically |
duke@435 | 274 | // resolved and they have to be present in the vtable only if they override |
duke@435 | 275 | // a super's method, in which case they re-use its entry |
duke@435 | 276 | allocate_new = false; |
duke@435 | 277 | } |
duke@435 | 278 | |
duke@435 | 279 | // we need a new entry if there is no superclass |
duke@435 | 280 | if (klass->super() == NULL) { |
duke@435 | 281 | return allocate_new; |
duke@435 | 282 | } |
duke@435 | 283 | |
duke@435 | 284 | // private methods always have a new entry in the vtable |
acorn@1087 | 285 | // specification interpretation since classic has |
acorn@1087 | 286 | // private methods not overriding |
duke@435 | 287 | if (target_method()->is_private()) { |
duke@435 | 288 | return allocate_new; |
duke@435 | 289 | } |
duke@435 | 290 | |
duke@435 | 291 | // search through the vtable and update overridden entries |
duke@435 | 292 | // Since check_signature_loaders acquires SystemDictionary_lock |
acorn@1087 | 293 | // which can block for gc, once we are in this loop, use handles |
acorn@1087 | 294 | // For classfiles built with >= jdk7, we now look for transitive overrides |
duke@435 | 295 | |
coleenp@2497 | 296 | Symbol* name = target_method()->name(); |
coleenp@2497 | 297 | Symbol* signature = target_method()->signature(); |
coleenp@4037 | 298 | Handle target_loader(THREAD, _klass()->class_loader()); |
coleenp@2497 | 299 | Symbol* target_classname = _klass->name(); |
duke@435 | 300 | for(int i = 0; i < super_vtable_len; i++) { |
coleenp@4037 | 301 | Method* super_method = method_at(i); |
duke@435 | 302 | // Check if method name matches |
coleenp@2497 | 303 | if (super_method->name() == name && super_method->signature() == signature) { |
duke@435 | 304 | |
acorn@1087 | 305 | // get super_klass for method_holder for the found method |
coleenp@4037 | 306 | InstanceKlass* super_klass = InstanceKlass::cast(super_method->method_holder()); |
duke@435 | 307 | |
acorn@1087 | 308 | if ((super_klass->is_override(super_method, target_loader, target_classname, THREAD)) || |
acorn@1087 | 309 | ((klass->major_version() >= VTABLE_TRANSITIVE_OVERRIDE_VERSION) |
acorn@1087 | 310 | && ((super_klass = find_transitive_override(super_klass, target_method, i, target_loader, |
coleenp@4037 | 311 | target_classname, THREAD)) != (InstanceKlass*)NULL))) { |
acorn@1087 | 312 | // overriding, so no new entry |
acorn@1087 | 313 | allocate_new = false; |
duke@435 | 314 | |
duke@435 | 315 | if (checkconstraints) { |
duke@435 | 316 | // Override vtable entry if passes loader constraint check |
duke@435 | 317 | // if loader constraint checking requested |
duke@435 | 318 | // No need to visit his super, since he and his super |
duke@435 | 319 | // have already made any needed loader constraints. |
duke@435 | 320 | // Since loader constraints are transitive, it is enough |
duke@435 | 321 | // to link to the first super, and we get all the others. |
duke@435 | 322 | Handle super_loader(THREAD, super_klass->class_loader()); |
duke@435 | 323 | |
acorn@1087 | 324 | if (target_loader() != super_loader()) { |
duke@435 | 325 | ResourceMark rm(THREAD); |
duke@435 | 326 | char* failed_type_name = |
acorn@1087 | 327 | SystemDictionary::check_signature_loaders(signature, target_loader, |
duke@435 | 328 | super_loader, true, |
duke@435 | 329 | CHECK_(false)); |
duke@435 | 330 | if (failed_type_name != NULL) { |
duke@435 | 331 | const char* msg = "loader constraint violation: when resolving " |
duke@435 | 332 | "overridden method \"%s\" the class loader (instance" |
duke@435 | 333 | " of %s) of the current class, %s, and its superclass loader " |
duke@435 | 334 | "(instance of %s), have different Class objects for the type " |
duke@435 | 335 | "%s used in the signature"; |
duke@435 | 336 | char* sig = target_method()->name_and_sig_as_C_string(); |
acorn@1087 | 337 | const char* loader1 = SystemDictionary::loader_name(target_loader()); |
duke@435 | 338 | char* current = _klass->name()->as_C_string(); |
duke@435 | 339 | const char* loader2 = SystemDictionary::loader_name(super_loader()); |
duke@435 | 340 | size_t buflen = strlen(msg) + strlen(sig) + strlen(loader1) + |
duke@435 | 341 | strlen(current) + strlen(loader2) + strlen(failed_type_name); |
duke@435 | 342 | char* buf = NEW_RESOURCE_ARRAY_IN_THREAD(THREAD, char, buflen); |
duke@435 | 343 | jio_snprintf(buf, buflen, msg, sig, loader1, current, loader2, |
duke@435 | 344 | failed_type_name); |
duke@435 | 345 | THROW_MSG_(vmSymbols::java_lang_LinkageError(), buf, false); |
duke@435 | 346 | } |
duke@435 | 347 | } |
acorn@1087 | 348 | } |
acorn@1087 | 349 | |
acorn@1087 | 350 | put_method_at(target_method(), i); |
acorn@1087 | 351 | target_method()->set_vtable_index(i); |
acorn@1087 | 352 | #ifndef PRODUCT |
acorn@1087 | 353 | if (PrintVtables && Verbose) { |
acorn@1087 | 354 | tty->print("overriding with %s::%s index %d, original flags: ", |
acorn@1087 | 355 | _klass->internal_name(), (target_method() != NULL) ? |
acorn@1087 | 356 | target_method()->name()->as_C_string() : "<NULL>", i); |
acorn@1087 | 357 | super_method->access_flags().print_on(tty); |
acorn@1087 | 358 | tty->print("overriders flags: "); |
acorn@1087 | 359 | target_method->access_flags().print_on(tty); |
acorn@1087 | 360 | tty->cr(); |
duke@435 | 361 | } |
acorn@1087 | 362 | #endif /*PRODUCT*/ |
acorn@1087 | 363 | } else { |
acorn@1087 | 364 | // allocate_new = true; default. We might override one entry, |
acorn@1087 | 365 | // but not override another. Once we override one, not need new |
duke@435 | 366 | #ifndef PRODUCT |
acorn@1087 | 367 | if (PrintVtables && Verbose) { |
acorn@1087 | 368 | tty->print("NOT overriding with %s::%s index %d, original flags: ", |
acorn@1087 | 369 | _klass->internal_name(), (target_method() != NULL) ? |
acorn@1087 | 370 | target_method()->name()->as_C_string() : "<NULL>", i); |
acorn@1087 | 371 | super_method->access_flags().print_on(tty); |
acorn@1087 | 372 | tty->print("overriders flags: "); |
acorn@1087 | 373 | target_method->access_flags().print_on(tty); |
acorn@1087 | 374 | tty->cr(); |
acorn@1087 | 375 | } |
duke@435 | 376 | #endif /*PRODUCT*/ |
duke@435 | 377 | } |
duke@435 | 378 | } |
duke@435 | 379 | } |
duke@435 | 380 | return allocate_new; |
duke@435 | 381 | } |
duke@435 | 382 | |
coleenp@4037 | 383 | void klassVtable::put_method_at(Method* m, int index) { |
duke@435 | 384 | #ifndef PRODUCT |
duke@435 | 385 | if (PrintVtables && Verbose) { |
acorn@1087 | 386 | ResourceMark rm; |
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 | #endif |
duke@435 | 391 | table()[index].set(m); |
duke@435 | 392 | } |
duke@435 | 393 | |
duke@435 | 394 | // Find out if a method "m" with superclass "super", loader "classloader" and |
duke@435 | 395 | // name "classname" needs a new vtable entry. Let P be a class package defined |
duke@435 | 396 | // by "classloader" and "classname". |
duke@435 | 397 | // NOTE: The logic used here is very similar to the one used for computing |
duke@435 | 398 | // the vtables indices for a method. We cannot directly use that function because, |
coleenp@4037 | 399 | // we allocate the InstanceKlass at load time, and that requires that the |
acorn@1087 | 400 | // superclass has been loaded. |
acorn@1087 | 401 | // However, the vtable entries are filled in at link time, and therefore |
acorn@1087 | 402 | // the superclass' vtable may not yet have been filled in. |
acorn@1087 | 403 | bool klassVtable::needs_new_vtable_entry(methodHandle target_method, |
coleenp@4037 | 404 | Klass* super, |
acorn@1087 | 405 | Handle classloader, |
coleenp@2497 | 406 | Symbol* classname, |
acorn@1087 | 407 | AccessFlags class_flags, |
acorn@1087 | 408 | TRAPS) { |
acorn@1087 | 409 | if ((class_flags.is_final() || target_method()->is_final()) || |
duke@435 | 410 | // a final method never needs a new entry; final methods can be statically |
duke@435 | 411 | // resolved and they have to be present in the vtable only if they override |
duke@435 | 412 | // a super's method, in which case they re-use its entry |
acorn@1087 | 413 | (target_method()->is_static()) || |
duke@435 | 414 | // static methods don't need to be in vtable |
acorn@1087 | 415 | (target_method()->name() == vmSymbols::object_initializer_name()) |
duke@435 | 416 | // <init> is never called dynamically-bound |
duke@435 | 417 | ) { |
duke@435 | 418 | return false; |
duke@435 | 419 | } |
duke@435 | 420 | |
duke@435 | 421 | // we need a new entry if there is no superclass |
duke@435 | 422 | if (super == NULL) { |
duke@435 | 423 | return true; |
duke@435 | 424 | } |
duke@435 | 425 | |
duke@435 | 426 | // private methods always have a new entry in the vtable |
acorn@1087 | 427 | // specification interpretation since classic has |
acorn@1087 | 428 | // private methods not overriding |
acorn@1087 | 429 | if (target_method()->is_private()) { |
duke@435 | 430 | return true; |
duke@435 | 431 | } |
duke@435 | 432 | |
duke@435 | 433 | // search through the super class hierarchy to see if we need |
duke@435 | 434 | // a new entry |
acorn@1087 | 435 | ResourceMark rm; |
coleenp@2497 | 436 | Symbol* name = target_method()->name(); |
coleenp@2497 | 437 | Symbol* signature = target_method()->signature(); |
coleenp@4037 | 438 | Klass* k = super; |
coleenp@4037 | 439 | Method* super_method = NULL; |
coleenp@4037 | 440 | InstanceKlass *holder = NULL; |
coleenp@4037 | 441 | Method* recheck_method = NULL; |
duke@435 | 442 | while (k != NULL) { |
duke@435 | 443 | // lookup through the hierarchy for a method with matching name and sign. |
coleenp@4037 | 444 | super_method = InstanceKlass::cast(k)->lookup_method(name, signature); |
acorn@1087 | 445 | if (super_method == NULL) { |
duke@435 | 446 | break; // we still have to search for a matching miranda method |
duke@435 | 447 | } |
duke@435 | 448 | // get the class holding the matching method |
acorn@1087 | 449 | // make sure you use that class for is_override |
coleenp@4037 | 450 | InstanceKlass* superk = InstanceKlass::cast(super_method->method_holder()); |
acorn@1087 | 451 | // we want only instance method matches |
acorn@1087 | 452 | // pretend private methods are not in the super vtable |
acorn@1087 | 453 | // since we do override around them: e.g. a.m pub/b.m private/c.m pub, |
acorn@1087 | 454 | // ignore private, c.m pub does override a.m pub |
acorn@1087 | 455 | // For classes that were not javac'd together, we also do transitive overriding around |
acorn@1087 | 456 | // methods that have less accessibility |
acorn@1087 | 457 | if ((!super_method->is_static()) && |
acorn@1087 | 458 | (!super_method->is_private())) { |
acorn@1087 | 459 | if (superk->is_override(super_method, classloader, classname, THREAD)) { |
duke@435 | 460 | return false; |
acorn@1087 | 461 | // else keep looking for transitive overrides |
duke@435 | 462 | } |
duke@435 | 463 | } |
duke@435 | 464 | |
acorn@1087 | 465 | // Start with lookup result and continue to search up |
acorn@1087 | 466 | k = superk->super(); // haven't found an override match yet; continue to look |
duke@435 | 467 | } |
duke@435 | 468 | |
duke@435 | 469 | // if the target method is public or protected it may have a matching |
duke@435 | 470 | // miranda method in the super, whose entry it should re-use. |
acorn@1087 | 471 | // Actually, to handle cases that javac would not generate, we need |
acorn@1087 | 472 | // this check for all access permissions. |
coleenp@4037 | 473 | InstanceKlass *sk = InstanceKlass::cast(super); |
acorn@1087 | 474 | if (sk->has_miranda_methods()) { |
acorn@1087 | 475 | if (sk->lookup_method_in_all_interfaces(name, signature) != NULL) { |
acorn@1087 | 476 | return false; // found a matching miranda; we do not need a new entry |
duke@435 | 477 | } |
duke@435 | 478 | } |
duke@435 | 479 | return true; // found no match; we need a new entry |
duke@435 | 480 | } |
duke@435 | 481 | |
duke@435 | 482 | // Support for miranda methods |
duke@435 | 483 | |
duke@435 | 484 | // get the vtable index of a miranda method with matching "name" and "signature" |
coleenp@2497 | 485 | int klassVtable::index_of_miranda(Symbol* name, Symbol* signature) { |
duke@435 | 486 | // search from the bottom, might be faster |
duke@435 | 487 | for (int i = (length() - 1); i >= 0; i--) { |
coleenp@4037 | 488 | Method* m = table()[i].method(); |
duke@435 | 489 | if (is_miranda_entry_at(i) && |
duke@435 | 490 | m->name() == name && m->signature() == signature) { |
duke@435 | 491 | return i; |
duke@435 | 492 | } |
duke@435 | 493 | } |
coleenp@4037 | 494 | return Method::invalid_vtable_index; |
duke@435 | 495 | } |
duke@435 | 496 | |
duke@435 | 497 | // check if an entry is miranda |
duke@435 | 498 | bool klassVtable::is_miranda_entry_at(int i) { |
coleenp@4037 | 499 | Method* m = method_at(i); |
coleenp@4037 | 500 | Klass* method_holder = m->method_holder(); |
coleenp@4037 | 501 | InstanceKlass *mhk = InstanceKlass::cast(method_holder); |
duke@435 | 502 | |
duke@435 | 503 | // miranda methods are interface methods in a class's vtable |
duke@435 | 504 | if (mhk->is_interface()) { |
duke@435 | 505 | assert(m->is_public() && m->is_abstract(), "should be public and abstract"); |
duke@435 | 506 | assert(ik()->implements_interface(method_holder) , "this class should implement the interface"); |
duke@435 | 507 | assert(is_miranda(m, ik()->methods(), ik()->super()), "should be a miranda_method"); |
duke@435 | 508 | return true; |
duke@435 | 509 | } |
duke@435 | 510 | return false; |
duke@435 | 511 | } |
duke@435 | 512 | |
duke@435 | 513 | // check if a method is a miranda method, given a class's methods table and it's super |
duke@435 | 514 | // the caller must make sure that the method belongs to an interface implemented by the class |
coleenp@4037 | 515 | bool klassVtable::is_miranda(Method* m, Array<Method*>* class_methods, Klass* super) { |
coleenp@2497 | 516 | Symbol* name = m->name(); |
coleenp@2497 | 517 | Symbol* signature = m->signature(); |
coleenp@4037 | 518 | if (InstanceKlass::find_method(class_methods, name, signature) == NULL) { |
dsamersoff@2360 | 519 | // did not find it in the method table of the current class |
duke@435 | 520 | if (super == NULL) { |
duke@435 | 521 | // super doesn't exist |
duke@435 | 522 | return true; |
dsamersoff@2360 | 523 | } |
dsamersoff@2360 | 524 | |
coleenp@4037 | 525 | Method* mo = InstanceKlass::cast(super)->lookup_method(name, signature); |
dsamersoff@2360 | 526 | if (mo == NULL || mo->access_flags().is_private() ) { |
dsamersoff@2360 | 527 | // super class hierarchy does not implement it or protection is different |
dsamersoff@2360 | 528 | return true; |
duke@435 | 529 | } |
duke@435 | 530 | } |
dsamersoff@2360 | 531 | |
duke@435 | 532 | return false; |
duke@435 | 533 | } |
duke@435 | 534 | |
coleenp@4037 | 535 | void klassVtable::add_new_mirandas_to_list(GrowableArray<Method*>* list_of_current_mirandas, |
coleenp@4037 | 536 | Array<Method*>* current_interface_methods, |
coleenp@4037 | 537 | Array<Method*>* class_methods, |
coleenp@4037 | 538 | Klass* super) { |
duke@435 | 539 | // iterate thru the current interface's method to see if it a miranda |
duke@435 | 540 | int num_methods = current_interface_methods->length(); |
duke@435 | 541 | for (int i = 0; i < num_methods; i++) { |
coleenp@4037 | 542 | Method* im = current_interface_methods->at(i); |
duke@435 | 543 | bool is_duplicate = false; |
duke@435 | 544 | int num_of_current_mirandas = list_of_current_mirandas->length(); |
duke@435 | 545 | // check for duplicate mirandas in different interfaces we implement |
duke@435 | 546 | for (int j = 0; j < num_of_current_mirandas; j++) { |
coleenp@4037 | 547 | Method* miranda = list_of_current_mirandas->at(j); |
duke@435 | 548 | if ((im->name() == miranda->name()) && |
duke@435 | 549 | (im->signature() == miranda->signature())) { |
duke@435 | 550 | is_duplicate = true; |
duke@435 | 551 | break; |
duke@435 | 552 | } |
duke@435 | 553 | } |
duke@435 | 554 | |
duke@435 | 555 | if (!is_duplicate) { // we don't want duplicate miranda entries in the vtable |
duke@435 | 556 | if (is_miranda(im, class_methods, super)) { // is it a miranda at all? |
coleenp@4037 | 557 | InstanceKlass *sk = InstanceKlass::cast(super); |
duke@435 | 558 | // check if it is a duplicate of a super's miranda |
duke@435 | 559 | if (sk->lookup_method_in_all_interfaces(im->name(), im->signature()) == NULL) { |
duke@435 | 560 | list_of_current_mirandas->append(im); |
duke@435 | 561 | } |
duke@435 | 562 | } |
duke@435 | 563 | } |
duke@435 | 564 | } |
duke@435 | 565 | } |
duke@435 | 566 | |
coleenp@4037 | 567 | void klassVtable::get_mirandas(GrowableArray<Method*>* mirandas, |
coleenp@4037 | 568 | Klass* super, Array<Method*>* class_methods, |
coleenp@4037 | 569 | Array<Klass*>* local_interfaces) { |
duke@435 | 570 | assert((mirandas->length() == 0) , "current mirandas must be 0"); |
duke@435 | 571 | |
duke@435 | 572 | // iterate thru the local interfaces looking for a miranda |
duke@435 | 573 | int num_local_ifs = local_interfaces->length(); |
duke@435 | 574 | for (int i = 0; i < num_local_ifs; i++) { |
coleenp@4037 | 575 | InstanceKlass *ik = InstanceKlass::cast(local_interfaces->at(i)); |
duke@435 | 576 | add_new_mirandas_to_list(mirandas, ik->methods(), class_methods, super); |
duke@435 | 577 | // iterate thru each local's super interfaces |
coleenp@4037 | 578 | Array<Klass*>* super_ifs = ik->transitive_interfaces(); |
duke@435 | 579 | int num_super_ifs = super_ifs->length(); |
duke@435 | 580 | for (int j = 0; j < num_super_ifs; j++) { |
coleenp@4037 | 581 | InstanceKlass *sik = InstanceKlass::cast(super_ifs->at(j)); |
duke@435 | 582 | add_new_mirandas_to_list(mirandas, sik->methods(), class_methods, super); |
duke@435 | 583 | } |
duke@435 | 584 | } |
duke@435 | 585 | } |
duke@435 | 586 | |
duke@435 | 587 | // get number of mirandas |
coleenp@4037 | 588 | int klassVtable::get_num_mirandas(Klass* super, Array<Method*>* class_methods, Array<Klass*>* local_interfaces) { |
duke@435 | 589 | ResourceMark rm; |
coleenp@4037 | 590 | GrowableArray<Method*>* mirandas = new GrowableArray<Method*>(20); |
duke@435 | 591 | get_mirandas(mirandas, super, class_methods, local_interfaces); |
duke@435 | 592 | return mirandas->length(); |
duke@435 | 593 | } |
duke@435 | 594 | |
duke@435 | 595 | // fill in mirandas |
duke@435 | 596 | void klassVtable::fill_in_mirandas(int& initialized) { |
duke@435 | 597 | ResourceMark rm; |
coleenp@4037 | 598 | GrowableArray<Method*>* mirandas = new GrowableArray<Method*>(20); |
coleenp@4037 | 599 | InstanceKlass *this_ik = ik(); |
duke@435 | 600 | get_mirandas(mirandas, this_ik->super(), this_ik->methods(), this_ik->local_interfaces()); |
duke@435 | 601 | int num_mirandas = mirandas->length(); |
duke@435 | 602 | for (int i = 0; i < num_mirandas; i++) { |
duke@435 | 603 | put_method_at(mirandas->at(i), initialized); |
duke@435 | 604 | initialized++; |
duke@435 | 605 | } |
duke@435 | 606 | } |
duke@435 | 607 | |
duke@435 | 608 | void klassVtable::copy_vtable_to(vtableEntry* start) { |
duke@435 | 609 | Copy::disjoint_words((HeapWord*)table(), (HeapWord*)start, _length * vtableEntry::size()); |
duke@435 | 610 | } |
duke@435 | 611 | |
coleenp@4037 | 612 | void klassVtable::adjust_method_entries(Method** old_methods, Method** new_methods, |
duke@435 | 613 | int methods_length, bool * trace_name_printed) { |
duke@435 | 614 | // search the vtable for uses of either obsolete or EMCP methods |
duke@435 | 615 | for (int j = 0; j < methods_length; j++) { |
coleenp@4037 | 616 | Method* old_method = old_methods[j]; |
coleenp@4037 | 617 | Method* new_method = new_methods[j]; |
duke@435 | 618 | |
duke@435 | 619 | // In the vast majority of cases we could get the vtable index |
duke@435 | 620 | // by using: old_method->vtable_index() |
duke@435 | 621 | // However, there are rare cases, eg. sun.awt.X11.XDecoratedPeer.getX() |
duke@435 | 622 | // in sun.awt.X11.XFramePeer where methods occur more than once in the |
duke@435 | 623 | // vtable, so, alas, we must do an exhaustive search. |
duke@435 | 624 | for (int index = 0; index < length(); index++) { |
duke@435 | 625 | if (unchecked_method_at(index) == old_method) { |
duke@435 | 626 | put_method_at(new_method, index); |
duke@435 | 627 | |
duke@435 | 628 | if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) { |
duke@435 | 629 | if (!(*trace_name_printed)) { |
duke@435 | 630 | // RC_TRACE_MESG macro has an embedded ResourceMark |
duke@435 | 631 | RC_TRACE_MESG(("adjust: name=%s", |
duke@435 | 632 | Klass::cast(old_method->method_holder())->external_name())); |
duke@435 | 633 | *trace_name_printed = true; |
duke@435 | 634 | } |
duke@435 | 635 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 636 | RC_TRACE(0x00100000, ("vtable method update: %s(%s)", |
duke@435 | 637 | new_method->name()->as_C_string(), |
duke@435 | 638 | new_method->signature()->as_C_string())); |
duke@435 | 639 | } |
duke@435 | 640 | } |
duke@435 | 641 | } |
duke@435 | 642 | } |
duke@435 | 643 | } |
duke@435 | 644 | |
coleenp@2777 | 645 | // CDS/RedefineClasses support - clear vtables so they can be reinitialized |
coleenp@2777 | 646 | void klassVtable::clear_vtable() { |
coleenp@2777 | 647 | for (int i = 0; i < _length; i++) table()[i].clear(); |
coleenp@2777 | 648 | } |
coleenp@2777 | 649 | |
coleenp@2777 | 650 | bool klassVtable::is_initialized() { |
coleenp@2777 | 651 | return _length == 0 || table()[0].method() != NULL; |
coleenp@2777 | 652 | } |
coleenp@2777 | 653 | |
duke@435 | 654 | //----------------------------------------------------------------------------------------- |
duke@435 | 655 | // Itable code |
duke@435 | 656 | |
duke@435 | 657 | // Initialize a itableMethodEntry |
coleenp@4037 | 658 | void itableMethodEntry::initialize(Method* m) { |
duke@435 | 659 | if (m == NULL) return; |
duke@435 | 660 | |
duke@435 | 661 | _method = m; |
duke@435 | 662 | } |
duke@435 | 663 | |
duke@435 | 664 | klassItable::klassItable(instanceKlassHandle klass) { |
duke@435 | 665 | _klass = klass; |
duke@435 | 666 | |
duke@435 | 667 | if (klass->itable_length() > 0) { |
duke@435 | 668 | itableOffsetEntry* offset_entry = (itableOffsetEntry*)klass->start_of_itable(); |
duke@435 | 669 | if (offset_entry != NULL && offset_entry->interface_klass() != NULL) { // Check that itable is initialized |
duke@435 | 670 | // First offset entry points to the first method_entry |
coleenp@4037 | 671 | intptr_t* method_entry = (intptr_t *)(((address)klass()) + offset_entry->offset()); |
duke@435 | 672 | intptr_t* end = klass->end_of_itable(); |
duke@435 | 673 | |
coleenp@4037 | 674 | _table_offset = (intptr_t*)offset_entry - (intptr_t*)klass(); |
duke@435 | 675 | _size_offset_table = (method_entry - ((intptr_t*)offset_entry)) / itableOffsetEntry::size(); |
duke@435 | 676 | _size_method_table = (end - method_entry) / itableMethodEntry::size(); |
duke@435 | 677 | assert(_table_offset >= 0 && _size_offset_table >= 0 && _size_method_table >= 0, "wrong computation"); |
duke@435 | 678 | return; |
duke@435 | 679 | } |
duke@435 | 680 | } |
duke@435 | 681 | |
dcubed@451 | 682 | // The length of the itable was either zero, or it has not yet been initialized. |
duke@435 | 683 | _table_offset = 0; |
duke@435 | 684 | _size_offset_table = 0; |
duke@435 | 685 | _size_method_table = 0; |
duke@435 | 686 | } |
duke@435 | 687 | |
duke@435 | 688 | static int initialize_count = 0; |
duke@435 | 689 | |
duke@435 | 690 | // Initialization |
duke@435 | 691 | void klassItable::initialize_itable(bool checkconstraints, TRAPS) { |
dcubed@451 | 692 | // Cannot be setup doing bootstrapping, interfaces don't have |
dcubed@451 | 693 | // itables, and klass with only ones entry have empty itables |
dcubed@451 | 694 | if (Universe::is_bootstrapping() || |
dcubed@451 | 695 | _klass->is_interface() || |
dcubed@451 | 696 | _klass->itable_length() == itableOffsetEntry::size()) return; |
duke@435 | 697 | |
dcubed@451 | 698 | // There's alway an extra itable entry so we can null-terminate it. |
dcubed@451 | 699 | guarantee(size_offset_table() >= 1, "too small"); |
dcubed@451 | 700 | int num_interfaces = size_offset_table() - 1; |
duke@435 | 701 | if (num_interfaces > 0) { |
dcubed@451 | 702 | if (TraceItables) tty->print_cr("%3d: Initializing itables for %s", ++initialize_count, |
dcubed@451 | 703 | _klass->name()->as_C_string()); |
duke@435 | 704 | |
duke@435 | 705 | |
acorn@1087 | 706 | // Iterate through all interfaces |
duke@435 | 707 | int i; |
duke@435 | 708 | for(i = 0; i < num_interfaces; i++) { |
duke@435 | 709 | itableOffsetEntry* ioe = offset_entry(i); |
coleenp@4037 | 710 | HandleMark hm(THREAD); |
duke@435 | 711 | KlassHandle interf_h (THREAD, ioe->interface_klass()); |
duke@435 | 712 | assert(interf_h() != NULL && ioe->offset() != 0, "bad offset entry in itable"); |
duke@435 | 713 | initialize_itable_for_interface(ioe->offset(), interf_h, checkconstraints, CHECK); |
duke@435 | 714 | } |
duke@435 | 715 | |
duke@435 | 716 | } |
dcubed@451 | 717 | // Check that the last entry is empty |
dcubed@451 | 718 | itableOffsetEntry* ioe = offset_entry(size_offset_table() - 1); |
dcubed@451 | 719 | guarantee(ioe->interface_klass() == NULL && ioe->offset() == 0, "terminator entry missing"); |
duke@435 | 720 | } |
duke@435 | 721 | |
duke@435 | 722 | |
duke@435 | 723 | void klassItable::initialize_itable_for_interface(int method_table_offset, KlassHandle interf_h, bool checkconstraints, TRAPS) { |
coleenp@4037 | 724 | Array<Method*>* methods = InstanceKlass::cast(interf_h())->methods(); |
coleenp@4037 | 725 | int nof_methods = methods->length(); |
duke@435 | 726 | HandleMark hm; |
duke@435 | 727 | KlassHandle klass = _klass; |
jcoomes@1844 | 728 | assert(nof_methods > 0, "at least one method must exist for interface to be in vtable"); |
coleenp@4037 | 729 | Handle interface_loader (THREAD, InstanceKlass::cast(interf_h())->class_loader()); |
duke@435 | 730 | int ime_num = 0; |
duke@435 | 731 | |
coleenp@4037 | 732 | // Skip first Method* if it is a class initializer |
coleenp@4037 | 733 | int i = methods->at(0)->is_static_initializer() ? 1 : 0; |
duke@435 | 734 | |
duke@435 | 735 | // m, method_name, method_signature, klass reset each loop so they |
duke@435 | 736 | // don't need preserving across check_signature_loaders call |
duke@435 | 737 | // methods needs a handle in case of gc from check_signature_loaders |
duke@435 | 738 | for(; i < nof_methods; i++) { |
coleenp@4037 | 739 | Method* m = methods->at(i); |
coleenp@2497 | 740 | Symbol* method_name = m->name(); |
coleenp@2497 | 741 | Symbol* method_signature = m->signature(); |
duke@435 | 742 | |
duke@435 | 743 | // This is same code as in Linkresolver::lookup_instance_method_in_klasses |
coleenp@4037 | 744 | Method* target = klass->uncached_lookup_method(method_name, method_signature); |
duke@435 | 745 | while (target != NULL && target->is_static()) { |
duke@435 | 746 | // continue with recursive lookup through the superclass |
coleenp@4037 | 747 | Klass* super = Klass::cast(target->method_holder())->super(); |
coleenp@4037 | 748 | target = (super == NULL) ? (Method*)NULL : Klass::cast(super)->uncached_lookup_method(method_name, method_signature); |
duke@435 | 749 | } |
duke@435 | 750 | if (target == NULL || !target->is_public() || target->is_abstract()) { |
duke@435 | 751 | // Entry do not resolve. Leave it empty |
duke@435 | 752 | } else { |
duke@435 | 753 | // Entry did resolve, check loader constraints before initializing |
duke@435 | 754 | // if checkconstraints requested |
duke@435 | 755 | methodHandle target_h (THREAD, target); // preserve across gc |
duke@435 | 756 | if (checkconstraints) { |
coleenp@4037 | 757 | Handle method_holder_loader (THREAD, InstanceKlass::cast(target->method_holder())->class_loader()); |
duke@435 | 758 | if (method_holder_loader() != interface_loader()) { |
duke@435 | 759 | ResourceMark rm(THREAD); |
duke@435 | 760 | char* failed_type_name = |
duke@435 | 761 | SystemDictionary::check_signature_loaders(method_signature, |
duke@435 | 762 | method_holder_loader, |
duke@435 | 763 | interface_loader, |
duke@435 | 764 | true, CHECK); |
duke@435 | 765 | if (failed_type_name != NULL) { |
duke@435 | 766 | const char* msg = "loader constraint violation in interface " |
duke@435 | 767 | "itable initialization: when resolving method \"%s\" the class" |
duke@435 | 768 | " loader (instance of %s) of the current class, %s, " |
duke@435 | 769 | "and the class loader (instance of %s) for interface " |
duke@435 | 770 | "%s have different Class objects for the type %s " |
duke@435 | 771 | "used in the signature"; |
duke@435 | 772 | char* sig = target_h()->name_and_sig_as_C_string(); |
duke@435 | 773 | const char* loader1 = SystemDictionary::loader_name(method_holder_loader()); |
duke@435 | 774 | char* current = klass->name()->as_C_string(); |
duke@435 | 775 | const char* loader2 = SystemDictionary::loader_name(interface_loader()); |
coleenp@4037 | 776 | char* iface = InstanceKlass::cast(interf_h())->name()->as_C_string(); |
duke@435 | 777 | size_t buflen = strlen(msg) + strlen(sig) + strlen(loader1) + |
duke@435 | 778 | strlen(current) + strlen(loader2) + strlen(iface) + |
duke@435 | 779 | strlen(failed_type_name); |
duke@435 | 780 | char* buf = NEW_RESOURCE_ARRAY_IN_THREAD(THREAD, char, buflen); |
duke@435 | 781 | jio_snprintf(buf, buflen, msg, sig, loader1, current, loader2, |
duke@435 | 782 | iface, failed_type_name); |
duke@435 | 783 | THROW_MSG(vmSymbols::java_lang_LinkageError(), buf); |
duke@435 | 784 | } |
duke@435 | 785 | } |
duke@435 | 786 | } |
duke@435 | 787 | |
duke@435 | 788 | // ime may have moved during GC so recalculate address |
duke@435 | 789 | itableOffsetEntry::method_entry(_klass(), method_table_offset)[ime_num].initialize(target_h()); |
duke@435 | 790 | } |
duke@435 | 791 | // Progress to next entry |
duke@435 | 792 | ime_num++; |
duke@435 | 793 | } |
duke@435 | 794 | } |
duke@435 | 795 | |
coleenp@4037 | 796 | // Update entry for specific Method* |
coleenp@4037 | 797 | void klassItable::initialize_with_method(Method* m) { |
duke@435 | 798 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 799 | for(int i = 0; i < _size_method_table; i++) { |
duke@435 | 800 | if (ime->method() == m) { |
duke@435 | 801 | ime->initialize(m); |
duke@435 | 802 | } |
duke@435 | 803 | ime++; |
duke@435 | 804 | } |
duke@435 | 805 | } |
duke@435 | 806 | |
coleenp@4037 | 807 | void klassItable::adjust_method_entries(Method** old_methods, Method** new_methods, |
duke@435 | 808 | int methods_length, bool * trace_name_printed) { |
duke@435 | 809 | // search the itable for uses of either obsolete or EMCP methods |
duke@435 | 810 | for (int j = 0; j < methods_length; j++) { |
coleenp@4037 | 811 | Method* old_method = old_methods[j]; |
coleenp@4037 | 812 | Method* new_method = new_methods[j]; |
duke@435 | 813 | itableMethodEntry* ime = method_entry(0); |
duke@435 | 814 | |
dcubed@1045 | 815 | // The itable can describe more than one interface and the same |
dcubed@1045 | 816 | // method signature can be specified by more than one interface. |
dcubed@1045 | 817 | // This means we have to do an exhaustive search to find all the |
dcubed@1045 | 818 | // old_method references. |
duke@435 | 819 | for (int i = 0; i < _size_method_table; i++) { |
duke@435 | 820 | if (ime->method() == old_method) { |
duke@435 | 821 | ime->initialize(new_method); |
duke@435 | 822 | |
duke@435 | 823 | if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) { |
duke@435 | 824 | if (!(*trace_name_printed)) { |
duke@435 | 825 | // RC_TRACE_MESG macro has an embedded ResourceMark |
duke@435 | 826 | RC_TRACE_MESG(("adjust: name=%s", |
duke@435 | 827 | Klass::cast(old_method->method_holder())->external_name())); |
duke@435 | 828 | *trace_name_printed = true; |
duke@435 | 829 | } |
duke@435 | 830 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 831 | RC_TRACE(0x00200000, ("itable method update: %s(%s)", |
duke@435 | 832 | new_method->name()->as_C_string(), |
duke@435 | 833 | new_method->signature()->as_C_string())); |
duke@435 | 834 | } |
coleenp@4037 | 835 | // Cannot break because there might be another entry for this method |
duke@435 | 836 | } |
duke@435 | 837 | ime++; |
duke@435 | 838 | } |
duke@435 | 839 | } |
duke@435 | 840 | } |
duke@435 | 841 | |
duke@435 | 842 | |
duke@435 | 843 | // Setup |
duke@435 | 844 | class InterfaceVisiterClosure : public StackObj { |
duke@435 | 845 | public: |
coleenp@4037 | 846 | virtual void doit(Klass* intf, int method_count) = 0; |
duke@435 | 847 | }; |
duke@435 | 848 | |
duke@435 | 849 | // Visit all interfaces with at-least one method (excluding <clinit>) |
coleenp@4037 | 850 | void visit_all_interfaces(Array<Klass*>* transitive_intf, InterfaceVisiterClosure *blk) { |
duke@435 | 851 | // Handle array argument |
duke@435 | 852 | for(int i = 0; i < transitive_intf->length(); i++) { |
coleenp@4037 | 853 | Klass* intf = transitive_intf->at(i); |
duke@435 | 854 | assert(Klass::cast(intf)->is_interface(), "sanity check"); |
duke@435 | 855 | |
duke@435 | 856 | // Find no. of methods excluding a <clinit> |
coleenp@4037 | 857 | int method_count = InstanceKlass::cast(intf)->methods()->length(); |
duke@435 | 858 | if (method_count > 0) { |
coleenp@4037 | 859 | Method* m = InstanceKlass::cast(intf)->methods()->at(0); |
duke@435 | 860 | assert(m != NULL && m->is_method(), "sanity check"); |
duke@435 | 861 | if (m->name() == vmSymbols::object_initializer_name()) { |
duke@435 | 862 | method_count--; |
duke@435 | 863 | } |
duke@435 | 864 | } |
duke@435 | 865 | |
duke@435 | 866 | // Only count interfaces with at least one method |
duke@435 | 867 | if (method_count > 0) { |
duke@435 | 868 | blk->doit(intf, method_count); |
duke@435 | 869 | } |
duke@435 | 870 | } |
duke@435 | 871 | } |
duke@435 | 872 | |
duke@435 | 873 | class CountInterfacesClosure : public InterfaceVisiterClosure { |
duke@435 | 874 | private: |
duke@435 | 875 | int _nof_methods; |
duke@435 | 876 | int _nof_interfaces; |
duke@435 | 877 | public: |
duke@435 | 878 | CountInterfacesClosure() { _nof_methods = 0; _nof_interfaces = 0; } |
duke@435 | 879 | |
duke@435 | 880 | int nof_methods() const { return _nof_methods; } |
duke@435 | 881 | int nof_interfaces() const { return _nof_interfaces; } |
duke@435 | 882 | |
coleenp@4037 | 883 | void doit(Klass* intf, int method_count) { _nof_methods += method_count; _nof_interfaces++; } |
duke@435 | 884 | }; |
duke@435 | 885 | |
duke@435 | 886 | class SetupItableClosure : public InterfaceVisiterClosure { |
duke@435 | 887 | private: |
duke@435 | 888 | itableOffsetEntry* _offset_entry; |
duke@435 | 889 | itableMethodEntry* _method_entry; |
duke@435 | 890 | address _klass_begin; |
duke@435 | 891 | public: |
duke@435 | 892 | SetupItableClosure(address klass_begin, itableOffsetEntry* offset_entry, itableMethodEntry* method_entry) { |
duke@435 | 893 | _klass_begin = klass_begin; |
duke@435 | 894 | _offset_entry = offset_entry; |
duke@435 | 895 | _method_entry = method_entry; |
duke@435 | 896 | } |
duke@435 | 897 | |
duke@435 | 898 | itableMethodEntry* method_entry() const { return _method_entry; } |
duke@435 | 899 | |
coleenp@4037 | 900 | void doit(Klass* intf, int method_count) { |
duke@435 | 901 | int offset = ((address)_method_entry) - _klass_begin; |
duke@435 | 902 | _offset_entry->initialize(intf, offset); |
duke@435 | 903 | _offset_entry++; |
duke@435 | 904 | _method_entry += method_count; |
duke@435 | 905 | } |
duke@435 | 906 | }; |
duke@435 | 907 | |
coleenp@4037 | 908 | int klassItable::compute_itable_size(Array<Klass*>* transitive_interfaces) { |
duke@435 | 909 | // Count no of interfaces and total number of interface methods |
duke@435 | 910 | CountInterfacesClosure cic; |
coleenp@4037 | 911 | visit_all_interfaces(transitive_interfaces, &cic); |
duke@435 | 912 | |
dcubed@451 | 913 | // There's alway an extra itable entry so we can null-terminate it. |
dcubed@451 | 914 | int itable_size = calc_itable_size(cic.nof_interfaces() + 1, cic.nof_methods()); |
duke@435 | 915 | |
duke@435 | 916 | // Statistics |
duke@435 | 917 | update_stats(itable_size * HeapWordSize); |
duke@435 | 918 | |
duke@435 | 919 | return itable_size; |
duke@435 | 920 | } |
duke@435 | 921 | |
duke@435 | 922 | |
duke@435 | 923 | // Fill out offset table and interface klasses into the itable space |
duke@435 | 924 | void klassItable::setup_itable_offset_table(instanceKlassHandle klass) { |
duke@435 | 925 | if (klass->itable_length() == 0) return; |
duke@435 | 926 | assert(!klass->is_interface(), "Should have zero length itable"); |
duke@435 | 927 | |
duke@435 | 928 | // Count no of interfaces and total number of interface methods |
duke@435 | 929 | CountInterfacesClosure cic; |
duke@435 | 930 | visit_all_interfaces(klass->transitive_interfaces(), &cic); |
duke@435 | 931 | int nof_methods = cic.nof_methods(); |
duke@435 | 932 | int nof_interfaces = cic.nof_interfaces(); |
duke@435 | 933 | |
dcubed@451 | 934 | // Add one extra entry so we can null-terminate the table |
dcubed@451 | 935 | nof_interfaces++; |
duke@435 | 936 | |
coleenp@4037 | 937 | assert(compute_itable_size(klass->transitive_interfaces()) == |
duke@435 | 938 | calc_itable_size(nof_interfaces, nof_methods), |
duke@435 | 939 | "mismatch calculation of itable size"); |
duke@435 | 940 | |
duke@435 | 941 | // Fill-out offset table |
duke@435 | 942 | itableOffsetEntry* ioe = (itableOffsetEntry*)klass->start_of_itable(); |
duke@435 | 943 | itableMethodEntry* ime = (itableMethodEntry*)(ioe + nof_interfaces); |
duke@435 | 944 | intptr_t* end = klass->end_of_itable(); |
never@2658 | 945 | assert((oop*)(ime + nof_methods) <= (oop*)klass->start_of_nonstatic_oop_maps(), "wrong offset calculation (1)"); |
coleenp@548 | 946 | assert((oop*)(end) == (oop*)(ime + nof_methods), "wrong offset calculation (2)"); |
duke@435 | 947 | |
duke@435 | 948 | // Visit all interfaces and initialize itable offset table |
coleenp@4037 | 949 | SetupItableClosure sic((address)klass(), ioe, ime); |
duke@435 | 950 | visit_all_interfaces(klass->transitive_interfaces(), &sic); |
duke@435 | 951 | |
duke@435 | 952 | #ifdef ASSERT |
duke@435 | 953 | ime = sic.method_entry(); |
duke@435 | 954 | oop* v = (oop*) klass->end_of_itable(); |
duke@435 | 955 | assert( (oop*)(ime) == v, "wrong offset calculation (2)"); |
duke@435 | 956 | #endif |
duke@435 | 957 | } |
duke@435 | 958 | |
duke@435 | 959 | |
duke@435 | 960 | // m must be a method in an interface |
coleenp@4037 | 961 | int klassItable::compute_itable_index(Method* m) { |
coleenp@4037 | 962 | Klass* intf = m->method_holder(); |
coleenp@4037 | 963 | assert(InstanceKlass::cast(intf)->is_interface(), "sanity check"); |
coleenp@4037 | 964 | Array<Method*>* methods = InstanceKlass::cast(intf)->methods(); |
duke@435 | 965 | int index = 0; |
coleenp@4037 | 966 | while(methods->at(index) != m) { |
duke@435 | 967 | index++; |
duke@435 | 968 | assert(index < methods->length(), "should find index for resolve_invoke"); |
duke@435 | 969 | } |
duke@435 | 970 | // Adjust for <clinit>, which is left out of table if first method |
coleenp@4037 | 971 | if (methods->length() > 0 && methods->at(0)->is_static_initializer()) { |
duke@435 | 972 | index--; |
duke@435 | 973 | } |
duke@435 | 974 | return index; |
duke@435 | 975 | } |
duke@435 | 976 | |
jrose@1100 | 977 | |
jrose@1100 | 978 | // inverse to compute_itable_index |
coleenp@4037 | 979 | Method* klassItable::method_for_itable_index(Klass* intf, int itable_index) { |
coleenp@4037 | 980 | assert(InstanceKlass::cast(intf)->is_interface(), "sanity check"); |
coleenp@4037 | 981 | Array<Method*>* methods = InstanceKlass::cast(intf)->methods(); |
jrose@1100 | 982 | |
jrose@1100 | 983 | int index = itable_index; |
jrose@1100 | 984 | // Adjust for <clinit>, which is left out of table if first method |
coleenp@4037 | 985 | if (methods->length() > 0 && methods->at(0)->is_static_initializer()) { |
jrose@1100 | 986 | index++; |
jrose@1100 | 987 | } |
jrose@1100 | 988 | |
jrose@1100 | 989 | if (itable_index < 0 || index >= methods->length()) |
jrose@1100 | 990 | return NULL; // help caller defend against bad indexes |
jrose@1100 | 991 | |
coleenp@4037 | 992 | Method* m = methods->at(index); |
jrose@1100 | 993 | assert(compute_itable_index(m) == itable_index, "correct inverse"); |
jrose@1100 | 994 | |
jrose@1100 | 995 | return m; |
jrose@1100 | 996 | } |
jrose@1100 | 997 | |
duke@435 | 998 | void klassVtable::verify(outputStream* st, bool forced) { |
duke@435 | 999 | // make sure table is initialized |
duke@435 | 1000 | if (!Universe::is_fully_initialized()) return; |
duke@435 | 1001 | #ifndef PRODUCT |
duke@435 | 1002 | // avoid redundant verifies |
duke@435 | 1003 | if (!forced && _verify_count == Universe::verify_count()) return; |
duke@435 | 1004 | _verify_count = Universe::verify_count(); |
duke@435 | 1005 | #endif |
duke@435 | 1006 | oop* end_of_obj = (oop*)_klass() + _klass()->size(); |
duke@435 | 1007 | oop* end_of_vtable = (oop *)&table()[_length]; |
duke@435 | 1008 | if (end_of_vtable > end_of_obj) { |
jcoomes@1845 | 1009 | fatal(err_msg("klass %s: klass object too short (vtable extends beyond " |
jcoomes@1845 | 1010 | "end)", _klass->internal_name())); |
duke@435 | 1011 | } |
duke@435 | 1012 | |
duke@435 | 1013 | for (int i = 0; i < _length; i++) table()[i].verify(this, st); |
duke@435 | 1014 | // verify consistency with superKlass vtable |
coleenp@4037 | 1015 | Klass* super = _klass->super(); |
duke@435 | 1016 | if (super != NULL) { |
coleenp@4037 | 1017 | InstanceKlass* sk = InstanceKlass::cast(super); |
duke@435 | 1018 | klassVtable* vt = sk->vtable(); |
duke@435 | 1019 | for (int i = 0; i < vt->length(); i++) { |
duke@435 | 1020 | verify_against(st, vt, i); |
duke@435 | 1021 | } |
duke@435 | 1022 | } |
duke@435 | 1023 | } |
duke@435 | 1024 | |
duke@435 | 1025 | void klassVtable::verify_against(outputStream* st, klassVtable* vt, int index) { |
duke@435 | 1026 | vtableEntry* vte = &vt->table()[index]; |
duke@435 | 1027 | if (vte->method()->name() != table()[index].method()->name() || |
duke@435 | 1028 | vte->method()->signature() != table()[index].method()->signature()) { |
duke@435 | 1029 | fatal("mismatched name/signature of vtable entries"); |
duke@435 | 1030 | } |
duke@435 | 1031 | } |
duke@435 | 1032 | |
duke@435 | 1033 | #ifndef PRODUCT |
duke@435 | 1034 | void klassVtable::print() { |
duke@435 | 1035 | ResourceMark rm; |
duke@435 | 1036 | tty->print("klassVtable for klass %s (length %d):\n", _klass->internal_name(), length()); |
duke@435 | 1037 | for (int i = 0; i < length(); i++) { |
duke@435 | 1038 | table()[i].print(); |
duke@435 | 1039 | tty->cr(); |
duke@435 | 1040 | } |
duke@435 | 1041 | } |
duke@435 | 1042 | #endif |
duke@435 | 1043 | |
duke@435 | 1044 | void vtableEntry::verify(klassVtable* vt, outputStream* st) { |
duke@435 | 1045 | NOT_PRODUCT(FlagSetting fs(IgnoreLockingAssertions, true)); |
duke@435 | 1046 | assert(method() != NULL, "must have set method"); |
duke@435 | 1047 | method()->verify(); |
duke@435 | 1048 | // we sub_type, because it could be a miranda method |
duke@435 | 1049 | if (!vt->klass()->is_subtype_of(method()->method_holder())) { |
duke@435 | 1050 | #ifndef PRODUCT |
duke@435 | 1051 | print(); |
duke@435 | 1052 | #endif |
jcoomes@1845 | 1053 | fatal(err_msg("vtableEntry " PTR_FORMAT ": method is from subclass", this)); |
duke@435 | 1054 | } |
duke@435 | 1055 | } |
duke@435 | 1056 | |
duke@435 | 1057 | #ifndef PRODUCT |
duke@435 | 1058 | |
duke@435 | 1059 | void vtableEntry::print() { |
duke@435 | 1060 | ResourceMark rm; |
duke@435 | 1061 | tty->print("vtableEntry %s: ", method()->name()->as_C_string()); |
duke@435 | 1062 | if (Verbose) { |
duke@435 | 1063 | tty->print("m %#lx ", (address)method()); |
duke@435 | 1064 | } |
duke@435 | 1065 | } |
duke@435 | 1066 | |
duke@435 | 1067 | class VtableStats : AllStatic { |
duke@435 | 1068 | public: |
duke@435 | 1069 | static int no_klasses; // # classes with vtables |
duke@435 | 1070 | static int no_array_klasses; // # array classes |
duke@435 | 1071 | static int no_instance_klasses; // # instanceKlasses |
duke@435 | 1072 | static int sum_of_vtable_len; // total # of vtable entries |
duke@435 | 1073 | static int sum_of_array_vtable_len; // total # of vtable entries in array klasses only |
duke@435 | 1074 | static int fixed; // total fixed overhead in bytes |
duke@435 | 1075 | static int filler; // overhead caused by filler bytes |
duke@435 | 1076 | static int entries; // total bytes consumed by vtable entries |
duke@435 | 1077 | static int array_entries; // total bytes consumed by array vtable entries |
duke@435 | 1078 | |
coleenp@4037 | 1079 | static void do_class(Klass* k) { |
coleenp@4037 | 1080 | Klass* kl = k; |
duke@435 | 1081 | klassVtable* vt = kl->vtable(); |
duke@435 | 1082 | if (vt == NULL) return; |
duke@435 | 1083 | no_klasses++; |
duke@435 | 1084 | if (kl->oop_is_instance()) { |
duke@435 | 1085 | no_instance_klasses++; |
duke@435 | 1086 | kl->array_klasses_do(do_class); |
duke@435 | 1087 | } |
duke@435 | 1088 | if (kl->oop_is_array()) { |
duke@435 | 1089 | no_array_klasses++; |
duke@435 | 1090 | sum_of_array_vtable_len += vt->length(); |
duke@435 | 1091 | } |
duke@435 | 1092 | sum_of_vtable_len += vt->length(); |
duke@435 | 1093 | } |
duke@435 | 1094 | |
duke@435 | 1095 | static void compute() { |
duke@435 | 1096 | SystemDictionary::classes_do(do_class); |
duke@435 | 1097 | fixed = no_klasses * oopSize; // vtable length |
duke@435 | 1098 | // filler size is a conservative approximation |
coleenp@4142 | 1099 | filler = oopSize * (no_klasses - no_instance_klasses) * (sizeof(InstanceKlass) - sizeof(ArrayKlass) - 1); |
duke@435 | 1100 | entries = sizeof(vtableEntry) * sum_of_vtable_len; |
duke@435 | 1101 | array_entries = sizeof(vtableEntry) * sum_of_array_vtable_len; |
duke@435 | 1102 | } |
duke@435 | 1103 | }; |
duke@435 | 1104 | |
duke@435 | 1105 | int VtableStats::no_klasses = 0; |
duke@435 | 1106 | int VtableStats::no_array_klasses = 0; |
duke@435 | 1107 | int VtableStats::no_instance_klasses = 0; |
duke@435 | 1108 | int VtableStats::sum_of_vtable_len = 0; |
duke@435 | 1109 | int VtableStats::sum_of_array_vtable_len = 0; |
duke@435 | 1110 | int VtableStats::fixed = 0; |
duke@435 | 1111 | int VtableStats::filler = 0; |
duke@435 | 1112 | int VtableStats::entries = 0; |
duke@435 | 1113 | int VtableStats::array_entries = 0; |
duke@435 | 1114 | |
duke@435 | 1115 | void klassVtable::print_statistics() { |
duke@435 | 1116 | ResourceMark rm; |
duke@435 | 1117 | HandleMark hm; |
duke@435 | 1118 | VtableStats::compute(); |
duke@435 | 1119 | tty->print_cr("vtable statistics:"); |
duke@435 | 1120 | tty->print_cr("%6d classes (%d instance, %d array)", VtableStats::no_klasses, VtableStats::no_instance_klasses, VtableStats::no_array_klasses); |
duke@435 | 1121 | int total = VtableStats::fixed + VtableStats::filler + VtableStats::entries; |
duke@435 | 1122 | tty->print_cr("%6d bytes fixed overhead (refs + vtable object header)", VtableStats::fixed); |
duke@435 | 1123 | tty->print_cr("%6d bytes filler overhead", VtableStats::filler); |
duke@435 | 1124 | tty->print_cr("%6d bytes for vtable entries (%d for arrays)", VtableStats::entries, VtableStats::array_entries); |
duke@435 | 1125 | tty->print_cr("%6d bytes total", total); |
duke@435 | 1126 | } |
duke@435 | 1127 | |
duke@435 | 1128 | bool klassVtable::check_no_old_entries() { |
duke@435 | 1129 | // Check that there really is no entry |
duke@435 | 1130 | for (int i = 0; i < length(); i++) { |
coleenp@4037 | 1131 | Method* m = unchecked_method_at(i); |
duke@435 | 1132 | if (m != NULL) { |
coleenp@4037 | 1133 | if (!m->is_valid() || m->is_old()) { |
duke@435 | 1134 | return false; |
duke@435 | 1135 | } |
duke@435 | 1136 | } |
duke@435 | 1137 | } |
duke@435 | 1138 | return true; |
duke@435 | 1139 | } |
duke@435 | 1140 | |
duke@435 | 1141 | void klassVtable::dump_vtable() { |
duke@435 | 1142 | tty->print_cr("vtable dump --"); |
duke@435 | 1143 | for (int i = 0; i < length(); i++) { |
coleenp@4037 | 1144 | Method* m = unchecked_method_at(i); |
duke@435 | 1145 | if (m != NULL) { |
duke@435 | 1146 | tty->print(" (%5d) ", i); |
duke@435 | 1147 | m->access_flags().print_on(tty); |
duke@435 | 1148 | tty->print(" -- "); |
duke@435 | 1149 | m->print_name(tty); |
duke@435 | 1150 | tty->cr(); |
duke@435 | 1151 | } |
duke@435 | 1152 | } |
duke@435 | 1153 | } |
duke@435 | 1154 | |
coleenp@4037 | 1155 | bool klassItable::check_no_old_entries() { |
coleenp@4037 | 1156 | itableMethodEntry* ime = method_entry(0); |
coleenp@4037 | 1157 | for(int i = 0; i < _size_method_table; i++) { |
coleenp@4037 | 1158 | Method* m = ime->method(); |
coleenp@4037 | 1159 | if (m != NULL && (!m->is_valid() || m->is_old())) return false; |
coleenp@4037 | 1160 | ime++; |
coleenp@4037 | 1161 | } |
coleenp@4037 | 1162 | return true; |
coleenp@4037 | 1163 | } |
coleenp@4037 | 1164 | |
duke@435 | 1165 | int klassItable::_total_classes; // Total no. of classes with itables |
duke@435 | 1166 | long klassItable::_total_size; // Total no. of bytes used for itables |
duke@435 | 1167 | |
duke@435 | 1168 | void klassItable::print_statistics() { |
duke@435 | 1169 | tty->print_cr("itable statistics:"); |
duke@435 | 1170 | tty->print_cr("%6d classes with itables", _total_classes); |
duke@435 | 1171 | tty->print_cr("%6d K uses for itables (average by class: %d bytes)", _total_size / K, _total_size / _total_classes); |
duke@435 | 1172 | } |
duke@435 | 1173 | |
duke@435 | 1174 | #endif // PRODUCT |