1 /* 2 * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "gc_implementation/g1/heapRegion.hpp" 27 #include "gc_implementation/g1/heapRegionRemSet.hpp" 28 #include "gc_implementation/g1/sparsePRT.hpp" 29 #include "memory/allocation.inline.hpp" 30 #include "memory/cardTableModRefBS.hpp" 31 #include "memory/space.inline.hpp" 32 #include "runtime/mutexLocker.hpp" 33 34 #define SPARSE_PRT_VERBOSE 0 35 36 #define UNROLL_CARD_LOOPS 1 37 38 void SparsePRTEntry::init(RegionIdx_t region_ind) { 39 _region_ind = region_ind; 40 _next_index = NullEntry; 41 42 #if UNROLL_CARD_LOOPS 43 assert((cards_num() & (UnrollFactor - 1)) == 0, "Invalid number of cards in the entry"); 44 for (int i = 0; i < cards_num(); i += UnrollFactor) { 45 _cards[i] = NullEntry; 46 _cards[i + 1] = NullEntry; 47 _cards[i + 2] = NullEntry; 48 _cards[i + 3] = NullEntry; 49 } 50 #else 51 for (int i = 0; i < cards_num(); i++) 52 _cards[i] = NullEntry; 53 #endif 54 } 55 56 bool SparsePRTEntry::contains_card(CardIdx_t card_index) const { 57 #if UNROLL_CARD_LOOPS 58 assert((cards_num() & (UnrollFactor - 1)) == 0, "Invalid number of cards in the entry"); 59 for (int i = 0; i < cards_num(); i += UnrollFactor) { 60 if (_cards[i] == card_index || 61 _cards[i + 1] == card_index || 62 _cards[i + 2] == card_index || 63 _cards[i + 3] == card_index) return true; 64 } 65 #else 66 for (int i = 0; i < cards_num(); i++) { 67 if (_cards[i] == card_index) return true; 68 } 69 #endif 70 // Otherwise, we're full. 71 return false; 72 } 73 74 int SparsePRTEntry::num_valid_cards() const { 75 int sum = 0; 76 #if UNROLL_CARD_LOOPS 77 assert((cards_num() & (UnrollFactor - 1)) == 0, "Invalid number of cards in the entry"); 78 for (int i = 0; i < cards_num(); i += UnrollFactor) { 79 sum += (_cards[i] != NullEntry); 80 sum += (_cards[i + 1] != NullEntry); 81 sum += (_cards[i + 2] != NullEntry); 82 sum += (_cards[i + 3] != NullEntry); 83 } 84 #else 85 for (int i = 0; i < cards_num(); i++) { 86 sum += (_cards[i] != NullEntry); 87 } 88 #endif 89 // Otherwise, we're full. 90 return sum; 91 } 92 93 SparsePRTEntry::AddCardResult SparsePRTEntry::add_card(CardIdx_t card_index) { 94 #if UNROLL_CARD_LOOPS 95 assert((cards_num() & (UnrollFactor - 1)) == 0, "Invalid number of cards in the entry"); 96 CardIdx_t c; 97 for (int i = 0; i < cards_num(); i += UnrollFactor) { 98 c = _cards[i]; 99 if (c == card_index) return found; 100 if (c == NullEntry) { _cards[i] = card_index; return added; } 101 c = _cards[i + 1]; 102 if (c == card_index) return found; 103 if (c == NullEntry) { _cards[i + 1] = card_index; return added; } 104 c = _cards[i + 2]; 105 if (c == card_index) return found; 106 if (c == NullEntry) { _cards[i + 2] = card_index; return added; } 107 c = _cards[i + 3]; 108 if (c == card_index) return found; 109 if (c == NullEntry) { _cards[i + 3] = card_index; return added; } 110 } 111 #else 112 for (int i = 0; i < cards_num(); i++) { 113 CardIdx_t c = _cards[i]; 114 if (c == card_index) return found; 115 if (c == NullEntry) { _cards[i] = card_index; return added; } 116 } 117 #endif 118 // Otherwise, we're full. 119 return overflow; 120 } 121 122 void SparsePRTEntry::copy_cards(CardIdx_t* cards) const { 123 #if UNROLL_CARD_LOOPS 124 assert((cards_num() & (UnrollFactor - 1)) == 0, "Invalid number of cards in the entry"); 125 for (int i = 0; i < cards_num(); i += UnrollFactor) { 126 cards[i] = _cards[i]; 127 cards[i + 1] = _cards[i + 1]; 128 cards[i + 2] = _cards[i + 2]; 129 cards[i + 3] = _cards[i + 3]; 130 } 131 #else 132 for (int i = 0; i < cards_num(); i++) { 133 cards[i] = _cards[i]; 134 } 135 #endif 136 } 137 138 void SparsePRTEntry::copy_cards(SparsePRTEntry* e) const { 139 copy_cards(&e->_cards[0]); 140 } 141 142 // ---------------------------------------------------------------------- 143 144 RSHashTable::RSHashTable(size_t capacity) : 145 _capacity(capacity), _capacity_mask(capacity-1), 146 _occupied_entries(0), _occupied_cards(0), 147 _entries((SparsePRTEntry*)NEW_C_HEAP_ARRAY(char, SparsePRTEntry::size() * capacity, mtGC)), 148 _buckets(NEW_C_HEAP_ARRAY(int, capacity, mtGC)), 149 _free_list(NullEntry), _free_region(0) 150 { 151 clear(); 152 } 153 154 RSHashTable::~RSHashTable() { 155 if (_entries != NULL) { 156 FREE_C_HEAP_ARRAY(SparsePRTEntry, _entries, mtGC); 157 _entries = NULL; 158 } 159 if (_buckets != NULL) { 160 FREE_C_HEAP_ARRAY(int, _buckets, mtGC); 161 _buckets = NULL; 162 } 163 } 164 165 void RSHashTable::clear() { 166 _occupied_entries = 0; 167 _occupied_cards = 0; 168 guarantee(_entries != NULL, "INV"); 169 guarantee(_buckets != NULL, "INV"); 170 171 guarantee(_capacity <= ((size_t)1 << (sizeof(int)*BitsPerByte-1)) - 1, 172 "_capacity too large"); 173 174 // This will put -1 == NullEntry in the key field of all entries. 175 memset(_entries, NullEntry, _capacity * SparsePRTEntry::size()); 176 memset(_buckets, NullEntry, _capacity * sizeof(int)); 177 _free_list = NullEntry; 178 _free_region = 0; 179 } 180 181 bool RSHashTable::add_card(RegionIdx_t region_ind, CardIdx_t card_index) { 182 SparsePRTEntry* e = entry_for_region_ind_create(region_ind); 183 assert(e != NULL && e->r_ind() == region_ind, 184 "Postcondition of call above."); 185 SparsePRTEntry::AddCardResult res = e->add_card(card_index); 186 if (res == SparsePRTEntry::added) _occupied_cards++; 187 #if SPARSE_PRT_VERBOSE 188 gclog_or_tty->print_cr(" after add_card[%d]: valid-cards = %d.", 189 pointer_delta(e, _entries, SparsePRTEntry::size()), 190 e->num_valid_cards()); 191 #endif 192 assert(e->num_valid_cards() > 0, "Postcondition"); 193 return res != SparsePRTEntry::overflow; 194 } 195 196 bool RSHashTable::get_cards(RegionIdx_t region_ind, CardIdx_t* cards) { 197 198 SparsePRTEntry* entry = get_entry(region_ind); 199 if (entry == NULL) { 200 return false; 201 } 202 // Otherwise... 203 entry->copy_cards(cards); 204 return true; 205 } 206 207 SparsePRTEntry* RSHashTable::get_entry(RegionIdx_t region_ind) const { 208 int ind = (int) (region_ind & capacity_mask()); 209 int cur_ind = _buckets[ind]; 210 SparsePRTEntry* cur; 211 while (cur_ind != NullEntry && 212 (cur = entry(cur_ind))->r_ind() != region_ind) { 213 cur_ind = cur->next_index(); 214 } 215 216 if (cur_ind == NullEntry) return NULL; 217 // Otherwise... 218 assert(cur->r_ind() == region_ind, "Postcondition of loop + test above."); 219 assert(cur->num_valid_cards() > 0, "Inv"); 220 return cur; 221 } 222 223 bool RSHashTable::delete_entry(RegionIdx_t region_ind) { 224 int ind = (int) (region_ind & capacity_mask()); 225 int* prev_loc = &_buckets[ind]; 226 int cur_ind = *prev_loc; 227 SparsePRTEntry* cur; 228 while (cur_ind != NullEntry && 229 (cur = entry(cur_ind))->r_ind() != region_ind) { 230 prev_loc = cur->next_index_addr(); 231 cur_ind = *prev_loc; 232 } 233 234 if (cur_ind == NullEntry) return false; 235 // Otherwise, splice out "cur". 236 *prev_loc = cur->next_index(); 237 _occupied_cards -= cur->num_valid_cards(); 238 free_entry(cur_ind); 239 _occupied_entries--; 240 return true; 241 } 242 243 SparsePRTEntry* 244 RSHashTable::entry_for_region_ind_create(RegionIdx_t region_ind) { 245 SparsePRTEntry* res = get_entry(region_ind); 246 if (res == NULL) { 247 int new_ind = alloc_entry(); 248 assert(0 <= new_ind && (size_t)new_ind < capacity(), "There should be room."); 249 res = entry(new_ind); 250 res->init(region_ind); 251 // Insert at front. 252 int ind = (int) (region_ind & capacity_mask()); 253 res->set_next_index(_buckets[ind]); 254 _buckets[ind] = new_ind; 255 _occupied_entries++; 256 } 257 return res; 258 } 259 260 int RSHashTable::alloc_entry() { 261 int res; 262 if (_free_list != NullEntry) { 263 res = _free_list; 264 _free_list = entry(res)->next_index(); 265 return res; 266 } else if ((size_t) _free_region+1 < capacity()) { 267 res = _free_region; 268 _free_region++; 269 return res; 270 } else { 271 return NullEntry; 272 } 273 } 274 275 void RSHashTable::free_entry(int fi) { 276 entry(fi)->set_next_index(_free_list); 277 _free_list = fi; 278 } 279 280 void RSHashTable::add_entry(SparsePRTEntry* e) { 281 assert(e->num_valid_cards() > 0, "Precondition."); 282 SparsePRTEntry* e2 = entry_for_region_ind_create(e->r_ind()); 283 e->copy_cards(e2); 284 _occupied_cards += e2->num_valid_cards(); 285 assert(e2->num_valid_cards() > 0, "Postcondition."); 286 } 287 288 CardIdx_t RSHashTableIter::find_first_card_in_list() { 289 CardIdx_t res; 290 while (_bl_ind != RSHashTable::NullEntry) { 291 res = _rsht->entry(_bl_ind)->card(0); 292 if (res != SparsePRTEntry::NullEntry) { 293 return res; 294 } else { 295 _bl_ind = _rsht->entry(_bl_ind)->next_index(); 296 } 297 } 298 // Otherwise, none found: 299 return SparsePRTEntry::NullEntry; 300 } 301 302 size_t RSHashTableIter::compute_card_ind(CardIdx_t ci) { 303 return (_rsht->entry(_bl_ind)->r_ind() * HeapRegion::CardsPerRegion) + ci; 304 } 305 306 bool RSHashTableIter::has_next(size_t& card_index) { 307 _card_ind++; 308 CardIdx_t ci; 309 if (_card_ind < SparsePRTEntry::cards_num() && 310 ((ci = _rsht->entry(_bl_ind)->card(_card_ind)) != 311 SparsePRTEntry::NullEntry)) { 312 card_index = compute_card_ind(ci); 313 return true; 314 } 315 // Otherwise, must find the next valid entry. 316 _card_ind = 0; 317 318 if (_bl_ind != RSHashTable::NullEntry) { 319 _bl_ind = _rsht->entry(_bl_ind)->next_index(); 320 ci = find_first_card_in_list(); 321 if (ci != SparsePRTEntry::NullEntry) { 322 card_index = compute_card_ind(ci); 323 return true; 324 } 325 } 326 // If we didn't return above, must go to the next non-null table index. 327 _tbl_ind++; 328 while ((size_t)_tbl_ind < _rsht->capacity()) { 329 _bl_ind = _rsht->_buckets[_tbl_ind]; 330 ci = find_first_card_in_list(); 331 if (ci != SparsePRTEntry::NullEntry) { 332 card_index = compute_card_ind(ci); 333 return true; 334 } 335 // Otherwise, try next entry. 336 _tbl_ind++; 337 } 338 // Otherwise, there were no entry. 339 return false; 340 } 341 342 bool RSHashTable::contains_card(RegionIdx_t region_index, CardIdx_t card_index) const { 343 SparsePRTEntry* e = get_entry(region_index); 344 return (e != NULL && e->contains_card(card_index)); 345 } 346 347 size_t RSHashTable::mem_size() const { 348 return sizeof(RSHashTable) + 349 capacity() * (SparsePRTEntry::size() + sizeof(int)); 350 } 351 352 // ---------------------------------------------------------------------- 353 354 SparsePRT* SparsePRT::_head_expanded_list = NULL; 355 356 void SparsePRT::add_to_expanded_list(SparsePRT* sprt) { 357 // We could expand multiple times in a pause -- only put on list once. 358 if (sprt->expanded()) return; 359 sprt->set_expanded(true); 360 SparsePRT* hd = _head_expanded_list; 361 while (true) { 362 sprt->_next_expanded = hd; 363 SparsePRT* res = 364 (SparsePRT*) 365 Atomic::cmpxchg_ptr(sprt, &_head_expanded_list, hd); 366 if (res == hd) return; 367 else hd = res; 368 } 369 } 370 371 372 SparsePRT* SparsePRT::get_from_expanded_list() { 373 SparsePRT* hd = _head_expanded_list; 374 while (hd != NULL) { 375 SparsePRT* next = hd->next_expanded(); 376 SparsePRT* res = 377 (SparsePRT*) 378 Atomic::cmpxchg_ptr(next, &_head_expanded_list, hd); 379 if (res == hd) { 380 hd->set_next_expanded(NULL); 381 return hd; 382 } else { 383 hd = res; 384 } 385 } 386 return NULL; 387 } 388 389 void SparsePRT::reset_for_cleanup_tasks() { 390 _head_expanded_list = NULL; 391 } 392 393 void SparsePRT::do_cleanup_work(SparsePRTCleanupTask* sprt_cleanup_task) { 394 if (should_be_on_expanded_list()) { 395 sprt_cleanup_task->add(this); 396 } 397 } 398 399 void SparsePRT::finish_cleanup_task(SparsePRTCleanupTask* sprt_cleanup_task) { 400 assert(ParGCRareEvent_lock->owned_by_self(), "pre-condition"); 401 SparsePRT* head = sprt_cleanup_task->head(); 402 SparsePRT* tail = sprt_cleanup_task->tail(); 403 if (head != NULL) { 404 assert(tail != NULL, "if head is not NULL, so should tail"); 405 406 tail->set_next_expanded(_head_expanded_list); 407 _head_expanded_list = head; 408 } else { 409 assert(tail == NULL, "if head is NULL, so should tail"); 410 } 411 } 412 413 bool SparsePRT::should_be_on_expanded_list() { 414 if (_expanded) { 415 assert(_cur != _next, "if _expanded is true, cur should be != _next"); 416 } else { 417 assert(_cur == _next, "if _expanded is false, cur should be == _next"); 418 } 419 return expanded(); 420 } 421 422 void SparsePRT::cleanup_all() { 423 // First clean up all expanded tables so they agree on next and cur. 424 SparsePRT* sprt = get_from_expanded_list(); 425 while (sprt != NULL) { 426 sprt->cleanup(); 427 sprt = get_from_expanded_list(); 428 } 429 } 430 431 432 SparsePRT::SparsePRT(HeapRegion* hr) : 433 _hr(hr), _expanded(false), _next_expanded(NULL) 434 { 435 _cur = new RSHashTable(InitialCapacity); 436 _next = _cur; 437 } 438 439 440 SparsePRT::~SparsePRT() { 441 assert(_next != NULL && _cur != NULL, "Inv"); 442 if (_cur != _next) { delete _cur; } 443 delete _next; 444 } 445 446 447 size_t SparsePRT::mem_size() const { 448 // We ignore "_cur" here, because it either = _next, or else it is 449 // on the deleted list. 450 return sizeof(SparsePRT) + _next->mem_size(); 451 } 452 453 bool SparsePRT::add_card(RegionIdx_t region_id, CardIdx_t card_index) { 454 #if SPARSE_PRT_VERBOSE 455 gclog_or_tty->print_cr(" Adding card %d from region %d to region %u sparse.", 456 card_index, region_id, _hr->hrs_index()); 457 #endif 458 if (_next->occupied_entries() * 2 > _next->capacity()) { 459 expand(); 460 } 461 return _next->add_card(region_id, card_index); 462 } 463 464 bool SparsePRT::get_cards(RegionIdx_t region_id, CardIdx_t* cards) { 465 return _next->get_cards(region_id, cards); 466 } 467 468 SparsePRTEntry* SparsePRT::get_entry(RegionIdx_t region_id) { 469 return _next->get_entry(region_id); 470 } 471 472 bool SparsePRT::delete_entry(RegionIdx_t region_id) { 473 return _next->delete_entry(region_id); 474 } 475 476 void SparsePRT::clear() { 477 // If they differ, _next is bigger then cur, so next has no chance of 478 // being the initial size. 479 if (_next != _cur) { 480 delete _next; 481 } 482 483 if (_cur->capacity() != InitialCapacity) { 484 delete _cur; 485 _cur = new RSHashTable(InitialCapacity); 486 } else { 487 _cur->clear(); 488 } 489 _next = _cur; 490 _expanded = false; 491 } 492 493 void SparsePRT::cleanup() { 494 // Make sure that the current and next tables agree. 495 if (_cur != _next) { 496 delete _cur; 497 } 498 _cur = _next; 499 set_expanded(false); 500 } 501 502 void SparsePRT::expand() { 503 RSHashTable* last = _next; 504 _next = new RSHashTable(last->capacity() * 2); 505 506 #if SPARSE_PRT_VERBOSE 507 gclog_or_tty->print_cr(" Expanded sparse table for %u to %d.", 508 _hr->hrs_index(), _next->capacity()); 509 #endif 510 for (size_t i = 0; i < last->capacity(); i++) { 511 SparsePRTEntry* e = last->entry((int)i); 512 if (e->valid_entry()) { 513 #if SPARSE_PRT_VERBOSE 514 gclog_or_tty->print_cr(" During expansion, transferred entry for %d.", 515 e->r_ind()); 516 #endif 517 _next->add_entry(e); 518 } 519 } 520 if (last != _cur) { 521 delete last; 522 } 523 add_to_expanded_list(this); 524 } 525 526 void SparsePRTCleanupTask::add(SparsePRT* sprt) { 527 assert(sprt->should_be_on_expanded_list(), "pre-condition"); 528 529 sprt->set_next_expanded(NULL); 530 if (_tail != NULL) { 531 _tail->set_next_expanded(sprt); 532 } else { 533 _head = sprt; 534 } 535 _tail = sprt; 536 }