author | stefank |
Tue, 26 Nov 2019 10:47:46 +0100 | |
changeset 59290 | 97d13893ec3c |
parent 59221 | cc3a82fc7bcb |
permissions | -rw-r--r-- |
1 | 1 |
/* |
59053
ba6c248cae19
8232365: Implementation for JEP 363: Remove the Concurrent Mark Sweep (CMS) Garbage Collector
lkorinth
parents:
58980
diff
changeset
|
2 |
* Copyright (c) 2001, 2019, 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" |
30764 | 26 |
#include "gc/serial/defNewGeneration.inline.hpp" |
50034
01a88f825a84
8202641: Replace OOP_SINCE_SAVE_MARKS with templates
stefank
parents:
50033
diff
changeset
|
27 |
#include "gc/serial/serialHeap.inline.hpp" |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
28 |
#include "gc/serial/tenuredGeneration.hpp" |
49048
4e8c86b75428
8198525: Move _size_policy out of GenCollectorPolicy into GenCollectedHeap
stefank
parents:
49047
diff
changeset
|
29 |
#include "gc/shared/adaptiveSizePolicy.hpp" |
35862
411842d0c882
8146395: Add inline qualifier in oop.hpp and fix inlining in gc files
goetz
parents:
35492
diff
changeset
|
30 |
#include "gc/shared/ageTable.inline.hpp" |
33212 | 31 |
#include "gc/shared/cardTableRS.hpp" |
30764 | 32 |
#include "gc/shared/collectorCounters.hpp" |
54678
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
33 |
#include "gc/shared/gcArguments.hpp" |
30764 | 34 |
#include "gc/shared/gcHeapSummary.hpp" |
49594
898ef81cbc0e
8200106: Move NoSafepointVerifier out from gcLocker.hpp
stefank
parents:
49164
diff
changeset
|
35 |
#include "gc/shared/gcLocker.hpp" |
30764 | 36 |
#include "gc/shared/gcPolicyCounters.hpp" |
37 |
#include "gc/shared/gcTimer.hpp" |
|
38 |
#include "gc/shared/gcTrace.hpp" |
|
35061 | 39 |
#include "gc/shared/gcTraceTime.inline.hpp" |
30764 | 40 |
#include "gc/shared/genOopClosures.inline.hpp" |
41 |
#include "gc/shared/generationSpec.hpp" |
|
36202
219f8808c3bd
8146989: Introduce per-worker preserved mark stacks in ParNew
tonyp
parents:
35862
diff
changeset
|
42 |
#include "gc/shared/preservedMarks.inline.hpp" |
30764 | 43 |
#include "gc/shared/referencePolicy.hpp" |
50605
7f63c74f0974
8202845: Refactor reference processing for improved parallelism
tschatzl
parents:
50396
diff
changeset
|
44 |
#include "gc/shared/referenceProcessorPhaseTimes.hpp" |
30764 | 45 |
#include "gc/shared/space.inline.hpp" |
58980 | 46 |
#include "gc/shared/spaceDecorator.inline.hpp" |
30868
c1b24f26deed
8080110: Remove usage of CollectedHeap::n_par_threads() from root processing
stefank
parents:
30764
diff
changeset
|
47 |
#include "gc/shared/strongRootsScope.hpp" |
47648
226b1fc611b9
8189359: Move native weak oops cleaning out of ReferenceProcessor
stefank
parents:
47622
diff
changeset
|
48 |
#include "gc/shared/weakProcessor.hpp" |
35061 | 49 |
#include "logging/log.hpp" |
50752 | 50 |
#include "memory/iterator.inline.hpp" |
37248 | 51 |
#include "memory/resourceArea.hpp" |
7397 | 52 |
#include "oops/instanceRefKlass.hpp" |
53 |
#include "oops/oop.inline.hpp" |
|
54 |
#include "runtime/java.hpp" |
|
24487
71ff0bd674eb
8042737: Introduce umbrella header prefetch.inline.hpp
goetz
parents:
24424
diff
changeset
|
55 |
#include "runtime/prefetch.inline.hpp" |
14583
d70ee55535f4
8003935: Simplify the needed includes for using Thread::current()
stefank
parents:
13728
diff
changeset
|
56 |
#include "runtime/thread.inline.hpp" |
46625 | 57 |
#include "utilities/align.hpp" |
7397 | 58 |
#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
|
59 |
#include "utilities/globalDefinitions.hpp" |
7397 | 60 |
#include "utilities/stack.inline.hpp" |
1 | 61 |
|
62 |
// |
|
63 |
// DefNewGeneration functions. |
|
64 |
||
65 |
// Methods of protected closure types. |
|
66 |
||
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
67 |
DefNewGeneration::IsAliveClosure::IsAliveClosure(Generation* young_gen) : _young_gen(young_gen) { |
59053
ba6c248cae19
8232365: Implementation for JEP 363: Remove the Concurrent Mark Sweep (CMS) Garbage Collector
lkorinth
parents:
58980
diff
changeset
|
68 |
assert(_young_gen->kind() == Generation::DefNew, "Expected the young generation here"); |
1 | 69 |
} |
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
70 |
|
1 | 71 |
bool DefNewGeneration::IsAliveClosure::do_object_b(oop p) { |
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
72 |
return (HeapWord*)p >= _young_gen->reserved().end() || p->is_forwarded(); |
1 | 73 |
} |
74 |
||
75 |
DefNewGeneration::KeepAliveClosure:: |
|
76 |
KeepAliveClosure(ScanWeakRefClosure* cl) : _cl(cl) { |
|
33212 | 77 |
_rs = GenCollectedHeap::heap()->rem_set(); |
1 | 78 |
} |
79 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
80 |
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
|
81 |
void DefNewGeneration::KeepAliveClosure::do_oop(narrowOop* p) { DefNewGeneration::KeepAliveClosure::do_oop_work(p); } |
1 | 82 |
|
83 |
||
84 |
DefNewGeneration::FastKeepAliveClosure:: |
|
85 |
FastKeepAliveClosure(DefNewGeneration* g, ScanWeakRefClosure* cl) : |
|
86 |
DefNewGeneration::KeepAliveClosure(cl) { |
|
87 |
_boundary = g->reserved().end(); |
|
88 |
} |
|
89 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
90 |
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
|
91 |
void DefNewGeneration::FastKeepAliveClosure::do_oop(narrowOop* p) { DefNewGeneration::FastKeepAliveClosure::do_oop_work(p); } |
1 | 92 |
|
93 |
DefNewGeneration::FastEvacuateFollowersClosure:: |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
94 |
FastEvacuateFollowersClosure(SerialHeap* heap, |
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
95 |
FastScanClosure* cur, |
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
96 |
FastScanClosure* older) : |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
97 |
_heap(heap), _scan_cur_or_nonheap(cur), _scan_older(older) |
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
98 |
{ |
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
99 |
} |
1 | 100 |
|
101 |
void DefNewGeneration::FastEvacuateFollowersClosure::do_void() { |
|
102 |
do { |
|
50034
01a88f825a84
8202641: Replace OOP_SINCE_SAVE_MARKS with templates
stefank
parents:
50033
diff
changeset
|
103 |
_heap->oop_since_save_marks_iterate(_scan_cur_or_nonheap, _scan_older); |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
104 |
} while (!_heap->no_allocs_since_save_marks()); |
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
105 |
guarantee(_heap->young_gen()->promo_failure_scan_is_complete(), "Failed to finish scan"); |
1 | 106 |
} |
107 |
||
108 |
ScanClosure::ScanClosure(DefNewGeneration* g, bool gc_barrier) : |
|
47580 | 109 |
OopsInClassLoaderDataOrGenClosure(g), _g(g), _gc_barrier(gc_barrier) |
1 | 110 |
{ |
111 |
_boundary = _g->reserved().end(); |
|
112 |
} |
|
113 |
||
114 |
FastScanClosure::FastScanClosure(DefNewGeneration* g, bool gc_barrier) : |
|
47580 | 115 |
OopsInClassLoaderDataOrGenClosure(g), _g(g), _gc_barrier(gc_barrier) |
1 | 116 |
{ |
117 |
_boundary = _g->reserved().end(); |
|
118 |
} |
|
119 |
||
47580 | 120 |
void CLDScanClosure::do_cld(ClassLoaderData* cld) { |
35061 | 121 |
NOT_PRODUCT(ResourceMark rm); |
47580 | 122 |
log_develop_trace(gc, scavenge)("CLDScanClosure::do_cld " PTR_FORMAT ", %s, dirty: %s", |
123 |
p2i(cld), |
|
50634
c349d409262a
8202605: Standardize on ClassLoaderData::loader_name() throughout the VM to obtain a class loader's name
lfoltan
parents:
50605
diff
changeset
|
124 |
cld->loader_name_and_id(), |
47580 | 125 |
cld->has_modified_oops() ? "true" : "false"); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
126 |
|
47580 | 127 |
// If the cld has not been dirtied we know that there's |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
128 |
// no references into the young gen and we can skip it. |
47580 | 129 |
if (cld->has_modified_oops()) { |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
130 |
if (_accumulate_modified_oops) { |
47580 | 131 |
cld->accumulate_modified_oops(); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
132 |
} |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
133 |
|
47580 | 134 |
// Tell the closure which CLD is being scanned so that it can be dirtied |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
135 |
// if oops are left pointing into the young gen. |
47580 | 136 |
_scavenge_closure->set_scanned_cld(cld); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
137 |
|
47580 | 138 |
// Clean the cld since we're going to scavenge all the metadata. |
52141
de6dc206a92b
8210330: Make CLD claiming allow multiple claim bits
eosterlund
parents:
50752
diff
changeset
|
139 |
cld->oops_do(_scavenge_closure, ClassLoaderData::_claim_none, /*clear_modified_oops*/true); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
140 |
|
47580 | 141 |
_scavenge_closure->set_scanned_cld(NULL); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
142 |
} |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
143 |
} |
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
144 |
|
1 | 145 |
ScanWeakRefClosure::ScanWeakRefClosure(DefNewGeneration* g) : |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
146 |
_g(g) |
1 | 147 |
{ |
148 |
_boundary = _g->reserved().end(); |
|
149 |
} |
|
150 |
||
151 |
DefNewGeneration::DefNewGeneration(ReservedSpace rs, |
|
152 |
size_t initial_size, |
|
54678
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
153 |
size_t min_size, |
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
154 |
size_t max_size, |
1 | 155 |
const char* policy) |
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
156 |
: Generation(rs, initial_size), |
36202
219f8808c3bd
8146989: Introduce per-worker preserved mark stacks in ParNew
tonyp
parents:
35862
diff
changeset
|
157 |
_preserved_marks_set(false /* in_c_heap */), |
1 | 158 |
_promo_failure_drain_in_progress(false), |
159 |
_should_allocate_from_space(false) |
|
160 |
{ |
|
161 |
MemRegion cmr((HeapWord*)_virtual_space.low(), |
|
162 |
(HeapWord*)_virtual_space.high()); |
|
30173
13cf7580b000
8077413: Avoid use of Universe::heap() inside collectors
pliden
parents:
30155
diff
changeset
|
163 |
GenCollectedHeap* gch = GenCollectedHeap::heap(); |
13cf7580b000
8077413: Avoid use of Universe::heap() inside collectors
pliden
parents:
30155
diff
changeset
|
164 |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49050
diff
changeset
|
165 |
gch->rem_set()->resize_covered_region(cmr); |
1 | 166 |
|
27625 | 167 |
_eden_space = new ContiguousSpace(); |
1 | 168 |
_from_space = new ContiguousSpace(); |
169 |
_to_space = new ContiguousSpace(); |
|
170 |
||
32623
390a27af5657
8134626: Misc cleanups after generation array removal
jwilhelm
parents:
31964
diff
changeset
|
171 |
if (_eden_space == NULL || _from_space == NULL || _to_space == NULL) { |
1 | 172 |
vm_exit_during_initialization("Could not allocate a new gen space"); |
32623
390a27af5657
8134626: Misc cleanups after generation array removal
jwilhelm
parents:
31964
diff
changeset
|
173 |
} |
1 | 174 |
|
175 |
// Compute the maximum eden and survivor space sizes. These sizes |
|
176 |
// are computed assuming the entire reserved space is committed. |
|
177 |
// These values are exported as performance counters. |
|
178 |
uintx size = _virtual_space.reserved_size(); |
|
54678
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
179 |
_max_survivor_size = compute_survivor_size(size, SpaceAlignment); |
1 | 180 |
_max_eden_size = size - (2*_max_survivor_size); |
181 |
||
182 |
// allocate the performance counters |
|
183 |
||
184 |
// 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
|
185 |
_gen_counters = new GenerationCounters("new", 0, 3, |
54678
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
186 |
min_size, max_size, &_virtual_space); |
1 | 187 |
_gc_counters = new CollectorCounters(policy, 0); |
188 |
||
189 |
_eden_counters = new CSpaceCounters("eden", 0, _max_eden_size, _eden_space, |
|
190 |
_gen_counters); |
|
191 |
_from_counters = new CSpaceCounters("s0", 1, _max_survivor_size, _from_space, |
|
192 |
_gen_counters); |
|
193 |
_to_counters = new CSpaceCounters("s1", 2, _max_survivor_size, _to_space, |
|
194 |
_gen_counters); |
|
195 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
196 |
compute_space_boundaries(0, SpaceDecorator::Clear, SpaceDecorator::Mangle); |
1 | 197 |
update_counters(); |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
198 |
_old_gen = NULL; |
1 | 199 |
_tenuring_threshold = MaxTenuringThreshold; |
200 |
_pretenure_size_threshold_words = PretenureSizeThreshold >> LogHeapWordSize; |
|
18025 | 201 |
|
202 |
_gc_timer = new (ResourceObj::C_HEAP, mtGC) STWGCTimer(); |
|
1 | 203 |
} |
204 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
205 |
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
|
206 |
bool clear_space, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
207 |
bool mangle_space) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
208 |
// 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
|
209 |
// 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
|
210 |
// 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
|
211 |
// so check. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
212 |
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
|
213 |
"Initialization of the survivor spaces assumes these are empty"); |
1 | 214 |
|
215 |
// Compute sizes |
|
216 |
uintx size = _virtual_space.committed_size(); |
|
54678
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
217 |
uintx survivor_size = compute_survivor_size(size, SpaceAlignment); |
1 | 218 |
uintx eden_size = size - (2*survivor_size); |
219 |
assert(eden_size > 0 && survivor_size <= eden_size, "just checking"); |
|
220 |
||
221 |
if (eden_size < minimum_eden_size) { |
|
222 |
// May happen due to 64Kb rounding, if so adjust eden size back up |
|
54678
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
223 |
minimum_eden_size = align_up(minimum_eden_size, SpaceAlignment); |
1 | 224 |
uintx maximum_survivor_size = (size - minimum_eden_size) / 2; |
225 |
uintx unaligned_survivor_size = |
|
54678
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
226 |
align_down(maximum_survivor_size, SpaceAlignment); |
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
227 |
survivor_size = MAX2(unaligned_survivor_size, SpaceAlignment); |
1 | 228 |
eden_size = size - (2*survivor_size); |
229 |
assert(eden_size > 0 && survivor_size <= eden_size, "just checking"); |
|
230 |
assert(eden_size >= minimum_eden_size, "just checking"); |
|
231 |
} |
|
232 |
||
233 |
char *eden_start = _virtual_space.low(); |
|
234 |
char *from_start = eden_start + eden_size; |
|
235 |
char *to_start = from_start + survivor_size; |
|
236 |
char *to_end = to_start + survivor_size; |
|
237 |
||
238 |
assert(to_end == _virtual_space.high(), "just checking"); |
|
46618
d503911aa948
8178489: Make align functions more type safe and consistent
stefank
parents:
41682
diff
changeset
|
239 |
assert(Space::is_aligned(eden_start), "checking alignment"); |
d503911aa948
8178489: Make align functions more type safe and consistent
stefank
parents:
41682
diff
changeset
|
240 |
assert(Space::is_aligned(from_start), "checking alignment"); |
d503911aa948
8178489: Make align functions more type safe and consistent
stefank
parents:
41682
diff
changeset
|
241 |
assert(Space::is_aligned(to_start), "checking alignment"); |
1 | 242 |
|
243 |
MemRegion edenMR((HeapWord*)eden_start, (HeapWord*)from_start); |
|
244 |
MemRegion fromMR((HeapWord*)from_start, (HeapWord*)to_start); |
|
245 |
MemRegion toMR ((HeapWord*)to_start, (HeapWord*)to_end); |
|
246 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
247 |
// 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
|
248 |
// 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
|
249 |
// newly formed eden. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
250 |
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
|
251 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
252 |
// 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
|
253 |
// the space are already mangled. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
254 |
if (!clear_space) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
255 |
// 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
|
256 |
// 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
|
257 |
// 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
|
258 |
// is not properly mangled. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
259 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
260 |
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
|
261 |
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
|
262 |
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
|
263 |
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
|
264 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
265 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
266 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
267 |
// 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
|
268 |
eden()->initialize(edenMR, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
269 |
clear_space && !live_in_eden, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
270 |
SpaceDecorator::Mangle); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
271 |
// If clear_space and live_in_eden, we will not have cleared any |
1 | 272 |
// portion of eden above its top. This can cause newly |
273 |
// expanded space not to be mangled if using ZapUnusedHeapArea. |
|
274 |
// 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
|
275 |
if (ZapUnusedHeapArea && clear_space && live_in_eden && mangle_space) { |
1 | 276 |
eden()->mangle_unused_area(); |
277 |
} |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
278 |
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
|
279 |
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
|
280 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
281 |
// Set next compaction spaces. |
1 | 282 |
eden()->set_next_compaction_space(from()); |
283 |
// The to-space is normally empty before a compaction so need |
|
284 |
// not be considered. The exception is during promotion |
|
285 |
// failure handling when to-space can contain live objects. |
|
286 |
from()->set_next_compaction_space(NULL); |
|
287 |
} |
|
288 |
||
289 |
void DefNewGeneration::swap_spaces() { |
|
290 |
ContiguousSpace* s = from(); |
|
291 |
_from_space = to(); |
|
292 |
_to_space = s; |
|
293 |
eden()->set_next_compaction_space(from()); |
|
294 |
// The to-space is normally empty before a compaction so need |
|
295 |
// not be considered. The exception is during promotion |
|
296 |
// failure handling when to-space can contain live objects. |
|
297 |
from()->set_next_compaction_space(NULL); |
|
298 |
||
299 |
if (UsePerfData) { |
|
300 |
CSpaceCounters* c = _from_counters; |
|
301 |
_from_counters = _to_counters; |
|
302 |
_to_counters = c; |
|
303 |
} |
|
304 |
} |
|
305 |
||
306 |
bool DefNewGeneration::expand(size_t bytes) { |
|
307 |
MutexLocker x(ExpandHeap_lock); |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
308 |
HeapWord* prev_high = (HeapWord*) _virtual_space.high(); |
1 | 309 |
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
|
310 |
if (success && ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
311 |
// 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
|
312 |
// 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
|
313 |
// spaces have been computed. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
314 |
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
|
315 |
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
|
316 |
SpaceMangler::mangle_region(mangle_region); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
317 |
} |
1 | 318 |
|
319 |
// Do not attempt an expand-to-the reserve size. The |
|
320 |
// request should properly observe the maximum size of |
|
321 |
// the generation so an expand-to-reserve should be |
|
322 |
// unnecessary. Also a second call to expand-to-reserve |
|
323 |
// value potentially can cause an undue expansion. |
|
324 |
// For example if the first expand fail for unknown reasons, |
|
325 |
// but the second succeeds and expands the heap to its maximum |
|
326 |
// value. |
|
35492
c8c0273e6b91
8146690: Make all classes in GC follow the naming convention.
david
parents:
35471
diff
changeset
|
327 |
if (GCLocker::is_active()) { |
35061 | 328 |
log_debug(gc)("Garbage collection disabled, expanded heap instead"); |
1 | 329 |
} |
330 |
||
331 |
return success; |
|
332 |
} |
|
333 |
||
35458
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
334 |
size_t DefNewGeneration::adjust_for_thread_increase(size_t new_size_candidate, |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
335 |
size_t new_size_before, |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
336 |
size_t alignment) const { |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
337 |
size_t desired_new_size = new_size_before; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
338 |
|
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
339 |
if (NewSizeThreadIncrease > 0) { |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
340 |
int threads_count; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
341 |
size_t thread_increase_size = 0; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
342 |
|
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
343 |
// 1. Check an overflow at 'threads_count * NewSizeThreadIncrease'. |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
344 |
threads_count = Threads::number_of_non_daemon_threads(); |
35471
deb38c83d759
8146695: FinalizeTest04 crashes VM with EXCEPTION_INT_DIVIDE_BY_ZERO
sangheki
parents:
35458
diff
changeset
|
345 |
if (threads_count > 0 && NewSizeThreadIncrease <= max_uintx / threads_count) { |
35458
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
346 |
thread_increase_size = threads_count * NewSizeThreadIncrease; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
347 |
|
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
348 |
// 2. Check an overflow at 'new_size_candidate + thread_increase_size'. |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
349 |
if (new_size_candidate <= max_uintx - thread_increase_size) { |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
350 |
new_size_candidate += thread_increase_size; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
351 |
|
46619
a3919f5e8d2b
8178499: Remove _ptr_ and _size_ infixes from align functions
stefank
parents:
46618
diff
changeset
|
352 |
// 3. Check an overflow at 'align_up'. |
35458
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
353 |
size_t aligned_max = ((max_uintx - alignment) & ~(alignment-1)); |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
354 |
if (new_size_candidate <= aligned_max) { |
46619
a3919f5e8d2b
8178499: Remove _ptr_ and _size_ infixes from align functions
stefank
parents:
46618
diff
changeset
|
355 |
desired_new_size = align_up(new_size_candidate, alignment); |
35458
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
356 |
} |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
357 |
} |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
358 |
} |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
359 |
} |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
360 |
|
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
361 |
return desired_new_size; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
362 |
} |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
363 |
|
1 | 364 |
void DefNewGeneration::compute_new_size() { |
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
365 |
// This is called after a GC that includes the old generation, so from-space |
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
366 |
// will normally be empty. |
1 | 367 |
// Note that we check both spaces, since if scavenge failed they revert roles. |
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
368 |
// If not we bail out (otherwise we would have to relocate the objects). |
1 | 369 |
if (!from()->is_empty() || !to()->is_empty()) { |
370 |
return; |
|
371 |
} |
|
372 |
||
373 |
GenCollectedHeap* gch = GenCollectedHeap::heap(); |
|
374 |
||
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
375 |
size_t old_size = gch->old_gen()->capacity(); |
1 | 376 |
size_t new_size_before = _virtual_space.committed_size(); |
33580 | 377 |
size_t min_new_size = initial_size(); |
1 | 378 |
size_t max_new_size = reserved().byte_size(); |
379 |
assert(min_new_size <= new_size_before && |
|
380 |
new_size_before <= max_new_size, |
|
381 |
"just checking"); |
|
382 |
// All space sizes must be multiples of Generation::GenGrain. |
|
383 |
size_t alignment = Generation::GenGrain; |
|
384 |
||
35458
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
385 |
int threads_count = 0; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
386 |
size_t thread_increase_size = 0; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
387 |
|
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
388 |
size_t new_size_candidate = old_size / NewRatio; |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
389 |
// Compute desired new generation size based on NewRatio and NewSizeThreadIncrease |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
390 |
// and reverts to previous value if any overflow happens |
71a08884be5f
8144527: NewSizeThreadIncrease would make an overflow
sangheki
parents:
35061
diff
changeset
|
391 |
size_t desired_new_size = adjust_for_thread_increase(new_size_candidate, new_size_before, alignment); |
1 | 392 |
|
393 |
// Adjust new generation size |
|
59221
cc3a82fc7bcb
8233702: Introduce helper function to clamp value to range
tschatzl
parents:
59053
diff
changeset
|
394 |
desired_new_size = clamp(desired_new_size, min_new_size, max_new_size); |
1 | 395 |
assert(desired_new_size <= max_new_size, "just checking"); |
396 |
||
397 |
bool changed = false; |
|
398 |
if (desired_new_size > new_size_before) { |
|
399 |
size_t change = desired_new_size - new_size_before; |
|
400 |
assert(change % alignment == 0, "just checking"); |
|
401 |
if (expand(change)) { |
|
402 |
changed = true; |
|
403 |
} |
|
404 |
// If the heap failed to expand to the desired size, |
|
405 |
// "changed" will be false. If the expansion failed |
|
406 |
// (and at this point it was expected to succeed), |
|
407 |
// ignore the failure (leaving "changed" as false). |
|
408 |
} |
|
409 |
if (desired_new_size < new_size_before && eden()->is_empty()) { |
|
410 |
// bail out of shrinking if objects in eden |
|
411 |
size_t change = new_size_before - desired_new_size; |
|
412 |
assert(change % alignment == 0, "just checking"); |
|
413 |
_virtual_space.shrink_by(change); |
|
414 |
changed = true; |
|
415 |
} |
|
416 |
if (changed) { |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
417 |
// 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
|
418 |
// 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
|
419 |
// 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
|
420 |
compute_space_boundaries(eden()->used(), |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
421 |
SpaceDecorator::Clear, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
422 |
SpaceDecorator::DontMangle); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
423 |
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
|
424 |
(HeapWord*)_virtual_space.high()); |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49050
diff
changeset
|
425 |
gch->rem_set()->resize_covered_region(cmr); |
35061 | 426 |
|
37200 | 427 |
log_debug(gc, ergo, heap)( |
35061 | 428 |
"New generation size " SIZE_FORMAT "K->" SIZE_FORMAT "K [eden=" SIZE_FORMAT "K,survivor=" SIZE_FORMAT "K]", |
429 |
new_size_before/K, _virtual_space.committed_size()/K, |
|
430 |
eden()->capacity()/K, from()->capacity()/K); |
|
37200 | 431 |
log_trace(gc, ergo, heap)( |
35061 | 432 |
" [allowed " SIZE_FORMAT "K extra for %d threads]", |
1 | 433 |
thread_increase_size/K, threads_count); |
434 |
} |
|
435 |
} |
|
436 |
||
30870
3050fdcdc60b
8080112: Replace and remove the last usages of CollectedHeap::n_par_threads()
stefank
parents:
30868
diff
changeset
|
437 |
void DefNewGeneration::younger_refs_iterate(OopsInGenClosure* cl, uint n_threads) { |
1 | 438 |
assert(false, "NYI -- are you sure you want to call this?"); |
439 |
} |
|
440 |
||
441 |
||
442 |
size_t DefNewGeneration::capacity() const { |
|
443 |
return eden()->capacity() |
|
444 |
+ from()->capacity(); // to() is only used during scavenge |
|
445 |
} |
|
446 |
||
447 |
||
448 |
size_t DefNewGeneration::used() const { |
|
449 |
return eden()->used() |
|
450 |
+ from()->used(); // to() is only used during scavenge |
|
451 |
} |
|
452 |
||
453 |
||
454 |
size_t DefNewGeneration::free() const { |
|
455 |
return eden()->free() |
|
456 |
+ from()->free(); // to() is only used during scavenge |
|
457 |
} |
|
458 |
||
459 |
size_t DefNewGeneration::max_capacity() const { |
|
460 |
const size_t reserved_bytes = reserved().byte_size(); |
|
54678
93f09ca4a7f8
8198505: Remove CollectorPolicy and its subclasses
stefank
parents:
52141
diff
changeset
|
461 |
return reserved_bytes - compute_survivor_size(reserved_bytes, SpaceAlignment); |
1 | 462 |
} |
463 |
||
464 |
size_t DefNewGeneration::unsafe_max_alloc_nogc() const { |
|
465 |
return eden()->free(); |
|
466 |
} |
|
467 |
||
468 |
size_t DefNewGeneration::capacity_before_gc() const { |
|
469 |
return eden()->capacity(); |
|
470 |
} |
|
471 |
||
472 |
size_t DefNewGeneration::contiguous_available() const { |
|
473 |
return eden()->free(); |
|
474 |
} |
|
475 |
||
476 |
||
41283
2615c024f3eb
8033552: Fix missing missing volatile specifiers in CAS operations in GC code
eosterlund
parents:
40914
diff
changeset
|
477 |
HeapWord* volatile* DefNewGeneration::top_addr() const { return eden()->top_addr(); } |
1 | 478 |
HeapWord** DefNewGeneration::end_addr() const { return eden()->end_addr(); } |
479 |
||
480 |
void DefNewGeneration::object_iterate(ObjectClosure* blk) { |
|
481 |
eden()->object_iterate(blk); |
|
482 |
from()->object_iterate(blk); |
|
483 |
} |
|
484 |
||
485 |
||
486 |
void DefNewGeneration::space_iterate(SpaceClosure* blk, |
|
487 |
bool usedOnly) { |
|
488 |
blk->do_space(eden()); |
|
489 |
blk->do_space(from()); |
|
490 |
blk->do_space(to()); |
|
491 |
} |
|
492 |
||
493 |
// The last collection bailed out, we are running out of heap space, |
|
494 |
// so we try to allocate the from-space, too. |
|
495 |
HeapWord* DefNewGeneration::allocate_from_space(size_t size) { |
|
35492
c8c0273e6b91
8146690: Make all classes in GC follow the naming convention.
david
parents:
35471
diff
changeset
|
496 |
bool should_try_alloc = should_allocate_from_space() || GCLocker::is_active_and_needs_gc(); |
35061 | 497 |
|
498 |
// If the Heap_lock is not locked by this thread, this will be called |
|
499 |
// again later with the Heap_lock held. |
|
500 |
bool do_alloc = should_try_alloc && (Heap_lock->owned_by_self() || (SafepointSynchronize::is_at_safepoint() && Thread::current()->is_VM_thread())); |
|
501 |
||
1 | 502 |
HeapWord* result = NULL; |
35061 | 503 |
if (do_alloc) { |
504 |
result = from()->allocate(size); |
|
505 |
} |
|
506 |
||
507 |
log_trace(gc, alloc)("DefNewGeneration::allocate_from_space(" SIZE_FORMAT "): will_fail: %s heap_lock: %s free: " SIZE_FORMAT "%s%s returns %s", |
|
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
508 |
size, |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
509 |
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
|
510 |
"true" : "false", |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
511 |
Heap_lock->is_locked() ? "locked" : "unlocked", |
35061 | 512 |
from()->free(), |
513 |
should_try_alloc ? "" : " should_allocate_from_space: NOT", |
|
514 |
do_alloc ? " Heap_lock is not owned by self" : "", |
|
515 |
result == NULL ? "NULL" : "object"); |
|
516 |
||
1 | 517 |
return result; |
518 |
} |
|
519 |
||
520 |
HeapWord* DefNewGeneration::expand_and_allocate(size_t size, |
|
521 |
bool is_tlab, |
|
522 |
bool parallel) { |
|
523 |
// We don't attempt to expand the young generation (but perhaps we should.) |
|
524 |
return allocate(size, is_tlab); |
|
525 |
} |
|
526 |
||
15215
048f775ae371
8005972: ParNew should not update the tenuring threshold when promotion failed has occurred
brutisso
parents:
14583
diff
changeset
|
527 |
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
|
528 |
// Set the desired survivor size to half the real survivor space |
40914
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
529 |
size_t const survivor_capacity = to()->capacity() / HeapWordSize; |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
530 |
size_t const desired_survivor_size = (size_t)((((double)survivor_capacity) * TargetSurvivorRatio) / 100); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
531 |
|
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
532 |
_tenuring_threshold = age_table()->compute_tenuring_threshold(desired_survivor_size); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
533 |
|
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
534 |
if (UsePerfData) { |
49050
170c7b36aea6
8198530: Move _gc_policy_counters from GenCollectorPolicy to GenCollectedHeap
stefank
parents:
49048
diff
changeset
|
535 |
GCPolicyCounters* gc_counters = GenCollectedHeap::heap()->counters(); |
40914
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
536 |
gc_counters->tenuring_threshold()->set_value(_tenuring_threshold); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
537 |
gc_counters->desired_survivor_size()->set_value(desired_survivor_size * oopSize); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
538 |
} |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
539 |
|
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40655
diff
changeset
|
540 |
age_table()->print_age_table(_tenuring_threshold); |
15215
048f775ae371
8005972: ParNew should not update the tenuring threshold when promotion failed has occurred
brutisso
parents:
14583
diff
changeset
|
541 |
} |
1 | 542 |
|
543 |
void DefNewGeneration::collect(bool full, |
|
544 |
bool clear_all_soft_refs, |
|
545 |
size_t size, |
|
546 |
bool is_tlab) { |
|
547 |
assert(full || size > 0, "otherwise we don't want to collect"); |
|
18025 | 548 |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
549 |
SerialHeap* heap = SerialHeap::heap(); |
18025 | 550 |
|
21767
41eaa9a17059
8028128: Add a type safe alternative for working with counter based data
mgronlun
parents:
21561
diff
changeset
|
551 |
_gc_timer->register_gc_start(); |
18025 | 552 |
DefNewTracer gc_tracer; |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
553 |
gc_tracer.report_gc_start(heap->gc_cause(), _gc_timer->gc_start()); |
18025 | 554 |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
555 |
_old_gen = heap->old_gen(); |
1 | 556 |
|
18025 | 557 |
// If the next generation is too full to accommodate promotion |
1 | 558 |
// from this generation, pass on collection; let the next generation |
559 |
// do it. |
|
560 |
if (!collection_attempt_is_safe()) { |
|
35061 | 561 |
log_trace(gc)(":: Collection attempt not safe ::"); |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
562 |
heap->set_incremental_collection_failed(); // Slight lie: we did not even attempt one |
1 | 563 |
return; |
564 |
} |
|
565 |
assert(to()->is_empty(), "Else not collection_attempt_is_safe"); |
|
566 |
||
567 |
init_assuming_no_promotion_failure(); |
|
568 |
||
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
569 |
GCTraceTime(Trace, gc, phases) tm("DefNew", NULL, heap->gc_cause()); |
1 | 570 |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
571 |
heap->trace_heap_before_gc(&gc_tracer); |
18025 | 572 |
|
1 | 573 |
// These can be shared for all code paths |
574 |
IsAliveClosure is_alive(this); |
|
575 |
ScanWeakRefClosure scan_weak_ref(this); |
|
576 |
||
577 |
age_table()->clear(); |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
578 |
to()->clear(SpaceDecorator::Mangle); |
36202
219f8808c3bd
8146989: Introduce per-worker preserved mark stacks in ParNew
tonyp
parents:
35862
diff
changeset
|
579 |
// The preserved marks should be empty at the start of the GC. |
219f8808c3bd
8146989: Introduce per-worker preserved mark stacks in ParNew
tonyp
parents:
35862
diff
changeset
|
580 |
_preserved_marks_set.init(1); |
1 | 581 |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
582 |
heap->rem_set()->prepare_for_younger_refs_iterate(false); |
1 | 583 |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
584 |
assert(heap->no_allocs_since_save_marks(), |
1 | 585 |
"save marks have not been newly set."); |
586 |
||
587 |
FastScanClosure fsc_with_no_gc_barrier(this, false); |
|
588 |
FastScanClosure fsc_with_gc_barrier(this, true); |
|
589 |
||
47580 | 590 |
CLDScanClosure cld_scan_closure(&fsc_with_no_gc_barrier, |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
591 |
heap->rem_set()->cld_rem_set()->accumulate_modified_oops()); |
13728
882756847a04
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
12630
diff
changeset
|
592 |
|
1 | 593 |
set_promo_failure_scan_stack_closure(&fsc_with_no_gc_barrier); |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
594 |
FastEvacuateFollowersClosure evacuate_followers(heap, |
1 | 595 |
&fsc_with_no_gc_barrier, |
596 |
&fsc_with_gc_barrier); |
|
597 |
||
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
598 |
assert(heap->no_allocs_since_save_marks(), |
1 | 599 |
"save marks have not been newly set."); |
600 |
||
30868
c1b24f26deed
8080110: Remove usage of CollectedHeap::n_par_threads() from root processing
stefank
parents:
30764
diff
changeset
|
601 |
{ |
30871 | 602 |
// DefNew needs to run with n_threads == 0, to make sure the serial |
603 |
// version of the card table scanning code is used. |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49050
diff
changeset
|
604 |
// See: CardTableRS::non_clean_card_iterate_possibly_parallel. |
30868
c1b24f26deed
8080110: Remove usage of CollectedHeap::n_par_threads() from root processing
stefank
parents:
30764
diff
changeset
|
605 |
StrongRootsScope srs(0); |
c1b24f26deed
8080110: Remove usage of CollectedHeap::n_par_threads() from root processing
stefank
parents:
30764
diff
changeset
|
606 |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
607 |
heap->young_process_roots(&srs, |
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
608 |
&fsc_with_no_gc_barrier, |
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
609 |
&fsc_with_gc_barrier, |
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
610 |
&cld_scan_closure); |
30868
c1b24f26deed
8080110: Remove usage of CollectedHeap::n_par_threads() from root processing
stefank
parents:
30764
diff
changeset
|
611 |
} |
1 | 612 |
|
613 |
// "evacuate followers". |
|
614 |
evacuate_followers.do_void(); |
|
615 |
||
616 |
FastKeepAliveClosure keep_alive(this, &scan_weak_ref); |
|
1606
dcf9714addbe
6684579: SoftReference processing can be made more efficient
ysr
parents:
1388
diff
changeset
|
617 |
ReferenceProcessor* rp = ref_processor(); |
1610
5dddd195cc86
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
1606
diff
changeset
|
618 |
rp->setup_policy(clear_all_soft_refs); |
50396
7f48bff40a9a
8204094: assert(worker_i < _length) failed: Worker 15 is greater than max: 11 at ReferenceProcessorPhaseTimes
sangheki
parents:
50034
diff
changeset
|
619 |
ReferenceProcessorPhaseTimes pt(_gc_timer, rp->max_num_queues()); |
18025 | 620 |
const ReferenceProcessorStats& stats = |
1606
dcf9714addbe
6684579: SoftReference processing can be made more efficient
ysr
parents:
1388
diff
changeset
|
621 |
rp->process_discovered_references(&is_alive, &keep_alive, &evacuate_followers, |
46795
623a5e42deb6
8173335: Improve logging for j.l.ref.reference processing
sangheki
parents:
46625
diff
changeset
|
622 |
NULL, &pt); |
18025 | 623 |
gc_tracer.report_gc_reference_stats(stats); |
33143
2083f82acec8
8139134: Wrong tenuring threshold in young GC trace event
ehelin
parents:
33107
diff
changeset
|
624 |
gc_tracer.report_tenuring_threshold(tenuring_threshold()); |
46795
623a5e42deb6
8173335: Improve logging for j.l.ref.reference processing
sangheki
parents:
46625
diff
changeset
|
625 |
pt.print_all_references(); |
18025 | 626 |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
627 |
assert(heap->no_allocs_since_save_marks(), "save marks have not been newly set."); |
47676
b1c020fc35a3
8189748: More precise closures for WeakProcessor::weak_oops_do calls
stefank
parents:
47648
diff
changeset
|
628 |
|
b1c020fc35a3
8189748: More precise closures for WeakProcessor::weak_oops_do calls
stefank
parents:
47648
diff
changeset
|
629 |
WeakProcessor::weak_oops_do(&is_alive, &keep_alive); |
b1c020fc35a3
8189748: More precise closures for WeakProcessor::weak_oops_do calls
stefank
parents:
47648
diff
changeset
|
630 |
|
b1c020fc35a3
8189748: More precise closures for WeakProcessor::weak_oops_do calls
stefank
parents:
47648
diff
changeset
|
631 |
// Verify that the usage of keep_alive didn't copy any objects. |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
632 |
assert(heap->no_allocs_since_save_marks(), "save marks have not been newly set."); |
47648
226b1fc611b9
8189359: Move native weak oops cleaning out of ReferenceProcessor
stefank
parents:
47622
diff
changeset
|
633 |
|
18025 | 634 |
if (!_promotion_failed) { |
1 | 635 |
// Swap the survivor spaces. |
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
636 |
eden()->clear(SpaceDecorator::Mangle); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
637 |
from()->clear(SpaceDecorator::Mangle); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
638 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
639 |
// 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
|
640 |
// can check for valid mangling at intermediate points in the |
32623
390a27af5657
8134626: Misc cleanups after generation array removal
jwilhelm
parents:
31964
diff
changeset
|
641 |
// collection(s). When a young collection fails to collect |
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
642 |
// 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
|
643 |
// 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
|
644 |
// 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
|
645 |
// other spaces. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
646 |
to()->mangle_unused_area(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
647 |
} |
1 | 648 |
swap_spaces(); |
649 |
||
650 |
assert(to()->is_empty(), "to space should be empty now"); |
|
651 |
||
15215
048f775ae371
8005972: ParNew should not update the tenuring threshold when promotion failed has occurred
brutisso
parents:
14583
diff
changeset
|
652 |
adjust_desired_tenuring_threshold(); |
1 | 653 |
|
5343
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4574
diff
changeset
|
654 |
// 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
|
655 |
// for full GC's. |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
656 |
AdaptiveSizePolicy* size_policy = heap->size_policy(); |
5343
95a5c4b89273
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
4574
diff
changeset
|
657 |
size_policy->reset_gc_overhead_limit_count(); |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
658 |
assert(!heap->incremental_collection_failed(), "Should be clear"); |
1 | 659 |
} else { |
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
660 |
assert(_promo_failure_scan_stack.is_empty(), "post condition"); |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
661 |
_promo_failure_scan_stack.clear(true); // Clear cached segments. |
1 | 662 |
|
663 |
remove_forwarding_pointers(); |
|
37422
8a7443b5edf8
8152312: ParNew: Restore preserved marks in parallel
tonyp
parents:
37248
diff
changeset
|
664 |
log_info(gc, promotion)("Promotion failed"); |
1 | 665 |
// Add to-space to the list of space to compact |
666 |
// when a promotion failure has occurred. In that |
|
667 |
// case there can be live objects in to-space |
|
668 |
// as a result of a partial evacuation of eden |
|
669 |
// and from-space. |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
670 |
swap_spaces(); // For uniformity wrt ParNewGeneration. |
1 | 671 |
from()->set_next_compaction_space(to()); |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
672 |
heap->set_incremental_collection_failed(); |
1 | 673 |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
3908
diff
changeset
|
674 |
// 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
|
675 |
_old_gen->promotion_failure_occurred(); |
18025 | 676 |
gc_tracer.report_promotion_failed(_promotion_failed_info); |
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
3908
diff
changeset
|
677 |
|
1 | 678 |
// Reset the PromotionFailureALot counters. |
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
679 |
NOT_PRODUCT(heap->reset_promotion_should_fail();) |
1 | 680 |
} |
36202
219f8808c3bd
8146989: Introduce per-worker preserved mark stacks in ParNew
tonyp
parents:
35862
diff
changeset
|
681 |
// We should have processed and cleared all the preserved marks. |
219f8808c3bd
8146989: Introduce per-worker preserved mark stacks in ParNew
tonyp
parents:
35862
diff
changeset
|
682 |
_preserved_marks_set.reclaim(); |
1 | 683 |
// set new iteration safe limit for the survivor spaces |
684 |
from()->set_concurrent_iteration_safe_limit(from()->top()); |
|
685 |
to()->set_concurrent_iteration_safe_limit(to()->top()); |
|
11755 | 686 |
|
18025 | 687 |
// We need to use a monotonically non-decreasing time in ms |
11755 | 688 |
// or we will see time-warp warnings and os::javaTimeMillis() |
689 |
// does not guarantee monotonicity. |
|
690 |
jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; |
|
691 |
update_time_of_last_gc(now); |
|
18025 | 692 |
|
50033
000c697c81db
8202639: Use concrete Generation classes in SerialHeap and CMSHeap
stefank
parents:
50032
diff
changeset
|
693 |
heap->trace_heap_after_gc(&gc_tracer); |
18025 | 694 |
|
21767
41eaa9a17059
8028128: Add a type safe alternative for working with counter based data
mgronlun
parents:
21561
diff
changeset
|
695 |
_gc_timer->register_gc_end(); |
18025 | 696 |
|
697 |
gc_tracer.report_gc_end(_gc_timer->gc_end(), _gc_timer->time_partitions()); |
|
1 | 698 |
} |
699 |
||
700 |
void DefNewGeneration::init_assuming_no_promotion_failure() { |
|
701 |
_promotion_failed = false; |
|
18025 | 702 |
_promotion_failed_info.reset(); |
1 | 703 |
from()->set_next_compaction_space(NULL); |
704 |
} |
|
705 |
||
706 |
void DefNewGeneration::remove_forwarding_pointers() { |
|
36202
219f8808c3bd
8146989: Introduce per-worker preserved mark stacks in ParNew
tonyp
parents:
35862
diff
changeset
|
707 |
RemoveForwardedPointerClosure rspc; |
1 | 708 |
eden()->object_iterate(&rspc); |
709 |
from()->object_iterate(&rspc); |
|
47622
817f2a7019e4
8179387: Factor out CMS specific code from GenCollectedHeap into its own subclass
rkennke
parents:
47580
diff
changeset
|
710 |
restore_preserved_marks(); |
817f2a7019e4
8179387: Factor out CMS specific code from GenCollectedHeap into its own subclass
rkennke
parents:
47580
diff
changeset
|
711 |
} |
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
712 |
|
47622
817f2a7019e4
8179387: Factor out CMS specific code from GenCollectedHeap into its own subclass
rkennke
parents:
47580
diff
changeset
|
713 |
void DefNewGeneration::restore_preserved_marks() { |
817f2a7019e4
8179387: Factor out CMS specific code from GenCollectedHeap into its own subclass
rkennke
parents:
47580
diff
changeset
|
714 |
SharedRestorePreservedMarksTaskExecutor task_executor(NULL); |
39228
32ce84798166
8156032: Clean up parallel GC specific code from vm/gc/shared/preservedMarks.cpp
lmesnik
parents:
38010
diff
changeset
|
715 |
_preserved_marks_set.restore(&task_executor); |
1 | 716 |
} |
717 |
||
718 |
void DefNewGeneration::handle_promotion_failure(oop old) { |
|
35061 | 719 |
log_debug(gc, promotion)("Promotion failure size = %d) ", old->size()); |
720 |
||
7658
b970e410547a
6807801: CMS: could save/restore fewer header words during scavenge
ysr
parents:
7419
diff
changeset
|
721 |
_promotion_failed = true; |
18025 | 722 |
_promotion_failed_info.register_copy_failure(old->size()); |
49722
a47d1e21b3f1
8199735: Mark word updates need to use Access API
rkennke
parents:
49594
diff
changeset
|
723 |
_preserved_marks_set.get()->push_if_necessary(old, old->mark_raw()); |
1 | 724 |
// forward to self |
725 |
old->forward_to(old); |
|
726 |
||
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
727 |
_promo_failure_scan_stack.push(old); |
1 | 728 |
|
729 |
if (!_promo_failure_drain_in_progress) { |
|
730 |
// prevent recursion in copy_to_survivor_space() |
|
731 |
_promo_failure_drain_in_progress = true; |
|
732 |
drain_promo_failure_scan_stack(); |
|
733 |
_promo_failure_drain_in_progress = false; |
|
734 |
} |
|
735 |
} |
|
736 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
737 |
oop DefNewGeneration::copy_to_survivor_space(oop old) { |
1 | 738 |
assert(is_in_reserved(old) && !old->is_forwarded(), |
739 |
"shouldn't be scavenging this oop"); |
|
740 |
size_t s = old->size(); |
|
741 |
oop obj = NULL; |
|
742 |
||
743 |
// Try allocating obj in to-space (unless too old) |
|
744 |
if (old->age() < tenuring_threshold()) { |
|
25905
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25492
diff
changeset
|
745 |
obj = (oop) to()->allocate_aligned(s); |
1 | 746 |
} |
747 |
||
748 |
// Otherwise try allocating obj tenured |
|
749 |
if (obj == NULL) { |
|
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
750 |
obj = _old_gen->promote(old, s); |
1 | 751 |
if (obj == NULL) { |
752 |
handle_promotion_failure(old); |
|
753 |
return old; |
|
754 |
} |
|
755 |
} else { |
|
756 |
// Prefetch beyond obj |
|
757 |
const intx interval = PrefetchCopyIntervalInBytes; |
|
758 |
Prefetch::write(obj, interval); |
|
759 |
||
760 |
// Copy obj |
|
761 |
Copy::aligned_disjoint_words((HeapWord*)old, (HeapWord*)obj, s); |
|
762 |
||
763 |
// Increment age if obj still in new generation |
|
764 |
obj->incr_age(); |
|
765 |
age_table()->add(obj, s); |
|
766 |
} |
|
767 |
||
768 |
// Done, insert forward pointer to obj in this header |
|
769 |
old->forward_to(obj); |
|
770 |
||
771 |
return obj; |
|
772 |
} |
|
773 |
||
774 |
void DefNewGeneration::drain_promo_failure_scan_stack() { |
|
6762
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
775 |
while (!_promo_failure_scan_stack.is_empty()) { |
f8d1b560700e
6423256: GC stacks should use a better data structure
jcoomes
parents:
5547
diff
changeset
|
776 |
oop obj = _promo_failure_scan_stack.pop(); |
1 | 777 |
obj->oop_iterate(_promo_failure_scan_stack_closure); |
778 |
} |
|
779 |
} |
|
780 |
||
781 |
void DefNewGeneration::save_marks() { |
|
782 |
eden()->set_saved_mark(); |
|
783 |
to()->set_saved_mark(); |
|
784 |
from()->set_saved_mark(); |
|
785 |
} |
|
786 |
||
787 |
||
788 |
void DefNewGeneration::reset_saved_marks() { |
|
789 |
eden()->reset_saved_mark(); |
|
790 |
to()->reset_saved_mark(); |
|
791 |
from()->reset_saved_mark(); |
|
792 |
} |
|
793 |
||
794 |
||
795 |
bool DefNewGeneration::no_allocs_since_save_marks() { |
|
796 |
assert(eden()->saved_mark_at_top(), "Violated spec - alloc in eden"); |
|
797 |
assert(from()->saved_mark_at_top(), "Violated spec - alloc in from"); |
|
798 |
return to()->saved_mark_at_top(); |
|
799 |
} |
|
800 |
||
801 |
void DefNewGeneration::contribute_scratch(ScratchBlock*& list, Generation* requestor, |
|
802 |
size_t max_alloc_words) { |
|
31358
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
803 |
if (requestor == this || _promotion_failed) { |
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
804 |
return; |
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
805 |
} |
693058672cc6
8077842: Remove the level parameter passed around in GenCollectedHeap
jwilhelm
parents:
31032
diff
changeset
|
806 |
assert(GenCollectedHeap::heap()->is_old_gen(requestor), "We should not call our own generation"); |
1 | 807 |
|
808 |
/* $$$ Assert this? "trace" is a "MarkSweep" function so that's not appropriate. |
|
809 |
if (to_space->top() > to_space->bottom()) { |
|
810 |
trace("to_space not empty when contribute_scratch called"); |
|
811 |
} |
|
812 |
*/ |
|
813 |
||
814 |
ContiguousSpace* to_space = to(); |
|
815 |
assert(to_space->end() >= to_space->top(), "pointers out of order"); |
|
816 |
size_t free_words = pointer_delta(to_space->end(), to_space->top()); |
|
817 |
if (free_words >= MinFreeScratchWords) { |
|
818 |
ScratchBlock* sb = (ScratchBlock*)to_space->top(); |
|
819 |
sb->num_words = free_words; |
|
820 |
sb->next = list; |
|
821 |
list = sb; |
|
822 |
} |
|
823 |
} |
|
824 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
825 |
void DefNewGeneration::reset_scratch() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
826 |
// 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
|
827 |
// 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
|
828 |
// 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
|
829 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
830 |
to()->mangle_unused_area_complete(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
831 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
832 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
833 |
|
1 | 834 |
bool DefNewGeneration::collection_attempt_is_safe() { |
835 |
if (!to()->is_empty()) { |
|
35061 | 836 |
log_trace(gc)(":: to is not empty ::"); |
1 | 837 |
return false; |
838 |
} |
|
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
839 |
if (_old_gen == NULL) { |
1 | 840 |
GenCollectedHeap* gch = GenCollectedHeap::heap(); |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
841 |
_old_gen = gch->old_gen(); |
1 | 842 |
} |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
843 |
return _old_gen->promotion_attempt_is_safe(used()); |
1 | 844 |
} |
845 |
||
846 |
void DefNewGeneration::gc_epilogue(bool full) { |
|
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
847 |
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
|
848 |
|
35492
c8c0273e6b91
8146690: Make all classes in GC follow the naming convention.
david
parents:
35471
diff
changeset
|
849 |
assert(!GCLocker::is_active(), "We should not be executing here"); |
1 | 850 |
// Check if the heap is approaching full after a collection has |
851 |
// been done. Generally the young generation is empty at |
|
852 |
// a minimum at the end of a collection. If it is not, then |
|
853 |
// the heap is approaching full. |
|
854 |
GenCollectedHeap* gch = GenCollectedHeap::heap(); |
|
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
855 |
if (full) { |
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
856 |
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
|
857 |
if (!collection_attempt_is_safe() && !_eden_space->is_empty()) { |
35061 | 858 |
log_trace(gc)("DefNewEpilogue: cause(%s), full, not safe, set_failed, set_alloc_from, clear_seen", |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
859 |
GCCause::to_string(gch->gc_cause())); |
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
860 |
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
|
861 |
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
|
862 |
} else { |
35061 | 863 |
log_trace(gc)("DefNewEpilogue: cause(%s), full, safe, clear_failed, clear_alloc_from, clear_seen", |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
864 |
GCCause::to_string(gch->gc_cause())); |
6985
e9364ec299ac
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
6762
diff
changeset
|
865 |
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
|
866 |
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
|
867 |
} |
1 | 868 |
} else { |
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
869 |
#ifdef ASSERT |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
870 |
// 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
|
871 |
// 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
|
872 |
// 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
|
873 |
// 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
|
874 |
// 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
|
875 |
// a full collection in between. |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
876 |
if (!seen_incremental_collection_failed && |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
877 |
gch->incremental_collection_failed()) { |
35061 | 878 |
log_trace(gc)("DefNewEpilogue: cause(%s), not full, not_seen_failed, failed, set_seen_failed", |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
879 |
GCCause::to_string(gch->gc_cause())); |
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
880 |
seen_incremental_collection_failed = true; |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
881 |
} else if (seen_incremental_collection_failed) { |
35061 | 882 |
log_trace(gc)("DefNewEpilogue: cause(%s), not full, seen_failed, will_clear_seen_failed", |
7419
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
883 |
GCCause::to_string(gch->gc_cause())); |
263dd4e89b9d
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
7397
diff
changeset
|
884 |
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
|
885 |
!gch->incremental_collection_failed(), |
7378
fe845b64d7fb
6998802: ScavengeALot: assert(!gch->incremental_collection_failed()) failed: Twice in a row
ysr
parents:
6986
diff
changeset
|
886 |
"Twice in a row"); |
6986
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
887 |
seen_incremental_collection_failed = false; |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
888 |
} |
daf18aec57b5
6995045: assert(!gch->incremental_collection_failed()) failed: Error, defNewGeneration.cpp:827
ysr
parents:
6985
diff
changeset
|
889 |
#endif // ASSERT |
1 | 890 |
} |
891 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
892 |
if (ZapUnusedHeapArea) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
893 |
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
|
894 |
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
|
895 |
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
|
896 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
897 |
|
10022
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
7658
diff
changeset
|
898 |
if (!CleanChunkPoolAsync) { |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
7658
diff
changeset
|
899 |
Chunk::clean_chunk_pool(); |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
7658
diff
changeset
|
900 |
} |
377345fb5fb5
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
7658
diff
changeset
|
901 |
|
1 | 902 |
// update the generation and space performance counters |
903 |
update_counters(); |
|
49050
170c7b36aea6
8198530: Move _gc_policy_counters from GenCollectorPolicy to GenCollectedHeap
stefank
parents:
49048
diff
changeset
|
904 |
gch->counters()->update_counters(); |
1 | 905 |
} |
906 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
907 |
void DefNewGeneration::record_spaces_top() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
908 |
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
|
909 |
eden()->set_top_for_allocations(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
910 |
to()->set_top_for_allocations(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
911 |
from()->set_top_for_allocations(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
912 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
913 |
|
18025 | 914 |
void DefNewGeneration::ref_processor_init() { |
915 |
Generation::ref_processor_init(); |
|
916 |
} |
|
917 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
360
diff
changeset
|
918 |
|
1 | 919 |
void DefNewGeneration::update_counters() { |
920 |
if (UsePerfData) { |
|
921 |
_eden_counters->update_all(); |
|
922 |
_from_counters->update_all(); |
|
923 |
_to_counters->update_all(); |
|
924 |
_gen_counters->update_all(); |
|
925 |
} |
|
926 |
} |
|
927 |
||
12379 | 928 |
void DefNewGeneration::verify() { |
929 |
eden()->verify(); |
|
930 |
from()->verify(); |
|
931 |
to()->verify(); |
|
1 | 932 |
} |
933 |
||
934 |
void DefNewGeneration::print_on(outputStream* st) const { |
|
935 |
Generation::print_on(st); |
|
936 |
st->print(" eden"); |
|
937 |
eden()->print_on(st); |
|
938 |
st->print(" from"); |
|
939 |
from()->print_on(st); |
|
940 |
st->print(" to "); |
|
941 |
to()->print_on(st); |
|
942 |
} |
|
943 |
||
944 |
||
945 |
const char* DefNewGeneration::name() const { |
|
946 |
return "def new generation"; |
|
947 |
} |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
948 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
949 |
// 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
|
950 |
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
|
951 |
return eden(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
952 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
953 |
|
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
954 |
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
|
955 |
// 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
|
956 |
// 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
|
957 |
// 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
|
958 |
// 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
|
959 |
// 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
|
960 |
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
|
961 |
if (result != NULL) { |
50031
aa04bf7b99bd
8202591: Remove usage of CMSEdenChunksRecordAlways in defNewGeneration.cpp
stefank
parents:
49982
diff
changeset
|
962 |
if (_old_gen != NULL) { |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
963 |
_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
|
964 |
} |
27625 | 965 |
} else { |
966 |
// If the eden is full and the last collection bailed out, we are running |
|
967 |
// out of heap space, and we try to allocate the from-space, too. |
|
968 |
// allocate_from_space can't be inlined because that would introduce a |
|
969 |
// 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
|
970 |
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
|
971 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
972 |
return result; |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
973 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
974 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
975 |
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
|
976 |
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
|
977 |
HeapWord* res = eden()->par_allocate(word_size); |
50031
aa04bf7b99bd
8202591: Remove usage of CMSEdenChunksRecordAlways in defNewGeneration.cpp
stefank
parents:
49982
diff
changeset
|
978 |
if (_old_gen != NULL) { |
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29200
diff
changeset
|
979 |
_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
|
980 |
} |
d32a17b7502c
6990419: CMS Remaining work for 6572569: consistently skewed work distribution in (long) re-mark pauses
jmasa
parents:
18687
diff
changeset
|
981 |
return res; |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
982 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
983 |
|
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
984 |
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
|
985 |
return eden()->capacity(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
986 |
} |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
987 |
|
22552 | 988 |
size_t DefNewGeneration::tlab_used() const { |
989 |
return eden()->used(); |
|
990 |
} |
|
991 |
||
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
992 |
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
|
993 |
return unsafe_max_alloc_nogc(); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
994 |
} |