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