Tue, 11 May 2010 14:35:43 -0700
6931180: Migration to recent versions of MS Platform SDK
6951582: Build problems on win64
Summary: Changes to enable building JDK7 with Microsoft Visual Studio 2010
Reviewed-by: ohair, art, ccheung, dcubed
duke@435 | 1 | /* |
jmasa@1822 | 2 | * Copyright 2001-2010 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_genMarkSweep.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | void GenMarkSweep::invoke_at_safepoint(int level, ReferenceProcessor* rp, |
duke@435 | 29 | bool clear_all_softrefs) { |
duke@435 | 30 | assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint"); |
duke@435 | 31 | |
jmasa@1822 | 32 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
jmasa@1822 | 33 | #ifdef ASSERT |
jmasa@1822 | 34 | if (gch->collector_policy()->should_clear_all_soft_refs()) { |
jmasa@1822 | 35 | assert(clear_all_softrefs, "Policy should have been checked earlier"); |
jmasa@1822 | 36 | } |
jmasa@1822 | 37 | #endif |
jmasa@1822 | 38 | |
duke@435 | 39 | // hook up weak ref data so it can be used during Mark-Sweep |
duke@435 | 40 | assert(ref_processor() == NULL, "no stomping"); |
ysr@888 | 41 | assert(rp != NULL, "should be non-NULL"); |
duke@435 | 42 | _ref_processor = rp; |
ysr@892 | 43 | rp->setup_policy(clear_all_softrefs); |
duke@435 | 44 | |
duke@435 | 45 | TraceTime t1("Full GC", PrintGC && !PrintGCDetails, true, gclog_or_tty); |
duke@435 | 46 | |
duke@435 | 47 | // When collecting the permanent generation methodOops may be moving, |
duke@435 | 48 | // so we either have to flush all bcp data or convert it into bci. |
duke@435 | 49 | CodeCache::gc_prologue(); |
duke@435 | 50 | Threads::gc_prologue(); |
duke@435 | 51 | |
duke@435 | 52 | // Increment the invocation count for the permanent generation, since it is |
duke@435 | 53 | // implicitly collected whenever we do a full mark sweep collection. |
duke@435 | 54 | gch->perm_gen()->stat_record()->invocations++; |
duke@435 | 55 | |
duke@435 | 56 | // Capture heap size before collection for printing. |
duke@435 | 57 | size_t gch_prev_used = gch->used(); |
duke@435 | 58 | |
duke@435 | 59 | // Some of the card table updates below assume that the perm gen is |
duke@435 | 60 | // also being collected. |
duke@435 | 61 | assert(level == gch->n_gens() - 1, |
duke@435 | 62 | "All generations are being collected, ergo perm gen too."); |
duke@435 | 63 | |
duke@435 | 64 | // Capture used regions for each generation that will be |
duke@435 | 65 | // subject to collection, so that card table adjustments can |
duke@435 | 66 | // be made intelligently (see clear / invalidate further below). |
duke@435 | 67 | gch->save_used_regions(level, true /* perm */); |
duke@435 | 68 | |
duke@435 | 69 | allocate_stacks(); |
duke@435 | 70 | |
duke@435 | 71 | mark_sweep_phase1(level, clear_all_softrefs); |
duke@435 | 72 | |
duke@435 | 73 | mark_sweep_phase2(); |
duke@435 | 74 | |
duke@435 | 75 | // Don't add any more derived pointers during phase3 |
duke@435 | 76 | COMPILER2_PRESENT(assert(DerivedPointerTable::is_active(), "Sanity")); |
duke@435 | 77 | COMPILER2_PRESENT(DerivedPointerTable::set_active(false)); |
duke@435 | 78 | |
duke@435 | 79 | mark_sweep_phase3(level); |
duke@435 | 80 | |
duke@435 | 81 | VALIDATE_MARK_SWEEP_ONLY( |
duke@435 | 82 | if (ValidateMarkSweep) { |
coleenp@548 | 83 | guarantee(_root_refs_stack->length() == 0, "should be empty by now"); |
duke@435 | 84 | } |
duke@435 | 85 | ) |
duke@435 | 86 | |
duke@435 | 87 | mark_sweep_phase4(); |
duke@435 | 88 | |
duke@435 | 89 | VALIDATE_MARK_SWEEP_ONLY( |
duke@435 | 90 | if (ValidateMarkSweep) { |
duke@435 | 91 | guarantee(_live_oops->length() == _live_oops_moved_to->length(), |
duke@435 | 92 | "should be the same size"); |
duke@435 | 93 | } |
duke@435 | 94 | ) |
duke@435 | 95 | |
duke@435 | 96 | restore_marks(); |
duke@435 | 97 | |
duke@435 | 98 | // Set saved marks for allocation profiler (and other things? -- dld) |
duke@435 | 99 | // (Should this be in general part?) |
duke@435 | 100 | gch->save_marks(); |
duke@435 | 101 | |
duke@435 | 102 | deallocate_stacks(); |
duke@435 | 103 | |
duke@435 | 104 | // If compaction completely evacuated all generations younger than this |
duke@435 | 105 | // one, then we can clear the card table. Otherwise, we must invalidate |
duke@435 | 106 | // it (consider all cards dirty). In the future, we might consider doing |
duke@435 | 107 | // compaction within generations only, and doing card-table sliding. |
duke@435 | 108 | bool all_empty = true; |
duke@435 | 109 | for (int i = 0; all_empty && i < level; i++) { |
duke@435 | 110 | Generation* g = gch->get_gen(i); |
duke@435 | 111 | all_empty = all_empty && gch->get_gen(i)->used() == 0; |
duke@435 | 112 | } |
duke@435 | 113 | GenRemSet* rs = gch->rem_set(); |
duke@435 | 114 | // Clear/invalidate below make use of the "prev_used_regions" saved earlier. |
duke@435 | 115 | if (all_empty) { |
duke@435 | 116 | // We've evacuated all generations below us. |
duke@435 | 117 | Generation* g = gch->get_gen(level); |
duke@435 | 118 | rs->clear_into_younger(g, true /* perm */); |
duke@435 | 119 | } else { |
duke@435 | 120 | // Invalidate the cards corresponding to the currently used |
duke@435 | 121 | // region and clear those corresponding to the evacuated region |
duke@435 | 122 | // of all generations just collected (i.e. level and younger). |
duke@435 | 123 | rs->invalidate_or_clear(gch->get_gen(level), |
duke@435 | 124 | true /* younger */, |
duke@435 | 125 | true /* perm */); |
duke@435 | 126 | } |
duke@435 | 127 | |
duke@435 | 128 | Threads::gc_epilogue(); |
duke@435 | 129 | CodeCache::gc_epilogue(); |
duke@435 | 130 | |
duke@435 | 131 | if (PrintGC && !PrintGCDetails) { |
duke@435 | 132 | gch->print_heap_change(gch_prev_used); |
duke@435 | 133 | } |
duke@435 | 134 | |
duke@435 | 135 | // refs processing: clean slate |
duke@435 | 136 | _ref_processor = NULL; |
duke@435 | 137 | |
duke@435 | 138 | // Update heap occupancy information which is used as |
duke@435 | 139 | // input to soft ref clearing policy at the next gc. |
duke@435 | 140 | Universe::update_heap_info_at_gc(); |
duke@435 | 141 | |
duke@435 | 142 | // Update time of last gc for all generations we collected |
duke@435 | 143 | // (which curently is all the generations in the heap). |
duke@435 | 144 | gch->update_time_of_last_gc(os::javaTimeMillis()); |
duke@435 | 145 | } |
duke@435 | 146 | |
duke@435 | 147 | void GenMarkSweep::allocate_stacks() { |
duke@435 | 148 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 149 | // Scratch request on behalf of oldest generation; will do no |
duke@435 | 150 | // allocation. |
duke@435 | 151 | ScratchBlock* scratch = gch->gather_scratch(gch->_gens[gch->_n_gens-1], 0); |
duke@435 | 152 | |
duke@435 | 153 | // $$$ To cut a corner, we'll only use the first scratch block, and then |
duke@435 | 154 | // revert to malloc. |
duke@435 | 155 | if (scratch != NULL) { |
duke@435 | 156 | _preserved_count_max = |
duke@435 | 157 | scratch->num_words * HeapWordSize / sizeof(PreservedMark); |
duke@435 | 158 | } else { |
duke@435 | 159 | _preserved_count_max = 0; |
duke@435 | 160 | } |
duke@435 | 161 | |
duke@435 | 162 | _preserved_marks = (PreservedMark*)scratch; |
duke@435 | 163 | _preserved_count = 0; |
duke@435 | 164 | _preserved_mark_stack = NULL; |
duke@435 | 165 | _preserved_oop_stack = NULL; |
duke@435 | 166 | |
duke@435 | 167 | _marking_stack = new (ResourceObj::C_HEAP) GrowableArray<oop>(4000, true); |
jcoomes@1746 | 168 | _objarray_stack = new (ResourceObj::C_HEAP) GrowableArray<ObjArrayTask>(50, true); |
duke@435 | 169 | |
duke@435 | 170 | int size = SystemDictionary::number_of_classes() * 2; |
duke@435 | 171 | _revisit_klass_stack = new (ResourceObj::C_HEAP) GrowableArray<Klass*>(size, true); |
ysr@1376 | 172 | // (#klass/k)^2 for k ~ 10 appears to be a better fit, but this will have to do for |
ysr@1376 | 173 | // now until we have had a chance to investigate a more optimal setting. |
ysr@1376 | 174 | _revisit_mdo_stack = new (ResourceObj::C_HEAP) GrowableArray<DataLayout*>(2*size, true); |
duke@435 | 175 | |
duke@435 | 176 | #ifdef VALIDATE_MARK_SWEEP |
duke@435 | 177 | if (ValidateMarkSweep) { |
coleenp@548 | 178 | _root_refs_stack = new (ResourceObj::C_HEAP) GrowableArray<void*>(100, true); |
coleenp@548 | 179 | _other_refs_stack = new (ResourceObj::C_HEAP) GrowableArray<void*>(100, true); |
coleenp@548 | 180 | _adjusted_pointers = new (ResourceObj::C_HEAP) GrowableArray<void*>(100, true); |
duke@435 | 181 | _live_oops = new (ResourceObj::C_HEAP) GrowableArray<oop>(100, true); |
duke@435 | 182 | _live_oops_moved_to = new (ResourceObj::C_HEAP) GrowableArray<oop>(100, true); |
duke@435 | 183 | _live_oops_size = new (ResourceObj::C_HEAP) GrowableArray<size_t>(100, true); |
duke@435 | 184 | } |
duke@435 | 185 | if (RecordMarkSweepCompaction) { |
duke@435 | 186 | if (_cur_gc_live_oops == NULL) { |
duke@435 | 187 | _cur_gc_live_oops = new(ResourceObj::C_HEAP) GrowableArray<HeapWord*>(100, true); |
duke@435 | 188 | _cur_gc_live_oops_moved_to = new(ResourceObj::C_HEAP) GrowableArray<HeapWord*>(100, true); |
duke@435 | 189 | _cur_gc_live_oops_size = new(ResourceObj::C_HEAP) GrowableArray<size_t>(100, true); |
duke@435 | 190 | _last_gc_live_oops = new(ResourceObj::C_HEAP) GrowableArray<HeapWord*>(100, true); |
duke@435 | 191 | _last_gc_live_oops_moved_to = new(ResourceObj::C_HEAP) GrowableArray<HeapWord*>(100, true); |
duke@435 | 192 | _last_gc_live_oops_size = new(ResourceObj::C_HEAP) GrowableArray<size_t>(100, true); |
duke@435 | 193 | } else { |
duke@435 | 194 | _cur_gc_live_oops->clear(); |
duke@435 | 195 | _cur_gc_live_oops_moved_to->clear(); |
duke@435 | 196 | _cur_gc_live_oops_size->clear(); |
duke@435 | 197 | } |
duke@435 | 198 | } |
duke@435 | 199 | #endif |
duke@435 | 200 | } |
duke@435 | 201 | |
duke@435 | 202 | |
duke@435 | 203 | void GenMarkSweep::deallocate_stacks() { |
tonyp@791 | 204 | if (!UseG1GC) { |
tonyp@791 | 205 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
tonyp@791 | 206 | gch->release_scratch(); |
tonyp@791 | 207 | } |
jmasa@698 | 208 | |
duke@435 | 209 | if (_preserved_oop_stack) { |
duke@435 | 210 | delete _preserved_mark_stack; |
duke@435 | 211 | _preserved_mark_stack = NULL; |
duke@435 | 212 | delete _preserved_oop_stack; |
duke@435 | 213 | _preserved_oop_stack = NULL; |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | delete _marking_stack; |
jcoomes@1746 | 217 | delete _objarray_stack; |
duke@435 | 218 | delete _revisit_klass_stack; |
ysr@1376 | 219 | delete _revisit_mdo_stack; |
duke@435 | 220 | |
duke@435 | 221 | #ifdef VALIDATE_MARK_SWEEP |
duke@435 | 222 | if (ValidateMarkSweep) { |
duke@435 | 223 | delete _root_refs_stack; |
duke@435 | 224 | delete _other_refs_stack; |
duke@435 | 225 | delete _adjusted_pointers; |
duke@435 | 226 | delete _live_oops; |
duke@435 | 227 | delete _live_oops_size; |
duke@435 | 228 | delete _live_oops_moved_to; |
duke@435 | 229 | _live_oops_index = 0; |
duke@435 | 230 | _live_oops_index_at_perm = 0; |
duke@435 | 231 | } |
duke@435 | 232 | #endif |
duke@435 | 233 | } |
duke@435 | 234 | |
duke@435 | 235 | void GenMarkSweep::mark_sweep_phase1(int level, |
duke@435 | 236 | bool clear_all_softrefs) { |
duke@435 | 237 | // Recursively traverse all live objects and mark them |
duke@435 | 238 | EventMark m("1 mark object"); |
duke@435 | 239 | TraceTime tm("phase 1", PrintGC && Verbose, true, gclog_or_tty); |
duke@435 | 240 | trace(" 1"); |
duke@435 | 241 | |
duke@435 | 242 | VALIDATE_MARK_SWEEP_ONLY(reset_live_oop_tracking(false)); |
duke@435 | 243 | |
duke@435 | 244 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 245 | |
duke@435 | 246 | // Because follow_root_closure is created statically, cannot |
duke@435 | 247 | // use OopsInGenClosure constructor which takes a generation, |
duke@435 | 248 | // as the Universe has not been created when the static constructors |
duke@435 | 249 | // are run. |
duke@435 | 250 | follow_root_closure.set_orig_generation(gch->get_gen(level)); |
duke@435 | 251 | |
duke@435 | 252 | gch->gen_process_strong_roots(level, |
duke@435 | 253 | false, // Younger gens are not roots. |
jrose@1424 | 254 | true, // activate StrongRootsScope |
duke@435 | 255 | true, // Collecting permanent generation. |
duke@435 | 256 | SharedHeap::SO_SystemClasses, |
jrose@1424 | 257 | &follow_root_closure, |
jrose@1424 | 258 | true, // walk code active on stacks |
jrose@1424 | 259 | &follow_root_closure); |
duke@435 | 260 | |
duke@435 | 261 | // Process reference objects found during marking |
duke@435 | 262 | { |
ysr@892 | 263 | ref_processor()->setup_policy(clear_all_softrefs); |
duke@435 | 264 | ref_processor()->process_discovered_references( |
ysr@888 | 265 | &is_alive, &keep_alive, &follow_stack_closure, NULL); |
duke@435 | 266 | } |
duke@435 | 267 | |
duke@435 | 268 | // Follow system dictionary roots and unload classes |
duke@435 | 269 | bool purged_class = SystemDictionary::do_unloading(&is_alive); |
duke@435 | 270 | |
duke@435 | 271 | // Follow code cache roots |
duke@435 | 272 | CodeCache::do_unloading(&is_alive, &keep_alive, purged_class); |
duke@435 | 273 | follow_stack(); // Flush marking stack |
duke@435 | 274 | |
duke@435 | 275 | // Update subklass/sibling/implementor links of live klasses |
duke@435 | 276 | follow_weak_klass_links(); |
duke@435 | 277 | assert(_marking_stack->is_empty(), "just drained"); |
duke@435 | 278 | |
ysr@1376 | 279 | // Visit memoized MDO's and clear any unmarked weak refs |
ysr@1376 | 280 | follow_mdo_weak_refs(); |
ysr@1376 | 281 | assert(_marking_stack->is_empty(), "just drained"); |
ysr@1376 | 282 | |
duke@435 | 283 | // Visit symbol and interned string tables and delete unmarked oops |
duke@435 | 284 | SymbolTable::unlink(&is_alive); |
duke@435 | 285 | StringTable::unlink(&is_alive); |
duke@435 | 286 | |
duke@435 | 287 | assert(_marking_stack->is_empty(), "stack should be empty by now"); |
duke@435 | 288 | } |
duke@435 | 289 | |
duke@435 | 290 | |
duke@435 | 291 | void GenMarkSweep::mark_sweep_phase2() { |
duke@435 | 292 | // Now all live objects are marked, compute the new object addresses. |
duke@435 | 293 | |
duke@435 | 294 | // It is imperative that we traverse perm_gen LAST. If dead space is |
duke@435 | 295 | // allowed a range of dead object may get overwritten by a dead int |
duke@435 | 296 | // array. If perm_gen is not traversed last a klassOop may get |
duke@435 | 297 | // overwritten. This is fine since it is dead, but if the class has dead |
duke@435 | 298 | // instances we have to skip them, and in order to find their size we |
duke@435 | 299 | // need the klassOop! |
duke@435 | 300 | // |
duke@435 | 301 | // It is not required that we traverse spaces in the same order in |
duke@435 | 302 | // phase2, phase3 and phase4, but the ValidateMarkSweep live oops |
duke@435 | 303 | // tracking expects us to do so. See comment under phase4. |
duke@435 | 304 | |
duke@435 | 305 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 306 | Generation* pg = gch->perm_gen(); |
duke@435 | 307 | |
duke@435 | 308 | EventMark m("2 compute new addresses"); |
duke@435 | 309 | TraceTime tm("phase 2", PrintGC && Verbose, true, gclog_or_tty); |
duke@435 | 310 | trace("2"); |
duke@435 | 311 | |
duke@435 | 312 | VALIDATE_MARK_SWEEP_ONLY(reset_live_oop_tracking(false)); |
duke@435 | 313 | |
duke@435 | 314 | gch->prepare_for_compaction(); |
duke@435 | 315 | |
duke@435 | 316 | VALIDATE_MARK_SWEEP_ONLY(_live_oops_index_at_perm = _live_oops_index); |
duke@435 | 317 | CompactPoint perm_cp(pg, NULL, NULL); |
duke@435 | 318 | pg->prepare_for_compaction(&perm_cp); |
duke@435 | 319 | } |
duke@435 | 320 | |
duke@435 | 321 | class GenAdjustPointersClosure: public GenCollectedHeap::GenClosure { |
duke@435 | 322 | public: |
duke@435 | 323 | void do_generation(Generation* gen) { |
duke@435 | 324 | gen->adjust_pointers(); |
duke@435 | 325 | } |
duke@435 | 326 | }; |
duke@435 | 327 | |
duke@435 | 328 | void GenMarkSweep::mark_sweep_phase3(int level) { |
duke@435 | 329 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 330 | Generation* pg = gch->perm_gen(); |
duke@435 | 331 | |
duke@435 | 332 | // Adjust the pointers to reflect the new locations |
duke@435 | 333 | EventMark m("3 adjust pointers"); |
duke@435 | 334 | TraceTime tm("phase 3", PrintGC && Verbose, true, gclog_or_tty); |
duke@435 | 335 | trace("3"); |
duke@435 | 336 | |
duke@435 | 337 | VALIDATE_MARK_SWEEP_ONLY(reset_live_oop_tracking(false)); |
duke@435 | 338 | |
duke@435 | 339 | // Needs to be done before the system dictionary is adjusted. |
duke@435 | 340 | pg->pre_adjust_pointers(); |
duke@435 | 341 | |
duke@435 | 342 | // Because the two closures below are created statically, cannot |
duke@435 | 343 | // use OopsInGenClosure constructor which takes a generation, |
duke@435 | 344 | // as the Universe has not been created when the static constructors |
duke@435 | 345 | // are run. |
duke@435 | 346 | adjust_root_pointer_closure.set_orig_generation(gch->get_gen(level)); |
duke@435 | 347 | adjust_pointer_closure.set_orig_generation(gch->get_gen(level)); |
duke@435 | 348 | |
duke@435 | 349 | gch->gen_process_strong_roots(level, |
duke@435 | 350 | false, // Younger gens are not roots. |
jrose@1424 | 351 | true, // activate StrongRootsScope |
duke@435 | 352 | true, // Collecting permanent generation. |
duke@435 | 353 | SharedHeap::SO_AllClasses, |
duke@435 | 354 | &adjust_root_pointer_closure, |
jrose@1424 | 355 | false, // do not walk code |
duke@435 | 356 | &adjust_root_pointer_closure); |
duke@435 | 357 | |
duke@435 | 358 | // Now adjust pointers in remaining weak roots. (All of which should |
duke@435 | 359 | // have been cleared if they pointed to non-surviving objects.) |
jrose@1424 | 360 | CodeBlobToOopClosure adjust_code_pointer_closure(&adjust_pointer_closure, |
jrose@1424 | 361 | /*do_marking=*/ false); |
duke@435 | 362 | gch->gen_process_weak_roots(&adjust_root_pointer_closure, |
jrose@1424 | 363 | &adjust_code_pointer_closure, |
duke@435 | 364 | &adjust_pointer_closure); |
duke@435 | 365 | |
duke@435 | 366 | adjust_marks(); |
duke@435 | 367 | GenAdjustPointersClosure blk; |
duke@435 | 368 | gch->generation_iterate(&blk, true); |
duke@435 | 369 | pg->adjust_pointers(); |
duke@435 | 370 | } |
duke@435 | 371 | |
duke@435 | 372 | class GenCompactClosure: public GenCollectedHeap::GenClosure { |
duke@435 | 373 | public: |
duke@435 | 374 | void do_generation(Generation* gen) { |
duke@435 | 375 | gen->compact(); |
duke@435 | 376 | } |
duke@435 | 377 | }; |
duke@435 | 378 | |
duke@435 | 379 | void GenMarkSweep::mark_sweep_phase4() { |
duke@435 | 380 | // All pointers are now adjusted, move objects accordingly |
duke@435 | 381 | |
duke@435 | 382 | // It is imperative that we traverse perm_gen first in phase4. All |
duke@435 | 383 | // classes must be allocated earlier than their instances, and traversing |
duke@435 | 384 | // perm_gen first makes sure that all klassOops have moved to their new |
duke@435 | 385 | // location before any instance does a dispatch through it's klass! |
duke@435 | 386 | |
duke@435 | 387 | // The ValidateMarkSweep live oops tracking expects us to traverse spaces |
duke@435 | 388 | // in the same order in phase2, phase3 and phase4. We don't quite do that |
duke@435 | 389 | // here (perm_gen first rather than last), so we tell the validate code |
duke@435 | 390 | // to use a higher index (saved from phase2) when verifying perm_gen. |
duke@435 | 391 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 392 | Generation* pg = gch->perm_gen(); |
duke@435 | 393 | |
duke@435 | 394 | EventMark m("4 compact heap"); |
duke@435 | 395 | TraceTime tm("phase 4", PrintGC && Verbose, true, gclog_or_tty); |
duke@435 | 396 | trace("4"); |
duke@435 | 397 | |
duke@435 | 398 | VALIDATE_MARK_SWEEP_ONLY(reset_live_oop_tracking(true)); |
duke@435 | 399 | |
duke@435 | 400 | pg->compact(); |
duke@435 | 401 | |
duke@435 | 402 | VALIDATE_MARK_SWEEP_ONLY(reset_live_oop_tracking(false)); |
duke@435 | 403 | |
duke@435 | 404 | GenCompactClosure blk; |
duke@435 | 405 | gch->generation_iterate(&blk, true); |
duke@435 | 406 | |
duke@435 | 407 | VALIDATE_MARK_SWEEP_ONLY(compaction_complete()); |
duke@435 | 408 | |
duke@435 | 409 | pg->post_compact(); // Shared spaces verification. |
duke@435 | 410 | } |