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