Mercurial > hg > truffle
annotate src/share/vm/memory/defNewGeneration.cpp @ 3229:4a6bda6cfe28
Fix for usages that are phi in rematerialization
author | Gilles Duboscq <gilles.duboscq@oracle.com> |
---|---|
date | Thu, 21 Jul 2011 11:32:22 +0200 |
parents | 74ee0db180fa |
children | 48048b59a551 |
rev | line source |
---|---|
0 | 1 /* |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1387
diff
changeset
|
2 * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1387
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1387
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1387
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "gc_implementation/shared/collectorCounters.hpp" | |
27 #include "gc_implementation/shared/gcPolicyCounters.hpp" | |
28 #include "gc_implementation/shared/spaceDecorator.hpp" | |
29 #include "memory/defNewGeneration.inline.hpp" | |
30 #include "memory/gcLocker.inline.hpp" | |
31 #include "memory/genCollectedHeap.hpp" | |
32 #include "memory/genOopClosures.inline.hpp" | |
33 #include "memory/generationSpec.hpp" | |
34 #include "memory/iterator.hpp" | |
35 #include "memory/referencePolicy.hpp" | |
36 #include "memory/space.inline.hpp" | |
37 #include "oops/instanceRefKlass.hpp" | |
38 #include "oops/oop.inline.hpp" | |
39 #include "runtime/java.hpp" | |
40 #include "utilities/copy.hpp" | |
41 #include "utilities/stack.inline.hpp" | |
42 #ifdef TARGET_OS_FAMILY_linux | |
43 # include "thread_linux.inline.hpp" | |
44 #endif | |
45 #ifdef TARGET_OS_FAMILY_solaris | |
46 # include "thread_solaris.inline.hpp" | |
47 #endif | |
48 #ifdef TARGET_OS_FAMILY_windows | |
49 # include "thread_windows.inline.hpp" | |
50 #endif | |
0 | 51 |
52 // | |
53 // DefNewGeneration functions. | |
54 | |
55 // Methods of protected closure types. | |
56 | |
57 DefNewGeneration::IsAliveClosure::IsAliveClosure(Generation* g) : _g(g) { | |
58 assert(g->level() == 0, "Optimized for youngest gen."); | |
59 } | |
60 void DefNewGeneration::IsAliveClosure::do_object(oop p) { | |
61 assert(false, "Do not call."); | |
62 } | |
63 bool DefNewGeneration::IsAliveClosure::do_object_b(oop p) { | |
64 return (HeapWord*)p >= _g->reserved().end() || p->is_forwarded(); | |
65 } | |
66 | |
67 DefNewGeneration::KeepAliveClosure:: | |
68 KeepAliveClosure(ScanWeakRefClosure* cl) : _cl(cl) { | |
69 GenRemSet* rs = GenCollectedHeap::heap()->rem_set(); | |
70 assert(rs->rs_kind() == GenRemSet::CardTable, "Wrong rem set kind."); | |
71 _rs = (CardTableRS*)rs; | |
72 } | |
73 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
74 void DefNewGeneration::KeepAliveClosure::do_oop(oop* p) { DefNewGeneration::KeepAliveClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
75 void DefNewGeneration::KeepAliveClosure::do_oop(narrowOop* p) { DefNewGeneration::KeepAliveClosure::do_oop_work(p); } |
0 | 76 |
77 | |
78 DefNewGeneration::FastKeepAliveClosure:: | |
79 FastKeepAliveClosure(DefNewGeneration* g, ScanWeakRefClosure* cl) : | |
80 DefNewGeneration::KeepAliveClosure(cl) { | |
81 _boundary = g->reserved().end(); | |
82 } | |
83 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
84 void DefNewGeneration::FastKeepAliveClosure::do_oop(oop* p) { DefNewGeneration::FastKeepAliveClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
85 void DefNewGeneration::FastKeepAliveClosure::do_oop(narrowOop* p) { DefNewGeneration::FastKeepAliveClosure::do_oop_work(p); } |
0 | 86 |
87 DefNewGeneration::EvacuateFollowersClosure:: | |
88 EvacuateFollowersClosure(GenCollectedHeap* gch, int level, | |
89 ScanClosure* cur, ScanClosure* older) : | |
90 _gch(gch), _level(level), | |
91 _scan_cur_or_nonheap(cur), _scan_older(older) | |
92 {} | |
93 | |
94 void DefNewGeneration::EvacuateFollowersClosure::do_void() { | |
95 do { | |
96 _gch->oop_since_save_marks_iterate(_level, _scan_cur_or_nonheap, | |
97 _scan_older); | |
98 } while (!_gch->no_allocs_since_save_marks(_level)); | |
99 } | |
100 | |
101 DefNewGeneration::FastEvacuateFollowersClosure:: | |
102 FastEvacuateFollowersClosure(GenCollectedHeap* gch, int level, | |
103 DefNewGeneration* gen, | |
104 FastScanClosure* cur, FastScanClosure* older) : | |
105 _gch(gch), _level(level), _gen(gen), | |
106 _scan_cur_or_nonheap(cur), _scan_older(older) | |
107 {} | |
108 | |
109 void DefNewGeneration::FastEvacuateFollowersClosure::do_void() { | |
110 do { | |
111 _gch->oop_since_save_marks_iterate(_level, _scan_cur_or_nonheap, | |
112 _scan_older); | |
113 } while (!_gch->no_allocs_since_save_marks(_level)); | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
114 guarantee(_gen->promo_failure_scan_is_complete(), "Failed to finish scan"); |
0 | 115 } |
116 | |
117 ScanClosure::ScanClosure(DefNewGeneration* g, bool gc_barrier) : | |
118 OopsInGenClosure(g), _g(g), _gc_barrier(gc_barrier) | |
119 { | |
120 assert(_g->level() == 0, "Optimized for youngest generation"); | |
121 _boundary = _g->reserved().end(); | |
122 } | |
123 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
124 void ScanClosure::do_oop(oop* p) { ScanClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
125 void ScanClosure::do_oop(narrowOop* p) { ScanClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
126 |
0 | 127 FastScanClosure::FastScanClosure(DefNewGeneration* g, bool gc_barrier) : |
128 OopsInGenClosure(g), _g(g), _gc_barrier(gc_barrier) | |
129 { | |
130 assert(_g->level() == 0, "Optimized for youngest generation"); | |
131 _boundary = _g->reserved().end(); | |
132 } | |
133 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
134 void FastScanClosure::do_oop(oop* p) { FastScanClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
135 void FastScanClosure::do_oop(narrowOop* p) { FastScanClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
136 |
0 | 137 ScanWeakRefClosure::ScanWeakRefClosure(DefNewGeneration* g) : |
138 OopClosure(g->ref_processor()), _g(g) | |
139 { | |
140 assert(_g->level() == 0, "Optimized for youngest generation"); | |
141 _boundary = _g->reserved().end(); | |
142 } | |
143 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
144 void ScanWeakRefClosure::do_oop(oop* p) { ScanWeakRefClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
145 void ScanWeakRefClosure::do_oop(narrowOop* p) { ScanWeakRefClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
146 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
147 void FilteringClosure::do_oop(oop* p) { FilteringClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
148 void FilteringClosure::do_oop(narrowOop* p) { FilteringClosure::do_oop_work(p); } |
0 | 149 |
150 DefNewGeneration::DefNewGeneration(ReservedSpace rs, | |
151 size_t initial_size, | |
152 int level, | |
153 const char* policy) | |
154 : Generation(rs, initial_size, level), | |
155 _promo_failure_drain_in_progress(false), | |
156 _should_allocate_from_space(false) | |
157 { | |
158 MemRegion cmr((HeapWord*)_virtual_space.low(), | |
159 (HeapWord*)_virtual_space.high()); | |
160 Universe::heap()->barrier_set()->resize_covered_region(cmr); | |
161 | |
162 if (GenCollectedHeap::heap()->collector_policy()->has_soft_ended_eden()) { | |
163 _eden_space = new ConcEdenSpace(this); | |
164 } else { | |
165 _eden_space = new EdenSpace(this); | |
166 } | |
167 _from_space = new ContiguousSpace(); | |
168 _to_space = new ContiguousSpace(); | |
169 | |
170 if (_eden_space == NULL || _from_space == NULL || _to_space == NULL) | |
171 vm_exit_during_initialization("Could not allocate a new gen space"); | |
172 | |
173 // Compute the maximum eden and survivor space sizes. These sizes | |
174 // are computed assuming the entire reserved space is committed. | |
175 // These values are exported as performance counters. | |
176 uintx alignment = GenCollectedHeap::heap()->collector_policy()->min_alignment(); | |
177 uintx size = _virtual_space.reserved_size(); | |
178 _max_survivor_size = compute_survivor_size(size, alignment); | |
179 _max_eden_size = size - (2*_max_survivor_size); | |
180 | |
181 // allocate the performance counters | |
182 | |
183 // Generation counters -- generation 0, 3 subspaces | |
184 _gen_counters = new GenerationCounters("new", 0, 3, &_virtual_space); | |
185 _gc_counters = new CollectorCounters(policy, 0); | |
186 | |
187 _eden_counters = new CSpaceCounters("eden", 0, _max_eden_size, _eden_space, | |
188 _gen_counters); | |
189 _from_counters = new CSpaceCounters("s0", 1, _max_survivor_size, _from_space, | |
190 _gen_counters); | |
191 _to_counters = new CSpaceCounters("s1", 2, _max_survivor_size, _to_space, | |
192 _gen_counters); | |
193 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
194 compute_space_boundaries(0, SpaceDecorator::Clear, SpaceDecorator::Mangle); |
0 | 195 update_counters(); |
196 _next_gen = NULL; | |
197 _tenuring_threshold = MaxTenuringThreshold; | |
198 _pretenure_size_threshold_words = PretenureSizeThreshold >> LogHeapWordSize; | |
199 } | |
200 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
201 void DefNewGeneration::compute_space_boundaries(uintx minimum_eden_size, |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
202 bool clear_space, |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
203 bool mangle_space) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
204 uintx alignment = |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
205 GenCollectedHeap::heap()->collector_policy()->min_alignment(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
206 |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
207 // If the spaces are being cleared (only done at heap initialization |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
208 // currently), the survivor spaces need not be empty. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
209 // Otherwise, no care is taken for used areas in the survivor spaces |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
210 // so check. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
211 assert(clear_space || (to()->is_empty() && from()->is_empty()), |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
212 "Initialization of the survivor spaces assumes these are empty"); |
0 | 213 |
214 // Compute sizes | |
215 uintx size = _virtual_space.committed_size(); | |
216 uintx survivor_size = compute_survivor_size(size, alignment); | |
217 uintx eden_size = size - (2*survivor_size); | |
218 assert(eden_size > 0 && survivor_size <= eden_size, "just checking"); | |
219 | |
220 if (eden_size < minimum_eden_size) { | |
221 // May happen due to 64Kb rounding, if so adjust eden size back up | |
222 minimum_eden_size = align_size_up(minimum_eden_size, alignment); | |
223 uintx maximum_survivor_size = (size - minimum_eden_size) / 2; | |
224 uintx unaligned_survivor_size = | |
225 align_size_down(maximum_survivor_size, alignment); | |
226 survivor_size = MAX2(unaligned_survivor_size, alignment); | |
227 eden_size = size - (2*survivor_size); | |
228 assert(eden_size > 0 && survivor_size <= eden_size, "just checking"); | |
229 assert(eden_size >= minimum_eden_size, "just checking"); | |
230 } | |
231 | |
232 char *eden_start = _virtual_space.low(); | |
233 char *from_start = eden_start + eden_size; | |
234 char *to_start = from_start + survivor_size; | |
235 char *to_end = to_start + survivor_size; | |
236 | |
237 assert(to_end == _virtual_space.high(), "just checking"); | |
238 assert(Space::is_aligned((HeapWord*)eden_start), "checking alignment"); | |
239 assert(Space::is_aligned((HeapWord*)from_start), "checking alignment"); | |
240 assert(Space::is_aligned((HeapWord*)to_start), "checking alignment"); | |
241 | |
242 MemRegion edenMR((HeapWord*)eden_start, (HeapWord*)from_start); | |
243 MemRegion fromMR((HeapWord*)from_start, (HeapWord*)to_start); | |
244 MemRegion toMR ((HeapWord*)to_start, (HeapWord*)to_end); | |
245 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
246 // A minimum eden size implies that there is a part of eden that |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
247 // is being used and that affects the initialization of any |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
248 // newly formed eden. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
249 bool live_in_eden = minimum_eden_size > 0; |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
250 |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
251 // If not clearing the spaces, do some checking to verify that |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
252 // the space are already mangled. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
253 if (!clear_space) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
254 // Must check mangling before the spaces are reshaped. Otherwise, |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
255 // the bottom or end of one space may have moved into another |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
256 // a failure of the check may not correctly indicate which space |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
257 // is not properly mangled. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
258 if (ZapUnusedHeapArea) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
259 HeapWord* limit = (HeapWord*) _virtual_space.high(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
260 eden()->check_mangled_unused_area(limit); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
261 from()->check_mangled_unused_area(limit); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
262 to()->check_mangled_unused_area(limit); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
263 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
264 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
265 |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
266 // Reset the spaces for their new regions. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
267 eden()->initialize(edenMR, |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
268 clear_space && !live_in_eden, |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
269 SpaceDecorator::Mangle); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
270 // If clear_space and live_in_eden, we will not have cleared any |
0 | 271 // portion of eden above its top. This can cause newly |
272 // expanded space not to be mangled if using ZapUnusedHeapArea. | |
273 // We explicitly do such mangling here. | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
274 if (ZapUnusedHeapArea && clear_space && live_in_eden && mangle_space) { |
0 | 275 eden()->mangle_unused_area(); |
276 } | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
277 from()->initialize(fromMR, clear_space, mangle_space); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
278 to()->initialize(toMR, clear_space, mangle_space); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
279 |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
280 // Set next compaction spaces. |
0 | 281 eden()->set_next_compaction_space(from()); |
282 // The to-space is normally empty before a compaction so need | |
283 // not be considered. The exception is during promotion | |
284 // failure handling when to-space can contain live objects. | |
285 from()->set_next_compaction_space(NULL); | |
286 } | |
287 | |
288 void DefNewGeneration::swap_spaces() { | |
289 ContiguousSpace* s = from(); | |
290 _from_space = to(); | |
291 _to_space = s; | |
292 eden()->set_next_compaction_space(from()); | |
293 // The to-space is normally empty before a compaction so need | |
294 // not be considered. The exception is during promotion | |
295 // failure handling when to-space can contain live objects. | |
296 from()->set_next_compaction_space(NULL); | |
297 | |
298 if (UsePerfData) { | |
299 CSpaceCounters* c = _from_counters; | |
300 _from_counters = _to_counters; | |
301 _to_counters = c; | |
302 } | |
303 } | |
304 | |
305 bool DefNewGeneration::expand(size_t bytes) { | |
306 MutexLocker x(ExpandHeap_lock); | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
307 HeapWord* prev_high = (HeapWord*) _virtual_space.high(); |
0 | 308 bool success = _virtual_space.expand_by(bytes); |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
309 if (success && ZapUnusedHeapArea) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
310 // Mangle newly committed space immediately because it |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
311 // can be done here more simply that after the new |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
312 // spaces have been computed. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
313 HeapWord* new_high = (HeapWord*) _virtual_space.high(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
314 MemRegion mangle_region(prev_high, new_high); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
315 SpaceMangler::mangle_region(mangle_region); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
316 } |
0 | 317 |
318 // Do not attempt an expand-to-the reserve size. The | |
319 // request should properly observe the maximum size of | |
320 // the generation so an expand-to-reserve should be | |
321 // unnecessary. Also a second call to expand-to-reserve | |
322 // value potentially can cause an undue expansion. | |
323 // For example if the first expand fail for unknown reasons, | |
324 // but the second succeeds and expands the heap to its maximum | |
325 // value. | |
326 if (GC_locker::is_active()) { | |
327 if (PrintGC && Verbose) { | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
328 gclog_or_tty->print_cr("Garbage collection disabled, " |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
329 "expanded heap instead"); |
0 | 330 } |
331 } | |
332 | |
333 return success; | |
334 } | |
335 | |
336 | |
337 void DefNewGeneration::compute_new_size() { | |
338 // This is called after a gc that includes the following generation | |
339 // (which is required to exist.) So from-space will normally be empty. | |
340 // Note that we check both spaces, since if scavenge failed they revert roles. | |
341 // If not we bail out (otherwise we would have to relocate the objects) | |
342 if (!from()->is_empty() || !to()->is_empty()) { | |
343 return; | |
344 } | |
345 | |
346 int next_level = level() + 1; | |
347 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
348 assert(next_level < gch->_n_gens, | |
349 "DefNewGeneration cannot be an oldest gen"); | |
350 | |
351 Generation* next_gen = gch->_gens[next_level]; | |
352 size_t old_size = next_gen->capacity(); | |
353 size_t new_size_before = _virtual_space.committed_size(); | |
354 size_t min_new_size = spec()->init_size(); | |
355 size_t max_new_size = reserved().byte_size(); | |
356 assert(min_new_size <= new_size_before && | |
357 new_size_before <= max_new_size, | |
358 "just checking"); | |
359 // All space sizes must be multiples of Generation::GenGrain. | |
360 size_t alignment = Generation::GenGrain; | |
361 | |
362 // Compute desired new generation size based on NewRatio and | |
363 // NewSizeThreadIncrease | |
364 size_t desired_new_size = old_size/NewRatio; | |
365 int threads_count = Threads::number_of_non_daemon_threads(); | |
366 size_t thread_increase_size = threads_count * NewSizeThreadIncrease; | |
367 desired_new_size = align_size_up(desired_new_size + thread_increase_size, alignment); | |
368 | |
369 // Adjust new generation size | |
370 desired_new_size = MAX2(MIN2(desired_new_size, max_new_size), min_new_size); | |
371 assert(desired_new_size <= max_new_size, "just checking"); | |
372 | |
373 bool changed = false; | |
374 if (desired_new_size > new_size_before) { | |
375 size_t change = desired_new_size - new_size_before; | |
376 assert(change % alignment == 0, "just checking"); | |
377 if (expand(change)) { | |
378 changed = true; | |
379 } | |
380 // If the heap failed to expand to the desired size, | |
381 // "changed" will be false. If the expansion failed | |
382 // (and at this point it was expected to succeed), | |
383 // ignore the failure (leaving "changed" as false). | |
384 } | |
385 if (desired_new_size < new_size_before && eden()->is_empty()) { | |
386 // bail out of shrinking if objects in eden | |
387 size_t change = new_size_before - desired_new_size; | |
388 assert(change % alignment == 0, "just checking"); | |
389 _virtual_space.shrink_by(change); | |
390 changed = true; | |
391 } | |
392 if (changed) { | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
393 // The spaces have already been mangled at this point but |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
394 // may not have been cleared (set top = bottom) and should be. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
395 // Mangling was done when the heap was being expanded. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
396 compute_space_boundaries(eden()->used(), |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
397 SpaceDecorator::Clear, |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
398 SpaceDecorator::DontMangle); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
399 MemRegion cmr((HeapWord*)_virtual_space.low(), |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
400 (HeapWord*)_virtual_space.high()); |
0 | 401 Universe::heap()->barrier_set()->resize_covered_region(cmr); |
402 if (Verbose && PrintGC) { | |
403 size_t new_size_after = _virtual_space.committed_size(); | |
404 size_t eden_size_after = eden()->capacity(); | |
405 size_t survivor_size_after = from()->capacity(); | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
406 gclog_or_tty->print("New generation size " SIZE_FORMAT "K->" |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
407 SIZE_FORMAT "K [eden=" |
0 | 408 SIZE_FORMAT "K,survivor=" SIZE_FORMAT "K]", |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
409 new_size_before/K, new_size_after/K, |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
410 eden_size_after/K, survivor_size_after/K); |
0 | 411 if (WizardMode) { |
412 gclog_or_tty->print("[allowed " SIZE_FORMAT "K extra for %d threads]", | |
413 thread_increase_size/K, threads_count); | |
414 } | |
415 gclog_or_tty->cr(); | |
416 } | |
417 } | |
418 } | |
419 | |
420 void DefNewGeneration::object_iterate_since_last_GC(ObjectClosure* cl) { | |
421 // $$$ This may be wrong in case of "scavenge failure"? | |
422 eden()->object_iterate(cl); | |
423 } | |
424 | |
425 void DefNewGeneration::younger_refs_iterate(OopsInGenClosure* cl) { | |
426 assert(false, "NYI -- are you sure you want to call this?"); | |
427 } | |
428 | |
429 | |
430 size_t DefNewGeneration::capacity() const { | |
431 return eden()->capacity() | |
432 + from()->capacity(); // to() is only used during scavenge | |
433 } | |
434 | |
435 | |
436 size_t DefNewGeneration::used() const { | |
437 return eden()->used() | |
438 + from()->used(); // to() is only used during scavenge | |
439 } | |
440 | |
441 | |
442 size_t DefNewGeneration::free() const { | |
443 return eden()->free() | |
444 + from()->free(); // to() is only used during scavenge | |
445 } | |
446 | |
447 size_t DefNewGeneration::max_capacity() const { | |
448 const size_t alignment = GenCollectedHeap::heap()->collector_policy()->min_alignment(); | |
449 const size_t reserved_bytes = reserved().byte_size(); | |
450 return reserved_bytes - compute_survivor_size(reserved_bytes, alignment); | |
451 } | |
452 | |
453 size_t DefNewGeneration::unsafe_max_alloc_nogc() const { | |
454 return eden()->free(); | |
455 } | |
456 | |
457 size_t DefNewGeneration::capacity_before_gc() const { | |
458 return eden()->capacity(); | |
459 } | |
460 | |
461 size_t DefNewGeneration::contiguous_available() const { | |
462 return eden()->free(); | |
463 } | |
464 | |
465 | |
466 HeapWord** DefNewGeneration::top_addr() const { return eden()->top_addr(); } | |
467 HeapWord** DefNewGeneration::end_addr() const { return eden()->end_addr(); } | |
468 | |
469 void DefNewGeneration::object_iterate(ObjectClosure* blk) { | |
470 eden()->object_iterate(blk); | |
471 from()->object_iterate(blk); | |
472 } | |
473 | |
474 | |
475 void DefNewGeneration::space_iterate(SpaceClosure* blk, | |
476 bool usedOnly) { | |
477 blk->do_space(eden()); | |
478 blk->do_space(from()); | |
479 blk->do_space(to()); | |
480 } | |
481 | |
482 // The last collection bailed out, we are running out of heap space, | |
483 // so we try to allocate the from-space, too. | |
484 HeapWord* DefNewGeneration::allocate_from_space(size_t size) { | |
485 HeapWord* result = NULL; | |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
486 if (Verbose && PrintGCDetails) { |
0 | 487 gclog_or_tty->print("DefNewGeneration::allocate_from_space(%u):" |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
488 " will_fail: %s" |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
489 " heap_lock: %s" |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
490 " free: " SIZE_FORMAT, |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
491 size, |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
492 GenCollectedHeap::heap()->incremental_collection_will_fail(false /* don't consult_young */) ? |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
493 "true" : "false", |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
494 Heap_lock->is_locked() ? "locked" : "unlocked", |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
495 from()->free()); |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
496 } |
0 | 497 if (should_allocate_from_space() || GC_locker::is_active_and_needs_gc()) { |
498 if (Heap_lock->owned_by_self() || | |
499 (SafepointSynchronize::is_at_safepoint() && | |
500 Thread::current()->is_VM_thread())) { | |
501 // If the Heap_lock is not locked by this thread, this will be called | |
502 // again later with the Heap_lock held. | |
503 result = from()->allocate(size); | |
504 } else if (PrintGC && Verbose) { | |
505 gclog_or_tty->print_cr(" Heap_lock is not owned by self"); | |
506 } | |
507 } else if (PrintGC && Verbose) { | |
508 gclog_or_tty->print_cr(" should_allocate_from_space: NOT"); | |
509 } | |
510 if (PrintGC && Verbose) { | |
511 gclog_or_tty->print_cr(" returns %s", result == NULL ? "NULL" : "object"); | |
512 } | |
513 return result; | |
514 } | |
515 | |
516 HeapWord* DefNewGeneration::expand_and_allocate(size_t size, | |
517 bool is_tlab, | |
518 bool parallel) { | |
519 // We don't attempt to expand the young generation (but perhaps we should.) | |
520 return allocate(size, is_tlab); | |
521 } | |
522 | |
523 | |
524 void DefNewGeneration::collect(bool full, | |
525 bool clear_all_soft_refs, | |
526 size_t size, | |
527 bool is_tlab) { | |
528 assert(full || size > 0, "otherwise we don't want to collect"); | |
529 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
530 _next_gen = gch->next_gen(this); | |
531 assert(_next_gen != NULL, | |
532 "This must be the youngest gen, and not the only gen"); | |
533 | |
534 // If the next generation is too full to accomodate promotion | |
535 // from this generation, pass on collection; let the next generation | |
536 // do it. | |
537 if (!collection_attempt_is_safe()) { | |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
538 if (Verbose && PrintGCDetails) { |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
539 gclog_or_tty->print(" :: Collection attempt not safe :: "); |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
540 } |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
541 gch->set_incremental_collection_failed(); // Slight lie: we did not even attempt one |
0 | 542 return; |
543 } | |
544 assert(to()->is_empty(), "Else not collection_attempt_is_safe"); | |
545 | |
546 init_assuming_no_promotion_failure(); | |
547 | |
548 TraceTime t1("GC", PrintGC && !PrintGCDetails, true, gclog_or_tty); | |
549 // Capture heap used before collection (for printing). | |
550 size_t gch_prev_used = gch->used(); | |
551 | |
552 SpecializationStats::clear(); | |
553 | |
554 // These can be shared for all code paths | |
555 IsAliveClosure is_alive(this); | |
556 ScanWeakRefClosure scan_weak_ref(this); | |
557 | |
558 age_table()->clear(); | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
559 to()->clear(SpaceDecorator::Mangle); |
0 | 560 |
561 gch->rem_set()->prepare_for_younger_refs_iterate(false); | |
562 | |
563 assert(gch->no_allocs_since_save_marks(0), | |
564 "save marks have not been newly set."); | |
565 | |
566 // Not very pretty. | |
567 CollectorPolicy* cp = gch->collector_policy(); | |
568 | |
569 FastScanClosure fsc_with_no_gc_barrier(this, false); | |
570 FastScanClosure fsc_with_gc_barrier(this, true); | |
571 | |
572 set_promo_failure_scan_stack_closure(&fsc_with_no_gc_barrier); | |
573 FastEvacuateFollowersClosure evacuate_followers(gch, _level, this, | |
574 &fsc_with_no_gc_barrier, | |
575 &fsc_with_gc_barrier); | |
576 | |
577 assert(gch->no_allocs_since_save_marks(0), | |
578 "save marks have not been newly set."); | |
579 | |
580 gch->gen_process_strong_roots(_level, | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
457
diff
changeset
|
581 true, // Process younger gens, if any, |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
457
diff
changeset
|
582 // as strong roots. |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
457
diff
changeset
|
583 true, // activate StrongRootsScope |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
457
diff
changeset
|
584 false, // not collecting perm generation. |
0 | 585 SharedHeap::SO_AllClasses, |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
457
diff
changeset
|
586 &fsc_with_no_gc_barrier, |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
457
diff
changeset
|
587 true, // walk *all* scavengable nmethods |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
457
diff
changeset
|
588 &fsc_with_gc_barrier); |
0 | 589 |
590 // "evacuate followers". | |
591 evacuate_followers.do_void(); | |
592 | |
593 FastKeepAliveClosure keep_alive(this, &scan_weak_ref); | |
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
356
diff
changeset
|
594 ReferenceProcessor* rp = ref_processor(); |
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
595 rp->setup_policy(clear_all_soft_refs); |
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
356
diff
changeset
|
596 rp->process_discovered_references(&is_alive, &keep_alive, &evacuate_followers, |
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
356
diff
changeset
|
597 NULL); |
0 | 598 if (!promotion_failed()) { |
599 // Swap the survivor spaces. | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
600 eden()->clear(SpaceDecorator::Mangle); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
601 from()->clear(SpaceDecorator::Mangle); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
602 if (ZapUnusedHeapArea) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
603 // This is now done here because of the piece-meal mangling which |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
604 // can check for valid mangling at intermediate points in the |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
605 // collection(s). When a minor collection fails to collect |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
606 // sufficient space resizing of the young generation can occur |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
607 // an redistribute the spaces in the young generation. Mangle |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
608 // here so that unzapped regions don't get distributed to |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
609 // other spaces. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
610 to()->mangle_unused_area(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
611 } |
0 | 612 swap_spaces(); |
613 | |
614 assert(to()->is_empty(), "to space should be empty now"); | |
615 | |
616 // Set the desired survivor size to half the real survivor space | |
617 _tenuring_threshold = | |
618 age_table()->compute_tenuring_threshold(to()->capacity()/HeapWordSize); | |
619 | |
1387
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1145
diff
changeset
|
620 // A successful scavenge should restart the GC time limit count which is |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1145
diff
changeset
|
621 // for full GC's. |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1145
diff
changeset
|
622 AdaptiveSizePolicy* size_policy = gch->gen_policy()->size_policy(); |
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1145
diff
changeset
|
623 size_policy->reset_gc_overhead_limit_count(); |
0 | 624 if (PrintGC && !PrintGCDetails) { |
625 gch->print_heap_change(gch_prev_used); | |
626 } | |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
627 assert(!gch->incremental_collection_failed(), "Should be clear"); |
0 | 628 } else { |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
629 assert(_promo_failure_scan_stack.is_empty(), "post condition"); |
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
630 _promo_failure_scan_stack.clear(true); // Clear cached segments. |
0 | 631 |
632 remove_forwarding_pointers(); | |
633 if (PrintGCDetails) { | |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
989
diff
changeset
|
634 gclog_or_tty->print(" (promotion failed) "); |
0 | 635 } |
636 // Add to-space to the list of space to compact | |
637 // when a promotion failure has occurred. In that | |
638 // case there can be live objects in to-space | |
639 // as a result of a partial evacuation of eden | |
640 // and from-space. | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
641 swap_spaces(); // For uniformity wrt ParNewGeneration. |
0 | 642 from()->set_next_compaction_space(to()); |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
643 gch->set_incremental_collection_failed(); |
0 | 644 |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
989
diff
changeset
|
645 // Inform the next generation that a promotion failure occurred. |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
989
diff
changeset
|
646 _next_gen->promotion_failure_occurred(); |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
989
diff
changeset
|
647 |
0 | 648 // Reset the PromotionFailureALot counters. |
649 NOT_PRODUCT(Universe::heap()->reset_promotion_should_fail();) | |
650 } | |
651 // set new iteration safe limit for the survivor spaces | |
652 from()->set_concurrent_iteration_safe_limit(from()->top()); | |
653 to()->set_concurrent_iteration_safe_limit(to()->top()); | |
654 SpecializationStats::print(); | |
655 update_time_of_last_gc(os::javaTimeMillis()); | |
656 } | |
657 | |
658 class RemoveForwardPointerClosure: public ObjectClosure { | |
659 public: | |
660 void do_object(oop obj) { | |
661 obj->init_mark(); | |
662 } | |
663 }; | |
664 | |
665 void DefNewGeneration::init_assuming_no_promotion_failure() { | |
666 _promotion_failed = false; | |
667 from()->set_next_compaction_space(NULL); | |
668 } | |
669 | |
670 void DefNewGeneration::remove_forwarding_pointers() { | |
671 RemoveForwardPointerClosure rspc; | |
672 eden()->object_iterate(&rspc); | |
673 from()->object_iterate(&rspc); | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
674 |
0 | 675 // Now restore saved marks, if any. |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
676 assert(_objs_with_preserved_marks.size() == _preserved_marks_of_objs.size(), |
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
677 "should be the same"); |
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
678 while (!_objs_with_preserved_marks.is_empty()) { |
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
679 oop obj = _objs_with_preserved_marks.pop(); |
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
680 markOop m = _preserved_marks_of_objs.pop(); |
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
681 obj->set_mark(m); |
0 | 682 } |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
683 _objs_with_preserved_marks.clear(true); |
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
684 _preserved_marks_of_objs.clear(true); |
0 | 685 } |
686 | |
2038
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
687 void DefNewGeneration::preserve_mark(oop obj, markOop m) { |
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
688 assert(promotion_failed() && m->must_be_preserved_for_promotion_failure(obj), |
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
689 "Oversaving!"); |
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
690 _objs_with_preserved_marks.push(obj); |
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
691 _preserved_marks_of_objs.push(m); |
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
692 } |
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
693 |
0 | 694 void DefNewGeneration::preserve_mark_if_necessary(oop obj, markOop m) { |
695 if (m->must_be_preserved_for_promotion_failure(obj)) { | |
2038
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
696 preserve_mark(obj, m); |
0 | 697 } |
698 } | |
699 | |
700 void DefNewGeneration::handle_promotion_failure(oop old) { | |
2038
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
701 if (PrintPromotionFailure && !_promotion_failed) { |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
989
diff
changeset
|
702 gclog_or_tty->print(" (promotion failure size = " SIZE_FORMAT ") ", |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
989
diff
changeset
|
703 old->size()); |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
989
diff
changeset
|
704 } |
2038
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
705 _promotion_failed = true; |
74ee0db180fa
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
1994
diff
changeset
|
706 preserve_mark_if_necessary(old, old->mark()); |
0 | 707 // forward to self |
708 old->forward_to(old); | |
709 | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
710 _promo_failure_scan_stack.push(old); |
0 | 711 |
712 if (!_promo_failure_drain_in_progress) { | |
713 // prevent recursion in copy_to_survivor_space() | |
714 _promo_failure_drain_in_progress = true; | |
715 drain_promo_failure_scan_stack(); | |
716 _promo_failure_drain_in_progress = false; | |
717 } | |
718 } | |
719 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
720 oop DefNewGeneration::copy_to_survivor_space(oop old) { |
0 | 721 assert(is_in_reserved(old) && !old->is_forwarded(), |
722 "shouldn't be scavenging this oop"); | |
723 size_t s = old->size(); | |
724 oop obj = NULL; | |
725 | |
726 // Try allocating obj in to-space (unless too old) | |
727 if (old->age() < tenuring_threshold()) { | |
728 obj = (oop) to()->allocate(s); | |
729 } | |
730 | |
731 // Otherwise try allocating obj tenured | |
732 if (obj == NULL) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
733 obj = _next_gen->promote(old, s); |
0 | 734 if (obj == NULL) { |
735 handle_promotion_failure(old); | |
736 return old; | |
737 } | |
738 } else { | |
739 // Prefetch beyond obj | |
740 const intx interval = PrefetchCopyIntervalInBytes; | |
741 Prefetch::write(obj, interval); | |
742 | |
743 // Copy obj | |
744 Copy::aligned_disjoint_words((HeapWord*)old, (HeapWord*)obj, s); | |
745 | |
746 // Increment age if obj still in new generation | |
747 obj->incr_age(); | |
748 age_table()->add(obj, s); | |
749 } | |
750 | |
751 // Done, insert forward pointer to obj in this header | |
752 old->forward_to(obj); | |
753 | |
754 return obj; | |
755 } | |
756 | |
757 void DefNewGeneration::drain_promo_failure_scan_stack() { | |
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
758 while (!_promo_failure_scan_stack.is_empty()) { |
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1552
diff
changeset
|
759 oop obj = _promo_failure_scan_stack.pop(); |
0 | 760 obj->oop_iterate(_promo_failure_scan_stack_closure); |
761 } | |
762 } | |
763 | |
764 void DefNewGeneration::save_marks() { | |
765 eden()->set_saved_mark(); | |
766 to()->set_saved_mark(); | |
767 from()->set_saved_mark(); | |
768 } | |
769 | |
770 | |
771 void DefNewGeneration::reset_saved_marks() { | |
772 eden()->reset_saved_mark(); | |
773 to()->reset_saved_mark(); | |
774 from()->reset_saved_mark(); | |
775 } | |
776 | |
777 | |
778 bool DefNewGeneration::no_allocs_since_save_marks() { | |
779 assert(eden()->saved_mark_at_top(), "Violated spec - alloc in eden"); | |
780 assert(from()->saved_mark_at_top(), "Violated spec - alloc in from"); | |
781 return to()->saved_mark_at_top(); | |
782 } | |
783 | |
784 #define DefNew_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \ | |
785 \ | |
786 void DefNewGeneration:: \ | |
787 oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl) { \ | |
788 cl->set_generation(this); \ | |
789 eden()->oop_since_save_marks_iterate##nv_suffix(cl); \ | |
790 to()->oop_since_save_marks_iterate##nv_suffix(cl); \ | |
791 from()->oop_since_save_marks_iterate##nv_suffix(cl); \ | |
792 cl->reset_generation(); \ | |
793 save_marks(); \ | |
794 } | |
795 | |
796 ALL_SINCE_SAVE_MARKS_CLOSURES(DefNew_SINCE_SAVE_MARKS_DEFN) | |
797 | |
798 #undef DefNew_SINCE_SAVE_MARKS_DEFN | |
799 | |
800 void DefNewGeneration::contribute_scratch(ScratchBlock*& list, Generation* requestor, | |
801 size_t max_alloc_words) { | |
802 if (requestor == this || _promotion_failed) return; | |
803 assert(requestor->level() > level(), "DefNewGeneration must be youngest"); | |
804 | |
805 /* $$$ Assert this? "trace" is a "MarkSweep" function so that's not appropriate. | |
806 if (to_space->top() > to_space->bottom()) { | |
807 trace("to_space not empty when contribute_scratch called"); | |
808 } | |
809 */ | |
810 | |
811 ContiguousSpace* to_space = to(); | |
812 assert(to_space->end() >= to_space->top(), "pointers out of order"); | |
813 size_t free_words = pointer_delta(to_space->end(), to_space->top()); | |
814 if (free_words >= MinFreeScratchWords) { | |
815 ScratchBlock* sb = (ScratchBlock*)to_space->top(); | |
816 sb->num_words = free_words; | |
817 sb->next = list; | |
818 list = sb; | |
819 } | |
820 } | |
821 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
822 void DefNewGeneration::reset_scratch() { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
823 // If contributing scratch in to_space, mangle all of |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
824 // to_space if ZapUnusedHeapArea. This is needed because |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
825 // top is not maintained while using to-space as scratch. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
826 if (ZapUnusedHeapArea) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
827 to()->mangle_unused_area_complete(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
828 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
829 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
830 |
0 | 831 bool DefNewGeneration::collection_attempt_is_safe() { |
832 if (!to()->is_empty()) { | |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
833 if (Verbose && PrintGCDetails) { |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
834 gclog_or_tty->print(" :: to is not empty :: "); |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
835 } |
0 | 836 return false; |
837 } | |
838 if (_next_gen == NULL) { | |
839 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
840 _next_gen = gch->next_gen(this); | |
841 assert(_next_gen != NULL, | |
842 "This must be the youngest gen, and not the only gen"); | |
843 } | |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
844 return _next_gen->promotion_attempt_is_safe(used()); |
0 | 845 } |
846 | |
847 void DefNewGeneration::gc_epilogue(bool full) { | |
1889
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
848 DEBUG_ONLY(static bool seen_incremental_collection_failed = false;) |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
849 |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
850 assert(!GC_locker::is_active(), "We should not be executing here"); |
0 | 851 // Check if the heap is approaching full after a collection has |
852 // been done. Generally the young generation is empty at | |
853 // a minimum at the end of a collection. If it is not, then | |
854 // the heap is approaching full. | |
855 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
856 if (full) { |
1889
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
857 DEBUG_ONLY(seen_incremental_collection_failed = false;) |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
858 if (!collection_attempt_is_safe() && !_eden_space->is_empty()) { |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
859 if (Verbose && PrintGCDetails) { |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
860 gclog_or_tty->print("DefNewEpilogue: cause(%s), full, not safe, set_failed, set_alloc_from, clear_seen", |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
861 GCCause::to_string(gch->gc_cause())); |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
862 } |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
863 gch->set_incremental_collection_failed(); // Slight lie: a full gc left us in that state |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
864 set_should_allocate_from_space(); // we seem to be running out of space |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
865 } else { |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
866 if (Verbose && PrintGCDetails) { |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
867 gclog_or_tty->print("DefNewEpilogue: cause(%s), full, safe, clear_failed, clear_alloc_from, clear_seen", |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
868 GCCause::to_string(gch->gc_cause())); |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
869 } |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
870 gch->clear_incremental_collection_failed(); // We just did a full collection |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
871 clear_should_allocate_from_space(); // if set |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1836
diff
changeset
|
872 } |
0 | 873 } else { |
1889
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
874 #ifdef ASSERT |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
875 // It is possible that incremental_collection_failed() == true |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
876 // here, because an attempted scavenge did not succeed. The policy |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
877 // is normally expected to cause a full collection which should |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
878 // clear that condition, so we should not be here twice in a row |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
879 // with incremental_collection_failed() == true without having done |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
880 // a full collection in between. |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
881 if (!seen_incremental_collection_failed && |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
882 gch->incremental_collection_failed()) { |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
883 if (Verbose && PrintGCDetails) { |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
884 gclog_or_tty->print("DefNewEpilogue: cause(%s), not full, not_seen_failed, failed, set_seen_failed", |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
885 GCCause::to_string(gch->gc_cause())); |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
886 } |
1889
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
887 seen_incremental_collection_failed = true; |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
888 } else if (seen_incremental_collection_failed) { |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
889 if (Verbose && PrintGCDetails) { |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
890 gclog_or_tty->print("DefNewEpilogue: cause(%s), not full, seen_failed, will_clear_seen_failed", |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
891 GCCause::to_string(gch->gc_cause())); |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
892 } |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
893 assert(gch->gc_cause() == GCCause::_scavenge_alot || |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
894 (gch->gc_cause() == GCCause::_java_lang_system_gc && UseConcMarkSweepGC && ExplicitGCInvokesConcurrent) || |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
895 !gch->incremental_collection_failed(), |
1953
8d81b4a1d3e1
6998802: ScavengeALot: assert(!gch->incremental_collection_failed()) failed: Twice in a row
ysr
parents:
1889
diff
changeset
|
896 "Twice in a row"); |
1889
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
897 seen_incremental_collection_failed = false; |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
898 } |
c766bae6c14d
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
1888
diff
changeset
|
899 #endif // ASSERT |
0 | 900 } |
901 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
902 if (ZapUnusedHeapArea) { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
903 eden()->check_mangled_unused_area_complete(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
904 from()->check_mangled_unused_area_complete(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
905 to()->check_mangled_unused_area_complete(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
906 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
907 |
0 | 908 // update the generation and space performance counters |
909 update_counters(); | |
910 gch->collector_policy()->counters()->update_counters(); | |
911 } | |
912 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
913 void DefNewGeneration::record_spaces_top() { |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
914 assert(ZapUnusedHeapArea, "Not mangling unused space"); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
915 eden()->set_top_for_allocations(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
916 to()->set_top_for_allocations(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
917 from()->set_top_for_allocations(); |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
918 } |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
919 |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
920 |
0 | 921 void DefNewGeneration::update_counters() { |
922 if (UsePerfData) { | |
923 _eden_counters->update_all(); | |
924 _from_counters->update_all(); | |
925 _to_counters->update_all(); | |
926 _gen_counters->update_all(); | |
927 } | |
928 } | |
929 | |
930 void DefNewGeneration::verify(bool allow_dirty) { | |
931 eden()->verify(allow_dirty); | |
932 from()->verify(allow_dirty); | |
933 to()->verify(allow_dirty); | |
934 } | |
935 | |
936 void DefNewGeneration::print_on(outputStream* st) const { | |
937 Generation::print_on(st); | |
938 st->print(" eden"); | |
939 eden()->print_on(st); | |
940 st->print(" from"); | |
941 from()->print_on(st); | |
942 st->print(" to "); | |
943 to()->print_on(st); | |
944 } | |
945 | |
946 | |
947 const char* DefNewGeneration::name() const { | |
948 return "def new generation"; | |
949 } | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
950 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
951 // Moved from inline file as they are not called inline |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
952 CompactibleSpace* DefNewGeneration::first_compaction_space() const { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
953 return eden(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
954 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
955 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
956 HeapWord* DefNewGeneration::allocate(size_t word_size, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
957 bool is_tlab) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
958 // This is the slow-path allocation for the DefNewGeneration. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
959 // Most allocations are fast-path in compiled code. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
960 // We try to allocate from the eden. If that works, we are happy. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
961 // Note that since DefNewGeneration supports lock-free allocation, we |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
962 // have to use it here, as well. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
963 HeapWord* result = eden()->par_allocate(word_size); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
964 if (result != NULL) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
965 return result; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
966 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
967 do { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
968 HeapWord* old_limit = eden()->soft_end(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
969 if (old_limit < eden()->end()) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
970 // Tell the next generation we reached a limit. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
971 HeapWord* new_limit = |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
972 next_gen()->allocation_limit_reached(eden(), eden()->top(), word_size); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
973 if (new_limit != NULL) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
974 Atomic::cmpxchg_ptr(new_limit, eden()->soft_end_addr(), old_limit); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
975 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
976 assert(eden()->soft_end() == eden()->end(), |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
977 "invalid state after allocation_limit_reached returned null"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
978 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
979 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
980 // The allocation failed and the soft limit is equal to the hard limit, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
981 // there are no reasons to do an attempt to allocate |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
982 assert(old_limit == eden()->end(), "sanity check"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
983 break; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
984 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
985 // Try to allocate until succeeded or the soft limit can't be adjusted |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
986 result = eden()->par_allocate(word_size); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
987 } while (result == NULL); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
988 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
989 // If the eden is full and the last collection bailed out, we are running |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
990 // out of heap space, and we try to allocate the from-space, too. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
991 // allocate_from_space can't be inlined because that would introduce a |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
992 // circular dependency at compile time. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
993 if (result == NULL) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
994 result = allocate_from_space(word_size); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
995 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
996 return result; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
997 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
998 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
999 HeapWord* DefNewGeneration::par_allocate(size_t word_size, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1000 bool is_tlab) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1001 return eden()->par_allocate(word_size); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1002 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1003 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1004 void DefNewGeneration::gc_prologue(bool full) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1005 // Ensure that _end and _soft_end are the same in eden space. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1006 eden()->set_soft_end(eden()->end()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1007 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1008 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1009 size_t DefNewGeneration::tlab_capacity() const { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1010 return eden()->capacity(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1011 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1012 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1013 size_t DefNewGeneration::unsafe_max_tlab_alloc() const { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1014 return unsafe_max_alloc_nogc(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1015 } |