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