Wed, 26 Jun 2013 16:58:37 +0200
8013590: NPG: Add a memory pool MXBean for Metaspace
Reviewed-by: jmasa, mgerdin
1 /*
2 * Copyright (c) 1997, 2013, 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;
148 size_t Universe::_class_metaspace_size;
150 void Universe::basic_type_classes_do(void f(Klass*)) {
151 f(boolArrayKlassObj());
152 f(byteArrayKlassObj());
153 f(charArrayKlassObj());
154 f(intArrayKlassObj());
155 f(shortArrayKlassObj());
156 f(longArrayKlassObj());
157 f(singleArrayKlassObj());
158 f(doubleArrayKlassObj());
159 }
161 void Universe::oops_do(OopClosure* f, bool do_all) {
163 f->do_oop((oop*) &_int_mirror);
164 f->do_oop((oop*) &_float_mirror);
165 f->do_oop((oop*) &_double_mirror);
166 f->do_oop((oop*) &_byte_mirror);
167 f->do_oop((oop*) &_bool_mirror);
168 f->do_oop((oop*) &_char_mirror);
169 f->do_oop((oop*) &_long_mirror);
170 f->do_oop((oop*) &_short_mirror);
171 f->do_oop((oop*) &_void_mirror);
173 for (int i = T_BOOLEAN; i < T_VOID+1; i++) {
174 f->do_oop((oop*) &_mirrors[i]);
175 }
176 assert(_mirrors[0] == NULL && _mirrors[T_BOOLEAN - 1] == NULL, "checking");
178 f->do_oop((oop*)&_the_empty_class_klass_array);
179 f->do_oop((oop*)&_the_null_string);
180 f->do_oop((oop*)&_the_min_jint_string);
181 f->do_oop((oop*)&_out_of_memory_error_java_heap);
182 f->do_oop((oop*)&_out_of_memory_error_perm_gen);
183 f->do_oop((oop*)&_out_of_memory_error_array_size);
184 f->do_oop((oop*)&_out_of_memory_error_gc_overhead_limit);
185 f->do_oop((oop*)&_preallocated_out_of_memory_error_array);
186 f->do_oop((oop*)&_null_ptr_exception_instance);
187 f->do_oop((oop*)&_arithmetic_exception_instance);
188 f->do_oop((oop*)&_virtual_machine_error_instance);
189 f->do_oop((oop*)&_main_thread_group);
190 f->do_oop((oop*)&_system_thread_group);
191 f->do_oop((oop*)&_vm_exception);
192 debug_only(f->do_oop((oop*)&_fullgc_alot_dummy_array);)
193 }
195 // Serialize metadata in and out of CDS archive, not oops.
196 void Universe::serialize(SerializeClosure* f, bool do_all) {
198 f->do_ptr((void**)&_boolArrayKlassObj);
199 f->do_ptr((void**)&_byteArrayKlassObj);
200 f->do_ptr((void**)&_charArrayKlassObj);
201 f->do_ptr((void**)&_intArrayKlassObj);
202 f->do_ptr((void**)&_shortArrayKlassObj);
203 f->do_ptr((void**)&_longArrayKlassObj);
204 f->do_ptr((void**)&_singleArrayKlassObj);
205 f->do_ptr((void**)&_doubleArrayKlassObj);
206 f->do_ptr((void**)&_objectArrayKlassObj);
208 {
209 for (int i = 0; i < T_VOID+1; i++) {
210 if (_typeArrayKlassObjs[i] != NULL) {
211 assert(i >= T_BOOLEAN, "checking");
212 f->do_ptr((void**)&_typeArrayKlassObjs[i]);
213 } else if (do_all) {
214 f->do_ptr((void**)&_typeArrayKlassObjs[i]);
215 }
216 }
217 }
219 f->do_ptr((void**)&_the_array_interfaces_array);
220 f->do_ptr((void**)&_the_empty_int_array);
221 f->do_ptr((void**)&_the_empty_short_array);
222 f->do_ptr((void**)&_the_empty_method_array);
223 f->do_ptr((void**)&_the_empty_klass_array);
224 _finalizer_register_cache->serialize(f);
225 _loader_addClass_cache->serialize(f);
226 _reflect_invoke_cache->serialize(f);
227 }
229 void Universe::check_alignment(uintx size, uintx alignment, const char* name) {
230 if (size < alignment || size % alignment != 0) {
231 vm_exit_during_initialization(
232 err_msg("Size of %s (" UINTX_FORMAT " bytes) must be aligned to " UINTX_FORMAT " bytes", name, size, alignment));
233 }
234 }
236 void initialize_basic_type_klass(Klass* k, TRAPS) {
237 Klass* ok = SystemDictionary::Object_klass();
238 if (UseSharedSpaces) {
239 assert(k->super() == ok, "u3");
240 k->restore_unshareable_info(CHECK);
241 } else {
242 k->initialize_supers(ok, CHECK);
243 }
244 k->append_to_sibling_list();
245 }
247 void Universe::genesis(TRAPS) {
248 ResourceMark rm;
250 { FlagSetting fs(_bootstrapping, true);
252 { MutexLocker mc(Compile_lock);
254 // determine base vtable size; without that we cannot create the array klasses
255 compute_base_vtable_size();
257 if (!UseSharedSpaces) {
258 _boolArrayKlassObj = TypeArrayKlass::create_klass(T_BOOLEAN, sizeof(jboolean), CHECK);
259 _charArrayKlassObj = TypeArrayKlass::create_klass(T_CHAR, sizeof(jchar), CHECK);
260 _singleArrayKlassObj = TypeArrayKlass::create_klass(T_FLOAT, sizeof(jfloat), CHECK);
261 _doubleArrayKlassObj = TypeArrayKlass::create_klass(T_DOUBLE, sizeof(jdouble), CHECK);
262 _byteArrayKlassObj = TypeArrayKlass::create_klass(T_BYTE, sizeof(jbyte), CHECK);
263 _shortArrayKlassObj = TypeArrayKlass::create_klass(T_SHORT, sizeof(jshort), CHECK);
264 _intArrayKlassObj = TypeArrayKlass::create_klass(T_INT, sizeof(jint), CHECK);
265 _longArrayKlassObj = TypeArrayKlass::create_klass(T_LONG, sizeof(jlong), CHECK);
267 _typeArrayKlassObjs[T_BOOLEAN] = _boolArrayKlassObj;
268 _typeArrayKlassObjs[T_CHAR] = _charArrayKlassObj;
269 _typeArrayKlassObjs[T_FLOAT] = _singleArrayKlassObj;
270 _typeArrayKlassObjs[T_DOUBLE] = _doubleArrayKlassObj;
271 _typeArrayKlassObjs[T_BYTE] = _byteArrayKlassObj;
272 _typeArrayKlassObjs[T_SHORT] = _shortArrayKlassObj;
273 _typeArrayKlassObjs[T_INT] = _intArrayKlassObj;
274 _typeArrayKlassObjs[T_LONG] = _longArrayKlassObj;
276 ClassLoaderData* null_cld = ClassLoaderData::the_null_class_loader_data();
278 _the_array_interfaces_array = MetadataFactory::new_array<Klass*>(null_cld, 2, NULL, CHECK);
279 _the_empty_int_array = MetadataFactory::new_array<int>(null_cld, 0, CHECK);
280 _the_empty_short_array = MetadataFactory::new_array<u2>(null_cld, 0, CHECK);
281 _the_empty_method_array = MetadataFactory::new_array<Method*>(null_cld, 0, CHECK);
282 _the_empty_klass_array = MetadataFactory::new_array<Klass*>(null_cld, 0, CHECK);
283 }
284 }
286 vmSymbols::initialize(CHECK);
288 SystemDictionary::initialize(CHECK);
290 Klass* ok = SystemDictionary::Object_klass();
292 _the_null_string = StringTable::intern("null", CHECK);
293 _the_min_jint_string = StringTable::intern("-2147483648", CHECK);
295 if (UseSharedSpaces) {
296 // Verify shared interfaces array.
297 assert(_the_array_interfaces_array->at(0) ==
298 SystemDictionary::Cloneable_klass(), "u3");
299 assert(_the_array_interfaces_array->at(1) ==
300 SystemDictionary::Serializable_klass(), "u3");
301 } else {
302 // Set up shared interfaces array. (Do this before supers are set up.)
303 _the_array_interfaces_array->at_put(0, SystemDictionary::Cloneable_klass());
304 _the_array_interfaces_array->at_put(1, SystemDictionary::Serializable_klass());
305 }
307 initialize_basic_type_klass(boolArrayKlassObj(), CHECK);
308 initialize_basic_type_klass(charArrayKlassObj(), CHECK);
309 initialize_basic_type_klass(singleArrayKlassObj(), CHECK);
310 initialize_basic_type_klass(doubleArrayKlassObj(), CHECK);
311 initialize_basic_type_klass(byteArrayKlassObj(), CHECK);
312 initialize_basic_type_klass(shortArrayKlassObj(), CHECK);
313 initialize_basic_type_klass(intArrayKlassObj(), CHECK);
314 initialize_basic_type_klass(longArrayKlassObj(), CHECK);
315 } // end of core bootstrapping
317 // Maybe this could be lifted up now that object array can be initialized
318 // during the bootstrapping.
320 // OLD
321 // Initialize _objectArrayKlass after core bootstraping to make
322 // sure the super class is set up properly for _objectArrayKlass.
323 // ---
324 // NEW
325 // Since some of the old system object arrays have been converted to
326 // ordinary object arrays, _objectArrayKlass will be loaded when
327 // SystemDictionary::initialize(CHECK); is run. See the extra check
328 // for Object_klass_loaded in objArrayKlassKlass::allocate_objArray_klass_impl.
329 _objectArrayKlassObj = InstanceKlass::
330 cast(SystemDictionary::Object_klass())->array_klass(1, CHECK);
331 // OLD
332 // Add the class to the class hierarchy manually to make sure that
333 // its vtable is initialized after core bootstrapping is completed.
334 // ---
335 // New
336 // Have already been initialized.
337 _objectArrayKlassObj->append_to_sibling_list();
339 // Compute is_jdk version flags.
340 // Only 1.3 or later has the java.lang.Shutdown class.
341 // Only 1.4 or later has the java.lang.CharSequence interface.
342 // Only 1.5 or later has the java.lang.management.MemoryUsage class.
343 if (JDK_Version::is_partially_initialized()) {
344 uint8_t jdk_version;
345 Klass* k = SystemDictionary::resolve_or_null(
346 vmSymbols::java_lang_management_MemoryUsage(), THREAD);
347 CLEAR_PENDING_EXCEPTION; // ignore exceptions
348 if (k == NULL) {
349 k = SystemDictionary::resolve_or_null(
350 vmSymbols::java_lang_CharSequence(), THREAD);
351 CLEAR_PENDING_EXCEPTION; // ignore exceptions
352 if (k == NULL) {
353 k = SystemDictionary::resolve_or_null(
354 vmSymbols::java_lang_Shutdown(), THREAD);
355 CLEAR_PENDING_EXCEPTION; // ignore exceptions
356 if (k == NULL) {
357 jdk_version = 2;
358 } else {
359 jdk_version = 3;
360 }
361 } else {
362 jdk_version = 4;
363 }
364 } else {
365 jdk_version = 5;
366 }
367 JDK_Version::fully_initialize(jdk_version);
368 }
370 #ifdef ASSERT
371 if (FullGCALot) {
372 // Allocate an array of dummy objects.
373 // We'd like these to be at the bottom of the old generation,
374 // so that when we free one and then collect,
375 // (almost) the whole heap moves
376 // and we find out if we actually update all the oops correctly.
377 // But we can't allocate directly in the old generation,
378 // so we allocate wherever, and hope that the first collection
379 // moves these objects to the bottom of the old generation.
380 // We can allocate directly in the permanent generation, so we do.
381 int size;
382 if (UseConcMarkSweepGC) {
383 warning("Using +FullGCALot with concurrent mark sweep gc "
384 "will not force all objects to relocate");
385 size = FullGCALotDummies;
386 } else {
387 size = FullGCALotDummies * 2;
388 }
389 objArrayOop naked_array = oopFactory::new_objArray(SystemDictionary::Object_klass(), size, CHECK);
390 objArrayHandle dummy_array(THREAD, naked_array);
391 int i = 0;
392 while (i < size) {
393 // Allocate dummy in old generation
394 oop dummy = InstanceKlass::cast(SystemDictionary::Object_klass())->allocate_instance(CHECK);
395 dummy_array->obj_at_put(i++, dummy);
396 }
397 {
398 // Only modify the global variable inside the mutex.
399 // If we had a race to here, the other dummy_array instances
400 // and their elements just get dropped on the floor, which is fine.
401 MutexLocker ml(FullGCALot_lock);
402 if (_fullgc_alot_dummy_array == NULL) {
403 _fullgc_alot_dummy_array = dummy_array();
404 }
405 }
406 assert(i == _fullgc_alot_dummy_array->length(), "just checking");
407 }
408 #endif
410 // Initialize dependency array for null class loader
411 ClassLoaderData::the_null_class_loader_data()->init_dependencies(CHECK);
413 }
415 // CDS support for patching vtables in metadata in the shared archive.
416 // All types inherited from Metadata have vtables, but not types inherited
417 // from MetaspaceObj, because the latter does not have virtual functions.
418 // If the metadata type has a vtable, it cannot be shared in the read-only
419 // section of the CDS archive, because the vtable pointer is patched.
420 static inline void add_vtable(void** list, int* n, void* o, int count) {
421 guarantee((*n) < count, "vtable list too small");
422 void* vtable = dereference_vptr(o);
423 assert(*(void**)(vtable) != NULL, "invalid vtable");
424 list[(*n)++] = vtable;
425 }
427 void Universe::init_self_patching_vtbl_list(void** list, int count) {
428 int n = 0;
429 { InstanceKlass o; add_vtable(list, &n, &o, count); }
430 { InstanceClassLoaderKlass o; add_vtable(list, &n, &o, count); }
431 { InstanceMirrorKlass o; add_vtable(list, &n, &o, count); }
432 { InstanceRefKlass o; add_vtable(list, &n, &o, count); }
433 { TypeArrayKlass o; add_vtable(list, &n, &o, count); }
434 { ObjArrayKlass o; add_vtable(list, &n, &o, count); }
435 { Method o; add_vtable(list, &n, &o, count); }
436 { ConstantPool o; add_vtable(list, &n, &o, count); }
437 }
439 void Universe::initialize_basic_type_mirrors(TRAPS) {
440 assert(_int_mirror==NULL, "basic type mirrors already initialized");
441 _int_mirror =
442 java_lang_Class::create_basic_type_mirror("int", T_INT, CHECK);
443 _float_mirror =
444 java_lang_Class::create_basic_type_mirror("float", T_FLOAT, CHECK);
445 _double_mirror =
446 java_lang_Class::create_basic_type_mirror("double", T_DOUBLE, CHECK);
447 _byte_mirror =
448 java_lang_Class::create_basic_type_mirror("byte", T_BYTE, CHECK);
449 _bool_mirror =
450 java_lang_Class::create_basic_type_mirror("boolean",T_BOOLEAN, CHECK);
451 _char_mirror =
452 java_lang_Class::create_basic_type_mirror("char", T_CHAR, CHECK);
453 _long_mirror =
454 java_lang_Class::create_basic_type_mirror("long", T_LONG, CHECK);
455 _short_mirror =
456 java_lang_Class::create_basic_type_mirror("short", T_SHORT, CHECK);
457 _void_mirror =
458 java_lang_Class::create_basic_type_mirror("void", T_VOID, CHECK);
460 _mirrors[T_INT] = _int_mirror;
461 _mirrors[T_FLOAT] = _float_mirror;
462 _mirrors[T_DOUBLE] = _double_mirror;
463 _mirrors[T_BYTE] = _byte_mirror;
464 _mirrors[T_BOOLEAN] = _bool_mirror;
465 _mirrors[T_CHAR] = _char_mirror;
466 _mirrors[T_LONG] = _long_mirror;
467 _mirrors[T_SHORT] = _short_mirror;
468 _mirrors[T_VOID] = _void_mirror;
469 //_mirrors[T_OBJECT] = InstanceKlass::cast(_object_klass)->java_mirror();
470 //_mirrors[T_ARRAY] = InstanceKlass::cast(_object_klass)->java_mirror();
471 }
473 void Universe::fixup_mirrors(TRAPS) {
474 // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly,
475 // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply
476 // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note
477 // that the number of objects allocated at this point is very small.
478 assert(SystemDictionary::Class_klass_loaded(), "java.lang.Class should be loaded");
479 HandleMark hm(THREAD);
480 // Cache the start of the static fields
481 InstanceMirrorKlass::init_offset_of_static_fields();
483 GrowableArray <Klass*>* list = java_lang_Class::fixup_mirror_list();
484 int list_length = list->length();
485 for (int i = 0; i < list_length; i++) {
486 Klass* k = list->at(i);
487 assert(k->is_klass(), "List should only hold classes");
488 EXCEPTION_MARK;
489 KlassHandle kh(THREAD, k);
490 java_lang_Class::fixup_mirror(kh, CATCH);
491 }
492 delete java_lang_Class::fixup_mirror_list();
493 java_lang_Class::set_fixup_mirror_list(NULL);
494 }
496 static bool has_run_finalizers_on_exit = false;
498 void Universe::run_finalizers_on_exit() {
499 if (has_run_finalizers_on_exit) return;
500 has_run_finalizers_on_exit = true;
502 // Called on VM exit. This ought to be run in a separate thread.
503 if (TraceReferenceGC) tty->print_cr("Callback to run finalizers on exit");
504 {
505 PRESERVE_EXCEPTION_MARK;
506 KlassHandle finalizer_klass(THREAD, SystemDictionary::Finalizer_klass());
507 JavaValue result(T_VOID);
508 JavaCalls::call_static(
509 &result,
510 finalizer_klass,
511 vmSymbols::run_finalizers_on_exit_name(),
512 vmSymbols::void_method_signature(),
513 THREAD
514 );
515 // Ignore any pending exceptions
516 CLEAR_PENDING_EXCEPTION;
517 }
518 }
521 // initialize_vtable could cause gc if
522 // 1) we specified true to initialize_vtable and
523 // 2) this ran after gc was enabled
524 // In case those ever change we use handles for oops
525 void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) {
526 // init vtable of k and all subclasses
527 Klass* ko = k_h();
528 klassVtable* vt = ko->vtable();
529 if (vt) vt->initialize_vtable(false, CHECK);
530 if (ko->oop_is_instance()) {
531 InstanceKlass* ik = (InstanceKlass*)ko;
532 for (KlassHandle s_h(THREAD, ik->subklass());
533 s_h() != NULL;
534 s_h = KlassHandle(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;
694 // If the total size and the metaspace size are small enough to allow
695 // UnscaledNarrowOop then just use UnscaledNarrowOop.
696 } else if ((total_size <= OopEncodingHeapMax) && (mode != HeapBasedNarrowOop) &&
697 (!UseCompressedKlassPointers ||
698 (((OopEncodingHeapMax - heap_size) + Universe::class_metaspace_size()) <= KlassEncodingMetaspaceMax))) {
699 // We don't need to check the metaspace size here because it is always smaller
700 // than total_size.
701 if ((total_size <= NarrowOopHeapMax) && (mode == UnscaledNarrowOop) &&
702 (Universe::narrow_oop_shift() == 0)) {
703 // Use 32-bits oops without encoding and
704 // place heap's top on the 4Gb boundary
705 base = (NarrowOopHeapMax - heap_size);
706 } else {
707 // Can't reserve with NarrowOopShift == 0
708 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
709 if (mode == UnscaledNarrowOop ||
710 mode == ZeroBasedNarrowOop && total_size <= NarrowOopHeapMax) {
711 // Use zero based compressed oops with encoding and
712 // place heap's top on the 32Gb boundary in case
713 // total_size > 4Gb or failed to reserve below 4Gb.
714 base = (OopEncodingHeapMax - heap_size);
715 }
716 }
718 // See if ZeroBaseNarrowOop encoding will work for a heap based at
719 // (KlassEncodingMetaspaceMax - class_metaspace_size()).
720 } else if (UseCompressedKlassPointers && (mode != HeapBasedNarrowOop) &&
721 (Universe::class_metaspace_size() + HeapBaseMinAddress <= KlassEncodingMetaspaceMax) &&
722 (KlassEncodingMetaspaceMax + heap_size - Universe::class_metaspace_size() <= OopEncodingHeapMax)) {
723 base = (KlassEncodingMetaspaceMax - Universe::class_metaspace_size());
724 } else {
725 // UnscaledNarrowOop encoding didn't work, and no base was found for ZeroBasedOops or
726 // HeapBasedNarrowOop encoding was requested. So, can't reserve below 32Gb.
727 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
728 }
730 // Set narrow_oop_base and narrow_oop_use_implicit_null_checks
731 // used in ReservedHeapSpace() constructors.
732 // The final values will be set in initialize_heap() below.
733 if ((base != 0) && ((base + heap_size) <= OopEncodingHeapMax) &&
734 (!UseCompressedKlassPointers || (base + Universe::class_metaspace_size()) <= KlassEncodingMetaspaceMax)) {
735 // Use zero based compressed oops
736 Universe::set_narrow_oop_base(NULL);
737 // Don't need guard page for implicit checks in indexed
738 // addressing mode with zero based Compressed Oops.
739 Universe::set_narrow_oop_use_implicit_null_checks(true);
740 } else {
741 // Set to a non-NULL value so the ReservedSpace ctor computes
742 // the correct no-access prefix.
743 // The final value will be set in initialize_heap() below.
744 Universe::set_narrow_oop_base((address)NarrowOopHeapMax);
745 #ifdef _WIN64
746 if (UseLargePages) {
747 // Cannot allocate guard pages for implicit checks in indexed
748 // addressing mode when large pages are specified on windows.
749 Universe::set_narrow_oop_use_implicit_null_checks(false);
750 }
751 #endif // _WIN64
752 }
753 }
754 #endif
755 return (char*)base; // also return NULL (don't care) for 32-bit VM
756 }
758 jint Universe::initialize_heap() {
760 if (UseParallelGC) {
761 #if INCLUDE_ALL_GCS
762 Universe::_collectedHeap = new ParallelScavengeHeap();
763 #else // INCLUDE_ALL_GCS
764 fatal("UseParallelGC not supported in this VM.");
765 #endif // INCLUDE_ALL_GCS
767 } else if (UseG1GC) {
768 #if INCLUDE_ALL_GCS
769 G1CollectorPolicy* g1p = new G1CollectorPolicy();
770 G1CollectedHeap* g1h = new G1CollectedHeap(g1p);
771 Universe::_collectedHeap = g1h;
772 #else // INCLUDE_ALL_GCS
773 fatal("UseG1GC not supported in java kernel vm.");
774 #endif // INCLUDE_ALL_GCS
776 } else {
777 GenCollectorPolicy *gc_policy;
779 if (UseSerialGC) {
780 gc_policy = new MarkSweepPolicy();
781 } else if (UseConcMarkSweepGC) {
782 #if INCLUDE_ALL_GCS
783 if (UseAdaptiveSizePolicy) {
784 gc_policy = new ASConcurrentMarkSweepPolicy();
785 } else {
786 gc_policy = new ConcurrentMarkSweepPolicy();
787 }
788 #else // INCLUDE_ALL_GCS
789 fatal("UseConcMarkSweepGC not supported in this VM.");
790 #endif // INCLUDE_ALL_GCS
791 } else { // default old generation
792 gc_policy = new MarkSweepPolicy();
793 }
795 Universe::_collectedHeap = new GenCollectedHeap(gc_policy);
796 }
798 jint status = Universe::heap()->initialize();
799 if (status != JNI_OK) {
800 return status;
801 }
803 #ifdef _LP64
804 if (UseCompressedOops) {
805 // Subtract a page because something can get allocated at heap base.
806 // This also makes implicit null checking work, because the
807 // memory+1 page below heap_base needs to cause a signal.
808 // See needs_explicit_null_check.
809 // Only set the heap base for compressed oops because it indicates
810 // compressed oops for pstack code.
811 bool verbose = PrintCompressedOopsMode || (PrintMiscellaneous && Verbose);
812 if (verbose) {
813 tty->cr();
814 tty->print("heap address: " PTR_FORMAT ", size: " SIZE_FORMAT " MB",
815 Universe::heap()->base(), Universe::heap()->reserved_region().byte_size()/M);
816 }
817 if (((uint64_t)Universe::heap()->reserved_region().end() > OopEncodingHeapMax) ||
818 (UseCompressedKlassPointers &&
819 ((uint64_t)Universe::heap()->base() + Universe::class_metaspace_size() > KlassEncodingMetaspaceMax))) {
820 // Can't reserve heap below 32Gb.
821 // keep the Universe::narrow_oop_base() set in Universe::reserve_heap()
822 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
823 if (verbose) {
824 tty->print(", %s: "PTR_FORMAT,
825 narrow_oop_mode_to_string(HeapBasedNarrowOop),
826 Universe::narrow_oop_base());
827 }
828 } else {
829 Universe::set_narrow_oop_base(0);
830 if (verbose) {
831 tty->print(", %s", narrow_oop_mode_to_string(ZeroBasedNarrowOop));
832 }
833 #ifdef _WIN64
834 if (!Universe::narrow_oop_use_implicit_null_checks()) {
835 // Don't need guard page for implicit checks in indexed addressing
836 // mode with zero based Compressed Oops.
837 Universe::set_narrow_oop_use_implicit_null_checks(true);
838 }
839 #endif // _WIN64
840 if((uint64_t)Universe::heap()->reserved_region().end() > NarrowOopHeapMax) {
841 // Can't reserve heap below 4Gb.
842 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
843 } else {
844 Universe::set_narrow_oop_shift(0);
845 if (verbose) {
846 tty->print(", %s", narrow_oop_mode_to_string(UnscaledNarrowOop));
847 }
848 }
849 }
850 if (verbose) {
851 tty->cr();
852 tty->cr();
853 }
854 if (UseCompressedKlassPointers) {
855 Universe::set_narrow_klass_base(Universe::narrow_oop_base());
856 Universe::set_narrow_klass_shift(MIN2(Universe::narrow_oop_shift(), LogKlassAlignmentInBytes));
857 }
858 Universe::set_narrow_ptrs_base(Universe::narrow_oop_base());
859 }
860 // Universe::narrow_oop_base() is one page below the metaspace
861 // base. The actual metaspace base depends on alignment constraints
862 // so we don't know its exact location here.
863 assert((intptr_t)Universe::narrow_oop_base() <= (intptr_t)(Universe::heap()->base() - os::vm_page_size() - ClassMetaspaceSize) ||
864 Universe::narrow_oop_base() == NULL, "invalid value");
865 assert(Universe::narrow_oop_shift() == LogMinObjAlignmentInBytes ||
866 Universe::narrow_oop_shift() == 0, "invalid value");
867 #endif
869 // We will never reach the CATCH below since Exceptions::_throw will cause
870 // the VM to exit if an exception is thrown during initialization
872 if (UseTLAB) {
873 assert(Universe::heap()->supports_tlab_allocation(),
874 "Should support thread-local allocation buffers");
875 ThreadLocalAllocBuffer::startup_initialization();
876 }
877 return JNI_OK;
878 }
881 // Reserve the Java heap, which is now the same for all GCs.
882 ReservedSpace Universe::reserve_heap(size_t heap_size, size_t alignment) {
883 // Add in the class metaspace area so the classes in the headers can
884 // be compressed the same as instances.
885 // Need to round class space size up because it's below the heap and
886 // the actual alignment depends on its size.
887 Universe::set_class_metaspace_size(align_size_up(ClassMetaspaceSize, alignment));
888 size_t total_reserved = align_size_up(heap_size + Universe::class_metaspace_size(), alignment);
889 assert(!UseCompressedOops || (total_reserved <= (OopEncodingHeapMax - os::vm_page_size())),
890 "heap size is too big for compressed oops");
891 char* addr = Universe::preferred_heap_base(total_reserved, Universe::UnscaledNarrowOop);
893 ReservedHeapSpace total_rs(total_reserved, alignment, UseLargePages, addr);
895 if (UseCompressedOops) {
896 if (addr != NULL && !total_rs.is_reserved()) {
897 // Failed to reserve at specified address - the requested memory
898 // region is taken already, for example, by 'java' launcher.
899 // Try again to reserver heap higher.
900 addr = Universe::preferred_heap_base(total_reserved, Universe::ZeroBasedNarrowOop);
902 ReservedHeapSpace total_rs0(total_reserved, alignment,
903 UseLargePages, addr);
905 if (addr != NULL && !total_rs0.is_reserved()) {
906 // Failed to reserve at specified address again - give up.
907 addr = Universe::preferred_heap_base(total_reserved, Universe::HeapBasedNarrowOop);
908 assert(addr == NULL, "");
910 ReservedHeapSpace total_rs1(total_reserved, alignment,
911 UseLargePages, addr);
912 total_rs = total_rs1;
913 } else {
914 total_rs = total_rs0;
915 }
916 }
917 }
919 if (!total_rs.is_reserved()) {
920 vm_exit_during_initialization(err_msg("Could not reserve enough space for " SIZE_FORMAT "KB object heap", total_reserved/K));
921 return total_rs;
922 }
924 // Split the reserved space into main Java heap and a space for
925 // classes so that they can be compressed using the same algorithm
926 // as compressed oops. If compress oops and compress klass ptrs are
927 // used we need the meta space first: if the alignment used for
928 // compressed oops is greater than the one used for compressed klass
929 // ptrs, a metadata space on top of the heap could become
930 // unreachable.
931 ReservedSpace class_rs = total_rs.first_part(Universe::class_metaspace_size());
932 ReservedSpace heap_rs = total_rs.last_part(Universe::class_metaspace_size(), alignment);
933 Metaspace::initialize_class_space(class_rs);
935 if (UseCompressedOops) {
936 // Universe::initialize_heap() will reset this to NULL if unscaled
937 // or zero-based narrow oops are actually used.
938 address base = (address)(total_rs.base() - os::vm_page_size());
939 Universe::set_narrow_oop_base(base);
940 }
941 return heap_rs;
942 }
945 // It's the caller's repsonsibility to ensure glitch-freedom
946 // (if required).
947 void Universe::update_heap_info_at_gc() {
948 _heap_capacity_at_last_gc = heap()->capacity();
949 _heap_used_at_last_gc = heap()->used();
950 }
953 const char* Universe::narrow_oop_mode_to_string(Universe::NARROW_OOP_MODE mode) {
954 switch (mode) {
955 case UnscaledNarrowOop:
956 return "32-bits Oops";
957 case ZeroBasedNarrowOop:
958 return "zero based Compressed Oops";
959 case HeapBasedNarrowOop:
960 return "Compressed Oops with base";
961 }
963 ShouldNotReachHere();
964 return "";
965 }
968 Universe::NARROW_OOP_MODE Universe::narrow_oop_mode() {
969 if (narrow_oop_base() != 0) {
970 return HeapBasedNarrowOop;
971 }
973 if (narrow_oop_shift() != 0) {
974 return ZeroBasedNarrowOop;
975 }
977 return UnscaledNarrowOop;
978 }
981 void universe2_init() {
982 EXCEPTION_MARK;
983 Universe::genesis(CATCH);
984 }
987 // This function is defined in JVM.cpp
988 extern void initialize_converter_functions();
990 bool universe_post_init() {
991 assert(!is_init_completed(), "Error: initialization not yet completed!");
992 Universe::_fully_initialized = true;
993 EXCEPTION_MARK;
994 { ResourceMark rm;
995 Interpreter::initialize(); // needed for interpreter entry points
996 if (!UseSharedSpaces) {
997 HandleMark hm(THREAD);
998 KlassHandle ok_h(THREAD, SystemDictionary::Object_klass());
999 Universe::reinitialize_vtable_of(ok_h, CHECK_false);
1000 Universe::reinitialize_itables(CHECK_false);
1001 }
1002 }
1004 HandleMark hm(THREAD);
1005 Klass* k;
1006 instanceKlassHandle k_h;
1007 // Setup preallocated empty java.lang.Class array
1008 Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::Class_klass(), 0, CHECK_false);
1010 // Setup preallocated OutOfMemoryError errors
1011 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_OutOfMemoryError(), true, CHECK_false);
1012 k_h = instanceKlassHandle(THREAD, k);
1013 Universe::_out_of_memory_error_java_heap = k_h->allocate_instance(CHECK_false);
1014 Universe::_out_of_memory_error_perm_gen = k_h->allocate_instance(CHECK_false);
1015 Universe::_out_of_memory_error_array_size = k_h->allocate_instance(CHECK_false);
1016 Universe::_out_of_memory_error_gc_overhead_limit =
1017 k_h->allocate_instance(CHECK_false);
1019 // Setup preallocated NullPointerException
1020 // (this is currently used for a cheap & dirty solution in compiler exception handling)
1021 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_NullPointerException(), true, CHECK_false);
1022 Universe::_null_ptr_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
1023 // Setup preallocated ArithmeticException
1024 // (this is currently used for a cheap & dirty solution in compiler exception handling)
1025 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_ArithmeticException(), true, CHECK_false);
1026 Universe::_arithmetic_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
1027 // Virtual Machine Error for when we get into a situation we can't resolve
1028 k = SystemDictionary::resolve_or_fail(
1029 vmSymbols::java_lang_VirtualMachineError(), true, CHECK_false);
1030 bool linked = InstanceKlass::cast(k)->link_class_or_fail(CHECK_false);
1031 if (!linked) {
1032 tty->print_cr("Unable to link/verify VirtualMachineError class");
1033 return false; // initialization failed
1034 }
1035 Universe::_virtual_machine_error_instance =
1036 InstanceKlass::cast(k)->allocate_instance(CHECK_false);
1038 Universe::_vm_exception = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
1040 if (!DumpSharedSpaces) {
1041 // These are the only Java fields that are currently set during shared space dumping.
1042 // We prefer to not handle this generally, so we always reinitialize these detail messages.
1043 Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false);
1044 java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg());
1046 msg = java_lang_String::create_from_str("Metadata space", CHECK_false);
1047 java_lang_Throwable::set_message(Universe::_out_of_memory_error_perm_gen, msg());
1049 msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false);
1050 java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg());
1052 msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false);
1053 java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg());
1055 msg = java_lang_String::create_from_str("/ by zero", CHECK_false);
1056 java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg());
1058 // Setup the array of errors that have preallocated backtrace
1059 k = Universe::_out_of_memory_error_java_heap->klass();
1060 assert(k->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error");
1061 k_h = instanceKlassHandle(THREAD, k);
1063 int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0;
1064 Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false);
1065 for (int i=0; i<len; i++) {
1066 oop err = k_h->allocate_instance(CHECK_false);
1067 Handle err_h = Handle(THREAD, err);
1068 java_lang_Throwable::allocate_backtrace(err_h, CHECK_false);
1069 Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h());
1070 }
1071 Universe::_preallocated_out_of_memory_error_avail_count = (jint)len;
1072 }
1075 // Setup static method for registering finalizers
1076 // The finalizer klass must be linked before looking up the method, in
1077 // case it needs to get rewritten.
1078 InstanceKlass::cast(SystemDictionary::Finalizer_klass())->link_class(CHECK_false);
1079 Method* m = InstanceKlass::cast(SystemDictionary::Finalizer_klass())->find_method(
1080 vmSymbols::register_method_name(),
1081 vmSymbols::register_method_signature());
1082 if (m == NULL || !m->is_static()) {
1083 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1084 "java.lang.ref.Finalizer.register", false);
1085 }
1086 Universe::_finalizer_register_cache->init(
1087 SystemDictionary::Finalizer_klass(), m, CHECK_false);
1089 // Resolve on first use and initialize class.
1090 // Note: No race-condition here, since a resolve will always return the same result
1092 // Setup method for security checks
1093 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_reflect_Method(), true, CHECK_false);
1094 k_h = instanceKlassHandle(THREAD, k);
1095 k_h->link_class(CHECK_false);
1096 m = k_h->find_method(vmSymbols::invoke_name(), vmSymbols::object_object_array_object_signature());
1097 if (m == NULL || m->is_static()) {
1098 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1099 "java.lang.reflect.Method.invoke", false);
1100 }
1101 Universe::_reflect_invoke_cache->init(k_h(), m, CHECK_false);
1103 // Setup method for registering loaded classes in class loader vector
1104 InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->link_class(CHECK_false);
1105 m = InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->find_method(vmSymbols::addClass_name(), vmSymbols::class_void_signature());
1106 if (m == NULL || m->is_static()) {
1107 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1108 "java.lang.ClassLoader.addClass", false);
1109 }
1110 Universe::_loader_addClass_cache->init(
1111 SystemDictionary::ClassLoader_klass(), m, CHECK_false);
1113 // The folowing is initializing converter functions for serialization in
1114 // JVM.cpp. If we clean up the StrictMath code above we may want to find
1115 // a better solution for this as well.
1116 initialize_converter_functions();
1118 // This needs to be done before the first scavenge/gc, since
1119 // it's an input to soft ref clearing policy.
1120 {
1121 MutexLocker x(Heap_lock);
1122 Universe::update_heap_info_at_gc();
1123 }
1125 // ("weak") refs processing infrastructure initialization
1126 Universe::heap()->post_initialize();
1128 // Initialize performance counters for metaspaces
1129 MetaspaceCounters::initialize_performance_counters();
1130 MemoryService::add_metaspace_memory_pools();
1132 GC_locker::unlock(); // allow gc after bootstrapping
1134 MemoryService::set_universe_heap(Universe::_collectedHeap);
1135 return true;
1136 }
1139 void Universe::compute_base_vtable_size() {
1140 _base_vtable_size = ClassLoader::compute_Object_vtable();
1141 }
1144 // %%% The Universe::flush_foo methods belong in CodeCache.
1146 // Flushes compiled methods dependent on dependee.
1147 void Universe::flush_dependents_on(instanceKlassHandle dependee) {
1148 assert_lock_strong(Compile_lock);
1150 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1152 // CodeCache can only be updated by a thread_in_VM and they will all be
1153 // stopped dring the safepoint so CodeCache will be safe to update without
1154 // holding the CodeCache_lock.
1156 KlassDepChange changes(dependee);
1158 // Compute the dependent nmethods
1159 if (CodeCache::mark_for_deoptimization(changes) > 0) {
1160 // At least one nmethod has been marked for deoptimization
1161 VM_Deoptimize op;
1162 VMThread::execute(&op);
1163 }
1164 }
1166 // Flushes compiled methods dependent on a particular CallSite
1167 // instance when its target is different than the given MethodHandle.
1168 void Universe::flush_dependents_on(Handle call_site, Handle method_handle) {
1169 assert_lock_strong(Compile_lock);
1171 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1173 // CodeCache can only be updated by a thread_in_VM and they will all be
1174 // stopped dring the safepoint so CodeCache will be safe to update without
1175 // holding the CodeCache_lock.
1177 CallSiteDepChange changes(call_site(), method_handle());
1179 // Compute the dependent nmethods that have a reference to a
1180 // CallSite object. We use InstanceKlass::mark_dependent_nmethod
1181 // directly instead of CodeCache::mark_for_deoptimization because we
1182 // want dependents on the call site class only not all classes in
1183 // the ContextStream.
1184 int marked = 0;
1185 {
1186 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1187 InstanceKlass* call_site_klass = InstanceKlass::cast(call_site->klass());
1188 marked = call_site_klass->mark_dependent_nmethods(changes);
1189 }
1190 if (marked > 0) {
1191 // At least one nmethod has been marked for deoptimization
1192 VM_Deoptimize op;
1193 VMThread::execute(&op);
1194 }
1195 }
1197 #ifdef HOTSWAP
1198 // Flushes compiled methods dependent on dependee in the evolutionary sense
1199 void Universe::flush_evol_dependents_on(instanceKlassHandle ev_k_h) {
1200 // --- Compile_lock is not held. However we are at a safepoint.
1201 assert_locked_or_safepoint(Compile_lock);
1202 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1204 // CodeCache can only be updated by a thread_in_VM and they will all be
1205 // stopped dring the safepoint so CodeCache will be safe to update without
1206 // holding the CodeCache_lock.
1208 // Compute the dependent nmethods
1209 if (CodeCache::mark_for_evol_deoptimization(ev_k_h) > 0) {
1210 // At least one nmethod has been marked for deoptimization
1212 // All this already happens inside a VM_Operation, so we'll do all the work here.
1213 // Stuff copied from VM_Deoptimize and modified slightly.
1215 // We do not want any GCs to happen while we are in the middle of this VM operation
1216 ResourceMark rm;
1217 DeoptimizationMarker dm;
1219 // Deoptimize all activations depending on marked nmethods
1220 Deoptimization::deoptimize_dependents();
1222 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1223 CodeCache::make_marked_nmethods_not_entrant();
1224 }
1225 }
1226 #endif // HOTSWAP
1229 // Flushes compiled methods dependent on dependee
1230 void Universe::flush_dependents_on_method(methodHandle m_h) {
1231 // --- Compile_lock is not held. However we are at a safepoint.
1232 assert_locked_or_safepoint(Compile_lock);
1234 // CodeCache can only be updated by a thread_in_VM and they will all be
1235 // stopped dring the safepoint so CodeCache will be safe to update without
1236 // holding the CodeCache_lock.
1238 // Compute the dependent nmethods
1239 if (CodeCache::mark_for_deoptimization(m_h()) > 0) {
1240 // At least one nmethod has been marked for deoptimization
1242 // All this already happens inside a VM_Operation, so we'll do all the work here.
1243 // Stuff copied from VM_Deoptimize and modified slightly.
1245 // We do not want any GCs to happen while we are in the middle of this VM operation
1246 ResourceMark rm;
1247 DeoptimizationMarker dm;
1249 // Deoptimize all activations depending on marked nmethods
1250 Deoptimization::deoptimize_dependents();
1252 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1253 CodeCache::make_marked_nmethods_not_entrant();
1254 }
1255 }
1257 void Universe::print() {
1258 print_on(gclog_or_tty);
1259 }
1261 void Universe::print_on(outputStream* st, bool extended) {
1262 st->print_cr("Heap");
1263 if (!extended) {
1264 heap()->print_on(st);
1265 } else {
1266 heap()->print_extended_on(st);
1267 }
1268 }
1270 void Universe::print_heap_at_SIGBREAK() {
1271 if (PrintHeapAtSIGBREAK) {
1272 MutexLocker hl(Heap_lock);
1273 print_on(tty);
1274 tty->cr();
1275 tty->flush();
1276 }
1277 }
1279 void Universe::print_heap_before_gc(outputStream* st, bool ignore_extended) {
1280 st->print_cr("{Heap before GC invocations=%u (full %u):",
1281 heap()->total_collections(),
1282 heap()->total_full_collections());
1283 if (!PrintHeapAtGCExtended || ignore_extended) {
1284 heap()->print_on(st);
1285 } else {
1286 heap()->print_extended_on(st);
1287 }
1288 }
1290 void Universe::print_heap_after_gc(outputStream* st, bool ignore_extended) {
1291 st->print_cr("Heap after GC invocations=%u (full %u):",
1292 heap()->total_collections(),
1293 heap()->total_full_collections());
1294 if (!PrintHeapAtGCExtended || ignore_extended) {
1295 heap()->print_on(st);
1296 } else {
1297 heap()->print_extended_on(st);
1298 }
1299 st->print_cr("}");
1300 }
1302 void Universe::verify(VerifyOption option, const char* prefix, bool silent) {
1303 // The use of _verify_in_progress is a temporary work around for
1304 // 6320749. Don't bother with a creating a class to set and clear
1305 // it since it is only used in this method and the control flow is
1306 // straight forward.
1307 _verify_in_progress = true;
1309 COMPILER2_PRESENT(
1310 assert(!DerivedPointerTable::is_active(),
1311 "DPT should not be active during verification "
1312 "(of thread stacks below)");
1313 )
1315 ResourceMark rm;
1316 HandleMark hm; // Handles created during verification can be zapped
1317 _verify_count++;
1319 if (!silent) gclog_or_tty->print(prefix);
1320 if (!silent) gclog_or_tty->print("[Verifying ");
1321 if (!silent) gclog_or_tty->print("threads ");
1322 Threads::verify();
1323 if (!silent) gclog_or_tty->print("heap ");
1324 heap()->verify(silent, option);
1325 if (!silent) gclog_or_tty->print("syms ");
1326 SymbolTable::verify();
1327 if (!silent) gclog_or_tty->print("strs ");
1328 StringTable::verify();
1329 {
1330 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1331 if (!silent) gclog_or_tty->print("zone ");
1332 CodeCache::verify();
1333 }
1334 if (!silent) gclog_or_tty->print("dict ");
1335 SystemDictionary::verify();
1336 #ifndef PRODUCT
1337 if (!silent) gclog_or_tty->print("cldg ");
1338 ClassLoaderDataGraph::verify();
1339 #endif
1340 if (!silent) gclog_or_tty->print("metaspace chunks ");
1341 MetaspaceAux::verify_free_chunks();
1342 if (!silent) gclog_or_tty->print("hand ");
1343 JNIHandles::verify();
1344 if (!silent) gclog_or_tty->print("C-heap ");
1345 os::check_heap();
1346 if (!silent) gclog_or_tty->print("code cache ");
1347 CodeCache::verify_oops();
1348 if (!silent) gclog_or_tty->print_cr("]");
1350 _verify_in_progress = false;
1351 }
1353 // Oop verification (see MacroAssembler::verify_oop)
1355 static uintptr_t _verify_oop_data[2] = {0, (uintptr_t)-1};
1356 static uintptr_t _verify_klass_data[2] = {0, (uintptr_t)-1};
1359 #ifndef PRODUCT
1361 static void calculate_verify_data(uintptr_t verify_data[2],
1362 HeapWord* low_boundary,
1363 HeapWord* high_boundary) {
1364 assert(low_boundary < high_boundary, "bad interval");
1366 // decide which low-order bits we require to be clear:
1367 size_t alignSize = MinObjAlignmentInBytes;
1368 size_t min_object_size = CollectedHeap::min_fill_size();
1370 // make an inclusive limit:
1371 uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize;
1372 uintptr_t min = (uintptr_t)low_boundary;
1373 assert(min < max, "bad interval");
1374 uintptr_t diff = max ^ min;
1376 // throw away enough low-order bits to make the diff vanish
1377 uintptr_t mask = (uintptr_t)(-1);
1378 while ((mask & diff) != 0)
1379 mask <<= 1;
1380 uintptr_t bits = (min & mask);
1381 assert(bits == (max & mask), "correct mask");
1382 // check an intermediate value between min and max, just to make sure:
1383 assert(bits == ((min + (max-min)/2) & mask), "correct mask");
1385 // require address alignment, too:
1386 mask |= (alignSize - 1);
1388 if (!(verify_data[0] == 0 && verify_data[1] == (uintptr_t)-1)) {
1389 assert(verify_data[0] == mask && verify_data[1] == bits, "mask stability");
1390 }
1391 verify_data[0] = mask;
1392 verify_data[1] = bits;
1393 }
1395 // Oop verification (see MacroAssembler::verify_oop)
1397 uintptr_t Universe::verify_oop_mask() {
1398 MemRegion m = heap()->reserved_region();
1399 calculate_verify_data(_verify_oop_data,
1400 m.start(),
1401 m.end());
1402 return _verify_oop_data[0];
1403 }
1407 uintptr_t Universe::verify_oop_bits() {
1408 verify_oop_mask();
1409 return _verify_oop_data[1];
1410 }
1412 uintptr_t Universe::verify_mark_mask() {
1413 return markOopDesc::lock_mask_in_place;
1414 }
1416 uintptr_t Universe::verify_mark_bits() {
1417 intptr_t mask = verify_mark_mask();
1418 intptr_t bits = (intptr_t)markOopDesc::prototype();
1419 assert((bits & ~mask) == 0, "no stray header bits");
1420 return bits;
1421 }
1422 #endif // PRODUCT
1425 void Universe::compute_verify_oop_data() {
1426 verify_oop_mask();
1427 verify_oop_bits();
1428 verify_mark_mask();
1429 verify_mark_bits();
1430 }
1433 void CommonMethodOopCache::init(Klass* k, Method* m, TRAPS) {
1434 if (!UseSharedSpaces) {
1435 _klass = k;
1436 }
1437 #ifndef PRODUCT
1438 else {
1439 // sharing initilization should have already set up _klass
1440 assert(_klass != NULL, "just checking");
1441 }
1442 #endif
1444 _method_idnum = m->method_idnum();
1445 assert(_method_idnum >= 0, "sanity check");
1446 }
1449 ActiveMethodOopsCache::~ActiveMethodOopsCache() {
1450 if (_prev_methods != NULL) {
1451 delete _prev_methods;
1452 _prev_methods = NULL;
1453 }
1454 }
1457 void ActiveMethodOopsCache::add_previous_version(Method* method) {
1458 assert(Thread::current()->is_VM_thread(),
1459 "only VMThread can add previous versions");
1461 // Only append the previous method if it is executing on the stack.
1462 if (method->on_stack()) {
1464 if (_prev_methods == NULL) {
1465 // This is the first previous version so make some space.
1466 // Start with 2 elements under the assumption that the class
1467 // won't be redefined much.
1468 _prev_methods = new (ResourceObj::C_HEAP, mtClass) GrowableArray<Method*>(2, true);
1469 }
1471 // RC_TRACE macro has an embedded ResourceMark
1472 RC_TRACE(0x00000100,
1473 ("add: %s(%s): adding prev version ref for cached method @%d",
1474 method->name()->as_C_string(), method->signature()->as_C_string(),
1475 _prev_methods->length()));
1477 _prev_methods->append(method);
1478 }
1481 // Since the caller is the VMThread and we are at a safepoint, this is a good
1482 // time to clear out unused method references.
1484 if (_prev_methods == NULL) return;
1486 for (int i = _prev_methods->length() - 1; i >= 0; i--) {
1487 Method* method = _prev_methods->at(i);
1488 assert(method != NULL, "weak method ref was unexpectedly cleared");
1490 if (!method->on_stack()) {
1491 // This method isn't running anymore so remove it
1492 _prev_methods->remove_at(i);
1493 MetadataFactory::free_metadata(method->method_holder()->class_loader_data(), method);
1494 } else {
1495 // RC_TRACE macro has an embedded ResourceMark
1496 RC_TRACE(0x00000400,
1497 ("add: %s(%s): previous cached method @%d is alive",
1498 method->name()->as_C_string(), method->signature()->as_C_string(), i));
1499 }
1500 }
1501 } // end add_previous_version()
1504 bool ActiveMethodOopsCache::is_same_method(const Method* method) const {
1505 InstanceKlass* ik = InstanceKlass::cast(klass());
1506 const Method* check_method = ik->method_with_idnum(method_idnum());
1507 assert(check_method != NULL, "sanity check");
1508 if (check_method == method) {
1509 // done with the easy case
1510 return true;
1511 }
1513 if (_prev_methods != NULL) {
1514 // The cached method has been redefined at least once so search
1515 // the previous versions for a match.
1516 for (int i = 0; i < _prev_methods->length(); i++) {
1517 check_method = _prev_methods->at(i);
1518 if (check_method == method) {
1519 // a previous version matches
1520 return true;
1521 }
1522 }
1523 }
1525 // either no previous versions or no previous version matched
1526 return false;
1527 }
1530 Method* LatestMethodOopCache::get_Method() {
1531 InstanceKlass* ik = InstanceKlass::cast(klass());
1532 Method* m = ik->method_with_idnum(method_idnum());
1533 assert(m != NULL, "sanity check");
1534 return m;
1535 }
1538 #ifdef ASSERT
1539 // Release dummy object(s) at bottom of heap
1540 bool Universe::release_fullgc_alot_dummy() {
1541 MutexLocker ml(FullGCALot_lock);
1542 if (_fullgc_alot_dummy_array != NULL) {
1543 if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) {
1544 // No more dummies to release, release entire array instead
1545 _fullgc_alot_dummy_array = NULL;
1546 return false;
1547 }
1548 if (!UseConcMarkSweepGC) {
1549 // Release dummy at bottom of old generation
1550 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1551 }
1552 // Release dummy at bottom of permanent generation
1553 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1554 }
1555 return true;
1556 }
1558 #endif // ASSERT