Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp @ 642:660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
Summary: Use zero based compressed oops if java heap is below 32gb and unscaled compressed oops if java heap is below 4gb.
Reviewed-by: never, twisti, jcoomes, coleenp
| author | kvn |
|---|---|
| date | Thu, 12 Mar 2009 10:37:46 -0700 |
| parents | bcedf688d882 |
| children | bd441136a5ce |
| rev | line source |
|---|---|
| 342 | 1 /* |
| 470 | 2 * Copyright 2001-2008 Sun Microsystems, Inc. All Rights Reserved. |
| 342 | 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
| 20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
| 21 * have any questions. | |
| 22 * | |
| 23 */ | |
| 24 | |
| 25 #include "incls/_precompiled.incl" | |
| 26 #include "incls/_g1CollectedHeap.cpp.incl" | |
| 27 | |
| 28 // turn it on so that the contents of the young list (scan-only / | |
| 29 // to-be-collected) are printed at "strategic" points before / during | |
| 30 // / after the collection --- this is useful for debugging | |
| 31 #define SCAN_ONLY_VERBOSE 0 | |
| 32 // CURRENT STATUS | |
| 33 // This file is under construction. Search for "FIXME". | |
| 34 | |
| 35 // INVARIANTS/NOTES | |
| 36 // | |
| 37 // All allocation activity covered by the G1CollectedHeap interface is | |
| 38 // serialized by acquiring the HeapLock. This happens in | |
| 39 // mem_allocate_work, which all such allocation functions call. | |
| 40 // (Note that this does not apply to TLAB allocation, which is not part | |
| 41 // of this interface: it is done by clients of this interface.) | |
| 42 | |
| 43 // Local to this file. | |
| 44 | |
| 45 // Finds the first HeapRegion. | |
| 46 // No longer used, but might be handy someday. | |
| 47 | |
| 48 class FindFirstRegionClosure: public HeapRegionClosure { | |
| 49 HeapRegion* _a_region; | |
| 50 public: | |
| 51 FindFirstRegionClosure() : _a_region(NULL) {} | |
| 52 bool doHeapRegion(HeapRegion* r) { | |
| 53 _a_region = r; | |
| 54 return true; | |
| 55 } | |
| 56 HeapRegion* result() { return _a_region; } | |
| 57 }; | |
| 58 | |
| 59 | |
| 60 class RefineCardTableEntryClosure: public CardTableEntryClosure { | |
| 61 SuspendibleThreadSet* _sts; | |
| 62 G1RemSet* _g1rs; | |
| 63 ConcurrentG1Refine* _cg1r; | |
| 64 bool _concurrent; | |
| 65 public: | |
| 66 RefineCardTableEntryClosure(SuspendibleThreadSet* sts, | |
| 67 G1RemSet* g1rs, | |
| 68 ConcurrentG1Refine* cg1r) : | |
| 69 _sts(sts), _g1rs(g1rs), _cg1r(cg1r), _concurrent(true) | |
| 70 {} | |
| 71 bool do_card_ptr(jbyte* card_ptr, int worker_i) { | |
| 72 _g1rs->concurrentRefineOneCard(card_ptr, worker_i); | |
| 73 if (_concurrent && _sts->should_yield()) { | |
| 74 // Caller will actually yield. | |
| 75 return false; | |
| 76 } | |
| 77 // Otherwise, we finished successfully; return true. | |
| 78 return true; | |
| 79 } | |
| 80 void set_concurrent(bool b) { _concurrent = b; } | |
| 81 }; | |
| 82 | |
| 83 | |
| 84 class ClearLoggedCardTableEntryClosure: public CardTableEntryClosure { | |
| 85 int _calls; | |
| 86 G1CollectedHeap* _g1h; | |
| 87 CardTableModRefBS* _ctbs; | |
| 88 int _histo[256]; | |
| 89 public: | |
| 90 ClearLoggedCardTableEntryClosure() : | |
| 91 _calls(0) | |
| 92 { | |
| 93 _g1h = G1CollectedHeap::heap(); | |
| 94 _ctbs = (CardTableModRefBS*)_g1h->barrier_set(); | |
| 95 for (int i = 0; i < 256; i++) _histo[i] = 0; | |
| 96 } | |
| 97 bool do_card_ptr(jbyte* card_ptr, int worker_i) { | |
| 98 if (_g1h->is_in_reserved(_ctbs->addr_for(card_ptr))) { | |
| 99 _calls++; | |
| 100 unsigned char* ujb = (unsigned char*)card_ptr; | |
| 101 int ind = (int)(*ujb); | |
| 102 _histo[ind]++; | |
| 103 *card_ptr = -1; | |
| 104 } | |
| 105 return true; | |
| 106 } | |
| 107 int calls() { return _calls; } | |
| 108 void print_histo() { | |
| 109 gclog_or_tty->print_cr("Card table value histogram:"); | |
| 110 for (int i = 0; i < 256; i++) { | |
| 111 if (_histo[i] != 0) { | |
| 112 gclog_or_tty->print_cr(" %d: %d", i, _histo[i]); | |
| 113 } | |
| 114 } | |
| 115 } | |
| 116 }; | |
| 117 | |
| 118 class RedirtyLoggedCardTableEntryClosure: public CardTableEntryClosure { | |
| 119 int _calls; | |
| 120 G1CollectedHeap* _g1h; | |
| 121 CardTableModRefBS* _ctbs; | |
| 122 public: | |
| 123 RedirtyLoggedCardTableEntryClosure() : | |
| 124 _calls(0) | |
| 125 { | |
| 126 _g1h = G1CollectedHeap::heap(); | |
| 127 _ctbs = (CardTableModRefBS*)_g1h->barrier_set(); | |
| 128 } | |
| 129 bool do_card_ptr(jbyte* card_ptr, int worker_i) { | |
| 130 if (_g1h->is_in_reserved(_ctbs->addr_for(card_ptr))) { | |
| 131 _calls++; | |
| 132 *card_ptr = 0; | |
| 133 } | |
| 134 return true; | |
| 135 } | |
| 136 int calls() { return _calls; } | |
| 137 }; | |
| 138 | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
139 class RedirtyLoggedCardTableEntryFastClosure : public CardTableEntryClosure { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
140 public: |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
141 bool do_card_ptr(jbyte* card_ptr, int worker_i) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
142 *card_ptr = CardTableModRefBS::dirty_card_val(); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
143 return true; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
144 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
145 }; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
146 |
| 342 | 147 YoungList::YoungList(G1CollectedHeap* g1h) |
| 148 : _g1h(g1h), _head(NULL), | |
| 149 _scan_only_head(NULL), _scan_only_tail(NULL), _curr_scan_only(NULL), | |
| 150 _length(0), _scan_only_length(0), | |
| 151 _last_sampled_rs_lengths(0), | |
| 545 | 152 _survivor_head(NULL), _survivor_tail(NULL), _survivor_length(0) |
| 342 | 153 { |
| 154 guarantee( check_list_empty(false), "just making sure..." ); | |
| 155 } | |
| 156 | |
| 157 void YoungList::push_region(HeapRegion *hr) { | |
| 158 assert(!hr->is_young(), "should not already be young"); | |
| 159 assert(hr->get_next_young_region() == NULL, "cause it should!"); | |
| 160 | |
| 161 hr->set_next_young_region(_head); | |
| 162 _head = hr; | |
| 163 | |
| 164 hr->set_young(); | |
| 165 double yg_surv_rate = _g1h->g1_policy()->predict_yg_surv_rate((int)_length); | |
| 166 ++_length; | |
| 167 } | |
| 168 | |
| 169 void YoungList::add_survivor_region(HeapRegion* hr) { | |
| 545 | 170 assert(hr->is_survivor(), "should be flagged as survivor region"); |
| 342 | 171 assert(hr->get_next_young_region() == NULL, "cause it should!"); |
| 172 | |
| 173 hr->set_next_young_region(_survivor_head); | |
| 174 if (_survivor_head == NULL) { | |
| 545 | 175 _survivor_tail = hr; |
| 342 | 176 } |
| 177 _survivor_head = hr; | |
| 178 | |
| 179 ++_survivor_length; | |
| 180 } | |
| 181 | |
| 182 HeapRegion* YoungList::pop_region() { | |
| 183 while (_head != NULL) { | |
| 184 assert( length() > 0, "list should not be empty" ); | |
| 185 HeapRegion* ret = _head; | |
| 186 _head = ret->get_next_young_region(); | |
| 187 ret->set_next_young_region(NULL); | |
| 188 --_length; | |
| 189 assert(ret->is_young(), "region should be very young"); | |
| 190 | |
| 191 // Replace 'Survivor' region type with 'Young'. So the region will | |
| 192 // be treated as a young region and will not be 'confused' with | |
| 193 // newly created survivor regions. | |
| 194 if (ret->is_survivor()) { | |
| 195 ret->set_young(); | |
| 196 } | |
| 197 | |
| 198 if (!ret->is_scan_only()) { | |
| 199 return ret; | |
| 200 } | |
| 201 | |
| 202 // scan-only, we'll add it to the scan-only list | |
| 203 if (_scan_only_tail == NULL) { | |
| 204 guarantee( _scan_only_head == NULL, "invariant" ); | |
| 205 | |
| 206 _scan_only_head = ret; | |
| 207 _curr_scan_only = ret; | |
| 208 } else { | |
| 209 guarantee( _scan_only_head != NULL, "invariant" ); | |
| 210 _scan_only_tail->set_next_young_region(ret); | |
| 211 } | |
| 212 guarantee( ret->get_next_young_region() == NULL, "invariant" ); | |
| 213 _scan_only_tail = ret; | |
| 214 | |
| 215 // no need to be tagged as scan-only any more | |
| 216 ret->set_young(); | |
| 217 | |
| 218 ++_scan_only_length; | |
| 219 } | |
| 220 assert( length() == 0, "list should be empty" ); | |
| 221 return NULL; | |
| 222 } | |
| 223 | |
| 224 void YoungList::empty_list(HeapRegion* list) { | |
| 225 while (list != NULL) { | |
| 226 HeapRegion* next = list->get_next_young_region(); | |
| 227 list->set_next_young_region(NULL); | |
| 228 list->uninstall_surv_rate_group(); | |
| 229 list->set_not_young(); | |
| 230 list = next; | |
| 231 } | |
| 232 } | |
| 233 | |
| 234 void YoungList::empty_list() { | |
| 235 assert(check_list_well_formed(), "young list should be well formed"); | |
| 236 | |
| 237 empty_list(_head); | |
| 238 _head = NULL; | |
| 239 _length = 0; | |
| 240 | |
| 241 empty_list(_scan_only_head); | |
| 242 _scan_only_head = NULL; | |
| 243 _scan_only_tail = NULL; | |
| 244 _scan_only_length = 0; | |
| 245 _curr_scan_only = NULL; | |
| 246 | |
| 247 empty_list(_survivor_head); | |
| 248 _survivor_head = NULL; | |
| 545 | 249 _survivor_tail = NULL; |
| 342 | 250 _survivor_length = 0; |
| 251 | |
| 252 _last_sampled_rs_lengths = 0; | |
| 253 | |
| 254 assert(check_list_empty(false), "just making sure..."); | |
| 255 } | |
| 256 | |
| 257 bool YoungList::check_list_well_formed() { | |
| 258 bool ret = true; | |
| 259 | |
| 260 size_t length = 0; | |
| 261 HeapRegion* curr = _head; | |
| 262 HeapRegion* last = NULL; | |
| 263 while (curr != NULL) { | |
| 264 if (!curr->is_young() || curr->is_scan_only()) { | |
| 265 gclog_or_tty->print_cr("### YOUNG REGION "PTR_FORMAT"-"PTR_FORMAT" " | |
| 266 "incorrectly tagged (%d, %d)", | |
| 267 curr->bottom(), curr->end(), | |
| 268 curr->is_young(), curr->is_scan_only()); | |
| 269 ret = false; | |
| 270 } | |
| 271 ++length; | |
| 272 last = curr; | |
| 273 curr = curr->get_next_young_region(); | |
| 274 } | |
| 275 ret = ret && (length == _length); | |
| 276 | |
| 277 if (!ret) { | |
| 278 gclog_or_tty->print_cr("### YOUNG LIST seems not well formed!"); | |
| 279 gclog_or_tty->print_cr("### list has %d entries, _length is %d", | |
| 280 length, _length); | |
| 281 } | |
| 282 | |
| 283 bool scan_only_ret = true; | |
| 284 length = 0; | |
| 285 curr = _scan_only_head; | |
| 286 last = NULL; | |
| 287 while (curr != NULL) { | |
| 288 if (!curr->is_young() || curr->is_scan_only()) { | |
| 289 gclog_or_tty->print_cr("### SCAN-ONLY REGION "PTR_FORMAT"-"PTR_FORMAT" " | |
| 290 "incorrectly tagged (%d, %d)", | |
| 291 curr->bottom(), curr->end(), | |
| 292 curr->is_young(), curr->is_scan_only()); | |
| 293 scan_only_ret = false; | |
| 294 } | |
| 295 ++length; | |
| 296 last = curr; | |
| 297 curr = curr->get_next_young_region(); | |
| 298 } | |
| 299 scan_only_ret = scan_only_ret && (length == _scan_only_length); | |
| 300 | |
| 301 if ( (last != _scan_only_tail) || | |
| 302 (_scan_only_head == NULL && _scan_only_tail != NULL) || | |
| 303 (_scan_only_head != NULL && _scan_only_tail == NULL) ) { | |
| 304 gclog_or_tty->print_cr("## _scan_only_tail is set incorrectly"); | |
| 305 scan_only_ret = false; | |
| 306 } | |
| 307 | |
| 308 if (_curr_scan_only != NULL && _curr_scan_only != _scan_only_head) { | |
| 309 gclog_or_tty->print_cr("### _curr_scan_only is set incorrectly"); | |
| 310 scan_only_ret = false; | |
| 311 } | |
| 312 | |
| 313 if (!scan_only_ret) { | |
| 314 gclog_or_tty->print_cr("### SCAN-ONLY LIST seems not well formed!"); | |
| 315 gclog_or_tty->print_cr("### list has %d entries, _scan_only_length is %d", | |
| 316 length, _scan_only_length); | |
| 317 } | |
| 318 | |
| 319 return ret && scan_only_ret; | |
| 320 } | |
| 321 | |
| 322 bool YoungList::check_list_empty(bool ignore_scan_only_list, | |
| 323 bool check_sample) { | |
| 324 bool ret = true; | |
| 325 | |
| 326 if (_length != 0) { | |
| 327 gclog_or_tty->print_cr("### YOUNG LIST should have 0 length, not %d", | |
| 328 _length); | |
| 329 ret = false; | |
| 330 } | |
| 331 if (check_sample && _last_sampled_rs_lengths != 0) { | |
| 332 gclog_or_tty->print_cr("### YOUNG LIST has non-zero last sampled RS lengths"); | |
| 333 ret = false; | |
| 334 } | |
| 335 if (_head != NULL) { | |
| 336 gclog_or_tty->print_cr("### YOUNG LIST does not have a NULL head"); | |
| 337 ret = false; | |
| 338 } | |
| 339 if (!ret) { | |
| 340 gclog_or_tty->print_cr("### YOUNG LIST does not seem empty"); | |
| 341 } | |
| 342 | |
| 343 if (ignore_scan_only_list) | |
| 344 return ret; | |
| 345 | |
| 346 bool scan_only_ret = true; | |
| 347 if (_scan_only_length != 0) { | |
| 348 gclog_or_tty->print_cr("### SCAN-ONLY LIST should have 0 length, not %d", | |
| 349 _scan_only_length); | |
| 350 scan_only_ret = false; | |
| 351 } | |
| 352 if (_scan_only_head != NULL) { | |
| 353 gclog_or_tty->print_cr("### SCAN-ONLY LIST does not have a NULL head"); | |
| 354 scan_only_ret = false; | |
| 355 } | |
| 356 if (_scan_only_tail != NULL) { | |
| 357 gclog_or_tty->print_cr("### SCAN-ONLY LIST does not have a NULL tail"); | |
| 358 scan_only_ret = false; | |
| 359 } | |
| 360 if (!scan_only_ret) { | |
| 361 gclog_or_tty->print_cr("### SCAN-ONLY LIST does not seem empty"); | |
| 362 } | |
| 363 | |
| 364 return ret && scan_only_ret; | |
| 365 } | |
| 366 | |
| 367 void | |
| 368 YoungList::rs_length_sampling_init() { | |
| 369 _sampled_rs_lengths = 0; | |
| 370 _curr = _head; | |
| 371 } | |
| 372 | |
| 373 bool | |
| 374 YoungList::rs_length_sampling_more() { | |
| 375 return _curr != NULL; | |
| 376 } | |
| 377 | |
| 378 void | |
| 379 YoungList::rs_length_sampling_next() { | |
| 380 assert( _curr != NULL, "invariant" ); | |
| 381 _sampled_rs_lengths += _curr->rem_set()->occupied(); | |
| 382 _curr = _curr->get_next_young_region(); | |
| 383 if (_curr == NULL) { | |
| 384 _last_sampled_rs_lengths = _sampled_rs_lengths; | |
| 385 // gclog_or_tty->print_cr("last sampled RS lengths = %d", _last_sampled_rs_lengths); | |
| 386 } | |
| 387 } | |
| 388 | |
| 389 void | |
| 390 YoungList::reset_auxilary_lists() { | |
| 391 // We could have just "moved" the scan-only list to the young list. | |
| 392 // However, the scan-only list is ordered according to the region | |
| 393 // age in descending order, so, by moving one entry at a time, we | |
| 394 // ensure that it is recreated in ascending order. | |
| 395 | |
| 396 guarantee( is_empty(), "young list should be empty" ); | |
| 397 assert(check_list_well_formed(), "young list should be well formed"); | |
| 398 | |
| 399 // Add survivor regions to SurvRateGroup. | |
| 400 _g1h->g1_policy()->note_start_adding_survivor_regions(); | |
| 545 | 401 _g1h->g1_policy()->finished_recalculating_age_indexes(true /* is_survivors */); |
| 342 | 402 for (HeapRegion* curr = _survivor_head; |
| 403 curr != NULL; | |
| 404 curr = curr->get_next_young_region()) { | |
| 405 _g1h->g1_policy()->set_region_survivors(curr); | |
| 406 } | |
| 407 _g1h->g1_policy()->note_stop_adding_survivor_regions(); | |
| 408 | |
| 409 if (_survivor_head != NULL) { | |
| 410 _head = _survivor_head; | |
| 411 _length = _survivor_length + _scan_only_length; | |
| 545 | 412 _survivor_tail->set_next_young_region(_scan_only_head); |
| 342 | 413 } else { |
| 414 _head = _scan_only_head; | |
| 415 _length = _scan_only_length; | |
| 416 } | |
| 417 | |
| 418 for (HeapRegion* curr = _scan_only_head; | |
| 419 curr != NULL; | |
| 420 curr = curr->get_next_young_region()) { | |
| 421 curr->recalculate_age_in_surv_rate_group(); | |
| 422 } | |
| 423 _scan_only_head = NULL; | |
| 424 _scan_only_tail = NULL; | |
| 425 _scan_only_length = 0; | |
| 426 _curr_scan_only = NULL; | |
| 427 | |
| 428 _survivor_head = NULL; | |
| 545 | 429 _survivor_tail = NULL; |
| 342 | 430 _survivor_length = 0; |
| 545 | 431 _g1h->g1_policy()->finished_recalculating_age_indexes(false /* is_survivors */); |
| 342 | 432 |
| 433 assert(check_list_well_formed(), "young list should be well formed"); | |
| 434 } | |
| 435 | |
| 436 void YoungList::print() { | |
| 437 HeapRegion* lists[] = {_head, _scan_only_head, _survivor_head}; | |
| 438 const char* names[] = {"YOUNG", "SCAN-ONLY", "SURVIVOR"}; | |
| 439 | |
| 440 for (unsigned int list = 0; list < ARRAY_SIZE(lists); ++list) { | |
| 441 gclog_or_tty->print_cr("%s LIST CONTENTS", names[list]); | |
| 442 HeapRegion *curr = lists[list]; | |
| 443 if (curr == NULL) | |
| 444 gclog_or_tty->print_cr(" empty"); | |
| 445 while (curr != NULL) { | |
| 446 gclog_or_tty->print_cr(" [%08x-%08x], t: %08x, P: %08x, N: %08x, C: %08x, " | |
| 447 "age: %4d, y: %d, s-o: %d, surv: %d", | |
| 448 curr->bottom(), curr->end(), | |
| 449 curr->top(), | |
| 450 curr->prev_top_at_mark_start(), | |
| 451 curr->next_top_at_mark_start(), | |
| 452 curr->top_at_conc_mark_count(), | |
| 453 curr->age_in_surv_rate_group_cond(), | |
| 454 curr->is_young(), | |
| 455 curr->is_scan_only(), | |
| 456 curr->is_survivor()); | |
| 457 curr = curr->get_next_young_region(); | |
| 458 } | |
| 459 } | |
| 460 | |
| 461 gclog_or_tty->print_cr(""); | |
| 462 } | |
| 463 | |
| 464 void G1CollectedHeap::stop_conc_gc_threads() { | |
| 465 _cg1r->cg1rThread()->stop(); | |
| 466 _czft->stop(); | |
| 467 _cmThread->stop(); | |
| 468 } | |
| 469 | |
| 470 | |
| 471 void G1CollectedHeap::check_ct_logs_at_safepoint() { | |
| 472 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set(); | |
| 473 CardTableModRefBS* ct_bs = (CardTableModRefBS*)barrier_set(); | |
| 474 | |
| 475 // Count the dirty cards at the start. | |
| 476 CountNonCleanMemRegionClosure count1(this); | |
| 477 ct_bs->mod_card_iterate(&count1); | |
| 478 int orig_count = count1.n(); | |
| 479 | |
| 480 // First clear the logged cards. | |
| 481 ClearLoggedCardTableEntryClosure clear; | |
| 482 dcqs.set_closure(&clear); | |
| 483 dcqs.apply_closure_to_all_completed_buffers(); | |
| 484 dcqs.iterate_closure_all_threads(false); | |
| 485 clear.print_histo(); | |
| 486 | |
| 487 // Now ensure that there's no dirty cards. | |
| 488 CountNonCleanMemRegionClosure count2(this); | |
| 489 ct_bs->mod_card_iterate(&count2); | |
| 490 if (count2.n() != 0) { | |
| 491 gclog_or_tty->print_cr("Card table has %d entries; %d originally", | |
| 492 count2.n(), orig_count); | |
| 493 } | |
| 494 guarantee(count2.n() == 0, "Card table should be clean."); | |
| 495 | |
| 496 RedirtyLoggedCardTableEntryClosure redirty; | |
| 497 JavaThread::dirty_card_queue_set().set_closure(&redirty); | |
| 498 dcqs.apply_closure_to_all_completed_buffers(); | |
| 499 dcqs.iterate_closure_all_threads(false); | |
| 500 gclog_or_tty->print_cr("Log entries = %d, dirty cards = %d.", | |
| 501 clear.calls(), orig_count); | |
| 502 guarantee(redirty.calls() == clear.calls(), | |
| 503 "Or else mechanism is broken."); | |
| 504 | |
| 505 CountNonCleanMemRegionClosure count3(this); | |
| 506 ct_bs->mod_card_iterate(&count3); | |
| 507 if (count3.n() != orig_count) { | |
| 508 gclog_or_tty->print_cr("Should have restored them all: orig = %d, final = %d.", | |
| 509 orig_count, count3.n()); | |
| 510 guarantee(count3.n() >= orig_count, "Should have restored them all."); | |
| 511 } | |
| 512 | |
| 513 JavaThread::dirty_card_queue_set().set_closure(_refine_cte_cl); | |
| 514 } | |
| 515 | |
| 516 // Private class members. | |
| 517 | |
| 518 G1CollectedHeap* G1CollectedHeap::_g1h; | |
| 519 | |
| 520 // Private methods. | |
| 521 | |
| 522 // Finds a HeapRegion that can be used to allocate a given size of block. | |
| 523 | |
| 524 | |
| 525 HeapRegion* G1CollectedHeap::newAllocRegion_work(size_t word_size, | |
| 526 bool do_expand, | |
| 527 bool zero_filled) { | |
| 528 ConcurrentZFThread::note_region_alloc(); | |
| 529 HeapRegion* res = alloc_free_region_from_lists(zero_filled); | |
| 530 if (res == NULL && do_expand) { | |
| 531 expand(word_size * HeapWordSize); | |
| 532 res = alloc_free_region_from_lists(zero_filled); | |
| 533 assert(res == NULL || | |
| 534 (!res->isHumongous() && | |
| 535 (!zero_filled || | |
| 536 res->zero_fill_state() == HeapRegion::Allocated)), | |
| 537 "Alloc Regions must be zero filled (and non-H)"); | |
| 538 } | |
| 539 if (res != NULL && res->is_empty()) _free_regions--; | |
| 540 assert(res == NULL || | |
| 541 (!res->isHumongous() && | |
| 542 (!zero_filled || | |
| 543 res->zero_fill_state() == HeapRegion::Allocated)), | |
| 544 "Non-young alloc Regions must be zero filled (and non-H)"); | |
| 545 | |
| 546 if (G1TraceRegions) { | |
| 547 if (res != NULL) { | |
| 548 gclog_or_tty->print_cr("new alloc region %d:["PTR_FORMAT", "PTR_FORMAT"], " | |
| 549 "top "PTR_FORMAT, | |
| 550 res->hrs_index(), res->bottom(), res->end(), res->top()); | |
| 551 } | |
| 552 } | |
| 553 | |
| 554 return res; | |
| 555 } | |
| 556 | |
| 557 HeapRegion* G1CollectedHeap::newAllocRegionWithExpansion(int purpose, | |
| 558 size_t word_size, | |
| 559 bool zero_filled) { | |
| 560 HeapRegion* alloc_region = NULL; | |
| 561 if (_gc_alloc_region_counts[purpose] < g1_policy()->max_regions(purpose)) { | |
| 562 alloc_region = newAllocRegion_work(word_size, true, zero_filled); | |
| 563 if (purpose == GCAllocForSurvived && alloc_region != NULL) { | |
| 545 | 564 alloc_region->set_survivor(); |
| 342 | 565 } |
| 566 ++_gc_alloc_region_counts[purpose]; | |
| 567 } else { | |
| 568 g1_policy()->note_alloc_region_limit_reached(purpose); | |
| 569 } | |
| 570 return alloc_region; | |
| 571 } | |
| 572 | |
| 573 // If could fit into free regions w/o expansion, try. | |
| 574 // Otherwise, if can expand, do so. | |
| 575 // Otherwise, if using ex regions might help, try with ex given back. | |
| 576 HeapWord* G1CollectedHeap::humongousObjAllocate(size_t word_size) { | |
| 577 assert(regions_accounted_for(), "Region leakage!"); | |
| 578 | |
| 579 // We can't allocate H regions while cleanupComplete is running, since | |
| 580 // some of the regions we find to be empty might not yet be added to the | |
| 581 // unclean list. (If we're already at a safepoint, this call is | |
| 582 // unnecessary, not to mention wrong.) | |
| 583 if (!SafepointSynchronize::is_at_safepoint()) | |
| 584 wait_for_cleanup_complete(); | |
| 585 | |
| 586 size_t num_regions = | |
| 587 round_to(word_size, HeapRegion::GrainWords) / HeapRegion::GrainWords; | |
| 588 | |
| 589 // Special case if < one region??? | |
| 590 | |
| 591 // Remember the ft size. | |
| 592 size_t x_size = expansion_regions(); | |
| 593 | |
| 594 HeapWord* res = NULL; | |
| 595 bool eliminated_allocated_from_lists = false; | |
| 596 | |
| 597 // Can the allocation potentially fit in the free regions? | |
| 598 if (free_regions() >= num_regions) { | |
| 599 res = _hrs->obj_allocate(word_size); | |
| 600 } | |
| 601 if (res == NULL) { | |
| 602 // Try expansion. | |
| 603 size_t fs = _hrs->free_suffix(); | |
| 604 if (fs + x_size >= num_regions) { | |
| 605 expand((num_regions - fs) * HeapRegion::GrainBytes); | |
| 606 res = _hrs->obj_allocate(word_size); | |
| 607 assert(res != NULL, "This should have worked."); | |
| 608 } else { | |
| 609 // Expansion won't help. Are there enough free regions if we get rid | |
| 610 // of reservations? | |
| 611 size_t avail = free_regions(); | |
| 612 if (avail >= num_regions) { | |
| 613 res = _hrs->obj_allocate(word_size); | |
| 614 if (res != NULL) { | |
| 615 remove_allocated_regions_from_lists(); | |
| 616 eliminated_allocated_from_lists = true; | |
| 617 } | |
| 618 } | |
| 619 } | |
| 620 } | |
| 621 if (res != NULL) { | |
| 622 // Increment by the number of regions allocated. | |
| 623 // FIXME: Assumes regions all of size GrainBytes. | |
| 624 #ifndef PRODUCT | |
| 625 mr_bs()->verify_clean_region(MemRegion(res, res + num_regions * | |
| 626 HeapRegion::GrainWords)); | |
| 627 #endif | |
| 628 if (!eliminated_allocated_from_lists) | |
| 629 remove_allocated_regions_from_lists(); | |
| 630 _summary_bytes_used += word_size * HeapWordSize; | |
| 631 _free_regions -= num_regions; | |
| 632 _num_humongous_regions += (int) num_regions; | |
| 633 } | |
| 634 assert(regions_accounted_for(), "Region Leakage"); | |
| 635 return res; | |
| 636 } | |
| 637 | |
| 638 HeapWord* | |
| 639 G1CollectedHeap::attempt_allocation_slow(size_t word_size, | |
| 640 bool permit_collection_pause) { | |
| 641 HeapWord* res = NULL; | |
| 642 HeapRegion* allocated_young_region = NULL; | |
| 643 | |
| 644 assert( SafepointSynchronize::is_at_safepoint() || | |
| 645 Heap_lock->owned_by_self(), "pre condition of the call" ); | |
| 646 | |
| 647 if (isHumongous(word_size)) { | |
| 648 // Allocation of a humongous object can, in a sense, complete a | |
| 649 // partial region, if the previous alloc was also humongous, and | |
| 650 // caused the test below to succeed. | |
| 651 if (permit_collection_pause) | |
| 652 do_collection_pause_if_appropriate(word_size); | |
| 653 res = humongousObjAllocate(word_size); | |
| 654 assert(_cur_alloc_region == NULL | |
| 655 || !_cur_alloc_region->isHumongous(), | |
| 656 "Prevent a regression of this bug."); | |
| 657 | |
| 658 } else { | |
|
354
c0f8f7790199
6652160: G1: assert(cur_used_bytes == _g1->recalculate_used(),"It should!") at g1CollectorPolicy.cpp:1425
iveresov
parents:
353
diff
changeset
|
659 // We may have concurrent cleanup working at the time. Wait for it |
|
c0f8f7790199
6652160: G1: assert(cur_used_bytes == _g1->recalculate_used(),"It should!") at g1CollectorPolicy.cpp:1425
iveresov
parents:
353
diff
changeset
|
660 // to complete. In the future we would probably want to make the |
|
c0f8f7790199
6652160: G1: assert(cur_used_bytes == _g1->recalculate_used(),"It should!") at g1CollectorPolicy.cpp:1425
iveresov
parents:
353
diff
changeset
|
661 // concurrent cleanup truly concurrent by decoupling it from the |
|
c0f8f7790199
6652160: G1: assert(cur_used_bytes == _g1->recalculate_used(),"It should!") at g1CollectorPolicy.cpp:1425
iveresov
parents:
353
diff
changeset
|
662 // allocation. |
|
c0f8f7790199
6652160: G1: assert(cur_used_bytes == _g1->recalculate_used(),"It should!") at g1CollectorPolicy.cpp:1425
iveresov
parents:
353
diff
changeset
|
663 if (!SafepointSynchronize::is_at_safepoint()) |
|
c0f8f7790199
6652160: G1: assert(cur_used_bytes == _g1->recalculate_used(),"It should!") at g1CollectorPolicy.cpp:1425
iveresov
parents:
353
diff
changeset
|
664 wait_for_cleanup_complete(); |
| 342 | 665 // If we do a collection pause, this will be reset to a non-NULL |
| 666 // value. If we don't, nulling here ensures that we allocate a new | |
| 667 // region below. | |
| 668 if (_cur_alloc_region != NULL) { | |
| 669 // We're finished with the _cur_alloc_region. | |
| 670 _summary_bytes_used += _cur_alloc_region->used(); | |
| 671 _cur_alloc_region = NULL; | |
| 672 } | |
| 673 assert(_cur_alloc_region == NULL, "Invariant."); | |
| 674 // Completion of a heap region is perhaps a good point at which to do | |
| 675 // a collection pause. | |
| 676 if (permit_collection_pause) | |
| 677 do_collection_pause_if_appropriate(word_size); | |
| 678 // Make sure we have an allocation region available. | |
| 679 if (_cur_alloc_region == NULL) { | |
| 680 if (!SafepointSynchronize::is_at_safepoint()) | |
| 681 wait_for_cleanup_complete(); | |
| 682 bool next_is_young = should_set_young_locked(); | |
| 683 // If the next region is not young, make sure it's zero-filled. | |
| 684 _cur_alloc_region = newAllocRegion(word_size, !next_is_young); | |
| 685 if (_cur_alloc_region != NULL) { | |
| 686 _summary_bytes_used -= _cur_alloc_region->used(); | |
| 687 if (next_is_young) { | |
| 688 set_region_short_lived_locked(_cur_alloc_region); | |
| 689 allocated_young_region = _cur_alloc_region; | |
| 690 } | |
| 691 } | |
| 692 } | |
| 693 assert(_cur_alloc_region == NULL || !_cur_alloc_region->isHumongous(), | |
| 694 "Prevent a regression of this bug."); | |
| 695 | |
| 696 // Now retry the allocation. | |
| 697 if (_cur_alloc_region != NULL) { | |
| 698 res = _cur_alloc_region->allocate(word_size); | |
| 699 } | |
| 700 } | |
| 701 | |
| 702 // NOTE: fails frequently in PRT | |
| 703 assert(regions_accounted_for(), "Region leakage!"); | |
| 704 | |
| 705 if (res != NULL) { | |
| 706 if (!SafepointSynchronize::is_at_safepoint()) { | |
| 707 assert( permit_collection_pause, "invariant" ); | |
| 708 assert( Heap_lock->owned_by_self(), "invariant" ); | |
| 709 Heap_lock->unlock(); | |
| 710 } | |
| 711 | |
| 712 if (allocated_young_region != NULL) { | |
| 713 HeapRegion* hr = allocated_young_region; | |
| 714 HeapWord* bottom = hr->bottom(); | |
| 715 HeapWord* end = hr->end(); | |
| 716 MemRegion mr(bottom, end); | |
| 717 ((CardTableModRefBS*)_g1h->barrier_set())->dirty(mr); | |
| 718 } | |
| 719 } | |
| 720 | |
| 721 assert( SafepointSynchronize::is_at_safepoint() || | |
| 722 (res == NULL && Heap_lock->owned_by_self()) || | |
| 723 (res != NULL && !Heap_lock->owned_by_self()), | |
| 724 "post condition of the call" ); | |
| 725 | |
| 726 return res; | |
| 727 } | |
| 728 | |
| 729 HeapWord* | |
| 730 G1CollectedHeap::mem_allocate(size_t word_size, | |
| 731 bool is_noref, | |
| 732 bool is_tlab, | |
| 733 bool* gc_overhead_limit_was_exceeded) { | |
| 734 debug_only(check_for_valid_allocation_state()); | |
| 735 assert(no_gc_in_progress(), "Allocation during gc not allowed"); | |
| 736 HeapWord* result = NULL; | |
| 737 | |
| 738 // Loop until the allocation is satisified, | |
| 739 // or unsatisfied after GC. | |
| 740 for (int try_count = 1; /* return or throw */; try_count += 1) { | |
| 741 int gc_count_before; | |
| 742 { | |
| 743 Heap_lock->lock(); | |
| 744 result = attempt_allocation(word_size); | |
| 745 if (result != NULL) { | |
| 746 // attempt_allocation should have unlocked the heap lock | |
| 747 assert(is_in(result), "result not in heap"); | |
| 748 return result; | |
| 749 } | |
| 750 // Read the gc count while the heap lock is held. | |
| 751 gc_count_before = SharedHeap::heap()->total_collections(); | |
| 752 Heap_lock->unlock(); | |
| 753 } | |
| 754 | |
| 755 // Create the garbage collection operation... | |
| 756 VM_G1CollectForAllocation op(word_size, | |
| 757 gc_count_before); | |
| 758 | |
| 759 // ...and get the VM thread to execute it. | |
| 760 VMThread::execute(&op); | |
| 761 if (op.prologue_succeeded()) { | |
| 762 result = op.result(); | |
| 763 assert(result == NULL || is_in(result), "result not in heap"); | |
| 764 return result; | |
| 765 } | |
| 766 | |
| 767 // Give a warning if we seem to be looping forever. | |
| 768 if ((QueuedAllocationWarningCount > 0) && | |
| 769 (try_count % QueuedAllocationWarningCount == 0)) { | |
| 770 warning("G1CollectedHeap::mem_allocate_work retries %d times", | |
| 771 try_count); | |
| 772 } | |
| 773 } | |
| 774 } | |
| 775 | |
| 776 void G1CollectedHeap::abandon_cur_alloc_region() { | |
| 777 if (_cur_alloc_region != NULL) { | |
| 778 // We're finished with the _cur_alloc_region. | |
| 779 if (_cur_alloc_region->is_empty()) { | |
| 780 _free_regions++; | |
| 781 free_region(_cur_alloc_region); | |
| 782 } else { | |
| 783 _summary_bytes_used += _cur_alloc_region->used(); | |
| 784 } | |
| 785 _cur_alloc_region = NULL; | |
| 786 } | |
| 787 } | |
| 788 | |
| 789 class PostMCRemSetClearClosure: public HeapRegionClosure { | |
| 790 ModRefBarrierSet* _mr_bs; | |
| 791 public: | |
| 792 PostMCRemSetClearClosure(ModRefBarrierSet* mr_bs) : _mr_bs(mr_bs) {} | |
| 793 bool doHeapRegion(HeapRegion* r) { | |
| 794 r->reset_gc_time_stamp(); | |
| 795 if (r->continuesHumongous()) | |
| 796 return false; | |
| 797 HeapRegionRemSet* hrrs = r->rem_set(); | |
| 798 if (hrrs != NULL) hrrs->clear(); | |
| 799 // You might think here that we could clear just the cards | |
| 800 // corresponding to the used region. But no: if we leave a dirty card | |
| 801 // in a region we might allocate into, then it would prevent that card | |
| 802 // from being enqueued, and cause it to be missed. | |
| 803 // Re: the performance cost: we shouldn't be doing full GC anyway! | |
| 804 _mr_bs->clear(MemRegion(r->bottom(), r->end())); | |
| 805 return false; | |
| 806 } | |
| 807 }; | |
| 808 | |
| 809 | |
| 810 class PostMCRemSetInvalidateClosure: public HeapRegionClosure { | |
| 811 ModRefBarrierSet* _mr_bs; | |
| 812 public: | |
| 813 PostMCRemSetInvalidateClosure(ModRefBarrierSet* mr_bs) : _mr_bs(mr_bs) {} | |
| 814 bool doHeapRegion(HeapRegion* r) { | |
| 815 if (r->continuesHumongous()) return false; | |
| 816 if (r->used_region().word_size() != 0) { | |
| 817 _mr_bs->invalidate(r->used_region(), true /*whole heap*/); | |
| 818 } | |
| 819 return false; | |
| 820 } | |
| 821 }; | |
| 822 | |
| 823 void G1CollectedHeap::do_collection(bool full, bool clear_all_soft_refs, | |
| 824 size_t word_size) { | |
| 825 ResourceMark rm; | |
| 826 | |
| 827 if (full && DisableExplicitGC) { | |
| 828 gclog_or_tty->print("\n\n\nDisabling Explicit GC\n\n\n"); | |
| 829 return; | |
| 830 } | |
| 831 | |
| 832 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); | |
| 833 assert(Thread::current() == VMThread::vm_thread(), "should be in vm thread"); | |
| 834 | |
| 835 if (GC_locker::is_active()) { | |
| 836 return; // GC is disabled (e.g. JNI GetXXXCritical operation) | |
| 837 } | |
| 838 | |
| 839 { | |
| 840 IsGCActiveMark x; | |
| 841 | |
| 842 // Timing | |
| 843 gclog_or_tty->date_stamp(PrintGC && PrintGCDateStamps); | |
| 844 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 845 TraceTime t(full ? "Full GC (System.gc())" : "Full GC", PrintGC, true, gclog_or_tty); | |
| 846 | |
| 847 double start = os::elapsedTime(); | |
| 848 GCOverheadReporter::recordSTWStart(start); | |
| 849 g1_policy()->record_full_collection_start(); | |
| 850 | |
| 851 gc_prologue(true); | |
| 852 increment_total_collections(); | |
| 853 | |
| 854 size_t g1h_prev_used = used(); | |
| 855 assert(used() == recalculate_used(), "Should be equal"); | |
| 856 | |
| 857 if (VerifyBeforeGC && total_collections() >= VerifyGCStartAt) { | |
| 858 HandleMark hm; // Discard invalid handles created during verification | |
| 859 prepare_for_verify(); | |
| 860 gclog_or_tty->print(" VerifyBeforeGC:"); | |
| 861 Universe::verify(true); | |
| 862 } | |
| 863 assert(regions_accounted_for(), "Region leakage!"); | |
| 864 | |
| 865 COMPILER2_PRESENT(DerivedPointerTable::clear()); | |
| 866 | |
| 867 // We want to discover references, but not process them yet. | |
| 868 // This mode is disabled in | |
| 869 // instanceRefKlass::process_discovered_references if the | |
| 870 // generation does some collection work, or | |
| 871 // instanceRefKlass::enqueue_discovered_references if the | |
| 872 // generation returns without doing any work. | |
| 873 ref_processor()->disable_discovery(); | |
| 874 ref_processor()->abandon_partial_discovery(); | |
| 875 ref_processor()->verify_no_references_recorded(); | |
| 876 | |
| 877 // Abandon current iterations of concurrent marking and concurrent | |
| 878 // refinement, if any are in progress. | |
| 879 concurrent_mark()->abort(); | |
| 880 | |
| 881 // Make sure we'll choose a new allocation region afterwards. | |
| 882 abandon_cur_alloc_region(); | |
| 883 assert(_cur_alloc_region == NULL, "Invariant."); | |
| 884 g1_rem_set()->as_HRInto_G1RemSet()->cleanupHRRS(); | |
| 885 tear_down_region_lists(); | |
| 886 set_used_regions_to_need_zero_fill(); | |
| 887 if (g1_policy()->in_young_gc_mode()) { | |
| 888 empty_young_list(); | |
| 889 g1_policy()->set_full_young_gcs(true); | |
| 890 } | |
| 891 | |
| 892 // Temporarily make reference _discovery_ single threaded (non-MT). | |
| 893 ReferenceProcessorMTMutator rp_disc_ser(ref_processor(), false); | |
| 894 | |
| 895 // Temporarily make refs discovery atomic | |
| 896 ReferenceProcessorAtomicMutator rp_disc_atomic(ref_processor(), true); | |
| 897 | |
| 898 // Temporarily clear _is_alive_non_header | |
| 899 ReferenceProcessorIsAliveMutator rp_is_alive_null(ref_processor(), NULL); | |
| 900 | |
| 901 ref_processor()->enable_discovery(); | |
|
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
902 ref_processor()->setup_policy(clear_all_soft_refs); |
| 342 | 903 |
| 904 // Do collection work | |
| 905 { | |
| 906 HandleMark hm; // Discard invalid handles created during gc | |
| 907 G1MarkSweep::invoke_at_safepoint(ref_processor(), clear_all_soft_refs); | |
| 908 } | |
| 909 // Because freeing humongous regions may have added some unclean | |
| 910 // regions, it is necessary to tear down again before rebuilding. | |
| 911 tear_down_region_lists(); | |
| 912 rebuild_region_lists(); | |
| 913 | |
| 914 _summary_bytes_used = recalculate_used(); | |
| 915 | |
| 916 ref_processor()->enqueue_discovered_references(); | |
| 917 | |
| 918 COMPILER2_PRESENT(DerivedPointerTable::update_pointers()); | |
| 919 | |
| 920 if (VerifyAfterGC && total_collections() >= VerifyGCStartAt) { | |
| 921 HandleMark hm; // Discard invalid handles created during verification | |
| 922 gclog_or_tty->print(" VerifyAfterGC:"); | |
| 923 Universe::verify(false); | |
| 924 } | |
| 925 NOT_PRODUCT(ref_processor()->verify_no_references_recorded()); | |
| 926 | |
| 927 reset_gc_time_stamp(); | |
| 928 // Since everything potentially moved, we will clear all remembered | |
| 929 // sets, and clear all cards. Later we will also cards in the used | |
| 930 // portion of the heap after the resizing (which could be a shrinking.) | |
| 931 // We will also reset the GC time stamps of the regions. | |
| 932 PostMCRemSetClearClosure rs_clear(mr_bs()); | |
| 933 heap_region_iterate(&rs_clear); | |
| 934 | |
| 935 // Resize the heap if necessary. | |
| 936 resize_if_necessary_after_full_collection(full ? 0 : word_size); | |
| 937 | |
| 938 // Since everything potentially moved, we will clear all remembered | |
| 939 // sets, but also dirty all cards corresponding to used regions. | |
| 940 PostMCRemSetInvalidateClosure rs_invalidate(mr_bs()); | |
| 941 heap_region_iterate(&rs_invalidate); | |
| 942 if (_cg1r->use_cache()) { | |
| 943 _cg1r->clear_and_record_card_counts(); | |
| 944 _cg1r->clear_hot_cache(); | |
| 945 } | |
| 946 | |
| 947 if (PrintGC) { | |
| 948 print_size_transition(gclog_or_tty, g1h_prev_used, used(), capacity()); | |
| 949 } | |
| 950 | |
| 951 if (true) { // FIXME | |
| 952 // Ask the permanent generation to adjust size for full collections | |
| 953 perm()->compute_new_size(); | |
| 954 } | |
| 955 | |
| 956 double end = os::elapsedTime(); | |
| 957 GCOverheadReporter::recordSTWEnd(end); | |
| 958 g1_policy()->record_full_collection_end(); | |
| 959 | |
|
546
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
960 #ifdef TRACESPINNING |
|
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
961 ParallelTaskTerminator::print_termination_counts(); |
|
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
962 #endif |
|
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
963 |
| 342 | 964 gc_epilogue(true); |
| 965 | |
| 966 // Abandon concurrent refinement. This must happen last: in the | |
| 967 // dirty-card logging system, some cards may be dirty by weak-ref | |
| 968 // processing, and may be enqueued. But the whole card table is | |
| 969 // dirtied, so this should abandon those logs, and set "do_traversal" | |
| 970 // to true. | |
| 971 concurrent_g1_refine()->set_pya_restart(); | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
972 assert(!G1DeferredRSUpdate |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
973 || (G1DeferredRSUpdate && (dirty_card_queue_set().completed_buffers_num() == 0)), "Should not be any"); |
| 342 | 974 assert(regions_accounted_for(), "Region leakage!"); |
| 975 } | |
| 976 | |
| 977 if (g1_policy()->in_young_gc_mode()) { | |
| 978 _young_list->reset_sampled_info(); | |
| 979 assert( check_young_list_empty(false, false), | |
| 980 "young list should be empty at this point"); | |
| 981 } | |
| 982 } | |
| 983 | |
| 984 void G1CollectedHeap::do_full_collection(bool clear_all_soft_refs) { | |
| 985 do_collection(true, clear_all_soft_refs, 0); | |
| 986 } | |
| 987 | |
| 988 // This code is mostly copied from TenuredGeneration. | |
| 989 void | |
| 990 G1CollectedHeap:: | |
| 991 resize_if_necessary_after_full_collection(size_t word_size) { | |
| 992 assert(MinHeapFreeRatio <= MaxHeapFreeRatio, "sanity check"); | |
| 993 | |
| 994 // Include the current allocation, if any, and bytes that will be | |
| 995 // pre-allocated to support collections, as "used". | |
| 996 const size_t used_after_gc = used(); | |
| 997 const size_t capacity_after_gc = capacity(); | |
| 998 const size_t free_after_gc = capacity_after_gc - used_after_gc; | |
| 999 | |
| 1000 // We don't have floating point command-line arguments | |
| 1001 const double minimum_free_percentage = (double) MinHeapFreeRatio / 100; | |
| 1002 const double maximum_used_percentage = 1.0 - minimum_free_percentage; | |
| 1003 const double maximum_free_percentage = (double) MaxHeapFreeRatio / 100; | |
| 1004 const double minimum_used_percentage = 1.0 - maximum_free_percentage; | |
| 1005 | |
| 1006 size_t minimum_desired_capacity = (size_t) (used_after_gc / maximum_used_percentage); | |
| 1007 size_t maximum_desired_capacity = (size_t) (used_after_gc / minimum_used_percentage); | |
| 1008 | |
| 1009 // Don't shrink less than the initial size. | |
| 1010 minimum_desired_capacity = | |
| 1011 MAX2(minimum_desired_capacity, | |
| 1012 collector_policy()->initial_heap_byte_size()); | |
| 1013 maximum_desired_capacity = | |
| 1014 MAX2(maximum_desired_capacity, | |
| 1015 collector_policy()->initial_heap_byte_size()); | |
| 1016 | |
| 1017 // We are failing here because minimum_desired_capacity is | |
| 1018 assert(used_after_gc <= minimum_desired_capacity, "sanity check"); | |
| 1019 assert(minimum_desired_capacity <= maximum_desired_capacity, "sanity check"); | |
| 1020 | |
| 1021 if (PrintGC && Verbose) { | |
| 1022 const double free_percentage = ((double)free_after_gc) / capacity(); | |
| 1023 gclog_or_tty->print_cr("Computing new size after full GC "); | |
| 1024 gclog_or_tty->print_cr(" " | |
| 1025 " minimum_free_percentage: %6.2f", | |
| 1026 minimum_free_percentage); | |
| 1027 gclog_or_tty->print_cr(" " | |
| 1028 " maximum_free_percentage: %6.2f", | |
| 1029 maximum_free_percentage); | |
| 1030 gclog_or_tty->print_cr(" " | |
| 1031 " capacity: %6.1fK" | |
| 1032 " minimum_desired_capacity: %6.1fK" | |
| 1033 " maximum_desired_capacity: %6.1fK", | |
| 1034 capacity() / (double) K, | |
| 1035 minimum_desired_capacity / (double) K, | |
| 1036 maximum_desired_capacity / (double) K); | |
| 1037 gclog_or_tty->print_cr(" " | |
| 1038 " free_after_gc : %6.1fK" | |
| 1039 " used_after_gc : %6.1fK", | |
| 1040 free_after_gc / (double) K, | |
| 1041 used_after_gc / (double) K); | |
| 1042 gclog_or_tty->print_cr(" " | |
| 1043 " free_percentage: %6.2f", | |
| 1044 free_percentage); | |
| 1045 } | |
| 1046 if (capacity() < minimum_desired_capacity) { | |
| 1047 // Don't expand unless it's significant | |
| 1048 size_t expand_bytes = minimum_desired_capacity - capacity_after_gc; | |
| 1049 expand(expand_bytes); | |
| 1050 if (PrintGC && Verbose) { | |
| 1051 gclog_or_tty->print_cr(" expanding:" | |
| 1052 " minimum_desired_capacity: %6.1fK" | |
| 1053 " expand_bytes: %6.1fK", | |
| 1054 minimum_desired_capacity / (double) K, | |
| 1055 expand_bytes / (double) K); | |
| 1056 } | |
| 1057 | |
| 1058 // No expansion, now see if we want to shrink | |
| 1059 } else if (capacity() > maximum_desired_capacity) { | |
| 1060 // Capacity too large, compute shrinking size | |
| 1061 size_t shrink_bytes = capacity_after_gc - maximum_desired_capacity; | |
| 1062 shrink(shrink_bytes); | |
| 1063 if (PrintGC && Verbose) { | |
| 1064 gclog_or_tty->print_cr(" " | |
| 1065 " shrinking:" | |
| 1066 " initSize: %.1fK" | |
| 1067 " maximum_desired_capacity: %.1fK", | |
| 1068 collector_policy()->initial_heap_byte_size() / (double) K, | |
| 1069 maximum_desired_capacity / (double) K); | |
| 1070 gclog_or_tty->print_cr(" " | |
| 1071 " shrink_bytes: %.1fK", | |
| 1072 shrink_bytes / (double) K); | |
| 1073 } | |
| 1074 } | |
| 1075 } | |
| 1076 | |
| 1077 | |
| 1078 HeapWord* | |
| 1079 G1CollectedHeap::satisfy_failed_allocation(size_t word_size) { | |
| 1080 HeapWord* result = NULL; | |
| 1081 | |
| 1082 // In a G1 heap, we're supposed to keep allocation from failing by | |
| 1083 // incremental pauses. Therefore, at least for now, we'll favor | |
| 1084 // expansion over collection. (This might change in the future if we can | |
| 1085 // do something smarter than full collection to satisfy a failed alloc.) | |
| 1086 | |
| 1087 result = expand_and_allocate(word_size); | |
| 1088 if (result != NULL) { | |
| 1089 assert(is_in(result), "result not in heap"); | |
| 1090 return result; | |
| 1091 } | |
| 1092 | |
| 1093 // OK, I guess we have to try collection. | |
| 1094 | |
| 1095 do_collection(false, false, word_size); | |
| 1096 | |
| 1097 result = attempt_allocation(word_size, /*permit_collection_pause*/false); | |
| 1098 | |
| 1099 if (result != NULL) { | |
| 1100 assert(is_in(result), "result not in heap"); | |
| 1101 return result; | |
| 1102 } | |
| 1103 | |
| 1104 // Try collecting soft references. | |
| 1105 do_collection(false, true, word_size); | |
| 1106 result = attempt_allocation(word_size, /*permit_collection_pause*/false); | |
| 1107 if (result != NULL) { | |
| 1108 assert(is_in(result), "result not in heap"); | |
| 1109 return result; | |
| 1110 } | |
| 1111 | |
| 1112 // What else? We might try synchronous finalization later. If the total | |
| 1113 // space available is large enough for the allocation, then a more | |
| 1114 // complete compaction phase than we've tried so far might be | |
| 1115 // appropriate. | |
| 1116 return NULL; | |
| 1117 } | |
| 1118 | |
| 1119 // Attempting to expand the heap sufficiently | |
| 1120 // to support an allocation of the given "word_size". If | |
| 1121 // successful, perform the allocation and return the address of the | |
| 1122 // allocated block, or else "NULL". | |
| 1123 | |
| 1124 HeapWord* G1CollectedHeap::expand_and_allocate(size_t word_size) { | |
| 1125 size_t expand_bytes = word_size * HeapWordSize; | |
| 1126 if (expand_bytes < MinHeapDeltaBytes) { | |
| 1127 expand_bytes = MinHeapDeltaBytes; | |
| 1128 } | |
| 1129 expand(expand_bytes); | |
| 1130 assert(regions_accounted_for(), "Region leakage!"); | |
| 1131 HeapWord* result = attempt_allocation(word_size, false /* permit_collection_pause */); | |
| 1132 return result; | |
| 1133 } | |
| 1134 | |
| 1135 size_t G1CollectedHeap::free_region_if_totally_empty(HeapRegion* hr) { | |
| 1136 size_t pre_used = 0; | |
| 1137 size_t cleared_h_regions = 0; | |
| 1138 size_t freed_regions = 0; | |
| 1139 UncleanRegionList local_list; | |
| 1140 free_region_if_totally_empty_work(hr, pre_used, cleared_h_regions, | |
| 1141 freed_regions, &local_list); | |
| 1142 | |
| 1143 finish_free_region_work(pre_used, cleared_h_regions, freed_regions, | |
| 1144 &local_list); | |
| 1145 return pre_used; | |
| 1146 } | |
| 1147 | |
| 1148 void | |
| 1149 G1CollectedHeap::free_region_if_totally_empty_work(HeapRegion* hr, | |
| 1150 size_t& pre_used, | |
| 1151 size_t& cleared_h, | |
| 1152 size_t& freed_regions, | |
| 1153 UncleanRegionList* list, | |
| 1154 bool par) { | |
| 1155 assert(!hr->continuesHumongous(), "should have filtered these out"); | |
| 1156 size_t res = 0; | |
| 1157 if (!hr->popular() && hr->used() > 0 && hr->garbage_bytes() == hr->used()) { | |
| 1158 if (!hr->is_young()) { | |
| 1159 if (G1PolicyVerbose > 0) | |
| 1160 gclog_or_tty->print_cr("Freeing empty region "PTR_FORMAT "(" SIZE_FORMAT " bytes)" | |
| 1161 " during cleanup", hr, hr->used()); | |
| 1162 free_region_work(hr, pre_used, cleared_h, freed_regions, list, par); | |
| 1163 } | |
| 1164 } | |
| 1165 } | |
| 1166 | |
| 1167 // FIXME: both this and shrink could probably be more efficient by | |
| 1168 // doing one "VirtualSpace::expand_by" call rather than several. | |
| 1169 void G1CollectedHeap::expand(size_t expand_bytes) { | |
| 1170 size_t old_mem_size = _g1_storage.committed_size(); | |
| 1171 // We expand by a minimum of 1K. | |
| 1172 expand_bytes = MAX2(expand_bytes, (size_t)K); | |
| 1173 size_t aligned_expand_bytes = | |
| 1174 ReservedSpace::page_align_size_up(expand_bytes); | |
| 1175 aligned_expand_bytes = align_size_up(aligned_expand_bytes, | |
| 1176 HeapRegion::GrainBytes); | |
| 1177 expand_bytes = aligned_expand_bytes; | |
| 1178 while (expand_bytes > 0) { | |
| 1179 HeapWord* base = (HeapWord*)_g1_storage.high(); | |
| 1180 // Commit more storage. | |
| 1181 bool successful = _g1_storage.expand_by(HeapRegion::GrainBytes); | |
| 1182 if (!successful) { | |
| 1183 expand_bytes = 0; | |
| 1184 } else { | |
| 1185 expand_bytes -= HeapRegion::GrainBytes; | |
| 1186 // Expand the committed region. | |
| 1187 HeapWord* high = (HeapWord*) _g1_storage.high(); | |
| 1188 _g1_committed.set_end(high); | |
| 1189 // Create a new HeapRegion. | |
| 1190 MemRegion mr(base, high); | |
| 1191 bool is_zeroed = !_g1_max_committed.contains(base); | |
| 1192 HeapRegion* hr = new HeapRegion(_bot_shared, mr, is_zeroed); | |
| 1193 | |
| 1194 // Now update max_committed if necessary. | |
| 1195 _g1_max_committed.set_end(MAX2(_g1_max_committed.end(), high)); | |
| 1196 | |
| 1197 // Add it to the HeapRegionSeq. | |
| 1198 _hrs->insert(hr); | |
| 1199 // Set the zero-fill state, according to whether it's already | |
| 1200 // zeroed. | |
| 1201 { | |
| 1202 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 1203 if (is_zeroed) { | |
| 1204 hr->set_zero_fill_complete(); | |
| 1205 put_free_region_on_list_locked(hr); | |
| 1206 } else { | |
| 1207 hr->set_zero_fill_needed(); | |
| 1208 put_region_on_unclean_list_locked(hr); | |
| 1209 } | |
| 1210 } | |
| 1211 _free_regions++; | |
| 1212 // And we used up an expansion region to create it. | |
| 1213 _expansion_regions--; | |
| 1214 // Tell the cardtable about it. | |
| 1215 Universe::heap()->barrier_set()->resize_covered_region(_g1_committed); | |
| 1216 // And the offset table as well. | |
| 1217 _bot_shared->resize(_g1_committed.word_size()); | |
| 1218 } | |
| 1219 } | |
| 1220 if (Verbose && PrintGC) { | |
| 1221 size_t new_mem_size = _g1_storage.committed_size(); | |
| 1222 gclog_or_tty->print_cr("Expanding garbage-first heap from %ldK by %ldK to %ldK", | |
| 1223 old_mem_size/K, aligned_expand_bytes/K, | |
| 1224 new_mem_size/K); | |
| 1225 } | |
| 1226 } | |
| 1227 | |
| 1228 void G1CollectedHeap::shrink_helper(size_t shrink_bytes) | |
| 1229 { | |
| 1230 size_t old_mem_size = _g1_storage.committed_size(); | |
| 1231 size_t aligned_shrink_bytes = | |
| 1232 ReservedSpace::page_align_size_down(shrink_bytes); | |
| 1233 aligned_shrink_bytes = align_size_down(aligned_shrink_bytes, | |
| 1234 HeapRegion::GrainBytes); | |
| 1235 size_t num_regions_deleted = 0; | |
| 1236 MemRegion mr = _hrs->shrink_by(aligned_shrink_bytes, num_regions_deleted); | |
| 1237 | |
| 1238 assert(mr.end() == (HeapWord*)_g1_storage.high(), "Bad shrink!"); | |
| 1239 if (mr.byte_size() > 0) | |
| 1240 _g1_storage.shrink_by(mr.byte_size()); | |
| 1241 assert(mr.start() == (HeapWord*)_g1_storage.high(), "Bad shrink!"); | |
| 1242 | |
| 1243 _g1_committed.set_end(mr.start()); | |
| 1244 _free_regions -= num_regions_deleted; | |
| 1245 _expansion_regions += num_regions_deleted; | |
| 1246 | |
| 1247 // Tell the cardtable about it. | |
| 1248 Universe::heap()->barrier_set()->resize_covered_region(_g1_committed); | |
| 1249 | |
| 1250 // And the offset table as well. | |
| 1251 _bot_shared->resize(_g1_committed.word_size()); | |
| 1252 | |
| 1253 HeapRegionRemSet::shrink_heap(n_regions()); | |
| 1254 | |
| 1255 if (Verbose && PrintGC) { | |
| 1256 size_t new_mem_size = _g1_storage.committed_size(); | |
| 1257 gclog_or_tty->print_cr("Shrinking garbage-first heap from %ldK by %ldK to %ldK", | |
| 1258 old_mem_size/K, aligned_shrink_bytes/K, | |
| 1259 new_mem_size/K); | |
| 1260 } | |
| 1261 } | |
| 1262 | |
| 1263 void G1CollectedHeap::shrink(size_t shrink_bytes) { | |
| 1264 release_gc_alloc_regions(); | |
| 1265 tear_down_region_lists(); // We will rebuild them in a moment. | |
| 1266 shrink_helper(shrink_bytes); | |
| 1267 rebuild_region_lists(); | |
| 1268 } | |
| 1269 | |
| 1270 // Public methods. | |
| 1271 | |
| 1272 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away | |
| 1273 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list | |
| 1274 #endif // _MSC_VER | |
| 1275 | |
| 1276 | |
| 1277 G1CollectedHeap::G1CollectedHeap(G1CollectorPolicy* policy_) : | |
| 1278 SharedHeap(policy_), | |
| 1279 _g1_policy(policy_), | |
| 1280 _ref_processor(NULL), | |
| 1281 _process_strong_tasks(new SubTasksDone(G1H_PS_NumElements)), | |
| 1282 _bot_shared(NULL), | |
| 1283 _par_alloc_during_gc_lock(Mutex::leaf, "par alloc during GC lock"), | |
| 1284 _objs_with_preserved_marks(NULL), _preserved_marks_of_objs(NULL), | |
| 1285 _evac_failure_scan_stack(NULL) , | |
| 1286 _mark_in_progress(false), | |
| 1287 _cg1r(NULL), _czft(NULL), _summary_bytes_used(0), | |
| 1288 _cur_alloc_region(NULL), | |
| 1289 _refine_cte_cl(NULL), | |
| 1290 _free_region_list(NULL), _free_region_list_size(0), | |
| 1291 _free_regions(0), | |
| 1292 _popular_object_boundary(NULL), | |
| 1293 _cur_pop_hr_index(0), | |
| 1294 _popular_regions_to_be_evacuated(NULL), | |
| 1295 _pop_obj_rc_at_copy(), | |
| 1296 _full_collection(false), | |
| 1297 _unclean_region_list(), | |
| 1298 _unclean_regions_coming(false), | |
| 1299 _young_list(new YoungList(this)), | |
| 1300 _gc_time_stamp(0), | |
| 526 | 1301 _surviving_young_words(NULL), |
| 1302 _in_cset_fast_test(NULL), | |
| 1303 _in_cset_fast_test_base(NULL) | |
| 342 | 1304 { |
| 1305 _g1h = this; // To catch bugs. | |
| 1306 if (_process_strong_tasks == NULL || !_process_strong_tasks->valid()) { | |
| 1307 vm_exit_during_initialization("Failed necessary allocation."); | |
| 1308 } | |
| 1309 int n_queues = MAX2((int)ParallelGCThreads, 1); | |
| 1310 _task_queues = new RefToScanQueueSet(n_queues); | |
| 1311 | |
| 1312 int n_rem_sets = HeapRegionRemSet::num_par_rem_sets(); | |
| 1313 assert(n_rem_sets > 0, "Invariant."); | |
| 1314 | |
| 1315 HeapRegionRemSetIterator** iter_arr = | |
| 1316 NEW_C_HEAP_ARRAY(HeapRegionRemSetIterator*, n_queues); | |
| 1317 for (int i = 0; i < n_queues; i++) { | |
| 1318 iter_arr[i] = new HeapRegionRemSetIterator(); | |
| 1319 } | |
| 1320 _rem_set_iterator = iter_arr; | |
| 1321 | |
| 1322 for (int i = 0; i < n_queues; i++) { | |
| 1323 RefToScanQueue* q = new RefToScanQueue(); | |
| 1324 q->initialize(); | |
| 1325 _task_queues->register_queue(i, q); | |
| 1326 } | |
| 1327 | |
| 1328 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { | |
| 1329 _gc_alloc_regions[ap] = NULL; | |
| 1330 _gc_alloc_region_counts[ap] = 0; | |
| 1331 } | |
| 1332 guarantee(_task_queues != NULL, "task_queues allocation failure."); | |
| 1333 } | |
| 1334 | |
| 1335 jint G1CollectedHeap::initialize() { | |
| 1336 os::enable_vtime(); | |
| 1337 | |
| 1338 // Necessary to satisfy locking discipline assertions. | |
| 1339 | |
| 1340 MutexLocker x(Heap_lock); | |
| 1341 | |
| 1342 // While there are no constraints in the GC code that HeapWordSize | |
| 1343 // be any particular value, there are multiple other areas in the | |
| 1344 // system which believe this to be true (e.g. oop->object_size in some | |
| 1345 // cases incorrectly returns the size in wordSize units rather than | |
| 1346 // HeapWordSize). | |
| 1347 guarantee(HeapWordSize == wordSize, "HeapWordSize must equal wordSize"); | |
| 1348 | |
| 1349 size_t init_byte_size = collector_policy()->initial_heap_byte_size(); | |
| 1350 size_t max_byte_size = collector_policy()->max_heap_byte_size(); | |
| 1351 | |
| 1352 // Ensure that the sizes are properly aligned. | |
| 1353 Universe::check_alignment(init_byte_size, HeapRegion::GrainBytes, "g1 heap"); | |
| 1354 Universe::check_alignment(max_byte_size, HeapRegion::GrainBytes, "g1 heap"); | |
| 1355 | |
| 1356 // We allocate this in any case, but only do no work if the command line | |
| 1357 // param is off. | |
| 1358 _cg1r = new ConcurrentG1Refine(); | |
| 1359 | |
| 1360 // Reserve the maximum. | |
| 1361 PermanentGenerationSpec* pgs = collector_policy()->permanent_generation(); | |
| 1362 // Includes the perm-gen. | |
|
642
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1363 |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1364 const size_t total_reserved = max_byte_size + pgs->max_size(); |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1365 char* addr = Universe::preferred_heap_base(total_reserved, Universe::UnscaledNarrowOop); |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1366 |
| 342 | 1367 ReservedSpace heap_rs(max_byte_size + pgs->max_size(), |
| 1368 HeapRegion::GrainBytes, | |
|
642
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1369 false /*ism*/, addr); |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1370 |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1371 if (UseCompressedOops) { |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1372 if (addr != NULL && !heap_rs.is_reserved()) { |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1373 // Failed to reserve at specified address - the requested memory |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1374 // region is taken already, for example, by 'java' launcher. |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1375 // Try again to reserver heap higher. |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1376 addr = Universe::preferred_heap_base(total_reserved, Universe::ZeroBasedNarrowOop); |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1377 ReservedSpace heap_rs0(total_reserved, HeapRegion::GrainBytes, |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1378 false /*ism*/, addr); |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1379 if (addr != NULL && !heap_rs0.is_reserved()) { |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1380 // Failed to reserve at specified address again - give up. |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1381 addr = Universe::preferred_heap_base(total_reserved, Universe::HeapBasedNarrowOop); |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1382 assert(addr == NULL, ""); |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1383 ReservedSpace heap_rs1(total_reserved, HeapRegion::GrainBytes, |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1384 false /*ism*/, addr); |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1385 heap_rs = heap_rs1; |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1386 } else { |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1387 heap_rs = heap_rs0; |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1388 } |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1389 } |
|
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
620
diff
changeset
|
1390 } |
| 342 | 1391 |
| 1392 if (!heap_rs.is_reserved()) { | |
| 1393 vm_exit_during_initialization("Could not reserve enough space for object heap"); | |
| 1394 return JNI_ENOMEM; | |
| 1395 } | |
| 1396 | |
| 1397 // It is important to do this in a way such that concurrent readers can't | |
| 1398 // temporarily think somethings in the heap. (I've actually seen this | |
| 1399 // happen in asserts: DLD.) | |
| 1400 _reserved.set_word_size(0); | |
| 1401 _reserved.set_start((HeapWord*)heap_rs.base()); | |
| 1402 _reserved.set_end((HeapWord*)(heap_rs.base() + heap_rs.size())); | |
| 1403 | |
| 1404 _expansion_regions = max_byte_size/HeapRegion::GrainBytes; | |
| 1405 | |
| 1406 _num_humongous_regions = 0; | |
| 1407 | |
| 1408 // Create the gen rem set (and barrier set) for the entire reserved region. | |
| 1409 _rem_set = collector_policy()->create_rem_set(_reserved, 2); | |
| 1410 set_barrier_set(rem_set()->bs()); | |
| 1411 if (barrier_set()->is_a(BarrierSet::ModRef)) { | |
| 1412 _mr_bs = (ModRefBarrierSet*)_barrier_set; | |
| 1413 } else { | |
| 1414 vm_exit_during_initialization("G1 requires a mod ref bs."); | |
| 1415 return JNI_ENOMEM; | |
| 1416 } | |
| 1417 | |
| 1418 // Also create a G1 rem set. | |
| 1419 if (G1UseHRIntoRS) { | |
| 1420 if (mr_bs()->is_a(BarrierSet::CardTableModRef)) { | |
| 1421 _g1_rem_set = new HRInto_G1RemSet(this, (CardTableModRefBS*)mr_bs()); | |
| 1422 } else { | |
| 1423 vm_exit_during_initialization("G1 requires a cardtable mod ref bs."); | |
| 1424 return JNI_ENOMEM; | |
| 1425 } | |
| 1426 } else { | |
| 1427 _g1_rem_set = new StupidG1RemSet(this); | |
| 1428 } | |
| 1429 | |
| 1430 // Carve out the G1 part of the heap. | |
| 1431 | |
| 1432 ReservedSpace g1_rs = heap_rs.first_part(max_byte_size); | |
| 1433 _g1_reserved = MemRegion((HeapWord*)g1_rs.base(), | |
| 1434 g1_rs.size()/HeapWordSize); | |
| 1435 ReservedSpace perm_gen_rs = heap_rs.last_part(max_byte_size); | |
| 1436 | |
| 1437 _perm_gen = pgs->init(perm_gen_rs, pgs->init_size(), rem_set()); | |
| 1438 | |
| 1439 _g1_storage.initialize(g1_rs, 0); | |
| 1440 _g1_committed = MemRegion((HeapWord*)_g1_storage.low(), (size_t) 0); | |
| 1441 _g1_max_committed = _g1_committed; | |
| 393 | 1442 _hrs = new HeapRegionSeq(_expansion_regions); |
| 342 | 1443 guarantee(_hrs != NULL, "Couldn't allocate HeapRegionSeq"); |
| 1444 guarantee(_cur_alloc_region == NULL, "from constructor"); | |
| 1445 | |
| 1446 _bot_shared = new G1BlockOffsetSharedArray(_reserved, | |
| 1447 heap_word_size(init_byte_size)); | |
| 1448 | |
| 1449 _g1h = this; | |
| 1450 | |
| 1451 // Create the ConcurrentMark data structure and thread. | |
| 1452 // (Must do this late, so that "max_regions" is defined.) | |
| 1453 _cm = new ConcurrentMark(heap_rs, (int) max_regions()); | |
| 1454 _cmThread = _cm->cmThread(); | |
| 1455 | |
| 1456 // ...and the concurrent zero-fill thread, if necessary. | |
| 1457 if (G1ConcZeroFill) { | |
| 1458 _czft = new ConcurrentZFThread(); | |
| 1459 } | |
| 1460 | |
| 1461 | |
| 1462 | |
| 1463 // Allocate the popular regions; take them off free lists. | |
| 1464 size_t pop_byte_size = G1NumPopularRegions * HeapRegion::GrainBytes; | |
| 1465 expand(pop_byte_size); | |
| 1466 _popular_object_boundary = | |
| 1467 _g1_reserved.start() + (G1NumPopularRegions * HeapRegion::GrainWords); | |
| 1468 for (int i = 0; i < G1NumPopularRegions; i++) { | |
| 1469 HeapRegion* hr = newAllocRegion(HeapRegion::GrainWords); | |
| 1470 // assert(hr != NULL && hr->bottom() < _popular_object_boundary, | |
| 1471 // "Should be enough, and all should be below boundary."); | |
| 1472 hr->set_popular(true); | |
| 1473 } | |
| 1474 assert(_cur_pop_hr_index == 0, "Start allocating at the first region."); | |
| 1475 | |
| 1476 // Initialize the from_card cache structure of HeapRegionRemSet. | |
| 1477 HeapRegionRemSet::init_heap(max_regions()); | |
| 1478 | |
| 1479 // Now expand into the rest of the initial heap size. | |
| 1480 expand(init_byte_size - pop_byte_size); | |
| 1481 | |
| 1482 // Perform any initialization actions delegated to the policy. | |
| 1483 g1_policy()->init(); | |
| 1484 | |
| 1485 g1_policy()->note_start_of_mark_thread(); | |
| 1486 | |
| 1487 _refine_cte_cl = | |
| 1488 new RefineCardTableEntryClosure(ConcurrentG1RefineThread::sts(), | |
| 1489 g1_rem_set(), | |
| 1490 concurrent_g1_refine()); | |
| 1491 JavaThread::dirty_card_queue_set().set_closure(_refine_cte_cl); | |
| 1492 | |
| 1493 JavaThread::satb_mark_queue_set().initialize(SATB_Q_CBL_mon, | |
| 1494 SATB_Q_FL_lock, | |
| 1495 0, | |
| 1496 Shared_SATB_Q_lock); | |
| 1497 if (G1RSBarrierUseQueue) { | |
| 1498 JavaThread::dirty_card_queue_set().initialize(DirtyCardQ_CBL_mon, | |
| 1499 DirtyCardQ_FL_lock, | |
| 1500 G1DirtyCardQueueMax, | |
| 1501 Shared_DirtyCardQ_lock); | |
| 1502 } | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
1503 if (G1DeferredRSUpdate) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
1504 dirty_card_queue_set().initialize(DirtyCardQ_CBL_mon, |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
1505 DirtyCardQ_FL_lock, |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
1506 0, |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
1507 Shared_DirtyCardQ_lock, |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
1508 &JavaThread::dirty_card_queue_set()); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
1509 } |
| 342 | 1510 // In case we're keeping closure specialization stats, initialize those |
| 1511 // counts and that mechanism. | |
| 1512 SpecializationStats::clear(); | |
| 1513 | |
| 1514 _gc_alloc_region_list = NULL; | |
| 1515 | |
| 1516 // Do later initialization work for concurrent refinement. | |
| 1517 _cg1r->init(); | |
| 1518 | |
| 1519 const char* group_names[] = { "CR", "ZF", "CM", "CL" }; | |
| 1520 GCOverheadReporter::initGCOverheadReporter(4, group_names); | |
| 1521 | |
| 1522 return JNI_OK; | |
| 1523 } | |
| 1524 | |
| 1525 void G1CollectedHeap::ref_processing_init() { | |
| 1526 SharedHeap::ref_processing_init(); | |
| 1527 MemRegion mr = reserved_region(); | |
| 1528 _ref_processor = ReferenceProcessor::create_ref_processor( | |
| 1529 mr, // span | |
| 1530 false, // Reference discovery is not atomic | |
| 1531 // (though it shouldn't matter here.) | |
| 1532 true, // mt_discovery | |
| 1533 NULL, // is alive closure: need to fill this in for efficiency | |
| 1534 ParallelGCThreads, | |
| 1535 ParallelRefProcEnabled, | |
| 1536 true); // Setting next fields of discovered | |
| 1537 // lists requires a barrier. | |
| 1538 } | |
| 1539 | |
| 1540 size_t G1CollectedHeap::capacity() const { | |
| 1541 return _g1_committed.byte_size(); | |
| 1542 } | |
| 1543 | |
| 1544 void G1CollectedHeap::iterate_dirty_card_closure(bool concurrent, | |
| 1545 int worker_i) { | |
| 1546 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set(); | |
| 1547 int n_completed_buffers = 0; | |
| 1548 while (dcqs.apply_closure_to_completed_buffer(worker_i, 0, true)) { | |
| 1549 n_completed_buffers++; | |
| 1550 } | |
| 1551 g1_policy()->record_update_rs_processed_buffers(worker_i, | |
| 1552 (double) n_completed_buffers); | |
| 1553 dcqs.clear_n_completed_buffers(); | |
| 1554 // Finish up the queue... | |
| 1555 if (worker_i == 0) concurrent_g1_refine()->clean_up_cache(worker_i, | |
| 1556 g1_rem_set()); | |
| 1557 assert(!dcqs.completed_buffers_exist_dirty(), "Completed buffers exist!"); | |
| 1558 } | |
| 1559 | |
| 1560 | |
| 1561 // Computes the sum of the storage used by the various regions. | |
| 1562 | |
| 1563 size_t G1CollectedHeap::used() const { | |
| 1564 assert(Heap_lock->owner() != NULL, | |
| 1565 "Should be owned on this thread's behalf."); | |
| 1566 size_t result = _summary_bytes_used; | |
| 1567 if (_cur_alloc_region != NULL) | |
| 1568 result += _cur_alloc_region->used(); | |
| 1569 return result; | |
| 1570 } | |
| 1571 | |
| 1572 class SumUsedClosure: public HeapRegionClosure { | |
| 1573 size_t _used; | |
| 1574 public: | |
| 1575 SumUsedClosure() : _used(0) {} | |
| 1576 bool doHeapRegion(HeapRegion* r) { | |
| 1577 if (!r->continuesHumongous()) { | |
| 1578 _used += r->used(); | |
| 1579 } | |
| 1580 return false; | |
| 1581 } | |
| 1582 size_t result() { return _used; } | |
| 1583 }; | |
| 1584 | |
| 1585 size_t G1CollectedHeap::recalculate_used() const { | |
| 1586 SumUsedClosure blk; | |
| 1587 _hrs->iterate(&blk); | |
| 1588 return blk.result(); | |
| 1589 } | |
| 1590 | |
| 1591 #ifndef PRODUCT | |
| 1592 class SumUsedRegionsClosure: public HeapRegionClosure { | |
| 1593 size_t _num; | |
| 1594 public: | |
| 1595 // _num is set to 1 to account for the popular region | |
| 1596 SumUsedRegionsClosure() : _num(G1NumPopularRegions) {} | |
| 1597 bool doHeapRegion(HeapRegion* r) { | |
| 1598 if (r->continuesHumongous() || r->used() > 0 || r->is_gc_alloc_region()) { | |
| 1599 _num += 1; | |
| 1600 } | |
| 1601 return false; | |
| 1602 } | |
| 1603 size_t result() { return _num; } | |
| 1604 }; | |
| 1605 | |
| 1606 size_t G1CollectedHeap::recalculate_used_regions() const { | |
| 1607 SumUsedRegionsClosure blk; | |
| 1608 _hrs->iterate(&blk); | |
| 1609 return blk.result(); | |
| 1610 } | |
| 1611 #endif // PRODUCT | |
| 1612 | |
| 1613 size_t G1CollectedHeap::unsafe_max_alloc() { | |
| 1614 if (_free_regions > 0) return HeapRegion::GrainBytes; | |
| 1615 // otherwise, is there space in the current allocation region? | |
| 1616 | |
| 1617 // We need to store the current allocation region in a local variable | |
| 1618 // here. The problem is that this method doesn't take any locks and | |
| 1619 // there may be other threads which overwrite the current allocation | |
| 1620 // region field. attempt_allocation(), for example, sets it to NULL | |
| 1621 // and this can happen *after* the NULL check here but before the call | |
| 1622 // to free(), resulting in a SIGSEGV. Note that this doesn't appear | |
| 1623 // to be a problem in the optimized build, since the two loads of the | |
| 1624 // current allocation region field are optimized away. | |
| 1625 HeapRegion* car = _cur_alloc_region; | |
| 1626 | |
| 1627 // FIXME: should iterate over all regions? | |
| 1628 if (car == NULL) { | |
| 1629 return 0; | |
| 1630 } | |
| 1631 return car->free(); | |
| 1632 } | |
| 1633 | |
| 1634 void G1CollectedHeap::collect(GCCause::Cause cause) { | |
| 1635 // The caller doesn't have the Heap_lock | |
| 1636 assert(!Heap_lock->owned_by_self(), "this thread should not own the Heap_lock"); | |
| 1637 MutexLocker ml(Heap_lock); | |
| 1638 collect_locked(cause); | |
| 1639 } | |
| 1640 | |
| 1641 void G1CollectedHeap::collect_as_vm_thread(GCCause::Cause cause) { | |
| 1642 assert(Thread::current()->is_VM_thread(), "Precondition#1"); | |
| 1643 assert(Heap_lock->is_locked(), "Precondition#2"); | |
| 1644 GCCauseSetter gcs(this, cause); | |
| 1645 switch (cause) { | |
| 1646 case GCCause::_heap_inspection: | |
| 1647 case GCCause::_heap_dump: { | |
| 1648 HandleMark hm; | |
| 1649 do_full_collection(false); // don't clear all soft refs | |
| 1650 break; | |
| 1651 } | |
| 1652 default: // XXX FIX ME | |
| 1653 ShouldNotReachHere(); // Unexpected use of this function | |
| 1654 } | |
| 1655 } | |
| 1656 | |
| 1657 | |
| 1658 void G1CollectedHeap::collect_locked(GCCause::Cause cause) { | |
| 1659 // Don't want to do a GC until cleanup is completed. | |
| 1660 wait_for_cleanup_complete(); | |
| 1661 | |
| 1662 // Read the GC count while holding the Heap_lock | |
| 1663 int gc_count_before = SharedHeap::heap()->total_collections(); | |
| 1664 { | |
| 1665 MutexUnlocker mu(Heap_lock); // give up heap lock, execute gets it back | |
| 1666 VM_G1CollectFull op(gc_count_before, cause); | |
| 1667 VMThread::execute(&op); | |
| 1668 } | |
| 1669 } | |
| 1670 | |
| 1671 bool G1CollectedHeap::is_in(const void* p) const { | |
| 1672 if (_g1_committed.contains(p)) { | |
| 1673 HeapRegion* hr = _hrs->addr_to_region(p); | |
| 1674 return hr->is_in(p); | |
| 1675 } else { | |
| 1676 return _perm_gen->as_gen()->is_in(p); | |
| 1677 } | |
| 1678 } | |
| 1679 | |
| 1680 // Iteration functions. | |
| 1681 | |
| 1682 // Iterates an OopClosure over all ref-containing fields of objects | |
| 1683 // within a HeapRegion. | |
| 1684 | |
| 1685 class IterateOopClosureRegionClosure: public HeapRegionClosure { | |
| 1686 MemRegion _mr; | |
| 1687 OopClosure* _cl; | |
| 1688 public: | |
| 1689 IterateOopClosureRegionClosure(MemRegion mr, OopClosure* cl) | |
| 1690 : _mr(mr), _cl(cl) {} | |
| 1691 bool doHeapRegion(HeapRegion* r) { | |
| 1692 if (! r->continuesHumongous()) { | |
| 1693 r->oop_iterate(_cl); | |
| 1694 } | |
| 1695 return false; | |
| 1696 } | |
| 1697 }; | |
| 1698 | |
| 1699 void G1CollectedHeap::oop_iterate(OopClosure* cl) { | |
| 1700 IterateOopClosureRegionClosure blk(_g1_committed, cl); | |
| 1701 _hrs->iterate(&blk); | |
| 1702 } | |
| 1703 | |
| 1704 void G1CollectedHeap::oop_iterate(MemRegion mr, OopClosure* cl) { | |
| 1705 IterateOopClosureRegionClosure blk(mr, cl); | |
| 1706 _hrs->iterate(&blk); | |
| 1707 } | |
| 1708 | |
| 1709 // Iterates an ObjectClosure over all objects within a HeapRegion. | |
| 1710 | |
| 1711 class IterateObjectClosureRegionClosure: public HeapRegionClosure { | |
| 1712 ObjectClosure* _cl; | |
| 1713 public: | |
| 1714 IterateObjectClosureRegionClosure(ObjectClosure* cl) : _cl(cl) {} | |
| 1715 bool doHeapRegion(HeapRegion* r) { | |
| 1716 if (! r->continuesHumongous()) { | |
| 1717 r->object_iterate(_cl); | |
| 1718 } | |
| 1719 return false; | |
| 1720 } | |
| 1721 }; | |
| 1722 | |
| 1723 void G1CollectedHeap::object_iterate(ObjectClosure* cl) { | |
| 1724 IterateObjectClosureRegionClosure blk(cl); | |
| 1725 _hrs->iterate(&blk); | |
| 1726 } | |
| 1727 | |
| 1728 void G1CollectedHeap::object_iterate_since_last_GC(ObjectClosure* cl) { | |
| 1729 // FIXME: is this right? | |
| 1730 guarantee(false, "object_iterate_since_last_GC not supported by G1 heap"); | |
| 1731 } | |
| 1732 | |
| 1733 // Calls a SpaceClosure on a HeapRegion. | |
| 1734 | |
| 1735 class SpaceClosureRegionClosure: public HeapRegionClosure { | |
| 1736 SpaceClosure* _cl; | |
| 1737 public: | |
| 1738 SpaceClosureRegionClosure(SpaceClosure* cl) : _cl(cl) {} | |
| 1739 bool doHeapRegion(HeapRegion* r) { | |
| 1740 _cl->do_space(r); | |
| 1741 return false; | |
| 1742 } | |
| 1743 }; | |
| 1744 | |
| 1745 void G1CollectedHeap::space_iterate(SpaceClosure* cl) { | |
| 1746 SpaceClosureRegionClosure blk(cl); | |
| 1747 _hrs->iterate(&blk); | |
| 1748 } | |
| 1749 | |
| 1750 void G1CollectedHeap::heap_region_iterate(HeapRegionClosure* cl) { | |
| 1751 _hrs->iterate(cl); | |
| 1752 } | |
| 1753 | |
| 1754 void G1CollectedHeap::heap_region_iterate_from(HeapRegion* r, | |
| 1755 HeapRegionClosure* cl) { | |
| 1756 _hrs->iterate_from(r, cl); | |
| 1757 } | |
| 1758 | |
| 1759 void | |
| 1760 G1CollectedHeap::heap_region_iterate_from(int idx, HeapRegionClosure* cl) { | |
| 1761 _hrs->iterate_from(idx, cl); | |
| 1762 } | |
| 1763 | |
| 1764 HeapRegion* G1CollectedHeap::region_at(size_t idx) { return _hrs->at(idx); } | |
| 1765 | |
| 1766 void | |
| 1767 G1CollectedHeap::heap_region_par_iterate_chunked(HeapRegionClosure* cl, | |
| 1768 int worker, | |
| 1769 jint claim_value) { | |
| 355 | 1770 const size_t regions = n_regions(); |
| 1771 const size_t worker_num = (ParallelGCThreads > 0 ? ParallelGCThreads : 1); | |
| 1772 // try to spread out the starting points of the workers | |
| 1773 const size_t start_index = regions / worker_num * (size_t) worker; | |
| 1774 | |
| 1775 // each worker will actually look at all regions | |
| 1776 for (size_t count = 0; count < regions; ++count) { | |
| 1777 const size_t index = (start_index + count) % regions; | |
| 1778 assert(0 <= index && index < regions, "sanity"); | |
| 1779 HeapRegion* r = region_at(index); | |
| 1780 // we'll ignore "continues humongous" regions (we'll process them | |
| 1781 // when we come across their corresponding "start humongous" | |
| 1782 // region) and regions already claimed | |
| 1783 if (r->claim_value() == claim_value || r->continuesHumongous()) { | |
| 1784 continue; | |
| 1785 } | |
| 1786 // OK, try to claim it | |
| 342 | 1787 if (r->claimHeapRegion(claim_value)) { |
| 355 | 1788 // success! |
| 1789 assert(!r->continuesHumongous(), "sanity"); | |
| 1790 if (r->startsHumongous()) { | |
| 1791 // If the region is "starts humongous" we'll iterate over its | |
| 1792 // "continues humongous" first; in fact we'll do them | |
| 1793 // first. The order is important. In on case, calling the | |
| 1794 // closure on the "starts humongous" region might de-allocate | |
| 1795 // and clear all its "continues humongous" regions and, as a | |
| 1796 // result, we might end up processing them twice. So, we'll do | |
| 1797 // them first (notice: most closures will ignore them anyway) and | |
| 1798 // then we'll do the "starts humongous" region. | |
| 1799 for (size_t ch_index = index + 1; ch_index < regions; ++ch_index) { | |
| 1800 HeapRegion* chr = region_at(ch_index); | |
| 1801 | |
| 1802 // if the region has already been claimed or it's not | |
| 1803 // "continues humongous" we're done | |
| 1804 if (chr->claim_value() == claim_value || | |
| 1805 !chr->continuesHumongous()) { | |
| 1806 break; | |
| 1807 } | |
| 1808 | |
| 1809 // Noone should have claimed it directly. We can given | |
| 1810 // that we claimed its "starts humongous" region. | |
| 1811 assert(chr->claim_value() != claim_value, "sanity"); | |
| 1812 assert(chr->humongous_start_region() == r, "sanity"); | |
| 1813 | |
| 1814 if (chr->claimHeapRegion(claim_value)) { | |
| 1815 // we should always be able to claim it; noone else should | |
| 1816 // be trying to claim this region | |
| 1817 | |
| 1818 bool res2 = cl->doHeapRegion(chr); | |
| 1819 assert(!res2, "Should not abort"); | |
| 1820 | |
| 1821 // Right now, this holds (i.e., no closure that actually | |
| 1822 // does something with "continues humongous" regions | |
| 1823 // clears them). We might have to weaken it in the future, | |
| 1824 // but let's leave these two asserts here for extra safety. | |
| 1825 assert(chr->continuesHumongous(), "should still be the case"); | |
| 1826 assert(chr->humongous_start_region() == r, "sanity"); | |
| 1827 } else { | |
| 1828 guarantee(false, "we should not reach here"); | |
| 1829 } | |
| 1830 } | |
| 1831 } | |
| 1832 | |
| 1833 assert(!r->continuesHumongous(), "sanity"); | |
| 1834 bool res = cl->doHeapRegion(r); | |
| 1835 assert(!res, "Should not abort"); | |
| 1836 } | |
| 1837 } | |
| 1838 } | |
| 1839 | |
| 390 | 1840 class ResetClaimValuesClosure: public HeapRegionClosure { |
| 1841 public: | |
| 1842 bool doHeapRegion(HeapRegion* r) { | |
| 1843 r->set_claim_value(HeapRegion::InitialClaimValue); | |
| 1844 return false; | |
| 1845 } | |
| 1846 }; | |
| 1847 | |
| 1848 void | |
| 1849 G1CollectedHeap::reset_heap_region_claim_values() { | |
| 1850 ResetClaimValuesClosure blk; | |
| 1851 heap_region_iterate(&blk); | |
| 1852 } | |
| 1853 | |
| 355 | 1854 #ifdef ASSERT |
| 1855 // This checks whether all regions in the heap have the correct claim | |
| 1856 // value. I also piggy-backed on this a check to ensure that the | |
| 1857 // humongous_start_region() information on "continues humongous" | |
| 1858 // regions is correct. | |
| 1859 | |
| 1860 class CheckClaimValuesClosure : public HeapRegionClosure { | |
| 1861 private: | |
| 1862 jint _claim_value; | |
| 1863 size_t _failures; | |
| 1864 HeapRegion* _sh_region; | |
| 1865 public: | |
| 1866 CheckClaimValuesClosure(jint claim_value) : | |
| 1867 _claim_value(claim_value), _failures(0), _sh_region(NULL) { } | |
| 1868 bool doHeapRegion(HeapRegion* r) { | |
| 1869 if (r->claim_value() != _claim_value) { | |
| 1870 gclog_or_tty->print_cr("Region ["PTR_FORMAT","PTR_FORMAT"), " | |
| 1871 "claim value = %d, should be %d", | |
| 1872 r->bottom(), r->end(), r->claim_value(), | |
| 1873 _claim_value); | |
| 1874 ++_failures; | |
| 1875 } | |
| 1876 if (!r->isHumongous()) { | |
| 1877 _sh_region = NULL; | |
| 1878 } else if (r->startsHumongous()) { | |
| 1879 _sh_region = r; | |
| 1880 } else if (r->continuesHumongous()) { | |
| 1881 if (r->humongous_start_region() != _sh_region) { | |
| 1882 gclog_or_tty->print_cr("Region ["PTR_FORMAT","PTR_FORMAT"), " | |
| 1883 "HS = "PTR_FORMAT", should be "PTR_FORMAT, | |
| 1884 r->bottom(), r->end(), | |
| 1885 r->humongous_start_region(), | |
| 1886 _sh_region); | |
| 1887 ++_failures; | |
| 342 | 1888 } |
| 1889 } | |
| 355 | 1890 return false; |
| 1891 } | |
| 1892 size_t failures() { | |
| 1893 return _failures; | |
| 1894 } | |
| 1895 }; | |
| 1896 | |
| 1897 bool G1CollectedHeap::check_heap_region_claim_values(jint claim_value) { | |
| 1898 CheckClaimValuesClosure cl(claim_value); | |
| 1899 heap_region_iterate(&cl); | |
| 1900 return cl.failures() == 0; | |
| 1901 } | |
| 1902 #endif // ASSERT | |
| 342 | 1903 |
| 1904 void G1CollectedHeap::collection_set_iterate(HeapRegionClosure* cl) { | |
| 1905 HeapRegion* r = g1_policy()->collection_set(); | |
| 1906 while (r != NULL) { | |
| 1907 HeapRegion* next = r->next_in_collection_set(); | |
| 1908 if (cl->doHeapRegion(r)) { | |
| 1909 cl->incomplete(); | |
| 1910 return; | |
| 1911 } | |
| 1912 r = next; | |
| 1913 } | |
| 1914 } | |
| 1915 | |
| 1916 void G1CollectedHeap::collection_set_iterate_from(HeapRegion* r, | |
| 1917 HeapRegionClosure *cl) { | |
| 1918 assert(r->in_collection_set(), | |
| 1919 "Start region must be a member of the collection set."); | |
| 1920 HeapRegion* cur = r; | |
| 1921 while (cur != NULL) { | |
| 1922 HeapRegion* next = cur->next_in_collection_set(); | |
| 1923 if (cl->doHeapRegion(cur) && false) { | |
| 1924 cl->incomplete(); | |
| 1925 return; | |
| 1926 } | |
| 1927 cur = next; | |
| 1928 } | |
| 1929 cur = g1_policy()->collection_set(); | |
| 1930 while (cur != r) { | |
| 1931 HeapRegion* next = cur->next_in_collection_set(); | |
| 1932 if (cl->doHeapRegion(cur) && false) { | |
| 1933 cl->incomplete(); | |
| 1934 return; | |
| 1935 } | |
| 1936 cur = next; | |
| 1937 } | |
| 1938 } | |
| 1939 | |
| 1940 CompactibleSpace* G1CollectedHeap::first_compactible_space() { | |
| 1941 return _hrs->length() > 0 ? _hrs->at(0) : NULL; | |
| 1942 } | |
| 1943 | |
| 1944 | |
| 1945 Space* G1CollectedHeap::space_containing(const void* addr) const { | |
| 1946 Space* res = heap_region_containing(addr); | |
| 1947 if (res == NULL) | |
| 1948 res = perm_gen()->space_containing(addr); | |
| 1949 return res; | |
| 1950 } | |
| 1951 | |
| 1952 HeapWord* G1CollectedHeap::block_start(const void* addr) const { | |
| 1953 Space* sp = space_containing(addr); | |
| 1954 if (sp != NULL) { | |
| 1955 return sp->block_start(addr); | |
| 1956 } | |
| 1957 return NULL; | |
| 1958 } | |
| 1959 | |
| 1960 size_t G1CollectedHeap::block_size(const HeapWord* addr) const { | |
| 1961 Space* sp = space_containing(addr); | |
| 1962 assert(sp != NULL, "block_size of address outside of heap"); | |
| 1963 return sp->block_size(addr); | |
| 1964 } | |
| 1965 | |
| 1966 bool G1CollectedHeap::block_is_obj(const HeapWord* addr) const { | |
| 1967 Space* sp = space_containing(addr); | |
| 1968 return sp->block_is_obj(addr); | |
| 1969 } | |
| 1970 | |
| 1971 bool G1CollectedHeap::supports_tlab_allocation() const { | |
| 1972 return true; | |
| 1973 } | |
| 1974 | |
| 1975 size_t G1CollectedHeap::tlab_capacity(Thread* ignored) const { | |
| 1976 return HeapRegion::GrainBytes; | |
| 1977 } | |
| 1978 | |
| 1979 size_t G1CollectedHeap::unsafe_max_tlab_alloc(Thread* ignored) const { | |
| 1980 // Return the remaining space in the cur alloc region, but not less than | |
| 1981 // the min TLAB size. | |
| 1982 // Also, no more than half the region size, since we can't allow tlabs to | |
| 1983 // grow big enough to accomodate humongous objects. | |
| 1984 | |
| 1985 // We need to story it locally, since it might change between when we | |
| 1986 // test for NULL and when we use it later. | |
| 1987 ContiguousSpace* cur_alloc_space = _cur_alloc_region; | |
| 1988 if (cur_alloc_space == NULL) { | |
| 1989 return HeapRegion::GrainBytes/2; | |
| 1990 } else { | |
| 1991 return MAX2(MIN2(cur_alloc_space->free(), | |
| 1992 (size_t)(HeapRegion::GrainBytes/2)), | |
| 1993 (size_t)MinTLABSize); | |
| 1994 } | |
| 1995 } | |
| 1996 | |
| 1997 HeapWord* G1CollectedHeap::allocate_new_tlab(size_t size) { | |
| 1998 bool dummy; | |
| 1999 return G1CollectedHeap::mem_allocate(size, false, true, &dummy); | |
| 2000 } | |
| 2001 | |
| 2002 bool G1CollectedHeap::allocs_are_zero_filled() { | |
| 2003 return false; | |
| 2004 } | |
| 2005 | |
| 2006 size_t G1CollectedHeap::large_typearray_limit() { | |
| 2007 // FIXME | |
| 2008 return HeapRegion::GrainBytes/HeapWordSize; | |
| 2009 } | |
| 2010 | |
| 2011 size_t G1CollectedHeap::max_capacity() const { | |
| 2012 return _g1_committed.byte_size(); | |
| 2013 } | |
| 2014 | |
| 2015 jlong G1CollectedHeap::millis_since_last_gc() { | |
| 2016 // assert(false, "NYI"); | |
| 2017 return 0; | |
| 2018 } | |
| 2019 | |
| 2020 | |
| 2021 void G1CollectedHeap::prepare_for_verify() { | |
| 2022 if (SafepointSynchronize::is_at_safepoint() || ! UseTLAB) { | |
| 2023 ensure_parsability(false); | |
| 2024 } | |
| 2025 g1_rem_set()->prepare_for_verify(); | |
| 2026 } | |
| 2027 | |
| 2028 class VerifyLivenessOopClosure: public OopClosure { | |
| 2029 G1CollectedHeap* g1h; | |
| 2030 public: | |
| 2031 VerifyLivenessOopClosure(G1CollectedHeap* _g1h) { | |
| 2032 g1h = _g1h; | |
| 2033 } | |
| 2034 void do_oop(narrowOop *p) { | |
| 2035 guarantee(false, "NYI"); | |
| 2036 } | |
| 2037 void do_oop(oop *p) { | |
| 2038 oop obj = *p; | |
| 2039 assert(obj == NULL || !g1h->is_obj_dead(obj), | |
| 2040 "Dead object referenced by a not dead object"); | |
| 2041 } | |
| 2042 }; | |
| 2043 | |
| 2044 class VerifyObjsInRegionClosure: public ObjectClosure { | |
| 2045 G1CollectedHeap* _g1h; | |
| 2046 size_t _live_bytes; | |
| 2047 HeapRegion *_hr; | |
| 2048 public: | |
| 2049 VerifyObjsInRegionClosure(HeapRegion *hr) : _live_bytes(0), _hr(hr) { | |
| 2050 _g1h = G1CollectedHeap::heap(); | |
| 2051 } | |
| 2052 void do_object(oop o) { | |
| 2053 VerifyLivenessOopClosure isLive(_g1h); | |
| 2054 assert(o != NULL, "Huh?"); | |
| 2055 if (!_g1h->is_obj_dead(o)) { | |
| 2056 o->oop_iterate(&isLive); | |
| 2057 if (!_hr->obj_allocated_since_prev_marking(o)) | |
| 2058 _live_bytes += (o->size() * HeapWordSize); | |
| 2059 } | |
| 2060 } | |
| 2061 size_t live_bytes() { return _live_bytes; } | |
| 2062 }; | |
| 2063 | |
| 2064 class PrintObjsInRegionClosure : public ObjectClosure { | |
| 2065 HeapRegion *_hr; | |
| 2066 G1CollectedHeap *_g1; | |
| 2067 public: | |
| 2068 PrintObjsInRegionClosure(HeapRegion *hr) : _hr(hr) { | |
| 2069 _g1 = G1CollectedHeap::heap(); | |
| 2070 }; | |
| 2071 | |
| 2072 void do_object(oop o) { | |
| 2073 if (o != NULL) { | |
| 2074 HeapWord *start = (HeapWord *) o; | |
| 2075 size_t word_sz = o->size(); | |
| 2076 gclog_or_tty->print("\nPrinting obj "PTR_FORMAT" of size " SIZE_FORMAT | |
| 2077 " isMarkedPrev %d isMarkedNext %d isAllocSince %d\n", | |
| 2078 (void*) o, word_sz, | |
| 2079 _g1->isMarkedPrev(o), | |
| 2080 _g1->isMarkedNext(o), | |
| 2081 _hr->obj_allocated_since_prev_marking(o)); | |
| 2082 HeapWord *end = start + word_sz; | |
| 2083 HeapWord *cur; | |
| 2084 int *val; | |
| 2085 for (cur = start; cur < end; cur++) { | |
| 2086 val = (int *) cur; | |
| 2087 gclog_or_tty->print("\t "PTR_FORMAT":"PTR_FORMAT"\n", val, *val); | |
| 2088 } | |
| 2089 } | |
| 2090 } | |
| 2091 }; | |
| 2092 | |
| 2093 class VerifyRegionClosure: public HeapRegionClosure { | |
| 2094 public: | |
| 2095 bool _allow_dirty; | |
| 390 | 2096 bool _par; |
| 2097 VerifyRegionClosure(bool allow_dirty, bool par = false) | |
| 2098 : _allow_dirty(allow_dirty), _par(par) {} | |
| 342 | 2099 bool doHeapRegion(HeapRegion* r) { |
| 390 | 2100 guarantee(_par || r->claim_value() == HeapRegion::InitialClaimValue, |
| 2101 "Should be unclaimed at verify points."); | |
| 342 | 2102 if (r->isHumongous()) { |
| 2103 if (r->startsHumongous()) { | |
| 2104 // Verify the single H object. | |
| 2105 oop(r->bottom())->verify(); | |
| 2106 size_t word_sz = oop(r->bottom())->size(); | |
| 2107 guarantee(r->top() == r->bottom() + word_sz, | |
| 2108 "Only one object in a humongous region"); | |
| 2109 } | |
| 2110 } else { | |
| 2111 VerifyObjsInRegionClosure not_dead_yet_cl(r); | |
| 2112 r->verify(_allow_dirty); | |
| 2113 r->object_iterate(¬_dead_yet_cl); | |
| 2114 guarantee(r->max_live_bytes() >= not_dead_yet_cl.live_bytes(), | |
| 2115 "More live objects than counted in last complete marking."); | |
| 2116 } | |
| 2117 return false; | |
| 2118 } | |
| 2119 }; | |
| 2120 | |
| 2121 class VerifyRootsClosure: public OopsInGenClosure { | |
| 2122 private: | |
| 2123 G1CollectedHeap* _g1h; | |
| 2124 bool _failures; | |
| 2125 | |
| 2126 public: | |
| 2127 VerifyRootsClosure() : | |
| 2128 _g1h(G1CollectedHeap::heap()), _failures(false) { } | |
| 2129 | |
| 2130 bool failures() { return _failures; } | |
| 2131 | |
| 2132 void do_oop(narrowOop* p) { | |
| 2133 guarantee(false, "NYI"); | |
| 2134 } | |
| 2135 | |
| 2136 void do_oop(oop* p) { | |
| 2137 oop obj = *p; | |
| 2138 if (obj != NULL) { | |
| 2139 if (_g1h->is_obj_dead(obj)) { | |
| 2140 gclog_or_tty->print_cr("Root location "PTR_FORMAT" " | |
| 2141 "points to dead obj "PTR_FORMAT, p, (void*) obj); | |
| 2142 obj->print_on(gclog_or_tty); | |
| 2143 _failures = true; | |
| 2144 } | |
| 2145 } | |
| 2146 } | |
| 2147 }; | |
| 2148 | |
| 390 | 2149 // This is the task used for parallel heap verification. |
| 2150 | |
| 2151 class G1ParVerifyTask: public AbstractGangTask { | |
| 2152 private: | |
| 2153 G1CollectedHeap* _g1h; | |
| 2154 bool _allow_dirty; | |
| 2155 | |
| 2156 public: | |
| 2157 G1ParVerifyTask(G1CollectedHeap* g1h, bool allow_dirty) : | |
| 2158 AbstractGangTask("Parallel verify task"), | |
| 2159 _g1h(g1h), _allow_dirty(allow_dirty) { } | |
| 2160 | |
| 2161 void work(int worker_i) { | |
| 2162 VerifyRegionClosure blk(_allow_dirty, true); | |
| 2163 _g1h->heap_region_par_iterate_chunked(&blk, worker_i, | |
| 2164 HeapRegion::ParVerifyClaimValue); | |
| 2165 } | |
| 2166 }; | |
| 2167 | |
| 342 | 2168 void G1CollectedHeap::verify(bool allow_dirty, bool silent) { |
| 2169 if (SafepointSynchronize::is_at_safepoint() || ! UseTLAB) { | |
| 2170 if (!silent) { gclog_or_tty->print("roots "); } | |
| 2171 VerifyRootsClosure rootsCl; | |
| 2172 process_strong_roots(false, | |
| 2173 SharedHeap::SO_AllClasses, | |
| 2174 &rootsCl, | |
| 2175 &rootsCl); | |
| 2176 rem_set()->invalidate(perm_gen()->used_region(), false); | |
| 2177 if (!silent) { gclog_or_tty->print("heapRegions "); } | |
| 390 | 2178 if (GCParallelVerificationEnabled && ParallelGCThreads > 1) { |
| 2179 assert(check_heap_region_claim_values(HeapRegion::InitialClaimValue), | |
| 2180 "sanity check"); | |
| 2181 | |
| 2182 G1ParVerifyTask task(this, allow_dirty); | |
| 2183 int n_workers = workers()->total_workers(); | |
| 2184 set_par_threads(n_workers); | |
| 2185 workers()->run_task(&task); | |
| 2186 set_par_threads(0); | |
| 2187 | |
| 2188 assert(check_heap_region_claim_values(HeapRegion::ParVerifyClaimValue), | |
| 2189 "sanity check"); | |
| 2190 | |
| 2191 reset_heap_region_claim_values(); | |
| 2192 | |
| 2193 assert(check_heap_region_claim_values(HeapRegion::InitialClaimValue), | |
| 2194 "sanity check"); | |
| 2195 } else { | |
| 2196 VerifyRegionClosure blk(allow_dirty); | |
| 2197 _hrs->iterate(&blk); | |
| 2198 } | |
| 342 | 2199 if (!silent) gclog_or_tty->print("remset "); |
| 2200 rem_set()->verify(); | |
| 2201 guarantee(!rootsCl.failures(), "should not have had failures"); | |
| 2202 } else { | |
| 2203 if (!silent) gclog_or_tty->print("(SKIPPING roots, heapRegions, remset) "); | |
| 2204 } | |
| 2205 } | |
| 2206 | |
| 2207 class PrintRegionClosure: public HeapRegionClosure { | |
| 2208 outputStream* _st; | |
| 2209 public: | |
| 2210 PrintRegionClosure(outputStream* st) : _st(st) {} | |
| 2211 bool doHeapRegion(HeapRegion* r) { | |
| 2212 r->print_on(_st); | |
| 2213 return false; | |
| 2214 } | |
| 2215 }; | |
| 2216 | |
| 2217 void G1CollectedHeap::print() const { print_on(gclog_or_tty); } | |
| 2218 | |
| 2219 void G1CollectedHeap::print_on(outputStream* st) const { | |
| 2220 PrintRegionClosure blk(st); | |
| 2221 _hrs->iterate(&blk); | |
| 2222 } | |
| 2223 | |
| 2224 void G1CollectedHeap::print_gc_threads_on(outputStream* st) const { | |
| 2225 if (ParallelGCThreads > 0) { | |
| 2226 workers()->print_worker_threads(); | |
| 2227 } | |
| 2228 st->print("\"G1 concurrent mark GC Thread\" "); | |
| 2229 _cmThread->print(); | |
| 2230 st->cr(); | |
| 2231 st->print("\"G1 concurrent refinement GC Thread\" "); | |
| 2232 _cg1r->cg1rThread()->print_on(st); | |
| 2233 st->cr(); | |
| 2234 st->print("\"G1 zero-fill GC Thread\" "); | |
| 2235 _czft->print_on(st); | |
| 2236 st->cr(); | |
| 2237 } | |
| 2238 | |
| 2239 void G1CollectedHeap::gc_threads_do(ThreadClosure* tc) const { | |
| 2240 if (ParallelGCThreads > 0) { | |
| 2241 workers()->threads_do(tc); | |
| 2242 } | |
| 2243 tc->do_thread(_cmThread); | |
| 2244 tc->do_thread(_cg1r->cg1rThread()); | |
| 2245 tc->do_thread(_czft); | |
| 2246 } | |
| 2247 | |
| 2248 void G1CollectedHeap::print_tracing_info() const { | |
| 2249 concurrent_g1_refine()->print_final_card_counts(); | |
| 2250 | |
| 2251 // We'll overload this to mean "trace GC pause statistics." | |
| 2252 if (TraceGen0Time || TraceGen1Time) { | |
| 2253 // The "G1CollectorPolicy" is keeping track of these stats, so delegate | |
| 2254 // to that. | |
| 2255 g1_policy()->print_tracing_info(); | |
| 2256 } | |
| 2257 if (SummarizeG1RSStats) { | |
| 2258 g1_rem_set()->print_summary_info(); | |
| 2259 } | |
| 2260 if (SummarizeG1ConcMark) { | |
| 2261 concurrent_mark()->print_summary_info(); | |
| 2262 } | |
| 2263 if (SummarizeG1ZFStats) { | |
| 2264 ConcurrentZFThread::print_summary_info(); | |
| 2265 } | |
| 2266 if (G1SummarizePopularity) { | |
| 2267 print_popularity_summary_info(); | |
| 2268 } | |
| 2269 g1_policy()->print_yg_surv_rate_info(); | |
| 2270 | |
| 2271 GCOverheadReporter::printGCOverhead(); | |
| 2272 | |
| 2273 SpecializationStats::print(); | |
| 2274 } | |
| 2275 | |
| 2276 | |
| 2277 int G1CollectedHeap::addr_to_arena_id(void* addr) const { | |
| 2278 HeapRegion* hr = heap_region_containing(addr); | |
| 2279 if (hr == NULL) { | |
| 2280 return 0; | |
| 2281 } else { | |
| 2282 return 1; | |
| 2283 } | |
| 2284 } | |
| 2285 | |
| 2286 G1CollectedHeap* G1CollectedHeap::heap() { | |
| 2287 assert(_sh->kind() == CollectedHeap::G1CollectedHeap, | |
| 2288 "not a garbage-first heap"); | |
| 2289 return _g1h; | |
| 2290 } | |
| 2291 | |
| 2292 void G1CollectedHeap::gc_prologue(bool full /* Ignored */) { | |
| 2293 if (PrintHeapAtGC){ | |
| 2294 gclog_or_tty->print_cr(" {Heap before GC collections=%d:", total_collections()); | |
| 2295 Universe::print(); | |
| 2296 } | |
| 2297 assert(InlineCacheBuffer::is_empty(), "should have cleaned up ICBuffer"); | |
| 2298 // Call allocation profiler | |
| 2299 AllocationProfiler::iterate_since_last_gc(); | |
| 2300 // Fill TLAB's and such | |
| 2301 ensure_parsability(true); | |
| 2302 } | |
| 2303 | |
| 2304 void G1CollectedHeap::gc_epilogue(bool full /* Ignored */) { | |
| 2305 // FIXME: what is this about? | |
| 2306 // I'm ignoring the "fill_newgen()" call if "alloc_event_enabled" | |
| 2307 // is set. | |
| 2308 COMPILER2_PRESENT(assert(DerivedPointerTable::is_empty(), | |
| 2309 "derived pointer present")); | |
| 2310 | |
| 2311 if (PrintHeapAtGC){ | |
| 2312 gclog_or_tty->print_cr(" Heap after GC collections=%d:", total_collections()); | |
| 2313 Universe::print(); | |
| 2314 gclog_or_tty->print("} "); | |
| 2315 } | |
| 2316 } | |
| 2317 | |
| 2318 void G1CollectedHeap::do_collection_pause() { | |
| 2319 // Read the GC count while holding the Heap_lock | |
| 2320 // we need to do this _before_ wait_for_cleanup_complete(), to | |
| 2321 // ensure that we do not give up the heap lock and potentially | |
| 2322 // pick up the wrong count | |
| 2323 int gc_count_before = SharedHeap::heap()->total_collections(); | |
| 2324 | |
| 2325 // Don't want to do a GC pause while cleanup is being completed! | |
| 2326 wait_for_cleanup_complete(); | |
| 2327 | |
| 2328 g1_policy()->record_stop_world_start(); | |
| 2329 { | |
| 2330 MutexUnlocker mu(Heap_lock); // give up heap lock, execute gets it back | |
| 2331 VM_G1IncCollectionPause op(gc_count_before); | |
| 2332 VMThread::execute(&op); | |
| 2333 } | |
| 2334 } | |
| 2335 | |
| 2336 void | |
| 2337 G1CollectedHeap::doConcurrentMark() { | |
| 2338 if (G1ConcMark) { | |
| 2339 MutexLockerEx x(CGC_lock, Mutex::_no_safepoint_check_flag); | |
| 2340 if (!_cmThread->in_progress()) { | |
| 2341 _cmThread->set_started(); | |
| 2342 CGC_lock->notify(); | |
| 2343 } | |
| 2344 } | |
| 2345 } | |
| 2346 | |
| 2347 class VerifyMarkedObjsClosure: public ObjectClosure { | |
| 2348 G1CollectedHeap* _g1h; | |
| 2349 public: | |
| 2350 VerifyMarkedObjsClosure(G1CollectedHeap* g1h) : _g1h(g1h) {} | |
| 2351 void do_object(oop obj) { | |
| 2352 assert(obj->mark()->is_marked() ? !_g1h->is_obj_dead(obj) : true, | |
| 2353 "markandsweep mark should agree with concurrent deadness"); | |
| 2354 } | |
| 2355 }; | |
| 2356 | |
| 2357 void | |
| 2358 G1CollectedHeap::checkConcurrentMark() { | |
| 2359 VerifyMarkedObjsClosure verifycl(this); | |
| 2360 // MutexLockerEx x(getMarkBitMapLock(), | |
| 2361 // Mutex::_no_safepoint_check_flag); | |
| 2362 object_iterate(&verifycl); | |
| 2363 } | |
| 2364 | |
| 2365 void G1CollectedHeap::do_sync_mark() { | |
| 2366 _cm->checkpointRootsInitial(); | |
| 2367 _cm->markFromRoots(); | |
| 2368 _cm->checkpointRootsFinal(false); | |
| 2369 } | |
| 2370 | |
| 2371 // <NEW PREDICTION> | |
| 2372 | |
| 2373 double G1CollectedHeap::predict_region_elapsed_time_ms(HeapRegion *hr, | |
| 2374 bool young) { | |
| 2375 return _g1_policy->predict_region_elapsed_time_ms(hr, young); | |
| 2376 } | |
| 2377 | |
| 2378 void G1CollectedHeap::check_if_region_is_too_expensive(double | |
| 2379 predicted_time_ms) { | |
| 2380 _g1_policy->check_if_region_is_too_expensive(predicted_time_ms); | |
| 2381 } | |
| 2382 | |
| 2383 size_t G1CollectedHeap::pending_card_num() { | |
| 2384 size_t extra_cards = 0; | |
| 2385 JavaThread *curr = Threads::first(); | |
| 2386 while (curr != NULL) { | |
| 2387 DirtyCardQueue& dcq = curr->dirty_card_queue(); | |
| 2388 extra_cards += dcq.size(); | |
| 2389 curr = curr->next(); | |
| 2390 } | |
| 2391 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set(); | |
| 2392 size_t buffer_size = dcqs.buffer_size(); | |
| 2393 size_t buffer_num = dcqs.completed_buffers_num(); | |
| 2394 return buffer_size * buffer_num + extra_cards; | |
| 2395 } | |
| 2396 | |
| 2397 size_t G1CollectedHeap::max_pending_card_num() { | |
| 2398 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set(); | |
| 2399 size_t buffer_size = dcqs.buffer_size(); | |
| 2400 size_t buffer_num = dcqs.completed_buffers_num(); | |
| 2401 int thread_num = Threads::number_of_threads(); | |
| 2402 return (buffer_num + thread_num) * buffer_size; | |
| 2403 } | |
| 2404 | |
| 2405 size_t G1CollectedHeap::cards_scanned() { | |
| 2406 HRInto_G1RemSet* g1_rset = (HRInto_G1RemSet*) g1_rem_set(); | |
| 2407 return g1_rset->cardsScanned(); | |
| 2408 } | |
| 2409 | |
| 2410 void | |
| 2411 G1CollectedHeap::setup_surviving_young_words() { | |
| 2412 guarantee( _surviving_young_words == NULL, "pre-condition" ); | |
| 2413 size_t array_length = g1_policy()->young_cset_length(); | |
| 2414 _surviving_young_words = NEW_C_HEAP_ARRAY(size_t, array_length); | |
| 2415 if (_surviving_young_words == NULL) { | |
| 2416 vm_exit_out_of_memory(sizeof(size_t) * array_length, | |
| 2417 "Not enough space for young surv words summary."); | |
| 2418 } | |
| 2419 memset(_surviving_young_words, 0, array_length * sizeof(size_t)); | |
| 2420 for (size_t i = 0; i < array_length; ++i) { | |
| 2421 guarantee( _surviving_young_words[i] == 0, "invariant" ); | |
| 2422 } | |
| 2423 } | |
| 2424 | |
| 2425 void | |
| 2426 G1CollectedHeap::update_surviving_young_words(size_t* surv_young_words) { | |
| 2427 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag); | |
| 2428 size_t array_length = g1_policy()->young_cset_length(); | |
| 2429 for (size_t i = 0; i < array_length; ++i) | |
| 2430 _surviving_young_words[i] += surv_young_words[i]; | |
| 2431 } | |
| 2432 | |
| 2433 void | |
| 2434 G1CollectedHeap::cleanup_surviving_young_words() { | |
| 2435 guarantee( _surviving_young_words != NULL, "pre-condition" ); | |
| 2436 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words); | |
| 2437 _surviving_young_words = NULL; | |
| 2438 } | |
| 2439 | |
| 2440 // </NEW PREDICTION> | |
| 2441 | |
| 2442 void | |
| 2443 G1CollectedHeap::do_collection_pause_at_safepoint(HeapRegion* popular_region) { | |
| 2444 char verbose_str[128]; | |
| 2445 sprintf(verbose_str, "GC pause "); | |
| 2446 if (popular_region != NULL) | |
| 2447 strcat(verbose_str, "(popular)"); | |
| 2448 else if (g1_policy()->in_young_gc_mode()) { | |
| 2449 if (g1_policy()->full_young_gcs()) | |
| 2450 strcat(verbose_str, "(young)"); | |
| 2451 else | |
| 2452 strcat(verbose_str, "(partial)"); | |
| 2453 } | |
| 2454 bool reset_should_initiate_conc_mark = false; | |
| 2455 if (popular_region != NULL && g1_policy()->should_initiate_conc_mark()) { | |
| 2456 // we currently do not allow an initial mark phase to be piggy-backed | |
| 2457 // on a popular pause | |
| 2458 reset_should_initiate_conc_mark = true; | |
| 2459 g1_policy()->unset_should_initiate_conc_mark(); | |
| 2460 } | |
| 2461 if (g1_policy()->should_initiate_conc_mark()) | |
| 2462 strcat(verbose_str, " (initial-mark)"); | |
| 2463 | |
| 2464 GCCauseSetter x(this, (popular_region == NULL ? | |
| 2465 GCCause::_g1_inc_collection_pause : | |
| 2466 GCCause::_g1_pop_region_collection_pause)); | |
| 2467 | |
| 2468 // if PrintGCDetails is on, we'll print long statistics information | |
| 2469 // in the collector policy code, so let's not print this as the output | |
| 2470 // is messy if we do. | |
| 2471 gclog_or_tty->date_stamp(PrintGC && PrintGCDateStamps); | |
| 2472 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 2473 TraceTime t(verbose_str, PrintGC && !PrintGCDetails, true, gclog_or_tty); | |
| 2474 | |
| 2475 ResourceMark rm; | |
| 2476 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); | |
| 2477 assert(Thread::current() == VMThread::vm_thread(), "should be in vm thread"); | |
| 2478 guarantee(!is_gc_active(), "collection is not reentrant"); | |
| 2479 assert(regions_accounted_for(), "Region leakage!"); | |
|
353
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
352
diff
changeset
|
2480 |
|
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
352
diff
changeset
|
2481 increment_gc_time_stamp(); |
| 342 | 2482 |
| 2483 if (g1_policy()->in_young_gc_mode()) { | |
| 2484 assert(check_young_list_well_formed(), | |
| 2485 "young list should be well formed"); | |
| 2486 } | |
| 2487 | |
| 2488 if (GC_locker::is_active()) { | |
| 2489 return; // GC is disabled (e.g. JNI GetXXXCritical operation) | |
| 2490 } | |
| 2491 | |
| 2492 bool abandoned = false; | |
| 2493 { // Call to jvmpi::post_class_unload_events must occur outside of active GC | |
| 2494 IsGCActiveMark x; | |
| 2495 | |
| 2496 gc_prologue(false); | |
| 2497 increment_total_collections(); | |
| 2498 | |
| 2499 #if G1_REM_SET_LOGGING | |
| 2500 gclog_or_tty->print_cr("\nJust chose CS, heap:"); | |
| 2501 print(); | |
| 2502 #endif | |
| 2503 | |
| 2504 if (VerifyBeforeGC && total_collections() >= VerifyGCStartAt) { | |
| 2505 HandleMark hm; // Discard invalid handles created during verification | |
| 2506 prepare_for_verify(); | |
| 2507 gclog_or_tty->print(" VerifyBeforeGC:"); | |
| 2508 Universe::verify(false); | |
| 2509 } | |
| 2510 | |
| 2511 COMPILER2_PRESENT(DerivedPointerTable::clear()); | |
| 2512 | |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
393
diff
changeset
|
2513 // We want to turn off ref discovery, if necessary, and turn it back on |
| 342 | 2514 // on again later if we do. |
| 2515 bool was_enabled = ref_processor()->discovery_enabled(); | |
| 2516 if (was_enabled) ref_processor()->disable_discovery(); | |
| 2517 | |
| 2518 // Forget the current alloc region (we might even choose it to be part | |
| 2519 // of the collection set!). | |
| 2520 abandon_cur_alloc_region(); | |
| 2521 | |
| 2522 // The elapsed time induced by the start time below deliberately elides | |
| 2523 // the possible verification above. | |
| 2524 double start_time_sec = os::elapsedTime(); | |
| 2525 GCOverheadReporter::recordSTWStart(start_time_sec); | |
| 2526 size_t start_used_bytes = used(); | |
| 2527 if (!G1ConcMark) { | |
| 2528 do_sync_mark(); | |
| 2529 } | |
| 2530 | |
| 2531 g1_policy()->record_collection_pause_start(start_time_sec, | |
| 2532 start_used_bytes); | |
| 2533 | |
| 526 | 2534 guarantee(_in_cset_fast_test == NULL, "invariant"); |
| 2535 guarantee(_in_cset_fast_test_base == NULL, "invariant"); | |
|
618
ae1579717a57
6812428: G1: Error: assert(ret || obj_in_cs(obj),"sanity")
tonyp
parents:
616
diff
changeset
|
2536 _in_cset_fast_test_length = max_regions(); |
| 526 | 2537 _in_cset_fast_test_base = |
| 2538 NEW_C_HEAP_ARRAY(bool, _in_cset_fast_test_length); | |
| 2539 memset(_in_cset_fast_test_base, false, | |
| 2540 _in_cset_fast_test_length * sizeof(bool)); | |
| 2541 // We're biasing _in_cset_fast_test to avoid subtracting the | |
| 2542 // beginning of the heap every time we want to index; basically | |
| 2543 // it's the same with what we do with the card table. | |
| 2544 _in_cset_fast_test = _in_cset_fast_test_base - | |
| 2545 ((size_t) _g1_reserved.start() >> HeapRegion::LogOfHRGrainBytes); | |
| 2546 | |
| 342 | 2547 #if SCAN_ONLY_VERBOSE |
| 2548 _young_list->print(); | |
| 2549 #endif // SCAN_ONLY_VERBOSE | |
| 2550 | |
| 2551 if (g1_policy()->should_initiate_conc_mark()) { | |
| 2552 concurrent_mark()->checkpointRootsInitialPre(); | |
| 2553 } | |
| 2554 save_marks(); | |
| 2555 | |
| 605 | 2556 // We must do this before any possible evacuation that should propagate |
| 342 | 2557 // marks, including evacuation of popular objects in a popular pause. |
| 2558 if (mark_in_progress()) { | |
| 2559 double start_time_sec = os::elapsedTime(); | |
| 2560 | |
| 2561 _cm->drainAllSATBBuffers(); | |
| 2562 double finish_mark_ms = (os::elapsedTime() - start_time_sec) * 1000.0; | |
| 2563 g1_policy()->record_satb_drain_time(finish_mark_ms); | |
| 2564 | |
| 2565 } | |
| 2566 // Record the number of elements currently on the mark stack, so we | |
| 2567 // only iterate over these. (Since evacuation may add to the mark | |
| 2568 // stack, doing more exposes race conditions.) If no mark is in | |
| 2569 // progress, this will be zero. | |
| 2570 _cm->set_oops_do_bound(); | |
| 2571 | |
| 2572 assert(regions_accounted_for(), "Region leakage."); | |
| 2573 | |
| 2574 bool abandoned = false; | |
| 2575 | |
| 2576 if (mark_in_progress()) | |
| 2577 concurrent_mark()->newCSet(); | |
| 2578 | |
| 2579 // Now choose the CS. | |
| 2580 if (popular_region == NULL) { | |
| 2581 g1_policy()->choose_collection_set(); | |
| 2582 } else { | |
| 2583 // We may be evacuating a single region (for popularity). | |
| 2584 g1_policy()->record_popular_pause_preamble_start(); | |
| 2585 popularity_pause_preamble(popular_region); | |
| 2586 g1_policy()->record_popular_pause_preamble_end(); | |
| 2587 abandoned = (g1_policy()->collection_set() == NULL); | |
| 2588 // Now we allow more regions to be added (we have to collect | |
| 2589 // all popular regions). | |
| 2590 if (!abandoned) { | |
| 2591 g1_policy()->choose_collection_set(popular_region); | |
| 2592 } | |
| 2593 } | |
| 2594 // We may abandon a pause if we find no region that will fit in the MMU | |
| 2595 // pause. | |
| 2596 abandoned = (g1_policy()->collection_set() == NULL); | |
| 2597 | |
| 2598 // Nothing to do if we were unable to choose a collection set. | |
| 2599 if (!abandoned) { | |
| 2600 #if G1_REM_SET_LOGGING | |
| 2601 gclog_or_tty->print_cr("\nAfter pause, heap:"); | |
| 2602 print(); | |
| 2603 #endif | |
| 2604 | |
| 2605 setup_surviving_young_words(); | |
| 2606 | |
| 2607 // Set up the gc allocation regions. | |
| 2608 get_gc_alloc_regions(); | |
| 2609 | |
| 2610 // Actually do the work... | |
| 2611 evacuate_collection_set(); | |
| 2612 free_collection_set(g1_policy()->collection_set()); | |
| 2613 g1_policy()->clear_collection_set(); | |
| 2614 | |
| 526 | 2615 FREE_C_HEAP_ARRAY(bool, _in_cset_fast_test_base); |
| 2616 // this is more for peace of mind; we're nulling them here and | |
| 2617 // we're expecting them to be null at the beginning of the next GC | |
| 2618 _in_cset_fast_test = NULL; | |
| 2619 _in_cset_fast_test_base = NULL; | |
| 2620 | |
| 342 | 2621 if (popular_region != NULL) { |
| 2622 // We have to wait until now, because we don't want the region to | |
| 2623 // be rescheduled for pop-evac during RS update. | |
| 2624 popular_region->set_popular_pending(false); | |
| 2625 } | |
| 2626 | |
| 2627 release_gc_alloc_regions(); | |
| 2628 | |
| 2629 cleanup_surviving_young_words(); | |
| 2630 | |
| 2631 if (g1_policy()->in_young_gc_mode()) { | |
| 2632 _young_list->reset_sampled_info(); | |
| 2633 assert(check_young_list_empty(true), | |
| 2634 "young list should be empty"); | |
| 2635 | |
| 2636 #if SCAN_ONLY_VERBOSE | |
| 2637 _young_list->print(); | |
| 2638 #endif // SCAN_ONLY_VERBOSE | |
| 2639 | |
| 545 | 2640 g1_policy()->record_survivor_regions(_young_list->survivor_length(), |
| 2641 _young_list->first_survivor_region(), | |
| 2642 _young_list->last_survivor_region()); | |
| 342 | 2643 _young_list->reset_auxilary_lists(); |
| 2644 } | |
| 2645 } else { | |
| 2646 COMPILER2_PRESENT(DerivedPointerTable::update_pointers()); | |
| 2647 } | |
| 2648 | |
| 2649 if (evacuation_failed()) { | |
| 2650 _summary_bytes_used = recalculate_used(); | |
| 2651 } else { | |
| 2652 // The "used" of the the collection set have already been subtracted | |
| 2653 // when they were freed. Add in the bytes evacuated. | |
| 2654 _summary_bytes_used += g1_policy()->bytes_in_to_space(); | |
| 2655 } | |
| 2656 | |
| 2657 if (g1_policy()->in_young_gc_mode() && | |
| 2658 g1_policy()->should_initiate_conc_mark()) { | |
| 2659 concurrent_mark()->checkpointRootsInitialPost(); | |
| 2660 set_marking_started(); | |
| 2661 doConcurrentMark(); | |
| 2662 } | |
| 2663 | |
| 2664 #if SCAN_ONLY_VERBOSE | |
| 2665 _young_list->print(); | |
| 2666 #endif // SCAN_ONLY_VERBOSE | |
| 2667 | |
| 2668 double end_time_sec = os::elapsedTime(); | |
|
595
3698e8f47799
6804746: G1: guarantee(variance() > -1.0,"variance should be >= 0") (due to evacuation failure)
tonyp
parents:
546
diff
changeset
|
2669 double pause_time_ms = (end_time_sec - start_time_sec) * MILLIUNITS; |
|
3698e8f47799
6804746: G1: guarantee(variance() > -1.0,"variance should be >= 0") (due to evacuation failure)
tonyp
parents:
546
diff
changeset
|
2670 g1_policy()->record_pause_time_ms(pause_time_ms); |
| 342 | 2671 GCOverheadReporter::recordSTWEnd(end_time_sec); |
| 2672 g1_policy()->record_collection_pause_end(popular_region != NULL, | |
| 2673 abandoned); | |
| 2674 | |
| 2675 assert(regions_accounted_for(), "Region leakage."); | |
| 2676 | |
| 2677 if (VerifyAfterGC && total_collections() >= VerifyGCStartAt) { | |
| 2678 HandleMark hm; // Discard invalid handles created during verification | |
| 2679 gclog_or_tty->print(" VerifyAfterGC:"); | |
| 2680 Universe::verify(false); | |
| 2681 } | |
| 2682 | |
| 2683 if (was_enabled) ref_processor()->enable_discovery(); | |
| 2684 | |
| 2685 { | |
| 2686 size_t expand_bytes = g1_policy()->expansion_amount(); | |
| 2687 if (expand_bytes > 0) { | |
| 2688 size_t bytes_before = capacity(); | |
| 2689 expand(expand_bytes); | |
| 2690 } | |
| 2691 } | |
| 2692 | |
|
546
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
2693 if (mark_in_progress()) { |
| 342 | 2694 concurrent_mark()->update_g1_committed(); |
|
546
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
2695 } |
|
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
2696 |
|
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
2697 #ifdef TRACESPINNING |
|
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
2698 ParallelTaskTerminator::print_termination_counts(); |
|
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
545
diff
changeset
|
2699 #endif |
| 342 | 2700 |
| 2701 gc_epilogue(false); | |
| 2702 } | |
| 2703 | |
| 2704 assert(verify_region_lists(), "Bad region lists."); | |
| 2705 | |
| 2706 if (reset_should_initiate_conc_mark) | |
| 2707 g1_policy()->set_should_initiate_conc_mark(); | |
| 2708 | |
| 2709 if (ExitAfterGCNum > 0 && total_collections() == ExitAfterGCNum) { | |
| 2710 gclog_or_tty->print_cr("Stopping after GC #%d", ExitAfterGCNum); | |
| 2711 print_tracing_info(); | |
| 2712 vm_exit(-1); | |
| 2713 } | |
| 2714 } | |
| 2715 | |
| 2716 void G1CollectedHeap::set_gc_alloc_region(int purpose, HeapRegion* r) { | |
| 2717 assert(purpose >= 0 && purpose < GCAllocPurposeCount, "invalid purpose"); | |
| 2718 HeapWord* original_top = NULL; | |
| 2719 if (r != NULL) | |
| 2720 original_top = r->top(); | |
| 2721 | |
| 2722 // We will want to record the used space in r as being there before gc. | |
| 2723 // One we install it as a GC alloc region it's eligible for allocation. | |
| 2724 // So record it now and use it later. | |
| 2725 size_t r_used = 0; | |
| 2726 if (r != NULL) { | |
| 2727 r_used = r->used(); | |
| 2728 | |
| 2729 if (ParallelGCThreads > 0) { | |
| 2730 // need to take the lock to guard against two threads calling | |
| 2731 // get_gc_alloc_region concurrently (very unlikely but...) | |
| 2732 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag); | |
| 2733 r->save_marks(); | |
| 2734 } | |
| 2735 } | |
| 2736 HeapRegion* old_alloc_region = _gc_alloc_regions[purpose]; | |
| 2737 _gc_alloc_regions[purpose] = r; | |
| 2738 if (old_alloc_region != NULL) { | |
| 2739 // Replace aliases too. | |
| 2740 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { | |
| 2741 if (_gc_alloc_regions[ap] == old_alloc_region) { | |
| 2742 _gc_alloc_regions[ap] = r; | |
| 2743 } | |
| 2744 } | |
| 2745 } | |
| 2746 if (r != NULL) { | |
| 2747 push_gc_alloc_region(r); | |
| 2748 if (mark_in_progress() && original_top != r->next_top_at_mark_start()) { | |
| 2749 // We are using a region as a GC alloc region after it has been used | |
| 2750 // as a mutator allocation region during the current marking cycle. | |
| 2751 // The mutator-allocated objects are currently implicitly marked, but | |
| 2752 // when we move hr->next_top_at_mark_start() forward at the the end | |
| 2753 // of the GC pause, they won't be. We therefore mark all objects in | |
| 2754 // the "gap". We do this object-by-object, since marking densely | |
| 2755 // does not currently work right with marking bitmap iteration. This | |
| 2756 // means we rely on TLAB filling at the start of pauses, and no | |
| 2757 // "resuscitation" of filled TLAB's. If we want to do this, we need | |
| 2758 // to fix the marking bitmap iteration. | |
| 2759 HeapWord* curhw = r->next_top_at_mark_start(); | |
| 2760 HeapWord* t = original_top; | |
| 2761 | |
| 2762 while (curhw < t) { | |
| 2763 oop cur = (oop)curhw; | |
| 2764 // We'll assume parallel for generality. This is rare code. | |
| 2765 concurrent_mark()->markAndGrayObjectIfNecessary(cur); // can't we just mark them? | |
| 2766 curhw = curhw + cur->size(); | |
| 2767 } | |
| 2768 assert(curhw == t, "Should have parsed correctly."); | |
| 2769 } | |
| 2770 if (G1PolicyVerbose > 1) { | |
| 2771 gclog_or_tty->print("New alloc region ["PTR_FORMAT", "PTR_FORMAT", " PTR_FORMAT") " | |
| 2772 "for survivors:", r->bottom(), original_top, r->end()); | |
| 2773 r->print(); | |
| 2774 } | |
| 2775 g1_policy()->record_before_bytes(r_used); | |
| 2776 } | |
| 2777 } | |
| 2778 | |
| 2779 void G1CollectedHeap::push_gc_alloc_region(HeapRegion* hr) { | |
| 2780 assert(Thread::current()->is_VM_thread() || | |
| 2781 par_alloc_during_gc_lock()->owned_by_self(), "Precondition"); | |
| 2782 assert(!hr->is_gc_alloc_region() && !hr->in_collection_set(), | |
| 2783 "Precondition."); | |
| 2784 hr->set_is_gc_alloc_region(true); | |
| 2785 hr->set_next_gc_alloc_region(_gc_alloc_region_list); | |
| 2786 _gc_alloc_region_list = hr; | |
| 2787 } | |
| 2788 | |
| 2789 #ifdef G1_DEBUG | |
| 2790 class FindGCAllocRegion: public HeapRegionClosure { | |
| 2791 public: | |
| 2792 bool doHeapRegion(HeapRegion* r) { | |
| 2793 if (r->is_gc_alloc_region()) { | |
| 2794 gclog_or_tty->print_cr("Region %d ["PTR_FORMAT"...] is still a gc_alloc_region.", | |
| 2795 r->hrs_index(), r->bottom()); | |
| 2796 } | |
| 2797 return false; | |
| 2798 } | |
| 2799 }; | |
| 2800 #endif // G1_DEBUG | |
| 2801 | |
| 2802 void G1CollectedHeap::forget_alloc_region_list() { | |
| 2803 assert(Thread::current()->is_VM_thread(), "Precondition"); | |
| 2804 while (_gc_alloc_region_list != NULL) { | |
| 2805 HeapRegion* r = _gc_alloc_region_list; | |
| 2806 assert(r->is_gc_alloc_region(), "Invariant."); | |
| 2807 _gc_alloc_region_list = r->next_gc_alloc_region(); | |
| 2808 r->set_next_gc_alloc_region(NULL); | |
| 2809 r->set_is_gc_alloc_region(false); | |
| 545 | 2810 if (r->is_survivor()) { |
| 2811 if (r->is_empty()) { | |
| 2812 r->set_not_young(); | |
| 2813 } else { | |
| 2814 _young_list->add_survivor_region(r); | |
| 2815 } | |
| 2816 } | |
| 342 | 2817 if (r->is_empty()) { |
| 2818 ++_free_regions; | |
| 2819 } | |
| 2820 } | |
| 2821 #ifdef G1_DEBUG | |
| 2822 FindGCAllocRegion fa; | |
| 2823 heap_region_iterate(&fa); | |
| 2824 #endif // G1_DEBUG | |
| 2825 } | |
| 2826 | |
| 2827 | |
| 2828 bool G1CollectedHeap::check_gc_alloc_regions() { | |
| 2829 // TODO: allocation regions check | |
| 2830 return true; | |
| 2831 } | |
| 2832 | |
| 2833 void G1CollectedHeap::get_gc_alloc_regions() { | |
| 2834 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { | |
| 2835 // Create new GC alloc regions. | |
| 2836 HeapRegion* alloc_region = _gc_alloc_regions[ap]; | |
| 2837 // Clear this alloc region, so that in case it turns out to be | |
| 2838 // unacceptable, we end up with no allocation region, rather than a bad | |
| 2839 // one. | |
| 2840 _gc_alloc_regions[ap] = NULL; | |
| 2841 if (alloc_region == NULL || alloc_region->in_collection_set()) { | |
| 2842 // Can't re-use old one. Allocate a new one. | |
| 2843 alloc_region = newAllocRegionWithExpansion(ap, 0); | |
| 2844 } | |
| 2845 if (alloc_region != NULL) { | |
| 2846 set_gc_alloc_region(ap, alloc_region); | |
| 2847 } | |
| 2848 } | |
| 2849 // Set alternative regions for allocation purposes that have reached | |
| 2850 // thier limit. | |
| 2851 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { | |
| 2852 GCAllocPurpose alt_purpose = g1_policy()->alternative_purpose(ap); | |
| 2853 if (_gc_alloc_regions[ap] == NULL && alt_purpose != ap) { | |
| 2854 _gc_alloc_regions[ap] = _gc_alloc_regions[alt_purpose]; | |
| 2855 } | |
| 2856 } | |
| 2857 assert(check_gc_alloc_regions(), "alloc regions messed up"); | |
| 2858 } | |
| 2859 | |
| 2860 void G1CollectedHeap::release_gc_alloc_regions() { | |
| 2861 // We keep a separate list of all regions that have been alloc regions in | |
| 2862 // the current collection pause. Forget that now. | |
| 2863 forget_alloc_region_list(); | |
| 2864 | |
| 2865 // The current alloc regions contain objs that have survived | |
| 2866 // collection. Make them no longer GC alloc regions. | |
| 2867 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { | |
| 2868 HeapRegion* r = _gc_alloc_regions[ap]; | |
| 2869 if (r != NULL && r->is_empty()) { | |
| 2870 { | |
| 2871 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 2872 r->set_zero_fill_complete(); | |
| 2873 put_free_region_on_list_locked(r); | |
| 2874 } | |
| 2875 } | |
| 2876 // set_gc_alloc_region will also NULLify all aliases to the region | |
| 2877 set_gc_alloc_region(ap, NULL); | |
| 2878 _gc_alloc_region_counts[ap] = 0; | |
| 2879 } | |
| 2880 } | |
| 2881 | |
| 2882 void G1CollectedHeap::init_for_evac_failure(OopsInHeapRegionClosure* cl) { | |
| 2883 _drain_in_progress = false; | |
| 2884 set_evac_failure_closure(cl); | |
| 2885 _evac_failure_scan_stack = new (ResourceObj::C_HEAP) GrowableArray<oop>(40, true); | |
| 2886 } | |
| 2887 | |
| 2888 void G1CollectedHeap::finalize_for_evac_failure() { | |
| 2889 assert(_evac_failure_scan_stack != NULL && | |
| 2890 _evac_failure_scan_stack->length() == 0, | |
| 2891 "Postcondition"); | |
| 2892 assert(!_drain_in_progress, "Postcondition"); | |
| 2893 // Don't have to delete, since the scan stack is a resource object. | |
| 2894 _evac_failure_scan_stack = NULL; | |
| 2895 } | |
| 2896 | |
| 2897 | |
| 2898 | |
| 2899 // *** Sequential G1 Evacuation | |
| 2900 | |
| 2901 HeapWord* G1CollectedHeap::allocate_during_gc(GCAllocPurpose purpose, size_t word_size) { | |
| 2902 HeapRegion* alloc_region = _gc_alloc_regions[purpose]; | |
| 2903 // let the caller handle alloc failure | |
| 2904 if (alloc_region == NULL) return NULL; | |
| 2905 assert(isHumongous(word_size) || !alloc_region->isHumongous(), | |
| 2906 "Either the object is humongous or the region isn't"); | |
| 2907 HeapWord* block = alloc_region->allocate(word_size); | |
| 2908 if (block == NULL) { | |
| 2909 block = allocate_during_gc_slow(purpose, alloc_region, false, word_size); | |
| 2910 } | |
| 2911 return block; | |
| 2912 } | |
| 2913 | |
| 2914 class G1IsAliveClosure: public BoolObjectClosure { | |
| 2915 G1CollectedHeap* _g1; | |
| 2916 public: | |
| 2917 G1IsAliveClosure(G1CollectedHeap* g1) : _g1(g1) {} | |
| 2918 void do_object(oop p) { assert(false, "Do not call."); } | |
| 2919 bool do_object_b(oop p) { | |
| 2920 // It is reachable if it is outside the collection set, or is inside | |
| 2921 // and forwarded. | |
| 2922 | |
| 2923 #ifdef G1_DEBUG | |
| 2924 gclog_or_tty->print_cr("is alive "PTR_FORMAT" in CS %d forwarded %d overall %d", | |
| 2925 (void*) p, _g1->obj_in_cs(p), p->is_forwarded(), | |
| 2926 !_g1->obj_in_cs(p) || p->is_forwarded()); | |
| 2927 #endif // G1_DEBUG | |
| 2928 | |
| 2929 return !_g1->obj_in_cs(p) || p->is_forwarded(); | |
| 2930 } | |
| 2931 }; | |
| 2932 | |
| 2933 class G1KeepAliveClosure: public OopClosure { | |
| 2934 G1CollectedHeap* _g1; | |
| 2935 public: | |
| 2936 G1KeepAliveClosure(G1CollectedHeap* g1) : _g1(g1) {} | |
| 2937 void do_oop(narrowOop* p) { | |
| 2938 guarantee(false, "NYI"); | |
| 2939 } | |
| 2940 void do_oop(oop* p) { | |
| 2941 oop obj = *p; | |
| 2942 #ifdef G1_DEBUG | |
| 2943 if (PrintGC && Verbose) { | |
| 2944 gclog_or_tty->print_cr("keep alive *"PTR_FORMAT" = "PTR_FORMAT" "PTR_FORMAT, | |
| 2945 p, (void*) obj, (void*) *p); | |
| 2946 } | |
| 2947 #endif // G1_DEBUG | |
| 2948 | |
| 2949 if (_g1->obj_in_cs(obj)) { | |
| 2950 assert( obj->is_forwarded(), "invariant" ); | |
| 2951 *p = obj->forwardee(); | |
| 2952 | |
| 2953 #ifdef G1_DEBUG | |
| 2954 gclog_or_tty->print_cr(" in CSet: moved "PTR_FORMAT" -> "PTR_FORMAT, | |
| 2955 (void*) obj, (void*) *p); | |
| 2956 #endif // G1_DEBUG | |
| 2957 } | |
| 2958 } | |
| 2959 }; | |
| 2960 | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2961 class UpdateRSetImmediate : public OopsInHeapRegionClosure { |
| 342 | 2962 private: |
| 2963 G1CollectedHeap* _g1; | |
| 2964 G1RemSet* _g1_rem_set; | |
| 2965 public: | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2966 UpdateRSetImmediate(G1CollectedHeap* g1) : |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2967 _g1(g1), _g1_rem_set(g1->g1_rem_set()) {} |
| 342 | 2968 |
| 2969 void do_oop(narrowOop* p) { | |
| 2970 guarantee(false, "NYI"); | |
| 2971 } | |
| 2972 void do_oop(oop* p) { | |
| 2973 assert(_from->is_in_reserved(p), "paranoia"); | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2974 if (*p != NULL && !_from->is_survivor()) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2975 _g1_rem_set->par_write_ref(_from, p, 0); |
| 342 | 2976 } |
| 2977 } | |
| 2978 }; | |
| 2979 | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2980 class UpdateRSetDeferred : public OopsInHeapRegionClosure { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2981 private: |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2982 G1CollectedHeap* _g1; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2983 DirtyCardQueue *_dcq; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2984 CardTableModRefBS* _ct_bs; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2985 |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2986 public: |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2987 UpdateRSetDeferred(G1CollectedHeap* g1, DirtyCardQueue* dcq) : |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2988 _g1(g1), _ct_bs((CardTableModRefBS*)_g1->barrier_set()), _dcq(dcq) {} |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2989 |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2990 void do_oop(narrowOop* p) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2991 guarantee(false, "NYI"); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2992 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2993 void do_oop(oop* p) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2994 assert(_from->is_in_reserved(p), "paranoia"); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2995 if (!_from->is_in_reserved(*p) && !_from->is_survivor()) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2996 size_t card_index = _ct_bs->index_for(p); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2997 if (_ct_bs->mark_card_deferred(card_index)) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2998 _dcq->enqueue((jbyte*)_ct_bs->byte_for_index(card_index)); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
2999 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3000 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3001 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3002 }; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3003 |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3004 |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3005 |
| 342 | 3006 class RemoveSelfPointerClosure: public ObjectClosure { |
| 3007 private: | |
| 3008 G1CollectedHeap* _g1; | |
| 3009 ConcurrentMark* _cm; | |
| 3010 HeapRegion* _hr; | |
| 3011 size_t _prev_marked_bytes; | |
| 3012 size_t _next_marked_bytes; | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3013 OopsInHeapRegionClosure *_cl; |
| 342 | 3014 public: |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3015 RemoveSelfPointerClosure(G1CollectedHeap* g1, OopsInHeapRegionClosure* cl) : |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3016 _g1(g1), _cm(_g1->concurrent_mark()), _prev_marked_bytes(0), |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3017 _next_marked_bytes(0), _cl(cl) {} |
| 342 | 3018 |
| 3019 size_t prev_marked_bytes() { return _prev_marked_bytes; } | |
| 3020 size_t next_marked_bytes() { return _next_marked_bytes; } | |
| 3021 | |
|
352
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3022 // The original idea here was to coalesce evacuated and dead objects. |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3023 // However that caused complications with the block offset table (BOT). |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3024 // In particular if there were two TLABs, one of them partially refined. |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3025 // |----- TLAB_1--------|----TLAB_2-~~~(partially refined part)~~~| |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3026 // The BOT entries of the unrefined part of TLAB_2 point to the start |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3027 // of TLAB_2. If the last object of the TLAB_1 and the first object |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3028 // of TLAB_2 are coalesced, then the cards of the unrefined part |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3029 // would point into middle of the filler object. |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3030 // |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3031 // The current approach is to not coalesce and leave the BOT contents intact. |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3032 void do_object(oop obj) { |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3033 if (obj->is_forwarded() && obj->forwardee() == obj) { |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3034 // The object failed to move. |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3035 assert(!_g1->is_obj_dead(obj), "We should not be preserving dead objs."); |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3036 _cm->markPrev(obj); |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3037 assert(_cm->isPrevMarked(obj), "Should be marked!"); |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3038 _prev_marked_bytes += (obj->size() * HeapWordSize); |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3039 if (_g1->mark_in_progress() && !_g1->is_obj_ill(obj)) { |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3040 _cm->markAndGrayObjectIfNecessary(obj); |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3041 } |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3042 obj->set_mark(markOopDesc::prototype()); |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3043 // While we were processing RSet buffers during the |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3044 // collection, we actually didn't scan any cards on the |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3045 // collection set, since we didn't want to update remebered |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3046 // sets with entries that point into the collection set, given |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3047 // that live objects fromthe collection set are about to move |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3048 // and such entries will be stale very soon. This change also |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3049 // dealt with a reliability issue which involved scanning a |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3050 // card in the collection set and coming across an array that |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3051 // was being chunked and looking malformed. The problem is |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3052 // that, if evacuation fails, we might have remembered set |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3053 // entries missing given that we skipped cards on the |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3054 // collection set. So, we'll recreate such entries now. |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3055 obj->oop_iterate(_cl); |
|
352
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3056 assert(_cm->isPrevMarked(obj), "Should be marked!"); |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3057 } else { |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3058 // The object has been either evacuated or is dead. Fill it with a |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3059 // dummy object. |
|
e0c09f7ec5c4
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov
parents:
342
diff
changeset
|
3060 MemRegion mr((HeapWord*)obj, obj->size()); |
|
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
3061 CollectedHeap::fill_with_object(mr); |
| 342 | 3062 _cm->clearRangeBothMaps(mr); |
| 3063 } | |
| 3064 } | |
| 3065 }; | |
| 3066 | |
| 3067 void G1CollectedHeap::remove_self_forwarding_pointers() { | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3068 UpdateRSetImmediate immediate_update(_g1h); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3069 DirtyCardQueue dcq(&_g1h->dirty_card_queue_set()); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3070 UpdateRSetDeferred deferred_update(_g1h, &dcq); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3071 OopsInHeapRegionClosure *cl; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3072 if (G1DeferredRSUpdate) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3073 cl = &deferred_update; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3074 } else { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3075 cl = &immediate_update; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3076 } |
| 342 | 3077 HeapRegion* cur = g1_policy()->collection_set(); |
| 3078 while (cur != NULL) { | |
| 3079 assert(g1_policy()->assertMarkedBytesDataOK(), "Should be!"); | |
| 3080 | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3081 RemoveSelfPointerClosure rspc(_g1h, cl); |
| 342 | 3082 if (cur->evacuation_failed()) { |
| 3083 assert(cur->in_collection_set(), "bad CS"); | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3084 cl->set_region(cur); |
| 342 | 3085 cur->object_iterate(&rspc); |
| 3086 | |
| 3087 // A number of manipulations to make the TAMS be the current top, | |
| 3088 // and the marked bytes be the ones observed in the iteration. | |
| 3089 if (_g1h->concurrent_mark()->at_least_one_mark_complete()) { | |
| 3090 // The comments below are the postconditions achieved by the | |
| 3091 // calls. Note especially the last such condition, which says that | |
| 3092 // the count of marked bytes has been properly restored. | |
| 3093 cur->note_start_of_marking(false); | |
| 3094 // _next_top_at_mark_start == top, _next_marked_bytes == 0 | |
| 3095 cur->add_to_marked_bytes(rspc.prev_marked_bytes()); | |
| 3096 // _next_marked_bytes == prev_marked_bytes. | |
| 3097 cur->note_end_of_marking(); | |
| 3098 // _prev_top_at_mark_start == top(), | |
| 3099 // _prev_marked_bytes == prev_marked_bytes | |
| 3100 } | |
| 3101 // If there is no mark in progress, we modified the _next variables | |
| 3102 // above needlessly, but harmlessly. | |
| 3103 if (_g1h->mark_in_progress()) { | |
| 3104 cur->note_start_of_marking(false); | |
| 3105 // _next_top_at_mark_start == top, _next_marked_bytes == 0 | |
| 3106 // _next_marked_bytes == next_marked_bytes. | |
| 3107 } | |
| 3108 | |
| 3109 // Now make sure the region has the right index in the sorted array. | |
| 3110 g1_policy()->note_change_in_marked_bytes(cur); | |
| 3111 } | |
| 3112 cur = cur->next_in_collection_set(); | |
| 3113 } | |
| 3114 assert(g1_policy()->assertMarkedBytesDataOK(), "Should be!"); | |
| 3115 | |
| 3116 // Now restore saved marks, if any. | |
| 3117 if (_objs_with_preserved_marks != NULL) { | |
| 3118 assert(_preserved_marks_of_objs != NULL, "Both or none."); | |
| 3119 assert(_objs_with_preserved_marks->length() == | |
| 3120 _preserved_marks_of_objs->length(), "Both or none."); | |
| 3121 guarantee(_objs_with_preserved_marks->length() == | |
| 3122 _preserved_marks_of_objs->length(), "Both or none."); | |
| 3123 for (int i = 0; i < _objs_with_preserved_marks->length(); i++) { | |
| 3124 oop obj = _objs_with_preserved_marks->at(i); | |
| 3125 markOop m = _preserved_marks_of_objs->at(i); | |
| 3126 obj->set_mark(m); | |
| 3127 } | |
| 3128 // Delete the preserved marks growable arrays (allocated on the C heap). | |
| 3129 delete _objs_with_preserved_marks; | |
| 3130 delete _preserved_marks_of_objs; | |
| 3131 _objs_with_preserved_marks = NULL; | |
| 3132 _preserved_marks_of_objs = NULL; | |
| 3133 } | |
| 3134 } | |
| 3135 | |
| 3136 void G1CollectedHeap::push_on_evac_failure_scan_stack(oop obj) { | |
| 3137 _evac_failure_scan_stack->push(obj); | |
| 3138 } | |
| 3139 | |
| 3140 void G1CollectedHeap::drain_evac_failure_scan_stack() { | |
| 3141 assert(_evac_failure_scan_stack != NULL, "precondition"); | |
| 3142 | |
| 3143 while (_evac_failure_scan_stack->length() > 0) { | |
| 3144 oop obj = _evac_failure_scan_stack->pop(); | |
| 3145 _evac_failure_closure->set_region(heap_region_containing(obj)); | |
| 3146 obj->oop_iterate_backwards(_evac_failure_closure); | |
| 3147 } | |
| 3148 } | |
| 3149 | |
| 3150 void G1CollectedHeap::handle_evacuation_failure(oop old) { | |
| 3151 markOop m = old->mark(); | |
| 3152 // forward to self | |
| 3153 assert(!old->is_forwarded(), "precondition"); | |
| 3154 | |
| 3155 old->forward_to(old); | |
| 3156 handle_evacuation_failure_common(old, m); | |
| 3157 } | |
| 3158 | |
| 3159 oop | |
| 3160 G1CollectedHeap::handle_evacuation_failure_par(OopsInHeapRegionClosure* cl, | |
| 3161 oop old) { | |
| 3162 markOop m = old->mark(); | |
| 3163 oop forward_ptr = old->forward_to_atomic(old); | |
| 3164 if (forward_ptr == NULL) { | |
| 3165 // Forward-to-self succeeded. | |
| 3166 if (_evac_failure_closure != cl) { | |
| 3167 MutexLockerEx x(EvacFailureStack_lock, Mutex::_no_safepoint_check_flag); | |
| 3168 assert(!_drain_in_progress, | |
| 3169 "Should only be true while someone holds the lock."); | |
| 3170 // Set the global evac-failure closure to the current thread's. | |
| 3171 assert(_evac_failure_closure == NULL, "Or locking has failed."); | |
| 3172 set_evac_failure_closure(cl); | |
| 3173 // Now do the common part. | |
| 3174 handle_evacuation_failure_common(old, m); | |
| 3175 // Reset to NULL. | |
| 3176 set_evac_failure_closure(NULL); | |
| 3177 } else { | |
| 3178 // The lock is already held, and this is recursive. | |
| 3179 assert(_drain_in_progress, "This should only be the recursive case."); | |
| 3180 handle_evacuation_failure_common(old, m); | |
| 3181 } | |
| 3182 return old; | |
| 3183 } else { | |
| 3184 // Someone else had a place to copy it. | |
| 3185 return forward_ptr; | |
| 3186 } | |
| 3187 } | |
| 3188 | |
| 3189 void G1CollectedHeap::handle_evacuation_failure_common(oop old, markOop m) { | |
| 3190 set_evacuation_failed(true); | |
| 3191 | |
| 3192 preserve_mark_if_necessary(old, m); | |
| 3193 | |
| 3194 HeapRegion* r = heap_region_containing(old); | |
| 3195 if (!r->evacuation_failed()) { | |
| 3196 r->set_evacuation_failed(true); | |
| 3197 if (G1TraceRegions) { | |
| 3198 gclog_or_tty->print("evacuation failed in heap region "PTR_FORMAT" " | |
| 3199 "["PTR_FORMAT","PTR_FORMAT")\n", | |
| 3200 r, r->bottom(), r->end()); | |
| 3201 } | |
| 3202 } | |
| 3203 | |
| 3204 push_on_evac_failure_scan_stack(old); | |
| 3205 | |
| 3206 if (!_drain_in_progress) { | |
| 3207 // prevent recursion in copy_to_survivor_space() | |
| 3208 _drain_in_progress = true; | |
| 3209 drain_evac_failure_scan_stack(); | |
| 3210 _drain_in_progress = false; | |
| 3211 } | |
| 3212 } | |
| 3213 | |
| 3214 void G1CollectedHeap::preserve_mark_if_necessary(oop obj, markOop m) { | |
| 3215 if (m != markOopDesc::prototype()) { | |
| 3216 if (_objs_with_preserved_marks == NULL) { | |
| 3217 assert(_preserved_marks_of_objs == NULL, "Both or none."); | |
| 3218 _objs_with_preserved_marks = | |
| 3219 new (ResourceObj::C_HEAP) GrowableArray<oop>(40, true); | |
| 3220 _preserved_marks_of_objs = | |
| 3221 new (ResourceObj::C_HEAP) GrowableArray<markOop>(40, true); | |
| 3222 } | |
| 3223 _objs_with_preserved_marks->push(obj); | |
| 3224 _preserved_marks_of_objs->push(m); | |
| 3225 } | |
| 3226 } | |
| 3227 | |
| 3228 // *** Parallel G1 Evacuation | |
| 3229 | |
| 3230 HeapWord* G1CollectedHeap::par_allocate_during_gc(GCAllocPurpose purpose, | |
| 3231 size_t word_size) { | |
| 3232 HeapRegion* alloc_region = _gc_alloc_regions[purpose]; | |
| 3233 // let the caller handle alloc failure | |
| 3234 if (alloc_region == NULL) return NULL; | |
| 3235 | |
| 3236 HeapWord* block = alloc_region->par_allocate(word_size); | |
| 3237 if (block == NULL) { | |
| 3238 MutexLockerEx x(par_alloc_during_gc_lock(), | |
| 3239 Mutex::_no_safepoint_check_flag); | |
| 3240 block = allocate_during_gc_slow(purpose, alloc_region, true, word_size); | |
| 3241 } | |
| 3242 return block; | |
| 3243 } | |
| 3244 | |
| 545 | 3245 void G1CollectedHeap::retire_alloc_region(HeapRegion* alloc_region, |
| 3246 bool par) { | |
| 3247 // Another thread might have obtained alloc_region for the given | |
| 3248 // purpose, and might be attempting to allocate in it, and might | |
| 3249 // succeed. Therefore, we can't do the "finalization" stuff on the | |
| 3250 // region below until we're sure the last allocation has happened. | |
| 3251 // We ensure this by allocating the remaining space with a garbage | |
| 3252 // object. | |
| 3253 if (par) par_allocate_remaining_space(alloc_region); | |
| 3254 // Now we can do the post-GC stuff on the region. | |
| 3255 alloc_region->note_end_of_copying(); | |
| 3256 g1_policy()->record_after_bytes(alloc_region->used()); | |
| 3257 } | |
| 3258 | |
| 342 | 3259 HeapWord* |
| 3260 G1CollectedHeap::allocate_during_gc_slow(GCAllocPurpose purpose, | |
| 3261 HeapRegion* alloc_region, | |
| 3262 bool par, | |
| 3263 size_t word_size) { | |
| 3264 HeapWord* block = NULL; | |
| 3265 // In the parallel case, a previous thread to obtain the lock may have | |
| 3266 // already assigned a new gc_alloc_region. | |
| 3267 if (alloc_region != _gc_alloc_regions[purpose]) { | |
| 3268 assert(par, "But should only happen in parallel case."); | |
| 3269 alloc_region = _gc_alloc_regions[purpose]; | |
| 3270 if (alloc_region == NULL) return NULL; | |
| 3271 block = alloc_region->par_allocate(word_size); | |
| 3272 if (block != NULL) return block; | |
| 3273 // Otherwise, continue; this new region is empty, too. | |
| 3274 } | |
| 3275 assert(alloc_region != NULL, "We better have an allocation region"); | |
| 545 | 3276 retire_alloc_region(alloc_region, par); |
| 342 | 3277 |
| 3278 if (_gc_alloc_region_counts[purpose] >= g1_policy()->max_regions(purpose)) { | |
| 3279 // Cannot allocate more regions for the given purpose. | |
| 3280 GCAllocPurpose alt_purpose = g1_policy()->alternative_purpose(purpose); | |
| 3281 // Is there an alternative? | |
| 3282 if (purpose != alt_purpose) { | |
| 3283 HeapRegion* alt_region = _gc_alloc_regions[alt_purpose]; | |
| 3284 // Has not the alternative region been aliased? | |
| 545 | 3285 if (alloc_region != alt_region && alt_region != NULL) { |
| 342 | 3286 // Try to allocate in the alternative region. |
| 3287 if (par) { | |
| 3288 block = alt_region->par_allocate(word_size); | |
| 3289 } else { | |
| 3290 block = alt_region->allocate(word_size); | |
| 3291 } | |
| 3292 // Make an alias. | |
| 3293 _gc_alloc_regions[purpose] = _gc_alloc_regions[alt_purpose]; | |
| 545 | 3294 if (block != NULL) { |
| 3295 return block; | |
| 3296 } | |
| 3297 retire_alloc_region(alt_region, par); | |
| 342 | 3298 } |
| 3299 // Both the allocation region and the alternative one are full | |
| 3300 // and aliased, replace them with a new allocation region. | |
| 3301 purpose = alt_purpose; | |
| 3302 } else { | |
| 3303 set_gc_alloc_region(purpose, NULL); | |
| 3304 return NULL; | |
| 3305 } | |
| 3306 } | |
| 3307 | |
| 3308 // Now allocate a new region for allocation. | |
| 3309 alloc_region = newAllocRegionWithExpansion(purpose, word_size, false /*zero_filled*/); | |
| 3310 | |
| 3311 // let the caller handle alloc failure | |
| 3312 if (alloc_region != NULL) { | |
| 3313 | |
| 3314 assert(check_gc_alloc_regions(), "alloc regions messed up"); | |
| 3315 assert(alloc_region->saved_mark_at_top(), | |
| 3316 "Mark should have been saved already."); | |
| 3317 // We used to assert that the region was zero-filled here, but no | |
| 3318 // longer. | |
| 3319 | |
| 3320 // This must be done last: once it's installed, other regions may | |
| 3321 // allocate in it (without holding the lock.) | |
| 3322 set_gc_alloc_region(purpose, alloc_region); | |
| 3323 | |
| 3324 if (par) { | |
| 3325 block = alloc_region->par_allocate(word_size); | |
| 3326 } else { | |
| 3327 block = alloc_region->allocate(word_size); | |
| 3328 } | |
| 3329 // Caller handles alloc failure. | |
| 3330 } else { | |
| 3331 // This sets other apis using the same old alloc region to NULL, also. | |
| 3332 set_gc_alloc_region(purpose, NULL); | |
| 3333 } | |
| 3334 return block; // May be NULL. | |
| 3335 } | |
| 3336 | |
| 3337 void G1CollectedHeap::par_allocate_remaining_space(HeapRegion* r) { | |
| 3338 HeapWord* block = NULL; | |
| 3339 size_t free_words; | |
| 3340 do { | |
| 3341 free_words = r->free()/HeapWordSize; | |
| 3342 // If there's too little space, no one can allocate, so we're done. | |
| 3343 if (free_words < (size_t)oopDesc::header_size()) return; | |
| 3344 // Otherwise, try to claim it. | |
| 3345 block = r->par_allocate(free_words); | |
| 3346 } while (block == NULL); | |
|
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
3347 fill_with_object(block, free_words); |
| 342 | 3348 } |
| 3349 | |
| 3350 #define use_local_bitmaps 1 | |
| 3351 #define verify_local_bitmaps 0 | |
| 3352 | |
| 3353 #ifndef PRODUCT | |
| 3354 | |
| 3355 class GCLabBitMap; | |
| 3356 class GCLabBitMapClosure: public BitMapClosure { | |
| 3357 private: | |
| 3358 ConcurrentMark* _cm; | |
| 3359 GCLabBitMap* _bitmap; | |
| 3360 | |
| 3361 public: | |
| 3362 GCLabBitMapClosure(ConcurrentMark* cm, | |
| 3363 GCLabBitMap* bitmap) { | |
| 3364 _cm = cm; | |
| 3365 _bitmap = bitmap; | |
| 3366 } | |
| 3367 | |
| 3368 virtual bool do_bit(size_t offset); | |
| 3369 }; | |
| 3370 | |
| 3371 #endif // PRODUCT | |
| 3372 | |
| 3373 #define oop_buffer_length 256 | |
| 3374 | |
| 3375 class GCLabBitMap: public BitMap { | |
| 3376 private: | |
| 3377 ConcurrentMark* _cm; | |
| 3378 | |
| 3379 int _shifter; | |
| 3380 size_t _bitmap_word_covers_words; | |
| 3381 | |
| 3382 // beginning of the heap | |
| 3383 HeapWord* _heap_start; | |
| 3384 | |
| 3385 // this is the actual start of the GCLab | |
| 3386 HeapWord* _real_start_word; | |
| 3387 | |
| 3388 // this is the actual end of the GCLab | |
| 3389 HeapWord* _real_end_word; | |
| 3390 | |
| 3391 // this is the first word, possibly located before the actual start | |
| 3392 // of the GCLab, that corresponds to the first bit of the bitmap | |
| 3393 HeapWord* _start_word; | |
| 3394 | |
| 3395 // size of a GCLab in words | |
| 3396 size_t _gclab_word_size; | |
| 3397 | |
| 3398 static int shifter() { | |
| 3399 return MinObjAlignment - 1; | |
| 3400 } | |
| 3401 | |
| 3402 // how many heap words does a single bitmap word corresponds to? | |
| 3403 static size_t bitmap_word_covers_words() { | |
| 3404 return BitsPerWord << shifter(); | |
| 3405 } | |
| 3406 | |
| 3407 static size_t gclab_word_size() { | |
| 3408 return ParallelGCG1AllocBufferSize / HeapWordSize; | |
| 3409 } | |
| 3410 | |
| 3411 static size_t bitmap_size_in_bits() { | |
| 3412 size_t bits_in_bitmap = gclab_word_size() >> shifter(); | |
| 3413 // We are going to ensure that the beginning of a word in this | |
| 3414 // bitmap also corresponds to the beginning of a word in the | |
| 3415 // global marking bitmap. To handle the case where a GCLab | |
| 3416 // starts from the middle of the bitmap, we need to add enough | |
| 3417 // space (i.e. up to a bitmap word) to ensure that we have | |
| 3418 // enough bits in the bitmap. | |
| 3419 return bits_in_bitmap + BitsPerWord - 1; | |
| 3420 } | |
| 3421 public: | |
| 3422 GCLabBitMap(HeapWord* heap_start) | |
| 3423 : BitMap(bitmap_size_in_bits()), | |
| 3424 _cm(G1CollectedHeap::heap()->concurrent_mark()), | |
| 3425 _shifter(shifter()), | |
| 3426 _bitmap_word_covers_words(bitmap_word_covers_words()), | |
| 3427 _heap_start(heap_start), | |
| 3428 _gclab_word_size(gclab_word_size()), | |
| 3429 _real_start_word(NULL), | |
| 3430 _real_end_word(NULL), | |
| 3431 _start_word(NULL) | |
| 3432 { | |
| 3433 guarantee( size_in_words() >= bitmap_size_in_words(), | |
| 3434 "just making sure"); | |
| 3435 } | |
| 3436 | |
| 3437 inline unsigned heapWordToOffset(HeapWord* addr) { | |
| 3438 unsigned offset = (unsigned) pointer_delta(addr, _start_word) >> _shifter; | |
| 3439 assert(offset < size(), "offset should be within bounds"); | |
| 3440 return offset; | |
| 3441 } | |
| 3442 | |
| 3443 inline HeapWord* offsetToHeapWord(size_t offset) { | |
| 3444 HeapWord* addr = _start_word + (offset << _shifter); | |
| 3445 assert(_real_start_word <= addr && addr < _real_end_word, "invariant"); | |
| 3446 return addr; | |
| 3447 } | |
| 3448 | |
| 3449 bool fields_well_formed() { | |
| 3450 bool ret1 = (_real_start_word == NULL) && | |
| 3451 (_real_end_word == NULL) && | |
| 3452 (_start_word == NULL); | |
| 3453 if (ret1) | |
| 3454 return true; | |
| 3455 | |
| 3456 bool ret2 = _real_start_word >= _start_word && | |
| 3457 _start_word < _real_end_word && | |
| 3458 (_real_start_word + _gclab_word_size) == _real_end_word && | |
| 3459 (_start_word + _gclab_word_size + _bitmap_word_covers_words) | |
| 3460 > _real_end_word; | |
| 3461 return ret2; | |
| 3462 } | |
| 3463 | |
| 3464 inline bool mark(HeapWord* addr) { | |
| 3465 guarantee(use_local_bitmaps, "invariant"); | |
| 3466 assert(fields_well_formed(), "invariant"); | |
| 3467 | |
| 3468 if (addr >= _real_start_word && addr < _real_end_word) { | |
| 3469 assert(!isMarked(addr), "should not have already been marked"); | |
| 3470 | |
| 3471 // first mark it on the bitmap | |
| 3472 at_put(heapWordToOffset(addr), true); | |
| 3473 | |
| 3474 return true; | |
| 3475 } else { | |
| 3476 return false; | |
| 3477 } | |
| 3478 } | |
| 3479 | |
| 3480 inline bool isMarked(HeapWord* addr) { | |
| 3481 guarantee(use_local_bitmaps, "invariant"); | |
| 3482 assert(fields_well_formed(), "invariant"); | |
| 3483 | |
| 3484 return at(heapWordToOffset(addr)); | |
| 3485 } | |
| 3486 | |
| 3487 void set_buffer(HeapWord* start) { | |
| 3488 guarantee(use_local_bitmaps, "invariant"); | |
| 3489 clear(); | |
| 3490 | |
| 3491 assert(start != NULL, "invariant"); | |
| 3492 _real_start_word = start; | |
| 3493 _real_end_word = start + _gclab_word_size; | |
| 3494 | |
| 3495 size_t diff = | |
| 3496 pointer_delta(start, _heap_start) % _bitmap_word_covers_words; | |
| 3497 _start_word = start - diff; | |
| 3498 | |
| 3499 assert(fields_well_formed(), "invariant"); | |
| 3500 } | |
| 3501 | |
| 3502 #ifndef PRODUCT | |
| 3503 void verify() { | |
| 3504 // verify that the marks have been propagated | |
| 3505 GCLabBitMapClosure cl(_cm, this); | |
| 3506 iterate(&cl); | |
| 3507 } | |
| 3508 #endif // PRODUCT | |
| 3509 | |
| 3510 void retire() { | |
| 3511 guarantee(use_local_bitmaps, "invariant"); | |
| 3512 assert(fields_well_formed(), "invariant"); | |
| 3513 | |
| 3514 if (_start_word != NULL) { | |
| 3515 CMBitMap* mark_bitmap = _cm->nextMarkBitMap(); | |
| 3516 | |
| 3517 // this means that the bitmap was set up for the GCLab | |
| 3518 assert(_real_start_word != NULL && _real_end_word != NULL, "invariant"); | |
| 3519 | |
| 3520 mark_bitmap->mostly_disjoint_range_union(this, | |
| 3521 0, // always start from the start of the bitmap | |
| 3522 _start_word, | |
| 3523 size_in_words()); | |
| 3524 _cm->grayRegionIfNecessary(MemRegion(_real_start_word, _real_end_word)); | |
| 3525 | |
| 3526 #ifndef PRODUCT | |
| 3527 if (use_local_bitmaps && verify_local_bitmaps) | |
| 3528 verify(); | |
| 3529 #endif // PRODUCT | |
| 3530 } else { | |
| 3531 assert(_real_start_word == NULL && _real_end_word == NULL, "invariant"); | |
| 3532 } | |
| 3533 } | |
| 3534 | |
| 3535 static size_t bitmap_size_in_words() { | |
| 3536 return (bitmap_size_in_bits() + BitsPerWord - 1) / BitsPerWord; | |
| 3537 } | |
| 3538 }; | |
| 3539 | |
| 3540 #ifndef PRODUCT | |
| 3541 | |
| 3542 bool GCLabBitMapClosure::do_bit(size_t offset) { | |
| 3543 HeapWord* addr = _bitmap->offsetToHeapWord(offset); | |
| 3544 guarantee(_cm->isMarked(oop(addr)), "it should be!"); | |
| 3545 return true; | |
| 3546 } | |
| 3547 | |
| 3548 #endif // PRODUCT | |
| 3549 | |
| 3550 class G1ParGCAllocBuffer: public ParGCAllocBuffer { | |
| 3551 private: | |
| 3552 bool _retired; | |
| 3553 bool _during_marking; | |
| 3554 GCLabBitMap _bitmap; | |
| 3555 | |
| 3556 public: | |
| 3557 G1ParGCAllocBuffer() : | |
| 3558 ParGCAllocBuffer(ParallelGCG1AllocBufferSize / HeapWordSize), | |
| 3559 _during_marking(G1CollectedHeap::heap()->mark_in_progress()), | |
| 3560 _bitmap(G1CollectedHeap::heap()->reserved_region().start()), | |
| 3561 _retired(false) | |
| 3562 { } | |
| 3563 | |
| 3564 inline bool mark(HeapWord* addr) { | |
| 3565 guarantee(use_local_bitmaps, "invariant"); | |
| 3566 assert(_during_marking, "invariant"); | |
| 3567 return _bitmap.mark(addr); | |
| 3568 } | |
| 3569 | |
| 3570 inline void set_buf(HeapWord* buf) { | |
| 3571 if (use_local_bitmaps && _during_marking) | |
| 3572 _bitmap.set_buffer(buf); | |
| 3573 ParGCAllocBuffer::set_buf(buf); | |
| 3574 _retired = false; | |
| 3575 } | |
| 3576 | |
| 3577 inline void retire(bool end_of_gc, bool retain) { | |
| 3578 if (_retired) | |
| 3579 return; | |
| 3580 if (use_local_bitmaps && _during_marking) { | |
| 3581 _bitmap.retire(); | |
| 3582 } | |
| 3583 ParGCAllocBuffer::retire(end_of_gc, retain); | |
| 3584 _retired = true; | |
| 3585 } | |
| 3586 }; | |
| 3587 | |
| 3588 | |
| 3589 class G1ParScanThreadState : public StackObj { | |
| 3590 protected: | |
| 3591 G1CollectedHeap* _g1h; | |
| 3592 RefToScanQueue* _refs; | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3593 DirtyCardQueue _dcq; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3594 CardTableModRefBS* _ct_bs; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3595 G1RemSet* _g1_rem; |
| 342 | 3596 |
| 3597 typedef GrowableArray<oop*> OverflowQueue; | |
| 3598 OverflowQueue* _overflowed_refs; | |
| 3599 | |
| 3600 G1ParGCAllocBuffer _alloc_buffers[GCAllocPurposeCount]; | |
| 545 | 3601 ageTable _age_table; |
| 342 | 3602 |
| 3603 size_t _alloc_buffer_waste; | |
| 3604 size_t _undo_waste; | |
| 3605 | |
| 3606 OopsInHeapRegionClosure* _evac_failure_cl; | |
| 3607 G1ParScanHeapEvacClosure* _evac_cl; | |
| 3608 G1ParScanPartialArrayClosure* _partial_scan_cl; | |
| 3609 | |
| 3610 int _hash_seed; | |
| 3611 int _queue_num; | |
| 3612 | |
| 3613 int _term_attempts; | |
| 3614 #if G1_DETAILED_STATS | |
| 3615 int _pushes, _pops, _steals, _steal_attempts; | |
| 3616 int _overflow_pushes; | |
| 3617 #endif | |
| 3618 | |
| 3619 double _start; | |
| 3620 double _start_strong_roots; | |
| 3621 double _strong_roots_time; | |
| 3622 double _start_term; | |
| 3623 double _term_time; | |
| 3624 | |
| 3625 // Map from young-age-index (0 == not young, 1 is youngest) to | |
| 3626 // surviving words. base is what we get back from the malloc call | |
| 3627 size_t* _surviving_young_words_base; | |
| 3628 // this points into the array, as we use the first few entries for padding | |
| 3629 size_t* _surviving_young_words; | |
| 3630 | |
| 3631 #define PADDING_ELEM_NUM (64 / sizeof(size_t)) | |
| 3632 | |
| 3633 void add_to_alloc_buffer_waste(size_t waste) { _alloc_buffer_waste += waste; } | |
| 3634 | |
| 3635 void add_to_undo_waste(size_t waste) { _undo_waste += waste; } | |
| 3636 | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3637 DirtyCardQueue& dirty_card_queue() { return _dcq; } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3638 CardTableModRefBS* ctbs() { return _ct_bs; } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3639 |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3640 void immediate_rs_update(HeapRegion* from, oop* p, int tid) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3641 _g1_rem->par_write_ref(from, p, tid); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3642 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3643 |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3644 void deferred_rs_update(HeapRegion* from, oop* p, int tid) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3645 // If the new value of the field points to the same region or |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3646 // is the to-space, we don't need to include it in the Rset updates. |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3647 if (!from->is_in_reserved(*p) && !from->is_survivor()) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3648 size_t card_index = ctbs()->index_for(p); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3649 // If the card hasn't been added to the buffer, do it. |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3650 if (ctbs()->mark_card_deferred(card_index)) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3651 dirty_card_queue().enqueue((jbyte*)ctbs()->byte_for_index(card_index)); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3652 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3653 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3654 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3655 |
| 342 | 3656 public: |
| 3657 G1ParScanThreadState(G1CollectedHeap* g1h, int queue_num) | |
| 3658 : _g1h(g1h), | |
| 3659 _refs(g1h->task_queue(queue_num)), | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3660 _dcq(&g1h->dirty_card_queue_set()), |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3661 _ct_bs((CardTableModRefBS*)_g1h->barrier_set()), |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3662 _g1_rem(g1h->g1_rem_set()), |
| 342 | 3663 _hash_seed(17), _queue_num(queue_num), |
| 3664 _term_attempts(0), | |
| 545 | 3665 _age_table(false), |
| 342 | 3666 #if G1_DETAILED_STATS |
| 3667 _pushes(0), _pops(0), _steals(0), | |
| 3668 _steal_attempts(0), _overflow_pushes(0), | |
| 3669 #endif | |
| 3670 _strong_roots_time(0), _term_time(0), | |
| 3671 _alloc_buffer_waste(0), _undo_waste(0) | |
| 3672 { | |
| 3673 // we allocate G1YoungSurvRateNumRegions plus one entries, since | |
| 3674 // we "sacrifice" entry 0 to keep track of surviving bytes for | |
| 3675 // non-young regions (where the age is -1) | |
| 3676 // We also add a few elements at the beginning and at the end in | |
| 3677 // an attempt to eliminate cache contention | |
| 3678 size_t real_length = 1 + _g1h->g1_policy()->young_cset_length(); | |
| 3679 size_t array_length = PADDING_ELEM_NUM + | |
| 3680 real_length + | |
| 3681 PADDING_ELEM_NUM; | |
| 3682 _surviving_young_words_base = NEW_C_HEAP_ARRAY(size_t, array_length); | |
| 3683 if (_surviving_young_words_base == NULL) | |
| 3684 vm_exit_out_of_memory(array_length * sizeof(size_t), | |
| 3685 "Not enough space for young surv histo."); | |
| 3686 _surviving_young_words = _surviving_young_words_base + PADDING_ELEM_NUM; | |
| 3687 memset(_surviving_young_words, 0, real_length * sizeof(size_t)); | |
| 3688 | |
| 3689 _overflowed_refs = new OverflowQueue(10); | |
| 3690 | |
| 3691 _start = os::elapsedTime(); | |
| 3692 } | |
| 3693 | |
| 3694 ~G1ParScanThreadState() { | |
| 3695 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base); | |
| 3696 } | |
| 3697 | |
| 3698 RefToScanQueue* refs() { return _refs; } | |
| 3699 OverflowQueue* overflowed_refs() { return _overflowed_refs; } | |
| 545 | 3700 ageTable* age_table() { return &_age_table; } |
| 3701 | |
| 3702 G1ParGCAllocBuffer* alloc_buffer(GCAllocPurpose purpose) { | |
| 342 | 3703 return &_alloc_buffers[purpose]; |
| 3704 } | |
| 3705 | |
| 3706 size_t alloc_buffer_waste() { return _alloc_buffer_waste; } | |
| 3707 size_t undo_waste() { return _undo_waste; } | |
| 3708 | |
| 3709 void push_on_queue(oop* ref) { | |
| 526 | 3710 assert(ref != NULL, "invariant"); |
| 3711 assert(has_partial_array_mask(ref) || _g1h->obj_in_cs(*ref), "invariant"); | |
| 3712 | |
| 342 | 3713 if (!refs()->push(ref)) { |
| 3714 overflowed_refs()->push(ref); | |
| 3715 IF_G1_DETAILED_STATS(note_overflow_push()); | |
| 3716 } else { | |
| 3717 IF_G1_DETAILED_STATS(note_push()); | |
| 3718 } | |
| 3719 } | |
| 3720 | |
| 3721 void pop_from_queue(oop*& ref) { | |
| 3722 if (!refs()->pop_local(ref)) { | |
| 3723 ref = NULL; | |
| 3724 } else { | |
| 526 | 3725 assert(ref != NULL, "invariant"); |
| 3726 assert(has_partial_array_mask(ref) || _g1h->obj_in_cs(*ref), | |
| 3727 "invariant"); | |
| 3728 | |
| 342 | 3729 IF_G1_DETAILED_STATS(note_pop()); |
| 3730 } | |
| 3731 } | |
| 3732 | |
| 3733 void pop_from_overflow_queue(oop*& ref) { | |
| 3734 ref = overflowed_refs()->pop(); | |
| 3735 } | |
| 3736 | |
| 3737 int refs_to_scan() { return refs()->size(); } | |
| 3738 int overflowed_refs_to_scan() { return overflowed_refs()->length(); } | |
| 3739 | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3740 void update_rs(HeapRegion* from, oop* p, int tid) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3741 if (G1DeferredRSUpdate) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3742 deferred_rs_update(from, p, tid); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3743 } else { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3744 immediate_rs_update(from, p, tid); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3745 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3746 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3747 |
| 342 | 3748 HeapWord* allocate_slow(GCAllocPurpose purpose, size_t word_sz) { |
| 3749 | |
| 3750 HeapWord* obj = NULL; | |
| 3751 if (word_sz * 100 < | |
| 3752 (size_t)(ParallelGCG1AllocBufferSize / HeapWordSize) * | |
| 3753 ParallelGCBufferWastePct) { | |
| 3754 G1ParGCAllocBuffer* alloc_buf = alloc_buffer(purpose); | |
| 3755 add_to_alloc_buffer_waste(alloc_buf->words_remaining()); | |
| 3756 alloc_buf->retire(false, false); | |
| 3757 | |
| 3758 HeapWord* buf = | |
| 3759 _g1h->par_allocate_during_gc(purpose, ParallelGCG1AllocBufferSize / HeapWordSize); | |
| 3760 if (buf == NULL) return NULL; // Let caller handle allocation failure. | |
| 3761 // Otherwise. | |
| 3762 alloc_buf->set_buf(buf); | |
| 3763 | |
| 3764 obj = alloc_buf->allocate(word_sz); | |
| 3765 assert(obj != NULL, "buffer was definitely big enough..."); | |
| 526 | 3766 } else { |
| 342 | 3767 obj = _g1h->par_allocate_during_gc(purpose, word_sz); |
| 3768 } | |
| 3769 return obj; | |
| 3770 } | |
| 3771 | |
| 3772 HeapWord* allocate(GCAllocPurpose purpose, size_t word_sz) { | |
| 3773 HeapWord* obj = alloc_buffer(purpose)->allocate(word_sz); | |
| 3774 if (obj != NULL) return obj; | |
| 3775 return allocate_slow(purpose, word_sz); | |
| 3776 } | |
| 3777 | |
| 3778 void undo_allocation(GCAllocPurpose purpose, HeapWord* obj, size_t word_sz) { | |
| 3779 if (alloc_buffer(purpose)->contains(obj)) { | |
| 3780 guarantee(alloc_buffer(purpose)->contains(obj + word_sz - 1), | |
| 3781 "should contain whole object"); | |
| 3782 alloc_buffer(purpose)->undo_allocation(obj, word_sz); | |
|
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
3783 } else { |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
3784 CollectedHeap::fill_with_object(obj, word_sz); |
| 342 | 3785 add_to_undo_waste(word_sz); |
| 3786 } | |
| 3787 } | |
| 3788 | |
| 3789 void set_evac_failure_closure(OopsInHeapRegionClosure* evac_failure_cl) { | |
| 3790 _evac_failure_cl = evac_failure_cl; | |
| 3791 } | |
| 3792 OopsInHeapRegionClosure* evac_failure_closure() { | |
| 3793 return _evac_failure_cl; | |
| 3794 } | |
| 3795 | |
| 3796 void set_evac_closure(G1ParScanHeapEvacClosure* evac_cl) { | |
| 3797 _evac_cl = evac_cl; | |
| 3798 } | |
| 3799 | |
| 3800 void set_partial_scan_closure(G1ParScanPartialArrayClosure* partial_scan_cl) { | |
| 3801 _partial_scan_cl = partial_scan_cl; | |
| 3802 } | |
| 3803 | |
| 3804 int* hash_seed() { return &_hash_seed; } | |
| 3805 int queue_num() { return _queue_num; } | |
| 3806 | |
| 3807 int term_attempts() { return _term_attempts; } | |
| 3808 void note_term_attempt() { _term_attempts++; } | |
| 3809 | |
| 3810 #if G1_DETAILED_STATS | |
| 3811 int pushes() { return _pushes; } | |
| 3812 int pops() { return _pops; } | |
| 3813 int steals() { return _steals; } | |
| 3814 int steal_attempts() { return _steal_attempts; } | |
| 3815 int overflow_pushes() { return _overflow_pushes; } | |
| 3816 | |
| 3817 void note_push() { _pushes++; } | |
| 3818 void note_pop() { _pops++; } | |
| 3819 void note_steal() { _steals++; } | |
| 3820 void note_steal_attempt() { _steal_attempts++; } | |
| 3821 void note_overflow_push() { _overflow_pushes++; } | |
| 3822 #endif | |
| 3823 | |
| 3824 void start_strong_roots() { | |
| 3825 _start_strong_roots = os::elapsedTime(); | |
| 3826 } | |
| 3827 void end_strong_roots() { | |
| 3828 _strong_roots_time += (os::elapsedTime() - _start_strong_roots); | |
| 3829 } | |
| 3830 double strong_roots_time() { return _strong_roots_time; } | |
| 3831 | |
| 3832 void start_term_time() { | |
| 3833 note_term_attempt(); | |
| 3834 _start_term = os::elapsedTime(); | |
| 3835 } | |
| 3836 void end_term_time() { | |
| 3837 _term_time += (os::elapsedTime() - _start_term); | |
| 3838 } | |
| 3839 double term_time() { return _term_time; } | |
| 3840 | |
| 3841 double elapsed() { | |
| 3842 return os::elapsedTime() - _start; | |
| 3843 } | |
| 3844 | |
| 3845 size_t* surviving_young_words() { | |
| 3846 // We add on to hide entry 0 which accumulates surviving words for | |
| 3847 // age -1 regions (i.e. non-young ones) | |
| 3848 return _surviving_young_words; | |
| 3849 } | |
| 3850 | |
| 3851 void retire_alloc_buffers() { | |
| 3852 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { | |
| 3853 size_t waste = _alloc_buffers[ap].words_remaining(); | |
| 3854 add_to_alloc_buffer_waste(waste); | |
| 3855 _alloc_buffers[ap].retire(true, false); | |
| 3856 } | |
| 3857 } | |
| 3858 | |
| 526 | 3859 private: |
| 3860 void deal_with_reference(oop* ref_to_scan) { | |
| 3861 if (has_partial_array_mask(ref_to_scan)) { | |
| 3862 _partial_scan_cl->do_oop_nv(ref_to_scan); | |
| 3863 } else { | |
| 3864 // Note: we can use "raw" versions of "region_containing" because | |
| 3865 // "obj_to_scan" is definitely in the heap, and is not in a | |
| 3866 // humongous region. | |
| 3867 HeapRegion* r = _g1h->heap_region_containing_raw(ref_to_scan); | |
| 3868 _evac_cl->set_region(r); | |
| 3869 _evac_cl->do_oop_nv(ref_to_scan); | |
| 3870 } | |
| 3871 } | |
| 3872 | |
| 3873 public: | |
| 342 | 3874 void trim_queue() { |
| 526 | 3875 // I've replicated the loop twice, first to drain the overflow |
| 3876 // queue, second to drain the task queue. This is better than | |
| 3877 // having a single loop, which checks both conditions and, inside | |
| 3878 // it, either pops the overflow queue or the task queue, as each | |
| 3879 // loop is tighter. Also, the decision to drain the overflow queue | |
| 3880 // first is not arbitrary, as the overflow queue is not visible | |
| 3881 // to the other workers, whereas the task queue is. So, we want to | |
| 3882 // drain the "invisible" entries first, while allowing the other | |
| 3883 // workers to potentially steal the "visible" entries. | |
| 3884 | |
| 342 | 3885 while (refs_to_scan() > 0 || overflowed_refs_to_scan() > 0) { |
| 526 | 3886 while (overflowed_refs_to_scan() > 0) { |
| 3887 oop *ref_to_scan = NULL; | |
| 342 | 3888 pop_from_overflow_queue(ref_to_scan); |
| 526 | 3889 assert(ref_to_scan != NULL, "invariant"); |
| 3890 // We shouldn't have pushed it on the queue if it was not | |
| 3891 // pointing into the CSet. | |
| 3892 assert(ref_to_scan != NULL, "sanity"); | |
| 3893 assert(has_partial_array_mask(ref_to_scan) || | |
| 3894 _g1h->obj_in_cs(*ref_to_scan), "sanity"); | |
| 3895 | |
| 3896 deal_with_reference(ref_to_scan); | |
| 342 | 3897 } |
| 526 | 3898 |
| 3899 while (refs_to_scan() > 0) { | |
| 3900 oop *ref_to_scan = NULL; | |
| 3901 pop_from_queue(ref_to_scan); | |
| 3902 | |
| 3903 if (ref_to_scan != NULL) { | |
| 3904 // We shouldn't have pushed it on the queue if it was not | |
| 3905 // pointing into the CSet. | |
| 3906 assert(has_partial_array_mask(ref_to_scan) || | |
| 3907 _g1h->obj_in_cs(*ref_to_scan), "sanity"); | |
| 3908 | |
| 3909 deal_with_reference(ref_to_scan); | |
| 342 | 3910 } |
| 3911 } | |
| 3912 } | |
| 3913 } | |
| 3914 }; | |
| 3915 | |
| 3916 G1ParClosureSuper::G1ParClosureSuper(G1CollectedHeap* g1, G1ParScanThreadState* par_scan_state) : | |
| 3917 _g1(g1), _g1_rem(_g1->g1_rem_set()), _cm(_g1->concurrent_mark()), | |
| 3918 _par_scan_state(par_scan_state) { } | |
| 3919 | |
| 3920 // This closure is applied to the fields of the objects that have just been copied. | |
| 3921 // Should probably be made inline and moved in g1OopClosures.inline.hpp. | |
| 3922 void G1ParScanClosure::do_oop_nv(oop* p) { | |
| 3923 oop obj = *p; | |
| 526 | 3924 |
| 342 | 3925 if (obj != NULL) { |
| 526 | 3926 if (_g1->in_cset_fast_test(obj)) { |
| 3927 // We're not going to even bother checking whether the object is | |
| 3928 // already forwarded or not, as this usually causes an immediate | |
| 3929 // stall. We'll try to prefetch the object (for write, given that | |
| 3930 // we might need to install the forwarding reference) and we'll | |
| 3931 // get back to it when pop it from the queue | |
| 3932 Prefetch::write(obj->mark_addr(), 0); | |
| 3933 Prefetch::read(obj->mark_addr(), (HeapWordSize*2)); | |
| 3934 | |
| 3935 // slightly paranoid test; I'm trying to catch potential | |
| 3936 // problems before we go into push_on_queue to know where the | |
| 3937 // problem is coming from | |
| 3938 assert(obj == *p, "the value of *p should not have changed"); | |
| 3939 _par_scan_state->push_on_queue(p); | |
| 3940 } else { | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
3941 _par_scan_state->update_rs(_from, p, _par_scan_state->queue_num()); |
| 342 | 3942 } |
| 3943 } | |
| 3944 } | |
| 3945 | |
| 3946 void G1ParCopyHelper::mark_forwardee(oop* p) { | |
| 3947 // This is called _after_ do_oop_work has been called, hence after | |
| 3948 // the object has been relocated to its new location and *p points | |
| 3949 // to its new location. | |
| 3950 | |
| 3951 oop thisOop = *p; | |
| 3952 if (thisOop != NULL) { | |
| 3953 assert((_g1->evacuation_failed()) || (!_g1->obj_in_cs(thisOop)), | |
| 3954 "shouldn't still be in the CSet if evacuation didn't fail."); | |
| 3955 HeapWord* addr = (HeapWord*)thisOop; | |
| 3956 if (_g1->is_in_g1_reserved(addr)) | |
| 3957 _cm->grayRoot(oop(addr)); | |
| 3958 } | |
| 3959 } | |
| 3960 | |
| 3961 oop G1ParCopyHelper::copy_to_survivor_space(oop old) { | |
| 3962 size_t word_sz = old->size(); | |
| 3963 HeapRegion* from_region = _g1->heap_region_containing_raw(old); | |
| 3964 // +1 to make the -1 indexes valid... | |
| 3965 int young_index = from_region->young_index_in_cset()+1; | |
| 3966 assert( (from_region->is_young() && young_index > 0) || | |
| 3967 (!from_region->is_young() && young_index == 0), "invariant" ); | |
| 3968 G1CollectorPolicy* g1p = _g1->g1_policy(); | |
| 3969 markOop m = old->mark(); | |
| 545 | 3970 int age = m->has_displaced_mark_helper() ? m->displaced_mark_helper()->age() |
| 3971 : m->age(); | |
| 3972 GCAllocPurpose alloc_purpose = g1p->evacuation_destination(from_region, age, | |
| 342 | 3973 word_sz); |
| 3974 HeapWord* obj_ptr = _par_scan_state->allocate(alloc_purpose, word_sz); | |
| 3975 oop obj = oop(obj_ptr); | |
| 3976 | |
| 3977 if (obj_ptr == NULL) { | |
| 3978 // This will either forward-to-self, or detect that someone else has | |
| 3979 // installed a forwarding pointer. | |
| 3980 OopsInHeapRegionClosure* cl = _par_scan_state->evac_failure_closure(); | |
| 3981 return _g1->handle_evacuation_failure_par(cl, old); | |
| 3982 } | |
| 3983 | |
| 526 | 3984 // We're going to allocate linearly, so might as well prefetch ahead. |
| 3985 Prefetch::write(obj_ptr, PrefetchCopyIntervalInBytes); | |
| 3986 | |
| 342 | 3987 oop forward_ptr = old->forward_to_atomic(obj); |
| 3988 if (forward_ptr == NULL) { | |
| 3989 Copy::aligned_disjoint_words((HeapWord*) old, obj_ptr, word_sz); | |
| 526 | 3990 if (g1p->track_object_age(alloc_purpose)) { |
| 3991 // We could simply do obj->incr_age(). However, this causes a | |
| 3992 // performance issue. obj->incr_age() will first check whether | |
| 3993 // the object has a displaced mark by checking its mark word; | |
| 3994 // getting the mark word from the new location of the object | |
| 3995 // stalls. So, given that we already have the mark word and we | |
| 3996 // are about to install it anyway, it's better to increase the | |
| 3997 // age on the mark word, when the object does not have a | |
| 3998 // displaced mark word. We're not expecting many objects to have | |
| 3999 // a displaced marked word, so that case is not optimized | |
| 4000 // further (it could be...) and we simply call obj->incr_age(). | |
| 4001 | |
| 4002 if (m->has_displaced_mark_helper()) { | |
| 4003 // in this case, we have to install the mark word first, | |
| 4004 // otherwise obj looks to be forwarded (the old mark word, | |
| 4005 // which contains the forward pointer, was copied) | |
| 4006 obj->set_mark(m); | |
| 4007 obj->incr_age(); | |
| 4008 } else { | |
| 4009 m = m->incr_age(); | |
| 545 | 4010 obj->set_mark(m); |
| 526 | 4011 } |
| 545 | 4012 _par_scan_state->age_table()->add(obj, word_sz); |
| 4013 } else { | |
| 4014 obj->set_mark(m); | |
| 526 | 4015 } |
| 4016 | |
| 342 | 4017 // preserve "next" mark bit |
| 4018 if (_g1->mark_in_progress() && !_g1->is_obj_ill(old)) { | |
| 4019 if (!use_local_bitmaps || | |
| 4020 !_par_scan_state->alloc_buffer(alloc_purpose)->mark(obj_ptr)) { | |
| 4021 // if we couldn't mark it on the local bitmap (this happens when | |
| 4022 // the object was not allocated in the GCLab), we have to bite | |
| 4023 // the bullet and do the standard parallel mark | |
| 4024 _cm->markAndGrayObjectIfNecessary(obj); | |
| 4025 } | |
| 4026 #if 1 | |
| 4027 if (_g1->isMarkedNext(old)) { | |
| 4028 _cm->nextMarkBitMap()->parClear((HeapWord*)old); | |
| 4029 } | |
| 4030 #endif | |
| 4031 } | |
| 4032 | |
| 4033 size_t* surv_young_words = _par_scan_state->surviving_young_words(); | |
| 4034 surv_young_words[young_index] += word_sz; | |
| 4035 | |
| 4036 if (obj->is_objArray() && arrayOop(obj)->length() >= ParGCArrayScanChunk) { | |
| 4037 arrayOop(old)->set_length(0); | |
| 526 | 4038 _par_scan_state->push_on_queue(set_partial_array_mask(old)); |
| 342 | 4039 } else { |
| 526 | 4040 // No point in using the slower heap_region_containing() method, |
| 4041 // given that we know obj is in the heap. | |
| 4042 _scanner->set_region(_g1->heap_region_containing_raw(obj)); | |
| 342 | 4043 obj->oop_iterate_backwards(_scanner); |
| 4044 } | |
| 4045 } else { | |
| 4046 _par_scan_state->undo_allocation(alloc_purpose, obj_ptr, word_sz); | |
| 4047 obj = forward_ptr; | |
| 4048 } | |
| 4049 return obj; | |
| 4050 } | |
| 4051 | |
| 526 | 4052 template<bool do_gen_barrier, G1Barrier barrier, |
| 4053 bool do_mark_forwardee, bool skip_cset_test> | |
| 4054 void G1ParCopyClosure<do_gen_barrier, barrier, | |
| 4055 do_mark_forwardee, skip_cset_test>::do_oop_work(oop* p) { | |
| 342 | 4056 oop obj = *p; |
| 4057 assert(barrier != G1BarrierRS || obj != NULL, | |
| 4058 "Precondition: G1BarrierRS implies obj is nonNull"); | |
| 4059 | |
| 526 | 4060 // The only time we skip the cset test is when we're scanning |
| 4061 // references popped from the queue. And we only push on the queue | |
| 4062 // references that we know point into the cset, so no point in | |
| 4063 // checking again. But we'll leave an assert here for peace of mind. | |
| 4064 assert(!skip_cset_test || _g1->obj_in_cs(obj), "invariant"); | |
| 4065 | |
| 4066 // here the null check is implicit in the cset_fast_test() test | |
| 4067 if (skip_cset_test || _g1->in_cset_fast_test(obj)) { | |
| 342 | 4068 #if G1_REM_SET_LOGGING |
| 526 | 4069 gclog_or_tty->print_cr("Loc "PTR_FORMAT" contains pointer "PTR_FORMAT" " |
| 4070 "into CS.", p, (void*) obj); | |
| 342 | 4071 #endif |
| 526 | 4072 if (obj->is_forwarded()) { |
| 4073 *p = obj->forwardee(); | |
| 4074 } else { | |
| 4075 *p = copy_to_survivor_space(obj); | |
| 342 | 4076 } |
| 526 | 4077 // When scanning the RS, we only care about objs in CS. |
| 4078 if (barrier == G1BarrierRS) { | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4079 _par_scan_state->update_rs(_from, p, _par_scan_state->queue_num()); |
| 342 | 4080 } |
| 526 | 4081 } |
| 4082 | |
| 4083 // When scanning moved objs, must look at all oops. | |
| 4084 if (barrier == G1BarrierEvac && obj != NULL) { | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4085 _par_scan_state->update_rs(_from, p, _par_scan_state->queue_num()); |
| 526 | 4086 } |
| 4087 | |
| 4088 if (do_gen_barrier && obj != NULL) { | |
| 4089 par_do_barrier(p); | |
| 4090 } | |
| 4091 } | |
| 4092 | |
| 4093 template void G1ParCopyClosure<false, G1BarrierEvac, false, true>::do_oop_work(oop* p); | |
| 4094 | |
| 4095 template<class T> void G1ParScanPartialArrayClosure::process_array_chunk( | |
| 342 | 4096 oop obj, int start, int end) { |
| 4097 // process our set of indices (include header in first chunk) | |
| 4098 assert(start < end, "invariant"); | |
| 4099 T* const base = (T*)objArrayOop(obj)->base(); | |
| 526 | 4100 T* const start_addr = (start == 0) ? (T*) obj : base + start; |
| 342 | 4101 T* const end_addr = base + end; |
| 4102 MemRegion mr((HeapWord*)start_addr, (HeapWord*)end_addr); | |
| 4103 _scanner.set_region(_g1->heap_region_containing(obj)); | |
| 4104 obj->oop_iterate(&_scanner, mr); | |
| 4105 } | |
| 4106 | |
| 4107 void G1ParScanPartialArrayClosure::do_oop_nv(oop* p) { | |
| 4108 assert(!UseCompressedOops, "Needs to be fixed to work with compressed oops"); | |
| 526 | 4109 assert(has_partial_array_mask(p), "invariant"); |
| 4110 oop old = clear_partial_array_mask(p); | |
| 342 | 4111 assert(old->is_objArray(), "must be obj array"); |
| 4112 assert(old->is_forwarded(), "must be forwarded"); | |
| 4113 assert(Universe::heap()->is_in_reserved(old), "must be in heap."); | |
| 4114 | |
| 4115 objArrayOop obj = objArrayOop(old->forwardee()); | |
| 4116 assert((void*)old != (void*)old->forwardee(), "self forwarding here?"); | |
| 4117 // Process ParGCArrayScanChunk elements now | |
| 4118 // and push the remainder back onto queue | |
| 4119 int start = arrayOop(old)->length(); | |
| 4120 int end = obj->length(); | |
| 4121 int remainder = end - start; | |
| 4122 assert(start <= end, "just checking"); | |
| 4123 if (remainder > 2 * ParGCArrayScanChunk) { | |
| 4124 // Test above combines last partial chunk with a full chunk | |
| 4125 end = start + ParGCArrayScanChunk; | |
| 4126 arrayOop(old)->set_length(end); | |
| 4127 // Push remainder. | |
| 526 | 4128 _par_scan_state->push_on_queue(set_partial_array_mask(old)); |
| 342 | 4129 } else { |
| 4130 // Restore length so that the heap remains parsable in | |
| 4131 // case of evacuation failure. | |
| 4132 arrayOop(old)->set_length(end); | |
| 4133 } | |
| 4134 | |
| 4135 // process our set of indices (include header in first chunk) | |
| 4136 process_array_chunk<oop>(obj, start, end); | |
| 4137 } | |
| 4138 | |
| 4139 int G1ScanAndBalanceClosure::_nq = 0; | |
| 4140 | |
| 4141 class G1ParEvacuateFollowersClosure : public VoidClosure { | |
| 4142 protected: | |
| 4143 G1CollectedHeap* _g1h; | |
| 4144 G1ParScanThreadState* _par_scan_state; | |
| 4145 RefToScanQueueSet* _queues; | |
| 4146 ParallelTaskTerminator* _terminator; | |
| 4147 | |
| 4148 G1ParScanThreadState* par_scan_state() { return _par_scan_state; } | |
| 4149 RefToScanQueueSet* queues() { return _queues; } | |
| 4150 ParallelTaskTerminator* terminator() { return _terminator; } | |
| 4151 | |
| 4152 public: | |
| 4153 G1ParEvacuateFollowersClosure(G1CollectedHeap* g1h, | |
| 4154 G1ParScanThreadState* par_scan_state, | |
| 4155 RefToScanQueueSet* queues, | |
| 4156 ParallelTaskTerminator* terminator) | |
| 4157 : _g1h(g1h), _par_scan_state(par_scan_state), | |
| 4158 _queues(queues), _terminator(terminator) {} | |
| 4159 | |
| 4160 void do_void() { | |
| 4161 G1ParScanThreadState* pss = par_scan_state(); | |
| 4162 while (true) { | |
| 4163 oop* ref_to_scan; | |
| 4164 pss->trim_queue(); | |
| 4165 IF_G1_DETAILED_STATS(pss->note_steal_attempt()); | |
| 4166 if (queues()->steal(pss->queue_num(), | |
| 4167 pss->hash_seed(), | |
| 4168 ref_to_scan)) { | |
| 4169 IF_G1_DETAILED_STATS(pss->note_steal()); | |
| 526 | 4170 |
| 4171 // slightly paranoid tests; I'm trying to catch potential | |
| 4172 // problems before we go into push_on_queue to know where the | |
| 4173 // problem is coming from | |
| 4174 assert(ref_to_scan != NULL, "invariant"); | |
| 4175 assert(has_partial_array_mask(ref_to_scan) || | |
| 4176 _g1h->obj_in_cs(*ref_to_scan), "invariant"); | |
| 342 | 4177 pss->push_on_queue(ref_to_scan); |
| 4178 continue; | |
| 4179 } | |
| 4180 pss->start_term_time(); | |
| 4181 if (terminator()->offer_termination()) break; | |
| 4182 pss->end_term_time(); | |
| 4183 } | |
| 4184 pss->end_term_time(); | |
| 4185 pss->retire_alloc_buffers(); | |
| 4186 } | |
| 4187 }; | |
| 4188 | |
| 4189 class G1ParTask : public AbstractGangTask { | |
| 4190 protected: | |
| 4191 G1CollectedHeap* _g1h; | |
| 4192 RefToScanQueueSet *_queues; | |
| 4193 ParallelTaskTerminator _terminator; | |
| 4194 | |
| 4195 Mutex _stats_lock; | |
| 4196 Mutex* stats_lock() { return &_stats_lock; } | |
| 4197 | |
| 4198 size_t getNCards() { | |
| 4199 return (_g1h->capacity() + G1BlockOffsetSharedArray::N_bytes - 1) | |
| 4200 / G1BlockOffsetSharedArray::N_bytes; | |
| 4201 } | |
| 4202 | |
| 4203 public: | |
| 4204 G1ParTask(G1CollectedHeap* g1h, int workers, RefToScanQueueSet *task_queues) | |
| 4205 : AbstractGangTask("G1 collection"), | |
| 4206 _g1h(g1h), | |
| 4207 _queues(task_queues), | |
| 4208 _terminator(workers, _queues), | |
| 4209 _stats_lock(Mutex::leaf, "parallel G1 stats lock", true) | |
| 4210 {} | |
| 4211 | |
| 4212 RefToScanQueueSet* queues() { return _queues; } | |
| 4213 | |
| 4214 RefToScanQueue *work_queue(int i) { | |
| 4215 return queues()->queue(i); | |
| 4216 } | |
| 4217 | |
| 4218 void work(int i) { | |
| 4219 ResourceMark rm; | |
| 4220 HandleMark hm; | |
| 4221 | |
| 526 | 4222 G1ParScanThreadState pss(_g1h, i); |
| 4223 G1ParScanHeapEvacClosure scan_evac_cl(_g1h, &pss); | |
| 4224 G1ParScanHeapEvacFailureClosure evac_failure_cl(_g1h, &pss); | |
| 4225 G1ParScanPartialArrayClosure partial_scan_cl(_g1h, &pss); | |
| 342 | 4226 |
| 4227 pss.set_evac_closure(&scan_evac_cl); | |
| 4228 pss.set_evac_failure_closure(&evac_failure_cl); | |
| 4229 pss.set_partial_scan_closure(&partial_scan_cl); | |
| 4230 | |
| 4231 G1ParScanExtRootClosure only_scan_root_cl(_g1h, &pss); | |
| 4232 G1ParScanPermClosure only_scan_perm_cl(_g1h, &pss); | |
| 4233 G1ParScanHeapRSClosure only_scan_heap_rs_cl(_g1h, &pss); | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4234 |
| 342 | 4235 G1ParScanAndMarkExtRootClosure scan_mark_root_cl(_g1h, &pss); |
| 4236 G1ParScanAndMarkPermClosure scan_mark_perm_cl(_g1h, &pss); | |
| 4237 G1ParScanAndMarkHeapRSClosure scan_mark_heap_rs_cl(_g1h, &pss); | |
| 4238 | |
| 4239 OopsInHeapRegionClosure *scan_root_cl; | |
| 4240 OopsInHeapRegionClosure *scan_perm_cl; | |
| 4241 OopsInHeapRegionClosure *scan_so_cl; | |
| 4242 | |
| 4243 if (_g1h->g1_policy()->should_initiate_conc_mark()) { | |
| 4244 scan_root_cl = &scan_mark_root_cl; | |
| 4245 scan_perm_cl = &scan_mark_perm_cl; | |
| 4246 scan_so_cl = &scan_mark_heap_rs_cl; | |
| 4247 } else { | |
| 4248 scan_root_cl = &only_scan_root_cl; | |
| 4249 scan_perm_cl = &only_scan_perm_cl; | |
| 4250 scan_so_cl = &only_scan_heap_rs_cl; | |
| 4251 } | |
| 4252 | |
| 4253 pss.start_strong_roots(); | |
| 4254 _g1h->g1_process_strong_roots(/* not collecting perm */ false, | |
| 4255 SharedHeap::SO_AllClasses, | |
| 4256 scan_root_cl, | |
| 4257 &only_scan_heap_rs_cl, | |
| 4258 scan_so_cl, | |
| 4259 scan_perm_cl, | |
| 4260 i); | |
| 4261 pss.end_strong_roots(); | |
| 4262 { | |
| 4263 double start = os::elapsedTime(); | |
| 4264 G1ParEvacuateFollowersClosure evac(_g1h, &pss, _queues, &_terminator); | |
| 4265 evac.do_void(); | |
| 4266 double elapsed_ms = (os::elapsedTime()-start)*1000.0; | |
| 4267 double term_ms = pss.term_time()*1000.0; | |
| 4268 _g1h->g1_policy()->record_obj_copy_time(i, elapsed_ms-term_ms); | |
| 4269 _g1h->g1_policy()->record_termination_time(i, term_ms); | |
| 4270 } | |
| 545 | 4271 if (G1UseSurvivorSpace) { |
| 4272 _g1h->g1_policy()->record_thread_age_table(pss.age_table()); | |
| 4273 } | |
| 342 | 4274 _g1h->update_surviving_young_words(pss.surviving_young_words()+1); |
| 4275 | |
| 4276 // Clean up any par-expanded rem sets. | |
| 4277 HeapRegionRemSet::par_cleanup(); | |
| 4278 | |
| 4279 MutexLocker x(stats_lock()); | |
| 4280 if (ParallelGCVerbose) { | |
| 4281 gclog_or_tty->print("Thread %d complete:\n", i); | |
| 4282 #if G1_DETAILED_STATS | |
| 4283 gclog_or_tty->print(" Pushes: %7d Pops: %7d Overflows: %7d Steals %7d (in %d attempts)\n", | |
| 4284 pss.pushes(), | |
| 4285 pss.pops(), | |
| 4286 pss.overflow_pushes(), | |
| 4287 pss.steals(), | |
| 4288 pss.steal_attempts()); | |
| 4289 #endif | |
| 4290 double elapsed = pss.elapsed(); | |
| 4291 double strong_roots = pss.strong_roots_time(); | |
| 4292 double term = pss.term_time(); | |
| 4293 gclog_or_tty->print(" Elapsed: %7.2f ms.\n" | |
| 4294 " Strong roots: %7.2f ms (%6.2f%%)\n" | |
| 4295 " Termination: %7.2f ms (%6.2f%%) (in %d entries)\n", | |
| 4296 elapsed * 1000.0, | |
| 4297 strong_roots * 1000.0, (strong_roots*100.0/elapsed), | |
| 4298 term * 1000.0, (term*100.0/elapsed), | |
| 4299 pss.term_attempts()); | |
| 4300 size_t total_waste = pss.alloc_buffer_waste() + pss.undo_waste(); | |
| 4301 gclog_or_tty->print(" Waste: %8dK\n" | |
| 4302 " Alloc Buffer: %8dK\n" | |
| 4303 " Undo: %8dK\n", | |
| 4304 (total_waste * HeapWordSize) / K, | |
| 4305 (pss.alloc_buffer_waste() * HeapWordSize) / K, | |
| 4306 (pss.undo_waste() * HeapWordSize) / K); | |
| 4307 } | |
| 4308 | |
| 4309 assert(pss.refs_to_scan() == 0, "Task queue should be empty"); | |
| 4310 assert(pss.overflowed_refs_to_scan() == 0, "Overflow queue should be empty"); | |
| 4311 } | |
| 4312 }; | |
| 4313 | |
| 4314 // *** Common G1 Evacuation Stuff | |
| 4315 | |
| 4316 class G1CountClosure: public OopsInHeapRegionClosure { | |
| 4317 public: | |
| 4318 int n; | |
| 4319 G1CountClosure() : n(0) {} | |
| 4320 void do_oop(narrowOop* p) { | |
| 4321 guarantee(false, "NYI"); | |
| 4322 } | |
| 4323 void do_oop(oop* p) { | |
| 4324 oop obj = *p; | |
| 4325 assert(obj != NULL && G1CollectedHeap::heap()->obj_in_cs(obj), | |
| 4326 "Rem set closure called on non-rem-set pointer."); | |
| 4327 n++; | |
| 4328 } | |
| 4329 }; | |
| 4330 | |
| 4331 static G1CountClosure count_closure; | |
| 4332 | |
| 4333 void | |
| 4334 G1CollectedHeap:: | |
| 4335 g1_process_strong_roots(bool collecting_perm_gen, | |
| 4336 SharedHeap::ScanningOption so, | |
| 4337 OopClosure* scan_non_heap_roots, | |
| 4338 OopsInHeapRegionClosure* scan_rs, | |
| 4339 OopsInHeapRegionClosure* scan_so, | |
| 4340 OopsInGenClosure* scan_perm, | |
| 4341 int worker_i) { | |
| 4342 // First scan the strong roots, including the perm gen. | |
| 4343 double ext_roots_start = os::elapsedTime(); | |
| 4344 double closure_app_time_sec = 0.0; | |
| 4345 | |
| 4346 BufferingOopClosure buf_scan_non_heap_roots(scan_non_heap_roots); | |
| 4347 BufferingOopsInGenClosure buf_scan_perm(scan_perm); | |
| 4348 buf_scan_perm.set_generation(perm_gen()); | |
| 4349 | |
| 4350 process_strong_roots(collecting_perm_gen, so, | |
| 4351 &buf_scan_non_heap_roots, | |
| 4352 &buf_scan_perm); | |
| 4353 // Finish up any enqueued closure apps. | |
| 4354 buf_scan_non_heap_roots.done(); | |
| 4355 buf_scan_perm.done(); | |
| 4356 double ext_roots_end = os::elapsedTime(); | |
| 4357 g1_policy()->reset_obj_copy_time(worker_i); | |
| 4358 double obj_copy_time_sec = | |
| 4359 buf_scan_non_heap_roots.closure_app_seconds() + | |
| 4360 buf_scan_perm.closure_app_seconds(); | |
| 4361 g1_policy()->record_obj_copy_time(worker_i, obj_copy_time_sec * 1000.0); | |
| 4362 double ext_root_time_ms = | |
| 4363 ((ext_roots_end - ext_roots_start) - obj_copy_time_sec) * 1000.0; | |
| 4364 g1_policy()->record_ext_root_scan_time(worker_i, ext_root_time_ms); | |
| 4365 | |
| 4366 // Scan strong roots in mark stack. | |
| 4367 if (!_process_strong_tasks->is_task_claimed(G1H_PS_mark_stack_oops_do)) { | |
| 4368 concurrent_mark()->oops_do(scan_non_heap_roots); | |
| 4369 } | |
| 4370 double mark_stack_scan_ms = (os::elapsedTime() - ext_roots_end) * 1000.0; | |
| 4371 g1_policy()->record_mark_stack_scan_time(worker_i, mark_stack_scan_ms); | |
| 4372 | |
| 4373 // XXX What should this be doing in the parallel case? | |
| 4374 g1_policy()->record_collection_pause_end_CH_strong_roots(); | |
| 4375 if (G1VerifyRemSet) { | |
| 4376 // :::: FIXME :::: | |
| 4377 // The stupid remembered set doesn't know how to filter out dead | |
| 4378 // objects, which the smart one does, and so when it is created | |
| 4379 // and then compared the number of entries in each differs and | |
| 4380 // the verification code fails. | |
| 4381 guarantee(false, "verification code is broken, see note"); | |
| 4382 | |
| 4383 // Let's make sure that the current rem set agrees with the stupidest | |
| 4384 // one possible! | |
| 4385 bool refs_enabled = ref_processor()->discovery_enabled(); | |
| 4386 if (refs_enabled) ref_processor()->disable_discovery(); | |
| 4387 StupidG1RemSet stupid(this); | |
| 4388 count_closure.n = 0; | |
| 4389 stupid.oops_into_collection_set_do(&count_closure, worker_i); | |
| 4390 int stupid_n = count_closure.n; | |
| 4391 count_closure.n = 0; | |
| 4392 g1_rem_set()->oops_into_collection_set_do(&count_closure, worker_i); | |
| 4393 guarantee(count_closure.n == stupid_n, "Old and new rem sets differ."); | |
| 4394 gclog_or_tty->print_cr("\nFound %d pointers in heap RS.", count_closure.n); | |
| 4395 if (refs_enabled) ref_processor()->enable_discovery(); | |
| 4396 } | |
| 4397 if (scan_so != NULL) { | |
| 4398 scan_scan_only_set(scan_so, worker_i); | |
| 4399 } | |
| 4400 // Now scan the complement of the collection set. | |
| 4401 if (scan_rs != NULL) { | |
| 4402 g1_rem_set()->oops_into_collection_set_do(scan_rs, worker_i); | |
| 4403 } | |
| 4404 // Finish with the ref_processor roots. | |
| 4405 if (!_process_strong_tasks->is_task_claimed(G1H_PS_refProcessor_oops_do)) { | |
| 4406 ref_processor()->oops_do(scan_non_heap_roots); | |
| 4407 } | |
| 4408 g1_policy()->record_collection_pause_end_G1_strong_roots(); | |
| 4409 _process_strong_tasks->all_tasks_completed(); | |
| 4410 } | |
| 4411 | |
| 4412 void | |
| 4413 G1CollectedHeap::scan_scan_only_region(HeapRegion* r, | |
| 4414 OopsInHeapRegionClosure* oc, | |
| 4415 int worker_i) { | |
| 4416 HeapWord* startAddr = r->bottom(); | |
| 4417 HeapWord* endAddr = r->used_region().end(); | |
| 4418 | |
| 4419 oc->set_region(r); | |
| 4420 | |
| 4421 HeapWord* p = r->bottom(); | |
| 4422 HeapWord* t = r->top(); | |
| 4423 guarantee( p == r->next_top_at_mark_start(), "invariant" ); | |
| 4424 while (p < t) { | |
| 4425 oop obj = oop(p); | |
| 4426 p += obj->oop_iterate(oc); | |
| 4427 } | |
| 4428 } | |
| 4429 | |
| 4430 void | |
| 4431 G1CollectedHeap::scan_scan_only_set(OopsInHeapRegionClosure* oc, | |
| 4432 int worker_i) { | |
| 4433 double start = os::elapsedTime(); | |
| 4434 | |
| 4435 BufferingOopsInHeapRegionClosure boc(oc); | |
| 4436 | |
| 4437 FilterInHeapRegionAndIntoCSClosure scan_only(this, &boc); | |
| 4438 FilterAndMarkInHeapRegionAndIntoCSClosure scan_and_mark(this, &boc, concurrent_mark()); | |
| 4439 | |
| 4440 OopsInHeapRegionClosure *foc; | |
| 4441 if (g1_policy()->should_initiate_conc_mark()) | |
| 4442 foc = &scan_and_mark; | |
| 4443 else | |
| 4444 foc = &scan_only; | |
| 4445 | |
| 4446 HeapRegion* hr; | |
| 4447 int n = 0; | |
| 4448 while ((hr = _young_list->par_get_next_scan_only_region()) != NULL) { | |
| 4449 scan_scan_only_region(hr, foc, worker_i); | |
| 4450 ++n; | |
| 4451 } | |
| 4452 boc.done(); | |
| 4453 | |
| 4454 double closure_app_s = boc.closure_app_seconds(); | |
| 4455 g1_policy()->record_obj_copy_time(worker_i, closure_app_s * 1000.0); | |
| 4456 double ms = (os::elapsedTime() - start - closure_app_s)*1000.0; | |
| 4457 g1_policy()->record_scan_only_time(worker_i, ms, n); | |
| 4458 } | |
| 4459 | |
| 4460 void | |
| 4461 G1CollectedHeap::g1_process_weak_roots(OopClosure* root_closure, | |
| 4462 OopClosure* non_root_closure) { | |
| 4463 SharedHeap::process_weak_roots(root_closure, non_root_closure); | |
| 4464 } | |
| 4465 | |
| 4466 | |
| 4467 class SaveMarksClosure: public HeapRegionClosure { | |
| 4468 public: | |
| 4469 bool doHeapRegion(HeapRegion* r) { | |
| 4470 r->save_marks(); | |
| 4471 return false; | |
| 4472 } | |
| 4473 }; | |
| 4474 | |
| 4475 void G1CollectedHeap::save_marks() { | |
| 4476 if (ParallelGCThreads == 0) { | |
| 4477 SaveMarksClosure sm; | |
| 4478 heap_region_iterate(&sm); | |
| 4479 } | |
| 4480 // We do this even in the parallel case | |
| 4481 perm_gen()->save_marks(); | |
| 4482 } | |
| 4483 | |
| 4484 void G1CollectedHeap::evacuate_collection_set() { | |
| 4485 set_evacuation_failed(false); | |
| 4486 | |
| 4487 g1_rem_set()->prepare_for_oops_into_collection_set_do(); | |
| 4488 concurrent_g1_refine()->set_use_cache(false); | |
| 4489 int n_workers = (ParallelGCThreads > 0 ? workers()->total_workers() : 1); | |
| 4490 set_par_threads(n_workers); | |
| 4491 G1ParTask g1_par_task(this, n_workers, _task_queues); | |
| 4492 | |
| 4493 init_for_evac_failure(NULL); | |
| 4494 | |
| 4495 change_strong_roots_parity(); // In preparation for parallel strong roots. | |
| 4496 rem_set()->prepare_for_younger_refs_iterate(true); | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4497 |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4498 assert(dirty_card_queue_set().completed_buffers_num() == 0, "Should be empty"); |
| 342 | 4499 double start_par = os::elapsedTime(); |
| 4500 if (ParallelGCThreads > 0) { | |
| 4501 // The individual threads will set their evac-failure closures. | |
| 4502 workers()->run_task(&g1_par_task); | |
| 4503 } else { | |
| 4504 g1_par_task.work(0); | |
| 4505 } | |
| 4506 | |
| 4507 double par_time = (os::elapsedTime() - start_par) * 1000.0; | |
| 4508 g1_policy()->record_par_time(par_time); | |
| 4509 set_par_threads(0); | |
| 4510 // Is this the right thing to do here? We don't save marks | |
| 4511 // on individual heap regions when we allocate from | |
| 4512 // them in parallel, so this seems like the correct place for this. | |
| 545 | 4513 retire_all_alloc_regions(); |
| 342 | 4514 { |
| 4515 G1IsAliveClosure is_alive(this); | |
| 4516 G1KeepAliveClosure keep_alive(this); | |
| 4517 JNIHandles::weak_oops_do(&is_alive, &keep_alive); | |
| 4518 } | |
| 4519 g1_rem_set()->cleanup_after_oops_into_collection_set_do(); | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4520 |
| 342 | 4521 concurrent_g1_refine()->set_use_cache(true); |
| 4522 | |
| 4523 finalize_for_evac_failure(); | |
| 4524 | |
| 4525 // Must do this before removing self-forwarding pointers, which clears | |
| 4526 // the per-region evac-failure flags. | |
| 4527 concurrent_mark()->complete_marking_in_collection_set(); | |
| 4528 | |
| 4529 if (evacuation_failed()) { | |
| 4530 remove_self_forwarding_pointers(); | |
| 4531 if (PrintGCDetails) { | |
| 4532 gclog_or_tty->print(" (evacuation failed)"); | |
| 4533 } else if (PrintGC) { | |
| 4534 gclog_or_tty->print("--"); | |
| 4535 } | |
| 4536 } | |
| 4537 | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4538 if (G1DeferredRSUpdate) { |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4539 RedirtyLoggedCardTableEntryFastClosure redirty; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4540 dirty_card_queue_set().set_closure(&redirty); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4541 dirty_card_queue_set().apply_closure_to_all_completed_buffers(); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4542 JavaThread::dirty_card_queue_set().merge_bufferlists(&dirty_card_queue_set()); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4543 assert(dirty_card_queue_set().completed_buffers_num() == 0, "All should be consumed"); |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4544 } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
595
diff
changeset
|
4545 |
| 342 | 4546 COMPILER2_PRESENT(DerivedPointerTable::update_pointers()); |
| 4547 } | |
| 4548 | |
| 4549 void G1CollectedHeap::free_region(HeapRegion* hr) { | |
| 4550 size_t pre_used = 0; | |
| 4551 size_t cleared_h_regions = 0; | |
| 4552 size_t freed_regions = 0; | |
| 4553 UncleanRegionList local_list; | |
| 4554 | |
| 4555 HeapWord* start = hr->bottom(); | |
| 4556 HeapWord* end = hr->prev_top_at_mark_start(); | |
| 4557 size_t used_bytes = hr->used(); | |
| 4558 size_t live_bytes = hr->max_live_bytes(); | |
| 4559 if (used_bytes > 0) { | |
| 4560 guarantee( live_bytes <= used_bytes, "invariant" ); | |
| 4561 } else { | |
| 4562 guarantee( live_bytes == 0, "invariant" ); | |
| 4563 } | |
| 4564 | |
| 4565 size_t garbage_bytes = used_bytes - live_bytes; | |
| 4566 if (garbage_bytes > 0) | |
| 4567 g1_policy()->decrease_known_garbage_bytes(garbage_bytes); | |
| 4568 | |
| 4569 free_region_work(hr, pre_used, cleared_h_regions, freed_regions, | |
| 4570 &local_list); | |
| 4571 finish_free_region_work(pre_used, cleared_h_regions, freed_regions, | |
| 4572 &local_list); | |
| 4573 } | |
| 4574 | |
| 4575 void | |
| 4576 G1CollectedHeap::free_region_work(HeapRegion* hr, | |
| 4577 size_t& pre_used, | |
| 4578 size_t& cleared_h_regions, | |
| 4579 size_t& freed_regions, | |
| 4580 UncleanRegionList* list, | |
| 4581 bool par) { | |
| 4582 assert(!hr->popular(), "should not free popular regions"); | |
| 4583 pre_used += hr->used(); | |
| 4584 if (hr->isHumongous()) { | |
| 4585 assert(hr->startsHumongous(), | |
| 4586 "Only the start of a humongous region should be freed."); | |
| 4587 int ind = _hrs->find(hr); | |
| 4588 assert(ind != -1, "Should have an index."); | |
| 4589 // Clear the start region. | |
| 4590 hr->hr_clear(par, true /*clear_space*/); | |
| 4591 list->insert_before_head(hr); | |
| 4592 cleared_h_regions++; | |
| 4593 freed_regions++; | |
| 4594 // Clear any continued regions. | |
| 4595 ind++; | |
| 4596 while ((size_t)ind < n_regions()) { | |
| 4597 HeapRegion* hrc = _hrs->at(ind); | |
| 4598 if (!hrc->continuesHumongous()) break; | |
| 4599 // Otherwise, does continue the H region. | |
| 4600 assert(hrc->humongous_start_region() == hr, "Huh?"); | |
| 4601 hrc->hr_clear(par, true /*clear_space*/); | |
| 4602 cleared_h_regions++; | |
| 4603 freed_regions++; | |
| 4604 list->insert_before_head(hrc); | |
| 4605 ind++; | |
| 4606 } | |
| 4607 } else { | |
| 4608 hr->hr_clear(par, true /*clear_space*/); | |
| 4609 list->insert_before_head(hr); | |
| 4610 freed_regions++; | |
| 4611 // If we're using clear2, this should not be enabled. | |
| 4612 // assert(!hr->in_cohort(), "Can't be both free and in a cohort."); | |
| 4613 } | |
| 4614 } | |
| 4615 | |
| 4616 void G1CollectedHeap::finish_free_region_work(size_t pre_used, | |
| 4617 size_t cleared_h_regions, | |
| 4618 size_t freed_regions, | |
| 4619 UncleanRegionList* list) { | |
| 4620 if (list != NULL && list->sz() > 0) { | |
| 4621 prepend_region_list_on_unclean_list(list); | |
| 4622 } | |
| 4623 // Acquire a lock, if we're parallel, to update possibly-shared | |
| 4624 // variables. | |
| 4625 Mutex* lock = (n_par_threads() > 0) ? ParGCRareEvent_lock : NULL; | |
| 4626 { | |
| 4627 MutexLockerEx x(lock, Mutex::_no_safepoint_check_flag); | |
| 4628 _summary_bytes_used -= pre_used; | |
| 4629 _num_humongous_regions -= (int) cleared_h_regions; | |
| 4630 _free_regions += freed_regions; | |
| 4631 } | |
| 4632 } | |
| 4633 | |
| 4634 | |
| 4635 void G1CollectedHeap::dirtyCardsForYoungRegions(CardTableModRefBS* ct_bs, HeapRegion* list) { | |
| 4636 while (list != NULL) { | |
| 4637 guarantee( list->is_young(), "invariant" ); | |
| 4638 | |
| 4639 HeapWord* bottom = list->bottom(); | |
| 4640 HeapWord* end = list->end(); | |
| 4641 MemRegion mr(bottom, end); | |
| 4642 ct_bs->dirty(mr); | |
| 4643 | |
| 4644 list = list->get_next_young_region(); | |
| 4645 } | |
| 4646 } | |
| 4647 | |
| 4648 void G1CollectedHeap::cleanUpCardTable() { | |
| 4649 CardTableModRefBS* ct_bs = (CardTableModRefBS*) (barrier_set()); | |
| 4650 double start = os::elapsedTime(); | |
| 4651 | |
| 4652 ct_bs->clear(_g1_committed); | |
| 4653 | |
| 4654 // now, redirty the cards of the scan-only and survivor regions | |
| 4655 // (it seemed faster to do it this way, instead of iterating over | |
| 4656 // all regions and then clearing / dirtying as approprite) | |
| 4657 dirtyCardsForYoungRegions(ct_bs, _young_list->first_scan_only_region()); | |
| 4658 dirtyCardsForYoungRegions(ct_bs, _young_list->first_survivor_region()); | |
| 4659 | |
| 4660 double elapsed = os::elapsedTime() - start; | |
| 4661 g1_policy()->record_clear_ct_time( elapsed * 1000.0); | |
| 4662 } | |
| 4663 | |
| 4664 | |
| 4665 void G1CollectedHeap::do_collection_pause_if_appropriate(size_t word_size) { | |
| 4666 // First do any popular regions. | |
| 4667 HeapRegion* hr; | |
| 4668 while ((hr = popular_region_to_evac()) != NULL) { | |
| 4669 evac_popular_region(hr); | |
| 4670 } | |
| 4671 // Now do heuristic pauses. | |
| 4672 if (g1_policy()->should_do_collection_pause(word_size)) { | |
| 4673 do_collection_pause(); | |
| 4674 } | |
| 4675 } | |
| 4676 | |
| 4677 void G1CollectedHeap::free_collection_set(HeapRegion* cs_head) { | |
| 4678 double young_time_ms = 0.0; | |
| 4679 double non_young_time_ms = 0.0; | |
| 4680 | |
| 4681 G1CollectorPolicy* policy = g1_policy(); | |
| 4682 | |
| 4683 double start_sec = os::elapsedTime(); | |
| 4684 bool non_young = true; | |
| 4685 | |
| 4686 HeapRegion* cur = cs_head; | |
| 4687 int age_bound = -1; | |
| 4688 size_t rs_lengths = 0; | |
| 4689 | |
| 4690 while (cur != NULL) { | |
| 4691 if (non_young) { | |
| 4692 if (cur->is_young()) { | |
| 4693 double end_sec = os::elapsedTime(); | |
| 4694 double elapsed_ms = (end_sec - start_sec) * 1000.0; | |
| 4695 non_young_time_ms += elapsed_ms; | |
| 4696 | |
| 4697 start_sec = os::elapsedTime(); | |
| 4698 non_young = false; | |
| 4699 } | |
| 4700 } else { | |
| 4701 if (!cur->is_on_free_list()) { | |
| 4702 double end_sec = os::elapsedTime(); | |
| 4703 double elapsed_ms = (end_sec - start_sec) * 1000.0; | |
| 4704 young_time_ms += elapsed_ms; | |
| 4705 | |
| 4706 start_sec = os::elapsedTime(); | |
| 4707 non_young = true; | |
| 4708 } | |
| 4709 } | |
| 4710 | |
| 4711 rs_lengths += cur->rem_set()->occupied(); | |
| 4712 | |
| 4713 HeapRegion* next = cur->next_in_collection_set(); | |
| 4714 assert(cur->in_collection_set(), "bad CS"); | |
| 4715 cur->set_next_in_collection_set(NULL); | |
| 4716 cur->set_in_collection_set(false); | |
| 4717 | |
| 4718 if (cur->is_young()) { | |
| 4719 int index = cur->young_index_in_cset(); | |
| 4720 guarantee( index != -1, "invariant" ); | |
| 4721 guarantee( (size_t)index < policy->young_cset_length(), "invariant" ); | |
| 4722 size_t words_survived = _surviving_young_words[index]; | |
| 4723 cur->record_surv_words_in_group(words_survived); | |
| 4724 } else { | |
| 4725 int index = cur->young_index_in_cset(); | |
| 4726 guarantee( index == -1, "invariant" ); | |
| 4727 } | |
| 4728 | |
| 4729 assert( (cur->is_young() && cur->young_index_in_cset() > -1) || | |
| 4730 (!cur->is_young() && cur->young_index_in_cset() == -1), | |
| 4731 "invariant" ); | |
| 4732 | |
| 4733 if (!cur->evacuation_failed()) { | |
| 4734 // And the region is empty. | |
| 4735 assert(!cur->is_empty(), | |
| 4736 "Should not have empty regions in a CS."); | |
| 4737 free_region(cur); | |
| 4738 } else { | |
| 4739 guarantee( !cur->is_scan_only(), "should not be scan only" ); | |
| 4740 cur->uninstall_surv_rate_group(); | |
| 4741 if (cur->is_young()) | |
| 4742 cur->set_young_index_in_cset(-1); | |
| 4743 cur->set_not_young(); | |
| 4744 cur->set_evacuation_failed(false); | |
| 4745 } | |
| 4746 cur = next; | |
| 4747 } | |
| 4748 | |
| 4749 policy->record_max_rs_lengths(rs_lengths); | |
| 4750 policy->cset_regions_freed(); | |
| 4751 | |
| 4752 double end_sec = os::elapsedTime(); | |
| 4753 double elapsed_ms = (end_sec - start_sec) * 1000.0; | |
| 4754 if (non_young) | |
| 4755 non_young_time_ms += elapsed_ms; | |
| 4756 else | |
| 4757 young_time_ms += elapsed_ms; | |
| 4758 | |
| 4759 policy->record_young_free_cset_time_ms(young_time_ms); | |
| 4760 policy->record_non_young_free_cset_time_ms(non_young_time_ms); | |
| 4761 } | |
| 4762 | |
| 4763 HeapRegion* | |
| 4764 G1CollectedHeap::alloc_region_from_unclean_list_locked(bool zero_filled) { | |
| 4765 assert(ZF_mon->owned_by_self(), "Precondition"); | |
| 4766 HeapRegion* res = pop_unclean_region_list_locked(); | |
| 4767 if (res != NULL) { | |
| 4768 assert(!res->continuesHumongous() && | |
| 4769 res->zero_fill_state() != HeapRegion::Allocated, | |
| 4770 "Only free regions on unclean list."); | |
| 4771 if (zero_filled) { | |
| 4772 res->ensure_zero_filled_locked(); | |
| 4773 res->set_zero_fill_allocated(); | |
| 4774 } | |
| 4775 } | |
| 4776 return res; | |
| 4777 } | |
| 4778 | |
| 4779 HeapRegion* G1CollectedHeap::alloc_region_from_unclean_list(bool zero_filled) { | |
| 4780 MutexLockerEx zx(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 4781 return alloc_region_from_unclean_list_locked(zero_filled); | |
| 4782 } | |
| 4783 | |
| 4784 void G1CollectedHeap::put_region_on_unclean_list(HeapRegion* r) { | |
| 4785 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 4786 put_region_on_unclean_list_locked(r); | |
| 4787 if (should_zf()) ZF_mon->notify_all(); // Wake up ZF thread. | |
| 4788 } | |
| 4789 | |
| 4790 void G1CollectedHeap::set_unclean_regions_coming(bool b) { | |
| 4791 MutexLockerEx x(Cleanup_mon); | |
| 4792 set_unclean_regions_coming_locked(b); | |
| 4793 } | |
| 4794 | |
| 4795 void G1CollectedHeap::set_unclean_regions_coming_locked(bool b) { | |
| 4796 assert(Cleanup_mon->owned_by_self(), "Precondition"); | |
| 4797 _unclean_regions_coming = b; | |
| 4798 // Wake up mutator threads that might be waiting for completeCleanup to | |
| 4799 // finish. | |
| 4800 if (!b) Cleanup_mon->notify_all(); | |
| 4801 } | |
| 4802 | |
| 4803 void G1CollectedHeap::wait_for_cleanup_complete() { | |
| 4804 MutexLockerEx x(Cleanup_mon); | |
| 4805 wait_for_cleanup_complete_locked(); | |
| 4806 } | |
| 4807 | |
| 4808 void G1CollectedHeap::wait_for_cleanup_complete_locked() { | |
| 4809 assert(Cleanup_mon->owned_by_self(), "precondition"); | |
| 4810 while (_unclean_regions_coming) { | |
| 4811 Cleanup_mon->wait(); | |
| 4812 } | |
| 4813 } | |
| 4814 | |
| 4815 void | |
| 4816 G1CollectedHeap::put_region_on_unclean_list_locked(HeapRegion* r) { | |
| 4817 assert(ZF_mon->owned_by_self(), "precondition."); | |
| 4818 _unclean_region_list.insert_before_head(r); | |
| 4819 } | |
| 4820 | |
| 4821 void | |
| 4822 G1CollectedHeap::prepend_region_list_on_unclean_list(UncleanRegionList* list) { | |
| 4823 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 4824 prepend_region_list_on_unclean_list_locked(list); | |
| 4825 if (should_zf()) ZF_mon->notify_all(); // Wake up ZF thread. | |
| 4826 } | |
| 4827 | |
| 4828 void | |
| 4829 G1CollectedHeap:: | |
| 4830 prepend_region_list_on_unclean_list_locked(UncleanRegionList* list) { | |
| 4831 assert(ZF_mon->owned_by_self(), "precondition."); | |
| 4832 _unclean_region_list.prepend_list(list); | |
| 4833 } | |
| 4834 | |
| 4835 HeapRegion* G1CollectedHeap::pop_unclean_region_list_locked() { | |
| 4836 assert(ZF_mon->owned_by_self(), "precondition."); | |
| 4837 HeapRegion* res = _unclean_region_list.pop(); | |
| 4838 if (res != NULL) { | |
| 4839 // Inform ZF thread that there's a new unclean head. | |
| 4840 if (_unclean_region_list.hd() != NULL && should_zf()) | |
| 4841 ZF_mon->notify_all(); | |
| 4842 } | |
| 4843 return res; | |
| 4844 } | |
| 4845 | |
| 4846 HeapRegion* G1CollectedHeap::peek_unclean_region_list_locked() { | |
| 4847 assert(ZF_mon->owned_by_self(), "precondition."); | |
| 4848 return _unclean_region_list.hd(); | |
| 4849 } | |
| 4850 | |
| 4851 | |
| 4852 bool G1CollectedHeap::move_cleaned_region_to_free_list_locked() { | |
| 4853 assert(ZF_mon->owned_by_self(), "Precondition"); | |
| 4854 HeapRegion* r = peek_unclean_region_list_locked(); | |
| 4855 if (r != NULL && r->zero_fill_state() == HeapRegion::ZeroFilled) { | |
| 4856 // Result of below must be equal to "r", since we hold the lock. | |
| 4857 (void)pop_unclean_region_list_locked(); | |
| 4858 put_free_region_on_list_locked(r); | |
| 4859 return true; | |
| 4860 } else { | |
| 4861 return false; | |
| 4862 } | |
| 4863 } | |
| 4864 | |
| 4865 bool G1CollectedHeap::move_cleaned_region_to_free_list() { | |
| 4866 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 4867 return move_cleaned_region_to_free_list_locked(); | |
| 4868 } | |
| 4869 | |
| 4870 | |
| 4871 void G1CollectedHeap::put_free_region_on_list_locked(HeapRegion* r) { | |
| 4872 assert(ZF_mon->owned_by_self(), "precondition."); | |
| 4873 assert(_free_region_list_size == free_region_list_length(), "Inv"); | |
| 4874 assert(r->zero_fill_state() == HeapRegion::ZeroFilled, | |
| 4875 "Regions on free list must be zero filled"); | |
| 4876 assert(!r->isHumongous(), "Must not be humongous."); | |
| 4877 assert(r->is_empty(), "Better be empty"); | |
| 4878 assert(!r->is_on_free_list(), | |
| 4879 "Better not already be on free list"); | |
| 4880 assert(!r->is_on_unclean_list(), | |
| 4881 "Better not already be on unclean list"); | |
| 4882 r->set_on_free_list(true); | |
| 4883 r->set_next_on_free_list(_free_region_list); | |
| 4884 _free_region_list = r; | |
| 4885 _free_region_list_size++; | |
| 4886 assert(_free_region_list_size == free_region_list_length(), "Inv"); | |
| 4887 } | |
| 4888 | |
| 4889 void G1CollectedHeap::put_free_region_on_list(HeapRegion* r) { | |
| 4890 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 4891 put_free_region_on_list_locked(r); | |
| 4892 } | |
| 4893 | |
| 4894 HeapRegion* G1CollectedHeap::pop_free_region_list_locked() { | |
| 4895 assert(ZF_mon->owned_by_self(), "precondition."); | |
| 4896 assert(_free_region_list_size == free_region_list_length(), "Inv"); | |
| 4897 HeapRegion* res = _free_region_list; | |
| 4898 if (res != NULL) { | |
| 4899 _free_region_list = res->next_from_free_list(); | |
| 4900 _free_region_list_size--; | |
| 4901 res->set_on_free_list(false); | |
| 4902 res->set_next_on_free_list(NULL); | |
| 4903 assert(_free_region_list_size == free_region_list_length(), "Inv"); | |
| 4904 } | |
| 4905 return res; | |
| 4906 } | |
| 4907 | |
| 4908 | |
| 4909 HeapRegion* G1CollectedHeap::alloc_free_region_from_lists(bool zero_filled) { | |
| 4910 // By self, or on behalf of self. | |
| 4911 assert(Heap_lock->is_locked(), "Precondition"); | |
| 4912 HeapRegion* res = NULL; | |
| 4913 bool first = true; | |
| 4914 while (res == NULL) { | |
| 4915 if (zero_filled || !first) { | |
| 4916 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 4917 res = pop_free_region_list_locked(); | |
| 4918 if (res != NULL) { | |
| 4919 assert(!res->zero_fill_is_allocated(), | |
| 4920 "No allocated regions on free list."); | |
| 4921 res->set_zero_fill_allocated(); | |
| 4922 } else if (!first) { | |
| 4923 break; // We tried both, time to return NULL. | |
| 4924 } | |
| 4925 } | |
| 4926 | |
| 4927 if (res == NULL) { | |
| 4928 res = alloc_region_from_unclean_list(zero_filled); | |
| 4929 } | |
| 4930 assert(res == NULL || | |
| 4931 !zero_filled || | |
| 4932 res->zero_fill_is_allocated(), | |
| 4933 "We must have allocated the region we're returning"); | |
| 4934 first = false; | |
| 4935 } | |
| 4936 return res; | |
| 4937 } | |
| 4938 | |
| 4939 void G1CollectedHeap::remove_allocated_regions_from_lists() { | |
| 4940 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 4941 { | |
| 4942 HeapRegion* prev = NULL; | |
| 4943 HeapRegion* cur = _unclean_region_list.hd(); | |
| 4944 while (cur != NULL) { | |
| 4945 HeapRegion* next = cur->next_from_unclean_list(); | |
| 4946 if (cur->zero_fill_is_allocated()) { | |
| 4947 // Remove from the list. | |
| 4948 if (prev == NULL) { | |
| 4949 (void)_unclean_region_list.pop(); | |
| 4950 } else { | |
| 4951 _unclean_region_list.delete_after(prev); | |
| 4952 } | |
| 4953 cur->set_on_unclean_list(false); | |
| 4954 cur->set_next_on_unclean_list(NULL); | |
| 4955 } else { | |
| 4956 prev = cur; | |
| 4957 } | |
| 4958 cur = next; | |
| 4959 } | |
| 4960 assert(_unclean_region_list.sz() == unclean_region_list_length(), | |
| 4961 "Inv"); | |
| 4962 } | |
| 4963 | |
| 4964 { | |
| 4965 HeapRegion* prev = NULL; | |
| 4966 HeapRegion* cur = _free_region_list; | |
| 4967 while (cur != NULL) { | |
| 4968 HeapRegion* next = cur->next_from_free_list(); | |
| 4969 if (cur->zero_fill_is_allocated()) { | |
| 4970 // Remove from the list. | |
| 4971 if (prev == NULL) { | |
| 4972 _free_region_list = cur->next_from_free_list(); | |
| 4973 } else { | |
| 4974 prev->set_next_on_free_list(cur->next_from_free_list()); | |
| 4975 } | |
| 4976 cur->set_on_free_list(false); | |
| 4977 cur->set_next_on_free_list(NULL); | |
| 4978 _free_region_list_size--; | |
| 4979 } else { | |
| 4980 prev = cur; | |
| 4981 } | |
| 4982 cur = next; | |
| 4983 } | |
| 4984 assert(_free_region_list_size == free_region_list_length(), "Inv"); | |
| 4985 } | |
| 4986 } | |
| 4987 | |
| 4988 bool G1CollectedHeap::verify_region_lists() { | |
| 4989 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 4990 return verify_region_lists_locked(); | |
| 4991 } | |
| 4992 | |
| 4993 bool G1CollectedHeap::verify_region_lists_locked() { | |
| 4994 HeapRegion* unclean = _unclean_region_list.hd(); | |
| 4995 while (unclean != NULL) { | |
| 4996 guarantee(unclean->is_on_unclean_list(), "Well, it is!"); | |
| 4997 guarantee(!unclean->is_on_free_list(), "Well, it shouldn't be!"); | |
| 4998 guarantee(unclean->zero_fill_state() != HeapRegion::Allocated, | |
| 4999 "Everything else is possible."); | |
| 5000 unclean = unclean->next_from_unclean_list(); | |
| 5001 } | |
| 5002 guarantee(_unclean_region_list.sz() == unclean_region_list_length(), "Inv"); | |
| 5003 | |
| 5004 HeapRegion* free_r = _free_region_list; | |
| 5005 while (free_r != NULL) { | |
| 5006 assert(free_r->is_on_free_list(), "Well, it is!"); | |
| 5007 assert(!free_r->is_on_unclean_list(), "Well, it shouldn't be!"); | |
| 5008 switch (free_r->zero_fill_state()) { | |
| 5009 case HeapRegion::NotZeroFilled: | |
| 5010 case HeapRegion::ZeroFilling: | |
| 5011 guarantee(false, "Should not be on free list."); | |
| 5012 break; | |
| 5013 default: | |
| 5014 // Everything else is possible. | |
| 5015 break; | |
| 5016 } | |
| 5017 free_r = free_r->next_from_free_list(); | |
| 5018 } | |
| 5019 guarantee(_free_region_list_size == free_region_list_length(), "Inv"); | |
| 5020 // If we didn't do an assertion... | |
| 5021 return true; | |
| 5022 } | |
| 5023 | |
| 5024 size_t G1CollectedHeap::free_region_list_length() { | |
| 5025 assert(ZF_mon->owned_by_self(), "precondition."); | |
| 5026 size_t len = 0; | |
| 5027 HeapRegion* cur = _free_region_list; | |
| 5028 while (cur != NULL) { | |
| 5029 len++; | |
| 5030 cur = cur->next_from_free_list(); | |
| 5031 } | |
| 5032 return len; | |
| 5033 } | |
| 5034 | |
| 5035 size_t G1CollectedHeap::unclean_region_list_length() { | |
| 5036 assert(ZF_mon->owned_by_self(), "precondition."); | |
| 5037 return _unclean_region_list.length(); | |
| 5038 } | |
| 5039 | |
| 5040 size_t G1CollectedHeap::n_regions() { | |
| 5041 return _hrs->length(); | |
| 5042 } | |
| 5043 | |
| 5044 size_t G1CollectedHeap::max_regions() { | |
| 5045 return | |
| 5046 (size_t)align_size_up(g1_reserved_obj_bytes(), HeapRegion::GrainBytes) / | |
| 5047 HeapRegion::GrainBytes; | |
| 5048 } | |
| 5049 | |
| 5050 size_t G1CollectedHeap::free_regions() { | |
| 5051 /* Possibly-expensive assert. | |
| 5052 assert(_free_regions == count_free_regions(), | |
| 5053 "_free_regions is off."); | |
| 5054 */ | |
| 5055 return _free_regions; | |
| 5056 } | |
| 5057 | |
| 5058 bool G1CollectedHeap::should_zf() { | |
| 5059 return _free_region_list_size < (size_t) G1ConcZFMaxRegions; | |
| 5060 } | |
| 5061 | |
| 5062 class RegionCounter: public HeapRegionClosure { | |
| 5063 size_t _n; | |
| 5064 public: | |
| 5065 RegionCounter() : _n(0) {} | |
| 5066 bool doHeapRegion(HeapRegion* r) { | |
| 5067 if (r->is_empty() && !r->popular()) { | |
| 5068 assert(!r->isHumongous(), "H regions should not be empty."); | |
| 5069 _n++; | |
| 5070 } | |
| 5071 return false; | |
| 5072 } | |
| 5073 int res() { return (int) _n; } | |
| 5074 }; | |
| 5075 | |
| 5076 size_t G1CollectedHeap::count_free_regions() { | |
| 5077 RegionCounter rc; | |
| 5078 heap_region_iterate(&rc); | |
| 5079 size_t n = rc.res(); | |
| 5080 if (_cur_alloc_region != NULL && _cur_alloc_region->is_empty()) | |
| 5081 n--; | |
| 5082 return n; | |
| 5083 } | |
| 5084 | |
| 5085 size_t G1CollectedHeap::count_free_regions_list() { | |
| 5086 size_t n = 0; | |
| 5087 size_t o = 0; | |
| 5088 ZF_mon->lock_without_safepoint_check(); | |
| 5089 HeapRegion* cur = _free_region_list; | |
| 5090 while (cur != NULL) { | |
| 5091 cur = cur->next_from_free_list(); | |
| 5092 n++; | |
| 5093 } | |
| 5094 size_t m = unclean_region_list_length(); | |
| 5095 ZF_mon->unlock(); | |
| 5096 return n + m; | |
| 5097 } | |
| 5098 | |
| 5099 bool G1CollectedHeap::should_set_young_locked() { | |
| 5100 assert(heap_lock_held_for_gc(), | |
| 5101 "the heap lock should already be held by or for this thread"); | |
| 5102 return (g1_policy()->in_young_gc_mode() && | |
| 5103 g1_policy()->should_add_next_region_to_young_list()); | |
| 5104 } | |
| 5105 | |
| 5106 void G1CollectedHeap::set_region_short_lived_locked(HeapRegion* hr) { | |
| 5107 assert(heap_lock_held_for_gc(), | |
| 5108 "the heap lock should already be held by or for this thread"); | |
| 5109 _young_list->push_region(hr); | |
| 5110 g1_policy()->set_region_short_lived(hr); | |
| 5111 } | |
| 5112 | |
| 5113 class NoYoungRegionsClosure: public HeapRegionClosure { | |
| 5114 private: | |
| 5115 bool _success; | |
| 5116 public: | |
| 5117 NoYoungRegionsClosure() : _success(true) { } | |
| 5118 bool doHeapRegion(HeapRegion* r) { | |
| 5119 if (r->is_young()) { | |
| 5120 gclog_or_tty->print_cr("Region ["PTR_FORMAT", "PTR_FORMAT") tagged as young", | |
| 5121 r->bottom(), r->end()); | |
| 5122 _success = false; | |
| 5123 } | |
| 5124 return false; | |
| 5125 } | |
| 5126 bool success() { return _success; } | |
| 5127 }; | |
| 5128 | |
| 5129 bool G1CollectedHeap::check_young_list_empty(bool ignore_scan_only_list, | |
| 5130 bool check_sample) { | |
| 5131 bool ret = true; | |
| 5132 | |
| 5133 ret = _young_list->check_list_empty(ignore_scan_only_list, check_sample); | |
| 5134 if (!ignore_scan_only_list) { | |
| 5135 NoYoungRegionsClosure closure; | |
| 5136 heap_region_iterate(&closure); | |
| 5137 ret = ret && closure.success(); | |
| 5138 } | |
| 5139 | |
| 5140 return ret; | |
| 5141 } | |
| 5142 | |
| 5143 void G1CollectedHeap::empty_young_list() { | |
| 5144 assert(heap_lock_held_for_gc(), | |
| 5145 "the heap lock should already be held by or for this thread"); | |
| 5146 assert(g1_policy()->in_young_gc_mode(), "should be in young GC mode"); | |
| 5147 | |
| 5148 _young_list->empty_list(); | |
| 5149 } | |
| 5150 | |
| 5151 bool G1CollectedHeap::all_alloc_regions_no_allocs_since_save_marks() { | |
| 5152 bool no_allocs = true; | |
| 5153 for (int ap = 0; ap < GCAllocPurposeCount && no_allocs; ++ap) { | |
| 5154 HeapRegion* r = _gc_alloc_regions[ap]; | |
| 5155 no_allocs = r == NULL || r->saved_mark_at_top(); | |
| 5156 } | |
| 5157 return no_allocs; | |
| 5158 } | |
| 5159 | |
| 545 | 5160 void G1CollectedHeap::retire_all_alloc_regions() { |
| 342 | 5161 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { |
| 5162 HeapRegion* r = _gc_alloc_regions[ap]; | |
| 5163 if (r != NULL) { | |
| 5164 // Check for aliases. | |
| 5165 bool has_processed_alias = false; | |
| 5166 for (int i = 0; i < ap; ++i) { | |
| 5167 if (_gc_alloc_regions[i] == r) { | |
| 5168 has_processed_alias = true; | |
| 5169 break; | |
| 5170 } | |
| 5171 } | |
| 5172 if (!has_processed_alias) { | |
| 545 | 5173 retire_alloc_region(r, false /* par */); |
| 342 | 5174 } |
| 5175 } | |
| 5176 } | |
| 5177 } | |
| 5178 | |
| 5179 | |
| 5180 // Done at the start of full GC. | |
| 5181 void G1CollectedHeap::tear_down_region_lists() { | |
| 5182 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 5183 while (pop_unclean_region_list_locked() != NULL) ; | |
| 5184 assert(_unclean_region_list.hd() == NULL && _unclean_region_list.sz() == 0, | |
| 5185 "Postconditions of loop.") | |
| 5186 while (pop_free_region_list_locked() != NULL) ; | |
| 5187 assert(_free_region_list == NULL, "Postcondition of loop."); | |
| 5188 if (_free_region_list_size != 0) { | |
| 5189 gclog_or_tty->print_cr("Size is %d.", _free_region_list_size); | |
| 5190 print(); | |
| 5191 } | |
| 5192 assert(_free_region_list_size == 0, "Postconditions of loop."); | |
| 5193 } | |
| 5194 | |
| 5195 | |
| 5196 class RegionResetter: public HeapRegionClosure { | |
| 5197 G1CollectedHeap* _g1; | |
| 5198 int _n; | |
| 5199 public: | |
| 5200 RegionResetter() : _g1(G1CollectedHeap::heap()), _n(0) {} | |
| 5201 bool doHeapRegion(HeapRegion* r) { | |
| 5202 if (r->continuesHumongous()) return false; | |
| 5203 if (r->top() > r->bottom()) { | |
| 5204 if (r->top() < r->end()) { | |
| 5205 Copy::fill_to_words(r->top(), | |
| 5206 pointer_delta(r->end(), r->top())); | |
| 5207 } | |
| 5208 r->set_zero_fill_allocated(); | |
| 5209 } else { | |
| 5210 assert(r->is_empty(), "tautology"); | |
| 5211 if (r->popular()) { | |
| 5212 if (r->zero_fill_state() != HeapRegion::Allocated) { | |
| 5213 r->ensure_zero_filled_locked(); | |
| 5214 r->set_zero_fill_allocated(); | |
| 5215 } | |
| 5216 } else { | |
| 5217 _n++; | |
| 5218 switch (r->zero_fill_state()) { | |
| 5219 case HeapRegion::NotZeroFilled: | |
| 5220 case HeapRegion::ZeroFilling: | |
| 5221 _g1->put_region_on_unclean_list_locked(r); | |
| 5222 break; | |
| 5223 case HeapRegion::Allocated: | |
| 5224 r->set_zero_fill_complete(); | |
| 5225 // no break; go on to put on free list. | |
| 5226 case HeapRegion::ZeroFilled: | |
| 5227 _g1->put_free_region_on_list_locked(r); | |
| 5228 break; | |
| 5229 } | |
| 5230 } | |
| 5231 } | |
| 5232 return false; | |
| 5233 } | |
| 5234 | |
| 5235 int getFreeRegionCount() {return _n;} | |
| 5236 }; | |
| 5237 | |
| 5238 // Done at the end of full GC. | |
| 5239 void G1CollectedHeap::rebuild_region_lists() { | |
| 5240 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 5241 // This needs to go at the end of the full GC. | |
| 5242 RegionResetter rs; | |
| 5243 heap_region_iterate(&rs); | |
| 5244 _free_regions = rs.getFreeRegionCount(); | |
| 5245 // Tell the ZF thread it may have work to do. | |
| 5246 if (should_zf()) ZF_mon->notify_all(); | |
| 5247 } | |
| 5248 | |
| 5249 class UsedRegionsNeedZeroFillSetter: public HeapRegionClosure { | |
| 5250 G1CollectedHeap* _g1; | |
| 5251 int _n; | |
| 5252 public: | |
| 5253 UsedRegionsNeedZeroFillSetter() : _g1(G1CollectedHeap::heap()), _n(0) {} | |
| 5254 bool doHeapRegion(HeapRegion* r) { | |
| 5255 if (r->continuesHumongous()) return false; | |
| 5256 if (r->top() > r->bottom()) { | |
| 5257 // There are assertions in "set_zero_fill_needed()" below that | |
| 5258 // require top() == bottom(), so this is technically illegal. | |
| 5259 // We'll skirt the law here, by making that true temporarily. | |
| 5260 DEBUG_ONLY(HeapWord* save_top = r->top(); | |
| 5261 r->set_top(r->bottom())); | |
| 5262 r->set_zero_fill_needed(); | |
| 5263 DEBUG_ONLY(r->set_top(save_top)); | |
| 5264 } | |
| 5265 return false; | |
| 5266 } | |
| 5267 }; | |
| 5268 | |
| 5269 // Done at the start of full GC. | |
| 5270 void G1CollectedHeap::set_used_regions_to_need_zero_fill() { | |
| 5271 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag); | |
| 5272 // This needs to go at the end of the full GC. | |
| 5273 UsedRegionsNeedZeroFillSetter rs; | |
| 5274 heap_region_iterate(&rs); | |
| 5275 } | |
| 5276 | |
| 5277 class CountObjClosure: public ObjectClosure { | |
| 5278 size_t _n; | |
| 5279 public: | |
| 5280 CountObjClosure() : _n(0) {} | |
| 5281 void do_object(oop obj) { _n++; } | |
| 5282 size_t n() { return _n; } | |
| 5283 }; | |
| 5284 | |
| 5285 size_t G1CollectedHeap::pop_object_used_objs() { | |
| 5286 size_t sum_objs = 0; | |
| 5287 for (int i = 0; i < G1NumPopularRegions; i++) { | |
| 5288 CountObjClosure cl; | |
| 5289 _hrs->at(i)->object_iterate(&cl); | |
| 5290 sum_objs += cl.n(); | |
| 5291 } | |
| 5292 return sum_objs; | |
| 5293 } | |
| 5294 | |
| 5295 size_t G1CollectedHeap::pop_object_used_bytes() { | |
| 5296 size_t sum_bytes = 0; | |
| 5297 for (int i = 0; i < G1NumPopularRegions; i++) { | |
| 5298 sum_bytes += _hrs->at(i)->used(); | |
| 5299 } | |
| 5300 return sum_bytes; | |
| 5301 } | |
| 5302 | |
| 5303 | |
| 5304 static int nq = 0; | |
| 5305 | |
| 5306 HeapWord* G1CollectedHeap::allocate_popular_object(size_t word_size) { | |
| 5307 while (_cur_pop_hr_index < G1NumPopularRegions) { | |
| 5308 HeapRegion* cur_pop_region = _hrs->at(_cur_pop_hr_index); | |
| 5309 HeapWord* res = cur_pop_region->allocate(word_size); | |
| 5310 if (res != NULL) { | |
| 5311 // We account for popular objs directly in the used summary: | |
| 5312 _summary_bytes_used += (word_size * HeapWordSize); | |
| 5313 return res; | |
| 5314 } | |
| 5315 // Otherwise, try the next region (first making sure that we remember | |
| 5316 // the last "top" value as the "next_top_at_mark_start", so that | |
| 5317 // objects made popular during markings aren't automatically considered | |
| 5318 // live). | |
| 5319 cur_pop_region->note_end_of_copying(); | |
| 5320 // Otherwise, try the next region. | |
| 5321 _cur_pop_hr_index++; | |
| 5322 } | |
| 5323 // XXX: For now !!! | |
| 5324 vm_exit_out_of_memory(word_size, | |
| 5325 "Not enough pop obj space (To Be Fixed)"); | |
| 5326 return NULL; | |
| 5327 } | |
| 5328 | |
| 5329 class HeapRegionList: public CHeapObj { | |
| 5330 public: | |
| 5331 HeapRegion* hr; | |
| 5332 HeapRegionList* next; | |
| 5333 }; | |
| 5334 | |
| 5335 void G1CollectedHeap::schedule_popular_region_evac(HeapRegion* r) { | |
| 5336 // This might happen during parallel GC, so protect by this lock. | |
| 5337 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag); | |
| 5338 // We don't schedule regions whose evacuations are already pending, or | |
| 5339 // are already being evacuated. | |
| 5340 if (!r->popular_pending() && !r->in_collection_set()) { | |
| 5341 r->set_popular_pending(true); | |
| 5342 if (G1TracePopularity) { | |
| 5343 gclog_or_tty->print_cr("Scheduling region "PTR_FORMAT" " | |
| 5344 "["PTR_FORMAT", "PTR_FORMAT") for pop-object evacuation.", | |
| 5345 r, r->bottom(), r->end()); | |
| 5346 } | |
| 5347 HeapRegionList* hrl = new HeapRegionList; | |
| 5348 hrl->hr = r; | |
| 5349 hrl->next = _popular_regions_to_be_evacuated; | |
| 5350 _popular_regions_to_be_evacuated = hrl; | |
| 5351 } | |
| 5352 } | |
| 5353 | |
| 5354 HeapRegion* G1CollectedHeap::popular_region_to_evac() { | |
| 5355 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag); | |
| 5356 HeapRegion* res = NULL; | |
| 5357 while (_popular_regions_to_be_evacuated != NULL && res == NULL) { | |
| 5358 HeapRegionList* hrl = _popular_regions_to_be_evacuated; | |
| 5359 _popular_regions_to_be_evacuated = hrl->next; | |
| 5360 res = hrl->hr; | |
| 5361 // The G1RSPopLimit may have increased, so recheck here... | |
| 5362 if (res->rem_set()->occupied() < (size_t) G1RSPopLimit) { | |
| 5363 // Hah: don't need to schedule. | |
| 5364 if (G1TracePopularity) { | |
| 5365 gclog_or_tty->print_cr("Unscheduling region "PTR_FORMAT" " | |
| 5366 "["PTR_FORMAT", "PTR_FORMAT") " | |
| 5367 "for pop-object evacuation (size %d < limit %d)", | |
| 5368 res, res->bottom(), res->end(), | |
| 5369 res->rem_set()->occupied(), G1RSPopLimit); | |
| 5370 } | |
| 5371 res->set_popular_pending(false); | |
| 5372 res = NULL; | |
| 5373 } | |
| 5374 // We do not reset res->popular() here; if we did so, it would allow | |
| 5375 // the region to be "rescheduled" for popularity evacuation. Instead, | |
| 5376 // this is done in the collection pause, with the world stopped. | |
| 5377 // So the invariant is that the regions in the list have the popularity | |
| 5378 // boolean set, but having the boolean set does not imply membership | |
| 5379 // on the list (though there can at most one such pop-pending region | |
| 5380 // not on the list at any time). | |
| 5381 delete hrl; | |
| 5382 } | |
| 5383 return res; | |
| 5384 } | |
| 5385 | |
| 5386 void G1CollectedHeap::evac_popular_region(HeapRegion* hr) { | |
| 5387 while (true) { | |
| 5388 // Don't want to do a GC pause while cleanup is being completed! | |
| 5389 wait_for_cleanup_complete(); | |
| 5390 | |
| 5391 // Read the GC count while holding the Heap_lock | |
| 5392 int gc_count_before = SharedHeap::heap()->total_collections(); | |
| 5393 g1_policy()->record_stop_world_start(); | |
| 5394 | |
| 5395 { | |
| 5396 MutexUnlocker mu(Heap_lock); // give up heap lock, execute gets it back | |
| 5397 VM_G1PopRegionCollectionPause op(gc_count_before, hr); | |
| 5398 VMThread::execute(&op); | |
| 5399 | |
| 5400 // If the prolog succeeded, we didn't do a GC for this. | |
| 5401 if (op.prologue_succeeded()) break; | |
| 5402 } | |
| 5403 // Otherwise we didn't. We should recheck the size, though, since | |
| 5404 // the limit may have increased... | |
| 5405 if (hr->rem_set()->occupied() < (size_t) G1RSPopLimit) { | |
| 5406 hr->set_popular_pending(false); | |
| 5407 break; | |
| 5408 } | |
| 5409 } | |
| 5410 } | |
| 5411 | |
| 5412 void G1CollectedHeap::atomic_inc_obj_rc(oop obj) { | |
| 5413 Atomic::inc(obj_rc_addr(obj)); | |
| 5414 } | |
| 5415 | |
| 5416 class CountRCClosure: public OopsInHeapRegionClosure { | |
| 5417 G1CollectedHeap* _g1h; | |
| 5418 bool _parallel; | |
| 5419 public: | |
| 5420 CountRCClosure(G1CollectedHeap* g1h) : | |
| 5421 _g1h(g1h), _parallel(ParallelGCThreads > 0) | |
| 5422 {} | |
| 5423 void do_oop(narrowOop* p) { | |
| 5424 guarantee(false, "NYI"); | |
| 5425 } | |
| 5426 void do_oop(oop* p) { | |
| 5427 oop obj = *p; | |
| 5428 assert(obj != NULL, "Precondition."); | |
| 5429 if (_parallel) { | |
| 5430 // We go sticky at the limit to avoid excess contention. | |
| 5431 // If we want to track the actual RC's further, we'll need to keep a | |
| 5432 // per-thread hash table or something for the popular objects. | |
| 5433 if (_g1h->obj_rc(obj) < G1ObjPopLimit) { | |
| 5434 _g1h->atomic_inc_obj_rc(obj); | |
| 5435 } | |
| 5436 } else { | |
| 5437 _g1h->inc_obj_rc(obj); | |
| 5438 } | |
| 5439 } | |
| 5440 }; | |
| 5441 | |
| 5442 class EvacPopObjClosure: public ObjectClosure { | |
| 5443 G1CollectedHeap* _g1h; | |
| 5444 size_t _pop_objs; | |
| 5445 size_t _max_rc; | |
| 5446 public: | |
| 5447 EvacPopObjClosure(G1CollectedHeap* g1h) : | |
| 5448 _g1h(g1h), _pop_objs(0), _max_rc(0) {} | |
| 5449 | |
| 5450 void do_object(oop obj) { | |
| 5451 size_t rc = _g1h->obj_rc(obj); | |
| 5452 _max_rc = MAX2(rc, _max_rc); | |
| 5453 if (rc >= (size_t) G1ObjPopLimit) { | |
| 5454 _g1h->_pop_obj_rc_at_copy.add((double)rc); | |
| 5455 size_t word_sz = obj->size(); | |
| 5456 HeapWord* new_pop_loc = _g1h->allocate_popular_object(word_sz); | |
| 5457 oop new_pop_obj = (oop)new_pop_loc; | |
| 5458 Copy::aligned_disjoint_words((HeapWord*)obj, new_pop_loc, word_sz); | |
| 5459 obj->forward_to(new_pop_obj); | |
| 5460 G1ScanAndBalanceClosure scan_and_balance(_g1h); | |
| 5461 new_pop_obj->oop_iterate_backwards(&scan_and_balance); | |
| 5462 // preserve "next" mark bit if marking is in progress. | |
| 5463 if (_g1h->mark_in_progress() && !_g1h->is_obj_ill(obj)) { | |
| 5464 _g1h->concurrent_mark()->markAndGrayObjectIfNecessary(new_pop_obj); | |
| 5465 } | |
| 5466 | |
| 5467 if (G1TracePopularity) { | |
| 5468 gclog_or_tty->print_cr("Found obj " PTR_FORMAT " of word size " SIZE_FORMAT | |
| 5469 " pop (%d), move to " PTR_FORMAT, | |
| 5470 (void*) obj, word_sz, | |
| 5471 _g1h->obj_rc(obj), (void*) new_pop_obj); | |
| 5472 } | |
| 5473 _pop_objs++; | |
| 5474 } | |
| 5475 } | |
| 5476 size_t pop_objs() { return _pop_objs; } | |
| 5477 size_t max_rc() { return _max_rc; } | |
| 5478 }; | |
| 5479 | |
| 5480 class G1ParCountRCTask : public AbstractGangTask { | |
| 5481 G1CollectedHeap* _g1h; | |
| 5482 BitMap _bm; | |
| 5483 | |
| 5484 size_t getNCards() { | |
| 5485 return (_g1h->capacity() + G1BlockOffsetSharedArray::N_bytes - 1) | |
| 5486 / G1BlockOffsetSharedArray::N_bytes; | |
| 5487 } | |
| 5488 CountRCClosure _count_rc_closure; | |
| 5489 public: | |
| 5490 G1ParCountRCTask(G1CollectedHeap* g1h) : | |
| 5491 AbstractGangTask("G1 Par RC Count task"), | |
| 5492 _g1h(g1h), _bm(getNCards()), _count_rc_closure(g1h) | |
| 5493 {} | |
| 5494 | |
| 5495 void work(int i) { | |
| 5496 ResourceMark rm; | |
| 5497 HandleMark hm; | |
| 5498 _g1h->g1_rem_set()->oops_into_collection_set_do(&_count_rc_closure, i); | |
| 5499 } | |
| 5500 }; | |
| 5501 | |
| 5502 void G1CollectedHeap::popularity_pause_preamble(HeapRegion* popular_region) { | |
| 5503 // We're evacuating a single region (for popularity). | |
| 5504 if (G1TracePopularity) { | |
| 5505 gclog_or_tty->print_cr("Doing pop region pause for ["PTR_FORMAT", "PTR_FORMAT")", | |
| 5506 popular_region->bottom(), popular_region->end()); | |
| 5507 } | |
| 5508 g1_policy()->set_single_region_collection_set(popular_region); | |
| 5509 size_t max_rc; | |
| 5510 if (!compute_reference_counts_and_evac_popular(popular_region, | |
| 5511 &max_rc)) { | |
| 5512 // We didn't evacuate any popular objects. | |
| 5513 // We increase the RS popularity limit, to prevent this from | |
| 5514 // happening in the future. | |
| 5515 if (G1RSPopLimit < (1 << 30)) { | |
| 5516 G1RSPopLimit *= 2; | |
| 5517 } | |
| 5518 // For now, interesting enough for a message: | |
| 5519 #if 1 | |
| 5520 gclog_or_tty->print_cr("In pop region pause for ["PTR_FORMAT", "PTR_FORMAT"), " | |
| 5521 "failed to find a pop object (max = %d).", | |
| 5522 popular_region->bottom(), popular_region->end(), | |
| 5523 max_rc); | |
| 5524 gclog_or_tty->print_cr("Increased G1RSPopLimit to %d.", G1RSPopLimit); | |
| 5525 #endif // 0 | |
| 5526 // Also, we reset the collection set to NULL, to make the rest of | |
| 5527 // the collection do nothing. | |
| 5528 assert(popular_region->next_in_collection_set() == NULL, | |
| 5529 "should be single-region."); | |
| 5530 popular_region->set_in_collection_set(false); | |
| 5531 popular_region->set_popular_pending(false); | |
| 5532 g1_policy()->clear_collection_set(); | |
| 5533 } | |
| 5534 } | |
| 5535 | |
| 5536 bool G1CollectedHeap:: | |
| 5537 compute_reference_counts_and_evac_popular(HeapRegion* popular_region, | |
| 5538 size_t* max_rc) { | |
| 5539 HeapWord* rc_region_bot; | |
| 5540 HeapWord* rc_region_end; | |
| 5541 | |
| 5542 // Set up the reference count region. | |
| 5543 HeapRegion* rc_region = newAllocRegion(HeapRegion::GrainWords); | |
| 5544 if (rc_region != NULL) { | |
| 5545 rc_region_bot = rc_region->bottom(); | |
| 5546 rc_region_end = rc_region->end(); | |
| 5547 } else { | |
| 5548 rc_region_bot = NEW_C_HEAP_ARRAY(HeapWord, HeapRegion::GrainWords); | |
| 5549 if (rc_region_bot == NULL) { | |
| 5550 vm_exit_out_of_memory(HeapRegion::GrainWords, | |
| 5551 "No space for RC region."); | |
| 5552 } | |
| 5553 rc_region_end = rc_region_bot + HeapRegion::GrainWords; | |
| 5554 } | |
| 5555 | |
| 5556 if (G1TracePopularity) | |
| 5557 gclog_or_tty->print_cr("RC region is ["PTR_FORMAT", "PTR_FORMAT")", | |
| 5558 rc_region_bot, rc_region_end); | |
| 5559 if (rc_region_bot > popular_region->bottom()) { | |
| 5560 _rc_region_above = true; | |
| 5561 _rc_region_diff = | |
| 5562 pointer_delta(rc_region_bot, popular_region->bottom(), 1); | |
| 5563 } else { | |
| 5564 assert(rc_region_bot < popular_region->bottom(), "Can't be equal."); | |
| 5565 _rc_region_above = false; | |
| 5566 _rc_region_diff = | |
| 5567 pointer_delta(popular_region->bottom(), rc_region_bot, 1); | |
| 5568 } | |
| 5569 g1_policy()->record_pop_compute_rc_start(); | |
| 5570 // Count external references. | |
| 5571 g1_rem_set()->prepare_for_oops_into_collection_set_do(); | |
| 5572 if (ParallelGCThreads > 0) { | |
| 5573 | |
| 5574 set_par_threads(workers()->total_workers()); | |
| 5575 G1ParCountRCTask par_count_rc_task(this); | |
| 5576 workers()->run_task(&par_count_rc_task); | |
| 5577 set_par_threads(0); | |
| 5578 | |
| 5579 } else { | |
| 5580 CountRCClosure count_rc_closure(this); | |
| 5581 g1_rem_set()->oops_into_collection_set_do(&count_rc_closure, 0); | |
| 5582 } | |
| 5583 g1_rem_set()->cleanup_after_oops_into_collection_set_do(); | |
| 5584 g1_policy()->record_pop_compute_rc_end(); | |
| 5585 | |
| 5586 // Now evacuate popular objects. | |
| 5587 g1_policy()->record_pop_evac_start(); | |
| 5588 EvacPopObjClosure evac_pop_obj_cl(this); | |
| 5589 popular_region->object_iterate(&evac_pop_obj_cl); | |
| 5590 *max_rc = evac_pop_obj_cl.max_rc(); | |
| 5591 | |
| 5592 // Make sure the last "top" value of the current popular region is copied | |
| 5593 // as the "next_top_at_mark_start", so that objects made popular during | |
| 5594 // markings aren't automatically considered live. | |
| 5595 HeapRegion* cur_pop_region = _hrs->at(_cur_pop_hr_index); | |
| 5596 cur_pop_region->note_end_of_copying(); | |
| 5597 | |
| 5598 if (rc_region != NULL) { | |
| 5599 free_region(rc_region); | |
| 5600 } else { | |
| 5601 FREE_C_HEAP_ARRAY(HeapWord, rc_region_bot); | |
| 5602 } | |
| 5603 g1_policy()->record_pop_evac_end(); | |
| 5604 | |
| 5605 return evac_pop_obj_cl.pop_objs() > 0; | |
| 5606 } | |
| 5607 | |
| 5608 class CountPopObjInfoClosure: public HeapRegionClosure { | |
| 5609 size_t _objs; | |
| 5610 size_t _bytes; | |
| 5611 | |
| 5612 class CountObjClosure: public ObjectClosure { | |
| 5613 int _n; | |
| 5614 public: | |
| 5615 CountObjClosure() : _n(0) {} | |
| 5616 void do_object(oop obj) { _n++; } | |
| 5617 size_t n() { return _n; } | |
| 5618 }; | |
| 5619 | |
| 5620 public: | |
| 5621 CountPopObjInfoClosure() : _objs(0), _bytes(0) {} | |
| 5622 bool doHeapRegion(HeapRegion* r) { | |
| 5623 _bytes += r->used(); | |
| 5624 CountObjClosure blk; | |
| 5625 r->object_iterate(&blk); | |
| 5626 _objs += blk.n(); | |
| 5627 return false; | |
| 5628 } | |
| 5629 size_t objs() { return _objs; } | |
| 5630 size_t bytes() { return _bytes; } | |
| 5631 }; | |
| 5632 | |
| 5633 | |
| 5634 void G1CollectedHeap::print_popularity_summary_info() const { | |
| 5635 CountPopObjInfoClosure blk; | |
| 5636 for (int i = 0; i <= _cur_pop_hr_index; i++) { | |
| 5637 blk.doHeapRegion(_hrs->at(i)); | |
| 5638 } | |
| 5639 gclog_or_tty->print_cr("\nPopular objects: %d objs, %d bytes.", | |
| 5640 blk.objs(), blk.bytes()); | |
| 5641 gclog_or_tty->print_cr(" RC at copy = [avg = %5.2f, max = %5.2f, sd = %5.2f].", | |
| 5642 _pop_obj_rc_at_copy.avg(), | |
| 5643 _pop_obj_rc_at_copy.maximum(), | |
| 5644 _pop_obj_rc_at_copy.sd()); | |
| 5645 } | |
| 5646 | |
| 5647 void G1CollectedHeap::set_refine_cte_cl_concurrency(bool concurrent) { | |
| 5648 _refine_cte_cl->set_concurrent(concurrent); | |
| 5649 } | |
| 5650 | |
| 5651 #ifndef PRODUCT | |
| 5652 | |
| 5653 class PrintHeapRegionClosure: public HeapRegionClosure { | |
| 5654 public: | |
| 5655 bool doHeapRegion(HeapRegion *r) { | |
| 5656 gclog_or_tty->print("Region: "PTR_FORMAT":", r); | |
| 5657 if (r != NULL) { | |
| 5658 if (r->is_on_free_list()) | |
| 5659 gclog_or_tty->print("Free "); | |
| 5660 if (r->is_young()) | |
| 5661 gclog_or_tty->print("Young "); | |
| 5662 if (r->isHumongous()) | |
| 5663 gclog_or_tty->print("Is Humongous "); | |
| 5664 r->print(); | |
| 5665 } | |
| 5666 return false; | |
| 5667 } | |
| 5668 }; | |
| 5669 | |
| 5670 class SortHeapRegionClosure : public HeapRegionClosure { | |
| 5671 size_t young_regions,free_regions, unclean_regions; | |
| 5672 size_t hum_regions, count; | |
| 5673 size_t unaccounted, cur_unclean, cur_alloc; | |
| 5674 size_t total_free; | |
| 5675 HeapRegion* cur; | |
| 5676 public: | |
| 5677 SortHeapRegionClosure(HeapRegion *_cur) : cur(_cur), young_regions(0), | |
| 5678 free_regions(0), unclean_regions(0), | |
| 5679 hum_regions(0), | |
| 5680 count(0), unaccounted(0), | |
| 5681 cur_alloc(0), total_free(0) | |
| 5682 {} | |
| 5683 bool doHeapRegion(HeapRegion *r) { | |
| 5684 count++; | |
| 5685 if (r->is_on_free_list()) free_regions++; | |
| 5686 else if (r->is_on_unclean_list()) unclean_regions++; | |
| 5687 else if (r->isHumongous()) hum_regions++; | |
| 5688 else if (r->is_young()) young_regions++; | |
| 5689 else if (r == cur) cur_alloc++; | |
| 5690 else unaccounted++; | |
| 5691 return false; | |
| 5692 } | |
| 5693 void print() { | |
| 5694 total_free = free_regions + unclean_regions; | |
| 5695 gclog_or_tty->print("%d regions\n", count); | |
| 5696 gclog_or_tty->print("%d free: free_list = %d unclean = %d\n", | |
| 5697 total_free, free_regions, unclean_regions); | |
| 5698 gclog_or_tty->print("%d humongous %d young\n", | |
| 5699 hum_regions, young_regions); | |
| 5700 gclog_or_tty->print("%d cur_alloc\n", cur_alloc); | |
| 5701 gclog_or_tty->print("UHOH unaccounted = %d\n", unaccounted); | |
| 5702 } | |
| 5703 }; | |
| 5704 | |
| 5705 void G1CollectedHeap::print_region_counts() { | |
| 5706 SortHeapRegionClosure sc(_cur_alloc_region); | |
| 5707 PrintHeapRegionClosure cl; | |
| 5708 heap_region_iterate(&cl); | |
| 5709 heap_region_iterate(&sc); | |
| 5710 sc.print(); | |
| 5711 print_region_accounting_info(); | |
| 5712 }; | |
| 5713 | |
| 5714 bool G1CollectedHeap::regions_accounted_for() { | |
| 5715 // TODO: regions accounting for young/survivor/tenured | |
| 5716 return true; | |
| 5717 } | |
| 5718 | |
| 5719 bool G1CollectedHeap::print_region_accounting_info() { | |
| 5720 gclog_or_tty->print_cr("P regions: %d.", G1NumPopularRegions); | |
| 5721 gclog_or_tty->print_cr("Free regions: %d (count: %d count list %d) (clean: %d unclean: %d).", | |
| 5722 free_regions(), | |
| 5723 count_free_regions(), count_free_regions_list(), | |
| 5724 _free_region_list_size, _unclean_region_list.sz()); | |
| 5725 gclog_or_tty->print_cr("cur_alloc: %d.", | |
| 5726 (_cur_alloc_region == NULL ? 0 : 1)); | |
| 5727 gclog_or_tty->print_cr("H regions: %d.", _num_humongous_regions); | |
| 5728 | |
| 5729 // TODO: check regions accounting for young/survivor/tenured | |
| 5730 return true; | |
| 5731 } | |
| 5732 | |
| 5733 bool G1CollectedHeap::is_in_closed_subset(const void* p) const { | |
| 5734 HeapRegion* hr = heap_region_containing(p); | |
| 5735 if (hr == NULL) { | |
| 5736 return is_in_permanent(p); | |
| 5737 } else { | |
| 5738 return hr->is_in(p); | |
| 5739 } | |
| 5740 } | |
| 5741 #endif // PRODUCT | |
| 5742 | |
| 5743 void G1CollectedHeap::g1_unimplemented() { | |
| 5744 // Unimplemented(); | |
| 5745 } | |
| 5746 | |
| 5747 | |
| 5748 // Local Variables: *** | |
| 5749 // c-indentation-style: gnu *** | |
| 5750 // End: *** |