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