Mercurial > hg > graal-compiler
annotate src/share/vm/gc_implementation/g1/g1MarkSweep.cpp @ 2153:377371490991
Merge
author | johnc |
---|---|
date | Thu, 20 Jan 2011 13:57:12 -0800 |
parents | 9afee0b9fc1d 0fa27f37d4d4 |
children | 3582bf76420e |
rev | line source |
---|---|
342 | 1 /* |
2152 | 2 * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved. |
342 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1387
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1387
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1387
diff
changeset
|
21 * questions. |
342 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "classfile/javaClasses.hpp" | |
27 #include "classfile/symbolTable.hpp" | |
28 #include "classfile/systemDictionary.hpp" | |
29 #include "classfile/vmSymbols.hpp" | |
30 #include "code/codeCache.hpp" | |
31 #include "code/icBuffer.hpp" | |
32 #include "gc_implementation/g1/g1MarkSweep.hpp" | |
33 #include "memory/gcLocker.hpp" | |
34 #include "memory/genCollectedHeap.hpp" | |
35 #include "memory/modRefBarrierSet.hpp" | |
36 #include "memory/referencePolicy.hpp" | |
37 #include "memory/space.hpp" | |
38 #include "oops/instanceRefKlass.hpp" | |
39 #include "oops/oop.inline.hpp" | |
40 #include "prims/jvmtiExport.hpp" | |
41 #include "runtime/aprofiler.hpp" | |
42 #include "runtime/biasedLocking.hpp" | |
43 #include "runtime/fprofiler.hpp" | |
44 #include "runtime/synchronizer.hpp" | |
45 #include "runtime/thread.hpp" | |
46 #include "runtime/vmThread.hpp" | |
47 #include "utilities/copy.hpp" | |
48 #include "utilities/events.hpp" | |
342 | 49 |
50 class HeapRegion; | |
51 | |
52 void G1MarkSweep::invoke_at_safepoint(ReferenceProcessor* rp, | |
53 bool clear_all_softrefs) { | |
54 assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint"); | |
55 | |
1387
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1311
diff
changeset
|
56 SharedHeap* sh = SharedHeap::heap(); |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1311
diff
changeset
|
57 #ifdef ASSERT |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1311
diff
changeset
|
58 if (sh->collector_policy()->should_clear_all_soft_refs()) { |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1311
diff
changeset
|
59 assert(clear_all_softrefs, "Policy should have been checked earler"); |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1311
diff
changeset
|
60 } |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1311
diff
changeset
|
61 #endif |
342 | 62 // hook up weak ref data so it can be used during Mark-Sweep |
63 assert(GenMarkSweep::ref_processor() == NULL, "no stomping"); | |
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
358
diff
changeset
|
64 assert(rp != NULL, "should be non-NULL"); |
342 | 65 GenMarkSweep::_ref_processor = rp; |
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
66 rp->setup_policy(clear_all_softrefs); |
342 | 67 |
68 // When collecting the permanent generation methodOops may be moving, | |
69 // so we either have to flush all bcp data or convert it into bci. | |
70 CodeCache::gc_prologue(); | |
71 Threads::gc_prologue(); | |
72 | |
73 // Increment the invocation count for the permanent generation, since it is | |
74 // implicitly collected whenever we do a full mark sweep collection. | |
75 sh->perm_gen()->stat_record()->invocations++; | |
76 | |
77 bool marked_for_unloading = false; | |
78 | |
79 allocate_stacks(); | |
80 | |
358
8651a65ac4b4
6735416: G1: runThese javasoft.sqe.tests.lang.thrd011.thrd01101.thrd01101 fails
iveresov
parents:
342
diff
changeset
|
81 // We should save the marks of the currently locked biased monitors. |
8651a65ac4b4
6735416: G1: runThese javasoft.sqe.tests.lang.thrd011.thrd01101.thrd01101 fails
iveresov
parents:
342
diff
changeset
|
82 // The marking doesn't preserve the marks of biased objects. |
8651a65ac4b4
6735416: G1: runThese javasoft.sqe.tests.lang.thrd011.thrd01101.thrd01101 fails
iveresov
parents:
342
diff
changeset
|
83 BiasedLocking::preserve_marks(); |
8651a65ac4b4
6735416: G1: runThese javasoft.sqe.tests.lang.thrd011.thrd01101.thrd01101 fails
iveresov
parents:
342
diff
changeset
|
84 |
342 | 85 mark_sweep_phase1(marked_for_unloading, clear_all_softrefs); |
86 | |
751 | 87 if (VerifyDuringGC) { |
342 | 88 G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
89 g1h->checkConcurrentMark(); | |
90 } | |
91 | |
92 mark_sweep_phase2(); | |
93 | |
94 // Don't add any more derived pointers during phase3 | |
95 COMPILER2_PRESENT(DerivedPointerTable::set_active(false)); | |
96 | |
97 mark_sweep_phase3(); | |
98 | |
99 mark_sweep_phase4(); | |
100 | |
101 GenMarkSweep::restore_marks(); | |
358
8651a65ac4b4
6735416: G1: runThese javasoft.sqe.tests.lang.thrd011.thrd01101.thrd01101 fails
iveresov
parents:
342
diff
changeset
|
102 BiasedLocking::restore_marks(); |
342 | 103 GenMarkSweep::deallocate_stacks(); |
104 | |
105 // We must invalidate the perm-gen rs, so that it gets rebuilt. | |
106 GenRemSet* rs = sh->rem_set(); | |
107 rs->invalidate(sh->perm_gen()->used_region(), true /*whole_heap*/); | |
108 | |
109 // "free at last gc" is calculated from these. | |
110 // CHF: cheating for now!!! | |
111 // Universe::set_heap_capacity_at_last_gc(Universe::heap()->capacity()); | |
112 // Universe::set_heap_used_at_last_gc(Universe::heap()->used()); | |
113 | |
114 Threads::gc_epilogue(); | |
115 CodeCache::gc_epilogue(); | |
2147
9afee0b9fc1d
7012505: BreakpointWithFullGC.sh fails with Internal Error (src/share/vm/oops/methodOop.cpp:220)
kamg
parents:
1972
diff
changeset
|
116 JvmtiExport::gc_epilogue(); |
342 | 117 |
118 // refs processing: clean slate | |
119 GenMarkSweep::_ref_processor = NULL; | |
120 } | |
121 | |
122 | |
123 void G1MarkSweep::allocate_stacks() { | |
124 GenMarkSweep::_preserved_count_max = 0; | |
125 GenMarkSweep::_preserved_marks = NULL; | |
126 GenMarkSweep::_preserved_count = 0; | |
127 } | |
128 | |
129 void G1MarkSweep::mark_sweep_phase1(bool& marked_for_unloading, | |
130 bool clear_all_softrefs) { | |
131 // Recursively traverse all live objects and mark them | |
132 EventMark m("1 mark object"); | |
133 TraceTime tm("phase 1", PrintGC && Verbose, true, gclog_or_tty); | |
134 GenMarkSweep::trace(" 1"); | |
135 | |
136 SharedHeap* sh = SharedHeap::heap(); | |
137 | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
138 sh->process_strong_roots(true, // activeate StrongRootsScope |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
139 true, // Collecting permanent generation. |
342 | 140 SharedHeap::SO_SystemClasses, |
141 &GenMarkSweep::follow_root_closure, | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
142 &GenMarkSweep::follow_code_root_closure, |
342 | 143 &GenMarkSweep::follow_root_closure); |
144 | |
145 // Process reference objects found during marking | |
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
358
diff
changeset
|
146 ReferenceProcessor* rp = GenMarkSweep::ref_processor(); |
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
147 rp->setup_policy(clear_all_softrefs); |
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
358
diff
changeset
|
148 rp->process_discovered_references(&GenMarkSweep::is_alive, |
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
358
diff
changeset
|
149 &GenMarkSweep::keep_alive, |
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
358
diff
changeset
|
150 &GenMarkSweep::follow_stack_closure, |
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
358
diff
changeset
|
151 NULL); |
342 | 152 |
153 // Follow system dictionary roots and unload classes | |
154 bool purged_class = SystemDictionary::do_unloading(&GenMarkSweep::is_alive); | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
155 assert(GenMarkSweep::_marking_stack.is_empty(), |
342 | 156 "stack should be empty by now"); |
157 | |
158 // Follow code cache roots (has to be done after system dictionary, | |
159 // assumes all live klasses are marked) | |
160 CodeCache::do_unloading(&GenMarkSweep::is_alive, | |
161 &GenMarkSweep::keep_alive, | |
162 purged_class); | |
941 | 163 GenMarkSweep::follow_stack(); |
342 | 164 |
165 // Update subklass/sibling/implementor links of live klasses | |
166 GenMarkSweep::follow_weak_klass_links(); | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
167 assert(GenMarkSweep::_marking_stack.is_empty(), |
342 | 168 "stack should be empty by now"); |
169 | |
941 | 170 // Visit memoized MDO's and clear any unmarked weak refs |
171 GenMarkSweep::follow_mdo_weak_refs(); | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
172 assert(GenMarkSweep::_marking_stack.is_empty(), "just drained"); |
941 | 173 |
174 | |
342 | 175 // Visit symbol and interned string tables and delete unmarked oops |
176 SymbolTable::unlink(&GenMarkSweep::is_alive); | |
177 StringTable::unlink(&GenMarkSweep::is_alive); | |
178 | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
179 assert(GenMarkSweep::_marking_stack.is_empty(), |
342 | 180 "stack should be empty by now"); |
181 } | |
182 | |
183 class G1PrepareCompactClosure: public HeapRegionClosure { | |
2152 | 184 G1CollectedHeap* _g1h; |
342 | 185 ModRefBarrierSet* _mrbs; |
186 CompactPoint _cp; | |
2152 | 187 size_t _pre_used; |
188 FreeRegionList _free_list; | |
189 HumongousRegionSet _humongous_proxy_set; | |
342 | 190 |
191 void free_humongous_region(HeapRegion* hr) { | |
192 HeapWord* end = hr->end(); | |
193 assert(hr->startsHumongous(), | |
194 "Only the start of a humongous region should be freed."); | |
2152 | 195 _g1h->free_humongous_region(hr, &_pre_used, &_free_list, |
196 &_humongous_proxy_set, false /* par */); | |
197 // Do we also need to do this for the continues humongous regions | |
198 // we just collapsed? | |
342 | 199 hr->prepare_for_compaction(&_cp); |
200 // Also clear the part of the card table that will be unused after | |
201 // compaction. | |
2152 | 202 _mrbs->clear(MemRegion(hr->compaction_top(), end)); |
342 | 203 } |
204 | |
205 public: | |
2152 | 206 G1PrepareCompactClosure(CompactibleSpace* cs) |
207 : _g1h(G1CollectedHeap::heap()), | |
208 _mrbs(G1CollectedHeap::heap()->mr_bs()), | |
342 | 209 _cp(NULL, cs, cs->initialize_threshold()), |
2152 | 210 _pre_used(0), |
211 _free_list("Local Free List for G1MarkSweep"), | |
212 _humongous_proxy_set("G1MarkSweep Humongous Proxy Set") { } | |
213 | |
214 void update_sets() { | |
215 // We'll recalculate total used bytes and recreate the free list | |
216 // at the end of the GC, so no point in updating those values here. | |
217 _g1h->update_sets_after_freeing_regions(0, /* pre_used */ | |
218 NULL, /* free_list */ | |
219 &_humongous_proxy_set, | |
220 false /* par */); | |
221 _free_list.remove_all(); | |
222 } | |
223 | |
342 | 224 bool doHeapRegion(HeapRegion* hr) { |
225 if (hr->isHumongous()) { | |
226 if (hr->startsHumongous()) { | |
227 oop obj = oop(hr->bottom()); | |
228 if (obj->is_gc_marked()) { | |
229 obj->forward_to(obj); | |
230 } else { | |
231 free_humongous_region(hr); | |
232 } | |
233 } else { | |
234 assert(hr->continuesHumongous(), "Invalid humongous."); | |
235 } | |
236 } else { | |
237 hr->prepare_for_compaction(&_cp); | |
238 // Also clear the part of the card table that will be unused after | |
239 // compaction. | |
240 _mrbs->clear(MemRegion(hr->compaction_top(), hr->end())); | |
241 } | |
242 return false; | |
243 } | |
244 }; | |
677 | 245 |
246 // Finds the first HeapRegion. | |
342 | 247 class FindFirstRegionClosure: public HeapRegionClosure { |
248 HeapRegion* _a_region; | |
249 public: | |
677 | 250 FindFirstRegionClosure() : _a_region(NULL) {} |
342 | 251 bool doHeapRegion(HeapRegion* r) { |
677 | 252 _a_region = r; |
253 return true; | |
342 | 254 } |
255 HeapRegion* result() { return _a_region; } | |
256 }; | |
257 | |
258 void G1MarkSweep::mark_sweep_phase2() { | |
259 // Now all live objects are marked, compute the new object addresses. | |
260 | |
261 // It is imperative that we traverse perm_gen LAST. If dead space is | |
262 // allowed a range of dead object may get overwritten by a dead int | |
263 // array. If perm_gen is not traversed last a klassOop may get | |
264 // overwritten. This is fine since it is dead, but if the class has dead | |
265 // instances we have to skip them, and in order to find their size we | |
266 // need the klassOop! | |
267 // | |
268 // It is not required that we traverse spaces in the same order in | |
269 // phase2, phase3 and phase4, but the ValidateMarkSweep live oops | |
270 // tracking expects us to do so. See comment under phase4. | |
271 | |
272 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
273 Generation* pg = g1h->perm_gen(); | |
274 | |
275 EventMark m("2 compute new addresses"); | |
276 TraceTime tm("phase 2", PrintGC && Verbose, true, gclog_or_tty); | |
277 GenMarkSweep::trace("2"); | |
278 | |
677 | 279 FindFirstRegionClosure cl; |
342 | 280 g1h->heap_region_iterate(&cl); |
281 HeapRegion *r = cl.result(); | |
282 CompactibleSpace* sp = r; | |
283 if (r->isHumongous() && oop(r->bottom())->is_gc_marked()) { | |
284 sp = r->next_compaction_space(); | |
285 } | |
286 | |
677 | 287 G1PrepareCompactClosure blk(sp); |
342 | 288 g1h->heap_region_iterate(&blk); |
2152 | 289 blk.update_sets(); |
342 | 290 |
291 CompactPoint perm_cp(pg, NULL, NULL); | |
292 pg->prepare_for_compaction(&perm_cp); | |
293 } | |
294 | |
295 class G1AdjustPointersClosure: public HeapRegionClosure { | |
296 public: | |
297 bool doHeapRegion(HeapRegion* r) { | |
298 if (r->isHumongous()) { | |
299 if (r->startsHumongous()) { | |
300 // We must adjust the pointers on the single H object. | |
301 oop obj = oop(r->bottom()); | |
302 debug_only(GenMarkSweep::track_interior_pointers(obj)); | |
303 // point all the oops to the new location | |
304 obj->adjust_pointers(); | |
305 debug_only(GenMarkSweep::check_interior_pointers()); | |
306 } | |
307 } else { | |
308 // This really ought to be "as_CompactibleSpace"... | |
309 r->adjust_pointers(); | |
310 } | |
311 return false; | |
312 } | |
313 }; | |
314 | |
315 void G1MarkSweep::mark_sweep_phase3() { | |
316 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
317 Generation* pg = g1h->perm_gen(); | |
318 | |
319 // Adjust the pointers to reflect the new locations | |
320 EventMark m("3 adjust pointers"); | |
321 TraceTime tm("phase 3", PrintGC && Verbose, true, gclog_or_tty); | |
322 GenMarkSweep::trace("3"); | |
323 | |
324 SharedHeap* sh = SharedHeap::heap(); | |
325 | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
326 sh->process_strong_roots(true, // activate StrongRootsScope |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
327 true, // Collecting permanent generation. |
342 | 328 SharedHeap::SO_AllClasses, |
329 &GenMarkSweep::adjust_root_pointer_closure, | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
330 NULL, // do not touch code cache here |
342 | 331 &GenMarkSweep::adjust_pointer_closure); |
332 | |
333 g1h->ref_processor()->weak_oops_do(&GenMarkSweep::adjust_root_pointer_closure); | |
334 | |
335 // Now adjust pointers in remaining weak roots. (All of which should | |
336 // have been cleared if they pointed to non-surviving objects.) | |
337 g1h->g1_process_weak_roots(&GenMarkSweep::adjust_root_pointer_closure, | |
338 &GenMarkSweep::adjust_pointer_closure); | |
339 | |
340 GenMarkSweep::adjust_marks(); | |
341 | |
342 G1AdjustPointersClosure blk; | |
343 g1h->heap_region_iterate(&blk); | |
344 pg->adjust_pointers(); | |
345 } | |
346 | |
347 class G1SpaceCompactClosure: public HeapRegionClosure { | |
348 public: | |
349 G1SpaceCompactClosure() {} | |
350 | |
351 bool doHeapRegion(HeapRegion* hr) { | |
352 if (hr->isHumongous()) { | |
353 if (hr->startsHumongous()) { | |
354 oop obj = oop(hr->bottom()); | |
355 if (obj->is_gc_marked()) { | |
356 obj->init_mark(); | |
357 } else { | |
358 assert(hr->is_empty(), "Should have been cleared in phase 2."); | |
359 } | |
360 hr->reset_during_compaction(); | |
361 } | |
362 } else { | |
363 hr->compact(); | |
364 } | |
365 return false; | |
366 } | |
367 }; | |
368 | |
369 void G1MarkSweep::mark_sweep_phase4() { | |
370 // All pointers are now adjusted, move objects accordingly | |
371 | |
372 // It is imperative that we traverse perm_gen first in phase4. All | |
373 // classes must be allocated earlier than their instances, and traversing | |
374 // perm_gen first makes sure that all klassOops have moved to their new | |
375 // location before any instance does a dispatch through it's klass! | |
376 | |
377 // The ValidateMarkSweep live oops tracking expects us to traverse spaces | |
378 // in the same order in phase2, phase3 and phase4. We don't quite do that | |
379 // here (perm_gen first rather than last), so we tell the validate code | |
380 // to use a higher index (saved from phase2) when verifying perm_gen. | |
381 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
382 Generation* pg = g1h->perm_gen(); | |
383 | |
384 EventMark m("4 compact heap"); | |
385 TraceTime tm("phase 4", PrintGC && Verbose, true, gclog_or_tty); | |
386 GenMarkSweep::trace("4"); | |
387 | |
388 pg->compact(); | |
389 | |
390 G1SpaceCompactClosure blk; | |
391 g1h->heap_region_iterate(&blk); | |
392 | |
393 } | |
394 | |
395 // Local Variables: *** | |
396 // c-indentation-style: gnu *** | |
397 // End: *** |