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