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