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