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