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