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