1 /*
   2  * Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "classfile/javaClasses.hpp"
  27 #include "classfile/systemDictionary.hpp"
  28 #include "classfile/verifier.hpp"
  29 #include "classfile/vmSymbols.hpp"
  30 #include "compiler/compileBroker.hpp"
  31 #include "gc/shared/collectedHeap.inline.hpp"
  32 #include "gc/shared/specialized_oop_closures.hpp"
  33 #include "interpreter/oopMapCache.hpp"
  34 #include "interpreter/rewriter.hpp"
  35 #include "jvmtifiles/jvmti.h"
  36 #include "memory/heapInspection.hpp"
  37 #include "memory/iterator.inline.hpp"
  38 #include "memory/metadataFactory.hpp"
  39 #include "memory/oopFactory.hpp"
  40 #include "oops/fieldStreams.hpp"
  41 #include "oops/instanceClassLoaderKlass.hpp"
  42 #include "oops/instanceKlass.inline.hpp"
  43 #include "oops/instanceMirrorKlass.hpp"
  44 #include "oops/instanceOop.hpp"
  45 #include "oops/klass.inline.hpp"
  46 #include "oops/method.hpp"
  47 #include "oops/oop.inline.hpp"
  48 #include "oops/symbol.hpp"
  49 #include "prims/jvmtiExport.hpp"
  50 #include "prims/jvmtiRedefineClasses.hpp"
  51 #include "prims/jvmtiRedefineClassesTrace.hpp"
  52 #include "prims/jvmtiThreadState.hpp"
  53 #include "prims/methodComparator.hpp"
  54 #include "runtime/atomic.inline.hpp"
  55 #include "runtime/fieldDescriptor.hpp"
  56 #include "runtime/handles.inline.hpp"
  57 #include "runtime/javaCalls.hpp"
  58 #include "runtime/mutexLocker.hpp"
  59 #include "runtime/orderAccess.inline.hpp"
  60 #include "runtime/thread.inline.hpp"
  61 #include "services/classLoadingService.hpp"
  62 #include "services/threadService.hpp"
  63 #include "utilities/dtrace.hpp"
  64 #include "utilities/macros.hpp"
  65 #ifdef COMPILER1
  66 #include "c1/c1_Compiler.hpp"
  67 #endif
  68 
  69 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
  70 
  71 #ifdef DTRACE_ENABLED
  72 
  73 
  74 #define HOTSPOT_CLASS_INITIALIZATION_required HOTSPOT_CLASS_INITIALIZATION_REQUIRED
  75 #define HOTSPOT_CLASS_INITIALIZATION_recursive HOTSPOT_CLASS_INITIALIZATION_RECURSIVE
  76 #define HOTSPOT_CLASS_INITIALIZATION_concurrent HOTSPOT_CLASS_INITIALIZATION_CONCURRENT
  77 #define HOTSPOT_CLASS_INITIALIZATION_erroneous HOTSPOT_CLASS_INITIALIZATION_ERRONEOUS
  78 #define HOTSPOT_CLASS_INITIALIZATION_super__failed HOTSPOT_CLASS_INITIALIZATION_SUPER_FAILED
  79 #define HOTSPOT_CLASS_INITIALIZATION_clinit HOTSPOT_CLASS_INITIALIZATION_CLINIT
  80 #define HOTSPOT_CLASS_INITIALIZATION_error HOTSPOT_CLASS_INITIALIZATION_ERROR
  81 #define HOTSPOT_CLASS_INITIALIZATION_end HOTSPOT_CLASS_INITIALIZATION_END
  82 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type)          \
  83   {                                                              \
  84     char* data = NULL;                                           \
  85     int len = 0;                                                 \
  86     Symbol* name = (clss)->name();                               \
  87     if (name != NULL) {                                          \
  88       data = (char*)name->bytes();                               \
  89       len = name->utf8_length();                                 \
  90     }                                                            \
  91     HOTSPOT_CLASS_INITIALIZATION_##type(                         \
  92       data, len, (clss)->class_loader(), thread_type);           \
  93   }
  94 
  95 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \
  96   {                                                              \
  97     char* data = NULL;                                           \
  98     int len = 0;                                                 \
  99     Symbol* name = (clss)->name();                               \
 100     if (name != NULL) {                                          \
 101       data = (char*)name->bytes();                               \
 102       len = name->utf8_length();                                 \
 103     }                                                            \
 104     HOTSPOT_CLASS_INITIALIZATION_##type(                         \
 105       data, len, (clss)->class_loader(), thread_type, wait);     \
 106   }
 107 
 108 #else //  ndef DTRACE_ENABLED
 109 
 110 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type)
 111 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait)
 112 
 113 #endif //  ndef DTRACE_ENABLED
 114 
 115 volatile int InstanceKlass::_total_instanceKlass_count = 0;
 116 
 117 InstanceKlass* InstanceKlass::allocate_instance_klass(
 118                                               ClassLoaderData* loader_data,
 119                                               int vtable_len,
 120                                               int itable_len,
 121                                               int static_field_size,
 122                                               int nonstatic_oop_map_size,
 123                                               ReferenceType rt,
 124                                               AccessFlags access_flags,
 125                                               Symbol* name,
 126                                               Klass* super_klass,
 127                                               bool is_anonymous,
 128                                               TRAPS) {
 129 
 130   int size = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size,
 131                                  access_flags.is_interface(), is_anonymous);
 132 
 133   // Allocation
 134   InstanceKlass* ik;
 135   if (rt == REF_NONE) {
 136     if (name == vmSymbols::java_lang_Class()) {
 137       ik = new (loader_data, size, THREAD) InstanceMirrorKlass(
 138         vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
 139         access_flags, is_anonymous);
 140     } else if (name == vmSymbols::java_lang_ClassLoader() ||
 141           (SystemDictionary::ClassLoader_klass_loaded() &&
 142           super_klass != NULL &&
 143           super_klass->is_subtype_of(SystemDictionary::ClassLoader_klass()))) {
 144       ik = new (loader_data, size, THREAD) InstanceClassLoaderKlass(
 145         vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
 146         access_flags, is_anonymous);
 147     } else {
 148       // normal class
 149       ik = new (loader_data, size, THREAD) InstanceKlass(
 150         vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
 151         access_flags, is_anonymous);
 152     }
 153   } else {
 154     // reference klass
 155     ik = new (loader_data, size, THREAD) InstanceRefKlass(
 156         vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
 157         access_flags, is_anonymous);
 158   }
 159 
 160   // Check for pending exception before adding to the loader data and incrementing
 161   // class count.  Can get OOM here.
 162   if (HAS_PENDING_EXCEPTION) {
 163     return NULL;
 164   }
 165 
 166   // Add all classes to our internal class loader list here,
 167   // including classes in the bootstrap (NULL) class loader.
 168   loader_data->add_class(ik);
 169 
 170   Atomic::inc(&_total_instanceKlass_count);
 171   return ik;
 172 }
 173 
 174 
 175 // copy method ordering from resource area to Metaspace
 176 void InstanceKlass::copy_method_ordering(intArray* m, TRAPS) {
 177   if (m != NULL) {
 178     // allocate a new array and copy contents (memcpy?)
 179     _method_ordering = MetadataFactory::new_array<int>(class_loader_data(), m->length(), CHECK);
 180     for (int i = 0; i < m->length(); i++) {
 181       _method_ordering->at_put(i, m->at(i));
 182     }
 183   } else {
 184     _method_ordering = Universe::the_empty_int_array();
 185   }
 186 }
 187 
 188 // create a new array of vtable_indices for default methods
 189 Array<int>* InstanceKlass::create_new_default_vtable_indices(int len, TRAPS) {
 190   Array<int>* vtable_indices = MetadataFactory::new_array<int>(class_loader_data(), len, CHECK_NULL);
 191   assert(default_vtable_indices() == NULL, "only create once");
 192   set_default_vtable_indices(vtable_indices);
 193   return vtable_indices;
 194 }
 195 
 196 InstanceKlass::InstanceKlass(int vtable_len,
 197                              int itable_len,
 198                              int static_field_size,
 199                              int nonstatic_oop_map_size,
 200                              ReferenceType rt,
 201                              AccessFlags access_flags,
 202                              bool is_anonymous) {
 203   No_Safepoint_Verifier no_safepoint; // until k becomes parsable
 204 
 205   int iksize = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size,
 206                                    access_flags.is_interface(), is_anonymous);
 207 
 208   set_vtable_length(vtable_len);
 209   set_itable_length(itable_len);
 210   set_static_field_size(static_field_size);
 211   set_nonstatic_oop_map_size(nonstatic_oop_map_size);
 212   set_access_flags(access_flags);
 213   _misc_flags = 0;  // initialize to zero
 214   set_is_anonymous(is_anonymous);
 215   assert(size() == iksize, "wrong size for object");
 216 
 217   set_array_klasses(NULL);
 218   set_methods(NULL);
 219   set_method_ordering(NULL);
 220   set_default_methods(NULL);
 221   set_default_vtable_indices(NULL);
 222   set_local_interfaces(NULL);
 223   set_transitive_interfaces(NULL);
 224   init_implementor();
 225   set_fields(NULL, 0);
 226   set_constants(NULL);
 227   set_class_loader_data(NULL);
 228   set_source_file_name_index(0);
 229   set_source_debug_extension(NULL, 0);
 230   set_array_name(NULL);
 231   set_inner_classes(NULL);
 232   set_static_oop_field_count(0);
 233   set_nonstatic_field_size(0);
 234   set_is_marked_dependent(false);
 235   set_has_unloaded_dependent(false);
 236   set_init_state(InstanceKlass::allocated);
 237   set_init_thread(NULL);
 238   set_reference_type(rt);
 239   set_oop_map_cache(NULL);
 240   set_jni_ids(NULL);
 241   set_osr_nmethods_head(NULL);
 242   set_breakpoints(NULL);
 243   init_previous_versions();
 244   set_generic_signature_index(0);
 245   release_set_methods_jmethod_ids(NULL);
 246   set_annotations(NULL);
 247   set_jvmti_cached_class_field_map(NULL);
 248   set_initial_method_idnum(0);
 249   _dependencies = NULL;
 250   set_jvmti_cached_class_field_map(NULL);
 251   set_cached_class_file(NULL);
 252   set_initial_method_idnum(0);
 253   set_minor_version(0);
 254   set_major_version(0);
 255   NOT_PRODUCT(_verify_count = 0;)
 256 
 257   // initialize the non-header words to zero
 258   intptr_t* p = (intptr_t*)this;
 259   for (int index = InstanceKlass::header_size(); index < iksize; index++) {
 260     p[index] = NULL_WORD;
 261   }
 262 
 263   // Set temporary value until parseClassFile updates it with the real instance
 264   // size.
 265   set_layout_helper(Klass::instance_layout_helper(0, true));
 266 }
 267 
 268 
 269 void InstanceKlass::deallocate_methods(ClassLoaderData* loader_data,
 270                                        Array<Method*>* methods) {
 271   if (methods != NULL && methods != Universe::the_empty_method_array() &&
 272       !methods->is_shared()) {
 273     for (int i = 0; i < methods->length(); i++) {
 274       Method* method = methods->at(i);
 275       if (method == NULL) continue;  // maybe null if error processing
 276       // Only want to delete methods that are not executing for RedefineClasses.
 277       // The previous version will point to them so they're not totally dangling
 278       assert (!method->on_stack(), "shouldn't be called with methods on stack");
 279       MetadataFactory::free_metadata(loader_data, method);
 280     }
 281     MetadataFactory::free_array<Method*>(loader_data, methods);
 282   }
 283 }
 284 
 285 void InstanceKlass::deallocate_interfaces(ClassLoaderData* loader_data,
 286                                           Klass* super_klass,
 287                                           Array<Klass*>* local_interfaces,
 288                                           Array<Klass*>* transitive_interfaces) {
 289   // Only deallocate transitive interfaces if not empty, same as super class
 290   // or same as local interfaces.  See code in parseClassFile.
 291   Array<Klass*>* ti = transitive_interfaces;
 292   if (ti != Universe::the_empty_klass_array() && ti != local_interfaces) {
 293     // check that the interfaces don't come from super class
 294     Array<Klass*>* sti = (super_klass == NULL) ? NULL :
 295                     InstanceKlass::cast(super_klass)->transitive_interfaces();
 296     if (ti != sti && ti != NULL && !ti->is_shared()) {
 297       MetadataFactory::free_array<Klass*>(loader_data, ti);
 298     }
 299   }
 300 
 301   // local interfaces can be empty
 302   if (local_interfaces != Universe::the_empty_klass_array() &&
 303       local_interfaces != NULL && !local_interfaces->is_shared()) {
 304     MetadataFactory::free_array<Klass*>(loader_data, local_interfaces);
 305   }
 306 }
 307 
 308 // This function deallocates the metadata and C heap pointers that the
 309 // InstanceKlass points to.
 310 void InstanceKlass::deallocate_contents(ClassLoaderData* loader_data) {
 311 
 312   // Orphan the mirror first, CMS thinks it's still live.
 313   if (java_mirror() != NULL) {
 314     java_lang_Class::set_klass(java_mirror(), NULL);
 315   }
 316 
 317   // Need to take this class off the class loader data list.
 318   loader_data->remove_class(this);
 319 
 320   // The array_klass for this class is created later, after error handling.
 321   // For class redefinition, we keep the original class so this scratch class
 322   // doesn't have an array class.  Either way, assert that there is nothing
 323   // to deallocate.
 324   assert(array_klasses() == NULL, "array classes shouldn't be created for this class yet");
 325 
 326   // Release C heap allocated data that this might point to, which includes
 327   // reference counting symbol names.
 328   release_C_heap_structures();
 329 
 330   deallocate_methods(loader_data, methods());
 331   set_methods(NULL);
 332 
 333   if (method_ordering() != NULL &&
 334       method_ordering() != Universe::the_empty_int_array() &&
 335       !method_ordering()->is_shared()) {
 336     MetadataFactory::free_array<int>(loader_data, method_ordering());
 337   }
 338   set_method_ordering(NULL);
 339 
 340   // default methods can be empty
 341   if (default_methods() != NULL &&
 342       default_methods() != Universe::the_empty_method_array() &&
 343       !default_methods()->is_shared()) {
 344     MetadataFactory::free_array<Method*>(loader_data, default_methods());
 345   }
 346   // Do NOT deallocate the default methods, they are owned by superinterfaces.
 347   set_default_methods(NULL);
 348 
 349   // default methods vtable indices can be empty
 350   if (default_vtable_indices() != NULL &&
 351       !default_vtable_indices()->is_shared()) {
 352     MetadataFactory::free_array<int>(loader_data, default_vtable_indices());
 353   }
 354   set_default_vtable_indices(NULL);
 355 
 356 
 357   // This array is in Klass, but remove it with the InstanceKlass since
 358   // this place would be the only caller and it can share memory with transitive
 359   // interfaces.
 360   if (secondary_supers() != NULL &&
 361       secondary_supers() != Universe::the_empty_klass_array() &&
 362       secondary_supers() != transitive_interfaces() &&
 363       !secondary_supers()->is_shared()) {
 364     MetadataFactory::free_array<Klass*>(loader_data, secondary_supers());
 365   }
 366   set_secondary_supers(NULL);
 367 
 368   deallocate_interfaces(loader_data, super(), local_interfaces(), transitive_interfaces());
 369   set_transitive_interfaces(NULL);
 370   set_local_interfaces(NULL);
 371 
 372   if (fields() != NULL && !fields()->is_shared()) {
 373     MetadataFactory::free_array<jushort>(loader_data, fields());
 374   }
 375   set_fields(NULL, 0);
 376 
 377   // If a method from a redefined class is using this constant pool, don't
 378   // delete it, yet.  The new class's previous version will point to this.
 379   if (constants() != NULL) {
 380     assert (!constants()->on_stack(), "shouldn't be called if anything is onstack");
 381     if (!constants()->is_shared()) {
 382       MetadataFactory::free_metadata(loader_data, constants());
 383     }
 384     set_constants(NULL);
 385   }
 386 
 387   if (inner_classes() != NULL &&
 388       inner_classes() != Universe::the_empty_short_array() &&
 389       !inner_classes()->is_shared()) {
 390     MetadataFactory::free_array<jushort>(loader_data, inner_classes());
 391   }
 392   set_inner_classes(NULL);
 393 
 394   // We should deallocate the Annotations instance if it's not in shared spaces.
 395   if (annotations() != NULL && !annotations()->is_shared()) {
 396     MetadataFactory::free_metadata(loader_data, annotations());
 397   }
 398   set_annotations(NULL);
 399 }
 400 
 401 bool InstanceKlass::should_be_initialized() const {
 402   return !is_initialized();
 403 }
 404 
 405 klassVtable* InstanceKlass::vtable() const {
 406   return new klassVtable(this, start_of_vtable(), vtable_length() / vtableEntry::size());
 407 }
 408 
 409 klassItable* InstanceKlass::itable() const {
 410   return new klassItable(instanceKlassHandle(this));
 411 }
 412 
 413 void InstanceKlass::eager_initialize(Thread *thread) {
 414   if (!EagerInitialization) return;
 415 
 416   if (this->is_not_initialized()) {
 417     // abort if the the class has a class initializer
 418     if (this->class_initializer() != NULL) return;
 419 
 420     // abort if it is java.lang.Object (initialization is handled in genesis)
 421     Klass* super = this->super();
 422     if (super == NULL) return;
 423 
 424     // abort if the super class should be initialized
 425     if (!InstanceKlass::cast(super)->is_initialized()) return;
 426 
 427     // call body to expose the this pointer
 428     instanceKlassHandle this_k(thread, this);
 429     eager_initialize_impl(this_k);
 430   }
 431 }
 432 
 433 // JVMTI spec thinks there are signers and protection domain in the
 434 // instanceKlass.  These accessors pretend these fields are there.
 435 // The hprof specification also thinks these fields are in InstanceKlass.
 436 oop InstanceKlass::protection_domain() const {
 437   // return the protection_domain from the mirror
 438   return java_lang_Class::protection_domain(java_mirror());
 439 }
 440 
 441 // To remove these from requires an incompatible change and CCC request.
 442 objArrayOop InstanceKlass::signers() const {
 443   // return the signers from the mirror
 444   return java_lang_Class::signers(java_mirror());
 445 }
 446 
 447 oop InstanceKlass::init_lock() const {
 448   // return the init lock from the mirror
 449   oop lock = java_lang_Class::init_lock(java_mirror());
 450   // Prevent reordering with any access of initialization state
 451   OrderAccess::loadload();
 452   assert((oop)lock != NULL || !is_not_initialized(), // initialized or in_error state
 453          "only fully initialized state can have a null lock");
 454   return lock;
 455 }
 456 
 457 // Set the initialization lock to null so the object can be GC'ed.  Any racing
 458 // threads to get this lock will see a null lock and will not lock.
 459 // That's okay because they all check for initialized state after getting
 460 // the lock and return.
 461 void InstanceKlass::fence_and_clear_init_lock() {
 462   // make sure previous stores are all done, notably the init_state.
 463   OrderAccess::storestore();
 464   java_lang_Class::set_init_lock(java_mirror(), NULL);
 465   assert(!is_not_initialized(), "class must be initialized now");
 466 }
 467 
 468 void InstanceKlass::eager_initialize_impl(instanceKlassHandle this_k) {
 469   EXCEPTION_MARK;
 470   oop init_lock = this_k->init_lock();
 471   ObjectLocker ol(init_lock, THREAD, init_lock != NULL);
 472 
 473   // abort if someone beat us to the initialization
 474   if (!this_k->is_not_initialized()) return;  // note: not equivalent to is_initialized()
 475 
 476   ClassState old_state = this_k->init_state();
 477   link_class_impl(this_k, true, THREAD);
 478   if (HAS_PENDING_EXCEPTION) {
 479     CLEAR_PENDING_EXCEPTION;
 480     // Abort if linking the class throws an exception.
 481 
 482     // Use a test to avoid redundantly resetting the state if there's
 483     // no change.  Set_init_state() asserts that state changes make
 484     // progress, whereas here we might just be spinning in place.
 485     if( old_state != this_k->_init_state )
 486       this_k->set_init_state (old_state);
 487   } else {
 488     // linking successfull, mark class as initialized
 489     this_k->set_init_state (fully_initialized);
 490     this_k->fence_and_clear_init_lock();
 491     // trace
 492     if (TraceClassInitialization) {
 493       ResourceMark rm(THREAD);
 494       tty->print_cr("[Initialized %s without side effects]", this_k->external_name());
 495     }
 496   }
 497 }
 498 
 499 
 500 // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization
 501 // process. The step comments refers to the procedure described in that section.
 502 // Note: implementation moved to static method to expose the this pointer.
 503 void InstanceKlass::initialize(TRAPS) {
 504   if (this->should_be_initialized()) {
 505     HandleMark hm(THREAD);
 506     instanceKlassHandle this_k(THREAD, this);
 507     initialize_impl(this_k, CHECK);
 508     // Note: at this point the class may be initialized
 509     //       OR it may be in the state of being initialized
 510     //       in case of recursive initialization!
 511   } else {
 512     assert(is_initialized(), "sanity check");
 513   }
 514 }
 515 
 516 
 517 bool InstanceKlass::verify_code(
 518     instanceKlassHandle this_k, bool throw_verifyerror, TRAPS) {
 519   // 1) Verify the bytecodes
 520   Verifier::Mode mode =
 521     throw_verifyerror ? Verifier::ThrowException : Verifier::NoException;
 522   return Verifier::verify(this_k, mode, this_k->should_verify_class(), THREAD);
 523 }
 524 
 525 
 526 // Used exclusively by the shared spaces dump mechanism to prevent
 527 // classes mapped into the shared regions in new VMs from appearing linked.
 528 
 529 void InstanceKlass::unlink_class() {
 530   assert(is_linked(), "must be linked");
 531   _init_state = loaded;
 532 }
 533 
 534 void InstanceKlass::link_class(TRAPS) {
 535   assert(is_loaded(), "must be loaded");
 536   if (!is_linked()) {
 537     HandleMark hm(THREAD);
 538     instanceKlassHandle this_k(THREAD, this);
 539     link_class_impl(this_k, true, CHECK);
 540   }
 541 }
 542 
 543 // Called to verify that a class can link during initialization, without
 544 // throwing a VerifyError.
 545 bool InstanceKlass::link_class_or_fail(TRAPS) {
 546   assert(is_loaded(), "must be loaded");
 547   if (!is_linked()) {
 548     HandleMark hm(THREAD);
 549     instanceKlassHandle this_k(THREAD, this);
 550     link_class_impl(this_k, false, CHECK_false);
 551   }
 552   return is_linked();
 553 }
 554 
 555 bool InstanceKlass::link_class_impl(
 556     instanceKlassHandle this_k, bool throw_verifyerror, TRAPS) {
 557   // check for error state
 558   if (this_k->is_in_error_state()) {
 559     ResourceMark rm(THREAD);
 560     THROW_MSG_(vmSymbols::java_lang_NoClassDefFoundError(),
 561                this_k->external_name(), false);
 562   }
 563   // return if already verified
 564   if (this_k->is_linked()) {
 565     return true;
 566   }
 567 
 568   // Timing
 569   // timer handles recursion
 570   assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl");
 571   JavaThread* jt = (JavaThread*)THREAD;
 572 
 573   // link super class before linking this class
 574   instanceKlassHandle super(THREAD, this_k->super());
 575   if (super.not_null()) {
 576     if (super->is_interface()) {  // check if super class is an interface
 577       ResourceMark rm(THREAD);
 578       Exceptions::fthrow(
 579         THREAD_AND_LOCATION,
 580         vmSymbols::java_lang_IncompatibleClassChangeError(),
 581         "class %s has interface %s as super class",
 582         this_k->external_name(),
 583         super->external_name()
 584       );
 585       return false;
 586     }
 587 
 588     link_class_impl(super, throw_verifyerror, CHECK_false);
 589   }
 590 
 591   // link all interfaces implemented by this class before linking this class
 592   Array<Klass*>* interfaces = this_k->local_interfaces();
 593   int num_interfaces = interfaces->length();
 594   for (int index = 0; index < num_interfaces; index++) {
 595     HandleMark hm(THREAD);
 596     instanceKlassHandle ih(THREAD, interfaces->at(index));
 597     link_class_impl(ih, throw_verifyerror, CHECK_false);
 598   }
 599 
 600   // in case the class is linked in the process of linking its superclasses
 601   if (this_k->is_linked()) {
 602     return true;
 603   }
 604 
 605   // trace only the link time for this klass that includes
 606   // the verification time
 607   PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(),
 608                              ClassLoader::perf_class_link_selftime(),
 609                              ClassLoader::perf_classes_linked(),
 610                              jt->get_thread_stat()->perf_recursion_counts_addr(),
 611                              jt->get_thread_stat()->perf_timers_addr(),
 612                              PerfClassTraceTime::CLASS_LINK);
 613 
 614   // verification & rewriting
 615   {
 616     oop init_lock = this_k->init_lock();
 617     ObjectLocker ol(init_lock, THREAD, init_lock != NULL);
 618     // rewritten will have been set if loader constraint error found
 619     // on an earlier link attempt
 620     // don't verify or rewrite if already rewritten
 621 
 622     if (!this_k->is_linked()) {
 623       if (!this_k->is_rewritten()) {
 624         {
 625           bool verify_ok = verify_code(this_k, throw_verifyerror, THREAD);
 626           if (!verify_ok) {
 627             return false;
 628           }
 629         }
 630 
 631         // Just in case a side-effect of verify linked this class already
 632         // (which can sometimes happen since the verifier loads classes
 633         // using custom class loaders, which are free to initialize things)
 634         if (this_k->is_linked()) {
 635           return true;
 636         }
 637 
 638         // also sets rewritten
 639         this_k->rewrite_class(CHECK_false);
 640       }
 641 
 642       // relocate jsrs and link methods after they are all rewritten
 643       this_k->link_methods(CHECK_false);
 644 
 645       // Initialize the vtable and interface table after
 646       // methods have been rewritten since rewrite may
 647       // fabricate new Method*s.
 648       // also does loader constraint checking
 649       if (!this_k()->is_shared()) {
 650         ResourceMark rm(THREAD);
 651         this_k->vtable()->initialize_vtable(true, CHECK_false);
 652         this_k->itable()->initialize_itable(true, CHECK_false);
 653       }
 654 #ifdef ASSERT
 655       else {
 656         ResourceMark rm(THREAD);
 657         this_k->vtable()->verify(tty, true);
 658         // In case itable verification is ever added.
 659         // this_k->itable()->verify(tty, true);
 660       }
 661 #endif
 662       this_k->set_init_state(linked);
 663       if (JvmtiExport::should_post_class_prepare()) {
 664         Thread *thread = THREAD;
 665         assert(thread->is_Java_thread(), "thread->is_Java_thread()");
 666         JvmtiExport::post_class_prepare((JavaThread *) thread, this_k());
 667       }
 668     }
 669   }
 670   return true;
 671 }
 672 
 673 
 674 // Rewrite the byte codes of all of the methods of a class.
 675 // The rewriter must be called exactly once. Rewriting must happen after
 676 // verification but before the first method of the class is executed.
 677 void InstanceKlass::rewrite_class(TRAPS) {
 678   assert(is_loaded(), "must be loaded");
 679   instanceKlassHandle this_k(THREAD, this);
 680   if (this_k->is_rewritten()) {
 681     assert(this_k()->is_shared(), "rewriting an unshared class?");
 682     return;
 683   }
 684   Rewriter::rewrite(this_k, CHECK);
 685   this_k->set_rewritten();
 686 }
 687 
 688 // Now relocate and link method entry points after class is rewritten.
 689 // This is outside is_rewritten flag. In case of an exception, it can be
 690 // executed more than once.
 691 void InstanceKlass::link_methods(TRAPS) {
 692   int len = methods()->length();
 693   for (int i = len-1; i >= 0; i--) {
 694     methodHandle m(THREAD, methods()->at(i));
 695 
 696     // Set up method entry points for compiler and interpreter    .
 697     m->link_method(m, CHECK);
 698   }
 699 }
 700 
 701 // Eagerly initialize superinterfaces that declare default methods (concrete instance: any access)
 702 void InstanceKlass::initialize_super_interfaces(instanceKlassHandle this_k, TRAPS) {
 703   if (this_k->has_default_methods()) {
 704     for (int i = 0; i < this_k->local_interfaces()->length(); ++i) {
 705       Klass* iface = this_k->local_interfaces()->at(i);
 706       InstanceKlass* ik = InstanceKlass::cast(iface);
 707       if (ik->should_be_initialized()) {
 708         if (ik->has_default_methods()) {
 709           ik->initialize_super_interfaces(ik, THREAD);
 710         }
 711         // Only initialize() interfaces that "declare" concrete methods.
 712         // has_default_methods drives searching superinterfaces since it
 713         // means has_default_methods in its superinterface hierarchy
 714         if (!HAS_PENDING_EXCEPTION && ik->declares_default_methods()) {
 715           ik->initialize(THREAD);
 716         }
 717         if (HAS_PENDING_EXCEPTION) {
 718           Handle e(THREAD, PENDING_EXCEPTION);
 719           CLEAR_PENDING_EXCEPTION;
 720           {
 721             EXCEPTION_MARK;
 722             // Locks object, set state, and notify all waiting threads
 723             this_k->set_initialization_state_and_notify(
 724                 initialization_error, THREAD);
 725 
 726             // ignore any exception thrown, superclass initialization error is
 727             // thrown below
 728             CLEAR_PENDING_EXCEPTION;
 729           }
 730           THROW_OOP(e());
 731         }
 732       }
 733     }
 734   }
 735 }
 736 
 737 void InstanceKlass::initialize_impl(instanceKlassHandle this_k, TRAPS) {
 738   // Make sure klass is linked (verified) before initialization
 739   // A class could already be verified, since it has been reflected upon.
 740   this_k->link_class(CHECK);
 741 
 742   DTRACE_CLASSINIT_PROBE(required, InstanceKlass::cast(this_k()), -1);
 743 
 744   bool wait = false;
 745 
 746   // refer to the JVM book page 47 for description of steps
 747   // Step 1
 748   {
 749     oop init_lock = this_k->init_lock();
 750     ObjectLocker ol(init_lock, THREAD, init_lock != NULL);
 751 
 752     Thread *self = THREAD; // it's passed the current thread
 753 
 754     // Step 2
 755     // If we were to use wait() instead of waitInterruptibly() then
 756     // we might end up throwing IE from link/symbol resolution sites
 757     // that aren't expected to throw.  This would wreak havoc.  See 6320309.
 758     while(this_k->is_being_initialized() && !this_k->is_reentrant_initialization(self)) {
 759         wait = true;
 760       ol.waitUninterruptibly(CHECK);
 761     }
 762 
 763     // Step 3
 764     if (this_k->is_being_initialized() && this_k->is_reentrant_initialization(self)) {
 765       DTRACE_CLASSINIT_PROBE_WAIT(recursive, InstanceKlass::cast(this_k()), -1,wait);
 766       return;
 767     }
 768 
 769     // Step 4
 770     if (this_k->is_initialized()) {
 771       DTRACE_CLASSINIT_PROBE_WAIT(concurrent, InstanceKlass::cast(this_k()), -1,wait);
 772       return;
 773     }
 774 
 775     // Step 5
 776     if (this_k->is_in_error_state()) {
 777       DTRACE_CLASSINIT_PROBE_WAIT(erroneous, InstanceKlass::cast(this_k()), -1,wait);
 778       ResourceMark rm(THREAD);
 779       const char* desc = "Could not initialize class ";
 780       const char* className = this_k->external_name();
 781       size_t msglen = strlen(desc) + strlen(className) + 1;
 782       char* message = NEW_RESOURCE_ARRAY(char, msglen);
 783       if (NULL == message) {
 784         // Out of memory: can't create detailed error message
 785         THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className);
 786       } else {
 787         jio_snprintf(message, msglen, "%s%s", desc, className);
 788         THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message);
 789       }
 790     }
 791 
 792     // Step 6
 793     this_k->set_init_state(being_initialized);
 794     this_k->set_init_thread(self);
 795   }
 796 
 797   // Step 7
 798   Klass* super_klass = this_k->super();
 799   if (super_klass != NULL && !this_k->is_interface() && super_klass->should_be_initialized()) {
 800     super_klass->initialize(THREAD);
 801 
 802     if (HAS_PENDING_EXCEPTION) {
 803       Handle e(THREAD, PENDING_EXCEPTION);
 804       CLEAR_PENDING_EXCEPTION;
 805       {
 806         EXCEPTION_MARK;
 807         this_k->set_initialization_state_and_notify(initialization_error, THREAD); // Locks object, set state, and notify all waiting threads
 808         CLEAR_PENDING_EXCEPTION;   // ignore any exception thrown, superclass initialization error is thrown below
 809       }
 810       DTRACE_CLASSINIT_PROBE_WAIT(super__failed, InstanceKlass::cast(this_k()), -1,wait);
 811       THROW_OOP(e());
 812     }
 813   }
 814 
 815   // Recursively initialize any superinterfaces that declare default methods
 816   // Only need to recurse if has_default_methods which includes declaring and
 817   // inheriting default methods
 818   if (this_k->has_default_methods()) {
 819     this_k->initialize_super_interfaces(this_k, CHECK);
 820   }
 821 
 822   // Step 8
 823   {
 824     assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl");
 825     JavaThread* jt = (JavaThread*)THREAD;
 826     DTRACE_CLASSINIT_PROBE_WAIT(clinit, InstanceKlass::cast(this_k()), -1,wait);
 827     // Timer includes any side effects of class initialization (resolution,
 828     // etc), but not recursive entry into call_class_initializer().
 829     PerfClassTraceTime timer(ClassLoader::perf_class_init_time(),
 830                              ClassLoader::perf_class_init_selftime(),
 831                              ClassLoader::perf_classes_inited(),
 832                              jt->get_thread_stat()->perf_recursion_counts_addr(),
 833                              jt->get_thread_stat()->perf_timers_addr(),
 834                              PerfClassTraceTime::CLASS_CLINIT);
 835     this_k->call_class_initializer(THREAD);
 836   }
 837 
 838   // Step 9
 839   if (!HAS_PENDING_EXCEPTION) {
 840     this_k->set_initialization_state_and_notify(fully_initialized, CHECK);
 841     { ResourceMark rm(THREAD);
 842       debug_only(this_k->vtable()->verify(tty, true);)
 843     }
 844   }
 845   else {
 846     // Step 10 and 11
 847     Handle e(THREAD, PENDING_EXCEPTION);
 848     CLEAR_PENDING_EXCEPTION;
 849     // JVMTI has already reported the pending exception
 850     // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError
 851     JvmtiExport::clear_detected_exception((JavaThread*)THREAD);
 852     {
 853       EXCEPTION_MARK;
 854       this_k->set_initialization_state_and_notify(initialization_error, THREAD);
 855       CLEAR_PENDING_EXCEPTION;   // ignore any exception thrown, class initialization error is thrown below
 856       // JVMTI has already reported the pending exception
 857       // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError
 858       JvmtiExport::clear_detected_exception((JavaThread*)THREAD);
 859     }
 860     DTRACE_CLASSINIT_PROBE_WAIT(error, InstanceKlass::cast(this_k()), -1,wait);
 861     if (e->is_a(SystemDictionary::Error_klass())) {
 862       THROW_OOP(e());
 863     } else {
 864       JavaCallArguments args(e);
 865       THROW_ARG(vmSymbols::java_lang_ExceptionInInitializerError(),
 866                 vmSymbols::throwable_void_signature(),
 867                 &args);
 868     }
 869   }
 870   DTRACE_CLASSINIT_PROBE_WAIT(end, InstanceKlass::cast(this_k()), -1,wait);
 871 }
 872 
 873 
 874 // Note: implementation moved to static method to expose the this pointer.
 875 void InstanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) {
 876   instanceKlassHandle kh(THREAD, this);
 877   set_initialization_state_and_notify_impl(kh, state, CHECK);
 878 }
 879 
 880 void InstanceKlass::set_initialization_state_and_notify_impl(instanceKlassHandle this_k, ClassState state, TRAPS) {
 881   oop init_lock = this_k->init_lock();
 882   ObjectLocker ol(init_lock, THREAD, init_lock != NULL);
 883   this_k->set_init_state(state);
 884   this_k->fence_and_clear_init_lock();
 885   ol.notify_all(CHECK);
 886 }
 887 
 888 // The embedded _implementor field can only record one implementor.
 889 // When there are more than one implementors, the _implementor field
 890 // is set to the interface Klass* itself. Following are the possible
 891 // values for the _implementor field:
 892 //   NULL                  - no implementor
 893 //   implementor Klass*    - one implementor
 894 //   self                  - more than one implementor
 895 //
 896 // The _implementor field only exists for interfaces.
 897 void InstanceKlass::add_implementor(Klass* k) {
 898   assert(Compile_lock->owned_by_self(), "");
 899   assert(is_interface(), "not interface");
 900   // Filter out my subinterfaces.
 901   // (Note: Interfaces are never on the subklass list.)
 902   if (InstanceKlass::cast(k)->is_interface()) return;
 903 
 904   // Filter out subclasses whose supers already implement me.
 905   // (Note: CHA must walk subclasses of direct implementors
 906   // in order to locate indirect implementors.)
 907   Klass* sk = InstanceKlass::cast(k)->super();
 908   if (sk != NULL && InstanceKlass::cast(sk)->implements_interface(this))
 909     // We only need to check one immediate superclass, since the
 910     // implements_interface query looks at transitive_interfaces.
 911     // Any supers of the super have the same (or fewer) transitive_interfaces.
 912     return;
 913 
 914   Klass* ik = implementor();
 915   if (ik == NULL) {
 916     set_implementor(k);
 917   } else if (ik != this) {
 918     // There is already an implementor. Use itself as an indicator of
 919     // more than one implementors.
 920     set_implementor(this);
 921   }
 922 
 923   // The implementor also implements the transitive_interfaces
 924   for (int index = 0; index < local_interfaces()->length(); index++) {
 925     InstanceKlass::cast(local_interfaces()->at(index))->add_implementor(k);
 926   }
 927 }
 928 
 929 void InstanceKlass::init_implementor() {
 930   if (is_interface()) {
 931     set_implementor(NULL);
 932   }
 933 }
 934 
 935 
 936 void InstanceKlass::process_interfaces(Thread *thread) {
 937   // link this class into the implementors list of every interface it implements
 938   for (int i = local_interfaces()->length() - 1; i >= 0; i--) {
 939     assert(local_interfaces()->at(i)->is_klass(), "must be a klass");
 940     InstanceKlass* interf = InstanceKlass::cast(local_interfaces()->at(i));
 941     assert(interf->is_interface(), "expected interface");
 942     interf->add_implementor(this);
 943   }
 944 }
 945 
 946 bool InstanceKlass::can_be_primary_super_slow() const {
 947   if (is_interface())
 948     return false;
 949   else
 950     return Klass::can_be_primary_super_slow();
 951 }
 952 
 953 GrowableArray<Klass*>* InstanceKlass::compute_secondary_supers(int num_extra_slots) {
 954   // The secondaries are the implemented interfaces.
 955   InstanceKlass* ik = InstanceKlass::cast(this);
 956   Array<Klass*>* interfaces = ik->transitive_interfaces();
 957   int num_secondaries = num_extra_slots + interfaces->length();
 958   if (num_secondaries == 0) {
 959     // Must share this for correct bootstrapping!
 960     set_secondary_supers(Universe::the_empty_klass_array());
 961     return NULL;
 962   } else if (num_extra_slots == 0) {
 963     // The secondary super list is exactly the same as the transitive interfaces.
 964     // Redefine classes has to be careful not to delete this!
 965     set_secondary_supers(interfaces);
 966     return NULL;
 967   } else {
 968     // Copy transitive interfaces to a temporary growable array to be constructed
 969     // into the secondary super list with extra slots.
 970     GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(interfaces->length());
 971     for (int i = 0; i < interfaces->length(); i++) {
 972       secondaries->push(interfaces->at(i));
 973     }
 974     return secondaries;
 975   }
 976 }
 977 
 978 bool InstanceKlass::compute_is_subtype_of(Klass* k) {
 979   if (k->is_interface()) {
 980     return implements_interface(k);
 981   } else {
 982     return Klass::compute_is_subtype_of(k);
 983   }
 984 }
 985 
 986 bool InstanceKlass::implements_interface(Klass* k) const {
 987   if (this == k) return true;
 988   assert(k->is_interface(), "should be an interface class");
 989   for (int i = 0; i < transitive_interfaces()->length(); i++) {
 990     if (transitive_interfaces()->at(i) == k) {
 991       return true;
 992     }
 993   }
 994   return false;
 995 }
 996 
 997 bool InstanceKlass::is_same_or_direct_interface(Klass *k) const {
 998   // Verify direct super interface
 999   if (this == k) return true;
1000   assert(k->is_interface(), "should be an interface class");
1001   for (int i = 0; i < local_interfaces()->length(); i++) {
1002     if (local_interfaces()->at(i) == k) {
1003       return true;
1004     }
1005   }
1006   return false;
1007 }
1008 
1009 objArrayOop InstanceKlass::allocate_objArray(int n, int length, TRAPS) {
1010   if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
1011   if (length > arrayOopDesc::max_array_length(T_OBJECT)) {
1012     report_java_out_of_memory("Requested array size exceeds VM limit");
1013     JvmtiExport::post_array_size_exhausted();
1014     THROW_OOP_0(Universe::out_of_memory_error_array_size());
1015   }
1016   int size = objArrayOopDesc::object_size(length);
1017   Klass* ak = array_klass(n, CHECK_NULL);
1018   KlassHandle h_ak (THREAD, ak);
1019   objArrayOop o =
1020     (objArrayOop)CollectedHeap::array_allocate(h_ak, size, length, CHECK_NULL);
1021   return o;
1022 }
1023 
1024 instanceOop InstanceKlass::register_finalizer(instanceOop i, TRAPS) {
1025   if (TraceFinalizerRegistration) {
1026     tty->print("Registered ");
1027     i->print_value_on(tty);
1028     tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", (address)i);
1029   }
1030   instanceHandle h_i(THREAD, i);
1031   // Pass the handle as argument, JavaCalls::call expects oop as jobjects
1032   JavaValue result(T_VOID);
1033   JavaCallArguments args(h_i);
1034   methodHandle mh (THREAD, Universe::finalizer_register_method());
1035   JavaCalls::call(&result, mh, &args, CHECK_NULL);
1036   return h_i();
1037 }
1038 
1039 instanceOop InstanceKlass::allocate_instance(TRAPS) {
1040   bool has_finalizer_flag = has_finalizer(); // Query before possible GC
1041   int size = size_helper();  // Query before forming handle.
1042 
1043   KlassHandle h_k(THREAD, this);
1044 
1045   instanceOop i;
1046 
1047   i = (instanceOop)CollectedHeap::obj_allocate(h_k, size, CHECK_NULL);
1048   if (has_finalizer_flag && !RegisterFinalizersAtInit) {
1049     i = register_finalizer(i, CHECK_NULL);
1050   }
1051   return i;
1052 }
1053 
1054 void InstanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) {
1055   if (is_interface() || is_abstract()) {
1056     ResourceMark rm(THREAD);
1057     THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError()
1058               : vmSymbols::java_lang_InstantiationException(), external_name());
1059   }
1060   if (this == SystemDictionary::Class_klass()) {
1061     ResourceMark rm(THREAD);
1062     THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError()
1063               : vmSymbols::java_lang_IllegalAccessException(), external_name());
1064   }
1065 }
1066 
1067 Klass* InstanceKlass::array_klass_impl(bool or_null, int n, TRAPS) {
1068   instanceKlassHandle this_k(THREAD, this);
1069   return array_klass_impl(this_k, or_null, n, THREAD);
1070 }
1071 
1072 Klass* InstanceKlass::array_klass_impl(instanceKlassHandle this_k, bool or_null, int n, TRAPS) {
1073   if (this_k->array_klasses() == NULL) {
1074     if (or_null) return NULL;
1075 
1076     ResourceMark rm;
1077     JavaThread *jt = (JavaThread *)THREAD;
1078     {
1079       // Atomic creation of array_klasses
1080       MutexLocker mc(Compile_lock, THREAD);   // for vtables
1081       MutexLocker ma(MultiArray_lock, THREAD);
1082 
1083       // Check if update has already taken place
1084       if (this_k->array_klasses() == NULL) {
1085         Klass*    k = ObjArrayKlass::allocate_objArray_klass(this_k->class_loader_data(), 1, this_k, CHECK_NULL);
1086         this_k->set_array_klasses(k);
1087       }
1088     }
1089   }
1090   // _this will always be set at this point
1091   ObjArrayKlass* oak = (ObjArrayKlass*)this_k->array_klasses();
1092   if (or_null) {
1093     return oak->array_klass_or_null(n);
1094   }
1095   return oak->array_klass(n, THREAD);
1096 }
1097 
1098 Klass* InstanceKlass::array_klass_impl(bool or_null, TRAPS) {
1099   return array_klass_impl(or_null, 1, THREAD);
1100 }
1101 
1102 void InstanceKlass::call_class_initializer(TRAPS) {
1103   instanceKlassHandle ik (THREAD, this);
1104   call_class_initializer_impl(ik, THREAD);
1105 }
1106 
1107 static int call_class_initializer_impl_counter = 0;   // for debugging
1108 
1109 Method* InstanceKlass::class_initializer() {
1110   Method* clinit = find_method(
1111       vmSymbols::class_initializer_name(), vmSymbols::void_method_signature());
1112   if (clinit != NULL && clinit->has_valid_initializer_flags()) {
1113     return clinit;
1114   }
1115   return NULL;
1116 }
1117 
1118 void InstanceKlass::call_class_initializer_impl(instanceKlassHandle this_k, TRAPS) {
1119   if (ReplayCompiles &&
1120       (ReplaySuppressInitializers == 1 ||
1121        ReplaySuppressInitializers >= 2 && this_k->class_loader() != NULL)) {
1122     // Hide the existence of the initializer for the purpose of replaying the compile
1123     return;
1124   }
1125 
1126   methodHandle h_method(THREAD, this_k->class_initializer());
1127   assert(!this_k->is_initialized(), "we cannot initialize twice");
1128   if (TraceClassInitialization) {
1129     tty->print("%d Initializing ", call_class_initializer_impl_counter++);
1130     this_k->name()->print_value();
1131     tty->print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", (address)this_k());
1132   }
1133   if (h_method() != NULL) {
1134     JavaCallArguments args; // No arguments
1135     JavaValue result(T_VOID);
1136     JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args)
1137   }
1138 }
1139 
1140 
1141 void InstanceKlass::mask_for(methodHandle method, int bci,
1142   InterpreterOopMap* entry_for) {
1143   // Dirty read, then double-check under a lock.
1144   if (_oop_map_cache == NULL) {
1145     // Otherwise, allocate a new one.
1146     MutexLocker x(OopMapCacheAlloc_lock);
1147     // First time use. Allocate a cache in C heap
1148     if (_oop_map_cache == NULL) {
1149       // Release stores from OopMapCache constructor before assignment
1150       // to _oop_map_cache. C++ compilers on ppc do not emit the
1151       // required memory barrier only because of the volatile
1152       // qualifier of _oop_map_cache.
1153       OrderAccess::release_store_ptr(&_oop_map_cache, new OopMapCache());
1154     }
1155   }
1156   // _oop_map_cache is constant after init; lookup below does is own locking.
1157   _oop_map_cache->lookup(method, bci, entry_for);
1158 }
1159 
1160 
1161 bool InstanceKlass::find_local_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1162   for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1163     Symbol* f_name = fs.name();
1164     Symbol* f_sig  = fs.signature();
1165     if (f_name == name && f_sig == sig) {
1166       fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index());
1167       return true;
1168     }
1169   }
1170   return false;
1171 }
1172 
1173 
1174 Klass* InstanceKlass::find_interface_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1175   const int n = local_interfaces()->length();
1176   for (int i = 0; i < n; i++) {
1177     Klass* intf1 = local_interfaces()->at(i);
1178     assert(intf1->is_interface(), "just checking type");
1179     // search for field in current interface
1180     if (InstanceKlass::cast(intf1)->find_local_field(name, sig, fd)) {
1181       assert(fd->is_static(), "interface field must be static");
1182       return intf1;
1183     }
1184     // search for field in direct superinterfaces
1185     Klass* intf2 = InstanceKlass::cast(intf1)->find_interface_field(name, sig, fd);
1186     if (intf2 != NULL) return intf2;
1187   }
1188   // otherwise field lookup fails
1189   return NULL;
1190 }
1191 
1192 
1193 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1194   // search order according to newest JVM spec (5.4.3.2, p.167).
1195   // 1) search for field in current klass
1196   if (find_local_field(name, sig, fd)) {
1197     return const_cast<InstanceKlass*>(this);
1198   }
1199   // 2) search for field recursively in direct superinterfaces
1200   { Klass* intf = find_interface_field(name, sig, fd);
1201     if (intf != NULL) return intf;
1202   }
1203   // 3) apply field lookup recursively if superclass exists
1204   { Klass* supr = super();
1205     if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, fd);
1206   }
1207   // 4) otherwise field lookup fails
1208   return NULL;
1209 }
1210 
1211 
1212 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, bool is_static, fieldDescriptor* fd) const {
1213   // search order according to newest JVM spec (5.4.3.2, p.167).
1214   // 1) search for field in current klass
1215   if (find_local_field(name, sig, fd)) {
1216     if (fd->is_static() == is_static) return const_cast<InstanceKlass*>(this);
1217   }
1218   // 2) search for field recursively in direct superinterfaces
1219   if (is_static) {
1220     Klass* intf = find_interface_field(name, sig, fd);
1221     if (intf != NULL) return intf;
1222   }
1223   // 3) apply field lookup recursively if superclass exists
1224   { Klass* supr = super();
1225     if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, is_static, fd);
1226   }
1227   // 4) otherwise field lookup fails
1228   return NULL;
1229 }
1230 
1231 
1232 bool InstanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1233   for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1234     if (fs.offset() == offset) {
1235       fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index());
1236       if (fd->is_static() == is_static) return true;
1237     }
1238   }
1239   return false;
1240 }
1241 
1242 
1243 bool InstanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1244   Klass* klass = const_cast<InstanceKlass*>(this);
1245   while (klass != NULL) {
1246     if (InstanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) {
1247       return true;
1248     }
1249     klass = klass->super();
1250   }
1251   return false;
1252 }
1253 
1254 
1255 void InstanceKlass::methods_do(void f(Method* method)) {
1256   // Methods aren't stable until they are loaded.  This can be read outside
1257   // a lock through the ClassLoaderData for profiling
1258   if (!is_loaded()) {
1259     return;
1260   }
1261 
1262   int len = methods()->length();
1263   for (int index = 0; index < len; index++) {
1264     Method* m = methods()->at(index);
1265     assert(m->is_method(), "must be method");
1266     f(m);
1267   }
1268 }
1269 
1270 
1271 void InstanceKlass::do_local_static_fields(FieldClosure* cl) {
1272   for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1273     if (fs.access_flags().is_static()) {
1274       fieldDescriptor& fd = fs.field_descriptor();
1275       cl->do_field(&fd);
1276     }
1277   }
1278 }
1279 
1280 
1281 void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, Handle, TRAPS), Handle mirror, TRAPS) {
1282   instanceKlassHandle h_this(THREAD, this);
1283   do_local_static_fields_impl(h_this, f, mirror, CHECK);
1284 }
1285 
1286 
1287 void InstanceKlass::do_local_static_fields_impl(instanceKlassHandle this_k,
1288                              void f(fieldDescriptor* fd, Handle, TRAPS), Handle mirror, TRAPS) {
1289   for (JavaFieldStream fs(this_k()); !fs.done(); fs.next()) {
1290     if (fs.access_flags().is_static()) {
1291       fieldDescriptor& fd = fs.field_descriptor();
1292       f(&fd, mirror, CHECK);
1293     }
1294   }
1295 }
1296 
1297 
1298 static int compare_fields_by_offset(int* a, int* b) {
1299   return a[0] - b[0];
1300 }
1301 
1302 void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) {
1303   InstanceKlass* super = superklass();
1304   if (super != NULL) {
1305     super->do_nonstatic_fields(cl);
1306   }
1307   fieldDescriptor fd;
1308   int length = java_fields_count();
1309   // In DebugInfo nonstatic fields are sorted by offset.
1310   int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass);
1311   int j = 0;
1312   for (int i = 0; i < length; i += 1) {
1313     fd.reinitialize(this, i);
1314     if (!fd.is_static()) {
1315       fields_sorted[j + 0] = fd.offset();
1316       fields_sorted[j + 1] = i;
1317       j += 2;
1318     }
1319   }
1320   if (j > 0) {
1321     length = j;
1322     // _sort_Fn is defined in growableArray.hpp.
1323     qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset);
1324     for (int i = 0; i < length; i += 2) {
1325       fd.reinitialize(this, fields_sorted[i + 1]);
1326       assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields");
1327       cl->do_field(&fd);
1328     }
1329   }
1330   FREE_C_HEAP_ARRAY(int, fields_sorted);
1331 }
1332 
1333 
1334 void InstanceKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) {
1335   if (array_klasses() != NULL)
1336     ArrayKlass::cast(array_klasses())->array_klasses_do(f, THREAD);
1337 }
1338 
1339 void InstanceKlass::array_klasses_do(void f(Klass* k)) {
1340   if (array_klasses() != NULL)
1341     ArrayKlass::cast(array_klasses())->array_klasses_do(f);
1342 }
1343 
1344 #ifdef ASSERT
1345 static int linear_search(Array<Method*>* methods, Symbol* name, Symbol* signature) {
1346   int len = methods->length();
1347   for (int index = 0; index < len; index++) {
1348     Method* m = methods->at(index);
1349     assert(m->is_method(), "must be method");
1350     if (m->signature() == signature && m->name() == name) {
1351        return index;
1352     }
1353   }
1354   return -1;
1355 }
1356 #endif
1357 
1358 static int binary_search(Array<Method*>* methods, Symbol* name) {
1359   int len = methods->length();
1360   // methods are sorted, so do binary search
1361   int l = 0;
1362   int h = len - 1;
1363   while (l <= h) {
1364     int mid = (l + h) >> 1;
1365     Method* m = methods->at(mid);
1366     assert(m->is_method(), "must be method");
1367     int res = m->name()->fast_compare(name);
1368     if (res == 0) {
1369       return mid;
1370     } else if (res < 0) {
1371       l = mid + 1;
1372     } else {
1373       h = mid - 1;
1374     }
1375   }
1376   return -1;
1377 }
1378 
1379 // find_method looks up the name/signature in the local methods array
1380 Method* InstanceKlass::find_method(Symbol* name, Symbol* signature) const {
1381   return find_method_impl(name, signature, find_overpass, find_static);
1382 }
1383 
1384 Method* InstanceKlass::find_method_impl(Symbol* name, Symbol* signature,
1385                                         OverpassLookupMode overpass_mode, StaticLookupMode static_mode) const {
1386   return InstanceKlass::find_method_impl(methods(), name, signature, overpass_mode, static_mode);
1387 }
1388 
1389 // find_instance_method looks up the name/signature in the local methods array
1390 // and skips over static methods
1391 Method* InstanceKlass::find_instance_method(
1392     Array<Method*>* methods, Symbol* name, Symbol* signature) {
1393   Method* meth = InstanceKlass::find_method_impl(methods, name, signature,
1394                                                  find_overpass, skip_static);
1395   assert(((meth == NULL) || !meth->is_static()), "find_instance_method should have skipped statics");
1396   return meth;
1397 }
1398 
1399 // find_instance_method looks up the name/signature in the local methods array
1400 // and skips over static methods
1401 Method* InstanceKlass::find_instance_method(Symbol* name, Symbol* signature) {
1402     return InstanceKlass::find_instance_method(methods(), name, signature);
1403 }
1404 
1405 // find_method looks up the name/signature in the local methods array
1406 Method* InstanceKlass::find_method(
1407     Array<Method*>* methods, Symbol* name, Symbol* signature) {
1408   return InstanceKlass::find_method_impl(methods, name, signature, find_overpass, find_static);
1409 }
1410 
1411 Method* InstanceKlass::find_method_impl(
1412     Array<Method*>* methods, Symbol* name, Symbol* signature, OverpassLookupMode overpass_mode, StaticLookupMode static_mode) {
1413   int hit = find_method_index(methods, name, signature, overpass_mode, static_mode);
1414   return hit >= 0 ? methods->at(hit): NULL;
1415 }
1416 
1417 bool InstanceKlass::method_matches(Method* m, Symbol* signature, bool skipping_overpass, bool skipping_static) {
1418     return (m->signature() == signature) &&
1419             (!skipping_overpass || !m->is_overpass()) &&
1420             (!skipping_static || !m->is_static());
1421 }
1422 
1423 // Used directly for default_methods to find the index into the
1424 // default_vtable_indices, and indirectly by find_method
1425 // find_method_index looks in the local methods array to return the index
1426 // of the matching name/signature. If, overpass methods are being ignored,
1427 // the search continues to find a potential non-overpass match.  This capability
1428 // is important during method resolution to prefer a static method, for example,
1429 // over an overpass method.
1430 int InstanceKlass::find_method_index(
1431     Array<Method*>* methods, Symbol* name, Symbol* signature, OverpassLookupMode overpass_mode, StaticLookupMode static_mode) {
1432   bool skipping_overpass = (overpass_mode == skip_overpass);
1433   bool skipping_static = (static_mode == skip_static);
1434   int hit = binary_search(methods, name);
1435   if (hit != -1) {
1436     Method* m = methods->at(hit);
1437 
1438     // Do linear search to find matching signature.  First, quick check
1439     // for common case, ignoring overpasses if requested.
1440     if (method_matches(m, signature, skipping_overpass, skipping_static)) return hit;
1441 
1442     // search downwards through overloaded methods
1443     int i;
1444     for (i = hit - 1; i >= 0; --i) {
1445         Method* m = methods->at(i);
1446         assert(m->is_method(), "must be method");
1447         if (m->name() != name) break;
1448         if (method_matches(m, signature, skipping_overpass, skipping_static)) return i;
1449     }
1450     // search upwards
1451     for (i = hit + 1; i < methods->length(); ++i) {
1452         Method* m = methods->at(i);
1453         assert(m->is_method(), "must be method");
1454         if (m->name() != name) break;
1455         if (method_matches(m, signature, skipping_overpass, skipping_static)) return i;
1456     }
1457     // not found
1458 #ifdef ASSERT
1459     int index = (skipping_overpass || skipping_static) ? -1 : linear_search(methods, name, signature);
1460     assert(index == -1, err_msg("binary search should have found entry %d", index));
1461 #endif
1462   }
1463   return -1;
1464 }
1465 int InstanceKlass::find_method_by_name(Symbol* name, int* end) {
1466   return find_method_by_name(methods(), name, end);
1467 }
1468 
1469 int InstanceKlass::find_method_by_name(
1470     Array<Method*>* methods, Symbol* name, int* end_ptr) {
1471   assert(end_ptr != NULL, "just checking");
1472   int start = binary_search(methods, name);
1473   int end = start + 1;
1474   if (start != -1) {
1475     while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start;
1476     while (end < methods->length() && (methods->at(end))->name() == name) ++end;
1477     *end_ptr = end;
1478     return start;
1479   }
1480   return -1;
1481 }
1482 
1483 // uncached_lookup_method searches both the local class methods array and all
1484 // superclasses methods arrays, skipping any overpass methods in superclasses.
1485 Method* InstanceKlass::uncached_lookup_method(Symbol* name, Symbol* signature, OverpassLookupMode overpass_mode) const {
1486   OverpassLookupMode overpass_local_mode = overpass_mode;
1487   Klass* klass = const_cast<InstanceKlass*>(this);
1488   while (klass != NULL) {
1489     Method* method = InstanceKlass::cast(klass)->find_method_impl(name, signature, overpass_local_mode, find_static);
1490     if (method != NULL) {
1491       return method;
1492     }
1493     klass = InstanceKlass::cast(klass)->super();
1494     overpass_local_mode = skip_overpass;   // Always ignore overpass methods in superclasses
1495   }
1496   return NULL;
1497 }
1498 
1499 #ifdef ASSERT
1500 // search through class hierarchy and return true if this class or
1501 // one of the superclasses was redefined
1502 bool InstanceKlass::has_redefined_this_or_super() const {
1503   const InstanceKlass* klass = this;
1504   while (klass != NULL) {
1505     if (klass->has_been_redefined()) {
1506       return true;
1507     }
1508     klass = InstanceKlass::cast(klass->super());
1509   }
1510   return false;
1511 }
1512 #endif
1513 
1514 // lookup a method in the default methods list then in all transitive interfaces
1515 // Do NOT return private or static methods
1516 Method* InstanceKlass::lookup_method_in_ordered_interfaces(Symbol* name,
1517                                                          Symbol* signature) const {
1518   Method* m = NULL;
1519   if (default_methods() != NULL) {
1520     m = find_method(default_methods(), name, signature);
1521   }
1522   // Look up interfaces
1523   if (m == NULL) {
1524     m = lookup_method_in_all_interfaces(name, signature, find_defaults);
1525   }
1526   return m;
1527 }
1528 
1529 // lookup a method in all the interfaces that this class implements
1530 // Do NOT return private or static methods, new in JDK8 which are not externally visible
1531 // They should only be found in the initial InterfaceMethodRef
1532 Method* InstanceKlass::lookup_method_in_all_interfaces(Symbol* name,
1533                                                        Symbol* signature,
1534                                                        DefaultsLookupMode defaults_mode) const {
1535   Array<Klass*>* all_ifs = transitive_interfaces();
1536   int num_ifs = all_ifs->length();
1537   InstanceKlass *ik = NULL;
1538   for (int i = 0; i < num_ifs; i++) {
1539     ik = InstanceKlass::cast(all_ifs->at(i));
1540     Method* m = ik->lookup_method(name, signature);
1541     if (m != NULL && m->is_public() && !m->is_static() &&
1542         ((defaults_mode != skip_defaults) || !m->is_default_method())) {
1543       return m;
1544     }
1545   }
1546   return NULL;
1547 }
1548 
1549 /* jni_id_for_impl for jfieldIds only */
1550 JNIid* InstanceKlass::jni_id_for_impl(instanceKlassHandle this_k, int offset) {
1551   MutexLocker ml(JfieldIdCreation_lock);
1552   // Retry lookup after we got the lock
1553   JNIid* probe = this_k->jni_ids() == NULL ? NULL : this_k->jni_ids()->find(offset);
1554   if (probe == NULL) {
1555     // Slow case, allocate new static field identifier
1556     probe = new JNIid(this_k(), offset, this_k->jni_ids());
1557     this_k->set_jni_ids(probe);
1558   }
1559   return probe;
1560 }
1561 
1562 
1563 /* jni_id_for for jfieldIds only */
1564 JNIid* InstanceKlass::jni_id_for(int offset) {
1565   JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
1566   if (probe == NULL) {
1567     probe = jni_id_for_impl(this, offset);
1568   }
1569   return probe;
1570 }
1571 
1572 u2 InstanceKlass::enclosing_method_data(int offset) {
1573   Array<jushort>* inner_class_list = inner_classes();
1574   if (inner_class_list == NULL) {
1575     return 0;
1576   }
1577   int length = inner_class_list->length();
1578   if (length % inner_class_next_offset == 0) {
1579     return 0;
1580   } else {
1581     int index = length - enclosing_method_attribute_size;
1582     assert(offset < enclosing_method_attribute_size, "invalid offset");
1583     return inner_class_list->at(index + offset);
1584   }
1585 }
1586 
1587 void InstanceKlass::set_enclosing_method_indices(u2 class_index,
1588                                                  u2 method_index) {
1589   Array<jushort>* inner_class_list = inner_classes();
1590   assert (inner_class_list != NULL, "_inner_classes list is not set up");
1591   int length = inner_class_list->length();
1592   if (length % inner_class_next_offset == enclosing_method_attribute_size) {
1593     int index = length - enclosing_method_attribute_size;
1594     inner_class_list->at_put(
1595       index + enclosing_method_class_index_offset, class_index);
1596     inner_class_list->at_put(
1597       index + enclosing_method_method_index_offset, method_index);
1598   }
1599 }
1600 
1601 // Lookup or create a jmethodID.
1602 // This code is called by the VMThread and JavaThreads so the
1603 // locking has to be done very carefully to avoid deadlocks
1604 // and/or other cache consistency problems.
1605 //
1606 jmethodID InstanceKlass::get_jmethod_id(instanceKlassHandle ik_h, methodHandle method_h) {
1607   size_t idnum = (size_t)method_h->method_idnum();
1608   jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire();
1609   size_t length = 0;
1610   jmethodID id = NULL;
1611 
1612   // We use a double-check locking idiom here because this cache is
1613   // performance sensitive. In the normal system, this cache only
1614   // transitions from NULL to non-NULL which is safe because we use
1615   // release_set_methods_jmethod_ids() to advertise the new cache.
1616   // A partially constructed cache should never be seen by a racing
1617   // thread. We also use release_store_ptr() to save a new jmethodID
1618   // in the cache so a partially constructed jmethodID should never be
1619   // seen either. Cache reads of existing jmethodIDs proceed without a
1620   // lock, but cache writes of a new jmethodID requires uniqueness and
1621   // creation of the cache itself requires no leaks so a lock is
1622   // generally acquired in those two cases.
1623   //
1624   // If the RedefineClasses() API has been used, then this cache can
1625   // grow and we'll have transitions from non-NULL to bigger non-NULL.
1626   // Cache creation requires no leaks and we require safety between all
1627   // cache accesses and freeing of the old cache so a lock is generally
1628   // acquired when the RedefineClasses() API has been used.
1629 
1630   if (jmeths != NULL) {
1631     // the cache already exists
1632     if (!ik_h->idnum_can_increment()) {
1633       // the cache can't grow so we can just get the current values
1634       get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1635     } else {
1636       // cache can grow so we have to be more careful
1637       if (Threads::number_of_threads() == 0 ||
1638           SafepointSynchronize::is_at_safepoint()) {
1639         // we're single threaded or at a safepoint - no locking needed
1640         get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1641       } else {
1642         MutexLocker ml(JmethodIdCreation_lock);
1643         get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1644       }
1645     }
1646   }
1647   // implied else:
1648   // we need to allocate a cache so default length and id values are good
1649 
1650   if (jmeths == NULL ||   // no cache yet
1651       length <= idnum ||  // cache is too short
1652       id == NULL) {       // cache doesn't contain entry
1653 
1654     // This function can be called by the VMThread so we have to do all
1655     // things that might block on a safepoint before grabbing the lock.
1656     // Otherwise, we can deadlock with the VMThread or have a cache
1657     // consistency issue. These vars keep track of what we might have
1658     // to free after the lock is dropped.
1659     jmethodID  to_dealloc_id     = NULL;
1660     jmethodID* to_dealloc_jmeths = NULL;
1661 
1662     // may not allocate new_jmeths or use it if we allocate it
1663     jmethodID* new_jmeths = NULL;
1664     if (length <= idnum) {
1665       // allocate a new cache that might be used
1666       size_t size = MAX2(idnum+1, (size_t)ik_h->idnum_allocated_count());
1667       new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1, mtClass);
1668       memset(new_jmeths, 0, (size+1)*sizeof(jmethodID));
1669       // cache size is stored in element[0], other elements offset by one
1670       new_jmeths[0] = (jmethodID)size;
1671     }
1672 
1673     // allocate a new jmethodID that might be used
1674     jmethodID new_id = NULL;
1675     if (method_h->is_old() && !method_h->is_obsolete()) {
1676       // The method passed in is old (but not obsolete), we need to use the current version
1677       Method* current_method = ik_h->method_with_idnum((int)idnum);
1678       assert(current_method != NULL, "old and but not obsolete, so should exist");
1679       new_id = Method::make_jmethod_id(ik_h->class_loader_data(), current_method);
1680     } else {
1681       // It is the current version of the method or an obsolete method,
1682       // use the version passed in
1683       new_id = Method::make_jmethod_id(ik_h->class_loader_data(), method_h());
1684     }
1685 
1686     if (Threads::number_of_threads() == 0 ||
1687         SafepointSynchronize::is_at_safepoint()) {
1688       // we're single threaded or at a safepoint - no locking needed
1689       id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths,
1690                                           &to_dealloc_id, &to_dealloc_jmeths);
1691     } else {
1692       MutexLocker ml(JmethodIdCreation_lock);
1693       id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths,
1694                                           &to_dealloc_id, &to_dealloc_jmeths);
1695     }
1696 
1697     // The lock has been dropped so we can free resources.
1698     // Free up either the old cache or the new cache if we allocated one.
1699     if (to_dealloc_jmeths != NULL) {
1700       FreeHeap(to_dealloc_jmeths);
1701     }
1702     // free up the new ID since it wasn't needed
1703     if (to_dealloc_id != NULL) {
1704       Method::destroy_jmethod_id(ik_h->class_loader_data(), to_dealloc_id);
1705     }
1706   }
1707   return id;
1708 }
1709 
1710 // Figure out how many jmethodIDs haven't been allocated, and make
1711 // sure space for them is pre-allocated.  This makes getting all
1712 // method ids much, much faster with classes with more than 8
1713 // methods, and has a *substantial* effect on performance with jvmti
1714 // code that loads all jmethodIDs for all classes.
1715 void InstanceKlass::ensure_space_for_methodids(int start_offset) {
1716   int new_jmeths = 0;
1717   int length = methods()->length();
1718   for (int index = start_offset; index < length; index++) {
1719     Method* m = methods()->at(index);
1720     jmethodID id = m->find_jmethod_id_or_null();
1721     if (id == NULL) {
1722       new_jmeths++;
1723     }
1724   }
1725   if (new_jmeths != 0) {
1726     Method::ensure_jmethod_ids(class_loader_data(), new_jmeths);
1727   }
1728 }
1729 
1730 // Common code to fetch the jmethodID from the cache or update the
1731 // cache with the new jmethodID. This function should never do anything
1732 // that causes the caller to go to a safepoint or we can deadlock with
1733 // the VMThread or have cache consistency issues.
1734 //
1735 jmethodID InstanceKlass::get_jmethod_id_fetch_or_update(
1736             instanceKlassHandle ik_h, size_t idnum, jmethodID new_id,
1737             jmethodID* new_jmeths, jmethodID* to_dealloc_id_p,
1738             jmethodID** to_dealloc_jmeths_p) {
1739   assert(new_id != NULL, "sanity check");
1740   assert(to_dealloc_id_p != NULL, "sanity check");
1741   assert(to_dealloc_jmeths_p != NULL, "sanity check");
1742   assert(Threads::number_of_threads() == 0 ||
1743          SafepointSynchronize::is_at_safepoint() ||
1744          JmethodIdCreation_lock->owned_by_self(), "sanity check");
1745 
1746   // reacquire the cache - we are locked, single threaded or at a safepoint
1747   jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire();
1748   jmethodID  id     = NULL;
1749   size_t     length = 0;
1750 
1751   if (jmeths == NULL ||                         // no cache yet
1752       (length = (size_t)jmeths[0]) <= idnum) {  // cache is too short
1753     if (jmeths != NULL) {
1754       // copy any existing entries from the old cache
1755       for (size_t index = 0; index < length; index++) {
1756         new_jmeths[index+1] = jmeths[index+1];
1757       }
1758       *to_dealloc_jmeths_p = jmeths;  // save old cache for later delete
1759     }
1760     ik_h->release_set_methods_jmethod_ids(jmeths = new_jmeths);
1761   } else {
1762     // fetch jmethodID (if any) from the existing cache
1763     id = jmeths[idnum+1];
1764     *to_dealloc_jmeths_p = new_jmeths;  // save new cache for later delete
1765   }
1766   if (id == NULL) {
1767     // No matching jmethodID in the existing cache or we have a new
1768     // cache or we just grew the cache. This cache write is done here
1769     // by the first thread to win the foot race because a jmethodID
1770     // needs to be unique once it is generally available.
1771     id = new_id;
1772 
1773     // The jmethodID cache can be read while unlocked so we have to
1774     // make sure the new jmethodID is complete before installing it
1775     // in the cache.
1776     OrderAccess::release_store_ptr(&jmeths[idnum+1], id);
1777   } else {
1778     *to_dealloc_id_p = new_id; // save new id for later delete
1779   }
1780   return id;
1781 }
1782 
1783 
1784 // Common code to get the jmethodID cache length and the jmethodID
1785 // value at index idnum if there is one.
1786 //
1787 void InstanceKlass::get_jmethod_id_length_value(jmethodID* cache,
1788        size_t idnum, size_t *length_p, jmethodID* id_p) {
1789   assert(cache != NULL, "sanity check");
1790   assert(length_p != NULL, "sanity check");
1791   assert(id_p != NULL, "sanity check");
1792 
1793   // cache size is stored in element[0], other elements offset by one
1794   *length_p = (size_t)cache[0];
1795   if (*length_p <= idnum) {  // cache is too short
1796     *id_p = NULL;
1797   } else {
1798     *id_p = cache[idnum+1];  // fetch jmethodID (if any)
1799   }
1800 }
1801 
1802 
1803 // Lookup a jmethodID, NULL if not found.  Do no blocking, no allocations, no handles
1804 jmethodID InstanceKlass::jmethod_id_or_null(Method* method) {
1805   size_t idnum = (size_t)method->method_idnum();
1806   jmethodID* jmeths = methods_jmethod_ids_acquire();
1807   size_t length;                                // length assigned as debugging crumb
1808   jmethodID id = NULL;
1809   if (jmeths != NULL &&                         // If there is a cache
1810       (length = (size_t)jmeths[0]) > idnum) {   // and if it is long enough,
1811     id = jmeths[idnum+1];                       // Look up the id (may be NULL)
1812   }
1813   return id;
1814 }
1815 
1816 int nmethodBucket::decrement() {
1817   return Atomic::add(-1, (volatile int *)&_count);
1818 }
1819 
1820 //
1821 // Walk the list of dependent nmethods searching for nmethods which
1822 // are dependent on the changes that were passed in and mark them for
1823 // deoptimization.  Returns the number of nmethods found.
1824 //
1825 int nmethodBucket::mark_dependent_nmethods(nmethodBucket* deps, DepChange& changes) {
1826   assert_locked_or_safepoint(CodeCache_lock);
1827   int found = 0;
1828   for (nmethodBucket* b = deps; b != NULL; b = b->next()) {
1829     nmethod* nm = b->get_nmethod();
1830     // since dependencies aren't removed until an nmethod becomes a zombie,
1831     // the dependency list may contain nmethods which aren't alive.
1832     if (b->count() > 0 && nm->is_alive() && !nm->is_marked_for_deoptimization() && nm->check_dependency_on(changes)) {
1833       if (TraceDependencies) {
1834         ResourceMark rm;
1835         tty->print_cr("Marked for deoptimization");
1836         changes.print();
1837         nm->print();
1838         nm->print_dependencies();
1839       }
1840       nm->mark_for_deoptimization();
1841       found++;
1842     }
1843   }

1844   return found;
1845 }
1846 
1847 //
1848 // Add an nmethodBucket to the list of dependencies for this nmethod.
1849 // It's possible that an nmethod has multiple dependencies on this klass
1850 // so a count is kept for each bucket to guarantee that creation and
1851 // deletion of dependencies is consistent. Returns new head of the list.
1852 //
1853 nmethodBucket* nmethodBucket::add_dependent_nmethod(nmethodBucket* deps, nmethod* nm) {
1854   assert_locked_or_safepoint(CodeCache_lock);
1855   for (nmethodBucket* b = deps; b != NULL; b = b->next()) {
1856     if (nm == b->get_nmethod()) {
1857       b->increment();
1858       return deps;
1859     }
1860   }
1861   return new nmethodBucket(nm, deps);
1862 }
1863 
1864 //
1865 // Decrement count of the nmethod in the dependency list and remove
1866 // the bucket completely when the count goes to 0.  This method must
1867 // find a corresponding bucket otherwise there's a bug in the
1868 // recording of dependencies. Returns true if the bucket is ready for reclamation.
1869 //
1870 bool nmethodBucket::remove_dependent_nmethod(nmethodBucket* deps, nmethod* nm) {
1871   assert_locked_or_safepoint(CodeCache_lock);
1872 
1873   for (nmethodBucket* b = deps; b != NULL; b = b->next()) {
1874     if (nm == b->get_nmethod()) {
1875       int val = b->decrement();
1876       guarantee(val >= 0, err_msg("Underflow: %d", val));

1877       return (val == 0);
1878     }
1879   }
1880 #ifdef ASSERT
1881   tty->print_raw_cr("### can't find dependent nmethod");
1882   nm->print();
1883 #endif // ASSERT
1884   ShouldNotReachHere();
1885   return false;
1886 }
1887 
1888 //
1889 // Reclaim all unused buckets. Returns new head of the list.
1890 //
1891 nmethodBucket* nmethodBucket::clean_dependent_nmethods(nmethodBucket* deps) {
1892   nmethodBucket* first = deps;
1893   nmethodBucket* last = NULL;
1894   nmethodBucket* b = first;
1895 
1896   while (b != NULL) {
1897     assert(b->count() >= 0, err_msg("bucket count: %d", b->count()));
1898     nmethodBucket* next = b->next();
1899     if (b->count() == 0) {
1900       if (last == NULL) {
1901         first = next;
1902       } else {
1903         last->set_next(next);
1904       }
1905       delete b;
1906       // last stays the same.
1907     } else {
1908       last = b;
1909     }
1910     b = next;
1911   }
1912   return first;
1913 }
1914 
1915 #ifndef PRODUCT
1916 void nmethodBucket::print_dependent_nmethods(nmethodBucket* deps, bool verbose) {







1917   int idx = 0;
1918   for (nmethodBucket* b = deps; b != NULL; b = b->next()) {
1919     nmethod* nm = b->get_nmethod();
1920     tty->print("[%d] count=%d { ", idx++, b->count());
1921     if (!verbose) {
1922       nm->print_on(tty, "nmethod");
1923       tty->print_cr(" } ");
1924     } else {
1925       nm->print();
1926       nm->print_dependencies();
1927       tty->print_cr("--- } ");
1928     }
1929   }
1930 }
1931 
1932 bool nmethodBucket::is_dependent_nmethod(nmethodBucket* deps, nmethod* nm) {
1933   for (nmethodBucket* b = deps; b != NULL; b = b->next()) {
1934     if (nm == b->get_nmethod()) {
1935 #ifdef ASSERT
1936       int count = b->count();
1937       assert(count >= 0, err_msg("count shouldn't be negative: %d", count));
1938 #endif
1939       return true;
1940     }
1941   }
1942   return false;
1943 }
1944 #endif //PRODUCT
1945 















































































































































