1 /*
2 * Copyright (c) 1997, 2014, 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 "classfile/classLoader.hpp"
27 #include "classfile/classLoaderData.hpp"
28 #include "classfile/javaClasses.hpp"
29 #include "classfile/stringTable.hpp"
30 #include "classfile/systemDictionary.hpp"
31 #include "classfile/vmSymbols.hpp"
32 #include "code/codeCache.hpp"
33 #include "code/dependencies.hpp"
34 #include "gc_interface/collectedHeap.inline.hpp"
35 #include "interpreter/interpreter.hpp"
36 #include "memory/cardTableModRefBS.hpp"
37 #include "memory/gcLocker.inline.hpp"
38 #include "memory/genCollectedHeap.hpp"
39 #include "memory/genRemSet.hpp"
40 #include "memory/generation.hpp"
41 #include "memory/metadataFactory.hpp"
42 #include "memory/metaspaceShared.hpp"
43 #include "memory/oopFactory.hpp"
44 #include "memory/space.hpp"
45 #include "memory/universe.hpp"
46 #include "memory/universe.inline.hpp"
47 #include "oops/constantPool.hpp"
48 #include "oops/instanceClassLoaderKlass.hpp"
49 #include "oops/instanceKlass.hpp"
50 #include "oops/instanceMirrorKlass.hpp"
51 #include "oops/instanceRefKlass.hpp"
52 #include "oops/oop.inline.hpp"
53 #include "oops/typeArrayKlass.hpp"
54 #include "prims/jvmtiRedefineClassesTrace.hpp"
55 #include "runtime/arguments.hpp"
56 #include "runtime/deoptimization.hpp"
57 #include "runtime/fprofiler.hpp"
58 #include "runtime/handles.inline.hpp"
59 #include "runtime/init.hpp"
60 #include "runtime/java.hpp"
61 #include "runtime/javaCalls.hpp"
62 #include "runtime/sharedRuntime.hpp"
63 #include "runtime/synchronizer.hpp"
64 #include "runtime/thread.inline.hpp"
65 #include "runtime/timer.hpp"
66 #include "runtime/vm_operations.hpp"
67 #include "services/memoryService.hpp"
68 #include "utilities/copy.hpp"
69 #include "utilities/events.hpp"
70 #include "utilities/hashtable.inline.hpp"
71 #include "utilities/preserveException.hpp"
72 #include "utilities/macros.hpp"
73 #if INCLUDE_ALL_GCS
74 #include "gc_implementation/concurrentMarkSweep/cmsAdaptiveSizePolicy.hpp"
75 #include "gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.hpp"
76 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
77 #include "gc_implementation/g1/g1CollectorPolicy.hpp"
78 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
79 #endif // INCLUDE_ALL_GCS
80
81 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
82
83 // Known objects
84 Klass* Universe::_boolArrayKlassObj = NULL;
85 Klass* Universe::_byteArrayKlassObj = NULL;
86 Klass* Universe::_charArrayKlassObj = NULL;
87 Klass* Universe::_intArrayKlassObj = NULL;
88 Klass* Universe::_shortArrayKlassObj = NULL;
89 Klass* Universe::_longArrayKlassObj = NULL;
90 Klass* Universe::_singleArrayKlassObj = NULL;
91 Klass* Universe::_doubleArrayKlassObj = NULL;
92 Klass* Universe::_typeArrayKlassObjs[T_VOID+1] = { NULL /*, NULL...*/ };
93 Klass* Universe::_objectArrayKlassObj = NULL;
94 oop Universe::_int_mirror = NULL;
95 oop Universe::_float_mirror = NULL;
96 oop Universe::_double_mirror = NULL;
97 oop Universe::_byte_mirror = NULL;
98 oop Universe::_bool_mirror = NULL;
99 oop Universe::_char_mirror = NULL;
100 oop Universe::_long_mirror = NULL;
101 oop Universe::_short_mirror = NULL;
102 oop Universe::_void_mirror = NULL;
103 oop Universe::_mirrors[T_VOID+1] = { NULL /*, NULL...*/ };
104 oop Universe::_main_thread_group = NULL;
105 oop Universe::_system_thread_group = NULL;
106 objArrayOop Universe::_the_empty_class_klass_array = NULL;
107 Array<Klass*>* Universe::_the_array_interfaces_array = NULL;
108 oop Universe::_the_null_string = NULL;
109 oop Universe::_the_min_jint_string = NULL;
110 LatestMethodCache* Universe::_finalizer_register_cache = NULL;
111 LatestMethodCache* Universe::_loader_addClass_cache = NULL;
112 LatestMethodCache* Universe::_pd_implies_cache = NULL;
113 oop Universe::_out_of_memory_error_java_heap = NULL;
114 oop Universe::_out_of_memory_error_metaspace = NULL;
115 oop Universe::_out_of_memory_error_class_metaspace = NULL;
116 oop Universe::_out_of_memory_error_array_size = NULL;
117 oop Universe::_out_of_memory_error_gc_overhead_limit = NULL;
118 objArrayOop Universe::_preallocated_out_of_memory_error_array = NULL;
119 volatile jint Universe::_preallocated_out_of_memory_error_avail_count = 0;
120 bool Universe::_verify_in_progress = false;
121 oop Universe::_null_ptr_exception_instance = NULL;
122 oop Universe::_arithmetic_exception_instance = NULL;
123 oop Universe::_virtual_machine_error_instance = NULL;
124 oop Universe::_vm_exception = NULL;
125 Method* Universe::_throw_illegal_access_error = NULL;
126 Array<int>* Universe::_the_empty_int_array = NULL;
127 Array<u2>* Universe::_the_empty_short_array = NULL;
128 Array<Klass*>* Universe::_the_empty_klass_array = NULL;
129 Array<Method*>* Universe::_the_empty_method_array = NULL;
130
131 // These variables are guarded by FullGCALot_lock.
132 debug_only(objArrayOop Universe::_fullgc_alot_dummy_array = NULL;)
133 debug_only(int Universe::_fullgc_alot_dummy_next = 0;)
134
135 // Heap
136 int Universe::_verify_count = 0;
137
138 int Universe::_base_vtable_size = 0;
139 bool Universe::_bootstrapping = false;
140 bool Universe::_fully_initialized = false;
141
142 size_t Universe::_heap_capacity_at_last_gc;
143 size_t Universe::_heap_used_at_last_gc = 0;
144
145 CollectedHeap* Universe::_collectedHeap = NULL;
146
147 NarrowPtrStruct Universe::_narrow_oop = { NULL, 0, true };
148 NarrowPtrStruct Universe::_narrow_klass = { NULL, 0, true };
149 address Universe::_narrow_ptrs_base;
150
151 void Universe::basic_type_classes_do(void f(Klass*)) {
152 f(boolArrayKlassObj());
153 f(byteArrayKlassObj());
154 f(charArrayKlassObj());
155 f(intArrayKlassObj());
156 f(shortArrayKlassObj());
157 f(longArrayKlassObj());
158 f(singleArrayKlassObj());
159 f(doubleArrayKlassObj());
160 }
161
162 void Universe::oops_do(OopClosure* f, bool do_all) {
163
164 f->do_oop((oop*) &_int_mirror);
165 f->do_oop((oop*) &_float_mirror);
166 f->do_oop((oop*) &_double_mirror);
167 f->do_oop((oop*) &_byte_mirror);
168 f->do_oop((oop*) &_bool_mirror);
169 f->do_oop((oop*) &_char_mirror);
170 f->do_oop((oop*) &_long_mirror);
171 f->do_oop((oop*) &_short_mirror);
172 f->do_oop((oop*) &_void_mirror);
173
174 for (int i = T_BOOLEAN; i < T_VOID+1; i++) {
175 f->do_oop((oop*) &_mirrors[i]);
176 }
177 assert(_mirrors[0] == NULL && _mirrors[T_BOOLEAN - 1] == NULL, "checking");
178
179 f->do_oop((oop*)&_the_empty_class_klass_array);
180 f->do_oop((oop*)&_the_null_string);
181 f->do_oop((oop*)&_the_min_jint_string);
182 f->do_oop((oop*)&_out_of_memory_error_java_heap);
183 f->do_oop((oop*)&_out_of_memory_error_metaspace);
184 f->do_oop((oop*)&_out_of_memory_error_class_metaspace);
185 f->do_oop((oop*)&_out_of_memory_error_array_size);
186 f->do_oop((oop*)&_out_of_memory_error_gc_overhead_limit);
187 f->do_oop((oop*)&_preallocated_out_of_memory_error_array);
188 f->do_oop((oop*)&_null_ptr_exception_instance);
189 f->do_oop((oop*)&_arithmetic_exception_instance);
190 f->do_oop((oop*)&_virtual_machine_error_instance);
191 f->do_oop((oop*)&_main_thread_group);
192 f->do_oop((oop*)&_system_thread_group);
193 f->do_oop((oop*)&_vm_exception);
194 debug_only(f->do_oop((oop*)&_fullgc_alot_dummy_array);)
195 }
196
197 // Serialize metadata in and out of CDS archive, not oops.
198 void Universe::serialize(SerializeClosure* f, bool do_all) {
199
200 f->do_ptr((void**)&_boolArrayKlassObj);
201 f->do_ptr((void**)&_byteArrayKlassObj);
202 f->do_ptr((void**)&_charArrayKlassObj);
203 f->do_ptr((void**)&_intArrayKlassObj);
204 f->do_ptr((void**)&_shortArrayKlassObj);
205 f->do_ptr((void**)&_longArrayKlassObj);
206 f->do_ptr((void**)&_singleArrayKlassObj);
207 f->do_ptr((void**)&_doubleArrayKlassObj);
208 f->do_ptr((void**)&_objectArrayKlassObj);
209
210 {
211 for (int i = 0; i < T_VOID+1; i++) {
212 if (_typeArrayKlassObjs[i] != NULL) {
213 assert(i >= T_BOOLEAN, "checking");
214 f->do_ptr((void**)&_typeArrayKlassObjs[i]);
215 } else if (do_all) {
216 f->do_ptr((void**)&_typeArrayKlassObjs[i]);
217 }
218 }
219 }
220
221 f->do_ptr((void**)&_the_array_interfaces_array);
222 f->do_ptr((void**)&_the_empty_int_array);
223 f->do_ptr((void**)&_the_empty_short_array);
224 f->do_ptr((void**)&_the_empty_method_array);
225 f->do_ptr((void**)&_the_empty_klass_array);
226 _finalizer_register_cache->serialize(f);
227 _loader_addClass_cache->serialize(f);
228 _pd_implies_cache->serialize(f);
229 }
230
231 void Universe::check_alignment(uintx size, uintx alignment, const char* name) {
232 if (size < alignment || size % alignment != 0) {
233 vm_exit_during_initialization(
234 err_msg("Size of %s (" UINTX_FORMAT " bytes) must be aligned to " UINTX_FORMAT " bytes", name, size, alignment));
235 }
236 }
237
238 void initialize_basic_type_klass(Klass* k, TRAPS) {
239 Klass* ok = SystemDictionary::Object_klass();
240 if (UseSharedSpaces) {
241 assert(k->super() == ok, "u3");
242 k->restore_unshareable_info(CHECK);
243 } else {
244 k->initialize_supers(ok, CHECK);
245 }
246 k->append_to_sibling_list();
247 }
248
249 void Universe::genesis(TRAPS) {
250 ResourceMark rm;
251
252 { FlagSetting fs(_bootstrapping, true);
253
254 { MutexLocker mc(Compile_lock);
255
256 // determine base vtable size; without that we cannot create the array klasses
257 compute_base_vtable_size();
258
259 if (!UseSharedSpaces) {
260 _boolArrayKlassObj = TypeArrayKlass::create_klass(T_BOOLEAN, sizeof(jboolean), CHECK);
261 _charArrayKlassObj = TypeArrayKlass::create_klass(T_CHAR, sizeof(jchar), CHECK);
262 _singleArrayKlassObj = TypeArrayKlass::create_klass(T_FLOAT, sizeof(jfloat), CHECK);
263 _doubleArrayKlassObj = TypeArrayKlass::create_klass(T_DOUBLE, sizeof(jdouble), CHECK);
264 _byteArrayKlassObj = TypeArrayKlass::create_klass(T_BYTE, sizeof(jbyte), CHECK);
265 _shortArrayKlassObj = TypeArrayKlass::create_klass(T_SHORT, sizeof(jshort), CHECK);
266 _intArrayKlassObj = TypeArrayKlass::create_klass(T_INT, sizeof(jint), CHECK);
267 _longArrayKlassObj = TypeArrayKlass::create_klass(T_LONG, sizeof(jlong), CHECK);
268
269 _typeArrayKlassObjs[T_BOOLEAN] = _boolArrayKlassObj;
270 _typeArrayKlassObjs[T_CHAR] = _charArrayKlassObj;
271 _typeArrayKlassObjs[T_FLOAT] = _singleArrayKlassObj;
272 _typeArrayKlassObjs[T_DOUBLE] = _doubleArrayKlassObj;
273 _typeArrayKlassObjs[T_BYTE] = _byteArrayKlassObj;
274 _typeArrayKlassObjs[T_SHORT] = _shortArrayKlassObj;
275 _typeArrayKlassObjs[T_INT] = _intArrayKlassObj;
276 _typeArrayKlassObjs[T_LONG] = _longArrayKlassObj;
277
278 ClassLoaderData* null_cld = ClassLoaderData::the_null_class_loader_data();
279
280 _the_array_interfaces_array = MetadataFactory::new_array<Klass*>(null_cld, 2, NULL, CHECK);
281 _the_empty_int_array = MetadataFactory::new_array<int>(null_cld, 0, CHECK);
282 _the_empty_short_array = MetadataFactory::new_array<u2>(null_cld, 0, CHECK);
283 _the_empty_method_array = MetadataFactory::new_array<Method*>(null_cld, 0, CHECK);
284 _the_empty_klass_array = MetadataFactory::new_array<Klass*>(null_cld, 0, CHECK);
285 }
286 }
287
288 vmSymbols::initialize(CHECK);
289
290 SystemDictionary::initialize(CHECK);
291
292 Klass* ok = SystemDictionary::Object_klass();
293
294 _the_null_string = StringTable::intern("null", CHECK);
295 _the_min_jint_string = StringTable::intern("-2147483648", CHECK);
296
297 if (UseSharedSpaces) {
298 // Verify shared interfaces array.
299 assert(_the_array_interfaces_array->at(0) ==
300 SystemDictionary::Cloneable_klass(), "u3");
301 assert(_the_array_interfaces_array->at(1) ==
302 SystemDictionary::Serializable_klass(), "u3");
303 } else {
304 // Set up shared interfaces array. (Do this before supers are set up.)
305 _the_array_interfaces_array->at_put(0, SystemDictionary::Cloneable_klass());
306 _the_array_interfaces_array->at_put(1, SystemDictionary::Serializable_klass());
307 }
308
309 initialize_basic_type_klass(boolArrayKlassObj(), CHECK);
310 initialize_basic_type_klass(charArrayKlassObj(), CHECK);
311 initialize_basic_type_klass(singleArrayKlassObj(), CHECK);
312 initialize_basic_type_klass(doubleArrayKlassObj(), CHECK);
313 initialize_basic_type_klass(byteArrayKlassObj(), CHECK);
314 initialize_basic_type_klass(shortArrayKlassObj(), CHECK);
315 initialize_basic_type_klass(intArrayKlassObj(), CHECK);
316 initialize_basic_type_klass(longArrayKlassObj(), CHECK);
317 } // end of core bootstrapping
318
319 // Maybe this could be lifted up now that object array can be initialized
320 // during the bootstrapping.
321
322 // OLD
323 // Initialize _objectArrayKlass after core bootstraping to make
324 // sure the super class is set up properly for _objectArrayKlass.
325 // ---
326 // NEW
327 // Since some of the old system object arrays have been converted to
328 // ordinary object arrays, _objectArrayKlass will be loaded when
329 // SystemDictionary::initialize(CHECK); is run. See the extra check
330 // for Object_klass_loaded in objArrayKlassKlass::allocate_objArray_klass_impl.
331 _objectArrayKlassObj = InstanceKlass::
332 cast(SystemDictionary::Object_klass())->array_klass(1, CHECK);
333 // OLD
334 // Add the class to the class hierarchy manually to make sure that
335 // its vtable is initialized after core bootstrapping is completed.
336 // ---
337 // New
338 // Have already been initialized.
339 _objectArrayKlassObj->append_to_sibling_list();
340
341 // Compute is_jdk version flags.
342 // Only 1.3 or later has the java.lang.Shutdown class.
343 // Only 1.4 or later has the java.lang.CharSequence interface.
344 // Only 1.5 or later has the java.lang.management.MemoryUsage class.
345 if (JDK_Version::is_partially_initialized()) {
346 uint8_t jdk_version;
347 Klass* k = SystemDictionary::resolve_or_null(
348 vmSymbols::java_lang_management_MemoryUsage(), THREAD);
349 CLEAR_PENDING_EXCEPTION; // ignore exceptions
350 if (k == NULL) {
351 k = SystemDictionary::resolve_or_null(
352 vmSymbols::java_lang_CharSequence(), THREAD);
353 CLEAR_PENDING_EXCEPTION; // ignore exceptions
354 if (k == NULL) {
355 k = SystemDictionary::resolve_or_null(
356 vmSymbols::java_lang_Shutdown(), THREAD);
357 CLEAR_PENDING_EXCEPTION; // ignore exceptions
358 if (k == NULL) {
359 jdk_version = 2;
360 } else {
361 jdk_version = 3;
362 }
363 } else {
364 jdk_version = 4;
365 }
366 } else {
367 jdk_version = 5;
368 }
369 JDK_Version::fully_initialize(jdk_version);
370 }
371
372 #ifdef ASSERT
373 if (FullGCALot) {
374 // Allocate an array of dummy objects.
375 // We'd like these to be at the bottom of the old generation,
376 // so that when we free one and then collect,
377 // (almost) the whole heap moves
378 // and we find out if we actually update all the oops correctly.
379 // But we can't allocate directly in the old generation,
380 // so we allocate wherever, and hope that the first collection
381 // moves these objects to the bottom of the old generation.
382 // We can allocate directly in the permanent generation, so we do.
383 int size;
384 if (UseConcMarkSweepGC) {
385 warning("Using +FullGCALot with concurrent mark sweep gc "
386 "will not force all objects to relocate");
387 size = FullGCALotDummies;
388 } else {
389 size = FullGCALotDummies * 2;
390 }
391 objArrayOop naked_array = oopFactory::new_objArray(SystemDictionary::Object_klass(), size, CHECK);
392 objArrayHandle dummy_array(THREAD, naked_array);
393 int i = 0;
394 while (i < size) {
395 // Allocate dummy in old generation
396 oop dummy = InstanceKlass::cast(SystemDictionary::Object_klass())->allocate_instance(CHECK);
397 dummy_array->obj_at_put(i++, dummy);
398 }
399 {
400 // Only modify the global variable inside the mutex.
401 // If we had a race to here, the other dummy_array instances
402 // and their elements just get dropped on the floor, which is fine.
403 MutexLocker ml(FullGCALot_lock);
404 if (_fullgc_alot_dummy_array == NULL) {
405 _fullgc_alot_dummy_array = dummy_array();
406 }
407 }
408 assert(i == _fullgc_alot_dummy_array->length(), "just checking");
409 }
410 #endif
411
412 // Initialize dependency array for null class loader
413 ClassLoaderData::the_null_class_loader_data()->init_dependencies(CHECK);
414
415 }
416
417 // CDS support for patching vtables in metadata in the shared archive.
418 // All types inherited from Metadata have vtables, but not types inherited
419 // from MetaspaceObj, because the latter does not have virtual functions.
420 // If the metadata type has a vtable, it cannot be shared in the read-only
421 // section of the CDS archive, because the vtable pointer is patched.
422 static inline void add_vtable(void** list, int* n, void* o, int count) {
423 guarantee((*n) < count, "vtable list too small");
424 void* vtable = dereference_vptr(o);
425 assert(*(void**)(vtable) != NULL, "invalid vtable");
426 list[(*n)++] = vtable;
427 }
428
429 void Universe::init_self_patching_vtbl_list(void** list, int count) {
430 int n = 0;
431 { InstanceKlass o; add_vtable(list, &n, &o, count); }
432 { InstanceClassLoaderKlass o; add_vtable(list, &n, &o, count); }
433 { InstanceMirrorKlass o; add_vtable(list, &n, &o, count); }
434 { InstanceRefKlass o; add_vtable(list, &n, &o, count); }
435 { TypeArrayKlass o; add_vtable(list, &n, &o, count); }
436 { ObjArrayKlass o; add_vtable(list, &n, &o, count); }
437 { Method o; add_vtable(list, &n, &o, count); }
438 { ConstantPool o; add_vtable(list, &n, &o, count); }
439 }
440
441 void Universe::initialize_basic_type_mirrors(TRAPS) {
442 assert(_int_mirror==NULL, "basic type mirrors already initialized");
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 _mirrors[T_INT] = _int_mirror;
463 _mirrors[T_FLOAT] = _float_mirror;
464 _mirrors[T_DOUBLE] = _double_mirror;
465 _mirrors[T_BYTE] = _byte_mirror;
466 _mirrors[T_BOOLEAN] = _bool_mirror;
467 _mirrors[T_CHAR] = _char_mirror;
468 _mirrors[T_LONG] = _long_mirror;
469 _mirrors[T_SHORT] = _short_mirror;
470 _mirrors[T_VOID] = _void_mirror;
471 //_mirrors[T_OBJECT] = InstanceKlass::cast(_object_klass)->java_mirror();
472 //_mirrors[T_ARRAY] = InstanceKlass::cast(_object_klass)->java_mirror();
473 }
474
475 void Universe::fixup_mirrors(TRAPS) {
476 // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly,
477 // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply
478 // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note
479 // that the number of objects allocated at this point is very small.
480 assert(SystemDictionary::Class_klass_loaded(), "java.lang.Class should be loaded");
481 HandleMark hm(THREAD);
482 // Cache the start of the static fields
483 InstanceMirrorKlass::init_offset_of_static_fields();
484
485 GrowableArray <Klass*>* list = java_lang_Class::fixup_mirror_list();
486 int list_length = list->length();
487 for (int i = 0; i < list_length; i++) {
488 Klass* k = list->at(i);
489 assert(k->is_klass(), "List should only hold classes");
490 EXCEPTION_MARK;
491 KlassHandle kh(THREAD, k);
492 java_lang_Class::fixup_mirror(kh, CATCH);
493 }
494 delete java_lang_Class::fixup_mirror_list();
495 java_lang_Class::set_fixup_mirror_list(NULL);
496 }
497
498 static bool has_run_finalizers_on_exit = false;
499
500 void Universe::run_finalizers_on_exit() {
501 if (has_run_finalizers_on_exit) return;
502 has_run_finalizers_on_exit = true;
503
504 // Called on VM exit. This ought to be run in a separate thread.
505 if (TraceReferenceGC) tty->print_cr("Callback to run finalizers on exit");
506 {
507 PRESERVE_EXCEPTION_MARK;
508 KlassHandle finalizer_klass(THREAD, SystemDictionary::Finalizer_klass());
509 JavaValue result(T_VOID);
510 JavaCalls::call_static(
511 &result,
512 finalizer_klass,
513 vmSymbols::run_finalizers_on_exit_name(),
514 vmSymbols::void_method_signature(),
515 THREAD
516 );
517 // Ignore any pending exceptions
518 CLEAR_PENDING_EXCEPTION;
519 }
520 }
521
522
523 // initialize_vtable could cause gc if
524 // 1) we specified true to initialize_vtable and
525 // 2) this ran after gc was enabled
526 // In case those ever change we use handles for oops
527 void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) {
528 // init vtable of k and all subclasses
529 Klass* ko = k_h();
530 klassVtable* vt = ko->vtable();
531 if (vt) vt->initialize_vtable(false, CHECK);
532 if (ko->oop_is_instance()) {
533 InstanceKlass* ik = (InstanceKlass*)ko;
534 for (KlassHandle s_h(THREAD, ik->subklass());
535 s_h() != NULL;
536 s_h = KlassHandle(THREAD, s_h()->next_sibling())) {
537 reinitialize_vtable_of(s_h, CHECK);
538 }
539 }
540 }
541
542
543 void initialize_itable_for_klass(Klass* k, TRAPS) {
544 InstanceKlass::cast(k)->itable()->initialize_itable(false, CHECK);
545 }
546
547
548 void Universe::reinitialize_itables(TRAPS) {
549 SystemDictionary::classes_do(initialize_itable_for_klass, CHECK);
550
551 }
552
553
554 bool Universe::on_page_boundary(void* addr) {
555 return ((uintptr_t) addr) % os::vm_page_size() == 0;
556 }
557
558
559 bool Universe::should_fill_in_stack_trace(Handle throwable) {
560 // never attempt to fill in the stack trace of preallocated errors that do not have
561 // backtrace. These errors are kept alive forever and may be "re-used" when all
562 // preallocated errors with backtrace have been consumed. Also need to avoid
563 // a potential loop which could happen if an out of memory occurs when attempting
564 // to allocate the backtrace.
565 return ((throwable() != Universe::_out_of_memory_error_java_heap) &&
566 (throwable() != Universe::_out_of_memory_error_metaspace) &&
567 (throwable() != Universe::_out_of_memory_error_class_metaspace) &&
568 (throwable() != Universe::_out_of_memory_error_array_size) &&
569 (throwable() != Universe::_out_of_memory_error_gc_overhead_limit));
570 }
571
572
573 oop Universe::gen_out_of_memory_error(oop default_err) {
574 // generate an out of memory error:
575 // - if there is a preallocated error with backtrace available then return it wth
576 // a filled in stack trace.
577 // - if there are no preallocated errors with backtrace available then return
578 // an error without backtrace.
579 int next;
580 if (_preallocated_out_of_memory_error_avail_count > 0) {
581 next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count);
582 assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt");
583 } else {
584 next = -1;
585 }
586 if (next < 0) {
587 // all preallocated errors have been used.
588 // return default
589 return default_err;
590 } else {
591 // get the error object at the slot and set set it to NULL so that the
592 // array isn't keeping it alive anymore.
593 oop exc = preallocated_out_of_memory_errors()->obj_at(next);
594 assert(exc != NULL, "slot has been used already");
595 preallocated_out_of_memory_errors()->obj_at_put(next, NULL);
596
597 // use the message from the default error
598 oop msg = java_lang_Throwable::message(default_err);
599 assert(msg != NULL, "no message");
600 java_lang_Throwable::set_message(exc, msg);
601
602 // populate the stack trace and return it.
603 java_lang_Throwable::fill_in_stack_trace_of_preallocated_backtrace(exc);
604 return exc;
605 }
606 }
607
608 intptr_t Universe::_non_oop_bits = 0;
609
610 void* Universe::non_oop_word() {
611 // Neither the high bits nor the low bits of this value is allowed
612 // to look like (respectively) the high or low bits of a real oop.
613 //
614 // High and low are CPU-specific notions, but low always includes
615 // the low-order bit. Since oops are always aligned at least mod 4,
616 // setting the low-order bit will ensure that the low half of the
617 // word will never look like that of a real oop.
618 //
619 // Using the OS-supplied non-memory-address word (usually 0 or -1)
620 // will take care of the high bits, however many there are.
621
622 if (_non_oop_bits == 0) {
623 _non_oop_bits = (intptr_t)os::non_memory_address_word() | 1;
624 }
625
626 return (void*)_non_oop_bits;
627 }
628
629 jint universe_init() {
630 assert(!Universe::_fully_initialized, "called after initialize_vtables");
631 guarantee(1 << LogHeapWordSize == sizeof(HeapWord),
632 "LogHeapWordSize is incorrect.");
633 guarantee(sizeof(oop) >= sizeof(HeapWord), "HeapWord larger than oop?");
634 guarantee(sizeof(oop) % sizeof(HeapWord) == 0,
635 "oop size is not not a multiple of HeapWord size");
636 TraceTime timer("Genesis", TraceStartupTime);
637 JavaClasses::compute_hard_coded_offsets();
638
639 jint status = Universe::initialize_heap();
640 if (status != JNI_OK) {
641 return status;
642 }
643
644 Metaspace::global_initialize();
645
646 // Create memory for metadata. Must be after initializing heap for
647 // DumpSharedSpaces.
648 ClassLoaderData::init_null_class_loader_data();
649
650 // We have a heap so create the Method* caches before
651 // Metaspace::initialize_shared_spaces() tries to populate them.
652 Universe::_finalizer_register_cache = new LatestMethodCache();
653 Universe::_loader_addClass_cache = new LatestMethodCache();
654 Universe::_pd_implies_cache = new LatestMethodCache();
655
656 if (UseSharedSpaces) {
657 // Read the data structures supporting the shared spaces (shared
658 // system dictionary, symbol table, etc.). After that, access to
659 // the file (other than the mapped regions) is no longer needed, and
660 // the file is closed. Closing the file does not affect the
661 // currently mapped regions.
662 MetaspaceShared::initialize_shared_spaces();
663 StringTable::create_table();
664 } else {
665 SymbolTable::create_table();
666 StringTable::create_table();
667 ClassLoader::create_package_info_table();
668 }
669
670 return JNI_OK;
671 }
672
673 // Choose the heap base address and oop encoding mode
674 // when compressed oops are used:
675 // Unscaled - Use 32-bits oops without encoding when
676 // NarrowOopHeapBaseMin + heap_size < 4Gb
677 // ZeroBased - Use zero based compressed oops with encoding when
678 // NarrowOopHeapBaseMin + heap_size < 32Gb
679 // HeapBased - Use compressed oops with heap base + encoding.
680
681 // 4Gb
682 static const uint64_t UnscaledOopHeapMax = (uint64_t(max_juint) + 1);
683 // 32Gb
684 // OopEncodingHeapMax == UnscaledOopHeapMax << LogMinObjAlignmentInBytes;
685
686 char* Universe::preferred_heap_base(size_t heap_size, size_t alignment, NARROW_OOP_MODE mode) {
687 assert(is_size_aligned((size_t)OopEncodingHeapMax, alignment), "Must be");
688 assert(is_size_aligned((size_t)UnscaledOopHeapMax, alignment), "Must be");
689 assert(is_size_aligned(heap_size, alignment), "Must be");
690
691 uintx heap_base_min_address_aligned = align_size_up(HeapBaseMinAddress, alignment);
692
693 size_t base = 0;
694 #ifdef _LP64
695 if (UseCompressedOops) {
696 assert(mode == UnscaledNarrowOop ||
697 mode == ZeroBasedNarrowOop ||
698 mode == HeapBasedNarrowOop, "mode is invalid");
699 const size_t total_size = heap_size + heap_base_min_address_aligned;
700 // Return specified base for the first request.
701 if (!FLAG_IS_DEFAULT(HeapBaseMinAddress) && (mode == UnscaledNarrowOop)) {
702 base = heap_base_min_address_aligned;
703
704 // If the total size is small enough to allow UnscaledNarrowOop then
705 // just use UnscaledNarrowOop.
706 } else if ((total_size <= OopEncodingHeapMax) && (mode != HeapBasedNarrowOop)) {
707 if ((total_size <= UnscaledOopHeapMax) && (mode == UnscaledNarrowOop) &&
708 (Universe::narrow_oop_shift() == 0)) {
709 // Use 32-bits oops without encoding and
710 // place heap's top on the 4Gb boundary
711 base = (UnscaledOopHeapMax - heap_size);
712 } else {
713 // Can't reserve with NarrowOopShift == 0
714 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
715
716 if (mode == UnscaledNarrowOop ||
717 mode == ZeroBasedNarrowOop && total_size <= UnscaledOopHeapMax) {
718
719 // Use zero based compressed oops with encoding and
720 // place heap's top on the 32Gb boundary in case
721 // total_size > 4Gb or failed to reserve below 4Gb.
722 uint64_t heap_top = OopEncodingHeapMax;
723
724 // For small heaps, save some space for compressed class pointer
725 // space so it can be decoded with no base.
726 if (UseCompressedClassPointers && !UseSharedSpaces &&
727 OopEncodingHeapMax <= 32*G) {
728
729 uint64_t class_space = align_size_up(CompressedClassSpaceSize, alignment);
730 assert(is_size_aligned((size_t)OopEncodingHeapMax-class_space,
731 alignment), "difference must be aligned too");
732 uint64_t new_top = OopEncodingHeapMax-class_space;
733
734 if (total_size <= new_top) {
735 heap_top = new_top;
736 }
737 }
738
739 // Align base to the adjusted top of the heap
740 base = heap_top - heap_size;
741 }
742 }
743 } else {
744 // UnscaledNarrowOop encoding didn't work, and no base was found for ZeroBasedOops or
745 // HeapBasedNarrowOop encoding was requested. So, can't reserve below 32Gb.
746 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
747 }
748
749 // Set narrow_oop_base and narrow_oop_use_implicit_null_checks
750 // used in ReservedHeapSpace() constructors.
751 // The final values will be set in initialize_heap() below.
752 if ((base != 0) && ((base + heap_size) <= OopEncodingHeapMax)) {
753 // Use zero based compressed oops
754 Universe::set_narrow_oop_base(NULL);
755 // Don't need guard page for implicit checks in indexed
756 // addressing mode with zero based Compressed Oops.
757 Universe::set_narrow_oop_use_implicit_null_checks(true);
758 } else {
759 // Set to a non-NULL value so the ReservedSpace ctor computes
760 // the correct no-access prefix.
761 // The final value will be set in initialize_heap() below.
762 Universe::set_narrow_oop_base((address)UnscaledOopHeapMax);
763 #if defined(_WIN64) || defined(AIX)
764 if (UseLargePages) {
765 // Cannot allocate guard pages for implicit checks in indexed
766 // addressing mode when large pages are specified on windows.
767 Universe::set_narrow_oop_use_implicit_null_checks(false);
768 }
769 #endif // _WIN64
770 }
771 }
772 #endif
773
774 assert(is_ptr_aligned((char*)base, alignment), "Must be");
775 return (char*)base; // also return NULL (don't care) for 32-bit VM
776 }
777
778 jint Universe::initialize_heap() {
779
780 if (UseParallelGC) {
781 #if INCLUDE_ALL_GCS
782 Universe::_collectedHeap = new ParallelScavengeHeap();
783 #else // INCLUDE_ALL_GCS
784 fatal("UseParallelGC not supported in this VM.");
785 #endif // INCLUDE_ALL_GCS
786
787 } else if (UseG1GC) {
788 #if INCLUDE_ALL_GCS
789 G1CollectorPolicy* g1p = new G1CollectorPolicy();
790 g1p->initialize_all();
791 G1CollectedHeap* g1h = new G1CollectedHeap(g1p);
792 Universe::_collectedHeap = g1h;
793 #else // INCLUDE_ALL_GCS
794 fatal("UseG1GC not supported in java kernel vm.");
795 #endif // INCLUDE_ALL_GCS
796
797 } else {
798 GenCollectorPolicy *gc_policy;
799
800 if (UseSerialGC) {
801 gc_policy = new MarkSweepPolicy();
802 } else if (UseConcMarkSweepGC) {
803 #if INCLUDE_ALL_GCS
804 if (UseAdaptiveSizePolicy) {
805 gc_policy = new ASConcurrentMarkSweepPolicy();
806 } else {
807 gc_policy = new ConcurrentMarkSweepPolicy();
808 }
809 #else // INCLUDE_ALL_GCS
810 fatal("UseConcMarkSweepGC not supported in this VM.");
811 #endif // INCLUDE_ALL_GCS
812 } else { // default old generation
813 gc_policy = new MarkSweepPolicy();
814 }
815 gc_policy->initialize_all();
816
817 Universe::_collectedHeap = new GenCollectedHeap(gc_policy);
818 }
819
820 ThreadLocalAllocBuffer::set_max_size(Universe::heap()->max_tlab_size());
821
822 jint status = Universe::heap()->initialize();
823 if (status != JNI_OK) {
824 return status;
825 }
826
827 #ifdef _LP64
828 if (UseCompressedOops) {
829 // Subtract a page because something can get allocated at heap base.
830 // This also makes implicit null checking work, because the
831 // memory+1 page below heap_base needs to cause a signal.
832 // See needs_explicit_null_check.
833 // Only set the heap base for compressed oops because it indicates
834 // compressed oops for pstack code.
835 bool verbose = PrintCompressedOopsMode || (PrintMiscellaneous && Verbose);
836 if (verbose) {
837 tty->cr();
838 tty->print("heap address: " PTR_FORMAT ", size: " SIZE_FORMAT " MB",
839 Universe::heap()->base(), Universe::heap()->reserved_region().byte_size()/M);
840 }
841 if (((uint64_t)Universe::heap()->reserved_region().end() > OopEncodingHeapMax)) {
842 // Can't reserve heap below 32Gb.
843 // keep the Universe::narrow_oop_base() set in Universe::reserve_heap()
844 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
845 #ifdef AIX
846 // There is no protected page before the heap. This assures all oops
847 // are decoded so that NULL is preserved, so this page will not be accessed.
848 Universe::set_narrow_oop_use_implicit_null_checks(false);
849 #endif
850 if (verbose) {
851 tty->print(", %s: "PTR_FORMAT,
852 narrow_oop_mode_to_string(HeapBasedNarrowOop),
853 Universe::narrow_oop_base());
854 }
855 } else {
856 Universe::set_narrow_oop_base(0);
857 if (verbose) {
858 tty->print(", %s", narrow_oop_mode_to_string(ZeroBasedNarrowOop));
859 }
860 #ifdef _WIN64
861 if (!Universe::narrow_oop_use_implicit_null_checks()) {
862 // Don't need guard page for implicit checks in indexed addressing
863 // mode with zero based Compressed Oops.
864 Universe::set_narrow_oop_use_implicit_null_checks(true);
865 }
866 #endif // _WIN64
867 if((uint64_t)Universe::heap()->reserved_region().end() > UnscaledOopHeapMax) {
868 // Can't reserve heap below 4Gb.
869 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
870 } else {
871 Universe::set_narrow_oop_shift(0);
872 if (verbose) {
873 tty->print(", %s", narrow_oop_mode_to_string(UnscaledNarrowOop));
874 }
875 }
876 }
877
878 if (verbose) {
879 tty->cr();
880 tty->cr();
881 }
882 Universe::set_narrow_ptrs_base(Universe::narrow_oop_base());
883 }
884 // Universe::narrow_oop_base() is one page below the heap.
885 assert((intptr_t)Universe::narrow_oop_base() <= (intptr_t)(Universe::heap()->base() -
886 os::vm_page_size()) ||
887 Universe::narrow_oop_base() == NULL, "invalid value");
888 assert(Universe::narrow_oop_shift() == LogMinObjAlignmentInBytes ||
889 Universe::narrow_oop_shift() == 0, "invalid value");
890 #endif
891
892 // We will never reach the CATCH below since Exceptions::_throw will cause
893 // the VM to exit if an exception is thrown during initialization
894
895 if (UseTLAB) {
896 assert(Universe::heap()->supports_tlab_allocation(),
897 "Should support thread-local allocation buffers");
898 ThreadLocalAllocBuffer::startup_initialization();
899 }
900 return JNI_OK;
901 }
902
903
904 // Reserve the Java heap, which is now the same for all GCs.
905 ReservedSpace Universe::reserve_heap(size_t heap_size, size_t alignment) {
906 assert(alignment <= Arguments::conservative_max_heap_alignment(),
907 err_msg("actual alignment "SIZE_FORMAT" must be within maximum heap alignment "SIZE_FORMAT,
908 alignment, Arguments::conservative_max_heap_alignment()));
909 size_t total_reserved = align_size_up(heap_size, alignment);
910 assert(!UseCompressedOops || (total_reserved <= (OopEncodingHeapMax - os::vm_page_size())),
911 "heap size is too big for compressed oops");
912
913 bool use_large_pages = UseLargePages && is_size_aligned(alignment, os::large_page_size());
914 assert(!UseLargePages
915 || UseParallelGC
916 || use_large_pages, "Wrong alignment to use large pages");
917
918 char* addr = Universe::preferred_heap_base(total_reserved, alignment, Universe::UnscaledNarrowOop);
919
920 ReservedHeapSpace total_rs(total_reserved, alignment, use_large_pages, addr);
921
922 if (UseCompressedOops) {
923 if (addr != NULL && !total_rs.is_reserved()) {
924 // Failed to reserve at specified address - the requested memory
925 // region is taken already, for example, by 'java' launcher.
926 // Try again to reserver heap higher.
927 addr = Universe::preferred_heap_base(total_reserved, alignment, Universe::ZeroBasedNarrowOop);
928
929 ReservedHeapSpace total_rs0(total_reserved, alignment,
930 use_large_pages, addr);
931
932 if (addr != NULL && !total_rs0.is_reserved()) {
933 // Failed to reserve at specified address again - give up.
934 addr = Universe::preferred_heap_base(total_reserved, alignment, Universe::HeapBasedNarrowOop);
935 assert(addr == NULL, "");
936
937 ReservedHeapSpace total_rs1(total_reserved, alignment,
938 use_large_pages, addr);
939 total_rs = total_rs1;
940 } else {
941 total_rs = total_rs0;
942 }
943 }
944 }
945
946 if (!total_rs.is_reserved()) {
947 vm_exit_during_initialization(err_msg("Could not reserve enough space for " SIZE_FORMAT "KB object heap", total_reserved/K));
948 return total_rs;
949 }
950
951 if (UseCompressedOops) {
952 // Universe::initialize_heap() will reset this to NULL if unscaled
953 // or zero-based narrow oops are actually used.
954 address base = (address)(total_rs.base() - os::vm_page_size());
955 Universe::set_narrow_oop_base(base);
956 }
957 return total_rs;
958 }
959
960
961 // It's the caller's responsibility to ensure glitch-freedom
962 // (if required).
963 void Universe::update_heap_info_at_gc() {
964 _heap_capacity_at_last_gc = heap()->capacity();
965 _heap_used_at_last_gc = heap()->used();
966 }
967
968
969 const char* Universe::narrow_oop_mode_to_string(Universe::NARROW_OOP_MODE mode) {
970 switch (mode) {
971 case UnscaledNarrowOop:
972 return "32-bits Oops";
973 case ZeroBasedNarrowOop:
974 return "zero based Compressed Oops";
975 case HeapBasedNarrowOop:
976 return "Compressed Oops with base";
977 }
978
979 ShouldNotReachHere();
980 return "";
981 }
982
983
984 Universe::NARROW_OOP_MODE Universe::narrow_oop_mode() {
985 if (narrow_oop_base() != 0) {
986 return HeapBasedNarrowOop;
987 }
988
989 if (narrow_oop_shift() != 0) {
990 return ZeroBasedNarrowOop;
991 }
992
993 return UnscaledNarrowOop;
994 }
995
996
997 void universe2_init() {
998 EXCEPTION_MARK;
999 Universe::genesis(CATCH);
1000 }
1001
1002
1003 // This function is defined in JVM.cpp
1004 extern void initialize_converter_functions();
1005
1006 bool universe_post_init() {
1007 assert(!is_init_completed(), "Error: initialization not yet completed!");
1008 Universe::_fully_initialized = true;
1009 EXCEPTION_MARK;
1010 { ResourceMark rm;
1011 Interpreter::initialize(); // needed for interpreter entry points
1012 if (!UseSharedSpaces) {
1013 HandleMark hm(THREAD);
1014 KlassHandle ok_h(THREAD, SystemDictionary::Object_klass());
1015 Universe::reinitialize_vtable_of(ok_h, CHECK_false);
1016 Universe::reinitialize_itables(CHECK_false);
1017 }
1018 }
1019
1020 HandleMark hm(THREAD);
1021 Klass* k;
1022 instanceKlassHandle k_h;
1023 // Setup preallocated empty java.lang.Class array
1024 Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::Class_klass(), 0, CHECK_false);
1025
1026 // Setup preallocated OutOfMemoryError errors
1027 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_OutOfMemoryError(), true, CHECK_false);
1028 k_h = instanceKlassHandle(THREAD, k);
1029 Universe::_out_of_memory_error_java_heap = k_h->allocate_instance(CHECK_false);
1030 Universe::_out_of_memory_error_metaspace = k_h->allocate_instance(CHECK_false);
1031 Universe::_out_of_memory_error_class_metaspace = k_h->allocate_instance(CHECK_false);
1032 Universe::_out_of_memory_error_array_size = k_h->allocate_instance(CHECK_false);
1033 Universe::_out_of_memory_error_gc_overhead_limit =
1034 k_h->allocate_instance(CHECK_false);
1035
1036 // Setup preallocated NullPointerException
1037 // (this is currently used for a cheap & dirty solution in compiler exception handling)
1038 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_NullPointerException(), true, CHECK_false);
1039 Universe::_null_ptr_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
1040 // Setup preallocated ArithmeticException
1041 // (this is currently used for a cheap & dirty solution in compiler exception handling)
1042 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_ArithmeticException(), true, CHECK_false);
1043 Universe::_arithmetic_exception_instance = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
1044 // Virtual Machine Error for when we get into a situation we can't resolve
1045 k = SystemDictionary::resolve_or_fail(
1046 vmSymbols::java_lang_VirtualMachineError(), true, CHECK_false);
1047 bool linked = InstanceKlass::cast(k)->link_class_or_fail(CHECK_false);
1048 if (!linked) {
1049 tty->print_cr("Unable to link/verify VirtualMachineError class");
1050 return false; // initialization failed
1051 }
1052 Universe::_virtual_machine_error_instance =
1053 InstanceKlass::cast(k)->allocate_instance(CHECK_false);
1054
1055 Universe::_vm_exception = InstanceKlass::cast(k)->allocate_instance(CHECK_false);
1056
1057 if (!DumpSharedSpaces) {
1058 // These are the only Java fields that are currently set during shared space dumping.
1059 // We prefer to not handle this generally, so we always reinitialize these detail messages.
1060 Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false);
1061 java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg());
1062
1063 msg = java_lang_String::create_from_str("Metaspace", CHECK_false);
1064 java_lang_Throwable::set_message(Universe::_out_of_memory_error_metaspace, msg());
1065 msg = java_lang_String::create_from_str("Compressed class space", CHECK_false);
1066 java_lang_Throwable::set_message(Universe::_out_of_memory_error_class_metaspace, msg());
1067
1068 msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false);
1069 java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg());
1070
1071 msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false);
1072 java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg());
1073
1074 msg = java_lang_String::create_from_str("/ by zero", CHECK_false);
1075 java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg());
1076
1077 // Setup the array of errors that have preallocated backtrace
1078 k = Universe::_out_of_memory_error_java_heap->klass();
1079 assert(k->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error");
1080 k_h = instanceKlassHandle(THREAD, k);
1081
1082 int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0;
1083 Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false);
1084 for (int i=0; i<len; i++) {
1085 oop err = k_h->allocate_instance(CHECK_false);
1086 Handle err_h = Handle(THREAD, err);
1087 java_lang_Throwable::allocate_backtrace(err_h, CHECK_false);
1088 Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h());
1089 }
1090 Universe::_preallocated_out_of_memory_error_avail_count = (jint)len;
1091 }
1092
1093
1094 // Setup static method for registering finalizers
1095 // The finalizer klass must be linked before looking up the method, in
1096 // case it needs to get rewritten.
1097 InstanceKlass::cast(SystemDictionary::Finalizer_klass())->link_class(CHECK_false);
1098 Method* m = InstanceKlass::cast(SystemDictionary::Finalizer_klass())->find_method(
1099 vmSymbols::register_method_name(),
1100 vmSymbols::register_method_signature());
1101 if (m == NULL || !m->is_static()) {
1102 tty->print_cr("Unable to link/verify Finalizer.register method");
1103 return false; // initialization failed (cannot throw exception yet)
1104 }
1105 Universe::_finalizer_register_cache->init(
1106 SystemDictionary::Finalizer_klass(), m);
1107
1108 InstanceKlass::cast(SystemDictionary::misc_Unsafe_klass())->link_class(CHECK_false);
1109 m = InstanceKlass::cast(SystemDictionary::misc_Unsafe_klass())->find_method(
1110 vmSymbols::throwIllegalAccessError_name(),
1111 vmSymbols::void_method_signature());
1112 if (m != NULL && !m->is_static()) {
1113 // Note null is okay; this method is used in itables, and if it is null,
1114 // then AbstractMethodError is thrown instead.
1115 tty->print_cr("Unable to link/verify Unsafe.throwIllegalAccessError method");
1116 return false; // initialization failed (cannot throw exception yet)
1117 }
1118 Universe::_throw_illegal_access_error = m;
1119
1120 // Setup method for registering loaded classes in class loader vector
1121 InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->link_class(CHECK_false);
1122 m = InstanceKlass::cast(SystemDictionary::ClassLoader_klass())->find_method(vmSymbols::addClass_name(), vmSymbols::class_void_signature());
1123 if (m == NULL || m->is_static()) {
1124 tty->print_cr("Unable to link/verify ClassLoader.addClass method");
1125 return false; // initialization failed (cannot throw exception yet)
1126 }
1127 Universe::_loader_addClass_cache->init(
1128 SystemDictionary::ClassLoader_klass(), m);
1129
1130 // Setup method for checking protection domain
1131 InstanceKlass::cast(SystemDictionary::ProtectionDomain_klass())->link_class(CHECK_false);
1132 m = InstanceKlass::cast(SystemDictionary::ProtectionDomain_klass())->
1133 find_method(vmSymbols::impliesCreateAccessControlContext_name(),
1134 vmSymbols::void_boolean_signature());
1135 // Allow NULL which should only happen with bootstrapping.
1136 if (m != NULL) {
1137 if (m->is_static()) {
1138 // NoSuchMethodException doesn't actually work because it tries to run the
1139 // <init> function before java_lang_Class is linked. Print error and exit.
1140 tty->print_cr("ProtectionDomain.impliesCreateAccessControlContext() has the wrong linkage");
1141 return false; // initialization failed
1142 }
1143 Universe::_pd_implies_cache->init(
1144 SystemDictionary::ProtectionDomain_klass(), m);;
1145 }
1146
1147 // The following is initializing converter functions for serialization in
1148 // JVM.cpp. If we clean up the StrictMath code above we may want to find
1149 // a better solution for this as well.
1150 initialize_converter_functions();
1151
1152 // This needs to be done before the first scavenge/gc, since
1153 // it's an input to soft ref clearing policy.
1154 {
1155 MutexLocker x(Heap_lock);
1156 Universe::update_heap_info_at_gc();
1157 }
1158
1159 // ("weak") refs processing infrastructure initialization
1160 Universe::heap()->post_initialize();
1161
1162 // Initialize performance counters for metaspaces
1163 MetaspaceCounters::initialize_performance_counters();
1164 CompressedClassSpaceCounters::initialize_performance_counters();
1165
1166 MemoryService::add_metaspace_memory_pools();
1167
1168 MemoryService::set_universe_heap(Universe::_collectedHeap);
1169 return true;
1170 }
1171
1172
1173 void Universe::compute_base_vtable_size() {
1174 _base_vtable_size = ClassLoader::compute_Object_vtable();
1175 }
1176
1177
1178 // %%% The Universe::flush_foo methods belong in CodeCache.
1179
1180 // Flushes compiled methods dependent on dependee.
1181 void Universe::flush_dependents_on(instanceKlassHandle dependee) {
1182 assert_lock_strong(Compile_lock);
1183
1184 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1185
1186 // CodeCache can only be updated by a thread_in_VM and they will all be
1187 // stopped during the safepoint so CodeCache will be safe to update without
1188 // holding the CodeCache_lock.
1189
1190 KlassDepChange changes(dependee);
1191
1192 // Compute the dependent nmethods
1193 if (CodeCache::mark_for_deoptimization(changes) > 0) {
1194 // At least one nmethod has been marked for deoptimization
1195 VM_Deoptimize op;
1196 VMThread::execute(&op);
1197 }
1198 }
1199
1200 // Flushes compiled methods dependent on a particular CallSite
1201 // instance when its target is different than the given MethodHandle.
1202 void Universe::flush_dependents_on(Handle call_site, Handle method_handle) {
1203 assert_lock_strong(Compile_lock);
1204
1205 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1206
1207 // CodeCache can only be updated by a thread_in_VM and they will all be
1208 // stopped during the safepoint so CodeCache will be safe to update without
1209 // holding the CodeCache_lock.
1210
1211 CallSiteDepChange changes(call_site(), method_handle());
1212
1213 // Compute the dependent nmethods that have a reference to a
1214 // CallSite object. We use InstanceKlass::mark_dependent_nmethod
1215 // directly instead of CodeCache::mark_for_deoptimization because we
1216 // want dependents on the call site class only not all classes in
1217 // the ContextStream.
1218 int marked = 0;
1219 {
1220 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1221 InstanceKlass* call_site_klass = InstanceKlass::cast(call_site->klass());
1222 marked = call_site_klass->mark_dependent_nmethods(changes);
1223 }
1224 if (marked > 0) {
1225 // At least one nmethod has been marked for deoptimization
1226 VM_Deoptimize op;
1227 VMThread::execute(&op);
1228 }
1229 }
1230
1231 #ifdef HOTSWAP
1232 // Flushes compiled methods dependent on dependee in the evolutionary sense
1233 void Universe::flush_evol_dependents_on(instanceKlassHandle ev_k_h) {
1234 // --- Compile_lock is not held. However we are at a safepoint.
1235 assert_locked_or_safepoint(Compile_lock);
1236 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1237
1238 // CodeCache can only be updated by a thread_in_VM and they will all be
1239 // stopped during the safepoint so CodeCache will be safe to update without
1240 // holding the CodeCache_lock.
1241
1242 // Compute the dependent nmethods
1243 if (CodeCache::mark_for_evol_deoptimization(ev_k_h) > 0) {
1244 // At least one nmethod has been marked for deoptimization
1245
1246 // All this already happens inside a VM_Operation, so we'll do all the work here.
1247 // Stuff copied from VM_Deoptimize and modified slightly.
1248
1249 // We do not want any GCs to happen while we are in the middle of this VM operation
1250 ResourceMark rm;
1251 DeoptimizationMarker dm;
1252
1253 // Deoptimize all activations depending on marked nmethods
1254 Deoptimization::deoptimize_dependents();
1255
1256 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1257 CodeCache::make_marked_nmethods_not_entrant();
1258 }
1259 }
1260 #endif // HOTSWAP
1261
1262
1263 // Flushes compiled methods dependent on dependee
1264 void Universe::flush_dependents_on_method(methodHandle m_h) {
1265 // --- Compile_lock is not held. However we are at a safepoint.
1266 assert_locked_or_safepoint(Compile_lock);
1267
1268 // CodeCache can only be updated by a thread_in_VM and they will all be
1269 // stopped dring the safepoint so CodeCache will be safe to update without
1270 // holding the CodeCache_lock.
1271
1272 // Compute the dependent nmethods
1273 if (CodeCache::mark_for_deoptimization(m_h()) > 0) {
1274 // At least one nmethod has been marked for deoptimization
1275
1276 // All this already happens inside a VM_Operation, so we'll do all the work here.
1277 // Stuff copied from VM_Deoptimize and modified slightly.
1278
1279 // We do not want any GCs to happen while we are in the middle of this VM operation
1280 ResourceMark rm;
1281 DeoptimizationMarker dm;
1282
1283 // Deoptimize all activations depending on marked nmethods
1284 Deoptimization::deoptimize_dependents();
1285
1286 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1287 CodeCache::make_marked_nmethods_not_entrant();
1288 }
1289 }
1290
1291 void Universe::print() {
1292 print_on(gclog_or_tty);
1293 }
1294
1295 void Universe::print_on(outputStream* st, bool extended) {
1296 st->print_cr("Heap");
1297 if (!extended) {
1298 heap()->print_on(st);
1299 } else {
1300 heap()->print_extended_on(st);
1301 }
1302 }
1303
1304 void Universe::print_heap_at_SIGBREAK() {
1305 if (PrintHeapAtSIGBREAK) {
1306 MutexLocker hl(Heap_lock);
1307 print_on(tty);
1308 tty->cr();
1309 tty->flush();
1310 }
1311 }
1312
1313 void Universe::print_heap_before_gc(outputStream* st, bool ignore_extended) {
1314 st->print_cr("{Heap before GC invocations=%u (full %u):",
1315 heap()->total_collections(),
1316 heap()->total_full_collections());
1317 if (!PrintHeapAtGCExtended || ignore_extended) {
1318 heap()->print_on(st);
1319 } else {
1320 heap()->print_extended_on(st);
1321 }
1322 }
1323
1324 void Universe::print_heap_after_gc(outputStream* st, bool ignore_extended) {
1325 st->print_cr("Heap after GC invocations=%u (full %u):",
1326 heap()->total_collections(),
1327 heap()->total_full_collections());
1328 if (!PrintHeapAtGCExtended || ignore_extended) {
1329 heap()->print_on(st);
1330 } else {
1331 heap()->print_extended_on(st);
1332 }
1333 st->print_cr("}");
1334 }
1335
1336 void Universe::verify(VerifyOption option, const char* prefix, bool silent) {
1337 // The use of _verify_in_progress is a temporary work around for
1338 // 6320749. Don't bother with a creating a class to set and clear
1339 // it since it is only used in this method and the control flow is
1340 // straight forward.
1341 _verify_in_progress = true;
1342
1343 COMPILER2_PRESENT(
1344 assert(!DerivedPointerTable::is_active(),
1345 "DPT should not be active during verification "
1346 "(of thread stacks below)");
1347 )
1348
1349 ResourceMark rm;
1350 HandleMark hm; // Handles created during verification can be zapped
1351 _verify_count++;
1352
1353 if (!silent) gclog_or_tty->print("%s", prefix);
1354 if (!silent) gclog_or_tty->print("[Verifying ");
1355 if (!silent) gclog_or_tty->print("threads ");
1356 Threads::verify();
1357 if (!silent) gclog_or_tty->print("heap ");
1358 heap()->verify(silent, option);
1359 if (!silent) gclog_or_tty->print("syms ");
1360 SymbolTable::verify();
1361 if (!silent) gclog_or_tty->print("strs ");
1362 StringTable::verify();
1363 {
1364 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1365 if (!silent) gclog_or_tty->print("zone ");
1366 CodeCache::verify();
1367 }
1368 if (!silent) gclog_or_tty->print("dict ");
1369 SystemDictionary::verify();
1370 #ifndef PRODUCT
1371 if (!silent) gclog_or_tty->print("cldg ");
1372 ClassLoaderDataGraph::verify();
1373 #endif
1374 if (!silent) gclog_or_tty->print("metaspace chunks ");
1375 MetaspaceAux::verify_free_chunks();
1376 if (!silent) gclog_or_tty->print("hand ");
1377 JNIHandles::verify();
1378 if (!silent) gclog_or_tty->print("C-heap ");
1379 os::check_heap();
1380 if (!silent) gclog_or_tty->print("code cache ");
1381 CodeCache::verify_oops();
1382 if (!silent) gclog_or_tty->print_cr("]");
1383
1384 _verify_in_progress = false;
1385 }
1386
1387 // Oop verification (see MacroAssembler::verify_oop)
1388
1389 static uintptr_t _verify_oop_data[2] = {0, (uintptr_t)-1};
1390 static uintptr_t _verify_klass_data[2] = {0, (uintptr_t)-1};
1391
1392
1393 #ifndef PRODUCT
1394
1395 static void calculate_verify_data(uintptr_t verify_data[2],
1396 HeapWord* low_boundary,
1397 HeapWord* high_boundary) {
1398 assert(low_boundary < high_boundary, "bad interval");
1399
1400 // decide which low-order bits we require to be clear:
1401 size_t alignSize = MinObjAlignmentInBytes;
1402 size_t min_object_size = CollectedHeap::min_fill_size();
1403
1404 // make an inclusive limit:
1405 uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize;
1406 uintptr_t min = (uintptr_t)low_boundary;
1407 assert(min < max, "bad interval");
1408 uintptr_t diff = max ^ min;
1409
1410 // throw away enough low-order bits to make the diff vanish
1411 uintptr_t mask = (uintptr_t)(-1);
1412 while ((mask & diff) != 0)
1413 mask <<= 1;
1414 uintptr_t bits = (min & mask);
1415 assert(bits == (max & mask), "correct mask");
1416 // check an intermediate value between min and max, just to make sure:
1417 assert(bits == ((min + (max-min)/2) & mask), "correct mask");
1418
1419 // require address alignment, too:
1420 mask |= (alignSize - 1);
1421
1422 if (!(verify_data[0] == 0 && verify_data[1] == (uintptr_t)-1)) {
1423 assert(verify_data[0] == mask && verify_data[1] == bits, "mask stability");
1424 }
1425 verify_data[0] = mask;
1426 verify_data[1] = bits;
1427 }
1428
1429 // Oop verification (see MacroAssembler::verify_oop)
1430
1431 uintptr_t Universe::verify_oop_mask() {
1432 MemRegion m = heap()->reserved_region();
1433 calculate_verify_data(_verify_oop_data,
1434 m.start(),
1435 m.end());
1436 return _verify_oop_data[0];
1437 }
1438
1439
1440
1441 uintptr_t Universe::verify_oop_bits() {
1442 verify_oop_mask();
1443 return _verify_oop_data[1];
1444 }
1445
1446 uintptr_t Universe::verify_mark_mask() {
1447 return markOopDesc::lock_mask_in_place;
1448 }
1449
1450 uintptr_t Universe::verify_mark_bits() {
1451 intptr_t mask = verify_mark_mask();
1452 intptr_t bits = (intptr_t)markOopDesc::prototype();
1453 assert((bits & ~mask) == 0, "no stray header bits");
1454 return bits;
1455 }
1456 #endif // PRODUCT
1457
1458
1459 void Universe::compute_verify_oop_data() {
1460 verify_oop_mask();
1461 verify_oop_bits();
1462 verify_mark_mask();
1463 verify_mark_bits();
1464 }
1465
1466
1467 void LatestMethodCache::init(Klass* k, Method* m) {
1468 if (!UseSharedSpaces) {
1469 _klass = k;
1470 }
1471 #ifndef PRODUCT
1472 else {
1473 // sharing initilization should have already set up _klass
1474 assert(_klass != NULL, "just checking");
1475 }
1476 #endif
1477
1478 _method_idnum = m->method_idnum();
1479 assert(_method_idnum >= 0, "sanity check");
1480 }
1481
1482
1483 Method* LatestMethodCache::get_method() {
1484 if (klass() == NULL) return NULL;
1485 InstanceKlass* ik = InstanceKlass::cast(klass());
1486 Method* m = ik->method_with_idnum(method_idnum());
1487 assert(m != NULL, "sanity check");
1488 return m;
1489 }
1490
1491
1492 #ifdef ASSERT
1493 // Release dummy object(s) at bottom of heap
1494 bool Universe::release_fullgc_alot_dummy() {
1495 MutexLocker ml(FullGCALot_lock);
1496 if (_fullgc_alot_dummy_array != NULL) {
1497 if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) {
1498 // No more dummies to release, release entire array instead
1499 _fullgc_alot_dummy_array = NULL;
1500 return false;
1501 }
1502 if (!UseConcMarkSweepGC) {
1503 // Release dummy at bottom of old generation
1504 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1505 }
1506 // Release dummy at bottom of permanent generation
1507 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1508 }
1509 return true;
1510 }
1511
1512 #endif // ASSERT