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