Mon, 07 Nov 2011 22:11:12 -0500
7092309: G1: introduce old region set
Summary: Keep track of all the old regions in the heap with a heap region set.
Reviewed-by: brutisso, johnc
1 /*
2 * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved.
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 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #include "precompiled.hpp"
26 #include "gc_implementation/g1/collectionSetChooser.hpp"
27 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
28 #include "gc_implementation/g1/g1CollectorPolicy.hpp"
29 #include "gc_implementation/g1/g1ErgoVerbose.hpp"
30 #include "memory/space.inline.hpp"
32 CSetChooserCache::CSetChooserCache() {
33 for (int i = 0; i < CacheLength; ++i)
34 _cache[i] = NULL;
35 clear();
36 }
38 void CSetChooserCache::clear() {
39 _occupancy = 0;
40 _first = 0;
41 for (int i = 0; i < CacheLength; ++i) {
42 HeapRegion *hr = _cache[i];
43 if (hr != NULL)
44 hr->set_sort_index(-1);
45 _cache[i] = NULL;
46 }
47 }
49 #ifndef PRODUCT
50 bool CSetChooserCache::verify() {
51 int index = _first;
52 HeapRegion *prev = NULL;
53 for (int i = 0; i < _occupancy; ++i) {
54 guarantee(_cache[index] != NULL, "cache entry should not be empty");
55 HeapRegion *hr = _cache[index];
56 guarantee(!hr->is_young(), "should not be young!");
57 if (prev != NULL) {
58 guarantee(prev->gc_efficiency() >= hr->gc_efficiency(),
59 "cache should be correctly ordered");
60 }
61 guarantee(hr->sort_index() == get_sort_index(index),
62 "sort index should be correct");
63 index = trim_index(index + 1);
64 prev = hr;
65 }
67 for (int i = 0; i < (CacheLength - _occupancy); ++i) {
68 guarantee(_cache[index] == NULL, "cache entry should be empty");
69 index = trim_index(index + 1);
70 }
72 guarantee(index == _first, "we should have reached where we started from");
73 return true;
74 }
75 #endif // PRODUCT
77 void CSetChooserCache::insert(HeapRegion *hr) {
78 assert(!is_full(), "cache should not be empty");
79 hr->calc_gc_efficiency();
81 int empty_index;
82 if (_occupancy == 0) {
83 empty_index = _first;
84 } else {
85 empty_index = trim_index(_first + _occupancy);
86 assert(_cache[empty_index] == NULL, "last slot should be empty");
87 int last_index = trim_index(empty_index - 1);
88 HeapRegion *last = _cache[last_index];
89 assert(last != NULL,"as the cache is not empty, last should not be empty");
90 while (empty_index != _first &&
91 last->gc_efficiency() < hr->gc_efficiency()) {
92 _cache[empty_index] = last;
93 last->set_sort_index(get_sort_index(empty_index));
94 empty_index = last_index;
95 last_index = trim_index(last_index - 1);
96 last = _cache[last_index];
97 }
98 }
99 _cache[empty_index] = hr;
100 hr->set_sort_index(get_sort_index(empty_index));
102 ++_occupancy;
103 assert(verify(), "cache should be consistent");
104 }
106 HeapRegion *CSetChooserCache::remove_first() {
107 if (_occupancy > 0) {
108 assert(_cache[_first] != NULL, "cache should have at least one region");
109 HeapRegion *ret = _cache[_first];
110 _cache[_first] = NULL;
111 ret->set_sort_index(-1);
112 --_occupancy;
113 _first = trim_index(_first + 1);
114 assert(verify(), "cache should be consistent");
115 return ret;
116 } else {
117 return NULL;
118 }
119 }
121 static inline int orderRegions(HeapRegion* hr1, HeapRegion* hr2) {
122 if (hr1 == NULL) {
123 if (hr2 == NULL) return 0;
124 else return 1;
125 } else if (hr2 == NULL) {
126 return -1;
127 }
128 if (hr2->gc_efficiency() < hr1->gc_efficiency()) return -1;
129 else if (hr1->gc_efficiency() < hr2->gc_efficiency()) return 1;
130 else return 0;
131 }
133 static int orderRegions(HeapRegion** hr1p, HeapRegion** hr2p) {
134 return orderRegions(*hr1p, *hr2p);
135 }
137 CollectionSetChooser::CollectionSetChooser() :
138 // The line below is the worst bit of C++ hackery I've ever written
139 // (Detlefs, 11/23). You should think of it as equivalent to
140 // "_regions(100, true)": initialize the growable array and inform it
141 // that it should allocate its elem array(s) on the C heap.
142 //
143 // The first argument, however, is actually a comma expression
144 // (set_allocation_type(this, C_HEAP), 100). The purpose of the
145 // set_allocation_type() call is to replace the default allocation
146 // type for embedded objects STACK_OR_EMBEDDED with C_HEAP. It will
147 // allow to pass the assert in GenericGrowableArray() which checks
148 // that a growable array object must be on C heap if elements are.
149 //
150 // Note: containing object is allocated on C heap since it is CHeapObj.
151 //
152 _markedRegions((ResourceObj::set_allocation_type((address)&_markedRegions,
153 ResourceObj::C_HEAP),
154 100),
155 true),
156 _curMarkedIndex(0),
157 _numMarkedRegions(0),
158 _unmarked_age_1_returned_as_new(false),
159 _first_par_unreserved_idx(0)
160 {}
164 #ifndef PRODUCT
165 bool CollectionSetChooser::verify() {
166 int index = 0;
167 guarantee(_curMarkedIndex <= _numMarkedRegions,
168 "_curMarkedIndex should be within bounds");
169 while (index < _curMarkedIndex) {
170 guarantee(_markedRegions.at(index++) == NULL,
171 "all entries before _curMarkedIndex should be NULL");
172 }
173 HeapRegion *prev = NULL;
174 while (index < _numMarkedRegions) {
175 HeapRegion *curr = _markedRegions.at(index++);
176 guarantee(curr != NULL, "Regions in _markedRegions array cannot be NULL");
177 int si = curr->sort_index();
178 guarantee(!curr->is_young(), "should not be young!");
179 guarantee(si > -1 && si == (index-1), "sort index invariant");
180 if (prev != NULL) {
181 guarantee(orderRegions(prev, curr) != 1, "regions should be sorted");
182 }
183 prev = curr;
184 }
185 return _cache.verify();
186 }
187 #endif
189 void
190 CollectionSetChooser::fillCache() {
191 while (!_cache.is_full() && (_curMarkedIndex < _numMarkedRegions)) {
192 HeapRegion* hr = _markedRegions.at(_curMarkedIndex);
193 assert(hr != NULL,
194 err_msg("Unexpected NULL hr in _markedRegions at index %d",
195 _curMarkedIndex));
196 _curMarkedIndex += 1;
197 assert(!hr->is_young(), "should not be young!");
198 assert(hr->sort_index() == _curMarkedIndex-1, "sort_index invariant");
199 _markedRegions.at_put(hr->sort_index(), NULL);
200 _cache.insert(hr);
201 assert(!_cache.is_empty(), "cache should not be empty");
202 }
203 assert(verify(), "cache should be consistent");
204 }
206 void
207 CollectionSetChooser::sortMarkedHeapRegions() {
208 guarantee(_cache.is_empty(), "cache should be empty");
209 // First trim any unused portion of the top in the parallel case.
210 if (_first_par_unreserved_idx > 0) {
211 if (G1PrintParCleanupStats) {
212 gclog_or_tty->print(" Truncating _markedRegions from %d to %d.\n",
213 _markedRegions.length(), _first_par_unreserved_idx);
214 }
215 assert(_first_par_unreserved_idx <= _markedRegions.length(),
216 "Or we didn't reserved enough length");
217 _markedRegions.trunc_to(_first_par_unreserved_idx);
218 }
219 _markedRegions.sort(orderRegions);
220 assert(_numMarkedRegions <= _markedRegions.length(), "Requirement");
221 assert(_numMarkedRegions == 0
222 || _markedRegions.at(_numMarkedRegions-1) != NULL,
223 "Testing _numMarkedRegions");
224 assert(_numMarkedRegions == _markedRegions.length()
225 || _markedRegions.at(_numMarkedRegions) == NULL,
226 "Testing _numMarkedRegions");
227 if (G1PrintParCleanupStats) {
228 gclog_or_tty->print_cr(" Sorted %d marked regions.", _numMarkedRegions);
229 }
230 for (int i = 0; i < _numMarkedRegions; i++) {
231 assert(_markedRegions.at(i) != NULL, "Should be true by sorting!");
232 _markedRegions.at(i)->set_sort_index(i);
233 }
234 if (G1PrintRegionLivenessInfo) {
235 G1PrintRegionLivenessInfoClosure cl(gclog_or_tty, "Post-Sorting");
236 for (int i = 0; i < _numMarkedRegions; ++i) {
237 HeapRegion* r = _markedRegions.at(i);
238 cl.doHeapRegion(r);
239 }
240 }
241 assert(verify(), "should now be sorted");
242 }
244 void
245 CollectionSetChooser::addMarkedHeapRegion(HeapRegion* hr) {
246 assert(!hr->isHumongous(),
247 "Humongous regions shouldn't be added to the collection set");
248 assert(!hr->is_young(), "should not be young!");
249 _markedRegions.append(hr);
250 _numMarkedRegions++;
251 hr->calc_gc_efficiency();
252 }
254 void
255 CollectionSetChooser::
256 prepareForAddMarkedHeapRegionsPar(size_t n_regions, size_t chunkSize) {
257 _first_par_unreserved_idx = 0;
258 size_t max_waste = ParallelGCThreads * chunkSize;
259 // it should be aligned with respect to chunkSize
260 size_t aligned_n_regions =
261 (n_regions + (chunkSize - 1)) / chunkSize * chunkSize;
262 assert( aligned_n_regions % chunkSize == 0, "should be aligned" );
263 _markedRegions.at_put_grow((int)(aligned_n_regions + max_waste - 1), NULL);
264 }
266 jint
267 CollectionSetChooser::getParMarkedHeapRegionChunk(jint n_regions) {
268 jint res = Atomic::add(n_regions, &_first_par_unreserved_idx);
269 assert(_markedRegions.length() > res + n_regions - 1,
270 "Should already have been expanded");
271 return res - n_regions;
272 }
274 void
275 CollectionSetChooser::setMarkedHeapRegion(jint index, HeapRegion* hr) {
276 assert(_markedRegions.at(index) == NULL, "precondition");
277 assert(!hr->is_young(), "should not be young!");
278 _markedRegions.at_put(index, hr);
279 hr->calc_gc_efficiency();
280 }
282 void
283 CollectionSetChooser::incNumMarkedHeapRegions(jint inc_by) {
284 (void)Atomic::add(inc_by, &_numMarkedRegions);
285 }
287 void
288 CollectionSetChooser::clearMarkedHeapRegions(){
289 for (int i = 0; i < _markedRegions.length(); i++) {
290 HeapRegion* r = _markedRegions.at(i);
291 if (r != NULL) r->set_sort_index(-1);
292 }
293 _markedRegions.clear();
294 _curMarkedIndex = 0;
295 _numMarkedRegions = 0;
296 _cache.clear();
297 };
299 void
300 CollectionSetChooser::updateAfterFullCollection() {
301 clearMarkedHeapRegions();
302 }
304 // if time_remaining < 0.0, then this method should try to return
305 // a region, whether it fits within the remaining time or not
306 HeapRegion*
307 CollectionSetChooser::getNextMarkedRegion(double time_remaining,
308 double avg_prediction) {
309 G1CollectedHeap* g1h = G1CollectedHeap::heap();
310 G1CollectorPolicy* g1p = g1h->g1_policy();
311 fillCache();
312 if (_cache.is_empty()) {
313 assert(_curMarkedIndex == _numMarkedRegions,
314 "if cache is empty, list should also be empty");
315 ergo_verbose0(ErgoCSetConstruction,
316 "stop adding old regions to CSet",
317 ergo_format_reason("cache is empty"));
318 return NULL;
319 }
321 HeapRegion *hr = _cache.get_first();
322 assert(hr != NULL, "if cache not empty, first entry should be non-null");
323 double predicted_time = g1h->predict_region_elapsed_time_ms(hr, false);
325 if (g1p->adaptive_young_list_length()) {
326 if (time_remaining - predicted_time < 0.0) {
327 g1h->check_if_region_is_too_expensive(predicted_time);
328 ergo_verbose2(ErgoCSetConstruction,
329 "stop adding old regions to CSet",
330 ergo_format_reason("predicted old region time higher than remaining time")
331 ergo_format_ms("predicted old region time")
332 ergo_format_ms("remaining time"),
333 predicted_time, time_remaining);
334 return NULL;
335 }
336 } else {
337 double threshold = 2.0 * avg_prediction;
338 if (predicted_time > threshold) {
339 ergo_verbose2(ErgoCSetConstruction,
340 "stop adding old regions to CSet",
341 ergo_format_reason("predicted old region time higher than threshold")
342 ergo_format_ms("predicted old region time")
343 ergo_format_ms("threshold"),
344 predicted_time, threshold);
345 return NULL;
346 }
347 }
349 HeapRegion *hr2 = _cache.remove_first();
350 assert(hr == hr2, "cache contents should not have changed");
352 return hr;
353 }