Mon, 24 Mar 2014 15:30:30 +0100
8035815: Cache-align and pad the from card cache
Summary: The from card cache is a very frequently accessed data structure. It is essentially a 2d array of per-region values, one row of values for every GC thread. Pad and align the data structure to avoid false sharing.
Reviewed-by: stefank
1 /*
2 * Copyright (c) 2001, 2014, 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 */
25 #include "precompiled.hpp"
26 #include "gc_implementation/g1/concurrentG1Refine.hpp"
27 #include "gc_implementation/g1/g1BlockOffsetTable.inline.hpp"
28 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
29 #include "gc_implementation/g1/heapRegionRemSet.hpp"
30 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
31 #include "memory/allocation.hpp"
32 #include "memory/padded.inline.hpp"
33 #include "memory/space.inline.hpp"
34 #include "oops/oop.inline.hpp"
35 #include "utilities/bitMap.inline.hpp"
36 #include "utilities/globalDefinitions.hpp"
37 #include "utilities/growableArray.hpp"
39 class PerRegionTable: public CHeapObj<mtGC> {
40 friend class OtherRegionsTable;
41 friend class HeapRegionRemSetIterator;
43 HeapRegion* _hr;
44 BitMap _bm;
45 jint _occupied;
47 // next pointer for free/allocated 'all' list
48 PerRegionTable* _next;
50 // prev pointer for the allocated 'all' list
51 PerRegionTable* _prev;
53 // next pointer in collision list
54 PerRegionTable * _collision_list_next;
56 // Global free list of PRTs
57 static PerRegionTable* _free_list;
59 protected:
60 // We need access in order to union things into the base table.
61 BitMap* bm() { return &_bm; }
63 void recount_occupied() {
64 _occupied = (jint) bm()->count_one_bits();
65 }
67 PerRegionTable(HeapRegion* hr) :
68 _hr(hr),
69 _occupied(0),
70 _bm(HeapRegion::CardsPerRegion, false /* in-resource-area */),
71 _collision_list_next(NULL), _next(NULL), _prev(NULL)
72 {}
74 void add_card_work(CardIdx_t from_card, bool par) {
75 if (!_bm.at(from_card)) {
76 if (par) {
77 if (_bm.par_at_put(from_card, 1)) {
78 Atomic::inc(&_occupied);
79 }
80 } else {
81 _bm.at_put(from_card, 1);
82 _occupied++;
83 }
84 }
85 }
87 void add_reference_work(OopOrNarrowOopStar from, bool par) {
88 // Must make this robust in case "from" is not in "_hr", because of
89 // concurrency.
91 if (G1TraceHeapRegionRememberedSet) {
92 gclog_or_tty->print_cr(" PRT::Add_reference_work(" PTR_FORMAT "->" PTR_FORMAT").",
93 from,
94 UseCompressedOops
95 ? (void *)oopDesc::load_decode_heap_oop((narrowOop*)from)
96 : (void *)oopDesc::load_decode_heap_oop((oop*)from));
97 }
99 HeapRegion* loc_hr = hr();
100 // If the test below fails, then this table was reused concurrently
101 // with this operation. This is OK, since the old table was coarsened,
102 // and adding a bit to the new table is never incorrect.
103 // If the table used to belong to a continues humongous region and is
104 // now reused for the corresponding start humongous region, we need to
105 // make sure that we detect this. Thus, we call is_in_reserved_raw()
106 // instead of just is_in_reserved() here.
107 if (loc_hr->is_in_reserved_raw(from)) {
108 size_t hw_offset = pointer_delta((HeapWord*)from, loc_hr->bottom());
109 CardIdx_t from_card = (CardIdx_t)
110 hw_offset >> (CardTableModRefBS::card_shift - LogHeapWordSize);
112 assert(0 <= from_card && (size_t)from_card < HeapRegion::CardsPerRegion,
113 "Must be in range.");
114 add_card_work(from_card, par);
115 }
116 }
118 public:
120 HeapRegion* hr() const { return _hr; }
122 jint occupied() const {
123 // Overkill, but if we ever need it...
124 // guarantee(_occupied == _bm.count_one_bits(), "Check");
125 return _occupied;
126 }
128 void init(HeapRegion* hr, bool clear_links_to_all_list) {
129 if (clear_links_to_all_list) {
130 set_next(NULL);
131 set_prev(NULL);
132 }
133 _hr = hr;
134 _collision_list_next = NULL;
135 _occupied = 0;
136 _bm.clear();
137 }
139 void add_reference(OopOrNarrowOopStar from) {
140 add_reference_work(from, /*parallel*/ true);
141 }
143 void seq_add_reference(OopOrNarrowOopStar from) {
144 add_reference_work(from, /*parallel*/ false);
145 }
147 void scrub(CardTableModRefBS* ctbs, BitMap* card_bm) {
148 HeapWord* hr_bot = hr()->bottom();
149 size_t hr_first_card_index = ctbs->index_for(hr_bot);
150 bm()->set_intersection_at_offset(*card_bm, hr_first_card_index);
151 recount_occupied();
152 }
154 void add_card(CardIdx_t from_card_index) {
155 add_card_work(from_card_index, /*parallel*/ true);
156 }
158 void seq_add_card(CardIdx_t from_card_index) {
159 add_card_work(from_card_index, /*parallel*/ false);
160 }
162 // (Destructively) union the bitmap of the current table into the given
163 // bitmap (which is assumed to be of the same size.)
164 void union_bitmap_into(BitMap* bm) {
165 bm->set_union(_bm);
166 }
168 // Mem size in bytes.
169 size_t mem_size() const {
170 return sizeof(this) + _bm.size_in_words() * HeapWordSize;
171 }
173 // Requires "from" to be in "hr()".
174 bool contains_reference(OopOrNarrowOopStar from) const {
175 assert(hr()->is_in_reserved(from), "Precondition.");
176 size_t card_ind = pointer_delta(from, hr()->bottom(),
177 CardTableModRefBS::card_size);
178 return _bm.at(card_ind);
179 }
181 // Bulk-free the PRTs from prt to last, assumes that they are
182 // linked together using their _next field.
183 static void bulk_free(PerRegionTable* prt, PerRegionTable* last) {
184 while (true) {
185 PerRegionTable* fl = _free_list;
186 last->set_next(fl);
187 PerRegionTable* res = (PerRegionTable*) Atomic::cmpxchg_ptr(prt, &_free_list, fl);
188 if (res == fl) {
189 return;
190 }
191 }
192 ShouldNotReachHere();
193 }
195 static void free(PerRegionTable* prt) {
196 bulk_free(prt, prt);
197 }
199 // Returns an initialized PerRegionTable instance.
200 static PerRegionTable* alloc(HeapRegion* hr) {
201 PerRegionTable* fl = _free_list;
202 while (fl != NULL) {
203 PerRegionTable* nxt = fl->next();
204 PerRegionTable* res =
205 (PerRegionTable*)
206 Atomic::cmpxchg_ptr(nxt, &_free_list, fl);
207 if (res == fl) {
208 fl->init(hr, true);
209 return fl;
210 } else {
211 fl = _free_list;
212 }
213 }
214 assert(fl == NULL, "Loop condition.");
215 return new PerRegionTable(hr);
216 }
218 PerRegionTable* next() const { return _next; }
219 void set_next(PerRegionTable* next) { _next = next; }
220 PerRegionTable* prev() const { return _prev; }
221 void set_prev(PerRegionTable* prev) { _prev = prev; }
223 // Accessor and Modification routines for the pointer for the
224 // singly linked collision list that links the PRTs within the
225 // OtherRegionsTable::_fine_grain_regions hash table.
226 //
227 // It might be useful to also make the collision list doubly linked
228 // to avoid iteration over the collisions list during scrubbing/deletion.
229 // OTOH there might not be many collisions.
231 PerRegionTable* collision_list_next() const {
232 return _collision_list_next;
233 }
235 void set_collision_list_next(PerRegionTable* next) {
236 _collision_list_next = next;
237 }
239 PerRegionTable** collision_list_next_addr() {
240 return &_collision_list_next;
241 }
243 static size_t fl_mem_size() {
244 PerRegionTable* cur = _free_list;
245 size_t res = 0;
246 while (cur != NULL) {
247 res += cur->mem_size();
248 cur = cur->next();
249 }
250 return res;
251 }
253 static void test_fl_mem_size();
254 };
256 PerRegionTable* PerRegionTable::_free_list = NULL;
258 size_t OtherRegionsTable::_max_fine_entries = 0;
259 size_t OtherRegionsTable::_mod_max_fine_entries_mask = 0;
260 size_t OtherRegionsTable::_fine_eviction_stride = 0;
261 size_t OtherRegionsTable::_fine_eviction_sample_size = 0;
263 OtherRegionsTable::OtherRegionsTable(HeapRegion* hr, Mutex* m) :
264 _g1h(G1CollectedHeap::heap()),
265 _hr(hr), _m(m),
266 _coarse_map(G1CollectedHeap::heap()->max_regions(),
267 false /* in-resource-area */),
268 _fine_grain_regions(NULL),
269 _first_all_fine_prts(NULL), _last_all_fine_prts(NULL),
270 _n_fine_entries(0), _n_coarse_entries(0),
271 _fine_eviction_start(0),
272 _sparse_table(hr)
273 {
274 typedef PerRegionTable* PerRegionTablePtr;
276 if (_max_fine_entries == 0) {
277 assert(_mod_max_fine_entries_mask == 0, "Both or none.");
278 size_t max_entries_log = (size_t)log2_long((jlong)G1RSetRegionEntries);
279 _max_fine_entries = (size_t)1 << max_entries_log;
280 _mod_max_fine_entries_mask = _max_fine_entries - 1;
282 assert(_fine_eviction_sample_size == 0
283 && _fine_eviction_stride == 0, "All init at same time.");
284 _fine_eviction_sample_size = MAX2((size_t)4, max_entries_log);
285 _fine_eviction_stride = _max_fine_entries / _fine_eviction_sample_size;
286 }
288 _fine_grain_regions = NEW_C_HEAP_ARRAY3(PerRegionTablePtr, _max_fine_entries,
289 mtGC, 0, AllocFailStrategy::RETURN_NULL);
291 if (_fine_grain_regions == NULL) {
292 vm_exit_out_of_memory(sizeof(void*)*_max_fine_entries, OOM_MALLOC_ERROR,
293 "Failed to allocate _fine_grain_entries.");
294 }
296 for (size_t i = 0; i < _max_fine_entries; i++) {
297 _fine_grain_regions[i] = NULL;
298 }
299 }
301 void OtherRegionsTable::link_to_all(PerRegionTable* prt) {
302 // We always append to the beginning of the list for convenience;
303 // the order of entries in this list does not matter.
304 if (_first_all_fine_prts != NULL) {
305 assert(_first_all_fine_prts->prev() == NULL, "invariant");
306 _first_all_fine_prts->set_prev(prt);
307 prt->set_next(_first_all_fine_prts);
308 } else {
309 // this is the first element we insert. Adjust the "last" pointer
310 _last_all_fine_prts = prt;
311 assert(prt->next() == NULL, "just checking");
312 }
313 // the new element is always the first element without a predecessor
314 prt->set_prev(NULL);
315 _first_all_fine_prts = prt;
317 assert(prt->prev() == NULL, "just checking");
318 assert(_first_all_fine_prts == prt, "just checking");
319 assert((_first_all_fine_prts == NULL && _last_all_fine_prts == NULL) ||
320 (_first_all_fine_prts != NULL && _last_all_fine_prts != NULL),
321 "just checking");
322 assert(_last_all_fine_prts == NULL || _last_all_fine_prts->next() == NULL,
323 "just checking");
324 assert(_first_all_fine_prts == NULL || _first_all_fine_prts->prev() == NULL,
325 "just checking");
326 }
328 void OtherRegionsTable::unlink_from_all(PerRegionTable* prt) {
329 if (prt->prev() != NULL) {
330 assert(_first_all_fine_prts != prt, "just checking");
331 prt->prev()->set_next(prt->next());
332 // removing the last element in the list?
333 if (_last_all_fine_prts == prt) {
334 _last_all_fine_prts = prt->prev();
335 }
336 } else {
337 assert(_first_all_fine_prts == prt, "just checking");
338 _first_all_fine_prts = prt->next();
339 // list is empty now?
340 if (_first_all_fine_prts == NULL) {
341 _last_all_fine_prts = NULL;
342 }
343 }
345 if (prt->next() != NULL) {
346 prt->next()->set_prev(prt->prev());
347 }
349 prt->set_next(NULL);
350 prt->set_prev(NULL);
352 assert((_first_all_fine_prts == NULL && _last_all_fine_prts == NULL) ||
353 (_first_all_fine_prts != NULL && _last_all_fine_prts != NULL),
354 "just checking");
355 assert(_last_all_fine_prts == NULL || _last_all_fine_prts->next() == NULL,
356 "just checking");
357 assert(_first_all_fine_prts == NULL || _first_all_fine_prts->prev() == NULL,
358 "just checking");
359 }
361 int** OtherRegionsTable::_from_card_cache = NULL;
362 uint OtherRegionsTable::_from_card_cache_max_regions = 0;
363 size_t OtherRegionsTable::_from_card_cache_mem_size = 0;
365 void OtherRegionsTable::init_from_card_cache(uint max_regions) {
366 guarantee(_from_card_cache == NULL, "Should not call this multiple times");
367 uint n_par_rs = HeapRegionRemSet::num_par_rem_sets();
369 _from_card_cache_max_regions = max_regions;
370 _from_card_cache = Padded2DArray<int, mtGC>::create_unfreeable(n_par_rs,
371 _from_card_cache_max_regions,
372 &_from_card_cache_mem_size);
374 for (uint i = 0; i < n_par_rs; i++) {
375 for (uint j = 0; j < _from_card_cache_max_regions; j++) {
376 _from_card_cache[i][j] = -1; // An invalid value.
377 }
378 }
379 }
381 void OtherRegionsTable::shrink_from_card_cache(uint new_n_regs) {
382 for (uint i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) {
383 assert(new_n_regs <= _from_card_cache_max_regions, "Must be within max.");
384 for (uint j = new_n_regs; j < _from_card_cache_max_regions; j++) {
385 _from_card_cache[i][j] = -1; // An invalid value.
386 }
387 }
388 }
390 #ifndef PRODUCT
391 void OtherRegionsTable::print_from_card_cache() {
392 for (uint i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) {
393 for (uint j = 0; j < _from_card_cache_max_regions; j++) {
394 gclog_or_tty->print_cr("_from_card_cache[%d][%d] = %d.",
395 i, j, _from_card_cache[i][j]);
396 }
397 }
398 }
399 #endif
401 void OtherRegionsTable::add_reference(OopOrNarrowOopStar from, int tid) {
402 size_t cur_hrs_ind = (size_t) hr()->hrs_index();
404 if (G1TraceHeapRegionRememberedSet) {
405 gclog_or_tty->print_cr("ORT::add_reference_work(" PTR_FORMAT "->" PTR_FORMAT ").",
406 from,
407 UseCompressedOops
408 ? (void *)oopDesc::load_decode_heap_oop((narrowOop*)from)
409 : (void *)oopDesc::load_decode_heap_oop((oop*)from));
410 }
412 int from_card = (int)(uintptr_t(from) >> CardTableModRefBS::card_shift);
414 if (G1TraceHeapRegionRememberedSet) {
415 gclog_or_tty->print_cr("Table for [" PTR_FORMAT "...): card %d (cache = %d)",
416 hr()->bottom(), from_card,
417 _from_card_cache[tid][cur_hrs_ind]);
418 }
420 if (from_card == _from_card_cache[tid][cur_hrs_ind]) {
421 if (G1TraceHeapRegionRememberedSet) {
422 gclog_or_tty->print_cr(" from-card cache hit.");
423 }
424 assert(contains_reference(from), "We just added it!");
425 return;
426 } else {
427 _from_card_cache[tid][cur_hrs_ind] = from_card;
428 }
430 // Note that this may be a continued H region.
431 HeapRegion* from_hr = _g1h->heap_region_containing_raw(from);
432 RegionIdx_t from_hrs_ind = (RegionIdx_t) from_hr->hrs_index();
434 // If the region is already coarsened, return.
435 if (_coarse_map.at(from_hrs_ind)) {
436 if (G1TraceHeapRegionRememberedSet) {
437 gclog_or_tty->print_cr(" coarse map hit.");
438 }
439 assert(contains_reference(from), "We just added it!");
440 return;
441 }
443 // Otherwise find a per-region table to add it to.
444 size_t ind = from_hrs_ind & _mod_max_fine_entries_mask;
445 PerRegionTable* prt = find_region_table(ind, from_hr);
446 if (prt == NULL) {
447 MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag);
448 // Confirm that it's really not there...
449 prt = find_region_table(ind, from_hr);
450 if (prt == NULL) {
452 uintptr_t from_hr_bot_card_index =
453 uintptr_t(from_hr->bottom())
454 >> CardTableModRefBS::card_shift;
455 CardIdx_t card_index = from_card - from_hr_bot_card_index;
456 assert(0 <= card_index && (size_t)card_index < HeapRegion::CardsPerRegion,
457 "Must be in range.");
458 if (G1HRRSUseSparseTable &&
459 _sparse_table.add_card(from_hrs_ind, card_index)) {
460 if (G1RecordHRRSOops) {
461 HeapRegionRemSet::record(hr(), from);
462 if (G1TraceHeapRegionRememberedSet) {
463 gclog_or_tty->print(" Added card " PTR_FORMAT " to region "
464 "[" PTR_FORMAT "...) for ref " PTR_FORMAT ".\n",
465 align_size_down(uintptr_t(from),
466 CardTableModRefBS::card_size),
467 hr()->bottom(), from);
468 }
469 }
470 if (G1TraceHeapRegionRememberedSet) {
471 gclog_or_tty->print_cr(" added card to sparse table.");
472 }
473 assert(contains_reference_locked(from), "We just added it!");
474 return;
475 } else {
476 if (G1TraceHeapRegionRememberedSet) {
477 gclog_or_tty->print_cr(" [tid %d] sparse table entry "
478 "overflow(f: %d, t: %d)",
479 tid, from_hrs_ind, cur_hrs_ind);
480 }
481 }
483 if (_n_fine_entries == _max_fine_entries) {
484 prt = delete_region_table();
485 // There is no need to clear the links to the 'all' list here:
486 // prt will be reused immediately, i.e. remain in the 'all' list.
487 prt->init(from_hr, false /* clear_links_to_all_list */);
488 } else {
489 prt = PerRegionTable::alloc(from_hr);
490 link_to_all(prt);
491 }
493 PerRegionTable* first_prt = _fine_grain_regions[ind];
494 prt->set_collision_list_next(first_prt);
495 _fine_grain_regions[ind] = prt;
496 _n_fine_entries++;
498 if (G1HRRSUseSparseTable) {
499 // Transfer from sparse to fine-grain.
500 SparsePRTEntry *sprt_entry = _sparse_table.get_entry(from_hrs_ind);
501 assert(sprt_entry != NULL, "There should have been an entry");
502 for (int i = 0; i < SparsePRTEntry::cards_num(); i++) {
503 CardIdx_t c = sprt_entry->card(i);
504 if (c != SparsePRTEntry::NullEntry) {
505 prt->add_card(c);
506 }
507 }
508 // Now we can delete the sparse entry.
509 bool res = _sparse_table.delete_entry(from_hrs_ind);
510 assert(res, "It should have been there.");
511 }
512 }
513 assert(prt != NULL && prt->hr() == from_hr, "consequence");
514 }
515 // Note that we can't assert "prt->hr() == from_hr", because of the
516 // possibility of concurrent reuse. But see head comment of
517 // OtherRegionsTable for why this is OK.
518 assert(prt != NULL, "Inv");
520 prt->add_reference(from);
522 if (G1RecordHRRSOops) {
523 HeapRegionRemSet::record(hr(), from);
524 if (G1TraceHeapRegionRememberedSet) {
525 gclog_or_tty->print("Added card " PTR_FORMAT " to region "
526 "[" PTR_FORMAT "...) for ref " PTR_FORMAT ".\n",
527 align_size_down(uintptr_t(from),
528 CardTableModRefBS::card_size),
529 hr()->bottom(), from);
530 }
531 }
532 assert(contains_reference(from), "We just added it!");
533 }
535 PerRegionTable*
536 OtherRegionsTable::find_region_table(size_t ind, HeapRegion* hr) const {
537 assert(0 <= ind && ind < _max_fine_entries, "Preconditions.");
538 PerRegionTable* prt = _fine_grain_regions[ind];
539 while (prt != NULL && prt->hr() != hr) {
540 prt = prt->collision_list_next();
541 }
542 // Loop postcondition is the method postcondition.
543 return prt;
544 }
546 jint OtherRegionsTable::_n_coarsenings = 0;
548 PerRegionTable* OtherRegionsTable::delete_region_table() {
549 assert(_m->owned_by_self(), "Precondition");
550 assert(_n_fine_entries == _max_fine_entries, "Precondition");
551 PerRegionTable* max = NULL;
552 jint max_occ = 0;
553 PerRegionTable** max_prev;
554 size_t max_ind;
556 size_t i = _fine_eviction_start;
557 for (size_t k = 0; k < _fine_eviction_sample_size; k++) {
558 size_t ii = i;
559 // Make sure we get a non-NULL sample.
560 while (_fine_grain_regions[ii] == NULL) {
561 ii++;
562 if (ii == _max_fine_entries) ii = 0;
563 guarantee(ii != i, "We must find one.");
564 }
565 PerRegionTable** prev = &_fine_grain_regions[ii];
566 PerRegionTable* cur = *prev;
567 while (cur != NULL) {
568 jint cur_occ = cur->occupied();
569 if (max == NULL || cur_occ > max_occ) {
570 max = cur;
571 max_prev = prev;
572 max_ind = i;
573 max_occ = cur_occ;
574 }
575 prev = cur->collision_list_next_addr();
576 cur = cur->collision_list_next();
577 }
578 i = i + _fine_eviction_stride;
579 if (i >= _n_fine_entries) i = i - _n_fine_entries;
580 }
582 _fine_eviction_start++;
584 if (_fine_eviction_start >= _n_fine_entries) {
585 _fine_eviction_start -= _n_fine_entries;
586 }
588 guarantee(max != NULL, "Since _n_fine_entries > 0");
590 // Set the corresponding coarse bit.
591 size_t max_hrs_index = (size_t) max->hr()->hrs_index();
592 if (!_coarse_map.at(max_hrs_index)) {
593 _coarse_map.at_put(max_hrs_index, true);
594 _n_coarse_entries++;
595 if (G1TraceHeapRegionRememberedSet) {
596 gclog_or_tty->print("Coarsened entry in region [" PTR_FORMAT "...] "
597 "for region [" PTR_FORMAT "...] (%d coarse entries).\n",
598 hr()->bottom(),
599 max->hr()->bottom(),
600 _n_coarse_entries);
601 }
602 }
604 // Unsplice.
605 *max_prev = max->collision_list_next();
606 Atomic::inc(&_n_coarsenings);
607 _n_fine_entries--;
608 return max;
609 }
612 // At present, this must be called stop-world single-threaded.
613 void OtherRegionsTable::scrub(CardTableModRefBS* ctbs,
614 BitMap* region_bm, BitMap* card_bm) {
615 // First eliminated garbage regions from the coarse map.
616 if (G1RSScrubVerbose) {
617 gclog_or_tty->print_cr("Scrubbing region %u:", hr()->hrs_index());
618 }
620 assert(_coarse_map.size() == region_bm->size(), "Precondition");
621 if (G1RSScrubVerbose) {
622 gclog_or_tty->print(" Coarse map: before = "SIZE_FORMAT"...",
623 _n_coarse_entries);
624 }
625 _coarse_map.set_intersection(*region_bm);
626 _n_coarse_entries = _coarse_map.count_one_bits();
627 if (G1RSScrubVerbose) {
628 gclog_or_tty->print_cr(" after = "SIZE_FORMAT".", _n_coarse_entries);
629 }
631 // Now do the fine-grained maps.
632 for (size_t i = 0; i < _max_fine_entries; i++) {
633 PerRegionTable* cur = _fine_grain_regions[i];
634 PerRegionTable** prev = &_fine_grain_regions[i];
635 while (cur != NULL) {
636 PerRegionTable* nxt = cur->collision_list_next();
637 // If the entire region is dead, eliminate.
638 if (G1RSScrubVerbose) {
639 gclog_or_tty->print_cr(" For other region %u:",
640 cur->hr()->hrs_index());
641 }
642 if (!region_bm->at((size_t) cur->hr()->hrs_index())) {
643 *prev = nxt;
644 cur->set_collision_list_next(NULL);
645 _n_fine_entries--;
646 if (G1RSScrubVerbose) {
647 gclog_or_tty->print_cr(" deleted via region map.");
648 }
649 unlink_from_all(cur);
650 PerRegionTable::free(cur);
651 } else {
652 // Do fine-grain elimination.
653 if (G1RSScrubVerbose) {
654 gclog_or_tty->print(" occ: before = %4d.", cur->occupied());
655 }
656 cur->scrub(ctbs, card_bm);
657 if (G1RSScrubVerbose) {
658 gclog_or_tty->print_cr(" after = %4d.", cur->occupied());
659 }
660 // Did that empty the table completely?
661 if (cur->occupied() == 0) {
662 *prev = nxt;
663 cur->set_collision_list_next(NULL);
664 _n_fine_entries--;
665 unlink_from_all(cur);
666 PerRegionTable::free(cur);
667 } else {
668 prev = cur->collision_list_next_addr();
669 }
670 }
671 cur = nxt;
672 }
673 }
674 // Since we may have deleted a from_card_cache entry from the RS, clear
675 // the FCC.
676 clear_fcc();
677 }
680 size_t OtherRegionsTable::occupied() const {
681 size_t sum = occ_fine();
682 sum += occ_sparse();
683 sum += occ_coarse();
684 return sum;
685 }
687 size_t OtherRegionsTable::occ_fine() const {
688 size_t sum = 0;
690 size_t num = 0;
691 PerRegionTable * cur = _first_all_fine_prts;
692 while (cur != NULL) {
693 sum += cur->occupied();
694 cur = cur->next();
695 num++;
696 }
697 guarantee(num == _n_fine_entries, "just checking");
698 return sum;
699 }
701 size_t OtherRegionsTable::occ_coarse() const {
702 return (_n_coarse_entries * HeapRegion::CardsPerRegion);
703 }
705 size_t OtherRegionsTable::occ_sparse() const {
706 return _sparse_table.occupied();
707 }
709 size_t OtherRegionsTable::mem_size() const {
710 size_t sum = 0;
711 // all PRTs are of the same size so it is sufficient to query only one of them.
712 if (_first_all_fine_prts != NULL) {
713 assert(_last_all_fine_prts != NULL &&
714 _first_all_fine_prts->mem_size() == _last_all_fine_prts->mem_size(), "check that mem_size() is constant");
715 sum += _first_all_fine_prts->mem_size() * _n_fine_entries;
716 }
717 sum += (sizeof(PerRegionTable*) * _max_fine_entries);
718 sum += (_coarse_map.size_in_words() * HeapWordSize);
719 sum += (_sparse_table.mem_size());
720 sum += sizeof(*this) - sizeof(_sparse_table); // Avoid double counting above.
721 return sum;
722 }
724 size_t OtherRegionsTable::static_mem_size() {
725 return _from_card_cache_mem_size;
726 }
728 size_t OtherRegionsTable::fl_mem_size() {
729 return PerRegionTable::fl_mem_size();
730 }
732 void OtherRegionsTable::clear_fcc() {
733 uint hrs_idx = hr()->hrs_index();
734 for (uint i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) {
735 _from_card_cache[i][hrs_idx] = -1;
736 }
737 }
739 void OtherRegionsTable::clear() {
740 // if there are no entries, skip this step
741 if (_first_all_fine_prts != NULL) {
742 guarantee(_first_all_fine_prts != NULL && _last_all_fine_prts != NULL, "just checking");
743 PerRegionTable::bulk_free(_first_all_fine_prts, _last_all_fine_prts);
744 memset(_fine_grain_regions, 0, _max_fine_entries * sizeof(_fine_grain_regions[0]));
745 } else {
746 guarantee(_first_all_fine_prts == NULL && _last_all_fine_prts == NULL, "just checking");
747 }
749 _first_all_fine_prts = _last_all_fine_prts = NULL;
750 _sparse_table.clear();
751 _coarse_map.clear();
752 _n_fine_entries = 0;
753 _n_coarse_entries = 0;
755 clear_fcc();
756 }
758 void OtherRegionsTable::clear_incoming_entry(HeapRegion* from_hr) {
759 MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag);
760 size_t hrs_ind = (size_t) from_hr->hrs_index();
761 size_t ind = hrs_ind & _mod_max_fine_entries_mask;
762 if (del_single_region_table(ind, from_hr)) {
763 assert(!_coarse_map.at(hrs_ind), "Inv");
764 } else {
765 _coarse_map.par_at_put(hrs_ind, 0);
766 }
767 // Check to see if any of the fcc entries come from here.
768 uint hr_ind = hr()->hrs_index();
769 for (uint tid = 0; tid < HeapRegionRemSet::num_par_rem_sets(); tid++) {
770 int fcc_ent = _from_card_cache[tid][hr_ind];
771 if (fcc_ent != -1) {
772 HeapWord* card_addr = (HeapWord*)
773 (uintptr_t(fcc_ent) << CardTableModRefBS::card_shift);
774 if (hr()->is_in_reserved(card_addr)) {
775 // Clear the from card cache.
776 _from_card_cache[tid][hr_ind] = -1;
777 }
778 }
779 }
780 }
782 bool OtherRegionsTable::del_single_region_table(size_t ind,
783 HeapRegion* hr) {
784 assert(0 <= ind && ind < _max_fine_entries, "Preconditions.");
785 PerRegionTable** prev_addr = &_fine_grain_regions[ind];
786 PerRegionTable* prt = *prev_addr;
787 while (prt != NULL && prt->hr() != hr) {
788 prev_addr = prt->collision_list_next_addr();
789 prt = prt->collision_list_next();
790 }
791 if (prt != NULL) {
792 assert(prt->hr() == hr, "Loop postcondition.");
793 *prev_addr = prt->collision_list_next();
794 unlink_from_all(prt);
795 PerRegionTable::free(prt);
796 _n_fine_entries--;
797 return true;
798 } else {
799 return false;
800 }
801 }
803 bool OtherRegionsTable::contains_reference(OopOrNarrowOopStar from) const {
804 // Cast away const in this case.
805 MutexLockerEx x((Mutex*)_m, Mutex::_no_safepoint_check_flag);
806 return contains_reference_locked(from);
807 }
809 bool OtherRegionsTable::contains_reference_locked(OopOrNarrowOopStar from) const {
810 HeapRegion* hr = _g1h->heap_region_containing_raw(from);
811 if (hr == NULL) return false;
812 RegionIdx_t hr_ind = (RegionIdx_t) hr->hrs_index();
813 // Is this region in the coarse map?
814 if (_coarse_map.at(hr_ind)) return true;
816 PerRegionTable* prt = find_region_table(hr_ind & _mod_max_fine_entries_mask,
817 hr);
818 if (prt != NULL) {
819 return prt->contains_reference(from);
821 } else {
822 uintptr_t from_card =
823 (uintptr_t(from) >> CardTableModRefBS::card_shift);
824 uintptr_t hr_bot_card_index =
825 uintptr_t(hr->bottom()) >> CardTableModRefBS::card_shift;
826 assert(from_card >= hr_bot_card_index, "Inv");
827 CardIdx_t card_index = from_card - hr_bot_card_index;
828 assert(0 <= card_index && (size_t)card_index < HeapRegion::CardsPerRegion,
829 "Must be in range.");
830 return _sparse_table.contains_card(hr_ind, card_index);
831 }
834 }
836 void
837 OtherRegionsTable::do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task) {
838 _sparse_table.do_cleanup_work(hrrs_cleanup_task);
839 }
841 // Determines how many threads can add records to an rset in parallel.
842 // This can be done by either mutator threads together with the
843 // concurrent refinement threads or GC threads.
844 uint HeapRegionRemSet::num_par_rem_sets() {
845 return (uint)MAX2(DirtyCardQueueSet::num_par_ids() + ConcurrentG1Refine::thread_num(), ParallelGCThreads);
846 }
848 HeapRegionRemSet::HeapRegionRemSet(G1BlockOffsetSharedArray* bosa,
849 HeapRegion* hr)
850 : _bosa(bosa),
851 _m(Mutex::leaf, FormatBuffer<128>("HeapRegionRemSet lock #"UINT32_FORMAT, hr->hrs_index()), true),
852 _code_roots(), _other_regions(hr, &_m) {
853 reset_for_par_iteration();
854 }
856 void HeapRegionRemSet::setup_remset_size() {
857 // Setup sparse and fine-grain tables sizes.
858 // table_size = base * (log(region_size / 1M) + 1)
859 const int LOG_M = 20;
860 int region_size_log_mb = MAX2(HeapRegion::LogOfHRGrainBytes - LOG_M, 0);
861 if (FLAG_IS_DEFAULT(G1RSetSparseRegionEntries)) {
862 G1RSetSparseRegionEntries = G1RSetSparseRegionEntriesBase * (region_size_log_mb + 1);
863 }
864 if (FLAG_IS_DEFAULT(G1RSetRegionEntries)) {
865 G1RSetRegionEntries = G1RSetRegionEntriesBase * (region_size_log_mb + 1);
866 }
867 guarantee(G1RSetSparseRegionEntries > 0 && G1RSetRegionEntries > 0 , "Sanity");
868 }
870 bool HeapRegionRemSet::claim_iter() {
871 if (_iter_state != Unclaimed) return false;
872 jint res = Atomic::cmpxchg(Claimed, (jint*)(&_iter_state), Unclaimed);
873 return (res == Unclaimed);
874 }
876 void HeapRegionRemSet::set_iter_complete() {
877 _iter_state = Complete;
878 }
880 bool HeapRegionRemSet::iter_is_complete() {
881 return _iter_state == Complete;
882 }
884 #ifndef PRODUCT
885 void HeapRegionRemSet::print() {
886 HeapRegionRemSetIterator iter(this);
887 size_t card_index;
888 while (iter.has_next(card_index)) {
889 HeapWord* card_start =
890 G1CollectedHeap::heap()->bot_shared()->address_for_index(card_index);
891 gclog_or_tty->print_cr(" Card " PTR_FORMAT, card_start);
892 }
893 if (iter.n_yielded() != occupied()) {
894 gclog_or_tty->print_cr("Yielded disagrees with occupied:");
895 gclog_or_tty->print_cr(" %6d yielded (%6d coarse, %6d fine).",
896 iter.n_yielded(),
897 iter.n_yielded_coarse(), iter.n_yielded_fine());
898 gclog_or_tty->print_cr(" %6d occ (%6d coarse, %6d fine).",
899 occupied(), occ_coarse(), occ_fine());
900 }
901 guarantee(iter.n_yielded() == occupied(),
902 "We should have yielded all the represented cards.");
903 }
904 #endif
906 void HeapRegionRemSet::cleanup() {
907 SparsePRT::cleanup_all();
908 }
910 void HeapRegionRemSet::clear() {
911 MutexLockerEx x(&_m, Mutex::_no_safepoint_check_flag);
912 clear_locked();
913 }
915 void HeapRegionRemSet::clear_locked() {
916 _code_roots.clear();
917 _other_regions.clear();
918 assert(occupied_locked() == 0, "Should be clear.");
919 reset_for_par_iteration();
920 }
922 void HeapRegionRemSet::reset_for_par_iteration() {
923 _iter_state = Unclaimed;
924 _iter_claimed = 0;
925 // It's good to check this to make sure that the two methods are in sync.
926 assert(verify_ready_for_par_iteration(), "post-condition");
927 }
929 void HeapRegionRemSet::scrub(CardTableModRefBS* ctbs,
930 BitMap* region_bm, BitMap* card_bm) {
931 _other_regions.scrub(ctbs, region_bm, card_bm);
932 }
935 // Code roots support
937 void HeapRegionRemSet::add_strong_code_root(nmethod* nm) {
938 assert(nm != NULL, "sanity");
939 _code_roots.add(nm);
940 }
942 void HeapRegionRemSet::remove_strong_code_root(nmethod* nm) {
943 assert(nm != NULL, "sanity");
944 _code_roots.remove(nm);
945 // Check that there were no duplicates
946 guarantee(!_code_roots.contains(nm), "duplicate entry found");
947 }
949 class NMethodMigrationOopClosure : public OopClosure {
950 G1CollectedHeap* _g1h;
951 HeapRegion* _from;
952 nmethod* _nm;
954 uint _num_self_forwarded;
956 template <class T> void do_oop_work(T* p) {
957 T heap_oop = oopDesc::load_heap_oop(p);
958 if (!oopDesc::is_null(heap_oop)) {
959 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
960 if (_from->is_in(obj)) {
961 // Reference still points into the source region.
962 // Since roots are immediately evacuated this means that
963 // we must have self forwarded the object
964 assert(obj->is_forwarded(),
965 err_msg("code roots should be immediately evacuated. "
966 "Ref: "PTR_FORMAT", "
967 "Obj: "PTR_FORMAT", "
968 "Region: "HR_FORMAT,
969 p, (void*) obj, HR_FORMAT_PARAMS(_from)));
970 assert(obj->forwardee() == obj,
971 err_msg("not self forwarded? obj = "PTR_FORMAT, (void*)obj));
973 // The object has been self forwarded.
974 // Note, if we're during an initial mark pause, there is
975 // no need to explicitly mark object. It will be marked
976 // during the regular evacuation failure handling code.
977 _num_self_forwarded++;
978 } else {
979 // The reference points into a promotion or to-space region
980 HeapRegion* to = _g1h->heap_region_containing(obj);
981 to->rem_set()->add_strong_code_root(_nm);
982 }
983 }
984 }
986 public:
987 NMethodMigrationOopClosure(G1CollectedHeap* g1h, HeapRegion* from, nmethod* nm):
988 _g1h(g1h), _from(from), _nm(nm), _num_self_forwarded(0) {}
990 void do_oop(narrowOop* p) { do_oop_work(p); }
991 void do_oop(oop* p) { do_oop_work(p); }
993 uint retain() { return _num_self_forwarded > 0; }
994 };
996 void HeapRegionRemSet::migrate_strong_code_roots() {
997 assert(hr()->in_collection_set(), "only collection set regions");
998 assert(!hr()->isHumongous(),
999 err_msg("humongous region "HR_FORMAT" should not have been added to the collection set",
1000 HR_FORMAT_PARAMS(hr())));
1002 ResourceMark rm;
1004 // List of code blobs to retain for this region
1005 GrowableArray<nmethod*> to_be_retained(10);
1006 G1CollectedHeap* g1h = G1CollectedHeap::heap();
1008 while (!_code_roots.is_empty()) {
1009 nmethod *nm = _code_roots.pop();
1010 if (nm != NULL) {
1011 NMethodMigrationOopClosure oop_cl(g1h, hr(), nm);
1012 nm->oops_do(&oop_cl);
1013 if (oop_cl.retain()) {
1014 to_be_retained.push(nm);
1015 }
1016 }
1017 }
1019 // Now push any code roots we need to retain
1020 assert(to_be_retained.is_empty() || hr()->evacuation_failed(),
1021 "Retained nmethod list must be empty or "
1022 "evacuation of this region failed");
1024 while (to_be_retained.is_nonempty()) {
1025 nmethod* nm = to_be_retained.pop();
1026 assert(nm != NULL, "sanity");
1027 add_strong_code_root(nm);
1028 }
1029 }
1031 void HeapRegionRemSet::strong_code_roots_do(CodeBlobClosure* blk) const {
1032 _code_roots.nmethods_do(blk);
1033 }
1035 size_t HeapRegionRemSet::strong_code_roots_mem_size() {
1036 return _code_roots.mem_size();
1037 }
1039 //-------------------- Iteration --------------------
1041 HeapRegionRemSetIterator:: HeapRegionRemSetIterator(HeapRegionRemSet* hrrs) :
1042 _hrrs(hrrs),
1043 _g1h(G1CollectedHeap::heap()),
1044 _coarse_map(&hrrs->_other_regions._coarse_map),
1045 _fine_grain_regions(hrrs->_other_regions._fine_grain_regions),
1046 _bosa(hrrs->bosa()),
1047 _is(Sparse),
1048 // Set these values so that we increment to the first region.
1049 _coarse_cur_region_index(-1),
1050 _coarse_cur_region_cur_card(HeapRegion::CardsPerRegion-1),
1051 _cur_region_cur_card(0),
1052 _fine_array_index(-1),
1053 _fine_cur_prt(NULL),
1054 _n_yielded_coarse(0),
1055 _n_yielded_fine(0),
1056 _n_yielded_sparse(0),
1057 _sparse_iter(&hrrs->_other_regions._sparse_table) {}
1059 bool HeapRegionRemSetIterator::coarse_has_next(size_t& card_index) {
1060 if (_hrrs->_other_regions._n_coarse_entries == 0) return false;
1061 // Go to the next card.
1062 _coarse_cur_region_cur_card++;
1063 // Was the last the last card in the current region?
1064 if (_coarse_cur_region_cur_card == HeapRegion::CardsPerRegion) {
1065 // Yes: find the next region. This may leave _coarse_cur_region_index
1066 // Set to the last index, in which case there are no more coarse
1067 // regions.
1068 _coarse_cur_region_index =
1069 (int) _coarse_map->get_next_one_offset(_coarse_cur_region_index + 1);
1070 if ((size_t)_coarse_cur_region_index < _coarse_map->size()) {
1071 _coarse_cur_region_cur_card = 0;
1072 HeapWord* r_bot =
1073 _g1h->region_at((uint) _coarse_cur_region_index)->bottom();
1074 _cur_region_card_offset = _bosa->index_for(r_bot);
1075 } else {
1076 return false;
1077 }
1078 }
1079 // If we didn't return false above, then we can yield a card.
1080 card_index = _cur_region_card_offset + _coarse_cur_region_cur_card;
1081 return true;
1082 }
1084 void HeapRegionRemSetIterator::fine_find_next_non_null_prt() {
1085 // Otherwise, find the next bucket list in the array.
1086 _fine_array_index++;
1087 while (_fine_array_index < (int) OtherRegionsTable::_max_fine_entries) {
1088 _fine_cur_prt = _fine_grain_regions[_fine_array_index];
1089 if (_fine_cur_prt != NULL) return;
1090 else _fine_array_index++;
1091 }
1092 assert(_fine_cur_prt == NULL, "Loop post");
1093 }
1095 bool HeapRegionRemSetIterator::fine_has_next(size_t& card_index) {
1096 if (fine_has_next()) {
1097 _cur_region_cur_card =
1098 _fine_cur_prt->_bm.get_next_one_offset(_cur_region_cur_card + 1);
1099 }
1100 while (!fine_has_next()) {
1101 if (_cur_region_cur_card == (size_t) HeapRegion::CardsPerRegion) {
1102 _cur_region_cur_card = 0;
1103 _fine_cur_prt = _fine_cur_prt->collision_list_next();
1104 }
1105 if (_fine_cur_prt == NULL) {
1106 fine_find_next_non_null_prt();
1107 if (_fine_cur_prt == NULL) return false;
1108 }
1109 assert(_fine_cur_prt != NULL && _cur_region_cur_card == 0,
1110 "inv.");
1111 HeapWord* r_bot =
1112 _fine_cur_prt->hr()->bottom();
1113 _cur_region_card_offset = _bosa->index_for(r_bot);
1114 _cur_region_cur_card = _fine_cur_prt->_bm.get_next_one_offset(0);
1115 }
1116 assert(fine_has_next(), "Or else we exited the loop via the return.");
1117 card_index = _cur_region_card_offset + _cur_region_cur_card;
1118 return true;
1119 }
1121 bool HeapRegionRemSetIterator::fine_has_next() {
1122 return
1123 _fine_cur_prt != NULL &&
1124 _cur_region_cur_card < HeapRegion::CardsPerRegion;
1125 }
1127 bool HeapRegionRemSetIterator::has_next(size_t& card_index) {
1128 switch (_is) {
1129 case Sparse:
1130 if (_sparse_iter.has_next(card_index)) {
1131 _n_yielded_sparse++;
1132 return true;
1133 }
1134 // Otherwise, deliberate fall-through
1135 _is = Fine;
1136 case Fine:
1137 if (fine_has_next(card_index)) {
1138 _n_yielded_fine++;
1139 return true;
1140 }
1141 // Otherwise, deliberate fall-through
1142 _is = Coarse;
1143 case Coarse:
1144 if (coarse_has_next(card_index)) {
1145 _n_yielded_coarse++;
1146 return true;
1147 }
1148 // Otherwise...
1149 break;
1150 }
1151 assert(ParallelGCThreads > 1 ||
1152 n_yielded() == _hrrs->occupied(),
1153 "Should have yielded all the cards in the rem set "
1154 "(in the non-par case).");
1155 return false;
1156 }
1160 OopOrNarrowOopStar* HeapRegionRemSet::_recorded_oops = NULL;
1161 HeapWord** HeapRegionRemSet::_recorded_cards = NULL;
1162 HeapRegion** HeapRegionRemSet::_recorded_regions = NULL;
1163 int HeapRegionRemSet::_n_recorded = 0;
1165 HeapRegionRemSet::Event* HeapRegionRemSet::_recorded_events = NULL;
1166 int* HeapRegionRemSet::_recorded_event_index = NULL;
1167 int HeapRegionRemSet::_n_recorded_events = 0;
1169 void HeapRegionRemSet::record(HeapRegion* hr, OopOrNarrowOopStar f) {
1170 if (_recorded_oops == NULL) {
1171 assert(_n_recorded == 0
1172 && _recorded_cards == NULL
1173 && _recorded_regions == NULL,
1174 "Inv");
1175 _recorded_oops = NEW_C_HEAP_ARRAY(OopOrNarrowOopStar, MaxRecorded, mtGC);
1176 _recorded_cards = NEW_C_HEAP_ARRAY(HeapWord*, MaxRecorded, mtGC);
1177 _recorded_regions = NEW_C_HEAP_ARRAY(HeapRegion*, MaxRecorded, mtGC);
1178 }
1179 if (_n_recorded == MaxRecorded) {
1180 gclog_or_tty->print_cr("Filled up 'recorded' (%d).", MaxRecorded);
1181 } else {
1182 _recorded_cards[_n_recorded] =
1183 (HeapWord*)align_size_down(uintptr_t(f),
1184 CardTableModRefBS::card_size);
1185 _recorded_oops[_n_recorded] = f;
1186 _recorded_regions[_n_recorded] = hr;
1187 _n_recorded++;
1188 }
1189 }
1191 void HeapRegionRemSet::record_event(Event evnt) {
1192 if (!G1RecordHRRSEvents) return;
1194 if (_recorded_events == NULL) {
1195 assert(_n_recorded_events == 0
1196 && _recorded_event_index == NULL,
1197 "Inv");
1198 _recorded_events = NEW_C_HEAP_ARRAY(Event, MaxRecordedEvents, mtGC);
1199 _recorded_event_index = NEW_C_HEAP_ARRAY(int, MaxRecordedEvents, mtGC);
1200 }
1201 if (_n_recorded_events == MaxRecordedEvents) {
1202 gclog_or_tty->print_cr("Filled up 'recorded_events' (%d).", MaxRecordedEvents);
1203 } else {
1204 _recorded_events[_n_recorded_events] = evnt;
1205 _recorded_event_index[_n_recorded_events] = _n_recorded;
1206 _n_recorded_events++;
1207 }
1208 }
1210 void HeapRegionRemSet::print_event(outputStream* str, Event evnt) {
1211 switch (evnt) {
1212 case Event_EvacStart:
1213 str->print("Evac Start");
1214 break;
1215 case Event_EvacEnd:
1216 str->print("Evac End");
1217 break;
1218 case Event_RSUpdateEnd:
1219 str->print("RS Update End");
1220 break;
1221 }
1222 }
1224 void HeapRegionRemSet::print_recorded() {
1225 int cur_evnt = 0;
1226 Event cur_evnt_kind;
1227 int cur_evnt_ind = 0;
1228 if (_n_recorded_events > 0) {
1229 cur_evnt_kind = _recorded_events[cur_evnt];
1230 cur_evnt_ind = _recorded_event_index[cur_evnt];
1231 }
1233 for (int i = 0; i < _n_recorded; i++) {
1234 while (cur_evnt < _n_recorded_events && i == cur_evnt_ind) {
1235 gclog_or_tty->print("Event: ");
1236 print_event(gclog_or_tty, cur_evnt_kind);
1237 gclog_or_tty->print_cr("");
1238 cur_evnt++;
1239 if (cur_evnt < MaxRecordedEvents) {
1240 cur_evnt_kind = _recorded_events[cur_evnt];
1241 cur_evnt_ind = _recorded_event_index[cur_evnt];
1242 }
1243 }
1244 gclog_or_tty->print("Added card " PTR_FORMAT " to region [" PTR_FORMAT "...]"
1245 " for ref " PTR_FORMAT ".\n",
1246 _recorded_cards[i], _recorded_regions[i]->bottom(),
1247 _recorded_oops[i]);
1248 }
1249 }
1251 void HeapRegionRemSet::reset_for_cleanup_tasks() {
1252 SparsePRT::reset_for_cleanup_tasks();
1253 }
1255 void HeapRegionRemSet::do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task) {
1256 _other_regions.do_cleanup_work(hrrs_cleanup_task);
1257 }
1259 void
1260 HeapRegionRemSet::finish_cleanup_task(HRRSCleanupTask* hrrs_cleanup_task) {
1261 SparsePRT::finish_cleanup_task(hrrs_cleanup_task);
1262 }
1264 #ifndef PRODUCT
1265 void PerRegionTable::test_fl_mem_size() {
1266 PerRegionTable* dummy = alloc(NULL);
1267 free(dummy);
1268 guarantee(dummy->mem_size() == fl_mem_size(), "fl_mem_size() does not return the correct element size");
1269 // try to reset the state
1270 _free_list = NULL;
1271 delete dummy;
1272 }
1274 void HeapRegionRemSet::test_prt() {
1275 PerRegionTable::test_fl_mem_size();
1276 }
1278 void HeapRegionRemSet::test() {
1279 os::sleep(Thread::current(), (jlong)5000, false);
1280 G1CollectedHeap* g1h = G1CollectedHeap::heap();
1282 // Run with "-XX:G1LogRSetRegionEntries=2", so that 1 and 5 end up in same
1283 // hash bucket.
1284 HeapRegion* hr0 = g1h->region_at(0);
1285 HeapRegion* hr1 = g1h->region_at(1);
1286 HeapRegion* hr2 = g1h->region_at(5);
1287 HeapRegion* hr3 = g1h->region_at(6);
1288 HeapRegion* hr4 = g1h->region_at(7);
1289 HeapRegion* hr5 = g1h->region_at(8);
1291 HeapWord* hr1_start = hr1->bottom();
1292 HeapWord* hr1_mid = hr1_start + HeapRegion::GrainWords/2;
1293 HeapWord* hr1_last = hr1->end() - 1;
1295 HeapWord* hr2_start = hr2->bottom();
1296 HeapWord* hr2_mid = hr2_start + HeapRegion::GrainWords/2;
1297 HeapWord* hr2_last = hr2->end() - 1;
1299 HeapWord* hr3_start = hr3->bottom();
1300 HeapWord* hr3_mid = hr3_start + HeapRegion::GrainWords/2;
1301 HeapWord* hr3_last = hr3->end() - 1;
1303 HeapRegionRemSet* hrrs = hr0->rem_set();
1305 // Make three references from region 0x101...
1306 hrrs->add_reference((OopOrNarrowOopStar)hr1_start);
1307 hrrs->add_reference((OopOrNarrowOopStar)hr1_mid);
1308 hrrs->add_reference((OopOrNarrowOopStar)hr1_last);
1310 hrrs->add_reference((OopOrNarrowOopStar)hr2_start);
1311 hrrs->add_reference((OopOrNarrowOopStar)hr2_mid);
1312 hrrs->add_reference((OopOrNarrowOopStar)hr2_last);
1314 hrrs->add_reference((OopOrNarrowOopStar)hr3_start);
1315 hrrs->add_reference((OopOrNarrowOopStar)hr3_mid);
1316 hrrs->add_reference((OopOrNarrowOopStar)hr3_last);
1318 // Now cause a coarsening.
1319 hrrs->add_reference((OopOrNarrowOopStar)hr4->bottom());
1320 hrrs->add_reference((OopOrNarrowOopStar)hr5->bottom());
1322 // Now, does iteration yield these three?
1323 HeapRegionRemSetIterator iter(hrrs);
1324 size_t sum = 0;
1325 size_t card_index;
1326 while (iter.has_next(card_index)) {
1327 HeapWord* card_start =
1328 G1CollectedHeap::heap()->bot_shared()->address_for_index(card_index);
1329 gclog_or_tty->print_cr(" Card " PTR_FORMAT ".", card_start);
1330 sum++;
1331 }
1332 guarantee(sum == 11 - 3 + 2048, "Failure");
1333 guarantee(sum == hrrs->occupied(), "Failure");
1334 }
1335 #endif