equal
deleted
inserted
replaced
139 } |
139 } |
140 |
140 |
141 void G1RemSetTrackingPolicy::update_after_rebuild(HeapRegion* r) { |
141 void G1RemSetTrackingPolicy::update_after_rebuild(HeapRegion* r) { |
142 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); |
142 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); |
143 |
143 |
144 if (r->is_old_or_humongous()) { |
144 if (r->is_old_or_humongous_or_archive()) { |
145 if (r->rem_set()->is_updating()) { |
145 if (r->rem_set()->is_updating()) { |
|
146 assert(!r->is_archive(), "Archive region %u with remembered set", r->hrm_index()); |
146 r->rem_set()->set_state_complete(); |
147 r->rem_set()->set_state_complete(); |
147 } |
148 } |
148 G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
149 G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
149 // We can drop remembered sets of humongous regions that have a too large remembered set: |
150 // We can drop remembered sets of humongous regions that have a too large remembered set: |
150 // We will never try to eagerly reclaim or move them anyway until the next concurrent |
151 // We will never try to eagerly reclaim or move them anyway until the next concurrent |