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