1 /*
2 * Copyright (c) 2001, 2013, 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_implementation/g1/bufferingOopClosure.hpp"
27 #include "gc_implementation/g1/concurrentG1Refine.hpp"
28 #include "gc_implementation/g1/concurrentG1RefineThread.hpp"
29 #include "gc_implementation/g1/g1BlockOffsetTable.inline.hpp"
30 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
31 #include "gc_implementation/g1/g1CollectorPolicy.hpp"
32 #include "gc_implementation/g1/g1HotCardCache.hpp"
33 #include "gc_implementation/g1/g1GCPhaseTimes.hpp"
34 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
35 #include "gc_implementation/g1/g1RemSet.inline.hpp"
36 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
37 #include "gc_implementation/g1/heapRegionRemSet.hpp"
38 #include "memory/iterator.hpp"
39 #include "oops/oop.inline.hpp"
40 #include "utilities/intHisto.hpp"
41
42 #define CARD_REPEAT_HISTO 0
43
44 #if CARD_REPEAT_HISTO
45 static size_t ct_freq_sz;
46 static jbyte* ct_freq = NULL;
47
48 void init_ct_freq_table(size_t heap_sz_bytes) {
49 if (ct_freq == NULL) {
50 ct_freq_sz = heap_sz_bytes/CardTableModRefBS::card_size;
51 ct_freq = new jbyte[ct_freq_sz];
52 for (size_t j = 0; j < ct_freq_sz; j++) ct_freq[j] = 0;
53 }
54 }
55
56 void ct_freq_note_card(size_t index) {
57 assert(0 <= index && index < ct_freq_sz, "Bounds error.");
58 if (ct_freq[index] < 100) { ct_freq[index]++; }
59 }
60
61 static IntHistogram card_repeat_count(10, 10);
62
63 void ct_freq_update_histo_and_reset() {
64 for (size_t j = 0; j < ct_freq_sz; j++) {
65 card_repeat_count.add_entry(ct_freq[j]);
66 ct_freq[j] = 0;
67 }
68
69 }
70 #endif
71
72 G1RemSet::G1RemSet(G1CollectedHeap* g1, CardTableModRefBS* ct_bs)
73 : _g1(g1), _conc_refine_cards(0),
74 _ct_bs(ct_bs), _g1p(_g1->g1_policy()),
75 _cg1r(g1->concurrent_g1_refine()),
76 _cset_rs_update_cl(NULL),
77 _cards_scanned(NULL), _total_cards_scanned(0),
78 _prev_period_summary()
79 {
80 _seq_task = new SubTasksDone(NumSeqTasks);
81 guarantee(n_workers() > 0, "There should be some workers");
82 _cset_rs_update_cl = NEW_C_HEAP_ARRAY(OopsInHeapRegionClosure*, n_workers(), mtGC);
83 for (uint i = 0; i < n_workers(); i++) {
84 _cset_rs_update_cl[i] = NULL;
85 }
86 _prev_period_summary.initialize(this, n_workers());
87 }
88
89 G1RemSet::~G1RemSet() {
90 delete _seq_task;
91 for (uint i = 0; i < n_workers(); i++) {
92 assert(_cset_rs_update_cl[i] == NULL, "it should be");
93 }
94 FREE_C_HEAP_ARRAY(OopsInHeapRegionClosure*, _cset_rs_update_cl, mtGC);
95 }
96
97 void CountNonCleanMemRegionClosure::do_MemRegion(MemRegion mr) {
98 if (_g1->is_in_g1_reserved(mr.start())) {
99 _n += (int) ((mr.byte_size() / CardTableModRefBS::card_size));
100 if (_start_first == NULL) _start_first = mr.start();
101 }
102 }
103
104 class ScanRSClosure : public HeapRegionClosure {
105 size_t _cards_done, _cards;
106 G1CollectedHeap* _g1h;
107
108 OopsInHeapRegionClosure* _oc;
109 CodeBlobToOopClosure* _code_root_cl;
110
111 G1BlockOffsetSharedArray* _bot_shared;
112 CardTableModRefBS *_ct_bs;
113
114 double _strong_code_root_scan_time_sec;
115 int _worker_i;
116 int _block_size;
117 bool _try_claimed;
118
119 public:
120 ScanRSClosure(OopsInHeapRegionClosure* oc,
121 CodeBlobToOopClosure* code_root_cl,
122 int worker_i) :
123 _oc(oc),
124 _code_root_cl(code_root_cl),
125 _strong_code_root_scan_time_sec(0.0),
126 _cards(0),
127 _cards_done(0),
128 _worker_i(worker_i),
129 _try_claimed(false)
130 {
131 _g1h = G1CollectedHeap::heap();
132 _bot_shared = _g1h->bot_shared();
133 _ct_bs = (CardTableModRefBS*) (_g1h->barrier_set());
134 _block_size = MAX2<int>(G1RSetScanBlockSize, 1);
135 }
136
137 void set_try_claimed() { _try_claimed = true; }
138
139 void scanCard(size_t index, HeapRegion *r) {
140 // Stack allocate the DirtyCardToOopClosure instance
141 HeapRegionDCTOC cl(_g1h, r, _oc,
142 CardTableModRefBS::Precise,
143 HeapRegionDCTOC::IntoCSFilterKind);
144
145 // Set the "from" region in the closure.
146 _oc->set_region(r);
147 HeapWord* card_start = _bot_shared->address_for_index(index);
148 HeapWord* card_end = card_start + G1BlockOffsetSharedArray::N_words;
149 Space *sp = SharedHeap::heap()->space_containing(card_start);
150 MemRegion sm_region = sp->used_region_at_save_marks();
151 MemRegion mr = sm_region.intersection(MemRegion(card_start,card_end));
152 if (!mr.is_empty() && !_ct_bs->is_card_claimed(index)) {
153 // We make the card as "claimed" lazily (so races are possible
154 // but they're benign), which reduces the number of duplicate
155 // scans (the rsets of the regions in the cset can intersect).
156 _ct_bs->set_card_claimed(index);
157 _cards_done++;
158 cl.do_MemRegion(mr);
159 }
160 }
161
162 void printCard(HeapRegion* card_region, size_t card_index,
163 HeapWord* card_start) {
164 gclog_or_tty->print_cr("T %d Region [" PTR_FORMAT ", " PTR_FORMAT ") "
165 "RS names card %p: "
166 "[" PTR_FORMAT ", " PTR_FORMAT ")",
167 _worker_i,
168 card_region->bottom(), card_region->end(),
169 card_index,
170 card_start, card_start + G1BlockOffsetSharedArray::N_words);
171 }
172
173 void scan_strong_code_roots(HeapRegion* r) {
174 double scan_start = os::elapsedTime();
175 r->strong_code_roots_do(_code_root_cl);
176 _strong_code_root_scan_time_sec += (os::elapsedTime() - scan_start);
177 }
178
179 bool doHeapRegion(HeapRegion* r) {
180 assert(r->in_collection_set(), "should only be called on elements of CS.");
181 HeapRegionRemSet* hrrs = r->rem_set();
182 if (hrrs->iter_is_complete()) return false; // All done.
183 if (!_try_claimed && !hrrs->claim_iter()) return false;
184 // If we ever free the collection set concurrently, we should also
185 // clear the card table concurrently therefore we won't need to
186 // add regions of the collection set to the dirty cards region.
187 _g1h->push_dirty_cards_region(r);
188 // If we didn't return above, then
189 // _try_claimed || r->claim_iter()
190 // is true: either we're supposed to work on claimed-but-not-complete
191 // regions, or we successfully claimed the region.
192
193 HeapRegionRemSetIterator iter(hrrs);
194 size_t card_index;
195
196 // We claim cards in block so as to recude the contention. The block size is determined by
197 // the G1RSetScanBlockSize parameter.
198 size_t jump_to_card = hrrs->iter_claimed_next(_block_size);
199 for (size_t current_card = 0; iter.has_next(card_index); current_card++) {
200 if (current_card >= jump_to_card + _block_size) {
201 jump_to_card = hrrs->iter_claimed_next(_block_size);
202 }
203 if (current_card < jump_to_card) continue;
204 HeapWord* card_start = _g1h->bot_shared()->address_for_index(card_index);
205 #if 0
206 gclog_or_tty->print("Rem set iteration yielded card [" PTR_FORMAT ", " PTR_FORMAT ").\n",
207 card_start, card_start + CardTableModRefBS::card_size_in_words);
208 #endif
209
210 HeapRegion* card_region = _g1h->heap_region_containing(card_start);
211 assert(card_region != NULL, "Yielding cards not in the heap?");
212 _cards++;
213
214 if (!card_region->is_on_dirty_cards_region_list()) {
215 _g1h->push_dirty_cards_region(card_region);
216 }
217
218 // If the card is dirty, then we will scan it during updateRS.
219 if (!card_region->in_collection_set() &&
220 !_ct_bs->is_card_dirty(card_index)) {
221 scanCard(card_index, card_region);
222 }
223 }
224 if (!_try_claimed) {
225 // Scan the strong code root list attached to the current region
226 scan_strong_code_roots(r);
227
228 hrrs->set_iter_complete();
229 }
230 return false;
231 }
232
233 double strong_code_root_scan_time_sec() {
234 return _strong_code_root_scan_time_sec;
235 }
236
237 size_t cards_done() { return _cards_done;}
238 size_t cards_looked_up() { return _cards;}
239 };
240
241 void G1RemSet::scanRS(OopsInHeapRegionClosure* oc,
242 CodeBlobToOopClosure* code_root_cl,
243 int worker_i) {
244 double rs_time_start = os::elapsedTime();
245 HeapRegion *startRegion = _g1->start_cset_region_for_worker(worker_i);
246
247 ScanRSClosure scanRScl(oc, code_root_cl, worker_i);
248
249 _g1->collection_set_iterate_from(startRegion, &scanRScl);
250 scanRScl.set_try_claimed();
251 _g1->collection_set_iterate_from(startRegion, &scanRScl);
252
253 double scan_rs_time_sec = (os::elapsedTime() - rs_time_start)
254 - scanRScl.strong_code_root_scan_time_sec();
255
256 assert(_cards_scanned != NULL, "invariant");
257 _cards_scanned[worker_i] = scanRScl.cards_done();
258
259 _g1p->phase_times()->record_scan_rs_time(worker_i, scan_rs_time_sec * 1000.0);
260 _g1p->phase_times()->record_strong_code_root_scan_time(worker_i,
261 scanRScl.strong_code_root_scan_time_sec() * 1000.0);
262 }
263
264 // Closure used for updating RSets and recording references that
265 // point into the collection set. Only called during an
266 // evacuation pause.
267
268 class RefineRecordRefsIntoCSCardTableEntryClosure: public CardTableEntryClosure {
269 G1RemSet* _g1rs;
270 DirtyCardQueue* _into_cset_dcq;
271 public:
272 RefineRecordRefsIntoCSCardTableEntryClosure(G1CollectedHeap* g1h,
273 DirtyCardQueue* into_cset_dcq) :
274 _g1rs(g1h->g1_rem_set()), _into_cset_dcq(into_cset_dcq)
275 {}
276 bool do_card_ptr(jbyte* card_ptr, int worker_i) {
277 // The only time we care about recording cards that
278 // contain references that point into the collection set
279 // is during RSet updating within an evacuation pause.
280 // In this case worker_i should be the id of a GC worker thread.
281 assert(SafepointSynchronize::is_at_safepoint(), "not during an evacuation pause");
282 assert(worker_i < (int) (ParallelGCThreads == 0 ? 1 : ParallelGCThreads), "should be a GC worker");
283
284 if (_g1rs->refine_card(card_ptr, worker_i, true)) {
285 // 'card_ptr' contains references that point into the collection
286 // set. We need to record the card in the DCQS
287 // (G1CollectedHeap::into_cset_dirty_card_queue_set())
288 // that's used for that purpose.
289 //
290 // Enqueue the card
291 _into_cset_dcq->enqueue(card_ptr);
292 }
293 return true;
294 }
295 };
296
297 void G1RemSet::updateRS(DirtyCardQueue* into_cset_dcq, int worker_i) {
298 double start = os::elapsedTime();
299 // Apply the given closure to all remaining log entries.
300 RefineRecordRefsIntoCSCardTableEntryClosure into_cset_update_rs_cl(_g1, into_cset_dcq);
301
302 _g1->iterate_dirty_card_closure(&into_cset_update_rs_cl, into_cset_dcq, false, worker_i);
303
304 // Now there should be no dirty cards.
305 if (G1RSLogCheckCardTable) {
306 CountNonCleanMemRegionClosure cl(_g1);
307 _ct_bs->mod_card_iterate(&cl);
308 // XXX This isn't true any more: keeping cards of young regions
309 // marked dirty broke it. Need some reasonable fix.
310 guarantee(cl.n() == 0, "Card table should be clean.");
311 }
312
313 _g1p->phase_times()->record_update_rs_time(worker_i, (os::elapsedTime() - start) * 1000.0);
314 }
315
316 void G1RemSet::cleanupHRRS() {
317 HeapRegionRemSet::cleanup();
318 }
319
320 void G1RemSet::oops_into_collection_set_do(OopsInHeapRegionClosure* oc,
321 CodeBlobToOopClosure* code_root_cl,
322 int worker_i) {
323 #if CARD_REPEAT_HISTO
324 ct_freq_update_histo_and_reset();
325 #endif
326
327 // We cache the value of 'oc' closure into the appropriate slot in the
328 // _cset_rs_update_cl for this worker
329 assert(worker_i < (int)n_workers(), "sanity");
330 _cset_rs_update_cl[worker_i] = oc;
331
332 // A DirtyCardQueue that is used to hold cards containing references
333 // that point into the collection set. This DCQ is associated with a
334 // special DirtyCardQueueSet (see g1CollectedHeap.hpp). Under normal
335 // circumstances (i.e. the pause successfully completes), these cards
336 // are just discarded (there's no need to update the RSets of regions
337 // that were in the collection set - after the pause these regions
338 // are wholly 'free' of live objects. In the event of an evacuation
339 // failure the cards/buffers in this queue set are:
340 // * passed to the DirtyCardQueueSet that is used to manage deferred
341 // RSet updates, or
342 // * scanned for references that point into the collection set
343 // and the RSet of the corresponding region in the collection set
344 // is updated immediately.
345 DirtyCardQueue into_cset_dcq(&_g1->into_cset_dirty_card_queue_set());
346
347 assert((ParallelGCThreads > 0) || worker_i == 0, "invariant");
348
349 // The two flags below were introduced temporarily to serialize
350 // the updating and scanning of remembered sets. There are some
351 // race conditions when these two operations are done in parallel
352 // and they are causing failures. When we resolve said race
353 // conditions, we'll revert back to parallel remembered set
354 // updating and scanning. See CRs 6677707 and 6677708.
355 if (G1UseParallelRSetUpdating || (worker_i == 0)) {
356 updateRS(&into_cset_dcq, worker_i);
357 } else {
358 _g1p->phase_times()->record_update_rs_processed_buffers(worker_i, 0);
359 _g1p->phase_times()->record_update_rs_time(worker_i, 0.0);
360 }
361 if (G1UseParallelRSetScanning || (worker_i == 0)) {
362 scanRS(oc, code_root_cl, worker_i);
363 } else {
364 _g1p->phase_times()->record_scan_rs_time(worker_i, 0.0);
365 }
366
367 // We now clear the cached values of _cset_rs_update_cl for this worker
368 _cset_rs_update_cl[worker_i] = NULL;
369 }
370
371 void G1RemSet::prepare_for_oops_into_collection_set_do() {
372 cleanupHRRS();
373 ConcurrentG1Refine* cg1r = _g1->concurrent_g1_refine();
374 _g1->set_refine_cte_cl_concurrency(false);
375 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
376 dcqs.concatenate_logs();
377
378 if (G1CollectedHeap::use_parallel_gc_threads()) {
379 // Don't set the number of workers here. It will be set
380 // when the task is run
381 // _seq_task->set_n_termination((int)n_workers());
382 }
383 guarantee( _cards_scanned == NULL, "invariant" );
384 _cards_scanned = NEW_C_HEAP_ARRAY(size_t, n_workers(), mtGC);
385 for (uint i = 0; i < n_workers(); ++i) {
386 _cards_scanned[i] = 0;
387 }
388 _total_cards_scanned = 0;
389 }
390
391
392 // This closure, applied to a DirtyCardQueueSet, is used to immediately
393 // update the RSets for the regions in the CSet. For each card it iterates
394 // through the oops which coincide with that card. It scans the reference
395 // fields in each oop; when it finds an oop that points into the collection
396 // set, the RSet for the region containing the referenced object is updated.
397 class UpdateRSetCardTableEntryIntoCSetClosure: public CardTableEntryClosure {
398 G1CollectedHeap* _g1;
399 CardTableModRefBS* _ct_bs;
400 public:
401 UpdateRSetCardTableEntryIntoCSetClosure(G1CollectedHeap* g1,
402 CardTableModRefBS* bs):
403 _g1(g1), _ct_bs(bs)
404 { }
405
406 bool do_card_ptr(jbyte* card_ptr, int worker_i) {
407 // Construct the region representing the card.
408 HeapWord* start = _ct_bs->addr_for(card_ptr);
409 // And find the region containing it.
410 HeapRegion* r = _g1->heap_region_containing(start);
411 assert(r != NULL, "unexpected null");
412
413 // Scan oops in the card looking for references into the collection set
414 // Don't use addr_for(card_ptr + 1) which can ask for
415 // a card beyond the heap. This is not safe without a perm
416 // gen.
417 HeapWord* end = start + CardTableModRefBS::card_size_in_words;
418 MemRegion scanRegion(start, end);
419
420 UpdateRSetImmediate update_rs_cl(_g1->g1_rem_set());
421 FilterIntoCSClosure update_rs_cset_oop_cl(NULL, _g1, &update_rs_cl);
422 FilterOutOfRegionClosure filter_then_update_rs_cset_oop_cl(r, &update_rs_cset_oop_cl);
423
424 // We can pass false as the "filter_young" parameter here as:
425 // * we should be in a STW pause,
426 // * the DCQS to which this closure is applied is used to hold
427 // references that point into the collection set from the prior
428 // RSet updating,
429 // * the post-write barrier shouldn't be logging updates to young
430 // regions (but there is a situation where this can happen - see
431 // the comment in G1RemSet::refine_card() below -
432 // that should not be applicable here), and
433 // * during actual RSet updating, the filtering of cards in young
434 // regions in HeapRegion::oops_on_card_seq_iterate_careful is
435 // employed.
436 // As a result, when this closure is applied to "refs into cset"
437 // DCQS, we shouldn't see any cards in young regions.
438 update_rs_cl.set_region(r);
439 HeapWord* stop_point =
440 r->oops_on_card_seq_iterate_careful(scanRegion,
441 &filter_then_update_rs_cset_oop_cl,
442 false /* filter_young */,
443 NULL /* card_ptr */);
444
445 // Since this is performed in the event of an evacuation failure, we
446 // we shouldn't see a non-null stop point
447 assert(stop_point == NULL, "saw an unallocated region");
448 return true;
449 }
450 };
451
452 void G1RemSet::cleanup_after_oops_into_collection_set_do() {
453 guarantee( _cards_scanned != NULL, "invariant" );
454 _total_cards_scanned = 0;
455 for (uint i = 0; i < n_workers(); ++i) {
456 _total_cards_scanned += _cards_scanned[i];
457 }
458 FREE_C_HEAP_ARRAY(size_t, _cards_scanned, mtGC);
459 _cards_scanned = NULL;
460 // Cleanup after copy
461 _g1->set_refine_cte_cl_concurrency(true);
462 // Set all cards back to clean.
463 _g1->cleanUpCardTable();
464
465 DirtyCardQueueSet& into_cset_dcqs = _g1->into_cset_dirty_card_queue_set();
466 int into_cset_n_buffers = into_cset_dcqs.completed_buffers_num();
467
468 if (_g1->evacuation_failed()) {
469 // Restore remembered sets for the regions pointing into the collection set.
470
471 if (G1DeferredRSUpdate) {
472 // If deferred RS updates are enabled then we just need to transfer
473 // the completed buffers from (a) the DirtyCardQueueSet used to hold
474 // cards that contain references that point into the collection set
475 // to (b) the DCQS used to hold the deferred RS updates
476 _g1->dirty_card_queue_set().merge_bufferlists(&into_cset_dcqs);
477 } else {
478
479 CardTableModRefBS* bs = (CardTableModRefBS*)_g1->barrier_set();
480 UpdateRSetCardTableEntryIntoCSetClosure update_rs_cset_immediate(_g1, bs);
481
482 int n_completed_buffers = 0;
483 while (into_cset_dcqs.apply_closure_to_completed_buffer(&update_rs_cset_immediate,
484 0, 0, true)) {
485 n_completed_buffers++;
486 }
487 assert(n_completed_buffers == into_cset_n_buffers, "missed some buffers");
488 }
489 }
490
491 // Free any completed buffers in the DirtyCardQueueSet used to hold cards
492 // which contain references that point into the collection.
493 _g1->into_cset_dirty_card_queue_set().clear();
494 assert(_g1->into_cset_dirty_card_queue_set().completed_buffers_num() == 0,
495 "all buffers should be freed");
496 _g1->into_cset_dirty_card_queue_set().clear_n_completed_buffers();
497 }
498
499 class ScrubRSClosure: public HeapRegionClosure {
500 G1CollectedHeap* _g1h;
501 BitMap* _region_bm;
502 BitMap* _card_bm;
503 CardTableModRefBS* _ctbs;
504 public:
505 ScrubRSClosure(BitMap* region_bm, BitMap* card_bm) :
506 _g1h(G1CollectedHeap::heap()),
507 _region_bm(region_bm), _card_bm(card_bm),
508 _ctbs(NULL)
509 {
510 ModRefBarrierSet* bs = _g1h->mr_bs();
511 guarantee(bs->is_a(BarrierSet::CardTableModRef), "Precondition");
512 _ctbs = (CardTableModRefBS*)bs;
513 }
514
515 bool doHeapRegion(HeapRegion* r) {
516 if (!r->continuesHumongous()) {
517 r->rem_set()->scrub(_ctbs, _region_bm, _card_bm);
518 }
519 return false;
520 }
521 };
522
523 void G1RemSet::scrub(BitMap* region_bm, BitMap* card_bm) {
524 ScrubRSClosure scrub_cl(region_bm, card_bm);
525 _g1->heap_region_iterate(&scrub_cl);
526 }
527
528 void G1RemSet::scrub_par(BitMap* region_bm, BitMap* card_bm,
529 uint worker_num, int claim_val) {
530 ScrubRSClosure scrub_cl(region_bm, card_bm);
531 _g1->heap_region_par_iterate_chunked(&scrub_cl,
532 worker_num,
533 n_workers(),
534 claim_val);
535 }
536
537 G1TriggerClosure::G1TriggerClosure() :
538 _triggered(false) { }
539
540 G1InvokeIfNotTriggeredClosure::G1InvokeIfNotTriggeredClosure(G1TriggerClosure* t_cl,
541 OopClosure* oop_cl) :
542 _trigger_cl(t_cl), _oop_cl(oop_cl) { }
543
544 G1Mux2Closure::G1Mux2Closure(OopClosure *c1, OopClosure *c2) :
545 _c1(c1), _c2(c2) { }
546
547 G1UpdateRSOrPushRefOopClosure::
548 G1UpdateRSOrPushRefOopClosure(G1CollectedHeap* g1h,
549 G1RemSet* rs,
550 OopsInHeapRegionClosure* push_ref_cl,
551 bool record_refs_into_cset,
552 int worker_i) :
553 _g1(g1h), _g1_rem_set(rs), _from(NULL),
554 _record_refs_into_cset(record_refs_into_cset),
555 _push_ref_cl(push_ref_cl), _worker_i(worker_i) { }
556
557 // Returns true if the given card contains references that point
558 // into the collection set, if we're checking for such references;
559 // false otherwise.
560
561 bool G1RemSet::refine_card(jbyte* card_ptr, int worker_i,
562 bool check_for_refs_into_cset) {
563
564 // If the card is no longer dirty, nothing to do.
565 if (*card_ptr != CardTableModRefBS::dirty_card_val()) {
566 // No need to return that this card contains refs that point
567 // into the collection set.
568 return false;
569 }
570
571 // Construct the region representing the card.
572 HeapWord* start = _ct_bs->addr_for(card_ptr);
573 // And find the region containing it.
574 HeapRegion* r = _g1->heap_region_containing(start);
575 if (r == NULL) {
576 // Again no need to return that this card contains refs that
577 // point into the collection set.
578 return false; // Not in the G1 heap (might be in perm, for example.)
579 }
580
581 // Why do we have to check here whether a card is on a young region,
582 // given that we dirty young regions and, as a result, the
583 // post-barrier is supposed to filter them out and never to enqueue
584 // them? When we allocate a new region as the "allocation region" we
585 // actually dirty its cards after we release the lock, since card
586 // dirtying while holding the lock was a performance bottleneck. So,
587 // as a result, it is possible for other threads to actually
588 // allocate objects in the region (after the acquire the lock)
589 // before all the cards on the region are dirtied. This is unlikely,
590 // and it doesn't happen often, but it can happen. So, the extra
591 // check below filters out those cards.
592 if (r->is_young()) {
593 return false;
594 }
595
596 // While we are processing RSet buffers during the collection, we
597 // actually don't want to scan any cards on the collection set,
598 // since we don't want to update remebered sets with entries that
599 // point into the collection set, given that live objects from the
600 // collection set are about to move and such entries will be stale
601 // very soon. This change also deals with a reliability issue which
602 // involves scanning a card in the collection set and coming across
603 // an array that was being chunked and looking malformed. Note,
604 // however, that if evacuation fails, we have to scan any objects
605 // that were not moved and create any missing entries.
606 if (r->in_collection_set()) {
607 return false;
608 }
609
610 // The result from the hot card cache insert call is either:
611 // * pointer to the current card
612 // (implying that the current card is not 'hot'),
613 // * null
614 // (meaning we had inserted the card ptr into the "hot" card cache,
615 // which had some headroom),
616 // * a pointer to a "hot" card that was evicted from the "hot" cache.
617 //
618
619 G1HotCardCache* hot_card_cache = _cg1r->hot_card_cache();
620 if (hot_card_cache->use_cache()) {
621 assert(!check_for_refs_into_cset, "sanity");
622 assert(!SafepointSynchronize::is_at_safepoint(), "sanity");
623
624 card_ptr = hot_card_cache->insert(card_ptr);
625 if (card_ptr == NULL) {
626 // There was no eviction. Nothing to do.
627 return false;
628 }
629
630 start = _ct_bs->addr_for(card_ptr);
631 r = _g1->heap_region_containing(start);
632 if (r == NULL) {
633 // Not in the G1 heap
634 return false;
635 }
636
637 // Checking whether the region we got back from the cache
638 // is young here is inappropriate. The region could have been
639 // freed, reallocated and tagged as young while in the cache.
640 // Hence we could see its young type change at any time.
641 }
642
643 // Don't use addr_for(card_ptr + 1) which can ask for
644 // a card beyond the heap. This is not safe without a perm
645 // gen at the upper end of the heap.
646 HeapWord* end = start + CardTableModRefBS::card_size_in_words;
647 MemRegion dirtyRegion(start, end);
648
649 #if CARD_REPEAT_HISTO
650 init_ct_freq_table(_g1->max_capacity());
651 ct_freq_note_card(_ct_bs->index_for(start));
652 #endif
653
654 OopsInHeapRegionClosure* oops_in_heap_closure = NULL;
655 if (check_for_refs_into_cset) {
656 // ConcurrentG1RefineThreads have worker numbers larger than what
657 // _cset_rs_update_cl[] is set up to handle. But those threads should
658 // only be active outside of a collection which means that when they
659 // reach here they should have check_for_refs_into_cset == false.
660 assert((size_t)worker_i < n_workers(), "index of worker larger than _cset_rs_update_cl[].length");
661 oops_in_heap_closure = _cset_rs_update_cl[worker_i];
662 }
663 G1UpdateRSOrPushRefOopClosure update_rs_oop_cl(_g1,
664 _g1->g1_rem_set(),
665 oops_in_heap_closure,
666 check_for_refs_into_cset,
667 worker_i);
668 update_rs_oop_cl.set_from(r);
669
670 G1TriggerClosure trigger_cl;
671 FilterIntoCSClosure into_cs_cl(NULL, _g1, &trigger_cl);
672 G1InvokeIfNotTriggeredClosure invoke_cl(&trigger_cl, &into_cs_cl);
673 G1Mux2Closure mux(&invoke_cl, &update_rs_oop_cl);
674
675 FilterOutOfRegionClosure filter_then_update_rs_oop_cl(r,
676 (check_for_refs_into_cset ?
677 (OopClosure*)&mux :
678 (OopClosure*)&update_rs_oop_cl));
679
680 // The region for the current card may be a young region. The
681 // current card may have been a card that was evicted from the
682 // card cache. When the card was inserted into the cache, we had
683 // determined that its region was non-young. While in the cache,
684 // the region may have been freed during a cleanup pause, reallocated
685 // and tagged as young.
686 //
687 // We wish to filter out cards for such a region but the current
688 // thread, if we're running concurrently, may "see" the young type
689 // change at any time (so an earlier "is_young" check may pass or
690 // fail arbitrarily). We tell the iteration code to perform this
691 // filtering when it has been determined that there has been an actual
692 // allocation in this region and making it safe to check the young type.
693 bool filter_young = true;
694
695 HeapWord* stop_point =
696 r->oops_on_card_seq_iterate_careful(dirtyRegion,
697 &filter_then_update_rs_oop_cl,
698 filter_young,
699 card_ptr);
700
701 // If stop_point is non-null, then we encountered an unallocated region
702 // (perhaps the unfilled portion of a TLAB.) For now, we'll dirty the
703 // card and re-enqueue: if we put off the card until a GC pause, then the
704 // unallocated portion will be filled in. Alternatively, we might try
705 // the full complexity of the technique used in "regular" precleaning.
706 if (stop_point != NULL) {
707 // The card might have gotten re-dirtied and re-enqueued while we
708 // worked. (In fact, it's pretty likely.)
709 if (*card_ptr != CardTableModRefBS::dirty_card_val()) {
710 *card_ptr = CardTableModRefBS::dirty_card_val();
711 MutexLockerEx x(Shared_DirtyCardQ_lock,
712 Mutex::_no_safepoint_check_flag);
713 DirtyCardQueue* sdcq =
714 JavaThread::dirty_card_queue_set().shared_dirty_card_queue();
715 sdcq->enqueue(card_ptr);
716 }
717 } else {
718 _conc_refine_cards++;
719 }
720
721 // This gets set to true if the card being refined has
722 // references that point into the collection set.
723 bool has_refs_into_cset = trigger_cl.triggered();
724
725 // We should only be detecting that the card contains references
726 // that point into the collection set if the current thread is
727 // a GC worker thread.
728 assert(!has_refs_into_cset || SafepointSynchronize::is_at_safepoint(),
729 "invalid result at non safepoint");
730
731 return has_refs_into_cset;
732 }
733
734 void G1RemSet::print_periodic_summary_info() {
735 G1RemSetSummary current;
736 current.initialize(this, n_workers());
737
738 _prev_period_summary.subtract_from(¤t);
739 print_summary_info(&_prev_period_summary);
740
741 _prev_period_summary.set(¤t);
742 }
743
744 void G1RemSet::print_summary_info() {
745 G1RemSetSummary current;
746 current.initialize(this, n_workers());
747
748 print_summary_info(¤t, " Cumulative RS summary");
749 }
750
751 void G1RemSet::print_summary_info(G1RemSetSummary * summary, const char * header) {
752 assert(summary != NULL, "just checking");
753
754 if (header != NULL) {
755 gclog_or_tty->print_cr("%s", header);
756 }
757
758 #if CARD_REPEAT_HISTO
759 gclog_or_tty->print_cr("\nG1 card_repeat count histogram: ");
760 gclog_or_tty->print_cr(" # of repeats --> # of cards with that number.");
761 card_repeat_count.print_on(gclog_or_tty);
762 #endif
763
764 summary->print_on(gclog_or_tty);
765 }
766
767 void G1RemSet::prepare_for_verify() {
768 if (G1HRRSFlushLogBuffersOnVerify &&
769 (VerifyBeforeGC || VerifyAfterGC)
770 && (!_g1->full_collection() || G1VerifyRSetsDuringFullGC)) {
771 cleanupHRRS();
772 _g1->set_refine_cte_cl_concurrency(false);
773 if (SafepointSynchronize::is_at_safepoint()) {
774 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
775 dcqs.concatenate_logs();
776 }
777
778 G1HotCardCache* hot_card_cache = _cg1r->hot_card_cache();
779 bool use_hot_card_cache = hot_card_cache->use_cache();
780 hot_card_cache->set_use_cache(false);
781
782 DirtyCardQueue into_cset_dcq(&_g1->into_cset_dirty_card_queue_set());
783 updateRS(&into_cset_dcq, 0);
784 _g1->into_cset_dirty_card_queue_set().clear();
785
786 hot_card_cache->set_use_cache(use_hot_card_cache);
787 assert(JavaThread::dirty_card_queue_set().completed_buffers_num() == 0, "All should be consumed");
788 }
789 }