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