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