Tue, 09 Oct 2012 10:11:38 +0200
7054512: Compress class pointers after perm gen removal
Summary: support of compress class pointers in the compilers.
Reviewed-by: kvn, twisti
duke@435 | 1 | /* |
brutisso@3711 | 2 | * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "classfile/classLoader.hpp" |
coleenp@4037 | 27 | #include "classfile/classLoaderData.hpp" |
stefank@2314 | 28 | #include "classfile/javaClasses.hpp" |
stefank@2314 | 29 | #include "classfile/symbolTable.hpp" |
stefank@2314 | 30 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 31 | #include "classfile/vmSymbols.hpp" |
stefank@2314 | 32 | #include "code/codeCache.hpp" |
stefank@2314 | 33 | #include "code/dependencies.hpp" |
stefank@2314 | 34 | #include "gc_interface/collectedHeap.inline.hpp" |
stefank@2314 | 35 | #include "interpreter/interpreter.hpp" |
stefank@2314 | 36 | #include "memory/cardTableModRefBS.hpp" |
stefank@2314 | 37 | #include "memory/gcLocker.inline.hpp" |
stefank@2314 | 38 | #include "memory/genCollectedHeap.hpp" |
stefank@2314 | 39 | #include "memory/genRemSet.hpp" |
stefank@2314 | 40 | #include "memory/generation.hpp" |
coleenp@4037 | 41 | #include "memory/metadataFactory.hpp" |
coleenp@4037 | 42 | #include "memory/metaspaceShared.hpp" |
stefank@2314 | 43 | #include "memory/oopFactory.hpp" |
stefank@2314 | 44 | #include "memory/space.hpp" |
stefank@2314 | 45 | #include "memory/universe.hpp" |
stefank@2314 | 46 | #include "memory/universe.inline.hpp" |
coleenp@4037 | 47 | #include "oops/constantPool.hpp" |
coleenp@4037 | 48 | #include "oops/instanceClassLoaderKlass.hpp" |
stefank@2314 | 49 | #include "oops/instanceKlass.hpp" |
never@2658 | 50 | #include "oops/instanceMirrorKlass.hpp" |
stefank@2314 | 51 | #include "oops/instanceRefKlass.hpp" |
stefank@2314 | 52 | #include "oops/oop.inline.hpp" |
stefank@2314 | 53 | #include "oops/typeArrayKlass.hpp" |
stefank@2314 | 54 | #include "prims/jvmtiRedefineClassesTrace.hpp" |
stefank@2314 | 55 | #include "runtime/aprofiler.hpp" |
stefank@2314 | 56 | #include "runtime/arguments.hpp" |
stefank@2314 | 57 | #include "runtime/deoptimization.hpp" |
stefank@2314 | 58 | #include "runtime/fprofiler.hpp" |
stefank@2314 | 59 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 60 | #include "runtime/init.hpp" |
stefank@2314 | 61 | #include "runtime/java.hpp" |
stefank@2314 | 62 | #include "runtime/javaCalls.hpp" |
stefank@2314 | 63 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 64 | #include "runtime/synchronizer.hpp" |
stefank@2314 | 65 | #include "runtime/timer.hpp" |
stefank@2314 | 66 | #include "runtime/vm_operations.hpp" |
stefank@2314 | 67 | #include "services/memoryService.hpp" |
stefank@2314 | 68 | #include "utilities/copy.hpp" |
stefank@2314 | 69 | #include "utilities/events.hpp" |
stefank@2314 | 70 | #include "utilities/hashtable.inline.hpp" |
stefank@2314 | 71 | #include "utilities/preserveException.hpp" |
stefank@2314 | 72 | #ifdef TARGET_OS_FAMILY_linux |
stefank@2314 | 73 | # include "thread_linux.inline.hpp" |
stefank@2314 | 74 | #endif |
stefank@2314 | 75 | #ifdef TARGET_OS_FAMILY_solaris |
stefank@2314 | 76 | # include "thread_solaris.inline.hpp" |
stefank@2314 | 77 | #endif |
stefank@2314 | 78 | #ifdef TARGET_OS_FAMILY_windows |
stefank@2314 | 79 | # include "thread_windows.inline.hpp" |
stefank@2314 | 80 | #endif |
never@3156 | 81 | #ifdef TARGET_OS_FAMILY_bsd |
never@3156 | 82 | # include "thread_bsd.inline.hpp" |
never@3156 | 83 | #endif |
stefank@2314 | 84 | #ifndef SERIALGC |
stefank@2314 | 85 | #include "gc_implementation/concurrentMarkSweep/cmsAdaptiveSizePolicy.hpp" |
stefank@2314 | 86 | #include "gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.hpp" |
stefank@2314 | 87 | #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" |
stefank@2314 | 88 | #include "gc_implementation/g1/g1CollectorPolicy.hpp" |
stefank@2314 | 89 | #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp" |
stefank@2314 | 90 | #endif |
duke@435 | 91 | |
duke@435 | 92 | // Known objects |
coleenp@4037 | 93 | Klass* Universe::_boolArrayKlassObj = NULL; |
coleenp@4037 | 94 | Klass* Universe::_byteArrayKlassObj = NULL; |
coleenp@4037 | 95 | Klass* Universe::_charArrayKlassObj = NULL; |
coleenp@4037 | 96 | Klass* Universe::_intArrayKlassObj = NULL; |
coleenp@4037 | 97 | Klass* Universe::_shortArrayKlassObj = NULL; |
coleenp@4037 | 98 | Klass* Universe::_longArrayKlassObj = NULL; |
coleenp@4037 | 99 | Klass* Universe::_singleArrayKlassObj = NULL; |
coleenp@4037 | 100 | Klass* Universe::_doubleArrayKlassObj = NULL; |
coleenp@4037 | 101 | Klass* Universe::_typeArrayKlassObjs[T_VOID+1] = { NULL /*, NULL...*/ }; |
coleenp@4037 | 102 | Klass* Universe::_objectArrayKlassObj = NULL; |
jcoomes@916 | 103 | oop Universe::_int_mirror = NULL; |
jcoomes@916 | 104 | oop Universe::_float_mirror = NULL; |
jcoomes@916 | 105 | oop Universe::_double_mirror = NULL; |
jcoomes@916 | 106 | oop Universe::_byte_mirror = NULL; |
jcoomes@916 | 107 | oop Universe::_bool_mirror = NULL; |
jcoomes@916 | 108 | oop Universe::_char_mirror = NULL; |
jcoomes@916 | 109 | oop Universe::_long_mirror = NULL; |
jcoomes@916 | 110 | oop Universe::_short_mirror = NULL; |
jcoomes@916 | 111 | oop Universe::_void_mirror = NULL; |
jcoomes@916 | 112 | oop Universe::_mirrors[T_VOID+1] = { NULL /*, NULL...*/ }; |
duke@435 | 113 | oop Universe::_main_thread_group = NULL; |
duke@435 | 114 | oop Universe::_system_thread_group = NULL; |
duke@435 | 115 | objArrayOop Universe::_the_empty_class_klass_array = NULL; |
coleenp@4037 | 116 | Array<Klass*>* Universe::_the_array_interfaces_array = NULL; |
never@1515 | 117 | oop Universe::_the_null_string = NULL; |
never@1515 | 118 | oop Universe::_the_min_jint_string = NULL; |
duke@435 | 119 | LatestMethodOopCache* Universe::_finalizer_register_cache = NULL; |
coleenp@4062 | 120 | LatestMethodOopCache* Universe::_loader_addClass_cache = NULL; |
duke@435 | 121 | ActiveMethodOopsCache* Universe::_reflect_invoke_cache = NULL; |
duke@435 | 122 | oop Universe::_out_of_memory_error_java_heap = NULL; |
duke@435 | 123 | oop Universe::_out_of_memory_error_perm_gen = NULL; |
duke@435 | 124 | oop Universe::_out_of_memory_error_array_size = NULL; |
duke@435 | 125 | oop Universe::_out_of_memory_error_gc_overhead_limit = NULL; |
duke@435 | 126 | objArrayOop Universe::_preallocated_out_of_memory_error_array = NULL; |
duke@435 | 127 | volatile jint Universe::_preallocated_out_of_memory_error_avail_count = 0; |
duke@435 | 128 | bool Universe::_verify_in_progress = false; |
duke@435 | 129 | oop Universe::_null_ptr_exception_instance = NULL; |
duke@435 | 130 | oop Universe::_arithmetic_exception_instance = NULL; |
duke@435 | 131 | oop Universe::_virtual_machine_error_instance = NULL; |
duke@435 | 132 | oop Universe::_vm_exception = NULL; |
coleenp@4037 | 133 | Array<int>* Universe::_the_empty_int_array = NULL; |
coleenp@4037 | 134 | Array<u2>* Universe::_the_empty_short_array = NULL; |
coleenp@4037 | 135 | Array<Klass*>* Universe::_the_empty_klass_array = NULL; |
coleenp@4037 | 136 | Array<Method*>* Universe::_the_empty_method_array = NULL; |
duke@435 | 137 | |
duke@435 | 138 | // These variables are guarded by FullGCALot_lock. |
duke@435 | 139 | debug_only(objArrayOop Universe::_fullgc_alot_dummy_array = NULL;) |
duke@435 | 140 | debug_only(int Universe::_fullgc_alot_dummy_next = 0;) |
duke@435 | 141 | |
duke@435 | 142 | // Heap |
duke@435 | 143 | int Universe::_verify_count = 0; |
duke@435 | 144 | |
duke@435 | 145 | int Universe::_base_vtable_size = 0; |
duke@435 | 146 | bool Universe::_bootstrapping = false; |
duke@435 | 147 | bool Universe::_fully_initialized = false; |
duke@435 | 148 | |
duke@435 | 149 | size_t Universe::_heap_capacity_at_last_gc; |
ysr@888 | 150 | size_t Universe::_heap_used_at_last_gc = 0; |
duke@435 | 151 | |
duke@435 | 152 | CollectedHeap* Universe::_collectedHeap = NULL; |
kvn@1077 | 153 | |
roland@4159 | 154 | NarrowPtrStruct Universe::_narrow_oop = { NULL, 0, true }; |
roland@4159 | 155 | NarrowPtrStruct Universe::_narrow_klass = { NULL, 0, true }; |
roland@4159 | 156 | address Universe::_narrow_ptrs_base; |
duke@435 | 157 | |
duke@435 | 158 | |
coleenp@4037 | 159 | void Universe::basic_type_classes_do(void f(Klass*)) { |
duke@435 | 160 | f(boolArrayKlassObj()); |
duke@435 | 161 | f(byteArrayKlassObj()); |
duke@435 | 162 | f(charArrayKlassObj()); |
duke@435 | 163 | f(intArrayKlassObj()); |
duke@435 | 164 | f(shortArrayKlassObj()); |
duke@435 | 165 | f(longArrayKlassObj()); |
duke@435 | 166 | f(singleArrayKlassObj()); |
duke@435 | 167 | f(doubleArrayKlassObj()); |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | void Universe::oops_do(OopClosure* f, bool do_all) { |
duke@435 | 171 | |
duke@435 | 172 | f->do_oop((oop*) &_int_mirror); |
duke@435 | 173 | f->do_oop((oop*) &_float_mirror); |
duke@435 | 174 | f->do_oop((oop*) &_double_mirror); |
duke@435 | 175 | f->do_oop((oop*) &_byte_mirror); |
duke@435 | 176 | f->do_oop((oop*) &_bool_mirror); |
duke@435 | 177 | f->do_oop((oop*) &_char_mirror); |
duke@435 | 178 | f->do_oop((oop*) &_long_mirror); |
duke@435 | 179 | f->do_oop((oop*) &_short_mirror); |
duke@435 | 180 | f->do_oop((oop*) &_void_mirror); |
duke@435 | 181 | |
duke@435 | 182 | for (int i = T_BOOLEAN; i < T_VOID+1; i++) { |
duke@435 | 183 | f->do_oop((oop*) &_mirrors[i]); |
duke@435 | 184 | } |
duke@435 | 185 | assert(_mirrors[0] == NULL && _mirrors[T_BOOLEAN - 1] == NULL, "checking"); |
duke@435 | 186 | |
duke@435 | 187 | f->do_oop((oop*)&_the_empty_class_klass_array); |
never@1515 | 188 | f->do_oop((oop*)&_the_null_string); |
never@1515 | 189 | f->do_oop((oop*)&_the_min_jint_string); |
duke@435 | 190 | f->do_oop((oop*)&_out_of_memory_error_java_heap); |
duke@435 | 191 | f->do_oop((oop*)&_out_of_memory_error_perm_gen); |
duke@435 | 192 | f->do_oop((oop*)&_out_of_memory_error_array_size); |
duke@435 | 193 | f->do_oop((oop*)&_out_of_memory_error_gc_overhead_limit); |
duke@435 | 194 | f->do_oop((oop*)&_preallocated_out_of_memory_error_array); |
duke@435 | 195 | f->do_oop((oop*)&_null_ptr_exception_instance); |
duke@435 | 196 | f->do_oop((oop*)&_arithmetic_exception_instance); |
duke@435 | 197 | f->do_oop((oop*)&_virtual_machine_error_instance); |
duke@435 | 198 | f->do_oop((oop*)&_main_thread_group); |
duke@435 | 199 | f->do_oop((oop*)&_system_thread_group); |
duke@435 | 200 | f->do_oop((oop*)&_vm_exception); |
duke@435 | 201 | debug_only(f->do_oop((oop*)&_fullgc_alot_dummy_array);) |
duke@435 | 202 | } |
duke@435 | 203 | |
coleenp@4037 | 204 | // Serialize metadata in and out of CDS archive, not oops. |
coleenp@4037 | 205 | void Universe::serialize(SerializeClosure* f, bool do_all) { |
coleenp@4037 | 206 | |
coleenp@4037 | 207 | f->do_ptr((void**)&_boolArrayKlassObj); |
coleenp@4037 | 208 | f->do_ptr((void**)&_byteArrayKlassObj); |
coleenp@4037 | 209 | f->do_ptr((void**)&_charArrayKlassObj); |
coleenp@4037 | 210 | f->do_ptr((void**)&_intArrayKlassObj); |
coleenp@4037 | 211 | f->do_ptr((void**)&_shortArrayKlassObj); |
coleenp@4037 | 212 | f->do_ptr((void**)&_longArrayKlassObj); |
coleenp@4037 | 213 | f->do_ptr((void**)&_singleArrayKlassObj); |
coleenp@4037 | 214 | f->do_ptr((void**)&_doubleArrayKlassObj); |
coleenp@4037 | 215 | f->do_ptr((void**)&_objectArrayKlassObj); |
coleenp@4037 | 216 | |
coleenp@4037 | 217 | { |
coleenp@4037 | 218 | for (int i = 0; i < T_VOID+1; i++) { |
coleenp@4037 | 219 | if (_typeArrayKlassObjs[i] != NULL) { |
coleenp@4037 | 220 | assert(i >= T_BOOLEAN, "checking"); |
coleenp@4037 | 221 | f->do_ptr((void**)&_typeArrayKlassObjs[i]); |
coleenp@4037 | 222 | } else if (do_all) { |
coleenp@4037 | 223 | f->do_ptr((void**)&_typeArrayKlassObjs[i]); |
coleenp@4037 | 224 | } |
coleenp@4037 | 225 | } |
coleenp@4037 | 226 | } |
coleenp@4037 | 227 | |
coleenp@4037 | 228 | f->do_ptr((void**)&_the_array_interfaces_array); |
coleenp@4037 | 229 | f->do_ptr((void**)&_the_empty_int_array); |
coleenp@4037 | 230 | f->do_ptr((void**)&_the_empty_short_array); |
coleenp@4037 | 231 | f->do_ptr((void**)&_the_empty_method_array); |
coleenp@4037 | 232 | f->do_ptr((void**)&_the_empty_klass_array); |
coleenp@4037 | 233 | _finalizer_register_cache->serialize(f); |
coleenp@4062 | 234 | _loader_addClass_cache->serialize(f); |
coleenp@4037 | 235 | _reflect_invoke_cache->serialize(f); |
coleenp@4037 | 236 | } |
duke@435 | 237 | |
duke@435 | 238 | void Universe::check_alignment(uintx size, uintx alignment, const char* name) { |
duke@435 | 239 | if (size < alignment || size % alignment != 0) { |
duke@435 | 240 | ResourceMark rm; |
duke@435 | 241 | stringStream st; |
duke@435 | 242 | st.print("Size of %s (%ld bytes) must be aligned to %ld bytes", name, size, alignment); |
duke@435 | 243 | char* error = st.as_string(); |
duke@435 | 244 | vm_exit_during_initialization(error); |
duke@435 | 245 | } |
duke@435 | 246 | } |
duke@435 | 247 | |
coleenp@4037 | 248 | void initialize_basic_type_klass(Klass* k, TRAPS) { |
coleenp@4037 | 249 | Klass* ok = SystemDictionary::Object_klass(); |
coleenp@4037 | 250 | if (UseSharedSpaces) { |
coleenp@4037 | 251 | assert(k->super() == ok, "u3"); |
coleenp@4037 | 252 | k->restore_unshareable_info(CHECK); |
coleenp@4037 | 253 | } else { |
coleenp@4037 | 254 | k->initialize_supers(ok, CHECK); |
coleenp@4037 | 255 | } |
coleenp@4037 | 256 | k->append_to_sibling_list(); |
coleenp@4037 | 257 | } |
duke@435 | 258 | |
duke@435 | 259 | void Universe::genesis(TRAPS) { |
duke@435 | 260 | ResourceMark rm; |
coleenp@4037 | 261 | |
duke@435 | 262 | { FlagSetting fs(_bootstrapping, true); |
duke@435 | 263 | |
duke@435 | 264 | { MutexLocker mc(Compile_lock); |
duke@435 | 265 | |
duke@435 | 266 | // determine base vtable size; without that we cannot create the array klasses |
duke@435 | 267 | compute_base_vtable_size(); |
duke@435 | 268 | |
duke@435 | 269 | if (!UseSharedSpaces) { |
duke@435 | 270 | _boolArrayKlassObj = typeArrayKlass::create_klass(T_BOOLEAN, sizeof(jboolean), CHECK); |
duke@435 | 271 | _charArrayKlassObj = typeArrayKlass::create_klass(T_CHAR, sizeof(jchar), CHECK); |
duke@435 | 272 | _singleArrayKlassObj = typeArrayKlass::create_klass(T_FLOAT, sizeof(jfloat), CHECK); |
duke@435 | 273 | _doubleArrayKlassObj = typeArrayKlass::create_klass(T_DOUBLE, sizeof(jdouble), CHECK); |
duke@435 | 274 | _byteArrayKlassObj = typeArrayKlass::create_klass(T_BYTE, sizeof(jbyte), CHECK); |
duke@435 | 275 | _shortArrayKlassObj = typeArrayKlass::create_klass(T_SHORT, sizeof(jshort), CHECK); |
duke@435 | 276 | _intArrayKlassObj = typeArrayKlass::create_klass(T_INT, sizeof(jint), CHECK); |
duke@435 | 277 | _longArrayKlassObj = typeArrayKlass::create_klass(T_LONG, sizeof(jlong), CHECK); |
duke@435 | 278 | |
duke@435 | 279 | _typeArrayKlassObjs[T_BOOLEAN] = _boolArrayKlassObj; |
duke@435 | 280 | _typeArrayKlassObjs[T_CHAR] = _charArrayKlassObj; |
duke@435 | 281 | _typeArrayKlassObjs[T_FLOAT] = _singleArrayKlassObj; |
duke@435 | 282 | _typeArrayKlassObjs[T_DOUBLE] = _doubleArrayKlassObj; |
duke@435 | 283 | _typeArrayKlassObjs[T_BYTE] = _byteArrayKlassObj; |
duke@435 | 284 | _typeArrayKlassObjs[T_SHORT] = _shortArrayKlassObj; |
duke@435 | 285 | _typeArrayKlassObjs[T_INT] = _intArrayKlassObj; |
duke@435 | 286 | _typeArrayKlassObjs[T_LONG] = _longArrayKlassObj; |
duke@435 | 287 | |
coleenp@4037 | 288 | ClassLoaderData* null_cld = ClassLoaderData::the_null_class_loader_data(); |
duke@435 | 289 | |
coleenp@4037 | 290 | _the_array_interfaces_array = MetadataFactory::new_array<Klass*>(null_cld, 2, NULL, CHECK); |
coleenp@4037 | 291 | _the_empty_int_array = MetadataFactory::new_array<int>(null_cld, 0, CHECK); |
coleenp@4037 | 292 | _the_empty_short_array = MetadataFactory::new_array<u2>(null_cld, 0, CHECK); |
coleenp@4037 | 293 | _the_empty_method_array = MetadataFactory::new_array<Method*>(null_cld, 0, CHECK); |
coleenp@4037 | 294 | _the_empty_klass_array = MetadataFactory::new_array<Klass*>(null_cld, 0, CHECK); |
duke@435 | 295 | } |
duke@435 | 296 | } |
duke@435 | 297 | |
duke@435 | 298 | vmSymbols::initialize(CHECK); |
duke@435 | 299 | |
duke@435 | 300 | SystemDictionary::initialize(CHECK); |
duke@435 | 301 | |
coleenp@4037 | 302 | Klass* ok = SystemDictionary::Object_klass(); |
duke@435 | 303 | |
never@1515 | 304 | _the_null_string = StringTable::intern("null", CHECK); |
never@1515 | 305 | _the_min_jint_string = StringTable::intern("-2147483648", CHECK); |
never@1515 | 306 | |
duke@435 | 307 | if (UseSharedSpaces) { |
duke@435 | 308 | // Verify shared interfaces array. |
coleenp@4037 | 309 | assert(_the_array_interfaces_array->at(0) == |
never@1577 | 310 | SystemDictionary::Cloneable_klass(), "u3"); |
coleenp@4037 | 311 | assert(_the_array_interfaces_array->at(1) == |
never@1577 | 312 | SystemDictionary::Serializable_klass(), "u3"); |
duke@435 | 313 | } else { |
duke@435 | 314 | // Set up shared interfaces array. (Do this before supers are set up.) |
coleenp@4037 | 315 | _the_array_interfaces_array->at_put(0, SystemDictionary::Cloneable_klass()); |
coleenp@4037 | 316 | _the_array_interfaces_array->at_put(1, SystemDictionary::Serializable_klass()); |
duke@435 | 317 | } |
duke@435 | 318 | |
coleenp@4037 | 319 | initialize_basic_type_klass(boolArrayKlassObj(), CHECK); |
coleenp@4037 | 320 | initialize_basic_type_klass(charArrayKlassObj(), CHECK); |
coleenp@4037 | 321 | initialize_basic_type_klass(singleArrayKlassObj(), CHECK); |
coleenp@4037 | 322 | initialize_basic_type_klass(doubleArrayKlassObj(), CHECK); |
coleenp@4037 | 323 | initialize_basic_type_klass(byteArrayKlassObj(), CHECK); |
coleenp@4037 | 324 | initialize_basic_type_klass(shortArrayKlassObj(), CHECK); |
coleenp@4037 | 325 | initialize_basic_type_klass(intArrayKlassObj(), CHECK); |
coleenp@4037 | 326 | initialize_basic_type_klass(longArrayKlassObj(), CHECK); |
duke@435 | 327 | } // end of core bootstrapping |
duke@435 | 328 | |
coleenp@4037 | 329 | // Maybe this could be lifted up now that object array can be initialized |
coleenp@4037 | 330 | // during the bootstrapping. |
coleenp@4037 | 331 | |
coleenp@4037 | 332 | // OLD |
duke@435 | 333 | // Initialize _objectArrayKlass after core bootstraping to make |
duke@435 | 334 | // sure the super class is set up properly for _objectArrayKlass. |
coleenp@4037 | 335 | // --- |
coleenp@4037 | 336 | // NEW |
coleenp@4037 | 337 | // Since some of the old system object arrays have been converted to |
coleenp@4037 | 338 | // ordinary object arrays, _objectArrayKlass will be loaded when |
coleenp@4037 | 339 | // SystemDictionary::initialize(CHECK); is run. See the extra check |
coleenp@4037 | 340 | // for Object_klass_loaded in objArrayKlassKlass::allocate_objArray_klass_impl. |
coleenp@4037 | 341 | _objectArrayKlassObj = InstanceKlass:: |
never@1577 | 342 | cast(SystemDictionary::Object_klass())->array_klass(1, CHECK); |
coleenp@4037 | 343 | // OLD |
duke@435 | 344 | // Add the class to the class hierarchy manually to make sure that |
duke@435 | 345 | // its vtable is initialized after core bootstrapping is completed. |
coleenp@4037 | 346 | // --- |
coleenp@4037 | 347 | // New |
coleenp@4037 | 348 | // Have already been initialized. |
duke@435 | 349 | Klass::cast(_objectArrayKlassObj)->append_to_sibling_list(); |
duke@435 | 350 | |
duke@435 | 351 | // Compute is_jdk version flags. |
duke@435 | 352 | // Only 1.3 or later has the java.lang.Shutdown class. |
duke@435 | 353 | // Only 1.4 or later has the java.lang.CharSequence interface. |
duke@435 | 354 | // Only 1.5 or later has the java.lang.management.MemoryUsage class. |
kamg@677 | 355 | if (JDK_Version::is_partially_initialized()) { |
kamg@677 | 356 | uint8_t jdk_version; |
coleenp@4037 | 357 | Klass* k = SystemDictionary::resolve_or_null( |
coleenp@2497 | 358 | vmSymbols::java_lang_management_MemoryUsage(), THREAD); |
duke@435 | 359 | CLEAR_PENDING_EXCEPTION; // ignore exceptions |
duke@435 | 360 | if (k == NULL) { |
kamg@677 | 361 | k = SystemDictionary::resolve_or_null( |
coleenp@2497 | 362 | vmSymbols::java_lang_CharSequence(), THREAD); |
duke@435 | 363 | CLEAR_PENDING_EXCEPTION; // ignore exceptions |
duke@435 | 364 | if (k == NULL) { |
kamg@677 | 365 | k = SystemDictionary::resolve_or_null( |
coleenp@2497 | 366 | vmSymbols::java_lang_Shutdown(), THREAD); |
duke@435 | 367 | CLEAR_PENDING_EXCEPTION; // ignore exceptions |
duke@435 | 368 | if (k == NULL) { |
kamg@677 | 369 | jdk_version = 2; |
duke@435 | 370 | } else { |
kamg@677 | 371 | jdk_version = 3; |
duke@435 | 372 | } |
duke@435 | 373 | } else { |
kamg@677 | 374 | jdk_version = 4; |
duke@435 | 375 | } |
duke@435 | 376 | } else { |
kamg@677 | 377 | jdk_version = 5; |
duke@435 | 378 | } |
kamg@677 | 379 | JDK_Version::fully_initialize(jdk_version); |
duke@435 | 380 | } |
duke@435 | 381 | |
duke@435 | 382 | #ifdef ASSERT |
duke@435 | 383 | if (FullGCALot) { |
duke@435 | 384 | // Allocate an array of dummy objects. |
duke@435 | 385 | // We'd like these to be at the bottom of the old generation, |
duke@435 | 386 | // so that when we free one and then collect, |
duke@435 | 387 | // (almost) the whole heap moves |
duke@435 | 388 | // and we find out if we actually update all the oops correctly. |
duke@435 | 389 | // But we can't allocate directly in the old generation, |
duke@435 | 390 | // so we allocate wherever, and hope that the first collection |
duke@435 | 391 | // moves these objects to the bottom of the old generation. |
duke@435 | 392 | // We can allocate directly in the permanent generation, so we do. |
duke@435 | 393 | int size; |
duke@435 | 394 | if (UseConcMarkSweepGC) { |
duke@435 | 395 | warning("Using +FullGCALot with concurrent mark sweep gc " |
duke@435 | 396 | "will not force all objects to relocate"); |
duke@435 | 397 | size = FullGCALotDummies; |
duke@435 | 398 | } else { |
duke@435 | 399 | size = FullGCALotDummies * 2; |
duke@435 | 400 | } |
coleenp@4037 | 401 | objArrayOop naked_array = oopFactory::new_objArray(SystemDictionary::Object_klass(), size, CHECK); |
duke@435 | 402 | objArrayHandle dummy_array(THREAD, naked_array); |
duke@435 | 403 | int i = 0; |
duke@435 | 404 | while (i < size) { |
duke@435 | 405 | // Allocate dummy in old generation |
coleenp@4037 | 406 | oop dummy = InstanceKlass::cast(SystemDictionary::Object_klass())->allocate_instance(CHECK); |
duke@435 | 407 | dummy_array->obj_at_put(i++, dummy); |
duke@435 | 408 | } |
duke@435 | 409 | { |
duke@435 | 410 | // Only modify the global variable inside the mutex. |
duke@435 | 411 | // If we had a race to here, the other dummy_array instances |
duke@435 | 412 | // and their elements just get dropped on the floor, which is fine. |
duke@435 | 413 | MutexLocker ml(FullGCALot_lock); |
duke@435 | 414 | if (_fullgc_alot_dummy_array == NULL) { |
duke@435 | 415 | _fullgc_alot_dummy_array = dummy_array(); |
duke@435 | 416 | } |
duke@435 | 417 | } |
duke@435 | 418 | assert(i == _fullgc_alot_dummy_array->length(), "just checking"); |
duke@435 | 419 | } |
duke@435 | 420 | #endif |
duke@435 | 421 | } |
duke@435 | 422 | |
coleenp@4037 | 423 | // CDS support for patching vtables in metadata in the shared archive. |
coleenp@4037 | 424 | // All types inherited from Metadata have vtables, but not types inherited |
coleenp@4037 | 425 | // from MetaspaceObj, because the latter does not have virtual functions. |
coleenp@4037 | 426 | // If the metadata type has a vtable, it cannot be shared in the read-only |
coleenp@4037 | 427 | // section of the CDS archive, because the vtable pointer is patched. |
coleenp@2497 | 428 | static inline void* dereference(void* addr) { |
coleenp@2497 | 429 | return *(void**)addr; |
duke@435 | 430 | } |
duke@435 | 431 | |
coleenp@2497 | 432 | static inline void add_vtable(void** list, int* n, void* o, int count) { |
coleenp@2497 | 433 | guarantee((*n) < count, "vtable list too small"); |
coleenp@2497 | 434 | void* vtable = dereference(o); |
coleenp@2497 | 435 | assert(dereference(vtable) != NULL, "invalid vtable"); |
coleenp@2497 | 436 | list[(*n)++] = vtable; |
coleenp@2497 | 437 | } |
duke@435 | 438 | |
duke@435 | 439 | void Universe::init_self_patching_vtbl_list(void** list, int count) { |
duke@435 | 440 | int n = 0; |
coleenp@4037 | 441 | { InstanceKlass o; add_vtable(list, &n, &o, count); } |
coleenp@4047 | 442 | { InstanceClassLoaderKlass o; add_vtable(list, &n, &o, count); } |
coleenp@4047 | 443 | { InstanceMirrorKlass o; add_vtable(list, &n, &o, count); } |
coleenp@4047 | 444 | { InstanceRefKlass o; add_vtable(list, &n, &o, count); } |
duke@435 | 445 | { typeArrayKlass o; add_vtable(list, &n, &o, count); } |
duke@435 | 446 | { objArrayKlass o; add_vtable(list, &n, &o, count); } |
coleenp@4037 | 447 | { Method o; add_vtable(list, &n, &o, count); } |
coleenp@4037 | 448 | { ConstantPool o; add_vtable(list, &n, &o, count); } |
duke@435 | 449 | } |
duke@435 | 450 | |
duke@435 | 451 | void Universe::initialize_basic_type_mirrors(TRAPS) { |
duke@435 | 452 | assert(_int_mirror==NULL, "basic type mirrors already initialized"); |
duke@435 | 453 | _int_mirror = |
duke@435 | 454 | java_lang_Class::create_basic_type_mirror("int", T_INT, CHECK); |
duke@435 | 455 | _float_mirror = |
duke@435 | 456 | java_lang_Class::create_basic_type_mirror("float", T_FLOAT, CHECK); |
duke@435 | 457 | _double_mirror = |
duke@435 | 458 | java_lang_Class::create_basic_type_mirror("double", T_DOUBLE, CHECK); |
duke@435 | 459 | _byte_mirror = |
duke@435 | 460 | java_lang_Class::create_basic_type_mirror("byte", T_BYTE, CHECK); |
duke@435 | 461 | _bool_mirror = |
duke@435 | 462 | java_lang_Class::create_basic_type_mirror("boolean",T_BOOLEAN, CHECK); |
duke@435 | 463 | _char_mirror = |
duke@435 | 464 | java_lang_Class::create_basic_type_mirror("char", T_CHAR, CHECK); |
duke@435 | 465 | _long_mirror = |
duke@435 | 466 | java_lang_Class::create_basic_type_mirror("long", T_LONG, CHECK); |
duke@435 | 467 | _short_mirror = |
duke@435 | 468 | java_lang_Class::create_basic_type_mirror("short", T_SHORT, CHECK); |
duke@435 | 469 | _void_mirror = |
duke@435 | 470 | java_lang_Class::create_basic_type_mirror("void", T_VOID, CHECK); |
duke@435 | 471 | |
duke@435 | 472 | _mirrors[T_INT] = _int_mirror; |
duke@435 | 473 | _mirrors[T_FLOAT] = _float_mirror; |
duke@435 | 474 | _mirrors[T_DOUBLE] = _double_mirror; |
duke@435 | 475 | _mirrors[T_BYTE] = _byte_mirror; |
duke@435 | 476 | _mirrors[T_BOOLEAN] = _bool_mirror; |
duke@435 | 477 | _mirrors[T_CHAR] = _char_mirror; |
duke@435 | 478 | _mirrors[T_LONG] = _long_mirror; |
duke@435 | 479 | _mirrors[T_SHORT] = _short_mirror; |
duke@435 | 480 | _mirrors[T_VOID] = _void_mirror; |
coleenp@4037 | 481 | //_mirrors[T_OBJECT] = InstanceKlass::cast(_object_klass)->java_mirror(); |
coleenp@4037 | 482 | //_mirrors[T_ARRAY] = InstanceKlass::cast(_object_klass)->java_mirror(); |
duke@435 | 483 | } |
duke@435 | 484 | |
duke@435 | 485 | void Universe::fixup_mirrors(TRAPS) { |
duke@435 | 486 | // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly, |
duke@435 | 487 | // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply |
duke@435 | 488 | // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note |
duke@435 | 489 | // that the number of objects allocated at this point is very small. |
never@1577 | 490 | assert(SystemDictionary::Class_klass_loaded(), "java.lang.Class should be loaded"); |
coleenp@4037 | 491 | HandleMark hm(THREAD); |
never@2658 | 492 | // Cache the start of the static fields |
coleenp@4047 | 493 | InstanceMirrorKlass::init_offset_of_static_fields(); |
never@2658 | 494 | |
coleenp@4037 | 495 | GrowableArray <Klass*>* list = java_lang_Class::fixup_mirror_list(); |
coleenp@4037 | 496 | int list_length = list->length(); |
coleenp@4037 | 497 | for (int i = 0; i < list_length; i++) { |
coleenp@4037 | 498 | Klass* k = list->at(i); |
coleenp@4037 | 499 | assert(k->is_klass(), "List should only hold classes"); |
coleenp@4037 | 500 | EXCEPTION_MARK; |
coleenp@4037 | 501 | KlassHandle kh(THREAD, k); |
coleenp@4037 | 502 | java_lang_Class::fixup_mirror(kh, CATCH); |
duke@435 | 503 | } |
coleenp@4037 | 504 | delete java_lang_Class::fixup_mirror_list(); |
coleenp@4037 | 505 | java_lang_Class::set_fixup_mirror_list(NULL); |
coleenp@4037 | 506 | } |
duke@435 | 507 | |
duke@435 | 508 | static bool has_run_finalizers_on_exit = false; |
duke@435 | 509 | |
duke@435 | 510 | void Universe::run_finalizers_on_exit() { |
duke@435 | 511 | if (has_run_finalizers_on_exit) return; |
duke@435 | 512 | has_run_finalizers_on_exit = true; |
duke@435 | 513 | |
duke@435 | 514 | // Called on VM exit. This ought to be run in a separate thread. |
duke@435 | 515 | if (TraceReferenceGC) tty->print_cr("Callback to run finalizers on exit"); |
duke@435 | 516 | { |
duke@435 | 517 | PRESERVE_EXCEPTION_MARK; |
never@1577 | 518 | KlassHandle finalizer_klass(THREAD, SystemDictionary::Finalizer_klass()); |
duke@435 | 519 | JavaValue result(T_VOID); |
duke@435 | 520 | JavaCalls::call_static( |
duke@435 | 521 | &result, |
duke@435 | 522 | finalizer_klass, |
coleenp@2497 | 523 | vmSymbols::run_finalizers_on_exit_name(), |
coleenp@2497 | 524 | vmSymbols::void_method_signature(), |
duke@435 | 525 | THREAD |
duke@435 | 526 | ); |
duke@435 | 527 | // Ignore any pending exceptions |
duke@435 | 528 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 529 | } |
duke@435 | 530 | } |
duke@435 | 531 | |
duke@435 | 532 | |
duke@435 | 533 | // initialize_vtable could cause gc if |
duke@435 | 534 | // 1) we specified true to initialize_vtable and |
duke@435 | 535 | // 2) this ran after gc was enabled |
duke@435 | 536 | // In case those ever change we use handles for oops |
duke@435 | 537 | void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) { |
duke@435 | 538 | // init vtable of k and all subclasses |
coleenp@4037 | 539 | Klass* ko = k_h(); |
duke@435 | 540 | klassVtable* vt = ko->vtable(); |
duke@435 | 541 | if (vt) vt->initialize_vtable(false, CHECK); |
duke@435 | 542 | if (ko->oop_is_instance()) { |
coleenp@4037 | 543 | InstanceKlass* ik = (InstanceKlass*)ko; |
coleenp@4037 | 544 | for (KlassHandle s_h(THREAD, ik->subklass()); s_h() != NULL; s_h = (THREAD, s_h()->next_sibling())) { |
duke@435 | 545 | reinitialize_vtable_of(s_h, CHECK); |
duke@435 | 546 | } |
duke@435 | 547 | } |
duke@435 | 548 | } |
duke@435 | 549 | |
duke@435 | 550 | |
coleenp@4037 | 551 | void initialize_itable_for_klass(Klass* k, TRAPS) { |
coleenp@4037 | 552 | InstanceKlass::cast(k)->itable()->initialize_itable(false, CHECK); |
duke@435 | 553 | } |
duke@435 | 554 | |
duke@435 | 555 | |
duke@435 | 556 | void Universe::reinitialize_itables(TRAPS) { |
duke@435 | 557 | SystemDictionary::classes_do(initialize_itable_for_klass, CHECK); |
duke@435 | 558 | |
duke@435 | 559 | } |
duke@435 | 560 | |
duke@435 | 561 | |
duke@435 | 562 | bool Universe::on_page_boundary(void* addr) { |
duke@435 | 563 | return ((uintptr_t) addr) % os::vm_page_size() == 0; |
duke@435 | 564 | } |
duke@435 | 565 | |
duke@435 | 566 | |
duke@435 | 567 | bool Universe::should_fill_in_stack_trace(Handle throwable) { |
duke@435 | 568 | // never attempt to fill in the stack trace of preallocated errors that do not have |
duke@435 | 569 | // backtrace. These errors are kept alive forever and may be "re-used" when all |
duke@435 | 570 | // preallocated errors with backtrace have been consumed. Also need to avoid |
duke@435 | 571 | // a potential loop which could happen if an out of memory occurs when attempting |
duke@435 | 572 | // to allocate the backtrace. |
duke@435 | 573 | return ((throwable() != Universe::_out_of_memory_error_java_heap) && |
duke@435 | 574 | (throwable() != Universe::_out_of_memory_error_perm_gen) && |
duke@435 | 575 | (throwable() != Universe::_out_of_memory_error_array_size) && |
duke@435 | 576 | (throwable() != Universe::_out_of_memory_error_gc_overhead_limit)); |
duke@435 | 577 | } |
duke@435 | 578 | |
duke@435 | 579 | |
duke@435 | 580 | oop Universe::gen_out_of_memory_error(oop default_err) { |
duke@435 | 581 | // generate an out of memory error: |
duke@435 | 582 | // - if there is a preallocated error with backtrace available then return it wth |
duke@435 | 583 | // a filled in stack trace. |
duke@435 | 584 | // - if there are no preallocated errors with backtrace available then return |
duke@435 | 585 | // an error without backtrace. |
duke@435 | 586 | int next; |
duke@435 | 587 | if (_preallocated_out_of_memory_error_avail_count > 0) { |
duke@435 | 588 | next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count); |
duke@435 | 589 | assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt"); |
duke@435 | 590 | } else { |
duke@435 | 591 | next = -1; |
duke@435 | 592 | } |
duke@435 | 593 | if (next < 0) { |
duke@435 | 594 | // all preallocated errors have been used. |
duke@435 | 595 | // return default |
duke@435 | 596 | return default_err; |
duke@435 | 597 | } else { |
duke@435 | 598 | // get the error object at the slot and set set it to NULL so that the |
duke@435 | 599 | // array isn't keeping it alive anymore. |
duke@435 | 600 | oop exc = preallocated_out_of_memory_errors()->obj_at(next); |
duke@435 | 601 | assert(exc != NULL, "slot has been used already"); |
duke@435 | 602 | preallocated_out_of_memory_errors()->obj_at_put(next, NULL); |
duke@435 | 603 | |
duke@435 | 604 | // use the message from the default error |
duke@435 | 605 | oop msg = java_lang_Throwable::message(default_err); |
duke@435 | 606 | assert(msg != NULL, "no message"); |
duke@435 | 607 | java_lang_Throwable::set_message(exc, msg); |
duke@435 | 608 | |
duke@435 | 609 | // populate the stack trace and return it. |
duke@435 | 610 | java_lang_Throwable::fill_in_stack_trace_of_preallocated_backtrace(exc); |
duke@435 | 611 | return exc; |
duke@435 | 612 | } |
duke@435 | 613 | } |
duke@435 | 614 | |
duke@435 | 615 | static intptr_t non_oop_bits = 0; |
duke@435 | 616 | |
duke@435 | 617 | void* Universe::non_oop_word() { |
duke@435 | 618 | // Neither the high bits nor the low bits of this value is allowed |
duke@435 | 619 | // to look like (respectively) the high or low bits of a real oop. |
duke@435 | 620 | // |
duke@435 | 621 | // High and low are CPU-specific notions, but low always includes |
duke@435 | 622 | // the low-order bit. Since oops are always aligned at least mod 4, |
duke@435 | 623 | // setting the low-order bit will ensure that the low half of the |
duke@435 | 624 | // word will never look like that of a real oop. |
duke@435 | 625 | // |
duke@435 | 626 | // Using the OS-supplied non-memory-address word (usually 0 or -1) |
duke@435 | 627 | // will take care of the high bits, however many there are. |
duke@435 | 628 | |
duke@435 | 629 | if (non_oop_bits == 0) { |
duke@435 | 630 | non_oop_bits = (intptr_t)os::non_memory_address_word() | 1; |
duke@435 | 631 | } |
duke@435 | 632 | |
duke@435 | 633 | return (void*)non_oop_bits; |
duke@435 | 634 | } |
duke@435 | 635 | |
duke@435 | 636 | jint universe_init() { |
duke@435 | 637 | assert(!Universe::_fully_initialized, "called after initialize_vtables"); |
duke@435 | 638 | guarantee(1 << LogHeapWordSize == sizeof(HeapWord), |
duke@435 | 639 | "LogHeapWordSize is incorrect."); |
duke@435 | 640 | guarantee(sizeof(oop) >= sizeof(HeapWord), "HeapWord larger than oop?"); |
duke@435 | 641 | guarantee(sizeof(oop) % sizeof(HeapWord) == 0, |
coleenp@548 | 642 | "oop size is not not a multiple of HeapWord size"); |
duke@435 | 643 | TraceTime timer("Genesis", TraceStartupTime); |
duke@435 | 644 | GC_locker::lock(); // do not allow gc during bootstrapping |
duke@435 | 645 | JavaClasses::compute_hard_coded_offsets(); |
duke@435 | 646 | |
duke@435 | 647 | jint status = Universe::initialize_heap(); |
duke@435 | 648 | if (status != JNI_OK) { |
duke@435 | 649 | return status; |
duke@435 | 650 | } |
duke@435 | 651 | |
coleenp@4037 | 652 | // Create memory for metadata. Must be after initializing heap for |
coleenp@4037 | 653 | // DumpSharedSpaces. |
coleenp@4037 | 654 | ClassLoaderData::init_null_class_loader_data(); |
coleenp@4037 | 655 | |
coleenp@4037 | 656 | // We have a heap so create the Method* caches before |
coleenp@4037 | 657 | // Metaspace::initialize_shared_spaces() tries to populate them. |
duke@435 | 658 | Universe::_finalizer_register_cache = new LatestMethodOopCache(); |
coleenp@4062 | 659 | Universe::_loader_addClass_cache = new LatestMethodOopCache(); |
duke@435 | 660 | Universe::_reflect_invoke_cache = new ActiveMethodOopsCache(); |
duke@435 | 661 | |
duke@435 | 662 | if (UseSharedSpaces) { |
duke@435 | 663 | // Read the data structures supporting the shared spaces (shared |
duke@435 | 664 | // system dictionary, symbol table, etc.). After that, access to |
duke@435 | 665 | // the file (other than the mapped regions) is no longer needed, and |
duke@435 | 666 | // the file is closed. Closing the file does not affect the |
duke@435 | 667 | // currently mapped regions. |
coleenp@4037 | 668 | MetaspaceShared::initialize_shared_spaces(); |
coleenp@4037 | 669 | StringTable::create_table(); |
duke@435 | 670 | } else { |
duke@435 | 671 | SymbolTable::create_table(); |
duke@435 | 672 | StringTable::create_table(); |
duke@435 | 673 | ClassLoader::create_package_info_table(); |
duke@435 | 674 | } |
duke@435 | 675 | |
duke@435 | 676 | return JNI_OK; |
duke@435 | 677 | } |
duke@435 | 678 | |
kvn@1077 | 679 | // Choose the heap base address and oop encoding mode |
kvn@1077 | 680 | // when compressed oops are used: |
kvn@1077 | 681 | // Unscaled - Use 32-bits oops without encoding when |
kvn@1077 | 682 | // NarrowOopHeapBaseMin + heap_size < 4Gb |
kvn@1077 | 683 | // ZeroBased - Use zero based compressed oops with encoding when |
kvn@1077 | 684 | // NarrowOopHeapBaseMin + heap_size < 32Gb |
kvn@1077 | 685 | // HeapBased - Use compressed oops with heap base + encoding. |
kvn@1077 | 686 | |
kvn@1077 | 687 | // 4Gb |
kvn@1077 | 688 | static const uint64_t NarrowOopHeapMax = (uint64_t(max_juint) + 1); |
kvn@1077 | 689 | // 32Gb |
kvn@1926 | 690 | // OopEncodingHeapMax == NarrowOopHeapMax << LogMinObjAlignmentInBytes; |
kvn@1077 | 691 | |
kvn@1077 | 692 | char* Universe::preferred_heap_base(size_t heap_size, NARROW_OOP_MODE mode) { |
kvn@1492 | 693 | size_t base = 0; |
kvn@1077 | 694 | #ifdef _LP64 |
kvn@1077 | 695 | if (UseCompressedOops) { |
kvn@1077 | 696 | assert(mode == UnscaledNarrowOop || |
kvn@1077 | 697 | mode == ZeroBasedNarrowOop || |
kvn@1077 | 698 | mode == HeapBasedNarrowOop, "mode is invalid"); |
kvn@1492 | 699 | const size_t total_size = heap_size + HeapBaseMinAddress; |
kvn@1357 | 700 | // Return specified base for the first request. |
kvn@1357 | 701 | if (!FLAG_IS_DEFAULT(HeapBaseMinAddress) && (mode == UnscaledNarrowOop)) { |
kvn@1492 | 702 | base = HeapBaseMinAddress; |
kvn@1492 | 703 | } else if (total_size <= OopEncodingHeapMax && (mode != HeapBasedNarrowOop)) { |
kvn@1077 | 704 | if (total_size <= NarrowOopHeapMax && (mode == UnscaledNarrowOop) && |
kvn@1077 | 705 | (Universe::narrow_oop_shift() == 0)) { |
kvn@1077 | 706 | // Use 32-bits oops without encoding and |
kvn@1077 | 707 | // place heap's top on the 4Gb boundary |
kvn@1492 | 708 | base = (NarrowOopHeapMax - heap_size); |
kvn@1077 | 709 | } else { |
kvn@1077 | 710 | // Can't reserve with NarrowOopShift == 0 |
kvn@1077 | 711 | Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); |
kvn@1077 | 712 | if (mode == UnscaledNarrowOop || |
kvn@1077 | 713 | mode == ZeroBasedNarrowOop && total_size <= NarrowOopHeapMax) { |
kvn@1077 | 714 | // Use zero based compressed oops with encoding and |
kvn@1077 | 715 | // place heap's top on the 32Gb boundary in case |
kvn@1077 | 716 | // total_size > 4Gb or failed to reserve below 4Gb. |
kvn@1492 | 717 | base = (OopEncodingHeapMax - heap_size); |
kvn@1077 | 718 | } |
kvn@1077 | 719 | } |
kvn@1077 | 720 | } else { |
kvn@1077 | 721 | // Can't reserve below 32Gb. |
kvn@1077 | 722 | Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); |
kvn@1077 | 723 | } |
kvn@1492 | 724 | // Set narrow_oop_base and narrow_oop_use_implicit_null_checks |
kvn@1492 | 725 | // used in ReservedHeapSpace() constructors. |
kvn@1492 | 726 | // The final values will be set in initialize_heap() below. |
kvn@1492 | 727 | if (base != 0 && (base + heap_size) <= OopEncodingHeapMax) { |
kvn@1492 | 728 | // Use zero based compressed oops |
kvn@1492 | 729 | Universe::set_narrow_oop_base(NULL); |
kvn@1492 | 730 | // Don't need guard page for implicit checks in indexed |
kvn@1492 | 731 | // addressing mode with zero based Compressed Oops. |
kvn@1492 | 732 | Universe::set_narrow_oop_use_implicit_null_checks(true); |
kvn@1492 | 733 | } else { |
kvn@1492 | 734 | // Set to a non-NULL value so the ReservedSpace ctor computes |
kvn@1492 | 735 | // the correct no-access prefix. |
kvn@1492 | 736 | // The final value will be set in initialize_heap() below. |
kvn@1492 | 737 | Universe::set_narrow_oop_base((address)NarrowOopHeapMax); |
kvn@1492 | 738 | #ifdef _WIN64 |
kvn@1492 | 739 | if (UseLargePages) { |
kvn@1492 | 740 | // Cannot allocate guard pages for implicit checks in indexed |
kvn@1492 | 741 | // addressing mode when large pages are specified on windows. |
kvn@1492 | 742 | Universe::set_narrow_oop_use_implicit_null_checks(false); |
kvn@1492 | 743 | } |
kvn@1492 | 744 | #endif // _WIN64 |
kvn@1492 | 745 | } |
kvn@1077 | 746 | } |
kvn@1077 | 747 | #endif |
kvn@1492 | 748 | return (char*)base; // also return NULL (don't care) for 32-bit VM |
kvn@1077 | 749 | } |
kvn@1077 | 750 | |
duke@435 | 751 | jint Universe::initialize_heap() { |
duke@435 | 752 | |
duke@435 | 753 | if (UseParallelGC) { |
duke@435 | 754 | #ifndef SERIALGC |
duke@435 | 755 | Universe::_collectedHeap = new ParallelScavengeHeap(); |
duke@435 | 756 | #else // SERIALGC |
duke@435 | 757 | fatal("UseParallelGC not supported in java kernel vm."); |
duke@435 | 758 | #endif // SERIALGC |
duke@435 | 759 | |
ysr@777 | 760 | } else if (UseG1GC) { |
ysr@777 | 761 | #ifndef SERIALGC |
tonyp@3209 | 762 | G1CollectorPolicy* g1p = new G1CollectorPolicy(); |
ysr@777 | 763 | G1CollectedHeap* g1h = new G1CollectedHeap(g1p); |
ysr@777 | 764 | Universe::_collectedHeap = g1h; |
ysr@777 | 765 | #else // SERIALGC |
ysr@777 | 766 | fatal("UseG1GC not supported in java kernel vm."); |
ysr@777 | 767 | #endif // SERIALGC |
ysr@777 | 768 | |
duke@435 | 769 | } else { |
duke@435 | 770 | GenCollectorPolicy *gc_policy; |
duke@435 | 771 | |
duke@435 | 772 | if (UseSerialGC) { |
duke@435 | 773 | gc_policy = new MarkSweepPolicy(); |
duke@435 | 774 | } else if (UseConcMarkSweepGC) { |
duke@435 | 775 | #ifndef SERIALGC |
duke@435 | 776 | if (UseAdaptiveSizePolicy) { |
duke@435 | 777 | gc_policy = new ASConcurrentMarkSweepPolicy(); |
duke@435 | 778 | } else { |
duke@435 | 779 | gc_policy = new ConcurrentMarkSweepPolicy(); |
duke@435 | 780 | } |
duke@435 | 781 | #else // SERIALGC |
duke@435 | 782 | fatal("UseConcMarkSweepGC not supported in java kernel vm."); |
duke@435 | 783 | #endif // SERIALGC |
duke@435 | 784 | } else { // default old generation |
duke@435 | 785 | gc_policy = new MarkSweepPolicy(); |
duke@435 | 786 | } |
duke@435 | 787 | |
duke@435 | 788 | Universe::_collectedHeap = new GenCollectedHeap(gc_policy); |
duke@435 | 789 | } |
duke@435 | 790 | |
duke@435 | 791 | jint status = Universe::heap()->initialize(); |
duke@435 | 792 | if (status != JNI_OK) { |
duke@435 | 793 | return status; |
duke@435 | 794 | } |
kvn@1077 | 795 | |
kvn@1077 | 796 | #ifdef _LP64 |
coleenp@548 | 797 | if (UseCompressedOops) { |
coleenp@548 | 798 | // Subtract a page because something can get allocated at heap base. |
coleenp@548 | 799 | // This also makes implicit null checking work, because the |
coleenp@548 | 800 | // memory+1 page below heap_base needs to cause a signal. |
coleenp@548 | 801 | // See needs_explicit_null_check. |
coleenp@548 | 802 | // Only set the heap base for compressed oops because it indicates |
coleenp@548 | 803 | // compressed oops for pstack code. |
kvn@2403 | 804 | bool verbose = PrintCompressedOopsMode || (PrintMiscellaneous && Verbose); |
kvn@2403 | 805 | if (verbose) { |
kvn@1077 | 806 | tty->cr(); |
kvn@2305 | 807 | tty->print("heap address: " PTR_FORMAT ", size: " SIZE_FORMAT " MB", |
kvn@2305 | 808 | Universe::heap()->base(), Universe::heap()->reserved_region().byte_size()/M); |
kvn@1077 | 809 | } |
kvn@1077 | 810 | if ((uint64_t)Universe::heap()->reserved_region().end() > OopEncodingHeapMax) { |
kvn@1077 | 811 | // Can't reserve heap below 32Gb. |
roland@4159 | 812 | // keep the Universe::narrow_oop_base() set in Universe::reserve_heap() |
kvn@1077 | 813 | Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); |
kvn@2403 | 814 | if (verbose) { |
kvn@1077 | 815 | tty->print(", Compressed Oops with base: "PTR_FORMAT, Universe::narrow_oop_base()); |
kvn@1077 | 816 | } |
kvn@1077 | 817 | } else { |
kvn@1077 | 818 | Universe::set_narrow_oop_base(0); |
kvn@2403 | 819 | if (verbose) { |
kvn@1077 | 820 | tty->print(", zero based Compressed Oops"); |
kvn@1077 | 821 | } |
kvn@1077 | 822 | #ifdef _WIN64 |
kvn@1077 | 823 | if (!Universe::narrow_oop_use_implicit_null_checks()) { |
kvn@1077 | 824 | // Don't need guard page for implicit checks in indexed addressing |
kvn@1077 | 825 | // mode with zero based Compressed Oops. |
kvn@1077 | 826 | Universe::set_narrow_oop_use_implicit_null_checks(true); |
kvn@1077 | 827 | } |
kvn@1077 | 828 | #endif // _WIN64 |
kvn@1077 | 829 | if((uint64_t)Universe::heap()->reserved_region().end() > NarrowOopHeapMax) { |
kvn@1077 | 830 | // Can't reserve heap below 4Gb. |
kvn@1077 | 831 | Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); |
kvn@1077 | 832 | } else { |
kvn@1357 | 833 | Universe::set_narrow_oop_shift(0); |
kvn@2403 | 834 | if (verbose) { |
kvn@1077 | 835 | tty->print(", 32-bits Oops"); |
kvn@1077 | 836 | } |
kvn@1077 | 837 | } |
kvn@1077 | 838 | } |
kvn@2403 | 839 | if (verbose) { |
kvn@1077 | 840 | tty->cr(); |
kvn@1077 | 841 | tty->cr(); |
kvn@1077 | 842 | } |
roland@4159 | 843 | if (UseCompressedKlassPointers) { |
roland@4159 | 844 | Universe::set_narrow_klass_base(Universe::narrow_oop_base()); |
roland@4159 | 845 | Universe::set_narrow_klass_shift(MIN2(Universe::narrow_oop_shift(), LogKlassAlignmentInBytes)); |
roland@4159 | 846 | } |
roland@4159 | 847 | Universe::set_narrow_ptrs_base(Universe::narrow_oop_base()); |
coleenp@548 | 848 | } |
roland@4159 | 849 | // Universe::narrow_oop_base() is one page below the metaspace |
roland@4159 | 850 | // base. The actual metaspace base depends on alignment constraints |
roland@4159 | 851 | // so we don't know its exact location here. |
roland@4159 | 852 | assert((intptr_t)Universe::narrow_oop_base() <= (intptr_t)(Universe::heap()->base() - os::vm_page_size() - ClassMetaspaceSize) || |
kvn@1077 | 853 | Universe::narrow_oop_base() == NULL, "invalid value"); |
kvn@1077 | 854 | assert(Universe::narrow_oop_shift() == LogMinObjAlignmentInBytes || |
kvn@1077 | 855 | Universe::narrow_oop_shift() == 0, "invalid value"); |
kvn@1077 | 856 | #endif |
duke@435 | 857 | |
duke@435 | 858 | // We will never reach the CATCH below since Exceptions::_throw will cause |
duke@435 | 859 | // the VM to exit if an exception is thrown during initialization |
duke@435 | 860 | |
duke@435 | 861 | if (UseTLAB) { |
duke@435 | 862 | assert(Universe::heap()->supports_tlab_allocation(), |
duke@435 | 863 | "Should support thread-local allocation buffers"); |
duke@435 | 864 | ThreadLocalAllocBuffer::startup_initialization(); |
duke@435 | 865 | } |
duke@435 | 866 | return JNI_OK; |
duke@435 | 867 | } |
duke@435 | 868 | |
coleenp@4037 | 869 | |
coleenp@4037 | 870 | // Reserve the Java heap, which is now the same for all GCs. |
coleenp@4037 | 871 | ReservedSpace Universe::reserve_heap(size_t heap_size, size_t alignment) { |
coleenp@4037 | 872 | // Add in the class metaspace area so the classes in the headers can |
coleenp@4037 | 873 | // be compressed the same as instances. |
roland@4159 | 874 | // Need to round class space size up because it's below the heap and |
roland@4159 | 875 | // the actual alignment depends on its size. |
roland@4159 | 876 | size_t metaspace_size = align_size_up(ClassMetaspaceSize, alignment); |
roland@4159 | 877 | size_t total_reserved = align_size_up(heap_size + metaspace_size, alignment); |
coleenp@4037 | 878 | char* addr = Universe::preferred_heap_base(total_reserved, Universe::UnscaledNarrowOop); |
coleenp@4037 | 879 | |
coleenp@4037 | 880 | ReservedHeapSpace total_rs(total_reserved, alignment, UseLargePages, addr); |
coleenp@4037 | 881 | |
coleenp@4037 | 882 | if (UseCompressedOops) { |
coleenp@4037 | 883 | if (addr != NULL && !total_rs.is_reserved()) { |
coleenp@4037 | 884 | // Failed to reserve at specified address - the requested memory |
coleenp@4037 | 885 | // region is taken already, for example, by 'java' launcher. |
coleenp@4037 | 886 | // Try again to reserver heap higher. |
coleenp@4037 | 887 | addr = Universe::preferred_heap_base(total_reserved, Universe::ZeroBasedNarrowOop); |
coleenp@4037 | 888 | |
coleenp@4037 | 889 | ReservedHeapSpace total_rs0(total_reserved, alignment, |
coleenp@4037 | 890 | UseLargePages, addr); |
coleenp@4037 | 891 | |
coleenp@4037 | 892 | if (addr != NULL && !total_rs0.is_reserved()) { |
coleenp@4037 | 893 | // Failed to reserve at specified address again - give up. |
coleenp@4037 | 894 | addr = Universe::preferred_heap_base(total_reserved, Universe::HeapBasedNarrowOop); |
coleenp@4037 | 895 | assert(addr == NULL, ""); |
coleenp@4037 | 896 | |
coleenp@4037 | 897 | ReservedHeapSpace total_rs1(total_reserved, alignment, |
coleenp@4037 | 898 | UseLargePages, addr); |
coleenp@4037 | 899 | total_rs = total_rs1; |
coleenp@4037 | 900 | } else { |
coleenp@4037 | 901 | total_rs = total_rs0; |
coleenp@4037 | 902 | } |
coleenp@4037 | 903 | } |
coleenp@4037 | 904 | } |
coleenp@4037 | 905 | |
coleenp@4037 | 906 | if (!total_rs.is_reserved()) { |
coleenp@4037 | 907 | vm_exit_during_initialization(err_msg("Could not reserve enough space for object heap %d bytes", total_reserved)); |
coleenp@4037 | 908 | return total_rs; |
coleenp@4037 | 909 | } |
coleenp@4037 | 910 | |
roland@4159 | 911 | // Split the reserved space into main Java heap and a space for |
roland@4159 | 912 | // classes so that they can be compressed using the same algorithm |
roland@4159 | 913 | // as compressed oops. If compress oops and compress klass ptrs are |
roland@4159 | 914 | // used we need the meta space first: if the alignment used for |
roland@4159 | 915 | // compressed oops is greater than the one used for compressed klass |
roland@4159 | 916 | // ptrs, a metadata space on top of the heap could become |
roland@4159 | 917 | // unreachable. |
roland@4159 | 918 | ReservedSpace class_rs = total_rs.first_part(metaspace_size); |
roland@4159 | 919 | ReservedSpace heap_rs = total_rs.last_part(metaspace_size, alignment); |
coleenp@4037 | 920 | Metaspace::initialize_class_space(class_rs); |
roland@4159 | 921 | |
roland@4159 | 922 | if (UseCompressedOops) { |
roland@4159 | 923 | // Universe::initialize_heap() will reset this to NULL if unscaled |
roland@4159 | 924 | // or zero-based narrow oops are actually used. |
roland@4159 | 925 | address base = (address)(total_rs.base() - os::vm_page_size()); |
roland@4159 | 926 | Universe::set_narrow_oop_base(base); |
roland@4159 | 927 | } |
coleenp@4037 | 928 | return heap_rs; |
coleenp@4037 | 929 | } |
coleenp@4037 | 930 | |
coleenp@4037 | 931 | |
duke@435 | 932 | // It's the caller's repsonsibility to ensure glitch-freedom |
duke@435 | 933 | // (if required). |
duke@435 | 934 | void Universe::update_heap_info_at_gc() { |
duke@435 | 935 | _heap_capacity_at_last_gc = heap()->capacity(); |
duke@435 | 936 | _heap_used_at_last_gc = heap()->used(); |
duke@435 | 937 | } |
duke@435 | 938 | |
duke@435 | 939 | |
duke@435 | 940 | |
duke@435 | 941 | void universe2_init() { |
duke@435 | 942 | EXCEPTION_MARK; |
duke@435 | 943 | Universe::genesis(CATCH); |
duke@435 | 944 | // Although we'd like to verify here that the state of the heap |
duke@435 | 945 | // is good, we can't because the main thread has not yet added |
duke@435 | 946 | // itself to the threads list (so, using current interfaces |
duke@435 | 947 | // we can't "fill" its TLAB), unless TLABs are disabled. |
duke@435 | 948 | if (VerifyBeforeGC && !UseTLAB && |
duke@435 | 949 | Universe::heap()->total_collections() >= VerifyGCStartAt) { |
duke@435 | 950 | Universe::heap()->prepare_for_verify(); |
duke@435 | 951 | Universe::verify(); // make sure we're starting with a clean slate |
duke@435 | 952 | } |
duke@435 | 953 | } |
duke@435 | 954 | |
duke@435 | 955 | |
duke@435 | 956 | // This function is defined in JVM.cpp |
duke@435 | 957 | extern void initialize_converter_functions(); |
duke@435 | 958 | |
duke@435 | 959 | bool universe_post_init() { |
ysr@2301 | 960 | assert(!is_init_completed(), "Error: initialization not yet completed!"); |
duke@435 | 961 | Universe::_fully_initialized = true; |
duke@435 | 962 | EXCEPTION_MARK; |
duke@435 | 963 | { ResourceMark rm; |
duke@435 | 964 | Interpreter::initialize(); // needed for interpreter entry points |
duke@435 | 965 | if (!UseSharedSpaces) { |
coleenp@4037 | 966 | HandleMark hm(THREAD); |
never@1577 | 967 | KlassHandle ok_h(THREAD, SystemDictionary::Object_klass()); |
duke@435 | 968 | Universe::reinitialize_vtable_of(ok_h, CHECK_false); |
duke@435 | 969 | Universe::reinitialize_itables(CHECK_false); |
duke@435 | 970 | } |
duke@435 | 971 | } |
duke@435 | 972 | |
coleenp@4037 | 973 | HandleMark hm(THREAD); |
coleenp@4037 | 974 | Klass* k; |
duke@435 | 975 | instanceKlassHandle k_h; |
duke@435 | 976 | // Setup preallocated empty java.lang.Class array |
never@1577 | 977 | Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::Class_klass(), 0, CHECK_false); |
coleenp@4037 | 978 | |
duke@435 | 979 | // Setup preallocated OutOfMemoryError errors |
coleenp@2497 | 980 | k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_OutOfMemoryError(), true, CHECK_false); |
duke@435 | 981 | k_h = instanceKlassHandle(THREAD, k); |
coleenp@4037 | 982 | Universe::_out_of_memory_error_java_heap = k_h->allocate_instance(CHECK_false); |
coleenp@4037 | 983 | Universe::_out_of_memory_error_perm_gen = k_h->allocate_instance(CHECK_false); |
coleenp@4037 | 984 | Universe::_out_of_memory_error_array_size = k_h->allocate_instance(CHECK_false); |
duke@435 | 985 | Universe::_out_of_memory_error_gc_overhead_limit = |
coleenp@4037 | 986 | k_h->allocate_instance(CHECK_false); |
duke@435 | 987 | |
duke@435 | 988 | // Setup preallocated NullPointerException |
duke@435 | 989 | // (this is currently used for a cheap & dirty solution in compiler exception handling) |
coleenp@2497 | 990 | k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_NullPointerException(), true, CHECK_false); |
coleenp@4037 | 991 | Universe::_null_ptr_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false); |
duke@435 | 992 | // Setup preallocated ArithmeticException |
duke@435 | 993 | // (this is currently used for a cheap & dirty solution in compiler exception handling) |
coleenp@2497 | 994 | k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_ArithmeticException(), true, CHECK_false); |
coleenp@4037 | 995 | Universe::_arithmetic_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false); |
duke@435 | 996 | // Virtual Machine Error for when we get into a situation we can't resolve |
duke@435 | 997 | k = SystemDictionary::resolve_or_fail( |
coleenp@2497 | 998 | vmSymbols::java_lang_VirtualMachineError(), true, CHECK_false); |
coleenp@4037 | 999 | bool linked = InstanceKlass::cast(k)->link_class_or_fail(CHECK_false); |
duke@435 | 1000 | if (!linked) { |
duke@435 | 1001 | tty->print_cr("Unable to link/verify VirtualMachineError class"); |
duke@435 | 1002 | return false; // initialization failed |
duke@435 | 1003 | } |
duke@435 | 1004 | Universe::_virtual_machine_error_instance = |
coleenp@4037 | 1005 | InstanceKlass::cast(k)->allocate_instance(CHECK_false); |
coleenp@2497 | 1006 | |
coleenp@4037 | 1007 | Universe::_vm_exception = InstanceKlass::cast(k)->allocate_instance(CHECK_false); |
coleenp@2497 | 1008 | |
duke@435 | 1009 | if (!DumpSharedSpaces) { |
duke@435 | 1010 | // These are the only Java fields that are currently set during shared space dumping. |
duke@435 | 1011 | // We prefer to not handle this generally, so we always reinitialize these detail messages. |
duke@435 | 1012 | Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false); |
duke@435 | 1013 | java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg()); |
duke@435 | 1014 | |
coleenp@4037 | 1015 | msg = java_lang_String::create_from_str("Metadata space", CHECK_false); |
duke@435 | 1016 | java_lang_Throwable::set_message(Universe::_out_of_memory_error_perm_gen, msg()); |
duke@435 | 1017 | |
duke@435 | 1018 | msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false); |
duke@435 | 1019 | java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg()); |
duke@435 | 1020 | |
duke@435 | 1021 | msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false); |
duke@435 | 1022 | java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg()); |
duke@435 | 1023 | |
duke@435 | 1024 | msg = java_lang_String::create_from_str("/ by zero", CHECK_false); |
duke@435 | 1025 | java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg()); |
duke@435 | 1026 | |
duke@435 | 1027 | // Setup the array of errors that have preallocated backtrace |
duke@435 | 1028 | k = Universe::_out_of_memory_error_java_heap->klass(); |
coleenp@4037 | 1029 | assert(k->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error"); |
duke@435 | 1030 | k_h = instanceKlassHandle(THREAD, k); |
duke@435 | 1031 | |
duke@435 | 1032 | int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0; |
duke@435 | 1033 | Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false); |
duke@435 | 1034 | for (int i=0; i<len; i++) { |
coleenp@4037 | 1035 | oop err = k_h->allocate_instance(CHECK_false); |
duke@435 | 1036 | Handle err_h = Handle(THREAD, err); |
duke@435 | 1037 | java_lang_Throwable::allocate_backtrace(err_h, CHECK_false); |
duke@435 | 1038 | Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h()); |
duke@435 | 1039 | } |
duke@435 | 1040 | Universe::_preallocated_out_of_memory_error_avail_count = (jint)len; |
duke@435 | 1041 | } |
duke@435 | 1042 | |
duke@435 | 1043 | |
duke@435 | 1044 | // Setup static method for registering finalizers |
duke@435 | 1045 | // The finalizer klass must be linked before looking up the method, in |
duke@435 | 1046 | // case it needs to get rewritten. |
coleenp@4037 | 1047 | InstanceKlass::cast(SystemDictionary::Finalizer_klass())->link_class(CHECK_false); |
coleenp@4037 | 1048 | Method* m = InstanceKlass::cast(SystemDictionary::Finalizer_klass())->find_method( |
duke@435 | 1049 | vmSymbols::register_method_name(), |
duke@435 | 1050 | vmSymbols::register_method_signature()); |
duke@435 | 1051 | if (m == NULL || !m->is_static()) { |
duke@435 | 1052 | THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), |
duke@435 | 1053 | "java.lang.ref.Finalizer.register", false); |
duke@435 | 1054 | } |
duke@435 | 1055 | Universe::_finalizer_register_cache->init( |
never@1577 | 1056 | SystemDictionary::Finalizer_klass(), m, CHECK_false); |
duke@435 | 1057 | |
duke@435 | 1058 | // Resolve on first use and initialize class. |
duke@435 | 1059 | // Note: No race-condition here, since a resolve will always return the same result |
duke@435 | 1060 | |
duke@435 | 1061 | // Setup method for security checks |
coleenp@2497 | 1062 | k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_reflect_Method(), true, CHECK_false); |
duke@435 | 1063 | k_h = instanceKlassHandle(THREAD, k); |
duke@435 | 1064 | k_h->link_class(CHECK_false); |
jrose@1862 | 1065 | m = k_h->find_method(vmSymbols::invoke_name(), vmSymbols::object_object_array_object_signature()); |
duke@435 | 1066 | if (m == NULL || m->is_static()) { |
duke@435 | 1067 | THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), |
duke@435 | 1068 | "java.lang.reflect.Method.invoke", false); |
duke@435 | 1069 | } |
duke@435 | 1070 | Universe::_reflect_invoke_cache->init(k_h(), m, CHECK_false); |
duke@435 | 1071 | |
coleenp@4062 | 1072 | // Setup method for registering loaded classes in class loader vector |
coleenp@4062 | 1073 | InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->link_class(CHECK_false); |
coleenp@4062 | 1074 | m = InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->find_method(vmSymbols::addClass_name(), vmSymbols::class_void_signature()); |
coleenp@4062 | 1075 | if (m == NULL || m->is_static()) { |
coleenp@4062 | 1076 | THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), |
coleenp@4062 | 1077 | "java.lang.ClassLoader.addClass", false); |
coleenp@4062 | 1078 | } |
coleenp@4062 | 1079 | Universe::_loader_addClass_cache->init( |
coleenp@4062 | 1080 | SystemDictionary::ClassLoader_klass(), m, CHECK_false); |
coleenp@4062 | 1081 | |
duke@435 | 1082 | // The folowing is initializing converter functions for serialization in |
duke@435 | 1083 | // JVM.cpp. If we clean up the StrictMath code above we may want to find |
duke@435 | 1084 | // a better solution for this as well. |
duke@435 | 1085 | initialize_converter_functions(); |
duke@435 | 1086 | |
duke@435 | 1087 | // This needs to be done before the first scavenge/gc, since |
duke@435 | 1088 | // it's an input to soft ref clearing policy. |
ysr@777 | 1089 | { |
ysr@777 | 1090 | MutexLocker x(Heap_lock); |
ysr@777 | 1091 | Universe::update_heap_info_at_gc(); |
ysr@777 | 1092 | } |
duke@435 | 1093 | |
duke@435 | 1094 | // ("weak") refs processing infrastructure initialization |
duke@435 | 1095 | Universe::heap()->post_initialize(); |
duke@435 | 1096 | |
coleenp@4037 | 1097 | // Initialize performance counters for metaspaces |
coleenp@4037 | 1098 | MetaspaceCounters::initialize_performance_counters(); |
coleenp@4037 | 1099 | |
duke@435 | 1100 | GC_locker::unlock(); // allow gc after bootstrapping |
duke@435 | 1101 | |
duke@435 | 1102 | MemoryService::set_universe_heap(Universe::_collectedHeap); |
duke@435 | 1103 | return true; |
duke@435 | 1104 | } |
duke@435 | 1105 | |
duke@435 | 1106 | |
duke@435 | 1107 | void Universe::compute_base_vtable_size() { |
duke@435 | 1108 | _base_vtable_size = ClassLoader::compute_Object_vtable(); |
duke@435 | 1109 | } |
duke@435 | 1110 | |
duke@435 | 1111 | |
duke@435 | 1112 | // %%% The Universe::flush_foo methods belong in CodeCache. |
duke@435 | 1113 | |
duke@435 | 1114 | // Flushes compiled methods dependent on dependee. |
duke@435 | 1115 | void Universe::flush_dependents_on(instanceKlassHandle dependee) { |
duke@435 | 1116 | assert_lock_strong(Compile_lock); |
duke@435 | 1117 | |
duke@435 | 1118 | if (CodeCache::number_of_nmethods_with_dependencies() == 0) return; |
duke@435 | 1119 | |
duke@435 | 1120 | // CodeCache can only be updated by a thread_in_VM and they will all be |
duke@435 | 1121 | // stopped dring the safepoint so CodeCache will be safe to update without |
duke@435 | 1122 | // holding the CodeCache_lock. |
duke@435 | 1123 | |
twisti@3050 | 1124 | KlassDepChange changes(dependee); |
duke@435 | 1125 | |
duke@435 | 1126 | // Compute the dependent nmethods |
duke@435 | 1127 | if (CodeCache::mark_for_deoptimization(changes) > 0) { |
duke@435 | 1128 | // At least one nmethod has been marked for deoptimization |
duke@435 | 1129 | VM_Deoptimize op; |
duke@435 | 1130 | VMThread::execute(&op); |
duke@435 | 1131 | } |
duke@435 | 1132 | } |
duke@435 | 1133 | |
twisti@3050 | 1134 | // Flushes compiled methods dependent on a particular CallSite |
twisti@3050 | 1135 | // instance when its target is different than the given MethodHandle. |
twisti@3050 | 1136 | void Universe::flush_dependents_on(Handle call_site, Handle method_handle) { |
twisti@3050 | 1137 | assert_lock_strong(Compile_lock); |
twisti@3050 | 1138 | |
twisti@3050 | 1139 | if (CodeCache::number_of_nmethods_with_dependencies() == 0) return; |
twisti@3050 | 1140 | |
twisti@3050 | 1141 | // CodeCache can only be updated by a thread_in_VM and they will all be |
twisti@3050 | 1142 | // stopped dring the safepoint so CodeCache will be safe to update without |
twisti@3050 | 1143 | // holding the CodeCache_lock. |
twisti@3050 | 1144 | |
twisti@3050 | 1145 | CallSiteDepChange changes(call_site(), method_handle()); |
twisti@3050 | 1146 | |
twisti@3050 | 1147 | // Compute the dependent nmethods that have a reference to a |
coleenp@4037 | 1148 | // CallSite object. We use InstanceKlass::mark_dependent_nmethod |
twisti@3050 | 1149 | // directly instead of CodeCache::mark_for_deoptimization because we |
twisti@3094 | 1150 | // want dependents on the call site class only not all classes in |
twisti@3094 | 1151 | // the ContextStream. |
twisti@3050 | 1152 | int marked = 0; |
twisti@3050 | 1153 | { |
twisti@3050 | 1154 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
coleenp@4037 | 1155 | InstanceKlass* call_site_klass = InstanceKlass::cast(call_site->klass()); |
twisti@3050 | 1156 | marked = call_site_klass->mark_dependent_nmethods(changes); |
twisti@3050 | 1157 | } |
twisti@3050 | 1158 | if (marked > 0) { |
twisti@3050 | 1159 | // At least one nmethod has been marked for deoptimization |
twisti@3050 | 1160 | VM_Deoptimize op; |
twisti@3050 | 1161 | VMThread::execute(&op); |
twisti@3050 | 1162 | } |
twisti@3050 | 1163 | } |
twisti@3050 | 1164 | |
duke@435 | 1165 | #ifdef HOTSWAP |
duke@435 | 1166 | // Flushes compiled methods dependent on dependee in the evolutionary sense |
duke@435 | 1167 | void Universe::flush_evol_dependents_on(instanceKlassHandle ev_k_h) { |
duke@435 | 1168 | // --- Compile_lock is not held. However we are at a safepoint. |
duke@435 | 1169 | assert_locked_or_safepoint(Compile_lock); |
duke@435 | 1170 | if (CodeCache::number_of_nmethods_with_dependencies() == 0) return; |
duke@435 | 1171 | |
duke@435 | 1172 | // CodeCache can only be updated by a thread_in_VM and they will all be |
duke@435 | 1173 | // stopped dring the safepoint so CodeCache will be safe to update without |
duke@435 | 1174 | // holding the CodeCache_lock. |
duke@435 | 1175 | |
duke@435 | 1176 | // Compute the dependent nmethods |
duke@435 | 1177 | if (CodeCache::mark_for_evol_deoptimization(ev_k_h) > 0) { |
duke@435 | 1178 | // At least one nmethod has been marked for deoptimization |
duke@435 | 1179 | |
duke@435 | 1180 | // All this already happens inside a VM_Operation, so we'll do all the work here. |
duke@435 | 1181 | // Stuff copied from VM_Deoptimize and modified slightly. |
duke@435 | 1182 | |
duke@435 | 1183 | // We do not want any GCs to happen while we are in the middle of this VM operation |
duke@435 | 1184 | ResourceMark rm; |
duke@435 | 1185 | DeoptimizationMarker dm; |
duke@435 | 1186 | |
duke@435 | 1187 | // Deoptimize all activations depending on marked nmethods |
duke@435 | 1188 | Deoptimization::deoptimize_dependents(); |
duke@435 | 1189 | |
duke@435 | 1190 | // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies) |
duke@435 | 1191 | CodeCache::make_marked_nmethods_not_entrant(); |
duke@435 | 1192 | } |
duke@435 | 1193 | } |
duke@435 | 1194 | #endif // HOTSWAP |
duke@435 | 1195 | |
duke@435 | 1196 | |
duke@435 | 1197 | // Flushes compiled methods dependent on dependee |
duke@435 | 1198 | void Universe::flush_dependents_on_method(methodHandle m_h) { |
duke@435 | 1199 | // --- Compile_lock is not held. However we are at a safepoint. |
duke@435 | 1200 | assert_locked_or_safepoint(Compile_lock); |
duke@435 | 1201 | |
duke@435 | 1202 | // CodeCache can only be updated by a thread_in_VM and they will all be |
duke@435 | 1203 | // stopped dring the safepoint so CodeCache will be safe to update without |
duke@435 | 1204 | // holding the CodeCache_lock. |
duke@435 | 1205 | |
duke@435 | 1206 | // Compute the dependent nmethods |
duke@435 | 1207 | if (CodeCache::mark_for_deoptimization(m_h()) > 0) { |
duke@435 | 1208 | // At least one nmethod has been marked for deoptimization |
duke@435 | 1209 | |
duke@435 | 1210 | // All this already happens inside a VM_Operation, so we'll do all the work here. |
duke@435 | 1211 | // Stuff copied from VM_Deoptimize and modified slightly. |
duke@435 | 1212 | |
duke@435 | 1213 | // We do not want any GCs to happen while we are in the middle of this VM operation |
duke@435 | 1214 | ResourceMark rm; |
duke@435 | 1215 | DeoptimizationMarker dm; |
duke@435 | 1216 | |
duke@435 | 1217 | // Deoptimize all activations depending on marked nmethods |
duke@435 | 1218 | Deoptimization::deoptimize_dependents(); |
duke@435 | 1219 | |
duke@435 | 1220 | // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies) |
duke@435 | 1221 | CodeCache::make_marked_nmethods_not_entrant(); |
duke@435 | 1222 | } |
duke@435 | 1223 | } |
duke@435 | 1224 | |
tonyp@3269 | 1225 | void Universe::print() { |
tonyp@3269 | 1226 | print_on(gclog_or_tty); |
tonyp@3269 | 1227 | } |
duke@435 | 1228 | |
tonyp@3269 | 1229 | void Universe::print_on(outputStream* st, bool extended) { |
duke@435 | 1230 | st->print_cr("Heap"); |
tonyp@3269 | 1231 | if (!extended) { |
tonyp@3269 | 1232 | heap()->print_on(st); |
tonyp@3269 | 1233 | } else { |
tonyp@3269 | 1234 | heap()->print_extended_on(st); |
tonyp@3269 | 1235 | } |
duke@435 | 1236 | } |
duke@435 | 1237 | |
duke@435 | 1238 | void Universe::print_heap_at_SIGBREAK() { |
duke@435 | 1239 | if (PrintHeapAtSIGBREAK) { |
duke@435 | 1240 | MutexLocker hl(Heap_lock); |
duke@435 | 1241 | print_on(tty); |
duke@435 | 1242 | tty->cr(); |
duke@435 | 1243 | tty->flush(); |
duke@435 | 1244 | } |
duke@435 | 1245 | } |
duke@435 | 1246 | |
never@3571 | 1247 | void Universe::print_heap_before_gc(outputStream* st, bool ignore_extended) { |
duke@435 | 1248 | st->print_cr("{Heap before GC invocations=%u (full %u):", |
duke@435 | 1249 | heap()->total_collections(), |
duke@435 | 1250 | heap()->total_full_collections()); |
never@3571 | 1251 | if (!PrintHeapAtGCExtended || ignore_extended) { |
tonyp@3269 | 1252 | heap()->print_on(st); |
tonyp@3269 | 1253 | } else { |
tonyp@3269 | 1254 | heap()->print_extended_on(st); |
tonyp@3269 | 1255 | } |
duke@435 | 1256 | } |
duke@435 | 1257 | |
never@3571 | 1258 | void Universe::print_heap_after_gc(outputStream* st, bool ignore_extended) { |
duke@435 | 1259 | st->print_cr("Heap after GC invocations=%u (full %u):", |
duke@435 | 1260 | heap()->total_collections(), |
duke@435 | 1261 | heap()->total_full_collections()); |
never@3571 | 1262 | if (!PrintHeapAtGCExtended || ignore_extended) { |
tonyp@3269 | 1263 | heap()->print_on(st); |
tonyp@3269 | 1264 | } else { |
tonyp@3269 | 1265 | heap()->print_extended_on(st); |
tonyp@3269 | 1266 | } |
duke@435 | 1267 | st->print_cr("}"); |
duke@435 | 1268 | } |
duke@435 | 1269 | |
brutisso@3711 | 1270 | void Universe::verify(bool silent, VerifyOption option) { |
duke@435 | 1271 | if (SharedSkipVerify) { |
duke@435 | 1272 | return; |
duke@435 | 1273 | } |
duke@435 | 1274 | |
duke@435 | 1275 | // The use of _verify_in_progress is a temporary work around for |
duke@435 | 1276 | // 6320749. Don't bother with a creating a class to set and clear |
duke@435 | 1277 | // it since it is only used in this method and the control flow is |
duke@435 | 1278 | // straight forward. |
duke@435 | 1279 | _verify_in_progress = true; |
duke@435 | 1280 | |
duke@435 | 1281 | COMPILER2_PRESENT( |
duke@435 | 1282 | assert(!DerivedPointerTable::is_active(), |
duke@435 | 1283 | "DPT should not be active during verification " |
duke@435 | 1284 | "(of thread stacks below)"); |
duke@435 | 1285 | ) |
duke@435 | 1286 | |
duke@435 | 1287 | ResourceMark rm; |
duke@435 | 1288 | HandleMark hm; // Handles created during verification can be zapped |
duke@435 | 1289 | _verify_count++; |
duke@435 | 1290 | |
duke@435 | 1291 | if (!silent) gclog_or_tty->print("[Verifying "); |
duke@435 | 1292 | if (!silent) gclog_or_tty->print("threads "); |
duke@435 | 1293 | Threads::verify(); |
brutisso@3711 | 1294 | heap()->verify(silent, option); |
duke@435 | 1295 | |
duke@435 | 1296 | if (!silent) gclog_or_tty->print("syms "); |
duke@435 | 1297 | SymbolTable::verify(); |
duke@435 | 1298 | if (!silent) gclog_or_tty->print("strs "); |
duke@435 | 1299 | StringTable::verify(); |
duke@435 | 1300 | { |
duke@435 | 1301 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 1302 | if (!silent) gclog_or_tty->print("zone "); |
duke@435 | 1303 | CodeCache::verify(); |
duke@435 | 1304 | } |
duke@435 | 1305 | if (!silent) gclog_or_tty->print("dict "); |
duke@435 | 1306 | SystemDictionary::verify(); |
coleenp@4037 | 1307 | #ifndef PRODUCT |
coleenp@4037 | 1308 | if (!silent) gclog_or_tty->print("cldg "); |
coleenp@4037 | 1309 | ClassLoaderDataGraph::verify(); |
coleenp@4037 | 1310 | #endif |
duke@435 | 1311 | if (!silent) gclog_or_tty->print("hand "); |
duke@435 | 1312 | JNIHandles::verify(); |
duke@435 | 1313 | if (!silent) gclog_or_tty->print("C-heap "); |
duke@435 | 1314 | os::check_heap(); |
never@2657 | 1315 | if (!silent) gclog_or_tty->print("code cache "); |
never@2657 | 1316 | CodeCache::verify_oops(); |
duke@435 | 1317 | if (!silent) gclog_or_tty->print_cr("]"); |
duke@435 | 1318 | |
duke@435 | 1319 | _verify_in_progress = false; |
duke@435 | 1320 | } |
duke@435 | 1321 | |
duke@435 | 1322 | // Oop verification (see MacroAssembler::verify_oop) |
duke@435 | 1323 | |
duke@435 | 1324 | static uintptr_t _verify_oop_data[2] = {0, (uintptr_t)-1}; |
duke@435 | 1325 | static uintptr_t _verify_klass_data[2] = {0, (uintptr_t)-1}; |
duke@435 | 1326 | |
duke@435 | 1327 | |
duke@435 | 1328 | static void calculate_verify_data(uintptr_t verify_data[2], |
duke@435 | 1329 | HeapWord* low_boundary, |
duke@435 | 1330 | HeapWord* high_boundary) { |
duke@435 | 1331 | assert(low_boundary < high_boundary, "bad interval"); |
duke@435 | 1332 | |
duke@435 | 1333 | // decide which low-order bits we require to be clear: |
duke@435 | 1334 | size_t alignSize = MinObjAlignmentInBytes; |
kvn@1926 | 1335 | size_t min_object_size = CollectedHeap::min_fill_size(); |
duke@435 | 1336 | |
duke@435 | 1337 | // make an inclusive limit: |
duke@435 | 1338 | uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize; |
duke@435 | 1339 | uintptr_t min = (uintptr_t)low_boundary; |
duke@435 | 1340 | assert(min < max, "bad interval"); |
duke@435 | 1341 | uintptr_t diff = max ^ min; |
duke@435 | 1342 | |
duke@435 | 1343 | // throw away enough low-order bits to make the diff vanish |
duke@435 | 1344 | uintptr_t mask = (uintptr_t)(-1); |
duke@435 | 1345 | while ((mask & diff) != 0) |
duke@435 | 1346 | mask <<= 1; |
duke@435 | 1347 | uintptr_t bits = (min & mask); |
duke@435 | 1348 | assert(bits == (max & mask), "correct mask"); |
duke@435 | 1349 | // check an intermediate value between min and max, just to make sure: |
duke@435 | 1350 | assert(bits == ((min + (max-min)/2) & mask), "correct mask"); |
duke@435 | 1351 | |
duke@435 | 1352 | // require address alignment, too: |
duke@435 | 1353 | mask |= (alignSize - 1); |
duke@435 | 1354 | |
duke@435 | 1355 | if (!(verify_data[0] == 0 && verify_data[1] == (uintptr_t)-1)) { |
duke@435 | 1356 | assert(verify_data[0] == mask && verify_data[1] == bits, "mask stability"); |
duke@435 | 1357 | } |
duke@435 | 1358 | verify_data[0] = mask; |
duke@435 | 1359 | verify_data[1] = bits; |
duke@435 | 1360 | } |
duke@435 | 1361 | |
duke@435 | 1362 | |
duke@435 | 1363 | // Oop verification (see MacroAssembler::verify_oop) |
duke@435 | 1364 | #ifndef PRODUCT |
duke@435 | 1365 | |
duke@435 | 1366 | uintptr_t Universe::verify_oop_mask() { |
duke@435 | 1367 | MemRegion m = heap()->reserved_region(); |
duke@435 | 1368 | calculate_verify_data(_verify_oop_data, |
duke@435 | 1369 | m.start(), |
duke@435 | 1370 | m.end()); |
duke@435 | 1371 | return _verify_oop_data[0]; |
duke@435 | 1372 | } |
duke@435 | 1373 | |
duke@435 | 1374 | |
duke@435 | 1375 | |
duke@435 | 1376 | uintptr_t Universe::verify_oop_bits() { |
duke@435 | 1377 | verify_oop_mask(); |
duke@435 | 1378 | return _verify_oop_data[1]; |
duke@435 | 1379 | } |
duke@435 | 1380 | |
duke@435 | 1381 | uintptr_t Universe::verify_mark_mask() { |
duke@435 | 1382 | return markOopDesc::lock_mask_in_place; |
duke@435 | 1383 | } |
duke@435 | 1384 | |
duke@435 | 1385 | uintptr_t Universe::verify_mark_bits() { |
duke@435 | 1386 | intptr_t mask = verify_mark_mask(); |
duke@435 | 1387 | intptr_t bits = (intptr_t)markOopDesc::prototype(); |
duke@435 | 1388 | assert((bits & ~mask) == 0, "no stray header bits"); |
duke@435 | 1389 | return bits; |
duke@435 | 1390 | } |
duke@435 | 1391 | #endif // PRODUCT |
duke@435 | 1392 | |
duke@435 | 1393 | |
duke@435 | 1394 | void Universe::compute_verify_oop_data() { |
duke@435 | 1395 | verify_oop_mask(); |
duke@435 | 1396 | verify_oop_bits(); |
duke@435 | 1397 | verify_mark_mask(); |
duke@435 | 1398 | verify_mark_bits(); |
duke@435 | 1399 | } |
duke@435 | 1400 | |
duke@435 | 1401 | |
coleenp@4037 | 1402 | void CommonMethodOopCache::init(Klass* k, Method* m, TRAPS) { |
duke@435 | 1403 | if (!UseSharedSpaces) { |
duke@435 | 1404 | _klass = k; |
duke@435 | 1405 | } |
duke@435 | 1406 | #ifndef PRODUCT |
duke@435 | 1407 | else { |
duke@435 | 1408 | // sharing initilization should have already set up _klass |
duke@435 | 1409 | assert(_klass != NULL, "just checking"); |
duke@435 | 1410 | } |
duke@435 | 1411 | #endif |
duke@435 | 1412 | |
duke@435 | 1413 | _method_idnum = m->method_idnum(); |
duke@435 | 1414 | assert(_method_idnum >= 0, "sanity check"); |
duke@435 | 1415 | } |
duke@435 | 1416 | |
duke@435 | 1417 | |
duke@435 | 1418 | ActiveMethodOopsCache::~ActiveMethodOopsCache() { |
duke@435 | 1419 | if (_prev_methods != NULL) { |
duke@435 | 1420 | delete _prev_methods; |
duke@435 | 1421 | _prev_methods = NULL; |
duke@435 | 1422 | } |
duke@435 | 1423 | } |
duke@435 | 1424 | |
duke@435 | 1425 | |
coleenp@4037 | 1426 | void ActiveMethodOopsCache::add_previous_version(Method* const method) { |
duke@435 | 1427 | assert(Thread::current()->is_VM_thread(), |
duke@435 | 1428 | "only VMThread can add previous versions"); |
duke@435 | 1429 | |
coleenp@4037 | 1430 | // Only append the previous method if it is executing on the stack. |
coleenp@4037 | 1431 | if (method->on_stack()) { |
coleenp@4037 | 1432 | |
duke@435 | 1433 | if (_prev_methods == NULL) { |
duke@435 | 1434 | // This is the first previous version so make some space. |
duke@435 | 1435 | // Start with 2 elements under the assumption that the class |
duke@435 | 1436 | // won't be redefined much. |
coleenp@4037 | 1437 | _prev_methods = new (ResourceObj::C_HEAP, mtClass) GrowableArray<Method*>(2, true); |
duke@435 | 1438 | } |
duke@435 | 1439 | |
duke@435 | 1440 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 1441 | RC_TRACE(0x00000100, |
duke@435 | 1442 | ("add: %s(%s): adding prev version ref for cached method @%d", |
duke@435 | 1443 | method->name()->as_C_string(), method->signature()->as_C_string(), |
duke@435 | 1444 | _prev_methods->length())); |
duke@435 | 1445 | |
coleenp@4037 | 1446 | _prev_methods->append(method); |
coleenp@4037 | 1447 | } |
duke@435 | 1448 | |
coleenp@4037 | 1449 | |
coleenp@4037 | 1450 | // Since the caller is the VMThread and we are at a safepoint, this is a good |
coleenp@4037 | 1451 | // time to clear out unused method references. |
coleenp@4037 | 1452 | |
coleenp@4037 | 1453 | if (_prev_methods == NULL) return; |
duke@435 | 1454 | |
duke@435 | 1455 | for (int i = _prev_methods->length() - 1; i >= 0; i--) { |
coleenp@4037 | 1456 | Method* method = _prev_methods->at(i); |
coleenp@4037 | 1457 | assert(method != NULL, "weak method ref was unexpectedly cleared"); |
coleenp@4037 | 1458 | |
coleenp@4037 | 1459 | if (!method->on_stack()) { |
coleenp@4037 | 1460 | // This method isn't running anymore so remove it |
duke@435 | 1461 | _prev_methods->remove_at(i); |
coleenp@4037 | 1462 | MetadataFactory::free_metadata(method->method_holder()->class_loader_data(), method); |
duke@435 | 1463 | } else { |
duke@435 | 1464 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 1465 | RC_TRACE(0x00000400, ("add: %s(%s): previous cached method @%d is alive", |
coleenp@4037 | 1466 | method->name()->as_C_string(), method->signature()->as_C_string(), i)); |
duke@435 | 1467 | } |
duke@435 | 1468 | } |
duke@435 | 1469 | } // end add_previous_version() |
duke@435 | 1470 | |
duke@435 | 1471 | |
coleenp@4037 | 1472 | bool ActiveMethodOopsCache::is_same_method(Method* const method) const { |
coleenp@4037 | 1473 | InstanceKlass* ik = InstanceKlass::cast(klass()); |
coleenp@4037 | 1474 | Method* check_method = ik->method_with_idnum(method_idnum()); |
duke@435 | 1475 | assert(check_method != NULL, "sanity check"); |
duke@435 | 1476 | if (check_method == method) { |
duke@435 | 1477 | // done with the easy case |
duke@435 | 1478 | return true; |
duke@435 | 1479 | } |
duke@435 | 1480 | |
duke@435 | 1481 | if (_prev_methods != NULL) { |
duke@435 | 1482 | // The cached method has been redefined at least once so search |
duke@435 | 1483 | // the previous versions for a match. |
duke@435 | 1484 | for (int i = 0; i < _prev_methods->length(); i++) { |
coleenp@4037 | 1485 | check_method = _prev_methods->at(i); |
duke@435 | 1486 | if (check_method == method) { |
duke@435 | 1487 | // a previous version matches |
duke@435 | 1488 | return true; |
duke@435 | 1489 | } |
duke@435 | 1490 | } |
duke@435 | 1491 | } |
duke@435 | 1492 | |
duke@435 | 1493 | // either no previous versions or no previous version matched |
duke@435 | 1494 | return false; |
duke@435 | 1495 | } |
duke@435 | 1496 | |
duke@435 | 1497 | |
coleenp@4037 | 1498 | Method* LatestMethodOopCache::get_Method() { |
coleenp@4037 | 1499 | InstanceKlass* ik = InstanceKlass::cast(klass()); |
coleenp@4037 | 1500 | Method* m = ik->method_with_idnum(method_idnum()); |
duke@435 | 1501 | assert(m != NULL, "sanity check"); |
duke@435 | 1502 | return m; |
duke@435 | 1503 | } |
duke@435 | 1504 | |
duke@435 | 1505 | |
duke@435 | 1506 | #ifdef ASSERT |
duke@435 | 1507 | // Release dummy object(s) at bottom of heap |
duke@435 | 1508 | bool Universe::release_fullgc_alot_dummy() { |
duke@435 | 1509 | MutexLocker ml(FullGCALot_lock); |
duke@435 | 1510 | if (_fullgc_alot_dummy_array != NULL) { |
duke@435 | 1511 | if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) { |
duke@435 | 1512 | // No more dummies to release, release entire array instead |
duke@435 | 1513 | _fullgc_alot_dummy_array = NULL; |
duke@435 | 1514 | return false; |
duke@435 | 1515 | } |
duke@435 | 1516 | if (!UseConcMarkSweepGC) { |
duke@435 | 1517 | // Release dummy at bottom of old generation |
duke@435 | 1518 | _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL); |
duke@435 | 1519 | } |
duke@435 | 1520 | // Release dummy at bottom of permanent generation |
duke@435 | 1521 | _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL); |
duke@435 | 1522 | } |
duke@435 | 1523 | return true; |
duke@435 | 1524 | } |
duke@435 | 1525 | |
duke@435 | 1526 | #endif // ASSERT |