1 /* 2 * Copyright (c) 1997, 2016, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "classfile/classLoader.hpp" 27 #include "classfile/classLoaderData.hpp" 28 #include "classfile/javaClasses.hpp" 29 #include "classfile/stringTable.hpp" 30 #include "classfile/systemDictionary.hpp" 31 #include "classfile/vmSymbols.hpp" 32 #include "code/codeCache.hpp" 33 #include "code/dependencies.hpp" 34 #include "gc/shared/cardTableModRefBS.hpp" 35 #include "gc/shared/collectedHeap.inline.hpp" 36 #include "gc/shared/gcLocker.inline.hpp" 37 #include "gc/shared/genCollectedHeap.hpp" 38 #include "gc/shared/generation.hpp" 39 #include "gc/shared/gcTraceTime.inline.hpp" 40 #include "gc/shared/space.hpp" 41 #include "interpreter/interpreter.hpp" 42 #include "logging/log.hpp" 43 #include "memory/filemap.hpp" 44 #include "memory/metadataFactory.hpp" 45 #include "memory/metaspaceShared.hpp" 46 #include "memory/oopFactory.hpp" 47 #include "memory/resourceArea.hpp" 48 #include "memory/universe.hpp" 49 #include "memory/universe.inline.hpp" 50 #include "oops/constantPool.hpp" 51 #include "oops/instanceClassLoaderKlass.hpp" 52 #include "oops/instanceKlass.hpp" 53 #include "oops/instanceMirrorKlass.hpp" 54 #include "oops/instanceRefKlass.hpp" 55 #include "oops/objArrayOop.inline.hpp" 56 #include "oops/oop.inline.hpp" 57 #include "oops/typeArrayKlass.hpp" 58 #include "prims/jvmtiRedefineClassesTrace.hpp" 59 #include "runtime/arguments.hpp" 60 #include "runtime/atomic.inline.hpp" 61 #include "runtime/commandLineFlagConstraintList.hpp" 62 #include "runtime/deoptimization.hpp" 63 #include "runtime/fprofiler.hpp" 64 #include "runtime/handles.inline.hpp" 65 #include "runtime/init.hpp" 66 #include "runtime/java.hpp" 67 #include "runtime/javaCalls.hpp" 68 #include "runtime/sharedRuntime.hpp" 69 #include "runtime/synchronizer.hpp" 70 #include "runtime/thread.inline.hpp" 71 #include "runtime/timerTrace.hpp" 72 #include "runtime/vm_operations.hpp" 73 #include "services/memoryService.hpp" 74 #include "utilities/copy.hpp" 75 #include "utilities/events.hpp" 76 #include "utilities/hashtable.inline.hpp" 77 #include "utilities/macros.hpp" 78 #include "utilities/ostream.hpp" 79 #include "utilities/preserveException.hpp" 80 #if INCLUDE_ALL_GCS 81 #include "gc/cms/cmsCollectorPolicy.hpp" 82 #include "gc/g1/g1CollectedHeap.inline.hpp" 83 #include "gc/g1/g1CollectorPolicy.hpp" 84 #include "gc/parallel/parallelScavengeHeap.hpp" 85 #include "gc/shared/adaptiveSizePolicy.hpp" 86 #endif // INCLUDE_ALL_GCS 87 #if INCLUDE_CDS 88 #include "classfile/sharedClassUtil.hpp" 89 #endif 90 91 // Known objects 92 Klass* Universe::_boolArrayKlassObj = NULL; 93 Klass* Universe::_byteArrayKlassObj = NULL; 94 Klass* Universe::_charArrayKlassObj = NULL; 95 Klass* Universe::_intArrayKlassObj = NULL; 96 Klass* Universe::_shortArrayKlassObj = NULL; 97 Klass* Universe::_longArrayKlassObj = NULL; 98 Klass* Universe::_singleArrayKlassObj = NULL; 99 Klass* Universe::_doubleArrayKlassObj = NULL; 100 Klass* Universe::_typeArrayKlassObjs[T_VOID+1] = { NULL /*, NULL...*/ }; 101 Klass* Universe::_objectArrayKlassObj = NULL; 102 oop Universe::_int_mirror = NULL; 103 oop Universe::_float_mirror = NULL; 104 oop Universe::_double_mirror = NULL; 105 oop Universe::_byte_mirror = NULL; 106 oop Universe::_bool_mirror = NULL; 107 oop Universe::_char_mirror = NULL; 108 oop Universe::_long_mirror = NULL; 109 oop Universe::_short_mirror = NULL; 110 oop Universe::_void_mirror = NULL; 111 oop Universe::_mirrors[T_VOID+1] = { NULL /*, NULL...*/ }; 112 oop Universe::_main_thread_group = NULL; 113 oop Universe::_system_thread_group = NULL; 114 objArrayOop Universe::_the_empty_class_klass_array = NULL; 115 Array<Klass*>* Universe::_the_array_interfaces_array = NULL; 116 oop Universe::_the_null_string = NULL; 117 oop Universe::_the_min_jint_string = NULL; 118 LatestMethodCache* Universe::_finalizer_register_cache = NULL; 119 LatestMethodCache* Universe::_loader_addClass_cache = NULL; 120 LatestMethodCache* Universe::_pd_implies_cache = NULL; 121 LatestMethodCache* Universe::_throw_illegal_access_error_cache = NULL; 122 LatestMethodCache* Universe::_do_stack_walk_cache = NULL; 123 oop Universe::_out_of_memory_error_java_heap = NULL; 124 oop Universe::_out_of_memory_error_metaspace = NULL; 125 oop Universe::_out_of_memory_error_class_metaspace = NULL; 126 oop Universe::_out_of_memory_error_array_size = NULL; 127 oop Universe::_out_of_memory_error_gc_overhead_limit = NULL; 128 oop Universe::_out_of_memory_error_realloc_objects = NULL; 129 oop Universe::_delayed_stack_overflow_error_message = NULL; 130 objArrayOop Universe::_preallocated_out_of_memory_error_array = NULL; 131 volatile jint Universe::_preallocated_out_of_memory_error_avail_count = 0; 132 bool Universe::_verify_in_progress = false; 133 long Universe::verify_flags = Universe::Verify_All; 134 oop Universe::_null_ptr_exception_instance = NULL; 135 oop Universe::_arithmetic_exception_instance = NULL; 136 oop Universe::_virtual_machine_error_instance = NULL; 137 oop Universe::_vm_exception = NULL; 138 oop Universe::_allocation_context_notification_obj = NULL; 139 140 Array<int>* Universe::_the_empty_int_array = NULL; 141 Array<u2>* Universe::_the_empty_short_array = NULL; 142 Array<Klass*>* Universe::_the_empty_klass_array = NULL; 143 Array<Method*>* Universe::_the_empty_method_array = NULL; 144 145 // These variables are guarded by FullGCALot_lock. 146 debug_only(objArrayOop Universe::_fullgc_alot_dummy_array = NULL;) 147 debug_only(int Universe::_fullgc_alot_dummy_next = 0;) 148 149 // Heap 150 int Universe::_verify_count = 0; 151 152 // Oop verification (see MacroAssembler::verify_oop) 153 uintptr_t Universe::_verify_oop_mask = 0; 154 uintptr_t Universe::_verify_oop_bits = (uintptr_t) -1; 155 156 int Universe::_base_vtable_size = 0; 157 bool Universe::_bootstrapping = false; 158 bool Universe::_module_initialized = false; 159 bool Universe::_fully_initialized = false; 160 161 size_t Universe::_heap_capacity_at_last_gc; 162 size_t Universe::_heap_used_at_last_gc = 0; 163 164 CollectedHeap* Universe::_collectedHeap = NULL; 165 166 NarrowPtrStruct Universe::_narrow_oop = { NULL, 0, true }; 167 NarrowPtrStruct Universe::_narrow_klass = { NULL, 0, true }; 168 address Universe::_narrow_ptrs_base; 169 170 void Universe::basic_type_classes_do(void f(Klass*)) { 171 f(boolArrayKlassObj()); 172 f(byteArrayKlassObj()); 173 f(charArrayKlassObj()); 174 f(intArrayKlassObj()); 175 f(shortArrayKlassObj()); 176 f(longArrayKlassObj()); 177 f(singleArrayKlassObj()); 178 f(doubleArrayKlassObj()); 179 } 180 181 void Universe::oops_do(OopClosure* f, bool do_all) { 182 183 f->do_oop((oop*) &_int_mirror); 184 f->do_oop((oop*) &_float_mirror); 185 f->do_oop((oop*) &_double_mirror); 186 f->do_oop((oop*) &_byte_mirror); 187 f->do_oop((oop*) &_bool_mirror); 188 f->do_oop((oop*) &_char_mirror); 189 f->do_oop((oop*) &_long_mirror); 190 f->do_oop((oop*) &_short_mirror); 191 f->do_oop((oop*) &_void_mirror); 192 193 for (int i = T_BOOLEAN; i < T_VOID+1; i++) { 194 f->do_oop((oop*) &_mirrors[i]); 195 } 196 assert(_mirrors[0] == NULL && _mirrors[T_BOOLEAN - 1] == NULL, "checking"); 197 198 f->do_oop((oop*)&_the_empty_class_klass_array); 199 f->do_oop((oop*)&_the_null_string); 200 f->do_oop((oop*)&_the_min_jint_string); 201 f->do_oop((oop*)&_out_of_memory_error_java_heap); 202 f->do_oop((oop*)&_out_of_memory_error_metaspace); 203 f->do_oop((oop*)&_out_of_memory_error_class_metaspace); 204 f->do_oop((oop*)&_out_of_memory_error_array_size); 205 f->do_oop((oop*)&_out_of_memory_error_gc_overhead_limit); 206 f->do_oop((oop*)&_out_of_memory_error_realloc_objects); 207 f->do_oop((oop*)&_delayed_stack_overflow_error_message); 208 f->do_oop((oop*)&_preallocated_out_of_memory_error_array); 209 f->do_oop((oop*)&_null_ptr_exception_instance); 210 f->do_oop((oop*)&_arithmetic_exception_instance); 211 f->do_oop((oop*)&_virtual_machine_error_instance); 212 f->do_oop((oop*)&_main_thread_group); 213 f->do_oop((oop*)&_system_thread_group); 214 f->do_oop((oop*)&_vm_exception); 215 f->do_oop((oop*)&_allocation_context_notification_obj); 216 debug_only(f->do_oop((oop*)&_fullgc_alot_dummy_array);) 217 } 218 219 // Serialize metadata in and out of CDS archive, not oops. 220 void Universe::serialize(SerializeClosure* f, bool do_all) { 221 222 f->do_ptr((void**)&_boolArrayKlassObj); 223 f->do_ptr((void**)&_byteArrayKlassObj); 224 f->do_ptr((void**)&_charArrayKlassObj); 225 f->do_ptr((void**)&_intArrayKlassObj); 226 f->do_ptr((void**)&_shortArrayKlassObj); 227 f->do_ptr((void**)&_longArrayKlassObj); 228 f->do_ptr((void**)&_singleArrayKlassObj); 229 f->do_ptr((void**)&_doubleArrayKlassObj); 230 f->do_ptr((void**)&_objectArrayKlassObj); 231 232 { 233 for (int i = 0; i < T_VOID+1; i++) { 234 if (_typeArrayKlassObjs[i] != NULL) { 235 assert(i >= T_BOOLEAN, "checking"); 236 f->do_ptr((void**)&_typeArrayKlassObjs[i]); 237 } else if (do_all) { 238 f->do_ptr((void**)&_typeArrayKlassObjs[i]); 239 } 240 } 241 } 242 243 f->do_ptr((void**)&_the_array_interfaces_array); 244 f->do_ptr((void**)&_the_empty_int_array); 245 f->do_ptr((void**)&_the_empty_short_array); 246 f->do_ptr((void**)&_the_empty_method_array); 247 f->do_ptr((void**)&_the_empty_klass_array); 248 _finalizer_register_cache->serialize(f); 249 _loader_addClass_cache->serialize(f); 250 _pd_implies_cache->serialize(f); 251 _throw_illegal_access_error_cache->serialize(f); 252 _do_stack_walk_cache->serialize(f); 253 } 254 255 void Universe::check_alignment(uintx size, uintx alignment, const char* name) { 256 if (size < alignment || size % alignment != 0) { 257 vm_exit_during_initialization( 258 err_msg("Size of %s (" UINTX_FORMAT " bytes) must be aligned to " UINTX_FORMAT " bytes", name, size, alignment)); 259 } 260 } 261 262 void initialize_basic_type_klass(Klass* k, TRAPS) { 263 Klass* ok = SystemDictionary::Object_klass(); 264 if (UseSharedSpaces) { 265 ClassLoaderData* loader_data = ClassLoaderData::the_null_class_loader_data(); 266 assert(k->super() == ok, "u3"); 267 k->restore_unshareable_info(loader_data, Handle(), CHECK); 268 } else { 269 k->initialize_supers(ok, CHECK); 270 } 271 k->append_to_sibling_list(); 272 } 273 274 void Universe::genesis(TRAPS) { 275 ResourceMark rm; 276 277 { FlagSetting fs(_bootstrapping, true); 278 279 { MutexLocker mc(Compile_lock); 280 281 // determine base vtable size; without that we cannot create the array klasses 282 compute_base_vtable_size(); 283 284 if (!UseSharedSpaces) { 285 _boolArrayKlassObj = TypeArrayKlass::create_klass(T_BOOLEAN, sizeof(jboolean), CHECK); 286 _charArrayKlassObj = TypeArrayKlass::create_klass(T_CHAR, sizeof(jchar), CHECK); 287 _singleArrayKlassObj = TypeArrayKlass::create_klass(T_FLOAT, sizeof(jfloat), CHECK); 288 _doubleArrayKlassObj = TypeArrayKlass::create_klass(T_DOUBLE, sizeof(jdouble), CHECK); 289 _byteArrayKlassObj = TypeArrayKlass::create_klass(T_BYTE, sizeof(jbyte), CHECK); 290 _shortArrayKlassObj = TypeArrayKlass::create_klass(T_SHORT, sizeof(jshort), CHECK); 291 _intArrayKlassObj = TypeArrayKlass::create_klass(T_INT, sizeof(jint), CHECK); 292 _longArrayKlassObj = TypeArrayKlass::create_klass(T_LONG, sizeof(jlong), CHECK); 293 294 _typeArrayKlassObjs[T_BOOLEAN] = _boolArrayKlassObj; 295 _typeArrayKlassObjs[T_CHAR] = _charArrayKlassObj; 296 _typeArrayKlassObjs[T_FLOAT] = _singleArrayKlassObj; 297 _typeArrayKlassObjs[T_DOUBLE] = _doubleArrayKlassObj; 298 _typeArrayKlassObjs[T_BYTE] = _byteArrayKlassObj; 299 _typeArrayKlassObjs[T_SHORT] = _shortArrayKlassObj; 300 _typeArrayKlassObjs[T_INT] = _intArrayKlassObj; 301 _typeArrayKlassObjs[T_LONG] = _longArrayKlassObj; 302 303 ClassLoaderData* null_cld = ClassLoaderData::the_null_class_loader_data(); 304 305 _the_array_interfaces_array = MetadataFactory::new_array<Klass*>(null_cld, 2, NULL, CHECK); 306 _the_empty_int_array = MetadataFactory::new_array<int>(null_cld, 0, CHECK); 307 _the_empty_short_array = MetadataFactory::new_array<u2>(null_cld, 0, CHECK); 308 _the_empty_method_array = MetadataFactory::new_array<Method*>(null_cld, 0, CHECK); 309 _the_empty_klass_array = MetadataFactory::new_array<Klass*>(null_cld, 0, CHECK); 310 } 311 } 312 313 vmSymbols::initialize(CHECK); 314 315 SystemDictionary::initialize(CHECK); 316 317 Klass* ok = SystemDictionary::Object_klass(); 318 319 _the_null_string = StringTable::intern("null", CHECK); 320 _the_min_jint_string = StringTable::intern("-2147483648", CHECK); 321 322 if (UseSharedSpaces) { 323 // Verify shared interfaces array. 324 assert(_the_array_interfaces_array->at(0) == 325 SystemDictionary::Cloneable_klass(), "u3"); 326 assert(_the_array_interfaces_array->at(1) == 327 SystemDictionary::Serializable_klass(), "u3"); 328 MetaspaceShared::fixup_shared_string_regions(); 329 } else { 330 // Set up shared interfaces array. (Do this before supers are set up.) 331 _the_array_interfaces_array->at_put(0, SystemDictionary::Cloneable_klass()); 332 _the_array_interfaces_array->at_put(1, SystemDictionary::Serializable_klass()); 333 } 334 335 initialize_basic_type_klass(boolArrayKlassObj(), CHECK); 336 initialize_basic_type_klass(charArrayKlassObj(), CHECK); 337 initialize_basic_type_klass(singleArrayKlassObj(), CHECK); 338 initialize_basic_type_klass(doubleArrayKlassObj(), CHECK); 339 initialize_basic_type_klass(byteArrayKlassObj(), CHECK); 340 initialize_basic_type_klass(shortArrayKlassObj(), CHECK); 341 initialize_basic_type_klass(intArrayKlassObj(), CHECK); 342 initialize_basic_type_klass(longArrayKlassObj(), CHECK); 343 } // end of core bootstrapping 344 345 // Maybe this could be lifted up now that object array can be initialized 346 // during the bootstrapping. 347 348 // OLD 349 // Initialize _objectArrayKlass after core bootstraping to make 350 // sure the super class is set up properly for _objectArrayKlass. 351 // --- 352 // NEW 353 // Since some of the old system object arrays have been converted to 354 // ordinary object arrays, _objectArrayKlass will be loaded when 355 // SystemDictionary::initialize(CHECK); is run. See the extra check 356 // for Object_klass_loaded in objArrayKlassKlass::allocate_objArray_klass_impl. 357 _objectArrayKlassObj = InstanceKlass:: 358 cast(SystemDictionary::Object_klass())->array_klass(1, CHECK); 359 // OLD 360 // Add the class to the class hierarchy manually to make sure that 361 // its vtable is initialized after core bootstrapping is completed. 362 // --- 363 // New 364 // Have already been initialized. 365 _objectArrayKlassObj->append_to_sibling_list(); 366 367 #ifdef ASSERT 368 if (FullGCALot) { 369 // Allocate an array of dummy objects. 370 // We'd like these to be at the bottom of the old generation, 371 // so that when we free one and then collect, 372 // (almost) the whole heap moves 373 // and we find out if we actually update all the oops correctly. 374 // But we can't allocate directly in the old generation, 375 // so we allocate wherever, and hope that the first collection 376 // moves these objects to the bottom of the old generation. 377 // We can allocate directly in the permanent generation, so we do. 378 int size; 379 if (UseConcMarkSweepGC) { 380 log_warning(gc)("Using +FullGCALot with concurrent mark sweep gc will not force all objects to relocate"); 381 size = FullGCALotDummies; 382 } else { 383 size = FullGCALotDummies * 2; 384 } 385 objArrayOop naked_array = oopFactory::new_objArray(SystemDictionary::Object_klass(), size, CHECK); 386 objArrayHandle dummy_array(THREAD, naked_array); 387 int i = 0; 388 while (i < size) { 389 // Allocate dummy in old generation 390 oop dummy = SystemDictionary::Object_klass()->allocate_instance(CHECK); 391 dummy_array->obj_at_put(i++, dummy); 392 } 393 { 394 // Only modify the global variable inside the mutex. 395 // If we had a race to here, the other dummy_array instances 396 // and their elements just get dropped on the floor, which is fine. 397 MutexLocker ml(FullGCALot_lock); 398 if (_fullgc_alot_dummy_array == NULL) { 399 _fullgc_alot_dummy_array = dummy_array(); 400 } 401 } 402 assert(i == _fullgc_alot_dummy_array->length(), "just checking"); 403 } 404 #endif 405 406 // Initialize dependency array for null class loader 407 ClassLoaderData::the_null_class_loader_data()->init_dependencies(CHECK); 408 409 } 410 411 // CDS support for patching vtables in metadata in the shared archive. 412 // All types inherited from Metadata have vtables, but not types inherited 413 // from MetaspaceObj, because the latter does not have virtual functions. 414 // If the metadata type has a vtable, it cannot be shared in the read-only 415 // section of the CDS archive, because the vtable pointer is patched. 416 static inline void add_vtable(void** list, int* n, void* o, int count) { 417 guarantee((*n) < count, "vtable list too small"); 418 void* vtable = dereference_vptr(o); 419 assert(*(void**)(vtable) != NULL, "invalid vtable"); 420 list[(*n)++] = vtable; 421 } 422 423 void Universe::init_self_patching_vtbl_list(void** list, int count) { 424 int n = 0; 425 { InstanceKlass o; add_vtable(list, &n, &o, count); } 426 { InstanceClassLoaderKlass o; add_vtable(list, &n, &o, count); } 427 { InstanceMirrorKlass o; add_vtable(list, &n, &o, count); } 428 { InstanceRefKlass o; add_vtable(list, &n, &o, count); } 429 { TypeArrayKlass o; add_vtable(list, &n, &o, count); } 430 { ObjArrayKlass o; add_vtable(list, &n, &o, count); } 431 { Method o; add_vtable(list, &n, &o, count); } 432 { ConstantPool o; add_vtable(list, &n, &o, count); } 433 } 434 435 void Universe::initialize_basic_type_mirrors(TRAPS) { 436 assert(_int_mirror==NULL, "basic type mirrors already initialized"); 437 _int_mirror = 438 java_lang_Class::create_basic_type_mirror("int", T_INT, CHECK); 439 _float_mirror = 440 java_lang_Class::create_basic_type_mirror("float", T_FLOAT, CHECK); 441 _double_mirror = 442 java_lang_Class::create_basic_type_mirror("double", T_DOUBLE, CHECK); 443 _byte_mirror = 444 java_lang_Class::create_basic_type_mirror("byte", T_BYTE, CHECK); 445 _bool_mirror = 446 java_lang_Class::create_basic_type_mirror("boolean",T_BOOLEAN, CHECK); 447 _char_mirror = 448 java_lang_Class::create_basic_type_mirror("char", T_CHAR, CHECK); 449 _long_mirror = 450 java_lang_Class::create_basic_type_mirror("long", T_LONG, CHECK); 451 _short_mirror = 452 java_lang_Class::create_basic_type_mirror("short", T_SHORT, CHECK); 453 _void_mirror = 454 java_lang_Class::create_basic_type_mirror("void", T_VOID, CHECK); 455 456 _mirrors[T_INT] = _int_mirror; 457 _mirrors[T_FLOAT] = _float_mirror; 458 _mirrors[T_DOUBLE] = _double_mirror; 459 _mirrors[T_BYTE] = _byte_mirror; 460 _mirrors[T_BOOLEAN] = _bool_mirror; 461 _mirrors[T_CHAR] = _char_mirror; 462 _mirrors[T_LONG] = _long_mirror; 463 _mirrors[T_SHORT] = _short_mirror; 464 _mirrors[T_VOID] = _void_mirror; 465 //_mirrors[T_OBJECT] = _object_klass->java_mirror(); 466 //_mirrors[T_ARRAY] = _object_klass->java_mirror(); 467 } 468 469 void Universe::fixup_mirrors(TRAPS) { 470 // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly, 471 // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply 472 // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note 473 // that the number of objects allocated at this point is very small. 474 assert(SystemDictionary::Class_klass_loaded(), "java.lang.Class should be loaded"); 475 HandleMark hm(THREAD); 476 // Cache the start of the static fields 477 InstanceMirrorKlass::init_offset_of_static_fields(); 478 479 GrowableArray <Klass*>* list = java_lang_Class::fixup_mirror_list(); 480 int list_length = list->length(); 481 for (int i = 0; i < list_length; i++) { 482 Klass* k = list->at(i); 483 assert(k->is_klass(), "List should only hold classes"); 484 EXCEPTION_MARK; 485 KlassHandle kh(THREAD, k); 486 java_lang_Class::fixup_mirror(kh, CATCH); 487 } 488 delete java_lang_Class::fixup_mirror_list(); 489 java_lang_Class::set_fixup_mirror_list(NULL); 490 } 491 492 static bool has_run_finalizers_on_exit = false; 493 494 void Universe::run_finalizers_on_exit() { 495 if (has_run_finalizers_on_exit) return; 496 has_run_finalizers_on_exit = true; 497 498 // Called on VM exit. This ought to be run in a separate thread. 499 log_trace(ref)("Callback to run finalizers on exit"); 500 { 501 PRESERVE_EXCEPTION_MARK; 502 KlassHandle finalizer_klass(THREAD, SystemDictionary::Finalizer_klass()); 503 JavaValue result(T_VOID); 504 JavaCalls::call_static( 505 &result, 506 finalizer_klass, 507 vmSymbols::run_finalizers_on_exit_name(), 508 vmSymbols::void_method_signature(), 509 THREAD 510 ); 511 // Ignore any pending exceptions 512 CLEAR_PENDING_EXCEPTION; 513 } 514 } 515 516 517 // initialize_vtable could cause gc if 518 // 1) we specified true to initialize_vtable and 519 // 2) this ran after gc was enabled 520 // In case those ever change we use handles for oops 521 void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) { 522 // init vtable of k and all subclasses 523 Klass* ko = k_h(); 524 klassVtable* vt = ko->vtable(); 525 if (vt) vt->initialize_vtable(false, CHECK); 526 if (ko->is_instance_klass()) { 527 for (KlassHandle s_h(THREAD, ko->subklass()); 528 s_h() != NULL; 529 s_h = KlassHandle(THREAD, s_h()->next_sibling())) { 530 reinitialize_vtable_of(s_h, CHECK); 531 } 532 } 533 } 534 535 536 void initialize_itable_for_klass(Klass* k, TRAPS) { 537 InstanceKlass::cast(k)->itable()->initialize_itable(false, CHECK); 538 } 539 540 541 void Universe::reinitialize_itables(TRAPS) { 542 SystemDictionary::classes_do(initialize_itable_for_klass, CHECK); 543 544 } 545 546 547 bool Universe::on_page_boundary(void* addr) { 548 return ((uintptr_t) addr) % os::vm_page_size() == 0; 549 } 550 551 552 bool Universe::should_fill_in_stack_trace(Handle throwable) { 553 // never attempt to fill in the stack trace of preallocated errors that do not have 554 // backtrace. These errors are kept alive forever and may be "re-used" when all 555 // preallocated errors with backtrace have been consumed. Also need to avoid 556 // a potential loop which could happen if an out of memory occurs when attempting 557 // to allocate the backtrace. 558 return ((throwable() != Universe::_out_of_memory_error_java_heap) && 559 (throwable() != Universe::_out_of_memory_error_metaspace) && 560 (throwable() != Universe::_out_of_memory_error_class_metaspace) && 561 (throwable() != Universe::_out_of_memory_error_array_size) && 562 (throwable() != Universe::_out_of_memory_error_gc_overhead_limit) && 563 (throwable() != Universe::_out_of_memory_error_realloc_objects)); 564 } 565 566 567 oop Universe::gen_out_of_memory_error(oop default_err) { 568 // generate an out of memory error: 569 // - if there is a preallocated error with backtrace available then return it wth 570 // a filled in stack trace. 571 // - if there are no preallocated errors with backtrace available then return 572 // an error without backtrace. 573 int next; 574 if (_preallocated_out_of_memory_error_avail_count > 0) { 575 next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count); 576 assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt"); 577 } else { 578 next = -1; 579 } 580 if (next < 0) { 581 // all preallocated errors have been used. 582 // return default 583 return default_err; 584 } else { 585 // get the error object at the slot and set set it to NULL so that the 586 // array isn't keeping it alive anymore. 587 oop exc = preallocated_out_of_memory_errors()->obj_at(next); 588 assert(exc != NULL, "slot has been used already"); 589 preallocated_out_of_memory_errors()->obj_at_put(next, NULL); 590 591 // use the message from the default error 592 oop msg = java_lang_Throwable::message(default_err); 593 assert(msg != NULL, "no message"); 594 java_lang_Throwable::set_message(exc, msg); 595 596 // populate the stack trace and return it. 597 java_lang_Throwable::fill_in_stack_trace_of_preallocated_backtrace(exc); 598 return exc; 599 } 600 } 601 602 intptr_t Universe::_non_oop_bits = 0; 603 604 void* Universe::non_oop_word() { 605 // Neither the high bits nor the low bits of this value is allowed 606 // to look like (respectively) the high or low bits of a real oop. 607 // 608 // High and low are CPU-specific notions, but low always includes 609 // the low-order bit. Since oops are always aligned at least mod 4, 610 // setting the low-order bit will ensure that the low half of the 611 // word will never look like that of a real oop. 612 // 613 // Using the OS-supplied non-memory-address word (usually 0 or -1) 614 // will take care of the high bits, however many there are. 615 616 if (_non_oop_bits == 0) { 617 _non_oop_bits = (intptr_t)os::non_memory_address_word() | 1; 618 } 619 620 return (void*)_non_oop_bits; 621 } 622 623 jint universe_init() { 624 assert(!Universe::_fully_initialized, "called after initialize_vtables"); 625 guarantee(1 << LogHeapWordSize == sizeof(HeapWord), 626 "LogHeapWordSize is incorrect."); 627 guarantee(sizeof(oop) >= sizeof(HeapWord), "HeapWord larger than oop?"); 628 guarantee(sizeof(oop) % sizeof(HeapWord) == 0, 629 "oop size is not not a multiple of HeapWord size"); 630 631 TraceTime timer("Genesis", TRACETIME_LOG(Info, startuptime)); 632 633 JavaClasses::compute_hard_coded_offsets(); 634 635 jint status = Universe::initialize_heap(); 636 if (status != JNI_OK) { 637 return status; 638 } 639 640 Metaspace::global_initialize(); 641 642 // Checks 'AfterMemoryInit' constraints. 643 if (!CommandLineFlagConstraintList::check_constraints(CommandLineFlagConstraint::AfterMemoryInit)) { 644 return JNI_EINVAL; 645 } 646 647 // Create memory for metadata. Must be after initializing heap for 648 // DumpSharedSpaces. 649 ClassLoaderData::init_null_class_loader_data(); 650 651 // We have a heap so create the Method* caches before 652 // Metaspace::initialize_shared_spaces() tries to populate them. 653 Universe::_finalizer_register_cache = new LatestMethodCache(); 654 Universe::_loader_addClass_cache = new LatestMethodCache(); 655 Universe::_pd_implies_cache = new LatestMethodCache(); 656 Universe::_throw_illegal_access_error_cache = new LatestMethodCache(); 657 Universe::_do_stack_walk_cache = new LatestMethodCache(); 658 659 if (UseSharedSpaces) { 660 // Read the data structures supporting the shared spaces (shared 661 // system dictionary, symbol table, etc.). After that, access to 662 // the file (other than the mapped regions) is no longer needed, and 663 // the file is closed. Closing the file does not affect the 664 // currently mapped regions. 665 MetaspaceShared::initialize_shared_spaces(); 666 StringTable::create_table(); 667 } else { 668 SymbolTable::create_table(); 669 StringTable::create_table(); 670 671 if (DumpSharedSpaces) { 672 MetaspaceShared::prepare_for_dumping(); 673 } 674 } 675 if (strlen(VerifySubSet) > 0) { 676 Universe::initialize_verify_flags(); 677 } 678 679 return JNI_OK; 680 } 681 682 CollectedHeap* Universe::create_heap() { 683 assert(_collectedHeap == NULL, "Heap already created"); 684 #if !INCLUDE_ALL_GCS 685 if (UseParallelGC) { 686 fatal("UseParallelGC not supported in this VM."); 687 } else if (UseG1GC) { 688 fatal("UseG1GC not supported in this VM."); 689 } else if (UseConcMarkSweepGC) { 690 fatal("UseConcMarkSweepGC not supported in this VM."); 691 #else 692 if (UseParallelGC) { 693 return Universe::create_heap_with_policy<ParallelScavengeHeap, GenerationSizer>(); 694 } else if (UseG1GC) { 695 return Universe::create_heap_with_policy<G1CollectedHeap, G1CollectorPolicy>(); 696 } else if (UseConcMarkSweepGC) { 697 return Universe::create_heap_with_policy<GenCollectedHeap, ConcurrentMarkSweepPolicy>(); 698 #endif 699 } else if (UseSerialGC) { 700 return Universe::create_heap_with_policy<GenCollectedHeap, MarkSweepPolicy>(); 701 } 702 703 ShouldNotReachHere(); 704 return NULL; 705 } 706 707 // Choose the heap base address and oop encoding mode 708 // when compressed oops are used: 709 // Unscaled - Use 32-bits oops without encoding when 710 // NarrowOopHeapBaseMin + heap_size < 4Gb 711 // ZeroBased - Use zero based compressed oops with encoding when 712 // NarrowOopHeapBaseMin + heap_size < 32Gb 713 // HeapBased - Use compressed oops with heap base + encoding. 714 715 jint Universe::initialize_heap() { 716 jint status = JNI_ERR; 717 718 _collectedHeap = create_heap_ext(); 719 if (_collectedHeap == NULL) { 720 _collectedHeap = create_heap(); 721 } 722 723 status = _collectedHeap->initialize(); 724 if (status != JNI_OK) { 725 return status; 726 } 727 log_info(gc)("Using %s", _collectedHeap->name()); 728 729 ThreadLocalAllocBuffer::set_max_size(Universe::heap()->max_tlab_size()); 730 731 #ifdef _LP64 732 if (UseCompressedOops) { 733 // Subtract a page because something can get allocated at heap base. 734 // This also makes implicit null checking work, because the 735 // memory+1 page below heap_base needs to cause a signal. 736 // See needs_explicit_null_check. 737 // Only set the heap base for compressed oops because it indicates 738 // compressed oops for pstack code. 739 if ((uint64_t)Universe::heap()->reserved_region().end() > UnscaledOopHeapMax) { 740 // Didn't reserve heap below 4Gb. Must shift. 741 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); 742 } 743 if ((uint64_t)Universe::heap()->reserved_region().end() <= OopEncodingHeapMax) { 744 // Did reserve heap below 32Gb. Can use base == 0; 745 Universe::set_narrow_oop_base(0); 746 } 747 748 Universe::set_narrow_ptrs_base(Universe::narrow_oop_base()); 749 750 if (log_is_enabled(Info, gc, heap, coops)) { 751 ResourceMark rm; 752 outputStream* logst = Log(gc, heap, coops)::info_stream(); 753 Universe::print_compressed_oops_mode(logst); 754 } 755 756 // Tell tests in which mode we run. 757 Arguments::PropertyList_add(new SystemProperty("java.vm.compressedOopsMode", 758 narrow_oop_mode_to_string(narrow_oop_mode()), 759 false)); 760 } 761 // Universe::narrow_oop_base() is one page below the heap. 762 assert((intptr_t)Universe::narrow_oop_base() <= (intptr_t)(Universe::heap()->base() - 763 os::vm_page_size()) || 764 Universe::narrow_oop_base() == NULL, "invalid value"); 765 assert(Universe::narrow_oop_shift() == LogMinObjAlignmentInBytes || 766 Universe::narrow_oop_shift() == 0, "invalid value"); 767 #endif 768 769 // We will never reach the CATCH below since Exceptions::_throw will cause 770 // the VM to exit if an exception is thrown during initialization 771 772 if (UseTLAB) { 773 assert(Universe::heap()->supports_tlab_allocation(), 774 "Should support thread-local allocation buffers"); 775 ThreadLocalAllocBuffer::startup_initialization(); 776 } 777 return JNI_OK; 778 } 779 780 void Universe::print_compressed_oops_mode(outputStream* st) { 781 st->print("Heap address: " PTR_FORMAT ", size: " SIZE_FORMAT " MB", 782 p2i(Universe::heap()->base()), Universe::heap()->reserved_region().byte_size()/M); 783 784 st->print(", Compressed Oops mode: %s", narrow_oop_mode_to_string(narrow_oop_mode())); 785 786 if (Universe::narrow_oop_base() != 0) { 787 st->print(": " PTR_FORMAT, p2i(Universe::narrow_oop_base())); 788 } 789 790 if (Universe::narrow_oop_shift() != 0) { 791 st->print(", Oop shift amount: %d", Universe::narrow_oop_shift()); 792 } 793 794 if (!Universe::narrow_oop_use_implicit_null_checks()) { 795 st->print(", no protected page in front of the heap"); 796 } 797 st->cr(); 798 } 799 800 ReservedSpace Universe::reserve_heap(size_t heap_size, size_t alignment) { 801 802 assert(alignment <= Arguments::conservative_max_heap_alignment(), 803 "actual alignment " SIZE_FORMAT " must be within maximum heap alignment " SIZE_FORMAT, 804 alignment, Arguments::conservative_max_heap_alignment()); 805 806 size_t total_reserved = align_size_up(heap_size, alignment); 807 assert(!UseCompressedOops || (total_reserved <= (OopEncodingHeapMax - os::vm_page_size())), 808 "heap size is too big for compressed oops"); 809 810 bool use_large_pages = UseLargePages && is_size_aligned(alignment, os::large_page_size()); 811 assert(!UseLargePages 812 || UseParallelGC 813 || use_large_pages, "Wrong alignment to use large pages"); 814 815 // Now create the space. 816 ReservedHeapSpace total_rs(total_reserved, alignment, use_large_pages); 817 818 if (total_rs.is_reserved()) { 819 assert((total_reserved == total_rs.size()) && ((uintptr_t)total_rs.base() % alignment == 0), 820 "must be exactly of required size and alignment"); 821 // We are good. 822 823 if (UseCompressedOops) { 824 // Universe::initialize_heap() will reset this to NULL if unscaled 825 // or zero-based narrow oops are actually used. 826 // Else heap start and base MUST differ, so that NULL can be encoded nonambigous. 827 Universe::set_narrow_oop_base((address)total_rs.compressed_oop_base()); 828 } 829 830 return total_rs; 831 } 832 833 vm_exit_during_initialization( 834 err_msg("Could not reserve enough space for " SIZE_FORMAT "KB object heap", 835 total_reserved/K)); 836 837 // satisfy compiler 838 ShouldNotReachHere(); 839 return ReservedHeapSpace(0, 0, false); 840 } 841 842 843 // It's the caller's responsibility to ensure glitch-freedom 844 // (if required). 845 void Universe::update_heap_info_at_gc() { 846 _heap_capacity_at_last_gc = heap()->capacity(); 847 _heap_used_at_last_gc = heap()->used(); 848 } 849 850 851 const char* Universe::narrow_oop_mode_to_string(Universe::NARROW_OOP_MODE mode) { 852 switch (mode) { 853 case UnscaledNarrowOop: 854 return "32-bit"; 855 case ZeroBasedNarrowOop: 856 return "Zero based"; 857 case DisjointBaseNarrowOop: 858 return "Non-zero disjoint base"; 859 case HeapBasedNarrowOop: 860 return "Non-zero based"; 861 } 862 863 ShouldNotReachHere(); 864 return ""; 865 } 866 867 868 Universe::NARROW_OOP_MODE Universe::narrow_oop_mode() { 869 if (narrow_oop_base_disjoint()) { 870 return DisjointBaseNarrowOop; 871 } 872 873 if (narrow_oop_base() != 0) { 874 return HeapBasedNarrowOop; 875 } 876 877 if (narrow_oop_shift() != 0) { 878 return ZeroBasedNarrowOop; 879 } 880 881 return UnscaledNarrowOop; 882 } 883 884 void initialize_known_method(LatestMethodCache* method_cache, 885 InstanceKlass* ik, 886 const char* method, 887 Symbol* signature, 888 bool is_static, TRAPS) 889 { 890 TempNewSymbol name = SymbolTable::new_symbol(method, CHECK); 891 Method* m = NULL; 892 // The klass must be linked before looking up the method. 893 if (!ik->link_class_or_fail(THREAD) || 894 ((m = ik->find_method(name, signature)) == NULL) || 895 is_static != m->is_static()) { 896 ResourceMark rm(THREAD); 897 // NoSuchMethodException doesn't actually work because it tries to run the 898 // <init> function before java_lang_Class is linked. Print error and exit. 899 vm_exit_during_initialization(err_msg("Unable to link/verify %s.%s method", 900 ik->name()->as_C_string(), method)); 901 } 902 method_cache->init(ik, m); 903 } 904 905 void Universe::initialize_known_methods(TRAPS) { 906 // Set up static method for registering finalizers 907 initialize_known_method(_finalizer_register_cache, 908 SystemDictionary::Finalizer_klass(), 909 "register", 910 vmSymbols::object_void_signature(), true, CHECK); 911 912 initialize_known_method(_throw_illegal_access_error_cache, 913 SystemDictionary::internal_Unsafe_klass(), 914 "throwIllegalAccessError", 915 vmSymbols::void_method_signature(), true, CHECK); 916 917 // Set up method for registering loaded classes in class loader vector 918 initialize_known_method(_loader_addClass_cache, 919 SystemDictionary::ClassLoader_klass(), 920 "addClass", 921 vmSymbols::class_void_signature(), false, CHECK); 922 923 // Set up method for checking protection domain 924 initialize_known_method(_pd_implies_cache, 925 SystemDictionary::ProtectionDomain_klass(), 926 "impliesCreateAccessControlContext", 927 vmSymbols::void_boolean_signature(), false, CHECK); 928 929 // Set up method for stack walking 930 initialize_known_method(_do_stack_walk_cache, 931 SystemDictionary::AbstractStackWalker_klass(), 932 "doStackWalk", 933 vmSymbols::doStackWalk_signature(), false, CHECK); 934 } 935 936 void universe2_init() { 937 EXCEPTION_MARK; 938 Universe::genesis(CATCH); 939 } 940 941 // Set after initialization of the module runtime, call_initModuleRuntime 942 void universe_post_module_init() { 943 Universe::_module_initialized = true; 944 } 945 946 bool universe_post_init() { 947 assert(!is_init_completed(), "Error: initialization not yet completed!"); 948 Universe::_fully_initialized = true; 949 EXCEPTION_MARK; 950 { ResourceMark rm; 951 Interpreter::initialize(); // needed for interpreter entry points 952 if (!UseSharedSpaces) { 953 HandleMark hm(THREAD); 954 KlassHandle ok_h(THREAD, SystemDictionary::Object_klass()); 955 Universe::reinitialize_vtable_of(ok_h, CHECK_false); 956 Universe::reinitialize_itables(CHECK_false); 957 } 958 } 959 960 HandleMark hm(THREAD); 961 Klass* k; 962 instanceKlassHandle k_h; 963 // Setup preallocated empty java.lang.Class array 964 Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::Class_klass(), 0, CHECK_false); 965 966 // Setup preallocated OutOfMemoryError errors 967 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_OutOfMemoryError(), true, CHECK_false); 968 k_h = instanceKlassHandle(THREAD, k); 969 Universe::_out_of_memory_error_java_heap = k_h->allocate_instance(CHECK_false); 970 Universe::_out_of_memory_error_metaspace = k_h->allocate_instance(CHECK_false); 971 Universe::_out_of_memory_error_class_metaspace = k_h->allocate_instance(CHECK_false); 972 Universe::_out_of_memory_error_array_size = k_h->allocate_instance(CHECK_false); 973 Universe::_out_of_memory_error_gc_overhead_limit = 974 k_h->allocate_instance(CHECK_false); 975 Universe::_out_of_memory_error_realloc_objects = k_h->allocate_instance(CHECK_false); 976 977 // Setup preallocated cause message for delayed StackOverflowError 978 if (StackReservedPages > 0) { 979 Universe::_delayed_stack_overflow_error_message = 980 java_lang_String::create_oop_from_str("Delayed StackOverflowError due to ReservedStackAccess annotated method", CHECK_false); 981 } 982 983 // Setup preallocated NullPointerException 984 // (this is currently used for a cheap & dirty solution in compiler exception handling) 985 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_NullPointerException(), true, CHECK_false); 986 Universe::_null_ptr_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false); 987 // Setup preallocated ArithmeticException 988 // (this is currently used for a cheap & dirty solution in compiler exception handling) 989 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_ArithmeticException(), true, CHECK_false); 990 Universe::_arithmetic_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false); 991 // Virtual Machine Error for when we get into a situation we can't resolve 992 k = SystemDictionary::resolve_or_fail( 993 vmSymbols::java_lang_VirtualMachineError(), true, CHECK_false); 994 bool linked = InstanceKlass::cast(k)->link_class_or_fail(CHECK_false); 995 if (!linked) { 996 tty->print_cr("Unable to link/verify VirtualMachineError class"); 997 return false; // initialization failed 998 } 999 Universe::_virtual_machine_error_instance = 1000 InstanceKlass::cast(k)->allocate_instance(CHECK_false); 1001 1002 Universe::_vm_exception = InstanceKlass::cast(k)->allocate_instance(CHECK_false); 1003 1004 if (!DumpSharedSpaces) { 1005 // These are the only Java fields that are currently set during shared space dumping. 1006 // We prefer to not handle this generally, so we always reinitialize these detail messages. 1007 Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false); 1008 java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg()); 1009 1010 msg = java_lang_String::create_from_str("Metaspace", CHECK_false); 1011 java_lang_Throwable::set_message(Universe::_out_of_memory_error_metaspace, msg()); 1012 msg = java_lang_String::create_from_str("Compressed class space", CHECK_false); 1013 java_lang_Throwable::set_message(Universe::_out_of_memory_error_class_metaspace, msg()); 1014 1015 msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false); 1016 java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg()); 1017 1018 msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false); 1019 java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg()); 1020 1021 msg = java_lang_String::create_from_str("Java heap space: failed reallocation of scalar replaced objects", CHECK_false); 1022 java_lang_Throwable::set_message(Universe::_out_of_memory_error_realloc_objects, msg()); 1023 1024 msg = java_lang_String::create_from_str("/ by zero", CHECK_false); 1025 java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg()); 1026 1027 // Setup the array of errors that have preallocated backtrace 1028 k = Universe::_out_of_memory_error_java_heap->klass(); 1029 assert(k->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error"); 1030 k_h = instanceKlassHandle(THREAD, k); 1031 1032 int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0; 1033 Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false); 1034 for (int i=0; i<len; i++) { 1035 oop err = k_h->allocate_instance(CHECK_false); 1036 Handle err_h = Handle(THREAD, err); 1037 java_lang_Throwable::allocate_backtrace(err_h, CHECK_false); 1038 Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h()); 1039 } 1040 Universe::_preallocated_out_of_memory_error_avail_count = (jint)len; 1041 } 1042 1043 Universe::initialize_known_methods(CHECK_false); 1044 1045 // This needs to be done before the first scavenge/gc, since 1046 // it's an input to soft ref clearing policy. 1047 { 1048 MutexLocker x(Heap_lock); 1049 Universe::update_heap_info_at_gc(); 1050 } 1051 1052 // ("weak") refs processing infrastructure initialization 1053 Universe::heap()->post_initialize(); 1054 1055 // Initialize performance counters for metaspaces 1056 MetaspaceCounters::initialize_performance_counters(); 1057 CompressedClassSpaceCounters::initialize_performance_counters(); 1058 1059 MemoryService::add_metaspace_memory_pools(); 1060 1061 MemoryService::set_universe_heap(Universe::heap()); 1062 #if INCLUDE_CDS 1063 SharedClassUtil::initialize(CHECK_false); 1064 #endif 1065 return true; 1066 } 1067 1068 1069 void Universe::compute_base_vtable_size() { 1070 _base_vtable_size = ClassLoader::compute_Object_vtable(); 1071 } 1072 1073 void Universe::print_on(outputStream* st) { 1074 st->print_cr("Heap"); 1075 heap()->print_on(st); 1076 } 1077 1078 void Universe::print_heap_at_SIGBREAK() { 1079 if (PrintHeapAtSIGBREAK) { 1080 MutexLocker hl(Heap_lock); 1081 print_on(tty); 1082 tty->cr(); 1083 tty->flush(); 1084 } 1085 } 1086 1087 void Universe::print_heap_before_gc() { 1088 Log(gc, heap) log; 1089 if (log.is_debug()) { 1090 log.debug("Heap before GC invocations=%u (full %u):", heap()->total_collections(), heap()->total_full_collections()); 1091 ResourceMark rm; 1092 heap()->print_on(log.debug_stream()); 1093 } 1094 } 1095 1096 void Universe::print_heap_after_gc() { 1097 Log(gc, heap) log; 1098 if (log.is_debug()) { 1099 log.debug("Heap after GC invocations=%u (full %u):", heap()->total_collections(), heap()->total_full_collections()); 1100 ResourceMark rm; 1101 heap()->print_on(log.debug_stream()); 1102 } 1103 } 1104 1105 void Universe::initialize_verify_flags() { 1106 verify_flags = 0; 1107 const char delimiter[] = " ,"; 1108 1109 size_t length = strlen(VerifySubSet); 1110 char* subset_list = NEW_C_HEAP_ARRAY(char, length + 1, mtInternal); 1111 strncpy(subset_list, VerifySubSet, length + 1); 1112 1113 char* token = strtok(subset_list, delimiter); 1114 while (token != NULL) { 1115 if (strcmp(token, "threads") == 0) { 1116 verify_flags |= Verify_Threads; 1117 } else if (strcmp(token, "heap") == 0) { 1118 verify_flags |= Verify_Heap; 1119 } else if (strcmp(token, "symbol_table") == 0) { 1120 verify_flags |= Verify_SymbolTable; 1121 } else if (strcmp(token, "string_table") == 0) { 1122 verify_flags |= Verify_StringTable; 1123 } else if (strcmp(token, "codecache") == 0) { 1124 verify_flags |= Verify_CodeCache; 1125 } else if (strcmp(token, "dictionary") == 0) { 1126 verify_flags |= Verify_SystemDictionary; 1127 } else if (strcmp(token, "classloader_data_graph") == 0) { 1128 verify_flags |= Verify_ClassLoaderDataGraph; 1129 } else if (strcmp(token, "metaspace") == 0) { 1130 verify_flags |= Verify_MetaspaceAux; 1131 } else if (strcmp(token, "jni_handles") == 0) { 1132 verify_flags |= Verify_JNIHandles; 1133 } else if (strcmp(token, "c-heap") == 0) { 1134 verify_flags |= Verify_CHeap; 1135 } else if (strcmp(token, "codecache_oops") == 0) { 1136 verify_flags |= Verify_CodeCacheOops; 1137 } else { 1138 vm_exit_during_initialization(err_msg("VerifySubSet: \'%s\' memory sub-system is unknown, please correct it", token)); 1139 } 1140 token = strtok(NULL, delimiter); 1141 } 1142 FREE_C_HEAP_ARRAY(char, subset_list); 1143 } 1144 1145 bool Universe::should_verify_subset(uint subset) { 1146 if (verify_flags & subset) { 1147 return true; 1148 } 1149 return false; 1150 } 1151 1152 void Universe::verify(VerifyOption option, const char* prefix) { 1153 // The use of _verify_in_progress is a temporary work around for 1154 // 6320749. Don't bother with a creating a class to set and clear 1155 // it since it is only used in this method and the control flow is 1156 // straight forward. 1157 _verify_in_progress = true; 1158 1159 COMPILER2_PRESENT( 1160 assert(!DerivedPointerTable::is_active(), 1161 "DPT should not be active during verification " 1162 "(of thread stacks below)"); 1163 ) 1164 1165 ResourceMark rm; 1166 HandleMark hm; // Handles created during verification can be zapped 1167 _verify_count++; 1168 1169 FormatBuffer<> title("Verifying %s", prefix); 1170 GCTraceTime(Info, gc, verify) tm(title.buffer()); 1171 if (should_verify_subset(Verify_Threads)) { 1172 log_debug(gc, verify)("Threads"); 1173 Threads::verify(); 1174 } 1175 if (should_verify_subset(Verify_Heap)) { 1176 log_debug(gc, verify)("Heap"); 1177 heap()->verify(option); 1178 } 1179 if (should_verify_subset(Verify_SymbolTable)) { 1180 log_debug(gc, verify)("SymbolTable"); 1181 SymbolTable::verify(); 1182 } 1183 if (should_verify_subset(Verify_StringTable)) { 1184 log_debug(gc, verify)("StringTable"); 1185 StringTable::verify(); 1186 } 1187 if (should_verify_subset(Verify_CodeCache)) { 1188 { 1189 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); 1190 log_debug(gc, verify)("CodeCache"); 1191 CodeCache::verify(); 1192 } 1193 } 1194 if (should_verify_subset(Verify_SystemDictionary)) { 1195 log_debug(gc, verify)("SystemDictionary"); 1196 SystemDictionary::verify(); 1197 } 1198 #ifndef PRODUCT 1199 if (should_verify_subset(Verify_ClassLoaderDataGraph)) { 1200 log_debug(gc, verify)("ClassLoaderDataGraph"); 1201 ClassLoaderDataGraph::verify(); 1202 } 1203 #endif 1204 if (should_verify_subset(Verify_MetaspaceAux)) { 1205 log_debug(gc, verify)("MetaspaceAux"); 1206 MetaspaceAux::verify_free_chunks(); 1207 } 1208 if (should_verify_subset(Verify_JNIHandles)) { 1209 log_debug(gc, verify)("JNIHandles"); 1210 JNIHandles::verify(); 1211 } 1212 if (should_verify_subset(Verify_CHeap)) { 1213 log_debug(gc, verify)("C-heap"); 1214 os::check_heap(); 1215 } 1216 if (should_verify_subset(Verify_CodeCacheOops)) { 1217 log_debug(gc, verify)("CodeCache Oops"); 1218 CodeCache::verify_oops(); 1219 } 1220 1221 _verify_in_progress = false; 1222 } 1223 1224 1225 #ifndef PRODUCT 1226 void Universe::calculate_verify_data(HeapWord* low_boundary, HeapWord* high_boundary) { 1227 assert(low_boundary < high_boundary, "bad interval"); 1228 1229 // decide which low-order bits we require to be clear: 1230 size_t alignSize = MinObjAlignmentInBytes; 1231 size_t min_object_size = CollectedHeap::min_fill_size(); 1232 1233 // make an inclusive limit: 1234 uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize; 1235 uintptr_t min = (uintptr_t)low_boundary; 1236 assert(min < max, "bad interval"); 1237 uintptr_t diff = max ^ min; 1238 1239 // throw away enough low-order bits to make the diff vanish 1240 uintptr_t mask = (uintptr_t)(-1); 1241 while ((mask & diff) != 0) 1242 mask <<= 1; 1243 uintptr_t bits = (min & mask); 1244 assert(bits == (max & mask), "correct mask"); 1245 // check an intermediate value between min and max, just to make sure: 1246 assert(bits == ((min + (max-min)/2) & mask), "correct mask"); 1247 1248 // require address alignment, too: 1249 mask |= (alignSize - 1); 1250 1251 if (!(_verify_oop_mask == 0 && _verify_oop_bits == (uintptr_t)-1)) { 1252 assert(_verify_oop_mask == mask && _verify_oop_bits == bits, "mask stability"); 1253 } 1254 _verify_oop_mask = mask; 1255 _verify_oop_bits = bits; 1256 } 1257 1258 // Oop verification (see MacroAssembler::verify_oop) 1259 1260 uintptr_t Universe::verify_oop_mask() { 1261 MemRegion m = heap()->reserved_region(); 1262 calculate_verify_data(m.start(), m.end()); 1263 return _verify_oop_mask; 1264 } 1265 1266 uintptr_t Universe::verify_oop_bits() { 1267 MemRegion m = heap()->reserved_region(); 1268 calculate_verify_data(m.start(), m.end()); 1269 return _verify_oop_bits; 1270 } 1271 1272 uintptr_t Universe::verify_mark_mask() { 1273 return markOopDesc::lock_mask_in_place; 1274 } 1275 1276 uintptr_t Universe::verify_mark_bits() { 1277 intptr_t mask = verify_mark_mask(); 1278 intptr_t bits = (intptr_t)markOopDesc::prototype(); 1279 assert((bits & ~mask) == 0, "no stray header bits"); 1280 return bits; 1281 } 1282 #endif // PRODUCT 1283 1284 1285 void Universe::compute_verify_oop_data() { 1286 verify_oop_mask(); 1287 verify_oop_bits(); 1288 verify_mark_mask(); 1289 verify_mark_bits(); 1290 } 1291 1292 1293 void LatestMethodCache::init(Klass* k, Method* m) { 1294 if (!UseSharedSpaces) { 1295 _klass = k; 1296 } 1297 #ifndef PRODUCT 1298 else { 1299 // sharing initilization should have already set up _klass 1300 assert(_klass != NULL, "just checking"); 1301 } 1302 #endif 1303 1304 _method_idnum = m->method_idnum(); 1305 assert(_method_idnum >= 0, "sanity check"); 1306 } 1307 1308 1309 Method* LatestMethodCache::get_method() { 1310 if (klass() == NULL) return NULL; 1311 InstanceKlass* ik = InstanceKlass::cast(klass()); 1312 Method* m = ik->method_with_idnum(method_idnum()); 1313 assert(m != NULL, "sanity check"); 1314 return m; 1315 } 1316 1317 1318 #ifdef ASSERT 1319 // Release dummy object(s) at bottom of heap 1320 bool Universe::release_fullgc_alot_dummy() { 1321 MutexLocker ml(FullGCALot_lock); 1322 if (_fullgc_alot_dummy_array != NULL) { 1323 if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) { 1324 // No more dummies to release, release entire array instead 1325 _fullgc_alot_dummy_array = NULL; 1326 return false; 1327 } 1328 if (!UseConcMarkSweepGC) { 1329 // Release dummy at bottom of old generation 1330 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL); 1331 } 1332 // Release dummy at bottom of permanent generation 1333 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL); 1334 } 1335 return true; 1336 } 1337 1338 #endif // ASSERT