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