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