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