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