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