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