1 /*
2 * Copyright (c) 2001, 2017, Oracle and/or its affiliates. All rights reserved.
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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc/g1/concurrentG1Refine.hpp"
27 #include "gc/g1/dirtyCardQueue.hpp"
28 #include "gc/g1/g1BlockOffsetTable.inline.hpp"
29 #include "gc/g1/g1CollectedHeap.inline.hpp"
30 #include "gc/g1/g1FromCardCache.hpp"
31 #include "gc/g1/g1GCPhaseTimes.hpp"
32 #include "gc/g1/g1HotCardCache.hpp"
33 #include "gc/g1/g1OopClosures.inline.hpp"
34 #include "gc/g1/g1RemSet.inline.hpp"
35 #include "gc/g1/g1SATBCardTableModRefBS.inline.hpp"
36 #include "gc/g1/heapRegion.inline.hpp"
37 #include "gc/g1/heapRegionManager.inline.hpp"
38 #include "gc/g1/heapRegionRemSet.hpp"
39 #include "gc/shared/gcTraceTime.inline.hpp"
40 #include "memory/iterator.hpp"
41 #include "memory/resourceArea.hpp"
42 #include "oops/oop.inline.hpp"
43 #include "utilities/globalDefinitions.hpp"
44 #include "utilities/intHisto.hpp"
45 #include "utilities/stack.inline.hpp"
46
47 // Collects information about the overall remembered set scan progress during an evacuation.
48 class G1RemSetScanState : public CHeapObj<mtGC> {
49 private:
50 class G1ClearCardTableTask : public AbstractGangTask {
51 G1CollectedHeap* _g1h;
52 uint* _dirty_region_list;
53 size_t _num_dirty_regions;
54 size_t _chunk_length;
55
56 size_t volatile _cur_dirty_regions;
57 public:
58 G1ClearCardTableTask(G1CollectedHeap* g1h,
59 uint* dirty_region_list,
60 size_t num_dirty_regions,
61 size_t chunk_length) :
62 AbstractGangTask("G1 Clear Card Table Task"),
63 _g1h(g1h),
64 _dirty_region_list(dirty_region_list),
65 _num_dirty_regions(num_dirty_regions),
66 _chunk_length(chunk_length),
67 _cur_dirty_regions(0) {
68
69 assert(chunk_length > 0, "must be");
70 }
71
72 static size_t chunk_size() { return M; }
73
74 void work(uint worker_id) {
75 G1SATBCardTableModRefBS* ct_bs = _g1h->g1_barrier_set();
76
77 while (_cur_dirty_regions < _num_dirty_regions) {
78 size_t next = Atomic::add(_chunk_length, &_cur_dirty_regions) - _chunk_length;
79 size_t max = MIN2(next + _chunk_length, _num_dirty_regions);
80
81 for (size_t i = next; i < max; i++) {
82 HeapRegion* r = _g1h->region_at(_dirty_region_list[i]);
83 if (!r->is_survivor()) {
84 ct_bs->clear(MemRegion(r->bottom(), r->end()));
85 }
86 }
87 }
88 }
89 };
90
91 size_t _max_regions;
92
93 // Scan progress for the remembered set of a single region. Transitions from
94 // Unclaimed -> Claimed -> Complete.
95 // At each of the transitions the thread that does the transition needs to perform
96 // some special action once. This is the reason for the extra "Claimed" state.
97 typedef jint G1RemsetIterState;
98
99 static const G1RemsetIterState Unclaimed = 0; // The remembered set has not been scanned yet.
100 static const G1RemsetIterState Claimed = 1; // The remembered set is currently being scanned.
101 static const G1RemsetIterState Complete = 2; // The remembered set has been completely scanned.
102
103 G1RemsetIterState volatile* _iter_states;
104 // The current location where the next thread should continue scanning in a region's
105 // remembered set.
106 size_t volatile* _iter_claims;
107
108 // Temporary buffer holding the regions we used to store remembered set scan duplicate
109 // information. These are also called "dirty". Valid entries are from [0.._cur_dirty_region)
110 uint* _dirty_region_buffer;
111
112 typedef jbyte IsDirtyRegionState;
113 static const IsDirtyRegionState Clean = 0;
114 static const IsDirtyRegionState Dirty = 1;
115 // Holds a flag for every region whether it is in the _dirty_region_buffer already
116 // to avoid duplicates. Uses jbyte since there are no atomic instructions for bools.
117 IsDirtyRegionState* _in_dirty_region_buffer;
118 size_t _cur_dirty_region;
119 public:
120 G1RemSetScanState() :
121 _max_regions(0),
122 _iter_states(NULL),
123 _iter_claims(NULL),
124 _dirty_region_buffer(NULL),
125 _in_dirty_region_buffer(NULL),
126 _cur_dirty_region(0) {
127
128 }
129
130 ~G1RemSetScanState() {
131 if (_iter_states != NULL) {
132 FREE_C_HEAP_ARRAY(G1RemsetIterState, _iter_states);
133 }
134 if (_iter_claims != NULL) {
135 FREE_C_HEAP_ARRAY(size_t, _iter_claims);
136 }
137 if (_dirty_region_buffer != NULL) {
138 FREE_C_HEAP_ARRAY(uint, _dirty_region_buffer);
139 }
140 if (_in_dirty_region_buffer != NULL) {
141 FREE_C_HEAP_ARRAY(IsDirtyRegionState, _in_dirty_region_buffer);
142 }
143 }
144
145 void initialize(uint max_regions) {
146 assert(_iter_states == NULL, "Must not be initialized twice");
147 assert(_iter_claims == NULL, "Must not be initialized twice");
148 _max_regions = max_regions;
149 _iter_states = NEW_C_HEAP_ARRAY(G1RemsetIterState, max_regions, mtGC);
150 _iter_claims = NEW_C_HEAP_ARRAY(size_t, max_regions, mtGC);
151 _dirty_region_buffer = NEW_C_HEAP_ARRAY(uint, max_regions, mtGC);
152 _in_dirty_region_buffer = NEW_C_HEAP_ARRAY(IsDirtyRegionState, max_regions, mtGC);
153 }
154
155 void reset() {
156 for (uint i = 0; i < _max_regions; i++) {
157 _iter_states[i] = Unclaimed;
158 }
159 memset((void*)_iter_claims, 0, _max_regions * sizeof(size_t));
160 memset(_in_dirty_region_buffer, Clean, _max_regions * sizeof(IsDirtyRegionState));
161 _cur_dirty_region = 0;
162 }
163
164 // Attempt to claim the remembered set of the region for iteration. Returns true
165 // if this call caused the transition from Unclaimed to Claimed.
166 inline bool claim_iter(uint region) {
167 assert(region < _max_regions, "Tried to access invalid region %u", region);
168 if (_iter_states[region] != Unclaimed) {
169 return false;
170 }
171 jint res = Atomic::cmpxchg(Claimed, (jint*)(&_iter_states[region]), Unclaimed);
172 return (res == Unclaimed);
173 }
174
175 // Try to atomically sets the iteration state to "complete". Returns true for the
176 // thread that caused the transition.
177 inline bool set_iter_complete(uint region) {
178 if (iter_is_complete(region)) {
179 return false;
180 }
181 jint res = Atomic::cmpxchg(Complete, (jint*)(&_iter_states[region]), Claimed);
182 return (res == Claimed);
183 }
184
185 // Returns true if the region's iteration is complete.
186 inline bool iter_is_complete(uint region) const {
187 assert(region < _max_regions, "Tried to access invalid region %u", region);
188 return _iter_states[region] == Complete;
189 }
190
191 // The current position within the remembered set of the given region.
192 inline size_t iter_claimed(uint region) const {
193 assert(region < _max_regions, "Tried to access invalid region %u", region);
194 return _iter_claims[region];
195 }
196
197 // Claim the next block of cards within the remembered set of the region with
198 // step size.
199 inline size_t iter_claimed_next(uint region, size_t step) {
200 return Atomic::add(step, &_iter_claims[region]) - step;
201 }
202
203 void add_dirty_region(uint region) {
204 if (_in_dirty_region_buffer[region] == Dirty) {
205 return;
206 }
207
208 bool marked_as_dirty = Atomic::cmpxchg(Dirty, &_in_dirty_region_buffer[region], Clean) == Clean;
209 if (marked_as_dirty) {
210 size_t allocated = Atomic::add(1, &_cur_dirty_region) - 1;
211 _dirty_region_buffer[allocated] = region;
212 }
213 }
214
215 // Clear the card table of "dirty" regions.
216 void clear_card_table(WorkGang* workers) {
217 if (_cur_dirty_region == 0) {
218 return;
219 }
220
221 size_t const num_chunks = align_size_up(_cur_dirty_region * HeapRegion::CardsPerRegion, G1ClearCardTableTask::chunk_size()) / G1ClearCardTableTask::chunk_size();
222 uint const num_workers = (uint)MIN2(num_chunks, (size_t)workers->active_workers());
223 size_t const chunk_length = G1ClearCardTableTask::chunk_size() / HeapRegion::CardsPerRegion;
224
225 // Iterate over the dirty cards region list.
226 G1ClearCardTableTask cl(G1CollectedHeap::heap(), _dirty_region_buffer, _cur_dirty_region, chunk_length);
227
228 log_debug(gc, ergo)("Running %s using %u workers for " SIZE_FORMAT " "
229 "units of work for " SIZE_FORMAT " regions.",
230 cl.name(), num_workers, num_chunks, _cur_dirty_region);
231 workers->run_task(&cl, num_workers);
232
233 #ifndef PRODUCT
234 // Need to synchronize with concurrent cleanup since it needs to
235 // finish its card table clearing before we can verify.
236 G1CollectedHeap::heap()->wait_while_free_regions_coming();
237 G1CollectedHeap::heap()->verifier()->verify_card_table_cleanup();
238 #endif
239 }
240 };
241
242 G1RemSet::G1RemSet(G1CollectedHeap* g1,
243 CardTableModRefBS* ct_bs,
244 G1HotCardCache* hot_card_cache) :
245 _g1(g1),
246 _scan_state(new G1RemSetScanState()),
247 _conc_refine_cards(0),
248 _ct_bs(ct_bs),
249 _g1p(_g1->g1_policy()),
250 _hot_card_cache(hot_card_cache),
251 _prev_period_summary(),
252 _into_cset_dirty_card_queue_set(false)
253 {
254 if (log_is_enabled(Trace, gc, remset)) {
255 _prev_period_summary.initialize(this);
256 }
257 // Initialize the card queue set used to hold cards containing
258 // references into the collection set.
259 _into_cset_dirty_card_queue_set.initialize(NULL, // Should never be called by the Java code
260 DirtyCardQ_CBL_mon,
261 DirtyCardQ_FL_lock,
262 -1, // never trigger processing
263 -1, // no limit on length
264 Shared_DirtyCardQ_lock,
265 &JavaThread::dirty_card_queue_set());
266 }
267
268 G1RemSet::~G1RemSet() {
269 if (_scan_state != NULL) {
270 delete _scan_state;
271 }
272 }
273
274 uint G1RemSet::num_par_rem_sets() {
275 return MAX2(DirtyCardQueueSet::num_par_ids() + ConcurrentG1Refine::thread_num(), ParallelGCThreads);
276 }
277
278 void G1RemSet::initialize(size_t capacity, uint max_regions) {
279 G1FromCardCache::initialize(num_par_rem_sets(), max_regions);
280 _scan_state->initialize(max_regions);
281 {
282 GCTraceTime(Debug, gc, marking)("Initialize Card Live Data");
283 _card_live_data.initialize(capacity, max_regions);
284 }
285 if (G1PretouchAuxiliaryMemory) {
286 GCTraceTime(Debug, gc, marking)("Pre-Touch Card Live Data");
287 _card_live_data.pretouch();
288 }
289 }
290
291 G1ScanRSClosure::G1ScanRSClosure(G1RemSetScanState* scan_state,
292 G1ParPushHeapRSClosure* push_heap_cl,
293 CodeBlobClosure* code_root_cl,
294 uint worker_i) :
295 _scan_state(scan_state),
296 _push_heap_cl(push_heap_cl),
297 _code_root_cl(code_root_cl),
298 _strong_code_root_scan_time_sec(0.0),
299 _cards(0),
300 _cards_done(0),
301 _worker_i(worker_i) {
302 _g1h = G1CollectedHeap::heap();
303 _bot = _g1h->bot();
304 _ct_bs = _g1h->g1_barrier_set();
305 _block_size = MAX2<size_t>(G1RSetScanBlockSize, 1);
306 }
307
308 void G1ScanRSClosure::scan_card(size_t index, HeapRegion *r) {
309 // Stack allocate the DirtyCardToOopClosure instance
310 HeapRegionDCTOC cl(_g1h, r, _push_heap_cl, CardTableModRefBS::Precise);
311
312 // Set the "from" region in the closure.
313 _push_heap_cl->set_region(r);
314 MemRegion card_region(_bot->address_for_index(index), BOTConstants::N_words);
315 MemRegion pre_gc_allocated(r->bottom(), r->scan_top());
316 MemRegion mr = pre_gc_allocated.intersection(card_region);
317 if (!mr.is_empty() && !_ct_bs->is_card_claimed(index)) {
318 // We make the card as "claimed" lazily (so races are possible
319 // but they're benign), which reduces the number of duplicate
320 // scans (the rsets of the regions in the cset can intersect).
321 _ct_bs->set_card_claimed(index);
322 _cards_done++;
323 cl.do_MemRegion(mr);
324 }
325 }
326
327 void G1ScanRSClosure::scan_strong_code_roots(HeapRegion* r) {
328 double scan_start = os::elapsedTime();
329 r->strong_code_roots_do(_code_root_cl);
330 _strong_code_root_scan_time_sec += (os::elapsedTime() - scan_start);
331 }
332
333 bool G1ScanRSClosure::doHeapRegion(HeapRegion* r) {
334 assert(r->in_collection_set(), "should only be called on elements of CS.");
335 uint region_idx = r->hrm_index();
336
337 if (_scan_state->iter_is_complete(region_idx)) {
338 return false;
339 }
340 if (_scan_state->claim_iter(region_idx)) {
341 // If we ever free the collection set concurrently, we should also
342 // clear the card table concurrently therefore we won't need to
343 // add regions of the collection set to the dirty cards region.
344 _scan_state->add_dirty_region(region_idx);
345 }
346
347 HeapRegionRemSetIterator iter(r->rem_set());
348 size_t card_index;
349
350 // We claim cards in block so as to reduce the contention. The block size is determined by
351 // the G1RSetScanBlockSize parameter.
352 size_t claimed_card_block = _scan_state->iter_claimed_next(region_idx, _block_size);
353 for (size_t current_card = 0; iter.has_next(card_index); current_card++) {
354 if (current_card >= claimed_card_block + _block_size) {
355 claimed_card_block = _scan_state->iter_claimed_next(region_idx, _block_size);
356 }
357 if (current_card < claimed_card_block) {
358 continue;
359 }
360 HeapWord* card_start = _g1h->bot()->address_for_index(card_index);
361
362 HeapRegion* card_region = _g1h->heap_region_containing(card_start);
363 _cards++;
364
365 _scan_state->add_dirty_region(card_region->hrm_index());
366
367 // If the card is dirty, then we will scan it during updateRS.
368 if (!card_region->in_collection_set() &&
369 !_ct_bs->is_card_dirty(card_index)) {
370 scan_card(card_index, card_region);
371 }
372 }
373 if (_scan_state->set_iter_complete(region_idx)) {
374 // Scan the strong code root list attached to the current region
375 scan_strong_code_roots(r);
376 }
377 return false;
378 }
379
380 size_t G1RemSet::scan_rem_set(G1ParPushHeapRSClosure* oops_in_heap_closure,
381 CodeBlobClosure* heap_region_codeblobs,
382 uint worker_i) {
383 double rs_time_start = os::elapsedTime();
384
385 G1ScanRSClosure cl(_scan_state, oops_in_heap_closure, heap_region_codeblobs, worker_i);
386 _g1->collection_set_iterate_from(&cl, worker_i);
387
388 double scan_rs_time_sec = (os::elapsedTime() - rs_time_start) -
389 cl.strong_code_root_scan_time_sec();
390
391 _g1p->phase_times()->record_time_secs(G1GCPhaseTimes::ScanRS, worker_i, scan_rs_time_sec);
392 _g1p->phase_times()->record_time_secs(G1GCPhaseTimes::CodeRoots, worker_i, cl.strong_code_root_scan_time_sec());
393
394 return cl.cards_done();
395 }
396
397 // Closure used for updating RSets and recording references that
398 // point into the collection set. Only called during an
399 // evacuation pause.
400
401 class RefineRecordRefsIntoCSCardTableEntryClosure: public CardTableEntryClosure {
402 G1RemSet* _g1rs;
403 DirtyCardQueue* _into_cset_dcq;
404 G1ParPushHeapRSClosure* _cl;
405 public:
406 RefineRecordRefsIntoCSCardTableEntryClosure(G1CollectedHeap* g1h,
407 DirtyCardQueue* into_cset_dcq,
408 G1ParPushHeapRSClosure* cl) :
409 _g1rs(g1h->g1_rem_set()), _into_cset_dcq(into_cset_dcq), _cl(cl)
410 {}
411
412 bool do_card_ptr(jbyte* card_ptr, uint worker_i) {
413 // The only time we care about recording cards that
414 // contain references that point into the collection set
415 // is during RSet updating within an evacuation pause.
416 // In this case worker_i should be the id of a GC worker thread.
417 assert(SafepointSynchronize::is_at_safepoint(), "not during an evacuation pause");
418 assert(worker_i < ParallelGCThreads, "should be a GC worker");
419
420 if (_g1rs->refine_card(card_ptr, worker_i, _cl)) {
421 // 'card_ptr' contains references that point into the collection
422 // set. We need to record the card in the DCQS
423 // (_into_cset_dirty_card_queue_set)
424 // that's used for that purpose.
425 //
426 // Enqueue the card
427 _into_cset_dcq->enqueue(card_ptr);
428 }
429 return true;
430 }
431 };
432
433 void G1RemSet::update_rem_set(DirtyCardQueue* into_cset_dcq,
434 G1ParPushHeapRSClosure* oops_in_heap_closure,
435 uint worker_i) {
436 RefineRecordRefsIntoCSCardTableEntryClosure into_cset_update_rs_cl(_g1, into_cset_dcq, oops_in_heap_closure);
437
438 G1GCParPhaseTimesTracker x(_g1p->phase_times(), G1GCPhaseTimes::UpdateRS, worker_i);
439 if (G1HotCardCache::default_use_cache()) {
440 // Apply the closure to the entries of the hot card cache.
441 G1GCParPhaseTimesTracker y(_g1p->phase_times(), G1GCPhaseTimes::ScanHCC, worker_i);
442 _g1->iterate_hcc_closure(&into_cset_update_rs_cl, worker_i);
443 }
444 // Apply the closure to all remaining log entries.
445 _g1->iterate_dirty_card_closure(&into_cset_update_rs_cl, worker_i);
446 }
447
448 void G1RemSet::cleanupHRRS() {
449 HeapRegionRemSet::cleanup();
450 }
451
452 size_t G1RemSet::oops_into_collection_set_do(G1ParPushHeapRSClosure* cl,
453 CodeBlobClosure* heap_region_codeblobs,
454 uint worker_i) {
455 // A DirtyCardQueue that is used to hold cards containing references
456 // that point into the collection set. This DCQ is associated with a
457 // special DirtyCardQueueSet (see g1CollectedHeap.hpp). Under normal
458 // circumstances (i.e. the pause successfully completes), these cards
459 // are just discarded (there's no need to update the RSets of regions
460 // that were in the collection set - after the pause these regions
461 // are wholly 'free' of live objects. In the event of an evacuation
462 // failure the cards/buffers in this queue set are passed to the
463 // DirtyCardQueueSet that is used to manage RSet updates
464 DirtyCardQueue into_cset_dcq(&_into_cset_dirty_card_queue_set);
465
466 update_rem_set(&into_cset_dcq, cl, worker_i);
467 return scan_rem_set(cl, heap_region_codeblobs, worker_i);;
468 }
469
470 void G1RemSet::prepare_for_oops_into_collection_set_do() {
471 _g1->set_refine_cte_cl_concurrency(false);
472 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
473 dcqs.concatenate_logs();
474
475 _scan_state->reset();
476 }
477
478 void G1RemSet::cleanup_after_oops_into_collection_set_do() {
479 G1GCPhaseTimes* phase_times = _g1->g1_policy()->phase_times();
480 // Cleanup after copy
481 _g1->set_refine_cte_cl_concurrency(true);
482
483 // Set all cards back to clean.
484 double start = os::elapsedTime();
485 _scan_state->clear_card_table(_g1->workers());
486 phase_times->record_clear_ct_time((os::elapsedTime() - start) * 1000.0);
487
488 DirtyCardQueueSet& into_cset_dcqs = _into_cset_dirty_card_queue_set;
489
490 if (_g1->evacuation_failed()) {
491 double restore_remembered_set_start = os::elapsedTime();
492
493 // Restore remembered sets for the regions pointing into the collection set.
494 // We just need to transfer the completed buffers from the DirtyCardQueueSet
495 // used to hold cards that contain references that point into the collection set
496 // to the DCQS used to hold the deferred RS updates.
497 _g1->dirty_card_queue_set().merge_bufferlists(&into_cset_dcqs);
498 phase_times->record_evac_fail_restore_remsets((os::elapsedTime() - restore_remembered_set_start) * 1000.0);
499 }
500
501 // Free any completed buffers in the DirtyCardQueueSet used to hold cards
502 // which contain references that point into the collection.
503 _into_cset_dirty_card_queue_set.clear();
504 assert(_into_cset_dirty_card_queue_set.completed_buffers_num() == 0,
505 "all buffers should be freed");
506 _into_cset_dirty_card_queue_set.clear_n_completed_buffers();
507 }
508
509 class G1ScrubRSClosure: public HeapRegionClosure {
510 G1CollectedHeap* _g1h;
511 G1CardLiveData* _live_data;
512 public:
513 G1ScrubRSClosure(G1CardLiveData* live_data) :
514 _g1h(G1CollectedHeap::heap()),
515 _live_data(live_data) { }
516
517 bool doHeapRegion(HeapRegion* r) {
518 if (!r->is_continues_humongous()) {
519 r->rem_set()->scrub(_live_data);
520 }
521 return false;
522 }
523 };
524
525 void G1RemSet::scrub(uint worker_num, HeapRegionClaimer *hrclaimer) {
526 G1ScrubRSClosure scrub_cl(&_card_live_data);
527 _g1->heap_region_par_iterate(&scrub_cl, worker_num, hrclaimer);
528 }
529
530 G1UpdateRSOrPushRefOopClosure::G1UpdateRSOrPushRefOopClosure(G1CollectedHeap* g1h,
531 G1ParPushHeapRSClosure* push_ref_cl,
532 bool record_refs_into_cset,
533 uint worker_i) :
534 _g1(g1h),
535 _from(NULL),
536 _record_refs_into_cset(record_refs_into_cset),
537 _has_refs_into_cset(false),
538 _push_ref_cl(push_ref_cl),
539 _worker_i(worker_i) { }
540
541 // Returns true if the given card contains references that point
542 // into the collection set, if we're checking for such references;
543 // false otherwise.
544
545 bool G1RemSet::refine_card(jbyte* card_ptr,
546 uint worker_i,
547 G1ParPushHeapRSClosure* oops_in_heap_closure) {
548 assert(_g1->is_in_exact(_ct_bs->addr_for(card_ptr)),
549 "Card at " PTR_FORMAT " index " SIZE_FORMAT " representing heap at " PTR_FORMAT " (%u) must be in committed heap",
550 p2i(card_ptr),
551 _ct_bs->index_for(_ct_bs->addr_for(card_ptr)),
552 p2i(_ct_bs->addr_for(card_ptr)),
553 _g1->addr_to_region(_ct_bs->addr_for(card_ptr)));
554
555 bool check_for_refs_into_cset = oops_in_heap_closure != NULL;
556
557 // If the card is no longer dirty, nothing to do.
558 if (*card_ptr != CardTableModRefBS::dirty_card_val()) {
559 // No need to return that this card contains refs that point
560 // into the collection set.
561 return false;
562 }
563
564 // Construct the region representing the card.
565 HeapWord* start = _ct_bs->addr_for(card_ptr);
566 // And find the region containing it.
567 HeapRegion* r = _g1->heap_region_containing(start);
568
569 // This check is needed for some uncommon cases where we should
570 // ignore the card.
571 //
572 // The region could be young. Cards for young regions are
573 // distinctly marked (set to g1_young_gen), so the post-barrier will
574 // filter them out. However, that marking is performed
575 // concurrently. A write to a young object could occur before the
576 // card has been marked young, slipping past the filter.
577 //
578 // The card could be stale, because the region has been freed since
579 // the card was recorded. In this case the region type could be
580 // anything. If (still) free or (reallocated) young, just ignore
581 // it. If (reallocated) old or humongous, the later card trimming
582 // and additional checks in iteration may detect staleness. At
583 // worst, we end up processing a stale card unnecessarily.
584 //
585 // In the normal (non-stale) case, the synchronization between the
586 // enqueueing of the card and processing it here will have ensured
587 // we see the up-to-date region type here.
588 if (!r->is_old_or_humongous()) {
589 return false;
590 }
591
592 // While we are processing RSet buffers during the collection, we
593 // actually don't want to scan any cards on the collection set,
594 // since we don't want to update remembered sets with entries that
595 // point into the collection set, given that live objects from the
596 // collection set are about to move and such entries will be stale
597 // very soon. This change also deals with a reliability issue which
598 // involves scanning a card in the collection set and coming across
599 // an array that was being chunked and looking malformed. Note,
600 // however, that if evacuation fails, we have to scan any objects
601 // that were not moved and create any missing entries.
602 if (r->in_collection_set()) {
603 return false;
604 }
605
606 // The result from the hot card cache insert call is either:
607 // * pointer to the current card
608 // (implying that the current card is not 'hot'),
609 // * null
610 // (meaning we had inserted the card ptr into the "hot" card cache,
611 // which had some headroom),
612 // * a pointer to a "hot" card that was evicted from the "hot" cache.
613 //
614
615 if (_hot_card_cache->use_cache()) {
616 assert(!check_for_refs_into_cset, "sanity");
617 assert(!SafepointSynchronize::is_at_safepoint(), "sanity");
618
619 const jbyte* orig_card_ptr = card_ptr;
620 card_ptr = _hot_card_cache->insert(card_ptr);
621 if (card_ptr == NULL) {
622 // There was no eviction. Nothing to do.
623 return false;
624 } else if (card_ptr != orig_card_ptr) {
625 // Original card was inserted and an old card was evicted.
626 start = _ct_bs->addr_for(card_ptr);
627 r = _g1->heap_region_containing(start);
628
629 // Check whether the region formerly in the cache should be
630 // ignored, as discussed earlier for the original card. The
631 // region could have been freed while in the cache. The cset is
632 // not relevant here, since we're in concurrent phase.
633 if (!r->is_old_or_humongous()) {
634 return false;
635 }
636 } // Else we still have the original card.
637 }
638
639 // Trim the region designated by the card to what's been allocated
640 // in the region. The card could be stale, or the card could cover
641 // (part of) an object at the end of the allocated space and extend
642 // beyond the end of allocation.
643 HeapWord* scan_limit;
644 if (_g1->is_gc_active()) {
645 // If we're in a STW GC, then a card might be in a GC alloc region
646 // and extend onto a GC LAB, which may not be parsable. Stop such
647 // at the "scan_top" of the region.
648 scan_limit = r->scan_top();
649 } else {
650 // Non-humongous objects are only allocated in the old-gen during
651 // GC, so if region is old then top is stable. Humongous object
652 // allocation sets top last; if top has not yet been set, this is
653 // a stale card and we'll end up with an empty intersection. If
654 // this is not a stale card, the synchronization between the
655 // enqueuing of the card and processing it here will have ensured
656 // we see the up-to-date top here.
657 scan_limit = r->top();
658 }
659 if (scan_limit <= start) {
660 // If the trimmed region is empty, the card must be stale.
661 return false;
662 }
663
664 // Okay to clean and process the card now. There are still some
665 // stale card cases that may be detected by iteration and dealt with
666 // as iteration failure.
667 *const_cast<volatile jbyte*>(card_ptr) = CardTableModRefBS::clean_card_val();
668
669 // This fence serves two purposes. First, the card must be cleaned
670 // before processing the contents. Second, we can't proceed with
671 // processing until after the read of top, for synchronization with
672 // possibly concurrent humongous object allocation. It's okay that
673 // reading top and reading type were racy wrto each other. We need
674 // both set, in any order, to proceed.
675 OrderAccess::fence();
676
677 // Don't use addr_for(card_ptr + 1) which can ask for
678 // a card beyond the heap.
679 HeapWord* end = start + CardTableModRefBS::card_size_in_words;
680 MemRegion dirty_region(start, MIN2(scan_limit, end));
681 assert(!dirty_region.is_empty(), "sanity");
682
683 G1UpdateRSOrPushRefOopClosure update_rs_oop_cl(_g1,
684 oops_in_heap_closure,
685 check_for_refs_into_cset,
686 worker_i);
687 update_rs_oop_cl.set_from(r);
688
689 bool card_processed =
690 r->oops_on_card_seq_iterate_careful(dirty_region,
691 &update_rs_oop_cl);
692
693 // If unable to process the card then we encountered an unparsable
694 // part of the heap (e.g. a partially allocated object) while
695 // processing a stale card. Despite the card being stale, redirty
696 // and re-enqueue, because we've already cleaned the card. Without
697 // this we could incorrectly discard a non-stale card.
698 if (!card_processed) {
699 assert(!_g1->is_gc_active(), "Unparsable heap during GC");
700 // The card might have gotten re-dirtied and re-enqueued while we
701 // worked. (In fact, it's pretty likely.)
702 if (*card_ptr != CardTableModRefBS::dirty_card_val()) {
703 *card_ptr = CardTableModRefBS::dirty_card_val();
704 MutexLockerEx x(Shared_DirtyCardQ_lock,
705 Mutex::_no_safepoint_check_flag);
706 DirtyCardQueue* sdcq =
707 JavaThread::dirty_card_queue_set().shared_dirty_card_queue();
708 sdcq->enqueue(card_ptr);
709 }
710 } else {
711 _conc_refine_cards++;
712 }
713
714 // This gets set to true if the card being refined has references that point
715 // into the collection set.
716 bool has_refs_into_cset = update_rs_oop_cl.has_refs_into_cset();
717
718 // We should only be detecting that the card contains references
719 // that point into the collection set if the current thread is
720 // a GC worker thread.
721 assert(!has_refs_into_cset || SafepointSynchronize::is_at_safepoint(),
722 "invalid result at non safepoint");
723
724 return has_refs_into_cset;
725 }
726
727 void G1RemSet::print_periodic_summary_info(const char* header, uint period_count) {
728 if ((G1SummarizeRSetStatsPeriod > 0) && log_is_enabled(Trace, gc, remset) &&
729 (period_count % G1SummarizeRSetStatsPeriod == 0)) {
730
731 if (!_prev_period_summary.initialized()) {
732 _prev_period_summary.initialize(this);
733 }
734
735 G1RemSetSummary current;
736 current.initialize(this);
737 _prev_period_summary.subtract_from(¤t);
738
739 Log(gc, remset) log;
740 log.trace("%s", header);
741 ResourceMark rm;
742 _prev_period_summary.print_on(log.trace_stream());
743
744 _prev_period_summary.set(¤t);
745 }
746 }
747
748 void G1RemSet::print_summary_info() {
749 Log(gc, remset, exit) log;
750 if (log.is_trace()) {
751 log.trace(" Cumulative RS summary");
752 G1RemSetSummary current;
753 current.initialize(this);
754 ResourceMark rm;
755 current.print_on(log.trace_stream());
756 }
757 }
758
759 void G1RemSet::prepare_for_verify() {
760 if (G1HRRSFlushLogBuffersOnVerify &&
761 (VerifyBeforeGC || VerifyAfterGC)
762 && (!_g1->collector_state()->full_collection() || G1VerifyRSetsDuringFullGC)) {
763 cleanupHRRS();
764 _g1->set_refine_cte_cl_concurrency(false);
765 if (SafepointSynchronize::is_at_safepoint()) {
766 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
767 dcqs.concatenate_logs();
768 }
769
770 bool use_hot_card_cache = _hot_card_cache->use_cache();
771 _hot_card_cache->set_use_cache(false);
772
773 DirtyCardQueue into_cset_dcq(&_into_cset_dirty_card_queue_set);
774 update_rem_set(&into_cset_dcq, NULL, 0);
775 _into_cset_dirty_card_queue_set.clear();
776
777 _hot_card_cache->set_use_cache(use_hot_card_cache);
778 assert(JavaThread::dirty_card_queue_set().completed_buffers_num() == 0, "All should be consumed");
779 }
780 }
781
782 void G1RemSet::create_card_live_data(WorkGang* workers, G1CMBitMap* mark_bitmap) {
783 _card_live_data.create(workers, mark_bitmap);
784 }
785
786 void G1RemSet::finalize_card_live_data(WorkGang* workers, G1CMBitMap* mark_bitmap) {
787 _card_live_data.finalize(workers, mark_bitmap);
788 }
789
790 void G1RemSet::verify_card_live_data(WorkGang* workers, G1CMBitMap* bitmap) {
791 _card_live_data.verify(workers, bitmap);
792 }
793
794 void G1RemSet::clear_card_live_data(WorkGang* workers) {
795 _card_live_data.clear(workers);
796 }
797
798 #ifdef ASSERT
799 void G1RemSet::verify_card_live_data_is_clear() {
800 _card_live_data.verify_is_clear();
801 }
802 #endif