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