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