Wed, 23 Jan 2013 13:02:39 -0500
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
Summary: Rename INCLUDE_ALTERNATE_GCS to INCLUDE_ALL_GCS and replace SERIALGC with INCLUDE_ALL_GCS.
Reviewed-by: coleenp, stefank
1 /*
2 * Copyright (c) 1997, 2012, 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 */
25 #include "precompiled.hpp"
26 #include "classfile/classLoader.hpp"
27 #include "classfile/classLoaderData.hpp"
28 #include "classfile/javaClasses.hpp"
29 #include "classfile/symbolTable.hpp"
30 #include "classfile/systemDictionary.hpp"
31 #include "classfile/vmSymbols.hpp"
32 #include "code/codeCache.hpp"
33 #include "code/dependencies.hpp"
34 #include "gc_interface/collectedHeap.inline.hpp"
35 #include "interpreter/interpreter.hpp"
36 #include "memory/cardTableModRefBS.hpp"
37 #include "memory/gcLocker.inline.hpp"
38 #include "memory/genCollectedHeap.hpp"
39 #include "memory/genRemSet.hpp"
40 #include "memory/generation.hpp"
41 #include "memory/metadataFactory.hpp"
42 #include "memory/metaspaceShared.hpp"
43 #include "memory/oopFactory.hpp"
44 #include "memory/space.hpp"
45 #include "memory/universe.hpp"
46 #include "memory/universe.inline.hpp"
47 #include "oops/constantPool.hpp"
48 #include "oops/instanceClassLoaderKlass.hpp"
49 #include "oops/instanceKlass.hpp"
50 #include "oops/instanceMirrorKlass.hpp"
51 #include "oops/instanceRefKlass.hpp"
52 #include "oops/oop.inline.hpp"
53 #include "oops/typeArrayKlass.hpp"
54 #include "prims/jvmtiRedefineClassesTrace.hpp"
55 #include "runtime/aprofiler.hpp"
56 #include "runtime/arguments.hpp"
57 #include "runtime/deoptimization.hpp"
58 #include "runtime/fprofiler.hpp"
59 #include "runtime/handles.inline.hpp"
60 #include "runtime/init.hpp"
61 #include "runtime/java.hpp"
62 #include "runtime/javaCalls.hpp"
63 #include "runtime/sharedRuntime.hpp"
64 #include "runtime/synchronizer.hpp"
65 #include "runtime/thread.inline.hpp"
66 #include "runtime/timer.hpp"
67 #include "runtime/vm_operations.hpp"
68 #include "services/memoryService.hpp"
69 #include "utilities/copy.hpp"
70 #include "utilities/events.hpp"
71 #include "utilities/hashtable.inline.hpp"
72 #include "utilities/preserveException.hpp"
73 #include "utilities/macros.hpp"
74 #if INCLUDE_ALL_GCS
75 #include "gc_implementation/concurrentMarkSweep/cmsAdaptiveSizePolicy.hpp"
76 #include "gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.hpp"
77 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
78 #include "gc_implementation/g1/g1CollectorPolicy.hpp"
79 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
80 #endif // INCLUDE_ALL_GCS
82 // Known objects
83 Klass* Universe::_boolArrayKlassObj = NULL;
84 Klass* Universe::_byteArrayKlassObj = NULL;
85 Klass* Universe::_charArrayKlassObj = NULL;
86 Klass* Universe::_intArrayKlassObj = NULL;
87 Klass* Universe::_shortArrayKlassObj = NULL;
88 Klass* Universe::_longArrayKlassObj = NULL;
89 Klass* Universe::_singleArrayKlassObj = NULL;
90 Klass* Universe::_doubleArrayKlassObj = NULL;
91 Klass* Universe::_typeArrayKlassObjs[T_VOID+1] = { NULL /*, NULL...*/ };
92 Klass* Universe::_objectArrayKlassObj = NULL;
93 oop Universe::_int_mirror = NULL;
94 oop Universe::_float_mirror = NULL;
95 oop Universe::_double_mirror = NULL;
96 oop Universe::_byte_mirror = NULL;
97 oop Universe::_bool_mirror = NULL;
98 oop Universe::_char_mirror = NULL;
99 oop Universe::_long_mirror = NULL;
100 oop Universe::_short_mirror = NULL;
101 oop Universe::_void_mirror = NULL;
102 oop Universe::_mirrors[T_VOID+1] = { NULL /*, NULL...*/ };
103 oop Universe::_main_thread_group = NULL;
104 oop Universe::_system_thread_group = NULL;
105 objArrayOop Universe::_the_empty_class_klass_array = NULL;
106 Array<Klass*>* Universe::_the_array_interfaces_array = NULL;
107 oop Universe::_the_null_string = NULL;
108 oop Universe::_the_min_jint_string = NULL;
109 LatestMethodOopCache* Universe::_finalizer_register_cache = NULL;
110 LatestMethodOopCache* Universe::_loader_addClass_cache = NULL;
111 ActiveMethodOopsCache* Universe::_reflect_invoke_cache = NULL;
112 oop Universe::_out_of_memory_error_java_heap = NULL;
113 oop Universe::_out_of_memory_error_perm_gen = NULL;
114 oop Universe::_out_of_memory_error_array_size = NULL;
115 oop Universe::_out_of_memory_error_gc_overhead_limit = NULL;
116 objArrayOop Universe::_preallocated_out_of_memory_error_array = NULL;
117 volatile jint Universe::_preallocated_out_of_memory_error_avail_count = 0;
118 bool Universe::_verify_in_progress = false;
119 oop Universe::_null_ptr_exception_instance = NULL;
120 oop Universe::_arithmetic_exception_instance = NULL;
121 oop Universe::_virtual_machine_error_instance = NULL;
122 oop Universe::_vm_exception = NULL;
123 Array<int>* Universe::_the_empty_int_array = NULL;
124 Array<u2>* Universe::_the_empty_short_array = NULL;
125 Array<Klass*>* Universe::_the_empty_klass_array = NULL;
126 Array<Method*>* Universe::_the_empty_method_array = NULL;
128 // These variables are guarded by FullGCALot_lock.
129 debug_only(objArrayOop Universe::_fullgc_alot_dummy_array = NULL;)
130 debug_only(int Universe::_fullgc_alot_dummy_next = 0;)
132 // Heap
133 int Universe::_verify_count = 0;
135 int Universe::_base_vtable_size = 0;
136 bool Universe::_bootstrapping = false;
137 bool Universe::_fully_initialized = false;
139 size_t Universe::_heap_capacity_at_last_gc;
140 size_t Universe::_heap_used_at_last_gc = 0;
142 CollectedHeap* Universe::_collectedHeap = NULL;
144 NarrowPtrStruct Universe::_narrow_oop = { NULL, 0, true };
145 NarrowPtrStruct Universe::_narrow_klass = { NULL, 0, true };
146 address Universe::_narrow_ptrs_base;
149 void Universe::basic_type_classes_do(void f(Klass*)) {
150 f(boolArrayKlassObj());
151 f(byteArrayKlassObj());
152 f(charArrayKlassObj());
153 f(intArrayKlassObj());
154 f(shortArrayKlassObj());
155 f(longArrayKlassObj());
156 f(singleArrayKlassObj());
157 f(doubleArrayKlassObj());
158 }
160 void Universe::oops_do(OopClosure* f, bool do_all) {
162 f->do_oop((oop*) &_int_mirror);
163 f->do_oop((oop*) &_float_mirror);
164 f->do_oop((oop*) &_double_mirror);
165 f->do_oop((oop*) &_byte_mirror);
166 f->do_oop((oop*) &_bool_mirror);
167 f->do_oop((oop*) &_char_mirror);
168 f->do_oop((oop*) &_long_mirror);
169 f->do_oop((oop*) &_short_mirror);
170 f->do_oop((oop*) &_void_mirror);
172 for (int i = T_BOOLEAN; i < T_VOID+1; i++) {
173 f->do_oop((oop*) &_mirrors[i]);
174 }
175 assert(_mirrors[0] == NULL && _mirrors[T_BOOLEAN - 1] == NULL, "checking");
177 f->do_oop((oop*)&_the_empty_class_klass_array);
178 f->do_oop((oop*)&_the_null_string);
179 f->do_oop((oop*)&_the_min_jint_string);
180 f->do_oop((oop*)&_out_of_memory_error_java_heap);
181 f->do_oop((oop*)&_out_of_memory_error_perm_gen);
182 f->do_oop((oop*)&_out_of_memory_error_array_size);
183 f->do_oop((oop*)&_out_of_memory_error_gc_overhead_limit);
184 f->do_oop((oop*)&_preallocated_out_of_memory_error_array);
185 f->do_oop((oop*)&_null_ptr_exception_instance);
186 f->do_oop((oop*)&_arithmetic_exception_instance);
187 f->do_oop((oop*)&_virtual_machine_error_instance);
188 f->do_oop((oop*)&_main_thread_group);
189 f->do_oop((oop*)&_system_thread_group);
190 f->do_oop((oop*)&_vm_exception);
191 debug_only(f->do_oop((oop*)&_fullgc_alot_dummy_array);)
192 }
194 // Serialize metadata in and out of CDS archive, not oops.
195 void Universe::serialize(SerializeClosure* f, bool do_all) {
197 f->do_ptr((void**)&_boolArrayKlassObj);
198 f->do_ptr((void**)&_byteArrayKlassObj);
199 f->do_ptr((void**)&_charArrayKlassObj);
200 f->do_ptr((void**)&_intArrayKlassObj);
201 f->do_ptr((void**)&_shortArrayKlassObj);
202 f->do_ptr((void**)&_longArrayKlassObj);
203 f->do_ptr((void**)&_singleArrayKlassObj);
204 f->do_ptr((void**)&_doubleArrayKlassObj);
205 f->do_ptr((void**)&_objectArrayKlassObj);
207 {
208 for (int i = 0; i < T_VOID+1; i++) {
209 if (_typeArrayKlassObjs[i] != NULL) {
210 assert(i >= T_BOOLEAN, "checking");
211 f->do_ptr((void**)&_typeArrayKlassObjs[i]);
212 } else if (do_all) {
213 f->do_ptr((void**)&_typeArrayKlassObjs[i]);
214 }
215 }
216 }
218 f->do_ptr((void**)&_the_array_interfaces_array);
219 f->do_ptr((void**)&_the_empty_int_array);
220 f->do_ptr((void**)&_the_empty_short_array);
221 f->do_ptr((void**)&_the_empty_method_array);
222 f->do_ptr((void**)&_the_empty_klass_array);
223 _finalizer_register_cache->serialize(f);
224 _loader_addClass_cache->serialize(f);
225 _reflect_invoke_cache->serialize(f);
226 }
228 void Universe::check_alignment(uintx size, uintx alignment, const char* name) {
229 if (size < alignment || size % alignment != 0) {
230 ResourceMark rm;
231 stringStream st;
232 st.print("Size of %s (%ld bytes) must be aligned to %ld bytes", name, size, alignment);
233 char* error = st.as_string();
234 vm_exit_during_initialization(error);
235 }
236 }
238 void initialize_basic_type_klass(Klass* k, TRAPS) {
239 Klass* ok = SystemDictionary::Object_klass();
240 if (UseSharedSpaces) {
241 assert(k->super() == ok, "u3");
242 k->restore_unshareable_info(CHECK);
243 } else {
244 k->initialize_supers(ok, CHECK);
245 }
246 k->append_to_sibling_list();
247 }
249 void Universe::genesis(TRAPS) {
250 ResourceMark rm;
252 { FlagSetting fs(_bootstrapping, true);
254 { MutexLocker mc(Compile_lock);
256 // determine base vtable size; without that we cannot create the array klasses
257 compute_base_vtable_size();
259 if (!UseSharedSpaces) {
260 _boolArrayKlassObj = TypeArrayKlass::create_klass(T_BOOLEAN, sizeof(jboolean), CHECK);
261 _charArrayKlassObj = TypeArrayKlass::create_klass(T_CHAR, sizeof(jchar), CHECK);
262 _singleArrayKlassObj = TypeArrayKlass::create_klass(T_FLOAT, sizeof(jfloat), CHECK);
263 _doubleArrayKlassObj = TypeArrayKlass::create_klass(T_DOUBLE, sizeof(jdouble), CHECK);
264 _byteArrayKlassObj = TypeArrayKlass::create_klass(T_BYTE, sizeof(jbyte), CHECK);
265 _shortArrayKlassObj = TypeArrayKlass::create_klass(T_SHORT, sizeof(jshort), CHECK);
266 _intArrayKlassObj = TypeArrayKlass::create_klass(T_INT, sizeof(jint), CHECK);
267 _longArrayKlassObj = TypeArrayKlass::create_klass(T_LONG, sizeof(jlong), CHECK);
269 _typeArrayKlassObjs[T_BOOLEAN] = _boolArrayKlassObj;
270 _typeArrayKlassObjs[T_CHAR] = _charArrayKlassObj;
271 _typeArrayKlassObjs[T_FLOAT] = _singleArrayKlassObj;
272 _typeArrayKlassObjs[T_DOUBLE] = _doubleArrayKlassObj;
273 _typeArrayKlassObjs[T_BYTE] = _byteArrayKlassObj;
274 _typeArrayKlassObjs[T_SHORT] = _shortArrayKlassObj;
275 _typeArrayKlassObjs[T_INT] = _intArrayKlassObj;
276 _typeArrayKlassObjs[T_LONG] = _longArrayKlassObj;
278 ClassLoaderData* null_cld = ClassLoaderData::the_null_class_loader_data();
280 _the_array_interfaces_array = MetadataFactory::new_array<Klass*>(null_cld, 2, NULL, CHECK);
281 _the_empty_int_array = MetadataFactory::new_array<int>(null_cld, 0, CHECK);
282 _the_empty_short_array = MetadataFactory::new_array<u2>(null_cld, 0, CHECK);
283 _the_empty_method_array = MetadataFactory::new_array<Method*>(null_cld, 0, CHECK);
284 _the_empty_klass_array = MetadataFactory::new_array<Klass*>(null_cld, 0, CHECK);
285 }
286 }
288 vmSymbols::initialize(CHECK);
290 SystemDictionary::initialize(CHECK);
292 Klass* ok = SystemDictionary::Object_klass();
294 _the_null_string = StringTable::intern("null", CHECK);
295 _the_min_jint_string = StringTable::intern("-2147483648", CHECK);
297 if (UseSharedSpaces) {
298 // Verify shared interfaces array.
299 assert(_the_array_interfaces_array->at(0) ==
300 SystemDictionary::Cloneable_klass(), "u3");
301 assert(_the_array_interfaces_array->at(1) ==
302 SystemDictionary::Serializable_klass(), "u3");
303 } else {
304 // Set up shared interfaces array. (Do this before supers are set up.)
305 _the_array_interfaces_array->at_put(0, SystemDictionary::Cloneable_klass());
306 _the_array_interfaces_array->at_put(1, SystemDictionary::Serializable_klass());
307 }
309 initialize_basic_type_klass(boolArrayKlassObj(), CHECK);
310 initialize_basic_type_klass(charArrayKlassObj(), CHECK);
311 initialize_basic_type_klass(singleArrayKlassObj(), CHECK);
312 initialize_basic_type_klass(doubleArrayKlassObj(), CHECK);
313 initialize_basic_type_klass(byteArrayKlassObj(), CHECK);
314 initialize_basic_type_klass(shortArrayKlassObj(), CHECK);
315 initialize_basic_type_klass(intArrayKlassObj(), CHECK);
316 initialize_basic_type_klass(longArrayKlassObj(), CHECK);
317 } // end of core bootstrapping
319 // Maybe this could be lifted up now that object array can be initialized
320 // during the bootstrapping.
322 // OLD
323 // Initialize _objectArrayKlass after core bootstraping to make
324 // sure the super class is set up properly for _objectArrayKlass.
325 // ---
326 // NEW
327 // Since some of the old system object arrays have been converted to
328 // ordinary object arrays, _objectArrayKlass will be loaded when
329 // SystemDictionary::initialize(CHECK); is run. See the extra check
330 // for Object_klass_loaded in objArrayKlassKlass::allocate_objArray_klass_impl.
331 _objectArrayKlassObj = InstanceKlass::
332 cast(SystemDictionary::Object_klass())->array_klass(1, CHECK);
333 // OLD
334 // Add the class to the class hierarchy manually to make sure that
335 // its vtable is initialized after core bootstrapping is completed.
336 // ---
337 // New
338 // Have already been initialized.
339 _objectArrayKlassObj->append_to_sibling_list();
341 // Compute is_jdk version flags.
342 // Only 1.3 or later has the java.lang.Shutdown class.
343 // Only 1.4 or later has the java.lang.CharSequence interface.
344 // Only 1.5 or later has the java.lang.management.MemoryUsage class.
345 if (JDK_Version::is_partially_initialized()) {
346 uint8_t jdk_version;
347 Klass* k = SystemDictionary::resolve_or_null(
348 vmSymbols::java_lang_management_MemoryUsage(), THREAD);
349 CLEAR_PENDING_EXCEPTION; // ignore exceptions
350 if (k == NULL) {
351 k = SystemDictionary::resolve_or_null(
352 vmSymbols::java_lang_CharSequence(), THREAD);
353 CLEAR_PENDING_EXCEPTION; // ignore exceptions
354 if (k == NULL) {
355 k = SystemDictionary::resolve_or_null(
356 vmSymbols::java_lang_Shutdown(), THREAD);
357 CLEAR_PENDING_EXCEPTION; // ignore exceptions
358 if (k == NULL) {
359 jdk_version = 2;
360 } else {
361 jdk_version = 3;
362 }
363 } else {
364 jdk_version = 4;
365 }
366 } else {
367 jdk_version = 5;
368 }
369 JDK_Version::fully_initialize(jdk_version);
370 }
372 #ifdef ASSERT
373 if (FullGCALot) {
374 // Allocate an array of dummy objects.
375 // We'd like these to be at the bottom of the old generation,
376 // so that when we free one and then collect,
377 // (almost) the whole heap moves
378 // and we find out if we actually update all the oops correctly.
379 // But we can't allocate directly in the old generation,
380 // so we allocate wherever, and hope that the first collection
381 // moves these objects to the bottom of the old generation.
382 // We can allocate directly in the permanent generation, so we do.
383 int size;
384 if (UseConcMarkSweepGC) {
385 warning("Using +FullGCALot with concurrent mark sweep gc "
386 "will not force all objects to relocate");
387 size = FullGCALotDummies;
388 } else {
389 size = FullGCALotDummies * 2;
390 }
391 objArrayOop naked_array = oopFactory::new_objArray(SystemDictionary::Object_klass(), size, CHECK);
392 objArrayHandle dummy_array(THREAD, naked_array);
393 int i = 0;
394 while (i < size) {
395 // Allocate dummy in old generation
396 oop dummy = InstanceKlass::cast(SystemDictionary::Object_klass())->allocate_instance(CHECK);
397 dummy_array->obj_at_put(i++, dummy);
398 }
399 {
400 // Only modify the global variable inside the mutex.
401 // If we had a race to here, the other dummy_array instances
402 // and their elements just get dropped on the floor, which is fine.
403 MutexLocker ml(FullGCALot_lock);
404 if (_fullgc_alot_dummy_array == NULL) {
405 _fullgc_alot_dummy_array = dummy_array();
406 }
407 }
408 assert(i == _fullgc_alot_dummy_array->length(), "just checking");
409 }
410 #endif
412 // Initialize dependency array for null class loader
413 ClassLoaderData::the_null_class_loader_data()->init_dependencies(CHECK);
415 }
417 // CDS support for patching vtables in metadata in the shared archive.
418 // All types inherited from Metadata have vtables, but not types inherited
419 // from MetaspaceObj, because the latter does not have virtual functions.
420 // If the metadata type has a vtable, it cannot be shared in the read-only
421 // section of the CDS archive, because the vtable pointer is patched.
422 static inline void add_vtable(void** list, int* n, void* o, int count) {
423 guarantee((*n) < count, "vtable list too small");
424 void* vtable = dereference_vptr(o);
425 assert(*(void**)(vtable) != NULL, "invalid vtable");
426 list[(*n)++] = vtable;
427 }
429 void Universe::init_self_patching_vtbl_list(void** list, int count) {
430 int n = 0;
431 { InstanceKlass o; add_vtable(list, &n, &o, count); }
432 { InstanceClassLoaderKlass o; add_vtable(list, &n, &o, count); }
433 { InstanceMirrorKlass o; add_vtable(list, &n, &o, count); }
434 { InstanceRefKlass o; add_vtable(list, &n, &o, count); }
435 { TypeArrayKlass o; add_vtable(list, &n, &o, count); }
436 { ObjArrayKlass o; add_vtable(list, &n, &o, count); }
437 { Method o; add_vtable(list, &n, &o, count); }
438 { ConstantPool o; add_vtable(list, &n, &o, count); }
439 }
441 void Universe::initialize_basic_type_mirrors(TRAPS) {
442 assert(_int_mirror==NULL, "basic type mirrors already initialized");
443 _int_mirror =
444 java_lang_Class::create_basic_type_mirror("int", T_INT, CHECK);
445 _float_mirror =
446 java_lang_Class::create_basic_type_mirror("float", T_FLOAT, CHECK);
447 _double_mirror =
448 java_lang_Class::create_basic_type_mirror("double", T_DOUBLE, CHECK);
449 _byte_mirror =
450 java_lang_Class::create_basic_type_mirror("byte", T_BYTE, CHECK);
451 _bool_mirror =
452 java_lang_Class::create_basic_type_mirror("boolean",T_BOOLEAN, CHECK);
453 _char_mirror =
454 java_lang_Class::create_basic_type_mirror("char", T_CHAR, CHECK);
455 _long_mirror =
456 java_lang_Class::create_basic_type_mirror("long", T_LONG, CHECK);
457 _short_mirror =
458 java_lang_Class::create_basic_type_mirror("short", T_SHORT, CHECK);
459 _void_mirror =
460 java_lang_Class::create_basic_type_mirror("void", T_VOID, CHECK);
462 _mirrors[T_INT] = _int_mirror;
463 _mirrors[T_FLOAT] = _float_mirror;
464 _mirrors[T_DOUBLE] = _double_mirror;
465 _mirrors[T_BYTE] = _byte_mirror;
466 _mirrors[T_BOOLEAN] = _bool_mirror;
467 _mirrors[T_CHAR] = _char_mirror;
468 _mirrors[T_LONG] = _long_mirror;
469 _mirrors[T_SHORT] = _short_mirror;
470 _mirrors[T_VOID] = _void_mirror;
471 //_mirrors[T_OBJECT] = InstanceKlass::cast(_object_klass)->java_mirror();
472 //_mirrors[T_ARRAY] = InstanceKlass::cast(_object_klass)->java_mirror();
473 }
475 void Universe::fixup_mirrors(TRAPS) {
476 // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly,
477 // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply
478 // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note
479 // that the number of objects allocated at this point is very small.
480 assert(SystemDictionary::Class_klass_loaded(), "java.lang.Class should be loaded");
481 HandleMark hm(THREAD);
482 // Cache the start of the static fields
483 InstanceMirrorKlass::init_offset_of_static_fields();
485 GrowableArray <Klass*>* list = java_lang_Class::fixup_mirror_list();
486 int list_length = list->length();
487 for (int i = 0; i < list_length; i++) {
488 Klass* k = list->at(i);
489 assert(k->is_klass(), "List should only hold classes");
490 EXCEPTION_MARK;
491 KlassHandle kh(THREAD, k);
492 java_lang_Class::fixup_mirror(kh, CATCH);
493 }
494 delete java_lang_Class::fixup_mirror_list();
495 java_lang_Class::set_fixup_mirror_list(NULL);
496 }
498 static bool has_run_finalizers_on_exit = false;
500 void Universe::run_finalizers_on_exit() {
501 if (has_run_finalizers_on_exit) return;
502 has_run_finalizers_on_exit = true;
504 // Called on VM exit. This ought to be run in a separate thread.
505 if (TraceReferenceGC) tty->print_cr("Callback to run finalizers on exit");
506 {
507 PRESERVE_EXCEPTION_MARK;
508 KlassHandle finalizer_klass(THREAD, SystemDictionary::Finalizer_klass());
509 JavaValue result(T_VOID);
510 JavaCalls::call_static(
511 &result,
512 finalizer_klass,
513 vmSymbols::run_finalizers_on_exit_name(),
514 vmSymbols::void_method_signature(),
515 THREAD
516 );
517 // Ignore any pending exceptions
518 CLEAR_PENDING_EXCEPTION;
519 }
520 }
523 // initialize_vtable could cause gc if
524 // 1) we specified true to initialize_vtable and
525 // 2) this ran after gc was enabled
526 // In case those ever change we use handles for oops
527 void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) {
528 // init vtable of k and all subclasses
529 Klass* ko = k_h();
530 klassVtable* vt = ko->vtable();
531 if (vt) vt->initialize_vtable(false, CHECK);
532 if (ko->oop_is_instance()) {
533 InstanceKlass* ik = (InstanceKlass*)ko;
534 for (KlassHandle s_h(THREAD, ik->subklass()); s_h() != NULL; s_h = (THREAD, s_h()->next_sibling())) {
535 reinitialize_vtable_of(s_h, CHECK);
536 }
537 }
538 }
541 void initialize_itable_for_klass(Klass* k, TRAPS) {
542 InstanceKlass::cast(k)->itable()->initialize_itable(false, CHECK);
543 }
546 void Universe::reinitialize_itables(TRAPS) {
547 SystemDictionary::classes_do(initialize_itable_for_klass, CHECK);
549 }
552 bool Universe::on_page_boundary(void* addr) {
553 return ((uintptr_t) addr) % os::vm_page_size() == 0;
554 }
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 ((throwable() != Universe::_out_of_memory_error_java_heap) &&
564 (throwable() != Universe::_out_of_memory_error_perm_gen) &&
565 (throwable() != Universe::_out_of_memory_error_array_size) &&
566 (throwable() != Universe::_out_of_memory_error_gc_overhead_limit));
567 }
570 oop Universe::gen_out_of_memory_error(oop default_err) {
571 // generate an out of memory error:
572 // - if there is a preallocated error with backtrace available then return it wth
573 // a filled in stack trace.
574 // - if there are no preallocated errors with backtrace available then return
575 // an error without backtrace.
576 int next;
577 if (_preallocated_out_of_memory_error_avail_count > 0) {
578 next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count);
579 assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt");
580 } else {
581 next = -1;
582 }
583 if (next < 0) {
584 // all preallocated errors have been used.
585 // return default
586 return default_err;
587 } else {
588 // get the error object at the slot and set set it to NULL so that the
589 // array isn't keeping it alive anymore.
590 oop exc = preallocated_out_of_memory_errors()->obj_at(next);
591 assert(exc != NULL, "slot has been used already");
592 preallocated_out_of_memory_errors()->obj_at_put(next, NULL);
594 // use the message from the default error
595 oop msg = java_lang_Throwable::message(default_err);
596 assert(msg != NULL, "no message");
597 java_lang_Throwable::set_message(exc, msg);
599 // populate the stack trace and return it.
600 java_lang_Throwable::fill_in_stack_trace_of_preallocated_backtrace(exc);
601 return exc;
602 }
603 }
605 static intptr_t non_oop_bits = 0;
607 void* Universe::non_oop_word() {
608 // Neither the high bits nor the low bits of this value is allowed
609 // to look like (respectively) the high or low bits of a real oop.
610 //
611 // High and low are CPU-specific notions, but low always includes
612 // the low-order bit. Since oops are always aligned at least mod 4,
613 // setting the low-order bit will ensure that the low half of the
614 // word will never look like that of a real oop.
615 //
616 // Using the OS-supplied non-memory-address word (usually 0 or -1)
617 // will take care of the high bits, however many there are.
619 if (non_oop_bits == 0) {
620 non_oop_bits = (intptr_t)os::non_memory_address_word() | 1;
621 }
623 return (void*)non_oop_bits;
624 }
626 jint universe_init() {
627 assert(!Universe::_fully_initialized, "called after initialize_vtables");
628 guarantee(1 << LogHeapWordSize == sizeof(HeapWord),
629 "LogHeapWordSize is incorrect.");
630 guarantee(sizeof(oop) >= sizeof(HeapWord), "HeapWord larger than oop?");
631 guarantee(sizeof(oop) % sizeof(HeapWord) == 0,
632 "oop size is not not a multiple of HeapWord size");
633 TraceTime timer("Genesis", TraceStartupTime);
634 GC_locker::lock(); // do not allow gc during bootstrapping
635 JavaClasses::compute_hard_coded_offsets();
637 jint status = Universe::initialize_heap();
638 if (status != JNI_OK) {
639 return status;
640 }
642 // Create memory for metadata. Must be after initializing heap for
643 // DumpSharedSpaces.
644 ClassLoaderData::init_null_class_loader_data();
646 // We have a heap so create the Method* caches before
647 // Metaspace::initialize_shared_spaces() tries to populate them.
648 Universe::_finalizer_register_cache = new LatestMethodOopCache();
649 Universe::_loader_addClass_cache = new LatestMethodOopCache();
650 Universe::_reflect_invoke_cache = new ActiveMethodOopsCache();
652 if (UseSharedSpaces) {
653 // Read the data structures supporting the shared spaces (shared
654 // system dictionary, symbol table, etc.). After that, access to
655 // the file (other than the mapped regions) is no longer needed, and
656 // the file is closed. Closing the file does not affect the
657 // currently mapped regions.
658 MetaspaceShared::initialize_shared_spaces();
659 StringTable::create_table();
660 } else {
661 SymbolTable::create_table();
662 StringTable::create_table();
663 ClassLoader::create_package_info_table();
664 }
666 return JNI_OK;
667 }
669 // Choose the heap base address and oop encoding mode
670 // when compressed oops are used:
671 // Unscaled - Use 32-bits oops without encoding when
672 // NarrowOopHeapBaseMin + heap_size < 4Gb
673 // ZeroBased - Use zero based compressed oops with encoding when
674 // NarrowOopHeapBaseMin + heap_size < 32Gb
675 // HeapBased - Use compressed oops with heap base + encoding.
677 // 4Gb
678 static const uint64_t NarrowOopHeapMax = (uint64_t(max_juint) + 1);
679 // 32Gb
680 // OopEncodingHeapMax == NarrowOopHeapMax << LogMinObjAlignmentInBytes;
682 char* Universe::preferred_heap_base(size_t heap_size, NARROW_OOP_MODE mode) {
683 size_t base = 0;
684 #ifdef _LP64
685 if (UseCompressedOops) {
686 assert(mode == UnscaledNarrowOop ||
687 mode == ZeroBasedNarrowOop ||
688 mode == HeapBasedNarrowOop, "mode is invalid");
689 const size_t total_size = heap_size + HeapBaseMinAddress;
690 // Return specified base for the first request.
691 if (!FLAG_IS_DEFAULT(HeapBaseMinAddress) && (mode == UnscaledNarrowOop)) {
692 base = HeapBaseMinAddress;
693 } else if (total_size <= OopEncodingHeapMax && (mode != HeapBasedNarrowOop)) {
694 if (total_size <= NarrowOopHeapMax && (mode == UnscaledNarrowOop) &&
695 (Universe::narrow_oop_shift() == 0)) {
696 // Use 32-bits oops without encoding and
697 // place heap's top on the 4Gb boundary
698 base = (NarrowOopHeapMax - heap_size);
699 } else {
700 // Can't reserve with NarrowOopShift == 0
701 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
702 if (mode == UnscaledNarrowOop ||
703 mode == ZeroBasedNarrowOop && total_size <= NarrowOopHeapMax) {
704 // Use zero based compressed oops with encoding and
705 // place heap's top on the 32Gb boundary in case
706 // total_size > 4Gb or failed to reserve below 4Gb.
707 base = (OopEncodingHeapMax - heap_size);
708 }
709 }
710 } else {
711 // Can't reserve below 32Gb.
712 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
713 }
714 // Set narrow_oop_base and narrow_oop_use_implicit_null_checks
715 // used in ReservedHeapSpace() constructors.
716 // The final values will be set in initialize_heap() below.
717 if (base != 0 && (base + heap_size) <= OopEncodingHeapMax) {
718 // Use zero based compressed oops
719 Universe::set_narrow_oop_base(NULL);
720 // Don't need guard page for implicit checks in indexed
721 // addressing mode with zero based Compressed Oops.
722 Universe::set_narrow_oop_use_implicit_null_checks(true);
723 } else {
724 // Set to a non-NULL value so the ReservedSpace ctor computes
725 // the correct no-access prefix.
726 // The final value will be set in initialize_heap() below.
727 Universe::set_narrow_oop_base((address)NarrowOopHeapMax);
728 #ifdef _WIN64
729 if (UseLargePages) {
730 // Cannot allocate guard pages for implicit checks in indexed
731 // addressing mode when large pages are specified on windows.
732 Universe::set_narrow_oop_use_implicit_null_checks(false);
733 }
734 #endif // _WIN64
735 }
736 }
737 #endif
738 return (char*)base; // also return NULL (don't care) for 32-bit VM
739 }
741 jint Universe::initialize_heap() {
743 if (UseParallelGC) {
744 #if INCLUDE_ALL_GCS
745 Universe::_collectedHeap = new ParallelScavengeHeap();
746 #else // INCLUDE_ALL_GCS
747 fatal("UseParallelGC not supported in this VM.");
748 #endif // INCLUDE_ALL_GCS
750 } else if (UseG1GC) {
751 #if INCLUDE_ALL_GCS
752 G1CollectorPolicy* g1p = new G1CollectorPolicy();
753 G1CollectedHeap* g1h = new G1CollectedHeap(g1p);
754 Universe::_collectedHeap = g1h;
755 #else // INCLUDE_ALL_GCS
756 fatal("UseG1GC not supported in java kernel vm.");
757 #endif // INCLUDE_ALL_GCS
759 } else {
760 GenCollectorPolicy *gc_policy;
762 if (UseSerialGC) {
763 gc_policy = new MarkSweepPolicy();
764 } else if (UseConcMarkSweepGC) {
765 #if INCLUDE_ALL_GCS
766 if (UseAdaptiveSizePolicy) {
767 gc_policy = new ASConcurrentMarkSweepPolicy();
768 } else {
769 gc_policy = new ConcurrentMarkSweepPolicy();
770 }
771 #else // INCLUDE_ALL_GCS
772 fatal("UseConcMarkSweepGC not supported in this VM.");
773 #endif // INCLUDE_ALL_GCS
774 } else { // default old generation
775 gc_policy = new MarkSweepPolicy();
776 }
778 Universe::_collectedHeap = new GenCollectedHeap(gc_policy);
779 }
781 jint status = Universe::heap()->initialize();
782 if (status != JNI_OK) {
783 return status;
784 }
786 #ifdef _LP64
787 if (UseCompressedOops) {
788 // Subtract a page because something can get allocated at heap base.
789 // This also makes implicit null checking work, because the
790 // memory+1 page below heap_base needs to cause a signal.
791 // See needs_explicit_null_check.
792 // Only set the heap base for compressed oops because it indicates
793 // compressed oops for pstack code.
794 bool verbose = PrintCompressedOopsMode || (PrintMiscellaneous && Verbose);
795 if (verbose) {
796 tty->cr();
797 tty->print("heap address: " PTR_FORMAT ", size: " SIZE_FORMAT " MB",
798 Universe::heap()->base(), Universe::heap()->reserved_region().byte_size()/M);
799 }
800 if ((uint64_t)Universe::heap()->reserved_region().end() > OopEncodingHeapMax) {
801 // Can't reserve heap below 32Gb.
802 // keep the Universe::narrow_oop_base() set in Universe::reserve_heap()
803 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
804 if (verbose) {
805 tty->print(", Compressed Oops with base: "PTR_FORMAT, Universe::narrow_oop_base());
806 }
807 } else {
808 Universe::set_narrow_oop_base(0);
809 if (verbose) {
810 tty->print(", zero based Compressed Oops");
811 }
812 #ifdef _WIN64
813 if (!Universe::narrow_oop_use_implicit_null_checks()) {
814 // Don't need guard page for implicit checks in indexed addressing
815 // mode with zero based Compressed Oops.
816 Universe::set_narrow_oop_use_implicit_null_checks(true);
817 }
818 #endif // _WIN64
819 if((uint64_t)Universe::heap()->reserved_region().end() > NarrowOopHeapMax) {
820 // Can't reserve heap below 4Gb.
821 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
822 } else {
823 Universe::set_narrow_oop_shift(0);
824 if (verbose) {
825 tty->print(", 32-bits Oops");
826 }
827 }
828 }
829 if (verbose) {
830 tty->cr();
831 tty->cr();
832 }
833 if (UseCompressedKlassPointers) {
834 Universe::set_narrow_klass_base(Universe::narrow_oop_base());
835 Universe::set_narrow_klass_shift(MIN2(Universe::narrow_oop_shift(), LogKlassAlignmentInBytes));
836 }
837 Universe::set_narrow_ptrs_base(Universe::narrow_oop_base());
838 }
839 // Universe::narrow_oop_base() is one page below the metaspace
840 // base. The actual metaspace base depends on alignment constraints
841 // so we don't know its exact location here.
842 assert((intptr_t)Universe::narrow_oop_base() <= (intptr_t)(Universe::heap()->base() - os::vm_page_size() - ClassMetaspaceSize) ||
843 Universe::narrow_oop_base() == NULL, "invalid value");
844 assert(Universe::narrow_oop_shift() == LogMinObjAlignmentInBytes ||
845 Universe::narrow_oop_shift() == 0, "invalid value");
846 #endif
848 // We will never reach the CATCH below since Exceptions::_throw will cause
849 // the VM to exit if an exception is thrown during initialization
851 if (UseTLAB) {
852 assert(Universe::heap()->supports_tlab_allocation(),
853 "Should support thread-local allocation buffers");
854 ThreadLocalAllocBuffer::startup_initialization();
855 }
856 return JNI_OK;
857 }
860 // Reserve the Java heap, which is now the same for all GCs.
861 ReservedSpace Universe::reserve_heap(size_t heap_size, size_t alignment) {
862 // Add in the class metaspace area so the classes in the headers can
863 // be compressed the same as instances.
864 // Need to round class space size up because it's below the heap and
865 // the actual alignment depends on its size.
866 size_t metaspace_size = align_size_up(ClassMetaspaceSize, alignment);
867 size_t total_reserved = align_size_up(heap_size + metaspace_size, alignment);
868 char* addr = Universe::preferred_heap_base(total_reserved, Universe::UnscaledNarrowOop);
870 ReservedHeapSpace total_rs(total_reserved, alignment, UseLargePages, addr);
872 if (UseCompressedOops) {
873 if (addr != NULL && !total_rs.is_reserved()) {
874 // Failed to reserve at specified address - the requested memory
875 // region is taken already, for example, by 'java' launcher.
876 // Try again to reserver heap higher.
877 addr = Universe::preferred_heap_base(total_reserved, Universe::ZeroBasedNarrowOop);
879 ReservedHeapSpace total_rs0(total_reserved, alignment,
880 UseLargePages, addr);
882 if (addr != NULL && !total_rs0.is_reserved()) {
883 // Failed to reserve at specified address again - give up.
884 addr = Universe::preferred_heap_base(total_reserved, Universe::HeapBasedNarrowOop);
885 assert(addr == NULL, "");
887 ReservedHeapSpace total_rs1(total_reserved, alignment,
888 UseLargePages, addr);
889 total_rs = total_rs1;
890 } else {
891 total_rs = total_rs0;
892 }
893 }
894 }
896 if (!total_rs.is_reserved()) {
897 vm_exit_during_initialization(err_msg("Could not reserve enough space for object heap %d bytes", total_reserved));
898 return total_rs;
899 }
901 // Split the reserved space into main Java heap and a space for
902 // classes so that they can be compressed using the same algorithm
903 // as compressed oops. If compress oops and compress klass ptrs are
904 // used we need the meta space first: if the alignment used for
905 // compressed oops is greater than the one used for compressed klass
906 // ptrs, a metadata space on top of the heap could become
907 // unreachable.
908 ReservedSpace class_rs = total_rs.first_part(metaspace_size);
909 ReservedSpace heap_rs = total_rs.last_part(metaspace_size, alignment);
910 Metaspace::initialize_class_space(class_rs);
912 if (UseCompressedOops) {
913 // Universe::initialize_heap() will reset this to NULL if unscaled
914 // or zero-based narrow oops are actually used.
915 address base = (address)(total_rs.base() - os::vm_page_size());
916 Universe::set_narrow_oop_base(base);
917 }
918 return heap_rs;
919 }
922 // It's the caller's repsonsibility to ensure glitch-freedom
923 // (if required).
924 void Universe::update_heap_info_at_gc() {
925 _heap_capacity_at_last_gc = heap()->capacity();
926 _heap_used_at_last_gc = heap()->used();
927 }
931 void universe2_init() {
932 EXCEPTION_MARK;
933 Universe::genesis(CATCH);
934 // Although we'd like to verify here that the state of the heap
935 // is good, we can't because the main thread has not yet added
936 // itself to the threads list (so, using current interfaces
937 // we can't "fill" its TLAB), unless TLABs are disabled.
938 if (VerifyBeforeGC && !UseTLAB &&
939 Universe::heap()->total_collections() >= VerifyGCStartAt) {
940 Universe::heap()->prepare_for_verify();
941 Universe::verify(); // make sure we're starting with a clean slate
942 }
943 }
946 // This function is defined in JVM.cpp
947 extern void initialize_converter_functions();
949 bool universe_post_init() {
950 assert(!is_init_completed(), "Error: initialization not yet completed!");
951 Universe::_fully_initialized = true;
952 EXCEPTION_MARK;
953 { ResourceMark rm;
954 Interpreter::initialize(); // needed for interpreter entry points
955 if (!UseSharedSpaces) {
956 HandleMark hm(THREAD);
957 KlassHandle ok_h(THREAD, SystemDictionary::Object_klass());
958 Universe::reinitialize_vtable_of(ok_h, CHECK_false);
959 Universe::reinitialize_itables(CHECK_false);
960 }
961 }
963 HandleMark hm(THREAD);
964 Klass* k;
965 instanceKlassHandle k_h;
966 // Setup preallocated empty java.lang.Class array
967 Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::Class_klass(), 0, CHECK_false);
969 // Setup preallocated OutOfMemoryError errors
970 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_OutOfMemoryError(), true, CHECK_false);
971 k_h = instanceKlassHandle(THREAD, k);
972 Universe::_out_of_memory_error_java_heap = k_h->allocate_instance(CHECK_false);
973 Universe::_out_of_memory_error_perm_gen = k_h->allocate_instance(CHECK_false);
974 Universe::_out_of_memory_error_array_size = k_h->allocate_instance(CHECK_false);
975 Universe::_out_of_memory_error_gc_overhead_limit =
976 k_h->allocate_instance(CHECK_false);
978 // Setup preallocated NullPointerException
979 // (this is currently used for a cheap & dirty solution in compiler exception handling)
980 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_NullPointerException(), true, CHECK_false);
981 Universe::_null_ptr_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
982 // Setup preallocated ArithmeticException
983 // (this is currently used for a cheap & dirty solution in compiler exception handling)
984 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_ArithmeticException(), true, CHECK_false);
985 Universe::_arithmetic_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
986 // Virtual Machine Error for when we get into a situation we can't resolve
987 k = SystemDictionary::resolve_or_fail(
988 vmSymbols::java_lang_VirtualMachineError(), true, CHECK_false);
989 bool linked = InstanceKlass::cast(k)->link_class_or_fail(CHECK_false);
990 if (!linked) {
991 tty->print_cr("Unable to link/verify VirtualMachineError class");
992 return false; // initialization failed
993 }
994 Universe::_virtual_machine_error_instance =
995 InstanceKlass::cast(k)->allocate_instance(CHECK_false);
997 Universe::_vm_exception = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
999 if (!DumpSharedSpaces) {
1000 // These are the only Java fields that are currently set during shared space dumping.
1001 // We prefer to not handle this generally, so we always reinitialize these detail messages.
1002 Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false);
1003 java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg());
1005 msg = java_lang_String::create_from_str("Metadata space", CHECK_false);
1006 java_lang_Throwable::set_message(Universe::_out_of_memory_error_perm_gen, msg());
1008 msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false);
1009 java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg());
1011 msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false);
1012 java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg());
1014 msg = java_lang_String::create_from_str("/ by zero", CHECK_false);
1015 java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg());
1017 // Setup the array of errors that have preallocated backtrace
1018 k = Universe::_out_of_memory_error_java_heap->klass();
1019 assert(k->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error");
1020 k_h = instanceKlassHandle(THREAD, k);
1022 int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0;
1023 Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false);
1024 for (int i=0; i<len; i++) {
1025 oop err = k_h->allocate_instance(CHECK_false);
1026 Handle err_h = Handle(THREAD, err);
1027 java_lang_Throwable::allocate_backtrace(err_h, CHECK_false);
1028 Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h());
1029 }
1030 Universe::_preallocated_out_of_memory_error_avail_count = (jint)len;
1031 }
1034 // Setup static method for registering finalizers
1035 // The finalizer klass must be linked before looking up the method, in
1036 // case it needs to get rewritten.
1037 InstanceKlass::cast(SystemDictionary::Finalizer_klass())->link_class(CHECK_false);
1038 Method* m = InstanceKlass::cast(SystemDictionary::Finalizer_klass())->find_method(
1039 vmSymbols::register_method_name(),
1040 vmSymbols::register_method_signature());
1041 if (m == NULL || !m->is_static()) {
1042 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1043 "java.lang.ref.Finalizer.register", false);
1044 }
1045 Universe::_finalizer_register_cache->init(
1046 SystemDictionary::Finalizer_klass(), m, CHECK_false);
1048 // Resolve on first use and initialize class.
1049 // Note: No race-condition here, since a resolve will always return the same result
1051 // Setup method for security checks
1052 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_reflect_Method(), true, CHECK_false);
1053 k_h = instanceKlassHandle(THREAD, k);
1054 k_h->link_class(CHECK_false);
1055 m = k_h->find_method(vmSymbols::invoke_name(), vmSymbols::object_object_array_object_signature());
1056 if (m == NULL || m->is_static()) {
1057 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1058 "java.lang.reflect.Method.invoke", false);
1059 }
1060 Universe::_reflect_invoke_cache->init(k_h(), m, CHECK_false);
1062 // Setup method for registering loaded classes in class loader vector
1063 InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->link_class(CHECK_false);
1064 m = InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->find_method(vmSymbols::addClass_name(), vmSymbols::class_void_signature());
1065 if (m == NULL || m->is_static()) {
1066 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1067 "java.lang.ClassLoader.addClass", false);
1068 }
1069 Universe::_loader_addClass_cache->init(
1070 SystemDictionary::ClassLoader_klass(), m, CHECK_false);
1072 // The folowing is initializing converter functions for serialization in
1073 // JVM.cpp. If we clean up the StrictMath code above we may want to find
1074 // a better solution for this as well.
1075 initialize_converter_functions();
1077 // This needs to be done before the first scavenge/gc, since
1078 // it's an input to soft ref clearing policy.
1079 {
1080 MutexLocker x(Heap_lock);
1081 Universe::update_heap_info_at_gc();
1082 }
1084 // ("weak") refs processing infrastructure initialization
1085 Universe::heap()->post_initialize();
1087 // Initialize performance counters for metaspaces
1088 MetaspaceCounters::initialize_performance_counters();
1090 GC_locker::unlock(); // allow gc after bootstrapping
1092 MemoryService::set_universe_heap(Universe::_collectedHeap);
1093 return true;
1094 }
1097 void Universe::compute_base_vtable_size() {
1098 _base_vtable_size = ClassLoader::compute_Object_vtable();
1099 }
1102 // %%% The Universe::flush_foo methods belong in CodeCache.
1104 // Flushes compiled methods dependent on dependee.
1105 void Universe::flush_dependents_on(instanceKlassHandle dependee) {
1106 assert_lock_strong(Compile_lock);
1108 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1110 // CodeCache can only be updated by a thread_in_VM and they will all be
1111 // stopped dring the safepoint so CodeCache will be safe to update without
1112 // holding the CodeCache_lock.
1114 KlassDepChange changes(dependee);
1116 // Compute the dependent nmethods
1117 if (CodeCache::mark_for_deoptimization(changes) > 0) {
1118 // At least one nmethod has been marked for deoptimization
1119 VM_Deoptimize op;
1120 VMThread::execute(&op);
1121 }
1122 }
1124 // Flushes compiled methods dependent on a particular CallSite
1125 // instance when its target is different than the given MethodHandle.
1126 void Universe::flush_dependents_on(Handle call_site, Handle method_handle) {
1127 assert_lock_strong(Compile_lock);
1129 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1131 // CodeCache can only be updated by a thread_in_VM and they will all be
1132 // stopped dring the safepoint so CodeCache will be safe to update without
1133 // holding the CodeCache_lock.
1135 CallSiteDepChange changes(call_site(), method_handle());
1137 // Compute the dependent nmethods that have a reference to a
1138 // CallSite object. We use InstanceKlass::mark_dependent_nmethod
1139 // directly instead of CodeCache::mark_for_deoptimization because we
1140 // want dependents on the call site class only not all classes in
1141 // the ContextStream.
1142 int marked = 0;
1143 {
1144 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1145 InstanceKlass* call_site_klass = InstanceKlass::cast(call_site->klass());
1146 marked = call_site_klass->mark_dependent_nmethods(changes);
1147 }
1148 if (marked > 0) {
1149 // At least one nmethod has been marked for deoptimization
1150 VM_Deoptimize op;
1151 VMThread::execute(&op);
1152 }
1153 }
1155 #ifdef HOTSWAP
1156 // Flushes compiled methods dependent on dependee in the evolutionary sense
1157 void Universe::flush_evol_dependents_on(instanceKlassHandle ev_k_h) {
1158 // --- Compile_lock is not held. However we are at a safepoint.
1159 assert_locked_or_safepoint(Compile_lock);
1160 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1162 // CodeCache can only be updated by a thread_in_VM and they will all be
1163 // stopped dring the safepoint so CodeCache will be safe to update without
1164 // holding the CodeCache_lock.
1166 // Compute the dependent nmethods
1167 if (CodeCache::mark_for_evol_deoptimization(ev_k_h) > 0) {
1168 // At least one nmethod has been marked for deoptimization
1170 // All this already happens inside a VM_Operation, so we'll do all the work here.
1171 // Stuff copied from VM_Deoptimize and modified slightly.
1173 // We do not want any GCs to happen while we are in the middle of this VM operation
1174 ResourceMark rm;
1175 DeoptimizationMarker dm;
1177 // Deoptimize all activations depending on marked nmethods
1178 Deoptimization::deoptimize_dependents();
1180 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1181 CodeCache::make_marked_nmethods_not_entrant();
1182 }
1183 }
1184 #endif // HOTSWAP
1187 // Flushes compiled methods dependent on dependee
1188 void Universe::flush_dependents_on_method(methodHandle m_h) {
1189 // --- Compile_lock is not held. However we are at a safepoint.
1190 assert_locked_or_safepoint(Compile_lock);
1192 // CodeCache can only be updated by a thread_in_VM and they will all be
1193 // stopped dring the safepoint so CodeCache will be safe to update without
1194 // holding the CodeCache_lock.
1196 // Compute the dependent nmethods
1197 if (CodeCache::mark_for_deoptimization(m_h()) > 0) {
1198 // At least one nmethod has been marked for deoptimization
1200 // All this already happens inside a VM_Operation, so we'll do all the work here.
1201 // Stuff copied from VM_Deoptimize and modified slightly.
1203 // We do not want any GCs to happen while we are in the middle of this VM operation
1204 ResourceMark rm;
1205 DeoptimizationMarker dm;
1207 // Deoptimize all activations depending on marked nmethods
1208 Deoptimization::deoptimize_dependents();
1210 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1211 CodeCache::make_marked_nmethods_not_entrant();
1212 }
1213 }
1215 void Universe::print() {
1216 print_on(gclog_or_tty);
1217 }
1219 void Universe::print_on(outputStream* st, bool extended) {
1220 st->print_cr("Heap");
1221 if (!extended) {
1222 heap()->print_on(st);
1223 } else {
1224 heap()->print_extended_on(st);
1225 }
1226 }
1228 void Universe::print_heap_at_SIGBREAK() {
1229 if (PrintHeapAtSIGBREAK) {
1230 MutexLocker hl(Heap_lock);
1231 print_on(tty);
1232 tty->cr();
1233 tty->flush();
1234 }
1235 }
1237 void Universe::print_heap_before_gc(outputStream* st, bool ignore_extended) {
1238 st->print_cr("{Heap before GC invocations=%u (full %u):",
1239 heap()->total_collections(),
1240 heap()->total_full_collections());
1241 if (!PrintHeapAtGCExtended || ignore_extended) {
1242 heap()->print_on(st);
1243 } else {
1244 heap()->print_extended_on(st);
1245 }
1246 }
1248 void Universe::print_heap_after_gc(outputStream* st, bool ignore_extended) {
1249 st->print_cr("Heap after GC invocations=%u (full %u):",
1250 heap()->total_collections(),
1251 heap()->total_full_collections());
1252 if (!PrintHeapAtGCExtended || ignore_extended) {
1253 heap()->print_on(st);
1254 } else {
1255 heap()->print_extended_on(st);
1256 }
1257 st->print_cr("}");
1258 }
1260 void Universe::verify(bool silent, VerifyOption option) {
1261 // The use of _verify_in_progress is a temporary work around for
1262 // 6320749. Don't bother with a creating a class to set and clear
1263 // it since it is only used in this method and the control flow is
1264 // straight forward.
1265 _verify_in_progress = true;
1267 COMPILER2_PRESENT(
1268 assert(!DerivedPointerTable::is_active(),
1269 "DPT should not be active during verification "
1270 "(of thread stacks below)");
1271 )
1273 ResourceMark rm;
1274 HandleMark hm; // Handles created during verification can be zapped
1275 _verify_count++;
1277 if (!silent) gclog_or_tty->print("[Verifying ");
1278 if (!silent) gclog_or_tty->print("threads ");
1279 Threads::verify();
1280 heap()->verify(silent, option);
1282 if (!silent) gclog_or_tty->print("syms ");
1283 SymbolTable::verify();
1284 if (!silent) gclog_or_tty->print("strs ");
1285 StringTable::verify();
1286 {
1287 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1288 if (!silent) gclog_or_tty->print("zone ");
1289 CodeCache::verify();
1290 }
1291 if (!silent) gclog_or_tty->print("dict ");
1292 SystemDictionary::verify();
1293 #ifndef PRODUCT
1294 if (!silent) gclog_or_tty->print("cldg ");
1295 ClassLoaderDataGraph::verify();
1296 #endif
1297 if (!silent) gclog_or_tty->print("metaspace chunks ");
1298 MetaspaceAux::verify_free_chunks();
1299 if (!silent) gclog_or_tty->print("hand ");
1300 JNIHandles::verify();
1301 if (!silent) gclog_or_tty->print("C-heap ");
1302 os::check_heap();
1303 if (!silent) gclog_or_tty->print("code cache ");
1304 CodeCache::verify_oops();
1305 if (!silent) gclog_or_tty->print_cr("]");
1307 _verify_in_progress = false;
1308 }
1310 // Oop verification (see MacroAssembler::verify_oop)
1312 static uintptr_t _verify_oop_data[2] = {0, (uintptr_t)-1};
1313 static uintptr_t _verify_klass_data[2] = {0, (uintptr_t)-1};
1316 static void calculate_verify_data(uintptr_t verify_data[2],
1317 HeapWord* low_boundary,
1318 HeapWord* high_boundary) {
1319 assert(low_boundary < high_boundary, "bad interval");
1321 // decide which low-order bits we require to be clear:
1322 size_t alignSize = MinObjAlignmentInBytes;
1323 size_t min_object_size = CollectedHeap::min_fill_size();
1325 // make an inclusive limit:
1326 uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize;
1327 uintptr_t min = (uintptr_t)low_boundary;
1328 assert(min < max, "bad interval");
1329 uintptr_t diff = max ^ min;
1331 // throw away enough low-order bits to make the diff vanish
1332 uintptr_t mask = (uintptr_t)(-1);
1333 while ((mask & diff) != 0)
1334 mask <<= 1;
1335 uintptr_t bits = (min & mask);
1336 assert(bits == (max & mask), "correct mask");
1337 // check an intermediate value between min and max, just to make sure:
1338 assert(bits == ((min + (max-min)/2) & mask), "correct mask");
1340 // require address alignment, too:
1341 mask |= (alignSize - 1);
1343 if (!(verify_data[0] == 0 && verify_data[1] == (uintptr_t)-1)) {
1344 assert(verify_data[0] == mask && verify_data[1] == bits, "mask stability");
1345 }
1346 verify_data[0] = mask;
1347 verify_data[1] = bits;
1348 }
1351 // Oop verification (see MacroAssembler::verify_oop)
1352 #ifndef PRODUCT
1354 uintptr_t Universe::verify_oop_mask() {
1355 MemRegion m = heap()->reserved_region();
1356 calculate_verify_data(_verify_oop_data,
1357 m.start(),
1358 m.end());
1359 return _verify_oop_data[0];
1360 }
1364 uintptr_t Universe::verify_oop_bits() {
1365 verify_oop_mask();
1366 return _verify_oop_data[1];
1367 }
1369 uintptr_t Universe::verify_mark_mask() {
1370 return markOopDesc::lock_mask_in_place;
1371 }
1373 uintptr_t Universe::verify_mark_bits() {
1374 intptr_t mask = verify_mark_mask();
1375 intptr_t bits = (intptr_t)markOopDesc::prototype();
1376 assert((bits & ~mask) == 0, "no stray header bits");
1377 return bits;
1378 }
1379 #endif // PRODUCT
1382 void Universe::compute_verify_oop_data() {
1383 verify_oop_mask();
1384 verify_oop_bits();
1385 verify_mark_mask();
1386 verify_mark_bits();
1387 }
1390 void CommonMethodOopCache::init(Klass* k, Method* m, TRAPS) {
1391 if (!UseSharedSpaces) {
1392 _klass = k;
1393 }
1394 #ifndef PRODUCT
1395 else {
1396 // sharing initilization should have already set up _klass
1397 assert(_klass != NULL, "just checking");
1398 }
1399 #endif
1401 _method_idnum = m->method_idnum();
1402 assert(_method_idnum >= 0, "sanity check");
1403 }
1406 ActiveMethodOopsCache::~ActiveMethodOopsCache() {
1407 if (_prev_methods != NULL) {
1408 delete _prev_methods;
1409 _prev_methods = NULL;
1410 }
1411 }
1414 void ActiveMethodOopsCache::add_previous_version(Method* const method) {
1415 assert(Thread::current()->is_VM_thread(),
1416 "only VMThread can add previous versions");
1418 // Only append the previous method if it is executing on the stack.
1419 if (method->on_stack()) {
1421 if (_prev_methods == NULL) {
1422 // This is the first previous version so make some space.
1423 // Start with 2 elements under the assumption that the class
1424 // won't be redefined much.
1425 _prev_methods = new (ResourceObj::C_HEAP, mtClass) GrowableArray<Method*>(2, true);
1426 }
1428 // RC_TRACE macro has an embedded ResourceMark
1429 RC_TRACE(0x00000100,
1430 ("add: %s(%s): adding prev version ref for cached method @%d",
1431 method->name()->as_C_string(), method->signature()->as_C_string(),
1432 _prev_methods->length()));
1434 _prev_methods->append(method);
1435 }
1438 // Since the caller is the VMThread and we are at a safepoint, this is a good
1439 // time to clear out unused method references.
1441 if (_prev_methods == NULL) return;
1443 for (int i = _prev_methods->length() - 1; i >= 0; i--) {
1444 Method* method = _prev_methods->at(i);
1445 assert(method != NULL, "weak method ref was unexpectedly cleared");
1447 if (!method->on_stack()) {
1448 // This method isn't running anymore so remove it
1449 _prev_methods->remove_at(i);
1450 MetadataFactory::free_metadata(method->method_holder()->class_loader_data(), method);
1451 } else {
1452 // RC_TRACE macro has an embedded ResourceMark
1453 RC_TRACE(0x00000400, ("add: %s(%s): previous cached method @%d is alive",
1454 method->name()->as_C_string(), method->signature()->as_C_string(), i));
1455 }
1456 }
1457 } // end add_previous_version()
1460 bool ActiveMethodOopsCache::is_same_method(Method* const method) const {
1461 InstanceKlass* ik = InstanceKlass::cast(klass());
1462 Method* check_method = ik->method_with_idnum(method_idnum());
1463 assert(check_method != NULL, "sanity check");
1464 if (check_method == method) {
1465 // done with the easy case
1466 return true;
1467 }
1469 if (_prev_methods != NULL) {
1470 // The cached method has been redefined at least once so search
1471 // the previous versions for a match.
1472 for (int i = 0; i < _prev_methods->length(); i++) {
1473 check_method = _prev_methods->at(i);
1474 if (check_method == method) {
1475 // a previous version matches
1476 return true;
1477 }
1478 }
1479 }
1481 // either no previous versions or no previous version matched
1482 return false;
1483 }
1486 Method* LatestMethodOopCache::get_Method() {
1487 InstanceKlass* ik = InstanceKlass::cast(klass());
1488 Method* m = ik->method_with_idnum(method_idnum());
1489 assert(m != NULL, "sanity check");
1490 return m;
1491 }
1494 #ifdef ASSERT
1495 // Release dummy object(s) at bottom of heap
1496 bool Universe::release_fullgc_alot_dummy() {
1497 MutexLocker ml(FullGCALot_lock);
1498 if (_fullgc_alot_dummy_array != NULL) {
1499 if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) {
1500 // No more dummies to release, release entire array instead
1501 _fullgc_alot_dummy_array = NULL;
1502 return false;
1503 }
1504 if (!UseConcMarkSweepGC) {
1505 // Release dummy at bottom of old generation
1506 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1507 }
1508 // Release dummy at bottom of permanent generation
1509 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1510 }
1511 return true;
1512 }
1514 #endif // ASSERT