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 // pad rows to cache line sizes.
366 _from_card_cache_max_regions = align_size_up(max_regions, DEFAULT_CACHE_LINE_SIZE / sizeof(int));
367
368 int n_par_rs = HeapRegionRemSet::num_par_rem_sets();
369 _from_card_cache = NEW_C_HEAP_ARRAY(int*, n_par_rs, mtGC);
370 for (int i = 0; i < n_par_rs; i++) {
371 _from_card_cache[i] = NEW_C_HEAP_ARRAY(int, _from_card_cache_max_regions, mtGC);
372 for (size_t j = 0; j < _from_card_cache_max_regions; j++) {
373 _from_card_cache[i][j] = -1; // An invalid value.
374 }
375 }
376 _from_card_cache_mem_size = n_par_rs * _from_card_cache_max_regions * sizeof(int);
377 }
378
379 void OtherRegionsTable::shrink_from_card_cache(size_t new_n_regs) {
380 for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) {
381 assert(new_n_regs <= _from_card_cache_max_regions, "Must be within max.");
382 for (size_t j = new_n_regs; j < _from_card_cache_max_regions; j++) {
383 _from_card_cache[i][j] = -1; // An invalid value.
384 }
385 }
386 }
387
388 #ifndef PRODUCT
389 void OtherRegionsTable::print_from_card_cache() {
390 for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) {
391 for (size_t j = 0; j < _from_card_cache_max_regions; j++) {
392 gclog_or_tty->print_cr("_from_card_cache[%d][%d] = %d.",
393 i, j, _from_card_cache[i][j]);
394 }
395 }
396 }
397 #endif
398
399 void OtherRegionsTable::add_reference(OopOrNarrowOopStar from, int tid) {
400 size_t cur_hrs_ind = (size_t) hr()->hrs_index();
401
402 if (G1TraceHeapRegionRememberedSet) {
403 gclog_or_tty->print_cr("ORT::add_reference_work(" PTR_FORMAT "->" PTR_FORMAT ").",
404 from,
405 UseCompressedOops
406 ? (void *)oopDesc::load_decode_heap_oop((narrowOop*)from)
407 : (void *)oopDesc::load_decode_heap_oop((oop*)from));
408 }
409
410 int from_card = (int)(uintptr_t(from) >> CardTableModRefBS::card_shift);
411
412 if (G1TraceHeapRegionRememberedSet) {
413 gclog_or_tty->print_cr("Table for [" PTR_FORMAT "...): card %d (cache = %d)",
414 hr()->bottom(), from_card,
415 _from_card_cache[tid][cur_hrs_ind]);
416 }
417
418 if (from_card == _from_card_cache[tid][cur_hrs_ind]) {
419 if (G1TraceHeapRegionRememberedSet) {
420 gclog_or_tty->print_cr(" from-card cache hit.");
421 }
422 assert(contains_reference(from), "We just added it!");
423 return;
424 } else {
425 _from_card_cache[tid][cur_hrs_ind] = from_card;
426 }
427
428 // Note that this may be a continued H region.
429 HeapRegion* from_hr = _g1h->heap_region_containing_raw(from);
430 RegionIdx_t from_hrs_ind = (RegionIdx_t) from_hr->hrs_index();
431
432 // If the region is already coarsened, return.
433 if (_coarse_map.at(from_hrs_ind)) {
434 if (G1TraceHeapRegionRememberedSet) {
435 gclog_or_tty->print_cr(" coarse map hit.");
436 }
437 assert(contains_reference(from), "We just added it!");
438 return;
439 }
440
441 // Otherwise find a per-region table to add it to.
442 size_t ind = from_hrs_ind & _mod_max_fine_entries_mask;
443 PerRegionTable* prt = find_region_table(ind, from_hr);
444 if (prt == NULL) {
445 MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag);
446 // Confirm that it's really not there...
447 prt = find_region_table(ind, from_hr);
448 if (prt == NULL) {
449
450 uintptr_t from_hr_bot_card_index =
451 uintptr_t(from_hr->bottom())
452 >> CardTableModRefBS::card_shift;
453 CardIdx_t card_index = from_card - from_hr_bot_card_index;
454 assert(0 <= card_index && (size_t)card_index < HeapRegion::CardsPerRegion,
455 "Must be in range.");
456 if (G1HRRSUseSparseTable &&
457 _sparse_table.add_card(from_hrs_ind, card_index)) {
458 if (G1RecordHRRSOops) {
459 HeapRegionRemSet::record(hr(), from);
460 if (G1TraceHeapRegionRememberedSet) {
461 gclog_or_tty->print(" Added card " PTR_FORMAT " to region "
462 "[" PTR_FORMAT "...) for ref " PTR_FORMAT ".\n",
463 align_size_down(uintptr_t(from),
464 CardTableModRefBS::card_size),
465 hr()->bottom(), from);
466 }
467 }
468 if (G1TraceHeapRegionRememberedSet) {
469 gclog_or_tty->print_cr(" added card to sparse table.");
470 }
471 assert(contains_reference_locked(from), "We just added it!");
472 return;
473 } else {
474 if (G1TraceHeapRegionRememberedSet) {
475 gclog_or_tty->print_cr(" [tid %d] sparse table entry "
476 "overflow(f: %d, t: %d)",
477 tid, from_hrs_ind, cur_hrs_ind);
478 }
479 }
480
481 if (_n_fine_entries == _max_fine_entries) {
482 prt = delete_region_table();
483 // There is no need to clear the links to the 'all' list here:
484 // prt will be reused immediately, i.e. remain in the 'all' list.
485 prt->init(from_hr, false /* clear_links_to_all_list */);
486 } else {
487 prt = PerRegionTable::alloc(from_hr);
488 link_to_all(prt);
489 }
490
491 PerRegionTable* first_prt = _fine_grain_regions[ind];
492 prt->set_collision_list_next(first_prt);
493 _fine_grain_regions[ind] = prt;
494 _n_fine_entries++;
495
496 if (G1HRRSUseSparseTable) {
497 // Transfer from sparse to fine-grain.
498 SparsePRTEntry *sprt_entry = _sparse_table.get_entry(from_hrs_ind);
499 assert(sprt_entry != NULL, "There should have been an entry");
500 for (int i = 0; i < SparsePRTEntry::cards_num(); i++) {
501 CardIdx_t c = sprt_entry->card(i);
502 if (c != SparsePRTEntry::NullEntry) {
503 prt->add_card(c);
504 }
505 }
506 // Now we can delete the sparse entry.
507 bool res = _sparse_table.delete_entry(from_hrs_ind);
508 assert(res, "It should have been there.");
509 }
510 }
511 assert(prt != NULL && prt->hr() == from_hr, "consequence");
512 }
513 // Note that we can't assert "prt->hr() == from_hr", because of the
514 // possibility of concurrent reuse. But see head comment of
515 // OtherRegionsTable for why this is OK.
516 assert(prt != NULL, "Inv");
517
518 prt->add_reference(from);
519
520 if (G1RecordHRRSOops) {
521 HeapRegionRemSet::record(hr(), from);
522 if (G1TraceHeapRegionRememberedSet) {
523 gclog_or_tty->print("Added card " PTR_FORMAT " to region "
524 "[" PTR_FORMAT "...) for ref " PTR_FORMAT ".\n",
525 align_size_down(uintptr_t(from),
526 CardTableModRefBS::card_size),
527 hr()->bottom(), from);
528 }
529 }
530 assert(contains_reference(from), "We just added it!");
531 }
532
533 PerRegionTable*
534 OtherRegionsTable::find_region_table(size_t ind, HeapRegion* hr) const {
535 assert(0 <= ind && ind < _max_fine_entries, "Preconditions.");
536 PerRegionTable* prt = _fine_grain_regions[ind];
537 while (prt != NULL && prt->hr() != hr) {
538 prt = prt->collision_list_next();
539 }
540 // Loop postcondition is the method postcondition.
541 return prt;
542 }
543
544 jint OtherRegionsTable::_n_coarsenings = 0;
545
546 PerRegionTable* OtherRegionsTable::delete_region_table() {
547 assert(_m->owned_by_self(), "Precondition");
548 assert(_n_fine_entries == _max_fine_entries, "Precondition");
549 PerRegionTable* max = NULL;
550 jint max_occ = 0;
551 PerRegionTable** max_prev;
552 size_t max_ind;
553
554 size_t i = _fine_eviction_start;
555 for (size_t k = 0; k < _fine_eviction_sample_size; k++) {
556 size_t ii = i;
557 // Make sure we get a non-NULL sample.
558 while (_fine_grain_regions[ii] == NULL) {
559 ii++;
560 if (ii == _max_fine_entries) ii = 0;
561 guarantee(ii != i, "We must find one.");
562 }
563 PerRegionTable** prev = &_fine_grain_regions[ii];
564 PerRegionTable* cur = *prev;
565 while (cur != NULL) {
566 jint cur_occ = cur->occupied();
567 if (max == NULL || cur_occ > max_occ) {
568 max = cur;
569 max_prev = prev;
570 max_ind = i;
571 max_occ = cur_occ;
572 }
573 prev = cur->collision_list_next_addr();
574 cur = cur->collision_list_next();
575 }
576 i = i + _fine_eviction_stride;
577 if (i >= _n_fine_entries) i = i - _n_fine_entries;
578 }
579
580 _fine_eviction_start++;
581
582 if (_fine_eviction_start >= _n_fine_entries) {
583 _fine_eviction_start -= _n_fine_entries;
584 }
585
586 guarantee(max != NULL, "Since _n_fine_entries > 0");
587
588 // Set the corresponding coarse bit.
589 size_t max_hrs_index = (size_t) max->hr()->hrs_index();
590 if (!_coarse_map.at(max_hrs_index)) {
591 _coarse_map.at_put(max_hrs_index, true);
592 _n_coarse_entries++;
593 if (G1TraceHeapRegionRememberedSet) {
594 gclog_or_tty->print("Coarsened entry in region [" PTR_FORMAT "...] "
595 "for region [" PTR_FORMAT "...] (%d coarse entries).\n",
596 hr()->bottom(),
597 max->hr()->bottom(),
598 _n_coarse_entries);
599 }
600 }
601
602 // Unsplice.
603 *max_prev = max->collision_list_next();
604 Atomic::inc(&_n_coarsenings);
605 _n_fine_entries--;
606 return max;
607 }
608
609
610 // At present, this must be called stop-world single-threaded.
611 void OtherRegionsTable::scrub(CardTableModRefBS* ctbs,
612 BitMap* region_bm, BitMap* card_bm) {
613 // First eliminated garbage regions from the coarse map.
614 if (G1RSScrubVerbose) {
615 gclog_or_tty->print_cr("Scrubbing region %u:", hr()->hrs_index());
616 }
617
618 assert(_coarse_map.size() == region_bm->size(), "Precondition");
619 if (G1RSScrubVerbose) {
620 gclog_or_tty->print(" Coarse map: before = "SIZE_FORMAT"...",
621 _n_coarse_entries);
622 }
623 _coarse_map.set_intersection(*region_bm);
624 _n_coarse_entries = _coarse_map.count_one_bits();
625 if (G1RSScrubVerbose) {
626 gclog_or_tty->print_cr(" after = "SIZE_FORMAT".", _n_coarse_entries);
627 }
628
629 // Now do the fine-grained maps.
630 for (size_t i = 0; i < _max_fine_entries; i++) {
631 PerRegionTable* cur = _fine_grain_regions[i];
632 PerRegionTable** prev = &_fine_grain_regions[i];
633 while (cur != NULL) {
634 PerRegionTable* nxt = cur->collision_list_next();
635 // If the entire region is dead, eliminate.
636 if (G1RSScrubVerbose) {
637 gclog_or_tty->print_cr(" For other region %u:",
638 cur->hr()->hrs_index());
639 }
640 if (!region_bm->at((size_t) cur->hr()->hrs_index())) {
641 *prev = nxt;
642 cur->set_collision_list_next(NULL);
643 _n_fine_entries--;
644 if (G1RSScrubVerbose) {
645 gclog_or_tty->print_cr(" deleted via region map.");
646 }
647 unlink_from_all(cur);
648 PerRegionTable::free(cur);
649 } else {
650 // Do fine-grain elimination.
651 if (G1RSScrubVerbose) {
652 gclog_or_tty->print(" occ: before = %4d.", cur->occupied());
653 }
654 cur->scrub(ctbs, card_bm);
655 if (G1RSScrubVerbose) {
656 gclog_or_tty->print_cr(" after = %4d.", cur->occupied());
657 }
658 // Did that empty the table completely?
659 if (cur->occupied() == 0) {
660 *prev = nxt;
661 cur->set_collision_list_next(NULL);
662 _n_fine_entries--;
663 unlink_from_all(cur);
664 PerRegionTable::free(cur);
665 } else {
666 prev = cur->collision_list_next_addr();
667 }
668 }
669 cur = nxt;
670 }
671 }
672 // Since we may have deleted a from_card_cache entry from the RS, clear
673 // the FCC.
674 clear_fcc();
675 }
676
677
678 size_t OtherRegionsTable::occupied() const {
679 size_t sum = occ_fine();
680 sum += occ_sparse();
681 sum += occ_coarse();
682 return sum;
683 }
684
685 size_t OtherRegionsTable::occ_fine() const {
686 size_t sum = 0;
687
688 size_t num = 0;
689 PerRegionTable * cur = _first_all_fine_prts;
690 while (cur != NULL) {
691 sum += cur->occupied();
692 cur = cur->next();
693 num++;
694 }
695 guarantee(num == _n_fine_entries, "just checking");
696 return sum;
697 }
698
699 size_t OtherRegionsTable::occ_coarse() const {
700 return (_n_coarse_entries * HeapRegion::CardsPerRegion);
701 }
702
703 size_t OtherRegionsTable::occ_sparse() const {
704 return _sparse_table.occupied();
705 }
706
707 size_t OtherRegionsTable::mem_size() const {
708 MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag);
709 size_t sum = 0;
710 // all PRTs are of the same size so it is sufficient to query only one of them.
711 if (_first_all_fine_prts != NULL) {
712 assert(_last_all_fine_prts != NULL &&
713 _first_all_fine_prts->mem_size() == _last_all_fine_prts->mem_size(), "check that mem_size() is constant");
714 sum += _first_all_fine_prts->mem_size() * _n_fine_entries;
715 }
716 sum += (sizeof(PerRegionTable*) * _max_fine_entries);
717 sum += (_coarse_map.size_in_words() * HeapWordSize);
718 sum += (_sparse_table.mem_size());
719 sum += sizeof(*this) - sizeof(_sparse_table); // Avoid double counting above.
720 return sum;
721 }
722
723 size_t OtherRegionsTable::static_mem_size() {
724 return _from_card_cache_mem_size;
725 }
726
727 size_t OtherRegionsTable::fl_mem_size() {
728 return PerRegionTable::fl_mem_size();
729 }
730
731 void OtherRegionsTable::clear_fcc() {
732 size_t hrs_idx = hr()->hrs_index();
733 uint num_par_remsets = HeapRegionRemSet::num_par_rem_sets();
734 for (uint i = 0; i < num_par_remsets; i++) {
735 _from_card_cache[i][hrs_idx] = -1;
736 }
737 }
738
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 }
748
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;
754
755 clear_fcc();
756 }
757
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 size_t hr_ind = (size_t) hr()->hrs_index();
769 for (int 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 }
781
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 }
802
803 bool OtherRegionsTable::contains_reference(OopOrNarrowOopStar from) const {
804 MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag);
805 return contains_reference_locked(from);
806 }
807
808 bool OtherRegionsTable::contains_reference_locked(OopOrNarrowOopStar from) const {
809 HeapRegion* hr = _g1h->heap_region_containing_raw(from);
810 if (hr == NULL) return false;
811 RegionIdx_t hr_ind = (RegionIdx_t) hr->hrs_index();
812 // Is this region in the coarse map?
813 if (_coarse_map.at(hr_ind)) return true;
814
815 PerRegionTable* prt = find_region_table(hr_ind & _mod_max_fine_entries_mask,
816 hr);
817 if (prt != NULL) {
818 return prt->contains_reference(from);
819
820 } else {
821 uintptr_t from_card =
822 (uintptr_t(from) >> CardTableModRefBS::card_shift);
823 uintptr_t hr_bot_card_index =
824 uintptr_t(hr->bottom()) >> CardTableModRefBS::card_shift;
825 assert(from_card >= hr_bot_card_index, "Inv");
826 CardIdx_t card_index = from_card - hr_bot_card_index;
827 assert(0 <= card_index && (size_t)card_index < HeapRegion::CardsPerRegion,
828 "Must be in range.");
829 return _sparse_table.contains_card(hr_ind, card_index);
830 }
831
832
833 }
834
835 void
836 OtherRegionsTable::do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task) {
837 _sparse_table.do_cleanup_work(hrrs_cleanup_task);
838 }
839
840 // Determines how many threads can add records to an rset in parallel.
841 // This can be done by either mutator threads together with the
842 // concurrent refinement threads or GC threads.
843 int HeapRegionRemSet::num_par_rem_sets() {
844 return (int)MAX2(DirtyCardQueueSet::num_par_ids() + ConcurrentG1Refine::thread_num(), ParallelGCThreads);
845 }
846
847 HeapRegionRemSet::HeapRegionRemSet(G1BlockOffsetSharedArray* bosa,
848 HeapRegion* hr)
849 : _bosa(bosa), _m(Mutex::leaf, "An OtherRegionsTable lock", true),
850 _other_regions(hr, &_m), _code_roots() {
851 reset_for_par_iteration();
852 }
853
854 void HeapRegionRemSet::setup_remset_size() {
855 // Setup sparse and fine-grain tables sizes.
856 // table_size = base * (log(region_size / 1M) + 1)
857 const int LOG_M = 20;
858 int region_size_log_mb = MAX2(HeapRegion::LogOfHRGrainBytes - LOG_M, 0);
859 if (FLAG_IS_DEFAULT(G1RSetSparseRegionEntries)) {
860 G1RSetSparseRegionEntries = G1RSetSparseRegionEntriesBase * (region_size_log_mb + 1);
861 }
862 if (FLAG_IS_DEFAULT(G1RSetRegionEntries)) {
863 G1RSetRegionEntries = G1RSetRegionEntriesBase * (region_size_log_mb + 1);
864 }
865 guarantee(G1RSetSparseRegionEntries > 0 && G1RSetRegionEntries > 0 , "Sanity");
866 }
867
868 bool HeapRegionRemSet::claim_iter() {
869 if (_iter_state != Unclaimed) return false;
870 jint res = Atomic::cmpxchg(Claimed, (jint*)(&_iter_state), Unclaimed);
871 return (res == Unclaimed);
872 }
873
874 void HeapRegionRemSet::set_iter_complete() {
875 _iter_state = Complete;
876 }
877
878 bool HeapRegionRemSet::iter_is_complete() {
879 return _iter_state == Complete;
880 }
881
882 #ifndef PRODUCT
883 void HeapRegionRemSet::print() {
884 HeapRegionRemSetIterator iter(this);
885 size_t card_index;
886 while (iter.has_next(card_index)) {
887 HeapWord* card_start =
888 G1CollectedHeap::heap()->bot_shared()->address_for_index(card_index);
889 gclog_or_tty->print_cr(" Card " PTR_FORMAT, card_start);
890 }
891 if (iter.n_yielded() != occupied()) {
892 gclog_or_tty->print_cr("Yielded disagrees with occupied:");
893 gclog_or_tty->print_cr(" %6d yielded (%6d coarse, %6d fine).",
894 iter.n_yielded(),
895 iter.n_yielded_coarse(), iter.n_yielded_fine());
896 gclog_or_tty->print_cr(" %6d occ (%6d coarse, %6d fine).",
897 occupied(), occ_coarse(), occ_fine());
898 }
899 guarantee(iter.n_yielded() == occupied(),
900 "We should have yielded all the represented cards.");
901 }
902 #endif
903
904 void HeapRegionRemSet::cleanup() {
905 SparsePRT::cleanup_all();
906 }
907
908 void HeapRegionRemSet::clear() {
909 MutexLockerEx x(&_m, Mutex::_no_safepoint_check_flag);
910 clear_locked();
911 }
912
913 void HeapRegionRemSet::clear_locked() {
914 _code_roots.clear();
915 _other_regions.clear();
916 assert(occupied_locked() == 0, "Should be clear.");
917 reset_for_par_iteration();
918 }
919
920 void HeapRegionRemSet::reset_for_par_iteration() {
921 _iter_state = Unclaimed;
922 _iter_claimed = 0;
923 // It's good to check this to make sure that the two methods are in sync.
924 assert(verify_ready_for_par_iteration(), "post-condition");
925 }
926
927 void HeapRegionRemSet::scrub(CardTableModRefBS* ctbs,
928 BitMap* region_bm, BitMap* card_bm) {
929 _other_regions.scrub(ctbs, region_bm, card_bm);
930 }
931
932
933 // Code roots support
934
935 void HeapRegionRemSet::add_strong_code_root(nmethod* nm) {
936 assert(nm != NULL, "sanity");
937 _code_roots.add(nm);
938 }
939
940 void HeapRegionRemSet::remove_strong_code_root(nmethod* nm) {
941 assert(nm != NULL, "sanity");
942 _code_roots.remove(nm);
943 // Check that there were no duplicates
944 guarantee(!_code_roots.contains(nm), "duplicate entry found");
945 }
946
947 class NMethodMigrationOopClosure : public OopClosure {
948 G1CollectedHeap* _g1h;
949 HeapRegion* _from;
950 nmethod* _nm;
951
952 uint _num_self_forwarded;
953
954 template <class T> void do_oop_work(T* p) {
955 T heap_oop = oopDesc::load_heap_oop(p);
956 if (!oopDesc::is_null(heap_oop)) {
957 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
958 if (_from->is_in(obj)) {
959 // Reference still points into the source region.
960 // Since roots are immediately evacuated this means that
961 // we must have self forwarded the object
962 assert(obj->is_forwarded(),
963 err_msg("code roots should be immediately evacuated. "
964 "Ref: "PTR_FORMAT", "
965 "Obj: "PTR_FORMAT", "
966 "Region: "HR_FORMAT,
967 p, (void*) obj, HR_FORMAT_PARAMS(_from)));
968 assert(obj->forwardee() == obj,
969 err_msg("not self forwarded? obj = "PTR_FORMAT, (void*)obj));
970
971 // The object has been self forwarded.
972 // Note, if we're during an initial mark pause, there is
973 // no need to explicitly mark object. It will be marked
974 // during the regular evacuation failure handling code.
975 _num_self_forwarded++;
976 } else {
977 // The reference points into a promotion or to-space region
978 HeapRegion* to = _g1h->heap_region_containing(obj);
979 to->rem_set()->add_strong_code_root(_nm);
980 }
981 }
982 }
983
984 public:
985 NMethodMigrationOopClosure(G1CollectedHeap* g1h, HeapRegion* from, nmethod* nm):
986 _g1h(g1h), _from(from), _nm(nm), _num_self_forwarded(0) {}
987
988 void do_oop(narrowOop* p) { do_oop_work(p); }
989 void do_oop(oop* p) { do_oop_work(p); }
990
991 uint retain() { return _num_self_forwarded > 0; }
992 };
993
994 void HeapRegionRemSet::migrate_strong_code_roots() {
995 assert(hr()->in_collection_set(), "only collection set regions");
996 assert(!hr()->isHumongous(),
997 err_msg("humongous region "HR_FORMAT" should not have been added to the collection set",
998 HR_FORMAT_PARAMS(hr())));
999
1000 ResourceMark rm;
1001
1002 // List of code blobs to retain for this region
1003 GrowableArray<nmethod*> to_be_retained(10);
1004 G1CollectedHeap* g1h = G1CollectedHeap::heap();
1005
1006 while (!_code_roots.is_empty()) {
1007 nmethod *nm = _code_roots.pop();
1008 if (nm != NULL) {
1009 NMethodMigrationOopClosure oop_cl(g1h, hr(), nm);
1010 nm->oops_do(&oop_cl);
1011 if (oop_cl.retain()) {
1012 to_be_retained.push(nm);
1013 }
1014 }
1015 }
1016
1017 // Now push any code roots we need to retain
1018 assert(to_be_retained.is_empty() || hr()->evacuation_failed(),
1019 "Retained nmethod list must be empty or "
1020 "evacuation of this region failed");
1021
1022 while (to_be_retained.is_nonempty()) {
1023 nmethod* nm = to_be_retained.pop();
1024 assert(nm != NULL, "sanity");
1025 add_strong_code_root(nm);
1026 }
1027 }
1028
1029 void HeapRegionRemSet::strong_code_roots_do(CodeBlobClosure* blk) {
1030 _code_roots.nmethods_do(blk);
1031 }
1032
1033 size_t HeapRegionRemSet::strong_code_roots_mem_size() {
1034 return _code_roots.mem_size();
1035 }
1036
1037 //-------------------- Iteration --------------------
1038
1039 HeapRegionRemSetIterator:: HeapRegionRemSetIterator(HeapRegionRemSet* hrrs) :
1040 _hrrs(hrrs),
1041 _g1h(G1CollectedHeap::heap()),
1042 _coarse_map(&hrrs->_other_regions._coarse_map),
1043 _fine_grain_regions(hrrs->_other_regions._fine_grain_regions),
1044 _bosa(hrrs->bosa()),
1045 _is(Sparse),
1046 // Set these values so that we increment to the first region.
1047 _coarse_cur_region_index(-1),
1048 _coarse_cur_region_cur_card(HeapRegion::CardsPerRegion-1),
1049 _cur_region_cur_card(0),
1050 _fine_array_index(-1),
1051 _fine_cur_prt(NULL),
1052 _n_yielded_coarse(0),
1053 _n_yielded_fine(0),
1054 _n_yielded_sparse(0),
1055 _sparse_iter(&hrrs->_other_regions._sparse_table) {}
1056
1057 bool HeapRegionRemSetIterator::coarse_has_next(size_t& card_index) {
1058 if (_hrrs->_other_regions._n_coarse_entries == 0) return false;
1059 // Go to the next card.
1060 _coarse_cur_region_cur_card++;
1061 // Was the last the last card in the current region?
1062 if (_coarse_cur_region_cur_card == HeapRegion::CardsPerRegion) {
1063 // Yes: find the next region. This may leave _coarse_cur_region_index
1064 // Set to the last index, in which case there are no more coarse
1065 // regions.
1066 _coarse_cur_region_index =
1067 (int) _coarse_map->get_next_one_offset(_coarse_cur_region_index + 1);
1068 if ((size_t)_coarse_cur_region_index < _coarse_map->size()) {
1069 _coarse_cur_region_cur_card = 0;
1070 HeapWord* r_bot =
1071 _g1h->region_at((uint) _coarse_cur_region_index)->bottom();
1072 _cur_region_card_offset = _bosa->index_for(r_bot);
1073 } else {
1074 return false;
1075 }
1076 }
1077 // If we didn't return false above, then we can yield a card.
1078 card_index = _cur_region_card_offset + _coarse_cur_region_cur_card;
1079 return true;
1080 }
1081
1082 void HeapRegionRemSetIterator::fine_find_next_non_null_prt() {
1083 // Otherwise, find the next bucket list in the array.
1084 _fine_array_index++;
1085 while (_fine_array_index < (int) OtherRegionsTable::_max_fine_entries) {
1086 _fine_cur_prt = _fine_grain_regions[_fine_array_index];
1087 if (_fine_cur_prt != NULL) return;
1088 else _fine_array_index++;
1089 }
1090 assert(_fine_cur_prt == NULL, "Loop post");
1091 }
1092
1093 bool HeapRegionRemSetIterator::fine_has_next(size_t& card_index) {
1094 if (fine_has_next()) {
1095 _cur_region_cur_card =
1096 _fine_cur_prt->_bm.get_next_one_offset(_cur_region_cur_card + 1);
1097 }
1098 while (!fine_has_next()) {
1099 if (_cur_region_cur_card == (size_t) HeapRegion::CardsPerRegion) {
1100 _cur_region_cur_card = 0;
1101 _fine_cur_prt = _fine_cur_prt->collision_list_next();
1102 }
1103 if (_fine_cur_prt == NULL) {
1104 fine_find_next_non_null_prt();
1105 if (_fine_cur_prt == NULL) return false;
1106 }
1107 assert(_fine_cur_prt != NULL && _cur_region_cur_card == 0,
1108 "inv.");
1109 HeapWord* r_bot =
1110 _fine_cur_prt->hr()->bottom();
1111 _cur_region_card_offset = _bosa->index_for(r_bot);
1112 _cur_region_cur_card = _fine_cur_prt->_bm.get_next_one_offset(0);
1113 }
1114 assert(fine_has_next(), "Or else we exited the loop via the return.");
1115 card_index = _cur_region_card_offset + _cur_region_cur_card;
1116 return true;
1117 }
1118
1119 bool HeapRegionRemSetIterator::fine_has_next() {
1120 return
1121 _fine_cur_prt != NULL &&
1122 _cur_region_cur_card < HeapRegion::CardsPerRegion;
1123 }
1124
1125 bool HeapRegionRemSetIterator::has_next(size_t& card_index) {
1126 switch (_is) {
1127 case Sparse:
1128 if (_sparse_iter.has_next(card_index)) {
1129 _n_yielded_sparse++;
1130 return true;
1131 }
1132 // Otherwise, deliberate fall-through
1133 _is = Fine;
1134 case Fine:
1135 if (fine_has_next(card_index)) {
1136 _n_yielded_fine++;
1137 return true;
1138 }
1139 // Otherwise, deliberate fall-through
1140 _is = Coarse;
1141 case Coarse:
1142 if (coarse_has_next(card_index)) {
1143 _n_yielded_coarse++;
1144 return true;
1145 }
1146 // Otherwise...
1147 break;
1148 }
1149 assert(ParallelGCThreads > 1 ||
1150 n_yielded() == _hrrs->occupied(),
1151 "Should have yielded all the cards in the rem set "
1152 "(in the non-par case).");
1153 return false;
1154 }
1155
1156
1157
1158 OopOrNarrowOopStar* HeapRegionRemSet::_recorded_oops = NULL;
1159 HeapWord** HeapRegionRemSet::_recorded_cards = NULL;
1160 HeapRegion** HeapRegionRemSet::_recorded_regions = NULL;
1161 int HeapRegionRemSet::_n_recorded = 0;
1162
1163 HeapRegionRemSet::Event* HeapRegionRemSet::_recorded_events = NULL;
1164 int* HeapRegionRemSet::_recorded_event_index = NULL;
1165 int HeapRegionRemSet::_n_recorded_events = 0;
1166
1167 void HeapRegionRemSet::record(HeapRegion* hr, OopOrNarrowOopStar f) {
1168 if (_recorded_oops == NULL) {
1169 assert(_n_recorded == 0
1170 && _recorded_cards == NULL
1171 && _recorded_regions == NULL,
1172 "Inv");
1173 _recorded_oops = NEW_C_HEAP_ARRAY(OopOrNarrowOopStar, MaxRecorded, mtGC);
1174 _recorded_cards = NEW_C_HEAP_ARRAY(HeapWord*, MaxRecorded, mtGC);
1175 _recorded_regions = NEW_C_HEAP_ARRAY(HeapRegion*, MaxRecorded, mtGC);
1176 }
1177 if (_n_recorded == MaxRecorded) {
1178 gclog_or_tty->print_cr("Filled up 'recorded' (%d).", MaxRecorded);
1179 } else {
1180 _recorded_cards[_n_recorded] =
1181 (HeapWord*)align_size_down(uintptr_t(f),
1182 CardTableModRefBS::card_size);
1183 _recorded_oops[_n_recorded] = f;
1184 _recorded_regions[_n_recorded] = hr;
1185 _n_recorded++;
1186 }
1187 }
1188
1189 void HeapRegionRemSet::record_event(Event evnt) {
1190 if (!G1RecordHRRSEvents) return;
1191
1192 if (_recorded_events == NULL) {
1193 assert(_n_recorded_events == 0
1194 && _recorded_event_index == NULL,
1195 "Inv");
1196 _recorded_events = NEW_C_HEAP_ARRAY(Event, MaxRecordedEvents, mtGC);
1197 _recorded_event_index = NEW_C_HEAP_ARRAY(int, MaxRecordedEvents, mtGC);
1198 }
1199 if (_n_recorded_events == MaxRecordedEvents) {
1200 gclog_or_tty->print_cr("Filled up 'recorded_events' (%d).", MaxRecordedEvents);
1201 } else {
1202 _recorded_events[_n_recorded_events] = evnt;
1203 _recorded_event_index[_n_recorded_events] = _n_recorded;
1204 _n_recorded_events++;
1205 }
1206 }
1207
1208 void HeapRegionRemSet::print_event(outputStream* str, Event evnt) {
1209 switch (evnt) {
1210 case Event_EvacStart:
1211 str->print("Evac Start");
1212 break;
1213 case Event_EvacEnd:
1214 str->print("Evac End");
1215 break;
1216 case Event_RSUpdateEnd:
1217 str->print("RS Update End");
1218 break;
1219 }
1220 }
1221
1222 void HeapRegionRemSet::print_recorded() {
1223 int cur_evnt = 0;
1224 Event cur_evnt_kind;
1225 int cur_evnt_ind = 0;
1226 if (_n_recorded_events > 0) {
1227 cur_evnt_kind = _recorded_events[cur_evnt];
1228 cur_evnt_ind = _recorded_event_index[cur_evnt];
1229 }
1230
1231 for (int i = 0; i < _n_recorded; i++) {
1232 while (cur_evnt < _n_recorded_events && i == cur_evnt_ind) {
1233 gclog_or_tty->print("Event: ");
1234 print_event(gclog_or_tty, cur_evnt_kind);
1235 gclog_or_tty->print_cr("");
1236 cur_evnt++;
1237 if (cur_evnt < MaxRecordedEvents) {
1238 cur_evnt_kind = _recorded_events[cur_evnt];
1239 cur_evnt_ind = _recorded_event_index[cur_evnt];
1240 }
1241 }
1242 gclog_or_tty->print("Added card " PTR_FORMAT " to region [" PTR_FORMAT "...]"
1243 " for ref " PTR_FORMAT ".\n",
1244 _recorded_cards[i], _recorded_regions[i]->bottom(),
1245 _recorded_oops[i]);
1246 }
1247 }
1248
1249 void HeapRegionRemSet::reset_for_cleanup_tasks() {
1250 SparsePRT::reset_for_cleanup_tasks();
1251 }
1252
1253 void HeapRegionRemSet::do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task) {
1254 _other_regions.do_cleanup_work(hrrs_cleanup_task);
1255 }
1256
1257 void
1258 HeapRegionRemSet::finish_cleanup_task(HRRSCleanupTask* hrrs_cleanup_task) {
1259 SparsePRT::finish_cleanup_task(hrrs_cleanup_task);
1260 }
1261
1262 #ifndef PRODUCT
1263 void PerRegionTable::test_fl_mem_size() {
1264 PerRegionTable* dummy = alloc(NULL);
1265 free(dummy);
1266 guarantee(dummy->mem_size() == fl_mem_size(), "fl_mem_size() does not return the correct element size");
1267 // try to reset the state
1268 _free_list = NULL;
1269 delete dummy;
1270 }
1271
1272 void HeapRegionRemSet::test_prt() {
1273 PerRegionTable::test_fl_mem_size();
1274 }
1275
1276 void HeapRegionRemSet::test() {
1277 os::sleep(Thread::current(), (jlong)5000, false);
1278 G1CollectedHeap* g1h = G1CollectedHeap::heap();
1279
1280 // Run with "-XX:G1LogRSetRegionEntries=2", so that 1 and 5 end up in same
1281 // hash bucket.
1282 HeapRegion* hr0 = g1h->region_at(0);
1283 HeapRegion* hr1 = g1h->region_at(1);
1284 HeapRegion* hr2 = g1h->region_at(5);
1285 HeapRegion* hr3 = g1h->region_at(6);
1286 HeapRegion* hr4 = g1h->region_at(7);
1287 HeapRegion* hr5 = g1h->region_at(8);
1288
1289 HeapWord* hr1_start = hr1->bottom();
1290 HeapWord* hr1_mid = hr1_start + HeapRegion::GrainWords/2;
1291 HeapWord* hr1_last = hr1->end() - 1;
1292
1293 HeapWord* hr2_start = hr2->bottom();
1294 HeapWord* hr2_mid = hr2_start + HeapRegion::GrainWords/2;
1295 HeapWord* hr2_last = hr2->end() - 1;
1296
1297 HeapWord* hr3_start = hr3->bottom();
1298 HeapWord* hr3_mid = hr3_start + HeapRegion::GrainWords/2;
1299 HeapWord* hr3_last = hr3->end() - 1;
1300
1301 HeapRegionRemSet* hrrs = hr0->rem_set();
1302
1303 // Make three references from region 0x101...
1304 hrrs->add_reference((OopOrNarrowOopStar)hr1_start);
1305 hrrs->add_reference((OopOrNarrowOopStar)hr1_mid);
1306 hrrs->add_reference((OopOrNarrowOopStar)hr1_last);
1307
1308 hrrs->add_reference((OopOrNarrowOopStar)hr2_start);
1309 hrrs->add_reference((OopOrNarrowOopStar)hr2_mid);
1310 hrrs->add_reference((OopOrNarrowOopStar)hr2_last);
1311
1312 hrrs->add_reference((OopOrNarrowOopStar)hr3_start);
1313 hrrs->add_reference((OopOrNarrowOopStar)hr3_mid);
1314 hrrs->add_reference((OopOrNarrowOopStar)hr3_last);
1315
1316 // Now cause a coarsening.
1317 hrrs->add_reference((OopOrNarrowOopStar)hr4->bottom());
1318 hrrs->add_reference((OopOrNarrowOopStar)hr5->bottom());
1319
1320 // Now, does iteration yield these three?
1321 HeapRegionRemSetIterator iter(hrrs);
1322 size_t sum = 0;
1323 size_t card_index;
1324 while (iter.has_next(card_index)) {
1325 HeapWord* card_start =
1326 G1CollectedHeap::heap()->bot_shared()->address_for_index(card_index);
1327 gclog_or_tty->print_cr(" Card " PTR_FORMAT ".", card_start);
1328 sum++;
1329 }
1330 guarantee(sum == 11 - 3 + 2048, "Failure");
1331 guarantee(sum == hrrs->occupied(), "Failure");
1332 }
1333 #endif