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