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