1946 int InstanceKlass::mark_dependent_nmethods(DepChange& changes) {
1947   assert_locked_or_safepoint(CodeCache_lock);
1948   return nmethodBucket::mark_dependent_nmethods(_dependencies, changes);
1949 }
1950 
1951 void InstanceKlass::clean_dependent_nmethods() {
1952   assert_locked_or_safepoint(CodeCache_lock);
1953 
1954   if (has_unloaded_dependent()) {
1955     _dependencies = nmethodBucket::clean_dependent_nmethods(_dependencies);
1956     set_has_unloaded_dependent(false);
1957   }
1958 #ifdef ASSERT
1959   else {
1960     // Verification
1961     for (nmethodBucket* b = _dependencies; b != NULL; b = b->next()) {
1962       assert(b->count() >= 0, err_msg("bucket count: %d", b->count()));
1963       assert(b->count() != 0, "empty buckets need to be cleaned");
1964     }
1965   }
1966 #endif
1967 }
1968 
1969 void InstanceKlass::add_dependent_nmethod(nmethod* nm) {
1970   assert_locked_or_safepoint(CodeCache_lock);
1971   _dependencies = nmethodBucket::add_dependent_nmethod(_dependencies, nm);
1972 }
1973 
1974 void InstanceKlass::remove_dependent_nmethod(nmethod* nm) {
1975   assert_locked_or_safepoint(CodeCache_lock);
1976 
1977   if (nmethodBucket::remove_dependent_nmethod(_dependencies, nm)) {
1978     set_has_unloaded_dependent(true);
1979   }
1980 }
1981 
1982 #ifndef PRODUCT
1983 void InstanceKlass::print_dependent_nmethods(bool verbose) {
1984   nmethodBucket::print_dependent_nmethods(_dependencies, verbose);
1985 }
1986 
1987 bool InstanceKlass::is_dependent_nmethod(nmethod* nm) {
1988   return nmethodBucket::is_dependent_nmethod(_dependencies, nm);
1989 }
1990 #endif //PRODUCT
1991 
1992 void InstanceKlass::clean_implementors_list(BoolObjectClosure* is_alive) {
1993   assert(class_loader_data()->is_alive(is_alive), "this klass should be live");
1994   if (is_interface()) {
1995     if (ClassUnloading) {
1996       Klass* impl = implementor();
1997       if (impl != NULL) {
1998         if (!impl->is_loader_alive(is_alive)) {
1999           // remove this guy
2000           Klass** klass = adr_implementor();
2001           assert(klass != NULL, "null klass");
2002           if (klass != NULL) {
2003             *klass = NULL;
2004           }
2005         }
2006       }
2007     }
2008   }
2009 }
2010 
2011 void InstanceKlass::clean_method_data(BoolObjectClosure* is_alive) {
2012   for (int m = 0; m < methods()->length(); m++) {
2013     MethodData* mdo = methods()->at(m)->method_data();
2014     if (mdo != NULL) {
2015       mdo->clean_method_data(is_alive);
2016     }
2017   }
2018 }
2019 
2020 
2021 static void remove_unshareable_in_class(Klass* k) {
2022   // remove klass's unshareable info
2023   k->remove_unshareable_info();
2024 }
2025 
2026 void InstanceKlass::remove_unshareable_info() {
2027   Klass::remove_unshareable_info();
2028   // Unlink the class
2029   if (is_linked()) {
2030     unlink_class();
2031   }
2032   init_implementor();
2033 
2034   constants()->remove_unshareable_info();
2035 
2036   for (int i = 0; i < methods()->length(); i++) {
2037     Method* m = methods()->at(i);
2038     m->remove_unshareable_info();
2039   }
2040 
2041   // do array classes also.
2042   array_klasses_do(remove_unshareable_in_class);
2043 }
2044 
2045 static void restore_unshareable_in_class(Klass* k, TRAPS) {
2046   // Array classes have null protection domain.
2047   // --> see ArrayKlass::complete_create_array_klass()
2048   k->restore_unshareable_info(ClassLoaderData::the_null_class_loader_data(), Handle(), CHECK);
2049 }
2050 
2051 void InstanceKlass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) {
2052   Klass::restore_unshareable_info(loader_data, protection_domain, CHECK);
2053   instanceKlassHandle ik(THREAD, this);
2054 
2055   Array<Method*>* methods = ik->methods();
2056   int num_methods = methods->length();
2057   for (int index2 = 0; index2 < num_methods; ++index2) {
2058     methodHandle m(THREAD, methods->at(index2));
2059     m->restore_unshareable_info(CHECK);
2060   }
2061   if (JvmtiExport::has_redefined_a_class()) {
2062     // Reinitialize vtable because RedefineClasses may have changed some
2063     // entries in this vtable for super classes so the CDS vtable might
2064     // point to old or obsolete entries.  RedefineClasses doesn't fix up
2065     // vtables in the shared system dictionary, only the main one.
2066     // It also redefines the itable too so fix that too.
2067     ResourceMark rm(THREAD);
2068     ik->vtable()->initialize_vtable(false, CHECK);
2069     ik->itable()->initialize_itable(false, CHECK);
2070   }
2071 
2072   // restore constant pool resolved references
2073   ik->constants()->restore_unshareable_info(CHECK);
2074 
2075   ik->array_klasses_do(restore_unshareable_in_class, CHECK);
2076 }
2077 
2078 // returns true IFF is_in_error_state() has been changed as a result of this call.
2079 bool InstanceKlass::check_sharing_error_state() {
2080   assert(DumpSharedSpaces, "should only be called during dumping");
2081   bool old_state = is_in_error_state();
2082 
2083   if (!is_in_error_state()) {
2084     bool bad = false;
2085     for (InstanceKlass* sup = java_super(); sup; sup = sup->java_super()) {
2086       if (sup->is_in_error_state()) {
2087         bad = true;
2088         break;
2089       }
2090     }
2091     if (!bad) {
2092       Array<Klass*>* interfaces = transitive_interfaces();
2093       for (int i = 0; i < interfaces->length(); i++) {
2094         Klass* iface = interfaces->at(i);
2095         if (InstanceKlass::cast(iface)->is_in_error_state()) {
2096           bad = true;
2097           break;
2098         }
2099       }
2100     }
2101 
2102     if (bad) {
2103       set_in_error_state();
2104     }
2105   }
2106 
2107   return (old_state != is_in_error_state());
2108 }
2109 
2110 static void clear_all_breakpoints(Method* m) {
2111   m->clear_all_breakpoints();
2112 }
2113 
2114 
2115 void InstanceKlass::notify_unload_class(InstanceKlass* ik) {
2116   // notify the debugger
2117   if (JvmtiExport::should_post_class_unload()) {
2118     JvmtiExport::post_class_unload(ik);
2119   }
2120 
2121   // notify ClassLoadingService of class unload
2122   ClassLoadingService::notify_class_unloaded(ik);
2123 }
2124 
2125 void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) {
2126   // Clean up C heap
2127   ik->release_C_heap_structures();
2128   ik->constants()->release_C_heap_structures();
2129 }
2130 
2131 void InstanceKlass::release_C_heap_structures() {
2132 
2133   // Can't release the constant pool here because the constant pool can be
2134   // deallocated separately from the InstanceKlass for default methods and
2135   // redefine classes.
2136 
2137   // Deallocate oop map cache
2138   if (_oop_map_cache != NULL) {
2139     delete _oop_map_cache;
2140     _oop_map_cache = NULL;
2141   }
2142 
2143   // Deallocate JNI identifiers for jfieldIDs
2144   JNIid::deallocate(jni_ids());
2145   set_jni_ids(NULL);
2146 
2147   jmethodID* jmeths = methods_jmethod_ids_acquire();
2148   if (jmeths != (jmethodID*)NULL) {
2149     release_set_methods_jmethod_ids(NULL);
2150     FreeHeap(jmeths);
2151   }
2152 
2153   // Deallocate MemberNameTable
2154   {
2155     Mutex* lock_or_null = SafepointSynchronize::is_at_safepoint() ? NULL : MemberNameTable_lock;
2156     MutexLockerEx ml(lock_or_null, Mutex::_no_safepoint_check_flag);
2157     MemberNameTable* mnt = member_names();
2158     if (mnt != NULL) {
2159       delete mnt;
2160       set_member_names(NULL);
2161     }
2162   }
2163 
2164   // release dependencies
2165   nmethodBucket* b = _dependencies;

2166   _dependencies = NULL;
2167   while (b != NULL) {
2168     nmethodBucket* next = b->next();
2169     delete b;
2170     b = next;
2171   }
2172 
2173   // Deallocate breakpoint records
2174   if (breakpoints() != 0x0) {
2175     methods_do(clear_all_breakpoints);
2176     assert(breakpoints() == 0x0, "should have cleared breakpoints");
2177   }
2178 
2179   // deallocate the cached class file
2180   if (_cached_class_file != NULL) {
2181     os::free(_cached_class_file);
2182     _cached_class_file = NULL;
2183   }
2184 
2185   // Decrement symbol reference counts associated with the unloaded class.
2186   if (_name != NULL) _name->decrement_refcount();
2187   // unreference array name derived from this class name (arrays of an unloaded
2188   // class can't be referenced anymore).
2189   if (_array_name != NULL)  _array_name->decrement_refcount();
2190   if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension);
2191 
2192   assert(_total_instanceKlass_count >= 1, "Sanity check");
2193   Atomic::dec(&_total_instanceKlass_count);
2194 }
2195 
2196 void InstanceKlass::set_source_debug_extension(char* array, int length) {
2197   if (array == NULL) {
2198     _source_debug_extension = NULL;
2199   } else {
2200     // Adding one to the attribute length in order to store a null terminator
2201     // character could cause an overflow because the attribute length is
2202     // already coded with an u4 in the classfile, but in practice, it's
2203     // unlikely to happen.
2204     assert((length+1) > length, "Overflow checking");
2205     char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass);
2206     for (int i = 0; i < length; i++) {
2207       sde[i] = array[i];
2208     }
2209     sde[length] = '\0';
2210     _source_debug_extension = sde;
2211   }
2212 }
2213 
2214 address InstanceKlass::static_field_addr(int offset) {
2215   return (address)(offset + InstanceMirrorKlass::offset_of_static_fields() + cast_from_oop<intptr_t>(java_mirror()));
2216 }
2217 
2218 
2219 const char* InstanceKlass::signature_name() const {
2220   int hash_len = 0;
2221   char hash_buf[40];
2222 
2223   // If this is an anonymous class, append a hash to make the name unique
2224   if (is_anonymous()) {
2225     intptr_t hash = (java_mirror() != NULL) ? java_mirror()->identity_hash() : 0;
2226     jio_snprintf(hash_buf, sizeof(hash_buf), "/" UINTX_FORMAT, (uintx)hash);
2227     hash_len = (int)strlen(hash_buf);
2228   }
2229 
2230   // Get the internal name as a c string
2231   const char* src = (const char*) (name()->as_C_string());
2232   const int src_length = (int)strlen(src);
2233 
2234   char* dest = NEW_RESOURCE_ARRAY(char, src_length + hash_len + 3);
2235 
2236   // Add L as type indicator
2237   int dest_index = 0;
2238   dest[dest_index++] = 'L';
2239 
2240   // Add the actual class name
2241   for (int src_index = 0; src_index < src_length; ) {
2242     dest[dest_index++] = src[src_index++];
2243   }
2244 
2245   // If we have a hash, append it
2246   for (int hash_index = 0; hash_index < hash_len; ) {
2247     dest[dest_index++] = hash_buf[hash_index++];
2248   }
2249 
2250   // Add the semicolon and the NULL
2251   dest[dest_index++] = ';';
2252   dest[dest_index] = '\0';
2253   return dest;
2254 }
2255 
2256 // different verisons of is_same_class_package
2257 bool InstanceKlass::is_same_class_package(Klass* class2) {
2258   Klass* class1 = this;
2259   oop classloader1 = InstanceKlass::cast(class1)->class_loader();
2260   Symbol* classname1 = class1->name();
2261 
2262   if (class2->oop_is_objArray()) {
2263     class2 = ObjArrayKlass::cast(class2)->bottom_klass();
2264   }
2265   oop classloader2;
2266   if (class2->oop_is_instance()) {
2267     classloader2 = InstanceKlass::cast(class2)->class_loader();
2268   } else {
2269     assert(class2->oop_is_typeArray(), "should be type array");
2270     classloader2 = NULL;
2271   }
2272   Symbol* classname2 = class2->name();
2273 
2274   return InstanceKlass::is_same_class_package(classloader1, classname1,
2275                                               classloader2, classname2);
2276 }
2277 
2278 bool InstanceKlass::is_same_class_package(oop classloader2, Symbol* classname2) {
2279   Klass* class1 = this;
2280   oop classloader1 = InstanceKlass::cast(class1)->class_loader();
2281   Symbol* classname1 = class1->name();
2282 
2283   return InstanceKlass::is_same_class_package(classloader1, classname1,
2284                                               classloader2, classname2);
2285 }
2286 
2287 // return true if two classes are in the same package, classloader
2288 // and classname information is enough to determine a class's package
2289 bool InstanceKlass::is_same_class_package(oop class_loader1, Symbol* class_name1,
2290                                           oop class_loader2, Symbol* class_name2) {
2291   if (class_loader1 != class_loader2) {
2292     return false;
2293   } else if (class_name1 == class_name2) {
2294     return true;                // skip painful bytewise comparison
2295   } else {
2296     ResourceMark rm;
2297 
2298     // The Symbol*'s are in UTF8 encoding. Since we only need to check explicitly
2299     // for ASCII characters ('/', 'L', '['), we can keep them in UTF8 encoding.
2300     // Otherwise, we just compare jbyte values between the strings.
2301     const jbyte *name1 = class_name1->base();
2302     const jbyte *name2 = class_name2->base();
2303 
2304     const jbyte *last_slash1 = UTF8::strrchr(name1, class_name1->utf8_length(), '/');
2305     const jbyte *last_slash2 = UTF8::strrchr(name2, class_name2->utf8_length(), '/');
2306 
2307     if ((last_slash1 == NULL) || (last_slash2 == NULL)) {
2308       // One of the two doesn't have a package.  Only return true
2309       // if the other one also doesn't have a package.
2310       return last_slash1 == last_slash2;
2311     } else {
2312       // Skip over '['s
2313       if (*name1 == '[') {
2314         do {
2315           name1++;
2316         } while (*name1 == '[');
2317         if (*name1 != 'L') {
2318           // Something is terribly wrong.  Shouldn't be here.
2319           return false;
2320         }
2321       }
2322       if (*name2 == '[') {
2323         do {
2324           name2++;
2325         } while (*name2 == '[');
2326         if (*name2 != 'L') {
2327           // Something is terribly wrong.  Shouldn't be here.
2328           return false;
2329         }
2330       }
2331 
2332       // Check that package part is identical
2333       int length1 = last_slash1 - name1;
2334       int length2 = last_slash2 - name2;
2335 
2336       return UTF8::equal(name1, length1, name2, length2);
2337     }
2338   }
2339 }
2340 
2341 // Returns true iff super_method can be overridden by a method in targetclassname
2342 // See JSL 3rd edition 8.4.6.1
2343 // Assumes name-signature match
2344 // "this" is InstanceKlass of super_method which must exist
2345 // note that the InstanceKlass of the method in the targetclassname has not always been created yet
2346 bool InstanceKlass::is_override(methodHandle super_method, Handle targetclassloader, Symbol* targetclassname, TRAPS) {
2347    // Private methods can not be overridden
2348    if (super_method->is_private()) {
2349      return false;
2350    }
2351    // If super method is accessible, then override
2352    if ((super_method->is_protected()) ||
2353        (super_method->is_public())) {
2354      return true;
2355    }
2356    // Package-private methods are not inherited outside of package
2357    assert(super_method->is_package_private(), "must be package private");
2358    return(is_same_class_package(targetclassloader(), targetclassname));
2359 }
2360 
2361 /* defined for now in jvm.cpp, for historical reasons *--
2362 Klass* InstanceKlass::compute_enclosing_class_impl(instanceKlassHandle self,
2363                                                      Symbol*& simple_name_result, TRAPS) {
2364   ...
2365 }
2366 */
2367 
2368 // tell if two classes have the same enclosing class (at package level)
2369 bool InstanceKlass::is_same_package_member_impl(instanceKlassHandle class1,
2370                                                 Klass* class2_oop, TRAPS) {
2371   if (class2_oop == class1())                       return true;
2372   if (!class2_oop->oop_is_instance())  return false;
2373   instanceKlassHandle class2(THREAD, class2_oop);
2374 
2375   // must be in same package before we try anything else
2376   if (!class1->is_same_class_package(class2->class_loader(), class2->name()))
2377     return false;
2378 
2379   // As long as there is an outer1.getEnclosingClass,
2380   // shift the search outward.
2381   instanceKlassHandle outer1 = class1;
2382   for (;;) {
2383     // As we walk along, look for equalities between outer1 and class2.
2384     // Eventually, the walks will terminate as outer1 stops
2385     // at the top-level class around the original class.
2386     bool ignore_inner_is_member;
2387     Klass* next = outer1->compute_enclosing_class(&ignore_inner_is_member,
2388                                                     CHECK_false);
2389     if (next == NULL)  break;
2390     if (next == class2())  return true;
2391     outer1 = instanceKlassHandle(THREAD, next);
2392   }
2393 
2394   // Now do the same for class2.
2395   instanceKlassHandle outer2 = class2;
2396   for (;;) {
2397     bool ignore_inner_is_member;
2398     Klass* next = outer2->compute_enclosing_class(&ignore_inner_is_member,
2399                                                     CHECK_false);
2400     if (next == NULL)  break;
2401     // Might as well check the new outer against all available values.
2402     if (next == class1())  return true;
2403     if (next == outer1())  return true;
2404     outer2 = instanceKlassHandle(THREAD, next);
2405   }
2406 
2407   // If by this point we have not found an equality between the
2408   // two classes, we know they are in separate package members.
2409   return false;
2410 }
2411 
2412 bool InstanceKlass::find_inner_classes_attr(instanceKlassHandle k, int* ooff, int* noff, TRAPS) {
2413   constantPoolHandle i_cp(THREAD, k->constants());
2414   for (InnerClassesIterator iter(k); !iter.done(); iter.next()) {
2415     int ioff = iter.inner_class_info_index();
2416     if (ioff != 0) {
2417       // Check to see if the name matches the class we're looking for
2418       // before attempting to find the class.
2419       if (i_cp->klass_name_at_matches(k, ioff)) {
2420         Klass* inner_klass = i_cp->klass_at(ioff, CHECK_false);
2421         if (k() == inner_klass) {
2422           *ooff = iter.outer_class_info_index();
2423           *noff = iter.inner_name_index();
2424           return true;
2425         }
2426       }
2427     }
2428   }
2429   return false;
2430 }
2431 
2432 Klass* InstanceKlass::compute_enclosing_class_impl(instanceKlassHandle k, bool* inner_is_member, TRAPS) {
2433   instanceKlassHandle outer_klass;
2434   *inner_is_member = false;
2435   int ooff = 0, noff = 0;
2436   if (find_inner_classes_attr(k, &ooff, &noff, THREAD)) {
2437     constantPoolHandle i_cp(THREAD, k->constants());
2438     if (ooff != 0) {
2439       Klass* ok = i_cp->klass_at(ooff, CHECK_NULL);
2440       outer_klass = instanceKlassHandle(THREAD, ok);
2441       *inner_is_member = true;
2442     }
2443     if (outer_klass.is_null()) {
2444       // It may be anonymous; try for that.
2445       int encl_method_class_idx = k->enclosing_method_class_index();
2446       if (encl_method_class_idx != 0) {
2447         Klass* ok = i_cp->klass_at(encl_method_class_idx, CHECK_NULL);
2448         outer_klass = instanceKlassHandle(THREAD, ok);
2449         *inner_is_member = false;
2450       }
2451     }
2452   }
2453 
2454   // If no inner class attribute found for this class.
2455   if (outer_klass.is_null())  return NULL;
2456 
2457   // Throws an exception if outer klass has not declared k as an inner klass
2458   // We need evidence that each klass knows about the other, or else
2459   // the system could allow a spoof of an inner class to gain access rights.
2460   Reflection::check_for_inner_class(outer_klass, k, *inner_is_member, CHECK_NULL);
2461   return outer_klass();
2462 }
2463 
2464 jint InstanceKlass::compute_modifier_flags(TRAPS) const {
2465   jint access = access_flags().as_int();
2466 
2467   // But check if it happens to be member class.
2468   instanceKlassHandle ik(THREAD, this);
2469   InnerClassesIterator iter(ik);
2470   for (; !iter.done(); iter.next()) {
2471     int ioff = iter.inner_class_info_index();
2472     // Inner class attribute can be zero, skip it.
2473     // Strange but true:  JVM spec. allows null inner class refs.
2474     if (ioff == 0) continue;
2475 
2476     // only look at classes that are already loaded
2477     // since we are looking for the flags for our self.
2478     Symbol* inner_name = ik->constants()->klass_name_at(ioff);
2479     if ((ik->name() == inner_name)) {
2480       // This is really a member class.
2481       access = iter.inner_access_flags();
2482       break;
2483     }
2484   }
2485   // Remember to strip ACC_SUPER bit
2486   return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS;
2487 }
2488 
2489 jint InstanceKlass::jvmti_class_status() const {
2490   jint result = 0;
2491 
2492   if (is_linked()) {
2493     result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED;
2494   }
2495 
2496   if (is_initialized()) {
2497     assert(is_linked(), "Class status is not consistent");
2498     result |= JVMTI_CLASS_STATUS_INITIALIZED;
2499   }
2500   if (is_in_error_state()) {
2501     result |= JVMTI_CLASS_STATUS_ERROR;
2502   }
2503   return result;
2504 }
2505 
2506 Method* InstanceKlass::method_at_itable(Klass* holder, int index, TRAPS) {
2507   itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
2508   int method_table_offset_in_words = ioe->offset()/wordSize;
2509   int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
2510                        / itableOffsetEntry::size();
2511 
2512   for (int cnt = 0 ; ; cnt ++, ioe ++) {
2513     // If the interface isn't implemented by the receiver class,
2514     // the VM should throw IncompatibleClassChangeError.
2515     if (cnt >= nof_interfaces) {
2516       THROW_NULL(vmSymbols::java_lang_IncompatibleClassChangeError());
2517     }
2518 
2519     Klass* ik = ioe->interface_klass();
2520     if (ik == holder) break;
2521   }
2522 
2523   itableMethodEntry* ime = ioe->first_method_entry(this);
2524   Method* m = ime[index].method();
2525   if (m == NULL) {
2526     THROW_NULL(vmSymbols::java_lang_AbstractMethodError());
2527   }
2528   return m;
2529 }
2530 
2531 
2532 #if INCLUDE_JVMTI
2533 // update default_methods for redefineclasses for methods that are
2534 // not yet in the vtable due to concurrent subclass define and superinterface
2535 // redefinition
2536 // Note: those in the vtable, should have been updated via adjust_method_entries
2537 void InstanceKlass::adjust_default_methods(InstanceKlass* holder, bool* trace_name_printed) {
2538   // search the default_methods for uses of either obsolete or EMCP methods
2539   if (default_methods() != NULL) {
2540     for (int index = 0; index < default_methods()->length(); index ++) {
2541       Method* old_method = default_methods()->at(index);
2542       if (old_method == NULL || old_method->method_holder() != holder || !old_method->is_old()) {
2543         continue; // skip uninteresting entries
2544       }
2545       assert(!old_method->is_deleted(), "default methods may not be deleted");
2546 
2547       Method* new_method = holder->method_with_idnum(old_method->orig_method_idnum());
2548 
2549       assert(new_method != NULL, "method_with_idnum() should not be NULL");
2550       assert(old_method != new_method, "sanity check");
2551 
2552       default_methods()->at_put(index, new_method);
2553       if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) {
2554         if (!(*trace_name_printed)) {
2555           // RC_TRACE_MESG macro has an embedded ResourceMark
2556           RC_TRACE_MESG(("adjust: klassname=%s default methods from name=%s",
2557                          external_name(),
2558                          old_method->method_holder()->external_name()));
2559           *trace_name_printed = true;
2560         }
2561         RC_TRACE(0x00100000, ("default method update: %s(%s) ",
2562                               new_method->name()->as_C_string(),
2563                               new_method->signature()->as_C_string()));
2564       }
2565     }
2566   }
2567 }
2568 #endif // INCLUDE_JVMTI
2569 
2570 // On-stack replacement stuff
2571 void InstanceKlass::add_osr_nmethod(nmethod* n) {
2572   // only one compilation can be active
2573   {
2574     // This is a short non-blocking critical region, so the no safepoint check is ok.
2575     MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
2576     assert(n->is_osr_method(), "wrong kind of nmethod");
2577     n->set_osr_link(osr_nmethods_head());
2578     set_osr_nmethods_head(n);
2579     // Raise the highest osr level if necessary
2580     if (TieredCompilation) {
2581       Method* m = n->method();
2582       m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level()));
2583     }
2584   }
2585 
2586   // Get rid of the osr methods for the same bci that have lower levels.
2587   if (TieredCompilation) {
2588     for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) {
2589       nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true);
2590       if (inv != NULL && inv->is_in_use()) {
2591         inv->make_not_entrant();
2592       }
2593     }
2594   }
2595 }
2596 
2597 
2598 void InstanceKlass::remove_osr_nmethod(nmethod* n) {
2599   // This is a short non-blocking critical region, so the no safepoint check is ok.
2600   MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
2601   assert(n->is_osr_method(), "wrong kind of nmethod");
2602   nmethod* last = NULL;
2603   nmethod* cur  = osr_nmethods_head();
2604   int max_level = CompLevel_none;  // Find the max comp level excluding n
2605   Method* m = n->method();
2606   // Search for match
2607   while(cur != NULL && cur != n) {
2608     if (TieredCompilation && m == cur->method()) {
2609       // Find max level before n
2610       max_level = MAX2(max_level, cur->comp_level());
2611     }
2612     last = cur;
2613     cur = cur->osr_link();
2614   }
2615   nmethod* next = NULL;
2616   if (cur == n) {
2617     next = cur->osr_link();
2618     if (last == NULL) {
2619       // Remove first element
2620       set_osr_nmethods_head(next);
2621     } else {
2622       last->set_osr_link(next);
2623     }
2624   }
2625   n->set_osr_link(NULL);
2626   if (TieredCompilation) {
2627     cur = next;
2628     while (cur != NULL) {
2629       // Find max level after n
2630       if (m == cur->method()) {
2631         max_level = MAX2(max_level, cur->comp_level());
2632       }
2633       cur = cur->osr_link();
2634     }
2635     m->set_highest_osr_comp_level(max_level);
2636   }
2637 }
2638 
2639 int InstanceKlass::mark_osr_nmethods(const Method* m) {
2640   // This is a short non-blocking critical region, so the no safepoint check is ok.
2641   MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
2642   nmethod* osr = osr_nmethods_head();
2643   int found = 0;
2644   while (osr != NULL) {
2645     assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
2646     if (osr->method() == m) {
2647       osr->mark_for_deoptimization();
2648       found++;
2649     }
2650     osr = osr->osr_link();
2651   }
2652   return found;
2653 }
2654 
2655 nmethod* InstanceKlass::lookup_osr_nmethod(const Method* m, int bci, int comp_level, bool match_level) const {
2656   // This is a short non-blocking critical region, so the no safepoint check is ok.
2657   MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
2658   nmethod* osr = osr_nmethods_head();
2659   nmethod* best = NULL;
2660   while (osr != NULL) {
2661     assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
2662     // There can be a time when a c1 osr method exists but we are waiting
2663     // for a c2 version. When c2 completes its osr nmethod we will trash
2664     // the c1 version and only be able to find the c2 version. However
2665     // while we overflow in the c1 code at back branches we don't want to
2666     // try and switch to the same code as we are already running
2667 
2668     if (osr->method() == m &&
2669         (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) {
2670       if (match_level) {
2671         if (osr->comp_level() == comp_level) {
2672           // Found a match - return it.
2673           return osr;
2674         }
2675       } else {
2676         if (best == NULL || (osr->comp_level() > best->comp_level())) {
2677           if (osr->comp_level() == CompLevel_highest_tier) {
2678             // Found the best possible - return it.
2679             return osr;
2680           }
2681           best = osr;
2682         }
2683       }
2684     }
2685     osr = osr->osr_link();
2686   }
2687   if (best != NULL && best->comp_level() >= comp_level && match_level == false) {
2688     return best;
2689   }
2690   return NULL;
2691 }
2692 
2693 bool InstanceKlass::add_member_name(Handle mem_name) {
2694   jweak mem_name_wref = JNIHandles::make_weak_global(mem_name);
2695   MutexLocker ml(MemberNameTable_lock);
2696   DEBUG_ONLY(No_Safepoint_Verifier nsv);
2697 
2698   // Check if method has been redefined while taking out MemberNameTable_lock, if so
2699   // return false.  We cannot cache obsolete methods. They will crash when the function
2700   // is called!
2701   Method* method = (Method*)java_lang_invoke_MemberName::vmtarget(mem_name());
2702   if (method->is_obsolete()) {
2703     return false;
2704   } else if (method->is_old()) {
2705     // Replace method with redefined version
2706     java_lang_invoke_MemberName::set_vmtarget(mem_name(), method_with_idnum(method->method_idnum()));
2707   }
2708 
2709   if (_member_names == NULL) {
2710     _member_names = new (ResourceObj::C_HEAP, mtClass) MemberNameTable(idnum_allocated_count());
2711   }
2712   _member_names->add_member_name(mem_name_wref);
2713   return true;
2714 }
2715 
2716 // -----------------------------------------------------------------------------------------------------
2717 // Printing
2718 
2719 #ifndef PRODUCT
2720 
2721 #define BULLET  " - "
2722 
2723 static const char* state_names[] = {
2724   "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error"
2725 };
2726 
2727 static void print_vtable(intptr_t* start, int len, outputStream* st) {
2728   for (int i = 0; i < len; i++) {
2729     intptr_t e = start[i];
2730     st->print("%d : " INTPTR_FORMAT, i, e);
2731     if (e != 0 && ((Metadata*)e)->is_metaspace_object()) {
2732       st->print(" ");
2733       ((Metadata*)e)->print_value_on(st);
2734     }
2735     st->cr();
2736   }
2737 }
2738 
2739 void InstanceKlass::print_on(outputStream* st) const {
2740   assert(is_klass(), "must be klass");
2741   Klass::print_on(st);
2742 
2743   st->print(BULLET"instance size:     %d", size_helper());                        st->cr();
2744   st->print(BULLET"klass size:        %d", size());                               st->cr();
2745   st->print(BULLET"access:            "); access_flags().print_on(st);            st->cr();
2746   st->print(BULLET"state:             "); st->print_cr("%s", state_names[_init_state]);
2747   st->print(BULLET"name:              "); name()->print_value_on(st);             st->cr();
2748   st->print(BULLET"super:             "); super()->print_value_on_maybe_null(st); st->cr();
2749   st->print(BULLET"sub:               ");
2750   Klass* sub = subklass();
2751   int n;
2752   for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) {
2753     if (n < MaxSubklassPrintSize) {
2754       sub->print_value_on(st);
2755       st->print("   ");
2756     }
2757   }
2758   if (n >= MaxSubklassPrintSize) st->print("(%d more klasses...)", n - MaxSubklassPrintSize);
2759   st->cr();
2760 
2761   if (is_interface()) {
2762     st->print_cr(BULLET"nof implementors:  %d", nof_implementors());
2763     if (nof_implementors() == 1) {
2764       st->print_cr(BULLET"implementor:    ");
2765       st->print("   ");
2766       implementor()->print_value_on(st);
2767       st->cr();
2768     }
2769   }
2770 
2771   st->print(BULLET"arrays:            "); array_klasses()->print_value_on_maybe_null(st); st->cr();
2772   st->print(BULLET"methods:           "); methods()->print_value_on(st);                  st->cr();
2773   if (Verbose || WizardMode) {
2774     Array<Method*>* method_array = methods();
2775     for (int i = 0; i < method_array->length(); i++) {
2776       st->print("%d : ", i); method_array->at(i)->print_value(); st->cr();
2777     }
2778   }
2779   st->print(BULLET"method ordering:   "); method_ordering()->print_value_on(st);      st->cr();
2780   st->print(BULLET"default_methods:   "); default_methods()->print_value_on(st);      st->cr();
2781   if (Verbose && default_methods() != NULL) {
2782     Array<Method*>* method_array = default_methods();
2783     for (int i = 0; i < method_array->length(); i++) {
2784       st->print("%d : ", i); method_array->at(i)->print_value(); st->cr();
2785     }
2786   }
2787   if (default_vtable_indices() != NULL) {
2788     st->print(BULLET"default vtable indices:   "); default_vtable_indices()->print_value_on(st);       st->cr();
2789   }
2790   st->print(BULLET"local interfaces:  "); local_interfaces()->print_value_on(st);      st->cr();
2791   st->print(BULLET"trans. interfaces: "); transitive_interfaces()->print_value_on(st); st->cr();
2792   st->print(BULLET"constants:         "); constants()->print_value_on(st);         st->cr();
2793   if (class_loader_data() != NULL) {
2794     st->print(BULLET"class loader data:  ");
2795     class_loader_data()->print_value_on(st);
2796     st->cr();
2797   }
2798   st->print(BULLET"host class:        "); host_klass()->print_value_on_maybe_null(st); st->cr();
2799   if (source_file_name() != NULL) {
2800     st->print(BULLET"source file:       ");
2801     source_file_name()->print_value_on(st);
2802     st->cr();
2803   }
2804   if (source_debug_extension() != NULL) {
2805     st->print(BULLET"source debug extension:       ");
2806     st->print("%s", source_debug_extension());
2807     st->cr();
2808   }
2809   st->print(BULLET"class annotations:       "); class_annotations()->print_value_on(st); st->cr();
2810   st->print(BULLET"class type annotations:  "); class_type_annotations()->print_value_on(st); st->cr();
2811   st->print(BULLET"field annotations:       "); fields_annotations()->print_value_on(st); st->cr();
2812   st->print(BULLET"field type annotations:  "); fields_type_annotations()->print_value_on(st); st->cr();
2813   {
2814     bool have_pv = false;
2815     // previous versions are linked together through the InstanceKlass
2816     for (InstanceKlass* pv_node = _previous_versions;
2817          pv_node != NULL;
2818          pv_node = pv_node->previous_versions()) {
2819       if (!have_pv)
2820         st->print(BULLET"previous version:  ");
2821       have_pv = true;
2822       pv_node->constants()->print_value_on(st);
2823     }
2824     if (have_pv) st->cr();
2825   }
2826 
2827   if (generic_signature() != NULL) {
2828     st->print(BULLET"generic signature: ");
2829     generic_signature()->print_value_on(st);
2830     st->cr();
2831   }
2832   st->print(BULLET"inner classes:     "); inner_classes()->print_value_on(st);     st->cr();
2833   st->print(BULLET"java mirror:       "); java_mirror()->print_value_on(st);       st->cr();
2834   st->print(BULLET"vtable length      %d  (start addr: " INTPTR_FORMAT ")", vtable_length(), start_of_vtable());  st->cr();
2835   if (vtable_length() > 0 && (Verbose || WizardMode))  print_vtable(start_of_vtable(), vtable_length(), st);
2836   st->print(BULLET"itable length      %d (start addr: " INTPTR_FORMAT ")", itable_length(), start_of_itable()); st->cr();
2837   if (itable_length() > 0 && (Verbose || WizardMode))  print_vtable(start_of_itable(), itable_length(), st);
2838   st->print_cr(BULLET"---- static fields (%d words):", static_field_size());
2839   FieldPrinter print_static_field(st);
2840   ((InstanceKlass*)this)->do_local_static_fields(&print_static_field);
2841   st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size());
2842   FieldPrinter print_nonstatic_field(st);
2843   ((InstanceKlass*)this)->do_nonstatic_fields(&print_nonstatic_field);
2844 
2845   st->print(BULLET"non-static oop maps: ");
2846   OopMapBlock* map     = start_of_nonstatic_oop_maps();
2847   OopMapBlock* end_map = map + nonstatic_oop_map_count();
2848   while (map < end_map) {
2849     st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1));
2850     map++;
2851   }
2852   st->cr();
2853 }
2854 
2855 #endif //PRODUCT
2856 
2857 void InstanceKlass::print_value_on(outputStream* st) const {
2858   assert(is_klass(), "must be klass");
2859   if (Verbose || WizardMode)  access_flags().print_on(st);
2860   name()->print_value_on(st);
2861 }
2862 
2863 #ifndef PRODUCT
2864 
2865 void FieldPrinter::do_field(fieldDescriptor* fd) {
2866   _st->print(BULLET);
2867    if (_obj == NULL) {
2868      fd->print_on(_st);
2869      _st->cr();
2870    } else {
2871      fd->print_on_for(_st, _obj);
2872      _st->cr();
2873    }
2874 }
2875 
2876 
2877 void InstanceKlass::oop_print_on(oop obj, outputStream* st) {
2878   Klass::oop_print_on(obj, st);
2879 
2880   if (this == SystemDictionary::String_klass()) {
2881     typeArrayOop value  = java_lang_String::value(obj);
2882     juint        offset = java_lang_String::offset(obj);
2883     juint        length = java_lang_String::length(obj);
2884     if (value != NULL &&
2885         value->is_typeArray() &&
2886         offset          <= (juint) value->length() &&
2887         offset + length <= (juint) value->length()) {
2888       st->print(BULLET"string: ");
2889       java_lang_String::print(obj, st);
2890       st->cr();
2891       if (!WizardMode)  return;  // that is enough
2892     }
2893   }
2894 
2895   st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj));
2896   FieldPrinter print_field(st, obj);
2897   do_nonstatic_fields(&print_field);
2898 
2899   if (this == SystemDictionary::Class_klass()) {
2900     st->print(BULLET"signature: ");
2901     java_lang_Class::print_signature(obj, st);
2902     st->cr();
2903     Klass* mirrored_klass = java_lang_Class::as_Klass(obj);
2904     st->print(BULLET"fake entry for mirror: ");
2905     mirrored_klass->print_value_on_maybe_null(st);
2906     st->cr();
2907     Klass* array_klass = java_lang_Class::array_klass(obj);
2908     st->print(BULLET"fake entry for array: ");
2909     array_klass->print_value_on_maybe_null(st);
2910     st->cr();
2911     st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj));
2912     st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj));
2913     Klass* real_klass = java_lang_Class::as_Klass(obj);
2914     if (real_klass != NULL && real_klass->oop_is_instance()) {
2915       InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field);
2916     }
2917   } else if (this == SystemDictionary::MethodType_klass()) {
2918     st->print(BULLET"signature: ");
2919     java_lang_invoke_MethodType::print_signature(obj, st);
2920     st->cr();
2921   }
2922 }
2923 
2924 #endif //PRODUCT
2925 
2926 void InstanceKlass::oop_print_value_on(oop obj, outputStream* st) {
2927   st->print("a ");
2928   name()->print_value_on(st);
2929   obj->print_address_on(st);
2930   if (this == SystemDictionary::String_klass()
2931       && java_lang_String::value(obj) != NULL) {
2932     ResourceMark rm;
2933     int len = java_lang_String::length(obj);
2934     int plen = (len < 24 ? len : 12);
2935     char* str = java_lang_String::as_utf8_string(obj, 0, plen);
2936     st->print(" = \"%s\"", str);
2937     if (len > plen)
2938       st->print("...[%d]", len);
2939   } else if (this == SystemDictionary::Class_klass()) {
2940     Klass* k = java_lang_Class::as_Klass(obj);
2941     st->print(" = ");
2942     if (k != NULL) {
2943       k->print_value_on(st);
2944     } else {
2945       const char* tname = type2name(java_lang_Class::primitive_type(obj));
2946       st->print("%s", tname ? tname : "type?");
2947     }
2948   } else if (this == SystemDictionary::MethodType_klass()) {
2949     st->print(" = ");
2950     java_lang_invoke_MethodType::print_signature(obj, st);
2951   } else if (java_lang_boxing_object::is_instance(obj)) {
2952     st->print(" = ");
2953     java_lang_boxing_object::print(obj, st);
2954   } else if (this == SystemDictionary::LambdaForm_klass()) {
2955     oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj);
2956     if (vmentry != NULL) {
2957       st->print(" => ");
2958       vmentry->print_value_on(st);
2959     }
2960   } else if (this == SystemDictionary::MemberName_klass()) {
2961     Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj);
2962     if (vmtarget != NULL) {
2963       st->print(" = ");
2964       vmtarget->print_value_on(st);
2965     } else {
2966       java_lang_invoke_MemberName::clazz(obj)->print_value_on(st);
2967       st->print(".");
2968       java_lang_invoke_MemberName::name(obj)->print_value_on(st);
2969     }
2970   }
2971 }
2972 
2973 const char* InstanceKlass::internal_name() const {
2974   return external_name();
2975 }
2976 
2977 #if INCLUDE_SERVICES
2978 // Size Statistics
2979 void InstanceKlass::collect_statistics(KlassSizeStats *sz) const {
2980   Klass::collect_statistics(sz);
2981 
2982   sz->_inst_size  = HeapWordSize * size_helper();
2983   sz->_vtab_bytes = HeapWordSize * align_object_offset(vtable_length());
2984   sz->_itab_bytes = HeapWordSize * align_object_offset(itable_length());
2985   sz->_nonstatic_oopmap_bytes = HeapWordSize *
2986         ((is_interface() || is_anonymous()) ?
2987          align_object_offset(nonstatic_oop_map_size()) :
2988          nonstatic_oop_map_size());
2989 
2990   int n = 0;
2991   n += (sz->_methods_array_bytes         = sz->count_array(methods()));
2992   n += (sz->_method_ordering_bytes       = sz->count_array(method_ordering()));
2993   n += (sz->_local_interfaces_bytes      = sz->count_array(local_interfaces()));
2994   n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces()));
2995   n += (sz->_fields_bytes                = sz->count_array(fields()));
2996   n += (sz->_inner_classes_bytes         = sz->count_array(inner_classes()));
2997   sz->_ro_bytes += n;
2998 
2999   const ConstantPool* cp = constants();
3000   if (cp) {
3001     cp->collect_statistics(sz);
3002   }
3003 
3004   const Annotations* anno = annotations();
3005   if (anno) {
3006     anno->collect_statistics(sz);
3007   }
3008 
3009   const Array<Method*>* methods_array = methods();
3010   if (methods()) {
3011     for (int i = 0; i < methods_array->length(); i++) {
3012       Method* method = methods_array->at(i);
3013       if (method) {
3014         sz->_method_count ++;
3015         method->collect_statistics(sz);
3016       }
3017     }
3018   }
3019 }
3020 #endif // INCLUDE_SERVICES
3021 
3022 // Verification
3023 
3024 class VerifyFieldClosure: public OopClosure {
3025  protected:
3026   template <class T> void do_oop_work(T* p) {
3027     oop obj = oopDesc::load_decode_heap_oop(p);
3028     if (!obj->is_oop_or_null()) {
3029       tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p, (address)obj);
3030       Universe::print();
3031       guarantee(false, "boom");
3032     }
3033   }
3034  public:
3035   virtual void do_oop(oop* p)       { VerifyFieldClosure::do_oop_work(p); }
3036   virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); }
3037 };
3038 
3039 void InstanceKlass::verify_on(outputStream* st) {
3040 #ifndef PRODUCT
3041   // Avoid redundant verifies, this really should be in product.
3042   if (_verify_count == Universe::verify_count()) return;
3043   _verify_count = Universe::verify_count();
3044 #endif
3045 
3046   // Verify Klass
3047   Klass::verify_on(st);
3048 
3049   // Verify that klass is present in ClassLoaderData
3050   guarantee(class_loader_data()->contains_klass(this),
3051             "this class isn't found in class loader data");
3052 
3053   // Verify vtables
3054   if (is_linked()) {
3055     ResourceMark rm;
3056     // $$$ This used to be done only for m/s collections.  Doing it
3057     // always seemed a valid generalization.  (DLD -- 6/00)
3058     vtable()->verify(st);
3059   }
3060 
3061   // Verify first subklass
3062   if (subklass() != NULL) {
3063     guarantee(subklass()->is_klass(), "should be klass");
3064   }
3065 
3066   // Verify siblings
3067   Klass* super = this->super();
3068   Klass* sib = next_sibling();
3069   if (sib != NULL) {
3070     if (sib == this) {
3071       fatal(err_msg("subclass points to itself " PTR_FORMAT, sib));
3072     }
3073 
3074     guarantee(sib->is_klass(), "should be klass");
3075     guarantee(sib->super() == super, "siblings should have same superklass");
3076   }
3077 
3078   // Verify implementor fields
3079   Klass* im = implementor();
3080   if (im != NULL) {
3081     guarantee(is_interface(), "only interfaces should have implementor set");
3082     guarantee(im->is_klass(), "should be klass");
3083     guarantee(!im->is_interface() || im == this,
3084       "implementors cannot be interfaces");
3085   }
3086 
3087   // Verify local interfaces
3088   if (local_interfaces()) {
3089     Array<Klass*>* local_interfaces = this->local_interfaces();
3090     for (int j = 0; j < local_interfaces->length(); j++) {
3091       Klass* e = local_interfaces->at(j);
3092       guarantee(e->is_klass() && e->is_interface(), "invalid local interface");
3093     }
3094   }
3095 
3096   // Verify transitive interfaces
3097   if (transitive_interfaces() != NULL) {
3098     Array<Klass*>* transitive_interfaces = this->transitive_interfaces();
3099     for (int j = 0; j < transitive_interfaces->length(); j++) {
3100       Klass* e = transitive_interfaces->at(j);
3101       guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface");
3102     }
3103   }
3104 
3105   // Verify methods
3106   if (methods() != NULL) {
3107     Array<Method*>* methods = this->methods();
3108     for (int j = 0; j < methods->length(); j++) {
3109       guarantee(methods->at(j)->is_method(), "non-method in methods array");
3110     }
3111     for (int j = 0; j < methods->length() - 1; j++) {
3112       Method* m1 = methods->at(j);
3113       Method* m2 = methods->at(j + 1);
3114       guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3115     }
3116   }
3117 
3118   // Verify method ordering
3119   if (method_ordering() != NULL) {
3120     Array<int>* method_ordering = this->method_ordering();
3121     int length = method_ordering->length();
3122     if (JvmtiExport::can_maintain_original_method_order() ||
3123         ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) {
3124       guarantee(length == methods()->length(), "invalid method ordering length");
3125       jlong sum = 0;
3126       for (int j = 0; j < length; j++) {
3127         int original_index = method_ordering->at(j);
3128         guarantee(original_index >= 0, "invalid method ordering index");
3129         guarantee(original_index < length, "invalid method ordering index");
3130         sum += original_index;
3131       }
3132       // Verify sum of indices 0,1,...,length-1
3133       guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum");
3134     } else {
3135       guarantee(length == 0, "invalid method ordering length");
3136     }
3137   }
3138 
3139   // Verify default methods
3140   if (default_methods() != NULL) {
3141     Array<Method*>* methods = this->default_methods();
3142     for (int j = 0; j < methods->length(); j++) {
3143       guarantee(methods->at(j)->is_method(), "non-method in methods array");
3144     }
3145     for (int j = 0; j < methods->length() - 1; j++) {
3146       Method* m1 = methods->at(j);
3147       Method* m2 = methods->at(j + 1);
3148       guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3149     }
3150   }
3151 
3152   // Verify JNI static field identifiers
3153   if (jni_ids() != NULL) {
3154     jni_ids()->verify(this);
3155   }
3156 
3157   // Verify other fields
3158   if (array_klasses() != NULL) {
3159     guarantee(array_klasses()->is_klass(), "should be klass");
3160   }
3161   if (constants() != NULL) {
3162     guarantee(constants()->is_constantPool(), "should be constant pool");
3163   }
3164   const Klass* host = host_klass();
3165   if (host != NULL) {
3166     guarantee(host->is_klass(), "should be klass");
3167   }
3168 }
3169 
3170 void InstanceKlass::oop_verify_on(oop obj, outputStream* st) {
3171   Klass::oop_verify_on(obj, st);
3172   VerifyFieldClosure blk;
3173   obj->oop_iterate_no_header(&blk);
3174 }
3175 
3176 
3177 // JNIid class for jfieldIDs only
3178 // Note to reviewers:
3179 // These JNI functions are just moved over to column 1 and not changed
3180 // in the compressed oops workspace.
3181 JNIid::JNIid(Klass* holder, int offset, JNIid* next) {
3182   _holder = holder;
3183   _offset = offset;
3184   _next = next;
3185   debug_only(_is_static_field_id = false;)
3186 }
3187 
3188 
3189 JNIid* JNIid::find(int offset) {
3190   JNIid* current = this;
3191   while (current != NULL) {
3192     if (current->offset() == offset) return current;
3193     current = current->next();
3194   }
3195   return NULL;
3196 }
3197 
3198 void JNIid::deallocate(JNIid* current) {
3199   while (current != NULL) {
3200     JNIid* next = current->next();
3201     delete current;
3202     current = next;
3203   }
3204 }
3205 
3206 
3207 void JNIid::verify(Klass* holder) {
3208   int first_field_offset  = InstanceMirrorKlass::offset_of_static_fields();
3209   int end_field_offset;
3210   end_field_offset = first_field_offset + (InstanceKlass::cast(holder)->static_field_size() * wordSize);
3211 
3212   JNIid* current = this;
3213   while (current != NULL) {
3214     guarantee(current->holder() == holder, "Invalid klass in JNIid");
3215 #ifdef ASSERT
3216     int o = current->offset();
3217     if (current->is_static_field_id()) {
3218       guarantee(o >= first_field_offset  && o < end_field_offset,  "Invalid static field offset in JNIid");
3219     }
3220 #endif
3221     current = current->next();
3222   }
3223 }
3224 
3225 
3226 #ifdef ASSERT
3227 void InstanceKlass::set_init_state(ClassState state) {
3228   bool good_state = is_shared() ? (_init_state <= state)
3229                                                : (_init_state < state);
3230   assert(good_state || state == allocated, "illegal state transition");
3231   _init_state = (u1)state;
3232 }
3233 #endif
3234 
3235 
3236 
3237 // RedefineClasses() support for previous versions:
3238 int InstanceKlass::_previous_version_count = 0;
3239 
3240 // Purge previous versions before adding new previous versions of the class.
3241 void InstanceKlass::purge_previous_versions(InstanceKlass* ik) {
3242   if (ik->previous_versions() != NULL) {
3243     // This klass has previous versions so see what we can cleanup
3244     // while it is safe to do so.
3245 
3246     int deleted_count = 0;    // leave debugging breadcrumbs
3247     int live_count = 0;
3248     ClassLoaderData* loader_data = ik->class_loader_data();
3249     assert(loader_data != NULL, "should never be null");
3250 
3251     // RC_TRACE macro has an embedded ResourceMark
3252     RC_TRACE(0x00000200, ("purge: %s: previous versions", ik->external_name()));
3253 
3254     // previous versions are linked together through the InstanceKlass
3255     InstanceKlass* pv_node = ik->previous_versions();
3256     InstanceKlass* last = ik;
3257     int version = 0;
3258 
3259     // check the previous versions list
3260     for (; pv_node != NULL; ) {
3261 
3262       ConstantPool* pvcp = pv_node->constants();
3263       assert(pvcp != NULL, "cp ref was unexpectedly cleared");
3264 
3265       if (!pvcp->on_stack()) {
3266         // If the constant pool isn't on stack, none of the methods
3267         // are executing.  Unlink this previous_version.
3268         // The previous version InstanceKlass is on the ClassLoaderData deallocate list
3269         // so will be deallocated during the next phase of class unloading.
3270         RC_TRACE(0x00000200, ("purge: previous version " INTPTR_FORMAT " is dead",
3271                               pv_node));
3272         // For debugging purposes.
3273         pv_node->set_is_scratch_class();
3274         pv_node->class_loader_data()->add_to_deallocate_list(pv_node);
3275         pv_node = pv_node->previous_versions();
3276         last->link_previous_versions(pv_node);
3277         deleted_count++;
3278         version++;
3279         continue;
3280       } else {
3281         RC_TRACE(0x00000200, ("purge: previous version " INTPTR_FORMAT " is alive",
3282                               pv_node));
3283         assert(pvcp->pool_holder() != NULL, "Constant pool with no holder");
3284         guarantee (!loader_data->is_unloading(), "unloaded classes can't be on the stack");
3285         live_count++;
3286       }
3287 
3288       // At least one method is live in this previous version.
3289       // Reset dead EMCP methods not to get breakpoints.
3290       // All methods are deallocated when all of the methods for this class are no
3291       // longer running.
3292       Array<Method*>* method_refs = pv_node->methods();
3293       if (method_refs != NULL) {
3294         RC_TRACE(0x00000200, ("purge: previous methods length=%d",
3295           method_refs->length()));
3296         for (int j = 0; j < method_refs->length(); j++) {
3297           Method* method = method_refs->at(j);
3298 
3299           if (!method->on_stack()) {
3300             // no breakpoints for non-running methods
3301             if (method->is_running_emcp()) {
3302               method->set_running_emcp(false);
3303             }
3304           } else {
3305             assert (method->is_obsolete() || method->is_running_emcp(),
3306                     "emcp method cannot run after emcp bit is cleared");
3307             // RC_TRACE macro has an embedded ResourceMark
3308             RC_TRACE(0x00000200,
3309               ("purge: %s(%s): prev method @%d in version @%d is alive",
3310               method->name()->as_C_string(),
3311               method->signature()->as_C_string(), j, version));
3312           }
3313         }
3314       }
3315       // next previous version
3316       last = pv_node;
3317       pv_node = pv_node->previous_versions();
3318       version++;
3319     }
3320     RC_TRACE(0x00000200,
3321       ("purge: previous version stats: live=%d, deleted=%d", live_count,
3322       deleted_count));
3323   }
3324 }
3325 
3326 void InstanceKlass::mark_newly_obsolete_methods(Array<Method*>* old_methods,
3327                                                 int emcp_method_count) {
3328   int obsolete_method_count = old_methods->length() - emcp_method_count;
3329 
3330   if (emcp_method_count != 0 && obsolete_method_count != 0 &&
3331       _previous_versions != NULL) {
3332     // We have a mix of obsolete and EMCP methods so we have to
3333     // clear out any matching EMCP method entries the hard way.
3334     int local_count = 0;
3335     for (int i = 0; i < old_methods->length(); i++) {
3336       Method* old_method = old_methods->at(i);
3337       if (old_method->is_obsolete()) {
3338         // only obsolete methods are interesting
3339         Symbol* m_name = old_method->name();
3340         Symbol* m_signature = old_method->signature();
3341 
3342         // previous versions are linked together through the InstanceKlass
3343         int j = 0;
3344         for (InstanceKlass* prev_version = _previous_versions;
3345              prev_version != NULL;
3346              prev_version = prev_version->previous_versions(), j++) {
3347 
3348           Array<Method*>* method_refs = prev_version->methods();
3349           for (int k = 0; k < method_refs->length(); k++) {
3350             Method* method = method_refs->at(k);
3351 
3352             if (!method->is_obsolete() &&
3353                 method->name() == m_name &&
3354                 method->signature() == m_signature) {
3355               // The current RedefineClasses() call has made all EMCP
3356               // versions of this method obsolete so mark it as obsolete
3357               RC_TRACE(0x00000400,
3358                 ("add: %s(%s): flush obsolete method @%d in version @%d",
3359                 m_name->as_C_string(), m_signature->as_C_string(), k, j));
3360 
3361               method->set_is_obsolete();
3362               break;
3363             }
3364           }
3365 
3366           // The previous loop may not find a matching EMCP method, but
3367           // that doesn't mean that we can optimize and not go any
3368           // further back in the PreviousVersion generations. The EMCP
3369           // method for this generation could have already been made obsolete,
3370           // but there still may be an older EMCP method that has not
3371           // been made obsolete.
3372         }
3373 
3374         if (++local_count >= obsolete_method_count) {
3375           // no more obsolete methods so bail out now
3376           break;
3377         }
3378       }
3379     }
3380   }
3381 }
3382 
3383 // Save the scratch_class as the previous version if any of the methods are running.
3384 // The previous_versions are used to set breakpoints in EMCP methods and they are
3385 // also used to clean MethodData links to redefined methods that are no longer running.
3386 void InstanceKlass::add_previous_version(instanceKlassHandle scratch_class,
3387                                          int emcp_method_count) {
3388   assert(Thread::current()->is_VM_thread(),
3389          "only VMThread can add previous versions");
3390 
3391   // RC_TRACE macro has an embedded ResourceMark
3392   RC_TRACE(0x00000400, ("adding previous version ref for %s, EMCP_cnt=%d",
3393     scratch_class->external_name(), emcp_method_count));
3394 
3395   // Clean out old previous versions
3396   purge_previous_versions(this);
3397 
3398   // Mark newly obsolete methods in remaining previous versions.  An EMCP method from
3399   // a previous redefinition may be made obsolete by this redefinition.
3400   Array<Method*>* old_methods = scratch_class->methods();
3401   mark_newly_obsolete_methods(old_methods, emcp_method_count);
3402 
3403   // If the constant pool for this previous version of the class
3404   // is not marked as being on the stack, then none of the methods
3405   // in this previous version of the class are on the stack so
3406   // we don't need to add this as a previous version.
3407   ConstantPool* cp_ref = scratch_class->constants();
3408   if (!cp_ref->on_stack()) {
3409     RC_TRACE(0x00000400, ("add: scratch class not added; no methods are running"));
3410     // For debugging purposes.
3411     scratch_class->set_is_scratch_class();
3412     scratch_class->class_loader_data()->add_to_deallocate_list(scratch_class());
3413     // Update count for class unloading.
3414     _previous_version_count--;
3415     return;
3416   }
3417 
3418   if (emcp_method_count != 0) {
3419     // At least one method is still running, check for EMCP methods
3420     for (int i = 0; i < old_methods->length(); i++) {
3421       Method* old_method = old_methods->at(i);
3422       if (!old_method->is_obsolete() && old_method->on_stack()) {
3423         // if EMCP method (not obsolete) is on the stack, mark as EMCP so that
3424         // we can add breakpoints for it.
3425 
3426         // We set the method->on_stack bit during safepoints for class redefinition
3427         // and use this bit to set the is_running_emcp bit.
3428         // After the safepoint, the on_stack bit is cleared and the running emcp
3429         // method may exit.   If so, we would set a breakpoint in a method that
3430         // is never reached, but this won't be noticeable to the programmer.
3431         old_method->set_running_emcp(true);
3432         RC_TRACE(0x00000400, ("add: EMCP method %s is on_stack " INTPTR_FORMAT,
3433                               old_method->name_and_sig_as_C_string(), old_method));
3434       } else if (!old_method->is_obsolete()) {
3435         RC_TRACE(0x00000400, ("add: EMCP method %s is NOT on_stack " INTPTR_FORMAT,
3436                               old_method->name_and_sig_as_C_string(), old_method));
3437       }
3438     }
3439   }
3440 
3441   // Add previous version if any methods are still running.
3442   RC_TRACE(0x00000400, ("add: scratch class added; one of its methods is on_stack"));
3443   assert(scratch_class->previous_versions() == NULL, "shouldn't have a previous version");
3444   scratch_class->link_previous_versions(previous_versions());
3445   link_previous_versions(scratch_class());
3446   // Update count for class unloading.
3447   _previous_version_count++;
3448 } // end add_previous_version()
3449 
3450 
3451 Method* InstanceKlass::method_with_idnum(int idnum) {
3452   Method* m = NULL;
3453   if (idnum < methods()->length()) {
3454     m = methods()->at(idnum);
3455   }
3456   if (m == NULL || m->method_idnum() != idnum) {
3457     for (int index = 0; index < methods()->length(); ++index) {
3458       m = methods()->at(index);
3459       if (m->method_idnum() == idnum) {
3460         return m;
3461       }
3462     }
3463     // None found, return null for the caller to handle.
3464     return NULL;
3465   }
3466   return m;
3467 }
3468 
3469 
3470 Method* InstanceKlass::method_with_orig_idnum(int idnum) {
3471   if (idnum >= methods()->length()) {
3472     return NULL;
3473   }
3474   Method* m = methods()->at(idnum);
3475   if (m != NULL && m->orig_method_idnum() == idnum) {
3476     return m;
3477   }
3478   // Obsolete method idnum does not match the original idnum
3479   for (int index = 0; index < methods()->length(); ++index) {
3480     m = methods()->at(index);
3481     if (m->orig_method_idnum() == idnum) {
3482       return m;
3483     }
3484   }
3485   // None found, return null for the caller to handle.
3486   return NULL;
3487 }
3488 
3489 
3490 Method* InstanceKlass::method_with_orig_idnum(int idnum, int version) {
3491   InstanceKlass* holder = get_klass_version(version);
3492   if (holder == NULL) {
3493     return NULL; // The version of klass is gone, no method is found
3494   }
3495   Method* method = holder->method_with_orig_idnum(idnum);
3496   return method;
3497 }
3498 
3499 
3500 jint InstanceKlass::get_cached_class_file_len() {
3501   return VM_RedefineClasses::get_cached_class_file_len(_cached_class_file);
3502 }
3503 
3504 unsigned char * InstanceKlass::get_cached_class_file_bytes() {
3505   return VM_RedefineClasses::get_cached_class_file_bytes(_cached_class_file);
3506 }
--- EOF ---