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