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