ysr@777: /*
dbuck@9487:  * Copyright (c) 2001, 2018, Oracle and/or its affiliates. All rights reserved.
ysr@777:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@777:  *
ysr@777:  * This code is free software; you can redistribute it and/or modify it
ysr@777:  * under the terms of the GNU General Public License version 2 only, as
ysr@777:  * published by the Free Software Foundation.
ysr@777:  *
ysr@777:  * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@777:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@777:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
ysr@777:  * version 2 for more details (a copy is included in the LICENSE file that
ysr@777:  * accompanied this code).
ysr@777:  *
ysr@777:  * You should have received a copy of the GNU General Public License version
ysr@777:  * 2 along with this work; if not, write to the Free Software Foundation,
ysr@777:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@777:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
ysr@777:  *
ysr@777:  */
ysr@777: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "gc_implementation/g1/concurrentG1Refine.hpp"
stefank@2314: #include "gc_implementation/g1/g1BlockOffsetTable.inline.hpp"
stefank@2314: #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
stefank@2314: #include "gc_implementation/g1/heapRegionRemSet.hpp"
tschatzl@7091: #include "gc_implementation/g1/heapRegionManager.inline.hpp"
stefank@2314: #include "memory/allocation.hpp"
tschatzl@6403: #include "memory/padded.inline.hpp"
stefank@2314: #include "memory/space.inline.hpp"
johnc@3891: #include "oops/oop.inline.hpp"
stefank@2314: #include "utilities/bitMap.inline.hpp"
stefank@2314: #include "utilities/globalDefinitions.hpp"
johnc@5548: #include "utilities/growableArray.hpp"
ysr@777: 
drchase@6680: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
drchase@6680: 
zgu@3900: class PerRegionTable: public CHeapObj<mtGC> {
ysr@777:   friend class OtherRegionsTable;
ysr@777:   friend class HeapRegionRemSetIterator;
ysr@777: 
ysr@777:   HeapRegion*     _hr;
ysr@777:   BitMap          _bm;
ysr@777:   jint            _occupied;
ysr@777: 
johnc@3956:   // next pointer for free/allocated 'all' list
johnc@3891:   PerRegionTable* _next;
ysr@777: 
johnc@3956:   // prev pointer for the allocated 'all' list
johnc@3956:   PerRegionTable* _prev;
johnc@3956: 
johnc@3956:   // next pointer in collision list
johnc@3956:   PerRegionTable * _collision_list_next;
johnc@3956: 
johnc@3956:   // Global free list of PRTs
ysr@777:   static PerRegionTable* _free_list;
ysr@777: 
ysr@777: protected:
ysr@777:   // We need access in order to union things into the base table.
ysr@777:   BitMap* bm() { return &_bm; }
ysr@777: 
ysr@777:   void recount_occupied() {
ysr@777:     _occupied = (jint) bm()->count_one_bits();
ysr@777:   }
ysr@777: 
ysr@777:   PerRegionTable(HeapRegion* hr) :
ysr@777:     _hr(hr),
ysr@777:     _occupied(0),
johnc@3956:     _bm(HeapRegion::CardsPerRegion, false /* in-resource-area */),
johnc@3956:     _collision_list_next(NULL), _next(NULL), _prev(NULL)
ysr@777:   {}
ysr@777: 
johnc@1242:   void add_card_work(CardIdx_t from_card, bool par) {
ysr@777:     if (!_bm.at(from_card)) {
ysr@777:       if (par) {
ysr@777:         if (_bm.par_at_put(from_card, 1)) {
ysr@777:           Atomic::inc(&_occupied);
ysr@777:         }
ysr@777:       } else {
ysr@777:         _bm.at_put(from_card, 1);
ysr@777:         _occupied++;
ysr@777:       }
ysr@777:     }
ysr@777:   }
ysr@777: 
ysr@1280:   void add_reference_work(OopOrNarrowOopStar from, bool par) {
ysr@777:     // Must make this robust in case "from" is not in "_hr", because of
ysr@777:     // concurrency.
ysr@777: 
johnc@3891:     if (G1TraceHeapRegionRememberedSet) {
johnc@3891:       gclog_or_tty->print_cr("    PRT::Add_reference_work(" PTR_FORMAT "->" PTR_FORMAT").",
johnc@3891:                              from,
johnc@3891:                              UseCompressedOops
hseigel@5784:                              ? (void *)oopDesc::load_decode_heap_oop((narrowOop*)from)
hseigel@5784:                              : (void *)oopDesc::load_decode_heap_oop((oop*)from));
johnc@3891:     }
ysr@777: 
ysr@777:     HeapRegion* loc_hr = hr();
ysr@777:     // If the test below fails, then this table was reused concurrently
ysr@777:     // with this operation.  This is OK, since the old table was coarsened,
ysr@777:     // and adding a bit to the new table is never incorrect.
brutisso@3216:     // If the table used to belong to a continues humongous region and is
brutisso@3216:     // now reused for the corresponding start humongous region, we need to
brutisso@3216:     // make sure that we detect this. Thus, we call is_in_reserved_raw()
brutisso@3216:     // instead of just is_in_reserved() here.
brutisso@3216:     if (loc_hr->is_in_reserved_raw(from)) {
ysr@777:       size_t hw_offset = pointer_delta((HeapWord*)from, loc_hr->bottom());
johnc@1242:       CardIdx_t from_card = (CardIdx_t)
johnc@1242:           hw_offset >> (CardTableModRefBS::card_shift - LogHeapWordSize);
ysr@777: 
johnc@3182:       assert(0 <= from_card && (size_t)from_card < HeapRegion::CardsPerRegion,
tonyp@1377:              "Must be in range.");
johnc@1242:       add_card_work(from_card, par);
ysr@777:     }
ysr@777:   }
ysr@777: 
ysr@777: public:
ysr@777: 
tschatzl@8281:   HeapRegion* hr() const {
tschatzl@8281:     return (HeapRegion*) OrderAccess::load_ptr_acquire(&_hr);
tschatzl@8281:   }
ysr@777: 
ysr@777:   jint occupied() const {
ysr@777:     // Overkill, but if we ever need it...
ysr@777:     // guarantee(_occupied == _bm.count_one_bits(), "Check");
ysr@777:     return _occupied;
ysr@777:   }
ysr@777: 
johnc@3956:   void init(HeapRegion* hr, bool clear_links_to_all_list) {
johnc@3956:     if (clear_links_to_all_list) {
johnc@3956:       set_next(NULL);
johnc@3956:       set_prev(NULL);
johnc@3956:     }
johnc@3956:     _collision_list_next = NULL;
ysr@777:     _occupied = 0;
ysr@777:     _bm.clear();
tschatzl@8281:     // Make sure that the bitmap clearing above has been finished before publishing
tschatzl@8281:     // this PRT to concurrent threads.
tschatzl@8281:     OrderAccess::release_store_ptr(&_hr, hr);
ysr@777:   }
ysr@777: 
ysr@1280:   void add_reference(OopOrNarrowOopStar from) {
ysr@777:     add_reference_work(from, /*parallel*/ true);
ysr@777:   }
ysr@777: 
ysr@1280:   void seq_add_reference(OopOrNarrowOopStar from) {
ysr@777:     add_reference_work(from, /*parallel*/ false);
ysr@777:   }
ysr@777: 
ysr@777:   void scrub(CardTableModRefBS* ctbs, BitMap* card_bm) {
ysr@777:     HeapWord* hr_bot = hr()->bottom();
swamyv@924:     size_t hr_first_card_index = ctbs->index_for(hr_bot);
ysr@777:     bm()->set_intersection_at_offset(*card_bm, hr_first_card_index);
ysr@777:     recount_occupied();
ysr@777:   }
ysr@777: 
johnc@1242:   void add_card(CardIdx_t from_card_index) {
ysr@777:     add_card_work(from_card_index, /*parallel*/ true);
ysr@777:   }
ysr@777: 
johnc@1242:   void seq_add_card(CardIdx_t from_card_index) {
ysr@777:     add_card_work(from_card_index, /*parallel*/ false);
ysr@777:   }
ysr@777: 
ysr@777:   // (Destructively) union the bitmap of the current table into the given
ysr@777:   // bitmap (which is assumed to be of the same size.)
ysr@777:   void union_bitmap_into(BitMap* bm) {
ysr@777:     bm->set_union(_bm);
ysr@777:   }
ysr@777: 
ysr@777:   // Mem size in bytes.
ysr@777:   size_t mem_size() const {
tschatzl@6932:     return sizeof(PerRegionTable) + _bm.size_in_words() * HeapWordSize;
ysr@777:   }
ysr@777: 
ysr@777:   // Requires "from" to be in "hr()".
ysr@1280:   bool contains_reference(OopOrNarrowOopStar from) const {
ysr@777:     assert(hr()->is_in_reserved(from), "Precondition.");
ysr@777:     size_t card_ind = pointer_delta(from, hr()->bottom(),
ysr@777:                                     CardTableModRefBS::card_size);
ysr@777:     return _bm.at(card_ind);
ysr@777:   }
ysr@777: 
johnc@3956:   // Bulk-free the PRTs from prt to last, assumes that they are
johnc@3956:   // linked together using their _next field.
johnc@3956:   static void bulk_free(PerRegionTable* prt, PerRegionTable* last) {
ysr@777:     while (true) {
johnc@3891:       PerRegionTable* fl = _free_list;
johnc@3956:       last->set_next(fl);
johnc@3956:       PerRegionTable* res = (PerRegionTable*) Atomic::cmpxchg_ptr(prt, &_free_list, fl);
johnc@3956:       if (res == fl) {
johnc@3956:         return;
johnc@3956:       }
ysr@777:     }
ysr@777:     ShouldNotReachHere();
ysr@777:   }
ysr@777: 
johnc@3956:   static void free(PerRegionTable* prt) {
johnc@3956:     bulk_free(prt, prt);
johnc@3956:   }
johnc@3956: 
johnc@3956:   // Returns an initialized PerRegionTable instance.
johnc@3891:   static PerRegionTable* alloc(HeapRegion* hr) {
johnc@3891:     PerRegionTable* fl = _free_list;
ysr@777:     while (fl != NULL) {
johnc@3891:       PerRegionTable* nxt = fl->next();
johnc@3891:       PerRegionTable* res =
johnc@3891:         (PerRegionTable*)
ysr@777:         Atomic::cmpxchg_ptr(nxt, &_free_list, fl);
ysr@777:       if (res == fl) {
johnc@3956:         fl->init(hr, true);
ysr@777:         return fl;
ysr@777:       } else {
ysr@777:         fl = _free_list;
ysr@777:       }
ysr@777:     }
ysr@777:     assert(fl == NULL, "Loop condition.");
johnc@3891:     return new PerRegionTable(hr);
ysr@777:   }
ysr@777: 
johnc@3956:   PerRegionTable* next() const { return _next; }
johnc@3956:   void set_next(PerRegionTable* next) { _next = next; }
johnc@3956:   PerRegionTable* prev() const { return _prev; }
johnc@3956:   void set_prev(PerRegionTable* prev) { _prev = prev; }
johnc@3956: 
johnc@3956:   // Accessor and Modification routines for the pointer for the
johnc@3956:   // singly linked collision list that links the PRTs within the
johnc@3956:   // OtherRegionsTable::_fine_grain_regions hash table.
johnc@3956:   //
johnc@3956:   // It might be useful to also make the collision list doubly linked
johnc@3956:   // to avoid iteration over the collisions list during scrubbing/deletion.
johnc@3956:   // OTOH there might not be many collisions.
johnc@3956: 
johnc@3956:   PerRegionTable* collision_list_next() const {
johnc@3956:     return _collision_list_next;
johnc@3956:   }
johnc@3956: 
johnc@3956:   void set_collision_list_next(PerRegionTable* next) {
johnc@3956:     _collision_list_next = next;
johnc@3956:   }
johnc@3956: 
johnc@3956:   PerRegionTable** collision_list_next_addr() {
johnc@3956:     return &_collision_list_next;
johnc@3956:   }
johnc@3956: 
ysr@777:   static size_t fl_mem_size() {
johnc@3891:     PerRegionTable* cur = _free_list;
ysr@777:     size_t res = 0;
ysr@777:     while (cur != NULL) {
tschatzl@5165:       res += cur->mem_size();
ysr@777:       cur = cur->next();
ysr@777:     }
ysr@777:     return res;
ysr@777:   }
tschatzl@5165: 
tschatzl@5165:   static void test_fl_mem_size();
ysr@777: };
ysr@777: 
johnc@3891: PerRegionTable* PerRegionTable::_free_list = NULL;
ysr@777: 
ysr@777: size_t OtherRegionsTable::_max_fine_entries = 0;
ysr@777: size_t OtherRegionsTable::_mod_max_fine_entries_mask = 0;
ysr@777: size_t OtherRegionsTable::_fine_eviction_stride = 0;
ysr@777: size_t OtherRegionsTable::_fine_eviction_sample_size = 0;
ysr@777: 
tschatzl@6402: OtherRegionsTable::OtherRegionsTable(HeapRegion* hr, Mutex* m) :
ysr@777:   _g1h(G1CollectedHeap::heap()),
tschatzl@6402:   _hr(hr), _m(m),
ysr@777:   _coarse_map(G1CollectedHeap::heap()->max_regions(),
ysr@777:               false /* in-resource-area */),
ysr@777:   _fine_grain_regions(NULL),
johnc@3956:   _first_all_fine_prts(NULL), _last_all_fine_prts(NULL),
ysr@777:   _n_fine_entries(0), _n_coarse_entries(0),
ysr@777:   _fine_eviction_start(0),
ysr@777:   _sparse_table(hr)
ysr@777: {
johnc@3891:   typedef PerRegionTable* PerRegionTablePtr;
johnc@3891: 
ysr@777:   if (_max_fine_entries == 0) {
ysr@777:     assert(_mod_max_fine_entries_mask == 0, "Both or none.");
iveresov@1696:     size_t max_entries_log = (size_t)log2_long((jlong)G1RSetRegionEntries);
brutisso@4061:     _max_fine_entries = (size_t)1 << max_entries_log;
ysr@777:     _mod_max_fine_entries_mask = _max_fine_entries - 1;
johnc@3891: 
ysr@777:     assert(_fine_eviction_sample_size == 0
ysr@777:            && _fine_eviction_stride == 0, "All init at same time.");
iveresov@1696:     _fine_eviction_sample_size = MAX2((size_t)4, max_entries_log);
ysr@777:     _fine_eviction_stride = _max_fine_entries / _fine_eviction_sample_size;
ysr@777:   }
johnc@3891: 
minqi@5103:   _fine_grain_regions = NEW_C_HEAP_ARRAY3(PerRegionTablePtr, _max_fine_entries,
zgu@7074:                         mtGC, CURRENT_PC, AllocFailStrategy::RETURN_NULL);
johnc@3891: 
johnc@3891:   if (_fine_grain_regions == NULL) {
ccheung@4993:     vm_exit_out_of_memory(sizeof(void*)*_max_fine_entries, OOM_MALLOC_ERROR,
ysr@777:                           "Failed to allocate _fine_grain_entries.");
johnc@3891:   }
johnc@3891: 
ysr@777:   for (size_t i = 0; i < _max_fine_entries; i++) {
ysr@777:     _fine_grain_regions[i] = NULL;
ysr@777:   }
ysr@777: }
ysr@777: 
johnc@3956: void OtherRegionsTable::link_to_all(PerRegionTable* prt) {
johnc@3956:   // We always append to the beginning of the list for convenience;
johnc@3956:   // the order of entries in this list does not matter.
johnc@3956:   if (_first_all_fine_prts != NULL) {
johnc@3956:     assert(_first_all_fine_prts->prev() == NULL, "invariant");
johnc@3956:     _first_all_fine_prts->set_prev(prt);
johnc@3956:     prt->set_next(_first_all_fine_prts);
johnc@3956:   } else {
johnc@3956:     // this is the first element we insert. Adjust the "last" pointer
johnc@3956:     _last_all_fine_prts = prt;
johnc@3956:     assert(prt->next() == NULL, "just checking");
johnc@3956:   }
johnc@3956:   // the new element is always the first element without a predecessor
johnc@3956:   prt->set_prev(NULL);
johnc@3956:   _first_all_fine_prts = prt;
johnc@3956: 
johnc@3956:   assert(prt->prev() == NULL, "just checking");
johnc@3956:   assert(_first_all_fine_prts == prt, "just checking");
johnc@3956:   assert((_first_all_fine_prts == NULL && _last_all_fine_prts == NULL) ||
johnc@3956:          (_first_all_fine_prts != NULL && _last_all_fine_prts != NULL),
johnc@3956:          "just checking");
johnc@3956:   assert(_last_all_fine_prts == NULL || _last_all_fine_prts->next() == NULL,
johnc@3956:          "just checking");
johnc@3956:   assert(_first_all_fine_prts == NULL || _first_all_fine_prts->prev() == NULL,
johnc@3956:          "just checking");
johnc@3956: }
johnc@3956: 
johnc@3956: void OtherRegionsTable::unlink_from_all(PerRegionTable* prt) {
johnc@3956:   if (prt->prev() != NULL) {
johnc@3956:     assert(_first_all_fine_prts != prt, "just checking");
johnc@3956:     prt->prev()->set_next(prt->next());
johnc@3956:     // removing the last element in the list?
johnc@3956:     if (_last_all_fine_prts == prt) {
johnc@3956:       _last_all_fine_prts = prt->prev();
johnc@3956:     }
johnc@3956:   } else {
johnc@3956:     assert(_first_all_fine_prts == prt, "just checking");
johnc@3956:     _first_all_fine_prts = prt->next();
johnc@3956:     // list is empty now?
johnc@3956:     if (_first_all_fine_prts == NULL) {
johnc@3956:       _last_all_fine_prts = NULL;
johnc@3956:     }
johnc@3956:   }
johnc@3956: 
johnc@3956:   if (prt->next() != NULL) {
johnc@3956:     prt->next()->set_prev(prt->prev());
johnc@3956:   }
johnc@3956: 
johnc@3956:   prt->set_next(NULL);
johnc@3956:   prt->set_prev(NULL);
johnc@3956: 
johnc@3956:   assert((_first_all_fine_prts == NULL && _last_all_fine_prts == NULL) ||
johnc@3956:          (_first_all_fine_prts != NULL && _last_all_fine_prts != NULL),
johnc@3956:          "just checking");
johnc@3956:   assert(_last_all_fine_prts == NULL || _last_all_fine_prts->next() == NULL,
johnc@3956:          "just checking");
johnc@3956:   assert(_first_all_fine_prts == NULL || _first_all_fine_prts->prev() == NULL,
johnc@3956:          "just checking");
johnc@3956: }
johnc@3956: 
tschatzl@6407: int**  FromCardCache::_cache = NULL;
tschatzl@6407: uint   FromCardCache::_max_regions = 0;
tschatzl@6407: size_t FromCardCache::_static_mem_size = 0;
ysr@777: 
tschatzl@6407: void FromCardCache::initialize(uint n_par_rs, uint max_num_regions) {
tschatzl@6407:   guarantee(_cache == NULL, "Should not call this multiple times");
tschatzl@6403: 
tschatzl@6407:   _max_regions = max_num_regions;
tschatzl@6407:   _cache = Padded2DArray<int, mtGC>::create_unfreeable(n_par_rs,
tschatzl@6407:                                                        _max_regions,
tschatzl@6407:                                                        &_static_mem_size);
ysr@777: 
tschatzl@7051:   invalidate(0, _max_regions);
ysr@777: }
ysr@777: 
tschatzl@7051: void FromCardCache::invalidate(uint start_idx, size_t new_num_regions) {
tschatzl@7051:   guarantee((size_t)start_idx + new_num_regions <= max_uintx,
kevinw@9327:             err_msg("Trying to invalidate beyond maximum region, from %u size " SIZE_FORMAT,
tschatzl@7051:                     start_idx, new_num_regions));
tschatzl@6403:   for (uint i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) {
tschatzl@7051:     uint end_idx = (start_idx + (uint)new_num_regions);
tschatzl@7051:     assert(end_idx <= _max_regions, "Must be within max.");
tschatzl@7051:     for (uint j = start_idx; j < end_idx; j++) {
tschatzl@6407:       set(i, j, InvalidCard);
ysr@777:     }
ysr@777:   }
ysr@777: }
ysr@777: 
ysr@777: #ifndef PRODUCT
tschatzl@6407: void FromCardCache::print(outputStream* out) {
tschatzl@6403:   for (uint i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) {
tschatzl@6407:     for (uint j = 0; j < _max_regions; j++) {
kevinw@9342:       out->print_cr("_from_card_cache[" UINT32_FORMAT "][" UINT32_FORMAT "] = " INT32_FORMAT ".",
tschatzl@6407:                     i, j, at(i, j));
ysr@777:     }
ysr@777:   }
ysr@777: }
ysr@777: #endif
ysr@777: 
tschatzl@6407: void FromCardCache::clear(uint region_idx) {
tschatzl@6407:   uint num_par_remsets = HeapRegionRemSet::num_par_rem_sets();
tschatzl@6407:   for (uint i = 0; i < num_par_remsets; i++) {
tschatzl@6407:     set(i, region_idx, InvalidCard);
tschatzl@6407:   }
tschatzl@6407: }
tschatzl@6407: 
tschatzl@7051: void OtherRegionsTable::initialize(uint max_regions) {
tschatzl@6407:   FromCardCache::initialize(HeapRegionRemSet::num_par_rem_sets(), max_regions);
tschatzl@6407: }
tschatzl@6407: 
tschatzl@7051: void OtherRegionsTable::invalidate(uint start_idx, size_t num_regions) {
tschatzl@7051:   FromCardCache::invalidate(start_idx, num_regions);
tschatzl@6407: }
tschatzl@6407: 
tschatzl@6407: void OtherRegionsTable::print_from_card_cache() {
tschatzl@6407:   FromCardCache::print();
tschatzl@6407: }
tschatzl@6407: 
ysr@1280: void OtherRegionsTable::add_reference(OopOrNarrowOopStar from, int tid) {
tschatzl@7091:   uint cur_hrm_ind = hr()->hrm_index();
ysr@777: 
johnc@3891:   if (G1TraceHeapRegionRememberedSet) {
johnc@3891:     gclog_or_tty->print_cr("ORT::add_reference_work(" PTR_FORMAT "->" PTR_FORMAT ").",
johnc@3891:                                                     from,
johnc@3891:                                                     UseCompressedOops
hseigel@5784:                                                     ? (void *)oopDesc::load_decode_heap_oop((narrowOop*)from)
hseigel@5784:                                                     : (void *)oopDesc::load_decode_heap_oop((oop*)from));
johnc@3891:   }
ysr@777: 
ysr@777:   int from_card = (int)(uintptr_t(from) >> CardTableModRefBS::card_shift);
ysr@777: 
johnc@3891:   if (G1TraceHeapRegionRememberedSet) {
kevinw@9342:     gclog_or_tty->print_cr("Table for [" PTR_FORMAT "...): card %d (cache = " INT32_FORMAT ")",
johnc@3891:                   hr()->bottom(), from_card,
tschatzl@7091:                   FromCardCache::at((uint)tid, cur_hrm_ind));
johnc@3891:   }
ysr@777: 
tschatzl@7091:   if (FromCardCache::contains_or_replace((uint)tid, cur_hrm_ind, from_card)) {
johnc@3891:     if (G1TraceHeapRegionRememberedSet) {
johnc@3891:       gclog_or_tty->print_cr("  from-card cache hit.");
johnc@3891:     }
tschatzl@8281:     assert(contains_reference(from), err_msg("We just found " PTR_FORMAT " in the FromCardCache", from));
ysr@777:     return;
ysr@777:   }
ysr@777: 
ysr@777:   // Note that this may be a continued H region.
ysr@777:   HeapRegion* from_hr = _g1h->heap_region_containing_raw(from);
tschatzl@7106:   RegionIdx_t from_hrm_ind = (RegionIdx_t) from_hr->hrm_index();
ysr@777: 
ysr@777:   // If the region is already coarsened, return.
tschatzl@7106:   if (_coarse_map.at(from_hrm_ind)) {
johnc@3891:     if (G1TraceHeapRegionRememberedSet) {
johnc@3891:       gclog_or_tty->print_cr("  coarse map hit.");
johnc@3891:     }
tschatzl@8281:     assert(contains_reference(from), err_msg("We just found " PTR_FORMAT " in the Coarse table", from));
ysr@777:     return;
ysr@777:   }
ysr@777: 
ysr@777:   // Otherwise find a per-region table to add it to.
tschatzl@7106:   size_t ind = from_hrm_ind & _mod_max_fine_entries_mask;
johnc@3891:   PerRegionTable* prt = find_region_table(ind, from_hr);
ysr@777:   if (prt == NULL) {
tschatzl@6402:     MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag);
ysr@777:     // Confirm that it's really not there...
ysr@777:     prt = find_region_table(ind, from_hr);
ysr@777:     if (prt == NULL) {
ysr@777: 
ysr@777:       uintptr_t from_hr_bot_card_index =
ysr@777:         uintptr_t(from_hr->bottom())
ysr@777:           >> CardTableModRefBS::card_shift;
johnc@1242:       CardIdx_t card_index = from_card - from_hr_bot_card_index;
johnc@3182:       assert(0 <= card_index && (size_t)card_index < HeapRegion::CardsPerRegion,
ysr@777:              "Must be in range.");
ysr@777:       if (G1HRRSUseSparseTable &&
tschatzl@7106:           _sparse_table.add_card(from_hrm_ind, card_index)) {
ysr@777:         if (G1RecordHRRSOops) {
ysr@777:           HeapRegionRemSet::record(hr(), from);
johnc@3891:           if (G1TraceHeapRegionRememberedSet) {
johnc@3891:             gclog_or_tty->print("   Added card " PTR_FORMAT " to region "
johnc@3891:                                 "[" PTR_FORMAT "...) for ref " PTR_FORMAT ".\n",
johnc@3891:                                 align_size_down(uintptr_t(from),
johnc@3891:                                                 CardTableModRefBS::card_size),
johnc@3891:                                 hr()->bottom(), from);
johnc@3891:           }
ysr@777:         }
johnc@3891:         if (G1TraceHeapRegionRememberedSet) {
johnc@3891:           gclog_or_tty->print_cr("   added card to sparse table.");
johnc@3891:         }
tschatzl@8281:         assert(contains_reference_locked(from), err_msg("We just added " PTR_FORMAT " to the Sparse table", from));
ysr@777:         return;
ysr@777:       } else {
johnc@3891:         if (G1TraceHeapRegionRememberedSet) {
johnc@3891:           gclog_or_tty->print_cr("   [tid %d] sparse table entry "
tschatzl@7091:                         "overflow(f: %d, t: %u)",
tschatzl@7106:                         tid, from_hrm_ind, cur_hrm_ind);
johnc@3891:         }
ysr@777:       }
ysr@777: 
ysr@777:       if (_n_fine_entries == _max_fine_entries) {
ysr@777:         prt = delete_region_table();
johnc@3956:         // There is no need to clear the links to the 'all' list here:
johnc@3956:         // prt will be reused immediately, i.e. remain in the 'all' list.
johnc@3956:         prt->init(from_hr, false /* clear_links_to_all_list */);
ysr@777:       } else {
johnc@3891:         prt = PerRegionTable::alloc(from_hr);
johnc@3956:         link_to_all(prt);
ysr@777:       }
ysr@777: 
johnc@3891:       PerRegionTable* first_prt = _fine_grain_regions[ind];
johnc@3956:       prt->set_collision_list_next(first_prt);
bdelsart@9046:       // The assignment into _fine_grain_regions allows the prt to
bdelsart@9046:       // start being used concurrently. In addition to
bdelsart@9046:       // collision_list_next which must be visible (else concurrent
bdelsart@9046:       // parsing of the list, if any, may fail to see other entries),
bdelsart@9046:       // the content of the prt must be visible (else for instance
bdelsart@9046:       // some mark bits may not yet seem cleared or a 'later' update
bdelsart@9046:       // performed by a concurrent thread could be undone when the
bdelsart@9046:       // zeroing becomes visible). This requires store ordering.
bdelsart@9046:       OrderAccess::release_store_ptr((volatile PerRegionTable*)&_fine_grain_regions[ind], prt);
ysr@777:       _n_fine_entries++;
ysr@777: 
ysr@777:       if (G1HRRSUseSparseTable) {
iveresov@1696:         // Transfer from sparse to fine-grain.
tschatzl@7106:         SparsePRTEntry *sprt_entry = _sparse_table.get_entry(from_hrm_ind);
iveresov@1696:         assert(sprt_entry != NULL, "There should have been an entry");
iveresov@1696:         for (int i = 0; i < SparsePRTEntry::cards_num(); i++) {
iveresov@1696:           CardIdx_t c = sprt_entry->card(i);
ysr@777:           if (c != SparsePRTEntry::NullEntry) {
ysr@777:             prt->add_card(c);
ysr@777:           }
ysr@777:         }
ysr@777:         // Now we can delete the sparse entry.
tschatzl@7106:         bool res = _sparse_table.delete_entry(from_hrm_ind);
ysr@777:         assert(res, "It should have been there.");
ysr@777:       }
ysr@777:     }
ysr@777:     assert(prt != NULL && prt->hr() == from_hr, "consequence");
ysr@777:   }
ysr@777:   // Note that we can't assert "prt->hr() == from_hr", because of the
ysr@777:   // possibility of concurrent reuse.  But see head comment of
ysr@777:   // OtherRegionsTable for why this is OK.
ysr@777:   assert(prt != NULL, "Inv");
ysr@777: 
johnc@3891:   prt->add_reference(from);
johnc@3891: 
ysr@777:   if (G1RecordHRRSOops) {
ysr@777:     HeapRegionRemSet::record(hr(), from);
johnc@3891:     if (G1TraceHeapRegionRememberedSet) {
johnc@3891:       gclog_or_tty->print("Added card " PTR_FORMAT " to region "
johnc@3891:                           "[" PTR_FORMAT "...) for ref " PTR_FORMAT ".\n",
johnc@3891:                           align_size_down(uintptr_t(from),
johnc@3891:                                           CardTableModRefBS::card_size),
johnc@3891:                           hr()->bottom(), from);
johnc@3891:     }
ysr@777:   }
tschatzl@8281:   assert(contains_reference(from), err_msg("We just added " PTR_FORMAT " to the PRT", from));
ysr@777: }
ysr@777: 
johnc@3891: PerRegionTable*
ysr@777: OtherRegionsTable::find_region_table(size_t ind, HeapRegion* hr) const {
ysr@777:   assert(0 <= ind && ind < _max_fine_entries, "Preconditions.");
johnc@3891:   PerRegionTable* prt = _fine_grain_regions[ind];
ysr@777:   while (prt != NULL && prt->hr() != hr) {
johnc@3956:     prt = prt->collision_list_next();
ysr@777:   }
ysr@777:   // Loop postcondition is the method postcondition.
ysr@777:   return prt;
ysr@777: }
ysr@777: 
ysr@777: jint OtherRegionsTable::_n_coarsenings = 0;
ysr@777: 
johnc@3891: PerRegionTable* OtherRegionsTable::delete_region_table() {
tschatzl@6402:   assert(_m->owned_by_self(), "Precondition");
ysr@777:   assert(_n_fine_entries == _max_fine_entries, "Precondition");
johnc@3891:   PerRegionTable* max = NULL;
ysr@777:   jint max_occ = 0;
csahu@8316:   PerRegionTable** max_prev = NULL;
ysr@777:   size_t max_ind;
ysr@777: 
ysr@777:   size_t i = _fine_eviction_start;
ysr@777:   for (size_t k = 0; k < _fine_eviction_sample_size; k++) {
ysr@777:     size_t ii = i;
ysr@777:     // Make sure we get a non-NULL sample.
ysr@777:     while (_fine_grain_regions[ii] == NULL) {
ysr@777:       ii++;
ysr@777:       if (ii == _max_fine_entries) ii = 0;
ysr@777:       guarantee(ii != i, "We must find one.");
ysr@777:     }
johnc@3891:     PerRegionTable** prev = &_fine_grain_regions[ii];
johnc@3891:     PerRegionTable* cur = *prev;
ysr@777:     while (cur != NULL) {
ysr@777:       jint cur_occ = cur->occupied();
ysr@777:       if (max == NULL || cur_occ > max_occ) {
ysr@777:         max = cur;
ysr@777:         max_prev = prev;
ysr@777:         max_ind = i;
ysr@777:         max_occ = cur_occ;
ysr@777:       }
johnc@3956:       prev = cur->collision_list_next_addr();
johnc@3956:       cur = cur->collision_list_next();
ysr@777:     }
ysr@777:     i = i + _fine_eviction_stride;
ysr@777:     if (i >= _n_fine_entries) i = i - _n_fine_entries;
ysr@777:   }
johnc@3891: 
ysr@777:   _fine_eviction_start++;
johnc@3891: 
johnc@3891:   if (_fine_eviction_start >= _n_fine_entries) {
ysr@777:     _fine_eviction_start -= _n_fine_entries;
ysr@777:   }
johnc@3891: 
ysr@777:   guarantee(max != NULL, "Since _n_fine_entries > 0");
csahu@8316:   guarantee(max_prev != NULL, "Since max != NULL.");
ysr@777: 
ysr@777:   // Set the corresponding coarse bit.
tschatzl@7091:   size_t max_hrm_index = (size_t) max->hr()->hrm_index();
tschatzl@7091:   if (!_coarse_map.at(max_hrm_index)) {
tschatzl@7091:     _coarse_map.at_put(max_hrm_index, true);
ysr@777:     _n_coarse_entries++;
johnc@3891:     if (G1TraceHeapRegionRememberedSet) {
johnc@3891:       gclog_or_tty->print("Coarsened entry in region [" PTR_FORMAT "...] "
johnc@3891:                  "for region [" PTR_FORMAT "...] (%d coarse entries).\n",
johnc@3891:                  hr()->bottom(),
johnc@3891:                  max->hr()->bottom(),
johnc@3891:                  _n_coarse_entries);
johnc@3891:     }
ysr@777:   }
ysr@777: 
ysr@777:   // Unsplice.
johnc@3956:   *max_prev = max->collision_list_next();
ysr@777:   Atomic::inc(&_n_coarsenings);
ysr@777:   _n_fine_entries--;
ysr@777:   return max;
ysr@777: }
ysr@777: 
ysr@777: 
ysr@777: // At present, this must be called stop-world single-threaded.
ysr@777: void OtherRegionsTable::scrub(CardTableModRefBS* ctbs,
ysr@777:                               BitMap* region_bm, BitMap* card_bm) {
ysr@777:   // First eliminated garbage regions from the coarse map.
tonyp@3713:   if (G1RSScrubVerbose) {
tschatzl@7091:     gclog_or_tty->print_cr("Scrubbing region %u:", hr()->hrm_index());
tonyp@3713:   }
ysr@777: 
ysr@777:   assert(_coarse_map.size() == region_bm->size(), "Precondition");
tonyp@3713:   if (G1RSScrubVerbose) {
kevinw@9327:     gclog_or_tty->print("   Coarse map: before = " SIZE_FORMAT "...",
tonyp@3713:                         _n_coarse_entries);
tonyp@3713:   }
ysr@777:   _coarse_map.set_intersection(*region_bm);
ysr@777:   _n_coarse_entries = _coarse_map.count_one_bits();
tonyp@3713:   if (G1RSScrubVerbose) {
kevinw@9327:     gclog_or_tty->print_cr("   after = " SIZE_FORMAT ".", _n_coarse_entries);
tonyp@3713:   }
ysr@777: 
ysr@777:   // Now do the fine-grained maps.
ysr@777:   for (size_t i = 0; i < _max_fine_entries; i++) {
johnc@3891:     PerRegionTable* cur = _fine_grain_regions[i];
johnc@3891:     PerRegionTable** prev = &_fine_grain_regions[i];
ysr@777:     while (cur != NULL) {
johnc@3956:       PerRegionTable* nxt = cur->collision_list_next();
ysr@777:       // If the entire region is dead, eliminate.
tonyp@3713:       if (G1RSScrubVerbose) {
tonyp@3713:         gclog_or_tty->print_cr("     For other region %u:",
tschatzl@7091:                                cur->hr()->hrm_index());
tonyp@3713:       }
tschatzl@7091:       if (!region_bm->at((size_t) cur->hr()->hrm_index())) {
ysr@777:         *prev = nxt;
johnc@3956:         cur->set_collision_list_next(NULL);
ysr@777:         _n_fine_entries--;
tonyp@3713:         if (G1RSScrubVerbose) {
ysr@777:           gclog_or_tty->print_cr("          deleted via region map.");
tonyp@3713:         }
johnc@3956:         unlink_from_all(cur);
johnc@3891:         PerRegionTable::free(cur);
ysr@777:       } else {
ysr@777:         // Do fine-grain elimination.
tonyp@3713:         if (G1RSScrubVerbose) {
ysr@777:           gclog_or_tty->print("          occ: before = %4d.", cur->occupied());
tonyp@3713:         }
ysr@777:         cur->scrub(ctbs, card_bm);
tonyp@3713:         if (G1RSScrubVerbose) {
ysr@777:           gclog_or_tty->print_cr("          after = %4d.", cur->occupied());
tonyp@3713:         }
ysr@777:         // Did that empty the table completely?
ysr@777:         if (cur->occupied() == 0) {
ysr@777:           *prev = nxt;
johnc@3956:           cur->set_collision_list_next(NULL);
ysr@777:           _n_fine_entries--;
johnc@3956:           unlink_from_all(cur);
johnc@3891:           PerRegionTable::free(cur);
ysr@777:         } else {
johnc@3956:           prev = cur->collision_list_next_addr();
ysr@777:         }
ysr@777:       }
ysr@777:       cur = nxt;
ysr@777:     }
ysr@777:   }
ysr@777:   // Since we may have deleted a from_card_cache entry from the RS, clear
ysr@777:   // the FCC.
ysr@777:   clear_fcc();
ysr@777: }
ysr@777: 
tschatzl@7828: bool OtherRegionsTable::occupancy_less_or_equal_than(size_t limit) const {
tschatzl@7828:   if (limit <= (size_t)G1RSetSparseRegionEntries) {
tschatzl@7828:     return occ_coarse() == 0 && _first_all_fine_prts == NULL && occ_sparse() <= limit;
tschatzl@7828:   } else {
tschatzl@7828:     // Current uses of this method may only use values less than G1RSetSparseRegionEntries
tschatzl@7828:     // for the limit. The solution, comparing against occupied() would be too slow
tschatzl@7828:     // at this time.
tschatzl@7828:     Unimplemented();
tschatzl@7828:     return false;
tschatzl@7828:   }
tschatzl@7828: }
tschatzl@7828: 
tschatzl@7010: bool OtherRegionsTable::is_empty() const {
tschatzl@7010:   return occ_sparse() == 0 && occ_coarse() == 0 && _first_all_fine_prts == NULL;
tschatzl@7010: }
ysr@777: 
ysr@777: size_t OtherRegionsTable::occupied() const {
ysr@777:   size_t sum = occ_fine();
ysr@777:   sum += occ_sparse();
ysr@777:   sum += occ_coarse();
ysr@777:   return sum;
ysr@777: }
ysr@777: 
ysr@777: size_t OtherRegionsTable::occ_fine() const {
ysr@777:   size_t sum = 0;
johnc@3956: 
johnc@3956:   size_t num = 0;
johnc@3956:   PerRegionTable * cur = _first_all_fine_prts;
johnc@3956:   while (cur != NULL) {
johnc@3956:     sum += cur->occupied();
johnc@3956:     cur = cur->next();
johnc@3956:     num++;
ysr@777:   }
johnc@3956:   guarantee(num == _n_fine_entries, "just checking");
ysr@777:   return sum;
ysr@777: }
ysr@777: 
ysr@777: size_t OtherRegionsTable::occ_coarse() const {
tonyp@1377:   return (_n_coarse_entries * HeapRegion::CardsPerRegion);
ysr@777: }
ysr@777: 
ysr@777: size_t OtherRegionsTable::occ_sparse() const {
ysr@777:   return _sparse_table.occupied();
ysr@777: }
ysr@777: 
ysr@777: size_t OtherRegionsTable::mem_size() const {
ysr@777:   size_t sum = 0;
tschatzl@5122:   // all PRTs are of the same size so it is sufficient to query only one of them.
tschatzl@5122:   if (_first_all_fine_prts != NULL) {
tschatzl@5122:     assert(_last_all_fine_prts != NULL &&
tschatzl@5122:       _first_all_fine_prts->mem_size() == _last_all_fine_prts->mem_size(), "check that mem_size() is constant");
tschatzl@5122:     sum += _first_all_fine_prts->mem_size() * _n_fine_entries;
ysr@777:   }
johnc@3891:   sum += (sizeof(PerRegionTable*) * _max_fine_entries);
ysr@777:   sum += (_coarse_map.size_in_words() * HeapWordSize);
ysr@777:   sum += (_sparse_table.mem_size());
tschatzl@6932:   sum += sizeof(OtherRegionsTable) - sizeof(_sparse_table); // Avoid double counting above.
ysr@777:   return sum;
ysr@777: }
ysr@777: 
ysr@777: size_t OtherRegionsTable::static_mem_size() {
tschatzl@6407:   return FromCardCache::static_mem_size();
ysr@777: }
ysr@777: 
ysr@777: size_t OtherRegionsTable::fl_mem_size() {
johnc@3891:   return PerRegionTable::fl_mem_size();
ysr@777: }
ysr@777: 
ysr@777: void OtherRegionsTable::clear_fcc() {
tschatzl@7091:   FromCardCache::clear(hr()->hrm_index());
ysr@777: }
ysr@777: 
ysr@777: void OtherRegionsTable::clear() {
johnc@3956:   // if there are no entries, skip this step
johnc@3956:   if (_first_all_fine_prts != NULL) {
johnc@3956:     guarantee(_first_all_fine_prts != NULL && _last_all_fine_prts != NULL, "just checking");
johnc@3956:     PerRegionTable::bulk_free(_first_all_fine_prts, _last_all_fine_prts);
johnc@3956:     memset(_fine_grain_regions, 0, _max_fine_entries * sizeof(_fine_grain_regions[0]));
johnc@3956:   } else {
johnc@3956:     guarantee(_first_all_fine_prts == NULL && _last_all_fine_prts == NULL, "just checking");
ysr@777:   }
johnc@3956: 
johnc@3956:   _first_all_fine_prts = _last_all_fine_prts = NULL;
ysr@777:   _sparse_table.clear();
ysr@777:   _coarse_map.clear();
ysr@777:   _n_fine_entries = 0;
ysr@777:   _n_coarse_entries = 0;
ysr@777: 
ysr@777:   clear_fcc();
ysr@777: }
ysr@777: 
ysr@777: bool OtherRegionsTable::del_single_region_table(size_t ind,
ysr@777:                                                 HeapRegion* hr) {
ysr@777:   assert(0 <= ind && ind < _max_fine_entries, "Preconditions.");
johnc@3891:   PerRegionTable** prev_addr = &_fine_grain_regions[ind];
johnc@3891:   PerRegionTable* prt = *prev_addr;
ysr@777:   while (prt != NULL && prt->hr() != hr) {
johnc@3956:     prev_addr = prt->collision_list_next_addr();
johnc@3956:     prt = prt->collision_list_next();
ysr@777:   }
ysr@777:   if (prt != NULL) {
ysr@777:     assert(prt->hr() == hr, "Loop postcondition.");
johnc@3956:     *prev_addr = prt->collision_list_next();
johnc@3956:     unlink_from_all(prt);
johnc@3891:     PerRegionTable::free(prt);
ysr@777:     _n_fine_entries--;
ysr@777:     return true;
ysr@777:   } else {
ysr@777:     return false;
ysr@777:   }
ysr@777: }
ysr@777: 
ysr@1280: bool OtherRegionsTable::contains_reference(OopOrNarrowOopStar from) const {
ysr@777:   // Cast away const in this case.
tschatzl@6402:   MutexLockerEx x((Mutex*)_m, Mutex::_no_safepoint_check_flag);
ysr@777:   return contains_reference_locked(from);
ysr@777: }
ysr@777: 
ysr@1280: bool OtherRegionsTable::contains_reference_locked(OopOrNarrowOopStar from) const {
ysr@777:   HeapRegion* hr = _g1h->heap_region_containing_raw(from);
tschatzl@7091:   RegionIdx_t hr_ind = (RegionIdx_t) hr->hrm_index();
ysr@777:   // Is this region in the coarse map?
ysr@777:   if (_coarse_map.at(hr_ind)) return true;
ysr@777: 
johnc@3891:   PerRegionTable* prt = find_region_table(hr_ind & _mod_max_fine_entries_mask,
ysr@777:                                      hr);
ysr@777:   if (prt != NULL) {
ysr@777:     return prt->contains_reference(from);
ysr@777: 
ysr@777:   } else {
ysr@777:     uintptr_t from_card =
ysr@777:       (uintptr_t(from) >> CardTableModRefBS::card_shift);
ysr@777:     uintptr_t hr_bot_card_index =
ysr@777:       uintptr_t(hr->bottom()) >> CardTableModRefBS::card_shift;
ysr@777:     assert(from_card >= hr_bot_card_index, "Inv");
johnc@1242:     CardIdx_t card_index = from_card - hr_bot_card_index;
johnc@3182:     assert(0 <= card_index && (size_t)card_index < HeapRegion::CardsPerRegion,
tonyp@1377:            "Must be in range.");
johnc@1242:     return _sparse_table.contains_card(hr_ind, card_index);
ysr@777:   }
ysr@777: }
ysr@777: 
tonyp@2493: void
tonyp@2493: OtherRegionsTable::do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task) {
tonyp@2493:   _sparse_table.do_cleanup_work(hrrs_cleanup_task);
tonyp@2493: }
tonyp@2493: 
iveresov@1230: // Determines how many threads can add records to an rset in parallel.
iveresov@1230: // This can be done by either mutator threads together with the
iveresov@1230: // concurrent refinement threads or GC threads.
tschatzl@6403: uint HeapRegionRemSet::num_par_rem_sets() {
vkempik@6552:   return MAX2(DirtyCardQueueSet::num_par_ids() + ConcurrentG1Refine::thread_num(), (uint)ParallelGCThreads);
ysr@777: }
ysr@777: 
ysr@777: HeapRegionRemSet::HeapRegionRemSet(G1BlockOffsetSharedArray* bosa,
ysr@777:                                    HeapRegion* hr)
tschatzl@6402:   : _bosa(bosa),
tschatzl@7091:     _m(Mutex::leaf, FormatBuffer<128>("HeapRegionRemSet lock #%u", hr->hrm_index()), true),
tschatzl@7051:     _code_roots(), _other_regions(hr, &_m), _iter_state(Unclaimed), _iter_claimed(0) {
tonyp@2974:   reset_for_par_iteration();
tonyp@2974: }
ysr@777: 
iveresov@1696: void HeapRegionRemSet::setup_remset_size() {
iveresov@1696:   // Setup sparse and fine-grain tables sizes.
iveresov@1696:   // table_size = base * (log(region_size / 1M) + 1)
brutisso@3810:   const int LOG_M = 20;
brutisso@3810:   int region_size_log_mb = MAX2(HeapRegion::LogOfHRGrainBytes - LOG_M, 0);
iveresov@1696:   if (FLAG_IS_DEFAULT(G1RSetSparseRegionEntries)) {
iveresov@1696:     G1RSetSparseRegionEntries = G1RSetSparseRegionEntriesBase * (region_size_log_mb + 1);
iveresov@1696:   }
iveresov@1696:   if (FLAG_IS_DEFAULT(G1RSetRegionEntries)) {
iveresov@1696:     G1RSetRegionEntries = G1RSetRegionEntriesBase * (region_size_log_mb + 1);
iveresov@1696:   }
iveresov@1696:   guarantee(G1RSetSparseRegionEntries > 0 && G1RSetRegionEntries > 0 , "Sanity");
iveresov@1696: }
iveresov@1696: 
ysr@777: bool HeapRegionRemSet::claim_iter() {
ysr@777:   if (_iter_state != Unclaimed) return false;
ysr@777:   jint res = Atomic::cmpxchg(Claimed, (jint*)(&_iter_state), Unclaimed);
ysr@777:   return (res == Unclaimed);
ysr@777: }
ysr@777: 
ysr@777: void HeapRegionRemSet::set_iter_complete() {
ysr@777:   _iter_state = Complete;
ysr@777: }
ysr@777: 
ysr@777: bool HeapRegionRemSet::iter_is_complete() {
ysr@777:   return _iter_state == Complete;
ysr@777: }
ysr@777: 
ysr@777: #ifndef PRODUCT
tschatzl@6402: void HeapRegionRemSet::print() {
johnc@5014:   HeapRegionRemSetIterator iter(this);
ysr@777:   size_t card_index;
ysr@777:   while (iter.has_next(card_index)) {
ysr@777:     HeapWord* card_start =
ysr@777:       G1CollectedHeap::heap()->bot_shared()->address_for_index(card_index);
tonyp@2974:     gclog_or_tty->print_cr("  Card " PTR_FORMAT, card_start);
ysr@777:   }
ysr@777:   if (iter.n_yielded() != occupied()) {
ysr@777:     gclog_or_tty->print_cr("Yielded disagrees with occupied:");
ysr@777:     gclog_or_tty->print_cr("  %6d yielded (%6d coarse, %6d fine).",
ysr@777:                   iter.n_yielded(),
ysr@777:                   iter.n_yielded_coarse(), iter.n_yielded_fine());
ysr@777:     gclog_or_tty->print_cr("  %6d occ     (%6d coarse, %6d fine).",
ysr@777:                   occupied(), occ_coarse(), occ_fine());
ysr@777:   }
ysr@777:   guarantee(iter.n_yielded() == occupied(),
ysr@777:             "We should have yielded all the represented cards.");
ysr@777: }
ysr@777: #endif
ysr@777: 
ysr@777: void HeapRegionRemSet::cleanup() {
ysr@777:   SparsePRT::cleanup_all();
ysr@777: }
ysr@777: 
ysr@777: void HeapRegionRemSet::clear() {
tschatzl@6402:   MutexLockerEx x(&_m, Mutex::_no_safepoint_check_flag);
tschatzl@6402:   clear_locked();
tschatzl@6402: }
johnc@5548: 
tschatzl@6402: void HeapRegionRemSet::clear_locked() {
tschatzl@6402:   _code_roots.clear();
ysr@777:   _other_regions.clear();
tschatzl@6402:   assert(occupied_locked() == 0, "Should be clear.");
tonyp@2974:   reset_for_par_iteration();
tonyp@2974: }
tonyp@2974: 
tonyp@2974: void HeapRegionRemSet::reset_for_par_iteration() {
tonyp@2974:   _iter_state = Unclaimed;
tonyp@2974:   _iter_claimed = 0;
tonyp@2974:   // It's good to check this to make sure that the two methods are in sync.
tonyp@2974:   assert(verify_ready_for_par_iteration(), "post-condition");
ysr@777: }
ysr@777: 
ysr@777: void HeapRegionRemSet::scrub(CardTableModRefBS* ctbs,
ysr@777:                              BitMap* region_bm, BitMap* card_bm) {
ysr@777:   _other_regions.scrub(ctbs, region_bm, card_bm);
ysr@777: }
ysr@777: 
johnc@5548: // Code roots support
mgerdin@7208: //
mgerdin@7208: // The code root set is protected by two separate locking schemes
mgerdin@7208: // When at safepoint the per-hrrs lock must be held during modifications
mgerdin@7208: // except when doing a full gc.
mgerdin@7208: // When not at safepoint the CodeCache_lock must be held during modifications.
mgerdin@7208: // When concurrent readers access the contains() function
mgerdin@7208: // (during the evacuation phase) no removals are allowed.
johnc@5548: 
johnc@5548: void HeapRegionRemSet::add_strong_code_root(nmethod* nm) {
johnc@5548:   assert(nm != NULL, "sanity");
dbuck@9487:   assert((!CodeCache_lock->owned_by_self() || SafepointSynchronize::is_at_safepoint()),
dbuck@9487:           err_msg("should call add_strong_code_root_locked instead. CodeCache_lock->owned_by_self(): %s, is_at_safepoint(): %s",
dbuck@9487:                   BOOL_TO_STR(CodeCache_lock->owned_by_self()), BOOL_TO_STR(SafepointSynchronize::is_at_safepoint())));
mgerdin@7208:   // Optimistic unlocked contains-check
mgerdin@7208:   if (!_code_roots.contains(nm)) {
mgerdin@7208:     MutexLockerEx ml(&_m, Mutex::_no_safepoint_check_flag);
mgerdin@7208:     add_strong_code_root_locked(nm);
mgerdin@7208:   }
mgerdin@7208: }
mgerdin@7208: 
mgerdin@7208: void HeapRegionRemSet::add_strong_code_root_locked(nmethod* nm) {
mgerdin@7208:   assert(nm != NULL, "sanity");
dbuck@9487:   assert((CodeCache_lock->owned_by_self() ||
dbuck@9487:          (SafepointSynchronize::is_at_safepoint() &&
dbuck@9487:           (_m.owned_by_self() || Thread::current()->is_VM_thread()))),
dbuck@9487:           err_msg("not safely locked. CodeCache_lock->owned_by_self(): %s, is_at_safepoint(): %s, _m.owned_by_self(): %s, Thread::current()->is_VM_thread(): %s",
dbuck@9487:                   BOOL_TO_STR(CodeCache_lock->owned_by_self()), BOOL_TO_STR(SafepointSynchronize::is_at_safepoint()),
dbuck@9487:                   BOOL_TO_STR(_m.owned_by_self()), BOOL_TO_STR(Thread::current()->is_VM_thread())));
tschatzl@6402:   _code_roots.add(nm);
johnc@5548: }
johnc@5548: 
johnc@5548: void HeapRegionRemSet::remove_strong_code_root(nmethod* nm) {
johnc@5548:   assert(nm != NULL, "sanity");
stefank@6992:   assert_locked_or_safepoint(CodeCache_lock);
stefank@6992: 
mgerdin@7208:   MutexLockerEx ml(CodeCache_lock->owned_by_self() ? NULL : &_m, Mutex::_no_safepoint_check_flag);
mgerdin@7208:   _code_roots.remove(nm);
stefank@6992: 
johnc@5548:   // Check that there were no duplicates
tschatzl@6402:   guarantee(!_code_roots.contains(nm), "duplicate entry found");
johnc@5548: }
johnc@5548: 
mgerdin@7208: void HeapRegionRemSet::strong_code_roots_do(CodeBlobClosure* blk) const {
mgerdin@7208:   _code_roots.nmethods_do(blk);
johnc@5548: }
johnc@5548: 
mgerdin@7208: void HeapRegionRemSet::clean_strong_code_roots(HeapRegion* hr) {
mgerdin@7208:   _code_roots.clean(hr);
johnc@5548: }
johnc@5548: 
johnc@5548: size_t HeapRegionRemSet::strong_code_roots_mem_size() {
tschatzl@6402:   return _code_roots.mem_size();
johnc@5548: }
johnc@5548: 
tschatzl@6402: HeapRegionRemSetIterator:: HeapRegionRemSetIterator(HeapRegionRemSet* hrrs) :
johnc@5014:   _hrrs(hrrs),
ysr@777:   _g1h(G1CollectedHeap::heap()),
johnc@5014:   _coarse_map(&hrrs->_other_regions._coarse_map),
johnc@5014:   _bosa(hrrs->bosa()),
johnc@5014:   _is(Sparse),
ysr@777:   // Set these values so that we increment to the first region.
johnc@5014:   _coarse_cur_region_index(-1),
johnc@5014:   _coarse_cur_region_cur_card(HeapRegion::CardsPerRegion-1),
tschatzl@6927:   _cur_card_in_prt(HeapRegion::CardsPerRegion),
johnc@5014:   _fine_cur_prt(NULL),
johnc@5014:   _n_yielded_coarse(0),
johnc@5014:   _n_yielded_fine(0),
johnc@5014:   _n_yielded_sparse(0),
johnc@5014:   _sparse_iter(&hrrs->_other_regions._sparse_table) {}
ysr@777: 
ysr@777: bool HeapRegionRemSetIterator::coarse_has_next(size_t& card_index) {
ysr@777:   if (_hrrs->_other_regions._n_coarse_entries == 0) return false;
ysr@777:   // Go to the next card.
ysr@777:   _coarse_cur_region_cur_card++;
ysr@777:   // Was the last the last card in the current region?
tonyp@1377:   if (_coarse_cur_region_cur_card == HeapRegion::CardsPerRegion) {
ysr@777:     // Yes: find the next region.  This may leave _coarse_cur_region_index
ysr@777:     // Set to the last index, in which case there are no more coarse
ysr@777:     // regions.
ysr@777:     _coarse_cur_region_index =
ysr@777:       (int) _coarse_map->get_next_one_offset(_coarse_cur_region_index + 1);
ysr@777:     if ((size_t)_coarse_cur_region_index < _coarse_map->size()) {
ysr@777:       _coarse_cur_region_cur_card = 0;
ysr@777:       HeapWord* r_bot =
tonyp@3713:         _g1h->region_at((uint) _coarse_cur_region_index)->bottom();
ysr@777:       _cur_region_card_offset = _bosa->index_for(r_bot);
ysr@777:     } else {
ysr@777:       return false;
ysr@777:     }
ysr@777:   }
ysr@777:   // If we didn't return false above, then we can yield a card.
ysr@777:   card_index = _cur_region_card_offset + _coarse_cur_region_cur_card;
ysr@777:   return true;
ysr@777: }
ysr@777: 
ysr@777: bool HeapRegionRemSetIterator::fine_has_next(size_t& card_index) {
ysr@777:   if (fine_has_next()) {
tschatzl@6927:     _cur_card_in_prt =
tschatzl@6927:       _fine_cur_prt->_bm.get_next_one_offset(_cur_card_in_prt + 1);
ysr@777:   }
tschatzl@6927:   if (_cur_card_in_prt == HeapRegion::CardsPerRegion) {
tschatzl@6927:     // _fine_cur_prt may still be NULL in case if there are not PRTs at all for
tschatzl@6927:     // the remembered set.
tschatzl@6927:     if (_fine_cur_prt == NULL || _fine_cur_prt->next() == NULL) {
tschatzl@6927:       return false;
ysr@777:     }
tschatzl@6927:     PerRegionTable* next_prt = _fine_cur_prt->next();
tschatzl@6927:     switch_to_prt(next_prt);
tschatzl@6927:     _cur_card_in_prt = _fine_cur_prt->_bm.get_next_one_offset(_cur_card_in_prt + 1);
ysr@777:   }
tschatzl@6927: 
tschatzl@6927:   card_index = _cur_region_card_offset + _cur_card_in_prt;
tschatzl@6927:   guarantee(_cur_card_in_prt < HeapRegion::CardsPerRegion,
kevinw@9327:             err_msg("Card index " SIZE_FORMAT " must be within the region", _cur_card_in_prt));
ysr@777:   return true;
ysr@777: }
ysr@777: 
ysr@777: bool HeapRegionRemSetIterator::fine_has_next() {
tschatzl@6927:   return _cur_card_in_prt != HeapRegion::CardsPerRegion;
tschatzl@6927: }
tschatzl@6927: 
tschatzl@6927: void HeapRegionRemSetIterator::switch_to_prt(PerRegionTable* prt) {
tschatzl@6927:   assert(prt != NULL, "Cannot switch to NULL prt");
tschatzl@6927:   _fine_cur_prt = prt;
tschatzl@6927: 
tschatzl@6927:   HeapWord* r_bot = _fine_cur_prt->hr()->bottom();
tschatzl@6927:   _cur_region_card_offset = _bosa->index_for(r_bot);
tschatzl@6927: 
tschatzl@6927:   // The bitmap scan for the PRT always scans from _cur_region_cur_card + 1.
tschatzl@6927:   // To avoid special-casing this start case, and not miss the first bitmap
tschatzl@6927:   // entry, initialize _cur_region_cur_card with -1 instead of 0.
tschatzl@6927:   _cur_card_in_prt = (size_t)-1;
ysr@777: }
ysr@777: 
ysr@777: bool HeapRegionRemSetIterator::has_next(size_t& card_index) {
ysr@777:   switch (_is) {
tschatzl@6927:   case Sparse: {
ysr@777:     if (_sparse_iter.has_next(card_index)) {
ysr@777:       _n_yielded_sparse++;
ysr@777:       return true;
ysr@777:     }
ysr@777:     // Otherwise, deliberate fall-through
ysr@777:     _is = Fine;
tschatzl@6927:     PerRegionTable* initial_fine_prt = _hrrs->_other_regions._first_all_fine_prts;
tschatzl@6927:     if (initial_fine_prt != NULL) {
tschatzl@6927:       switch_to_prt(_hrrs->_other_regions._first_all_fine_prts);
tschatzl@6927:     }
tschatzl@6927:   }
ysr@777:   case Fine:
ysr@777:     if (fine_has_next(card_index)) {
ysr@777:       _n_yielded_fine++;
ysr@777:       return true;
ysr@777:     }
ysr@777:     // Otherwise, deliberate fall-through
ysr@777:     _is = Coarse;
ysr@777:   case Coarse:
ysr@777:     if (coarse_has_next(card_index)) {
ysr@777:       _n_yielded_coarse++;
ysr@777:       return true;
ysr@777:     }
ysr@777:     // Otherwise...
ysr@777:     break;
ysr@777:   }
ysr@777:   assert(ParallelGCThreads > 1 ||
ysr@777:          n_yielded() == _hrrs->occupied(),
ysr@777:          "Should have yielded all the cards in the rem set "
ysr@777:          "(in the non-par case).");
ysr@777:   return false;
ysr@777: }
ysr@777: 
ysr@777: 
ysr@777: 
ysr@1280: OopOrNarrowOopStar* HeapRegionRemSet::_recorded_oops = NULL;
ysr@1280: HeapWord**          HeapRegionRemSet::_recorded_cards = NULL;
ysr@1280: HeapRegion**        HeapRegionRemSet::_recorded_regions = NULL;
ysr@1280: int                 HeapRegionRemSet::_n_recorded = 0;
ysr@777: 
ysr@777: HeapRegionRemSet::Event* HeapRegionRemSet::_recorded_events = NULL;
ysr@777: int*         HeapRegionRemSet::_recorded_event_index = NULL;
ysr@777: int          HeapRegionRemSet::_n_recorded_events = 0;
ysr@777: 
ysr@1280: void HeapRegionRemSet::record(HeapRegion* hr, OopOrNarrowOopStar f) {
ysr@777:   if (_recorded_oops == NULL) {
ysr@777:     assert(_n_recorded == 0
ysr@777:            && _recorded_cards == NULL
ysr@777:            && _recorded_regions == NULL,
ysr@777:            "Inv");
zgu@3900:     _recorded_oops    = NEW_C_HEAP_ARRAY(OopOrNarrowOopStar, MaxRecorded, mtGC);
zgu@3900:     _recorded_cards   = NEW_C_HEAP_ARRAY(HeapWord*,          MaxRecorded, mtGC);
zgu@3900:     _recorded_regions = NEW_C_HEAP_ARRAY(HeapRegion*,        MaxRecorded, mtGC);
ysr@777:   }
ysr@777:   if (_n_recorded == MaxRecorded) {
ysr@777:     gclog_or_tty->print_cr("Filled up 'recorded' (%d).", MaxRecorded);
ysr@777:   } else {
ysr@777:     _recorded_cards[_n_recorded] =
ysr@777:       (HeapWord*)align_size_down(uintptr_t(f),
ysr@777:                                  CardTableModRefBS::card_size);
ysr@777:     _recorded_oops[_n_recorded] = f;
ysr@777:     _recorded_regions[_n_recorded] = hr;
ysr@777:     _n_recorded++;
ysr@777:   }
ysr@777: }
ysr@777: 
ysr@777: void HeapRegionRemSet::record_event(Event evnt) {
ysr@777:   if (!G1RecordHRRSEvents) return;
ysr@777: 
ysr@777:   if (_recorded_events == NULL) {
ysr@777:     assert(_n_recorded_events == 0
ysr@777:            && _recorded_event_index == NULL,
ysr@777:            "Inv");
zgu@3900:     _recorded_events = NEW_C_HEAP_ARRAY(Event, MaxRecordedEvents, mtGC);
zgu@3900:     _recorded_event_index = NEW_C_HEAP_ARRAY(int, MaxRecordedEvents, mtGC);
ysr@777:   }
ysr@777:   if (_n_recorded_events == MaxRecordedEvents) {
ysr@777:     gclog_or_tty->print_cr("Filled up 'recorded_events' (%d).", MaxRecordedEvents);
ysr@777:   } else {
ysr@777:     _recorded_events[_n_recorded_events] = evnt;
ysr@777:     _recorded_event_index[_n_recorded_events] = _n_recorded;
ysr@777:     _n_recorded_events++;
ysr@777:   }
ysr@777: }
ysr@777: 
ysr@777: void HeapRegionRemSet::print_event(outputStream* str, Event evnt) {
ysr@777:   switch (evnt) {
ysr@777:   case Event_EvacStart:
ysr@777:     str->print("Evac Start");
ysr@777:     break;
ysr@777:   case Event_EvacEnd:
ysr@777:     str->print("Evac End");
ysr@777:     break;
ysr@777:   case Event_RSUpdateEnd:
ysr@777:     str->print("RS Update End");
ysr@777:     break;
ysr@777:   }
ysr@777: }
ysr@777: 
ysr@777: void HeapRegionRemSet::print_recorded() {
ysr@777:   int cur_evnt = 0;
csahu@8316:   Event cur_evnt_kind = Event_illegal;
ysr@777:   int cur_evnt_ind = 0;
ysr@777:   if (_n_recorded_events > 0) {
ysr@777:     cur_evnt_kind = _recorded_events[cur_evnt];
ysr@777:     cur_evnt_ind = _recorded_event_index[cur_evnt];
ysr@777:   }
ysr@777: 
ysr@777:   for (int i = 0; i < _n_recorded; i++) {
ysr@777:     while (cur_evnt < _n_recorded_events && i == cur_evnt_ind) {
ysr@777:       gclog_or_tty->print("Event: ");
ysr@777:       print_event(gclog_or_tty, cur_evnt_kind);
drchase@6680:       gclog_or_tty->cr();
ysr@777:       cur_evnt++;
ysr@777:       if (cur_evnt < MaxRecordedEvents) {
ysr@777:         cur_evnt_kind = _recorded_events[cur_evnt];
ysr@777:         cur_evnt_ind = _recorded_event_index[cur_evnt];
ysr@777:       }
ysr@777:     }
ysr@777:     gclog_or_tty->print("Added card " PTR_FORMAT " to region [" PTR_FORMAT "...]"
ysr@777:                         " for ref " PTR_FORMAT ".\n",
ysr@777:                         _recorded_cards[i], _recorded_regions[i]->bottom(),
ysr@777:                         _recorded_oops[i]);
ysr@777:   }
ysr@777: }
ysr@777: 
tonyp@2493: void HeapRegionRemSet::reset_for_cleanup_tasks() {
tonyp@2493:   SparsePRT::reset_for_cleanup_tasks();
tonyp@2493: }
tonyp@2493: 
tonyp@2493: void HeapRegionRemSet::do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task) {
tonyp@2493:   _other_regions.do_cleanup_work(hrrs_cleanup_task);
tonyp@2493: }
tonyp@2493: 
tonyp@2493: void
tonyp@2493: HeapRegionRemSet::finish_cleanup_task(HRRSCleanupTask* hrrs_cleanup_task) {
tonyp@2493:   SparsePRT::finish_cleanup_task(hrrs_cleanup_task);
tonyp@2493: }
tonyp@2493: 
ysr@777: #ifndef PRODUCT
tschatzl@5165: void PerRegionTable::test_fl_mem_size() {
tschatzl@5165:   PerRegionTable* dummy = alloc(NULL);
tschatzl@6932: 
tschatzl@6932:   size_t min_prt_size = sizeof(void*) + dummy->bm()->size_in_words() * HeapWordSize;
tschatzl@6932:   assert(dummy->mem_size() > min_prt_size,
kevinw@9327:          err_msg("PerRegionTable memory usage is suspiciously small, only has " SIZE_FORMAT " bytes. "
kevinw@9327:                  "Should be at least " SIZE_FORMAT " bytes.", dummy->mem_size(), min_prt_size));
tschatzl@5165:   free(dummy);
tschatzl@5165:   guarantee(dummy->mem_size() == fl_mem_size(), "fl_mem_size() does not return the correct element size");
tschatzl@5165:   // try to reset the state
tschatzl@5165:   _free_list = NULL;
tschatzl@5165:   delete dummy;
tschatzl@5165: }
tschatzl@5165: 
tschatzl@5165: void HeapRegionRemSet::test_prt() {
tschatzl@5165:   PerRegionTable::test_fl_mem_size();
tschatzl@5165: }
tschatzl@5165: 
ysr@777: void HeapRegionRemSet::test() {
ysr@777:   os::sleep(Thread::current(), (jlong)5000, false);
ysr@777:   G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@777: 
iveresov@1696:   // Run with "-XX:G1LogRSetRegionEntries=2", so that 1 and 5 end up in same
ysr@777:   // hash bucket.
ysr@777:   HeapRegion* hr0 = g1h->region_at(0);
ysr@777:   HeapRegion* hr1 = g1h->region_at(1);
ysr@777:   HeapRegion* hr2 = g1h->region_at(5);
ysr@777:   HeapRegion* hr3 = g1h->region_at(6);
ysr@777:   HeapRegion* hr4 = g1h->region_at(7);
ysr@777:   HeapRegion* hr5 = g1h->region_at(8);
ysr@777: 
ysr@777:   HeapWord* hr1_start = hr1->bottom();
ysr@777:   HeapWord* hr1_mid = hr1_start + HeapRegion::GrainWords/2;
ysr@777:   HeapWord* hr1_last = hr1->end() - 1;
ysr@777: 
ysr@777:   HeapWord* hr2_start = hr2->bottom();
ysr@777:   HeapWord* hr2_mid = hr2_start + HeapRegion::GrainWords/2;
ysr@777:   HeapWord* hr2_last = hr2->end() - 1;
ysr@777: 
ysr@777:   HeapWord* hr3_start = hr3->bottom();
ysr@777:   HeapWord* hr3_mid = hr3_start + HeapRegion::GrainWords/2;
ysr@777:   HeapWord* hr3_last = hr3->end() - 1;
ysr@777: 
ysr@777:   HeapRegionRemSet* hrrs = hr0->rem_set();
ysr@777: 
ysr@777:   // Make three references from region 0x101...
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr1_start);
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr1_mid);
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr1_last);
ysr@777: 
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr2_start);
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr2_mid);
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr2_last);
ysr@777: 
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr3_start);
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr3_mid);
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr3_last);
ysr@777: 
ysr@777:   // Now cause a coarsening.
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr4->bottom());
ysr@1280:   hrrs->add_reference((OopOrNarrowOopStar)hr5->bottom());
ysr@777: 
ysr@777:   // Now, does iteration yield these three?
johnc@5014:   HeapRegionRemSetIterator iter(hrrs);
ysr@777:   size_t sum = 0;
ysr@777:   size_t card_index;
ysr@777:   while (iter.has_next(card_index)) {
ysr@777:     HeapWord* card_start =
ysr@777:       G1CollectedHeap::heap()->bot_shared()->address_for_index(card_index);
ysr@777:     gclog_or_tty->print_cr("  Card " PTR_FORMAT ".", card_start);
ysr@777:     sum++;
ysr@777:   }
ysr@777:   guarantee(sum == 11 - 3 + 2048, "Failure");
ysr@777:   guarantee(sum == hrrs->occupied(), "Failure");
ysr@777: }
ysr@777: #endif