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