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