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