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