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