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