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