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