annotate src/share/vm/oops/instanceKlass.cpp @ 4841:6bd680e9ea35

8003421: NPG: Move oops out of InstanceKlass into mirror Summary: Inject protection_domain, signers, init_lock into java_lang_Class Reviewed-by: stefank, dholmes, sla
author coleenp
date Wed, 22 May 2013 14:37:49 -0400
parents 92ef81e2f571
children b7fa10a3a69a
rev   line source
duke@0 1 /*
acorn@4139 2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
trims@1472 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1472 20 * or visit www.oracle.com if you need additional information or have any
trims@1472 21 * questions.
duke@0 22 *
duke@0 23 */
duke@0 24
stefank@1885 25 #include "precompiled.hpp"
stefank@1885 26 #include "classfile/javaClasses.hpp"
stefank@1885 27 #include "classfile/systemDictionary.hpp"
stefank@1885 28 #include "classfile/verifier.hpp"
stefank@1885 29 #include "classfile/vmSymbols.hpp"
stefank@1885 30 #include "compiler/compileBroker.hpp"
stefank@1885 31 #include "gc_implementation/shared/markSweep.inline.hpp"
stefank@1885 32 #include "gc_interface/collectedHeap.inline.hpp"
stefank@1885 33 #include "interpreter/oopMapCache.hpp"
stefank@1885 34 #include "interpreter/rewriter.hpp"
stefank@1885 35 #include "jvmtifiles/jvmti.h"
stefank@1885 36 #include "memory/genOopClosures.inline.hpp"
acorn@4139 37 #include "memory/heapInspection.hpp"
coleenp@3656 38 #include "memory/metadataFactory.hpp"
stefank@1885 39 #include "memory/oopFactory.hpp"
never@2712 40 #include "oops/fieldStreams.hpp"
coleenp@3656 41 #include "oops/instanceClassLoaderKlass.hpp"
stefank@1885 42 #include "oops/instanceKlass.hpp"
never@2231 43 #include "oops/instanceMirrorKlass.hpp"
stefank@1885 44 #include "oops/instanceOop.hpp"
coleenp@3656 45 #include "oops/klass.inline.hpp"
coleenp@3656 46 #include "oops/method.hpp"
stefank@1885 47 #include "oops/oop.inline.hpp"
coleenp@2069 48 #include "oops/symbol.hpp"
stefank@1885 49 #include "prims/jvmtiExport.hpp"
stefank@1885 50 #include "prims/jvmtiRedefineClassesTrace.hpp"
coleenp@4035 51 #include "prims/methodComparator.hpp"
stefank@1885 52 #include "runtime/fieldDescriptor.hpp"
stefank@1885 53 #include "runtime/handles.inline.hpp"
stefank@1885 54 #include "runtime/javaCalls.hpp"
stefank@1885 55 #include "runtime/mutexLocker.hpp"
stefank@3931 56 #include "runtime/thread.inline.hpp"
coleenp@4642 57 #include "services/classLoadingService.hpp"
stefank@1885 58 #include "services/threadService.hpp"
stefank@1885 59 #include "utilities/dtrace.hpp"
jprovino@4184 60 #include "utilities/macros.hpp"
jprovino@4184 61 #if INCLUDE_ALL_GCS
coleenp@3656 62 #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp"
stefank@1885 63 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
stefank@1885 64 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
stefank@1885 65 #include "gc_implementation/g1/g1RemSet.inline.hpp"
stefank@1885 66 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
stefank@1885 67 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
coleenp@3656 68 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.inline.hpp"
stefank@1885 69 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
stefank@1885 70 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
stefank@1885 71 #include "oops/oop.pcgc.inline.hpp"
jprovino@4184 72 #endif // INCLUDE_ALL_GCS
stefank@1885 73 #ifdef COMPILER1
stefank@1885 74 #include "c1/c1_Compiler.hpp"
stefank@1885 75 #endif
duke@0 76
fparain@1324 77 #ifdef DTRACE_ENABLED
fparain@1324 78
dcubed@2777 79 #ifndef USDT2
dcubed@2777 80
fparain@1324 81 HS_DTRACE_PROBE_DECL4(hotspot, class__initialization__required,
fparain@1324 82 char*, intptr_t, oop, intptr_t);
fparain@1324 83 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__recursive,
fparain@1324 84 char*, intptr_t, oop, intptr_t, int);
fparain@1324 85 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__concurrent,
fparain@1324 86 char*, intptr_t, oop, intptr_t, int);
fparain@1324 87 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__erroneous,
fparain@1324 88 char*, intptr_t, oop, intptr_t, int);
fparain@1324 89 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__super__failed,
fparain@1324 90 char*, intptr_t, oop, intptr_t, int);
fparain@1324 91 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__clinit,
fparain@1324 92 char*, intptr_t, oop, intptr_t, int);
fparain@1324 93 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__error,
fparain@1324 94 char*, intptr_t, oop, intptr_t, int);
fparain@1324 95 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__end,
fparain@1324 96 char*, intptr_t, oop, intptr_t, int);
fparain@1324 97
fparain@1324 98 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \
fparain@1324 99 { \
fparain@1324 100 char* data = NULL; \
fparain@1324 101 int len = 0; \
coleenp@2069 102 Symbol* name = (clss)->name(); \
fparain@1324 103 if (name != NULL) { \
fparain@1324 104 data = (char*)name->bytes(); \
fparain@1324 105 len = name->utf8_length(); \
fparain@1324 106 } \
fparain@1324 107 HS_DTRACE_PROBE4(hotspot, class__initialization__##type, \
fparain@1324 108 data, len, (clss)->class_loader(), thread_type); \
fparain@1324 109 }
fparain@1324 110
fparain@1324 111 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \
fparain@1324 112 { \
fparain@1324 113 char* data = NULL; \
fparain@1324 114 int len = 0; \
coleenp@2069 115 Symbol* name = (clss)->name(); \
fparain@1324 116 if (name != NULL) { \
fparain@1324 117 data = (char*)name->bytes(); \
fparain@1324 118 len = name->utf8_length(); \
fparain@1324 119 } \
fparain@1324 120 HS_DTRACE_PROBE5(hotspot, class__initialization__##type, \
fparain@1324 121 data, len, (clss)->class_loader(), thread_type, wait); \
fparain@1324 122 }
dcubed@2777 123 #else /* USDT2 */
dcubed@2777 124
dcubed@2777 125 #define HOTSPOT_CLASS_INITIALIZATION_required HOTSPOT_CLASS_INITIALIZATION_REQUIRED
dcubed@2777 126 #define HOTSPOT_CLASS_INITIALIZATION_recursive HOTSPOT_CLASS_INITIALIZATION_RECURSIVE
dcubed@2777 127 #define HOTSPOT_CLASS_INITIALIZATION_concurrent HOTSPOT_CLASS_INITIALIZATION_CONCURRENT
dcubed@2777 128 #define HOTSPOT_CLASS_INITIALIZATION_erroneous HOTSPOT_CLASS_INITIALIZATION_ERRONEOUS
dcubed@2777 129 #define HOTSPOT_CLASS_INITIALIZATION_super__failed HOTSPOT_CLASS_INITIALIZATION_SUPER_FAILED
dcubed@2777 130 #define HOTSPOT_CLASS_INITIALIZATION_clinit HOTSPOT_CLASS_INITIALIZATION_CLINIT
dcubed@2777 131 #define HOTSPOT_CLASS_INITIALIZATION_error HOTSPOT_CLASS_INITIALIZATION_ERROR
dcubed@2777 132 #define HOTSPOT_CLASS_INITIALIZATION_end HOTSPOT_CLASS_INITIALIZATION_END
dcubed@2777 133 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \
dcubed@2777 134 { \
dcubed@2777 135 char* data = NULL; \
dcubed@2777 136 int len = 0; \
dcubed@2777 137 Symbol* name = (clss)->name(); \
dcubed@2777 138 if (name != NULL) { \
dcubed@2777 139 data = (char*)name->bytes(); \
dcubed@2777 140 len = name->utf8_length(); \
dcubed@2777 141 } \
dcubed@2777 142 HOTSPOT_CLASS_INITIALIZATION_##type( \
dcubed@2777 143 data, len, (clss)->class_loader(), thread_type); \
dcubed@2777 144 }
dcubed@2777 145
dcubed@2777 146 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \
dcubed@2777 147 { \
dcubed@2777 148 char* data = NULL; \
dcubed@2777 149 int len = 0; \
dcubed@2777 150 Symbol* name = (clss)->name(); \
dcubed@2777 151 if (name != NULL) { \
dcubed@2777 152 data = (char*)name->bytes(); \
dcubed@2777 153 len = name->utf8_length(); \
dcubed@2777 154 } \
dcubed@2777 155 HOTSPOT_CLASS_INITIALIZATION_##type( \
dcubed@2777 156 data, len, (clss)->class_loader(), thread_type, wait); \
dcubed@2777 157 }
dcubed@2777 158 #endif /* USDT2 */
fparain@1324 159
fparain@1324 160 #else // ndef DTRACE_ENABLED
fparain@1324 161
fparain@1324 162 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type)
fparain@1324 163 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait)
fparain@1324 164
fparain@1324 165 #endif // ndef DTRACE_ENABLED
fparain@1324 166
zgu@4040 167 volatile int InstanceKlass::_total_instanceKlass_count = 0;
zgu@4040 168
coleenp@4367 169 InstanceKlass* InstanceKlass::allocate_instance_klass(
coleenp@4367 170 ClassLoaderData* loader_data,
coleenp@4214 171 int vtable_len,
coleenp@4214 172 int itable_len,
coleenp@4214 173 int static_field_size,
coleenp@4214 174 int nonstatic_oop_map_size,
coleenp@4214 175 ReferenceType rt,
coleenp@4214 176 AccessFlags access_flags,
coleenp@4214 177 Symbol* name,
coleenp@3656 178 Klass* super_klass,
coleenp@4214 179 bool is_anonymous,
coleenp@4214 180 TRAPS) {
coleenp@3656 181
coleenp@3656 182 int size = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size,
coleenp@4214 183 access_flags.is_interface(), is_anonymous);
coleenp@3656 184
coleenp@3656 185 // Allocation
coleenp@3656 186 InstanceKlass* ik;
coleenp@3656 187 if (rt == REF_NONE) {
coleenp@3656 188 if (name == vmSymbols::java_lang_Class()) {
coleenp@3666 189 ik = new (loader_data, size, THREAD) InstanceMirrorKlass(
coleenp@3656 190 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
coleenp@4214 191 access_flags, is_anonymous);
coleenp@3656 192 } else if (name == vmSymbols::java_lang_ClassLoader() ||
coleenp@3656 193 (SystemDictionary::ClassLoader_klass_loaded() &&
coleenp@3656 194 super_klass != NULL &&
coleenp@3656 195 super_klass->is_subtype_of(SystemDictionary::ClassLoader_klass()))) {
coleenp@3666 196 ik = new (loader_data, size, THREAD) InstanceClassLoaderKlass(
coleenp@3656 197 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
coleenp@4214 198 access_flags, is_anonymous);
coleenp@3656 199 } else {
coleenp@3656 200 // normal class
coleenp@3656 201 ik = new (loader_data, size, THREAD) InstanceKlass(
coleenp@3656 202 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
coleenp@4214 203 access_flags, is_anonymous);
coleenp@3656 204 }
coleenp@3656 205 } else {
coleenp@3656 206 // reference klass
coleenp@3666 207 ik = new (loader_data, size, THREAD) InstanceRefKlass(
coleenp@3656 208 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
coleenp@4214 209 access_flags, is_anonymous);
coleenp@3656 210 }
coleenp@3656 211
coleenp@4367 212 // Check for pending exception before adding to the loader data and incrementing
coleenp@4367 213 // class count. Can get OOM here.
coleenp@4367 214 if (HAS_PENDING_EXCEPTION) {
coleenp@4367 215 return NULL;
coleenp@4367 216 }
coleenp@4367 217
coleenp@4367 218 // Add all classes to our internal class loader list here,
coleenp@4367 219 // including classes in the bootstrap (NULL) class loader.
coleenp@4367 220 loader_data->add_class(ik);
coleenp@4367 221
zgu@4040 222 Atomic::inc(&_total_instanceKlass_count);
coleenp@3656 223 return ik;
coleenp@3656 224 }
coleenp@3656 225
coleenp@4367 226
coleenp@4367 227 // copy method ordering from resource area to Metaspace
coleenp@4367 228 void InstanceKlass::copy_method_ordering(intArray* m, TRAPS) {
coleenp@4367 229 if (m != NULL) {
coleenp@4367 230 // allocate a new array and copy contents (memcpy?)
coleenp@4367 231 _method_ordering = MetadataFactory::new_array<int>(class_loader_data(), m->length(), CHECK);
coleenp@4367 232 for (int i = 0; i < m->length(); i++) {
coleenp@4367 233 _method_ordering->at_put(i, m->at(i));
coleenp@4367 234 }
coleenp@4367 235 } else {
coleenp@4367 236 _method_ordering = Universe::the_empty_int_array();
coleenp@4367 237 }
coleenp@4367 238 }
coleenp@4367 239
coleenp@4367 240
coleenp@3656 241 InstanceKlass::InstanceKlass(int vtable_len,
coleenp@3656 242 int itable_len,
coleenp@3656 243 int static_field_size,
coleenp@3656 244 int nonstatic_oop_map_size,
coleenp@3656 245 ReferenceType rt,
coleenp@3656 246 AccessFlags access_flags,
coleenp@3656 247 bool is_anonymous) {
coleenp@3656 248 No_Safepoint_Verifier no_safepoint; // until k becomes parsable
coleenp@3656 249
coleenp@4360 250 int iksize = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size,
coleenp@4360 251 access_flags.is_interface(), is_anonymous);
coleenp@3656 252
coleenp@4360 253 set_vtable_length(vtable_len);
coleenp@4360 254 set_itable_length(itable_len);
coleenp@4360 255 set_static_field_size(static_field_size);
coleenp@4360 256 set_nonstatic_oop_map_size(nonstatic_oop_map_size);
coleenp@4360 257 set_access_flags(access_flags);
coleenp@4360 258 _misc_flags = 0; // initialize to zero
coleenp@4360 259 set_is_anonymous(is_anonymous);
coleenp@4360 260 assert(size() == iksize, "wrong size for object");
coleenp@4360 261
coleenp@4360 262 set_array_klasses(NULL);
coleenp@4360 263 set_methods(NULL);
coleenp@4360 264 set_method_ordering(NULL);
coleenp@4360 265 set_local_interfaces(NULL);
coleenp@4360 266 set_transitive_interfaces(NULL);
coleenp@4360 267 init_implementor();
coleenp@4360 268 set_fields(NULL, 0);
coleenp@4360 269 set_constants(NULL);
coleenp@4360 270 set_class_loader_data(NULL);
coleenp@4360 271 set_source_file_name(NULL);
coleenp@4360 272 set_source_debug_extension(NULL, 0);
coleenp@4360 273 set_array_name(NULL);
coleenp@4360 274 set_inner_classes(NULL);
coleenp@4360 275 set_static_oop_field_count(0);
coleenp@4360 276 set_nonstatic_field_size(0);
coleenp@4360 277 set_is_marked_dependent(false);
coleenp@4360 278 set_init_state(InstanceKlass::allocated);
coleenp@4360 279 set_init_thread(NULL);
coleenp@4360 280 set_reference_type(rt);
coleenp@4360 281 set_oop_map_cache(NULL);
coleenp@4360 282 set_jni_ids(NULL);
coleenp@4360 283 set_osr_nmethods_head(NULL);
coleenp@4360 284 set_breakpoints(NULL);
coleenp@4360 285 init_previous_versions();
coleenp@4360 286 set_generic_signature(NULL);
coleenp@4360 287 release_set_methods_jmethod_ids(NULL);
coleenp@4360 288 release_set_methods_cached_itable_indices(NULL);
coleenp@4360 289 set_annotations(NULL);
coleenp@4360 290 set_jvmti_cached_class_field_map(NULL);
coleenp@4360 291 set_initial_method_idnum(0);
coleenp@4360 292 _dependencies = NULL;
coleenp@4360 293 set_jvmti_cached_class_field_map(NULL);
coleenp@4360 294 set_cached_class_file(NULL, 0);
coleenp@4360 295 set_initial_method_idnum(0);
coleenp@4360 296 set_minor_version(0);
coleenp@4360 297 set_major_version(0);
coleenp@4360 298 NOT_PRODUCT(_verify_count = 0;)
coleenp@3656 299
coleenp@3656 300 // initialize the non-header words to zero
coleenp@3656 301 intptr_t* p = (intptr_t*)this;
coleenp@4360 302 for (int index = InstanceKlass::header_size(); index < iksize; index++) {
coleenp@3656 303 p[index] = NULL_WORD;
coleenp@3656 304 }
coleenp@3656 305
coleenp@3656 306 // Set temporary value until parseClassFile updates it with the real instance
coleenp@3656 307 // size.
coleenp@4360 308 set_layout_helper(Klass::instance_layout_helper(0, true));
coleenp@3656 309 }
coleenp@3656 310
coleenp@3656 311
coleenp@4367 312 void InstanceKlass::deallocate_methods(ClassLoaderData* loader_data,
coleenp@4367 313 Array<Method*>* methods) {
coleenp@4367 314 if (methods != NULL && methods != Universe::the_empty_method_array()) {
coleenp@4367 315 for (int i = 0; i < methods->length(); i++) {
coleenp@4367 316 Method* method = methods->at(i);
coleenp@4367 317 if (method == NULL) continue; // maybe null if error processing
coleenp@4367 318 // Only want to delete methods that are not executing for RedefineClasses.
coleenp@4367 319 // The previous version will point to them so they're not totally dangling
coleenp@4367 320 assert (!method->on_stack(), "shouldn't be called with methods on stack");
coleenp@4367 321 MetadataFactory::free_metadata(loader_data, method);
coleenp@4367 322 }
coleenp@4367 323 MetadataFactory::free_array<Method*>(loader_data, methods);
coleenp@4367 324 }
coleenp@4367 325 }
coleenp@4367 326
coleenp@4367 327 void InstanceKlass::deallocate_interfaces(ClassLoaderData* loader_data,
coleenp@4367 328 Klass* super_klass,
coleenp@4367 329 Array<Klass*>* local_interfaces,
coleenp@4367 330 Array<Klass*>* transitive_interfaces) {
coleenp@4367 331 // Only deallocate transitive interfaces if not empty, same as super class
coleenp@4367 332 // or same as local interfaces. See code in parseClassFile.
coleenp@4367 333 Array<Klass*>* ti = transitive_interfaces;
coleenp@4367 334 if (ti != Universe::the_empty_klass_array() && ti != local_interfaces) {
coleenp@4367 335 // check that the interfaces don't come from super class
coleenp@4367 336 Array<Klass*>* sti = (super_klass == NULL) ? NULL :
coleenp@4367 337 InstanceKlass::cast(super_klass)->transitive_interfaces();
coleenp@4367 338 if (ti != sti) {
coleenp@4367 339 MetadataFactory::free_array<Klass*>(loader_data, ti);
coleenp@4367 340 }
coleenp@4367 341 }
coleenp@4367 342
coleenp@4367 343 // local interfaces can be empty
coleenp@4367 344 if (local_interfaces != Universe::the_empty_klass_array()) {
coleenp@4367 345 MetadataFactory::free_array<Klass*>(loader_data, local_interfaces);
coleenp@4367 346 }
coleenp@4367 347 }
coleenp@4367 348
coleenp@3656 349 // This function deallocates the metadata and C heap pointers that the
coleenp@3656 350 // InstanceKlass points to.
coleenp@3656 351 void InstanceKlass::deallocate_contents(ClassLoaderData* loader_data) {
coleenp@3656 352
coleenp@3656 353 // Orphan the mirror first, CMS thinks it's still live.
coleenp@4367 354 if (java_mirror() != NULL) {
coleenp@4367 355 java_lang_Class::set_klass(java_mirror(), NULL);
coleenp@4367 356 }
coleenp@3656 357
coleenp@3656 358 // Need to take this class off the class loader data list.
coleenp@3656 359 loader_data->remove_class(this);
coleenp@3656 360
coleenp@3656 361 // The array_klass for this class is created later, after error handling.
coleenp@3656 362 // For class redefinition, we keep the original class so this scratch class
coleenp@3656 363 // doesn't have an array class. Either way, assert that there is nothing
coleenp@3656 364 // to deallocate.
coleenp@3656 365 assert(array_klasses() == NULL, "array classes shouldn't be created for this class yet");
coleenp@3656 366
coleenp@3656 367 // Release C heap allocated data that this might point to, which includes
coleenp@3656 368 // reference counting symbol names.
coleenp@3656 369 release_C_heap_structures();
coleenp@3656 370
coleenp@4367 371 deallocate_methods(loader_data, methods());
coleenp@3656 372 set_methods(NULL);
coleenp@3656 373
coleenp@3656 374 if (method_ordering() != Universe::the_empty_int_array()) {
coleenp@3656 375 MetadataFactory::free_array<int>(loader_data, method_ordering());
coleenp@3656 376 }
coleenp@3656 377 set_method_ordering(NULL);
coleenp@3656 378
coleenp@3656 379 // This array is in Klass, but remove it with the InstanceKlass since
coleenp@3656 380 // this place would be the only caller and it can share memory with transitive
coleenp@3656 381 // interfaces.
coleenp@3656 382 if (secondary_supers() != Universe::the_empty_klass_array() &&
coleenp@3656 383 secondary_supers() != transitive_interfaces()) {
coleenp@3656 384 MetadataFactory::free_array<Klass*>(loader_data, secondary_supers());
coleenp@3656 385 }
coleenp@3656 386 set_secondary_supers(NULL);
coleenp@3656 387
coleenp@4367 388 deallocate_interfaces(loader_data, super(), local_interfaces(), transitive_interfaces());
coleenp@3656 389 set_transitive_interfaces(NULL);
coleenp@3656 390 set_local_interfaces(NULL);
coleenp@3656 391
coleenp@3656 392 MetadataFactory::free_array<jushort>(loader_data, fields());
coleenp@3656 393 set_fields(NULL, 0);
coleenp@3656 394
coleenp@3656 395 // If a method from a redefined class is using this constant pool, don't
coleenp@3656 396 // delete it, yet. The new class's previous version will point to this.
coleenp@4367 397 if (constants() != NULL) {
coleenp@4367 398 assert (!constants()->on_stack(), "shouldn't be called if anything is onstack");
coleenp@4367 399 MetadataFactory::free_metadata(loader_data, constants());
coleenp@4367 400 set_constants(NULL);
coleenp@4367 401 }
coleenp@3656 402
coleenp@3656 403 if (inner_classes() != Universe::the_empty_short_array()) {
coleenp@3656 404 MetadataFactory::free_array<jushort>(loader_data, inner_classes());
coleenp@3656 405 }
coleenp@3656 406 set_inner_classes(NULL);
coleenp@3656 407
stefank@4033 408 // We should deallocate the Annotations instance
stefank@4033 409 MetadataFactory::free_metadata(loader_data, annotations());
coleenp@3656 410 set_annotations(NULL);
coleenp@3656 411 }
coleenp@3656 412
coleenp@3656 413 bool InstanceKlass::should_be_initialized() const {
duke@0 414 return !is_initialized();
duke@0 415 }
duke@0 416
coleenp@3656 417 klassVtable* InstanceKlass::vtable() const {
coleenp@3656 418 return new klassVtable(this, start_of_vtable(), vtable_length() / vtableEntry::size());
duke@0 419 }
duke@0 420
coleenp@3656 421 klassItable* InstanceKlass::itable() const {
coleenp@3656 422 return new klassItable(instanceKlassHandle(this));
duke@0 423 }
duke@0 424
coleenp@3656 425 void InstanceKlass::eager_initialize(Thread *thread) {
duke@0 426 if (!EagerInitialization) return;
duke@0 427
duke@0 428 if (this->is_not_initialized()) {
duke@0 429 // abort if the the class has a class initializer
duke@0 430 if (this->class_initializer() != NULL) return;
duke@0 431
duke@0 432 // abort if it is java.lang.Object (initialization is handled in genesis)
coleenp@3656 433 Klass* super = this->super();
duke@0 434 if (super == NULL) return;
duke@0 435
duke@0 436 // abort if the super class should be initialized
coleenp@3656 437 if (!InstanceKlass::cast(super)->is_initialized()) return;
duke@0 438
duke@0 439 // call body to expose the this pointer
coleenp@3656 440 instanceKlassHandle this_oop(thread, this);
duke@0 441 eager_initialize_impl(this_oop);
duke@0 442 }
duke@0 443 }
duke@0 444
coleenp@4841 445 // JVMTI spec thinks there are signers and protection domain in the
coleenp@4841 446 // instanceKlass. These accessors pretend these fields are there.
coleenp@4841 447 // The hprof specification also thinks these fields are in InstanceKlass.
coleenp@4841 448 oop InstanceKlass::protection_domain() const {
coleenp@4841 449 // return the protection_domain from the mirror
coleenp@4841 450 return java_lang_Class::protection_domain(java_mirror());
coleenp@4841 451 }
coleenp@4841 452
coleenp@4841 453 // To remove these from requires an incompatible change and CCC request.
coleenp@4841 454 objArrayOop InstanceKlass::signers() const {
coleenp@4841 455 // return the signers from the mirror
coleenp@4841 456 return java_lang_Class::signers(java_mirror());
coleenp@4841 457 }
coleenp@4841 458
coleenp@4841 459 volatile oop InstanceKlass::init_lock() const {
coleenp@4841 460 // return the init lock from the mirror
coleenp@4841 461 return java_lang_Class::init_lock(java_mirror());
coleenp@4841 462 }
duke@0 463
coleenp@3656 464 void InstanceKlass::eager_initialize_impl(instanceKlassHandle this_oop) {
duke@0 465 EXCEPTION_MARK;
coleenp@3656 466 volatile oop init_lock = this_oop->init_lock();
iklam@4645 467 ObjectLocker ol(init_lock, THREAD);
duke@0 468
duke@0 469 // abort if someone beat us to the initialization
duke@0 470 if (!this_oop->is_not_initialized()) return; // note: not equivalent to is_initialized()
duke@0 471
coleenp@2944 472 ClassState old_state = this_oop->init_state();
duke@0 473 link_class_impl(this_oop, true, THREAD);
duke@0 474 if (HAS_PENDING_EXCEPTION) {
duke@0 475 CLEAR_PENDING_EXCEPTION;
duke@0 476 // Abort if linking the class throws an exception.
duke@0 477
duke@0 478 // Use a test to avoid redundantly resetting the state if there's
duke@0 479 // no change. Set_init_state() asserts that state changes make
duke@0 480 // progress, whereas here we might just be spinning in place.
duke@0 481 if( old_state != this_oop->_init_state )
duke@0 482 this_oop->set_init_state (old_state);
duke@0 483 } else {
duke@0 484 // linking successfull, mark class as initialized
duke@0 485 this_oop->set_init_state (fully_initialized);
duke@0 486 // trace
duke@0 487 if (TraceClassInitialization) {
duke@0 488 ResourceMark rm(THREAD);
duke@0 489 tty->print_cr("[Initialized %s without side effects]", this_oop->external_name());
duke@0 490 }
duke@0 491 }
duke@0 492 }
duke@0 493
duke@0 494
duke@0 495 // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization
duke@0 496 // process. The step comments refers to the procedure described in that section.
duke@0 497 // Note: implementation moved to static method to expose the this pointer.
coleenp@3656 498 void InstanceKlass::initialize(TRAPS) {
duke@0 499 if (this->should_be_initialized()) {
duke@0 500 HandleMark hm(THREAD);
coleenp@3656 501 instanceKlassHandle this_oop(THREAD, this);
duke@0 502 initialize_impl(this_oop, CHECK);
duke@0 503 // Note: at this point the class may be initialized
duke@0 504 // OR it may be in the state of being initialized
duke@0 505 // in case of recursive initialization!
duke@0 506 } else {
duke@0 507 assert(is_initialized(), "sanity check");
duke@0 508 }
duke@0 509 }
duke@0 510
duke@0 511
coleenp@3656 512 bool InstanceKlass::verify_code(
duke@0 513 instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) {
duke@0 514 // 1) Verify the bytecodes
duke@0 515 Verifier::Mode mode =
duke@0 516 throw_verifyerror ? Verifier::ThrowException : Verifier::NoException;
acorn@973 517 return Verifier::verify(this_oop, mode, this_oop->should_verify_class(), CHECK_false);
duke@0 518 }
duke@0 519
duke@0 520
duke@0 521 // Used exclusively by the shared spaces dump mechanism to prevent
duke@0 522 // classes mapped into the shared regions in new VMs from appearing linked.
duke@0 523
coleenp@3656 524 void InstanceKlass::unlink_class() {
duke@0 525 assert(is_linked(), "must be linked");
duke@0 526 _init_state = loaded;
duke@0 527 }
duke@0 528
coleenp@3656 529 void InstanceKlass::link_class(TRAPS) {
duke@0 530 assert(is_loaded(), "must be loaded");
duke@0 531 if (!is_linked()) {
coleenp@3656 532 HandleMark hm(THREAD);
coleenp@3656 533 instanceKlassHandle this_oop(THREAD, this);
duke@0 534 link_class_impl(this_oop, true, CHECK);
duke@0 535 }
duke@0 536 }
duke@0 537
duke@0 538 // Called to verify that a class can link during initialization, without
duke@0 539 // throwing a VerifyError.
coleenp@3656 540 bool InstanceKlass::link_class_or_fail(TRAPS) {
duke@0 541 assert(is_loaded(), "must be loaded");
duke@0 542 if (!is_linked()) {
coleenp@3656 543 HandleMark hm(THREAD);
coleenp@3656 544 instanceKlassHandle this_oop(THREAD, this);
duke@0 545 link_class_impl(this_oop, false, CHECK_false);
duke@0 546 }
duke@0 547 return is_linked();
duke@0 548 }
duke@0 549
coleenp@3656 550 bool InstanceKlass::link_class_impl(
duke@0 551 instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) {
duke@0 552 // check for error state
duke@0 553 if (this_oop->is_in_error_state()) {
duke@0 554 ResourceMark rm(THREAD);
duke@0 555 THROW_MSG_(vmSymbols::java_lang_NoClassDefFoundError(),
duke@0 556 this_oop->external_name(), false);
duke@0 557 }
duke@0 558 // return if already verified
duke@0 559 if (this_oop->is_linked()) {
duke@0 560 return true;
duke@0 561 }
duke@0 562
duke@0 563 // Timing
duke@0 564 // timer handles recursion
duke@0 565 assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl");
duke@0 566 JavaThread* jt = (JavaThread*)THREAD;
duke@0 567
duke@0 568 // link super class before linking this class
duke@0 569 instanceKlassHandle super(THREAD, this_oop->super());
duke@0 570 if (super.not_null()) {
duke@0 571 if (super->is_interface()) { // check if super class is an interface
duke@0 572 ResourceMark rm(THREAD);
duke@0 573 Exceptions::fthrow(
duke@0 574 THREAD_AND_LOCATION,
coleenp@2069 575 vmSymbols::java_lang_IncompatibleClassChangeError(),
duke@0 576 "class %s has interface %s as super class",
duke@0 577 this_oop->external_name(),
duke@0 578 super->external_name()
duke@0 579 );
duke@0 580 return false;
duke@0 581 }
duke@0 582
duke@0 583 link_class_impl(super, throw_verifyerror, CHECK_false);
duke@0 584 }
duke@0 585
duke@0 586 // link all interfaces implemented by this class before linking this class
coleenp@3656 587 Array<Klass*>* interfaces = this_oop->local_interfaces();
duke@0 588 int num_interfaces = interfaces->length();
duke@0 589 for (int index = 0; index < num_interfaces; index++) {
duke@0 590 HandleMark hm(THREAD);
coleenp@3656 591 instanceKlassHandle ih(THREAD, interfaces->at(index));
duke@0 592 link_class_impl(ih, throw_verifyerror, CHECK_false);
duke@0 593 }
duke@0 594
duke@0 595 // in case the class is linked in the process of linking its superclasses
duke@0 596 if (this_oop->is_linked()) {
duke@0 597 return true;
duke@0 598 }
duke@0 599
mchung@875 600 // trace only the link time for this klass that includes
mchung@875 601 // the verification time
mchung@875 602 PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(),
mchung@875 603 ClassLoader::perf_class_link_selftime(),
mchung@875 604 ClassLoader::perf_classes_linked(),
mchung@875 605 jt->get_thread_stat()->perf_recursion_counts_addr(),
mchung@875 606 jt->get_thread_stat()->perf_timers_addr(),
mchung@875 607 PerfClassTraceTime::CLASS_LINK);
mchung@875 608
duke@0 609 // verification & rewriting
duke@0 610 {
coleenp@3656 611 volatile oop init_lock = this_oop->init_lock();
iklam@4645 612 ObjectLocker ol(init_lock, THREAD);
duke@0 613 // rewritten will have been set if loader constraint error found
duke@0 614 // on an earlier link attempt
duke@0 615 // don't verify or rewrite if already rewritten
coleenp@3656 616
duke@0 617 if (!this_oop->is_linked()) {
duke@0 618 if (!this_oop->is_rewritten()) {
duke@0 619 {
duke@0 620 // Timer includes any side effects of class verification (resolution,
duke@0 621 // etc), but not recursive entry into verify_code().
mchung@875 622 PerfClassTraceTime timer(ClassLoader::perf_class_verify_time(),
mchung@875 623 ClassLoader::perf_class_verify_selftime(),
mchung@875 624 ClassLoader::perf_classes_verified(),
mchung@875 625 jt->get_thread_stat()->perf_recursion_counts_addr(),
mchung@875 626 jt->get_thread_stat()->perf_timers_addr(),
mchung@875 627 PerfClassTraceTime::CLASS_VERIFY);
duke@0 628 bool verify_ok = verify_code(this_oop, throw_verifyerror, THREAD);
duke@0 629 if (!verify_ok) {
duke@0 630 return false;
duke@0 631 }
duke@0 632 }
duke@0 633
duke@0 634 // Just in case a side-effect of verify linked this class already
duke@0 635 // (which can sometimes happen since the verifier loads classes
duke@0 636 // using custom class loaders, which are free to initialize things)
duke@0 637 if (this_oop->is_linked()) {
duke@0 638 return true;
duke@0 639 }
duke@0 640
duke@0 641 // also sets rewritten
duke@0 642 this_oop->rewrite_class(CHECK_false);
duke@0 643 }
duke@0 644
coleenp@2520 645 // relocate jsrs and link methods after they are all rewritten
coleenp@4035 646 this_oop->link_methods(CHECK_false);
coleenp@2520 647
duke@0 648 // Initialize the vtable and interface table after
duke@0 649 // methods have been rewritten since rewrite may
coleenp@3656 650 // fabricate new Method*s.
duke@0 651 // also does loader constraint checking
duke@0 652 if (!this_oop()->is_shared()) {
duke@0 653 ResourceMark rm(THREAD);
duke@0 654 this_oop->vtable()->initialize_vtable(true, CHECK_false);
duke@0 655 this_oop->itable()->initialize_itable(true, CHECK_false);
duke@0 656 }
duke@0 657 #ifdef ASSERT
duke@0 658 else {
duke@0 659 ResourceMark rm(THREAD);
duke@0 660 this_oop->vtable()->verify(tty, true);
duke@0 661 // In case itable verification is ever added.
duke@0 662 // this_oop->itable()->verify(tty, true);
duke@0 663 }
duke@0 664 #endif
duke@0 665 this_oop->set_init_state(linked);
duke@0 666 if (JvmtiExport::should_post_class_prepare()) {
duke@0 667 Thread *thread = THREAD;
duke@0 668 assert(thread->is_Java_thread(), "thread->is_Java_thread()");
duke@0 669 JvmtiExport::post_class_prepare((JavaThread *) thread, this_oop());
duke@0 670 }
duke@0 671 }
duke@0 672 }
duke@0 673 return true;
duke@0 674 }
duke@0 675
duke@0 676
duke@0 677 // Rewrite the byte codes of all of the methods of a class.
duke@0 678 // The rewriter must be called exactly once. Rewriting must happen after
duke@0 679 // verification but before the first method of the class is executed.
coleenp@3656 680 void InstanceKlass::rewrite_class(TRAPS) {
duke@0 681 assert(is_loaded(), "must be loaded");
coleenp@3656 682 instanceKlassHandle this_oop(THREAD, this);
duke@0 683 if (this_oop->is_rewritten()) {
duke@0 684 assert(this_oop()->is_shared(), "rewriting an unshared class?");
duke@0 685 return;
duke@0 686 }
coleenp@2520 687 Rewriter::rewrite(this_oop, CHECK);
duke@0 688 this_oop->set_rewritten();
duke@0 689 }
duke@0 690
coleenp@2520 691 // Now relocate and link method entry points after class is rewritten.
coleenp@2520 692 // This is outside is_rewritten flag. In case of an exception, it can be
coleenp@2520 693 // executed more than once.
coleenp@4035 694 void InstanceKlass::link_methods(TRAPS) {
coleenp@4035 695 int len = methods()->length();
coleenp@4035 696 for (int i = len-1; i >= 0; i--) {
coleenp@4035 697 methodHandle m(THREAD, methods()->at(i));
coleenp@4035 698
coleenp@4035 699 // Set up method entry points for compiler and interpreter .
coleenp@4035 700 m->link_method(m, CHECK);
coleenp@4035 701
coleenp@4035 702 // This is for JVMTI and unrelated to relocator but the last thing we do
coleenp@4035 703 #ifdef ASSERT
coleenp@4035 704 if (StressMethodComparator) {
coleenp@4035 705 ResourceMark rm(THREAD);
coleenp@4035 706 static int nmc = 0;
coleenp@4035 707 for (int j = i; j >= 0 && j >= i-4; j--) {
coleenp@4035 708 if ((++nmc % 1000) == 0) tty->print_cr("Have run MethodComparator %d times...", nmc);
coleenp@4035 709 bool z = MethodComparator::methods_EMCP(m(),
coleenp@4035 710 methods()->at(j));
coleenp@4035 711 if (j == i && !z) {
coleenp@4035 712 tty->print("MethodComparator FAIL: "); m->print(); m->print_codes();
coleenp@4035 713 assert(z, "method must compare equal to itself");
coleenp@4035 714 }
coleenp@4035 715 }
coleenp@4035 716 }
coleenp@4035 717 #endif //ASSERT
coleenp@4035 718 }
coleenp@2520 719 }
coleenp@2520 720
duke@0 721
coleenp@3656 722 void InstanceKlass::initialize_impl(instanceKlassHandle this_oop, TRAPS) {
duke@0 723 // Make sure klass is linked (verified) before initialization
duke@0 724 // A class could already be verified, since it has been reflected upon.
duke@0 725 this_oop->link_class(CHECK);
duke@0 726
coleenp@3656 727 DTRACE_CLASSINIT_PROBE(required, InstanceKlass::cast(this_oop()), -1);
fparain@1324 728
fparain@1324 729 bool wait = false;
fparain@1324 730
duke@0 731 // refer to the JVM book page 47 for description of steps
duke@0 732 // Step 1
coleenp@3656 733 {
coleenp@3656 734 volatile oop init_lock = this_oop->init_lock();
iklam@4645 735 ObjectLocker ol(init_lock, THREAD);
duke@0 736
duke@0 737 Thread *self = THREAD; // it's passed the current thread
duke@0 738
duke@0 739 // Step 2
duke@0 740 // If we were to use wait() instead of waitInterruptibly() then
duke@0 741 // we might end up throwing IE from link/symbol resolution sites
duke@0 742 // that aren't expected to throw. This would wreak havoc. See 6320309.
duke@0 743 while(this_oop->is_being_initialized() && !this_oop->is_reentrant_initialization(self)) {
fparain@1324 744 wait = true;
duke@0 745 ol.waitUninterruptibly(CHECK);
duke@0 746 }
duke@0 747
duke@0 748 // Step 3
fparain@1324 749 if (this_oop->is_being_initialized() && this_oop->is_reentrant_initialization(self)) {
coleenp@3656 750 DTRACE_CLASSINIT_PROBE_WAIT(recursive, InstanceKlass::cast(this_oop()), -1,wait);
duke@0 751 return;
fparain@1324 752 }
duke@0 753
duke@0 754 // Step 4
fparain@1324 755 if (this_oop->is_initialized()) {
coleenp@3656 756 DTRACE_CLASSINIT_PROBE_WAIT(concurrent, InstanceKlass::cast(this_oop()), -1,wait);
duke@0 757 return;
fparain@1324 758 }
duke@0 759
duke@0 760 // Step 5
duke@0 761 if (this_oop->is_in_error_state()) {
coleenp@3656 762 DTRACE_CLASSINIT_PROBE_WAIT(erroneous, InstanceKlass::cast(this_oop()), -1,wait);
duke@0 763 ResourceMark rm(THREAD);
duke@0 764 const char* desc = "Could not initialize class ";
duke@0 765 const char* className = this_oop->external_name();
duke@0 766 size_t msglen = strlen(desc) + strlen(className) + 1;
kamg@1675 767 char* message = NEW_RESOURCE_ARRAY(char, msglen);
duke@0 768 if (NULL == message) {
duke@0 769 // Out of memory: can't create detailed error message
duke@0 770 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className);
duke@0 771 } else {
duke@0 772 jio_snprintf(message, msglen, "%s%s", desc, className);
duke@0 773 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message);
duke@0 774 }
duke@0 775 }
duke@0 776
duke@0 777 // Step 6
duke@0 778 this_oop->set_init_state(being_initialized);
duke@0 779 this_oop->set_init_thread(self);
duke@0 780 }
duke@0 781
duke@0 782 // Step 7
coleenp@3656 783 Klass* super_klass = this_oop->super();
hseigel@3908 784 if (super_klass != NULL && !this_oop->is_interface() && super_klass->should_be_initialized()) {
hseigel@3908 785 super_klass->initialize(THREAD);
duke@0 786
duke@0 787 if (HAS_PENDING_EXCEPTION) {
duke@0 788 Handle e(THREAD, PENDING_EXCEPTION);
duke@0 789 CLEAR_PENDING_EXCEPTION;
duke@0 790 {
duke@0 791 EXCEPTION_MARK;
duke@0 792 this_oop->set_initialization_state_and_notify(initialization_error, THREAD); // Locks object, set state, and notify all waiting threads
duke@0 793 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, superclass initialization error is thrown below
duke@0 794 }
coleenp@3656 795 DTRACE_CLASSINIT_PROBE_WAIT(super__failed, InstanceKlass::cast(this_oop()), -1,wait);
duke@0 796 THROW_OOP(e());
duke@0 797 }
duke@0 798 }
duke@0 799
kamg@3874 800 if (this_oop->has_default_methods()) {
kamg@3874 801 // Step 7.5: initialize any interfaces which have default methods
kamg@3874 802 for (int i = 0; i < this_oop->local_interfaces()->length(); ++i) {
kamg@3874 803 Klass* iface = this_oop->local_interfaces()->at(i);
kamg@3874 804 InstanceKlass* ik = InstanceKlass::cast(iface);
kamg@3874 805 if (ik->has_default_methods() && ik->should_be_initialized()) {
kamg@3874 806 ik->initialize(THREAD);
kamg@3874 807
kamg@3874 808 if (HAS_PENDING_EXCEPTION) {
kamg@3874 809 Handle e(THREAD, PENDING_EXCEPTION);
kamg@3874 810 CLEAR_PENDING_EXCEPTION;
kamg@3874 811 {
kamg@3874 812 EXCEPTION_MARK;
kamg@3874 813 // Locks object, set state, and notify all waiting threads
kamg@3874 814 this_oop->set_initialization_state_and_notify(
kamg@3874 815 initialization_error, THREAD);
kamg@3874 816
kamg@3874 817 // ignore any exception thrown, superclass initialization error is
kamg@3874 818 // thrown below
kamg@3874 819 CLEAR_PENDING_EXCEPTION;
kamg@3874 820 }
kamg@3874 821 DTRACE_CLASSINIT_PROBE_WAIT(
kamg@3874 822 super__failed, InstanceKlass::cast(this_oop()), -1, wait);
kamg@3874 823 THROW_OOP(e());
kamg@3874 824 }
kamg@3874 825 }
kamg@3874 826 }
kamg@3874 827 }
kamg@3874 828
duke@0 829 // Step 8
duke@0 830 {
duke@0 831 assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl");
duke@0 832 JavaThread* jt = (JavaThread*)THREAD;
coleenp@3656 833 DTRACE_CLASSINIT_PROBE_WAIT(clinit, InstanceKlass::cast(this_oop()), -1,wait);
duke@0 834 // Timer includes any side effects of class initialization (resolution,
duke@0 835 // etc), but not recursive entry into call_class_initializer().
mchung@875 836 PerfClassTraceTime timer(ClassLoader::perf_class_init_time(),
mchung@875 837 ClassLoader::perf_class_init_selftime(),
mchung@875 838 ClassLoader::perf_classes_inited(),
mchung@875 839 jt->get_thread_stat()->perf_recursion_counts_addr(),
mchung@875 840 jt->get_thread_stat()->perf_timers_addr(),
mchung@875 841 PerfClassTraceTime::CLASS_CLINIT);
duke@0 842 this_oop->call_class_initializer(THREAD);
duke@0 843 }
duke@0 844
duke@0 845 // Step 9
duke@0 846 if (!HAS_PENDING_EXCEPTION) {
duke@0 847 this_oop->set_initialization_state_and_notify(fully_initialized, CHECK);
duke@0 848 { ResourceMark rm(THREAD);
duke@0 849 debug_only(this_oop->vtable()->verify(tty, true);)
duke@0 850 }
duke@0 851 }
duke@0 852 else {
duke@0 853 // Step 10 and 11
duke@0 854 Handle e(THREAD, PENDING_EXCEPTION);
duke@0 855 CLEAR_PENDING_EXCEPTION;
duke@0 856 {
duke@0 857 EXCEPTION_MARK;
duke@0 858 this_oop->set_initialization_state_and_notify(initialization_error, THREAD);
duke@0 859 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below
duke@0 860 }
coleenp@3656 861 DTRACE_CLASSINIT_PROBE_WAIT(error, InstanceKlass::cast(this_oop()), -1,wait);
never@1142 862 if (e->is_a(SystemDictionary::Error_klass())) {
duke@0 863 THROW_OOP(e());
duke@0 864 } else {
duke@0 865 JavaCallArguments args(e);
coleenp@2069 866 THROW_ARG(vmSymbols::java_lang_ExceptionInInitializerError(),
coleenp@2069 867 vmSymbols::throwable_void_signature(),
duke@0 868 &args);
duke@0 869 }
duke@0 870 }
coleenp@3656 871 DTRACE_CLASSINIT_PROBE_WAIT(end, InstanceKlass::cast(this_oop()), -1,wait);
duke@0 872 }
duke@0 873
duke@0 874
duke@0 875 // Note: implementation moved to static method to expose the this pointer.
coleenp@3656 876 void InstanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) {
coleenp@3656 877 instanceKlassHandle kh(THREAD, this);
duke@0 878 set_initialization_state_and_notify_impl(kh, state, CHECK);
duke@0 879 }
duke@0 880
coleenp@3656 881 void InstanceKlass::set_initialization_state_and_notify_impl(instanceKlassHandle this_oop, ClassState state, TRAPS) {
coleenp@3656 882 volatile oop init_lock = this_oop->init_lock();
iklam@4645 883 ObjectLocker ol(init_lock, THREAD);
duke@0 884 this_oop->set_init_state(state);
duke@0 885 ol.notify_all(CHECK);
duke@0 886 }
duke@0 887
jiangli@3296 888 // The embedded _implementor field can only record one implementor.
jiangli@3296 889 // When there are more than one implementors, the _implementor field
coleenp@3656 890 // is set to the interface Klass* itself. Following are the possible
jiangli@3296 891 // values for the _implementor field:
jiangli@3296 892 // NULL - no implementor
coleenp@3656 893 // implementor Klass* - one implementor
jiangli@3296 894 // self - more than one implementor
jiangli@3296 895 //
jiangli@3296 896 // The _implementor field only exists for interfaces.
coleenp@3656 897 void InstanceKlass::add_implementor(Klass* k) {
duke@0 898 assert(Compile_lock->owned_by_self(), "");
jiangli@3296 899 assert(is_interface(), "not interface");
duke@0 900 // Filter out my subinterfaces.
duke@0 901 // (Note: Interfaces are never on the subklass list.)
coleenp@3656 902 if (InstanceKlass::cast(k)->is_interface()) return;
duke@0 903
duke@0 904 // Filter out subclasses whose supers already implement me.
duke@0 905 // (Note: CHA must walk subclasses of direct implementors
duke@0 906 // in order to locate indirect implementors.)
coleenp@3656 907 Klass* sk = InstanceKlass::cast(k)->super();
coleenp@3656 908 if (sk != NULL && InstanceKlass::cast(sk)->implements_interface(this))
duke@0 909 // We only need to check one immediate superclass, since the
duke@0 910 // implements_interface query looks at transitive_interfaces.
duke@0 911 // Any supers of the super have the same (or fewer) transitive_interfaces.
duke@0 912 return;
duke@0 913
coleenp@3656 914 Klass* ik = implementor();
jiangli@3296 915 if (ik == NULL) {
jiangli@3296 916 set_implementor(k);
coleenp@3656 917 } else if (ik != this) {
jiangli@3296 918 // There is already an implementor. Use itself as an indicator of
jiangli@3296 919 // more than one implementors.
coleenp@3656 920 set_implementor(this);
duke@0 921 }
duke@0 922
duke@0 923 // The implementor also implements the transitive_interfaces
duke@0 924 for (int index = 0; index < local_interfaces()->length(); index++) {
coleenp@3656 925 InstanceKlass::cast(local_interfaces()->at(index))->add_implementor(k);
duke@0 926 }
duke@0 927 }
duke@0 928
coleenp@3656 929 void InstanceKlass::init_implementor() {
jiangli@3296 930 if (is_interface()) {
jiangli@3296 931 set_implementor(NULL);
jiangli@3296 932 }
duke@0 933 }
duke@0 934
duke@0 935
coleenp@3656 936 void InstanceKlass::process_interfaces(Thread *thread) {
duke@0 937 // link this class into the implementors list of every interface it implements
coleenp@3656 938 Klass* this_as_klass_oop = this;
duke@0 939 for (int i = local_interfaces()->length() - 1; i >= 0; i--) {
coleenp@3656 940 assert(local_interfaces()->at(i)->is_klass(), "must be a klass");
coleenp@3656 941 InstanceKlass* interf = InstanceKlass::cast(local_interfaces()->at(i));
duke@0 942 assert(interf->is_interface(), "expected interface");
coleenp@3656 943 interf->add_implementor(this_as_klass_oop);
duke@0 944 }
duke@0 945 }
duke@0 946
coleenp@3656 947 bool InstanceKlass::can_be_primary_super_slow() const {
duke@0 948 if (is_interface())
duke@0 949 return false;
duke@0 950 else
duke@0 951 return Klass::can_be_primary_super_slow();
duke@0 952 }
duke@0 953
coleenp@3656 954 GrowableArray<Klass*>* InstanceKlass::compute_secondary_supers(int num_extra_slots) {
duke@0 955 // The secondaries are the implemented interfaces.
coleenp@3656 956 InstanceKlass* ik = InstanceKlass::cast(this);
coleenp@3656 957 Array<Klass*>* interfaces = ik->transitive_interfaces();
duke@0 958 int num_secondaries = num_extra_slots + interfaces->length();
duke@0 959 if (num_secondaries == 0) {
coleenp@3656 960 // Must share this for correct bootstrapping!
coleenp@3656 961 set_secondary_supers(Universe::the_empty_klass_array());
coleenp@3656 962 return NULL;
duke@0 963 } else if (num_extra_slots == 0) {
coleenp@3656 964 // The secondary super list is exactly the same as the transitive interfaces.
coleenp@3656 965 // Redefine classes has to be careful not to delete this!
coleenp@3656 966 set_secondary_supers(interfaces);
coleenp@3656 967 return NULL;
duke@0 968 } else {
coleenp@3656 969 // Copy transitive interfaces to a temporary growable array to be constructed
coleenp@3656 970 // into the secondary super list with extra slots.
coleenp@3656 971 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(interfaces->length());
duke@0 972 for (int i = 0; i < interfaces->length(); i++) {
coleenp@3656 973 secondaries->push(interfaces->at(i));
duke@0 974 }
duke@0 975 return secondaries;
duke@0 976 }
duke@0 977 }
duke@0 978
coleenp@3656 979 bool InstanceKlass::compute_is_subtype_of(Klass* k) {
hseigel@3908 980 if (k->is_interface()) {
duke@0 981 return implements_interface(k);
duke@0 982 } else {
duke@0 983 return Klass::compute_is_subtype_of(k);
duke@0 984 }
duke@0 985 }
duke@0 986
coleenp@3656 987 bool InstanceKlass::implements_interface(Klass* k) const {
coleenp@3656 988 if (this == k) return true;
hseigel@3908 989 assert(k->is_interface(), "should be an interface class");
duke@0 990 for (int i = 0; i < transitive_interfaces()->length(); i++) {
coleenp@3656 991 if (transitive_interfaces()->at(i) == k) {
duke@0 992 return true;
duke@0 993 }
duke@0 994 }
duke@0 995 return false;
duke@0 996 }
duke@0 997
coleenp@3656 998 objArrayOop InstanceKlass::allocate_objArray(int n, int length, TRAPS) {
duke@0 999 if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
duke@0 1000 if (length > arrayOopDesc::max_array_length(T_OBJECT)) {
martin@876 1001 report_java_out_of_memory("Requested array size exceeds VM limit");
sspitsyn@3224 1002 JvmtiExport::post_array_size_exhausted();
duke@0 1003 THROW_OOP_0(Universe::out_of_memory_error_array_size());
duke@0 1004 }
duke@0 1005 int size = objArrayOopDesc::object_size(length);
coleenp@3656 1006 Klass* ak = array_klass(n, CHECK_NULL);
duke@0 1007 KlassHandle h_ak (THREAD, ak);
duke@0 1008 objArrayOop o =
duke@0 1009 (objArrayOop)CollectedHeap::array_allocate(h_ak, size, length, CHECK_NULL);
duke@0 1010 return o;
duke@0 1011 }
duke@0 1012
coleenp@3656 1013 instanceOop InstanceKlass::register_finalizer(instanceOop i, TRAPS) {
duke@0 1014 if (TraceFinalizerRegistration) {
duke@0 1015 tty->print("Registered ");
duke@0 1016 i->print_value_on(tty);
duke@0 1017 tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", (address)i);
duke@0 1018 }
duke@0 1019 instanceHandle h_i(THREAD, i);
duke@0 1020 // Pass the handle as argument, JavaCalls::call expects oop as jobjects
duke@0 1021 JavaValue result(T_VOID);
duke@0 1022 JavaCallArguments args(h_i);
duke@0 1023 methodHandle mh (THREAD, Universe::finalizer_register_method());
duke@0 1024 JavaCalls::call(&result, mh, &args, CHECK_NULL);
duke@0 1025 return h_i();
duke@0 1026 }
duke@0 1027
coleenp@3656 1028 instanceOop InstanceKlass::allocate_instance(TRAPS) {
duke@0 1029 bool has_finalizer_flag = has_finalizer(); // Query before possible GC
duke@0 1030 int size = size_helper(); // Query before forming handle.
duke@0 1031
coleenp@3656 1032 KlassHandle h_k(THREAD, this);
duke@0 1033
duke@0 1034 instanceOop i;
duke@0 1035
duke@0 1036 i = (instanceOop)CollectedHeap::obj_allocate(h_k, size, CHECK_NULL);
duke@0 1037 if (has_finalizer_flag && !RegisterFinalizersAtInit) {
duke@0 1038 i = register_finalizer(i, CHECK_NULL);
duke@0 1039 }
duke@0 1040 return i;
duke@0 1041 }
duke@0 1042
coleenp@3656 1043 void InstanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) {
duke@0 1044 if (is_interface() || is_abstract()) {
duke@0 1045 ResourceMark rm(THREAD);
duke@0 1046 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError()
duke@0 1047 : vmSymbols::java_lang_InstantiationException(), external_name());
duke@0 1048 }
coleenp@3656 1049 if (this == SystemDictionary::Class_klass()) {
duke@0 1050 ResourceMark rm(THREAD);
duke@0 1051 THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError()
duke@0 1052 : vmSymbols::java_lang_IllegalAccessException(), external_name());
duke@0 1053 }
duke@0 1054 }
duke@0 1055
coleenp@3656 1056 Klass* InstanceKlass::array_klass_impl(bool or_null, int n, TRAPS) {
coleenp@3656 1057 instanceKlassHandle this_oop(THREAD, this);
duke@0 1058 return array_klass_impl(this_oop, or_null, n, THREAD);
duke@0 1059 }
duke@0 1060
coleenp@3656 1061 Klass* InstanceKlass::array_klass_impl(instanceKlassHandle this_oop, bool or_null, int n, TRAPS) {
duke@0 1062 if (this_oop->array_klasses() == NULL) {
duke@0 1063 if (or_null) return NULL;
duke@0 1064
duke@0 1065 ResourceMark rm;
duke@0 1066 JavaThread *jt = (JavaThread *)THREAD;
duke@0 1067 {
duke@0 1068 // Atomic creation of array_klasses
duke@0 1069 MutexLocker mc(Compile_lock, THREAD); // for vtables
duke@0 1070 MutexLocker ma(MultiArray_lock, THREAD);
duke@0 1071
duke@0 1072 // Check if update has already taken place
duke@0 1073 if (this_oop->array_klasses() == NULL) {
coleenp@3764 1074 Klass* k = ObjArrayKlass::allocate_objArray_klass(this_oop->class_loader_data(), 1, this_oop, CHECK_NULL);
duke@0 1075 this_oop->set_array_klasses(k);
duke@0 1076 }
duke@0 1077 }
duke@0 1078 }
duke@0 1079 // _this will always be set at this point
coleenp@3764 1080 ObjArrayKlass* oak = (ObjArrayKlass*)this_oop->array_klasses();
duke@0 1081 if (or_null) {
duke@0 1082 return oak->array_klass_or_null(n);
duke@0 1083 }
duke@0 1084 return oak->array_klass(n, CHECK_NULL);
duke@0 1085 }
duke@0 1086
coleenp@3656 1087 Klass* InstanceKlass::array_klass_impl(bool or_null, TRAPS) {
duke@0 1088 return array_klass_impl(or_null, 1, THREAD);
duke@0 1089 }
duke@0 1090
coleenp@3656 1091 void InstanceKlass::call_class_initializer(TRAPS) {
coleenp@3656 1092 instanceKlassHandle ik (THREAD, this);
duke@0 1093 call_class_initializer_impl(ik, THREAD);
duke@0 1094 }
duke@0 1095
duke@0 1096 static int call_class_initializer_impl_counter = 0; // for debugging
duke@0 1097
coleenp@3656 1098 Method* InstanceKlass::class_initializer() {
coleenp@3656 1099 Method* clinit = find_method(
kamg@2189 1100 vmSymbols::class_initializer_name(), vmSymbols::void_method_signature());
kamg@2189 1101 if (clinit != NULL && clinit->has_valid_initializer_flags()) {
kamg@2189 1102 return clinit;
kamg@2189 1103 }
kamg@2189 1104 return NULL;
duke@0 1105 }
duke@0 1106
coleenp@3656 1107 void InstanceKlass::call_class_initializer_impl(instanceKlassHandle this_oop, TRAPS) {
minqi@3897 1108 if (ReplayCompiles &&
minqi@3897 1109 (ReplaySuppressInitializers == 1 ||
minqi@3897 1110 ReplaySuppressInitializers >= 2 && this_oop->class_loader() != NULL)) {
minqi@3897 1111 // Hide the existence of the initializer for the purpose of replaying the compile
minqi@3897 1112 return;
minqi@3897 1113 }
minqi@3897 1114
duke@0 1115 methodHandle h_method(THREAD, this_oop->class_initializer());
duke@0 1116 assert(!this_oop->is_initialized(), "we cannot initialize twice");
duke@0 1117 if (TraceClassInitialization) {
duke@0 1118 tty->print("%d Initializing ", call_class_initializer_impl_counter++);
duke@0 1119 this_oop->name()->print_value();
duke@0 1120 tty->print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", (address)this_oop());
duke@0 1121 }
duke@0 1122 if (h_method() != NULL) {
duke@0 1123 JavaCallArguments args; // No arguments
duke@0 1124 JavaValue result(T_VOID);
duke@0 1125 JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args)
duke@0 1126 }
duke@0 1127 }
duke@0 1128
duke@0 1129
coleenp@3656 1130 void InstanceKlass::mask_for(methodHandle method, int bci,
duke@0 1131 InterpreterOopMap* entry_for) {
duke@0 1132 // Dirty read, then double-check under a lock.
duke@0 1133 if (_oop_map_cache == NULL) {
duke@0 1134 // Otherwise, allocate a new one.
duke@0 1135 MutexLocker x(OopMapCacheAlloc_lock);
duke@0 1136 // First time use. Allocate a cache in C heap
duke@0 1137 if (_oop_map_cache == NULL) {
duke@0 1138 _oop_map_cache = new OopMapCache();
duke@0 1139 }
duke@0 1140 }
duke@0 1141 // _oop_map_cache is constant after init; lookup below does is own locking.
duke@0 1142 _oop_map_cache->lookup(method, bci, entry_for);
duke@0 1143 }
duke@0 1144
duke@0 1145
coleenp@3656 1146 bool InstanceKlass::find_local_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
coleenp@3656 1147 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
never@2712 1148 Symbol* f_name = fs.name();
never@2712 1149 Symbol* f_sig = fs.signature();
duke@0 1150 if (f_name == name && f_sig == sig) {
coleenp@3656 1151 fd->initialize(const_cast<InstanceKlass*>(this), fs.index());
duke@0 1152 return true;
duke@0 1153 }
duke@0 1154 }
duke@0 1155 return false;
duke@0 1156 }
duke@0 1157
duke@0 1158
coleenp@3656 1159 Klass* InstanceKlass::find_interface_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
duke@0 1160 const int n = local_interfaces()->length();
duke@0 1161 for (int i = 0; i < n; i++) {
coleenp@3656 1162 Klass* intf1 = local_interfaces()->at(i);
hseigel@3908 1163 assert(intf1->is_interface(), "just checking type");
duke@0 1164 // search for field in current interface
coleenp@3656 1165 if (InstanceKlass::cast(intf1)->find_local_field(name, sig, fd)) {
duke@0 1166 assert(fd->is_static(), "interface field must be static");
duke@0 1167 return intf1;
duke@0 1168 }
duke@0 1169 // search for field in direct superinterfaces
coleenp@3656 1170 Klass* intf2 = InstanceKlass::cast(intf1)->find_interface_field(name, sig, fd);
duke@0 1171 if (intf2 != NULL) return intf2;
duke@0 1172 }
duke@0 1173 // otherwise field lookup fails
duke@0 1174 return NULL;
duke@0 1175 }
duke@0 1176
duke@0 1177
coleenp@3656 1178 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
duke@0 1179 // search order according to newest JVM spec (5.4.3.2, p.167).
duke@0 1180 // 1) search for field in current klass
duke@0 1181 if (find_local_field(name, sig, fd)) {
coleenp@3656 1182 return const_cast<InstanceKlass*>(this);
duke@0 1183 }
duke@0 1184 // 2) search for field recursively in direct superinterfaces
coleenp@3656 1185 { Klass* intf = find_interface_field(name, sig, fd);
duke@0 1186 if (intf != NULL) return intf;
duke@0 1187 }
duke@0 1188 // 3) apply field lookup recursively if superclass exists
coleenp@3656 1189 { Klass* supr = super();
coleenp@3656 1190 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, fd);
duke@0 1191 }
duke@0 1192 // 4) otherwise field lookup fails
duke@0 1193 return NULL;
duke@0 1194 }
duke@0 1195
duke@0 1196
coleenp@3656 1197 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, bool is_static, fieldDescriptor* fd) const {
duke@0 1198 // search order according to newest JVM spec (5.4.3.2, p.167).
duke@0 1199 // 1) search for field in current klass
duke@0 1200 if (find_local_field(name, sig, fd)) {
coleenp@3656 1201 if (fd->is_static() == is_static) return const_cast<InstanceKlass*>(this);
duke@0 1202 }
duke@0 1203 // 2) search for field recursively in direct superinterfaces
duke@0 1204 if (is_static) {
coleenp@3656 1205 Klass* intf = find_interface_field(name, sig, fd);
duke@0 1206 if (intf != NULL) return intf;
duke@0 1207 }
duke@0 1208 // 3) apply field lookup recursively if superclass exists
coleenp@3656 1209 { Klass* supr = super();
coleenp@3656 1210 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, is_static, fd);
duke@0 1211 }
duke@0 1212 // 4) otherwise field lookup fails
duke@0 1213 return NULL;
duke@0 1214 }
duke@0 1215
duke@0 1216
coleenp@3656 1217 bool InstanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
coleenp@3656 1218 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
never@2712 1219 if (fs.offset() == offset) {
coleenp@3656 1220 fd->initialize(const_cast<InstanceKlass*>(this), fs.index());
duke@0 1221 if (fd->is_static() == is_static) return true;
duke@0 1222 }
duke@0 1223 }
duke@0 1224 return false;
duke@0 1225 }
duke@0 1226
duke@0 1227
coleenp@3656 1228 bool InstanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
coleenp@3656 1229 Klass* klass = const_cast<InstanceKlass*>(this);
duke@0 1230 while (klass != NULL) {
coleenp@3656 1231 if (InstanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) {
duke@0 1232 return true;
duke@0 1233 }
hseigel@3908 1234 klass = klass->super();
duke@0 1235 }
duke@0 1236 return false;
duke@0 1237 }
duke@0 1238
duke@0 1239
coleenp@3656 1240 void InstanceKlass::methods_do(void f(Method* method)) {
duke@0 1241 int len = methods()->length();
duke@0 1242 for (int index = 0; index < len; index++) {
coleenp@3656 1243 Method* m = methods()->at(index);
duke@0 1244 assert(m->is_method(), "must be method");
duke@0 1245 f(m);
duke@0 1246 }
duke@0 1247 }
duke@0 1248
never@2231 1249
coleenp@3656 1250 void InstanceKlass::do_local_static_fields(FieldClosure* cl) {
never@2712 1251 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
never@2712 1252 if (fs.access_flags().is_static()) {
never@2712 1253 fieldDescriptor fd;
coleenp@3656 1254 fd.initialize(this, fs.index());
never@2712 1255 cl->do_field(&fd);
never@2712 1256 }
duke@0 1257 }
duke@0 1258 }
duke@0 1259
duke@0 1260
coleenp@3656 1261 void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, TRAPS), TRAPS) {
coleenp@3656 1262 instanceKlassHandle h_this(THREAD, this);
duke@0 1263 do_local_static_fields_impl(h_this, f, CHECK);
duke@0 1264 }
duke@0 1265
duke@0 1266
coleenp@3656 1267 void InstanceKlass::do_local_static_fields_impl(instanceKlassHandle this_oop, void f(fieldDescriptor* fd, TRAPS), TRAPS) {
never@2712 1268 for (JavaFieldStream fs(this_oop()); !fs.done(); fs.next()) {
never@2712 1269 if (fs.access_flags().is_static()) {
never@2712 1270 fieldDescriptor fd;
never@2712 1271 fd.initialize(this_oop(), fs.index());
never@2712 1272 f(&fd, CHECK);
never@2712 1273 }
duke@0 1274 }
duke@0 1275 }
duke@0 1276
duke@0 1277
kvn@44 1278 static int compare_fields_by_offset(int* a, int* b) {
kvn@44 1279 return a[0] - b[0];
kvn@44 1280 }
kvn@44 1281
coleenp@3656 1282 void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) {
coleenp@3656 1283 InstanceKlass* super = superklass();
duke@0 1284 if (super != NULL) {
duke@0 1285 super->do_nonstatic_fields(cl);
duke@0 1286 }
kvn@44 1287 fieldDescriptor fd;
never@2712 1288 int length = java_fields_count();
kvn@44 1289 // In DebugInfo nonstatic fields are sorted by offset.
zgu@3505 1290 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass);
kvn@44 1291 int j = 0;
never@2712 1292 for (int i = 0; i < length; i += 1) {
coleenp@3656 1293 fd.initialize(this, i);
kvn@44 1294 if (!fd.is_static()) {
kvn@44 1295 fields_sorted[j + 0] = fd.offset();
kvn@44 1296 fields_sorted[j + 1] = i;
kvn@44 1297 j += 2;
kvn@44 1298 }
duke@0 1299 }
kvn@44 1300 if (j > 0) {
kvn@44 1301 length = j;
kvn@44 1302 // _sort_Fn is defined in growableArray.hpp.
kvn@44 1303 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset);
kvn@44 1304 for (int i = 0; i < length; i += 2) {
coleenp@3656 1305 fd.initialize(this, fields_sorted[i + 1]);
kvn@44 1306 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields");
kvn@44 1307 cl->do_field(&fd);
kvn@44 1308 }
kvn@44 1309 }
zgu@3505 1310 FREE_C_HEAP_ARRAY(int, fields_sorted, mtClass);
duke@0 1311 }
duke@0 1312
duke@0 1313
coleenp@3656 1314 void InstanceKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) {
coleenp@3656 1315 if (array_klasses() != NULL)
coleenp@3764 1316 ArrayKlass::cast(array_klasses())->array_klasses_do(f, THREAD);
coleenp@3656 1317 }
coleenp@3656 1318
coleenp@3656 1319 void InstanceKlass::array_klasses_do(void f(Klass* k)) {
duke@0 1320 if (array_klasses() != NULL)
coleenp@3764 1321 ArrayKlass::cast(array_klasses())->array_klasses_do(f);
duke@0 1322 }
duke@0 1323
duke@0 1324
coleenp@3656 1325 void InstanceKlass::with_array_klasses_do(void f(Klass* k)) {
coleenp@3656 1326 f(this);
duke@0 1327 array_klasses_do(f);
duke@0 1328 }
duke@0 1329
duke@0 1330 #ifdef ASSERT
coleenp@3656 1331 static int linear_search(Array<Method*>* methods, Symbol* name, Symbol* signature) {
duke@0 1332 int len = methods->length();
duke@0 1333 for (int index = 0; index < len; index++) {
coleenp@3656 1334 Method* m = methods->at(index);
duke@0 1335 assert(m->is_method(), "must be method");
duke@0 1336 if (m->signature() == signature && m->name() == name) {
duke@0 1337 return index;
duke@0 1338 }
duke@0 1339 }
duke@0 1340 return -1;
duke@0 1341 }
duke@0 1342 #endif
duke@0 1343
kamg@3874 1344 static int binary_search(Array<Method*>* methods, Symbol* name) {
duke@0 1345 int len = methods->length();
duke@0 1346 // methods are sorted, so do binary search
duke@0 1347 int l = 0;
duke@0 1348 int h = len - 1;
duke@0 1349 while (l <= h) {
duke@0 1350 int mid = (l + h) >> 1;
coleenp@3656 1351 Method* m = methods->at(mid);
duke@0 1352 assert(m->is_method(), "must be method");
duke@0 1353 int res = m->name()->fast_compare(name);
duke@0 1354 if (res == 0) {
kamg@3874 1355 return mid;
duke@0 1356 } else if (res < 0) {
duke@0 1357 l = mid + 1;
duke@0 1358 } else {
duke@0 1359 h = mid - 1;
duke@0 1360 }
duke@0 1361 }
kamg@3874 1362 return -1;
kamg@3874 1363 }
kamg@3874 1364
kamg@3874 1365 Method* InstanceKlass::find_method(Symbol* name, Symbol* signature) const {
kamg@3874 1366 return InstanceKlass::find_method(methods(), name, signature);
kamg@3874 1367 }
kamg@3874 1368
kamg@3874 1369 Method* InstanceKlass::find_method(
kamg@3874 1370 Array<Method*>* methods, Symbol* name, Symbol* signature) {
kamg@3874 1371 int hit = binary_search(methods, name);
kamg@3874 1372 if (hit != -1) {
kamg@3874 1373 Method* m = methods->at(hit);
kamg@3874 1374 // Do linear search to find matching signature. First, quick check
kamg@3874 1375 // for common case
kamg@3874 1376 if (m->signature() == signature) return m;
kamg@3874 1377 // search downwards through overloaded methods
kamg@3874 1378 int i;
kamg@3874 1379 for (i = hit - 1; i >= 0; --i) {
kamg@3874 1380 Method* m = methods->at(i);
kamg@3874 1381 assert(m->is_method(), "must be method");
kamg@3874 1382 if (m->name() != name) break;
kamg@3874 1383 if (m->signature() == signature) return m;
kamg@3874 1384 }
kamg@3874 1385 // search upwards
kamg@3874 1386 for (i = hit + 1; i < methods->length(); ++i) {
kamg@3874 1387 Method* m = methods->at(i);
kamg@3874 1388 assert(m->is_method(), "must be method");
kamg@3874 1389 if (m->name() != name) break;
kamg@3874 1390 if (m->signature() == signature) return m;
kamg@3874 1391 }
kamg@3874 1392 // not found
duke@0 1393 #ifdef ASSERT
kamg@3874 1394 int index = linear_search(methods, name, signature);
kamg@3874 1395 assert(index == -1, err_msg("binary search should have found entry %d", index));
duke@0 1396 #endif
kamg@3874 1397 }
duke@0 1398 return NULL;
duke@0 1399 }
duke@0 1400
kamg@3874 1401 int InstanceKlass::find_method_by_name(Symbol* name, int* end) {
kamg@3874 1402 return find_method_by_name(methods(), name, end);
kamg@3874 1403 }
kamg@3874 1404
kamg@3874 1405 int InstanceKlass::find_method_by_name(
kamg@3874 1406 Array<Method*>* methods, Symbol* name, int* end_ptr) {
kamg@3874 1407 assert(end_ptr != NULL, "just checking");
kamg@3874 1408 int start = binary_search(methods, name);
kamg@3874 1409 int end = start + 1;
kamg@3874 1410 if (start != -1) {
kamg@3874 1411 while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start;
kamg@3874 1412 while (end < methods->length() && (methods->at(end))->name() == name) ++end;
kamg@3874 1413 *end_ptr = end;
kamg@3874 1414 return start;
kamg@3874 1415 }
kamg@3874 1416 return -1;
kamg@3874 1417 }
kamg@3874 1418
coleenp@3656 1419 Method* InstanceKlass::uncached_lookup_method(Symbol* name, Symbol* signature) const {
coleenp@3656 1420 Klass* klass = const_cast<InstanceKlass*>(this);
duke@0 1421 while (klass != NULL) {
coleenp@3656 1422 Method* method = InstanceKlass::cast(klass)->find_method(name, signature);
duke@0 1423 if (method != NULL) return method;
coleenp@3656 1424 klass = InstanceKlass::cast(klass)->super();
duke@0 1425 }
duke@0 1426 return NULL;
duke@0 1427 }
duke@0 1428
duke@0 1429 // lookup a method in all the interfaces that this class implements
coleenp@3656 1430 Method* InstanceKlass::lookup_method_in_all_interfaces(Symbol* name,
coleenp@2069 1431 Symbol* signature) const {
coleenp@3656 1432 Array<Klass*>* all_ifs = transitive_interfaces();
duke@0 1433 int num_ifs = all_ifs->length();
coleenp@3656 1434 InstanceKlass *ik = NULL;
duke@0 1435 for (int i = 0; i < num_ifs; i++) {
coleenp@3656 1436 ik = InstanceKlass::cast(all_ifs->at(i));
coleenp@3656 1437 Method* m = ik->lookup_method(name, signature);
duke@0 1438 if (m != NULL) {
duke@0 1439 return m;
duke@0 1440 }
duke@0 1441 }
duke@0 1442 return NULL;
duke@0 1443 }
duke@0 1444
duke@0 1445 /* jni_id_for_impl for jfieldIds only */
coleenp@3656 1446 JNIid* InstanceKlass::jni_id_for_impl(instanceKlassHandle this_oop, int offset) {
duke@0 1447 MutexLocker ml(JfieldIdCreation_lock);
duke@0 1448 // Retry lookup after we got the lock
duke@0 1449 JNIid* probe = this_oop->jni_ids() == NULL ? NULL : this_oop->jni_ids()->find(offset);
duke@0 1450 if (probe == NULL) {
duke@0 1451 // Slow case, allocate new static field identifier
coleenp@3656 1452 probe = new JNIid(this_oop(), offset, this_oop->jni_ids());
duke@0 1453 this_oop->set_jni_ids(probe);
duke@0 1454 }
duke@0 1455 return probe;
duke@0 1456 }
duke@0 1457
duke@0 1458
duke@0 1459 /* jni_id_for for jfieldIds only */
coleenp@3656 1460 JNIid* InstanceKlass::jni_id_for(int offset) {
duke@0 1461 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
duke@0 1462 if (probe == NULL) {
coleenp@3656 1463 probe = jni_id_for_impl(this, offset);
duke@0 1464 }
duke@0 1465 return probe;
duke@0 1466 }
duke@0 1467
coleenp@3656 1468 u2 InstanceKlass::enclosing_method_data(int offset) {
coleenp@3656 1469 Array<jushort>* inner_class_list = inner_classes();
jiangli@3256 1470 if (inner_class_list == NULL) {
jiangli@3256 1471 return 0;
jiangli@3256 1472 }
jiangli@3256 1473 int length = inner_class_list->length();
jiangli@3256 1474 if (length % inner_class_next_offset == 0) {
jiangli@3256 1475 return 0;
jiangli@3256 1476 } else {
jiangli@3256 1477 int index = length - enclosing_method_attribute_size;
jiangli@3256 1478 assert(offset < enclosing_method_attribute_size, "invalid offset");
coleenp@3656 1479 return inner_class_list->at(index + offset);
jiangli@3256 1480 }
jiangli@3256 1481 }
jiangli@3256 1482
coleenp@3656 1483 void InstanceKlass::set_enclosing_method_indices(u2 class_index,
jiangli@3256 1484 u2 method_index) {
coleenp@3656 1485 Array<jushort>* inner_class_list = inner_classes();
jiangli@3256 1486 assert (inner_class_list != NULL, "_inner_classes list is not set up");
jiangli@3256 1487 int length = inner_class_list->length();
jiangli@3256 1488 if (length % inner_class_next_offset == enclosing_method_attribute_size) {
jiangli@3256 1489 int index = length - enclosing_method_attribute_size;
coleenp@3656 1490 inner_class_list->at_put(
jiangli@3256 1491 index + enclosing_method_class_index_offset, class_index);
coleenp@3656 1492 inner_class_list->at_put(
jiangli@3256 1493 index + enclosing_method_method_index_offset, method_index);
jiangli@3256 1494 }
jiangli@3256 1495 }
duke@0 1496
duke@0 1497 // Lookup or create a jmethodID.
dcubed@977 1498 // This code is called by the VMThread and JavaThreads so the
dcubed@977 1499 // locking has to be done very carefully to avoid deadlocks
dcubed@977 1500 // and/or other cache consistency problems.
dcubed@977 1501 //
coleenp@3656 1502 jmethodID InstanceKlass::get_jmethod_id(instanceKlassHandle ik_h, methodHandle method_h) {
duke@0 1503 size_t idnum = (size_t)method_h->method_idnum();
duke@0 1504 jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire();
duke@0 1505 size_t length = 0;
duke@0 1506 jmethodID id = NULL;
duke@0 1507
dcubed@977 1508 // We use a double-check locking idiom here because this cache is
dcubed@977 1509 // performance sensitive. In the normal system, this cache only
dcubed@977 1510 // transitions from NULL to non-NULL which is safe because we use
dcubed@977 1511 // release_set_methods_jmethod_ids() to advertise the new cache.
dcubed@977 1512 // A partially constructed cache should never be seen by a racing
dcubed@977 1513 // thread. We also use release_store_ptr() to save a new jmethodID
dcubed@977 1514 // in the cache so a partially constructed jmethodID should never be
dcubed@977 1515 // seen either. Cache reads of existing jmethodIDs proceed without a
dcubed@977 1516 // lock, but cache writes of a new jmethodID requires uniqueness and
dcubed@977 1517 // creation of the cache itself requires no leaks so a lock is
dcubed@977 1518 // generally acquired in those two cases.
dcubed@977 1519 //
dcubed@977 1520 // If the RedefineClasses() API has been used, then this cache can
dcubed@977 1521 // grow and we'll have transitions from non-NULL to bigger non-NULL.
dcubed@977 1522 // Cache creation requires no leaks and we require safety between all
dcubed@977 1523 // cache accesses and freeing of the old cache so a lock is generally
dcubed@977 1524 // acquired when the RedefineClasses() API has been used.
duke@0 1525
dcubed@977 1526 if (jmeths != NULL) {
dcubed@977 1527 // the cache already exists
dcubed@977 1528 if (!ik_h->idnum_can_increment()) {
dcubed@977 1529 // the cache can't grow so we can just get the current values
dcubed@977 1530 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
dcubed@977 1531 } else {
dcubed@977 1532 // cache can grow so we have to be more careful
dcubed@977 1533 if (Threads::number_of_threads() == 0 ||
dcubed@977 1534 SafepointSynchronize::is_at_safepoint()) {
dcubed@977 1535 // we're single threaded or at a safepoint - no locking needed
dcubed@977 1536 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
dcubed@977 1537 } else {
dcubed@977 1538 MutexLocker ml(JmethodIdCreation_lock);
dcubed@977 1539 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
dcubed@977 1540 }
dcubed@977 1541 }
dcubed@977 1542 }
dcubed@977 1543 // implied else:
dcubed@977 1544 // we need to allocate a cache so default length and id values are good
dcubed@977 1545
dcubed@977 1546 if (jmeths == NULL || // no cache yet
dcubed@977 1547 length <= idnum || // cache is too short
dcubed@977 1548 id == NULL) { // cache doesn't contain entry
dcubed@977 1549
dcubed@977 1550 // This function can be called by the VMThread so we have to do all
dcubed@977 1551 // things that might block on a safepoint before grabbing the lock.
dcubed@977 1552 // Otherwise, we can deadlock with the VMThread or have a cache
dcubed@977 1553 // consistency issue. These vars keep track of what we might have
dcubed@977 1554 // to free after the lock is dropped.
dcubed@977 1555 jmethodID to_dealloc_id = NULL;
dcubed@977 1556 jmethodID* to_dealloc_jmeths = NULL;
dcubed@977 1557
dcubed@977 1558 // may not allocate new_jmeths or use it if we allocate it
duke@0 1559 jmethodID* new_jmeths = NULL;
duke@0 1560 if (length <= idnum) {
dcubed@977 1561 // allocate a new cache that might be used
duke@0 1562 size_t size = MAX2(idnum+1, (size_t)ik_h->idnum_allocated_count());
zgu@3505 1563 new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1, mtClass);
duke@0 1564 memset(new_jmeths, 0, (size+1)*sizeof(jmethodID));
dcubed@977 1565 // cache size is stored in element[0], other elements offset by one
dcubed@977 1566 new_jmeths[0] = (jmethodID)size;
duke@0 1567 }
duke@0 1568
dcubed@977 1569 // allocate a new jmethodID that might be used
duke@0 1570 jmethodID new_id = NULL;
duke@0 1571 if (method_h->is_old() && !method_h->is_obsolete()) {
duke@0 1572 // The method passed in is old (but not obsolete), we need to use the current version
coleenp@3656 1573 Method* current_method = ik_h->method_with_idnum((int)idnum);
duke@0 1574 assert(current_method != NULL, "old and but not obsolete, so should exist");
coleenp@3656 1575 new_id = Method::make_jmethod_id(ik_h->class_loader_data(), current_method);
duke@0 1576 } else {
duke@0 1577 // It is the current version of the method or an obsolete method,
duke@0 1578 // use the version passed in
coleenp@3656 1579 new_id = Method::make_jmethod_id(ik_h->class_loader_data(), method_h());
duke@0 1580 }
duke@0 1581
dcubed@977 1582 if (Threads::number_of_threads() == 0 ||
dcubed@977 1583 SafepointSynchronize::is_at_safepoint()) {
dcubed@977 1584 // we're single threaded or at a safepoint - no locking needed
dcubed@977 1585 id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths,
dcubed@977 1586 &to_dealloc_id, &to_dealloc_jmeths);
dcubed@49 1587 } else {
duke@0 1588 MutexLocker ml(JmethodIdCreation_lock);
dcubed@977 1589 id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths,
dcubed@977 1590 &to_dealloc_id, &to_dealloc_jmeths);
dcubed@977 1591 }
dcubed@977 1592
dcubed@977 1593 // The lock has been dropped so we can free resources.
dcubed@977 1594 // Free up either the old cache or the new cache if we allocated one.
dcubed@977 1595 if (to_dealloc_jmeths != NULL) {
dcubed@977 1596 FreeHeap(to_dealloc_jmeths);
dcubed@977 1597 }
dcubed@977 1598 // free up the new ID since it wasn't needed
dcubed@977 1599 if (to_dealloc_id != NULL) {
coleenp@3656 1600 Method::destroy_jmethod_id(ik_h->class_loader_data(), to_dealloc_id);
dcubed@49 1601 }
dcubed@49 1602 }
dcubed@49 1603 return id;
dcubed@49 1604 }
duke@0 1605
duke@0 1606
dcubed@977 1607 // Common code to fetch the jmethodID from the cache or update the
dcubed@977 1608 // cache with the new jmethodID. This function should never do anything
dcubed@977 1609 // that causes the caller to go to a safepoint or we can deadlock with
dcubed@977 1610 // the VMThread or have cache consistency issues.
dcubed@977 1611 //
coleenp@3656 1612 jmethodID InstanceKlass::get_jmethod_id_fetch_or_update(
dcubed@977 1613 instanceKlassHandle ik_h, size_t idnum, jmethodID new_id,
dcubed@977 1614 jmethodID* new_jmeths, jmethodID* to_dealloc_id_p,
dcubed@977 1615 jmethodID** to_dealloc_jmeths_p) {
dcubed@977 1616 assert(new_id != NULL, "sanity check");
dcubed@977 1617 assert(to_dealloc_id_p != NULL, "sanity check");
dcubed@977 1618 assert(to_dealloc_jmeths_p != NULL, "sanity check");
dcubed@977 1619 assert(Threads::number_of_threads() == 0 ||
dcubed@977 1620 SafepointSynchronize::is_at_safepoint() ||
dcubed@977 1621 JmethodIdCreation_lock->owned_by_self(), "sanity check");
dcubed@977 1622
dcubed@977 1623 // reacquire the cache - we are locked, single threaded or at a safepoint
dcubed@49 1624 jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire();
dcubed@977 1625 jmethodID id = NULL;
dcubed@977 1626 size_t length = 0;
dcubed@49 1627
dcubed@977 1628 if (jmeths == NULL || // no cache yet
dcubed@977 1629 (length = (size_t)jmeths[0]) <= idnum) { // cache is too short
dcubed@49 1630 if (jmeths != NULL) {
dcubed@977 1631 // copy any existing entries from the old cache
dcubed@49 1632 for (size_t index = 0; index < length; index++) {
dcubed@49 1633 new_jmeths[index+1] = jmeths[index+1];
duke@0 1634 }
dcubed@977 1635 *to_dealloc_jmeths_p = jmeths; // save old cache for later delete
duke@0 1636 }
dcubed@49 1637 ik_h->release_set_methods_jmethod_ids(jmeths = new_jmeths);
dcubed@49 1638 } else {
dcubed@977 1639 // fetch jmethodID (if any) from the existing cache
dcubed@49 1640 id = jmeths[idnum+1];
dcubed@977 1641 *to_dealloc_jmeths_p = new_jmeths; // save new cache for later delete
dcubed@49 1642 }
dcubed@49 1643 if (id == NULL) {
dcubed@977 1644 // No matching jmethodID in the existing cache or we have a new
dcubed@977 1645 // cache or we just grew the cache. This cache write is done here
dcubed@977 1646 // by the first thread to win the foot race because a jmethodID
dcubed@977 1647 // needs to be unique once it is generally available.
dcubed@49 1648 id = new_id;
dcubed@977 1649
dcubed@977 1650 // The jmethodID cache can be read while unlocked so we have to
dcubed@977 1651 // make sure the new jmethodID is complete before installing it
dcubed@977 1652 // in the cache.
dcubed@977 1653 OrderAccess::release_store_ptr(&jmeths[idnum+1], id);
dcubed@49 1654 } else {
dcubed@977 1655 *to_dealloc_id_p = new_id; // save new id for later delete
duke@0 1656 }
duke@0 1657 return id;
duke@0 1658 }
duke@0 1659
duke@0 1660
dcubed@977 1661 // Common code to get the jmethodID cache length and the jmethodID
dcubed@977 1662 // value at index idnum if there is one.
dcubed@977 1663 //
coleenp@3656 1664 void InstanceKlass::get_jmethod_id_length_value(jmethodID* cache,
dcubed@977 1665 size_t idnum, size_t *length_p, jmethodID* id_p) {
dcubed@977 1666 assert(cache != NULL, "sanity check");
dcubed@977 1667 assert(length_p != NULL, "sanity check");
dcubed@977 1668 assert(id_p != NULL, "sanity check");
dcubed@977 1669
dcubed@977 1670 // cache size is stored in element[0], other elements offset by one
dcubed@977 1671 *length_p = (size_t)cache[0];
dcubed@977 1672 if (*length_p <= idnum) { // cache is too short
dcubed@977 1673 *id_p = NULL;
dcubed@977 1674 } else {
dcubed@977 1675 *id_p = cache[idnum+1]; // fetch jmethodID (if any)
dcubed@977 1676 }
dcubed@977 1677 }
dcubed@977 1678
dcubed@977 1679
duke@0 1680 // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles
coleenp@3656 1681 jmethodID InstanceKlass::jmethod_id_or_null(Method* method) {
duke@0 1682 size_t idnum = (size_t)method->method_idnum();
duke@0 1683 jmethodID* jmeths = methods_jmethod_ids_acquire();
duke@0 1684 size_t length; // length assigned as debugging crumb
duke@0 1685 jmethodID id = NULL;
dcubed@977 1686 if (jmeths != NULL && // If there is a cache
duke@0 1687 (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough,
duke@0 1688 id = jmeths[idnum+1]; // Look up the id (may be NULL)
duke@0 1689 }
duke@0 1690 return id;
duke@0 1691 }
duke@0 1692
duke@0 1693
duke@0 1694 // Cache an itable index
coleenp@3656 1695 void InstanceKlass::set_cached_itable_index(size_t idnum, int index) {
duke@0 1696 int* indices = methods_cached_itable_indices_acquire();
dcubed@977 1697 int* to_dealloc_indices = NULL;
dcubed@977 1698
dcubed@977 1699 // We use a double-check locking idiom here because this cache is
dcubed@977 1700 // performance sensitive. In the normal system, this cache only
dcubed@977 1701 // transitions from NULL to non-NULL which is safe because we use
dcubed@977 1702 // release_set_methods_cached_itable_indices() to advertise the
dcubed@977 1703 // new cache. A partially constructed cache should never be seen
dcubed@977 1704 // by a racing thread. Cache reads and writes proceed without a
dcubed@977 1705 // lock, but creation of the cache itself requires no leaks so a
dcubed@977 1706 // lock is generally acquired in that case.
dcubed@977 1707 //
dcubed@977 1708 // If the RedefineClasses() API has been used, then this cache can
dcubed@977 1709 // grow and we'll have transitions from non-NULL to bigger non-NULL.
dcubed@977 1710 // Cache creation requires no leaks and we require safety between all
dcubed@977 1711 // cache accesses and freeing of the old cache so a lock is generally
dcubed@977 1712 // acquired when the RedefineClasses() API has been used.
dcubed@977 1713
dcubed@977 1714 if (indices == NULL || idnum_can_increment()) {
dcubed@977 1715 // we need a cache or the cache can grow
duke@0 1716 MutexLocker ml(JNICachedItableIndex_lock);
dcubed@977 1717 // reacquire the cache to see if another thread already did the work
duke@0 1718 indices = methods_cached_itable_indices_acquire();
duke@0 1719 size_t length = 0;
dcubed@977 1720 // cache size is stored in element[0], other elements offset by one
duke@0 1721 if (indices == NULL || (length = (size_t)indices[0]) <= idnum) {
duke@0 1722 size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count());
zgu@3505 1723 int* new_indices = NEW_C_HEAP_ARRAY(int, size+1, mtClass);
dcubed@977 1724 new_indices[0] = (int)size;
dcubed@977 1725 // copy any existing entries
duke@0 1726 size_t i;
duke@0 1727 for (i = 0; i < length; i++) {
duke@0 1728 new_indices[i+1] = indices[i+1];
duke@0 1729 }
duke@0 1730 // Set all the rest to -1
duke@0 1731 for (i = length; i < size; i++) {
duke@0 1732 new_indices[i+1] = -1;
duke@0 1733 }
duke@0 1734 if (indices != NULL) {
dcubed@977 1735 // We have an old cache to delete so save it for after we
dcubed@977 1736 // drop the lock.
dcubed@977 1737 to_dealloc_indices = indices;
duke@0 1738 }
duke@0 1739 release_set_methods_cached_itable_indices(indices = new_indices);
duke@0 1740 }
dcubed@977 1741
dcubed@977 1742 if (idnum_can_increment()) {
dcubed@977 1743 // this cache can grow so we have to write to it safely
dcubed@977 1744 indices[idnum+1] = index;
dcubed@977 1745 }
duke@0 1746 } else {
duke@0 1747 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
duke@0 1748 }
dcubed@977 1749
dcubed@977 1750 if (!idnum_can_increment()) {
dcubed@977 1751 // The cache cannot grow and this JNI itable index value does not
dcubed@977 1752 // have to be unique like a jmethodID. If there is a race to set it,
dcubed@977 1753 // it doesn't matter.
dcubed@977 1754 indices[idnum+1] = index;
dcubed@977 1755 }
dcubed@977 1756
dcubed@977 1757 if (to_dealloc_indices != NULL) {
dcubed@977 1758 // we allocated a new cache so free the old one
dcubed@977 1759 FreeHeap(to_dealloc_indices);
dcubed@977 1760 }
duke@0 1761 }
duke@0 1762
duke@0 1763
duke@0 1764 // Retrieve a cached itable index
coleenp@3656 1765 int InstanceKlass::cached_itable_index(size_t idnum) {
duke@0 1766 int* indices = methods_cached_itable_indices_acquire();
duke@0 1767 if (indices != NULL && ((size_t)indices[0]) > idnum) {
duke@0 1768 // indices exist and are long enough, retrieve possible cached
duke@0 1769 return indices[idnum+1];
duke@0 1770 }
duke@0 1771 return -1;
duke@0 1772 }
duke@0 1773
duke@0 1774
duke@0 1775 //
duke@0 1776 // Walk the list of dependent nmethods searching for nmethods which
twisti@2625 1777 // are dependent on the changes that were passed in and mark them for
duke@0 1778 // deoptimization. Returns the number of nmethods found.
duke@0 1779 //
coleenp@3656 1780 int InstanceKlass::mark_dependent_nmethods(DepChange& changes) {
duke@0 1781 assert_locked_or_safepoint(CodeCache_lock);
duke@0 1782 int found = 0;
duke@0 1783 nmethodBucket* b = _dependencies;
duke@0 1784 while (b != NULL) {
duke@0 1785 nmethod* nm = b->get_nmethod();
duke@0 1786 // since dependencies aren't removed until an nmethod becomes a zombie,
duke@0 1787 // the dependency list may contain nmethods which aren't alive.
duke@0 1788 if (nm->is_alive() && !nm->is_marked_for_deoptimization() && nm->check_dependency_on(changes)) {
duke@0 1789 if (TraceDependencies) {
duke@0 1790 ResourceMark rm;
duke@0 1791 tty->print_cr("Marked for deoptimization");
duke@0 1792 tty->print_cr(" context = %s", this->external_name());
duke@0 1793 changes.print();
duke@0 1794 nm->print();
duke@0 1795 nm->print_dependencies();
duke@0 1796 }
duke@0 1797 nm->mark_for_deoptimization();
duke@0 1798 found++;
duke@0 1799 }
duke@0 1800 b = b->next();
duke@0 1801 }
duke@0 1802 return found;
duke@0 1803 }
duke@0 1804
duke@0 1805
duke@0 1806 //
duke@0 1807 // Add an nmethodBucket to the list of dependencies for this nmethod.
duke@0 1808 // It's possible that an nmethod has multiple dependencies on this klass
duke@0 1809 // so a count is kept for each bucket to guarantee that creation and
duke@0 1810 // deletion of dependencies is consistent.
duke@0 1811 //
coleenp@3656 1812 void InstanceKlass::add_dependent_nmethod(nmethod* nm) {
duke@0 1813 assert_locked_or_safepoint(CodeCache_lock);
duke@0 1814 nmethodBucket* b = _dependencies;
duke@0 1815 nmethodBucket* last = NULL;
duke@0 1816 while (b != NULL) {
duke@0 1817 if (nm == b->get_nmethod()) {
duke@0 1818 b->increment();
duke@0 1819 return;
duke@0 1820 }
duke@0 1821 b = b->next();
duke@0 1822 }
duke@0 1823 _dependencies = new nmethodBucket(nm, _dependencies);
duke@0 1824 }
duke@0 1825
duke@0 1826
duke@0 1827 //
duke@0 1828 // Decrement count of the nmethod in the dependency list and remove
duke@0 1829 // the bucket competely when the count goes to 0. This method must
duke@0 1830 // find a corresponding bucket otherwise there's a bug in the
duke@0 1831 // recording of dependecies.
duke@0 1832 //
coleenp@3656 1833 void InstanceKlass::remove_dependent_nmethod(nmethod* nm) {
duke@0 1834 assert_locked_or_safepoint(CodeCache_lock);
duke@0 1835 nmethodBucket* b = _dependencies;
duke@0 1836 nmethodBucket* last = NULL;
duke@0 1837 while (b != NULL) {
duke@0 1838 if (nm == b->get_nmethod()) {
duke@0 1839 if (b->decrement() == 0) {
duke@0 1840 if (last == NULL) {
duke@0 1841 _dependencies = b->next();
duke@0 1842 } else {
duke@0 1843 last->set_next(b->next());
duke@0 1844 }
duke@0 1845 delete b;
duke@0 1846 }
duke@0 1847 return;
duke@0 1848 }
duke@0 1849 last = b;
duke@0 1850 b = b->next();
duke@0 1851 }
duke@0 1852 #ifdef ASSERT
duke@0 1853 tty->print_cr("### %s can't find dependent nmethod:", this->external_name());
duke@0 1854 nm->print();
duke@0 1855 #endif // ASSERT
duke@0 1856 ShouldNotReachHere();
duke@0 1857 }
duke@0 1858
duke@0 1859
duke@0 1860 #ifndef PRODUCT
coleenp@3656 1861 void InstanceKlass::print_dependent_nmethods(bool verbose) {
duke@0 1862 nmethodBucket* b = _dependencies;
duke@0 1863 int idx = 0;
duke@0 1864 while (b != NULL) {
duke@0 1865 nmethod* nm = b->get_nmethod();
duke@0 1866 tty->print("[%d] count=%d { ", idx++, b->count());
duke@0 1867 if (!verbose) {
duke@0 1868 nm->print_on(tty, "nmethod");
duke@0 1869 tty->print_cr(" } ");
duke@0 1870 } else {
duke@0 1871 nm->print();
duke@0 1872 nm->print_dependencies();
duke@0 1873 tty->print_cr("--- } ");
duke@0 1874 }
duke@0 1875 b = b->next();
duke@0 1876 }
duke@0 1877 }
duke@0 1878
duke@0 1879
coleenp@3656 1880 bool InstanceKlass::is_dependent_nmethod(nmethod* nm) {
duke@0 1881 nmethodBucket* b = _dependencies;
duke@0 1882 while (b != NULL) {
duke@0 1883 if (nm == b->get_nmethod()) {
duke@0 1884 return true;
duke@0 1885 }
duke@0 1886 b = b->next();
duke@0 1887 }
duke@0 1888 return false;
duke@0 1889 }
duke@0 1890 #endif //PRODUCT
duke@0 1891
duke@0 1892
coleenp@3656 1893 // Garbage collection
coleenp@3656 1894
coleenp@113 1895 #ifdef ASSERT
coleenp@113 1896 template <class T> void assert_is_in(T *p) {
coleenp@113 1897 T heap_oop = oopDesc::load_heap_oop(p);
coleenp@113 1898 if (!oopDesc::is_null(heap_oop)) {
coleenp@113 1899 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
coleenp@113 1900 assert(Universe::heap()->is_in(o), "should be in heap");
coleenp@113 1901 }
coleenp@113 1902 }
coleenp@113 1903 template <class T> void assert_is_in_closed_subset(T *p) {
coleenp@113 1904 T heap_oop = oopDesc::load_heap_oop(p);
coleenp@113 1905 if (!oopDesc::is_null(heap_oop)) {
coleenp@113 1906 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
coleenp@3656 1907 assert(Universe::heap()->is_in_closed_subset(o),
coleenp@3656 1908 err_msg("should be in closed *p " INTPTR_FORMAT " " INTPTR_FORMAT, (address)p, (address)o));
coleenp@113 1909 }
coleenp@113 1910 }
coleenp@113 1911 template <class T> void assert_is_in_reserved(T *p) {
coleenp@113 1912 T heap_oop = oopDesc::load_heap_oop(p);
coleenp@113 1913 if (!oopDesc::is_null(heap_oop)) {
coleenp@113 1914 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
coleenp@113 1915 assert(Universe::heap()->is_in_reserved(o), "should be in reserved");
coleenp@113 1916 }
coleenp@113 1917 }
coleenp@113 1918 template <class T> void assert_nothing(T *p) {}
coleenp@113 1919
coleenp@113 1920 #else
coleenp@113 1921 template <class T> void assert_is_in(T *p) {}
coleenp@113 1922 template <class T> void assert_is_in_closed_subset(T *p) {}
coleenp@113 1923 template <class T> void assert_is_in_reserved(T *p) {}
coleenp@113 1924 template <class T> void assert_nothing(T *p) {}
coleenp@113 1925 #endif // ASSERT
coleenp@113 1926
coleenp@113 1927 //
coleenp@113 1928 // Macros that iterate over areas of oops which are specialized on type of
coleenp@113 1929 // oop pointer either narrow or wide, depending on UseCompressedOops
coleenp@113 1930 //
coleenp@113 1931 // Parameters are:
coleenp@113 1932 // T - type of oop to point to (either oop or narrowOop)
coleenp@113 1933 // start_p - starting pointer for region to iterate over
coleenp@113 1934 // count - number of oops or narrowOops to iterate over
coleenp@113 1935 // do_oop - action to perform on each oop (it's arbitrary C code which
coleenp@113 1936 // makes it more efficient to put in a macro rather than making
coleenp@113 1937 // it a template function)
coleenp@113 1938 // assert_fn - assert function which is template function because performance
coleenp@113 1939 // doesn't matter when enabled.
coleenp@113 1940 #define InstanceKlass_SPECIALIZED_OOP_ITERATE( \
coleenp@113 1941 T, start_p, count, do_oop, \
coleenp@113 1942 assert_fn) \
coleenp@113 1943 { \
coleenp@113 1944 T* p = (T*)(start_p); \
coleenp@113 1945 T* const end = p + (count); \
coleenp@113 1946 while (p < end) { \
coleenp@113 1947 (assert_fn)(p); \
coleenp@113 1948 do_oop; \
coleenp@113 1949 ++p; \
coleenp@113 1950 } \
coleenp@113 1951 }
coleenp@113 1952
coleenp@113 1953 #define InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE( \
coleenp@113 1954 T, start_p, count, do_oop, \
coleenp@113 1955 assert_fn) \
coleenp@113 1956 { \
coleenp@113 1957 T* const start = (T*)(start_p); \
coleenp@113 1958 T* p = start + (count); \
coleenp@113 1959 while (start < p) { \
coleenp@113 1960 --p; \
coleenp@113 1961 (assert_fn)(p); \
coleenp@113 1962 do_oop; \
coleenp@113 1963 } \
coleenp@113 1964 }
coleenp@113 1965
coleenp@113 1966 #define InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE( \
coleenp@113 1967 T, start_p, count, low, high, \
coleenp@113 1968 do_oop, assert_fn) \
coleenp@113 1969 { \
coleenp@113 1970 T* const l = (T*)(low); \
coleenp@113 1971 T* const h = (T*)(high); \
coleenp@113 1972 assert(mask_bits((intptr_t)l, sizeof(T)-1) == 0 && \
coleenp@113 1973 mask_bits((intptr_t)h, sizeof(T)-1) == 0, \
coleenp@113 1974 "bounded region must be properly aligned"); \
coleenp@113 1975 T* p = (T*)(start_p); \
coleenp@113 1976 T* end = p + (count); \
coleenp@113 1977 if (p < l) p = l; \
coleenp@113 1978 if (end > h) end = h; \
coleenp@113 1979 while (p < end) { \
coleenp@113 1980 (assert_fn)(p); \
coleenp@113 1981 do_oop; \
coleenp@113 1982 ++p; \
coleenp@113 1983 } \
coleenp@113 1984 }
coleenp@113 1985
coleenp@113 1986
coleenp@113 1987 // The following macros call specialized macros, passing either oop or
coleenp@113 1988 // narrowOop as the specialization type. These test the UseCompressedOops
coleenp@113 1989 // flag.
coleenp@113 1990 #define InstanceKlass_OOP_MAP_ITERATE(obj, do_oop, assert_fn) \
coleenp@113 1991 { \
coleenp@113 1992 /* Compute oopmap block range. The common case \
coleenp@113 1993 is nonstatic_oop_map_size == 1. */ \
coleenp@113 1994 OopMapBlock* map = start_of_nonstatic_oop_maps(); \
jcoomes@938 1995 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \
coleenp@113 1996 if (UseCompressedOops) { \
coleenp@113 1997 while (map < end_map) { \
coleenp@113 1998 InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
jcoomes@938 1999 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
coleenp@113 2000 do_oop, assert_fn) \
coleenp@113 2001 ++map; \
coleenp@113 2002 } \
coleenp@113 2003 } else { \
coleenp@113 2004 while (map < end_map) { \
coleenp@113 2005 InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \
jcoomes@938 2006 obj->obj_field_addr<oop>(map->offset()), map->count(), \
coleenp@113 2007 do_oop, assert_fn) \
coleenp@113 2008 ++map; \
coleenp@113 2009 } \
coleenp@113 2010 } \
coleenp@113 2011 }
coleenp@113 2012
coleenp@113 2013 #define InstanceKlass_OOP_MAP_REVERSE_ITERATE(obj, do_oop, assert_fn) \
coleenp@113 2014 { \
coleenp@113 2015 OopMapBlock* const start_map = start_of_nonstatic_oop_maps(); \
jcoomes@938 2016 OopMapBlock* map = start_map + nonstatic_oop_map_count(); \
coleenp@113 2017 if (UseCompressedOops) { \
coleenp@113 2018 while (start_map < map) { \
coleenp@113 2019 --map; \
coleenp@113 2020 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(narrowOop, \
jcoomes@938 2021 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
coleenp@113 2022 do_oop, assert_fn) \
coleenp@113 2023 } \
coleenp@113 2024 } else { \
coleenp@113 2025 while (start_map < map) { \
coleenp@113 2026 --map; \
coleenp@113 2027 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(oop, \
jcoomes@938 2028 obj->obj_field_addr<oop>(map->offset()), map->count(), \
coleenp@113 2029 do_oop, assert_fn) \
coleenp@113 2030 } \
coleenp@113 2031 } \
coleenp@113 2032 }
coleenp@113 2033
coleenp@113 2034 #define InstanceKlass_BOUNDED_OOP_MAP_ITERATE(obj, low, high, do_oop, \
coleenp@113 2035 assert_fn) \
coleenp@113 2036 { \
coleenp@113 2037 /* Compute oopmap block range. The common case is \
coleenp@113 2038 nonstatic_oop_map_size == 1, so we accept the \
coleenp@113 2039 usually non-existent extra overhead of examining \
coleenp@113 2040 all the maps. */ \
coleenp@113 2041 OopMapBlock* map = start_of_nonstatic_oop_maps(); \
jcoomes@938 2042 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \
coleenp@113 2043 if (UseCompressedOops) { \
coleenp@113 2044 while (map < end_map) { \
coleenp@113 2045 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
jcoomes@938 2046 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
coleenp@113 2047 low, high, \
coleenp@113 2048 do_oop, assert_fn) \
coleenp@113 2049 ++map; \
coleenp@113 2050 } \
coleenp@113 2051 } else { \
coleenp@113 2052 while (map < end_map) { \
coleenp@113 2053 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
jcoomes@938 2054 obj->obj_field_addr<oop>(map->offset()), map->count(), \
coleenp@113 2055 low, high, \
coleenp@113 2056 do_oop, assert_fn) \
coleenp@113 2057 ++map; \
coleenp@113 2058 } \
coleenp@113 2059 } \
coleenp@113 2060 }
coleenp@113 2061
coleenp@3656 2062 void InstanceKlass::oop_follow_contents(oop obj) {
coleenp@113 2063 assert(obj != NULL, "can't follow the content of NULL object");
coleenp@3656 2064 MarkSweep::follow_klass(obj->klass());
coleenp@113 2065 InstanceKlass_OOP_MAP_ITERATE( \
coleenp@113 2066 obj, \
coleenp@113 2067 MarkSweep::mark_and_push(p), \
coleenp@113 2068 assert_is_in_closed_subset)
duke@0 2069 }
duke@0 2070
jprovino@4184 2071 #if INCLUDE_ALL_GCS
coleenp@3656 2072 void InstanceKlass::oop_follow_contents(ParCompactionManager* cm,
duke@0 2073 oop obj) {
coleenp@113 2074 assert(obj != NULL, "can't follow the content of NULL object");
coleenp@3656 2075 PSParallelCompact::follow_klass(cm, obj->klass());
coleenp@3656 2076 // Only mark the header and let the scan of the meta-data mark
coleenp@3656 2077 // everything else.
coleenp@113 2078 InstanceKlass_OOP_MAP_ITERATE( \
coleenp@113 2079 obj, \
coleenp@113 2080 PSParallelCompact::mark_and_push(cm, p), \
coleenp@113 2081 assert_is_in)
duke@0 2082 }
jprovino@4184 2083 #endif // INCLUDE_ALL_GCS
duke@0 2084
coleenp@3656 2085 // closure's do_metadata() method dictates whether the given closure should be
duke@0 2086 // applied to the klass ptr in the object header.
duke@0 2087
coleenp@3656 2088 #define if_do_metadata_checked(closure, nv_suffix) \
coleenp@3656 2089 /* Make sure the non-virtual and the virtual versions match. */ \
coleenp@3656 2090 assert(closure->do_metadata##nv_suffix() == closure->do_metadata(), \
coleenp@3656 2091 "Inconsistency in do_metadata"); \
coleenp@3656 2092 if (closure->do_metadata##nv_suffix())
coleenp@3656 2093
ysr@342 2094 #define InstanceKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
ysr@342 2095 \
coleenp@3656 2096 int InstanceKlass::oop_oop_iterate##nv_suffix(oop obj, OopClosureType* closure) { \
coleenp@113 2097 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\
coleenp@113 2098 /* header */ \
coleenp@3656 2099 if_do_metadata_checked(closure, nv_suffix) { \
coleenp@3656 2100 closure->do_klass##nv_suffix(obj->klass()); \
coleenp@113 2101 } \
coleenp@113 2102 InstanceKlass_OOP_MAP_ITERATE( \
coleenp@113 2103 obj, \
coleenp@113 2104 SpecializationStats:: \
coleenp@113 2105 record_do_oop_call##nv_suffix(SpecializationStats::ik); \
coleenp@113 2106 (closure)->do_oop##nv_suffix(p), \
coleenp@113 2107 assert_is_in_closed_subset) \
coleenp@113 2108 return size_helper(); \
duke@0 2109 }
duke@0 2110
jprovino@4184 2111 #if INCLUDE_ALL_GCS
ysr@342 2112 #define InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \
ysr@342 2113 \
coleenp@3656 2114 int InstanceKlass::oop_oop_iterate_backwards##nv_suffix(oop obj, \
ysr@342 2115 OopClosureType* closure) { \
ysr@342 2116 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik); \
ysr@342 2117 /* header */ \
coleenp@3656 2118 if_do_metadata_checked(closure, nv_suffix) { \
coleenp@3656 2119 closure->do_klass##nv_suffix(obj->klass()); \
ysr@342 2120 } \
ysr@342 2121 /* instance variables */ \
ysr@342 2122 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
ysr@342 2123 obj, \
ysr@342 2124 SpecializationStats::record_do_oop_call##nv_suffix(SpecializationStats::ik);\
ysr@342 2125 (closure)->do_oop##nv_suffix(p), \
ysr@342 2126 assert_is_in_closed_subset) \
ysr@342 2127 return size_helper(); \
ysr@342 2128 }
jprovino@4184 2129 #endif // INCLUDE_ALL_GCS
ysr@342 2130
coleenp@113 2131 #define InstanceKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
coleenp@113 2132 \
coleenp@3656 2133 int InstanceKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
coleenp@113 2134 OopClosureType* closure, \
coleenp@113 2135 MemRegion mr) { \
coleenp@113 2136 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\
coleenp@3656 2137 if_do_metadata_checked(closure, nv_suffix) { \
coleenp@3656 2138 if (mr.contains(obj)) { \
coleenp@3656 2139 closure->do_klass##nv_suffix(obj->klass()); \
coleenp@3656 2140 } \
coleenp@113 2141 } \
coleenp@113 2142 InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \
coleenp@113 2143 obj, mr.start(), mr.end(), \
coleenp@113 2144 (closure)->do_oop##nv_suffix(p), \
coleenp@113 2145 assert_is_in_closed_subset) \
coleenp@113 2146 return size_helper(); \
duke@0 2147 }
duke@0 2148
duke@0 2149 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN)
ysr@342 2150 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN)
duke@0 2151 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN_m)
ysr@342 2152 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN_m)
jprovino@4184 2153 #if INCLUDE_ALL_GCS
ysr@342 2154 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN)
ysr@342 2155 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN)
jprovino@4184 2156 #endif // INCLUDE_ALL_GCS
duke@0 2157
coleenp@3656 2158 int InstanceKlass::oop_adjust_pointers(oop obj) {
duke@0 2159 int size = size_helper();
coleenp@113 2160 InstanceKlass_OOP_MAP_ITERATE( \
coleenp@113 2161 obj, \
coleenp@113 2162 MarkSweep::adjust_pointer(p), \
coleenp@113 2163 assert_is_in)
coleenp@3656 2164 MarkSweep::adjust_klass(obj->klass());
duke@0 2165 return size;
duke@0 2166 }
duke@0 2167
jprovino@4184 2168 #if INCLUDE_ALL_GCS
coleenp@3656 2169 void InstanceKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
coleenp@113 2170 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
coleenp@113 2171 obj, \
coleenp@113 2172 if (PSScavenge::should_scavenge(p)) { \
coleenp@113 2173 pm->claim_or_forward_depth(p); \
coleenp@113 2174 }, \
coleenp@113 2175 assert_nothing )
duke@0 2176 }
duke@0 2177
coleenp@3656 2178 int InstanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
coleenp@3656 2179 int size = size_helper();
coleenp@113 2180 InstanceKlass_OOP_MAP_ITERATE( \
coleenp@113 2181 obj, \
coleenp@113 2182 PSParallelCompact::adjust_pointer(p), \
coleenp@3656 2183 assert_is_in)
coleenp@3656 2184 obj->update_header(cm);
coleenp@3656 2185 return size;
duke@0 2186 }
duke@0 2187
jprovino@4184 2188 #endif // INCLUDE_ALL_GCS
duke@0 2189
coleenp@3656 2190 void InstanceKlass::clean_implementors_list(BoolObjectClosure* is_alive) {
coleenp@3656 2191 assert(is_loader_alive(is_alive), "this klass should be live");
jiangli@3296 2192 if (is_interface()) {
jiangli@3296 2193 if (ClassUnloading) {
coleenp@3656 2194 Klass* impl = implementor();
jiangli@3296 2195 if (impl != NULL) {
coleenp@3656 2196 if (!impl->is_loader_alive(is_alive)) {
jiangli@3296 2197 // remove this guy
morris@4341 2198 Klass** klass = adr_implementor();
morris@4341 2199 assert(klass != NULL, "null klass");
morris@4341 2200 if (klass != NULL) {
morris@4341 2201 *klass = NULL;
morris@4341 2202 }
jiangli@3296 2203 }
duke@0 2204 }
duke@0 2205 }
duke@0 2206 }
duke@0 2207 }
duke@0 2208
coleenp@3656 2209 void InstanceKlass::clean_method_data(BoolObjectClosure* is_alive) {
coleenp@3656 2210 for (int m = 0; m < methods()->length(); m++) {
coleenp@3656 2211 MethodData* mdo = methods()->at(m)->method_data();
coleenp@3656 2212 if (mdo != NULL) {
coleenp@3656 2213 for (ProfileData* data = mdo->first_data();
coleenp@3656 2214 mdo->is_valid(data);
coleenp@3656 2215 data = mdo->next_data(data)) {
coleenp@3656 2216 data->clean_weak_klass_links(is_alive);
coleenp@3656 2217 }
coleenp@3656 2218 }
coleenp@3656 2219 }
coleenp@3656 2220 }
coleenp@3656 2221
coleenp@3656 2222
coleenp@3656 2223 static void remove_unshareable_in_class(Klass* k) {
coleenp@3656 2224 // remove klass's unshareable info
coleenp@3656 2225 k->remove_unshareable_info();
coleenp@3656 2226 }
coleenp@3656 2227
coleenp@3656 2228 void InstanceKlass::remove_unshareable_info() {
duke@0 2229 Klass::remove_unshareable_info();
coleenp@3656 2230 // Unlink the class
coleenp@3656 2231 if (is_linked()) {
coleenp@3656 2232 unlink_class();
coleenp@3656 2233 }
duke@0 2234 init_implementor();
coleenp@3656 2235
coleenp@3656 2236 constants()->remove_unshareable_info();
coleenp@3656 2237
coleenp@3656 2238 for (int i = 0; i < methods()->length(); i++) {
coleenp@3656 2239 Method* m = methods()->at(i);
coleenp@3656 2240 m->remove_unshareable_info();
coleenp@3656 2241 }
coleenp@3656 2242
coleenp@3656 2243 // do array classes also.
coleenp@3656 2244 array_klasses_do(remove_unshareable_in_class);
duke@0 2245 }
duke@0 2246
coleenp@3656 2247 void restore_unshareable_in_class(Klass* k, TRAPS) {
coleenp@3656 2248 k->restore_unshareable_info(CHECK);
coleenp@3656 2249 }
coleenp@3656 2250
coleenp@3656 2251 void InstanceKlass::restore_unshareable_info(TRAPS) {
coleenp@3656 2252 Klass::restore_unshareable_info(CHECK);
coleenp@3656 2253 instanceKlassHandle ik(THREAD, this);
coleenp@3656 2254
coleenp@3656 2255 Array<Method*>* methods = ik->methods();
coleenp@3656 2256 int num_methods = methods->length();
coleenp@3656 2257 for (int index2 = 0; index2 < num_methods; ++index2) {
coleenp@3656 2258 methodHandle m(THREAD, methods->at(index2));
coleenp@3656 2259 m()->link_method(m, CHECK);
coleenp@3664 2260 // restore method's vtable by calling a virtual function
coleenp@3664 2261 m->restore_vtable();
coleenp@3656 2262 }
coleenp@3656 2263 if (JvmtiExport::has_redefined_a_class()) {
coleenp@3656 2264 // Reinitialize vtable because RedefineClasses may have changed some
coleenp@3656 2265 // entries in this vtable for super classes so the CDS vtable might
coleenp@3656 2266 // point to old or obsolete entries. RedefineClasses doesn't fix up
coleenp@3656 2267 // vtables in the shared system dictionary, only the main one.
coleenp@3656 2268 // It also redefines the itable too so fix that too.
coleenp@3656 2269 ResourceMark rm(THREAD);
coleenp@3656 2270 ik->vtable()->initialize_vtable(false, CHECK);
coleenp@3656 2271 ik->itable()->initialize_itable(false, CHECK);
coleenp@3656 2272 }
coleenp@3656 2273
coleenp@3656 2274 // restore constant pool resolved references
coleenp@3656 2275 ik->constants()->restore_unshareable_info(CHECK);
coleenp@3656 2276
coleenp@3656 2277 ik->array_klasses_do(restore_unshareable_in_class, CHECK);
coleenp@3656 2278 }
coleenp@3656 2279
coleenp@3656 2280 static void clear_all_breakpoints(Method* m) {
duke@0 2281 m->clear_all_breakpoints();
duke@0 2282 }
duke@0 2283
coleenp@4642 2284
coleenp@4642 2285 void InstanceKlass::notify_unload_class(InstanceKlass* ik) {
coleenp@4642 2286 // notify the debugger
coleenp@4642 2287 if (JvmtiExport::should_post_class_unload()) {
coleenp@4642 2288 JvmtiExport::post_class_unload(ik);
coleenp@4642 2289 }
coleenp@4642 2290
coleenp@4642 2291 // notify ClassLoadingService of class unload
coleenp@4642 2292 ClassLoadingService::notify_class_unloaded(ik);
coleenp@4642 2293 }
coleenp@4642 2294
coleenp@4642 2295 void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) {
coleenp@4642 2296 // Clean up C heap
coleenp@4642 2297 ik->release_C_heap_structures();
coleenp@4642 2298 ik->constants()->release_C_heap_structures();
coleenp@4642 2299 }
coleenp@4642 2300
coleenp@3656 2301 void InstanceKlass::release_C_heap_structures() {
coleenp@4642 2302
coleenp@4642 2303 // Can't release the constant pool here because the constant pool can be
coleenp@4642 2304 // deallocated separately from the InstanceKlass for default methods and
coleenp@4642 2305 // redefine classes.
coleenp@4642 2306
duke@0 2307 // Deallocate oop map cache
duke@0 2308 if (_oop_map_cache != NULL) {
duke@0 2309 delete _oop_map_cache;
duke@0 2310 _oop_map_cache = NULL;
duke@0 2311 }
duke@0 2312
duke@0 2313 // Deallocate JNI identifiers for jfieldIDs
duke@0 2314 JNIid::deallocate(jni_ids());
duke@0 2315 set_jni_ids(NULL);
duke@0 2316
duke@0 2317 jmethodID* jmeths = methods_jmethod_ids_acquire();
duke@0 2318 if (jmeths != (jmethodID*)NULL) {
duke@0 2319 release_set_methods_jmethod_ids(NULL);
duke@0 2320 FreeHeap(jmeths);
duke@0 2321 }
duke@0 2322
sspitsyn@4623 2323 MemberNameTable* mnt = member_names();
sspitsyn@4623 2324 if (mnt != NULL) {
sspitsyn@4623 2325 delete mnt;
sspitsyn@4623 2326 set_member_names(NULL);
sspitsyn@4623 2327 }
sspitsyn@4623 2328
duke@0 2329 int* indices = methods_cached_itable_indices_acquire();
duke@0 2330 if (indices != (int*)NULL) {
duke@0 2331 release_set_methods_cached_itable_indices(NULL);
duke@0 2332 FreeHeap(indices);
duke@0 2333 }
duke@0 2334
duke@0 2335 // release dependencies
duke@0 2336 nmethodBucket* b = _dependencies;
duke@0 2337 _dependencies = NULL;
duke@0 2338 while (b != NULL) {
duke@0 2339 nmethodBucket* next = b->next();
duke@0 2340 delete b;
duke@0 2341 b = next;
duke@0 2342 }
duke@0 2343
duke@0 2344 // Deallocate breakpoint records
duke@0 2345 if (breakpoints() != 0x0) {
duke@0 2346 methods_do(clear_all_breakpoints);
duke@0 2347 assert(breakpoints() == 0x0, "should have cleared breakpoints");
duke@0 2348 }
duke@0 2349
duke@0 2350 // deallocate information about previous versions
duke@0 2351 if (_previous_versions != NULL) {
duke@0 2352 for (int i = _previous_versions->length() - 1; i >= 0; i--) {
duke@0 2353 PreviousVersionNode * pv_node = _previous_versions->at(i);
duke@0 2354 delete pv_node;
duke@0 2355 }
duke@0 2356 delete _previous_versions;
duke@0 2357 _previous_versions = NULL;
duke@0 2358 }
duke@0 2359
duke@0 2360 // deallocate the cached class file
duke@0 2361 if (_cached_class_file_bytes != NULL) {
zgu@3505 2362 os::free(_cached_class_file_bytes, mtClass);
duke@0 2363 _cached_class_file_bytes = NULL;
duke@0 2364 _cached_class_file_len = 0;
duke@0 2365 }
coleenp@2069 2366
coleenp@2069 2367 // Decrement symbol reference counts associated with the unloaded class.
coleenp@2069 2368 if (_name != NULL) _name->decrement_refcount();
coleenp@2069 2369 // unreference array name derived from this class name (arrays of an unloaded
coleenp@2069 2370 // class can't be referenced anymore).
coleenp@2069 2371 if (_array_name != NULL) _array_name->decrement_refcount();
coleenp@2069 2372 if (_source_file_name != NULL) _source_file_name->decrement_refcount();
fparain@3511 2373 if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension, mtClass);
zgu@4040 2374
zgu@4040 2375 assert(_total_instanceKlass_count >= 1, "Sanity check");
zgu@4040 2376 Atomic::dec(&_total_instanceKlass_count);
coleenp@2069 2377 }
coleenp@2069 2378
coleenp@3656 2379 void InstanceKlass::set_source_file_name(Symbol* n) {
coleenp@2069 2380 _source_file_name = n;
coleenp@2069 2381 if (_source_file_name != NULL) _source_file_name->increment_refcount();
coleenp@2069 2382 }
coleenp@2069 2383
coleenp@3656 2384 void InstanceKlass::set_source_debug_extension(char* array, int length) {
fparain@3511 2385 if (array == NULL) {
fparain@3511 2386 _source_debug_extension = NULL;
fparain@3511 2387 } else {
fparain@3511 2388 // Adding one to the attribute length in order to store a null terminator
fparain@3511 2389 // character could cause an overflow because the attribute length is
fparain@3511 2390 // already coded with an u4 in the classfile, but in practice, it's
fparain@3511 2391 // unlikely to happen.
fparain@3511 2392 assert((length+1) > length, "Overflow checking");
fparain@3511 2393 char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass);
fparain@3511 2394 for (int i = 0; i < length; i++) {
fparain@3511 2395 sde[i] = array[i];
fparain@3511 2396 }
fparain@3511 2397 sde[length] = '\0';
fparain@3511 2398 _source_debug_extension = sde;
fparain@3511 2399 }
duke@0 2400 }
duke@0 2401
coleenp@3656 2402 address InstanceKlass::static_field_addr(int offset) {
coleenp@3666 2403 return (address)(offset + InstanceMirrorKlass::offset_of_static_fields() + (intptr_t)java_mirror());
never@2231 2404 }
never@2231 2405
never@2231 2406
coleenp@3656 2407 const char* InstanceKlass::signature_name() const {
duke@0 2408 const char* src = (const char*) (name()->as_C_string());
duke@0 2409 const int src_length = (int)strlen(src);
duke@0 2410 char* dest = NEW_RESOURCE_ARRAY(char, src_length + 3);
duke@0 2411 int src_index = 0;
duke@0 2412 int dest_index = 0;
duke@0 2413 dest[dest_index++] = 'L';
duke@0 2414 while (src_index < src_length) {
duke@0 2415 dest[dest_index++] = src[src_index++];
duke@0 2416 }
duke@0 2417 dest[dest_index++] = ';';
duke@0 2418 dest[dest_index] = '\0';
duke@0 2419 return dest;
duke@0 2420 }
duke@0 2421
duke@0 2422 // different verisons of is_same_class_package
coleenp@3656 2423 bool InstanceKlass::is_same_class_package(Klass* class2) {
coleenp@3656 2424 Klass* class1 = this;
coleenp@3656 2425 oop classloader1 = InstanceKlass::cast(class1)->class_loader();
hseigel@3908 2426 Symbol* classname1 = class1->name();
hseigel@3908 2427
hseigel@3908 2428 if (class2->oop_is_objArray()) {
coleenp@3764 2429 class2 = ObjArrayKlass::cast(class2)->bottom_klass();
duke@0 2430 }
duke@0 2431 oop classloader2;
hseigel@3908 2432 if (class2->oop_is_instance()) {
coleenp@3656 2433 classloader2 = InstanceKlass::cast(class2)->class_loader();
duke@0 2434 } else {
hseigel@3908 2435 assert(class2->oop_is_typeArray(), "should be type array");
duke@0 2436 classloader2 = NULL;
duke@0 2437 }
hseigel@3908 2438 Symbol* classname2 = class2->name();
duke@0 2439
coleenp@3656 2440 return InstanceKlass::is_same_class_package(classloader1, classname1,
duke@0 2441 classloader2, classname2);
duke@0 2442 }
duke@0 2443
coleenp@3656 2444 bool InstanceKlass::is_same_class_package(oop classloader2, Symbol* classname2) {
coleenp@3656 2445 Klass* class1 = this;
coleenp@3656 2446 oop classloader1 = InstanceKlass::cast(class1)->class_loader();
hseigel@3908 2447 Symbol* classname1 = class1->name();
duke@0 2448
coleenp@3656 2449 return InstanceKlass::is_same_class_package(classloader1, classname1,
duke@0 2450 classloader2, classname2);
duke@0 2451 }
duke@0 2452
duke@0 2453 // return true if two classes are in the same package, classloader
duke@0 2454 // and classname information is enough to determine a class's package
coleenp@3656 2455 bool InstanceKlass::is_same_class_package(oop class_loader1, Symbol* class_name1,
coleenp@2069 2456 oop class_loader2, Symbol* class_name2) {
duke@0 2457 if (class_loader1 != class_loader2) {
duke@0 2458 return false;
jrose@665 2459 } else if (class_name1 == class_name2) {
jrose@665 2460 return true; // skip painful bytewise comparison
duke@0 2461 } else {
duke@0 2462 ResourceMark rm;
duke@0 2463
coleenp@2069 2464 // The Symbol*'s are in UTF8 encoding. Since we only need to check explicitly
duke@0 2465 // for ASCII characters ('/', 'L', '['), we can keep them in UTF8 encoding.
duke@0 2466 // Otherwise, we just compare jbyte values between the strings.
coleenp@2069 2467 const jbyte *name1 = class_name1->base();
coleenp@2069 2468 const jbyte *name2 = class_name2->base();
coleenp@2069 2469
coleenp@2069 2470 const jbyte *last_slash1 = UTF8::strrchr(name1, class_name1->utf8_length(), '/');
coleenp@2069 2471 const jbyte *last_slash2 = UTF8::strrchr(name2, class_name2->utf8_length(), '/');
duke@0 2472
duke@0 2473 if ((last_slash1 == NULL) || (last_slash2 == NULL)) {
duke@0 2474 // One of the two doesn't have a package. Only return true
duke@0 2475 // if the other one also doesn't have a package.
duke@0 2476 return last_slash1 == last_slash2;
duke@0 2477 } else {
duke@0 2478 // Skip over '['s
duke@0 2479 if (*name1 == '[') {
duke@0 2480 do {
duke@0 2481 name1++;
duke@0 2482 } while (*name1 == '[');
duke@0 2483 if (*name1 != 'L') {
duke@0 2484 // Something is terribly wrong. Shouldn't be here.
duke@0 2485 return false;
duke@0 2486 }
duke@0 2487 }
duke@0 2488 if (*name2 == '[') {
duke@0 2489 do {
duke@0 2490 name2++;
duke@0 2491 } while (*name2 == '[');
duke@0 2492 if (*name2 != 'L') {
duke@0 2493 // Something is terribly wrong. Shouldn't be here.
duke@0 2494 return false;
duke@0 2495 }
duke@0 2496 }
duke@0 2497
duke@0 2498 // Check that package part is identical
duke@0 2499 int length1 = last_slash1 - name1;
duke@0 2500 int length2 = last_slash2 - name2;
duke@0 2501
duke@0 2502 return UTF8::equal(name1, length1, name2, length2);
duke@0 2503 }
duke@0 2504 }
duke@0 2505 }
duke@0 2506
acorn@652 2507 // Returns true iff super_method can be overridden by a method in targetclassname
acorn@652 2508 // See JSL 3rd edition 8.4.6.1
acorn@652 2509 // Assumes name-signature match
coleenp@3656 2510 // "this" is InstanceKlass of super_method which must exist
coleenp@3656 2511 // note that the InstanceKlass of the method in the targetclassname has not always been created yet
coleenp@3656 2512 bool InstanceKlass::is_override(methodHandle super_method, Handle targetclassloader, Symbol* targetclassname, TRAPS) {
acorn@652 2513 // Private methods can not be overridden
acorn@652 2514 if (super_method->is_private()) {
acorn@652 2515 return false;
acorn@652 2516 }
acorn@652 2517 // If super method is accessible, then override
acorn@652 2518 if ((super_method->is_protected()) ||
acorn@652 2519 (super_method->is_public())) {
acorn@652 2520 return true;
acorn@652 2521 }
acorn@652 2522 // Package-private methods are not inherited outside of package
acorn@652 2523 assert(super_method->is_package_private(), "must be package private");
coleenp@2069 2524 return(is_same_class_package(targetclassloader(), targetclassname));
acorn@652 2525 }
twisti@605 2526
jrose@665 2527 /* defined for now in jvm.cpp, for historical reasons *--
coleenp@3656 2528 Klass* InstanceKlass::compute_enclosing_class_impl(instanceKlassHandle self,
coleenp@2069 2529 Symbol*& simple_name_result, TRAPS) {
jrose@665 2530 ...
jrose@665 2531 }
jrose@665 2532 */
jrose@665 2533
jrose@665 2534 // tell if two classes have the same enclosing class (at package level)
coleenp@3656 2535 bool InstanceKlass::is_same_package_member_impl(instanceKlassHandle class1,
coleenp@3656 2536 Klass* class2_oop, TRAPS) {
coleenp@3656 2537 if (class2_oop == class1()) return true;
hseigel@3908 2538 if (!class2_oop->oop_is_instance()) return false;
jrose@665 2539 instanceKlassHandle class2(THREAD, class2_oop);
jrose@665 2540
jrose@665 2541 // must be in same package before we try anything else
jrose@665 2542 if (!class1->is_same_class_package(class2->class_loader(), class2->name()))
jrose@665 2543 return false;
jrose@665 2544
jrose@665 2545 // As long as there is an outer1.getEnclosingClass,
jrose@665 2546 // shift the search outward.
jrose@665 2547 instanceKlassHandle outer1 = class1;
jrose@665 2548 for (;;) {
jrose@665 2549 // As we walk along, look for equalities between outer1 and class2.
jrose@665 2550 // Eventually, the walks will terminate as outer1 stops
jrose@665 2551 // at the top-level class around the original class.
xlu@1126 2552 bool ignore_inner_is_member;
coleenp@3656 2553 Klass* next = outer1->compute_enclosing_class(&ignore_inner_is_member,
xlu@1126 2554 CHECK_false);
jrose@665 2555 if (next == NULL) break;
jrose@665 2556 if (next == class2()) return true;
jrose@665 2557 outer1 = instanceKlassHandle(THREAD, next);
jrose@665 2558 }
jrose@665 2559
jrose@665 2560 // Now do the same for class2.
jrose@665 2561 instanceKlassHandle outer2 = class2;
jrose@665 2562 for (;;) {
xlu@1126 2563 bool ignore_inner_is_member;
coleenp@3656 2564 Klass* next = outer2->compute_enclosing_class(&ignore_inner_is_member,
xlu@1126 2565 CHECK_false);
jrose@665 2566 if (next == NULL) break;
jrose@665 2567 // Might as well check the new outer against all available values.
jrose@665 2568 if (next == class1()) return true;
jrose@665 2569 if (next == outer1()) return true;
jrose@665 2570 outer2 = instanceKlassHandle(THREAD, next);
jrose@665 2571 }
jrose@665 2572
jrose@665 2573 // If by this point we have not found an equality between the
jrose@665 2574 // two classes, we know they are in separate package members.
jrose@665 2575 return false;
jrose@665 2576 }
jrose@665 2577
duke@0 2578
coleenp@3656 2579 jint InstanceKlass::compute_modifier_flags(TRAPS) const {
duke@0 2580 jint access = access_flags().as_int();
duke@0 2581
duke@0 2582 // But check if it happens to be member class.
coleenp@3656 2583 instanceKlassHandle ik(THREAD, this);
jiangli@3256 2584 InnerClassesIterator iter(ik);
jiangli@3256 2585 for (; !iter.done(); iter.next()) {
jiangli@3256 2586 int ioff = iter.inner_class_info_index();
jiangli@3256 2587 // Inner class attribute can be zero, skip it.
jiangli@3256 2588 // Strange but true: JVM spec. allows null inner class refs.
jiangli@3256 2589 if (ioff == 0) continue;
jiangli@3256 2590
jiangli@3256 2591 // only look at classes that are already loaded
jiangli@3256 2592 // since we are looking for the flags for our self.
jiangli@3256 2593 Symbol* inner_name = ik->constants()->klass_name_at(ioff);
jiangli@3256 2594 if ((ik->name() == inner_name)) {
jiangli@3256 2595 // This is really a member class.
jiangli@3256 2596 access = iter.inner_access_flags();
jiangli@3256 2597 break;
duke@0 2598 }
duke@0 2599 }
duke@0 2600 // Remember to strip ACC_SUPER bit
duke@0 2601 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS;
duke@0 2602 }
duke@0 2603
coleenp@3656 2604 jint InstanceKlass::jvmti_class_status() const {
duke@0 2605 jint result = 0;
duke@0 2606
duke@0 2607 if (is_linked()) {
duke@0 2608 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED;
duke@0 2609 }
duke@0 2610
duke@0 2611 if (is_initialized()) {
duke@0 2612 assert(is_linked(), "Class status is not consistent");
duke@0 2613 result |= JVMTI_CLASS_STATUS_INITIALIZED;
duke@0 2614 }
duke@0 2615 if (is_in_error_state()) {
duke@0 2616 result |= JVMTI_CLASS_STATUS_ERROR;
duke@0 2617 }
duke@0 2618 return result;
duke@0 2619 }
duke@0 2620
coleenp@3656 2621 Method* InstanceKlass::method_at_itable(Klass* holder, int index, TRAPS) {
duke@0 2622 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
duke@0 2623 int method_table_offset_in_words = ioe->offset()/wordSize;
duke@0 2624 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
duke@0 2625 / itableOffsetEntry::size();
duke@0 2626
duke@0 2627 for (int cnt = 0 ; ; cnt ++, ioe ++) {
twisti@605 2628 // If the interface isn't implemented by the receiver class,
duke@0 2629 // the VM should throw IncompatibleClassChangeError.
duke@0 2630 if (cnt >= nof_interfaces) {
coleenp@3656 2631 THROW_NULL(vmSymbols::java_lang_IncompatibleClassChangeError());
duke@0 2632 }
duke@0 2633
coleenp@3656 2634 Klass* ik = ioe->interface_klass();
duke@0 2635 if (ik == holder) break;
duke@0 2636 }
duke@0 2637
coleenp@3656 2638 itableMethodEntry* ime = ioe->first_method_entry(this);
coleenp@3656 2639 Method* m = ime[index].method();
duke@0 2640 if (m == NULL) {
coleenp@3656 2641 THROW_NULL(vmSymbols::java_lang_AbstractMethodError());
duke@0 2642 }
duke@0 2643 return m;
duke@0 2644 }
duke@0 2645
duke@0 2646 // On-stack replacement stuff
coleenp@3656 2647 void InstanceKlass::add_osr_nmethod(nmethod* n) {
duke@0 2648 // only one compilation can be active
duke@0 2649 NEEDS_CLEANUP
duke@0 2650 // This is a short non-blocking critical region, so the no safepoint check is ok.
duke@0 2651 OsrList_lock->lock_without_safepoint_check();
duke@0 2652 assert(n->is_osr_method(), "wrong kind of nmethod");
jrose@989 2653 n->set_osr_link(osr_nmethods_head());
duke@0 2654 set_osr_nmethods_head(n);
iveresov@1707 2655 // Raise the highest osr level if necessary
iveresov@1707 2656 if (TieredCompilation) {
coleenp@3656 2657 Method* m = n->method();
iveresov@1707 2658 m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level()));
iveresov@1707 2659 }
duke@0 2660 // Remember to unlock again
duke@0 2661 OsrList_lock->unlock();
iveresov@1707 2662
iveresov@1707 2663 // Get rid of the osr methods for the same bci that have lower levels.
iveresov@1707 2664 if (TieredCompilation) {
iveresov@1707 2665 for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) {
iveresov@1707 2666 nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true);
iveresov@1707 2667 if (inv != NULL && inv->is_in_use()) {
iveresov@1707 2668 inv->make_not_entrant();
iveresov@1707 2669 }
iveresov@1707 2670 }
iveresov@1707 2671 }
duke@0 2672 }
duke@0 2673
duke@0 2674
coleenp@3656 2675 void InstanceKlass::remove_osr_nmethod(nmethod* n) {
duke@0 2676 // This is a short non-blocking critical region, so the no safepoint check is ok.
duke@0 2677 OsrList_lock->lock_without_safepoint_check();
duke@0 2678 assert(n->is_osr_method(), "wrong kind of nmethod");
duke@0 2679 nmethod* last = NULL;
duke@0 2680 nmethod* cur = osr_nmethods_head();
iveresov@1707 2681 int max_level = CompLevel_none; // Find the max comp level excluding n
coleenp@3656 2682 Method* m = n->method();
duke@0 2683 // Search for match
duke@0 2684 while(cur != NULL && cur != n) {
iveresov@1707 2685 if (TieredCompilation) {
iveresov@1707 2686 // Find max level before n
iveresov@1707 2687 max_level = MAX2(max_level, cur->comp_level());
iveresov@1707 2688 }
duke@0 2689 last = cur;
jrose@989 2690 cur = cur->osr_link();
duke@0 2691 }
iveresov@1707 2692 nmethod* next = NULL;
duke@0 2693 if (cur == n) {
iveresov@1707 2694 next = cur->osr_link();
duke@0 2695 if (last == NULL) {
duke@0 2696 // Remove first element
iveresov@1707 2697 set_osr_nmethods_head(next);
duke@0 2698 } else {
iveresov@1707 2699 last->set_osr_link(next);
duke@0 2700 }
duke@0 2701 }
jrose@989 2702 n->set_osr_link(NULL);
iveresov@1707 2703 if (TieredCompilation) {
iveresov@1707 2704 cur = next;
iveresov@1707 2705 while (cur != NULL) {
iveresov@1707 2706 // Find max level after n
iveresov@1707 2707 max_level = MAX2(max_level, cur->comp_level());
iveresov@1707 2708 cur = cur->osr_link();
iveresov@1707 2709 }
iveresov@1707 2710 m->set_highest_osr_comp_level(max_level);
iveresov@1707 2711 }
duke@0 2712 // Remember to unlock again
duke@0 2713 OsrList_lock->unlock();
duke@0 2714 }
duke@0 2715
minqi@4759 2716 nmethod* InstanceKlass::lookup_osr_nmethod(const Method* m, int bci, int comp_level, bool match_level) const {
duke@0 2717 // This is a short non-blocking critical region, so the no safepoint check is ok.
duke@0 2718 OsrList_lock->lock_without_safepoint_check();
duke@0 2719 nmethod* osr = osr_nmethods_head();
iveresov@1707 2720 nmethod* best = NULL;
duke@0 2721 while (osr != NULL) {
duke@0 2722 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
iveresov@1707 2723 // There can be a time when a c1 osr method exists but we are waiting
iveresov@1707 2724 // for a c2 version. When c2 completes its osr nmethod we will trash
iveresov@1707 2725 // the c1 version and only be able to find the c2 version. However
iveresov@1707 2726 // while we overflow in the c1 code at back branches we don't want to
iveresov@1707 2727 // try and switch to the same code as we are already running
iveresov@1707 2728
duke@0 2729 if (osr->method() == m &&
duke@0 2730 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) {
iveresov@1707 2731 if (match_level) {
iveresov@1707 2732 if (osr->comp_level() == comp_level) {
iveresov@1707 2733 // Found a match - return it.
iveresov@1707 2734 OsrList_lock->unlock();
iveresov@1707 2735 return osr;
iveresov@1707 2736 }
iveresov@1707 2737 } else {
iveresov@1707 2738 if (best == NULL || (osr->comp_level() > best->comp_level())) {
iveresov@1707 2739 if (osr->comp_level() == CompLevel_highest_tier) {
iveresov@1707 2740 // Found the best possible - return it.
iveresov@1707 2741 OsrList_lock->unlock();
iveresov@1707 2742 return osr;
iveresov@1707 2743 }
iveresov@1707 2744 best = osr;
iveresov@1707 2745 }
iveresov@1707 2746 }
duke@0 2747 }
jrose@989 2748 osr = osr->osr_link();
duke@0 2749 }
duke@0 2750 OsrList_lock->unlock();
iveresov@1707 2751 if (best != NULL && best->comp_level() >= comp_level && match_level == false) {
iveresov@1707 2752 return best;
iveresov@1707 2753 }
duke@0 2754 return NULL;
duke@0 2755 }
duke@0 2756
sspitsyn@4623 2757 void InstanceKlass::add_member_name(Handle mem_name) {
sspitsyn@4623 2758 jweak mem_name_wref = JNIHandles::make_weak_global(mem_name);
sspitsyn@4623 2759 MutexLocker ml(MemberNameTable_lock);
sspitsyn@4623 2760 DEBUG_ONLY(No_Safepoint_Verifier nsv);
sspitsyn@4623 2761
sspitsyn@4623 2762 if (_member_names == NULL) {
sspitsyn@4623 2763 _member_names = new (ResourceObj::C_HEAP, mtClass) MemberNameTable();
sspitsyn@4623 2764 }
sspitsyn@4623 2765 _member_names->add_member_name(mem_name_wref);
sspitsyn@4623 2766 }
sspitsyn@4623 2767
duke@0 2768 // -----------------------------------------------------------------------------------------------------
coleenp@3656 2769 // Printing
coleenp@3656 2770
duke@0 2771 #ifndef PRODUCT
duke@0 2772
jrose@665 2773 #define BULLET " - "
jrose@665 2774
coleenp@3656 2775 static const char* state_names[] = {
coleenp@3656 2776 "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error"
coleenp@3656 2777 };
coleenp@3656 2778
coleenp@3656 2779 void InstanceKlass::print_on(outputStream* st) const {
coleenp@3656 2780 assert(is_klass(), "must be klass");
coleenp@3656 2781 Klass::print_on(st);
coleenp@3656 2782
coleenp@3656 2783 st->print(BULLET"instance size: %d", size_helper()); st->cr();
coleenp@3656 2784 st->print(BULLET"klass size: %d", size()); st->cr();
coleenp@3656 2785 st->print(BULLET"access: "); access_flags().print_on(st); st->cr();
coleenp@3656 2786 st->print(BULLET"state: "); st->print_cr(state_names[_init_state]);
coleenp@3656 2787 st->print(BULLET"name: "); name()->print_value_on(st); st->cr();
coleenp@3656 2788 st->print(BULLET"super: "); super()->print_value_on_maybe_null(st); st->cr();
coleenp@3656 2789 st->print(BULLET"sub: ");
coleenp@3656 2790 Klass* sub = subklass();
coleenp@3656 2791 int n;
coleenp@3656 2792 for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) {
coleenp@3656 2793 if (n < MaxSubklassPrintSize) {
coleenp@3656 2794 sub->print_value_on(st);
coleenp@3656 2795 st->print(" ");
coleenp@3656 2796 }
coleenp@3656 2797 }
coleenp@3656 2798 if (n >= MaxSubklassPrintSize) st->print("(%d more klasses...)", n - MaxSubklassPrintSize);
coleenp@3656 2799 st->cr();
coleenp@3656 2800
coleenp@3656 2801 if (is_interface()) {
coleenp@3656 2802 st->print_cr(BULLET"nof implementors: %d", nof_implementors());
coleenp@3656 2803 if (nof_implementors() == 1) {
coleenp@3656 2804 st->print_cr(BULLET"implementor: ");
coleenp@3656 2805 st->print(" ");
coleenp@3656 2806 implementor()->print_value_on(st);
coleenp@3656 2807 st->cr();
coleenp@3656 2808 }
coleenp@3656 2809 }
coleenp@3656 2810
coleenp@3656 2811 st->print(BULLET"arrays: "); array_klasses()->print_value_on_maybe_null(st); st->cr();
coleenp@3656 2812 st->print(BULLET"methods: "); methods()->print_value_on(st); st->cr();
coleenp@3656 2813 if (Verbose) {
coleenp@3656 2814 Array<Method*>* method_array = methods();
coleenp@3656 2815 for(int i = 0; i < method_array->length(); i++) {
coleenp@3656 2816 st->print("%d : ", i); method_array->at(i)->print_value(); st->cr();
coleenp@3656 2817 }
coleenp@3656 2818 }
coleenp@3656 2819 st->print(BULLET"method ordering: "); method_ordering()->print_value_on(st); st->cr();
coleenp@3656 2820 st->print(BULLET"local interfaces: "); local_interfaces()->print_value_on(st); st->cr();
coleenp@3656 2821 st->print(BULLET"trans. interfaces: "); transitive_interfaces()->print_value_on(st); st->cr();
coleenp@3656 2822 st->print(BULLET"constants: "); constants()->print_value_on(st); st->cr();
coleenp@3656 2823 if (class_loader_data() != NULL) {
coleenp@3656 2824 st->print(BULLET"class loader data: ");
coleenp@3656 2825 class_loader_data()->print_value_on(st);
coleenp@3656 2826 st->cr();
coleenp@3656 2827 }
coleenp@3656 2828 st->print(BULLET"host class: "); host_klass()->print_value_on_maybe_null(st); st->cr();
coleenp@3656 2829 if (source_file_name() != NULL) {
coleenp@3656 2830 st->print(BULLET"source file: ");
coleenp@3656 2831 source_file_name()->print_value_on(st);
coleenp@3656 2832 st->cr();
coleenp@3656 2833 }
coleenp@3656 2834 if (source_debug_extension() != NULL) {
coleenp@3656 2835 st->print(BULLET"source debug extension: ");
coleenp@3656 2836 st->print("%s", source_debug_extension());
coleenp@3656 2837 st->cr();
coleenp@3656 2838 }
coleenp@4214 2839 st->print(BULLET"class annotations: "); class_annotations()->print_value_on(st); st->cr();
coleenp@4214 2840 st->print(BULLET"class type annotations: "); class_type_annotations()->print_value_on(st); st->cr();
coleenp@4214 2841 st->print(BULLET"field annotations: "); fields_annotations()->print_value_on(st); st->cr();
coleenp@4214 2842 st->print(BULLET"field type annotations: "); fields_type_annotations()->print_value_on(st); st->cr();
coleenp@3656 2843 {
coleenp@3656 2844 ResourceMark rm;
coleenp@3656 2845 // PreviousVersionInfo objects returned via PreviousVersionWalker
coleenp@3656 2846 // contain a GrowableArray of handles. We have to clean up the
coleenp@3656 2847 // GrowableArray _after_ the PreviousVersionWalker destructor
coleenp@3656 2848 // has destroyed the handles.
coleenp@3656 2849 {
coleenp@3656 2850 bool have_pv = false;
coleenp@3656 2851 PreviousVersionWalker pvw((InstanceKlass*)this);
coleenp@3656 2852 for (PreviousVersionInfo * pv_info = pvw.next_previous_version();
coleenp@3656 2853 pv_info != NULL; pv_info = pvw.next_previous_version()) {
coleenp@3656 2854 if (!have_pv)
coleenp@3656 2855 st->print(BULLET"previous version: ");
coleenp@3656 2856 have_pv = true;
coleenp@3656 2857 pv_info->prev_constant_pool_handle()()->print_value_on(st);
coleenp@3656 2858 }
coleenp@3656 2859 if (have_pv) st->cr();
coleenp@3656 2860 } // pvw is cleaned up
coleenp@3656 2861 } // rm is cleaned up
coleenp@3656 2862
coleenp@3656 2863 if (generic_signature() != NULL) {
coleenp@3656 2864 st->print(BULLET"generic signature: ");
coleenp@3656 2865 generic_signature()->print_value_on(st);
coleenp@3656 2866 st->cr();
coleenp@3656 2867 }
coleenp@3656 2868 st->print(BULLET"inner classes: "); inner_classes()->print_value_on(st); st->cr();
coleenp@3656 2869 st->print(BULLET"java mirror: "); java_mirror()->print_value_on(st); st->cr();
coleenp@3656 2870 st->print(BULLET"vtable length %d (start addr: " INTPTR_FORMAT ")", vtable_length(), start_of_vtable()); st->cr();
coleenp@3656 2871 st->print(BULLET"itable length %d (start addr: " INTPTR_FORMAT ")", itable_length(), start_of_itable()); st->cr();
coleenp@3656 2872 st->print_cr(BULLET"---- static fields (%d words):", static_field_size());
coleenp@3656 2873 FieldPrinter print_static_field(st);
coleenp@3656 2874 ((InstanceKlass*)this)->do_local_static_fields(&print_static_field);
coleenp@3656 2875 st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size());
coleenp@3656 2876 FieldPrinter print_nonstatic_field(st);
coleenp@3656 2877 ((InstanceKlass*)this)->do_nonstatic_fields(&print_nonstatic_field);
coleenp@3656 2878
coleenp@3656 2879 st->print(BULLET"non-static oop maps: ");
coleenp@3656 2880 OopMapBlock* map = start_of_nonstatic_oop_maps();
coleenp@3656 2881 OopMapBlock* end_map = map + nonstatic_oop_map_count();
coleenp@3656 2882 while (map < end_map) {
coleenp@3656 2883 st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1));
coleenp@3656 2884 map++;
coleenp@3656 2885 }
coleenp@3656 2886 st->cr();
coleenp@3656 2887 }
coleenp@3656 2888
coleenp@3656 2889 #endif //PRODUCT
coleenp@3656 2890
coleenp@3656 2891 void InstanceKlass::print_value_on(outputStream* st) const {
coleenp@3656 2892 assert(is_klass(), "must be klass");
coleenp@3656 2893 name()->print_value_on(st);
coleenp@3656 2894 }
coleenp@3656 2895
coleenp@3656 2896 #ifndef PRODUCT
coleenp@3656 2897
duke@0 2898 void FieldPrinter::do_field(fieldDescriptor* fd) {
jrose@665 2899 _st->print(BULLET);
never@2231 2900 if (_obj == NULL) {
duke@0 2901 fd->print_on(_st);
duke@0 2902 _st->cr();
duke@0 2903 } else {
duke@0 2904 fd->print_on_for(_st, _obj);
duke@0 2905 _st->cr();
duke@0 2906 }
duke@0 2907 }
duke@0 2908
duke@0 2909
coleenp@3656 2910 void InstanceKlass::oop_print_on(oop obj, outputStream* st) {
duke@0 2911 Klass::oop_print_on(obj, st);
duke@0 2912
coleenp@3656 2913 if (this == SystemDictionary::String_klass()) {
duke@0 2914 typeArrayOop value = java_lang_String::value(obj);
duke@0 2915 juint offset = java_lang_String::offset(obj);
duke@0 2916 juint length = java_lang_String::length(obj);
duke@0 2917 if (value != NULL &&
duke@0 2918 value->is_typeArray() &&
duke@0 2919 offset <= (juint) value->length() &&
duke@0 2920 offset + length <= (juint) value->length()) {
jrose@665 2921 st->print(BULLET"string: ");
duke@0 2922 Handle h_obj(obj);
duke@0 2923 java_lang_String::print(h_obj, st);
duke@0 2924 st->cr();
duke@0 2925 if (!WizardMode) return; // that is enough
duke@0 2926 }
duke@0 2927 }
duke@0 2928
jrose@665 2929 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj));
never@2231 2930 FieldPrinter print_field(st, obj);
never@2231 2931 do_nonstatic_fields(&print_field);
duke@0 2932
coleenp@3656 2933 if (this == SystemDictionary::Class_klass()) {
jrose@665 2934 st->print(BULLET"signature: ");
jrose@665 2935 java_lang_Class::print_signature(obj, st);
jrose@665 2936 st->cr();
coleenp@3656 2937 Klass* mirrored_klass = java_lang_Class::as_Klass(obj);
jrose@665 2938 st->print(BULLET"fake entry for mirror: ");
coleenp@3656 2939 mirrored_klass->print_value_on_maybe_null(st);
duke@0 2940 st->cr();
coleenp@3656 2941 Klass* array_klass = java_lang_Class::array_klass(obj);
jrose@665 2942 st->print(BULLET"fake entry for array: ");
coleenp@3656 2943 array_klass->print_value_on_maybe_null(st);
duke@0 2944 st->cr();
never@2231 2945 st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj));
never@2231 2946 st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj));
coleenp@3656 2947 Klass* real_klass = java_lang_Class::as_Klass(obj);
coleenp@3656 2948 if (real_klass != NULL && real_klass->oop_is_instance()) {
coleenp@3656 2949 InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field);
never@2231 2950 }
coleenp@3656 2951 } else if (this == SystemDictionary::MethodType_klass()) {
jrose@1039 2952 st->print(BULLET"signature: ");
jrose@2212 2953 java_lang_invoke_MethodType::print_signature(obj, st);
jrose@1039 2954 st->cr();
duke@0 2955 }
duke@0 2956 }
duke@0 2957
jrose@1155 2958 #endif //PRODUCT
jrose@1155 2959
coleenp@3656 2960 void InstanceKlass::oop_print_value_on(oop obj, outputStream* st) {
duke@0 2961 st->print("a ");
duke@0 2962 name()->print_value_on(st);
duke@0 2963 obj->print_address_on(st);
coleenp@3656 2964 if (this == SystemDictionary::String_klass()
jrose@665 2965 && java_lang_String::value(obj) != NULL) {
jrose@665 2966 ResourceMark rm;
jrose@665 2967 int len = java_lang_String::length(obj);
jrose@665 2968 int plen = (len < 24 ? len : 12);
jrose@665 2969 char* str = java_lang_String::as_utf8_string(obj, 0, plen);
jrose@665 2970 st->print(" = \"%s\"", str);
jrose@665 2971 if (len > plen)
jrose@665 2972 st->print("...[%d]", len);
coleenp@3656 2973 } else if (this == SystemDictionary::Class_klass()) {
coleenp@3656 2974 Klass* k = java_lang_Class::as_Klass(obj);
jrose@665 2975 st->print(" = ");
jrose@665 2976 if (k != NULL) {
jrose@665 2977 k->print_value_on(st);
jrose@665 2978 } else {
jrose@665 2979 const char* tname = type2name(java_lang_Class::primitive_type(obj));
jrose@665 2980 st->print("%s", tname ? tname : "type?");
jrose@665 2981 }
coleenp@3656 2982 } else if (this == SystemDictionary::MethodType_klass()) {
jrose@1039 2983 st->print(" = ");
jrose@2212 2984 java_lang_invoke_MethodType::print_signature(obj, st);
jrose@665 2985 } else if (java_lang_boxing_object::is_instance(obj)) {
jrose@665 2986 st->print(" = ");
jrose@665 2987 java_lang_boxing_object::print(obj, st);
coleenp@3656 2988 } else if (this == SystemDictionary::LambdaForm_klass()) {
twisti@3582 2989 oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj);
twisti@3582 2990 if (vmentry != NULL) {
twisti@3582 2991 st->print(" => ");
twisti@3582 2992 vmentry->print_value_on(st);
twisti@3582 2993 }
coleenp@3656 2994 } else if (this == SystemDictionary::MemberName_klass()) {
coleenp@3656 2995 Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj);
twisti@3582 2996 if (vmtarget != NULL) {
twisti@3582 2997 st->print(" = ");
twisti@3582 2998 vmtarget->print_value_on(st);
twisti@3582 2999 } else {
twisti@3582 3000 java_lang_invoke_MemberName::clazz(obj)->print_value_on(st);
twisti@3582 3001 st->print(".");
twisti@3582 3002 java_lang_invoke_MemberName::name(obj)->print_value_on(st);
twisti@3582 3003 }
jrose@665 3004 }
duke@0 3005 }
duke@0 3006
coleenp@3656 3007 const char* InstanceKlass::internal_name() const {
duke@0 3008 return external_name();
duke@0 3009 }
duke@0 3010
acorn@4139 3011 #if INCLUDE_SERVICES
acorn@4139 3012 // Size Statistics
acorn@4139 3013 void InstanceKlass::collect_statistics(KlassSizeStats *sz) const {
acorn@4139 3014 Klass::collect_statistics(sz);
acorn@4139 3015
acorn@4139 3016 sz->_inst_size = HeapWordSize * size_helper();
acorn@4139 3017 sz->_vtab_bytes = HeapWordSize * align_object_offset(vtable_length());
acorn@4139 3018 sz->_itab_bytes = HeapWordSize * align_object_offset(itable_length());
acorn@4139 3019 sz->_nonstatic_oopmap_bytes = HeapWordSize *
acorn@4139 3020 ((is_interface() || is_anonymous()) ?
acorn@4139 3021 align_object_offset(nonstatic_oop_map_size()) :
acorn@4139 3022 nonstatic_oop_map_size());
acorn@4139 3023
acorn@4139 3024 int n = 0;
acorn@4139 3025 n += (sz->_methods_array_bytes = sz->count_array(methods()));
acorn@4139 3026 n += (sz->_method_ordering_bytes = sz->count_array(method_ordering()));
acorn@4139 3027 n += (sz->_local_interfaces_bytes = sz->count_array(local_interfaces()));
acorn@4139 3028 n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces()));
acorn@4139 3029 n += (sz->_fields_bytes = sz->count_array(fields()));
acorn@4139 3030 n += (sz->_inner_classes_bytes = sz->count_array(inner_classes()));
acorn@4139 3031 sz->_ro_bytes += n;
acorn@4139 3032
acorn@4139 3033 const ConstantPool* cp = constants();
acorn@4139 3034 if (cp) {
acorn@4139 3035 cp->collect_statistics(sz);
acorn@4139 3036 }
acorn@4139 3037
acorn@4139 3038 const Annotations* anno = annotations();
acorn@4139 3039 if (anno) {
acorn@4139 3040 anno->collect_statistics(sz);
acorn@4139 3041 }
acorn@4139 3042
acorn@4139 3043 const Array<Method*>* methods_array = methods();
acorn@4139 3044 if (methods()) {
acorn@4139 3045 for (int i = 0; i < methods_array->length(); i++) {
acorn@4139 3046 Method* method = methods_array->at(i);
acorn@4139 3047 if (method) {
acorn@4139 3048 sz->_method_count ++;
acorn@4139 3049 method->collect_statistics(sz);
acorn@4139 3050 }
acorn@4139 3051 }
acorn@4139 3052 }
acorn@4139 3053 }
acorn@4139 3054 #endif // INCLUDE_SERVICES
acorn@4139 3055
duke@0 3056 // Verification
duke@0 3057
duke@0 3058 class VerifyFieldClosure: public OopClosure {
coleenp@113 3059 protected:
coleenp@113 3060 template <class T> void do_oop_work(T* p) {
coleenp@113 3061 oop obj = oopDesc::load_decode_heap_oop(p);
coleenp@113 3062 if (!obj->is_oop_or_null()) {
coleenp@113 3063 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p, (address)obj);
duke@0 3064 Universe::print();
duke@0 3065 guarantee(false, "boom");
duke@0 3066 }
duke@0 3067 }
coleenp@113 3068 public:
coleenp@113 3069 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); }
coleenp@113 3070 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); }
duke@0 3071 };
duke@0 3072
coleenp@3656 3073 void InstanceKlass::verify_on(outputStream* st) {
coleenp@3656 3074 Klass::verify_on(st);
coleenp@3656 3075 Thread *thread = Thread::current();
coleenp@3656 3076
coleenp@3656 3077 #ifndef PRODUCT
coleenp@3656 3078 // Avoid redundant verifies
coleenp@3656 3079 if (_verify_count == Universe::verify_count()) return;
coleenp@3656 3080 _verify_count = Universe::verify_count();
coleenp@3656 3081 #endif
coleenp@3656 3082 // Verify that klass is present in SystemDictionary
coleenp@3656 3083 if (is_loaded() && !is_anonymous()) {
coleenp@3656 3084 Symbol* h_name = name();
coleenp@3656 3085 SystemDictionary::verify_obj_klass_present(h_name, class_loader_data());
coleenp@3656 3086 }
coleenp@3656 3087
coleenp@3656 3088 // Verify static fields
coleenp@3656 3089 VerifyFieldClosure blk;
coleenp@3656 3090
coleenp@3656 3091 // Verify vtables
coleenp@3656 3092 if (is_linked()) {
coleenp@3656 3093 ResourceMark rm(thread);
coleenp@3656 3094 // $$$ This used to be done only for m/s collections. Doing it
coleenp@3656 3095 // always seemed a valid generalization. (DLD -- 6/00)
coleenp@3656 3096 vtable()->verify(st);
coleenp@3656 3097 }
coleenp@3656 3098
coleenp@3656 3099 // Verify first subklass
coleenp@3656 3100 if (subklass_oop() != NULL) {
coleenp@3656 3101 guarantee(subklass_oop()->is_metadata(), "should be in metaspace");
coleenp@3656 3102 guarantee(subklass_oop()->is_klass(), "should be klass");
coleenp@3656 3103 }
coleenp@3656 3104
coleenp@3656 3105 // Verify siblings
coleenp@3656 3106 Klass* super = this->super();
coleenp@3656 3107 Klass* sib = next_sibling();
coleenp@3656 3108 if (sib != NULL) {
coleenp@3656 3109 if (sib == this) {
coleenp@3656 3110 fatal(err_msg("subclass points to itself " PTR_FORMAT, sib));
coleenp@3656 3111 }
coleenp@3656 3112
coleenp@3656 3113 guarantee(sib->is_metadata(), "should be in metaspace");
coleenp@3656 3114 guarantee(sib->is_klass(), "should be klass");
coleenp@3656 3115 guarantee(sib->super() == super, "siblings should have same superklass");
coleenp@3656 3116 }
coleenp@3656 3117
coleenp@3656 3118 // Verify implementor fields
coleenp@3656 3119 Klass* im = implementor();
coleenp@3656 3120 if (im != NULL) {
coleenp@3656 3121 guarantee(is_interface(), "only interfaces should have implementor set");
coleenp@3656 3122 guarantee(im->is_klass(), "should be klass");
hseigel@3908 3123 guarantee(!im->is_interface() || im == this,
coleenp@3656 3124 "implementors cannot be interfaces");
coleenp@3656 3125 }
coleenp@3656 3126
coleenp@3656 3127 // Verify local interfaces
coleenp@3656 3128 if (local_interfaces()) {
coleenp@3656 3129 Array<Klass*>* local_interfaces = this->local_interfaces();
coleenp@3656 3130 for (int j = 0; j < local_interfaces->length(); j++) {
coleenp@3656 3131 Klass* e = local_interfaces->at(j);
hseigel@3908 3132 guarantee(e->is_klass() && e->is_interface(), "invalid local interface");
coleenp@3656 3133 }
coleenp@3656 3134 }
coleenp@3656 3135
coleenp@3656 3136 // Verify transitive interfaces
coleenp@3656 3137 if (transitive_interfaces() != NULL) {
coleenp@3656 3138 Array<Klass*>* transitive_interfaces = this->transitive_interfaces();
coleenp@3656 3139 for (int j = 0; j < transitive_interfaces->length(); j++) {
coleenp@3656 3140 Klass* e = transitive_interfaces->at(j);
hseigel@3908 3141 guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface");
coleenp@3656 3142 }
coleenp@3656 3143 }
coleenp@3656 3144
coleenp@3656 3145 // Verify methods
coleenp@3656 3146 if (methods() != NULL) {
coleenp@3656 3147 Array<Method*>* methods = this->methods();
coleenp@3656 3148 for (int j = 0; j < methods->length(); j++) {
coleenp@3656 3149 guarantee(methods->at(j)->is_metadata(), "should be in metaspace");
coleenp@3656 3150 guarantee(methods->at(j)->is_method(), "non-method in methods array");
coleenp@3656 3151 }
coleenp@3656 3152 for (int j = 0; j < methods->length() - 1; j++) {
coleenp@3656 3153 Method* m1 = methods->at(j);
coleenp@3656 3154 Method* m2 = methods->at(j + 1);
coleenp@3656 3155 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
coleenp@3656 3156 }
coleenp@3656 3157 }
coleenp@3656 3158
coleenp@3656 3159 // Verify method ordering
coleenp@3656 3160 if (method_ordering() != NULL) {
coleenp@3656 3161 Array<int>* method_ordering = this->method_ordering();
coleenp@3656 3162 int length = method_ordering->length();
coleenp@3656 3163 if (JvmtiExport::can_maintain_original_method_order() ||
hseigel@4537 3164 ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) {
coleenp@3656 3165 guarantee(length == methods()->length(), "invalid method ordering length");
coleenp@3656 3166 jlong sum = 0;
coleenp@3656 3167 for (int j = 0; j < length; j++) {
coleenp@3656 3168 int original_index = method_ordering->at(j);
coleenp@3656 3169 guarantee(original_index >= 0, "invalid method ordering index");
coleenp@3656 3170 guarantee(original_index < length, "invalid method ordering index");
coleenp@3656 3171 sum += original_index;
coleenp@3656 3172 }
coleenp@3656 3173 // Verify sum of indices 0,1,...,length-1
coleenp@3656 3174 guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum");
coleenp@3656 3175 } else {
coleenp@3656 3176 guarantee(length == 0, "invalid method ordering length");
coleenp@3656 3177 }
coleenp@3656 3178 }
coleenp@3656 3179
coleenp@3656 3180 // Verify JNI static field identifiers
coleenp@3656 3181 if (jni_ids() != NULL) {
coleenp@3656 3182 jni_ids()->verify(this);
coleenp@3656 3183 }
coleenp@3656 3184
coleenp@3656 3185 // Verify other fields
coleenp@3656 3186 if (array_klasses() != NULL) {
coleenp@3656 3187 guarantee(array_klasses()->is_metadata(), "should be in metaspace");
coleenp@3656 3188 guarantee(array_klasses()->is_klass(), "should be klass");
coleenp@3656 3189 }
coleenp@3656 3190 if (constants() != NULL) {
coleenp@3656 3191 guarantee(constants()->is_metadata(), "should be in metaspace");
coleenp@3656 3192 guarantee(constants()->is_constantPool(), "should be constant pool");
coleenp@3656 3193 }
morris@4341 3194 const Klass* host = host_klass();
morris@4341 3195 if (host != NULL) {
morris@4341 3196 guarantee(host->is_metadata(), "should be in metaspace");
morris@4341 3197 guarantee(host->is_klass(), "should be klass");
coleenp@3656 3198 }
coleenp@3656 3199 }
coleenp@3656 3200
coleenp@3656 3201 void InstanceKlass::oop_verify_on(oop obj, outputStream* st) {
duke@0 3202 Klass::oop_verify_on(obj, st);
duke@0 3203 VerifyFieldClosure blk;
coleenp@3656 3204 obj->oop_iterate_no_header(&blk);
duke@0 3205 }
duke@0 3206
coleenp@3656 3207
coleenp@113 3208 // JNIid class for jfieldIDs only
coleenp@113 3209 // Note to reviewers:
coleenp@113 3210 // These JNI functions are just moved over to column 1 and not changed
coleenp@113 3211 // in the compressed oops workspace.
coleenp@3656 3212 JNIid::JNIid(Klass* holder, int offset, JNIid* next) {
coleenp@113 3213 _holder = holder;
coleenp@113 3214 _offset = offset;
coleenp@113 3215 _next = next;
coleenp@113 3216 debug_only(_is_static_field_id = false;)
coleenp@113 3217 }
duke@0 3218
duke@0 3219
coleenp@113 3220 JNIid* JNIid::find(int offset) {
coleenp@113 3221 JNIid* current = this;
coleenp@113 3222 while (current != NULL) {
coleenp@113 3223 if (current->offset() == offset) return current;
coleenp@113 3224 current = current->next();
coleenp@113 3225 }
coleenp@113 3226 return NULL;
coleenp@113 3227 }
duke@0 3228
duke@0 3229 void JNIid::deallocate(JNIid* current) {
coleenp@113 3230 while (current != NULL) {
coleenp@113 3231 JNIid* next = current->next();
coleenp@113 3232 delete current;
coleenp@113 3233 current = next;
coleenp@113 3234 }
coleenp@113 3235 }
duke@0 3236
duke@0 3237
coleenp@3656 3238 void JNIid::verify(Klass* holder) {
coleenp@3666 3239 int first_field_offset = InstanceMirrorKlass::offset_of_static_fields();
coleenp@113 3240 int end_field_offset;
coleenp@3656 3241 end_field_offset = first_field_offset + (InstanceKlass::cast(holder)->static_field_size() * wordSize);
duke@0 3242
coleenp@113 3243 JNIid* current = this;
coleenp@113 3244 while (current != NULL) {
coleenp@113 3245 guarantee(current->holder() == holder, "Invalid klass in JNIid");
coleenp@113 3246 #ifdef ASSERT
coleenp@113 3247 int o = current->offset();
coleenp@113 3248 if (current->is_static_field_id()) {
coleenp@113 3249 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid");
coleenp@113 3250 }
coleenp@113 3251 #endif
coleenp@113 3252 current = current->next();
coleenp@113 3253 }
coleenp@113 3254 }
duke@0 3255
duke@0 3256
duke@0 3257 #ifdef ASSERT
coleenp@3656 3258 void InstanceKlass::set_init_state(ClassState state) {
coleenp@3656 3259 bool good_state = is_shared() ? (_init_state <= state)
coleenp@113 3260 : (_init_state < state);
coleenp@113 3261 assert(good_state || state == allocated, "illegal state transition");
coleenp@2944 3262 _init_state = (u1)state;
coleenp@113 3263 }
duke@0 3264 #endif
duke@0 3265