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