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