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