author | stefank |
Thu, 02 Apr 2015 10:04:27 +0200 | |
changeset 30150 | d9c940aa42ef |
parent 30147 | af9a41999c6e |
child 30155 | a3a254791703 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
29200 | 2 |
* Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved. |
1 | 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 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5343
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5343
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5343
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#include "precompiled.hpp" |
26 |
#include "gc_implementation/shared/collectorCounters.hpp" |
|
27 |
#include "gc_implementation/shared/gcPolicyCounters.hpp" |
|
18025 | 28 |
#include "gc_implementation/shared/gcHeapSummary.hpp" |
29 |
#include "gc_implementation/shared/gcTimer.hpp" |
|
30 |
#include "gc_implementation/shared/gcTraceTime.hpp" |
|
31 |
#include "gc_implementation/shared/gcTrace.hpp" |
|
7397 | 32 |
#include "gc_implementation/shared/spaceDecorator.hpp" |
33 |
#include "memory/defNewGeneration.inline.hpp" |
|
34 |
#include "memory/gcLocker.inline.hpp" |
|
35 |
#include "memory/genCollectedHeap.hpp" |
|
36 |
#include "memory/genOopClosures.inline.hpp" |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
37 |
#include "memory/genRemSet.hpp" |
7397 | 38 |
#include "memory/generationSpec.hpp" |
39 |
#include "memory/iterator.hpp" |
|
40 |
#include "memory/referencePolicy.hpp" |
|
41 |
#include "memory/space.inline.hpp" |
|
42 |
#include "oops/instanceRefKlass.hpp" |
|
43 |
#include "oops/oop.inline.hpp" |
|
25351
7c198a690050
8044775: Improve usage of umbrella header atomic.inline.hpp.
goetz
parents:
25350
diff
changeset
|
44 |
#include "runtime/atomic.inline.hpp" |
7397 | 45 |
#include "runtime/java.hpp" |
24487
71ff0bd674eb
8042737: Introduce umbrella header prefetch.inline.hpp
goetz
parents:
24424
diff
changeset
|
46 |
#include "runtime/prefetch.inline.hpp" |
14583
d70ee55535f4
8003935: Simplify the needed includes for using Thread::current()
stefank
parents:
13728
diff
changeset
|
47 |
#include "runtime/thread.inline.hpp" |
7397 | 48 |
#include "utilities/copy.hpp" |
24098
48f07e2c74de
8039957: Replace the last few %p usages with PTR_FORMAT in the GC code
stefank
parents:
24092
diff
changeset
|
49 |
#include "utilities/globalDefinitions.hpp" |
7397 | 50 |
#include "utilities/stack.inline.hpp" |
30150
d9c940aa42ef
8075955: Replace the macro based implementation of oop_oop_iterate with a template based solution
stefank
parents:
30147
diff
changeset
|
51 |
#if INCLUDE_ALL_GCS |
d9c940aa42ef
8075955: Replace the macro based implementation of oop_oop_iterate with a template based solution
stefank
parents:
30147
diff
changeset
|
52 |
#include "gc_implementation/parNew/parOopClosures.hpp" |
d9c940aa42ef
8075955: Replace the macro based implementation of oop_oop_iterate with a template based solution
stefank
parents:
30147
diff
changeset
|
53 |
#endif |
1 | 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 |
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 |
_rs = (CardTableRS*)rs; |
|
71 |
} |
|
72 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
73 |
void DefNewGeneration::KeepAliveClosure::do_oop(oop* p) { DefNewGeneration::KeepAliveClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
74 |
void DefNewGeneration::KeepAliveClosure::do_oop(narrowOop* p) { DefNewGeneration::KeepAliveClosure::do_oop_work(p); } |
1 | 75 |
|
76 |
||
77 |
DefNewGeneration::FastKeepAliveClosure:: |
|
78 |
FastKeepAliveClosure(DefNewGeneration* g, ScanWeakRefClosure* cl) : |
|
79 |
DefNewGeneration::KeepAliveClosure(cl) { |
|
80 |
_boundary = g->reserved().end(); |
|
81 |
} |
|
82 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
83 |
void DefNewGeneration::FastKeepAliveClosure::do_oop(oop* p) { DefNewGeneration::FastKeepAliveClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
84 |
void DefNewGeneration::FastKeepAliveClosure::do_oop(narrowOop* p) { DefNewGeneration::FastKeepAliveClosure::do_oop_work(p); } |
1 | 85 |
|
86 |
DefNewGeneration::EvacuateFollowersClosure:: |
|
87 |
EvacuateFollowersClosure(GenCollectedHeap* gch, int level, |
|
88 |
ScanClosure* cur, ScanClosure* older) : |
|
89 |
_gch(gch), _level(level), |
|
90 |
_scan_cur_or_nonheap(cur), _scan_older(older) |
|
91 |
{} |
|
92 |
||
93 |
void DefNewGeneration::EvacuateFollowersClosure::do_void() { |
|
94 |
do { |
|
95 |
_gch->oop_since_save_marks_iterate(_level, _scan_cur_or_nonheap, |
|
96 |
_scan_older); |
|
97 |
} while (!_gch->no_allocs_since_save_marks(_level)); |
|
98 |
} |
|
99 |
||
100 |
DefNewGeneration::FastEvacuateFollowersClosure:: |
|
101 |
FastEvacuateFollowersClosure(GenCollectedHeap* gch, int level, |
|
102 |
DefNewGeneration* gen, |
|
103 |
FastScanClosure* cur, FastScanClosure* older) : |
|
104 |
_gch(gch), _level(level), _gen(gen), |
|
105 |
_scan_cur_or_nonheap(cur), _scan_older(older) |
|
106 |
{} |
|
107 |
||
108 |
void DefNewGeneration::FastEvacuateFollowersClosure::do_void() { |
|
109 |
do { |
|
110 |
_gch->oop_since_save_marks_iterate(_level, _scan_cur_or_nonheap, |
|
111 |
_scan_older); |
|
112 |
} while (!_gch->no_allocs_since_save_marks(_level)); |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
113 |
guarantee(_gen->promo_failure_scan_is_complete(), "Failed to finish scan"); |
1 | 114 |
} |
115 |
||
116 |
ScanClosure::ScanClosure(DefNewGeneration* g, bool gc_barrier) : |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
117 |
OopsInKlassOrGenClosure(g), _g(g), _gc_barrier(gc_barrier) |
1 | 118 |
{ |
119 |
assert(_g->level() == 0, "Optimized for youngest generation"); |
|
120 |
_boundary = _g->reserved().end(); |
|
121 |
} |
|
122 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
123 |
void ScanClosure::do_oop(oop* p) { ScanClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
124 |
void ScanClosure::do_oop(narrowOop* p) { ScanClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
125 |
|
1 | 126 |
FastScanClosure::FastScanClosure(DefNewGeneration* g, bool gc_barrier) : |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
127 |
OopsInKlassOrGenClosure(g), _g(g), _gc_barrier(gc_barrier) |
1 | 128 |
{ |
129 |
assert(_g->level() == 0, "Optimized for youngest generation"); |
|
130 |
_boundary = _g->reserved().end(); |
|
131 |
} |
|
132 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
133 |
void FastScanClosure::do_oop(oop* p) { FastScanClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
134 |
void FastScanClosure::do_oop(narrowOop* p) { FastScanClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
135 |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
136 |
void KlassScanClosure::do_klass(Klass* klass) { |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
137 |
#ifndef PRODUCT |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
138 |
if (TraceScavenge) { |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
139 |
ResourceMark rm; |
24098
48f07e2c74de
8039957: Replace the last few %p usages with PTR_FORMAT in the GC code
stefank
parents:
24092
diff
changeset
|
140 |
gclog_or_tty->print_cr("KlassScanClosure::do_klass " PTR_FORMAT ", %s, dirty: %s", |
29800
fa5f7a2bf717
8076073: shared: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC needs to be removed from source files
david
parents:
29794
diff
changeset
|
141 |
p2i(klass), |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
142 |
klass->external_name(), |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
143 |
klass->has_modified_oops() ? "true" : "false"); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
144 |
} |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
145 |
#endif |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
146 |
|
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
147 |
// If the klass has not been dirtied we know that there's |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
148 |
// no references into the young gen and we can skip it. |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
149 |
if (klass->has_modified_oops()) { |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
150 |
if (_accumulate_modified_oops) { |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
151 |
klass->accumulate_modified_oops(); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
152 |
} |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
153 |
|
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
154 |
// Clear this state since we're going to scavenge all the metadata. |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
155 |
klass->clear_modified_oops(); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
156 |
|
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
157 |
// Tell the closure which Klass is being scanned so that it can be dirtied |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
158 |
// if oops are left pointing into the young gen. |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
159 |
_scavenge_closure->set_scanned_klass(klass); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
160 |
|
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
161 |
klass->oops_do(_scavenge_closure); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
162 |
|
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
163 |
_scavenge_closure->set_scanned_klass(NULL); |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
164 |
} |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
165 |
} |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
166 |
|
1 | 167 |
ScanWeakRefClosure::ScanWeakRefClosure(DefNewGeneration* g) : |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
168 |
_g(g) |
1 | 169 |
{ |
170 |
assert(_g->level() == 0, "Optimized for youngest generation"); |
|
171 |
_boundary = _g->reserved().end(); |
|
172 |
} |
|
173 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
174 |
void ScanWeakRefClosure::do_oop(oop* p) { ScanWeakRefClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
175 |
void ScanWeakRefClosure::do_oop(narrowOop* p) { ScanWeakRefClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
176 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
177 |
void FilteringClosure::do_oop(oop* p) { FilteringClosure::do_oop_work(p); } |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
178 |
void FilteringClosure::do_oop(narrowOop* p) { FilteringClosure::do_oop_work(p); } |
1 | 179 |
|
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
180 |
KlassScanClosure::KlassScanClosure(OopsInKlassOrGenClosure* scavenge_closure, |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
181 |
KlassRemSet* klass_rem_set) |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
182 |
: _scavenge_closure(scavenge_closure), |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
183 |
_accumulate_modified_oops(klass_rem_set->accumulate_modified_oops()) {} |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
184 |
|
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
185 |
|
1 | 186 |
DefNewGeneration::DefNewGeneration(ReservedSpace rs, |
187 |
size_t initial_size, |
|
188 |
int level, |
|
189 |
const char* policy) |
|
190 |
: Generation(rs, initial_size, level), |
|
191 |
_promo_failure_drain_in_progress(false), |
|
192 |
_should_allocate_from_space(false) |
|
193 |
{ |
|
194 |
MemRegion cmr((HeapWord*)_virtual_space.low(), |
|
195 |
(HeapWord*)_virtual_space.high()); |
|
196 |
Universe::heap()->barrier_set()->resize_covered_region(cmr); |
|
197 |
||
27625 | 198 |
_eden_space = new ContiguousSpace(); |
1 | 199 |
_from_space = new ContiguousSpace(); |
200 |
_to_space = new ContiguousSpace(); |
|
201 |
||
202 |
if (_eden_space == NULL || _from_space == NULL || _to_space == NULL) |
|
203 |
vm_exit_during_initialization("Could not allocate a new gen space"); |
|
204 |
||
205 |
// Compute the maximum eden and survivor space sizes. These sizes |
|
206 |
// are computed assuming the entire reserved space is committed. |
|
207 |
// These values are exported as performance counters. |
|
21561
c619b1cb4554
8016309: assert(eden_size > 0 && survivor_size > 0) failed: just checking
jwilhelm
parents:
19286
diff
changeset
|
208 |
uintx alignment = GenCollectedHeap::heap()->collector_policy()->space_alignment(); |
1 | 209 |
uintx size = _virtual_space.reserved_size(); |
210 |
_max_survivor_size = compute_survivor_size(size, alignment); |
|
211 |
_max_eden_size = size - (2*_max_survivor_size); |
|
212 |
||
213 |
// allocate the performance counters |
|
26324
6b9c12e15535
8028787: tmtools/jstat/gcoldcapacity/jstat_gcoldcapacity02 fails nsk.share.Failure: OGC < OGCMN in RT_Baseline
sjohanss
parents:
25905
diff
changeset
|
214 |
GenCollectorPolicy* gcp = (GenCollectorPolicy*) GenCollectedHeap::heap()->collector_policy(); |
1 | 215 |
|
216 |
// Generation counters -- generation 0, 3 subspaces |
|
26324
6b9c12e15535
8028787: tmtools/jstat/gcoldcapacity/jstat_gcoldcapacity02 fails nsk.share.Failure: OGC < OGCMN in RT_Baseline
sjohanss
parents:
25905
diff
changeset
|
217 |
_gen_counters = new GenerationCounters("new", 0, 3, |
6b9c12e15535
8028787: tmtools/jstat/gcoldcapacity/jstat_gcoldcapacity02 fails nsk.share.Failure: OGC < OGCMN in RT_Baseline
sjohanss
parents:
25905
diff
changeset
|
218 |
gcp->min_young_size(), gcp->max_young_size(), &_virtual_space); |
1 | 219 |
_gc_counters = new CollectorCounters(policy, 0); |
220 |
||
221 |
_eden_counters = new CSpaceCounters("eden", 0, _max_eden_size, _eden_space, |
|
222 |
_gen_counters); |
|
223 |
_from_counters = new CSpaceCounters("s0", 1, _max_survivor_size, _from_space, |
|
224 |
_gen_counters); |
|
225 |
_to_counters = new CSpaceCounters("s1", 2, _max_survivor_size, _to_space, |
|
226 |
_gen_counters); |
|
227 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
228 |
compute_space_boundaries(0, SpaceDecorator::Clear, SpaceDecorator::Mangle); |
1 | 229 |
update_counters(); |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
230 |
_old_gen = NULL; |
1 | 231 |
_tenuring_threshold = MaxTenuringThreshold; |
232 |
_pretenure_size_threshold_words = PretenureSizeThreshold >> LogHeapWordSize; |
|
18025 | 233 |
|
234 |
_gc_timer = new (ResourceObj::C_HEAP, mtGC) STWGCTimer(); |
|
1 | 235 |
} |
236 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
237 |
void DefNewGeneration::compute_space_boundaries(uintx minimum_eden_size, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
238 |
bool clear_space, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
239 |
bool mangle_space) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
240 |
uintx alignment = |
21561
c619b1cb4554
8016309: assert(eden_size > 0 && survivor_size > 0) failed: just checking
jwilhelm
parents:
19286
diff
changeset
|
241 |
GenCollectedHeap::heap()->collector_policy()->space_alignment(); |
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
242 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
243 |
// If the spaces are being cleared (only done at heap initialization |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
244 |
// currently), the survivor spaces need not be empty. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
245 |
// Otherwise, no care is taken for used areas in the survivor spaces |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
246 |
// so check. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
247 |
assert(clear_space || (to()->is_empty() && from()->is_empty()), |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
248 |
"Initialization of the survivor spaces assumes these are empty"); |
1 | 249 |
|
250 |
// Compute sizes |
|
251 |
uintx size = _virtual_space.committed_size(); |
|
252 |
uintx survivor_size = compute_survivor_size(size, alignment); |
|
253 |
uintx eden_size = size - (2*survivor_size); |
|
254 |
assert(eden_size > 0 && survivor_size <= eden_size, "just checking"); |
|
255 |
||
256 |
if (eden_size < minimum_eden_size) { |
|
257 |
// May happen due to 64Kb rounding, if so adjust eden size back up |
|
258 |
minimum_eden_size = align_size_up(minimum_eden_size, alignment); |
|
259 |
uintx maximum_survivor_size = (size - minimum_eden_size) / 2; |
|
260 |
uintx unaligned_survivor_size = |
|
261 |
align_size_down(maximum_survivor_size, alignment); |
|
262 |
survivor_size = MAX2(unaligned_survivor_size, alignment); |
|
263 |
eden_size = size - (2*survivor_size); |
|
264 |
assert(eden_size > 0 && survivor_size <= eden_size, "just checking"); |
|
265 |
assert(eden_size >= minimum_eden_size, "just checking"); |
|
266 |
} |
|
267 |
||
268 |
char *eden_start = _virtual_space.low(); |
|
269 |
char *from_start = eden_start + eden_size; |
|
270 |
char *to_start = from_start + survivor_size; |
|
271 |
char *to_end = to_start + survivor_size; |
|
272 |
||
273 |
assert(to_end == _virtual_space.high(), "just checking"); |
|
274 |
assert(Space::is_aligned((HeapWord*)eden_start), "checking alignment"); |
|
275 |
assert(Space::is_aligned((HeapWord*)from_start), "checking alignment"); |
|
276 |
assert(Space::is_aligned((HeapWord*)to_start), "checking alignment"); |
|
277 |
||
278 |
MemRegion edenMR((HeapWord*)eden_start, (HeapWord*)from_start); |
|
279 |
MemRegion fromMR((HeapWord*)from_start, (HeapWord*)to_start); |
|
280 |
MemRegion toMR ((HeapWord*)to_start, (HeapWord*)to_end); |
|
281 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
282 |
// A minimum eden size implies that there is a part of eden that |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
283 |
// is being used and that affects the initialization of any |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
284 |
// newly formed eden. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
285 |
bool live_in_eden = minimum_eden_size > 0; |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
286 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
287 |
// If not clearing the spaces, do some checking to verify that |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
288 |
// the space are already mangled. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
289 |
if (!clear_space) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
290 |
// Must check mangling before the spaces are reshaped. Otherwise, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
291 |
// the bottom or end of one space may have moved into another |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
292 |
// a failure of the check may not correctly indicate which space |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
293 |
// is not properly mangled. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
294 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
295 |
HeapWord* limit = (HeapWord*) _virtual_space.high(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
296 |
eden()->check_mangled_unused_area(limit); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
297 |
from()->check_mangled_unused_area(limit); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
298 |
to()->check_mangled_unused_area(limit); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
299 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
300 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
301 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
302 |
// Reset the spaces for their new regions. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
303 |
eden()->initialize(edenMR, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
304 |
clear_space && !live_in_eden, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
305 |
SpaceDecorator::Mangle); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
306 |
// If clear_space and live_in_eden, we will not have cleared any |
1 | 307 |
// portion of eden above its top. This can cause newly |
308 |
// expanded space not to be mangled if using ZapUnusedHeapArea. |
|
309 |
// We explicitly do such mangling here. |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
310 |
if (ZapUnusedHeapArea && clear_space && live_in_eden && mangle_space) { |
1 | 311 |
eden()->mangle_unused_area(); |
312 |
} |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
313 |
from()->initialize(fromMR, clear_space, mangle_space); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
314 |
to()->initialize(toMR, clear_space, mangle_space); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
315 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
316 |
// Set next compaction spaces. |
1 | 317 |
eden()->set_next_compaction_space(from()); |
318 |
// The to-space is normally empty before a compaction so need |
|
319 |
// not be considered. The exception is during promotion |
|
320 |
// failure handling when to-space can contain live objects. |
|
321 |
from()->set_next_compaction_space(NULL); |
|
322 |
} |
|
323 |
||
324 |
void DefNewGeneration::swap_spaces() { |
|
325 |
ContiguousSpace* s = from(); |
|
326 |
_from_space = to(); |
|
327 |
_to_space = s; |
|
328 |
eden()->set_next_compaction_space(from()); |
|
329 |
// The to-space is normally empty before a compaction so need |
|
330 |
// not be considered. The exception is during promotion |
|
331 |
// failure handling when to-space can contain live objects. |
|
332 |
from()->set_next_compaction_space(NULL); |
|
333 |
||
334 |
if (UsePerfData) { |
|
335 |
CSpaceCounters* c = _from_counters; |
|
336 |
_from_counters = _to_counters; |
|
337 |
_to_counters = c; |
|
338 |
} |
|
339 |
} |
|
340 |
||
341 |
bool DefNewGeneration::expand(size_t bytes) { |
|
342 |
MutexLocker x(ExpandHeap_lock); |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
343 |
HeapWord* prev_high = (HeapWord*) _virtual_space.high(); |
1 | 344 |
bool success = _virtual_space.expand_by(bytes); |
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
345 |
if (success && ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
346 |
// Mangle newly committed space immediately because it |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
347 |
// can be done here more simply that after the new |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
348 |
// spaces have been computed. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
349 |
HeapWord* new_high = (HeapWord*) _virtual_space.high(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
350 |
MemRegion mangle_region(prev_high, new_high); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
351 |
SpaceMangler::mangle_region(mangle_region); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
352 |
} |
1 | 353 |
|
354 |
// Do not attempt an expand-to-the reserve size. The |
|
355 |
// request should properly observe the maximum size of |
|
356 |
// the generation so an expand-to-reserve should be |
|
357 |
// unnecessary. Also a second call to expand-to-reserve |
|
358 |
// value potentially can cause an undue expansion. |
|
359 |
// For example if the first expand fail for unknown reasons, |
|
360 |
// but the second succeeds and expands the heap to its maximum |
|
361 |
// value. |
|
362 |
if (GC_locker::is_active()) { |
|
363 |
if (PrintGC && Verbose) { |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
364 |
gclog_or_tty->print_cr("Garbage collection disabled, " |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
365 |
"expanded heap instead"); |
1 | 366 |
} |
367 |
} |
|
368 |
||
369 |
return success; |
|
370 |
} |
|
371 |
||
372 |
||
373 |
void DefNewGeneration::compute_new_size() { |
|
374 |
// This is called after a gc that includes the following generation |
|
375 |
// (which is required to exist.) So from-space will normally be empty. |
|
376 |
// Note that we check both spaces, since if scavenge failed they revert roles. |
|
377 |
// If not we bail out (otherwise we would have to relocate the objects) |
|
378 |
if (!from()->is_empty() || !to()->is_empty()) { |
|
379 |
return; |
|
380 |
} |
|
381 |
||
382 |
int next_level = level() + 1; |
|
383 |
GenCollectedHeap* gch = GenCollectedHeap::heap(); |
|
29794 | 384 |
assert(next_level < gch->n_gens(), |
1 | 385 |
"DefNewGeneration cannot be an oldest gen"); |
386 |
||
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
387 |
Generation* old_gen = gch->old_gen(); |
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
388 |
size_t old_size = old_gen->capacity(); |
1 | 389 |
size_t new_size_before = _virtual_space.committed_size(); |
390 |
size_t min_new_size = spec()->init_size(); |
|
391 |
size_t max_new_size = reserved().byte_size(); |
|
392 |
assert(min_new_size <= new_size_before && |
|
393 |
new_size_before <= max_new_size, |
|
394 |
"just checking"); |
|
395 |
// All space sizes must be multiples of Generation::GenGrain. |
|
396 |
size_t alignment = Generation::GenGrain; |
|
397 |
||
398 |
// Compute desired new generation size based on NewRatio and |
|
399 |
// NewSizeThreadIncrease |
|
400 |
size_t desired_new_size = old_size/NewRatio; |
|
401 |
int threads_count = Threads::number_of_non_daemon_threads(); |
|
402 |
size_t thread_increase_size = threads_count * NewSizeThreadIncrease; |
|
403 |
desired_new_size = align_size_up(desired_new_size + thread_increase_size, alignment); |
|
404 |
||
405 |
// Adjust new generation size |
|
406 |
desired_new_size = MAX2(MIN2(desired_new_size, max_new_size), min_new_size); |
|
407 |
assert(desired_new_size <= max_new_size, "just checking"); |
|
408 |
||
409 |
bool changed = false; |
|
410 |
if (desired_new_size > new_size_before) { |
|
411 |
size_t change = desired_new_size - new_size_before; |
|
412 |
assert(change % alignment == 0, "just checking"); |
|
413 |
if (expand(change)) { |
|
414 |
changed = true; |
|
415 |
} |
|
416 |
// If the heap failed to expand to the desired size, |
|
417 |
// "changed" will be false. If the expansion failed |
|
418 |
// (and at this point it was expected to succeed), |
|
419 |
// ignore the failure (leaving "changed" as false). |
|
420 |
} |
|
421 |
if (desired_new_size < new_size_before && eden()->is_empty()) { |
|
422 |
// bail out of shrinking if objects in eden |
|
423 |
size_t change = new_size_before - desired_new_size; |
|
424 |
assert(change % alignment == 0, "just checking"); |
|
425 |
_virtual_space.shrink_by(change); |
|
426 |
changed = true; |
|
427 |
} |
|
428 |
if (changed) { |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
429 |
// The spaces have already been mangled at this point but |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
430 |
// may not have been cleared (set top = bottom) and should be. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
431 |
// Mangling was done when the heap was being expanded. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
432 |
compute_space_boundaries(eden()->used(), |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
433 |
SpaceDecorator::Clear, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
434 |
SpaceDecorator::DontMangle); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
435 |
MemRegion cmr((HeapWord*)_virtual_space.low(), |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
436 |
(HeapWord*)_virtual_space.high()); |
1 | 437 |
Universe::heap()->barrier_set()->resize_covered_region(cmr); |
438 |
if (Verbose && PrintGC) { |
|
439 |
size_t new_size_after = _virtual_space.committed_size(); |
|
440 |
size_t eden_size_after = eden()->capacity(); |
|
441 |
size_t survivor_size_after = from()->capacity(); |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
442 |
gclog_or_tty->print("New generation size " SIZE_FORMAT "K->" |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
443 |
SIZE_FORMAT "K [eden=" |
1 | 444 |
SIZE_FORMAT "K,survivor=" SIZE_FORMAT "K]", |
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
445 |
new_size_before/K, new_size_after/K, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
446 |
eden_size_after/K, survivor_size_after/K); |
1 | 447 |
if (WizardMode) { |
448 |
gclog_or_tty->print("[allowed " SIZE_FORMAT "K extra for %d threads]", |
|
449 |
thread_increase_size/K, threads_count); |
|
450 |
} |
|
451 |
gclog_or_tty->cr(); |
|
452 |
} |
|
453 |
} |
|
454 |
} |
|
455 |
||
456 |
void DefNewGeneration::younger_refs_iterate(OopsInGenClosure* cl) { |
|
457 |
assert(false, "NYI -- are you sure you want to call this?"); |
|
458 |
} |
|
459 |
||
460 |
||
461 |
size_t DefNewGeneration::capacity() const { |
|
462 |
return eden()->capacity() |
|
463 |
+ from()->capacity(); // to() is only used during scavenge |
|
464 |
} |
|
465 |
||
466 |
||
467 |
size_t DefNewGeneration::used() const { |
|
468 |
return eden()->used() |
|
469 |
+ from()->used(); // to() is only used during scavenge |
|
470 |
} |
|
471 |
||
472 |
||
473 |
size_t DefNewGeneration::free() const { |
|
474 |
return eden()->free() |
|
475 |
+ from()->free(); // to() is only used during scavenge |
|
476 |
} |
|
477 |
||
478 |
size_t DefNewGeneration::max_capacity() const { |
|
21561
c619b1cb4554
8016309: assert(eden_size > 0 && survivor_size > 0) failed: just checking
jwilhelm
parents:
19286
diff
changeset
|
479 |
const size_t alignment = GenCollectedHeap::heap()->collector_policy()->space_alignment(); |
1 | 480 |
const size_t reserved_bytes = reserved().byte_size(); |
481 |
return reserved_bytes - compute_survivor_size(reserved_bytes, alignment); |
|
482 |
} |
|
483 |
||
484 |
size_t DefNewGeneration::unsafe_max_alloc_nogc() const { |
|
485 |
return eden()->free(); |
|
486 |
} |
|
487 |
||
488 |
size_t DefNewGeneration::capacity_before_gc() const { |
|
489 |
return eden()->capacity(); |
|
490 |
} |
|
491 |
||
492 |
size_t DefNewGeneration::contiguous_available() const { |
|
493 |
return eden()->free(); |
|
494 |
} |
|
495 |
||
496 |
||
497 |
HeapWord** DefNewGeneration::top_addr() const { return eden()->top_addr(); } |
|
498 |
HeapWord** DefNewGeneration::end_addr() const { return eden()->end_addr(); } |
|
499 |
||
500 |
void DefNewGeneration::object_iterate(ObjectClosure* blk) { |
|
501 |
eden()->object_iterate(blk); |
|
502 |
from()->object_iterate(blk); |
|
503 |
} |
|
504 |
||
505 |
||
506 |
void DefNewGeneration::space_iterate(SpaceClosure* blk, |
|
507 |
bool usedOnly) { |
|
508 |
blk->do_space(eden()); |
|
509 |
blk->do_space(from()); |
|
510 |
blk->do_space(to()); |
|
511 |
} |
|
512 |
||
513 |
// The last collection bailed out, we are running out of heap space, |
|
514 |
// so we try to allocate the from-space, too. |
|
515 |
HeapWord* DefNewGeneration::allocate_from_space(size_t size) { |
|
516 |
HeapWord* result = NULL; |
|
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
517 |
if (Verbose && PrintGCDetails) { |
24092
e274d864545a
8039743: Use correct format specifier to print size_t values and pointers in the GC code
stefank
parents:
22882
diff
changeset
|
518 |
gclog_or_tty->print("DefNewGeneration::allocate_from_space(" SIZE_FORMAT "):" |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
519 |
" will_fail: %s" |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
520 |
" heap_lock: %s" |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
521 |
" free: " SIZE_FORMAT, |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
522 |
size, |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
523 |
GenCollectedHeap::heap()->incremental_collection_will_fail(false /* don't consult_young */) ? |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
524 |
"true" : "false", |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
525 |
Heap_lock->is_locked() ? "locked" : "unlocked", |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
526 |
from()->free()); |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
527 |
} |
1 | 528 |
if (should_allocate_from_space() || GC_locker::is_active_and_needs_gc()) { |
529 |
if (Heap_lock->owned_by_self() || |
|
530 |
(SafepointSynchronize::is_at_safepoint() && |
|
531 |
Thread::current()->is_VM_thread())) { |
|
532 |
// If the Heap_lock is not locked by this thread, this will be called |
|
533 |
// again later with the Heap_lock held. |
|
534 |
result = from()->allocate(size); |
|
535 |
} else if (PrintGC && Verbose) { |
|
536 |
gclog_or_tty->print_cr(" Heap_lock is not owned by self"); |
|
537 |
} |
|
538 |
} else if (PrintGC && Verbose) { |
|
539 |
gclog_or_tty->print_cr(" should_allocate_from_space: NOT"); |
|
540 |
} |
|
541 |
if (PrintGC && Verbose) { |
|
542 |
gclog_or_tty->print_cr(" returns %s", result == NULL ? "NULL" : "object"); |
|
543 |
} |
|
544 |
return result; |
|
545 |
} |
|
546 |
||
547 |
HeapWord* DefNewGeneration::expand_and_allocate(size_t size, |
|
548 |
bool is_tlab, |
|
549 |
bool parallel) { |
|
550 |
// We don't attempt to expand the young generation (but perhaps we should.) |
|
551 |
return allocate(size, is_tlab); |
|
552 |
} |
|
553 |
||
15215
048f775ae371
8005972: ParNew should not update the tenuring threshold when promotion failed has occurred
brutisso
parents:
14583
diff
changeset
|
554 |
void DefNewGeneration::adjust_desired_tenuring_threshold() { |
048f775ae371
8005972: ParNew should not update the tenuring threshold when promotion failed has occurred
brutisso
parents:
14583
diff
changeset
|
555 |
// Set the desired survivor size to half the real survivor space |
30147
af9a41999c6e
8076314: Remove the static instance variable SharedHeap:: _sh
brutisso
parents:
29800
diff
changeset
|
556 |
GCPolicyCounters* gc_counters = GenCollectedHeap::heap()->collector_policy()->counters(); |
15215
048f775ae371
8005972: ParNew should not update the tenuring threshold when promotion failed has occurred
brutisso
parents:
14583
diff
changeset
|
557 |
_tenuring_threshold = |
30147
af9a41999c6e
8076314: Remove the static instance variable SharedHeap:: _sh
brutisso
parents:
29800
diff
changeset
|
558 |
age_table()->compute_tenuring_threshold(to()->capacity()/HeapWordSize, gc_counters); |
15215
048f775ae371
8005972: ParNew should not update the tenuring threshold when promotion failed has occurred
brutisso
parents:
14583
diff
changeset
|
559 |
} |
1 | 560 |
|
561 |
void DefNewGeneration::collect(bool full, |
|
562 |
bool clear_all_soft_refs, |
|
563 |
size_t size, |
|
564 |
bool is_tlab) { |
|
565 |
assert(full || size > 0, "otherwise we don't want to collect"); |
|
18025 | 566 |
|
1 | 567 |
GenCollectedHeap* gch = GenCollectedHeap::heap(); |
18025 | 568 |
|
21767
41eaa9a17059
8028128: Add a type safe alternative for working with counter based data
mgronlun
parents:
21561
diff
changeset
|
569 |
_gc_timer->register_gc_start(); |
18025 | 570 |
DefNewTracer gc_tracer; |
571 |
gc_tracer.report_gc_start(gch->gc_cause(), _gc_timer->gc_start()); |
|
572 |
||
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
573 |
_old_gen = gch->old_gen(); |
1 | 574 |
|
18025 | 575 |
// If the next generation is too full to accommodate promotion |
1 | 576 |
// from this generation, pass on collection; let the next generation |
577 |
// do it. |
|
578 |
if (!collection_attempt_is_safe()) { |
|
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
579 |
if (Verbose && PrintGCDetails) { |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
580 |
gclog_or_tty->print(" :: Collection attempt not safe :: "); |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
581 |
} |
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
582 |
gch->set_incremental_collection_failed(); // Slight lie: we did not even attempt one |
1 | 583 |
return; |
584 |
} |
|
585 |
assert(to()->is_empty(), "Else not collection_attempt_is_safe"); |
|
586 |
||
587 |
init_assuming_no_promotion_failure(); |
|
588 |
||
25350
6423a57e5451
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
24487
diff
changeset
|
589 |
GCTraceTime t1(GCCauseString("GC", gch->gc_cause()), PrintGC && !PrintGCDetails, true, NULL, gc_tracer.gc_id()); |
1 | 590 |
// Capture heap used before collection (for printing). |
591 |
size_t gch_prev_used = gch->used(); |
|
592 |
||
18025 | 593 |
gch->trace_heap_before_gc(&gc_tracer); |
594 |
||
1 | 595 |
// These can be shared for all code paths |
596 |
IsAliveClosure is_alive(this); |
|
597 |
ScanWeakRefClosure scan_weak_ref(this); |
|
598 |
||
599 |
age_table()->clear(); |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
600 |
to()->clear(SpaceDecorator::Mangle); |
1 | 601 |
|
602 |
gch->rem_set()->prepare_for_younger_refs_iterate(false); |
|
603 |
||
604 |
assert(gch->no_allocs_since_save_marks(0), |
|
605 |
"save marks have not been newly set."); |
|
606 |
||
607 |
// Not very pretty. |
|
608 |
CollectorPolicy* cp = gch->collector_policy(); |
|
609 |
||
610 |
FastScanClosure fsc_with_no_gc_barrier(this, false); |
|
611 |
FastScanClosure fsc_with_gc_barrier(this, true); |
|
612 |
||
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
613 |
KlassScanClosure klass_scan_closure(&fsc_with_no_gc_barrier, |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
614 |
gch->rem_set()->klass_rem_set()); |
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
615 |
CLDToKlassAndOopClosure cld_scan_closure(&klass_scan_closure, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
616 |
&fsc_with_no_gc_barrier, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
617 |
false); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
618 |
|
1 | 619 |
set_promo_failure_scan_stack_closure(&fsc_with_no_gc_barrier); |
620 |
FastEvacuateFollowersClosure evacuate_followers(gch, _level, this, |
|
621 |
&fsc_with_no_gc_barrier, |
|
622 |
&fsc_with_gc_barrier); |
|
623 |
||
624 |
assert(gch->no_allocs_since_save_marks(0), |
|
625 |
"save marks have not been newly set."); |
|
626 |
||
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
627 |
gch->gen_process_roots(_level, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
628 |
true, // Process younger gens, if any, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
629 |
// as strong roots. |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
630 |
true, // activate StrongRootsScope |
29693
fac175f7a466
8075210: Refactor strong root processing in order to allow G1 to evolve separately from GenCollectedHeap
mgerdin
parents:
29687
diff
changeset
|
631 |
GenCollectedHeap::SO_ScavengeCodeCache, |
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
632 |
GenCollectedHeap::StrongAndWeakRoots, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
633 |
&fsc_with_no_gc_barrier, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
634 |
&fsc_with_gc_barrier, |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
635 |
&cld_scan_closure); |
1 | 636 |
|
637 |
// "evacuate followers". |
|
638 |
evacuate_followers.do_void(); |
|
639 |
||
640 |
FastKeepAliveClosure keep_alive(this, &scan_weak_ref); |
|
1606
dcf9714addbe
6684579: SoftReference processing can be made more efficient
ysr
parents:
1388
diff
changeset
|
641 |
ReferenceProcessor* rp = ref_processor(); |
1610
5dddd195cc86
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
1606
diff
changeset
|
642 |
rp->setup_policy(clear_all_soft_refs); |
18025 | 643 |
const ReferenceProcessorStats& stats = |
1606
dcf9714addbe
6684579: SoftReference processing can be made more efficient
ysr
parents:
1388
diff
changeset
|
644 |
rp->process_discovered_references(&is_alive, &keep_alive, &evacuate_followers, |
25350
6423a57e5451
8043607: Add a GC id as a log decoration similar to PrintGCTimeStamps
brutisso
parents:
24487
diff
changeset
|
645 |
NULL, _gc_timer, gc_tracer.gc_id()); |
18025 | 646 |
gc_tracer.report_gc_reference_stats(stats); |
647 |
||
648 |
if (!_promotion_failed) { |
|
1 | 649 |
// Swap the survivor spaces. |
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
650 |
eden()->clear(SpaceDecorator::Mangle); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
651 |
from()->clear(SpaceDecorator::Mangle); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
652 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
653 |
// This is now done here because of the piece-meal mangling which |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
654 |
// can check for valid mangling at intermediate points in the |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
655 |
// collection(s). When a minor collection fails to collect |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
656 |
// sufficient space resizing of the young generation can occur |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
657 |
// an redistribute the spaces in the young generation. Mangle |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
658 |
// here so that unzapped regions don't get distributed to |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
659 |
// other spaces. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
660 |
to()->mangle_unused_area(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
661 |
} |
1 | 662 |
swap_spaces(); |
663 |
||
664 |
assert(to()->is_empty(), "to space should be empty now"); |
|
665 |
||
15215
048f775ae371
8005972: ParNew should not update the tenuring threshold when promotion failed has occurred
brutisso
parents:
14583
diff
changeset
|
666 |
adjust_desired_tenuring_threshold(); |
1 | 667 |
|
5343
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4574
diff
changeset
|
668 |
// A successful scavenge should restart the GC time limit count which is |
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4574
diff
changeset
|
669 |
// for full GC's. |
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4574
diff
changeset
|
670 |
AdaptiveSizePolicy* size_policy = gch->gen_policy()->size_policy(); |
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4574
diff
changeset
|
671 |
size_policy->reset_gc_overhead_limit_count(); |
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
672 |
assert(!gch->incremental_collection_failed(), "Should be clear"); |
1 | 673 |
} else { |
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
674 |
assert(_promo_failure_scan_stack.is_empty(), "post condition"); |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
675 |
_promo_failure_scan_stack.clear(true); // Clear cached segments. |
1 | 676 |
|
677 |
remove_forwarding_pointers(); |
|
678 |
if (PrintGCDetails) { |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
3908
diff
changeset
|
679 |
gclog_or_tty->print(" (promotion failed) "); |
1 | 680 |
} |
681 |
// Add to-space to the list of space to compact |
|
682 |
// when a promotion failure has occurred. In that |
|
683 |
// case there can be live objects in to-space |
|
684 |
// as a result of a partial evacuation of eden |
|
685 |
// and from-space. |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
686 |
swap_spaces(); // For uniformity wrt ParNewGeneration. |
1 | 687 |
from()->set_next_compaction_space(to()); |
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
688 |
gch->set_incremental_collection_failed(); |
1 | 689 |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
3908
diff
changeset
|
690 |
// Inform the next generation that a promotion failure occurred. |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
691 |
_old_gen->promotion_failure_occurred(); |
18025 | 692 |
gc_tracer.report_promotion_failed(_promotion_failed_info); |
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
3908
diff
changeset
|
693 |
|
1 | 694 |
// Reset the PromotionFailureALot counters. |
695 |
NOT_PRODUCT(Universe::heap()->reset_promotion_should_fail();) |
|
696 |
} |
|
22204
eef85c68cec0
8027440: DefNew does not log heap change information when a promotion failure occurs
brutisso
parents:
21767
diff
changeset
|
697 |
if (PrintGC && !PrintGCDetails) { |
eef85c68cec0
8027440: DefNew does not log heap change information when a promotion failure occurs
brutisso
parents:
21767
diff
changeset
|
698 |
gch->print_heap_change(gch_prev_used); |
eef85c68cec0
8027440: DefNew does not log heap change information when a promotion failure occurs
brutisso
parents:
21767
diff
changeset
|
699 |
} |
1 | 700 |
// set new iteration safe limit for the survivor spaces |
701 |
from()->set_concurrent_iteration_safe_limit(from()->top()); |
|
702 |
to()->set_concurrent_iteration_safe_limit(to()->top()); |
|
11755 | 703 |
|
18025 | 704 |
// We need to use a monotonically non-decreasing time in ms |
11755 | 705 |
// or we will see time-warp warnings and os::javaTimeMillis() |
706 |
// does not guarantee monotonicity. |
|
707 |
jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; |
|
708 |
update_time_of_last_gc(now); |
|
18025 | 709 |
|
710 |
gch->trace_heap_after_gc(&gc_tracer); |
|
711 |
gc_tracer.report_tenuring_threshold(tenuring_threshold()); |
|
712 |
||
21767
41eaa9a17059
8028128: Add a type safe alternative for working with counter based data
mgronlun
parents:
21561
diff
changeset
|
713 |
_gc_timer->register_gc_end(); |
18025 | 714 |
|
715 |
gc_tracer.report_gc_end(_gc_timer->gc_end(), _gc_timer->time_partitions()); |
|
1 | 716 |
} |
717 |
||
718 |
class RemoveForwardPointerClosure: public ObjectClosure { |
|
719 |
public: |
|
720 |
void do_object(oop obj) { |
|
721 |
obj->init_mark(); |
|
722 |
} |
|
723 |
}; |
|
724 |
||
725 |
void DefNewGeneration::init_assuming_no_promotion_failure() { |
|
726 |
_promotion_failed = false; |
|
18025 | 727 |
_promotion_failed_info.reset(); |
1 | 728 |
from()->set_next_compaction_space(NULL); |
729 |
} |
|
730 |
||
731 |
void DefNewGeneration::remove_forwarding_pointers() { |
|
732 |
RemoveForwardPointerClosure rspc; |
|
733 |
eden()->object_iterate(&rspc); |
|
734 |
from()->object_iterate(&rspc); |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
735 |
|
1 | 736 |
// Now restore saved marks, if any. |
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
737 |
assert(_objs_with_preserved_marks.size() == _preserved_marks_of_objs.size(), |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
738 |
"should be the same"); |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
739 |
while (!_objs_with_preserved_marks.is_empty()) { |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
740 |
oop obj = _objs_with_preserved_marks.pop(); |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
741 |
markOop m = _preserved_marks_of_objs.pop(); |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
742 |
obj->set_mark(m); |
1 | 743 |
} |
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
744 |
_objs_with_preserved_marks.clear(true); |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
745 |
_preserved_marks_of_objs.clear(true); |
1 | 746 |
} |
747 |
||
7658
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
748 |
void DefNewGeneration::preserve_mark(oop obj, markOop m) { |
18025 | 749 |
assert(_promotion_failed && m->must_be_preserved_for_promotion_failure(obj), |
7658
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
750 |
"Oversaving!"); |
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
751 |
_objs_with_preserved_marks.push(obj); |
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
752 |
_preserved_marks_of_objs.push(m); |
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
753 |
} |
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
754 |
|
1 | 755 |
void DefNewGeneration::preserve_mark_if_necessary(oop obj, markOop m) { |
756 |
if (m->must_be_preserved_for_promotion_failure(obj)) { |
|
7658
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
757 |
preserve_mark(obj, m); |
1 | 758 |
} |
759 |
} |
|
760 |
||
761 |
void DefNewGeneration::handle_promotion_failure(oop old) { |
|
7658
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
762 |
if (PrintPromotionFailure && !_promotion_failed) { |
24092
e274d864545a
8039743: Use correct format specifier to print size_t values and pointers in the GC code
stefank
parents:
22882
diff
changeset
|
763 |
gclog_or_tty->print(" (promotion failure size = %d) ", |
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
3908
diff
changeset
|
764 |
old->size()); |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
3908
diff
changeset
|
765 |
} |
7658
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
766 |
_promotion_failed = true; |
18025 | 767 |
_promotion_failed_info.register_copy_failure(old->size()); |
7658
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
768 |
preserve_mark_if_necessary(old, old->mark()); |
1 | 769 |
// forward to self |
770 |
old->forward_to(old); |
|
771 |
||
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
772 |
_promo_failure_scan_stack.push(old); |
1 | 773 |
|
774 |
if (!_promo_failure_drain_in_progress) { |
|
775 |
// prevent recursion in copy_to_survivor_space() |
|
776 |
_promo_failure_drain_in_progress = true; |
|
777 |
drain_promo_failure_scan_stack(); |
|
778 |
_promo_failure_drain_in_progress = false; |
|
779 |
} |
|
780 |
} |
|
781 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
782 |
oop DefNewGeneration::copy_to_survivor_space(oop old) { |
1 | 783 |
assert(is_in_reserved(old) && !old->is_forwarded(), |
784 |
"shouldn't be scavenging this oop"); |
|
785 |
size_t s = old->size(); |
|
786 |
oop obj = NULL; |
|
787 |
||
788 |
// Try allocating obj in to-space (unless too old) |
|
789 |
if (old->age() < tenuring_threshold()) { |
|
25905
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25492
diff
changeset
|
790 |
obj = (oop) to()->allocate_aligned(s); |
1 | 791 |
} |
792 |
||
793 |
// Otherwise try allocating obj tenured |
|
794 |
if (obj == NULL) { |
|
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
795 |
obj = _old_gen->promote(old, s); |
1 | 796 |
if (obj == NULL) { |
797 |
handle_promotion_failure(old); |
|
798 |
return old; |
|
799 |
} |
|
800 |
} else { |
|
801 |
// Prefetch beyond obj |
|
802 |
const intx interval = PrefetchCopyIntervalInBytes; |
|
803 |
Prefetch::write(obj, interval); |
|
804 |
||
805 |
// Copy obj |
|
806 |
Copy::aligned_disjoint_words((HeapWord*)old, (HeapWord*)obj, s); |
|
807 |
||
808 |
// Increment age if obj still in new generation |
|
809 |
obj->incr_age(); |
|
810 |
age_table()->add(obj, s); |
|
811 |
} |
|
812 |
||
813 |
// Done, insert forward pointer to obj in this header |
|
814 |
old->forward_to(obj); |
|
815 |
||
816 |
return obj; |
|
817 |
} |
|
818 |
||
819 |
void DefNewGeneration::drain_promo_failure_scan_stack() { |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
820 |
while (!_promo_failure_scan_stack.is_empty()) { |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
821 |
oop obj = _promo_failure_scan_stack.pop(); |
1 | 822 |
obj->oop_iterate(_promo_failure_scan_stack_closure); |
823 |
} |
|
824 |
} |
|
825 |
||
826 |
void DefNewGeneration::save_marks() { |
|
827 |
eden()->set_saved_mark(); |
|
828 |
to()->set_saved_mark(); |
|
829 |
from()->set_saved_mark(); |
|
830 |
} |
|
831 |
||
832 |
||
833 |
void DefNewGeneration::reset_saved_marks() { |
|
834 |
eden()->reset_saved_mark(); |
|
835 |
to()->reset_saved_mark(); |
|
836 |
from()->reset_saved_mark(); |
|
837 |
} |
|
838 |
||
839 |
||
840 |
bool DefNewGeneration::no_allocs_since_save_marks() { |
|
841 |
assert(eden()->saved_mark_at_top(), "Violated spec - alloc in eden"); |
|
842 |
assert(from()->saved_mark_at_top(), "Violated spec - alloc in from"); |
|
843 |
return to()->saved_mark_at_top(); |
|
844 |
} |
|
845 |
||
846 |
#define DefNew_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \ |
|
847 |
\ |
|
848 |
void DefNewGeneration:: \ |
|
849 |
oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl) { \ |
|
850 |
cl->set_generation(this); \ |
|
851 |
eden()->oop_since_save_marks_iterate##nv_suffix(cl); \ |
|
852 |
to()->oop_since_save_marks_iterate##nv_suffix(cl); \ |
|
853 |
from()->oop_since_save_marks_iterate##nv_suffix(cl); \ |
|
854 |
cl->reset_generation(); \ |
|
855 |
save_marks(); \ |
|
856 |
} |
|
857 |
||
858 |
ALL_SINCE_SAVE_MARKS_CLOSURES(DefNew_SINCE_SAVE_MARKS_DEFN) |
|
859 |
||
860 |
#undef DefNew_SINCE_SAVE_MARKS_DEFN |
|
861 |
||
862 |
void DefNewGeneration::contribute_scratch(ScratchBlock*& list, Generation* requestor, |
|
863 |
size_t max_alloc_words) { |
|
864 |
if (requestor == this || _promotion_failed) return; |
|
865 |
assert(requestor->level() > level(), "DefNewGeneration must be youngest"); |
|
866 |
||
867 |
/* $$$ Assert this? "trace" is a "MarkSweep" function so that's not appropriate. |
|
868 |
if (to_space->top() > to_space->bottom()) { |
|
869 |
trace("to_space not empty when contribute_scratch called"); |
|
870 |
} |
|
871 |
*/ |
|
872 |
||
873 |
ContiguousSpace* to_space = to(); |
|
874 |
assert(to_space->end() >= to_space->top(), "pointers out of order"); |
|
875 |
size_t free_words = pointer_delta(to_space->end(), to_space->top()); |
|
876 |
if (free_words >= MinFreeScratchWords) { |
|
877 |
ScratchBlock* sb = (ScratchBlock*)to_space->top(); |
|
878 |
sb->num_words = free_words; |
|
879 |
sb->next = list; |
|
880 |
list = sb; |
|
881 |
} |
|
882 |
} |
|
883 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
884 |
void DefNewGeneration::reset_scratch() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
885 |
// If contributing scratch in to_space, mangle all of |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
886 |
// to_space if ZapUnusedHeapArea. This is needed because |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
887 |
// top is not maintained while using to-space as scratch. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
888 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
889 |
to()->mangle_unused_area_complete(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
890 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
891 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
892 |
|
1 | 893 |
bool DefNewGeneration::collection_attempt_is_safe() { |
894 |
if (!to()->is_empty()) { |
|
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
895 |
if (Verbose && PrintGCDetails) { |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
896 |
gclog_or_tty->print(" :: to is not empty :: "); |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
897 |
} |
1 | 898 |
return false; |
899 |
} |
|
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
900 |
if (_old_gen == NULL) { |
1 | 901 |
GenCollectedHeap* gch = GenCollectedHeap::heap(); |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
902 |
_old_gen = gch->old_gen(); |
1 | 903 |
} |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
904 |
return _old_gen->promotion_attempt_is_safe(used()); |
1 | 905 |
} |
906 |
||
907 |
void DefNewGeneration::gc_epilogue(bool full) { |
|
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
908 |
DEBUG_ONLY(static bool seen_incremental_collection_failed = false;) |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
909 |
|
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
910 |
assert(!GC_locker::is_active(), "We should not be executing here"); |
1 | 911 |
// Check if the heap is approaching full after a collection has |
912 |
// been done. Generally the young generation is empty at |
|
913 |
// a minimum at the end of a collection. If it is not, then |
|
914 |
// the heap is approaching full. |
|
915 |
GenCollectedHeap* gch = GenCollectedHeap::heap(); |
|
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
916 |
if (full) { |
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
917 |
DEBUG_ONLY(seen_incremental_collection_failed = false;) |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
918 |
if (!collection_attempt_is_safe() && !_eden_space->is_empty()) { |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
919 |
if (Verbose && PrintGCDetails) { |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
920 |
gclog_or_tty->print("DefNewEpilogue: cause(%s), full, not safe, set_failed, set_alloc_from, clear_seen", |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
921 |
GCCause::to_string(gch->gc_cause())); |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
922 |
} |
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
923 |
gch->set_incremental_collection_failed(); // Slight lie: a full gc left us in that state |
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
924 |
set_should_allocate_from_space(); // we seem to be running out of space |
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
925 |
} else { |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
926 |
if (Verbose && PrintGCDetails) { |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
927 |
gclog_or_tty->print("DefNewEpilogue: cause(%s), full, safe, clear_failed, clear_alloc_from, clear_seen", |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
928 |
GCCause::to_string(gch->gc_cause())); |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
929 |
} |
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
930 |
gch->clear_incremental_collection_failed(); // We just did a full collection |
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
931 |
clear_should_allocate_from_space(); // if set |
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
932 |
} |
1 | 933 |
} else { |
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
934 |
#ifdef ASSERT |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
935 |
// It is possible that incremental_collection_failed() == true |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
936 |
// here, because an attempted scavenge did not succeed. The policy |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
937 |
// is normally expected to cause a full collection which should |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
938 |
// clear that condition, so we should not be here twice in a row |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
939 |
// with incremental_collection_failed() == true without having done |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
940 |
// a full collection in between. |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
941 |
if (!seen_incremental_collection_failed && |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
942 |
gch->incremental_collection_failed()) { |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
943 |
if (Verbose && PrintGCDetails) { |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
944 |
gclog_or_tty->print("DefNewEpilogue: cause(%s), not full, not_seen_failed, failed, set_seen_failed", |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
945 |
GCCause::to_string(gch->gc_cause())); |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
946 |
} |
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
947 |
seen_incremental_collection_failed = true; |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
948 |
} else if (seen_incremental_collection_failed) { |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
949 |
if (Verbose && PrintGCDetails) { |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
950 |
gclog_or_tty->print("DefNewEpilogue: cause(%s), not full, seen_failed, will_clear_seen_failed", |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
951 |
GCCause::to_string(gch->gc_cause())); |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
952 |
} |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
953 |
assert(gch->gc_cause() == GCCause::_scavenge_alot || |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
954 |
(gch->gc_cause() == GCCause::_java_lang_system_gc && UseConcMarkSweepGC && ExplicitGCInvokesConcurrent) || |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
955 |
!gch->incremental_collection_failed(), |
7378
fe845b64d7fb
6998802: ScavengeALot: assert(!gch->incremental_collection_failed()) failed: Twice in a row
ysr
parents:
6986
diff
changeset
|
956 |
"Twice in a row"); |
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
957 |
seen_incremental_collection_failed = false; |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
958 |
} |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
959 |
#endif // ASSERT |
1 | 960 |
} |
961 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
962 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
963 |
eden()->check_mangled_unused_area_complete(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
964 |
from()->check_mangled_unused_area_complete(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
965 |
to()->check_mangled_unused_area_complete(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
966 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
967 |
|
10022
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
7658
diff
changeset
|
968 |
if (!CleanChunkPoolAsync) { |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
7658
diff
changeset
|
969 |
Chunk::clean_chunk_pool(); |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
7658
diff
changeset
|
970 |
} |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
7658
diff
changeset
|
971 |
|
1 | 972 |
// update the generation and space performance counters |
973 |
update_counters(); |
|
974 |
gch->collector_policy()->counters()->update_counters(); |
|
975 |
} |
|
976 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
977 |
void DefNewGeneration::record_spaces_top() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
978 |
assert(ZapUnusedHeapArea, "Not mangling unused space"); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
979 |
eden()->set_top_for_allocations(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
980 |
to()->set_top_for_allocations(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
981 |
from()->set_top_for_allocations(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
982 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
983 |
|
18025 | 984 |
void DefNewGeneration::ref_processor_init() { |
985 |
Generation::ref_processor_init(); |
|
986 |
} |
|
987 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
988 |
|
1 | 989 |
void DefNewGeneration::update_counters() { |
990 |
if (UsePerfData) { |
|
991 |
_eden_counters->update_all(); |
|
992 |
_from_counters->update_all(); |
|
993 |
_to_counters->update_all(); |
|
994 |
_gen_counters->update_all(); |
|
995 |
} |
|
996 |
} |
|
997 |
||
12379 | 998 |
void DefNewGeneration::verify() { |
999 |
eden()->verify(); |
|
1000 |
from()->verify(); |
|
1001 |
to()->verify(); |
|
1 | 1002 |
} |
1003 |
||
1004 |
void DefNewGeneration::print_on(outputStream* st) const { |
|
1005 |
Generation::print_on(st); |
|
1006 |
st->print(" eden"); |
|
1007 |
eden()->print_on(st); |
|
1008 |
st->print(" from"); |
|
1009 |
from()->print_on(st); |
|
1010 |
st->print(" to "); |
|
1011 |
to()->print_on(st); |
|
1012 |
} |
|
1013 |
||
1014 |
||
1015 |
const char* DefNewGeneration::name() const { |
|
1016 |
return "def new generation"; |
|
1017 |
} |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1018 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1019 |
// Moved from inline file as they are not called inline |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1020 |
CompactibleSpace* DefNewGeneration::first_compaction_space() const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1021 |
return eden(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1022 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1023 |
|
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
1024 |
HeapWord* DefNewGeneration::allocate(size_t word_size, bool is_tlab) { |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1025 |
// This is the slow-path allocation for the DefNewGeneration. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1026 |
// Most allocations are fast-path in compiled code. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1027 |
// We try to allocate from the eden. If that works, we are happy. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1028 |
// Note that since DefNewGeneration supports lock-free allocation, we |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1029 |
// have to use it here, as well. |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1030 |
HeapWord* result = eden()->par_allocate(word_size); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1031 |
if (result != NULL) { |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
1032 |
if (CMSEdenChunksRecordAlways && _old_gen != NULL) { |
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
1033 |
_old_gen->sample_eden_chunk(); |
18994
d32a17b7502c
6990419: CMS Remaining work for 6572569: consistently skewed work distribution in (long) re-mark pauses
jmasa
parents:
18687
diff
changeset
|
1034 |
} |
27625 | 1035 |
} else { |
1036 |
// If the eden is full and the last collection bailed out, we are running |
|
1037 |
// out of heap space, and we try to allocate the from-space, too. |
|
1038 |
// allocate_from_space can't be inlined because that would introduce a |
|
1039 |
// circular dependency at compile time. |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1040 |
result = allocate_from_space(word_size); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1041 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1042 |
return result; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1043 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1044 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1045 |
HeapWord* DefNewGeneration::par_allocate(size_t word_size, |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1046 |
bool is_tlab) { |
18994
d32a17b7502c
6990419: CMS Remaining work for 6572569: consistently skewed work distribution in (long) re-mark pauses
jmasa
parents:
18687
diff
changeset
|
1047 |
HeapWord* res = eden()->par_allocate(word_size); |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
1048 |
if (CMSEdenChunksRecordAlways && _old_gen != NULL) { |
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
1049 |
_old_gen->sample_eden_chunk(); |
18994
d32a17b7502c
6990419: CMS Remaining work for 6572569: consistently skewed work distribution in (long) re-mark pauses
jmasa
parents:
18687
diff
changeset
|
1050 |
} |
d32a17b7502c
6990419: CMS Remaining work for 6572569: consistently skewed work distribution in (long) re-mark pauses
jmasa
parents:
18687
diff
changeset
|
1051 |
return res; |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1052 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1053 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1054 |
size_t DefNewGeneration::tlab_capacity() const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1055 |
return eden()->capacity(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1056 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1057 |
|
22552 | 1058 |
size_t DefNewGeneration::tlab_used() const { |
1059 |
return eden()->used(); |
|
1060 |
} |
|
1061 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1062 |
size_t DefNewGeneration::unsafe_max_tlab_alloc() const { |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1063 |
return unsafe_max_alloc_nogc(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
1064 |
} |