duke@435: /* hseigel@4465: * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "classfile/classLoader.hpp" coleenp@4037: #include "classfile/classLoaderData.hpp" stefank@2314: #include "classfile/javaClasses.hpp" stefank@2314: #include "classfile/symbolTable.hpp" stefank@2314: #include "classfile/systemDictionary.hpp" stefank@2314: #include "classfile/vmSymbols.hpp" stefank@2314: #include "code/codeCache.hpp" stefank@2314: #include "code/dependencies.hpp" stefank@2314: #include "gc_interface/collectedHeap.inline.hpp" stefank@2314: #include "interpreter/interpreter.hpp" stefank@2314: #include "memory/cardTableModRefBS.hpp" stefank@2314: #include "memory/gcLocker.inline.hpp" stefank@2314: #include "memory/genCollectedHeap.hpp" stefank@2314: #include "memory/genRemSet.hpp" stefank@2314: #include "memory/generation.hpp" coleenp@4037: #include "memory/metadataFactory.hpp" coleenp@4037: #include "memory/metaspaceShared.hpp" stefank@2314: #include "memory/oopFactory.hpp" stefank@2314: #include "memory/space.hpp" stefank@2314: #include "memory/universe.hpp" stefank@2314: #include "memory/universe.inline.hpp" coleenp@4037: #include "oops/constantPool.hpp" coleenp@4037: #include "oops/instanceClassLoaderKlass.hpp" stefank@2314: #include "oops/instanceKlass.hpp" never@2658: #include "oops/instanceMirrorKlass.hpp" stefank@2314: #include "oops/instanceRefKlass.hpp" stefank@2314: #include "oops/oop.inline.hpp" stefank@2314: #include "oops/typeArrayKlass.hpp" stefank@2314: #include "prims/jvmtiRedefineClassesTrace.hpp" stefank@2314: #include "runtime/aprofiler.hpp" stefank@2314: #include "runtime/arguments.hpp" stefank@2314: #include "runtime/deoptimization.hpp" stefank@2314: #include "runtime/fprofiler.hpp" stefank@2314: #include "runtime/handles.inline.hpp" stefank@2314: #include "runtime/init.hpp" stefank@2314: #include "runtime/java.hpp" stefank@2314: #include "runtime/javaCalls.hpp" stefank@2314: #include "runtime/sharedRuntime.hpp" stefank@2314: #include "runtime/synchronizer.hpp" stefank@4299: #include "runtime/thread.inline.hpp" stefank@2314: #include "runtime/timer.hpp" stefank@2314: #include "runtime/vm_operations.hpp" stefank@2314: #include "services/memoryService.hpp" stefank@2314: #include "utilities/copy.hpp" stefank@2314: #include "utilities/events.hpp" stefank@2314: #include "utilities/hashtable.inline.hpp" stefank@2314: #include "utilities/preserveException.hpp" jprovino@4542: #include "utilities/macros.hpp" jprovino@4542: #if INCLUDE_ALL_GCS stefank@2314: #include "gc_implementation/concurrentMarkSweep/cmsAdaptiveSizePolicy.hpp" stefank@2314: #include "gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.hpp" stefank@2314: #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" stefank@2314: #include "gc_implementation/g1/g1CollectorPolicy.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp" jprovino@4542: #endif // INCLUDE_ALL_GCS duke@435: duke@435: // Known objects coleenp@4037: Klass* Universe::_boolArrayKlassObj = NULL; coleenp@4037: Klass* Universe::_byteArrayKlassObj = NULL; coleenp@4037: Klass* Universe::_charArrayKlassObj = NULL; coleenp@4037: Klass* Universe::_intArrayKlassObj = NULL; coleenp@4037: Klass* Universe::_shortArrayKlassObj = NULL; coleenp@4037: Klass* Universe::_longArrayKlassObj = NULL; coleenp@4037: Klass* Universe::_singleArrayKlassObj = NULL; coleenp@4037: Klass* Universe::_doubleArrayKlassObj = NULL; coleenp@4037: Klass* Universe::_typeArrayKlassObjs[T_VOID+1] = { NULL /*, NULL...*/ }; coleenp@4037: Klass* Universe::_objectArrayKlassObj = NULL; jcoomes@916: oop Universe::_int_mirror = NULL; jcoomes@916: oop Universe::_float_mirror = NULL; jcoomes@916: oop Universe::_double_mirror = NULL; jcoomes@916: oop Universe::_byte_mirror = NULL; jcoomes@916: oop Universe::_bool_mirror = NULL; jcoomes@916: oop Universe::_char_mirror = NULL; jcoomes@916: oop Universe::_long_mirror = NULL; jcoomes@916: oop Universe::_short_mirror = NULL; jcoomes@916: oop Universe::_void_mirror = NULL; jcoomes@916: oop Universe::_mirrors[T_VOID+1] = { NULL /*, NULL...*/ }; duke@435: oop Universe::_main_thread_group = NULL; duke@435: oop Universe::_system_thread_group = NULL; duke@435: objArrayOop Universe::_the_empty_class_klass_array = NULL; coleenp@4037: Array* Universe::_the_array_interfaces_array = NULL; never@1515: oop Universe::_the_null_string = NULL; never@1515: oop Universe::_the_min_jint_string = NULL; duke@435: LatestMethodOopCache* Universe::_finalizer_register_cache = NULL; coleenp@4062: LatestMethodOopCache* Universe::_loader_addClass_cache = NULL; duke@435: ActiveMethodOopsCache* Universe::_reflect_invoke_cache = NULL; duke@435: oop Universe::_out_of_memory_error_java_heap = NULL; duke@435: oop Universe::_out_of_memory_error_perm_gen = NULL; duke@435: oop Universe::_out_of_memory_error_array_size = NULL; duke@435: oop Universe::_out_of_memory_error_gc_overhead_limit = NULL; duke@435: objArrayOop Universe::_preallocated_out_of_memory_error_array = NULL; duke@435: volatile jint Universe::_preallocated_out_of_memory_error_avail_count = 0; duke@435: bool Universe::_verify_in_progress = false; duke@435: oop Universe::_null_ptr_exception_instance = NULL; duke@435: oop Universe::_arithmetic_exception_instance = NULL; duke@435: oop Universe::_virtual_machine_error_instance = NULL; duke@435: oop Universe::_vm_exception = NULL; coleenp@4037: Array* Universe::_the_empty_int_array = NULL; coleenp@4037: Array* Universe::_the_empty_short_array = NULL; coleenp@4037: Array* Universe::_the_empty_klass_array = NULL; coleenp@4037: Array* Universe::_the_empty_method_array = NULL; duke@435: duke@435: // These variables are guarded by FullGCALot_lock. duke@435: debug_only(objArrayOop Universe::_fullgc_alot_dummy_array = NULL;) duke@435: debug_only(int Universe::_fullgc_alot_dummy_next = 0;) duke@435: duke@435: // Heap duke@435: int Universe::_verify_count = 0; duke@435: duke@435: int Universe::_base_vtable_size = 0; duke@435: bool Universe::_bootstrapping = false; duke@435: bool Universe::_fully_initialized = false; duke@435: duke@435: size_t Universe::_heap_capacity_at_last_gc; ysr@888: size_t Universe::_heap_used_at_last_gc = 0; duke@435: duke@435: CollectedHeap* Universe::_collectedHeap = NULL; kvn@1077: roland@4159: NarrowPtrStruct Universe::_narrow_oop = { NULL, 0, true }; roland@4159: NarrowPtrStruct Universe::_narrow_klass = { NULL, 0, true }; roland@4159: address Universe::_narrow_ptrs_base; duke@435: hseigel@4523: size_t Universe::_class_metaspace_size; duke@435: coleenp@4037: void Universe::basic_type_classes_do(void f(Klass*)) { duke@435: f(boolArrayKlassObj()); duke@435: f(byteArrayKlassObj()); duke@435: f(charArrayKlassObj()); duke@435: f(intArrayKlassObj()); duke@435: f(shortArrayKlassObj()); duke@435: f(longArrayKlassObj()); duke@435: f(singleArrayKlassObj()); duke@435: f(doubleArrayKlassObj()); duke@435: } duke@435: duke@435: void Universe::oops_do(OopClosure* f, bool do_all) { duke@435: duke@435: f->do_oop((oop*) &_int_mirror); duke@435: f->do_oop((oop*) &_float_mirror); duke@435: f->do_oop((oop*) &_double_mirror); duke@435: f->do_oop((oop*) &_byte_mirror); duke@435: f->do_oop((oop*) &_bool_mirror); duke@435: f->do_oop((oop*) &_char_mirror); duke@435: f->do_oop((oop*) &_long_mirror); duke@435: f->do_oop((oop*) &_short_mirror); duke@435: f->do_oop((oop*) &_void_mirror); duke@435: duke@435: for (int i = T_BOOLEAN; i < T_VOID+1; i++) { duke@435: f->do_oop((oop*) &_mirrors[i]); duke@435: } duke@435: assert(_mirrors[0] == NULL && _mirrors[T_BOOLEAN - 1] == NULL, "checking"); duke@435: duke@435: f->do_oop((oop*)&_the_empty_class_klass_array); never@1515: f->do_oop((oop*)&_the_null_string); never@1515: f->do_oop((oop*)&_the_min_jint_string); duke@435: f->do_oop((oop*)&_out_of_memory_error_java_heap); duke@435: f->do_oop((oop*)&_out_of_memory_error_perm_gen); duke@435: f->do_oop((oop*)&_out_of_memory_error_array_size); duke@435: f->do_oop((oop*)&_out_of_memory_error_gc_overhead_limit); duke@435: f->do_oop((oop*)&_preallocated_out_of_memory_error_array); duke@435: f->do_oop((oop*)&_null_ptr_exception_instance); duke@435: f->do_oop((oop*)&_arithmetic_exception_instance); duke@435: f->do_oop((oop*)&_virtual_machine_error_instance); duke@435: f->do_oop((oop*)&_main_thread_group); duke@435: f->do_oop((oop*)&_system_thread_group); duke@435: f->do_oop((oop*)&_vm_exception); duke@435: debug_only(f->do_oop((oop*)&_fullgc_alot_dummy_array);) duke@435: } duke@435: coleenp@4037: // Serialize metadata in and out of CDS archive, not oops. coleenp@4037: void Universe::serialize(SerializeClosure* f, bool do_all) { coleenp@4037: coleenp@4037: f->do_ptr((void**)&_boolArrayKlassObj); coleenp@4037: f->do_ptr((void**)&_byteArrayKlassObj); coleenp@4037: f->do_ptr((void**)&_charArrayKlassObj); coleenp@4037: f->do_ptr((void**)&_intArrayKlassObj); coleenp@4037: f->do_ptr((void**)&_shortArrayKlassObj); coleenp@4037: f->do_ptr((void**)&_longArrayKlassObj); coleenp@4037: f->do_ptr((void**)&_singleArrayKlassObj); coleenp@4037: f->do_ptr((void**)&_doubleArrayKlassObj); coleenp@4037: f->do_ptr((void**)&_objectArrayKlassObj); coleenp@4037: coleenp@4037: { coleenp@4037: for (int i = 0; i < T_VOID+1; i++) { coleenp@4037: if (_typeArrayKlassObjs[i] != NULL) { coleenp@4037: assert(i >= T_BOOLEAN, "checking"); coleenp@4037: f->do_ptr((void**)&_typeArrayKlassObjs[i]); coleenp@4037: } else if (do_all) { coleenp@4037: f->do_ptr((void**)&_typeArrayKlassObjs[i]); coleenp@4037: } coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: f->do_ptr((void**)&_the_array_interfaces_array); coleenp@4037: f->do_ptr((void**)&_the_empty_int_array); coleenp@4037: f->do_ptr((void**)&_the_empty_short_array); coleenp@4037: f->do_ptr((void**)&_the_empty_method_array); coleenp@4037: f->do_ptr((void**)&_the_empty_klass_array); coleenp@4037: _finalizer_register_cache->serialize(f); coleenp@4062: _loader_addClass_cache->serialize(f); coleenp@4037: _reflect_invoke_cache->serialize(f); coleenp@4037: } duke@435: duke@435: void Universe::check_alignment(uintx size, uintx alignment, const char* name) { duke@435: if (size < alignment || size % alignment != 0) { duke@435: ResourceMark rm; duke@435: stringStream st; hseigel@4465: st.print("Size of %s (" UINTX_FORMAT " bytes) must be aligned to " UINTX_FORMAT " bytes", name, size, alignment); duke@435: char* error = st.as_string(); duke@435: vm_exit_during_initialization(error); duke@435: } duke@435: } duke@435: coleenp@4037: void initialize_basic_type_klass(Klass* k, TRAPS) { coleenp@4037: Klass* ok = SystemDictionary::Object_klass(); coleenp@4037: if (UseSharedSpaces) { coleenp@4037: assert(k->super() == ok, "u3"); coleenp@4037: k->restore_unshareable_info(CHECK); coleenp@4037: } else { coleenp@4037: k->initialize_supers(ok, CHECK); coleenp@4037: } coleenp@4037: k->append_to_sibling_list(); coleenp@4037: } duke@435: duke@435: void Universe::genesis(TRAPS) { duke@435: ResourceMark rm; coleenp@4037: duke@435: { FlagSetting fs(_bootstrapping, true); duke@435: duke@435: { MutexLocker mc(Compile_lock); duke@435: duke@435: // determine base vtable size; without that we cannot create the array klasses duke@435: compute_base_vtable_size(); duke@435: duke@435: if (!UseSharedSpaces) { coleenp@4142: _boolArrayKlassObj = TypeArrayKlass::create_klass(T_BOOLEAN, sizeof(jboolean), CHECK); coleenp@4142: _charArrayKlassObj = TypeArrayKlass::create_klass(T_CHAR, sizeof(jchar), CHECK); coleenp@4142: _singleArrayKlassObj = TypeArrayKlass::create_klass(T_FLOAT, sizeof(jfloat), CHECK); coleenp@4142: _doubleArrayKlassObj = TypeArrayKlass::create_klass(T_DOUBLE, sizeof(jdouble), CHECK); coleenp@4142: _byteArrayKlassObj = TypeArrayKlass::create_klass(T_BYTE, sizeof(jbyte), CHECK); coleenp@4142: _shortArrayKlassObj = TypeArrayKlass::create_klass(T_SHORT, sizeof(jshort), CHECK); coleenp@4142: _intArrayKlassObj = TypeArrayKlass::create_klass(T_INT, sizeof(jint), CHECK); coleenp@4142: _longArrayKlassObj = TypeArrayKlass::create_klass(T_LONG, sizeof(jlong), CHECK); duke@435: duke@435: _typeArrayKlassObjs[T_BOOLEAN] = _boolArrayKlassObj; duke@435: _typeArrayKlassObjs[T_CHAR] = _charArrayKlassObj; duke@435: _typeArrayKlassObjs[T_FLOAT] = _singleArrayKlassObj; duke@435: _typeArrayKlassObjs[T_DOUBLE] = _doubleArrayKlassObj; duke@435: _typeArrayKlassObjs[T_BYTE] = _byteArrayKlassObj; duke@435: _typeArrayKlassObjs[T_SHORT] = _shortArrayKlassObj; duke@435: _typeArrayKlassObjs[T_INT] = _intArrayKlassObj; duke@435: _typeArrayKlassObjs[T_LONG] = _longArrayKlassObj; duke@435: coleenp@4037: ClassLoaderData* null_cld = ClassLoaderData::the_null_class_loader_data(); duke@435: coleenp@4037: _the_array_interfaces_array = MetadataFactory::new_array(null_cld, 2, NULL, CHECK); coleenp@4037: _the_empty_int_array = MetadataFactory::new_array(null_cld, 0, CHECK); coleenp@4037: _the_empty_short_array = MetadataFactory::new_array(null_cld, 0, CHECK); coleenp@4037: _the_empty_method_array = MetadataFactory::new_array(null_cld, 0, CHECK); coleenp@4037: _the_empty_klass_array = MetadataFactory::new_array(null_cld, 0, CHECK); duke@435: } duke@435: } duke@435: duke@435: vmSymbols::initialize(CHECK); duke@435: duke@435: SystemDictionary::initialize(CHECK); duke@435: coleenp@4037: Klass* ok = SystemDictionary::Object_klass(); duke@435: never@1515: _the_null_string = StringTable::intern("null", CHECK); never@1515: _the_min_jint_string = StringTable::intern("-2147483648", CHECK); never@1515: duke@435: if (UseSharedSpaces) { duke@435: // Verify shared interfaces array. coleenp@4037: assert(_the_array_interfaces_array->at(0) == never@1577: SystemDictionary::Cloneable_klass(), "u3"); coleenp@4037: assert(_the_array_interfaces_array->at(1) == never@1577: SystemDictionary::Serializable_klass(), "u3"); duke@435: } else { duke@435: // Set up shared interfaces array. (Do this before supers are set up.) coleenp@4037: _the_array_interfaces_array->at_put(0, SystemDictionary::Cloneable_klass()); coleenp@4037: _the_array_interfaces_array->at_put(1, SystemDictionary::Serializable_klass()); duke@435: } duke@435: coleenp@4037: initialize_basic_type_klass(boolArrayKlassObj(), CHECK); coleenp@4037: initialize_basic_type_klass(charArrayKlassObj(), CHECK); coleenp@4037: initialize_basic_type_klass(singleArrayKlassObj(), CHECK); coleenp@4037: initialize_basic_type_klass(doubleArrayKlassObj(), CHECK); coleenp@4037: initialize_basic_type_klass(byteArrayKlassObj(), CHECK); coleenp@4037: initialize_basic_type_klass(shortArrayKlassObj(), CHECK); coleenp@4037: initialize_basic_type_klass(intArrayKlassObj(), CHECK); coleenp@4037: initialize_basic_type_klass(longArrayKlassObj(), CHECK); duke@435: } // end of core bootstrapping duke@435: coleenp@4037: // Maybe this could be lifted up now that object array can be initialized coleenp@4037: // during the bootstrapping. coleenp@4037: coleenp@4037: // OLD duke@435: // Initialize _objectArrayKlass after core bootstraping to make duke@435: // sure the super class is set up properly for _objectArrayKlass. coleenp@4037: // --- coleenp@4037: // NEW coleenp@4037: // Since some of the old system object arrays have been converted to coleenp@4037: // ordinary object arrays, _objectArrayKlass will be loaded when coleenp@4037: // SystemDictionary::initialize(CHECK); is run. See the extra check coleenp@4037: // for Object_klass_loaded in objArrayKlassKlass::allocate_objArray_klass_impl. coleenp@4037: _objectArrayKlassObj = InstanceKlass:: never@1577: cast(SystemDictionary::Object_klass())->array_klass(1, CHECK); coleenp@4037: // OLD duke@435: // Add the class to the class hierarchy manually to make sure that duke@435: // its vtable is initialized after core bootstrapping is completed. coleenp@4037: // --- coleenp@4037: // New coleenp@4037: // Have already been initialized. hseigel@4278: _objectArrayKlassObj->append_to_sibling_list(); duke@435: duke@435: // Compute is_jdk version flags. duke@435: // Only 1.3 or later has the java.lang.Shutdown class. duke@435: // Only 1.4 or later has the java.lang.CharSequence interface. duke@435: // Only 1.5 or later has the java.lang.management.MemoryUsage class. kamg@677: if (JDK_Version::is_partially_initialized()) { kamg@677: uint8_t jdk_version; coleenp@4037: Klass* k = SystemDictionary::resolve_or_null( coleenp@2497: vmSymbols::java_lang_management_MemoryUsage(), THREAD); duke@435: CLEAR_PENDING_EXCEPTION; // ignore exceptions duke@435: if (k == NULL) { kamg@677: k = SystemDictionary::resolve_or_null( coleenp@2497: vmSymbols::java_lang_CharSequence(), THREAD); duke@435: CLEAR_PENDING_EXCEPTION; // ignore exceptions duke@435: if (k == NULL) { kamg@677: k = SystemDictionary::resolve_or_null( coleenp@2497: vmSymbols::java_lang_Shutdown(), THREAD); duke@435: CLEAR_PENDING_EXCEPTION; // ignore exceptions duke@435: if (k == NULL) { kamg@677: jdk_version = 2; duke@435: } else { kamg@677: jdk_version = 3; duke@435: } duke@435: } else { kamg@677: jdk_version = 4; duke@435: } duke@435: } else { kamg@677: jdk_version = 5; duke@435: } kamg@677: JDK_Version::fully_initialize(jdk_version); duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: if (FullGCALot) { duke@435: // Allocate an array of dummy objects. duke@435: // We'd like these to be at the bottom of the old generation, duke@435: // so that when we free one and then collect, duke@435: // (almost) the whole heap moves duke@435: // and we find out if we actually update all the oops correctly. duke@435: // But we can't allocate directly in the old generation, duke@435: // so we allocate wherever, and hope that the first collection duke@435: // moves these objects to the bottom of the old generation. duke@435: // We can allocate directly in the permanent generation, so we do. duke@435: int size; duke@435: if (UseConcMarkSweepGC) { duke@435: warning("Using +FullGCALot with concurrent mark sweep gc " duke@435: "will not force all objects to relocate"); duke@435: size = FullGCALotDummies; duke@435: } else { duke@435: size = FullGCALotDummies * 2; duke@435: } coleenp@4037: objArrayOop naked_array = oopFactory::new_objArray(SystemDictionary::Object_klass(), size, CHECK); duke@435: objArrayHandle dummy_array(THREAD, naked_array); duke@435: int i = 0; duke@435: while (i < size) { duke@435: // Allocate dummy in old generation coleenp@4037: oop dummy = InstanceKlass::cast(SystemDictionary::Object_klass())->allocate_instance(CHECK); duke@435: dummy_array->obj_at_put(i++, dummy); duke@435: } duke@435: { duke@435: // Only modify the global variable inside the mutex. duke@435: // If we had a race to here, the other dummy_array instances duke@435: // and their elements just get dropped on the floor, which is fine. duke@435: MutexLocker ml(FullGCALot_lock); duke@435: if (_fullgc_alot_dummy_array == NULL) { duke@435: _fullgc_alot_dummy_array = dummy_array(); duke@435: } duke@435: } duke@435: assert(i == _fullgc_alot_dummy_array->length(), "just checking"); duke@435: } duke@435: #endif coleenp@4304: coleenp@4304: // Initialize dependency array for null class loader coleenp@4304: ClassLoaderData::the_null_class_loader_data()->init_dependencies(CHECK); coleenp@4304: duke@435: } duke@435: coleenp@4037: // CDS support for patching vtables in metadata in the shared archive. coleenp@4037: // All types inherited from Metadata have vtables, but not types inherited coleenp@4037: // from MetaspaceObj, because the latter does not have virtual functions. coleenp@4037: // If the metadata type has a vtable, it cannot be shared in the read-only coleenp@4037: // section of the CDS archive, because the vtable pointer is patched. coleenp@2497: static inline void add_vtable(void** list, int* n, void* o, int count) { coleenp@2497: guarantee((*n) < count, "vtable list too small"); coleenp@4295: void* vtable = dereference_vptr(o); coleenp@4295: assert(*(void**)(vtable) != NULL, "invalid vtable"); coleenp@2497: list[(*n)++] = vtable; coleenp@2497: } duke@435: duke@435: void Universe::init_self_patching_vtbl_list(void** list, int count) { duke@435: int n = 0; coleenp@4037: { InstanceKlass o; add_vtable(list, &n, &o, count); } coleenp@4047: { InstanceClassLoaderKlass o; add_vtable(list, &n, &o, count); } coleenp@4047: { InstanceMirrorKlass o; add_vtable(list, &n, &o, count); } coleenp@4047: { InstanceRefKlass o; add_vtable(list, &n, &o, count); } coleenp@4142: { TypeArrayKlass o; add_vtable(list, &n, &o, count); } coleenp@4142: { ObjArrayKlass o; add_vtable(list, &n, &o, count); } coleenp@4037: { Method o; add_vtable(list, &n, &o, count); } coleenp@4037: { ConstantPool o; add_vtable(list, &n, &o, count); } duke@435: } duke@435: duke@435: void Universe::initialize_basic_type_mirrors(TRAPS) { duke@435: assert(_int_mirror==NULL, "basic type mirrors already initialized"); duke@435: _int_mirror = duke@435: java_lang_Class::create_basic_type_mirror("int", T_INT, CHECK); duke@435: _float_mirror = duke@435: java_lang_Class::create_basic_type_mirror("float", T_FLOAT, CHECK); duke@435: _double_mirror = duke@435: java_lang_Class::create_basic_type_mirror("double", T_DOUBLE, CHECK); duke@435: _byte_mirror = duke@435: java_lang_Class::create_basic_type_mirror("byte", T_BYTE, CHECK); duke@435: _bool_mirror = duke@435: java_lang_Class::create_basic_type_mirror("boolean",T_BOOLEAN, CHECK); duke@435: _char_mirror = duke@435: java_lang_Class::create_basic_type_mirror("char", T_CHAR, CHECK); duke@435: _long_mirror = duke@435: java_lang_Class::create_basic_type_mirror("long", T_LONG, CHECK); duke@435: _short_mirror = duke@435: java_lang_Class::create_basic_type_mirror("short", T_SHORT, CHECK); duke@435: _void_mirror = duke@435: java_lang_Class::create_basic_type_mirror("void", T_VOID, CHECK); duke@435: duke@435: _mirrors[T_INT] = _int_mirror; duke@435: _mirrors[T_FLOAT] = _float_mirror; duke@435: _mirrors[T_DOUBLE] = _double_mirror; duke@435: _mirrors[T_BYTE] = _byte_mirror; duke@435: _mirrors[T_BOOLEAN] = _bool_mirror; duke@435: _mirrors[T_CHAR] = _char_mirror; duke@435: _mirrors[T_LONG] = _long_mirror; duke@435: _mirrors[T_SHORT] = _short_mirror; duke@435: _mirrors[T_VOID] = _void_mirror; coleenp@4037: //_mirrors[T_OBJECT] = InstanceKlass::cast(_object_klass)->java_mirror(); coleenp@4037: //_mirrors[T_ARRAY] = InstanceKlass::cast(_object_klass)->java_mirror(); duke@435: } duke@435: duke@435: void Universe::fixup_mirrors(TRAPS) { duke@435: // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly, duke@435: // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply duke@435: // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note duke@435: // that the number of objects allocated at this point is very small. never@1577: assert(SystemDictionary::Class_klass_loaded(), "java.lang.Class should be loaded"); coleenp@4037: HandleMark hm(THREAD); never@2658: // Cache the start of the static fields coleenp@4047: InstanceMirrorKlass::init_offset_of_static_fields(); never@2658: coleenp@4037: GrowableArray * list = java_lang_Class::fixup_mirror_list(); coleenp@4037: int list_length = list->length(); coleenp@4037: for (int i = 0; i < list_length; i++) { coleenp@4037: Klass* k = list->at(i); coleenp@4037: assert(k->is_klass(), "List should only hold classes"); coleenp@4037: EXCEPTION_MARK; coleenp@4037: KlassHandle kh(THREAD, k); coleenp@4037: java_lang_Class::fixup_mirror(kh, CATCH); duke@435: } coleenp@4037: delete java_lang_Class::fixup_mirror_list(); coleenp@4037: java_lang_Class::set_fixup_mirror_list(NULL); coleenp@4037: } duke@435: duke@435: static bool has_run_finalizers_on_exit = false; duke@435: duke@435: void Universe::run_finalizers_on_exit() { duke@435: if (has_run_finalizers_on_exit) return; duke@435: has_run_finalizers_on_exit = true; duke@435: duke@435: // Called on VM exit. This ought to be run in a separate thread. duke@435: if (TraceReferenceGC) tty->print_cr("Callback to run finalizers on exit"); duke@435: { duke@435: PRESERVE_EXCEPTION_MARK; never@1577: KlassHandle finalizer_klass(THREAD, SystemDictionary::Finalizer_klass()); duke@435: JavaValue result(T_VOID); duke@435: JavaCalls::call_static( duke@435: &result, duke@435: finalizer_klass, coleenp@2497: vmSymbols::run_finalizers_on_exit_name(), coleenp@2497: vmSymbols::void_method_signature(), duke@435: THREAD duke@435: ); duke@435: // Ignore any pending exceptions duke@435: CLEAR_PENDING_EXCEPTION; duke@435: } duke@435: } duke@435: duke@435: duke@435: // initialize_vtable could cause gc if duke@435: // 1) we specified true to initialize_vtable and duke@435: // 2) this ran after gc was enabled duke@435: // In case those ever change we use handles for oops duke@435: void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) { duke@435: // init vtable of k and all subclasses coleenp@4037: Klass* ko = k_h(); duke@435: klassVtable* vt = ko->vtable(); duke@435: if (vt) vt->initialize_vtable(false, CHECK); duke@435: if (ko->oop_is_instance()) { coleenp@4037: InstanceKlass* ik = (InstanceKlass*)ko; coleenp@4037: for (KlassHandle s_h(THREAD, ik->subklass()); s_h() != NULL; s_h = (THREAD, s_h()->next_sibling())) { duke@435: reinitialize_vtable_of(s_h, CHECK); duke@435: } duke@435: } duke@435: } duke@435: duke@435: coleenp@4037: void initialize_itable_for_klass(Klass* k, TRAPS) { coleenp@4037: InstanceKlass::cast(k)->itable()->initialize_itable(false, CHECK); duke@435: } duke@435: duke@435: duke@435: void Universe::reinitialize_itables(TRAPS) { duke@435: SystemDictionary::classes_do(initialize_itable_for_klass, CHECK); duke@435: duke@435: } duke@435: duke@435: duke@435: bool Universe::on_page_boundary(void* addr) { duke@435: return ((uintptr_t) addr) % os::vm_page_size() == 0; duke@435: } duke@435: duke@435: duke@435: bool Universe::should_fill_in_stack_trace(Handle throwable) { duke@435: // never attempt to fill in the stack trace of preallocated errors that do not have duke@435: // backtrace. These errors are kept alive forever and may be "re-used" when all duke@435: // preallocated errors with backtrace have been consumed. Also need to avoid duke@435: // a potential loop which could happen if an out of memory occurs when attempting duke@435: // to allocate the backtrace. duke@435: return ((throwable() != Universe::_out_of_memory_error_java_heap) && duke@435: (throwable() != Universe::_out_of_memory_error_perm_gen) && duke@435: (throwable() != Universe::_out_of_memory_error_array_size) && duke@435: (throwable() != Universe::_out_of_memory_error_gc_overhead_limit)); duke@435: } duke@435: duke@435: duke@435: oop Universe::gen_out_of_memory_error(oop default_err) { duke@435: // generate an out of memory error: duke@435: // - if there is a preallocated error with backtrace available then return it wth duke@435: // a filled in stack trace. duke@435: // - if there are no preallocated errors with backtrace available then return duke@435: // an error without backtrace. duke@435: int next; duke@435: if (_preallocated_out_of_memory_error_avail_count > 0) { duke@435: next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count); duke@435: assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt"); duke@435: } else { duke@435: next = -1; duke@435: } duke@435: if (next < 0) { duke@435: // all preallocated errors have been used. duke@435: // return default duke@435: return default_err; duke@435: } else { duke@435: // get the error object at the slot and set set it to NULL so that the duke@435: // array isn't keeping it alive anymore. duke@435: oop exc = preallocated_out_of_memory_errors()->obj_at(next); duke@435: assert(exc != NULL, "slot has been used already"); duke@435: preallocated_out_of_memory_errors()->obj_at_put(next, NULL); duke@435: duke@435: // use the message from the default error duke@435: oop msg = java_lang_Throwable::message(default_err); duke@435: assert(msg != NULL, "no message"); duke@435: java_lang_Throwable::set_message(exc, msg); duke@435: duke@435: // populate the stack trace and return it. duke@435: java_lang_Throwable::fill_in_stack_trace_of_preallocated_backtrace(exc); duke@435: return exc; duke@435: } duke@435: } duke@435: duke@435: static intptr_t non_oop_bits = 0; duke@435: duke@435: void* Universe::non_oop_word() { duke@435: // Neither the high bits nor the low bits of this value is allowed duke@435: // to look like (respectively) the high or low bits of a real oop. duke@435: // duke@435: // High and low are CPU-specific notions, but low always includes duke@435: // the low-order bit. Since oops are always aligned at least mod 4, duke@435: // setting the low-order bit will ensure that the low half of the duke@435: // word will never look like that of a real oop. duke@435: // duke@435: // Using the OS-supplied non-memory-address word (usually 0 or -1) duke@435: // will take care of the high bits, however many there are. duke@435: duke@435: if (non_oop_bits == 0) { duke@435: non_oop_bits = (intptr_t)os::non_memory_address_word() | 1; duke@435: } duke@435: duke@435: return (void*)non_oop_bits; duke@435: } duke@435: duke@435: jint universe_init() { duke@435: assert(!Universe::_fully_initialized, "called after initialize_vtables"); duke@435: guarantee(1 << LogHeapWordSize == sizeof(HeapWord), duke@435: "LogHeapWordSize is incorrect."); duke@435: guarantee(sizeof(oop) >= sizeof(HeapWord), "HeapWord larger than oop?"); duke@435: guarantee(sizeof(oop) % sizeof(HeapWord) == 0, coleenp@548: "oop size is not not a multiple of HeapWord size"); duke@435: TraceTime timer("Genesis", TraceStartupTime); duke@435: GC_locker::lock(); // do not allow gc during bootstrapping duke@435: JavaClasses::compute_hard_coded_offsets(); duke@435: duke@435: jint status = Universe::initialize_heap(); duke@435: if (status != JNI_OK) { duke@435: return status; duke@435: } duke@435: coleenp@4037: // Create memory for metadata. Must be after initializing heap for coleenp@4037: // DumpSharedSpaces. coleenp@4037: ClassLoaderData::init_null_class_loader_data(); coleenp@4037: coleenp@4037: // We have a heap so create the Method* caches before coleenp@4037: // Metaspace::initialize_shared_spaces() tries to populate them. duke@435: Universe::_finalizer_register_cache = new LatestMethodOopCache(); coleenp@4062: Universe::_loader_addClass_cache = new LatestMethodOopCache(); duke@435: Universe::_reflect_invoke_cache = new ActiveMethodOopsCache(); duke@435: duke@435: if (UseSharedSpaces) { duke@435: // Read the data structures supporting the shared spaces (shared duke@435: // system dictionary, symbol table, etc.). After that, access to duke@435: // the file (other than the mapped regions) is no longer needed, and duke@435: // the file is closed. Closing the file does not affect the duke@435: // currently mapped regions. coleenp@4037: MetaspaceShared::initialize_shared_spaces(); coleenp@4037: StringTable::create_table(); duke@435: } else { duke@435: SymbolTable::create_table(); duke@435: StringTable::create_table(); duke@435: ClassLoader::create_package_info_table(); duke@435: } duke@435: duke@435: return JNI_OK; duke@435: } duke@435: kvn@1077: // Choose the heap base address and oop encoding mode kvn@1077: // when compressed oops are used: kvn@1077: // Unscaled - Use 32-bits oops without encoding when kvn@1077: // NarrowOopHeapBaseMin + heap_size < 4Gb kvn@1077: // ZeroBased - Use zero based compressed oops with encoding when kvn@1077: // NarrowOopHeapBaseMin + heap_size < 32Gb kvn@1077: // HeapBased - Use compressed oops with heap base + encoding. kvn@1077: kvn@1077: // 4Gb kvn@1077: static const uint64_t NarrowOopHeapMax = (uint64_t(max_juint) + 1); kvn@1077: // 32Gb kvn@1926: // OopEncodingHeapMax == NarrowOopHeapMax << LogMinObjAlignmentInBytes; kvn@1077: kvn@1077: char* Universe::preferred_heap_base(size_t heap_size, NARROW_OOP_MODE mode) { kvn@1492: size_t base = 0; kvn@1077: #ifdef _LP64 kvn@1077: if (UseCompressedOops) { kvn@1077: assert(mode == UnscaledNarrowOop || kvn@1077: mode == ZeroBasedNarrowOop || kvn@1077: mode == HeapBasedNarrowOop, "mode is invalid"); kvn@1492: const size_t total_size = heap_size + HeapBaseMinAddress; kvn@1357: // Return specified base for the first request. kvn@1357: if (!FLAG_IS_DEFAULT(HeapBaseMinAddress) && (mode == UnscaledNarrowOop)) { kvn@1492: base = HeapBaseMinAddress; hseigel@4523: hseigel@4523: // If the total size and the metaspace size are small enough to allow hseigel@4523: // UnscaledNarrowOop then just use UnscaledNarrowOop. hseigel@4523: } else if ((total_size <= OopEncodingHeapMax) && (mode != HeapBasedNarrowOop) && hseigel@4523: (!UseCompressedKlassPointers || hseigel@4523: (((OopEncodingHeapMax - heap_size) + Universe::class_metaspace_size()) <= KlassEncodingMetaspaceMax))) { hseigel@4523: // We don't need to check the metaspace size here because it is always smaller hseigel@4523: // than total_size. hseigel@4523: if ((total_size <= NarrowOopHeapMax) && (mode == UnscaledNarrowOop) && kvn@1077: (Universe::narrow_oop_shift() == 0)) { kvn@1077: // Use 32-bits oops without encoding and kvn@1077: // place heap's top on the 4Gb boundary kvn@1492: base = (NarrowOopHeapMax - heap_size); kvn@1077: } else { kvn@1077: // Can't reserve with NarrowOopShift == 0 kvn@1077: Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); kvn@1077: if (mode == UnscaledNarrowOop || kvn@1077: mode == ZeroBasedNarrowOop && total_size <= NarrowOopHeapMax) { kvn@1077: // Use zero based compressed oops with encoding and kvn@1077: // place heap's top on the 32Gb boundary in case kvn@1077: // total_size > 4Gb or failed to reserve below 4Gb. kvn@1492: base = (OopEncodingHeapMax - heap_size); kvn@1077: } kvn@1077: } hseigel@4523: hseigel@4523: // See if ZeroBaseNarrowOop encoding will work for a heap based at hseigel@4523: // (KlassEncodingMetaspaceMax - class_metaspace_size()). hseigel@4523: } else if (UseCompressedKlassPointers && (mode != HeapBasedNarrowOop) && hseigel@4523: (Universe::class_metaspace_size() + HeapBaseMinAddress <= KlassEncodingMetaspaceMax) && hseigel@4523: (KlassEncodingMetaspaceMax + heap_size - Universe::class_metaspace_size() <= OopEncodingHeapMax)) { hseigel@4523: base = (KlassEncodingMetaspaceMax - Universe::class_metaspace_size()); kvn@1077: } else { hseigel@4523: // UnscaledNarrowOop encoding didn't work, and no base was found for ZeroBasedOops or hseigel@4523: // HeapBasedNarrowOop encoding was requested. So, can't reserve below 32Gb. kvn@1077: Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); kvn@1077: } hseigel@4523: kvn@1492: // Set narrow_oop_base and narrow_oop_use_implicit_null_checks kvn@1492: // used in ReservedHeapSpace() constructors. kvn@1492: // The final values will be set in initialize_heap() below. hseigel@4523: if ((base != 0) && ((base + heap_size) <= OopEncodingHeapMax) && hseigel@4523: (!UseCompressedKlassPointers || (base + Universe::class_metaspace_size()) <= KlassEncodingMetaspaceMax)) { kvn@1492: // Use zero based compressed oops kvn@1492: Universe::set_narrow_oop_base(NULL); kvn@1492: // Don't need guard page for implicit checks in indexed kvn@1492: // addressing mode with zero based Compressed Oops. kvn@1492: Universe::set_narrow_oop_use_implicit_null_checks(true); kvn@1492: } else { kvn@1492: // Set to a non-NULL value so the ReservedSpace ctor computes kvn@1492: // the correct no-access prefix. kvn@1492: // The final value will be set in initialize_heap() below. kvn@1492: Universe::set_narrow_oop_base((address)NarrowOopHeapMax); kvn@1492: #ifdef _WIN64 kvn@1492: if (UseLargePages) { kvn@1492: // Cannot allocate guard pages for implicit checks in indexed kvn@1492: // addressing mode when large pages are specified on windows. kvn@1492: Universe::set_narrow_oop_use_implicit_null_checks(false); kvn@1492: } kvn@1492: #endif // _WIN64 kvn@1492: } kvn@1077: } kvn@1077: #endif kvn@1492: return (char*)base; // also return NULL (don't care) for 32-bit VM kvn@1077: } kvn@1077: duke@435: jint Universe::initialize_heap() { duke@435: duke@435: if (UseParallelGC) { jprovino@4542: #if INCLUDE_ALL_GCS duke@435: Universe::_collectedHeap = new ParallelScavengeHeap(); jprovino@4542: #else // INCLUDE_ALL_GCS jprovino@4165: fatal("UseParallelGC not supported in this VM."); jprovino@4542: #endif // INCLUDE_ALL_GCS duke@435: ysr@777: } else if (UseG1GC) { jprovino@4542: #if INCLUDE_ALL_GCS tonyp@3209: G1CollectorPolicy* g1p = new G1CollectorPolicy(); ysr@777: G1CollectedHeap* g1h = new G1CollectedHeap(g1p); ysr@777: Universe::_collectedHeap = g1h; jprovino@4542: #else // INCLUDE_ALL_GCS ysr@777: fatal("UseG1GC not supported in java kernel vm."); jprovino@4542: #endif // INCLUDE_ALL_GCS ysr@777: duke@435: } else { duke@435: GenCollectorPolicy *gc_policy; duke@435: duke@435: if (UseSerialGC) { duke@435: gc_policy = new MarkSweepPolicy(); duke@435: } else if (UseConcMarkSweepGC) { jprovino@4542: #if INCLUDE_ALL_GCS duke@435: if (UseAdaptiveSizePolicy) { duke@435: gc_policy = new ASConcurrentMarkSweepPolicy(); duke@435: } else { duke@435: gc_policy = new ConcurrentMarkSweepPolicy(); duke@435: } jprovino@4542: #else // INCLUDE_ALL_GCS jprovino@4165: fatal("UseConcMarkSweepGC not supported in this VM."); jprovino@4542: #endif // INCLUDE_ALL_GCS duke@435: } else { // default old generation duke@435: gc_policy = new MarkSweepPolicy(); duke@435: } duke@435: duke@435: Universe::_collectedHeap = new GenCollectedHeap(gc_policy); duke@435: } duke@435: duke@435: jint status = Universe::heap()->initialize(); duke@435: if (status != JNI_OK) { duke@435: return status; duke@435: } kvn@1077: kvn@1077: #ifdef _LP64 coleenp@548: if (UseCompressedOops) { coleenp@548: // Subtract a page because something can get allocated at heap base. coleenp@548: // This also makes implicit null checking work, because the coleenp@548: // memory+1 page below heap_base needs to cause a signal. coleenp@548: // See needs_explicit_null_check. coleenp@548: // Only set the heap base for compressed oops because it indicates coleenp@548: // compressed oops for pstack code. kvn@2403: bool verbose = PrintCompressedOopsMode || (PrintMiscellaneous && Verbose); kvn@2403: if (verbose) { kvn@1077: tty->cr(); kvn@2305: tty->print("heap address: " PTR_FORMAT ", size: " SIZE_FORMAT " MB", kvn@2305: Universe::heap()->base(), Universe::heap()->reserved_region().byte_size()/M); kvn@1077: } hseigel@4523: if (((uint64_t)Universe::heap()->reserved_region().end() > OopEncodingHeapMax) || hseigel@4523: (UseCompressedKlassPointers && hseigel@4523: ((uint64_t)Universe::heap()->base() + Universe::class_metaspace_size() > KlassEncodingMetaspaceMax))) { kvn@1077: // Can't reserve heap below 32Gb. roland@4159: // keep the Universe::narrow_oop_base() set in Universe::reserve_heap() kvn@1077: Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); kvn@2403: if (verbose) { kvn@1077: tty->print(", Compressed Oops with base: "PTR_FORMAT, Universe::narrow_oop_base()); kvn@1077: } kvn@1077: } else { kvn@1077: Universe::set_narrow_oop_base(0); kvn@2403: if (verbose) { kvn@1077: tty->print(", zero based Compressed Oops"); kvn@1077: } kvn@1077: #ifdef _WIN64 kvn@1077: if (!Universe::narrow_oop_use_implicit_null_checks()) { kvn@1077: // Don't need guard page for implicit checks in indexed addressing kvn@1077: // mode with zero based Compressed Oops. kvn@1077: Universe::set_narrow_oop_use_implicit_null_checks(true); kvn@1077: } kvn@1077: #endif // _WIN64 kvn@1077: if((uint64_t)Universe::heap()->reserved_region().end() > NarrowOopHeapMax) { kvn@1077: // Can't reserve heap below 4Gb. kvn@1077: Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes); kvn@1077: } else { kvn@1357: Universe::set_narrow_oop_shift(0); kvn@2403: if (verbose) { kvn@1077: tty->print(", 32-bits Oops"); kvn@1077: } kvn@1077: } kvn@1077: } kvn@2403: if (verbose) { kvn@1077: tty->cr(); kvn@1077: tty->cr(); kvn@1077: } roland@4159: if (UseCompressedKlassPointers) { roland@4159: Universe::set_narrow_klass_base(Universe::narrow_oop_base()); roland@4159: Universe::set_narrow_klass_shift(MIN2(Universe::narrow_oop_shift(), LogKlassAlignmentInBytes)); roland@4159: } roland@4159: Universe::set_narrow_ptrs_base(Universe::narrow_oop_base()); coleenp@548: } roland@4159: // Universe::narrow_oop_base() is one page below the metaspace roland@4159: // base. The actual metaspace base depends on alignment constraints roland@4159: // so we don't know its exact location here. roland@4159: assert((intptr_t)Universe::narrow_oop_base() <= (intptr_t)(Universe::heap()->base() - os::vm_page_size() - ClassMetaspaceSize) || kvn@1077: Universe::narrow_oop_base() == NULL, "invalid value"); kvn@1077: assert(Universe::narrow_oop_shift() == LogMinObjAlignmentInBytes || kvn@1077: Universe::narrow_oop_shift() == 0, "invalid value"); kvn@1077: #endif duke@435: duke@435: // We will never reach the CATCH below since Exceptions::_throw will cause duke@435: // the VM to exit if an exception is thrown during initialization duke@435: duke@435: if (UseTLAB) { duke@435: assert(Universe::heap()->supports_tlab_allocation(), duke@435: "Should support thread-local allocation buffers"); duke@435: ThreadLocalAllocBuffer::startup_initialization(); duke@435: } duke@435: return JNI_OK; duke@435: } duke@435: coleenp@4037: coleenp@4037: // Reserve the Java heap, which is now the same for all GCs. coleenp@4037: ReservedSpace Universe::reserve_heap(size_t heap_size, size_t alignment) { coleenp@4037: // Add in the class metaspace area so the classes in the headers can coleenp@4037: // be compressed the same as instances. roland@4159: // Need to round class space size up because it's below the heap and roland@4159: // the actual alignment depends on its size. hseigel@4523: Universe::set_class_metaspace_size(align_size_up(ClassMetaspaceSize, alignment)); hseigel@4523: size_t total_reserved = align_size_up(heap_size + Universe::class_metaspace_size(), alignment); brutisso@4741: assert(!UseCompressedOops || (total_reserved <= (OopEncodingHeapMax - os::vm_page_size())), brutisso@4741: "heap size is too big for compressed oops"); coleenp@4037: char* addr = Universe::preferred_heap_base(total_reserved, Universe::UnscaledNarrowOop); coleenp@4037: coleenp@4037: ReservedHeapSpace total_rs(total_reserved, alignment, UseLargePages, addr); coleenp@4037: coleenp@4037: if (UseCompressedOops) { coleenp@4037: if (addr != NULL && !total_rs.is_reserved()) { coleenp@4037: // Failed to reserve at specified address - the requested memory coleenp@4037: // region is taken already, for example, by 'java' launcher. coleenp@4037: // Try again to reserver heap higher. coleenp@4037: addr = Universe::preferred_heap_base(total_reserved, Universe::ZeroBasedNarrowOop); coleenp@4037: coleenp@4037: ReservedHeapSpace total_rs0(total_reserved, alignment, coleenp@4037: UseLargePages, addr); coleenp@4037: coleenp@4037: if (addr != NULL && !total_rs0.is_reserved()) { coleenp@4037: // Failed to reserve at specified address again - give up. coleenp@4037: addr = Universe::preferred_heap_base(total_reserved, Universe::HeapBasedNarrowOop); coleenp@4037: assert(addr == NULL, ""); coleenp@4037: coleenp@4037: ReservedHeapSpace total_rs1(total_reserved, alignment, coleenp@4037: UseLargePages, addr); coleenp@4037: total_rs = total_rs1; coleenp@4037: } else { coleenp@4037: total_rs = total_rs0; coleenp@4037: } coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: if (!total_rs.is_reserved()) { coleenp@4037: vm_exit_during_initialization(err_msg("Could not reserve enough space for object heap %d bytes", total_reserved)); coleenp@4037: return total_rs; coleenp@4037: } coleenp@4037: roland@4159: // Split the reserved space into main Java heap and a space for roland@4159: // classes so that they can be compressed using the same algorithm roland@4159: // as compressed oops. If compress oops and compress klass ptrs are roland@4159: // used we need the meta space first: if the alignment used for roland@4159: // compressed oops is greater than the one used for compressed klass roland@4159: // ptrs, a metadata space on top of the heap could become roland@4159: // unreachable. hseigel@4523: ReservedSpace class_rs = total_rs.first_part(Universe::class_metaspace_size()); hseigel@4523: ReservedSpace heap_rs = total_rs.last_part(Universe::class_metaspace_size(), alignment); coleenp@4037: Metaspace::initialize_class_space(class_rs); roland@4159: roland@4159: if (UseCompressedOops) { roland@4159: // Universe::initialize_heap() will reset this to NULL if unscaled roland@4159: // or zero-based narrow oops are actually used. roland@4159: address base = (address)(total_rs.base() - os::vm_page_size()); roland@4159: Universe::set_narrow_oop_base(base); roland@4159: } coleenp@4037: return heap_rs; coleenp@4037: } coleenp@4037: coleenp@4037: duke@435: // It's the caller's repsonsibility to ensure glitch-freedom duke@435: // (if required). duke@435: void Universe::update_heap_info_at_gc() { duke@435: _heap_capacity_at_last_gc = heap()->capacity(); duke@435: _heap_used_at_last_gc = heap()->used(); duke@435: } duke@435: duke@435: duke@435: duke@435: void universe2_init() { duke@435: EXCEPTION_MARK; duke@435: Universe::genesis(CATCH); duke@435: } duke@435: duke@435: duke@435: // This function is defined in JVM.cpp duke@435: extern void initialize_converter_functions(); duke@435: duke@435: bool universe_post_init() { ysr@2301: assert(!is_init_completed(), "Error: initialization not yet completed!"); duke@435: Universe::_fully_initialized = true; duke@435: EXCEPTION_MARK; duke@435: { ResourceMark rm; duke@435: Interpreter::initialize(); // needed for interpreter entry points duke@435: if (!UseSharedSpaces) { coleenp@4037: HandleMark hm(THREAD); never@1577: KlassHandle ok_h(THREAD, SystemDictionary::Object_klass()); duke@435: Universe::reinitialize_vtable_of(ok_h, CHECK_false); duke@435: Universe::reinitialize_itables(CHECK_false); duke@435: } duke@435: } duke@435: coleenp@4037: HandleMark hm(THREAD); coleenp@4037: Klass* k; duke@435: instanceKlassHandle k_h; duke@435: // Setup preallocated empty java.lang.Class array never@1577: Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::Class_klass(), 0, CHECK_false); coleenp@4037: duke@435: // Setup preallocated OutOfMemoryError errors coleenp@2497: k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_OutOfMemoryError(), true, CHECK_false); duke@435: k_h = instanceKlassHandle(THREAD, k); coleenp@4037: Universe::_out_of_memory_error_java_heap = k_h->allocate_instance(CHECK_false); coleenp@4037: Universe::_out_of_memory_error_perm_gen = k_h->allocate_instance(CHECK_false); coleenp@4037: Universe::_out_of_memory_error_array_size = k_h->allocate_instance(CHECK_false); duke@435: Universe::_out_of_memory_error_gc_overhead_limit = coleenp@4037: k_h->allocate_instance(CHECK_false); duke@435: duke@435: // Setup preallocated NullPointerException duke@435: // (this is currently used for a cheap & dirty solution in compiler exception handling) coleenp@2497: k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_NullPointerException(), true, CHECK_false); coleenp@4037: Universe::_null_ptr_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false); duke@435: // Setup preallocated ArithmeticException duke@435: // (this is currently used for a cheap & dirty solution in compiler exception handling) coleenp@2497: k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_ArithmeticException(), true, CHECK_false); coleenp@4037: Universe::_arithmetic_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false); duke@435: // Virtual Machine Error for when we get into a situation we can't resolve duke@435: k = SystemDictionary::resolve_or_fail( coleenp@2497: vmSymbols::java_lang_VirtualMachineError(), true, CHECK_false); coleenp@4037: bool linked = InstanceKlass::cast(k)->link_class_or_fail(CHECK_false); duke@435: if (!linked) { duke@435: tty->print_cr("Unable to link/verify VirtualMachineError class"); duke@435: return false; // initialization failed duke@435: } duke@435: Universe::_virtual_machine_error_instance = coleenp@4037: InstanceKlass::cast(k)->allocate_instance(CHECK_false); coleenp@2497: coleenp@4037: Universe::_vm_exception = InstanceKlass::cast(k)->allocate_instance(CHECK_false); coleenp@2497: duke@435: if (!DumpSharedSpaces) { duke@435: // These are the only Java fields that are currently set during shared space dumping. duke@435: // We prefer to not handle this generally, so we always reinitialize these detail messages. duke@435: Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false); duke@435: java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg()); duke@435: coleenp@4037: msg = java_lang_String::create_from_str("Metadata space", CHECK_false); duke@435: java_lang_Throwable::set_message(Universe::_out_of_memory_error_perm_gen, msg()); duke@435: duke@435: msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false); duke@435: java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg()); duke@435: duke@435: msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false); duke@435: java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg()); duke@435: duke@435: msg = java_lang_String::create_from_str("/ by zero", CHECK_false); duke@435: java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg()); duke@435: duke@435: // Setup the array of errors that have preallocated backtrace duke@435: k = Universe::_out_of_memory_error_java_heap->klass(); coleenp@4037: assert(k->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error"); duke@435: k_h = instanceKlassHandle(THREAD, k); duke@435: duke@435: int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0; duke@435: Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false); duke@435: for (int i=0; iallocate_instance(CHECK_false); duke@435: Handle err_h = Handle(THREAD, err); duke@435: java_lang_Throwable::allocate_backtrace(err_h, CHECK_false); duke@435: Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h()); duke@435: } duke@435: Universe::_preallocated_out_of_memory_error_avail_count = (jint)len; duke@435: } duke@435: duke@435: duke@435: // Setup static method for registering finalizers duke@435: // The finalizer klass must be linked before looking up the method, in duke@435: // case it needs to get rewritten. coleenp@4037: InstanceKlass::cast(SystemDictionary::Finalizer_klass())->link_class(CHECK_false); coleenp@4037: Method* m = InstanceKlass::cast(SystemDictionary::Finalizer_klass())->find_method( duke@435: vmSymbols::register_method_name(), duke@435: vmSymbols::register_method_signature()); duke@435: if (m == NULL || !m->is_static()) { duke@435: THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), duke@435: "java.lang.ref.Finalizer.register", false); duke@435: } duke@435: Universe::_finalizer_register_cache->init( never@1577: SystemDictionary::Finalizer_klass(), m, CHECK_false); duke@435: duke@435: // Resolve on first use and initialize class. duke@435: // Note: No race-condition here, since a resolve will always return the same result duke@435: duke@435: // Setup method for security checks coleenp@2497: k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_reflect_Method(), true, CHECK_false); duke@435: k_h = instanceKlassHandle(THREAD, k); duke@435: k_h->link_class(CHECK_false); jrose@1862: m = k_h->find_method(vmSymbols::invoke_name(), vmSymbols::object_object_array_object_signature()); duke@435: if (m == NULL || m->is_static()) { duke@435: THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), duke@435: "java.lang.reflect.Method.invoke", false); duke@435: } duke@435: Universe::_reflect_invoke_cache->init(k_h(), m, CHECK_false); duke@435: coleenp@4062: // Setup method for registering loaded classes in class loader vector coleenp@4062: InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->link_class(CHECK_false); coleenp@4062: m = InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->find_method(vmSymbols::addClass_name(), vmSymbols::class_void_signature()); coleenp@4062: if (m == NULL || m->is_static()) { coleenp@4062: THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), coleenp@4062: "java.lang.ClassLoader.addClass", false); coleenp@4062: } coleenp@4062: Universe::_loader_addClass_cache->init( coleenp@4062: SystemDictionary::ClassLoader_klass(), m, CHECK_false); coleenp@4062: duke@435: // The folowing is initializing converter functions for serialization in duke@435: // JVM.cpp. If we clean up the StrictMath code above we may want to find duke@435: // a better solution for this as well. duke@435: initialize_converter_functions(); duke@435: duke@435: // This needs to be done before the first scavenge/gc, since duke@435: // it's an input to soft ref clearing policy. ysr@777: { ysr@777: MutexLocker x(Heap_lock); ysr@777: Universe::update_heap_info_at_gc(); ysr@777: } duke@435: duke@435: // ("weak") refs processing infrastructure initialization duke@435: Universe::heap()->post_initialize(); duke@435: coleenp@4037: // Initialize performance counters for metaspaces coleenp@4037: MetaspaceCounters::initialize_performance_counters(); coleenp@4037: duke@435: GC_locker::unlock(); // allow gc after bootstrapping duke@435: duke@435: MemoryService::set_universe_heap(Universe::_collectedHeap); duke@435: return true; duke@435: } duke@435: duke@435: duke@435: void Universe::compute_base_vtable_size() { duke@435: _base_vtable_size = ClassLoader::compute_Object_vtable(); duke@435: } duke@435: duke@435: duke@435: // %%% The Universe::flush_foo methods belong in CodeCache. duke@435: duke@435: // Flushes compiled methods dependent on dependee. duke@435: void Universe::flush_dependents_on(instanceKlassHandle dependee) { duke@435: assert_lock_strong(Compile_lock); duke@435: duke@435: if (CodeCache::number_of_nmethods_with_dependencies() == 0) return; duke@435: duke@435: // CodeCache can only be updated by a thread_in_VM and they will all be duke@435: // stopped dring the safepoint so CodeCache will be safe to update without duke@435: // holding the CodeCache_lock. duke@435: twisti@3050: KlassDepChange changes(dependee); duke@435: duke@435: // Compute the dependent nmethods duke@435: if (CodeCache::mark_for_deoptimization(changes) > 0) { duke@435: // At least one nmethod has been marked for deoptimization duke@435: VM_Deoptimize op; duke@435: VMThread::execute(&op); duke@435: } duke@435: } duke@435: twisti@3050: // Flushes compiled methods dependent on a particular CallSite twisti@3050: // instance when its target is different than the given MethodHandle. twisti@3050: void Universe::flush_dependents_on(Handle call_site, Handle method_handle) { twisti@3050: assert_lock_strong(Compile_lock); twisti@3050: twisti@3050: if (CodeCache::number_of_nmethods_with_dependencies() == 0) return; twisti@3050: twisti@3050: // CodeCache can only be updated by a thread_in_VM and they will all be twisti@3050: // stopped dring the safepoint so CodeCache will be safe to update without twisti@3050: // holding the CodeCache_lock. twisti@3050: twisti@3050: CallSiteDepChange changes(call_site(), method_handle()); twisti@3050: twisti@3050: // Compute the dependent nmethods that have a reference to a coleenp@4037: // CallSite object. We use InstanceKlass::mark_dependent_nmethod twisti@3050: // directly instead of CodeCache::mark_for_deoptimization because we twisti@3094: // want dependents on the call site class only not all classes in twisti@3094: // the ContextStream. twisti@3050: int marked = 0; twisti@3050: { twisti@3050: MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); coleenp@4037: InstanceKlass* call_site_klass = InstanceKlass::cast(call_site->klass()); twisti@3050: marked = call_site_klass->mark_dependent_nmethods(changes); twisti@3050: } twisti@3050: if (marked > 0) { twisti@3050: // At least one nmethod has been marked for deoptimization twisti@3050: VM_Deoptimize op; twisti@3050: VMThread::execute(&op); twisti@3050: } twisti@3050: } twisti@3050: duke@435: #ifdef HOTSWAP duke@435: // Flushes compiled methods dependent on dependee in the evolutionary sense duke@435: void Universe::flush_evol_dependents_on(instanceKlassHandle ev_k_h) { duke@435: // --- Compile_lock is not held. However we are at a safepoint. duke@435: assert_locked_or_safepoint(Compile_lock); duke@435: if (CodeCache::number_of_nmethods_with_dependencies() == 0) return; duke@435: duke@435: // CodeCache can only be updated by a thread_in_VM and they will all be duke@435: // stopped dring the safepoint so CodeCache will be safe to update without duke@435: // holding the CodeCache_lock. duke@435: duke@435: // Compute the dependent nmethods duke@435: if (CodeCache::mark_for_evol_deoptimization(ev_k_h) > 0) { duke@435: // At least one nmethod has been marked for deoptimization duke@435: duke@435: // All this already happens inside a VM_Operation, so we'll do all the work here. duke@435: // Stuff copied from VM_Deoptimize and modified slightly. duke@435: duke@435: // We do not want any GCs to happen while we are in the middle of this VM operation duke@435: ResourceMark rm; duke@435: DeoptimizationMarker dm; duke@435: duke@435: // Deoptimize all activations depending on marked nmethods duke@435: Deoptimization::deoptimize_dependents(); duke@435: duke@435: // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies) duke@435: CodeCache::make_marked_nmethods_not_entrant(); duke@435: } duke@435: } duke@435: #endif // HOTSWAP duke@435: duke@435: duke@435: // Flushes compiled methods dependent on dependee duke@435: void Universe::flush_dependents_on_method(methodHandle m_h) { duke@435: // --- Compile_lock is not held. However we are at a safepoint. duke@435: assert_locked_or_safepoint(Compile_lock); duke@435: duke@435: // CodeCache can only be updated by a thread_in_VM and they will all be duke@435: // stopped dring the safepoint so CodeCache will be safe to update without duke@435: // holding the CodeCache_lock. duke@435: duke@435: // Compute the dependent nmethods duke@435: if (CodeCache::mark_for_deoptimization(m_h()) > 0) { duke@435: // At least one nmethod has been marked for deoptimization duke@435: duke@435: // All this already happens inside a VM_Operation, so we'll do all the work here. duke@435: // Stuff copied from VM_Deoptimize and modified slightly. duke@435: duke@435: // We do not want any GCs to happen while we are in the middle of this VM operation duke@435: ResourceMark rm; duke@435: DeoptimizationMarker dm; duke@435: duke@435: // Deoptimize all activations depending on marked nmethods duke@435: Deoptimization::deoptimize_dependents(); duke@435: duke@435: // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies) duke@435: CodeCache::make_marked_nmethods_not_entrant(); duke@435: } duke@435: } duke@435: tonyp@3269: void Universe::print() { tonyp@3269: print_on(gclog_or_tty); tonyp@3269: } duke@435: tonyp@3269: void Universe::print_on(outputStream* st, bool extended) { duke@435: st->print_cr("Heap"); tonyp@3269: if (!extended) { tonyp@3269: heap()->print_on(st); tonyp@3269: } else { tonyp@3269: heap()->print_extended_on(st); tonyp@3269: } duke@435: } duke@435: duke@435: void Universe::print_heap_at_SIGBREAK() { duke@435: if (PrintHeapAtSIGBREAK) { duke@435: MutexLocker hl(Heap_lock); duke@435: print_on(tty); duke@435: tty->cr(); duke@435: tty->flush(); duke@435: } duke@435: } duke@435: never@3571: void Universe::print_heap_before_gc(outputStream* st, bool ignore_extended) { duke@435: st->print_cr("{Heap before GC invocations=%u (full %u):", duke@435: heap()->total_collections(), duke@435: heap()->total_full_collections()); never@3571: if (!PrintHeapAtGCExtended || ignore_extended) { tonyp@3269: heap()->print_on(st); tonyp@3269: } else { tonyp@3269: heap()->print_extended_on(st); tonyp@3269: } duke@435: } duke@435: never@3571: void Universe::print_heap_after_gc(outputStream* st, bool ignore_extended) { duke@435: st->print_cr("Heap after GC invocations=%u (full %u):", duke@435: heap()->total_collections(), duke@435: heap()->total_full_collections()); never@3571: if (!PrintHeapAtGCExtended || ignore_extended) { tonyp@3269: heap()->print_on(st); tonyp@3269: } else { tonyp@3269: heap()->print_extended_on(st); tonyp@3269: } duke@435: st->print_cr("}"); duke@435: } duke@435: brutisso@3711: void Universe::verify(bool silent, VerifyOption option) { duke@435: // The use of _verify_in_progress is a temporary work around for duke@435: // 6320749. Don't bother with a creating a class to set and clear duke@435: // it since it is only used in this method and the control flow is duke@435: // straight forward. duke@435: _verify_in_progress = true; duke@435: duke@435: COMPILER2_PRESENT( duke@435: assert(!DerivedPointerTable::is_active(), duke@435: "DPT should not be active during verification " duke@435: "(of thread stacks below)"); duke@435: ) duke@435: duke@435: ResourceMark rm; duke@435: HandleMark hm; // Handles created during verification can be zapped duke@435: _verify_count++; duke@435: duke@435: if (!silent) gclog_or_tty->print("[Verifying "); duke@435: if (!silent) gclog_or_tty->print("threads "); duke@435: Threads::verify(); brutisso@3711: heap()->verify(silent, option); duke@435: duke@435: if (!silent) gclog_or_tty->print("syms "); duke@435: SymbolTable::verify(); duke@435: if (!silent) gclog_or_tty->print("strs "); duke@435: StringTable::verify(); duke@435: { duke@435: MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); duke@435: if (!silent) gclog_or_tty->print("zone "); duke@435: CodeCache::verify(); duke@435: } duke@435: if (!silent) gclog_or_tty->print("dict "); duke@435: SystemDictionary::verify(); coleenp@4037: #ifndef PRODUCT coleenp@4037: if (!silent) gclog_or_tty->print("cldg "); coleenp@4037: ClassLoaderDataGraph::verify(); coleenp@4037: #endif mgerdin@4264: if (!silent) gclog_or_tty->print("metaspace chunks "); mgerdin@4264: MetaspaceAux::verify_free_chunks(); duke@435: if (!silent) gclog_or_tty->print("hand "); duke@435: JNIHandles::verify(); duke@435: if (!silent) gclog_or_tty->print("C-heap "); duke@435: os::check_heap(); never@2657: if (!silent) gclog_or_tty->print("code cache "); never@2657: CodeCache::verify_oops(); duke@435: if (!silent) gclog_or_tty->print_cr("]"); duke@435: duke@435: _verify_in_progress = false; duke@435: } duke@435: duke@435: // Oop verification (see MacroAssembler::verify_oop) duke@435: duke@435: static uintptr_t _verify_oop_data[2] = {0, (uintptr_t)-1}; duke@435: static uintptr_t _verify_klass_data[2] = {0, (uintptr_t)-1}; duke@435: duke@435: duke@435: static void calculate_verify_data(uintptr_t verify_data[2], duke@435: HeapWord* low_boundary, duke@435: HeapWord* high_boundary) { duke@435: assert(low_boundary < high_boundary, "bad interval"); duke@435: duke@435: // decide which low-order bits we require to be clear: duke@435: size_t alignSize = MinObjAlignmentInBytes; kvn@1926: size_t min_object_size = CollectedHeap::min_fill_size(); duke@435: duke@435: // make an inclusive limit: duke@435: uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize; duke@435: uintptr_t min = (uintptr_t)low_boundary; duke@435: assert(min < max, "bad interval"); duke@435: uintptr_t diff = max ^ min; duke@435: duke@435: // throw away enough low-order bits to make the diff vanish duke@435: uintptr_t mask = (uintptr_t)(-1); duke@435: while ((mask & diff) != 0) duke@435: mask <<= 1; duke@435: uintptr_t bits = (min & mask); duke@435: assert(bits == (max & mask), "correct mask"); duke@435: // check an intermediate value between min and max, just to make sure: duke@435: assert(bits == ((min + (max-min)/2) & mask), "correct mask"); duke@435: duke@435: // require address alignment, too: duke@435: mask |= (alignSize - 1); duke@435: duke@435: if (!(verify_data[0] == 0 && verify_data[1] == (uintptr_t)-1)) { duke@435: assert(verify_data[0] == mask && verify_data[1] == bits, "mask stability"); duke@435: } duke@435: verify_data[0] = mask; duke@435: verify_data[1] = bits; duke@435: } duke@435: duke@435: duke@435: // Oop verification (see MacroAssembler::verify_oop) duke@435: #ifndef PRODUCT duke@435: duke@435: uintptr_t Universe::verify_oop_mask() { duke@435: MemRegion m = heap()->reserved_region(); duke@435: calculate_verify_data(_verify_oop_data, duke@435: m.start(), duke@435: m.end()); duke@435: return _verify_oop_data[0]; duke@435: } duke@435: duke@435: duke@435: duke@435: uintptr_t Universe::verify_oop_bits() { duke@435: verify_oop_mask(); duke@435: return _verify_oop_data[1]; duke@435: } duke@435: duke@435: uintptr_t Universe::verify_mark_mask() { duke@435: return markOopDesc::lock_mask_in_place; duke@435: } duke@435: duke@435: uintptr_t Universe::verify_mark_bits() { duke@435: intptr_t mask = verify_mark_mask(); duke@435: intptr_t bits = (intptr_t)markOopDesc::prototype(); duke@435: assert((bits & ~mask) == 0, "no stray header bits"); duke@435: return bits; duke@435: } duke@435: #endif // PRODUCT duke@435: duke@435: duke@435: void Universe::compute_verify_oop_data() { duke@435: verify_oop_mask(); duke@435: verify_oop_bits(); duke@435: verify_mark_mask(); duke@435: verify_mark_bits(); duke@435: } duke@435: duke@435: coleenp@4037: void CommonMethodOopCache::init(Klass* k, Method* m, TRAPS) { duke@435: if (!UseSharedSpaces) { duke@435: _klass = k; duke@435: } duke@435: #ifndef PRODUCT duke@435: else { duke@435: // sharing initilization should have already set up _klass duke@435: assert(_klass != NULL, "just checking"); duke@435: } duke@435: #endif duke@435: duke@435: _method_idnum = m->method_idnum(); duke@435: assert(_method_idnum >= 0, "sanity check"); duke@435: } duke@435: duke@435: duke@435: ActiveMethodOopsCache::~ActiveMethodOopsCache() { duke@435: if (_prev_methods != NULL) { duke@435: delete _prev_methods; duke@435: _prev_methods = NULL; duke@435: } duke@435: } duke@435: duke@435: coleenp@4037: void ActiveMethodOopsCache::add_previous_version(Method* const method) { duke@435: assert(Thread::current()->is_VM_thread(), duke@435: "only VMThread can add previous versions"); duke@435: coleenp@4037: // Only append the previous method if it is executing on the stack. coleenp@4037: if (method->on_stack()) { coleenp@4037: duke@435: if (_prev_methods == NULL) { duke@435: // This is the first previous version so make some space. duke@435: // Start with 2 elements under the assumption that the class duke@435: // won't be redefined much. coleenp@4037: _prev_methods = new (ResourceObj::C_HEAP, mtClass) GrowableArray(2, true); duke@435: } duke@435: duke@435: // RC_TRACE macro has an embedded ResourceMark duke@435: RC_TRACE(0x00000100, duke@435: ("add: %s(%s): adding prev version ref for cached method @%d", duke@435: method->name()->as_C_string(), method->signature()->as_C_string(), duke@435: _prev_methods->length())); duke@435: coleenp@4037: _prev_methods->append(method); coleenp@4037: } duke@435: coleenp@4037: coleenp@4037: // Since the caller is the VMThread and we are at a safepoint, this is a good coleenp@4037: // time to clear out unused method references. coleenp@4037: coleenp@4037: if (_prev_methods == NULL) return; duke@435: duke@435: for (int i = _prev_methods->length() - 1; i >= 0; i--) { coleenp@4037: Method* method = _prev_methods->at(i); coleenp@4037: assert(method != NULL, "weak method ref was unexpectedly cleared"); coleenp@4037: coleenp@4037: if (!method->on_stack()) { coleenp@4037: // This method isn't running anymore so remove it duke@435: _prev_methods->remove_at(i); coleenp@4037: MetadataFactory::free_metadata(method->method_holder()->class_loader_data(), method); duke@435: } else { duke@435: // RC_TRACE macro has an embedded ResourceMark duke@435: RC_TRACE(0x00000400, ("add: %s(%s): previous cached method @%d is alive", coleenp@4037: method->name()->as_C_string(), method->signature()->as_C_string(), i)); duke@435: } duke@435: } duke@435: } // end add_previous_version() duke@435: duke@435: coleenp@4037: bool ActiveMethodOopsCache::is_same_method(Method* const method) const { coleenp@4037: InstanceKlass* ik = InstanceKlass::cast(klass()); coleenp@4037: Method* check_method = ik->method_with_idnum(method_idnum()); duke@435: assert(check_method != NULL, "sanity check"); duke@435: if (check_method == method) { duke@435: // done with the easy case duke@435: return true; duke@435: } duke@435: duke@435: if (_prev_methods != NULL) { duke@435: // The cached method has been redefined at least once so search duke@435: // the previous versions for a match. duke@435: for (int i = 0; i < _prev_methods->length(); i++) { coleenp@4037: check_method = _prev_methods->at(i); duke@435: if (check_method == method) { duke@435: // a previous version matches duke@435: return true; duke@435: } duke@435: } duke@435: } duke@435: duke@435: // either no previous versions or no previous version matched duke@435: return false; duke@435: } duke@435: duke@435: coleenp@4037: Method* LatestMethodOopCache::get_Method() { coleenp@4037: InstanceKlass* ik = InstanceKlass::cast(klass()); coleenp@4037: Method* m = ik->method_with_idnum(method_idnum()); duke@435: assert(m != NULL, "sanity check"); duke@435: return m; duke@435: } duke@435: duke@435: duke@435: #ifdef ASSERT duke@435: // Release dummy object(s) at bottom of heap duke@435: bool Universe::release_fullgc_alot_dummy() { duke@435: MutexLocker ml(FullGCALot_lock); duke@435: if (_fullgc_alot_dummy_array != NULL) { duke@435: if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) { duke@435: // No more dummies to release, release entire array instead duke@435: _fullgc_alot_dummy_array = NULL; duke@435: return false; duke@435: } duke@435: if (!UseConcMarkSweepGC) { duke@435: // Release dummy at bottom of old generation duke@435: _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL); duke@435: } duke@435: // Release dummy at bottom of permanent generation duke@435: _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL); duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: #endif // ASSERT