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