author | stefank |
Tue, 26 Nov 2019 10:47:46 +0100 | |
changeset 59290 | 97d13893ec3c |
parent 59252 | 623722a6aeb9 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
2 |
* Copyright (c) 1997, 2018, 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:
4571
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
4571
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:
4571
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#include "precompiled.hpp" |
26 |
#include "classfile/systemDictionary.hpp" |
|
27 |
#include "classfile/vmSymbols.hpp" |
|
30764 | 28 |
#include "gc/shared/blockOffsetTable.inline.hpp" |
29 |
#include "gc/shared/collectedHeap.inline.hpp" |
|
30 |
#include "gc/shared/genCollectedHeap.hpp" |
|
31 |
#include "gc/shared/genOopClosures.inline.hpp" |
|
32 |
#include "gc/shared/space.hpp" |
|
33 |
#include "gc/shared/space.inline.hpp" |
|
58980 | 34 |
#include "gc/shared/spaceDecorator.inline.hpp" |
50752 | 35 |
#include "memory/iterator.inline.hpp" |
49359
59f6547e151f
8199264: Remove universe.inline.hpp to simplify include dependencies
stefank
parents:
49164
diff
changeset
|
36 |
#include "memory/universe.hpp" |
7397 | 37 |
#include "oops/oop.inline.hpp" |
40655
9f644073d3a0
8157907: Incorrect inclusion of atomic.hpp instead of atomic.inline.hpp
dholmes
parents:
37495
diff
changeset
|
38 |
#include "runtime/atomic.hpp" |
7397 | 39 |
#include "runtime/java.hpp" |
24487
71ff0bd674eb
8042737: Introduce umbrella header prefetch.inline.hpp
goetz
parents:
24424
diff
changeset
|
40 |
#include "runtime/prefetch.inline.hpp" |
7397 | 41 |
#include "runtime/safepoint.hpp" |
46625 | 42 |
#include "utilities/align.hpp" |
7397 | 43 |
#include "utilities/copy.hpp" |
44 |
#include "utilities/globalDefinitions.hpp" |
|
15482
470d0b0c09f1
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
15088
diff
changeset
|
45 |
#include "utilities/macros.hpp" |
49982 | 46 |
#if INCLUDE_SERIALGC |
47 |
#include "gc/serial/defNewGeneration.hpp" |
|
48 |
#endif |
|
1 | 49 |
|
50 |
HeapWord* DirtyCardToOopClosure::get_actual_top(HeapWord* top, |
|
51 |
HeapWord* top_obj) { |
|
52 |
if (top_obj != NULL) { |
|
53 |
if (_sp->block_is_obj(top_obj)) { |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
54 |
if (_precision == CardTable::ObjHeadPreciseArray) { |
1 | 55 |
if (oop(top_obj)->is_objArray() || oop(top_obj)->is_typeArray()) { |
56 |
// An arrayOop is starting on the dirty card - since we do exact |
|
57 |
// store checks for objArrays we are done. |
|
58 |
} else { |
|
59 |
// Otherwise, it is possible that the object starting on the dirty |
|
60 |
// card spans the entire card, and that the store happened on a |
|
61 |
// later card. Figure out where the object ends. |
|
62 |
// Use the block_size() method of the space over which |
|
63 |
// the iteration is being done. That space (e.g. CMS) may have |
|
64 |
// specific requirements on object sizes which will |
|
65 |
// be reflected in the block_size() method. |
|
66 |
top = top_obj + oop(top_obj)->size(); |
|
67 |
} |
|
68 |
} |
|
69 |
} else { |
|
70 |
top = top_obj; |
|
71 |
} |
|
72 |
} else { |
|
73 |
assert(top == _sp->end(), "only case where top_obj == NULL"); |
|
74 |
} |
|
75 |
return top; |
|
76 |
} |
|
77 |
||
78 |
void DirtyCardToOopClosure::walk_mem_region(MemRegion mr, |
|
79 |
HeapWord* bottom, |
|
80 |
HeapWord* top) { |
|
81 |
// 1. Blocks may or may not be objects. |
|
82 |
// 2. Even when a block_is_obj(), it may not entirely |
|
83 |
// occupy the block if the block quantum is larger than |
|
84 |
// the object size. |
|
85 |
// We can and should try to optimize by calling the non-MemRegion |
|
86 |
// version of oop_iterate() for all but the extremal objects |
|
87 |
// (for which we need to call the MemRegion version of |
|
88 |
// oop_iterate()) To be done post-beta XXX |
|
89 |
for (; bottom < top; bottom += _sp->block_size(bottom)) { |
|
90 |
// As in the case of contiguous space above, we'd like to |
|
91 |
// just use the value returned by oop_iterate to increment the |
|
92 |
// current pointer; unfortunately, that won't work in CMS because |
|
93 |
// we'd need an interface change (it seems) to have the space |
|
94 |
// "adjust the object size" (for instance pad it up to its |
|
95 |
// block alignment or minimum block size restrictions. XXX |
|
96 |
if (_sp->block_is_obj(bottom) && |
|
97 |
!_sp->obj_allocated_since_save_marks(oop(bottom))) { |
|
98 |
oop(bottom)->oop_iterate(_cl, mr); |
|
99 |
} |
|
100 |
} |
|
101 |
} |
|
102 |
||
9624
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
103 |
// We get called with "mr" representing the dirty region |
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
104 |
// that we want to process. Because of imprecise marking, |
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
105 |
// we may need to extend the incoming "mr" to the right, |
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
106 |
// and scan more. However, because we may already have |
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
107 |
// scanned some of that extended region, we may need to |
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
108 |
// trim its right-end back some so we do not scan what |
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
109 |
// we (or another worker thread) may already have scanned |
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
110 |
// or planning to scan. |
1 | 111 |
void DirtyCardToOopClosure::do_MemRegion(MemRegion mr) { |
112 |
HeapWord* bottom = mr.start(); |
|
113 |
HeapWord* last = mr.last(); |
|
114 |
HeapWord* top = mr.end(); |
|
115 |
HeapWord* bottom_obj; |
|
116 |
HeapWord* top_obj; |
|
117 |
||
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
118 |
assert(_precision == CardTable::ObjHeadPreciseArray || |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
119 |
_precision == CardTable::Precise, |
1 | 120 |
"Only ones we deal with for now."); |
121 |
||
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
122 |
assert(_precision != CardTable::ObjHeadPreciseArray || |
50801 | 123 |
_last_bottom == NULL || top <= _last_bottom, |
1 | 124 |
"Not decreasing"); |
125 |
NOT_PRODUCT(_last_bottom = mr.start()); |
|
126 |
||
127 |
bottom_obj = _sp->block_start(bottom); |
|
128 |
top_obj = _sp->block_start(last); |
|
129 |
||
130 |
assert(bottom_obj <= bottom, "just checking"); |
|
131 |
assert(top_obj <= top, "just checking"); |
|
132 |
||
133 |
// Given what we think is the top of the memory region and |
|
134 |
// the start of the object at the top, get the actual |
|
135 |
// value of the top. |
|
136 |
top = get_actual_top(top, top_obj); |
|
137 |
||
138 |
// If the previous call did some part of this region, don't redo. |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
139 |
if (_precision == CardTable::ObjHeadPreciseArray && |
1 | 140 |
_min_done != NULL && |
141 |
_min_done < top) { |
|
142 |
top = _min_done; |
|
143 |
} |
|
144 |
||
145 |
// Top may have been reset, and in fact may be below bottom, |
|
146 |
// e.g. the dirty card region is entirely in a now free object |
|
147 |
// -- something that could happen with a concurrent sweeper. |
|
148 |
bottom = MIN2(bottom, top); |
|
9624
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
149 |
MemRegion extended_mr = MemRegion(bottom, top); |
1 | 150 |
assert(bottom <= top && |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
151 |
(_precision != CardTable::ObjHeadPreciseArray || |
1 | 152 |
_min_done == NULL || |
153 |
top <= _min_done), |
|
154 |
"overlap!"); |
|
155 |
||
156 |
// Walk the region if it is not empty; otherwise there is nothing to do. |
|
9624
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
157 |
if (!extended_mr.is_empty()) { |
c3657c3324ee
6883834: ParNew: assert(!_g->to()->is_in_reserved(obj),"Scanning field twice?") with LargeObjects tests
ysr
parents:
8928
diff
changeset
|
158 |
walk_mem_region(extended_mr, bottom_obj, top); |
1 | 159 |
} |
160 |
||
50801 | 161 |
_min_done = bottom; |
1 | 162 |
} |
163 |
||
50752 | 164 |
DirtyCardToOopClosure* Space::new_dcto_cl(OopIterateClosure* cl, |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
165 |
CardTable::PrecisionStyle precision, |
30870
3050fdcdc60b
8080112: Replace and remove the last usages of CollectedHeap::n_par_threads()
stefank
parents:
30764
diff
changeset
|
166 |
HeapWord* boundary, |
3050fdcdc60b
8080112: Replace and remove the last usages of CollectedHeap::n_par_threads()
stefank
parents:
30764
diff
changeset
|
167 |
bool parallel) { |
1 | 168 |
return new DirtyCardToOopClosure(this, cl, precision, boundary); |
169 |
} |
|
170 |
||
171 |
HeapWord* ContiguousSpaceDCTOC::get_actual_top(HeapWord* top, |
|
172 |
HeapWord* top_obj) { |
|
173 |
if (top_obj != NULL && top_obj < (_sp->toContiguousSpace())->top()) { |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
174 |
if (_precision == CardTable::ObjHeadPreciseArray) { |
1 | 175 |
if (oop(top_obj)->is_objArray() || oop(top_obj)->is_typeArray()) { |
176 |
// An arrayOop is starting on the dirty card - since we do exact |
|
177 |
// store checks for objArrays we are done. |
|
178 |
} else { |
|
179 |
// Otherwise, it is possible that the object starting on the dirty |
|
180 |
// card spans the entire card, and that the store happened on a |
|
181 |
// later card. Figure out where the object ends. |
|
182 |
assert(_sp->block_size(top_obj) == (size_t) oop(top_obj)->size(), |
|
183 |
"Block size and object size mismatch"); |
|
184 |
top = top_obj + oop(top_obj)->size(); |
|
185 |
} |
|
186 |
} |
|
187 |
} else { |
|
188 |
top = (_sp->toContiguousSpace())->top(); |
|
189 |
} |
|
190 |
return top; |
|
191 |
} |
|
192 |
||
35492
c8c0273e6b91
8146690: Make all classes in GC follow the naming convention.
david
parents:
33205
diff
changeset
|
193 |
void FilteringDCTOC::walk_mem_region(MemRegion mr, |
c8c0273e6b91
8146690: Make all classes in GC follow the naming convention.
david
parents:
33205
diff
changeset
|
194 |
HeapWord* bottom, |
c8c0273e6b91
8146690: Make all classes in GC follow the naming convention.
david
parents:
33205
diff
changeset
|
195 |
HeapWord* top) { |
1 | 196 |
// Note that this assumption won't hold if we have a concurrent |
197 |
// collector in this space, which may have freed up objects after |
|
198 |
// they were dirtied and before the stop-the-world GC that is |
|
199 |
// examining cards here. |
|
200 |
assert(bottom < top, "ought to be at least one obj on a dirty card."); |
|
201 |
||
202 |
if (_boundary != NULL) { |
|
203 |
// We have a boundary outside of which we don't want to look |
|
204 |
// at objects, so create a filtering closure around the |
|
205 |
// oop closure before walking the region. |
|
206 |
FilteringClosure filter(_boundary, _cl); |
|
207 |
walk_mem_region_with_cl(mr, bottom, top, &filter); |
|
208 |
} else { |
|
209 |
// No boundary, simply walk the heap with the oop closure. |
|
210 |
walk_mem_region_with_cl(mr, bottom, top, _cl); |
|
211 |
} |
|
212 |
||
213 |
} |
|
214 |
||
215 |
// We must replicate this so that the static type of "FilteringClosure" |
|
216 |
// (see above) is apparent at the oop_iterate calls. |
|
217 |
#define ContiguousSpaceDCTOC__walk_mem_region_with_cl_DEFN(ClosureType) \ |
|
218 |
void ContiguousSpaceDCTOC::walk_mem_region_with_cl(MemRegion mr, \ |
|
219 |
HeapWord* bottom, \ |
|
220 |
HeapWord* top, \ |
|
221 |
ClosureType* cl) { \ |
|
32606
fdaa30d06ada
8129417: Oop iteration clean-up to remove oop_ms_follow_contents
sjohanss
parents:
30870
diff
changeset
|
222 |
bottom += oop(bottom)->oop_iterate_size(cl, mr); \ |
1 | 223 |
if (bottom < top) { \ |
224 |
HeapWord* next_obj = bottom + oop(bottom)->size(); \ |
|
225 |
while (next_obj < top) { \ |
|
226 |
/* Bottom lies entirely below top, so we can call the */ \ |
|
227 |
/* non-memRegion version of oop_iterate below. */ \ |
|
228 |
oop(bottom)->oop_iterate(cl); \ |
|
229 |
bottom = next_obj; \ |
|
230 |
next_obj = bottom + oop(bottom)->size(); \ |
|
231 |
} \ |
|
232 |
/* Last object. */ \ |
|
233 |
oop(bottom)->oop_iterate(cl, mr); \ |
|
234 |
} \ |
|
235 |
} |
|
236 |
||
237 |
// (There are only two of these, rather than N, because the split is due |
|
238 |
// only to the introduction of the FilteringClosure, a local part of the |
|
239 |
// impl of this abstraction.) |
|
50752 | 240 |
ContiguousSpaceDCTOC__walk_mem_region_with_cl_DEFN(OopIterateClosure) |
1 | 241 |
ContiguousSpaceDCTOC__walk_mem_region_with_cl_DEFN(FilteringClosure) |
242 |
||
243 |
DirtyCardToOopClosure* |
|
50752 | 244 |
ContiguousSpace::new_dcto_cl(OopIterateClosure* cl, |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47634
diff
changeset
|
245 |
CardTable::PrecisionStyle precision, |
30870
3050fdcdc60b
8080112: Replace and remove the last usages of CollectedHeap::n_par_threads()
stefank
parents:
30764
diff
changeset
|
246 |
HeapWord* boundary, |
3050fdcdc60b
8080112: Replace and remove the last usages of CollectedHeap::n_par_threads()
stefank
parents:
30764
diff
changeset
|
247 |
bool parallel) { |
1 | 248 |
return new ContiguousSpaceDCTOC(this, cl, precision, boundary); |
249 |
} |
|
250 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
251 |
void Space::initialize(MemRegion mr, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
252 |
bool clear_space, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
253 |
bool mangle_space) { |
1 | 254 |
HeapWord* bottom = mr.start(); |
255 |
HeapWord* end = mr.end(); |
|
256 |
assert(Universe::on_page_boundary(bottom) && Universe::on_page_boundary(end), |
|
257 |
"invalid space boundaries"); |
|
258 |
set_bottom(bottom); |
|
259 |
set_end(end); |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
260 |
if (clear_space) clear(mangle_space); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
261 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
262 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
263 |
void Space::clear(bool mangle_space) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
264 |
if (ZapUnusedHeapArea && mangle_space) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
265 |
mangle_unused_area(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
266 |
} |
1 | 267 |
} |
268 |
||
1388 | 269 |
ContiguousSpace::ContiguousSpace(): CompactibleSpace(), _top(NULL), |
270 |
_concurrent_iteration_safe_limit(NULL) { |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
271 |
_mangler = new GenSpaceMangler(this); |
1 | 272 |
} |
273 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
274 |
ContiguousSpace::~ContiguousSpace() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
275 |
delete _mangler; |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
276 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
277 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
278 |
void ContiguousSpace::initialize(MemRegion mr, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
279 |
bool clear_space, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
280 |
bool mangle_space) |
1 | 281 |
{ |
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
282 |
CompactibleSpace::initialize(mr, clear_space, mangle_space); |
1379
ccfaefa561cd
6718086: CMS assert: _concurrent_iteration_safe_limit update missed
ysr
parents:
1376
diff
changeset
|
283 |
set_concurrent_iteration_safe_limit(top()); |
1 | 284 |
} |
285 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
286 |
void ContiguousSpace::clear(bool mangle_space) { |
1 | 287 |
set_top(bottom()); |
288 |
set_saved_mark(); |
|
1388 | 289 |
CompactibleSpace::clear(mangle_space); |
1 | 290 |
} |
291 |
||
292 |
bool ContiguousSpace::is_free_block(const HeapWord* p) const { |
|
293 |
return p >= _top; |
|
294 |
} |
|
295 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
296 |
void OffsetTableContigSpace::clear(bool mangle_space) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
297 |
ContiguousSpace::clear(mangle_space); |
1 | 298 |
_offsets.initialize_threshold(); |
299 |
} |
|
300 |
||
301 |
void OffsetTableContigSpace::set_bottom(HeapWord* new_bottom) { |
|
302 |
Space::set_bottom(new_bottom); |
|
303 |
_offsets.set_bottom(new_bottom); |
|
304 |
} |
|
305 |
||
306 |
void OffsetTableContigSpace::set_end(HeapWord* new_end) { |
|
22551 | 307 |
// Space should not advertise an increase in size |
308 |
// until after the underlying offset table has been enlarged. |
|
1 | 309 |
_offsets.resize(pointer_delta(new_end, bottom())); |
310 |
Space::set_end(new_end); |
|
311 |
} |
|
312 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
313 |
#ifndef PRODUCT |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
314 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
315 |
void ContiguousSpace::set_top_for_allocations(HeapWord* v) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
316 |
mangler()->set_top_for_allocations(v); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
317 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
318 |
void ContiguousSpace::set_top_for_allocations() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
319 |
mangler()->set_top_for_allocations(top()); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
320 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
321 |
void ContiguousSpace::check_mangled_unused_area(HeapWord* limit) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
322 |
mangler()->check_mangled_unused_area(limit); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
323 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
324 |
|
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
325 |
void ContiguousSpace::check_mangled_unused_area_complete() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
326 |
mangler()->check_mangled_unused_area_complete(); |
1 | 327 |
} |
328 |
||
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
329 |
// Mangled only the unused space that has not previously |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
330 |
// been mangled and that has not been allocated since being |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
331 |
// mangled. |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
332 |
void ContiguousSpace::mangle_unused_area() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
333 |
mangler()->mangle_unused_area(); |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
334 |
} |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
335 |
void ContiguousSpace::mangle_unused_area_complete() { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
336 |
mangler()->mangle_unused_area_complete(); |
1 | 337 |
} |
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
338 |
#endif // NOT_PRODUCT |
1 | 339 |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
340 |
void CompactibleSpace::initialize(MemRegion mr, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
341 |
bool clear_space, |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
342 |
bool mangle_space) { |
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
343 |
Space::initialize(mr, clear_space, mangle_space); |
1388 | 344 |
set_compaction_top(bottom()); |
345 |
_next_compaction_space = NULL; |
|
346 |
} |
|
347 |
||
348 |
void CompactibleSpace::clear(bool mangle_space) { |
|
349 |
Space::clear(mangle_space); |
|
1 | 350 |
_compaction_top = bottom(); |
351 |
} |
|
352 |
||
353 |
HeapWord* CompactibleSpace::forward(oop q, size_t size, |
|
354 |
CompactPoint* cp, HeapWord* compact_top) { |
|
355 |
// q is alive |
|
356 |
// First check if we should switch compaction space |
|
357 |
assert(this == cp->space, "'this' should be current compaction space."); |
|
358 |
size_t compaction_max_size = pointer_delta(end(), compact_top); |
|
359 |
while (size > compaction_max_size) { |
|
360 |
// switch to next compaction space |
|
361 |
cp->space->set_compaction_top(compact_top); |
|
362 |
cp->space = cp->space->next_compaction_space(); |
|
363 |
if (cp->space == NULL) { |
|
29684
a36d90acae41
8057632: Remove auxiliary code used to handle the generations array
jwilhelm
parents:
29681
diff
changeset
|
364 |
cp->gen = GenCollectedHeap::heap()->young_gen(); |
1 | 365 |
assert(cp->gen != NULL, "compaction must succeed"); |
366 |
cp->space = cp->gen->first_compaction_space(); |
|
367 |
assert(cp->space != NULL, "generation must have a first compaction space"); |
|
368 |
} |
|
369 |
compact_top = cp->space->bottom(); |
|
370 |
cp->space->set_compaction_top(compact_top); |
|
371 |
cp->threshold = cp->space->initialize_threshold(); |
|
372 |
compaction_max_size = pointer_delta(cp->space->end(), compact_top); |
|
373 |
} |
|
374 |
||
375 |
// store the forwarding pointer into the mark word |
|
376 |
if ((HeapWord*)q != compact_top) { |
|
377 |
q->forward_to(oop(compact_top)); |
|
378 |
assert(q->is_gc_marked(), "encoding the pointer should preserve the mark"); |
|
379 |
} else { |
|
380 |
// if the object isn't moving we can just set the mark to the default |
|
381 |
// mark and handle it specially later on. |
|
49722
a47d1e21b3f1
8199735: Mark word updates need to use Access API
rkennke
parents:
49359
diff
changeset
|
382 |
q->init_mark_raw(); |
1 | 383 |
assert(q->forwardee() == NULL, "should be forwarded to NULL"); |
384 |
} |
|
385 |
||
386 |
compact_top += size; |
|
387 |
||
388 |
// we need to update the offset table so that the beginnings of objects can be |
|
389 |
// found during scavenge. Note that we are updating the offset table based on |
|
390 |
// where the object will be once the compaction phase finishes. |
|
391 |
if (compact_top > cp->threshold) |
|
392 |
cp->threshold = |
|
393 |
cp->space->cross_threshold(compact_top - size, compact_top); |
|
394 |
return compact_top; |
|
395 |
} |
|
396 |
||
49982 | 397 |
#if INCLUDE_SERIALGC |
398 |
||
1 | 399 |
void ContiguousSpace::prepare_for_compaction(CompactPoint* cp) { |
27624
fe43edc5046d
8043243: convert SCAN_AND_FORWARD, SCAN_AND_ADJUST_POINTERS, SCAN_AND_COMPACT macros to methods
mlarsson
parents:
25905
diff
changeset
|
400 |
scan_and_forward(this, cp); |
1 | 401 |
} |
402 |
||
403 |
void CompactibleSpace::adjust_pointers() { |
|
404 |
// Check first is there is any work to do. |
|
405 |
if (used() == 0) { |
|
406 |
return; // Nothing to do. |
|
407 |
} |
|
408 |
||
27624
fe43edc5046d
8043243: convert SCAN_AND_FORWARD, SCAN_AND_ADJUST_POINTERS, SCAN_AND_COMPACT macros to methods
mlarsson
parents:
25905
diff
changeset
|
409 |
scan_and_adjust_pointers(this); |
1 | 410 |
} |
411 |
||
412 |
void CompactibleSpace::compact() { |
|
27624
fe43edc5046d
8043243: convert SCAN_AND_FORWARD, SCAN_AND_ADJUST_POINTERS, SCAN_AND_COMPACT macros to methods
mlarsson
parents:
25905
diff
changeset
|
413 |
scan_and_compact(this); |
1 | 414 |
} |
415 |
||
49982 | 416 |
#endif // INCLUDE_SERIALGC |
417 |
||
1 | 418 |
void Space::print_short() const { print_short_on(tty); } |
419 |
||
420 |
void Space::print_short_on(outputStream* st) const { |
|
421 |
st->print(" space " SIZE_FORMAT "K, %3d%% used", capacity() / K, |
|
422 |
(int) ((double) used() * 100 / capacity())); |
|
423 |
} |
|
424 |
||
425 |
void Space::print() const { print_on(tty); } |
|
426 |
||
427 |
void Space::print_on(outputStream* st) const { |
|
428 |
print_short_on(st); |
|
429 |
st->print_cr(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ")", |
|
29800
fa5f7a2bf717
8076073: shared: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC needs to be removed from source files
david
parents:
29701
diff
changeset
|
430 |
p2i(bottom()), p2i(end())); |
1 | 431 |
} |
432 |
||
433 |
void ContiguousSpace::print_on(outputStream* st) const { |
|
434 |
print_short_on(st); |
|
435 |
st->print_cr(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ", " INTPTR_FORMAT ")", |
|
29800
fa5f7a2bf717
8076073: shared: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC needs to be removed from source files
david
parents:
29701
diff
changeset
|
436 |
p2i(bottom()), p2i(top()), p2i(end())); |
1 | 437 |
} |
438 |
||
439 |
void OffsetTableContigSpace::print_on(outputStream* st) const { |
|
440 |
print_short_on(st); |
|
441 |
st->print_cr(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ", " |
|
442 |
INTPTR_FORMAT ", " INTPTR_FORMAT ")", |
|
29800
fa5f7a2bf717
8076073: shared: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC needs to be removed from source files
david
parents:
29701
diff
changeset
|
443 |
p2i(bottom()), p2i(top()), p2i(_offsets.threshold()), p2i(end())); |
1 | 444 |
} |
445 |
||
12379 | 446 |
void ContiguousSpace::verify() const { |
1 | 447 |
HeapWord* p = bottom(); |
448 |
HeapWord* t = top(); |
|
449 |
HeapWord* prev_p = NULL; |
|
450 |
while (p < t) { |
|
51268
4ac20e5f96ce
8202171: Some oopDesc functions compare this with NULL
hseigel
parents:
50801
diff
changeset
|
451 |
oopDesc::verify(oop(p)); |
1 | 452 |
prev_p = p; |
453 |
p += oop(p)->size(); |
|
454 |
} |
|
455 |
guarantee(p == top(), "end of last object must match end of space"); |
|
456 |
if (top() != end()) { |
|
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
457 |
guarantee(top() == block_start_const(end()-1) && |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
458 |
top() == block_start_const(top()), |
1 | 459 |
"top should be start of unallocated block, if it exists"); |
460 |
} |
|
461 |
} |
|
462 |
||
50752 | 463 |
void Space::oop_iterate(OopIterateClosure* blk) { |
1 | 464 |
ObjectToOopClosure blk2(blk); |
465 |
object_iterate(&blk2); |
|
466 |
} |
|
467 |
||
468 |
bool Space::obj_is_alive(const HeapWord* p) const { |
|
469 |
assert (block_is_obj(p), "The address should point to an object"); |
|
470 |
return true; |
|
471 |
} |
|
472 |
||
50752 | 473 |
void ContiguousSpace::oop_iterate(OopIterateClosure* blk) { |
1 | 474 |
if (is_empty()) return; |
475 |
HeapWord* obj_addr = bottom(); |
|
476 |
HeapWord* t = top(); |
|
477 |
// Could call objects iterate, but this is easier. |
|
478 |
while (obj_addr < t) { |
|
32606
fdaa30d06ada
8129417: Oop iteration clean-up to remove oop_ms_follow_contents
sjohanss
parents:
30870
diff
changeset
|
479 |
obj_addr += oop(obj_addr)->oop_iterate_size(blk); |
1 | 480 |
} |
481 |
} |
|
482 |
||
483 |
void ContiguousSpace::object_iterate(ObjectClosure* blk) { |
|
484 |
if (is_empty()) return; |
|
33205 | 485 |
object_iterate_from(bottom(), blk); |
1 | 486 |
} |
487 |
||
33205 | 488 |
void ContiguousSpace::object_iterate_from(HeapWord* mark, ObjectClosure* blk) { |
489 |
while (mark < top()) { |
|
490 |
blk->do_object(oop(mark)); |
|
491 |
mark += oop(mark)->size(); |
|
1 | 492 |
} |
493 |
} |
|
494 |
||
495 |
// Very general, slow implementation. |
|
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
496 |
HeapWord* ContiguousSpace::block_start_const(const void* p) const { |
14584
bd4290e6d0a5
7194633: G1: Assertion and guarantee failures in block offset table
johnc
parents:
13728
diff
changeset
|
497 |
assert(MemRegion(bottom(), end()).contains(p), |
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32606
diff
changeset
|
498 |
"p (" PTR_FORMAT ") not in space [" PTR_FORMAT ", " PTR_FORMAT ")", |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32606
diff
changeset
|
499 |
p2i(p), p2i(bottom()), p2i(end())); |
1 | 500 |
if (p >= top()) { |
501 |
return top(); |
|
502 |
} else { |
|
503 |
HeapWord* last = bottom(); |
|
504 |
HeapWord* cur = last; |
|
505 |
while (cur <= p) { |
|
506 |
last = cur; |
|
507 |
cur += oop(cur)->size(); |
|
508 |
} |
|
46968
9119841280f4
8160399: is_oop_or_null involves undefined behavior
coleenp
parents:
46625
diff
changeset
|
509 |
assert(oopDesc::is_oop(oop(last)), PTR_FORMAT " should be an object start", p2i(last)); |
1 | 510 |
return last; |
511 |
} |
|
512 |
} |
|
513 |
||
514 |
size_t ContiguousSpace::block_size(const HeapWord* p) const { |
|
14584
bd4290e6d0a5
7194633: G1: Assertion and guarantee failures in block offset table
johnc
parents:
13728
diff
changeset
|
515 |
assert(MemRegion(bottom(), end()).contains(p), |
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32606
diff
changeset
|
516 |
"p (" PTR_FORMAT ") not in space [" PTR_FORMAT ", " PTR_FORMAT ")", |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32606
diff
changeset
|
517 |
p2i(p), p2i(bottom()), p2i(end())); |
1 | 518 |
HeapWord* current_top = top(); |
14584
bd4290e6d0a5
7194633: G1: Assertion and guarantee failures in block offset table
johnc
parents:
13728
diff
changeset
|
519 |
assert(p <= current_top, |
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32606
diff
changeset
|
520 |
"p > current top - p: " PTR_FORMAT ", current top: " PTR_FORMAT, |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32606
diff
changeset
|
521 |
p2i(p), p2i(current_top)); |
46968
9119841280f4
8160399: is_oop_or_null involves undefined behavior
coleenp
parents:
46625
diff
changeset
|
522 |
assert(p == current_top || oopDesc::is_oop(oop(p)), |
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32606
diff
changeset
|
523 |
"p (" PTR_FORMAT ") is not a block start - " |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32606
diff
changeset
|
524 |
"current_top: " PTR_FORMAT ", is_oop: %s", |
46968
9119841280f4
8160399: is_oop_or_null involves undefined behavior
coleenp
parents:
46625
diff
changeset
|
525 |
p2i(p), p2i(current_top), BOOL_TO_STR(oopDesc::is_oop(oop(p)))); |
14584
bd4290e6d0a5
7194633: G1: Assertion and guarantee failures in block offset table
johnc
parents:
13728
diff
changeset
|
526 |
if (p < current_top) { |
1 | 527 |
return oop(p)->size(); |
14584
bd4290e6d0a5
7194633: G1: Assertion and guarantee failures in block offset table
johnc
parents:
13728
diff
changeset
|
528 |
} else { |
1 | 529 |
assert(p == current_top, "just checking"); |
530 |
return pointer_delta(end(), (HeapWord*) p); |
|
531 |
} |
|
532 |
} |
|
533 |
||
534 |
// This version requires locking. |
|
27625 | 535 |
inline HeapWord* ContiguousSpace::allocate_impl(size_t size) { |
1 | 536 |
assert(Heap_lock->owned_by_self() || |
25481
1427aa24638c
8047818: G1 HeapRegions can no longer be ContiguousSpaces
mgerdin
parents:
25351
diff
changeset
|
537 |
(SafepointSynchronize::is_at_safepoint() && Thread::current()->is_VM_thread()), |
1 | 538 |
"not locked"); |
539 |
HeapWord* obj = top(); |
|
27625 | 540 |
if (pointer_delta(end(), obj) >= size) { |
1 | 541 |
HeapWord* new_top = obj + size; |
542 |
set_top(new_top); |
|
543 |
assert(is_aligned(obj) && is_aligned(new_top), "checking alignment"); |
|
544 |
return obj; |
|
545 |
} else { |
|
546 |
return NULL; |
|
547 |
} |
|
548 |
} |
|
549 |
||
550 |
// This version is lock-free. |
|
27625 | 551 |
inline HeapWord* ContiguousSpace::par_allocate_impl(size_t size) { |
1 | 552 |
do { |
553 |
HeapWord* obj = top(); |
|
27625 | 554 |
if (pointer_delta(end(), obj) >= size) { |
1 | 555 |
HeapWord* new_top = obj + size; |
59252
623722a6aeb9
8234740: Harmonize parameter order in Atomic - cmpxchg
stefank
parents:
59154
diff
changeset
|
556 |
HeapWord* result = Atomic::cmpxchg(top_addr(), obj, new_top); |
1 | 557 |
// result can be one of two: |
558 |
// the old top value: the exchange succeeded |
|
559 |
// otherwise: the new value of the top is returned. |
|
560 |
if (result == obj) { |
|
561 |
assert(is_aligned(obj) && is_aligned(new_top), "checking alignment"); |
|
562 |
return obj; |
|
563 |
} |
|
564 |
} else { |
|
565 |
return NULL; |
|
566 |
} |
|
567 |
} while (true); |
|
568 |
} |
|
569 |
||
25905
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
570 |
HeapWord* ContiguousSpace::allocate_aligned(size_t size) { |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
571 |
assert(Heap_lock->owned_by_self() || (SafepointSynchronize::is_at_safepoint() && Thread::current()->is_VM_thread()), "not locked"); |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
572 |
HeapWord* end_value = end(); |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
573 |
|
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
574 |
HeapWord* obj = CollectedHeap::align_allocation_or_fail(top(), end_value, SurvivorAlignmentInBytes); |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
575 |
if (obj == NULL) { |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
576 |
return NULL; |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
577 |
} |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
578 |
|
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
579 |
if (pointer_delta(end_value, obj) >= size) { |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
580 |
HeapWord* new_top = obj + size; |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
581 |
set_top(new_top); |
46619
a3919f5e8d2b
8178499: Remove _ptr_ and _size_ infixes from align functions
stefank
parents:
46618
diff
changeset
|
582 |
assert(::is_aligned(obj, SurvivorAlignmentInBytes) && is_aligned(new_top), |
25905
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
583 |
"checking alignment"); |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
584 |
return obj; |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
585 |
} else { |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
586 |
set_top(obj); |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
587 |
return NULL; |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
588 |
} |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
589 |
} |
04a3d83cc752
8031323: Optionally align objects copied to survivor spaces
jmasa
parents:
25481
diff
changeset
|
590 |
|
1 | 591 |
// Requires locking. |
592 |
HeapWord* ContiguousSpace::allocate(size_t size) { |
|
27625 | 593 |
return allocate_impl(size); |
1 | 594 |
} |
595 |
||
596 |
// Lock-free. |
|
597 |
HeapWord* ContiguousSpace::par_allocate(size_t size) { |
|
27625 | 598 |
return par_allocate_impl(size); |
1 | 599 |
} |
600 |
||
601 |
void ContiguousSpace::allocate_temporary_filler(int factor) { |
|
602 |
// allocate temporary type array decreasing free size with factor 'factor' |
|
603 |
assert(factor >= 0, "just checking"); |
|
604 |
size_t size = pointer_delta(end(), top()); |
|
605 |
||
606 |
// if space is full, return |
|
607 |
if (size == 0) return; |
|
608 |
||
609 |
if (factor > 0) { |
|
610 |
size -= size/factor; |
|
611 |
} |
|
612 |
size = align_object_size(size); |
|
613 |
||
5694
1e0532a6abff
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
4571
diff
changeset
|
614 |
const size_t array_header_size = typeArrayOopDesc::header_size(T_INT); |
46618
d503911aa948
8178489: Make align functions more type safe and consistent
stefank
parents:
40655
diff
changeset
|
615 |
if (size >= align_object_size(array_header_size)) { |
5694
1e0532a6abff
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
4571
diff
changeset
|
616 |
size_t length = (size - array_header_size) * (HeapWordSize / sizeof(jint)); |
1 | 617 |
// allocate uninitialized int array |
618 |
typeArrayOop t = (typeArrayOop) allocate(size); |
|
619 |
assert(t != NULL, "allocation should succeed"); |
|
57777
90ead0febf56
8229258: Rework markOop and markOopDesc into a simpler mark word value carrier
stefank
parents:
51268
diff
changeset
|
620 |
t->set_mark_raw(markWord::prototype()); |
1 | 621 |
t->set_klass(Universe::intArrayKlassObj()); |
622 |
t->set_length((int)length); |
|
623 |
} else { |
|
5694
1e0532a6abff
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
4571
diff
changeset
|
624 |
assert(size == CollectedHeap::min_fill_size(), |
1 | 625 |
"size for smallest fake object doesn't match"); |
626 |
instanceOop obj = (instanceOop) allocate(size); |
|
57777
90ead0febf56
8229258: Rework markOop and markOopDesc into a simpler mark word value carrier
stefank
parents:
51268
diff
changeset
|
627 |
obj->set_mark_raw(markWord::prototype()); |
593
803947e176bd
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
360
diff
changeset
|
628 |
obj->set_klass_gap(0); |
4571 | 629 |
obj->set_klass(SystemDictionary::Object_klass()); |
1 | 630 |
} |
631 |
} |
|
632 |
||
633 |
HeapWord* OffsetTableContigSpace::initialize_threshold() { |
|
634 |
return _offsets.initialize_threshold(); |
|
635 |
} |
|
636 |
||
637 |
HeapWord* OffsetTableContigSpace::cross_threshold(HeapWord* start, HeapWord* end) { |
|
638 |
_offsets.alloc_block(start, end); |
|
639 |
return _offsets.threshold(); |
|
640 |
} |
|
641 |
||
642 |
OffsetTableContigSpace::OffsetTableContigSpace(BlockOffsetSharedArray* sharedOffsetArray, |
|
643 |
MemRegion mr) : |
|
644 |
_offsets(sharedOffsetArray, mr), |
|
645 |
_par_alloc_lock(Mutex::leaf, "OffsetTableContigSpace par alloc lock", true) |
|
646 |
{ |
|
647 |
_offsets.set_contig_space(this); |
|
971
f0b20be4165d
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
593
diff
changeset
|
648 |
initialize(mr, SpaceDecorator::Clear, SpaceDecorator::Mangle); |
1 | 649 |
} |
650 |
||
651 |
#define OBJ_SAMPLE_INTERVAL 0 |
|
652 |
#define BLOCK_SAMPLE_INTERVAL 100 |
|
653 |
||
12379 | 654 |
void OffsetTableContigSpace::verify() const { |
1 | 655 |
HeapWord* p = bottom(); |
656 |
HeapWord* prev_p = NULL; |
|
657 |
int objs = 0; |
|
658 |
int blocks = 0; |
|
659 |
||
660 |
if (VerifyObjectStartArray) { |
|
661 |
_offsets.verify(); |
|
662 |
} |
|
663 |
||
664 |
while (p < top()) { |
|
665 |
size_t size = oop(p)->size(); |
|
666 |
// For a sampling of objects in the space, find it using the |
|
667 |
// block offset table. |
|
668 |
if (blocks == BLOCK_SAMPLE_INTERVAL) { |
|
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
669 |
guarantee(p == block_start_const(p + (size/2)), |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
670 |
"check offset computation"); |
1 | 671 |
blocks = 0; |
672 |
} else { |
|
673 |
blocks++; |
|
674 |
} |
|
675 |
||
676 |
if (objs == OBJ_SAMPLE_INTERVAL) { |
|
51268
4ac20e5f96ce
8202171: Some oopDesc functions compare this with NULL
hseigel
parents:
50801
diff
changeset
|
677 |
oopDesc::verify(oop(p)); |
1 | 678 |
objs = 0; |
679 |
} else { |
|
680 |
objs++; |
|
681 |
} |
|
682 |
prev_p = p; |
|
683 |
p += size; |
|
684 |
} |
|
685 |
guarantee(p == top(), "end of last object must match end of space"); |
|
686 |
} |
|
687 |
||
688 |
||
1557 | 689 |
size_t TenuredSpace::allowed_dead_ratio() const { |
1 | 690 |
return MarkSweepDeadRatio; |
691 |
} |