Mercurial > hg > graal-compiler
annotate src/share/vm/memory/universe.cpp @ 242:d95b224e9f17
6721093: -XX:AppendRatio=N not supported
Summary: Add mechanism to ignore unsupported flags for a set period of time
Reviewed-by: acorn, never, coleenp
| author | kamg |
|---|---|
| date | Mon, 28 Jul 2008 14:07:44 -0400 |
| parents | d1605aabd0a1 |
| children | 1ee8caae33af |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 196 | 2 * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. |
| 0 | 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 */ | |
| 24 | |
| 25 # include "incls/_precompiled.incl" | |
| 26 # include "incls/_universe.cpp.incl" | |
| 27 | |
| 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; | |
| 85 | |
| 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;) | |
| 89 | |
| 90 | |
| 91 // Heap | |
| 92 int Universe::_verify_count = 0; | |
| 93 | |
| 94 int Universe::_base_vtable_size = 0; | |
| 95 bool Universe::_bootstrapping = false; | |
| 96 bool Universe::_fully_initialized = false; | |
| 97 | |
| 98 size_t Universe::_heap_capacity_at_last_gc; | |
| 99 size_t Universe::_heap_used_at_last_gc; | |
| 100 | |
| 101 CollectedHeap* Universe::_collectedHeap = NULL; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
102 address Universe::_heap_base = NULL; |
| 0 | 103 |
| 104 | |
| 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 } | |
| 115 | |
| 116 | |
| 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 } | |
| 130 | |
| 131 void Universe::oops_do(OopClosure* f, bool do_all) { | |
| 132 | |
| 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); | |
| 142 | |
| 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"); | |
| 149 | |
| 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 } | |
| 208 | |
| 209 | |
| 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 } | |
| 219 | |
| 220 | |
| 221 void Universe::genesis(TRAPS) { | |
| 222 ResourceMark rm; | |
| 223 { FlagSetting fs(_bootstrapping, true); | |
| 224 | |
| 225 { MutexLocker mc(Compile_lock); | |
| 226 | |
| 227 // determine base vtable size; without that we cannot create the array klasses | |
| 228 compute_base_vtable_size(); | |
| 229 | |
| 230 if (!UseSharedSpaces) { | |
| 231 _klassKlassObj = klassKlass::create_klass(CHECK); | |
| 232 _arrayKlassKlassObj = arrayKlassKlass::create_klass(CHECK); | |
| 233 | |
| 234 _objArrayKlassKlassObj = objArrayKlassKlass::create_klass(CHECK); | |
| 235 _instanceKlassKlassObj = instanceKlassKlass::create_klass(CHECK); | |
| 236 _typeArrayKlassKlassObj = typeArrayKlassKlass::create_klass(CHECK); | |
| 237 | |
| 238 _symbolKlassObj = symbolKlass::create_klass(CHECK); | |
| 239 | |
| 240 _emptySymbol = oopFactory::new_symbol("", CHECK); | |
| 241 | |
| 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); | |
| 250 | |
| 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; | |
| 259 | |
| 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); | |
| 265 | |
| 266 _compiledICHolderKlassObj = compiledICHolderKlass::create_klass(CHECK); | |
| 267 _systemObjArrayKlassObj = objArrayKlassKlass::cast(objArrayKlassKlassObj())->allocate_system_objArray_klass(CHECK); | |
| 268 | |
| 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); | |
| 273 | |
| 274 _the_array_interfaces_array = oopFactory::new_system_objArray(2, CHECK); | |
| 275 _vm_exception = oopFactory::new_symbol("vm exception holder", CHECK); | |
| 276 } else { | |
| 277 | |
| 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 } | |
| 285 | |
| 286 vmSymbols::initialize(CHECK); | |
| 287 | |
| 288 SystemDictionary::initialize(CHECK); | |
| 289 | |
| 290 klassOop ok = SystemDictionary::object_klass(); | |
| 291 | |
| 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"); | |
| 298 | |
| 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"); | |
| 302 | |
| 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()); | |
| 318 | |
| 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); | |
| 322 | |
| 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 } | |
| 345 | |
| 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 | |
| 357 | |
| 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(); | |
| 365 | |
| 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. | |
| 242 | 370 if (JDK_Version::is_partially_initialized()) { |
| 371 uint8_t jdk_version; | |
| 372 klassOop k = SystemDictionary::resolve_or_null( | |
| 373 vmSymbolHandles::java_lang_management_MemoryUsage(), THREAD); | |
| 0 | 374 CLEAR_PENDING_EXCEPTION; // ignore exceptions |
| 375 if (k == NULL) { | |
| 242 | 376 k = SystemDictionary::resolve_or_null( |
| 377 vmSymbolHandles::java_lang_CharSequence(), THREAD); | |
| 0 | 378 CLEAR_PENDING_EXCEPTION; // ignore exceptions |
| 379 if (k == NULL) { | |
| 242 | 380 k = SystemDictionary::resolve_or_null( |
| 381 vmSymbolHandles::java_lang_Shutdown(), THREAD); | |
| 0 | 382 CLEAR_PENDING_EXCEPTION; // ignore exceptions |
| 383 if (k == NULL) { | |
| 242 | 384 jdk_version = 2; |
| 0 | 385 } else { |
| 242 | 386 jdk_version = 3; |
| 0 | 387 } |
| 388 } else { | |
| 242 | 389 jdk_version = 4; |
| 0 | 390 } |
| 391 } else { | |
| 242 | 392 jdk_version = 5; |
| 0 | 393 } |
| 242 | 394 JDK_Version::fully_initialize(jdk_version); |
| 0 | 395 } |
| 396 | |
| 397 #ifdef ASSERT | |
| 398 if (FullGCALot) { | |
| 399 // Allocate an array of dummy objects. | |
| 400 // We'd like these to be at the bottom of the old generation, | |
| 401 // so that when we free one and then collect, | |
| 402 // (almost) the whole heap moves | |
| 403 // and we find out if we actually update all the oops correctly. | |
| 404 // But we can't allocate directly in the old generation, | |
| 405 // so we allocate wherever, and hope that the first collection | |
| 406 // moves these objects to the bottom of the old generation. | |
| 407 // We can allocate directly in the permanent generation, so we do. | |
| 408 int size; | |
| 409 if (UseConcMarkSweepGC) { | |
| 410 warning("Using +FullGCALot with concurrent mark sweep gc " | |
| 411 "will not force all objects to relocate"); | |
| 412 size = FullGCALotDummies; | |
| 413 } else { | |
| 414 size = FullGCALotDummies * 2; | |
| 415 } | |
| 416 objArrayOop naked_array = oopFactory::new_system_objArray(size, CHECK); | |
| 417 objArrayHandle dummy_array(THREAD, naked_array); | |
| 418 int i = 0; | |
| 419 while (i < size) { | |
| 420 if (!UseConcMarkSweepGC) { | |
| 421 // Allocate dummy in old generation | |
| 422 oop dummy = instanceKlass::cast(SystemDictionary::object_klass())->allocate_instance(CHECK); | |
| 423 dummy_array->obj_at_put(i++, dummy); | |
| 424 } | |
| 425 // Allocate dummy in permanent generation | |
| 426 oop dummy = instanceKlass::cast(SystemDictionary::object_klass())->allocate_permanent_instance(CHECK); | |
| 427 dummy_array->obj_at_put(i++, dummy); | |
| 428 } | |
| 429 { | |
| 430 // Only modify the global variable inside the mutex. | |
| 431 // If we had a race to here, the other dummy_array instances | |
| 432 // and their elements just get dropped on the floor, which is fine. | |
| 433 MutexLocker ml(FullGCALot_lock); | |
| 434 if (_fullgc_alot_dummy_array == NULL) { | |
| 435 _fullgc_alot_dummy_array = dummy_array(); | |
| 436 } | |
| 437 } | |
| 438 assert(i == _fullgc_alot_dummy_array->length(), "just checking"); | |
| 439 } | |
| 440 #endif | |
| 441 } | |
| 442 | |
| 443 | |
| 444 static inline void add_vtable(void** list, int* n, Klass* o, int count) { | |
| 445 list[(*n)++] = *(void**)&o->vtbl_value(); | |
| 446 guarantee((*n) <= count, "vtable list too small."); | |
| 447 } | |
| 448 | |
| 449 | |
| 450 void Universe::init_self_patching_vtbl_list(void** list, int count) { | |
| 451 int n = 0; | |
| 452 { klassKlass o; add_vtable(list, &n, &o, count); } | |
| 453 { arrayKlassKlass o; add_vtable(list, &n, &o, count); } | |
| 454 { objArrayKlassKlass o; add_vtable(list, &n, &o, count); } | |
| 455 { instanceKlassKlass o; add_vtable(list, &n, &o, count); } | |
| 456 { instanceKlass o; add_vtable(list, &n, &o, count); } | |
| 457 { instanceRefKlass o; add_vtable(list, &n, &o, count); } | |
| 458 { typeArrayKlassKlass o; add_vtable(list, &n, &o, count); } | |
| 459 { symbolKlass o; add_vtable(list, &n, &o, count); } | |
| 460 { typeArrayKlass o; add_vtable(list, &n, &o, count); } | |
| 461 { methodKlass o; add_vtable(list, &n, &o, count); } | |
| 462 { constMethodKlass o; add_vtable(list, &n, &o, count); } | |
| 463 { constantPoolKlass o; add_vtable(list, &n, &o, count); } | |
| 464 { constantPoolCacheKlass o; add_vtable(list, &n, &o, count); } | |
| 465 { objArrayKlass o; add_vtable(list, &n, &o, count); } | |
| 466 { methodDataKlass o; add_vtable(list, &n, &o, count); } | |
| 467 { compiledICHolderKlass o; add_vtable(list, &n, &o, count); } | |
| 468 } | |
| 469 | |
| 470 | |
| 471 class FixupMirrorClosure: public ObjectClosure { | |
| 472 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
473 virtual void do_object(oop obj) { |
| 0 | 474 if (obj->is_klass()) { |
| 475 EXCEPTION_MARK; | |
| 476 KlassHandle k(THREAD, klassOop(obj)); | |
| 477 // We will never reach the CATCH below since Exceptions::_throw will cause | |
| 478 // the VM to exit if an exception is thrown during initialization | |
| 479 java_lang_Class::create_mirror(k, CATCH); | |
| 480 // This call unconditionally creates a new mirror for k, | |
| 481 // and links in k's component_mirror field if k is an array. | |
| 482 // If k is an objArray, k's element type must already have | |
| 483 // a mirror. In other words, this closure must process | |
| 484 // the component type of an objArray k before it processes k. | |
| 485 // This works because the permgen iterator presents arrays | |
| 486 // and their component types in order of creation. | |
| 487 } | |
| 488 } | |
| 489 }; | |
| 490 | |
| 491 void Universe::initialize_basic_type_mirrors(TRAPS) { | |
| 492 if (UseSharedSpaces) { | |
| 493 assert(_int_mirror != NULL, "already loaded"); | |
| 494 assert(_void_mirror == _mirrors[T_VOID], "consistently loaded"); | |
| 495 } else { | |
| 496 | |
| 497 assert(_int_mirror==NULL, "basic type mirrors already initialized"); | |
| 498 _int_mirror = | |
| 499 java_lang_Class::create_basic_type_mirror("int", T_INT, CHECK); | |
| 500 _float_mirror = | |
| 501 java_lang_Class::create_basic_type_mirror("float", T_FLOAT, CHECK); | |
| 502 _double_mirror = | |
| 503 java_lang_Class::create_basic_type_mirror("double", T_DOUBLE, CHECK); | |
| 504 _byte_mirror = | |
| 505 java_lang_Class::create_basic_type_mirror("byte", T_BYTE, CHECK); | |
| 506 _bool_mirror = | |
| 507 java_lang_Class::create_basic_type_mirror("boolean",T_BOOLEAN, CHECK); | |
| 508 _char_mirror = | |
| 509 java_lang_Class::create_basic_type_mirror("char", T_CHAR, CHECK); | |
| 510 _long_mirror = | |
| 511 java_lang_Class::create_basic_type_mirror("long", T_LONG, CHECK); | |
| 512 _short_mirror = | |
| 513 java_lang_Class::create_basic_type_mirror("short", T_SHORT, CHECK); | |
| 514 _void_mirror = | |
| 515 java_lang_Class::create_basic_type_mirror("void", T_VOID, CHECK); | |
| 516 | |
| 517 _mirrors[T_INT] = _int_mirror; | |
| 518 _mirrors[T_FLOAT] = _float_mirror; | |
| 519 _mirrors[T_DOUBLE] = _double_mirror; | |
| 520 _mirrors[T_BYTE] = _byte_mirror; | |
| 521 _mirrors[T_BOOLEAN] = _bool_mirror; | |
| 522 _mirrors[T_CHAR] = _char_mirror; | |
| 523 _mirrors[T_LONG] = _long_mirror; | |
| 524 _mirrors[T_SHORT] = _short_mirror; | |
| 525 _mirrors[T_VOID] = _void_mirror; | |
| 526 //_mirrors[T_OBJECT] = instanceKlass::cast(_object_klass)->java_mirror(); | |
| 527 //_mirrors[T_ARRAY] = instanceKlass::cast(_object_klass)->java_mirror(); | |
| 528 } | |
| 529 } | |
| 530 | |
| 531 void Universe::fixup_mirrors(TRAPS) { | |
| 532 // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly, | |
| 533 // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply | |
| 534 // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note | |
| 535 // that the number of objects allocated at this point is very small. | |
| 536 assert(SystemDictionary::class_klass_loaded(), "java.lang.Class should be loaded"); | |
| 537 FixupMirrorClosure blk; | |
| 538 Universe::heap()->permanent_object_iterate(&blk); | |
| 539 } | |
| 540 | |
| 541 | |
| 542 static bool has_run_finalizers_on_exit = false; | |
| 543 | |
| 544 void Universe::run_finalizers_on_exit() { | |
| 545 if (has_run_finalizers_on_exit) return; | |
| 546 has_run_finalizers_on_exit = true; | |
| 547 | |
| 548 // Called on VM exit. This ought to be run in a separate thread. | |
| 549 if (TraceReferenceGC) tty->print_cr("Callback to run finalizers on exit"); | |
| 550 { | |
| 551 PRESERVE_EXCEPTION_MARK; | |
| 552 KlassHandle finalizer_klass(THREAD, SystemDictionary::finalizer_klass()); | |
| 553 JavaValue result(T_VOID); | |
| 554 JavaCalls::call_static( | |
| 555 &result, | |
| 556 finalizer_klass, | |
| 557 vmSymbolHandles::run_finalizers_on_exit_name(), | |
| 558 vmSymbolHandles::void_method_signature(), | |
| 559 THREAD | |
| 560 ); | |
| 561 // Ignore any pending exceptions | |
| 562 CLEAR_PENDING_EXCEPTION; | |
| 563 } | |
| 564 } | |
| 565 | |
| 566 | |
| 567 // initialize_vtable could cause gc if | |
| 568 // 1) we specified true to initialize_vtable and | |
| 569 // 2) this ran after gc was enabled | |
| 570 // In case those ever change we use handles for oops | |
| 571 void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) { | |
| 572 // init vtable of k and all subclasses | |
| 573 Klass* ko = k_h()->klass_part(); | |
| 574 klassVtable* vt = ko->vtable(); | |
| 575 if (vt) vt->initialize_vtable(false, CHECK); | |
| 576 if (ko->oop_is_instance()) { | |
| 577 instanceKlass* ik = (instanceKlass*)ko; | |
| 578 for (KlassHandle s_h(THREAD, ik->subklass()); s_h() != NULL; s_h = (THREAD, s_h()->klass_part()->next_sibling())) { | |
| 579 reinitialize_vtable_of(s_h, CHECK); | |
| 580 } | |
| 581 } | |
| 582 } | |
| 583 | |
| 584 | |
| 585 void initialize_itable_for_klass(klassOop k, TRAPS) { | |
| 586 instanceKlass::cast(k)->itable()->initialize_itable(false, CHECK); | |
| 587 } | |
| 588 | |
| 589 | |
| 590 void Universe::reinitialize_itables(TRAPS) { | |
| 591 SystemDictionary::classes_do(initialize_itable_for_klass, CHECK); | |
| 592 | |
| 593 } | |
| 594 | |
| 595 | |
| 596 bool Universe::on_page_boundary(void* addr) { | |
| 597 return ((uintptr_t) addr) % os::vm_page_size() == 0; | |
| 598 } | |
| 599 | |
| 600 | |
| 601 bool Universe::should_fill_in_stack_trace(Handle throwable) { | |
| 602 // never attempt to fill in the stack trace of preallocated errors that do not have | |
| 603 // backtrace. These errors are kept alive forever and may be "re-used" when all | |
| 604 // preallocated errors with backtrace have been consumed. Also need to avoid | |
| 605 // a potential loop which could happen if an out of memory occurs when attempting | |
| 606 // to allocate the backtrace. | |
| 607 return ((throwable() != Universe::_out_of_memory_error_java_heap) && | |
| 608 (throwable() != Universe::_out_of_memory_error_perm_gen) && | |
| 609 (throwable() != Universe::_out_of_memory_error_array_size) && | |
| 610 (throwable() != Universe::_out_of_memory_error_gc_overhead_limit)); | |
| 611 } | |
| 612 | |
| 613 | |
| 614 oop Universe::gen_out_of_memory_error(oop default_err) { | |
| 615 // generate an out of memory error: | |
| 616 // - if there is a preallocated error with backtrace available then return it wth | |
| 617 // a filled in stack trace. | |
| 618 // - if there are no preallocated errors with backtrace available then return | |
| 619 // an error without backtrace. | |
| 620 int next; | |
| 621 if (_preallocated_out_of_memory_error_avail_count > 0) { | |
| 622 next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count); | |
| 623 assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt"); | |
| 624 } else { | |
| 625 next = -1; | |
| 626 } | |
| 627 if (next < 0) { | |
| 628 // all preallocated errors have been used. | |
| 629 // return default | |
| 630 return default_err; | |
| 631 } else { | |
| 632 // get the error object at the slot and set set it to NULL so that the | |
| 633 // array isn't keeping it alive anymore. | |
| 634 oop exc = preallocated_out_of_memory_errors()->obj_at(next); | |
| 635 assert(exc != NULL, "slot has been used already"); | |
| 636 preallocated_out_of_memory_errors()->obj_at_put(next, NULL); | |
| 637 | |
| 638 // use the message from the default error | |
| 639 oop msg = java_lang_Throwable::message(default_err); | |
| 640 assert(msg != NULL, "no message"); | |
| 641 java_lang_Throwable::set_message(exc, msg); | |
| 642 | |
| 643 // populate the stack trace and return it. | |
| 644 java_lang_Throwable::fill_in_stack_trace_of_preallocated_backtrace(exc); | |
| 645 return exc; | |
| 646 } | |
| 647 } | |
| 648 | |
| 649 static intptr_t non_oop_bits = 0; | |
| 650 | |
| 651 void* Universe::non_oop_word() { | |
| 652 // Neither the high bits nor the low bits of this value is allowed | |
| 653 // to look like (respectively) the high or low bits of a real oop. | |
| 654 // | |
| 655 // High and low are CPU-specific notions, but low always includes | |
| 656 // the low-order bit. Since oops are always aligned at least mod 4, | |
| 657 // setting the low-order bit will ensure that the low half of the | |
| 658 // word will never look like that of a real oop. | |
| 659 // | |
| 660 // Using the OS-supplied non-memory-address word (usually 0 or -1) | |
| 661 // will take care of the high bits, however many there are. | |
| 662 | |
| 663 if (non_oop_bits == 0) { | |
| 664 non_oop_bits = (intptr_t)os::non_memory_address_word() | 1; | |
| 665 } | |
| 666 | |
| 667 return (void*)non_oop_bits; | |
| 668 } | |
| 669 | |
| 670 jint universe_init() { | |
| 671 assert(!Universe::_fully_initialized, "called after initialize_vtables"); | |
| 672 guarantee(1 << LogHeapWordSize == sizeof(HeapWord), | |
| 673 "LogHeapWordSize is incorrect."); | |
| 674 guarantee(sizeof(oop) >= sizeof(HeapWord), "HeapWord larger than oop?"); | |
| 675 guarantee(sizeof(oop) % sizeof(HeapWord) == 0, | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
676 "oop size is not not a multiple of HeapWord size"); |
| 0 | 677 TraceTime timer("Genesis", TraceStartupTime); |
| 678 GC_locker::lock(); // do not allow gc during bootstrapping | |
| 679 JavaClasses::compute_hard_coded_offsets(); | |
| 680 | |
| 681 // Get map info from shared archive file. | |
| 682 if (DumpSharedSpaces) | |
| 683 UseSharedSpaces = false; | |
| 684 | |
| 685 FileMapInfo* mapinfo = NULL; | |
| 686 if (UseSharedSpaces) { | |
| 687 mapinfo = NEW_C_HEAP_OBJ(FileMapInfo); | |
| 688 memset(mapinfo, 0, sizeof(FileMapInfo)); | |
| 689 | |
| 690 // Open the shared archive file, read and validate the header. If | |
| 691 // initialization files, shared spaces [UseSharedSpaces] are | |
| 692 // disabled and the file is closed. | |
| 693 | |
| 694 if (mapinfo->initialize()) { | |
| 695 FileMapInfo::set_current_info(mapinfo); | |
| 696 } else { | |
| 697 assert(!mapinfo->is_open() && !UseSharedSpaces, | |
| 698 "archive file not closed or shared spaces not disabled."); | |
| 699 } | |
| 700 } | |
| 701 | |
| 702 jint status = Universe::initialize_heap(); | |
| 703 if (status != JNI_OK) { | |
| 704 return status; | |
| 705 } | |
| 706 | |
| 707 // We have a heap so create the methodOop caches before | |
| 708 // CompactingPermGenGen::initialize_oops() tries to populate them. | |
| 709 Universe::_finalizer_register_cache = new LatestMethodOopCache(); | |
| 710 Universe::_loader_addClass_cache = new LatestMethodOopCache(); | |
| 711 Universe::_reflect_invoke_cache = new ActiveMethodOopsCache(); | |
| 712 | |
| 713 if (UseSharedSpaces) { | |
| 714 | |
| 715 // Read the data structures supporting the shared spaces (shared | |
| 716 // system dictionary, symbol table, etc.). After that, access to | |
| 717 // the file (other than the mapped regions) is no longer needed, and | |
| 718 // the file is closed. Closing the file does not affect the | |
| 719 // currently mapped regions. | |
| 720 | |
| 721 CompactingPermGenGen::initialize_oops(); | |
| 722 mapinfo->close(); | |
| 723 | |
| 724 } else { | |
| 725 SymbolTable::create_table(); | |
| 726 StringTable::create_table(); | |
| 727 ClassLoader::create_package_info_table(); | |
| 728 } | |
| 729 | |
| 730 return JNI_OK; | |
| 731 } | |
| 732 | |
| 733 jint Universe::initialize_heap() { | |
| 734 | |
| 735 if (UseParallelGC) { | |
| 736 #ifndef SERIALGC | |
| 737 Universe::_collectedHeap = new ParallelScavengeHeap(); | |
| 738 #else // SERIALGC | |
| 739 fatal("UseParallelGC not supported in java kernel vm."); | |
| 740 #endif // SERIALGC | |
| 741 | |
| 742 } else { | |
| 743 GenCollectorPolicy *gc_policy; | |
| 744 | |
| 745 if (UseSerialGC) { | |
| 746 gc_policy = new MarkSweepPolicy(); | |
| 747 } else if (UseConcMarkSweepGC) { | |
| 748 #ifndef SERIALGC | |
| 749 if (UseAdaptiveSizePolicy) { | |
| 750 gc_policy = new ASConcurrentMarkSweepPolicy(); | |
| 751 } else { | |
| 752 gc_policy = new ConcurrentMarkSweepPolicy(); | |
| 753 } | |
| 754 #else // SERIALGC | |
| 755 fatal("UseConcMarkSweepGC not supported in java kernel vm."); | |
| 756 #endif // SERIALGC | |
| 757 } else { // default old generation | |
| 758 gc_policy = new MarkSweepPolicy(); | |
| 759 } | |
| 760 | |
| 761 Universe::_collectedHeap = new GenCollectedHeap(gc_policy); | |
| 762 } | |
| 763 | |
| 764 jint status = Universe::heap()->initialize(); | |
| 765 if (status != JNI_OK) { | |
| 766 return status; | |
| 767 } | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
768 if (UseCompressedOops) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
769 // Subtract a page because something can get allocated at heap base. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
770 // This also makes implicit null checking work, because the |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
771 // memory+1 page below heap_base needs to cause a signal. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
772 // See needs_explicit_null_check. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
773 // Only set the heap base for compressed oops because it indicates |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
774 // compressed oops for pstack code. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
775 Universe::_heap_base = Universe::heap()->base() - os::vm_page_size(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
776 } |
| 0 | 777 |
| 778 // We will never reach the CATCH below since Exceptions::_throw will cause | |
| 779 // the VM to exit if an exception is thrown during initialization | |
| 780 | |
| 781 if (UseTLAB) { | |
| 782 assert(Universe::heap()->supports_tlab_allocation(), | |
| 783 "Should support thread-local allocation buffers"); | |
| 784 ThreadLocalAllocBuffer::startup_initialization(); | |
| 785 } | |
| 786 return JNI_OK; | |
| 787 } | |
| 788 | |
| 789 // It's the caller's repsonsibility to ensure glitch-freedom | |
| 790 // (if required). | |
| 791 void Universe::update_heap_info_at_gc() { | |
| 792 _heap_capacity_at_last_gc = heap()->capacity(); | |
| 793 _heap_used_at_last_gc = heap()->used(); | |
| 794 } | |
| 795 | |
| 796 | |
| 797 | |
| 798 void universe2_init() { | |
| 799 EXCEPTION_MARK; | |
| 800 Universe::genesis(CATCH); | |
| 801 // Although we'd like to verify here that the state of the heap | |
| 802 // is good, we can't because the main thread has not yet added | |
| 803 // itself to the threads list (so, using current interfaces | |
| 804 // we can't "fill" its TLAB), unless TLABs are disabled. | |
| 805 if (VerifyBeforeGC && !UseTLAB && | |
| 806 Universe::heap()->total_collections() >= VerifyGCStartAt) { | |
| 807 Universe::heap()->prepare_for_verify(); | |
| 808 Universe::verify(); // make sure we're starting with a clean slate | |
| 809 } | |
| 810 } | |
| 811 | |
| 812 | |
| 813 // This function is defined in JVM.cpp | |
| 814 extern void initialize_converter_functions(); | |
| 815 | |
| 816 bool universe_post_init() { | |
| 817 Universe::_fully_initialized = true; | |
| 818 EXCEPTION_MARK; | |
| 819 { ResourceMark rm; | |
| 820 Interpreter::initialize(); // needed for interpreter entry points | |
| 821 if (!UseSharedSpaces) { | |
| 822 KlassHandle ok_h(THREAD, SystemDictionary::object_klass()); | |
| 823 Universe::reinitialize_vtable_of(ok_h, CHECK_false); | |
| 824 Universe::reinitialize_itables(CHECK_false); | |
| 825 } | |
| 826 } | |
| 827 | |
| 828 klassOop k; | |
| 829 instanceKlassHandle k_h; | |
| 830 if (!UseSharedSpaces) { | |
| 831 // Setup preallocated empty java.lang.Class array | |
| 832 Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::class_klass(), 0, CHECK_false); | |
| 833 // Setup preallocated OutOfMemoryError errors | |
| 834 k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_OutOfMemoryError(), true, CHECK_false); | |
| 835 k_h = instanceKlassHandle(THREAD, k); | |
| 836 Universe::_out_of_memory_error_java_heap = k_h->allocate_permanent_instance(CHECK_false); | |
| 837 Universe::_out_of_memory_error_perm_gen = k_h->allocate_permanent_instance(CHECK_false); | |
| 838 Universe::_out_of_memory_error_array_size = k_h->allocate_permanent_instance(CHECK_false); | |
| 839 Universe::_out_of_memory_error_gc_overhead_limit = | |
| 840 k_h->allocate_permanent_instance(CHECK_false); | |
| 841 | |
| 842 // Setup preallocated NullPointerException | |
| 843 // (this is currently used for a cheap & dirty solution in compiler exception handling) | |
| 844 k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_NullPointerException(), true, CHECK_false); | |
| 845 Universe::_null_ptr_exception_instance = instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false); | |
| 846 // Setup preallocated ArithmeticException | |
| 847 // (this is currently used for a cheap & dirty solution in compiler exception handling) | |
| 848 k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_ArithmeticException(), true, CHECK_false); | |
| 849 Universe::_arithmetic_exception_instance = instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false); | |
| 850 // Virtual Machine Error for when we get into a situation we can't resolve | |
| 851 k = SystemDictionary::resolve_or_fail( | |
| 852 vmSymbolHandles::java_lang_VirtualMachineError(), true, CHECK_false); | |
| 853 bool linked = instanceKlass::cast(k)->link_class_or_fail(CHECK_false); | |
| 854 if (!linked) { | |
| 855 tty->print_cr("Unable to link/verify VirtualMachineError class"); | |
| 856 return false; // initialization failed | |
| 857 } | |
| 858 Universe::_virtual_machine_error_instance = | |
| 859 instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false); | |
| 860 } | |
| 861 if (!DumpSharedSpaces) { | |
| 862 // These are the only Java fields that are currently set during shared space dumping. | |
| 863 // We prefer to not handle this generally, so we always reinitialize these detail messages. | |
| 864 Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false); | |
| 865 java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg()); | |
| 866 | |
| 867 msg = java_lang_String::create_from_str("PermGen space", CHECK_false); | |
| 868 java_lang_Throwable::set_message(Universe::_out_of_memory_error_perm_gen, msg()); | |
| 869 | |
| 870 msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false); | |
| 871 java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg()); | |
| 872 | |
| 873 msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false); | |
| 874 java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg()); | |
| 875 | |
| 876 msg = java_lang_String::create_from_str("/ by zero", CHECK_false); | |
| 877 java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg()); | |
| 878 | |
| 879 // Setup the array of errors that have preallocated backtrace | |
| 880 k = Universe::_out_of_memory_error_java_heap->klass(); | |
| 881 assert(k->klass_part()->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error"); | |
| 882 k_h = instanceKlassHandle(THREAD, k); | |
| 883 | |
| 884 int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0; | |
| 885 Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false); | |
| 886 for (int i=0; i<len; i++) { | |
| 887 oop err = k_h->allocate_permanent_instance(CHECK_false); | |
| 888 Handle err_h = Handle(THREAD, err); | |
| 889 java_lang_Throwable::allocate_backtrace(err_h, CHECK_false); | |
| 890 Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h()); | |
| 891 } | |
| 892 Universe::_preallocated_out_of_memory_error_avail_count = (jint)len; | |
| 893 } | |
| 894 | |
| 895 | |
| 896 // Setup static method for registering finalizers | |
| 897 // The finalizer klass must be linked before looking up the method, in | |
| 898 // case it needs to get rewritten. | |
| 899 instanceKlass::cast(SystemDictionary::finalizer_klass())->link_class(CHECK_false); | |
| 900 methodOop m = instanceKlass::cast(SystemDictionary::finalizer_klass())->find_method( | |
| 901 vmSymbols::register_method_name(), | |
| 902 vmSymbols::register_method_signature()); | |
| 903 if (m == NULL || !m->is_static()) { | |
| 904 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), | |
| 905 "java.lang.ref.Finalizer.register", false); | |
| 906 } | |
| 907 Universe::_finalizer_register_cache->init( | |
| 908 SystemDictionary::finalizer_klass(), m, CHECK_false); | |
| 909 | |
| 910 // Resolve on first use and initialize class. | |
| 911 // Note: No race-condition here, since a resolve will always return the same result | |
| 912 | |
| 913 // Setup method for security checks | |
| 914 k = SystemDictionary::resolve_or_fail(vmSymbolHandles::java_lang_reflect_Method(), true, CHECK_false); | |
| 915 k_h = instanceKlassHandle(THREAD, k); | |
| 916 k_h->link_class(CHECK_false); | |
| 917 m = k_h->find_method(vmSymbols::invoke_name(), vmSymbols::object_array_object_object_signature()); | |
| 918 if (m == NULL || m->is_static()) { | |
| 919 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), | |
| 920 "java.lang.reflect.Method.invoke", false); | |
| 921 } | |
| 922 Universe::_reflect_invoke_cache->init(k_h(), m, CHECK_false); | |
| 923 | |
| 924 // Setup method for registering loaded classes in class loader vector | |
| 925 instanceKlass::cast(SystemDictionary::classloader_klass())->link_class(CHECK_false); | |
| 926 m = instanceKlass::cast(SystemDictionary::classloader_klass())->find_method(vmSymbols::addClass_name(), vmSymbols::class_void_signature()); | |
| 927 if (m == NULL || m->is_static()) { | |
| 928 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(), | |
| 929 "java.lang.ClassLoader.addClass", false); | |
| 930 } | |
| 931 Universe::_loader_addClass_cache->init( | |
| 932 SystemDictionary::classloader_klass(), m, CHECK_false); | |
| 933 | |
| 934 // The folowing is initializing converter functions for serialization in | |
| 935 // JVM.cpp. If we clean up the StrictMath code above we may want to find | |
| 936 // a better solution for this as well. | |
| 937 initialize_converter_functions(); | |
| 938 | |
| 939 // This needs to be done before the first scavenge/gc, since | |
| 940 // it's an input to soft ref clearing policy. | |
| 941 Universe::update_heap_info_at_gc(); | |
| 942 | |
| 943 // ("weak") refs processing infrastructure initialization | |
| 944 Universe::heap()->post_initialize(); | |
| 945 | |
| 946 GC_locker::unlock(); // allow gc after bootstrapping | |
| 947 | |
| 948 MemoryService::set_universe_heap(Universe::_collectedHeap); | |
| 949 return true; | |
| 950 } | |
| 951 | |
| 952 | |
| 953 void Universe::compute_base_vtable_size() { | |
| 954 _base_vtable_size = ClassLoader::compute_Object_vtable(); | |
| 955 } | |
| 956 | |
| 957 | |
| 958 // %%% The Universe::flush_foo methods belong in CodeCache. | |
| 959 | |
| 960 // Flushes compiled methods dependent on dependee. | |
| 961 void Universe::flush_dependents_on(instanceKlassHandle dependee) { | |
| 962 assert_lock_strong(Compile_lock); | |
| 963 | |
| 964 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return; | |
| 965 | |
| 966 // CodeCache can only be updated by a thread_in_VM and they will all be | |
| 967 // stopped dring the safepoint so CodeCache will be safe to update without | |
| 968 // holding the CodeCache_lock. | |
| 969 | |
| 970 DepChange changes(dependee); | |
| 971 | |
| 972 // Compute the dependent nmethods | |
| 973 if (CodeCache::mark_for_deoptimization(changes) > 0) { | |
| 974 // At least one nmethod has been marked for deoptimization | |
| 975 VM_Deoptimize op; | |
| 976 VMThread::execute(&op); | |
| 977 } | |
| 978 } | |
| 979 | |
| 980 #ifdef HOTSWAP | |
| 981 // Flushes compiled methods dependent on dependee in the evolutionary sense | |
| 982 void Universe::flush_evol_dependents_on(instanceKlassHandle ev_k_h) { | |
| 983 // --- Compile_lock is not held. However we are at a safepoint. | |
| 984 assert_locked_or_safepoint(Compile_lock); | |
| 985 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return; | |
| 986 | |
| 987 // CodeCache can only be updated by a thread_in_VM and they will all be | |
| 988 // stopped dring the safepoint so CodeCache will be safe to update without | |
| 989 // holding the CodeCache_lock. | |
| 990 | |
| 991 // Compute the dependent nmethods | |
| 992 if (CodeCache::mark_for_evol_deoptimization(ev_k_h) > 0) { | |
| 993 // At least one nmethod has been marked for deoptimization | |
| 994 | |
| 995 // All this already happens inside a VM_Operation, so we'll do all the work here. | |
| 996 // Stuff copied from VM_Deoptimize and modified slightly. | |
| 997 | |
| 998 // We do not want any GCs to happen while we are in the middle of this VM operation | |
| 999 ResourceMark rm; | |
| 1000 DeoptimizationMarker dm; | |
| 1001 | |
| 1002 // Deoptimize all activations depending on marked nmethods | |
| 1003 Deoptimization::deoptimize_dependents(); | |
| 1004 | |
| 1005 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies) | |
| 1006 CodeCache::make_marked_nmethods_not_entrant(); | |
| 1007 } | |
| 1008 } | |
| 1009 #endif // HOTSWAP | |
| 1010 | |
| 1011 | |
| 1012 // Flushes compiled methods dependent on dependee | |
| 1013 void Universe::flush_dependents_on_method(methodHandle m_h) { | |
| 1014 // --- Compile_lock is not held. However we are at a safepoint. | |
| 1015 assert_locked_or_safepoint(Compile_lock); | |
| 1016 | |
| 1017 // CodeCache can only be updated by a thread_in_VM and they will all be | |
| 1018 // stopped dring the safepoint so CodeCache will be safe to update without | |
| 1019 // holding the CodeCache_lock. | |
| 1020 | |
| 1021 // Compute the dependent nmethods | |
| 1022 if (CodeCache::mark_for_deoptimization(m_h()) > 0) { | |
| 1023 // At least one nmethod has been marked for deoptimization | |
| 1024 | |
| 1025 // All this already happens inside a VM_Operation, so we'll do all the work here. | |
| 1026 // Stuff copied from VM_Deoptimize and modified slightly. | |
| 1027 | |
| 1028 // We do not want any GCs to happen while we are in the middle of this VM operation | |
| 1029 ResourceMark rm; | |
| 1030 DeoptimizationMarker dm; | |
| 1031 | |
| 1032 // Deoptimize all activations depending on marked nmethods | |
| 1033 Deoptimization::deoptimize_dependents(); | |
| 1034 | |
| 1035 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies) | |
| 1036 CodeCache::make_marked_nmethods_not_entrant(); | |
| 1037 } | |
| 1038 } | |
| 1039 | |
| 1040 void Universe::print() { print_on(gclog_or_tty); } | |
| 1041 | |
| 1042 void Universe::print_on(outputStream* st) { | |
| 1043 st->print_cr("Heap"); | |
| 1044 heap()->print_on(st); | |
| 1045 } | |
| 1046 | |
| 1047 void Universe::print_heap_at_SIGBREAK() { | |
| 1048 if (PrintHeapAtSIGBREAK) { | |
| 1049 MutexLocker hl(Heap_lock); | |
| 1050 print_on(tty); | |
| 1051 tty->cr(); | |
| 1052 tty->flush(); | |
| 1053 } | |
| 1054 } | |
| 1055 | |
| 1056 void Universe::print_heap_before_gc(outputStream* st) { | |
| 1057 st->print_cr("{Heap before GC invocations=%u (full %u):", | |
| 1058 heap()->total_collections(), | |
| 1059 heap()->total_full_collections()); | |
| 1060 heap()->print_on(st); | |
| 1061 } | |
| 1062 | |
| 1063 void Universe::print_heap_after_gc(outputStream* st) { | |
| 1064 st->print_cr("Heap after GC invocations=%u (full %u):", | |
| 1065 heap()->total_collections(), | |
| 1066 heap()->total_full_collections()); | |
| 1067 heap()->print_on(st); | |
| 1068 st->print_cr("}"); | |
| 1069 } | |
| 1070 | |
| 1071 void Universe::verify(bool allow_dirty, bool silent) { | |
| 1072 if (SharedSkipVerify) { | |
| 1073 return; | |
| 1074 } | |
| 1075 | |
| 1076 // The use of _verify_in_progress is a temporary work around for | |
| 1077 // 6320749. Don't bother with a creating a class to set and clear | |
| 1078 // it since it is only used in this method and the control flow is | |
| 1079 // straight forward. | |
| 1080 _verify_in_progress = true; | |
| 1081 | |
| 1082 COMPILER2_PRESENT( | |
| 1083 assert(!DerivedPointerTable::is_active(), | |
| 1084 "DPT should not be active during verification " | |
| 1085 "(of thread stacks below)"); | |
| 1086 ) | |
| 1087 | |
| 1088 ResourceMark rm; | |
| 1089 HandleMark hm; // Handles created during verification can be zapped | |
| 1090 _verify_count++; | |
| 1091 | |
| 1092 if (!silent) gclog_or_tty->print("[Verifying "); | |
| 1093 if (!silent) gclog_or_tty->print("threads "); | |
| 1094 Threads::verify(); | |
| 1095 heap()->verify(allow_dirty, silent); | |
| 1096 | |
| 1097 if (!silent) gclog_or_tty->print("syms "); | |
| 1098 SymbolTable::verify(); | |
| 1099 if (!silent) gclog_or_tty->print("strs "); | |
| 1100 StringTable::verify(); | |
| 1101 { | |
| 1102 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); | |
| 1103 if (!silent) gclog_or_tty->print("zone "); | |
| 1104 CodeCache::verify(); | |
| 1105 } | |
| 1106 if (!silent) gclog_or_tty->print("dict "); | |
| 1107 SystemDictionary::verify(); | |
| 1108 if (!silent) gclog_or_tty->print("hand "); | |
| 1109 JNIHandles::verify(); | |
| 1110 if (!silent) gclog_or_tty->print("C-heap "); | |
| 1111 os::check_heap(); | |
| 1112 if (!silent) gclog_or_tty->print_cr("]"); | |
| 1113 | |
| 1114 _verify_in_progress = false; | |
| 1115 } | |
| 1116 | |
| 1117 // Oop verification (see MacroAssembler::verify_oop) | |
| 1118 | |
| 1119 static uintptr_t _verify_oop_data[2] = {0, (uintptr_t)-1}; | |
| 1120 static uintptr_t _verify_klass_data[2] = {0, (uintptr_t)-1}; | |
| 1121 | |
| 1122 | |
| 1123 static void calculate_verify_data(uintptr_t verify_data[2], | |
| 1124 HeapWord* low_boundary, | |
| 1125 HeapWord* high_boundary) { | |
| 1126 assert(low_boundary < high_boundary, "bad interval"); | |
| 1127 | |
| 1128 // decide which low-order bits we require to be clear: | |
| 1129 size_t alignSize = MinObjAlignmentInBytes; | |
| 1130 size_t min_object_size = oopDesc::header_size(); | |
| 1131 | |
| 1132 // make an inclusive limit: | |
| 1133 uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize; | |
| 1134 uintptr_t min = (uintptr_t)low_boundary; | |
| 1135 assert(min < max, "bad interval"); | |
| 1136 uintptr_t diff = max ^ min; | |
| 1137 | |
| 1138 // throw away enough low-order bits to make the diff vanish | |
| 1139 uintptr_t mask = (uintptr_t)(-1); | |
| 1140 while ((mask & diff) != 0) | |
| 1141 mask <<= 1; | |
| 1142 uintptr_t bits = (min & mask); | |
| 1143 assert(bits == (max & mask), "correct mask"); | |
| 1144 // check an intermediate value between min and max, just to make sure: | |
| 1145 assert(bits == ((min + (max-min)/2) & mask), "correct mask"); | |
| 1146 | |
| 1147 // require address alignment, too: | |
| 1148 mask |= (alignSize - 1); | |
| 1149 | |
| 1150 if (!(verify_data[0] == 0 && verify_data[1] == (uintptr_t)-1)) { | |
| 1151 assert(verify_data[0] == mask && verify_data[1] == bits, "mask stability"); | |
| 1152 } | |
| 1153 verify_data[0] = mask; | |
| 1154 verify_data[1] = bits; | |
| 1155 } | |
| 1156 | |
| 1157 | |
| 1158 // Oop verification (see MacroAssembler::verify_oop) | |
| 1159 #ifndef PRODUCT | |
| 1160 | |
| 1161 uintptr_t Universe::verify_oop_mask() { | |
| 1162 MemRegion m = heap()->reserved_region(); | |
| 1163 calculate_verify_data(_verify_oop_data, | |
| 1164 m.start(), | |
| 1165 m.end()); | |
| 1166 return _verify_oop_data[0]; | |
| 1167 } | |
| 1168 | |
| 1169 | |
| 1170 | |
| 1171 uintptr_t Universe::verify_oop_bits() { | |
| 1172 verify_oop_mask(); | |
| 1173 return _verify_oop_data[1]; | |
| 1174 } | |
| 1175 | |
| 1176 | |
| 1177 uintptr_t Universe::verify_klass_mask() { | |
| 1178 /* $$$ | |
| 1179 // A klass can never live in the new space. Since the new and old | |
| 1180 // spaces can change size, we must settle for bounds-checking against | |
| 1181 // the bottom of the world, plus the smallest possible new and old | |
| 1182 // space sizes that may arise during execution. | |
| 1183 size_t min_new_size = Universe::new_size(); // in bytes | |
| 1184 size_t min_old_size = Universe::old_size(); // in bytes | |
| 1185 calculate_verify_data(_verify_klass_data, | |
| 1186 (HeapWord*)((uintptr_t)_new_gen->low_boundary + min_new_size + min_old_size), | |
| 1187 _perm_gen->high_boundary); | |
| 1188 */ | |
| 1189 // Why doesn't the above just say that klass's always live in the perm | |
| 1190 // gen? I'll see if that seems to work... | |
| 1191 MemRegion permanent_reserved; | |
| 1192 switch (Universe::heap()->kind()) { | |
| 1193 default: | |
| 1194 // ???: What if a CollectedHeap doesn't have a permanent generation? | |
| 1195 ShouldNotReachHere(); | |
| 1196 break; | |
| 1197 case CollectedHeap::GenCollectedHeap: { | |
| 1198 GenCollectedHeap* gch = (GenCollectedHeap*) Universe::heap(); | |
| 1199 permanent_reserved = gch->perm_gen()->reserved(); | |
| 1200 break; | |
| 1201 } | |
| 1202 #ifndef SERIALGC | |
| 1203 case CollectedHeap::ParallelScavengeHeap: { | |
| 1204 ParallelScavengeHeap* psh = (ParallelScavengeHeap*) Universe::heap(); | |
| 1205 permanent_reserved = psh->perm_gen()->reserved(); | |
| 1206 break; | |
| 1207 } | |
| 1208 #endif // SERIALGC | |
| 1209 } | |
| 1210 calculate_verify_data(_verify_klass_data, | |
| 1211 permanent_reserved.start(), | |
| 1212 permanent_reserved.end()); | |
| 1213 | |
| 1214 return _verify_klass_data[0]; | |
| 1215 } | |
| 1216 | |
| 1217 | |
| 1218 | |
| 1219 uintptr_t Universe::verify_klass_bits() { | |
| 1220 verify_klass_mask(); | |
| 1221 return _verify_klass_data[1]; | |
| 1222 } | |
| 1223 | |
| 1224 | |
| 1225 uintptr_t Universe::verify_mark_mask() { | |
| 1226 return markOopDesc::lock_mask_in_place; | |
| 1227 } | |
| 1228 | |
| 1229 | |
| 1230 | |
| 1231 uintptr_t Universe::verify_mark_bits() { | |
| 1232 intptr_t mask = verify_mark_mask(); | |
| 1233 intptr_t bits = (intptr_t)markOopDesc::prototype(); | |
| 1234 assert((bits & ~mask) == 0, "no stray header bits"); | |
| 1235 return bits; | |
| 1236 } | |
| 1237 #endif // PRODUCT | |
| 1238 | |
| 1239 | |
| 1240 void Universe::compute_verify_oop_data() { | |
| 1241 verify_oop_mask(); | |
| 1242 verify_oop_bits(); | |
| 1243 verify_mark_mask(); | |
| 1244 verify_mark_bits(); | |
| 1245 verify_klass_mask(); | |
| 1246 verify_klass_bits(); | |
| 1247 } | |
| 1248 | |
| 1249 | |
| 1250 void CommonMethodOopCache::init(klassOop k, methodOop m, TRAPS) { | |
| 1251 if (!UseSharedSpaces) { | |
| 1252 _klass = k; | |
| 1253 } | |
| 1254 #ifndef PRODUCT | |
| 1255 else { | |
| 1256 // sharing initilization should have already set up _klass | |
| 1257 assert(_klass != NULL, "just checking"); | |
| 1258 } | |
| 1259 #endif | |
| 1260 | |
| 1261 _method_idnum = m->method_idnum(); | |
| 1262 assert(_method_idnum >= 0, "sanity check"); | |
| 1263 } | |
| 1264 | |
| 1265 | |
| 1266 ActiveMethodOopsCache::~ActiveMethodOopsCache() { | |
| 1267 if (_prev_methods != NULL) { | |
| 1268 for (int i = _prev_methods->length() - 1; i >= 0; i--) { | |
| 1269 jweak method_ref = _prev_methods->at(i); | |
| 1270 if (method_ref != NULL) { | |
| 1271 JNIHandles::destroy_weak_global(method_ref); | |
| 1272 } | |
| 1273 } | |
| 1274 delete _prev_methods; | |
| 1275 _prev_methods = NULL; | |
| 1276 } | |
| 1277 } | |
| 1278 | |
| 1279 | |
| 1280 void ActiveMethodOopsCache::add_previous_version(const methodOop method) { | |
| 1281 assert(Thread::current()->is_VM_thread(), | |
| 1282 "only VMThread can add previous versions"); | |
| 1283 | |
| 1284 if (_prev_methods == NULL) { | |
| 1285 // This is the first previous version so make some space. | |
| 1286 // Start with 2 elements under the assumption that the class | |
| 1287 // won't be redefined much. | |
| 1288 _prev_methods = new (ResourceObj::C_HEAP) GrowableArray<jweak>(2, true); | |
| 1289 } | |
| 1290 | |
| 1291 // RC_TRACE macro has an embedded ResourceMark | |
| 1292 RC_TRACE(0x00000100, | |
| 1293 ("add: %s(%s): adding prev version ref for cached method @%d", | |
| 1294 method->name()->as_C_string(), method->signature()->as_C_string(), | |
| 1295 _prev_methods->length())); | |
| 1296 | |
| 1297 methodHandle method_h(method); | |
| 1298 jweak method_ref = JNIHandles::make_weak_global(method_h); | |
| 1299 _prev_methods->append(method_ref); | |
| 1300 | |
| 1301 // Using weak references allows previous versions of the cached | |
| 1302 // method to be GC'ed when they are no longer needed. Since the | |
| 1303 // caller is the VMThread and we are at a safepoint, this is a good | |
| 1304 // time to clear out unused weak references. | |
| 1305 | |
| 1306 for (int i = _prev_methods->length() - 1; i >= 0; i--) { | |
| 1307 jweak method_ref = _prev_methods->at(i); | |
| 1308 assert(method_ref != NULL, "weak method ref was unexpectedly cleared"); | |
| 1309 if (method_ref == NULL) { | |
| 1310 _prev_methods->remove_at(i); | |
| 1311 // Since we are traversing the array backwards, we don't have to | |
| 1312 // do anything special with the index. | |
| 1313 continue; // robustness | |
| 1314 } | |
| 1315 | |
| 1316 methodOop m = (methodOop)JNIHandles::resolve(method_ref); | |
| 1317 if (m == NULL) { | |
| 1318 // this method entry has been GC'ed so remove it | |
| 1319 JNIHandles::destroy_weak_global(method_ref); | |
| 1320 _prev_methods->remove_at(i); | |
| 1321 } else { | |
| 1322 // RC_TRACE macro has an embedded ResourceMark | |
| 1323 RC_TRACE(0x00000400, ("add: %s(%s): previous cached method @%d is alive", | |
| 1324 m->name()->as_C_string(), m->signature()->as_C_string(), i)); | |
| 1325 } | |
| 1326 } | |
| 1327 } // end add_previous_version() | |
| 1328 | |
| 1329 | |
| 1330 bool ActiveMethodOopsCache::is_same_method(const methodOop method) const { | |
| 1331 instanceKlass* ik = instanceKlass::cast(klass()); | |
| 1332 methodOop check_method = ik->method_with_idnum(method_idnum()); | |
| 1333 assert(check_method != NULL, "sanity check"); | |
| 1334 if (check_method == method) { | |
| 1335 // done with the easy case | |
| 1336 return true; | |
| 1337 } | |
| 1338 | |
| 1339 if (_prev_methods != NULL) { | |
| 1340 // The cached method has been redefined at least once so search | |
| 1341 // the previous versions for a match. | |
| 1342 for (int i = 0; i < _prev_methods->length(); i++) { | |
| 1343 jweak method_ref = _prev_methods->at(i); | |
| 1344 assert(method_ref != NULL, "weak method ref was unexpectedly cleared"); | |
| 1345 if (method_ref == NULL) { | |
| 1346 continue; // robustness | |
| 1347 } | |
| 1348 | |
| 1349 check_method = (methodOop)JNIHandles::resolve(method_ref); | |
| 1350 if (check_method == method) { | |
| 1351 // a previous version matches | |
| 1352 return true; | |
| 1353 } | |
| 1354 } | |
| 1355 } | |
| 1356 | |
| 1357 // either no previous versions or no previous version matched | |
| 1358 return false; | |
| 1359 } | |
| 1360 | |
| 1361 | |
| 1362 methodOop LatestMethodOopCache::get_methodOop() { | |
| 1363 instanceKlass* ik = instanceKlass::cast(klass()); | |
| 1364 methodOop m = ik->method_with_idnum(method_idnum()); | |
| 1365 assert(m != NULL, "sanity check"); | |
| 1366 return m; | |
| 1367 } | |
| 1368 | |
| 1369 | |
| 1370 #ifdef ASSERT | |
| 1371 // Release dummy object(s) at bottom of heap | |
| 1372 bool Universe::release_fullgc_alot_dummy() { | |
| 1373 MutexLocker ml(FullGCALot_lock); | |
| 1374 if (_fullgc_alot_dummy_array != NULL) { | |
| 1375 if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) { | |
| 1376 // No more dummies to release, release entire array instead | |
| 1377 _fullgc_alot_dummy_array = NULL; | |
| 1378 return false; | |
| 1379 } | |
| 1380 if (!UseConcMarkSweepGC) { | |
| 1381 // Release dummy at bottom of old generation | |
| 1382 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL); | |
| 1383 } | |
| 1384 // Release dummy at bottom of permanent generation | |
| 1385 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL); | |
| 1386 } | |
| 1387 return true; | |
| 1388 } | |
| 1389 | |
| 1390 #endif // ASSERT |