Mercurial > hg > truffle
annotate src/share/vm/memory/dump.cpp @ 196:d1605aabd0a1 jdk7-b30
6719955: Update copyright year
Summary: Update copyright year for files that have been modified in 2008
Reviewed-by: ohair, tbell
| author | xdono |
|---|---|
| date | Wed, 02 Jul 2008 12:55:16 -0700 |
| parents | ba764ed4b6f2 |
| children | 850fdf70db2b 6e76352f1f62 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 196 | 2 * Copyright 2003-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/_dump.cpp.incl" | |
| 27 | |
| 28 | |
| 29 // Closure to set up the fingerprint field for all methods. | |
| 30 | |
| 31 class FingerprintMethodsClosure: public ObjectClosure { | |
| 32 public: | |
| 33 void do_object(oop obj) { | |
| 34 if (obj->is_method()) { | |
| 35 methodOop mobj = (methodOop)obj; | |
| 36 ResourceMark rm; | |
| 37 (new Fingerprinter(mobj))->fingerprint(); | |
| 38 } | |
| 39 } | |
| 40 }; | |
| 41 | |
| 42 | |
| 43 | |
| 44 // Closure to set the hash value (String.hash field) in all of the | |
| 45 // String objects in the heap. Setting the hash value is not required. | |
| 46 // However, setting the value in advance prevents the value from being | |
| 47 // written later, increasing the likelihood that the shared page contain | |
| 48 // the hash can be shared. | |
| 49 // | |
| 50 // NOTE THAT the algorithm in StringTable::hash_string() MUST MATCH the | |
| 51 // algorithm in java.lang.String.hashCode(). | |
| 52 | |
| 53 class StringHashCodeClosure: public OopClosure { | |
| 54 private: | |
| 55 Thread* THREAD; | |
| 56 int hash_offset; | |
| 57 public: | |
| 58 StringHashCodeClosure(Thread* t) { | |
| 59 THREAD = t; | |
| 60 hash_offset = java_lang_String::hash_offset_in_bytes(); | |
| 61 } | |
| 62 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
63 void do_oop(oop* p) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
64 if (p != NULL) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
65 oop obj = *p; |
| 0 | 66 if (obj->klass() == SystemDictionary::string_klass()) { |
| 67 | |
| 68 int hash; | |
| 69 typeArrayOop value = java_lang_String::value(obj); | |
| 70 int length = java_lang_String::length(obj); | |
| 71 if (length == 0) { | |
| 72 hash = 0; | |
| 73 } else { | |
| 74 int offset = java_lang_String::offset(obj); | |
| 75 jchar* s = value->char_at_addr(offset); | |
| 76 hash = StringTable::hash_string(s, length); | |
| 77 } | |
| 78 obj->int_field_put(hash_offset, hash); | |
| 79 } | |
| 80 } | |
| 81 } | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
82 void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
| 0 | 83 }; |
| 84 | |
| 85 | |
| 86 // Remove data from objects which should not appear in the shared file | |
| 87 // (as it pertains only to the current JVM). | |
| 88 | |
| 89 class RemoveUnshareableInfoClosure : public ObjectClosure { | |
| 90 public: | |
| 91 void do_object(oop obj) { | |
| 92 // Zap data from the objects which is pertains only to this JVM. We | |
| 93 // want that data recreated in new JVMs when the shared file is used. | |
| 94 if (obj->is_method()) { | |
| 95 ((methodOop)obj)->remove_unshareable_info(); | |
| 96 } | |
| 97 else if (obj->is_klass()) { | |
| 98 Klass::cast((klassOop)obj)->remove_unshareable_info(); | |
| 99 } | |
| 100 | |
| 101 // Don't save compiler related special oops (shouldn't be any yet). | |
| 102 if (obj->is_methodData() || obj->is_compiledICHolder()) { | |
| 103 ShouldNotReachHere(); | |
| 104 } | |
| 105 } | |
| 106 }; | |
| 107 | |
| 108 | |
| 109 static bool mark_object(oop obj) { | |
| 110 if (obj != NULL && | |
| 111 !obj->is_shared() && | |
| 112 !obj->is_forwarded() && | |
| 113 !obj->is_gc_marked()) { | |
| 114 obj->set_mark(markOopDesc::prototype()->set_marked()); | |
| 115 return true; | |
| 116 } | |
| 117 | |
| 118 return false; | |
| 119 } | |
| 120 | |
| 121 // Closure: mark objects closure. | |
| 122 | |
| 123 class MarkObjectsOopClosure : public OopClosure { | |
| 124 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
125 void do_oop(oop* p) { mark_object(*p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
126 void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
| 0 | 127 }; |
| 128 | |
| 129 | |
| 130 class MarkObjectsSkippingKlassesOopClosure : public OopClosure { | |
| 131 public: | |
| 132 void do_oop(oop* pobj) { | |
| 133 oop obj = *pobj; | |
| 134 if (obj != NULL && | |
| 135 !obj->is_klass()) { | |
| 136 mark_object(obj); | |
| 137 } | |
| 138 } | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
139 void do_oop(narrowOop* pobj) { ShouldNotReachHere(); } |
| 0 | 140 }; |
| 141 | |
| 142 | |
| 143 static void mark_object_recursive_skipping_klasses(oop obj) { | |
| 144 mark_object(obj); | |
| 145 if (obj != NULL) { | |
| 146 MarkObjectsSkippingKlassesOopClosure mark_all; | |
| 147 obj->oop_iterate(&mark_all); | |
| 148 } | |
| 149 } | |
| 150 | |
| 151 | |
| 152 // Closure: mark common read-only objects, excluding symbols | |
| 153 | |
| 154 class MarkCommonReadOnly : public ObjectClosure { | |
| 155 private: | |
| 156 MarkObjectsOopClosure mark_all; | |
| 157 public: | |
| 158 void do_object(oop obj) { | |
| 159 | |
| 160 // Mark all constMethod objects. | |
| 161 | |
| 162 if (obj->is_constMethod()) { | |
| 163 mark_object(obj); | |
| 164 mark_object(constMethodOop(obj)->stackmap_data()); | |
| 165 // Exception tables are needed by ci code during compilation. | |
| 166 mark_object(constMethodOop(obj)->exception_table()); | |
| 167 } | |
| 168 | |
| 169 // Mark objects referenced by klass objects which are read-only. | |
| 170 | |
| 171 else if (obj->is_klass()) { | |
| 172 Klass* k = Klass::cast((klassOop)obj); | |
| 173 mark_object(k->secondary_supers()); | |
| 174 | |
| 175 // The METHODS() OBJARRAYS CANNOT BE MADE READ-ONLY, even though | |
| 176 // it is never modified. Otherwise, they will be pre-marked; the | |
| 177 // GC marking phase will skip them; and by skipping them will fail | |
| 178 // to mark the methods objects referenced by the array. | |
| 179 | |
| 180 if (obj->blueprint()->oop_is_instanceKlass()) { | |
| 181 instanceKlass* ik = instanceKlass::cast((klassOop)obj); | |
| 182 mark_object(ik->method_ordering()); | |
| 183 mark_object(ik->local_interfaces()); | |
| 184 mark_object(ik->transitive_interfaces()); | |
| 185 mark_object(ik->fields()); | |
| 186 | |
| 187 mark_object(ik->class_annotations()); | |
| 188 | |
| 189 mark_object_recursive_skipping_klasses(ik->fields_annotations()); | |
| 190 mark_object_recursive_skipping_klasses(ik->methods_annotations()); | |
| 191 mark_object_recursive_skipping_klasses(ik->methods_parameter_annotations()); | |
| 192 mark_object_recursive_skipping_klasses(ik->methods_default_annotations()); | |
| 193 | |
| 194 typeArrayOop inner_classes = ik->inner_classes(); | |
| 195 if (inner_classes != NULL) { | |
| 196 mark_object(inner_classes); | |
| 197 } | |
| 198 } | |
| 199 } | |
| 200 } | |
| 201 }; | |
| 202 | |
| 203 | |
| 204 // Closure: mark common symbols | |
| 205 | |
| 206 class MarkCommonSymbols : public ObjectClosure { | |
| 207 private: | |
| 208 MarkObjectsOopClosure mark_all; | |
| 209 public: | |
| 210 void do_object(oop obj) { | |
| 211 | |
| 212 // Mark symbols refered to by method objects. | |
| 213 | |
| 214 if (obj->is_method()) { | |
| 215 methodOop m = methodOop(obj); | |
| 216 mark_object(m->name()); | |
| 217 mark_object(m->signature()); | |
| 218 } | |
| 219 | |
| 220 // Mark symbols referenced by klass objects which are read-only. | |
| 221 | |
| 222 else if (obj->is_klass()) { | |
| 223 | |
| 224 if (obj->blueprint()->oop_is_instanceKlass()) { | |
| 225 instanceKlass* ik = instanceKlass::cast((klassOop)obj); | |
| 226 mark_object(ik->name()); | |
| 227 mark_object(ik->generic_signature()); | |
| 228 mark_object(ik->source_file_name()); | |
| 229 mark_object(ik->source_debug_extension()); | |
| 230 | |
| 231 typeArrayOop inner_classes = ik->inner_classes(); | |
| 232 if (inner_classes != NULL) { | |
| 233 int length = inner_classes->length(); | |
| 234 for (int i = 0; | |
| 235 i < length; | |
| 236 i += instanceKlass::inner_class_next_offset) { | |
| 237 int ioff = i + instanceKlass::inner_class_inner_name_offset; | |
| 238 int index = inner_classes->ushort_at(ioff); | |
| 239 if (index != 0) { | |
| 240 mark_object(ik->constants()->symbol_at(index)); | |
| 241 } | |
| 242 } | |
| 243 } | |
| 244 ik->field_names_and_sigs_iterate(&mark_all); | |
| 245 } | |
| 246 } | |
| 247 | |
| 248 // Mark symbols referenced by other constantpool entries. | |
| 249 | |
| 250 if (obj->is_constantPool()) { | |
| 251 constantPoolOop(obj)->shared_symbols_iterate(&mark_all); | |
| 252 } | |
| 253 } | |
| 254 }; | |
| 255 | |
| 256 | |
| 257 // Closure: mark char arrays used by strings | |
| 258 | |
| 259 class MarkStringValues : public ObjectClosure { | |
| 260 private: | |
| 261 MarkObjectsOopClosure mark_all; | |
| 262 public: | |
| 263 void do_object(oop obj) { | |
| 264 | |
| 265 // Character arrays referenced by String objects are read-only. | |
| 266 | |
| 267 if (java_lang_String::is_instance(obj)) { | |
| 268 mark_object(java_lang_String::value(obj)); | |
| 269 } | |
| 270 } | |
| 271 }; | |
| 272 | |
| 273 | |
| 274 #ifdef DEBUG | |
| 275 // Closure: Check for objects left in the heap which have not been moved. | |
| 276 | |
| 277 class CheckRemainingObjects : public ObjectClosure { | |
| 278 private: | |
| 279 int count; | |
| 280 | |
| 281 public: | |
| 282 CheckRemainingObjects() { | |
| 283 count = 0; | |
| 284 } | |
| 285 | |
| 286 void do_object(oop obj) { | |
| 287 if (!obj->is_shared() && | |
| 288 !obj->is_forwarded()) { | |
| 289 ++count; | |
| 290 if (Verbose) { | |
| 291 tty->print("Unreferenced object: "); | |
| 292 obj->print_on(tty); | |
| 293 } | |
| 294 } | |
| 295 } | |
| 296 | |
| 297 void status() { | |
| 298 tty->print_cr("%d objects no longer referenced, not shared.", count); | |
| 299 } | |
| 300 }; | |
| 301 #endif | |
| 302 | |
| 303 | |
| 304 // Closure: Mark remaining objects read-write, except Strings. | |
| 305 | |
| 306 class MarkReadWriteObjects : public ObjectClosure { | |
| 307 private: | |
| 308 MarkObjectsOopClosure mark_objects; | |
| 309 public: | |
| 310 void do_object(oop obj) { | |
| 311 | |
| 312 // The METHODS() OBJARRAYS CANNOT BE MADE READ-ONLY, even though | |
| 313 // it is never modified. Otherwise, they will be pre-marked; the | |
| 314 // GC marking phase will skip them; and by skipping them will fail | |
| 315 // to mark the methods objects referenced by the array. | |
| 316 | |
| 317 if (obj->is_klass()) { | |
| 318 mark_object(obj); | |
| 319 Klass* k = klassOop(obj)->klass_part(); | |
| 320 mark_object(k->java_mirror()); | |
| 321 if (obj->blueprint()->oop_is_instanceKlass()) { | |
| 322 instanceKlass* ik = (instanceKlass*)k; | |
| 323 mark_object(ik->methods()); | |
| 324 mark_object(ik->constants()); | |
| 325 } | |
| 326 if (obj->blueprint()->oop_is_javaArray()) { | |
| 327 arrayKlass* ak = (arrayKlass*)k; | |
| 328 mark_object(ak->component_mirror()); | |
| 329 } | |
| 330 return; | |
| 331 } | |
| 332 | |
| 333 // Mark constantPool tags and the constantPoolCache. | |
| 334 | |
| 335 else if (obj->is_constantPool()) { | |
| 336 constantPoolOop pool = constantPoolOop(obj); | |
| 337 mark_object(pool->cache()); | |
| 338 pool->shared_tags_iterate(&mark_objects); | |
| 339 return; | |
| 340 } | |
| 341 | |
| 342 // Mark all method objects. | |
| 343 | |
| 344 if (obj->is_method()) { | |
| 345 mark_object(obj); | |
| 346 } | |
| 347 } | |
| 348 }; | |
| 349 | |
| 350 | |
| 351 // Closure: Mark String objects read-write. | |
| 352 | |
| 353 class MarkStringObjects : public ObjectClosure { | |
| 354 private: | |
| 355 MarkObjectsOopClosure mark_objects; | |
| 356 public: | |
| 357 void do_object(oop obj) { | |
| 358 | |
| 359 // Mark String objects referenced by constant pool entries. | |
| 360 | |
| 361 if (obj->is_constantPool()) { | |
| 362 constantPoolOop pool = constantPoolOop(obj); | |
| 363 pool->shared_strings_iterate(&mark_objects); | |
| 364 return; | |
| 365 } | |
| 366 } | |
| 367 }; | |
| 368 | |
| 369 | |
| 370 // Move objects matching specified type (ie. lock_bits) to the specified | |
| 371 // space. | |
| 372 | |
| 373 class MoveMarkedObjects : public ObjectClosure { | |
| 374 private: | |
| 375 OffsetTableContigSpace* _space; | |
| 376 bool _read_only; | |
| 377 | |
| 378 public: | |
| 379 MoveMarkedObjects(OffsetTableContigSpace* space, bool read_only) { | |
| 380 _space = space; | |
| 381 _read_only = read_only; | |
| 382 } | |
| 383 | |
| 384 void do_object(oop obj) { | |
| 385 if (obj->is_shared()) { | |
| 386 return; | |
| 387 } | |
| 388 if (obj->is_gc_marked() && obj->forwardee() == NULL) { | |
| 389 int s = obj->size(); | |
| 390 oop sh_obj = (oop)_space->allocate(s); | |
| 391 if (sh_obj == NULL) { | |
| 392 if (_read_only) { | |
| 393 warning("\nThe permanent generation read only space is not large " | |
| 394 "enough to \npreload requested classes. Use " | |
| 395 "-XX:SharedReadOnlySize= to increase \nthe initial " | |
| 396 "size of the read only space.\n"); | |
| 397 } else { | |
| 398 warning("\nThe permanent generation read write space is not large " | |
| 399 "enough to \npreload requested classes. Use " | |
| 400 "-XX:SharedReadWriteSize= to increase \nthe initial " | |
| 401 "size of the read write space.\n"); | |
| 402 } | |
| 403 exit(2); | |
| 404 } | |
| 405 if (PrintSharedSpaces && Verbose && WizardMode) { | |
| 406 tty->print_cr("\nMoveMarkedObjects: " PTR_FORMAT " -> " PTR_FORMAT " %s", obj, sh_obj, | |
| 407 (_read_only ? "ro" : "rw")); | |
| 408 } | |
| 409 Copy::aligned_disjoint_words((HeapWord*)obj, (HeapWord*)sh_obj, s); | |
| 410 obj->forward_to(sh_obj); | |
| 411 if (_read_only) { | |
| 412 // Readonly objects: set hash value to self pointer and make gc_marked. | |
| 413 sh_obj->forward_to(sh_obj); | |
| 414 } else { | |
| 415 sh_obj->init_mark(); | |
| 416 } | |
| 417 } | |
| 418 } | |
| 419 }; | |
| 420 | |
| 421 static void mark_and_move(oop obj, MoveMarkedObjects* move) { | |
| 422 if (mark_object(obj)) move->do_object(obj); | |
| 423 } | |
| 424 | |
| 425 enum order_policy { | |
| 426 OP_favor_startup = 0, | |
| 427 OP_balanced = 1, | |
| 428 OP_favor_runtime = 2 | |
| 429 }; | |
| 430 | |
| 431 static void mark_and_move_for_policy(order_policy policy, oop obj, MoveMarkedObjects* move) { | |
| 432 if (SharedOptimizeColdStartPolicy >= policy) mark_and_move(obj, move); | |
| 433 } | |
| 434 | |
| 435 class MarkAndMoveOrderedReadOnly : public ObjectClosure { | |
| 436 private: | |
| 437 MoveMarkedObjects *_move_ro; | |
| 438 | |
| 439 public: | |
| 440 MarkAndMoveOrderedReadOnly(MoveMarkedObjects *move_ro) : _move_ro(move_ro) {} | |
| 441 | |
| 442 void do_object(oop obj) { | |
| 443 if (obj->is_klass() && obj->blueprint()->oop_is_instanceKlass()) { | |
| 444 instanceKlass* ik = instanceKlass::cast((klassOop)obj); | |
| 445 int i; | |
| 446 | |
| 447 mark_and_move_for_policy(OP_favor_startup, ik->name(), _move_ro); | |
| 448 | |
| 449 if (ik->super() != NULL) { | |
| 450 do_object(ik->super()); | |
| 451 } | |
| 452 | |
| 453 objArrayOop interfaces = ik->local_interfaces(); | |
| 454 mark_and_move_for_policy(OP_favor_startup, interfaces, _move_ro); | |
| 455 for(i = 0; i < interfaces->length(); i++) { | |
| 456 klassOop k = klassOop(interfaces->obj_at(i)); | |
| 457 mark_and_move_for_policy(OP_favor_startup, k->klass_part()->name(), _move_ro); | |
| 458 do_object(k); | |
| 459 } | |
| 460 | |
| 461 objArrayOop methods = ik->methods(); | |
| 462 for(i = 0; i < methods->length(); i++) { | |
| 463 methodOop m = methodOop(methods->obj_at(i)); | |
| 464 mark_and_move_for_policy(OP_favor_startup, m->constMethod(), _move_ro); | |
| 465 mark_and_move_for_policy(OP_favor_runtime, m->constMethod()->exception_table(), _move_ro); | |
| 466 mark_and_move_for_policy(OP_favor_runtime, m->constMethod()->stackmap_data(), _move_ro); | |
| 467 | |
| 468 // We don't move the name symbolOop here because it may invalidate | |
| 469 // method ordering, which is dependent on the address of the name | |
| 470 // symbolOop. It will get promoted later with the other symbols. | |
| 471 // Method name is rarely accessed during classloading anyway. | |
| 472 // mark_and_move_for_policy(OP_balanced, m->name(), _move_ro); | |
| 473 | |
| 474 mark_and_move_for_policy(OP_favor_startup, m->signature(), _move_ro); | |
| 475 } | |
| 476 | |
| 477 mark_and_move_for_policy(OP_favor_startup, ik->transitive_interfaces(), _move_ro); | |
| 478 mark_and_move_for_policy(OP_favor_startup, ik->fields(), _move_ro); | |
| 479 | |
| 480 mark_and_move_for_policy(OP_favor_runtime, ik->secondary_supers(), _move_ro); | |
| 481 mark_and_move_for_policy(OP_favor_runtime, ik->method_ordering(), _move_ro); | |
| 482 mark_and_move_for_policy(OP_favor_runtime, ik->class_annotations(), _move_ro); | |
| 483 mark_and_move_for_policy(OP_favor_runtime, ik->fields_annotations(), _move_ro); | |
| 484 mark_and_move_for_policy(OP_favor_runtime, ik->methods_annotations(), _move_ro); | |
| 485 mark_and_move_for_policy(OP_favor_runtime, ik->methods_parameter_annotations(), _move_ro); | |
| 486 mark_and_move_for_policy(OP_favor_runtime, ik->methods_default_annotations(), _move_ro); | |
| 487 mark_and_move_for_policy(OP_favor_runtime, ik->inner_classes(), _move_ro); | |
| 488 mark_and_move_for_policy(OP_favor_runtime, ik->secondary_supers(), _move_ro); | |
| 489 } | |
| 490 } | |
| 491 }; | |
| 492 | |
| 493 class MarkAndMoveOrderedReadWrite: public ObjectClosure { | |
| 494 private: | |
| 495 MoveMarkedObjects *_move_rw; | |
| 496 | |
| 497 public: | |
| 498 MarkAndMoveOrderedReadWrite(MoveMarkedObjects *move_rw) : _move_rw(move_rw) {} | |
| 499 | |
| 500 void do_object(oop obj) { | |
| 501 if (obj->is_klass() && obj->blueprint()->oop_is_instanceKlass()) { | |
| 502 instanceKlass* ik = instanceKlass::cast((klassOop)obj); | |
| 503 int i; | |
| 504 | |
| 505 mark_and_move_for_policy(OP_favor_startup, ik->as_klassOop(), _move_rw); | |
| 506 | |
| 507 if (ik->super() != NULL) { | |
| 508 do_object(ik->super()); | |
| 509 } | |
| 510 | |
| 511 objArrayOop interfaces = ik->local_interfaces(); | |
| 512 for(i = 0; i < interfaces->length(); i++) { | |
| 513 klassOop k = klassOop(interfaces->obj_at(i)); | |
| 514 mark_and_move_for_policy(OP_favor_startup, k, _move_rw); | |
| 515 do_object(k); | |
| 516 } | |
| 517 | |
| 518 objArrayOop methods = ik->methods(); | |
| 519 mark_and_move_for_policy(OP_favor_startup, methods, _move_rw); | |
| 520 for(i = 0; i < methods->length(); i++) { | |
| 521 methodOop m = methodOop(methods->obj_at(i)); | |
| 522 mark_and_move_for_policy(OP_favor_startup, m, _move_rw); | |
| 523 mark_and_move_for_policy(OP_favor_startup, ik->constants(), _move_rw); // idempotent | |
| 524 mark_and_move_for_policy(OP_balanced, ik->constants()->cache(), _move_rw); // idempotent | |
| 525 mark_and_move_for_policy(OP_balanced, ik->constants()->tags(), _move_rw); // idempotent | |
| 526 } | |
| 527 | |
| 528 mark_and_move_for_policy(OP_favor_startup, ik->as_klassOop()->klass(), _move_rw); | |
| 529 mark_and_move_for_policy(OP_favor_startup, ik->constants()->klass(), _move_rw); | |
| 530 | |
| 531 // Although Java mirrors are marked in MarkReadWriteObjects, | |
| 532 // apparently they were never moved into shared spaces since | |
| 533 // MoveMarkedObjects skips marked instance oops. This may | |
| 534 // be a bug in the original implementation or simply the vestige | |
| 535 // of an abandoned experiment. Nevertheless we leave a hint | |
| 536 // here in case this capability is ever correctly implemented. | |
| 537 // | |
| 538 // mark_and_move_for_policy(OP_favor_runtime, ik->java_mirror(), _move_rw); | |
| 539 } | |
| 540 } | |
| 541 | |
| 542 }; | |
| 543 | |
| 544 // Adjust references in oops to refer to shared spaces. | |
| 545 | |
| 546 class ResolveForwardingClosure: public OopClosure { | |
| 547 public: | |
| 548 void do_oop(oop* p) { | |
| 549 oop obj = *p; | |
| 550 if (!obj->is_shared()) { | |
| 551 if (obj != NULL) { | |
| 552 oop f = obj->forwardee(); | |
| 553 guarantee(f->is_shared(), "Oop doesn't refer to shared space."); | |
| 554 *p = f; | |
| 555 } | |
| 556 } | |
| 557 } | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
558 void do_oop(narrowOop* pobj) { ShouldNotReachHere(); } |
| 0 | 559 }; |
| 560 | |
| 561 | |
| 562 void sort_methods(instanceKlass* ik, TRAPS) { | |
| 563 klassOop super = ik->super(); | |
| 564 if (super != NULL) { | |
| 565 sort_methods(instanceKlass::cast(super), THREAD); | |
| 566 } | |
| 567 | |
| 568 // The methods array must be ordered by symbolOop address. (See | |
| 569 // classFileParser.cpp where methods in a class are originally | |
| 570 // sorted.) Since objects have just be reordered, this must be | |
| 571 // corrected. | |
| 572 methodOopDesc::sort_methods(ik->methods(), | |
| 573 ik->methods_annotations(), | |
| 574 ik->methods_parameter_annotations(), | |
| 575 ik->methods_default_annotations(), | |
| 576 true /* idempotent, slow */); | |
| 577 | |
| 578 // Itable indices are calculated based on methods array order | |
| 579 // (see klassItable::compute_itable_index()). Must reinitialize. | |
| 580 // We assume that since checkconstraints is false, this method | |
| 581 // cannot throw an exception. An exception here would be | |
| 582 // problematic since this is the VMThread, not a JavaThread. | |
| 583 ik->itable()->initialize_itable(false, THREAD); | |
| 584 } | |
| 585 | |
| 586 // Sort methods if the oop is an instanceKlass. | |
| 587 | |
| 588 class SortMethodsClosure: public ObjectClosure { | |
| 589 private: | |
| 590 Thread* _thread; | |
| 591 | |
| 592 public: | |
| 593 SortMethodsClosure(Thread* thread) : _thread(thread) {} | |
| 594 | |
| 595 void do_object(oop obj) { | |
| 596 // instanceKlass objects need some adjustment. | |
| 597 if (obj->blueprint()->oop_is_instanceKlass()) { | |
| 598 instanceKlass* ik = instanceKlass::cast((klassOop)obj); | |
| 599 | |
| 600 sort_methods(ik, _thread); | |
| 601 } | |
| 602 } | |
| 603 }; | |
| 604 | |
| 605 | |
| 606 // Adjust references in oops to refer to shared spaces. | |
| 607 | |
| 608 class PatchOopsClosure: public ObjectClosure { | |
| 609 private: | |
| 610 Thread* _thread; | |
| 611 ResolveForwardingClosure resolve; | |
| 612 | |
| 613 public: | |
| 614 PatchOopsClosure(Thread* thread) : _thread(thread) {} | |
| 615 | |
| 616 void do_object(oop obj) { | |
| 617 obj->oop_iterate_header(&resolve); | |
| 618 obj->oop_iterate(&resolve); | |
| 619 | |
| 620 assert(obj->klass()->is_shared(), "Klass not pointing into shared space."); | |
| 621 | |
| 622 // If the object is a Java object or class which might (in the | |
| 623 // future) contain a reference to a young gen object, add it to the | |
| 624 // list. | |
| 625 | |
| 626 if (obj->is_klass() || obj->is_instance()) { | |
| 627 if (obj->is_klass() || | |
| 628 obj->is_a(SystemDictionary::class_klass()) || | |
| 629 obj->is_a(SystemDictionary::throwable_klass())) { | |
| 630 // Do nothing | |
| 631 } | |
| 632 else if (obj->is_a(SystemDictionary::string_klass())) { | |
| 633 // immutable objects. | |
| 634 } else { | |
| 635 // someone added an object we hadn't accounted for. | |
| 636 ShouldNotReachHere(); | |
| 637 } | |
| 638 } | |
| 639 } | |
| 640 }; | |
| 641 | |
| 642 | |
| 643 // Empty the young and old generations. | |
| 644 | |
| 645 class ClearSpaceClosure : public SpaceClosure { | |
| 646 public: | |
| 647 void do_space(Space* s) { | |
| 648 s->clear(); | |
| 649 } | |
| 650 }; | |
| 651 | |
| 652 | |
| 653 // Closure for serializing initialization data out to a data area to be | |
| 654 // written to the shared file. | |
| 655 | |
| 656 class WriteClosure : public SerializeOopClosure { | |
| 657 private: | |
| 658 oop* top; | |
| 659 char* end; | |
| 660 | |
| 661 void out_of_space() { | |
| 662 warning("\nThe shared miscellaneous data space is not large " | |
| 663 "enough to \npreload requested classes. Use " | |
| 664 "-XX:SharedMiscDataSize= to increase \nthe initial " | |
| 665 "size of the miscellaneous data space.\n"); | |
| 666 exit(2); | |
| 667 } | |
| 668 | |
| 669 | |
| 670 inline void check_space() { | |
| 671 if ((char*)top + sizeof(oop) > end) { | |
| 672 out_of_space(); | |
| 673 } | |
| 674 } | |
| 675 | |
| 676 | |
| 677 public: | |
| 678 WriteClosure(char* md_top, char* md_end) { | |
| 679 top = (oop*)md_top; | |
| 680 end = md_end; | |
| 681 } | |
| 682 | |
| 683 char* get_top() { return (char*)top; } | |
| 684 | |
| 685 void do_oop(oop* p) { | |
| 686 check_space(); | |
| 687 oop obj = *p; | |
| 688 assert(obj->is_oop_or_null(), "invalid oop"); | |
| 689 assert(obj == NULL || obj->is_shared(), | |
| 690 "Oop in shared space not pointing into shared space."); | |
| 691 *top = obj; | |
| 692 ++top; | |
| 693 } | |
| 694 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
695 void do_oop(narrowOop* pobj) { ShouldNotReachHere(); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
696 |
| 0 | 697 void do_int(int* p) { |
| 698 check_space(); | |
| 699 *top = (oop)(intptr_t)*p; | |
| 700 ++top; | |
| 701 } | |
| 702 | |
| 703 void do_size_t(size_t* p) { | |
| 704 check_space(); | |
| 705 *top = (oop)(intptr_t)*p; | |
| 706 ++top; | |
| 707 } | |
| 708 | |
| 709 void do_ptr(void** p) { | |
| 710 check_space(); | |
| 711 *top = (oop)*p; | |
| 712 ++top; | |
| 713 } | |
| 714 | |
| 715 void do_ptr(HeapWord** p) { do_ptr((void **) p); } | |
| 716 | |
| 717 void do_tag(int tag) { | |
| 718 check_space(); | |
| 719 *top = (oop)(intptr_t)tag; | |
| 720 ++top; | |
| 721 } | |
| 722 | |
| 723 void do_region(u_char* start, size_t size) { | |
| 724 if ((char*)top + size > end) { | |
| 725 out_of_space(); | |
| 726 } | |
| 727 assert((intptr_t)start % sizeof(oop) == 0, "bad alignment"); | |
| 728 assert(size % sizeof(oop) == 0, "bad size"); | |
| 729 do_tag((int)size); | |
| 730 while (size > 0) { | |
| 731 *top = *(oop*)start; | |
| 732 ++top; | |
| 733 start += sizeof(oop); | |
| 734 size -= sizeof(oop); | |
| 735 } | |
| 736 } | |
| 737 | |
| 738 bool reading() const { return false; } | |
| 739 }; | |
| 740 | |
| 741 | |
| 742 class ResolveConstantPoolsClosure : public ObjectClosure { | |
| 743 private: | |
| 744 TRAPS; | |
| 745 public: | |
| 746 ResolveConstantPoolsClosure(Thread *t) { | |
| 747 __the_thread__ = t; | |
| 748 } | |
| 749 void do_object(oop obj) { | |
| 750 if (obj->is_constantPool()) { | |
| 751 constantPoolOop cpool = (constantPoolOop)obj; | |
| 752 int unresolved = cpool->pre_resolve_shared_klasses(THREAD); | |
| 753 } | |
| 754 } | |
| 755 }; | |
| 756 | |
| 757 | |
| 758 // Print a summary of the contents of the read/write spaces to help | |
| 759 // identify objects which might be able to be made read-only. At this | |
| 760 // point, the objects have been written, and we can trash them as | |
| 761 // needed. | |
| 762 | |
| 763 static void print_contents() { | |
| 764 if (PrintSharedSpaces) { | |
| 765 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 766 CompactingPermGenGen* gen = (CompactingPermGenGen*)gch->perm_gen(); | |
| 767 | |
| 768 // High level summary of the read-only space: | |
| 769 | |
| 770 ClassifyObjectClosure coc; | |
| 771 tty->cr(); tty->print_cr("ReadOnly space:"); | |
| 772 gen->ro_space()->object_iterate(&coc); | |
| 773 coc.print(); | |
| 774 | |
| 775 // High level summary of the read-write space: | |
| 776 | |
| 777 coc.reset(); | |
| 778 tty->cr(); tty->print_cr("ReadWrite space:"); | |
| 779 gen->rw_space()->object_iterate(&coc); | |
| 780 coc.print(); | |
| 781 | |
| 782 // Reset counters | |
| 783 | |
| 784 ClearAllocCountClosure cacc; | |
| 785 gen->ro_space()->object_iterate(&cacc); | |
| 786 gen->rw_space()->object_iterate(&cacc); | |
| 787 coc.reset(); | |
| 788 | |
| 789 // Lower level summary of the read-only space: | |
| 790 | |
| 791 gen->ro_space()->object_iterate(&coc); | |
| 792 tty->cr(); tty->print_cr("ReadOnly space:"); | |
| 793 ClassifyInstanceKlassClosure cikc; | |
| 794 gen->rw_space()->object_iterate(&cikc); | |
| 795 cikc.print(); | |
| 796 | |
| 797 // Reset counters | |
| 798 | |
| 799 gen->ro_space()->object_iterate(&cacc); | |
| 800 gen->rw_space()->object_iterate(&cacc); | |
| 801 coc.reset(); | |
| 802 | |
| 803 // Lower level summary of the read-write space: | |
| 804 | |
| 805 gen->rw_space()->object_iterate(&coc); | |
| 806 cikc.reset(); | |
| 807 tty->cr(); tty->print_cr("ReadWrite space:"); | |
| 808 gen->rw_space()->object_iterate(&cikc); | |
| 809 cikc.print(); | |
| 810 } | |
| 811 } | |
| 812 | |
| 813 | |
| 814 // Patch C++ vtable pointer in klass oops. | |
| 815 | |
| 816 // Klass objects contain references to c++ vtables in the JVM library. | |
| 817 // Fix them to point to our constructed vtables. However, don't iterate | |
| 818 // across the space while doing this, as that causes the vtables to be | |
| 819 // patched, undoing our useful work. Instead, iterate to make a list, | |
| 820 // then use the list to do the fixing. | |
| 821 | |
| 822 class PatchKlassVtables: public ObjectClosure { | |
| 823 private: | |
| 824 void* _vtbl_ptr; | |
| 825 VirtualSpace* _md_vs; | |
| 826 GrowableArray<klassOop>* _klass_objects; | |
| 827 | |
| 828 public: | |
| 829 | |
| 830 PatchKlassVtables(void* vtbl_ptr, VirtualSpace* md_vs) { | |
| 831 _vtbl_ptr = vtbl_ptr; | |
| 832 _md_vs = md_vs; | |
| 833 _klass_objects = new GrowableArray<klassOop>(); | |
| 834 } | |
| 835 | |
| 836 | |
| 837 void do_object(oop obj) { | |
| 838 if (obj->is_klass()) { | |
| 839 _klass_objects->append(klassOop(obj)); | |
| 840 } | |
| 841 } | |
| 842 | |
| 843 | |
| 844 void patch(void** vtbl_list, int vtbl_list_size) { | |
| 845 for (int i = 0; i < _klass_objects->length(); ++i) { | |
| 846 klassOop obj = (klassOop)_klass_objects->at(i); | |
| 847 Klass* k = obj->klass_part(); | |
| 848 void* v = *(void**)k; | |
| 849 | |
| 850 int n; | |
| 851 for (n = 0; n < vtbl_list_size; ++n) { | |
| 852 *(void**)k = NULL; | |
| 853 if (vtbl_list[n] == v) { | |
| 854 *(void**)k = (void**)_vtbl_ptr + | |
| 855 (n * CompactingPermGenGen::num_virtuals); | |
| 856 break; | |
| 857 } | |
| 858 } | |
| 859 guarantee(n < vtbl_list_size, "unable to find matching vtbl pointer"); | |
| 860 } | |
| 861 } | |
| 862 }; | |
| 863 | |
| 864 | |
| 865 // Populate the shared space. | |
| 866 | |
| 867 class VM_PopulateDumpSharedSpace: public VM_Operation { | |
| 868 private: | |
| 869 GrowableArray<oop> *_class_promote_order; | |
| 870 OffsetTableContigSpace* _ro_space; | |
| 871 OffsetTableContigSpace* _rw_space; | |
| 872 VirtualSpace* _md_vs; | |
| 873 VirtualSpace* _mc_vs; | |
| 874 | |
| 875 public: | |
| 876 VM_PopulateDumpSharedSpace(GrowableArray<oop> *class_promote_order, | |
| 877 OffsetTableContigSpace* ro_space, | |
| 878 OffsetTableContigSpace* rw_space, | |
| 879 VirtualSpace* md_vs, VirtualSpace* mc_vs) { | |
| 880 _class_promote_order = class_promote_order; | |
| 881 _ro_space = ro_space; | |
| 882 _rw_space = rw_space; | |
| 883 _md_vs = md_vs; | |
| 884 _mc_vs = mc_vs; | |
| 885 } | |
| 886 | |
| 887 VMOp_Type type() const { return VMOp_PopulateDumpSharedSpace; } | |
| 888 void doit() { | |
| 889 Thread* THREAD = VMThread::vm_thread(); | |
| 890 NOT_PRODUCT(SystemDictionary::verify();) | |
| 891 // The following guarantee is meant to ensure that no loader constraints | |
| 892 // exist yet, since the constraints table is not shared. This becomes | |
| 893 // more important now that we don't re-initialize vtables/itables for | |
| 894 // shared classes at runtime, where constraints were previously created. | |
| 895 guarantee(SystemDictionary::constraints()->number_of_entries() == 0, | |
| 896 "loader constraints are not saved"); | |
| 897 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 898 | |
| 899 // At this point, many classes have been loaded. | |
| 900 | |
| 901 // Update all the fingerprints in the shared methods. | |
| 902 | |
| 903 tty->print("Calculating fingerprints ... "); | |
| 904 FingerprintMethodsClosure fpmc; | |
| 905 gch->object_iterate(&fpmc); | |
| 906 tty->print_cr("done. "); | |
| 907 | |
| 908 // Remove all references outside the heap. | |
| 909 | |
| 910 tty->print("Removing unshareable information ... "); | |
| 911 RemoveUnshareableInfoClosure ruic; | |
| 912 gch->object_iterate(&ruic); | |
| 913 tty->print_cr("done. "); | |
| 914 | |
| 915 // Move the objects in three passes. | |
| 916 | |
| 917 MarkObjectsOopClosure mark_all; | |
| 918 MarkCommonReadOnly mark_common_ro; | |
| 919 MarkCommonSymbols mark_common_symbols; | |
| 920 MarkStringValues mark_string_values; | |
| 921 MarkReadWriteObjects mark_rw; | |
| 922 MarkStringObjects mark_strings; | |
| 923 MoveMarkedObjects move_ro(_ro_space, true); | |
| 924 MoveMarkedObjects move_rw(_rw_space, false); | |
| 925 | |
| 926 // The SharedOptimizeColdStart VM option governs the new layout | |
| 927 // algorithm for promoting classes into the shared archive. | |
| 928 // The general idea is to minimize cold start time by laying | |
| 929 // out the objects in the order they are accessed at startup time. | |
| 930 // By doing this we are trying to eliminate out-of-order accesses | |
| 931 // in the shared archive. This benefits cold startup time by making | |
| 932 // disk reads as sequential as possible during class loading and | |
| 933 // bootstrapping activities. There may also be a small secondary | |
| 934 // effect of better "packing" of more commonly used data on a smaller | |
| 935 // number of pages, although no direct benefit has been measured from | |
| 936 // this effect. | |
| 937 // | |
| 938 // At the class level of granularity, the promotion order is dictated | |
| 939 // by the classlist file whose generation is discussed elsewhere. | |
| 940 // | |
| 941 // At smaller granularity, optimal ordering was determined by an | |
| 942 // offline analysis of object access order in the shared archive. | |
| 943 // The dbx watchpoint facility, combined with SA post-processing, | |
| 944 // was used to observe common access patterns primarily during | |
| 945 // classloading. This information was used to craft the promotion | |
| 946 // order seen in the following closures. | |
| 947 // | |
| 948 // The observed access order is mostly governed by what happens | |
| 949 // in SystemDictionary::load_shared_class(). NOTE WELL - care | |
| 950 // should be taken when making changes to this method, because it | |
| 951 // may invalidate assumptions made about access order! | |
| 952 // | |
| 953 // (Ideally, there would be a better way to manage changes to | |
| 954 // the access order. Unfortunately a generic in-VM solution for | |
| 955 // dynamically observing access order and optimizing shared | |
| 956 // archive layout is pretty difficult. We go with the static | |
| 957 // analysis because the code is fairly mature at this point | |
| 958 // and we're betting that the access order won't change much.) | |
| 959 | |
| 960 MarkAndMoveOrderedReadOnly mark_and_move_ordered_ro(&move_ro); | |
| 961 MarkAndMoveOrderedReadWrite mark_and_move_ordered_rw(&move_rw); | |
| 962 | |
| 963 // Phase 1a: move commonly used read-only objects to the read-only space. | |
| 964 | |
| 965 if (SharedOptimizeColdStart) { | |
| 966 tty->print("Moving pre-ordered read-only objects to shared space at " PTR_FORMAT " ... ", | |
| 967 _ro_space->top()); | |
| 968 for (int i = 0; i < _class_promote_order->length(); i++) { | |
| 969 oop obj = _class_promote_order->at(i); | |
| 970 mark_and_move_ordered_ro.do_object(obj); | |
| 971 } | |
| 972 tty->print_cr("done. "); | |
| 973 } | |
| 974 | |
| 975 tty->print("Moving read-only objects to shared space at " PTR_FORMAT " ... ", | |
| 976 _ro_space->top()); | |
| 977 gch->object_iterate(&mark_common_ro); | |
| 978 gch->object_iterate(&move_ro); | |
| 979 tty->print_cr("done. "); | |
| 980 | |
| 981 // Phase 1b: move commonly used symbols to the read-only space. | |
| 982 | |
| 983 tty->print("Moving common symbols to shared space at " PTR_FORMAT " ... ", | |
| 984 _ro_space->top()); | |
| 985 gch->object_iterate(&mark_common_symbols); | |
| 986 gch->object_iterate(&move_ro); | |
| 987 tty->print_cr("done. "); | |
| 988 | |
| 989 // Phase 1c: move remaining symbols to the read-only space | |
| 990 // (e.g. String initializers). | |
| 991 | |
| 992 tty->print("Moving remaining symbols to shared space at " PTR_FORMAT " ... ", | |
| 993 _ro_space->top()); | |
| 994 vmSymbols::oops_do(&mark_all, true); | |
| 995 gch->object_iterate(&move_ro); | |
| 996 tty->print_cr("done. "); | |
| 997 | |
| 998 // Phase 1d: move String character arrays to the read-only space. | |
| 999 | |
| 1000 tty->print("Moving string char arrays to shared space at " PTR_FORMAT " ... ", | |
| 1001 _ro_space->top()); | |
| 1002 gch->object_iterate(&mark_string_values); | |
| 1003 gch->object_iterate(&move_ro); | |
| 1004 tty->print_cr("done. "); | |
| 1005 | |
| 1006 // Phase 2: move all remaining symbols to the read-only space. The | |
| 1007 // remaining symbols are assumed to be string initializers no longer | |
| 1008 // referenced. | |
| 1009 | |
| 1010 void* extra_symbols = _ro_space->top(); | |
| 1011 tty->print("Moving additional symbols to shared space at " PTR_FORMAT " ... ", | |
| 1012 _ro_space->top()); | |
| 1013 SymbolTable::oops_do(&mark_all); | |
| 1014 gch->object_iterate(&move_ro); | |
| 1015 tty->print_cr("done. "); | |
| 1016 tty->print_cr("Read-only space ends at " PTR_FORMAT ", %d bytes.", | |
| 1017 _ro_space->top(), _ro_space->used()); | |
| 1018 | |
| 1019 // Phase 3: move read-write objects to the read-write space, except | |
| 1020 // Strings. | |
| 1021 | |
| 1022 if (SharedOptimizeColdStart) { | |
| 1023 tty->print("Moving pre-ordered read-write objects to shared space at " PTR_FORMAT " ... ", | |
| 1024 _rw_space->top()); | |
| 1025 for (int i = 0; i < _class_promote_order->length(); i++) { | |
| 1026 oop obj = _class_promote_order->at(i); | |
| 1027 mark_and_move_ordered_rw.do_object(obj); | |
| 1028 } | |
| 1029 tty->print_cr("done. "); | |
| 1030 } | |
| 1031 tty->print("Moving read-write objects to shared space at " PTR_FORMAT " ... ", | |
| 1032 _rw_space->top()); | |
| 1033 Universe::oops_do(&mark_all, true); | |
| 1034 SystemDictionary::oops_do(&mark_all); | |
| 1035 oop tmp = Universe::arithmetic_exception_instance(); | |
| 1036 mark_object(java_lang_Throwable::message(tmp)); | |
| 1037 gch->object_iterate(&mark_rw); | |
| 1038 gch->object_iterate(&move_rw); | |
| 1039 tty->print_cr("done. "); | |
| 1040 | |
| 1041 // Phase 4: move String objects to the read-write space. | |
| 1042 | |
| 1043 tty->print("Moving String objects to shared space at " PTR_FORMAT " ... ", | |
| 1044 _rw_space->top()); | |
| 1045 StringTable::oops_do(&mark_all); | |
| 1046 gch->object_iterate(&mark_strings); | |
| 1047 gch->object_iterate(&move_rw); | |
| 1048 tty->print_cr("done. "); | |
| 1049 tty->print_cr("Read-write space ends at " PTR_FORMAT ", %d bytes.", | |
| 1050 _rw_space->top(), _rw_space->used()); | |
| 1051 | |
| 1052 #ifdef DEBUG | |
| 1053 // Check: scan for objects which were not moved. | |
| 1054 | |
| 1055 CheckRemainingObjects check_objects; | |
| 1056 gch->object_iterate(&check_objects); | |
| 1057 check_objects.status(); | |
| 1058 #endif | |
| 1059 | |
| 1060 // Resolve forwarding in objects and saved C++ structures | |
| 1061 tty->print("Updating references to shared objects ... "); | |
| 1062 ResolveForwardingClosure resolve; | |
| 1063 Universe::oops_do(&resolve); | |
| 1064 SystemDictionary::oops_do(&resolve); | |
| 1065 StringTable::oops_do(&resolve); | |
| 1066 SymbolTable::oops_do(&resolve); | |
| 1067 vmSymbols::oops_do(&resolve); | |
| 1068 | |
| 1069 // Set up the share data and shared code segments. | |
| 1070 | |
| 1071 char* md_top = _md_vs->low(); | |
| 1072 char* md_end = _md_vs->high(); | |
| 1073 char* mc_top = _mc_vs->low(); | |
| 1074 char* mc_end = _mc_vs->high(); | |
| 1075 | |
| 1076 // Reserve space for the list of klassOops whose vtables are used | |
| 1077 // for patching others as needed. | |
| 1078 | |
| 1079 void** vtbl_list = (void**)md_top; | |
| 1080 int vtbl_list_size = CompactingPermGenGen::vtbl_list_size; | |
| 1081 Universe::init_self_patching_vtbl_list(vtbl_list, vtbl_list_size); | |
| 1082 | |
| 1083 md_top += vtbl_list_size * sizeof(void*); | |
| 1084 void* vtable = md_top; | |
| 1085 | |
| 1086 // Reserve space for a new dummy vtable for klass objects in the | |
| 1087 // heap. Generate self-patching vtable entries. | |
| 1088 | |
| 1089 CompactingPermGenGen::generate_vtable_methods(vtbl_list, | |
| 1090 &vtable, | |
| 1091 &md_top, md_end, | |
| 1092 &mc_top, mc_end); | |
| 1093 | |
| 1094 // Fix (forward) all of the references in these shared objects (which | |
| 1095 // are required to point ONLY to objects in the shared spaces). | |
| 1096 // Also, create a list of all objects which might later contain a | |
| 1097 // reference to a younger generation object. | |
| 1098 | |
| 1099 CompactingPermGenGen* gen = (CompactingPermGenGen*)gch->perm_gen(); | |
| 1100 PatchOopsClosure patch(THREAD); | |
| 1101 gen->ro_space()->object_iterate(&patch); | |
| 1102 gen->rw_space()->object_iterate(&patch); | |
| 1103 | |
| 1104 // Previously method sorting was done concurrently with forwarding | |
| 1105 // pointer resolution in the shared spaces. This imposed an ordering | |
| 1106 // restriction in that methods were required to be promoted/patched | |
| 1107 // before their holder classes. (Because constant pool pointers in | |
| 1108 // methodKlasses are required to be resolved before their holder class | |
| 1109 // is visited for sorting, otherwise methods are sorted by incorrect, | |
| 1110 // pre-forwarding addresses.) | |
| 1111 // | |
| 1112 // Now, we reorder methods as a separate step after ALL forwarding | |
| 1113 // pointer resolution, so that methods can be promoted in any order | |
| 1114 // with respect to their holder classes. | |
| 1115 | |
| 1116 SortMethodsClosure sort(THREAD); | |
| 1117 gen->ro_space()->object_iterate(&sort); | |
| 1118 gen->rw_space()->object_iterate(&sort); | |
| 1119 tty->print_cr("done. "); | |
| 1120 tty->cr(); | |
| 1121 | |
| 1122 // Reorder the system dictionary. (Moving the symbols opps affects | |
| 1123 // how the hash table indices are calculated.) | |
| 1124 | |
| 1125 SystemDictionary::reorder_dictionary(); | |
| 1126 | |
| 1127 // Empty the non-shared heap (because most of the objects were | |
| 1128 // copied out, and the remainder cannot be considered valid oops). | |
| 1129 | |
| 1130 ClearSpaceClosure csc; | |
| 1131 for (int i = 0; i < gch->n_gens(); ++i) { | |
| 1132 gch->get_gen(i)->space_iterate(&csc); | |
| 1133 } | |
| 1134 csc.do_space(gen->the_space()); | |
| 1135 NOT_PRODUCT(SystemDictionary::verify();) | |
| 1136 | |
| 1137 // Copy the String table, the symbol table, and the system | |
| 1138 // dictionary to the shared space in usable form. Copy the hastable | |
| 1139 // buckets first [read-write], then copy the linked lists of entries | |
| 1140 // [read-only]. | |
| 1141 | |
| 1142 SymbolTable::reverse(extra_symbols); | |
| 1143 NOT_PRODUCT(SymbolTable::verify()); | |
| 1144 SymbolTable::copy_buckets(&md_top, md_end); | |
| 1145 | |
| 1146 StringTable::reverse(); | |
| 1147 NOT_PRODUCT(StringTable::verify()); | |
| 1148 StringTable::copy_buckets(&md_top, md_end); | |
| 1149 | |
| 1150 SystemDictionary::reverse(); | |
| 1151 SystemDictionary::copy_buckets(&md_top, md_end); | |
| 1152 | |
| 1153 ClassLoader::verify(); | |
| 1154 ClassLoader::copy_package_info_buckets(&md_top, md_end); | |
| 1155 ClassLoader::verify(); | |
| 1156 | |
| 1157 SymbolTable::copy_table(&md_top, md_end); | |
| 1158 StringTable::copy_table(&md_top, md_end); | |
| 1159 SystemDictionary::copy_table(&md_top, md_end); | |
| 1160 ClassLoader::verify(); | |
| 1161 ClassLoader::copy_package_info_table(&md_top, md_end); | |
| 1162 ClassLoader::verify(); | |
| 1163 | |
| 1164 // Print debug data. | |
| 1165 | |
| 1166 if (PrintSharedSpaces) { | |
| 1167 const char* fmt = "%s space: " PTR_FORMAT " out of " PTR_FORMAT " bytes allocated at " PTR_FORMAT "."; | |
| 1168 tty->print_cr(fmt, "ro", _ro_space->used(), _ro_space->capacity(), | |
| 1169 _ro_space->bottom()); | |
| 1170 tty->print_cr(fmt, "rw", _rw_space->used(), _rw_space->capacity(), | |
| 1171 _rw_space->bottom()); | |
| 1172 } | |
| 1173 | |
| 1174 // Write the oop data to the output array. | |
| 1175 | |
| 1176 WriteClosure wc(md_top, md_end); | |
| 1177 CompactingPermGenGen::serialize_oops(&wc); | |
| 1178 md_top = wc.get_top(); | |
| 1179 | |
| 1180 // Update the vtable pointers in all of the Klass objects in the | |
| 1181 // heap. They should point to newly generated vtable. | |
| 1182 | |
| 1183 PatchKlassVtables pkvt(vtable, _md_vs); | |
| 1184 _rw_space->object_iterate(&pkvt); | |
| 1185 pkvt.patch(vtbl_list, vtbl_list_size); | |
| 1186 | |
| 1187 char* saved_vtbl = (char*)malloc(vtbl_list_size * sizeof(void*)); | |
| 1188 memmove(saved_vtbl, vtbl_list, vtbl_list_size * sizeof(void*)); | |
| 1189 memset(vtbl_list, 0, vtbl_list_size * sizeof(void*)); | |
| 1190 | |
| 1191 // Create and write the archive file that maps the shared spaces. | |
| 1192 | |
| 1193 FileMapInfo* mapinfo = new FileMapInfo(); | |
| 1194 mapinfo->populate_header(gch->gen_policy()->max_alignment()); | |
| 1195 | |
| 1196 // Pass 1 - update file offsets in header. | |
| 1197 mapinfo->write_header(); | |
| 1198 mapinfo->write_space(CompactingPermGenGen::ro, _ro_space, true); | |
| 1199 _ro_space->set_saved_mark(); | |
| 1200 mapinfo->write_space(CompactingPermGenGen::rw, _rw_space, false); | |
| 1201 _rw_space->set_saved_mark(); | |
| 1202 mapinfo->write_region(CompactingPermGenGen::md, _md_vs->low(), | |
| 1203 md_top - _md_vs->low(), SharedMiscDataSize, | |
| 1204 false, false); | |
| 1205 mapinfo->write_region(CompactingPermGenGen::mc, _mc_vs->low(), | |
| 1206 mc_top - _mc_vs->low(), SharedMiscCodeSize, | |
| 1207 true, true); | |
| 1208 | |
| 1209 // Pass 2 - write data. | |
| 1210 mapinfo->open_for_write(); | |
| 1211 mapinfo->write_header(); | |
| 1212 mapinfo->write_space(CompactingPermGenGen::ro, _ro_space, true); | |
| 1213 mapinfo->write_space(CompactingPermGenGen::rw, _rw_space, false); | |
| 1214 mapinfo->write_region(CompactingPermGenGen::md, _md_vs->low(), | |
| 1215 md_top - _md_vs->low(), SharedMiscDataSize, | |
| 1216 false, false); | |
| 1217 mapinfo->write_region(CompactingPermGenGen::mc, _mc_vs->low(), | |
| 1218 mc_top - _mc_vs->low(), SharedMiscCodeSize, | |
| 1219 true, true); | |
| 1220 mapinfo->close(); | |
| 1221 | |
| 1222 // Summarize heap. | |
| 1223 memmove(vtbl_list, saved_vtbl, vtbl_list_size * sizeof(void*)); | |
| 1224 print_contents(); | |
| 1225 } | |
| 1226 }; // class VM_PopulateDumpSharedSpace | |
| 1227 | |
| 1228 | |
| 1229 // Populate the shared spaces and dump to a file. | |
| 1230 | |
| 1231 jint CompactingPermGenGen::dump_shared(GrowableArray<oop>* class_promote_order, TRAPS) { | |
| 1232 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 1233 | |
| 1234 // Calculate hash values for all of the (interned) strings to avoid | |
| 1235 // writes to shared pages in the future. | |
| 1236 | |
| 1237 tty->print("Calculating hash values for String objects .. "); | |
| 1238 StringHashCodeClosure shcc(THREAD); | |
| 1239 StringTable::oops_do(&shcc); | |
| 1240 tty->print_cr("done. "); | |
| 1241 | |
| 1242 CompactingPermGenGen* gen = (CompactingPermGenGen*)gch->perm_gen(); | |
| 1243 VM_PopulateDumpSharedSpace op(class_promote_order, | |
| 1244 gen->ro_space(), gen->rw_space(), | |
| 1245 gen->md_space(), gen->mc_space()); | |
| 1246 VMThread::execute(&op); | |
| 1247 return JNI_OK; | |
| 1248 } | |
| 1249 | |
| 1250 | |
| 1251 class LinkClassesClosure : public ObjectClosure { | |
| 1252 private: | |
| 1253 Thread* THREAD; | |
| 1254 | |
| 1255 public: | |
| 1256 LinkClassesClosure(Thread* thread) : THREAD(thread) {} | |
| 1257 | |
| 1258 void do_object(oop obj) { | |
| 1259 if (obj->is_klass()) { | |
| 1260 Klass* k = Klass::cast((klassOop) obj); | |
| 1261 if (k->oop_is_instance()) { | |
| 1262 instanceKlass* ik = (instanceKlass*) k; | |
| 1263 // Link the class to cause the bytecodes to be rewritten and the | |
| 1264 // cpcache to be created. | |
| 1265 if (ik->get_init_state() < instanceKlass::linked) { | |
| 1266 ik->link_class(THREAD); | |
| 1267 guarantee(!HAS_PENDING_EXCEPTION, "exception in class rewriting"); | |
| 1268 } | |
| 1269 | |
| 1270 // Create String objects from string initializer symbols. | |
| 1271 ik->constants()->resolve_string_constants(THREAD); | |
| 1272 guarantee(!HAS_PENDING_EXCEPTION, "exception resolving string constants"); | |
| 1273 } | |
| 1274 } | |
| 1275 } | |
| 1276 }; | |
| 1277 | |
| 1278 | |
| 1279 // Support for a simple checksum of the contents of the class list | |
| 1280 // file to prevent trivial tampering. The algorithm matches that in | |
| 1281 // the MakeClassList program used by the J2SE build process. | |
| 1282 #define JSUM_SEED ((jlong)CONST64(0xcafebabebabecafe)) | |
| 1283 static jlong | |
| 1284 jsum(jlong start, const char *buf, const int len) | |
| 1285 { | |
| 1286 jlong h = start; | |
| 1287 char *p = (char *)buf, *e = p + len; | |
| 1288 while (p < e) { | |
| 1289 char c = *p++; | |
| 1290 if (c <= ' ') { | |
| 1291 /* Skip spaces and control characters */ | |
| 1292 continue; | |
| 1293 } | |
| 1294 h = 31 * h + c; | |
| 1295 } | |
| 1296 return h; | |
| 1297 } | |
| 1298 | |
| 1299 | |
| 1300 | |
| 1301 | |
| 1302 | |
| 1303 // Preload classes from a list, populate the shared spaces and dump to a | |
| 1304 // file. | |
| 1305 | |
| 1306 void GenCollectedHeap::preload_and_dump(TRAPS) { | |
| 1307 TraceTime timer("Dump Shared Spaces", TraceStartupTime); | |
| 1308 ResourceMark rm; | |
| 1309 | |
| 1310 // Preload classes to be shared. | |
| 1311 // Should use some hpi:: method rather than fopen() here. aB. | |
| 1312 // Construct the path to the class list (in jre/lib) | |
| 1313 // Walk up two directories from the location of the VM and | |
| 1314 // optionally tack on "lib" (depending on platform) | |
| 1315 char class_list_path[JVM_MAXPATHLEN]; | |
| 1316 os::jvm_path(class_list_path, sizeof(class_list_path)); | |
| 1317 for (int i = 0; i < 3; i++) { | |
| 1318 char *end = strrchr(class_list_path, *os::file_separator()); | |
| 1319 if (end != NULL) *end = '\0'; | |
| 1320 } | |
| 1321 int class_list_path_len = (int)strlen(class_list_path); | |
| 1322 if (class_list_path_len >= 3) { | |
| 1323 if (strcmp(class_list_path + class_list_path_len - 3, "lib") != 0) { | |
| 1324 strcat(class_list_path, os::file_separator()); | |
| 1325 strcat(class_list_path, "lib"); | |
| 1326 } | |
| 1327 } | |
| 1328 strcat(class_list_path, os::file_separator()); | |
| 1329 strcat(class_list_path, "classlist"); | |
| 1330 | |
| 1331 FILE* file = fopen(class_list_path, "r"); | |
| 1332 if (file != NULL) { | |
| 1333 jlong computed_jsum = JSUM_SEED; | |
| 1334 jlong file_jsum = 0; | |
| 1335 | |
| 1336 char class_name[256]; | |
| 1337 int class_count = 0; | |
| 1338 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 1339 gch->_preloading_shared_classes = true; | |
| 1340 GrowableArray<oop>* class_promote_order = new GrowableArray<oop>(); | |
| 1341 | |
| 1342 // Preload (and intern) strings which will be used later. | |
| 1343 | |
| 1344 StringTable::intern("main", THREAD); | |
| 1345 StringTable::intern("([Ljava/lang/String;)V", THREAD); | |
| 1346 StringTable::intern("Ljava/lang/Class;", THREAD); | |
| 1347 | |
| 1348 StringTable::intern("I", THREAD); // Needed for StringBuffer persistence? | |
| 1349 StringTable::intern("Z", THREAD); // Needed for StringBuffer persistence? | |
| 1350 | |
| 1351 // sun.io.Converters | |
| 1352 static const char obj_array_sig[] = "[[Ljava/lang/Object;"; | |
| 1353 SymbolTable::lookup(obj_array_sig, (int)strlen(obj_array_sig), THREAD); | |
| 1354 | |
| 1355 // java.util.HashMap | |
| 1356 static const char map_entry_array_sig[] = "[Ljava/util/Map$Entry;"; | |
| 1357 SymbolTable::lookup(map_entry_array_sig, (int)strlen(map_entry_array_sig), | |
| 1358 THREAD); | |
| 1359 | |
| 1360 tty->print("Loading classes to share ... "); | |
| 1361 while ((fgets(class_name, sizeof class_name, file)) != NULL) { | |
| 1362 if (*class_name == '#') { | |
| 1363 jint fsh, fsl; | |
| 1364 if (sscanf(class_name, "# %8x%8x\n", &fsh, &fsl) == 2) { | |
| 1365 file_jsum = ((jlong)(fsh) << 32) | (fsl & 0xffffffff); | |
| 1366 } | |
| 1367 | |
| 1368 continue; | |
| 1369 } | |
| 1370 // Remove trailing newline | |
| 1371 size_t name_len = strlen(class_name); | |
| 1372 class_name[name_len-1] = '\0'; | |
| 1373 | |
| 1374 computed_jsum = jsum(computed_jsum, class_name, (const int)name_len - 1); | |
| 1375 | |
| 1376 // Got a class name - load it. | |
| 1377 symbolHandle class_name_symbol = oopFactory::new_symbol(class_name, | |
| 1378 THREAD); | |
| 1379 guarantee(!HAS_PENDING_EXCEPTION, "Exception creating a symbol."); | |
| 1380 klassOop klass = SystemDictionary::resolve_or_null(class_name_symbol, | |
| 1381 THREAD); | |
| 1382 guarantee(!HAS_PENDING_EXCEPTION, "Exception resolving a class."); | |
| 1383 if (klass != NULL) { | |
| 1384 if (PrintSharedSpaces) { | |
| 1385 tty->print_cr("Shared spaces preloaded: %s", class_name); | |
| 1386 } | |
| 1387 | |
| 1388 | |
| 1389 instanceKlass* ik = instanceKlass::cast(klass); | |
| 1390 | |
| 1391 // Should be class load order as per -XX:+TraceClassLoadingPreorder | |
| 1392 class_promote_order->append(ik->as_klassOop()); | |
| 1393 | |
| 1394 // Link the class to cause the bytecodes to be rewritten and the | |
| 1395 // cpcache to be created. The linking is done as soon as classes | |
| 1396 // are loaded in order that the related data structures (klass, | |
| 1397 // cpCache, Sting constants) are located together. | |
| 1398 | |
| 1399 if (ik->get_init_state() < instanceKlass::linked) { | |
| 1400 ik->link_class(THREAD); | |
| 1401 guarantee(!(HAS_PENDING_EXCEPTION), "exception in class rewriting"); | |
| 1402 } | |
| 1403 | |
| 1404 // Create String objects from string initializer symbols. | |
| 1405 | |
| 1406 ik->constants()->resolve_string_constants(THREAD); | |
| 1407 | |
| 1408 class_count++; | |
| 1409 } else { | |
| 1410 if (PrintSharedSpaces) { | |
| 1411 tty->cr(); | |
| 1412 tty->print_cr(" Preload failed: %s", class_name); | |
| 1413 } | |
| 1414 } | |
| 1415 file_jsum = 0; // Checksum must be on last line of file | |
| 1416 } | |
| 1417 if (computed_jsum != file_jsum) { | |
| 1418 tty->cr(); | |
| 1419 tty->print_cr("Preload failed: checksum of class list was incorrect."); | |
| 1420 exit(1); | |
| 1421 } | |
| 1422 | |
| 1423 tty->print_cr("done. "); | |
| 1424 | |
| 1425 if (PrintSharedSpaces) { | |
| 1426 tty->print_cr("Shared spaces: preloaded %d classes", class_count); | |
| 1427 } | |
| 1428 | |
| 1429 // Rewrite and unlink classes. | |
| 1430 tty->print("Rewriting and unlinking classes ... "); | |
| 1431 // Make heap parsable | |
| 1432 ensure_parsability(false); // arg is actually don't care | |
| 1433 | |
| 1434 // Link any classes which got missed. (It's not quite clear why | |
| 1435 // they got missed.) This iteration would be unsafe if we weren't | |
| 1436 // single-threaded at this point; however we can't do it on the VM | |
| 1437 // thread because it requires object allocation. | |
| 1438 LinkClassesClosure lcc(Thread::current()); | |
| 1439 object_iterate(&lcc); | |
| 1440 tty->print_cr("done. "); | |
| 1441 | |
| 1442 // Create and dump the shared spaces. | |
| 1443 jint err = CompactingPermGenGen::dump_shared(class_promote_order, THREAD); | |
| 1444 if (err != JNI_OK) { | |
| 1445 fatal("Dumping shared spaces failed."); | |
| 1446 } | |
| 1447 | |
| 1448 } else { | |
| 1449 char errmsg[JVM_MAXPATHLEN]; | |
| 1450 hpi::lasterror(errmsg, JVM_MAXPATHLEN); | |
| 1451 tty->print_cr("Loading classlist failed: %s", errmsg); | |
| 1452 exit(1); | |
| 1453 } | |
| 1454 | |
| 1455 // Since various initialization steps have been undone by this process, | |
| 1456 // it is not reasonable to continue running a java process. | |
| 1457 exit(0); | |
| 1458 } |