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