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