Mercurial > jdk8-mips64-public > hotspot / file revision
src/share/vm/memory/universe.cpp@6aae2f9d0294
src/share/vm/memory/universe.cpp
Thu, 12 Jun 2008 13:50:55 -0700
- author
- ysr
- date
- Thu, 12 Jun 2008 13:50:55 -0700
- changeset 779
- 6aae2f9d0294
- parent 777
- 37f87013dfd8
- child 791
- 1ee8caae33af
- permissions
- -rw-r--r--
Merge
1 /*
2 * Copyright 1997-2007 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
25 # include "incls/_precompiled.incl"
26 # include "incls/_universe.cpp.incl"
28 // Known objects
29 klassOop Universe::_boolArrayKlassObj = NULL;
30 klassOop Universe::_byteArrayKlassObj = NULL;
31 klassOop Universe::_charArrayKlassObj = NULL;
32 klassOop Universe::_intArrayKlassObj = NULL;
33 klassOop Universe::_shortArrayKlassObj = NULL;
34 klassOop Universe::_longArrayKlassObj = NULL;
35 klassOop Universe::_singleArrayKlassObj = NULL;
36 klassOop Universe::_doubleArrayKlassObj = NULL;
37 klassOop Universe::_typeArrayKlassObjs[T_VOID+1] = { NULL /*, NULL...*/ };
38 klassOop Universe::_objectArrayKlassObj = NULL;
39 klassOop Universe::_symbolKlassObj = NULL;
40 klassOop Universe::_methodKlassObj = NULL;
41 klassOop Universe::_constMethodKlassObj = NULL;
42 klassOop Universe::_methodDataKlassObj = NULL;
43 klassOop Universe::_klassKlassObj = NULL;
44 klassOop Universe::_arrayKlassKlassObj = NULL;
45 klassOop Universe::_objArrayKlassKlassObj = NULL;
46 klassOop Universe::_typeArrayKlassKlassObj = NULL;
47 klassOop Universe::_instanceKlassKlassObj = NULL;
48 klassOop Universe::_constantPoolKlassObj = NULL;
49 klassOop Universe::_constantPoolCacheKlassObj = NULL;
50 klassOop Universe::_compiledICHolderKlassObj = NULL;
51 klassOop Universe::_systemObjArrayKlassObj = NULL;
52 oop Universe::_int_mirror = NULL;
53 oop Universe::_float_mirror = NULL;
54 oop Universe::_double_mirror = NULL;
55 oop Universe::_byte_mirror = NULL;
56 oop Universe::_bool_mirror = NULL;
57 oop Universe::_char_mirror = NULL;
58 oop Universe::_long_mirror = NULL;
59 oop Universe::_short_mirror = NULL;
60 oop Universe::_void_mirror = NULL;
61 oop Universe::_mirrors[T_VOID+1] = { NULL /*, NULL...*/ };
62 oop Universe::_main_thread_group = NULL;
63 oop Universe::_system_thread_group = NULL;
64 typeArrayOop Universe::_the_empty_byte_array = NULL;
65 typeArrayOop Universe::_the_empty_short_array = NULL;
66 typeArrayOop Universe::_the_empty_int_array = NULL;
67 objArrayOop Universe::_the_empty_system_obj_array = NULL;
68 objArrayOop Universe::_the_empty_class_klass_array = NULL;
69 objArrayOop Universe::_the_array_interfaces_array = NULL;
70 LatestMethodOopCache* Universe::_finalizer_register_cache = NULL;
71 LatestMethodOopCache* Universe::_loader_addClass_cache = NULL;
72 ActiveMethodOopsCache* Universe::_reflect_invoke_cache = NULL;
73 oop Universe::_out_of_memory_error_java_heap = NULL;
74 oop Universe::_out_of_memory_error_perm_gen = NULL;
75 oop Universe::_out_of_memory_error_array_size = NULL;
76 oop Universe::_out_of_memory_error_gc_overhead_limit = NULL;
77 objArrayOop Universe::_preallocated_out_of_memory_error_array = NULL;
78 volatile jint Universe::_preallocated_out_of_memory_error_avail_count = 0;
79 bool Universe::_verify_in_progress = false;
80 oop Universe::_null_ptr_exception_instance = NULL;
81 oop Universe::_arithmetic_exception_instance = NULL;
82 oop Universe::_virtual_machine_error_instance = NULL;
83 oop Universe::_vm_exception = NULL;
84 oop Universe::_emptySymbol = NULL;
86 // These variables are guarded by FullGCALot_lock.
87 debug_only(objArrayOop Universe::_fullgc_alot_dummy_array = NULL;)
88 debug_only(int Universe::_fullgc_alot_dummy_next = 0;)
91 // Heap
92 int Universe::_verify_count = 0;
94 int Universe::_base_vtable_size = 0;
95 bool Universe::_bootstrapping = false;
96 bool Universe::_fully_initialized = false;
98 size_t Universe::_heap_capacity_at_last_gc;
99 size_t Universe::_heap_used_at_last_gc;
101 CollectedHeap* Universe::_collectedHeap = NULL;
102 address Universe::_heap_base = NULL;
105 void Universe::basic_type_classes_do(void f(klassOop)) {
106 f(boolArrayKlassObj());
107 f(byteArrayKlassObj());
108 f(charArrayKlassObj());
109 f(intArrayKlassObj());
110 f(shortArrayKlassObj());
111 f(longArrayKlassObj());
112 f(singleArrayKlassObj());
113 f(doubleArrayKlassObj());
114 }
117 void Universe::system_classes_do(void f(klassOop)) {
118 f(symbolKlassObj());
119 f(methodKlassObj());
120 f(constMethodKlassObj());
121 f(methodDataKlassObj());
122 f(klassKlassObj());
123 f(arrayKlassKlassObj());
124 f(objArrayKlassKlassObj());
125 f(typeArrayKlassKlassObj());
126 f(instanceKlassKlassObj());
127 f(constantPoolKlassObj());
128 f(systemObjArrayKlassObj());
129 }
131 void Universe::oops_do(OopClosure* f, bool do_all) {
133 f->do_oop((oop*) &_int_mirror);
134 f->do_oop((oop*) &_float_mirror);
135 f->do_oop((oop*) &_double_mirror);
136 f->do_oop((oop*) &_byte_mirror);
137 f->do_oop((oop*) &_bool_mirror);
138 f->do_oop((oop*) &_char_mirror);
139 f->do_oop((oop*) &_long_mirror);
140 f->do_oop((oop*) &_short_mirror);
141 f->do_oop((oop*) &_void_mirror);
143 // It's important to iterate over these guys even if they are null,
144 // since that's how shared heaps are restored.
145 for (int i = T_BOOLEAN; i < T_VOID+1; i++) {
146 f->do_oop((oop*) &_mirrors[i]);
147 }
148 assert(_mirrors[0] == NULL && _mirrors[T_BOOLEAN - 1] == NULL, "checking");
150 // %%% Consider moving those "shared oops" over here with the others.
151 f->do_oop((oop*)&_boolArrayKlassObj);
152 f->do_oop((oop*)&_byteArrayKlassObj);
153 f->do_oop((oop*)&_charArrayKlassObj);
154 f->do_oop((oop*)&_intArrayKlassObj);
155 f->do_oop((oop*)&_shortArrayKlassObj);
156 f->do_oop((oop*)&_longArrayKlassObj);
157 f->do_oop((oop*)&_singleArrayKlassObj);
158 f->do_oop((oop*)&_doubleArrayKlassObj);
159 f->do_oop((oop*)&_objectArrayKlassObj);
160 {
161 for (int i = 0; i < T_VOID+1; i++) {
162 if (_typeArrayKlassObjs[i] != NULL) {
163 assert(i >= T_BOOLEAN, "checking");
164 f->do_oop((oop*)&_typeArrayKlassObjs[i]);
165 } else if (do_all) {
166 f->do_oop((oop*)&_typeArrayKlassObjs[i]);
167 }
168 }
169 }
170 f->do_oop((oop*)&_symbolKlassObj);
171 f->do_oop((oop*)&_methodKlassObj);
172 f->do_oop((oop*)&_constMethodKlassObj);
173 f->do_oop((oop*)&_methodDataKlassObj);
174 f->do_oop((oop*)&_klassKlassObj);
175 f->do_oop((oop*)&_arrayKlassKlassObj);
176 f->do_oop((oop*)&_objArrayKlassKlassObj);
177 f->do_oop((oop*)&_typeArrayKlassKlassObj);
178 f->do_oop((oop*)&_instanceKlassKlassObj);
179 f->do_oop((oop*)&_constantPoolKlassObj);
180 f->do_oop((oop*)&_constantPoolCacheKlassObj);
181 f->do_oop((oop*)&_compiledICHolderKlassObj);
182 f->do_oop((oop*)&_systemObjArrayKlassObj);
183 f->do_oop((oop*)&_the_empty_byte_array);
184 f->do_oop((oop*)&_the_empty_short_array);
185 f->do_oop((oop*)&_the_empty_int_array);
186 f->do_oop((oop*)&_the_empty_system_obj_array);
187 f->do_oop((oop*)&_the_empty_class_klass_array);
188 f->do_oop((oop*)&_the_array_interfaces_array);
189 _finalizer_register_cache->oops_do(f);
190 _loader_addClass_cache->oops_do(f);
191 _reflect_invoke_cache->oops_do(f);
192 f->do_oop((oop*)&_out_of_memory_error_java_heap);
193 f->do_oop((oop*)&_out_of_memory_error_perm_gen);
194 f->do_oop((oop*)&_out_of_memory_error_array_size);
195 f->do_oop((oop*)&_out_of_memory_error_gc_overhead_limit);
196 if (_preallocated_out_of_memory_error_array != (oop)NULL) { // NULL when DumpSharedSpaces
197 f->do_oop((oop*)&_preallocated_out_of_memory_error_array);
198 }
199 f->do_oop((oop*)&_null_ptr_exception_instance);
200 f->do_oop((oop*)&_arithmetic_exception_instance);
201 f->do_oop((oop*)&_virtual_machine_error_instance);
202 f->do_oop((oop*)&_main_thread_group);
203 f->do_oop((oop*)&_system_thread_group);
204 f->do_oop((oop*)&_vm_exception);
205 f->do_oop((oop*)&_emptySymbol);
206 debug_only(f->do_oop((oop*)&_fullgc_alot_dummy_array);)
207 }
210 void Universe::check_alignment(uintx size, uintx alignment, const char* name) {
211 if (size < alignment || size % alignment != 0) {
212 ResourceMark rm;
213 stringStream st;
214 st.print("Size of %s (%ld bytes) must be aligned to %ld bytes", name, size, alignment);
215 char* error = st.as_string();
216 vm_exit_during_initialization(error);
217 }
218 }
221 void Universe::genesis(TRAPS) {
222 ResourceMark rm;
223 { FlagSetting fs(_bootstrapping, true);
225 { MutexLocker mc(Compile_lock);
227 // determine base vtable size; without that we cannot create the array klasses
228 compute_base_vtable_size();
230 if (!UseSharedSpaces) {
231 _klassKlassObj = klassKlass::create_klass(CHECK);
232 _arrayKlassKlassObj = arrayKlassKlass::create_klass(CHECK);
234 _objArrayKlassKlassObj = objArrayKlassKlass::create_klass(CHECK);
235 _instanceKlassKlassObj = instanceKlassKlass::create_klass(CHECK);
236 _typeArrayKlassKlassObj = typeArrayKlassKlass::create_klass(CHECK);
238 _symbolKlassObj = symbolKlass::create_klass(CHECK);
240 _emptySymbol = oopFactory::new_symbol("", CHECK);
242 _boolArrayKlassObj = typeArrayKlass::create_klass(T_BOOLEAN, sizeof(jboolean), CHECK);
243 _charArrayKlassObj = typeArrayKlass::create_klass(T_CHAR, sizeof(jchar), CHECK);
244 _singleArrayKlassObj = typeArrayKlass::create_klass(T_FLOAT, sizeof(jfloat), CHECK);
245 _doubleArrayKlassObj = typeArrayKlass::create_klass(T_DOUBLE, sizeof(jdouble), CHECK);
246 _byteArrayKlassObj = typeArrayKlass::create_klass(T_BYTE, sizeof(jbyte), CHECK);
247 _shortArrayKlassObj = typeArrayKlass::create_klass(T_SHORT, sizeof(jshort), CHECK);
248 _intArrayKlassObj = typeArrayKlass::create_klass(T_INT, sizeof(jint), CHECK);
249 _longArrayKlassObj = typeArrayKlass::create_klass(T_LONG, sizeof(jlong), CHECK);
251 _typeArrayKlassObjs[T_BOOLEAN] = _boolArrayKlassObj;
252 _typeArrayKlassObjs[T_CHAR] = _charArrayKlassObj;
253 _typeArrayKlassObjs[T_FLOAT] = _singleArrayKlassObj;
254 _typeArrayKlassObjs[T_DOUBLE] = _doubleArrayKlassObj;
255 _typeArrayKlassObjs[T_BYTE] = _byteArrayKlassObj;
256 _typeArrayKlassObjs[T_SHORT] = _shortArrayKlassObj;
257 _typeArrayKlassObjs[T_INT] = _intArrayKlassObj;
258 _typeArrayKlassObjs[T_LONG] = _longArrayKlassObj;
260 _methodKlassObj = methodKlass::create_klass(CHECK);
261 _constMethodKlassObj = constMethodKlass::create_klass(CHECK);
262 _methodDataKlassObj = methodDataKlass::create_klass(CHECK);
263 _constantPoolKlassObj = constantPoolKlass::create_klass(CHECK);
264 _constantPoolCacheKlassObj = constantPoolCacheKlass::create_klass(CHECK);
266 _compiledICHolderKlassObj = compiledICHolderKlass::create_klass(CHECK);
267 _systemObjArrayKlassObj = objArrayKlassKlass::cast(objArrayKlassKlassObj())->allocate_system_objArray_klass(CHECK);
269 _the_empty_byte_array = oopFactory::new_permanent_byteArray(0, CHECK);
270 _the_empty_short_array = oopFactory::new_permanent_shortArray(0, CHECK);
271 _the_empty_int_array = oopFactory::new_permanent_intArray(0, CHECK);
272 _the_empty_system_obj_array = oopFactory::new_system_objArray(0, CHECK);
274 _the_array_interfaces_array = oopFactory::new_system_objArray(2, CHECK);
275 _vm_exception = oopFactory::new_symbol("vm exception holder", CHECK);
276 } else {
278 FileMapInfo *mapinfo = FileMapInfo::current_info();
279 char* buffer = mapinfo->region_base(CompactingPermGenGen::md);
280 void** vtbl_list = (void**)buffer;
281 init_self_patching_vtbl_list(vtbl_list,
282 CompactingPermGenGen::vtbl_list_size);
283 }
284 }
286 vmSymbols::initialize(CHECK);
288 SystemDictionary::initialize(CHECK);
290 klassOop ok = SystemDictionary::object_klass();
292 if (UseSharedSpaces) {
293 // Verify shared interfaces array.
294 assert(_the_array_interfaces_array->obj_at(0) ==
295 SystemDictionary::cloneable_klass(), "u3");
296 assert(_the_array_interfaces_array->obj_at(1) ==
297 SystemDictionary::serializable_klass(), "u3");
299 // Verify element klass for system obj array klass
300 assert(objArrayKlass::cast(_systemObjArrayKlassObj)->element_klass() == ok, "u1");
301 assert(objArrayKlass::cast(_systemObjArrayKlassObj)->bottom_klass() == ok, "u2");
303 // Verify super class for the classes created above
304 assert(Klass::cast(boolArrayKlassObj() )->super() == ok, "u3");
305 assert(Klass::cast(charArrayKlassObj() )->super() == ok, "u3");
306 assert(Klass::cast(singleArrayKlassObj() )->super() == ok, "u3");
307 assert(Klass::cast(doubleArrayKlassObj() )->super() == ok, "u3");
308 assert(Klass::cast(byteArrayKlassObj() )->super() == ok, "u3");
309 assert(Klass::cast(shortArrayKlassObj() )->super() == ok, "u3");
310 assert(Klass::cast(intArrayKlassObj() )->super() == ok, "u3");
311 assert(Klass::cast(longArrayKlassObj() )->super() == ok, "u3");
312 assert(Klass::cast(constantPoolKlassObj() )->super() == ok, "u3");
313 assert(Klass::cast(systemObjArrayKlassObj())->super() == ok, "u3");
314 } else {
315 // Set up shared interfaces array. (Do this before supers are set up.)
316 _the_array_interfaces_array->obj_at_put(0, SystemDictionary::cloneable_klass());
317 _the_array_interfaces_array->obj_at_put(1, SystemDictionary::serializable_klass());
319 // Set element klass for system obj array klass
320 objArrayKlass::cast(_systemObjArrayKlassObj)->set_element_klass(ok);
321 objArrayKlass::cast(_systemObjArrayKlassObj)->set_bottom_klass(ok);
323 // Set super class for the classes created above
324 Klass::cast(boolArrayKlassObj() )->initialize_supers(ok, CHECK);
325 Klass::cast(charArrayKlassObj() )->initialize_supers(ok, CHECK);
326 Klass::cast(singleArrayKlassObj() )->initialize_supers(ok, CHECK);
327 Klass::cast(doubleArrayKlassObj() )->initialize_supers(ok, CHECK);
328 Klass::cast(byteArrayKlassObj() )->initialize_supers(ok, CHECK);
329 Klass::cast(shortArrayKlassObj() )->initialize_supers(ok, CHECK);
330 Klass::cast(intArrayKlassObj() )->initialize_supers(ok, CHECK);
331 Klass::cast(longArrayKlassObj() )->initialize_supers(ok, CHECK);
332 Klass::cast(constantPoolKlassObj() )->initialize_supers(ok, CHECK);
333 Klass::cast(systemObjArrayKlassObj())->initialize_supers(ok, CHECK);
334 Klass::cast(boolArrayKlassObj() )->set_super(ok);
335 Klass::cast(charArrayKlassObj() )->set_super(ok);
336 Klass::cast(singleArrayKlassObj() )->set_super(ok);
337 Klass::cast(doubleArrayKlassObj() )->set_super(ok);
338 Klass::cast(byteArrayKlassObj() )->set_super(ok);
339 Klass::cast(shortArrayKlassObj() )->set_super(ok);
340 Klass::cast(intArrayKlassObj() )->set_super(ok);
341 Klass::cast(longArrayKlassObj() )->set_super(ok);
342 Klass::cast(constantPoolKlassObj() )->set_super(ok);
343 Klass::cast(systemObjArrayKlassObj())->set_super(ok);
344 }
346 Klass::cast(boolArrayKlassObj() )->append_to_sibling_list();
347 Klass::cast(charArrayKlassObj() )->append_to_sibling_list();
348 Klass::cast(singleArrayKlassObj() )->append_to_sibling_list();
349 Klass::cast(doubleArrayKlassObj() )->append_to_sibling_list();
350 Klass::cast(byteArrayKlassObj() )->append_to_sibling_list();
351 Klass::cast(shortArrayKlassObj() )->append_to_sibling_list();
352 Klass::cast(intArrayKlassObj() )->append_to_sibling_list();
353 Klass::cast(longArrayKlassObj() )->append_to_sibling_list();
354 Klass::cast(constantPoolKlassObj() )->append_to_sibling_list();
355 Klass::cast(systemObjArrayKlassObj())->append_to_sibling_list();
356 } // end of core bootstrapping
358 // Initialize _objectArrayKlass after core bootstraping to make
359 // sure the super class is set up properly for _objectArrayKlass.
360 _objectArrayKlassObj = instanceKlass::
361 cast(SystemDictionary::object_klass())->array_klass(1, CHECK);
362 // Add the class to the class hierarchy manually to make sure that
363 // its vtable is initialized after core bootstrapping is completed.
364 Klass::cast(_objectArrayKlassObj)->append_to_sibling_list();
366 // Compute is_jdk version flags.
367 // Only 1.3 or later has the java.lang.Shutdown class.
368 // Only 1.4 or later has the java.lang.CharSequence interface.
369 // Only 1.5 or later has the java.lang.management.MemoryUsage class.
370 if (JDK_Version::is_pre_jdk16_version()) {
371 klassOop k = SystemDictionary::resolve_or_null(vmSymbolHandles::java_lang_management_MemoryUsage(), THREAD);
372 CLEAR_PENDING_EXCEPTION; // ignore exceptions
373 if (k == NULL) {
374 k = SystemDictionary::resolve_or_null(vmSymbolHandles::java_lang_CharSequence(), THREAD);
375 CLEAR_PENDING_EXCEPTION; // ignore exceptions
376 if (k == NULL) {
377 k = SystemDictionary::resolve_or_null(vmSymbolHandles::java_lang_Shutdown(), THREAD);
378 CLEAR_PENDING_EXCEPTION; // ignore exceptions
379 if (k == NULL) {
380 JDK_Version::set_jdk12x_version();
381 } else {
382 JDK_Version::set_jdk13x_version();
383 }
384 } else {
385 JDK_Version::set_jdk14x_version();
386 }
387 } else {
388 JDK_Version::set_jdk15x_version();
389 }
390 }
392 #ifdef ASSERT
393 if (FullGCALot) {
394 // Allocate an array of dummy objects.
395 // We'd like these to be at the bottom of the old generation,
396 // so that when we free one and then collect,
397 // (almost) the whole heap moves
398 // and we find out if we actually update all the oops correctly.
399 // But we can't allocate directly in the old generation,
400 // so we allocate wherever, and hope that the first collection
401 // moves these objects to the bottom of the old generation.
402 // We can allocate directly in the permanent generation, so we do.
403 int size;
404 if (UseConcMarkSweepGC) {
405 warning("Using +FullGCALot with concurrent mark sweep gc "
406 "will not force all objects to relocate");
407 size = FullGCALotDummies;
408 } else {
409 size = FullGCALotDummies * 2;
410 }
411 objArrayOop naked_array = oopFactory::new_system_objArray(size, CHECK);
412 objArrayHandle dummy_array(THREAD, naked_array);
413 int i = 0;
414 while (i < size) {
415 if (!UseConcMarkSweepGC) {
416 // Allocate dummy in old generation
417 oop dummy = instanceKlass::cast(SystemDictionary::object_klass())->allocate_instance(CHECK);
418 dummy_array->obj_at_put(i++, dummy);
419 }
420 // Allocate dummy in permanent generation
421 oop dummy = instanceKlass::cast(SystemDictionary::object_klass())->allocate_permanent_instance(CHECK);
422 dummy_array->obj_at_put(i++, dummy);
423 }
424 {
425 // Only modify the global variable inside the mutex.
426 // If we had a race to here, the other dummy_array instances
427 // and their elements just get dropped on the floor, which is fine.
428 MutexLocker ml(FullGCALot_lock);
429 if (_fullgc_alot_dummy_array == NULL) {
430 _fullgc_alot_dummy_array = dummy_array();
431 }
432 }
433 assert(i == _fullgc_alot_dummy_array->length(), "just checking");
434 }
435 #endif
436 }
439 static inline void add_vtable(void** list, int* n, Klass* o, int count) {
440 list[(*n)++] = *(void**)&o->vtbl_value();
441 guarantee((*n) <= count, "vtable list too small.");
442 }
445 void Universe::init_self_patching_vtbl_list(void** list, int count) {
446 int n = 0;
447 { klassKlass o; add_vtable(list, &n, &o, count); }
448 { arrayKlassKlass o; add_vtable(list, &n, &o, count); }
449 { objArrayKlassKlass o; add_vtable(list, &n, &o, count); }
450 { instanceKlassKlass o; add_vtable(list, &n, &o, count); }
451 { instanceKlass o; add_vtable(list, &n, &o, count); }
452 { instanceRefKlass o; add_vtable(list, &n, &o, count); }
453 { typeArrayKlassKlass o; add_vtable(list, &n, &o, count); }
454 { symbolKlass o; add_vtable(list, &n, &o, count); }
455 { typeArrayKlass o; add_vtable(list, &n, &o, count); }
456 { methodKlass o; add_vtable(list, &n, &o, count); }
457 { constMethodKlass o; add_vtable(list, &n, &o, count); }
458 { constantPoolKlass o; add_vtable(list, &n, &o, count); }
459 { constantPoolCacheKlass o; add_vtable(list, &n, &o, count); }
460 { objArrayKlass o; add_vtable(list, &n, &o, count); }
461 { methodDataKlass o; add_vtable(list, &n, &o, count); }
462 { compiledICHolderKlass o; add_vtable(list, &n, &o, count); }
463 }
466 class FixupMirrorClosure: public ObjectClosure {
467 public:
468 virtual void do_object(oop obj) {
469 if (obj->is_klass()) {
470 EXCEPTION_MARK;
471 KlassHandle k(THREAD, klassOop(obj));
472 // We will never reach the CATCH below since Exceptions::_throw will cause
473 // the VM to exit if an exception is thrown during initialization
474 java_lang_Class::create_mirror(k, CATCH);
475 // This call unconditionally creates a new mirror for k,
476 // and links in k's component_mirror field if k is an array.
477 // If k is an objArray, k's element type must already have
478 // a mirror. In other words, this closure must process
479 // the component type of an objArray k before it processes k.
480 // This works because the permgen iterator presents arrays
481 // and their component types in order of creation.
482 }
483 }
484 };
486 void Universe::initialize_basic_type_mirrors(TRAPS) {
487 if (UseSharedSpaces) {
488 assert(_int_mirror != NULL, "already loaded");
489 assert(_void_mirror == _mirrors[T_VOID], "consistently loaded");
490 } else {
492 assert(_int_mirror==NULL, "basic type mirrors already initialized");
493 _int_mirror =
494 java_lang_Class::create_basic_type_mirror("int", T_INT, CHECK);
495 _float_mirror =
496 java_lang_Class::create_basic_type_mirror("float", T_FLOAT, CHECK);
497 _double_mirror =
498 java_lang_Class::create_basic_type_mirror("double", T_DOUBLE, CHECK);
499 _byte_mirror =
500 java_lang_Class::create_basic_type_mirror("byte", T_BYTE, CHECK);
501 _bool_mirror =
502 java_lang_Class::create_basic_type_mirror("boolean",T_BOOLEAN, CHECK);
503 _char_mirror =
504 java_lang_Class::create_basic_type_mirror("char", T_CHAR, CHECK);
505 _long_mirror =
506 java_lang_Class::create_basic_type_mirror("long", T_LONG, CHECK);
507 _short_mirror =
508 java_lang_Class::create_basic_type_mirror("short", T_SHORT, CHECK);
509 _void_mirror =
510 java_lang_Class::create_basic_type_mirror("void", T_VOID, CHECK);
512 _mirrors[T_INT] = _int_mirror;
513 _mirrors[T_FLOAT] = _float_mirror;
514 _mirrors[T_DOUBLE] = _double_mirror;
515 _mirrors[T_BYTE] = _byte_mirror;
516 _mirrors[T_BOOLEAN] = _bool_mirror;
517 _mirrors[T_CHAR] = _char_mirror;
518 _mirrors[T_LONG] = _long_mirror;
519 _mirrors[T_SHORT] = _short_mirror;
520 _mirrors[T_VOID] = _void_mirror;
521 //_mirrors[T_OBJECT] = instanceKlass::cast(_object_klass)->java_mirror();
522 //_mirrors[T_ARRAY] = instanceKlass::cast(_object_klass)->java_mirror();
523 }
524 }
526 void Universe::fixup_mirrors(TRAPS) {
527 // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly,
528 // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply
529 // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note
530 // that the number of objects allocated at this point is very small.
531 assert(SystemDictionary::class_klass_loaded(), "java.lang.Class should be loaded");
532 FixupMirrorClosure blk;
533 Universe::heap()->permanent_object_iterate(&blk);
534 }
537 static bool has_run_finalizers_on_exit = false;
539 void Universe::run_finalizers_on_exit() {
540 if (has_run_finalizers_on_exit) return;
541 has_run_finalizers_on_exit = true;
543 // Called on VM exit. This ought to be run in a separate thread.
544 if (TraceReferenceGC) tty->print_cr("Callback to run finalizers on exit");
545 {
546 PRESERVE_EXCEPTION_MARK;
547 KlassHandle finalizer_klass(THREAD, SystemDictionary::finalizer_klass());
548 JavaValue result(T_VOID);
549 JavaCalls::call_static(
550 &result,
551 finalizer_klass,
552 vmSymbolHandles::run_finalizers_on_exit_name(),
553 vmSymbolHandles::void_method_signature(),
554 THREAD
555 );
556 // Ignore any pending exceptions
557 CLEAR_PENDING_EXCEPTION;
558 }
559 }
562 // initialize_vtable could cause gc if
563 // 1) we specified true to initialize_vtable and
564 // 2) this ran after gc was enabled
565 // In case those ever change we use handles for oops
566 void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) {
567 // init vtable of k and all subclasses
568 Klass* ko = k_h()->klass_part();
569 klassVtable* vt = ko->vtable();
570 if (vt) vt->initialize_vtable(false, CHECK);
571 if (ko->oop_is_instance()) {
572 instanceKlass* ik = (instanceKlass*)ko;
573 for (KlassHandle s_h(THREAD, ik->subklass()); s_h() != NULL; s_h = (THREAD, s_h()->klass_part()->next_sibling())) {
574 reinitialize_vtable_of(s_h, CHECK);
575 }
576 }
577 }
580 void initialize_itable_for_klass(klassOop k, TRAPS) {
581 instanceKlass::cast(k)->itable()->initialize_itable(false, CHECK);
582 }
585 void Universe::reinitialize_itables(TRAPS) {
586 SystemDictionary::classes_do(initialize_itable_for_klass, CHECK);
588 }
591 bool Universe::on_page_boundary(void* addr) {
592 return ((uintptr_t) addr) % os::vm_page_size() == 0;
593 }
596 bool Universe::should_fill_in_stack_trace(Handle throwable) {
597 // never attempt to fill in the stack trace of preallocated errors that do not have
598 // backtrace. These errors are kept alive forever and may be "re-used" when all
599 // preallocated errors with backtrace have been consumed. Also need to avoid
600 // a potential loop which could happen if an out of memory occurs when attempting
601 // to allocate the backtrace.
602 return ((throwable() != Universe::_out_of_memory_error_java_heap) &&
603 (throwable() != Universe::_out_of_memory_error_perm_gen) &&
604 (throwable() != Universe::_out_of_memory_error_array_size) &&
605 (throwable() != Universe::_out_of_memory_error_gc_overhead_limit));
606 }
609 oop Universe::gen_out_of_memory_error(oop default_err) {
610 // generate an out of memory error:
611 // - if there is a preallocated error with backtrace available then return it wth
612 // a filled in stack trace.
613 // - if there are no preallocated errors with backtrace available then return
614 // an error without backtrace.
615 int next;
616 if (_preallocated_out_of_memory_error_avail_count > 0) {
617 next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count);
618 assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt");
619 } else {
620 next = -1;
621 }
622 if (next < 0) {
623 // all preallocated errors have been used.
624 // return default
625 return default_err;
626 } else {
627 // get the error object at the slot and set set it to NULL so that the
628 // array isn't keeping it alive anymore.
629 oop exc = preallocated_out_of_memory_errors()->obj_at(next);
630 assert(exc != NULL, "slot has been used already");
631 preallocated_out_of_memory_errors()->obj_at_put(next, NULL);
633 // use the message from the default error
634 oop msg = java_lang_Throwable::message(default_err);
635 assert(msg != NULL, "no message");
636 java_lang_Throwable::set_message(exc, msg);
638 // populate the stack trace and return it.
639 java_lang_Throwable::fill_in_stack_trace_of_preallocated_backtrace(exc);
640 return exc;
641 }
642 }
644 static intptr_t non_oop_bits = 0;
646 void* Universe::non_oop_word() {
647 // Neither the high bits nor the low bits of this value is allowed
648 // to look like (respectively) the high or low bits of a real oop.
649 //
650 // High and low are CPU-specific notions, but low always includes
651 // the low-order bit. Since oops are always aligned at least mod 4,
652 // setting the low-order bit will ensure that the low half of the
653 // word will never look like that of a real oop.
654 //
655 // Using the OS-supplied non-memory-address word (usually 0 or -1)
656 // will take care of the high bits, however many there are.
658 if (non_oop_bits == 0) {
659 non_oop_bits = (intptr_t)os::non_memory_address_word() | 1;
660 }
662 return (void*)non_oop_bits;
663 }
665 jint universe_init() {
666 assert(!Universe::_fully_initialized, "called after initialize_vtables");
667 guarantee(1 << LogHeapWordSize == sizeof(HeapWord),
668 "LogHeapWordSize is incorrect.");
669 guarantee(sizeof(oop) >= sizeof(HeapWord), "HeapWord larger than oop?");
670 guarantee(sizeof(oop) % sizeof(HeapWord) == 0,
671 "oop size is not not a multiple of HeapWord size");
672 TraceTime timer("Genesis", TraceStartupTime);
673 GC_locker::lock(); // do not allow gc during bootstrapping
674 JavaClasses::compute_hard_coded_offsets();
676 // Get map info from shared archive file.
677 if (DumpSharedSpaces)
678 UseSharedSpaces = false;
680 FileMapInfo* mapinfo = NULL;
681 if (UseSharedSpaces) {
682 mapinfo = NEW_C_HEAP_OBJ(FileMapInfo);
683 memset(mapinfo, 0, sizeof(FileMapInfo));
685 // Open the shared archive file, read and validate the header. If
686 // initialization files, shared spaces [UseSharedSpaces] are
687 // disabled and the file is closed.
689 if (mapinfo->initialize()) {
690 FileMapInfo::set_current_info(mapinfo);
691 } else {
692 assert(!mapinfo->is_open() && !UseSharedSpaces,
693 "archive file not closed or shared spaces not disabled.");
694 }
695 }
697 jint status = Universe::initialize_heap();
698 if (status != JNI_OK) {
699 return status;
700 }
702 // We have a heap so create the methodOop caches before
703 // CompactingPermGenGen::initialize_oops() tries to populate them.
704 Universe::_finalizer_register_cache = new LatestMethodOopCache();
705 Universe::_loader_addClass_cache = new LatestMethodOopCache();
706 Universe::_reflect_invoke_cache = new ActiveMethodOopsCache();
708 if (UseSharedSpaces) {
710 // Read the data structures supporting the shared spaces (shared
711 // system dictionary, symbol table, etc.). After that, access to
712 // the file (other than the mapped regions) is no longer needed, and
713 // the file is closed. Closing the file does not affect the
714 // currently mapped regions.
716 CompactingPermGenGen::initialize_oops();
717 mapinfo->close();
719 } else {
720 SymbolTable::create_table();
721 StringTable::create_table();
722 ClassLoader::create_package_info_table();
723 }
725 return JNI_OK;
726 }
728 jint Universe::initialize_heap() {
730 if (UseParallelGC) {
731 #ifndef SERIALGC
732 Universe::_collectedHeap = new ParallelScavengeHeap();
733 #else // SERIALGC
734 fatal("UseParallelGC not supported in java kernel vm.");
735 #endif // SERIALGC
737 } else if (UseG1GC) {
738 #ifndef SERIALGC
739 G1CollectorPolicy* g1p = new G1CollectorPolicy_BestRegionsFirst();
740 G1CollectedHeap* g1h = new G1CollectedHeap(g1p);
741 Universe::_collectedHeap = g1h;
742 #else // SERIALGC
743 fatal("UseG1GC not supported in java kernel vm.");
744 #endif // SERIALGC
746 } else {
747 GenCollectorPolicy *gc_policy;
749 if (UseSerialGC) {
750 gc_policy = new MarkSweepPolicy();
751 } else if (UseConcMarkSweepGC) {
752 #ifndef SERIALGC
753 if (UseAdaptiveSizePolicy) {
754 gc_policy = new ASConcurrentMarkSweepPolicy();
755 } else {
756 gc_policy = new ConcurrentMarkSweepPolicy();
757 }
758 #else // SERIALGC
759 fatal("UseConcMarkSweepGC not supported in java kernel vm.");
760 #endif // SERIALGC
761 } else { // default old generation
762 gc_policy = new MarkSweepPolicy();
763 }
765 Universe::_collectedHeap = new GenCollectedHeap(gc_policy);
766 }
768 jint status = Universe::heap()->initialize();
769 if (status != JNI_OK) {
770 return status;
771 }
772 if (UseCompressedOops) {
773 // Subtract a page because something can get allocated at heap base.
774 // This also makes implicit null checking work, because the
775 // memory+1 page below heap_base needs to cause a signal.
776 // See needs_explicit_null_check.
777 // Only set the heap base for compressed oops because it indicates
778 // compressed oops for pstack code.
779 Universe::_heap_base = Universe::heap()->base() - os::vm_page_size();
780 }
782 // We will never reach the CATCH below since Exceptions::_throw will cause
783 // the VM to exit if an exception is thrown during initialization
785 if (UseTLAB) {
786 assert(Universe::heap()->supports_tlab_allocation(),
787 "Should support thread-local allocation buffers");
788 ThreadLocalAllocBuffer::startup_initialization();
789 }
790 return JNI_OK;
791 }
793 // It's the caller's repsonsibility to ensure glitch-freedom
794 // (if required).
795 void Universe::update_heap_info_at_gc() {
796 _heap_capacity_at_last_gc = heap()->capacity();
797 _heap_used_at_last_gc = heap()->used();
798 }
802 void universe2_init() {
803 EXCEPTION_MARK;
804 Universe::genesis(CATCH);
805 // Although we'd like to verify here that the state of the heap
806 // is good, we can't because the main thread has not yet added
807 // itself to the threads list (so, using current interfaces
808 // we can't "fill" its TLAB), unless TLABs are disabled.
809 if (VerifyBeforeGC && !UseTLAB &&
810 Universe::heap()->total_collections() >= VerifyGCStartAt) {
811 Universe::heap()->prepare_for_verify();
812 Universe::verify(); // make sure we're starting with a clean slate
813 }
814 }
817 // This function is defined in JVM.cpp
818 extern void initialize_converter_functions();
820 bool universe_post_init() {
821 Universe::_fully_initialized = true;
822 EXCEPTION_MARK;
823 { ResourceMark rm;
824 Interpreter::initialize(); // needed for interpreter entry points
825 if (!UseSharedSpaces) {
826 KlassHandle ok_h(THREAD, SystemDictionary::object_klass());
827 Universe::reinitialize_vtable_of(ok_h, CHECK_false);
828 Universe::reinitialize_itables(CHECK_false);
829 }
830 }
832 klassOop k;
833 instanceKlassHandle k_h;
834 if (!UseSharedSpaces) {
835 // Setup preallocated empty java.lang.Class array
836 Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::class_klass(), 0, CHECK_false);
837 // Setup preallocated OutOfMemoryError errors
838 k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_OutOfMemoryError(), true, CHECK_false);
839 k_h = instanceKlassHandle(THREAD, k);
840 Universe::_out_of_memory_error_java_heap = k_h->allocate_permanent_instance(CHECK_false);
841 Universe::_out_of_memory_error_perm_gen = k_h->allocate_permanent_instance(CHECK_false);
842 Universe::_out_of_memory_error_array_size = k_h->allocate_permanent_instance(CHECK_false);
843 Universe::_out_of_memory_error_gc_overhead_limit =
844 k_h->allocate_permanent_instance(CHECK_false);
846 // Setup preallocated NullPointerException
847 // (this is currently used for a cheap & dirty solution in compiler exception handling)
848 k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_NullPointerException(), true, CHECK_false);
849 Universe::_null_ptr_exception_instance = instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false);
850 // Setup preallocated ArithmeticException
851 // (this is currently used for a cheap & dirty solution in compiler exception handling)
852 k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_ArithmeticException(), true, CHECK_false);
853 Universe::_arithmetic_exception_instance = instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false);
854 // Virtual Machine Error for when we get into a situation we can't resolve
855 k = SystemDictionary::resolve_or_fail(
856 vmSymbolHandles::java_lang_VirtualMachineError(), true, CHECK_false);
857 bool linked = instanceKlass::cast(k)->link_class_or_fail(CHECK_false);
858 if (!linked) {
859 tty->print_cr("Unable to link/verify VirtualMachineError class");
860 return false; // initialization failed
861 }
862 Universe::_virtual_machine_error_instance =
863 instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false);
864 }
865 if (!DumpSharedSpaces) {
866 // These are the only Java fields that are currently set during shared space dumping.
867 // We prefer to not handle this generally, so we always reinitialize these detail messages.
868 Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false);
869 java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg());
871 msg = java_lang_String::create_from_str("PermGen space", CHECK_false);
872 java_lang_Throwable::set_message(Universe::_out_of_memory_error_perm_gen, msg());
874 msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false);
875 java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg());
877 msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false);
878 java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg());
880 msg = java_lang_String::create_from_str("/ by zero", CHECK_false);
881 java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg());
883 // Setup the array of errors that have preallocated backtrace
884 k = Universe::_out_of_memory_error_java_heap->klass();
885 assert(k->klass_part()->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error");
886 k_h = instanceKlassHandle(THREAD, k);
888 int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0;
889 Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false);
890 for (int i=0; i<len; i++) {
891 oop err = k_h->allocate_permanent_instance(CHECK_false);
892 Handle err_h = Handle(THREAD, err);
893 java_lang_Throwable::allocate_backtrace(err_h, CHECK_false);
894 Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h());
895 }
896 Universe::_preallocated_out_of_memory_error_avail_count = (jint)len;
897 }
900 // Setup static method for registering finalizers
901 // The finalizer klass must be linked before looking up the method, in
902 // case it needs to get rewritten.
903 instanceKlass::cast(SystemDictionary::finalizer_klass())->link_class(CHECK_false);
904 methodOop m = instanceKlass::cast(SystemDictionary::finalizer_klass())->find_method(
905 vmSymbols::register_method_name(),
906 vmSymbols::register_method_signature());
907 if (m == NULL || !m->is_static()) {
908 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
909 "java.lang.ref.Finalizer.register", false);
910 }
911 Universe::_finalizer_register_cache->init(
912 SystemDictionary::finalizer_klass(), m, CHECK_false);
914 // Resolve on first use and initialize class.
915 // Note: No race-condition here, since a resolve will always return the same result
917 // Setup method for security checks
918 k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_reflect_Method(), true, CHECK_false);
919 k_h = instanceKlassHandle(THREAD, k);
920 k_h->link_class(CHECK_false);
921 m = k_h->find_method(vmSymbols::invoke_name(), vmSymbols::object_array_object_object_signature());
922 if (m == NULL || m->is_static()) {
923 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
924 "java.lang.reflect.Method.invoke", false);
925 }
926 Universe::_reflect_invoke_cache->init(k_h(), m, CHECK_false);
928 // Setup method for registering loaded classes in class loader vector
929 instanceKlass::cast(SystemDictionary::classloader_klass())->link_class(CHECK_false);
930 m = instanceKlass::cast(SystemDictionary::classloader_klass())->find_method(vmSymbols::addClass_name(), vmSymbols::class_void_signature());
931 if (m == NULL || m->is_static()) {
932 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
933 "java.lang.ClassLoader.addClass", false);
934 }
935 Universe::_loader_addClass_cache->init(
936 SystemDictionary::classloader_klass(), m, CHECK_false);
938 // The folowing is initializing converter functions for serialization in
939 // JVM.cpp. If we clean up the StrictMath code above we may want to find
940 // a better solution for this as well.
941 initialize_converter_functions();
943 // This needs to be done before the first scavenge/gc, since
944 // it's an input to soft ref clearing policy.
945 {
946 MutexLocker x(Heap_lock);
947 Universe::update_heap_info_at_gc();
948 }
950 // ("weak") refs processing infrastructure initialization
951 Universe::heap()->post_initialize();
953 GC_locker::unlock(); // allow gc after bootstrapping
955 MemoryService::set_universe_heap(Universe::_collectedHeap);
956 return true;
957 }
960 void Universe::compute_base_vtable_size() {
961 _base_vtable_size = ClassLoader::compute_Object_vtable();
962 }
965 // %%% The Universe::flush_foo methods belong in CodeCache.
967 // Flushes compiled methods dependent on dependee.
968 void Universe::flush_dependents_on(instanceKlassHandle dependee) {
969 assert_lock_strong(Compile_lock);
971 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
973 // CodeCache can only be updated by a thread_in_VM and they will all be
974 // stopped dring the safepoint so CodeCache will be safe to update without
975 // holding the CodeCache_lock.
977 DepChange changes(dependee);
979 // Compute the dependent nmethods
980 if (CodeCache::mark_for_deoptimization(changes) > 0) {
981 // At least one nmethod has been marked for deoptimization
982 VM_Deoptimize op;
983 VMThread::execute(&op);
984 }
985 }
987 #ifdef HOTSWAP
988 // Flushes compiled methods dependent on dependee in the evolutionary sense
989 void Universe::flush_evol_dependents_on(instanceKlassHandle ev_k_h) {
990 // --- Compile_lock is not held. However we are at a safepoint.
991 assert_locked_or_safepoint(Compile_lock);
992 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
994 // CodeCache can only be updated by a thread_in_VM and they will all be
995 // stopped dring the safepoint so CodeCache will be safe to update without
996 // holding the CodeCache_lock.
998 // Compute the dependent nmethods
999 if (CodeCache::mark_for_evol_deoptimization(ev_k_h) > 0) {
1000 // At least one nmethod has been marked for deoptimization
1002 // All this already happens inside a VM_Operation, so we'll do all the work here.
1003 // Stuff copied from VM_Deoptimize and modified slightly.
1005 // We do not want any GCs to happen while we are in the middle of this VM operation
1006 ResourceMark rm;
1007 DeoptimizationMarker dm;
1009 // Deoptimize all activations depending on marked nmethods
1010 Deoptimization::deoptimize_dependents();
1012 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1013 CodeCache::make_marked_nmethods_not_entrant();
1014 }
1015 }
1016 #endif // HOTSWAP
1019 // Flushes compiled methods dependent on dependee
1020 void Universe::flush_dependents_on_method(methodHandle m_h) {
1021 // --- Compile_lock is not held. However we are at a safepoint.
1022 assert_locked_or_safepoint(Compile_lock);
1024 // CodeCache can only be updated by a thread_in_VM and they will all be
1025 // stopped dring the safepoint so CodeCache will be safe to update without
1026 // holding the CodeCache_lock.
1028 // Compute the dependent nmethods
1029 if (CodeCache::mark_for_deoptimization(m_h()) > 0) {
1030 // At least one nmethod has been marked for deoptimization
1032 // All this already happens inside a VM_Operation, so we'll do all the work here.
1033 // Stuff copied from VM_Deoptimize and modified slightly.
1035 // We do not want any GCs to happen while we are in the middle of this VM operation
1036 ResourceMark rm;
1037 DeoptimizationMarker dm;
1039 // Deoptimize all activations depending on marked nmethods
1040 Deoptimization::deoptimize_dependents();
1042 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1043 CodeCache::make_marked_nmethods_not_entrant();
1044 }
1045 }
1047 void Universe::print() { print_on(gclog_or_tty); }
1049 void Universe::print_on(outputStream* st) {
1050 st->print_cr("Heap");
1051 heap()->print_on(st);
1052 }
1054 void Universe::print_heap_at_SIGBREAK() {
1055 if (PrintHeapAtSIGBREAK) {
1056 MutexLocker hl(Heap_lock);
1057 print_on(tty);
1058 tty->cr();
1059 tty->flush();
1060 }
1061 }
1063 void Universe::print_heap_before_gc(outputStream* st) {
1064 st->print_cr("{Heap before GC invocations=%u (full %u):",
1065 heap()->total_collections(),
1066 heap()->total_full_collections());
1067 heap()->print_on(st);
1068 }
1070 void Universe::print_heap_after_gc(outputStream* st) {
1071 st->print_cr("Heap after GC invocations=%u (full %u):",
1072 heap()->total_collections(),
1073 heap()->total_full_collections());
1074 heap()->print_on(st);
1075 st->print_cr("}");
1076 }
1078 void Universe::verify(bool allow_dirty, bool silent) {
1079 if (SharedSkipVerify) {
1080 return;
1081 }
1083 // The use of _verify_in_progress is a temporary work around for
1084 // 6320749. Don't bother with a creating a class to set and clear
1085 // it since it is only used in this method and the control flow is
1086 // straight forward.
1087 _verify_in_progress = true;
1089 COMPILER2_PRESENT(
1090 assert(!DerivedPointerTable::is_active(),
1091 "DPT should not be active during verification "
1092 "(of thread stacks below)");
1093 )
1095 ResourceMark rm;
1096 HandleMark hm; // Handles created during verification can be zapped
1097 _verify_count++;
1099 if (!silent) gclog_or_tty->print("[Verifying ");
1100 if (!silent) gclog_or_tty->print("threads ");
1101 Threads::verify();
1102 heap()->verify(allow_dirty, silent);
1104 if (!silent) gclog_or_tty->print("syms ");
1105 SymbolTable::verify();
1106 if (!silent) gclog_or_tty->print("strs ");
1107 StringTable::verify();
1108 {
1109 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1110 if (!silent) gclog_or_tty->print("zone ");
1111 CodeCache::verify();
1112 }
1113 if (!silent) gclog_or_tty->print("dict ");
1114 SystemDictionary::verify();
1115 if (!silent) gclog_or_tty->print("hand ");
1116 JNIHandles::verify();
1117 if (!silent) gclog_or_tty->print("C-heap ");
1118 os::check_heap();
1119 if (!silent) gclog_or_tty->print_cr("]");
1121 _verify_in_progress = false;
1122 }
1124 // Oop verification (see MacroAssembler::verify_oop)
1126 static uintptr_t _verify_oop_data[2] = {0, (uintptr_t)-1};
1127 static uintptr_t _verify_klass_data[2] = {0, (uintptr_t)-1};
1130 static void calculate_verify_data(uintptr_t verify_data[2],
1131 HeapWord* low_boundary,
1132 HeapWord* high_boundary) {
1133 assert(low_boundary < high_boundary, "bad interval");
1135 // decide which low-order bits we require to be clear:
1136 size_t alignSize = MinObjAlignmentInBytes;
1137 size_t min_object_size = oopDesc::header_size();
1139 // make an inclusive limit:
1140 uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize;
1141 uintptr_t min = (uintptr_t)low_boundary;
1142 assert(min < max, "bad interval");
1143 uintptr_t diff = max ^ min;
1145 // throw away enough low-order bits to make the diff vanish
1146 uintptr_t mask = (uintptr_t)(-1);
1147 while ((mask & diff) != 0)
1148 mask <<= 1;
1149 uintptr_t bits = (min & mask);
1150 assert(bits == (max & mask), "correct mask");
1151 // check an intermediate value between min and max, just to make sure:
1152 assert(bits == ((min + (max-min)/2) & mask), "correct mask");
1154 // require address alignment, too:
1155 mask |= (alignSize - 1);
1157 if (!(verify_data[0] == 0 && verify_data[1] == (uintptr_t)-1)) {
1158 assert(verify_data[0] == mask && verify_data[1] == bits, "mask stability");
1159 }
1160 verify_data[0] = mask;
1161 verify_data[1] = bits;
1162 }
1165 // Oop verification (see MacroAssembler::verify_oop)
1166 #ifndef PRODUCT
1168 uintptr_t Universe::verify_oop_mask() {
1169 MemRegion m = heap()->reserved_region();
1170 calculate_verify_data(_verify_oop_data,
1171 m.start(),
1172 m.end());
1173 return _verify_oop_data[0];
1174 }
1178 uintptr_t Universe::verify_oop_bits() {
1179 verify_oop_mask();
1180 return _verify_oop_data[1];
1181 }
1184 uintptr_t Universe::verify_klass_mask() {
1185 /* $$$
1186 // A klass can never live in the new space. Since the new and old
1187 // spaces can change size, we must settle for bounds-checking against
1188 // the bottom of the world, plus the smallest possible new and old
1189 // space sizes that may arise during execution.
1190 size_t min_new_size = Universe::new_size(); // in bytes
1191 size_t min_old_size = Universe::old_size(); // in bytes
1192 calculate_verify_data(_verify_klass_data,
1193 (HeapWord*)((uintptr_t)_new_gen->low_boundary + min_new_size + min_old_size),
1194 _perm_gen->high_boundary);
1195 */
1196 // Why doesn't the above just say that klass's always live in the perm
1197 // gen? I'll see if that seems to work...
1198 MemRegion permanent_reserved;
1199 switch (Universe::heap()->kind()) {
1200 default:
1201 // ???: What if a CollectedHeap doesn't have a permanent generation?
1202 ShouldNotReachHere();
1203 break;
1204 case CollectedHeap::GenCollectedHeap:
1205 case CollectedHeap::G1CollectedHeap: {
1206 SharedHeap* sh = (SharedHeap*) Universe::heap();
1207 permanent_reserved = sh->perm_gen()->reserved();
1208 break;
1209 }
1210 #ifndef SERIALGC
1211 case CollectedHeap::ParallelScavengeHeap: {
1212 ParallelScavengeHeap* psh = (ParallelScavengeHeap*) Universe::heap();
1213 permanent_reserved = psh->perm_gen()->reserved();
1214 break;
1215 }
1216 #endif // SERIALGC
1217 }
1218 calculate_verify_data(_verify_klass_data,
1219 permanent_reserved.start(),
1220 permanent_reserved.end());
1222 return _verify_klass_data[0];
1223 }
1227 uintptr_t Universe::verify_klass_bits() {
1228 verify_klass_mask();
1229 return _verify_klass_data[1];
1230 }
1233 uintptr_t Universe::verify_mark_mask() {
1234 return markOopDesc::lock_mask_in_place;
1235 }
1239 uintptr_t Universe::verify_mark_bits() {
1240 intptr_t mask = verify_mark_mask();
1241 intptr_t bits = (intptr_t)markOopDesc::prototype();
1242 assert((bits & ~mask) == 0, "no stray header bits");
1243 return bits;
1244 }
1245 #endif // PRODUCT
1248 void Universe::compute_verify_oop_data() {
1249 verify_oop_mask();
1250 verify_oop_bits();
1251 verify_mark_mask();
1252 verify_mark_bits();
1253 verify_klass_mask();
1254 verify_klass_bits();
1255 }
1258 void CommonMethodOopCache::init(klassOop k, methodOop m, TRAPS) {
1259 if (!UseSharedSpaces) {
1260 _klass = k;
1261 }
1262 #ifndef PRODUCT
1263 else {
1264 // sharing initilization should have already set up _klass
1265 assert(_klass != NULL, "just checking");
1266 }
1267 #endif
1269 _method_idnum = m->method_idnum();
1270 assert(_method_idnum >= 0, "sanity check");
1271 }
1274 ActiveMethodOopsCache::~ActiveMethodOopsCache() {
1275 if (_prev_methods != NULL) {
1276 for (int i = _prev_methods->length() - 1; i >= 0; i--) {
1277 jweak method_ref = _prev_methods->at(i);
1278 if (method_ref != NULL) {
1279 JNIHandles::destroy_weak_global(method_ref);
1280 }
1281 }
1282 delete _prev_methods;
1283 _prev_methods = NULL;
1284 }
1285 }
1288 void ActiveMethodOopsCache::add_previous_version(const methodOop method) {
1289 assert(Thread::current()->is_VM_thread(),
1290 "only VMThread can add previous versions");
1292 if (_prev_methods == NULL) {
1293 // This is the first previous version so make some space.
1294 // Start with 2 elements under the assumption that the class
1295 // won't be redefined much.
1296 _prev_methods = new (ResourceObj::C_HEAP) GrowableArray<jweak>(2, true);
1297 }
1299 // RC_TRACE macro has an embedded ResourceMark
1300 RC_TRACE(0x00000100,
1301 ("add: %s(%s): adding prev version ref for cached method @%d",
1302 method->name()->as_C_string(), method->signature()->as_C_string(),
1303 _prev_methods->length()));
1305 methodHandle method_h(method);
1306 jweak method_ref = JNIHandles::make_weak_global(method_h);
1307 _prev_methods->append(method_ref);
1309 // Using weak references allows previous versions of the cached
1310 // method to be GC'ed when they are no longer needed. Since the
1311 // caller is the VMThread and we are at a safepoint, this is a good
1312 // time to clear out unused weak references.
1314 for (int i = _prev_methods->length() - 1; i >= 0; i--) {
1315 jweak method_ref = _prev_methods->at(i);
1316 assert(method_ref != NULL, "weak method ref was unexpectedly cleared");
1317 if (method_ref == NULL) {
1318 _prev_methods->remove_at(i);
1319 // Since we are traversing the array backwards, we don't have to
1320 // do anything special with the index.
1321 continue; // robustness
1322 }
1324 methodOop m = (methodOop)JNIHandles::resolve(method_ref);
1325 if (m == NULL) {
1326 // this method entry has been GC'ed so remove it
1327 JNIHandles::destroy_weak_global(method_ref);
1328 _prev_methods->remove_at(i);
1329 } else {
1330 // RC_TRACE macro has an embedded ResourceMark
1331 RC_TRACE(0x00000400, ("add: %s(%s): previous cached method @%d is alive",
1332 m->name()->as_C_string(), m->signature()->as_C_string(), i));
1333 }
1334 }
1335 } // end add_previous_version()
1338 bool ActiveMethodOopsCache::is_same_method(const methodOop method) const {
1339 instanceKlass* ik = instanceKlass::cast(klass());
1340 methodOop check_method = ik->method_with_idnum(method_idnum());
1341 assert(check_method != NULL, "sanity check");
1342 if (check_method == method) {
1343 // done with the easy case
1344 return true;
1345 }
1347 if (_prev_methods != NULL) {
1348 // The cached method has been redefined at least once so search
1349 // the previous versions for a match.
1350 for (int i = 0; i < _prev_methods->length(); i++) {
1351 jweak method_ref = _prev_methods->at(i);
1352 assert(method_ref != NULL, "weak method ref was unexpectedly cleared");
1353 if (method_ref == NULL) {
1354 continue; // robustness
1355 }
1357 check_method = (methodOop)JNIHandles::resolve(method_ref);
1358 if (check_method == method) {
1359 // a previous version matches
1360 return true;
1361 }
1362 }
1363 }
1365 // either no previous versions or no previous version matched
1366 return false;
1367 }
1370 methodOop LatestMethodOopCache::get_methodOop() {
1371 instanceKlass* ik = instanceKlass::cast(klass());
1372 methodOop m = ik->method_with_idnum(method_idnum());
1373 assert(m != NULL, "sanity check");
1374 return m;
1375 }
1378 #ifdef ASSERT
1379 // Release dummy object(s) at bottom of heap
1380 bool Universe::release_fullgc_alot_dummy() {
1381 MutexLocker ml(FullGCALot_lock);
1382 if (_fullgc_alot_dummy_array != NULL) {
1383 if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) {
1384 // No more dummies to release, release entire array instead
1385 _fullgc_alot_dummy_array = NULL;
1386 return false;
1387 }
1388 if (!UseConcMarkSweepGC) {
1389 // Release dummy at bottom of old generation
1390 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1391 }
1392 // Release dummy at bottom of permanent generation
1393 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1394 }
1395 return true;
1396 }
1398 #endif // ASSERT
