Print this page
Split |
Split |
Close |
Expand all |
Collapse all |
--- old/src/share/vm/memory/universe.cpp
+++ new/src/share/vm/memory/universe.cpp
1 1 /*
2 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #include "precompiled.hpp"
26 26 #include "classfile/classLoader.hpp"
27 27 #include "classfile/javaClasses.hpp"
28 28 #include "classfile/symbolTable.hpp"
29 29 #include "classfile/systemDictionary.hpp"
30 30 #include "classfile/vmSymbols.hpp"
31 31 #include "code/codeCache.hpp"
32 32 #include "code/dependencies.hpp"
33 33 #include "gc_interface/collectedHeap.inline.hpp"
34 34 #include "interpreter/interpreter.hpp"
35 35 #include "memory/cardTableModRefBS.hpp"
36 36 #include "memory/filemap.hpp"
37 37 #include "memory/gcLocker.inline.hpp"
38 38 #include "memory/genCollectedHeap.hpp"
39 39 #include "memory/genRemSet.hpp"
40 40 #include "memory/generation.hpp"
41 41 #include "memory/oopFactory.hpp"
42 42 #include "memory/permGen.hpp"
43 43 #include "memory/space.hpp"
44 44 #include "memory/universe.hpp"
45 45 #include "memory/universe.inline.hpp"
46 46 #include "oops/arrayKlassKlass.hpp"
47 47 #include "oops/compiledICHolderKlass.hpp"
48 48 #include "oops/constMethodKlass.hpp"
49 49 #include "oops/constantPoolKlass.hpp"
50 50 #include "oops/constantPoolOop.hpp"
51 51 #include "oops/cpCacheKlass.hpp"
52 52 #include "oops/cpCacheOop.hpp"
53 53 #include "oops/instanceKlass.hpp"
54 54 #include "oops/instanceMirrorKlass.hpp"
55 55 #include "oops/instanceKlassKlass.hpp"
56 56 #include "oops/instanceRefKlass.hpp"
57 57 #include "oops/klassKlass.hpp"
58 58 #include "oops/klassOop.hpp"
59 59 #include "oops/methodDataKlass.hpp"
60 60 #include "oops/methodKlass.hpp"
61 61 #include "oops/objArrayKlassKlass.hpp"
62 62 #include "oops/oop.inline.hpp"
63 63 #include "oops/typeArrayKlass.hpp"
64 64 #include "oops/typeArrayKlassKlass.hpp"
65 65 #include "prims/jvmtiRedefineClassesTrace.hpp"
66 66 #include "runtime/aprofiler.hpp"
67 67 #include "runtime/arguments.hpp"
68 68 #include "runtime/deoptimization.hpp"
69 69 #include "runtime/fprofiler.hpp"
70 70 #include "runtime/handles.inline.hpp"
71 71 #include "runtime/init.hpp"
72 72 #include "runtime/java.hpp"
73 73 #include "runtime/javaCalls.hpp"
74 74 #include "runtime/sharedRuntime.hpp"
75 75 #include "runtime/synchronizer.hpp"
76 76 #include "runtime/timer.hpp"
77 77 #include "runtime/vm_operations.hpp"
78 78 #include "services/memoryService.hpp"
79 79 #include "utilities/copy.hpp"
80 80 #include "utilities/events.hpp"
81 81 #include "utilities/hashtable.inline.hpp"
82 82 #include "utilities/preserveException.hpp"
83 83 #ifdef TARGET_OS_FAMILY_linux
84 84 # include "thread_linux.inline.hpp"
85 85 #endif
86 86 #ifdef TARGET_OS_FAMILY_solaris
87 87 # include "thread_solaris.inline.hpp"
88 88 #endif
89 89 #ifdef TARGET_OS_FAMILY_windows
90 90 # include "thread_windows.inline.hpp"
91 91 #endif
92 92 #ifdef TARGET_OS_FAMILY_bsd
93 93 # include "thread_bsd.inline.hpp"
94 94 #endif
95 95 #ifndef SERIALGC
96 96 #include "gc_implementation/concurrentMarkSweep/cmsAdaptiveSizePolicy.hpp"
97 97 #include "gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.hpp"
98 98 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
99 99 #include "gc_implementation/g1/g1CollectorPolicy.hpp"
100 100 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
101 101 #endif
102 102
103 103 // Known objects
104 104 klassOop Universe::_boolArrayKlassObj = NULL;
105 105 klassOop Universe::_byteArrayKlassObj = NULL;
106 106 klassOop Universe::_charArrayKlassObj = NULL;
107 107 klassOop Universe::_intArrayKlassObj = NULL;
108 108 klassOop Universe::_shortArrayKlassObj = NULL;
109 109 klassOop Universe::_longArrayKlassObj = NULL;
110 110 klassOop Universe::_singleArrayKlassObj = NULL;
111 111 klassOop Universe::_doubleArrayKlassObj = NULL;
112 112 klassOop Universe::_typeArrayKlassObjs[T_VOID+1] = { NULL /*, NULL...*/ };
113 113 klassOop Universe::_objectArrayKlassObj = NULL;
114 114 klassOop Universe::_methodKlassObj = NULL;
115 115 klassOop Universe::_constMethodKlassObj = NULL;
116 116 klassOop Universe::_methodDataKlassObj = NULL;
117 117 klassOop Universe::_klassKlassObj = NULL;
118 118 klassOop Universe::_arrayKlassKlassObj = NULL;
119 119 klassOop Universe::_objArrayKlassKlassObj = NULL;
120 120 klassOop Universe::_typeArrayKlassKlassObj = NULL;
121 121 klassOop Universe::_instanceKlassKlassObj = NULL;
122 122 klassOop Universe::_constantPoolKlassObj = NULL;
123 123 klassOop Universe::_constantPoolCacheKlassObj = NULL;
124 124 klassOop Universe::_compiledICHolderKlassObj = NULL;
125 125 klassOop Universe::_systemObjArrayKlassObj = NULL;
126 126 oop Universe::_int_mirror = NULL;
127 127 oop Universe::_float_mirror = NULL;
128 128 oop Universe::_double_mirror = NULL;
129 129 oop Universe::_byte_mirror = NULL;
130 130 oop Universe::_bool_mirror = NULL;
131 131 oop Universe::_char_mirror = NULL;
132 132 oop Universe::_long_mirror = NULL;
133 133 oop Universe::_short_mirror = NULL;
134 134 oop Universe::_void_mirror = NULL;
135 135 oop Universe::_mirrors[T_VOID+1] = { NULL /*, NULL...*/ };
136 136 oop Universe::_main_thread_group = NULL;
137 137 oop Universe::_system_thread_group = NULL;
138 138 typeArrayOop Universe::_the_empty_byte_array = NULL;
139 139 typeArrayOop Universe::_the_empty_short_array = NULL;
140 140 typeArrayOop Universe::_the_empty_int_array = NULL;
141 141 objArrayOop Universe::_the_empty_system_obj_array = NULL;
142 142 objArrayOop Universe::_the_empty_class_klass_array = NULL;
143 143 objArrayOop Universe::_the_array_interfaces_array = NULL;
144 144 oop Universe::_the_null_string = NULL;
145 145 oop Universe::_the_min_jint_string = NULL;
146 146 LatestMethodOopCache* Universe::_finalizer_register_cache = NULL;
147 147 LatestMethodOopCache* Universe::_loader_addClass_cache = NULL;
148 148 ActiveMethodOopsCache* Universe::_reflect_invoke_cache = NULL;
149 149 oop Universe::_out_of_memory_error_java_heap = NULL;
150 150 oop Universe::_out_of_memory_error_perm_gen = NULL;
151 151 oop Universe::_out_of_memory_error_array_size = NULL;
152 152 oop Universe::_out_of_memory_error_gc_overhead_limit = NULL;
153 153 objArrayOop Universe::_preallocated_out_of_memory_error_array = NULL;
154 154 volatile jint Universe::_preallocated_out_of_memory_error_avail_count = 0;
155 155 bool Universe::_verify_in_progress = false;
156 156 oop Universe::_null_ptr_exception_instance = NULL;
157 157 oop Universe::_arithmetic_exception_instance = NULL;
158 158 oop Universe::_virtual_machine_error_instance = NULL;
159 159 oop Universe::_vm_exception = NULL;
160 160
161 161 // These variables are guarded by FullGCALot_lock.
162 162 debug_only(objArrayOop Universe::_fullgc_alot_dummy_array = NULL;)
163 163 debug_only(int Universe::_fullgc_alot_dummy_next = 0;)
164 164
165 165
166 166 // Heap
167 167 int Universe::_verify_count = 0;
168 168
169 169 int Universe::_base_vtable_size = 0;
170 170 bool Universe::_bootstrapping = false;
171 171 bool Universe::_fully_initialized = false;
172 172
173 173 size_t Universe::_heap_capacity_at_last_gc;
174 174 size_t Universe::_heap_used_at_last_gc = 0;
175 175
176 176 CollectedHeap* Universe::_collectedHeap = NULL;
177 177
178 178 NarrowOopStruct Universe::_narrow_oop = { NULL, 0, true };
179 179
180 180
181 181 void Universe::basic_type_classes_do(void f(klassOop)) {
182 182 f(boolArrayKlassObj());
183 183 f(byteArrayKlassObj());
184 184 f(charArrayKlassObj());
185 185 f(intArrayKlassObj());
186 186 f(shortArrayKlassObj());
187 187 f(longArrayKlassObj());
188 188 f(singleArrayKlassObj());
189 189 f(doubleArrayKlassObj());
190 190 }
191 191
192 192
193 193 void Universe::system_classes_do(void f(klassOop)) {
194 194 f(methodKlassObj());
195 195 f(constMethodKlassObj());
196 196 f(methodDataKlassObj());
197 197 f(klassKlassObj());
198 198 f(arrayKlassKlassObj());
199 199 f(objArrayKlassKlassObj());
200 200 f(typeArrayKlassKlassObj());
201 201 f(instanceKlassKlassObj());
202 202 f(constantPoolKlassObj());
203 203 f(systemObjArrayKlassObj());
204 204 }
205 205
206 206 void Universe::oops_do(OopClosure* f, bool do_all) {
207 207
208 208 f->do_oop((oop*) &_int_mirror);
209 209 f->do_oop((oop*) &_float_mirror);
210 210 f->do_oop((oop*) &_double_mirror);
211 211 f->do_oop((oop*) &_byte_mirror);
212 212 f->do_oop((oop*) &_bool_mirror);
213 213 f->do_oop((oop*) &_char_mirror);
214 214 f->do_oop((oop*) &_long_mirror);
215 215 f->do_oop((oop*) &_short_mirror);
216 216 f->do_oop((oop*) &_void_mirror);
217 217
218 218 // It's important to iterate over these guys even if they are null,
219 219 // since that's how shared heaps are restored.
220 220 for (int i = T_BOOLEAN; i < T_VOID+1; i++) {
221 221 f->do_oop((oop*) &_mirrors[i]);
222 222 }
223 223 assert(_mirrors[0] == NULL && _mirrors[T_BOOLEAN - 1] == NULL, "checking");
224 224
225 225 // %%% Consider moving those "shared oops" over here with the others.
226 226 f->do_oop((oop*)&_boolArrayKlassObj);
227 227 f->do_oop((oop*)&_byteArrayKlassObj);
228 228 f->do_oop((oop*)&_charArrayKlassObj);
229 229 f->do_oop((oop*)&_intArrayKlassObj);
230 230 f->do_oop((oop*)&_shortArrayKlassObj);
231 231 f->do_oop((oop*)&_longArrayKlassObj);
232 232 f->do_oop((oop*)&_singleArrayKlassObj);
233 233 f->do_oop((oop*)&_doubleArrayKlassObj);
234 234 f->do_oop((oop*)&_objectArrayKlassObj);
235 235 {
236 236 for (int i = 0; i < T_VOID+1; i++) {
237 237 if (_typeArrayKlassObjs[i] != NULL) {
238 238 assert(i >= T_BOOLEAN, "checking");
239 239 f->do_oop((oop*)&_typeArrayKlassObjs[i]);
240 240 } else if (do_all) {
241 241 f->do_oop((oop*)&_typeArrayKlassObjs[i]);
242 242 }
243 243 }
244 244 }
245 245 f->do_oop((oop*)&_methodKlassObj);
246 246 f->do_oop((oop*)&_constMethodKlassObj);
247 247 f->do_oop((oop*)&_methodDataKlassObj);
248 248 f->do_oop((oop*)&_klassKlassObj);
249 249 f->do_oop((oop*)&_arrayKlassKlassObj);
250 250 f->do_oop((oop*)&_objArrayKlassKlassObj);
251 251 f->do_oop((oop*)&_typeArrayKlassKlassObj);
252 252 f->do_oop((oop*)&_instanceKlassKlassObj);
253 253 f->do_oop((oop*)&_constantPoolKlassObj);
254 254 f->do_oop((oop*)&_constantPoolCacheKlassObj);
255 255 f->do_oop((oop*)&_compiledICHolderKlassObj);
256 256 f->do_oop((oop*)&_systemObjArrayKlassObj);
257 257 f->do_oop((oop*)&_the_empty_byte_array);
258 258 f->do_oop((oop*)&_the_empty_short_array);
259 259 f->do_oop((oop*)&_the_empty_int_array);
260 260 f->do_oop((oop*)&_the_empty_system_obj_array);
261 261 f->do_oop((oop*)&_the_empty_class_klass_array);
262 262 f->do_oop((oop*)&_the_array_interfaces_array);
263 263 f->do_oop((oop*)&_the_null_string);
264 264 f->do_oop((oop*)&_the_min_jint_string);
265 265 _finalizer_register_cache->oops_do(f);
266 266 _loader_addClass_cache->oops_do(f);
267 267 _reflect_invoke_cache->oops_do(f);
268 268 f->do_oop((oop*)&_out_of_memory_error_java_heap);
269 269 f->do_oop((oop*)&_out_of_memory_error_perm_gen);
270 270 f->do_oop((oop*)&_out_of_memory_error_array_size);
271 271 f->do_oop((oop*)&_out_of_memory_error_gc_overhead_limit);
272 272 if (_preallocated_out_of_memory_error_array != (oop)NULL) { // NULL when DumpSharedSpaces
273 273 f->do_oop((oop*)&_preallocated_out_of_memory_error_array);
274 274 }
275 275 f->do_oop((oop*)&_null_ptr_exception_instance);
276 276 f->do_oop((oop*)&_arithmetic_exception_instance);
277 277 f->do_oop((oop*)&_virtual_machine_error_instance);
278 278 f->do_oop((oop*)&_main_thread_group);
279 279 f->do_oop((oop*)&_system_thread_group);
280 280 f->do_oop((oop*)&_vm_exception);
281 281 debug_only(f->do_oop((oop*)&_fullgc_alot_dummy_array);)
282 282 }
283 283
284 284
285 285 void Universe::check_alignment(uintx size, uintx alignment, const char* name) {
286 286 if (size < alignment || size % alignment != 0) {
287 287 ResourceMark rm;
288 288 stringStream st;
289 289 st.print("Size of %s (%ld bytes) must be aligned to %ld bytes", name, size, alignment);
290 290 char* error = st.as_string();
291 291 vm_exit_during_initialization(error);
292 292 }
293 293 }
294 294
295 295
296 296 void Universe::genesis(TRAPS) {
297 297 ResourceMark rm;
298 298 { FlagSetting fs(_bootstrapping, true);
299 299
300 300 { MutexLocker mc(Compile_lock);
301 301
302 302 // determine base vtable size; without that we cannot create the array klasses
303 303 compute_base_vtable_size();
304 304
305 305 if (!UseSharedSpaces) {
306 306 _klassKlassObj = klassKlass::create_klass(CHECK);
307 307 _arrayKlassKlassObj = arrayKlassKlass::create_klass(CHECK);
308 308
309 309 _objArrayKlassKlassObj = objArrayKlassKlass::create_klass(CHECK);
310 310 _instanceKlassKlassObj = instanceKlassKlass::create_klass(CHECK);
311 311 _typeArrayKlassKlassObj = typeArrayKlassKlass::create_klass(CHECK);
312 312
313 313 _boolArrayKlassObj = typeArrayKlass::create_klass(T_BOOLEAN, sizeof(jboolean), CHECK);
314 314 _charArrayKlassObj = typeArrayKlass::create_klass(T_CHAR, sizeof(jchar), CHECK);
315 315 _singleArrayKlassObj = typeArrayKlass::create_klass(T_FLOAT, sizeof(jfloat), CHECK);
316 316 _doubleArrayKlassObj = typeArrayKlass::create_klass(T_DOUBLE, sizeof(jdouble), CHECK);
317 317 _byteArrayKlassObj = typeArrayKlass::create_klass(T_BYTE, sizeof(jbyte), CHECK);
318 318 _shortArrayKlassObj = typeArrayKlass::create_klass(T_SHORT, sizeof(jshort), CHECK);
319 319 _intArrayKlassObj = typeArrayKlass::create_klass(T_INT, sizeof(jint), CHECK);
320 320 _longArrayKlassObj = typeArrayKlass::create_klass(T_LONG, sizeof(jlong), CHECK);
321 321
322 322 _typeArrayKlassObjs[T_BOOLEAN] = _boolArrayKlassObj;
323 323 _typeArrayKlassObjs[T_CHAR] = _charArrayKlassObj;
324 324 _typeArrayKlassObjs[T_FLOAT] = _singleArrayKlassObj;
325 325 _typeArrayKlassObjs[T_DOUBLE] = _doubleArrayKlassObj;
326 326 _typeArrayKlassObjs[T_BYTE] = _byteArrayKlassObj;
327 327 _typeArrayKlassObjs[T_SHORT] = _shortArrayKlassObj;
328 328 _typeArrayKlassObjs[T_INT] = _intArrayKlassObj;
329 329 _typeArrayKlassObjs[T_LONG] = _longArrayKlassObj;
330 330
331 331 _methodKlassObj = methodKlass::create_klass(CHECK);
332 332 _constMethodKlassObj = constMethodKlass::create_klass(CHECK);
333 333 _methodDataKlassObj = methodDataKlass::create_klass(CHECK);
334 334 _constantPoolKlassObj = constantPoolKlass::create_klass(CHECK);
335 335 _constantPoolCacheKlassObj = constantPoolCacheKlass::create_klass(CHECK);
336 336
337 337 _compiledICHolderKlassObj = compiledICHolderKlass::create_klass(CHECK);
338 338 _systemObjArrayKlassObj = objArrayKlassKlass::cast(objArrayKlassKlassObj())->allocate_system_objArray_klass(CHECK);
339 339
340 340 _the_empty_byte_array = oopFactory::new_permanent_byteArray(0, CHECK);
341 341 _the_empty_short_array = oopFactory::new_permanent_shortArray(0, CHECK);
342 342 _the_empty_int_array = oopFactory::new_permanent_intArray(0, CHECK);
343 343 _the_empty_system_obj_array = oopFactory::new_system_objArray(0, CHECK);
344 344
345 345 _the_array_interfaces_array = oopFactory::new_system_objArray(2, CHECK);
346 346 }
347 347 }
348 348
349 349 vmSymbols::initialize(CHECK);
350 350
351 351 SystemDictionary::initialize(CHECK);
352 352
353 353 klassOop ok = SystemDictionary::Object_klass();
354 354
355 355 _the_null_string = StringTable::intern("null", CHECK);
356 356 _the_min_jint_string = StringTable::intern("-2147483648", CHECK);
357 357
358 358 if (UseSharedSpaces) {
359 359 // Verify shared interfaces array.
360 360 assert(_the_array_interfaces_array->obj_at(0) ==
361 361 SystemDictionary::Cloneable_klass(), "u3");
362 362 assert(_the_array_interfaces_array->obj_at(1) ==
363 363 SystemDictionary::Serializable_klass(), "u3");
364 364
365 365 // Verify element klass for system obj array klass
366 366 assert(objArrayKlass::cast(_systemObjArrayKlassObj)->element_klass() == ok, "u1");
367 367 assert(objArrayKlass::cast(_systemObjArrayKlassObj)->bottom_klass() == ok, "u2");
368 368
369 369 // Verify super class for the classes created above
370 370 assert(Klass::cast(boolArrayKlassObj() )->super() == ok, "u3");
371 371 assert(Klass::cast(charArrayKlassObj() )->super() == ok, "u3");
372 372 assert(Klass::cast(singleArrayKlassObj() )->super() == ok, "u3");
373 373 assert(Klass::cast(doubleArrayKlassObj() )->super() == ok, "u3");
374 374 assert(Klass::cast(byteArrayKlassObj() )->super() == ok, "u3");
375 375 assert(Klass::cast(shortArrayKlassObj() )->super() == ok, "u3");
376 376 assert(Klass::cast(intArrayKlassObj() )->super() == ok, "u3");
377 377 assert(Klass::cast(longArrayKlassObj() )->super() == ok, "u3");
378 378 assert(Klass::cast(constantPoolKlassObj() )->super() == ok, "u3");
379 379 assert(Klass::cast(systemObjArrayKlassObj())->super() == ok, "u3");
380 380 } else {
381 381 // Set up shared interfaces array. (Do this before supers are set up.)
382 382 _the_array_interfaces_array->obj_at_put(0, SystemDictionary::Cloneable_klass());
383 383 _the_array_interfaces_array->obj_at_put(1, SystemDictionary::Serializable_klass());
384 384
385 385 // Set element klass for system obj array klass
386 386 objArrayKlass::cast(_systemObjArrayKlassObj)->set_element_klass(ok);
387 387 objArrayKlass::cast(_systemObjArrayKlassObj)->set_bottom_klass(ok);
388 388
389 389 // Set super class for the classes created above
390 390 Klass::cast(boolArrayKlassObj() )->initialize_supers(ok, CHECK);
391 391 Klass::cast(charArrayKlassObj() )->initialize_supers(ok, CHECK);
392 392 Klass::cast(singleArrayKlassObj() )->initialize_supers(ok, CHECK);
393 393 Klass::cast(doubleArrayKlassObj() )->initialize_supers(ok, CHECK);
394 394 Klass::cast(byteArrayKlassObj() )->initialize_supers(ok, CHECK);
395 395 Klass::cast(shortArrayKlassObj() )->initialize_supers(ok, CHECK);
396 396 Klass::cast(intArrayKlassObj() )->initialize_supers(ok, CHECK);
397 397 Klass::cast(longArrayKlassObj() )->initialize_supers(ok, CHECK);
398 398 Klass::cast(constantPoolKlassObj() )->initialize_supers(ok, CHECK);
399 399 Klass::cast(systemObjArrayKlassObj())->initialize_supers(ok, CHECK);
400 400 Klass::cast(boolArrayKlassObj() )->set_super(ok);
401 401 Klass::cast(charArrayKlassObj() )->set_super(ok);
402 402 Klass::cast(singleArrayKlassObj() )->set_super(ok);
403 403 Klass::cast(doubleArrayKlassObj() )->set_super(ok);
404 404 Klass::cast(byteArrayKlassObj() )->set_super(ok);
405 405 Klass::cast(shortArrayKlassObj() )->set_super(ok);
406 406 Klass::cast(intArrayKlassObj() )->set_super(ok);
407 407 Klass::cast(longArrayKlassObj() )->set_super(ok);
408 408 Klass::cast(constantPoolKlassObj() )->set_super(ok);
409 409 Klass::cast(systemObjArrayKlassObj())->set_super(ok);
410 410 }
411 411
412 412 Klass::cast(boolArrayKlassObj() )->append_to_sibling_list();
413 413 Klass::cast(charArrayKlassObj() )->append_to_sibling_list();
414 414 Klass::cast(singleArrayKlassObj() )->append_to_sibling_list();
415 415 Klass::cast(doubleArrayKlassObj() )->append_to_sibling_list();
416 416 Klass::cast(byteArrayKlassObj() )->append_to_sibling_list();
417 417 Klass::cast(shortArrayKlassObj() )->append_to_sibling_list();
418 418 Klass::cast(intArrayKlassObj() )->append_to_sibling_list();
419 419 Klass::cast(longArrayKlassObj() )->append_to_sibling_list();
420 420 Klass::cast(constantPoolKlassObj() )->append_to_sibling_list();
421 421 Klass::cast(systemObjArrayKlassObj())->append_to_sibling_list();
422 422 } // end of core bootstrapping
423 423
424 424 // Initialize _objectArrayKlass after core bootstraping to make
425 425 // sure the super class is set up properly for _objectArrayKlass.
426 426 _objectArrayKlassObj = instanceKlass::
427 427 cast(SystemDictionary::Object_klass())->array_klass(1, CHECK);
428 428 // Add the class to the class hierarchy manually to make sure that
429 429 // its vtable is initialized after core bootstrapping is completed.
430 430 Klass::cast(_objectArrayKlassObj)->append_to_sibling_list();
431 431
432 432 // Compute is_jdk version flags.
433 433 // Only 1.3 or later has the java.lang.Shutdown class.
434 434 // Only 1.4 or later has the java.lang.CharSequence interface.
435 435 // Only 1.5 or later has the java.lang.management.MemoryUsage class.
436 436 if (JDK_Version::is_partially_initialized()) {
437 437 uint8_t jdk_version;
438 438 klassOop k = SystemDictionary::resolve_or_null(
439 439 vmSymbols::java_lang_management_MemoryUsage(), THREAD);
440 440 CLEAR_PENDING_EXCEPTION; // ignore exceptions
441 441 if (k == NULL) {
442 442 k = SystemDictionary::resolve_or_null(
443 443 vmSymbols::java_lang_CharSequence(), THREAD);
444 444 CLEAR_PENDING_EXCEPTION; // ignore exceptions
445 445 if (k == NULL) {
446 446 k = SystemDictionary::resolve_or_null(
447 447 vmSymbols::java_lang_Shutdown(), THREAD);
448 448 CLEAR_PENDING_EXCEPTION; // ignore exceptions
449 449 if (k == NULL) {
450 450 jdk_version = 2;
451 451 } else {
452 452 jdk_version = 3;
453 453 }
454 454 } else {
455 455 jdk_version = 4;
456 456 }
457 457 } else {
458 458 jdk_version = 5;
459 459 }
460 460 JDK_Version::fully_initialize(jdk_version);
461 461 }
462 462
463 463 #ifdef ASSERT
464 464 if (FullGCALot) {
465 465 // Allocate an array of dummy objects.
466 466 // We'd like these to be at the bottom of the old generation,
467 467 // so that when we free one and then collect,
468 468 // (almost) the whole heap moves
469 469 // and we find out if we actually update all the oops correctly.
470 470 // But we can't allocate directly in the old generation,
471 471 // so we allocate wherever, and hope that the first collection
472 472 // moves these objects to the bottom of the old generation.
473 473 // We can allocate directly in the permanent generation, so we do.
474 474 int size;
475 475 if (UseConcMarkSweepGC) {
476 476 warning("Using +FullGCALot with concurrent mark sweep gc "
477 477 "will not force all objects to relocate");
478 478 size = FullGCALotDummies;
479 479 } else {
480 480 size = FullGCALotDummies * 2;
481 481 }
482 482 objArrayOop naked_array = oopFactory::new_system_objArray(size, CHECK);
483 483 objArrayHandle dummy_array(THREAD, naked_array);
484 484 int i = 0;
485 485 while (i < size) {
486 486 if (!UseConcMarkSweepGC) {
487 487 // Allocate dummy in old generation
488 488 oop dummy = instanceKlass::cast(SystemDictionary::Object_klass())->allocate_instance(CHECK);
489 489 dummy_array->obj_at_put(i++, dummy);
490 490 }
491 491 // Allocate dummy in permanent generation
492 492 oop dummy = instanceKlass::cast(SystemDictionary::Object_klass())->allocate_permanent_instance(CHECK);
493 493 dummy_array->obj_at_put(i++, dummy);
494 494 }
495 495 {
496 496 // Only modify the global variable inside the mutex.
497 497 // If we had a race to here, the other dummy_array instances
498 498 // and their elements just get dropped on the floor, which is fine.
499 499 MutexLocker ml(FullGCALot_lock);
500 500 if (_fullgc_alot_dummy_array == NULL) {
501 501 _fullgc_alot_dummy_array = dummy_array();
502 502 }
503 503 }
504 504 assert(i == _fullgc_alot_dummy_array->length(), "just checking");
505 505 }
506 506 #endif
507 507 }
508 508
509 509
510 510 static inline void* dereference(void* addr) {
511 511 return *(void**)addr;
512 512 }
513 513
514 514 static inline void add_vtable(void** list, int* n, void* o, int count) {
515 515 guarantee((*n) < count, "vtable list too small");
516 516 void* vtable = dereference(o);
517 517 assert(dereference(vtable) != NULL, "invalid vtable");
518 518 list[(*n)++] = vtable;
519 519 }
520 520
521 521 void Universe::init_self_patching_vtbl_list(void** list, int count) {
522 522 int n = 0;
523 523 { klassKlass o; add_vtable(list, &n, &o, count); }
524 524 { arrayKlassKlass o; add_vtable(list, &n, &o, count); }
525 525 { objArrayKlassKlass o; add_vtable(list, &n, &o, count); }
526 526 { instanceKlassKlass o; add_vtable(list, &n, &o, count); }
527 527 { instanceKlass o; add_vtable(list, &n, &o, count); }
528 528 { instanceMirrorKlass o; add_vtable(list, &n, &o, count); }
529 529 { instanceRefKlass o; add_vtable(list, &n, &o, count); }
530 530 { typeArrayKlassKlass o; add_vtable(list, &n, &o, count); }
531 531 { typeArrayKlass o; add_vtable(list, &n, &o, count); }
532 532 { methodKlass o; add_vtable(list, &n, &o, count); }
533 533 { constMethodKlass o; add_vtable(list, &n, &o, count); }
534 534 { constantPoolKlass o; add_vtable(list, &n, &o, count); }
535 535 { constantPoolCacheKlass o; add_vtable(list, &n, &o, count); }
536 536 { objArrayKlass o; add_vtable(list, &n, &o, count); }
537 537 { methodDataKlass o; add_vtable(list, &n, &o, count); }
538 538 { compiledICHolderKlass o; add_vtable(list, &n, &o, count); }
539 539 #ifndef PRODUCT
540 540 // In non-product builds CHeapObj is derived from AllocatedObj,
541 541 // so symbols in CDS archive should have their vtable pointer patched.
542 542 { Symbol o; add_vtable(list, &n, &o, count); }
543 543 #endif
544 544 }
545 545
546 546
547 547 class FixupMirrorClosure: public ObjectClosure {
548 548 public:
549 549 virtual void do_object(oop obj) {
550 550 if (obj->is_klass()) {
551 551 EXCEPTION_MARK;
552 552 KlassHandle k(THREAD, klassOop(obj));
553 553 // We will never reach the CATCH below since Exceptions::_throw will cause
554 554 // the VM to exit if an exception is thrown during initialization
555 555 java_lang_Class::fixup_mirror(k, CATCH);
556 556 // This call unconditionally creates a new mirror for k,
557 557 // and links in k's component_mirror field if k is an array.
558 558 // If k is an objArray, k's element type must already have
559 559 // a mirror. In other words, this closure must process
560 560 // the component type of an objArray k before it processes k.
561 561 // This works because the permgen iterator presents arrays
562 562 // and their component types in order of creation.
563 563 }
564 564 }
565 565 };
566 566
567 567 void Universe::initialize_basic_type_mirrors(TRAPS) {
568 568 if (UseSharedSpaces) {
569 569 assert(_int_mirror != NULL, "already loaded");
570 570 assert(_void_mirror == _mirrors[T_VOID], "consistently loaded");
571 571 } else {
572 572
573 573 assert(_int_mirror==NULL, "basic type mirrors already initialized");
574 574 _int_mirror =
575 575 java_lang_Class::create_basic_type_mirror("int", T_INT, CHECK);
576 576 _float_mirror =
577 577 java_lang_Class::create_basic_type_mirror("float", T_FLOAT, CHECK);
578 578 _double_mirror =
579 579 java_lang_Class::create_basic_type_mirror("double", T_DOUBLE, CHECK);
580 580 _byte_mirror =
581 581 java_lang_Class::create_basic_type_mirror("byte", T_BYTE, CHECK);
582 582 _bool_mirror =
583 583 java_lang_Class::create_basic_type_mirror("boolean",T_BOOLEAN, CHECK);
584 584 _char_mirror =
585 585 java_lang_Class::create_basic_type_mirror("char", T_CHAR, CHECK);
586 586 _long_mirror =
587 587 java_lang_Class::create_basic_type_mirror("long", T_LONG, CHECK);
588 588 _short_mirror =
589 589 java_lang_Class::create_basic_type_mirror("short", T_SHORT, CHECK);
590 590 _void_mirror =
591 591 java_lang_Class::create_basic_type_mirror("void", T_VOID, CHECK);
592 592
593 593 _mirrors[T_INT] = _int_mirror;
594 594 _mirrors[T_FLOAT] = _float_mirror;
595 595 _mirrors[T_DOUBLE] = _double_mirror;
596 596 _mirrors[T_BYTE] = _byte_mirror;
597 597 _mirrors[T_BOOLEAN] = _bool_mirror;
598 598 _mirrors[T_CHAR] = _char_mirror;
599 599 _mirrors[T_LONG] = _long_mirror;
600 600 _mirrors[T_SHORT] = _short_mirror;
601 601 _mirrors[T_VOID] = _void_mirror;
602 602 //_mirrors[T_OBJECT] = instanceKlass::cast(_object_klass)->java_mirror();
603 603 //_mirrors[T_ARRAY] = instanceKlass::cast(_object_klass)->java_mirror();
604 604 }
605 605 }
606 606
607 607 void Universe::fixup_mirrors(TRAPS) {
608 608 // Bootstrap problem: all classes gets a mirror (java.lang.Class instance) assigned eagerly,
609 609 // but we cannot do that for classes created before java.lang.Class is loaded. Here we simply
610 610 // walk over permanent objects created so far (mostly classes) and fixup their mirrors. Note
611 611 // that the number of objects allocated at this point is very small.
612 612 assert(SystemDictionary::Class_klass_loaded(), "java.lang.Class should be loaded");
613 613
614 614 // Cache the start of the static fields
615 615 instanceMirrorKlass::init_offset_of_static_fields();
616 616
617 617 FixupMirrorClosure blk;
618 618 Universe::heap()->permanent_object_iterate(&blk);
619 619 }
620 620
621 621
622 622 static bool has_run_finalizers_on_exit = false;
623 623
624 624 void Universe::run_finalizers_on_exit() {
625 625 if (has_run_finalizers_on_exit) return;
626 626 has_run_finalizers_on_exit = true;
627 627
628 628 // Called on VM exit. This ought to be run in a separate thread.
629 629 if (TraceReferenceGC) tty->print_cr("Callback to run finalizers on exit");
630 630 {
631 631 PRESERVE_EXCEPTION_MARK;
632 632 KlassHandle finalizer_klass(THREAD, SystemDictionary::Finalizer_klass());
633 633 JavaValue result(T_VOID);
634 634 JavaCalls::call_static(
635 635 &result,
636 636 finalizer_klass,
637 637 vmSymbols::run_finalizers_on_exit_name(),
638 638 vmSymbols::void_method_signature(),
639 639 THREAD
640 640 );
641 641 // Ignore any pending exceptions
642 642 CLEAR_PENDING_EXCEPTION;
643 643 }
644 644 }
645 645
646 646
647 647 // initialize_vtable could cause gc if
648 648 // 1) we specified true to initialize_vtable and
649 649 // 2) this ran after gc was enabled
650 650 // In case those ever change we use handles for oops
651 651 void Universe::reinitialize_vtable_of(KlassHandle k_h, TRAPS) {
652 652 // init vtable of k and all subclasses
653 653 Klass* ko = k_h()->klass_part();
654 654 klassVtable* vt = ko->vtable();
655 655 if (vt) vt->initialize_vtable(false, CHECK);
656 656 if (ko->oop_is_instance()) {
657 657 instanceKlass* ik = (instanceKlass*)ko;
658 658 for (KlassHandle s_h(THREAD, ik->subklass()); s_h() != NULL; s_h = (THREAD, s_h()->klass_part()->next_sibling())) {
659 659 reinitialize_vtable_of(s_h, CHECK);
660 660 }
661 661 }
662 662 }
663 663
664 664
665 665 void initialize_itable_for_klass(klassOop k, TRAPS) {
666 666 instanceKlass::cast(k)->itable()->initialize_itable(false, CHECK);
667 667 }
668 668
669 669
670 670 void Universe::reinitialize_itables(TRAPS) {
671 671 SystemDictionary::classes_do(initialize_itable_for_klass, CHECK);
672 672
673 673 }
674 674
675 675
676 676 bool Universe::on_page_boundary(void* addr) {
677 677 return ((uintptr_t) addr) % os::vm_page_size() == 0;
678 678 }
679 679
680 680
681 681 bool Universe::should_fill_in_stack_trace(Handle throwable) {
682 682 // never attempt to fill in the stack trace of preallocated errors that do not have
683 683 // backtrace. These errors are kept alive forever and may be "re-used" when all
684 684 // preallocated errors with backtrace have been consumed. Also need to avoid
685 685 // a potential loop which could happen if an out of memory occurs when attempting
686 686 // to allocate the backtrace.
687 687 return ((throwable() != Universe::_out_of_memory_error_java_heap) &&
688 688 (throwable() != Universe::_out_of_memory_error_perm_gen) &&
689 689 (throwable() != Universe::_out_of_memory_error_array_size) &&
690 690 (throwable() != Universe::_out_of_memory_error_gc_overhead_limit));
691 691 }
692 692
693 693
694 694 oop Universe::gen_out_of_memory_error(oop default_err) {
695 695 // generate an out of memory error:
696 696 // - if there is a preallocated error with backtrace available then return it wth
697 697 // a filled in stack trace.
698 698 // - if there are no preallocated errors with backtrace available then return
699 699 // an error without backtrace.
700 700 int next;
701 701 if (_preallocated_out_of_memory_error_avail_count > 0) {
702 702 next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count);
703 703 assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt");
704 704 } else {
705 705 next = -1;
706 706 }
707 707 if (next < 0) {
708 708 // all preallocated errors have been used.
709 709 // return default
710 710 return default_err;
711 711 } else {
712 712 // get the error object at the slot and set set it to NULL so that the
713 713 // array isn't keeping it alive anymore.
714 714 oop exc = preallocated_out_of_memory_errors()->obj_at(next);
715 715 assert(exc != NULL, "slot has been used already");
716 716 preallocated_out_of_memory_errors()->obj_at_put(next, NULL);
717 717
718 718 // use the message from the default error
719 719 oop msg = java_lang_Throwable::message(default_err);
720 720 assert(msg != NULL, "no message");
721 721 java_lang_Throwable::set_message(exc, msg);
722 722
723 723 // populate the stack trace and return it.
724 724 java_lang_Throwable::fill_in_stack_trace_of_preallocated_backtrace(exc);
725 725 return exc;
726 726 }
727 727 }
728 728
729 729 static intptr_t non_oop_bits = 0;
730 730
731 731 void* Universe::non_oop_word() {
732 732 // Neither the high bits nor the low bits of this value is allowed
733 733 // to look like (respectively) the high or low bits of a real oop.
734 734 //
735 735 // High and low are CPU-specific notions, but low always includes
736 736 // the low-order bit. Since oops are always aligned at least mod 4,
737 737 // setting the low-order bit will ensure that the low half of the
738 738 // word will never look like that of a real oop.
739 739 //
740 740 // Using the OS-supplied non-memory-address word (usually 0 or -1)
741 741 // will take care of the high bits, however many there are.
742 742
743 743 if (non_oop_bits == 0) {
744 744 non_oop_bits = (intptr_t)os::non_memory_address_word() | 1;
745 745 }
746 746
747 747 return (void*)non_oop_bits;
748 748 }
749 749
750 750 jint universe_init() {
751 751 assert(!Universe::_fully_initialized, "called after initialize_vtables");
752 752 guarantee(1 << LogHeapWordSize == sizeof(HeapWord),
753 753 "LogHeapWordSize is incorrect.");
754 754 guarantee(sizeof(oop) >= sizeof(HeapWord), "HeapWord larger than oop?");
755 755 guarantee(sizeof(oop) % sizeof(HeapWord) == 0,
756 756 "oop size is not not a multiple of HeapWord size");
757 757 TraceTime timer("Genesis", TraceStartupTime);
758 758 GC_locker::lock(); // do not allow gc during bootstrapping
759 759 JavaClasses::compute_hard_coded_offsets();
760 760
761 761 // Get map info from shared archive file.
762 762 if (DumpSharedSpaces)
763 763 UseSharedSpaces = false;
764 764
765 765 FileMapInfo* mapinfo = NULL;
766 766 if (UseSharedSpaces) {
767 767 mapinfo = NEW_C_HEAP_OBJ(FileMapInfo, mtInternal);
768 768 memset(mapinfo, 0, sizeof(FileMapInfo));
769 769
770 770 // Open the shared archive file, read and validate the header. If
771 771 // initialization files, shared spaces [UseSharedSpaces] are
772 772 // disabled and the file is closed.
773 773
774 774 if (mapinfo->initialize()) {
775 775 FileMapInfo::set_current_info(mapinfo);
776 776 } else {
777 777 assert(!mapinfo->is_open() && !UseSharedSpaces,
778 778 "archive file not closed or shared spaces not disabled.");
779 779 }
780 780 }
781 781
782 782 jint status = Universe::initialize_heap();
783 783 if (status != JNI_OK) {
784 784 return status;
785 785 }
786 786
787 787 // We have a heap so create the methodOop caches before
788 788 // CompactingPermGenGen::initialize_oops() tries to populate them.
789 789 Universe::_finalizer_register_cache = new LatestMethodOopCache();
790 790 Universe::_loader_addClass_cache = new LatestMethodOopCache();
791 791 Universe::_reflect_invoke_cache = new ActiveMethodOopsCache();
792 792
793 793 if (UseSharedSpaces) {
794 794
795 795 // Read the data structures supporting the shared spaces (shared
796 796 // system dictionary, symbol table, etc.). After that, access to
797 797 // the file (other than the mapped regions) is no longer needed, and
798 798 // the file is closed. Closing the file does not affect the
799 799 // currently mapped regions.
800 800
801 801 CompactingPermGenGen::initialize_oops();
802 802 mapinfo->close();
803 803
804 804 } else {
805 805 SymbolTable::create_table();
806 806 StringTable::create_table();
807 807 ClassLoader::create_package_info_table();
808 808 }
809 809
810 810 return JNI_OK;
811 811 }
812 812
813 813 // Choose the heap base address and oop encoding mode
814 814 // when compressed oops are used:
815 815 // Unscaled - Use 32-bits oops without encoding when
816 816 // NarrowOopHeapBaseMin + heap_size < 4Gb
817 817 // ZeroBased - Use zero based compressed oops with encoding when
818 818 // NarrowOopHeapBaseMin + heap_size < 32Gb
819 819 // HeapBased - Use compressed oops with heap base + encoding.
820 820
821 821 // 4Gb
822 822 static const uint64_t NarrowOopHeapMax = (uint64_t(max_juint) + 1);
823 823 // 32Gb
824 824 // OopEncodingHeapMax == NarrowOopHeapMax << LogMinObjAlignmentInBytes;
825 825
826 826 char* Universe::preferred_heap_base(size_t heap_size, NARROW_OOP_MODE mode) {
827 827 size_t base = 0;
828 828 #ifdef _LP64
829 829 if (UseCompressedOops) {
830 830 assert(mode == UnscaledNarrowOop ||
831 831 mode == ZeroBasedNarrowOop ||
832 832 mode == HeapBasedNarrowOop, "mode is invalid");
833 833 const size_t total_size = heap_size + HeapBaseMinAddress;
834 834 // Return specified base for the first request.
835 835 if (!FLAG_IS_DEFAULT(HeapBaseMinAddress) && (mode == UnscaledNarrowOop)) {
836 836 base = HeapBaseMinAddress;
837 837 } else if (total_size <= OopEncodingHeapMax && (mode != HeapBasedNarrowOop)) {
838 838 if (total_size <= NarrowOopHeapMax && (mode == UnscaledNarrowOop) &&
839 839 (Universe::narrow_oop_shift() == 0)) {
840 840 // Use 32-bits oops without encoding and
841 841 // place heap's top on the 4Gb boundary
842 842 base = (NarrowOopHeapMax - heap_size);
843 843 } else {
844 844 // Can't reserve with NarrowOopShift == 0
845 845 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
846 846 if (mode == UnscaledNarrowOop ||
847 847 mode == ZeroBasedNarrowOop && total_size <= NarrowOopHeapMax) {
848 848 // Use zero based compressed oops with encoding and
849 849 // place heap's top on the 32Gb boundary in case
850 850 // total_size > 4Gb or failed to reserve below 4Gb.
851 851 base = (OopEncodingHeapMax - heap_size);
852 852 }
853 853 }
854 854 } else {
855 855 // Can't reserve below 32Gb.
856 856 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
857 857 }
858 858 // Set narrow_oop_base and narrow_oop_use_implicit_null_checks
859 859 // used in ReservedHeapSpace() constructors.
860 860 // The final values will be set in initialize_heap() below.
861 861 if (base != 0 && (base + heap_size) <= OopEncodingHeapMax) {
862 862 // Use zero based compressed oops
863 863 Universe::set_narrow_oop_base(NULL);
864 864 // Don't need guard page for implicit checks in indexed
865 865 // addressing mode with zero based Compressed Oops.
866 866 Universe::set_narrow_oop_use_implicit_null_checks(true);
867 867 } else {
868 868 // Set to a non-NULL value so the ReservedSpace ctor computes
869 869 // the correct no-access prefix.
870 870 // The final value will be set in initialize_heap() below.
871 871 Universe::set_narrow_oop_base((address)NarrowOopHeapMax);
872 872 #ifdef _WIN64
873 873 if (UseLargePages) {
874 874 // Cannot allocate guard pages for implicit checks in indexed
875 875 // addressing mode when large pages are specified on windows.
876 876 Universe::set_narrow_oop_use_implicit_null_checks(false);
877 877 }
878 878 #endif // _WIN64
879 879 }
880 880 }
881 881 #endif
882 882 return (char*)base; // also return NULL (don't care) for 32-bit VM
883 883 }
884 884
885 885 jint Universe::initialize_heap() {
886 886
887 887 if (UseParallelGC) {
888 888 #ifndef SERIALGC
889 889 Universe::_collectedHeap = new ParallelScavengeHeap();
890 890 #else // SERIALGC
891 891 fatal("UseParallelGC not supported in java kernel vm.");
892 892 #endif // SERIALGC
893 893
894 894 } else if (UseG1GC) {
895 895 #ifndef SERIALGC
896 896 G1CollectorPolicy* g1p = new G1CollectorPolicy();
897 897 G1CollectedHeap* g1h = new G1CollectedHeap(g1p);
898 898 Universe::_collectedHeap = g1h;
899 899 #else // SERIALGC
900 900 fatal("UseG1GC not supported in java kernel vm.");
901 901 #endif // SERIALGC
902 902
903 903 } else {
904 904 GenCollectorPolicy *gc_policy;
905 905
906 906 if (UseSerialGC) {
907 907 gc_policy = new MarkSweepPolicy();
908 908 } else if (UseConcMarkSweepGC) {
909 909 #ifndef SERIALGC
910 910 if (UseAdaptiveSizePolicy) {
911 911 gc_policy = new ASConcurrentMarkSweepPolicy();
912 912 } else {
913 913 gc_policy = new ConcurrentMarkSweepPolicy();
914 914 }
915 915 #else // SERIALGC
916 916 fatal("UseConcMarkSweepGC not supported in java kernel vm.");
917 917 #endif // SERIALGC
918 918 } else { // default old generation
919 919 gc_policy = new MarkSweepPolicy();
920 920 }
921 921
922 922 Universe::_collectedHeap = new GenCollectedHeap(gc_policy);
923 923 }
924 924
925 925 jint status = Universe::heap()->initialize();
926 926 if (status != JNI_OK) {
927 927 return status;
928 928 }
929 929
930 930 #ifdef _LP64
931 931 if (UseCompressedOops) {
932 932 // Subtract a page because something can get allocated at heap base.
933 933 // This also makes implicit null checking work, because the
934 934 // memory+1 page below heap_base needs to cause a signal.
935 935 // See needs_explicit_null_check.
936 936 // Only set the heap base for compressed oops because it indicates
937 937 // compressed oops for pstack code.
938 938 bool verbose = PrintCompressedOopsMode || (PrintMiscellaneous && Verbose);
939 939 if (verbose) {
940 940 tty->cr();
941 941 tty->print("heap address: " PTR_FORMAT ", size: " SIZE_FORMAT " MB",
942 942 Universe::heap()->base(), Universe::heap()->reserved_region().byte_size()/M);
943 943 }
944 944 if ((uint64_t)Universe::heap()->reserved_region().end() > OopEncodingHeapMax) {
945 945 // Can't reserve heap below 32Gb.
946 946 Universe::set_narrow_oop_base(Universe::heap()->base() - os::vm_page_size());
947 947 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
948 948 if (verbose) {
949 949 tty->print(", %s: "PTR_FORMAT,
950 950 narrow_oop_mode_to_string(HeapBasedNarrowOop),
951 951 Universe::narrow_oop_base());
952 952 }
953 953 } else {
954 954 Universe::set_narrow_oop_base(0);
955 955 if (verbose) {
956 956 tty->print(", %s", narrow_oop_mode_to_string(ZeroBasedNarrowOop));
957 957 }
958 958 #ifdef _WIN64
959 959 if (!Universe::narrow_oop_use_implicit_null_checks()) {
960 960 // Don't need guard page for implicit checks in indexed addressing
961 961 // mode with zero based Compressed Oops.
962 962 Universe::set_narrow_oop_use_implicit_null_checks(true);
963 963 }
964 964 #endif // _WIN64
965 965 if((uint64_t)Universe::heap()->reserved_region().end() > NarrowOopHeapMax) {
966 966 // Can't reserve heap below 4Gb.
967 967 Universe::set_narrow_oop_shift(LogMinObjAlignmentInBytes);
968 968 } else {
969 969 Universe::set_narrow_oop_shift(0);
970 970 if (verbose) {
971 971 tty->print(", %s", narrow_oop_mode_to_string(UnscaledNarrowOop));
972 972 }
973 973 }
974 974 }
975 975 if (verbose) {
976 976 tty->cr();
977 977 tty->cr();
978 978 }
979 979 }
980 980 assert(Universe::narrow_oop_base() == (Universe::heap()->base() - os::vm_page_size()) ||
981 981 Universe::narrow_oop_base() == NULL, "invalid value");
982 982 assert(Universe::narrow_oop_shift() == LogMinObjAlignmentInBytes ||
983 983 Universe::narrow_oop_shift() == 0, "invalid value");
984 984 #endif
985 985
986 986 // We will never reach the CATCH below since Exceptions::_throw will cause
987 987 // the VM to exit if an exception is thrown during initialization
988 988
989 989 if (UseTLAB) {
990 990 assert(Universe::heap()->supports_tlab_allocation(),
991 991 "Should support thread-local allocation buffers");
992 992 ThreadLocalAllocBuffer::startup_initialization();
993 993 }
994 994 return JNI_OK;
995 995 }
996 996
997 997 // It's the caller's repsonsibility to ensure glitch-freedom
998 998 // (if required).
999 999 void Universe::update_heap_info_at_gc() {
1000 1000 _heap_capacity_at_last_gc = heap()->capacity();
1001 1001 _heap_used_at_last_gc = heap()->used();
1002 1002 }
1003 1003
1004 1004
1005 1005 const char* Universe::narrow_oop_mode_to_string(Universe::NARROW_OOP_MODE mode) {
1006 1006 switch (mode) {
1007 1007 case UnscaledNarrowOop:
1008 1008 return "32-bits Oops";
1009 1009 case ZeroBasedNarrowOop:
1010 1010 return "zero based Compressed Oops";
1011 1011 case HeapBasedNarrowOop:
1012 1012 return "Compressed Oops with base";
1013 1013 }
1014 1014
1015 1015 ShouldNotReachHere();
1016 1016 return "";
1017 1017 }
1018 1018
1019 1019
1020 1020 Universe::NARROW_OOP_MODE Universe::narrow_oop_mode() {
1021 1021 if (narrow_oop_base() != 0) {
1022 1022 return HeapBasedNarrowOop;
1023 1023 }
1024 1024
1025 1025 if (narrow_oop_shift() != 0) {
↓ open down ↓ |
1025 lines elided |
↑ open up ↑ |
1026 1026 return ZeroBasedNarrowOop;
1027 1027 }
1028 1028
1029 1029 return UnscaledNarrowOop;
1030 1030 }
1031 1031
1032 1032
1033 1033 void universe2_init() {
1034 1034 EXCEPTION_MARK;
1035 1035 Universe::genesis(CATCH);
1036 - // Although we'd like to verify here that the state of the heap
1037 - // is good, we can't because the main thread has not yet added
1038 - // itself to the threads list (so, using current interfaces
1039 - // we can't "fill" its TLAB), unless TLABs are disabled.
1040 - if (VerifyBeforeGC && !UseTLAB &&
1041 - Universe::heap()->total_collections() >= VerifyGCStartAt) {
1042 - Universe::heap()->prepare_for_verify();
1043 - Universe::verify(); // make sure we're starting with a clean slate
1044 - }
1045 1036 }
1046 1037
1047 1038
1048 1039 // This function is defined in JVM.cpp
1049 1040 extern void initialize_converter_functions();
1050 1041
1051 1042 bool universe_post_init() {
1052 1043 assert(!is_init_completed(), "Error: initialization not yet completed!");
1053 1044 Universe::_fully_initialized = true;
1054 1045 EXCEPTION_MARK;
1055 1046 { ResourceMark rm;
1056 1047 Interpreter::initialize(); // needed for interpreter entry points
1057 1048 if (!UseSharedSpaces) {
1058 1049 KlassHandle ok_h(THREAD, SystemDictionary::Object_klass());
1059 1050 Universe::reinitialize_vtable_of(ok_h, CHECK_false);
1060 1051 Universe::reinitialize_itables(CHECK_false);
1061 1052 }
1062 1053 }
1063 1054
1064 1055 klassOop k;
1065 1056 instanceKlassHandle k_h;
1066 1057 if (!UseSharedSpaces) {
1067 1058 // Setup preallocated empty java.lang.Class array
1068 1059 Universe::_the_empty_class_klass_array = oopFactory::new_objArray(SystemDictionary::Class_klass(), 0, CHECK_false);
1069 1060 // Setup preallocated OutOfMemoryError errors
1070 1061 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_OutOfMemoryError(), true, CHECK_false);
1071 1062 k_h = instanceKlassHandle(THREAD, k);
1072 1063 Universe::_out_of_memory_error_java_heap = k_h->allocate_permanent_instance(CHECK_false);
1073 1064 Universe::_out_of_memory_error_perm_gen = k_h->allocate_permanent_instance(CHECK_false);
1074 1065 Universe::_out_of_memory_error_array_size = k_h->allocate_permanent_instance(CHECK_false);
1075 1066 Universe::_out_of_memory_error_gc_overhead_limit =
1076 1067 k_h->allocate_permanent_instance(CHECK_false);
1077 1068
1078 1069 // Setup preallocated NullPointerException
1079 1070 // (this is currently used for a cheap & dirty solution in compiler exception handling)
1080 1071 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_NullPointerException(), true, CHECK_false);
1081 1072 Universe::_null_ptr_exception_instance = instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false);
1082 1073 // Setup preallocated ArithmeticException
1083 1074 // (this is currently used for a cheap & dirty solution in compiler exception handling)
1084 1075 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_ArithmeticException(), true, CHECK_false);
1085 1076 Universe::_arithmetic_exception_instance = instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false);
1086 1077 // Virtual Machine Error for when we get into a situation we can't resolve
1087 1078 k = SystemDictionary::resolve_or_fail(
1088 1079 vmSymbols::java_lang_VirtualMachineError(), true, CHECK_false);
1089 1080 bool linked = instanceKlass::cast(k)->link_class_or_fail(CHECK_false);
1090 1081 if (!linked) {
1091 1082 tty->print_cr("Unable to link/verify VirtualMachineError class");
1092 1083 return false; // initialization failed
1093 1084 }
1094 1085 Universe::_virtual_machine_error_instance =
1095 1086 instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false);
1096 1087
1097 1088 Universe::_vm_exception = instanceKlass::cast(k)->allocate_permanent_instance(CHECK_false);
1098 1089
1099 1090 }
1100 1091 if (!DumpSharedSpaces) {
1101 1092 // These are the only Java fields that are currently set during shared space dumping.
1102 1093 // We prefer to not handle this generally, so we always reinitialize these detail messages.
1103 1094 Handle msg = java_lang_String::create_from_str("Java heap space", CHECK_false);
1104 1095 java_lang_Throwable::set_message(Universe::_out_of_memory_error_java_heap, msg());
1105 1096
1106 1097 msg = java_lang_String::create_from_str("PermGen space", CHECK_false);
1107 1098 java_lang_Throwable::set_message(Universe::_out_of_memory_error_perm_gen, msg());
1108 1099
1109 1100 msg = java_lang_String::create_from_str("Requested array size exceeds VM limit", CHECK_false);
1110 1101 java_lang_Throwable::set_message(Universe::_out_of_memory_error_array_size, msg());
1111 1102
1112 1103 msg = java_lang_String::create_from_str("GC overhead limit exceeded", CHECK_false);
1113 1104 java_lang_Throwable::set_message(Universe::_out_of_memory_error_gc_overhead_limit, msg());
1114 1105
1115 1106 msg = java_lang_String::create_from_str("/ by zero", CHECK_false);
1116 1107 java_lang_Throwable::set_message(Universe::_arithmetic_exception_instance, msg());
1117 1108
1118 1109 // Setup the array of errors that have preallocated backtrace
1119 1110 k = Universe::_out_of_memory_error_java_heap->klass();
1120 1111 assert(k->klass_part()->name() == vmSymbols::java_lang_OutOfMemoryError(), "should be out of memory error");
1121 1112 k_h = instanceKlassHandle(THREAD, k);
1122 1113
1123 1114 int len = (StackTraceInThrowable) ? (int)PreallocatedOutOfMemoryErrorCount : 0;
1124 1115 Universe::_preallocated_out_of_memory_error_array = oopFactory::new_objArray(k_h(), len, CHECK_false);
1125 1116 for (int i=0; i<len; i++) {
1126 1117 oop err = k_h->allocate_permanent_instance(CHECK_false);
1127 1118 Handle err_h = Handle(THREAD, err);
1128 1119 java_lang_Throwable::allocate_backtrace(err_h, CHECK_false);
1129 1120 Universe::preallocated_out_of_memory_errors()->obj_at_put(i, err_h());
1130 1121 }
1131 1122 Universe::_preallocated_out_of_memory_error_avail_count = (jint)len;
1132 1123 }
1133 1124
1134 1125
1135 1126 // Setup static method for registering finalizers
1136 1127 // The finalizer klass must be linked before looking up the method, in
1137 1128 // case it needs to get rewritten.
1138 1129 instanceKlass::cast(SystemDictionary::Finalizer_klass())->link_class(CHECK_false);
1139 1130 methodOop m = instanceKlass::cast(SystemDictionary::Finalizer_klass())->find_method(
1140 1131 vmSymbols::register_method_name(),
1141 1132 vmSymbols::register_method_signature());
1142 1133 if (m == NULL || !m->is_static()) {
1143 1134 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1144 1135 "java.lang.ref.Finalizer.register", false);
1145 1136 }
1146 1137 Universe::_finalizer_register_cache->init(
1147 1138 SystemDictionary::Finalizer_klass(), m, CHECK_false);
1148 1139
1149 1140 // Resolve on first use and initialize class.
1150 1141 // Note: No race-condition here, since a resolve will always return the same result
1151 1142
1152 1143 // Setup method for security checks
1153 1144 k = SystemDictionary::resolve_or_fail(vmSymbols::java_lang_reflect_Method(), true, CHECK_false);
1154 1145 k_h = instanceKlassHandle(THREAD, k);
1155 1146 k_h->link_class(CHECK_false);
1156 1147 m = k_h->find_method(vmSymbols::invoke_name(), vmSymbols::object_object_array_object_signature());
1157 1148 if (m == NULL || m->is_static()) {
1158 1149 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1159 1150 "java.lang.reflect.Method.invoke", false);
1160 1151 }
1161 1152 Universe::_reflect_invoke_cache->init(k_h(), m, CHECK_false);
1162 1153
1163 1154 // Setup method for registering loaded classes in class loader vector
1164 1155 instanceKlass::cast(SystemDictionary::ClassLoader_klass())->link_class(CHECK_false);
1165 1156 m = instanceKlass::cast(SystemDictionary::ClassLoader_klass())->find_method(vmSymbols::addClass_name(), vmSymbols::class_void_signature());
1166 1157 if (m == NULL || m->is_static()) {
1167 1158 THROW_MSG_(vmSymbols::java_lang_NoSuchMethodException(),
1168 1159 "java.lang.ClassLoader.addClass", false);
1169 1160 }
1170 1161 Universe::_loader_addClass_cache->init(
1171 1162 SystemDictionary::ClassLoader_klass(), m, CHECK_false);
1172 1163
1173 1164 // The folowing is initializing converter functions for serialization in
1174 1165 // JVM.cpp. If we clean up the StrictMath code above we may want to find
1175 1166 // a better solution for this as well.
1176 1167 initialize_converter_functions();
1177 1168
1178 1169 // This needs to be done before the first scavenge/gc, since
1179 1170 // it's an input to soft ref clearing policy.
1180 1171 {
1181 1172 MutexLocker x(Heap_lock);
1182 1173 Universe::update_heap_info_at_gc();
1183 1174 }
1184 1175
1185 1176 // ("weak") refs processing infrastructure initialization
1186 1177 Universe::heap()->post_initialize();
1187 1178
1188 1179 GC_locker::unlock(); // allow gc after bootstrapping
1189 1180
1190 1181 MemoryService::set_universe_heap(Universe::_collectedHeap);
1191 1182 return true;
1192 1183 }
1193 1184
1194 1185
1195 1186 void Universe::compute_base_vtable_size() {
1196 1187 _base_vtable_size = ClassLoader::compute_Object_vtable();
1197 1188 }
1198 1189
1199 1190
1200 1191 // %%% The Universe::flush_foo methods belong in CodeCache.
1201 1192
1202 1193 // Flushes compiled methods dependent on dependee.
1203 1194 void Universe::flush_dependents_on(instanceKlassHandle dependee) {
1204 1195 assert_lock_strong(Compile_lock);
1205 1196
1206 1197 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1207 1198
1208 1199 // CodeCache can only be updated by a thread_in_VM and they will all be
1209 1200 // stopped dring the safepoint so CodeCache will be safe to update without
1210 1201 // holding the CodeCache_lock.
1211 1202
1212 1203 KlassDepChange changes(dependee);
1213 1204
1214 1205 // Compute the dependent nmethods
1215 1206 if (CodeCache::mark_for_deoptimization(changes) > 0) {
1216 1207 // At least one nmethod has been marked for deoptimization
1217 1208 VM_Deoptimize op;
1218 1209 VMThread::execute(&op);
1219 1210 }
1220 1211 }
1221 1212
1222 1213 // Flushes compiled methods dependent on a particular CallSite
1223 1214 // instance when its target is different than the given MethodHandle.
1224 1215 void Universe::flush_dependents_on(Handle call_site, Handle method_handle) {
1225 1216 assert_lock_strong(Compile_lock);
1226 1217
1227 1218 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1228 1219
1229 1220 // CodeCache can only be updated by a thread_in_VM and they will all be
1230 1221 // stopped dring the safepoint so CodeCache will be safe to update without
1231 1222 // holding the CodeCache_lock.
1232 1223
1233 1224 CallSiteDepChange changes(call_site(), method_handle());
1234 1225
1235 1226 // Compute the dependent nmethods that have a reference to a
1236 1227 // CallSite object. We use instanceKlass::mark_dependent_nmethod
1237 1228 // directly instead of CodeCache::mark_for_deoptimization because we
1238 1229 // want dependents on the call site class only not all classes in
1239 1230 // the ContextStream.
1240 1231 int marked = 0;
1241 1232 {
1242 1233 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1243 1234 instanceKlass* call_site_klass = instanceKlass::cast(call_site->klass());
1244 1235 marked = call_site_klass->mark_dependent_nmethods(changes);
1245 1236 }
1246 1237 if (marked > 0) {
1247 1238 // At least one nmethod has been marked for deoptimization
1248 1239 VM_Deoptimize op;
1249 1240 VMThread::execute(&op);
1250 1241 }
1251 1242 }
1252 1243
1253 1244 #ifdef HOTSWAP
1254 1245 // Flushes compiled methods dependent on dependee in the evolutionary sense
1255 1246 void Universe::flush_evol_dependents_on(instanceKlassHandle ev_k_h) {
1256 1247 // --- Compile_lock is not held. However we are at a safepoint.
1257 1248 assert_locked_or_safepoint(Compile_lock);
1258 1249 if (CodeCache::number_of_nmethods_with_dependencies() == 0) return;
1259 1250
1260 1251 // CodeCache can only be updated by a thread_in_VM and they will all be
1261 1252 // stopped dring the safepoint so CodeCache will be safe to update without
1262 1253 // holding the CodeCache_lock.
1263 1254
1264 1255 // Compute the dependent nmethods
1265 1256 if (CodeCache::mark_for_evol_deoptimization(ev_k_h) > 0) {
1266 1257 // At least one nmethod has been marked for deoptimization
1267 1258
1268 1259 // All this already happens inside a VM_Operation, so we'll do all the work here.
1269 1260 // Stuff copied from VM_Deoptimize and modified slightly.
1270 1261
1271 1262 // We do not want any GCs to happen while we are in the middle of this VM operation
1272 1263 ResourceMark rm;
1273 1264 DeoptimizationMarker dm;
1274 1265
1275 1266 // Deoptimize all activations depending on marked nmethods
1276 1267 Deoptimization::deoptimize_dependents();
1277 1268
1278 1269 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1279 1270 CodeCache::make_marked_nmethods_not_entrant();
1280 1271 }
1281 1272 }
1282 1273 #endif // HOTSWAP
1283 1274
1284 1275
1285 1276 // Flushes compiled methods dependent on dependee
1286 1277 void Universe::flush_dependents_on_method(methodHandle m_h) {
1287 1278 // --- Compile_lock is not held. However we are at a safepoint.
1288 1279 assert_locked_or_safepoint(Compile_lock);
1289 1280
1290 1281 // CodeCache can only be updated by a thread_in_VM and they will all be
1291 1282 // stopped dring the safepoint so CodeCache will be safe to update without
1292 1283 // holding the CodeCache_lock.
1293 1284
1294 1285 // Compute the dependent nmethods
1295 1286 if (CodeCache::mark_for_deoptimization(m_h()) > 0) {
1296 1287 // At least one nmethod has been marked for deoptimization
1297 1288
1298 1289 // All this already happens inside a VM_Operation, so we'll do all the work here.
1299 1290 // Stuff copied from VM_Deoptimize and modified slightly.
1300 1291
1301 1292 // We do not want any GCs to happen while we are in the middle of this VM operation
1302 1293 ResourceMark rm;
1303 1294 DeoptimizationMarker dm;
1304 1295
1305 1296 // Deoptimize all activations depending on marked nmethods
1306 1297 Deoptimization::deoptimize_dependents();
1307 1298
1308 1299 // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies)
1309 1300 CodeCache::make_marked_nmethods_not_entrant();
1310 1301 }
1311 1302 }
1312 1303
1313 1304 void Universe::print() {
1314 1305 print_on(gclog_or_tty);
1315 1306 }
1316 1307
1317 1308 void Universe::print_on(outputStream* st, bool extended) {
1318 1309 st->print_cr("Heap");
1319 1310 if (!extended) {
1320 1311 heap()->print_on(st);
1321 1312 } else {
1322 1313 heap()->print_extended_on(st);
1323 1314 }
1324 1315 }
1325 1316
1326 1317 void Universe::print_heap_at_SIGBREAK() {
1327 1318 if (PrintHeapAtSIGBREAK) {
1328 1319 MutexLocker hl(Heap_lock);
1329 1320 print_on(tty);
1330 1321 tty->cr();
1331 1322 tty->flush();
1332 1323 }
1333 1324 }
1334 1325
1335 1326 void Universe::print_heap_before_gc(outputStream* st, bool ignore_extended) {
1336 1327 st->print_cr("{Heap before GC invocations=%u (full %u):",
1337 1328 heap()->total_collections(),
1338 1329 heap()->total_full_collections());
1339 1330 if (!PrintHeapAtGCExtended || ignore_extended) {
1340 1331 heap()->print_on(st);
1341 1332 } else {
1342 1333 heap()->print_extended_on(st);
1343 1334 }
1344 1335 }
1345 1336
1346 1337 void Universe::print_heap_after_gc(outputStream* st, bool ignore_extended) {
1347 1338 st->print_cr("Heap after GC invocations=%u (full %u):",
1348 1339 heap()->total_collections(),
1349 1340 heap()->total_full_collections());
1350 1341 if (!PrintHeapAtGCExtended || ignore_extended) {
1351 1342 heap()->print_on(st);
1352 1343 } else {
1353 1344 heap()->print_extended_on(st);
1354 1345 }
1355 1346 st->print_cr("}");
1356 1347 }
1357 1348
1358 1349 void Universe::verify(bool silent, VerifyOption option) {
1359 1350 if (SharedSkipVerify) {
1360 1351 return;
1361 1352 }
1362 1353
1363 1354 // The use of _verify_in_progress is a temporary work around for
1364 1355 // 6320749. Don't bother with a creating a class to set and clear
1365 1356 // it since it is only used in this method and the control flow is
1366 1357 // straight forward.
1367 1358 _verify_in_progress = true;
1368 1359
1369 1360 COMPILER2_PRESENT(
1370 1361 assert(!DerivedPointerTable::is_active(),
1371 1362 "DPT should not be active during verification "
1372 1363 "(of thread stacks below)");
1373 1364 )
1374 1365
1375 1366 ResourceMark rm;
1376 1367 HandleMark hm; // Handles created during verification can be zapped
1377 1368 _verify_count++;
1378 1369
1379 1370 if (!silent) gclog_or_tty->print("[Verifying ");
1380 1371 if (!silent) gclog_or_tty->print("threads ");
1381 1372 Threads::verify();
1382 1373 heap()->verify(silent, option);
1383 1374
1384 1375 if (!silent) gclog_or_tty->print("syms ");
1385 1376 SymbolTable::verify();
1386 1377 if (!silent) gclog_or_tty->print("strs ");
1387 1378 StringTable::verify();
1388 1379 {
1389 1380 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1390 1381 if (!silent) gclog_or_tty->print("zone ");
1391 1382 CodeCache::verify();
1392 1383 }
1393 1384 if (!silent) gclog_or_tty->print("dict ");
1394 1385 SystemDictionary::verify();
1395 1386 if (!silent) gclog_or_tty->print("hand ");
1396 1387 JNIHandles::verify();
1397 1388 if (!silent) gclog_or_tty->print("C-heap ");
1398 1389 os::check_heap();
1399 1390 if (!silent) gclog_or_tty->print("code cache ");
1400 1391 CodeCache::verify_oops();
1401 1392 if (!silent) gclog_or_tty->print_cr("]");
1402 1393
1403 1394 _verify_in_progress = false;
1404 1395 }
1405 1396
1406 1397 // Oop verification (see MacroAssembler::verify_oop)
1407 1398
1408 1399 static uintptr_t _verify_oop_data[2] = {0, (uintptr_t)-1};
1409 1400 static uintptr_t _verify_klass_data[2] = {0, (uintptr_t)-1};
1410 1401
1411 1402
1412 1403 static void calculate_verify_data(uintptr_t verify_data[2],
1413 1404 HeapWord* low_boundary,
1414 1405 HeapWord* high_boundary) {
1415 1406 assert(low_boundary < high_boundary, "bad interval");
1416 1407
1417 1408 // decide which low-order bits we require to be clear:
1418 1409 size_t alignSize = MinObjAlignmentInBytes;
1419 1410 size_t min_object_size = CollectedHeap::min_fill_size();
1420 1411
1421 1412 // make an inclusive limit:
1422 1413 uintptr_t max = (uintptr_t)high_boundary - min_object_size*wordSize;
1423 1414 uintptr_t min = (uintptr_t)low_boundary;
1424 1415 assert(min < max, "bad interval");
1425 1416 uintptr_t diff = max ^ min;
1426 1417
1427 1418 // throw away enough low-order bits to make the diff vanish
1428 1419 uintptr_t mask = (uintptr_t)(-1);
1429 1420 while ((mask & diff) != 0)
1430 1421 mask <<= 1;
1431 1422 uintptr_t bits = (min & mask);
1432 1423 assert(bits == (max & mask), "correct mask");
1433 1424 // check an intermediate value between min and max, just to make sure:
1434 1425 assert(bits == ((min + (max-min)/2) & mask), "correct mask");
1435 1426
1436 1427 // require address alignment, too:
1437 1428 mask |= (alignSize - 1);
1438 1429
1439 1430 if (!(verify_data[0] == 0 && verify_data[1] == (uintptr_t)-1)) {
1440 1431 assert(verify_data[0] == mask && verify_data[1] == bits, "mask stability");
1441 1432 }
1442 1433 verify_data[0] = mask;
1443 1434 verify_data[1] = bits;
1444 1435 }
1445 1436
1446 1437
1447 1438 // Oop verification (see MacroAssembler::verify_oop)
1448 1439 #ifndef PRODUCT
1449 1440
1450 1441 uintptr_t Universe::verify_oop_mask() {
1451 1442 MemRegion m = heap()->reserved_region();
1452 1443 calculate_verify_data(_verify_oop_data,
1453 1444 m.start(),
1454 1445 m.end());
1455 1446 return _verify_oop_data[0];
1456 1447 }
1457 1448
1458 1449
1459 1450
1460 1451 uintptr_t Universe::verify_oop_bits() {
1461 1452 verify_oop_mask();
1462 1453 return _verify_oop_data[1];
1463 1454 }
1464 1455
1465 1456
1466 1457 uintptr_t Universe::verify_klass_mask() {
1467 1458 /* $$$
1468 1459 // A klass can never live in the new space. Since the new and old
1469 1460 // spaces can change size, we must settle for bounds-checking against
1470 1461 // the bottom of the world, plus the smallest possible new and old
1471 1462 // space sizes that may arise during execution.
1472 1463 size_t min_new_size = Universe::new_size(); // in bytes
1473 1464 size_t min_old_size = Universe::old_size(); // in bytes
1474 1465 calculate_verify_data(_verify_klass_data,
1475 1466 (HeapWord*)((uintptr_t)_new_gen->low_boundary + min_new_size + min_old_size),
1476 1467 _perm_gen->high_boundary);
1477 1468 */
1478 1469 // Why doesn't the above just say that klass's always live in the perm
1479 1470 // gen? I'll see if that seems to work...
1480 1471 MemRegion permanent_reserved;
1481 1472 switch (Universe::heap()->kind()) {
1482 1473 default:
1483 1474 // ???: What if a CollectedHeap doesn't have a permanent generation?
1484 1475 ShouldNotReachHere();
1485 1476 break;
1486 1477 case CollectedHeap::GenCollectedHeap:
1487 1478 case CollectedHeap::G1CollectedHeap: {
1488 1479 SharedHeap* sh = (SharedHeap*) Universe::heap();
1489 1480 permanent_reserved = sh->perm_gen()->reserved();
1490 1481 break;
1491 1482 }
1492 1483 #ifndef SERIALGC
1493 1484 case CollectedHeap::ParallelScavengeHeap: {
1494 1485 ParallelScavengeHeap* psh = (ParallelScavengeHeap*) Universe::heap();
1495 1486 permanent_reserved = psh->perm_gen()->reserved();
1496 1487 break;
1497 1488 }
1498 1489 #endif // SERIALGC
1499 1490 }
1500 1491 calculate_verify_data(_verify_klass_data,
1501 1492 permanent_reserved.start(),
1502 1493 permanent_reserved.end());
1503 1494
1504 1495 return _verify_klass_data[0];
1505 1496 }
1506 1497
1507 1498
1508 1499
1509 1500 uintptr_t Universe::verify_klass_bits() {
1510 1501 verify_klass_mask();
1511 1502 return _verify_klass_data[1];
1512 1503 }
1513 1504
1514 1505
1515 1506 uintptr_t Universe::verify_mark_mask() {
1516 1507 return markOopDesc::lock_mask_in_place;
1517 1508 }
1518 1509
1519 1510
1520 1511
1521 1512 uintptr_t Universe::verify_mark_bits() {
1522 1513 intptr_t mask = verify_mark_mask();
1523 1514 intptr_t bits = (intptr_t)markOopDesc::prototype();
1524 1515 assert((bits & ~mask) == 0, "no stray header bits");
1525 1516 return bits;
1526 1517 }
1527 1518 #endif // PRODUCT
1528 1519
1529 1520
1530 1521 void Universe::compute_verify_oop_data() {
1531 1522 verify_oop_mask();
1532 1523 verify_oop_bits();
1533 1524 verify_mark_mask();
1534 1525 verify_mark_bits();
1535 1526 verify_klass_mask();
1536 1527 verify_klass_bits();
1537 1528 }
1538 1529
1539 1530
1540 1531 void CommonMethodOopCache::init(klassOop k, methodOop m, TRAPS) {
1541 1532 if (!UseSharedSpaces) {
1542 1533 _klass = k;
1543 1534 }
1544 1535 #ifndef PRODUCT
1545 1536 else {
1546 1537 // sharing initilization should have already set up _klass
1547 1538 assert(_klass != NULL, "just checking");
1548 1539 }
1549 1540 #endif
1550 1541
1551 1542 _method_idnum = m->method_idnum();
1552 1543 assert(_method_idnum >= 0, "sanity check");
1553 1544 }
1554 1545
1555 1546
1556 1547 ActiveMethodOopsCache::~ActiveMethodOopsCache() {
1557 1548 if (_prev_methods != NULL) {
1558 1549 for (int i = _prev_methods->length() - 1; i >= 0; i--) {
1559 1550 jweak method_ref = _prev_methods->at(i);
1560 1551 if (method_ref != NULL) {
1561 1552 JNIHandles::destroy_weak_global(method_ref);
1562 1553 }
1563 1554 }
1564 1555 delete _prev_methods;
1565 1556 _prev_methods = NULL;
1566 1557 }
1567 1558 }
1568 1559
1569 1560
1570 1561 void ActiveMethodOopsCache::add_previous_version(const methodOop method) {
1571 1562 assert(Thread::current()->is_VM_thread(),
1572 1563 "only VMThread can add previous versions");
1573 1564
1574 1565 if (_prev_methods == NULL) {
1575 1566 // This is the first previous version so make some space.
1576 1567 // Start with 2 elements under the assumption that the class
1577 1568 // won't be redefined much.
1578 1569 _prev_methods = new (ResourceObj::C_HEAP, mtClass) GrowableArray<jweak>(2, true);
1579 1570 }
1580 1571
1581 1572 // RC_TRACE macro has an embedded ResourceMark
1582 1573 RC_TRACE(0x00000100,
1583 1574 ("add: %s(%s): adding prev version ref for cached method @%d",
1584 1575 method->name()->as_C_string(), method->signature()->as_C_string(),
1585 1576 _prev_methods->length()));
1586 1577
1587 1578 methodHandle method_h(method);
1588 1579 jweak method_ref = JNIHandles::make_weak_global(method_h);
1589 1580 _prev_methods->append(method_ref);
1590 1581
1591 1582 // Using weak references allows previous versions of the cached
1592 1583 // method to be GC'ed when they are no longer needed. Since the
1593 1584 // caller is the VMThread and we are at a safepoint, this is a good
1594 1585 // time to clear out unused weak references.
1595 1586
1596 1587 for (int i = _prev_methods->length() - 1; i >= 0; i--) {
1597 1588 jweak method_ref = _prev_methods->at(i);
1598 1589 assert(method_ref != NULL, "weak method ref was unexpectedly cleared");
1599 1590 if (method_ref == NULL) {
1600 1591 _prev_methods->remove_at(i);
1601 1592 // Since we are traversing the array backwards, we don't have to
1602 1593 // do anything special with the index.
1603 1594 continue; // robustness
1604 1595 }
1605 1596
1606 1597 methodOop m = (methodOop)JNIHandles::resolve(method_ref);
1607 1598 if (m == NULL) {
1608 1599 // this method entry has been GC'ed so remove it
1609 1600 JNIHandles::destroy_weak_global(method_ref);
1610 1601 _prev_methods->remove_at(i);
1611 1602 } else {
1612 1603 // RC_TRACE macro has an embedded ResourceMark
1613 1604 RC_TRACE(0x00000400, ("add: %s(%s): previous cached method @%d is alive",
1614 1605 m->name()->as_C_string(), m->signature()->as_C_string(), i));
1615 1606 }
1616 1607 }
1617 1608 } // end add_previous_version()
1618 1609
1619 1610
1620 1611 bool ActiveMethodOopsCache::is_same_method(const methodOop method) const {
1621 1612 instanceKlass* ik = instanceKlass::cast(klass());
1622 1613 methodOop check_method = ik->method_with_idnum(method_idnum());
1623 1614 assert(check_method != NULL, "sanity check");
1624 1615 if (check_method == method) {
1625 1616 // done with the easy case
1626 1617 return true;
1627 1618 }
1628 1619
1629 1620 if (_prev_methods != NULL) {
1630 1621 // The cached method has been redefined at least once so search
1631 1622 // the previous versions for a match.
1632 1623 for (int i = 0; i < _prev_methods->length(); i++) {
1633 1624 jweak method_ref = _prev_methods->at(i);
1634 1625 assert(method_ref != NULL, "weak method ref was unexpectedly cleared");
1635 1626 if (method_ref == NULL) {
1636 1627 continue; // robustness
1637 1628 }
1638 1629
1639 1630 check_method = (methodOop)JNIHandles::resolve(method_ref);
1640 1631 if (check_method == method) {
1641 1632 // a previous version matches
1642 1633 return true;
1643 1634 }
1644 1635 }
1645 1636 }
1646 1637
1647 1638 // either no previous versions or no previous version matched
1648 1639 return false;
1649 1640 }
1650 1641
1651 1642
1652 1643 methodOop LatestMethodOopCache::get_methodOop() {
1653 1644 instanceKlass* ik = instanceKlass::cast(klass());
1654 1645 methodOop m = ik->method_with_idnum(method_idnum());
1655 1646 assert(m != NULL, "sanity check");
1656 1647 return m;
1657 1648 }
1658 1649
1659 1650
1660 1651 #ifdef ASSERT
1661 1652 // Release dummy object(s) at bottom of heap
1662 1653 bool Universe::release_fullgc_alot_dummy() {
1663 1654 MutexLocker ml(FullGCALot_lock);
1664 1655 if (_fullgc_alot_dummy_array != NULL) {
1665 1656 if (_fullgc_alot_dummy_next >= _fullgc_alot_dummy_array->length()) {
1666 1657 // No more dummies to release, release entire array instead
1667 1658 _fullgc_alot_dummy_array = NULL;
1668 1659 return false;
1669 1660 }
1670 1661 if (!UseConcMarkSweepGC) {
1671 1662 // Release dummy at bottom of old generation
1672 1663 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1673 1664 }
1674 1665 // Release dummy at bottom of permanent generation
1675 1666 _fullgc_alot_dummy_array->obj_at_put(_fullgc_alot_dummy_next++, NULL);
1676 1667 }
1677 1668 return true;
1678 1669 }
1679 1670
1680 1671 #endif // ASSERT
↓ open down ↓ |
626 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX