Print this page
rev 3463 : 7114678: G1: various small fixes, code cleanup, and refactoring
Summary: Various cleanups as a prelude to introducing iterators for HeapRegions.
Reviewed-by: johnc
Contributed-by: tonyp
Split |
Close |
Expand all |
Collapse all |
--- old/src/share/vm/gc_implementation/g1/heapRegion.cpp
+++ new/src/share/vm/gc_implementation/g1/heapRegion.cpp
1 1 /*
2 2 * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #include "precompiled.hpp"
26 26 #include "gc_implementation/g1/g1BlockOffsetTable.inline.hpp"
27 27 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
28 28 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
29 29 #include "gc_implementation/g1/heapRegion.inline.hpp"
30 30 #include "gc_implementation/g1/heapRegionRemSet.hpp"
31 31 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
32 32 #include "memory/genOopClosures.inline.hpp"
33 33 #include "memory/iterator.hpp"
34 34 #include "oops/oop.inline.hpp"
35 35
36 36 int HeapRegion::LogOfHRGrainBytes = 0;
↓ open down ↓ |
36 lines elided |
↑ open up ↑ |
37 37 int HeapRegion::LogOfHRGrainWords = 0;
38 38 size_t HeapRegion::GrainBytes = 0;
39 39 size_t HeapRegion::GrainWords = 0;
40 40 size_t HeapRegion::CardsPerRegion = 0;
41 41
42 42 HeapRegionDCTOC::HeapRegionDCTOC(G1CollectedHeap* g1,
43 43 HeapRegion* hr, OopClosure* cl,
44 44 CardTableModRefBS::PrecisionStyle precision,
45 45 FilterKind fk) :
46 46 ContiguousSpaceDCTOC(hr, cl, precision, NULL),
47 - _hr(hr), _fk(fk), _g1(g1)
48 -{ }
47 + _hr(hr), _fk(fk), _g1(g1) { }
49 48
50 49 FilterOutOfRegionClosure::FilterOutOfRegionClosure(HeapRegion* r,
51 50 OopClosure* oc) :
52 - _r_bottom(r->bottom()), _r_end(r->end()),
53 - _oc(oc), _out_of_region(0)
54 -{}
51 + _r_bottom(r->bottom()), _r_end(r->end()), _oc(oc) { }
55 52
56 53 class VerifyLiveClosure: public OopClosure {
57 54 private:
58 55 G1CollectedHeap* _g1h;
59 56 CardTableModRefBS* _bs;
60 57 oop _containing_obj;
61 58 bool _failures;
62 59 int _n_failures;
63 60 VerifyOption _vo;
64 61 public:
65 62 // _vo == UsePrevMarking -> use "prev" marking information,
66 63 // _vo == UseNextMarking -> use "next" marking information,
67 64 // _vo == UseMarkWord -> use mark word from object header.
68 65 VerifyLiveClosure(G1CollectedHeap* g1h, VerifyOption vo) :
69 66 _g1h(g1h), _bs(NULL), _containing_obj(NULL),
70 67 _failures(false), _n_failures(0), _vo(vo)
71 68 {
72 69 BarrierSet* bs = _g1h->barrier_set();
73 70 if (bs->is_a(BarrierSet::CardTableModRef))
74 71 _bs = (CardTableModRefBS*)bs;
75 72 }
76 73
77 74 void set_containing_obj(oop obj) {
78 75 _containing_obj = obj;
79 76 }
80 77
81 78 bool failures() { return _failures; }
82 79 int n_failures() { return _n_failures; }
83 80
84 81 virtual void do_oop(narrowOop* p) { do_oop_work(p); }
85 82 virtual void do_oop( oop* p) { do_oop_work(p); }
86 83
87 84 void print_object(outputStream* out, oop obj) {
88 85 #ifdef PRODUCT
89 86 klassOop k = obj->klass();
90 87 const char* class_name = instanceKlass::cast(k)->external_name();
91 88 out->print_cr("class name %s", class_name);
92 89 #else // PRODUCT
93 90 obj->print_on(out);
94 91 #endif // PRODUCT
95 92 }
96 93
97 94 template <class T>
98 95 void do_oop_work(T* p) {
99 96 assert(_containing_obj != NULL, "Precondition");
100 97 assert(!_g1h->is_obj_dead_cond(_containing_obj, _vo),
101 98 "Precondition");
102 99 T heap_oop = oopDesc::load_heap_oop(p);
103 100 if (!oopDesc::is_null(heap_oop)) {
104 101 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
105 102 bool failed = false;
106 103 if (!_g1h->is_in_closed_subset(obj) || _g1h->is_obj_dead_cond(obj, _vo)) {
107 104 MutexLockerEx x(ParGCRareEvent_lock,
108 105 Mutex::_no_safepoint_check_flag);
109 106
110 107 if (!_failures) {
111 108 gclog_or_tty->print_cr("");
112 109 gclog_or_tty->print_cr("----------");
113 110 }
114 111 if (!_g1h->is_in_closed_subset(obj)) {
115 112 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
116 113 gclog_or_tty->print_cr("Field "PTR_FORMAT
117 114 " of live obj "PTR_FORMAT" in region "
118 115 "["PTR_FORMAT", "PTR_FORMAT")",
119 116 p, (void*) _containing_obj,
120 117 from->bottom(), from->end());
121 118 print_object(gclog_or_tty, _containing_obj);
122 119 gclog_or_tty->print_cr("points to obj "PTR_FORMAT" not in the heap",
123 120 (void*) obj);
124 121 } else {
125 122 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
126 123 HeapRegion* to = _g1h->heap_region_containing((HeapWord*)obj);
127 124 gclog_or_tty->print_cr("Field "PTR_FORMAT
128 125 " of live obj "PTR_FORMAT" in region "
129 126 "["PTR_FORMAT", "PTR_FORMAT")",
130 127 p, (void*) _containing_obj,
131 128 from->bottom(), from->end());
132 129 print_object(gclog_or_tty, _containing_obj);
133 130 gclog_or_tty->print_cr("points to dead obj "PTR_FORMAT" in region "
134 131 "["PTR_FORMAT", "PTR_FORMAT")",
135 132 (void*) obj, to->bottom(), to->end());
136 133 print_object(gclog_or_tty, obj);
137 134 }
138 135 gclog_or_tty->print_cr("----------");
139 136 gclog_or_tty->flush();
140 137 _failures = true;
141 138 failed = true;
142 139 _n_failures++;
143 140 }
144 141
145 142 if (!_g1h->full_collection()) {
146 143 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
147 144 HeapRegion* to = _g1h->heap_region_containing(obj);
148 145 if (from != NULL && to != NULL &&
149 146 from != to &&
150 147 !to->isHumongous()) {
151 148 jbyte cv_obj = *_bs->byte_for_const(_containing_obj);
152 149 jbyte cv_field = *_bs->byte_for_const(p);
153 150 const jbyte dirty = CardTableModRefBS::dirty_card_val();
154 151
155 152 bool is_bad = !(from->is_young()
156 153 || to->rem_set()->contains_reference(p)
157 154 || !G1HRRSFlushLogBuffersOnVerify && // buffers were not flushed
158 155 (_containing_obj->is_objArray() ?
159 156 cv_field == dirty
160 157 : cv_obj == dirty || cv_field == dirty));
161 158 if (is_bad) {
162 159 MutexLockerEx x(ParGCRareEvent_lock,
163 160 Mutex::_no_safepoint_check_flag);
164 161
165 162 if (!_failures) {
166 163 gclog_or_tty->print_cr("");
167 164 gclog_or_tty->print_cr("----------");
168 165 }
169 166 gclog_or_tty->print_cr("Missing rem set entry:");
170 167 gclog_or_tty->print_cr("Field "PTR_FORMAT" "
171 168 "of obj "PTR_FORMAT", "
172 169 "in region "HR_FORMAT,
173 170 p, (void*) _containing_obj,
174 171 HR_FORMAT_PARAMS(from));
175 172 _containing_obj->print_on(gclog_or_tty);
176 173 gclog_or_tty->print_cr("points to obj "PTR_FORMAT" "
177 174 "in region "HR_FORMAT,
178 175 (void*) obj,
179 176 HR_FORMAT_PARAMS(to));
180 177 obj->print_on(gclog_or_tty);
181 178 gclog_or_tty->print_cr("Obj head CTE = %d, field CTE = %d.",
182 179 cv_obj, cv_field);
183 180 gclog_or_tty->print_cr("----------");
184 181 gclog_or_tty->flush();
185 182 _failures = true;
186 183 if (!failed) _n_failures++;
187 184 }
188 185 }
189 186 }
190 187 }
191 188 }
192 189 };
193 190
194 191 template<class ClosureType>
195 192 HeapWord* walk_mem_region_loop(ClosureType* cl, G1CollectedHeap* g1h,
196 193 HeapRegion* hr,
197 194 HeapWord* cur, HeapWord* top) {
198 195 oop cur_oop = oop(cur);
199 196 int oop_size = cur_oop->size();
200 197 HeapWord* next_obj = cur + oop_size;
201 198 while (next_obj < top) {
202 199 // Keep filtering the remembered set.
203 200 if (!g1h->is_obj_dead(cur_oop, hr)) {
204 201 // Bottom lies entirely below top, so we can call the
205 202 // non-memRegion version of oop_iterate below.
206 203 cur_oop->oop_iterate(cl);
207 204 }
208 205 cur = next_obj;
209 206 cur_oop = oop(cur);
210 207 oop_size = cur_oop->size();
211 208 next_obj = cur + oop_size;
212 209 }
213 210 return cur;
214 211 }
215 212
216 213 void HeapRegionDCTOC::walk_mem_region_with_cl(MemRegion mr,
217 214 HeapWord* bottom,
218 215 HeapWord* top,
219 216 OopClosure* cl) {
220 217 G1CollectedHeap* g1h = _g1;
221 218 int oop_size;
222 219 OopClosure* cl2 = NULL;
223 220
224 221 FilterIntoCSClosure intoCSFilt(this, g1h, cl);
225 222 FilterOutOfRegionClosure outOfRegionFilt(_hr, cl);
226 223
227 224 switch (_fk) {
228 225 case NoFilterKind: cl2 = cl; break;
229 226 case IntoCSFilterKind: cl2 = &intoCSFilt; break;
230 227 case OutOfRegionFilterKind: cl2 = &outOfRegionFilt; break;
231 228 default: ShouldNotReachHere();
232 229 }
233 230
234 231 // Start filtering what we add to the remembered set. If the object is
235 232 // not considered dead, either because it is marked (in the mark bitmap)
236 233 // or it was allocated after marking finished, then we add it. Otherwise
237 234 // we can safely ignore the object.
238 235 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
239 236 oop_size = oop(bottom)->oop_iterate(cl2, mr);
240 237 } else {
241 238 oop_size = oop(bottom)->size();
242 239 }
243 240
244 241 bottom += oop_size;
245 242
246 243 if (bottom < top) {
247 244 // We replicate the loop below for several kinds of possible filters.
248 245 switch (_fk) {
249 246 case NoFilterKind:
250 247 bottom = walk_mem_region_loop(cl, g1h, _hr, bottom, top);
251 248 break;
252 249
253 250 case IntoCSFilterKind: {
254 251 FilterIntoCSClosure filt(this, g1h, cl);
255 252 bottom = walk_mem_region_loop(&filt, g1h, _hr, bottom, top);
256 253 break;
257 254 }
258 255
259 256 case OutOfRegionFilterKind: {
260 257 FilterOutOfRegionClosure filt(_hr, cl);
261 258 bottom = walk_mem_region_loop(&filt, g1h, _hr, bottom, top);
262 259 break;
263 260 }
264 261
265 262 default:
266 263 ShouldNotReachHere();
267 264 }
268 265
269 266 // Last object. Need to do dead-obj filtering here too.
270 267 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
271 268 oop(bottom)->oop_iterate(cl2, mr);
272 269 }
273 270 }
274 271 }
275 272
276 273 // Minimum region size; we won't go lower than that.
277 274 // We might want to decrease this in the future, to deal with small
278 275 // heaps a bit more efficiently.
279 276 #define MIN_REGION_SIZE ( 1024 * 1024 )
280 277
281 278 // Maximum region size; we don't go higher than that. There's a good
282 279 // reason for having an upper bound. We don't want regions to get too
283 280 // large, otherwise cleanup's effectiveness would decrease as there
284 281 // will be fewer opportunities to find totally empty regions after
285 282 // marking.
286 283 #define MAX_REGION_SIZE ( 32 * 1024 * 1024 )
287 284
288 285 // The automatic region size calculation will try to have around this
289 286 // many regions in the heap (based on the min heap size).
290 287 #define TARGET_REGION_NUMBER 2048
291 288
292 289 void HeapRegion::setup_heap_region_size(uintx min_heap_size) {
293 290 // region_size in bytes
294 291 uintx region_size = G1HeapRegionSize;
295 292 if (FLAG_IS_DEFAULT(G1HeapRegionSize)) {
296 293 // We base the automatic calculation on the min heap size. This
297 294 // can be problematic if the spread between min and max is quite
298 295 // wide, imagine -Xms128m -Xmx32g. But, if we decided it based on
299 296 // the max size, the region size might be way too large for the
300 297 // min size. Either way, some users might have to set the region
301 298 // size manually for some -Xms / -Xmx combos.
302 299
303 300 region_size = MAX2(min_heap_size / TARGET_REGION_NUMBER,
304 301 (uintx) MIN_REGION_SIZE);
305 302 }
306 303
307 304 int region_size_log = log2_long((jlong) region_size);
308 305 // Recalculate the region size to make sure it's a power of
309 306 // 2. This means that region_size is the largest power of 2 that's
310 307 // <= what we've calculated so far.
311 308 region_size = ((uintx)1 << region_size_log);
312 309
313 310 // Now make sure that we don't go over or under our limits.
314 311 if (region_size < MIN_REGION_SIZE) {
315 312 region_size = MIN_REGION_SIZE;
316 313 } else if (region_size > MAX_REGION_SIZE) {
317 314 region_size = MAX_REGION_SIZE;
318 315 }
319 316
320 317 // And recalculate the log.
321 318 region_size_log = log2_long((jlong) region_size);
322 319
323 320 // Now, set up the globals.
324 321 guarantee(LogOfHRGrainBytes == 0, "we should only set it once");
325 322 LogOfHRGrainBytes = region_size_log;
326 323
327 324 guarantee(LogOfHRGrainWords == 0, "we should only set it once");
328 325 LogOfHRGrainWords = LogOfHRGrainBytes - LogHeapWordSize;
329 326
330 327 guarantee(GrainBytes == 0, "we should only set it once");
331 328 // The cast to int is safe, given that we've bounded region_size by
332 329 // MIN_REGION_SIZE and MAX_REGION_SIZE.
333 330 GrainBytes = (size_t)region_size;
334 331
335 332 guarantee(GrainWords == 0, "we should only set it once");
336 333 GrainWords = GrainBytes >> LogHeapWordSize;
337 334 guarantee((size_t) 1 << LogOfHRGrainWords == GrainWords, "sanity");
338 335
339 336 guarantee(CardsPerRegion == 0, "we should only set it once");
340 337 CardsPerRegion = GrainBytes >> CardTableModRefBS::card_shift;
341 338 }
342 339
343 340 void HeapRegion::reset_after_compaction() {
344 341 G1OffsetTableContigSpace::reset_after_compaction();
345 342 // After a compaction the mark bitmap is invalid, so we must
346 343 // treat all objects as being inside the unmarked area.
347 344 zero_marked_bytes();
348 345 init_top_at_mark_start();
349 346 }
350 347
351 348 void HeapRegion::hr_clear(bool par, bool clear_space) {
352 349 assert(_humongous_type == NotHumongous,
353 350 "we should have already filtered out humongous regions");
354 351 assert(_humongous_start_region == NULL,
355 352 "we should have already filtered out humongous regions");
356 353 assert(_end == _orig_end,
357 354 "we should have already filtered out humongous regions");
358 355
359 356 _in_collection_set = false;
360 357
361 358 set_young_index_in_cset(-1);
362 359 uninstall_surv_rate_group();
363 360 set_young_type(NotYoung);
364 361 reset_pre_dummy_top();
365 362
366 363 if (!par) {
367 364 // If this is parallel, this will be done later.
368 365 HeapRegionRemSet* hrrs = rem_set();
369 366 if (hrrs != NULL) hrrs->clear();
370 367 _claimed = InitialClaimValue;
371 368 }
372 369 zero_marked_bytes();
373 370
374 371 _offsets.resize(HeapRegion::GrainWords);
375 372 init_top_at_mark_start();
376 373 if (clear_space) clear(SpaceDecorator::Mangle);
377 374 }
378 375
379 376 void HeapRegion::par_clear() {
380 377 assert(used() == 0, "the region should have been already cleared");
381 378 assert(capacity() == HeapRegion::GrainBytes, "should be back to normal");
382 379 HeapRegionRemSet* hrrs = rem_set();
383 380 hrrs->clear();
384 381 CardTableModRefBS* ct_bs =
385 382 (CardTableModRefBS*)G1CollectedHeap::heap()->barrier_set();
386 383 ct_bs->clear(MemRegion(bottom(), end()));
387 384 }
388 385
389 386 void HeapRegion::calc_gc_efficiency() {
390 387 G1CollectedHeap* g1h = G1CollectedHeap::heap();
391 388 G1CollectorPolicy* g1p = g1h->g1_policy();
392 389 _gc_efficiency = (double) reclaimable_bytes() /
393 390 g1p->predict_region_elapsed_time_ms(this, false);
394 391 }
395 392
396 393 void HeapRegion::set_startsHumongous(HeapWord* new_top, HeapWord* new_end) {
397 394 assert(!isHumongous(), "sanity / pre-condition");
398 395 assert(end() == _orig_end,
399 396 "Should be normal before the humongous object allocation");
400 397 assert(top() == bottom(), "should be empty");
401 398 assert(bottom() <= new_top && new_top <= new_end, "pre-condition");
402 399
403 400 _humongous_type = StartsHumongous;
404 401 _humongous_start_region = this;
405 402
406 403 set_end(new_end);
407 404 _offsets.set_for_starts_humongous(new_top);
408 405 }
409 406
410 407 void HeapRegion::set_continuesHumongous(HeapRegion* first_hr) {
411 408 assert(!isHumongous(), "sanity / pre-condition");
412 409 assert(end() == _orig_end,
413 410 "Should be normal before the humongous object allocation");
414 411 assert(top() == bottom(), "should be empty");
415 412 assert(first_hr->startsHumongous(), "pre-condition");
416 413
417 414 _humongous_type = ContinuesHumongous;
418 415 _humongous_start_region = first_hr;
419 416 }
420 417
421 418 void HeapRegion::set_notHumongous() {
422 419 assert(isHumongous(), "pre-condition");
423 420
424 421 if (startsHumongous()) {
425 422 assert(top() <= end(), "pre-condition");
426 423 set_end(_orig_end);
427 424 if (top() > end()) {
428 425 // at least one "continues humongous" region after it
429 426 set_top(end());
430 427 }
431 428 } else {
432 429 // continues humongous
433 430 assert(end() == _orig_end, "sanity");
434 431 }
435 432
436 433 assert(capacity() == HeapRegion::GrainBytes, "pre-condition");
437 434 _humongous_type = NotHumongous;
438 435 _humongous_start_region = NULL;
439 436 }
440 437
441 438 bool HeapRegion::claimHeapRegion(jint claimValue) {
442 439 jint current = _claimed;
443 440 if (current != claimValue) {
444 441 jint res = Atomic::cmpxchg(claimValue, &_claimed, current);
445 442 if (res == current) {
446 443 return true;
447 444 }
448 445 }
449 446 return false;
450 447 }
451 448
452 449 HeapWord* HeapRegion::next_block_start_careful(HeapWord* addr) {
453 450 HeapWord* low = addr;
454 451 HeapWord* high = end();
455 452 while (low < high) {
456 453 size_t diff = pointer_delta(high, low);
457 454 // Must add one below to bias toward the high amount. Otherwise, if
458 455 // "high" were at the desired value, and "low" were one less, we
459 456 // would not converge on "high". This is not symmetric, because
460 457 // we set "high" to a block start, which might be the right one,
461 458 // which we don't do for "low".
462 459 HeapWord* middle = low + (diff+1)/2;
463 460 if (middle == high) return high;
464 461 HeapWord* mid_bs = block_start_careful(middle);
465 462 if (mid_bs < addr) {
466 463 low = middle;
467 464 } else {
468 465 high = mid_bs;
469 466 }
470 467 }
471 468 assert(low == high && low >= addr, "Didn't work.");
472 469 return low;
473 470 }
474 471
475 472 void HeapRegion::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
476 473 G1OffsetTableContigSpace::initialize(mr, false, mangle_space);
477 474 hr_clear(false/*par*/, clear_space);
478 475 }
479 476 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
480 477 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
481 478 #endif // _MSC_VER
482 479
483 480
484 481 HeapRegion::HeapRegion(uint hrs_index,
485 482 G1BlockOffsetSharedArray* sharedOffsetArray,
486 483 MemRegion mr, bool is_zeroed) :
487 484 G1OffsetTableContigSpace(sharedOffsetArray, mr, is_zeroed),
488 485 _hrs_index(hrs_index),
489 486 _humongous_type(NotHumongous), _humongous_start_region(NULL),
490 487 _in_collection_set(false),
491 488 _next_in_special_set(NULL), _orig_end(NULL),
492 489 _claimed(InitialClaimValue), _evacuation_failed(false),
493 490 _prev_marked_bytes(0), _next_marked_bytes(0), _gc_efficiency(0.0),
494 491 _young_type(NotYoung), _next_young_region(NULL),
495 492 _next_dirty_cards_region(NULL), _next(NULL), _pending_removal(false),
496 493 #ifdef ASSERT
497 494 _containing_set(NULL),
498 495 #endif // ASSERT
499 496 _young_index_in_cset(-1), _surv_rate_group(NULL), _age_index(-1),
500 497 _rem_set(NULL), _recorded_rs_length(0), _predicted_elapsed_time_ms(0),
501 498 _predicted_bytes_to_copy(0)
502 499 {
503 500 _orig_end = mr.end();
504 501 // Note that initialize() will set the start of the unmarked area of the
↓ open down ↓ |
440 lines elided |
↑ open up ↑ |
505 502 // region.
506 503 this->initialize(mr, !is_zeroed, SpaceDecorator::Mangle);
507 504 set_top(bottom());
508 505 set_saved_mark();
509 506
510 507 _rem_set = new HeapRegionRemSet(sharedOffsetArray, this);
511 508
512 509 assert(HeapRegionRemSet::num_par_rem_sets() > 0, "Invariant.");
513 510 }
514 511
515 -class NextCompactionHeapRegionClosure: public HeapRegionClosure {
516 - const HeapRegion* _target;
517 - bool _target_seen;
518 - HeapRegion* _last;
519 - CompactibleSpace* _res;
520 -public:
521 - NextCompactionHeapRegionClosure(const HeapRegion* target) :
522 - _target(target), _target_seen(false), _res(NULL) {}
523 - bool doHeapRegion(HeapRegion* cur) {
524 - if (_target_seen) {
525 - if (!cur->isHumongous()) {
526 - _res = cur;
527 - return true;
528 - }
529 - } else if (cur == _target) {
530 - _target_seen = true;
531 - }
532 - return false;
533 - }
534 - CompactibleSpace* result() { return _res; }
535 -};
536 -
537 512 CompactibleSpace* HeapRegion::next_compaction_space() const {
513 + // We're not using an iterator given that it will wrap around when
514 + // it reaches the last region and this is not what we want here.
538 515 G1CollectedHeap* g1h = G1CollectedHeap::heap();
539 - // cast away const-ness
540 - HeapRegion* r = (HeapRegion*) this;
541 - NextCompactionHeapRegionClosure blk(r);
542 - g1h->heap_region_iterate_from(r, &blk);
543 - return blk.result();
516 + uint index = hrs_index() + 1;
517 + while (index < g1h->n_regions()) {
518 + HeapRegion* hr = g1h->region_at(index);
519 + if (!hr->isHumongous()) {
520 + return hr;
521 + }
522 + index += 1;
523 + }
524 + return NULL;
544 525 }
545 526
546 527 void HeapRegion::save_marks() {
547 528 set_saved_mark();
548 529 }
549 530
550 531 void HeapRegion::oops_in_mr_iterate(MemRegion mr, OopClosure* cl) {
551 532 HeapWord* p = mr.start();
552 533 HeapWord* e = mr.end();
553 534 oop obj;
554 535 while (p < e) {
555 536 obj = oop(p);
556 537 p += obj->oop_iterate(cl);
557 538 }
558 539 assert(p == e, "bad memregion: doesn't end on obj boundary");
559 540 }
560 541
561 542 #define HeapRegion_OOP_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \
562 543 void HeapRegion::oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl) { \
563 544 ContiguousSpace::oop_since_save_marks_iterate##nv_suffix(cl); \
564 545 }
565 546 SPECIALIZED_SINCE_SAVE_MARKS_CLOSURES(HeapRegion_OOP_SINCE_SAVE_MARKS_DEFN)
566 547
567 548
568 549 void HeapRegion::oop_before_save_marks_iterate(OopClosure* cl) {
569 550 oops_in_mr_iterate(MemRegion(bottom(), saved_mark_word()), cl);
570 551 }
571 552
572 553 void HeapRegion::note_self_forwarding_removal_start(bool during_initial_mark,
573 554 bool during_conc_mark) {
574 555 // We always recreate the prev marking info and we'll explicitly
575 556 // mark all objects we find to be self-forwarded on the prev
576 557 // bitmap. So all objects need to be below PTAMS.
577 558 _prev_top_at_mark_start = top();
578 559 _prev_marked_bytes = 0;
579 560
580 561 if (during_initial_mark) {
581 562 // During initial-mark, we'll also explicitly mark all objects
582 563 // we find to be self-forwarded on the next bitmap. So all
583 564 // objects need to be below NTAMS.
584 565 _next_top_at_mark_start = top();
585 566 _next_marked_bytes = 0;
586 567 } else if (during_conc_mark) {
587 568 // During concurrent mark, all objects in the CSet (including
588 569 // the ones we find to be self-forwarded) are implicitly live.
589 570 // So all objects need to be above NTAMS.
590 571 _next_top_at_mark_start = bottom();
591 572 _next_marked_bytes = 0;
592 573 }
593 574 }
594 575
595 576 void HeapRegion::note_self_forwarding_removal_end(bool during_initial_mark,
596 577 bool during_conc_mark,
597 578 size_t marked_bytes) {
598 579 assert(0 <= marked_bytes && marked_bytes <= used(),
599 580 err_msg("marked: "SIZE_FORMAT" used: "SIZE_FORMAT,
600 581 marked_bytes, used()));
601 582 _prev_marked_bytes = marked_bytes;
602 583 }
603 584
604 585 HeapWord*
605 586 HeapRegion::object_iterate_mem_careful(MemRegion mr,
606 587 ObjectClosure* cl) {
607 588 G1CollectedHeap* g1h = G1CollectedHeap::heap();
608 589 // We used to use "block_start_careful" here. But we're actually happy
609 590 // to update the BOT while we do this...
610 591 HeapWord* cur = block_start(mr.start());
611 592 mr = mr.intersection(used_region());
612 593 if (mr.is_empty()) return NULL;
613 594 // Otherwise, find the obj that extends onto mr.start().
614 595
615 596 assert(cur <= mr.start()
616 597 && (oop(cur)->klass_or_null() == NULL ||
617 598 cur + oop(cur)->size() > mr.start()),
618 599 "postcondition of block_start");
619 600 oop obj;
620 601 while (cur < mr.end()) {
621 602 obj = oop(cur);
622 603 if (obj->klass_or_null() == NULL) {
623 604 // Ran into an unparseable point.
624 605 return cur;
625 606 } else if (!g1h->is_obj_dead(obj)) {
626 607 cl->do_object(obj);
627 608 }
628 609 if (cl->abort()) return cur;
629 610 // The check above must occur before the operation below, since an
630 611 // abort might invalidate the "size" operation.
631 612 cur += obj->size();
632 613 }
633 614 return NULL;
634 615 }
635 616
636 617 HeapWord*
637 618 HeapRegion::
638 619 oops_on_card_seq_iterate_careful(MemRegion mr,
639 620 FilterOutOfRegionClosure* cl,
640 621 bool filter_young,
641 622 jbyte* card_ptr) {
642 623 // Currently, we should only have to clean the card if filter_young
643 624 // is true and vice versa.
644 625 if (filter_young) {
645 626 assert(card_ptr != NULL, "pre-condition");
646 627 } else {
647 628 assert(card_ptr == NULL, "pre-condition");
648 629 }
649 630 G1CollectedHeap* g1h = G1CollectedHeap::heap();
650 631
651 632 // If we're within a stop-world GC, then we might look at a card in a
652 633 // GC alloc region that extends onto a GC LAB, which may not be
653 634 // parseable. Stop such at the "saved_mark" of the region.
654 635 if (g1h->is_gc_active()) {
655 636 mr = mr.intersection(used_region_at_save_marks());
656 637 } else {
657 638 mr = mr.intersection(used_region());
658 639 }
659 640 if (mr.is_empty()) return NULL;
660 641 // Otherwise, find the obj that extends onto mr.start().
661 642
662 643 // The intersection of the incoming mr (for the card) and the
663 644 // allocated part of the region is non-empty. This implies that
664 645 // we have actually allocated into this region. The code in
665 646 // G1CollectedHeap.cpp that allocates a new region sets the
666 647 // is_young tag on the region before allocating. Thus we
667 648 // safely know if this region is young.
668 649 if (is_young() && filter_young) {
669 650 return NULL;
670 651 }
671 652
672 653 assert(!is_young(), "check value of filter_young");
673 654
674 655 // We can only clean the card here, after we make the decision that
675 656 // the card is not young. And we only clean the card if we have been
676 657 // asked to (i.e., card_ptr != NULL).
677 658 if (card_ptr != NULL) {
678 659 *card_ptr = CardTableModRefBS::clean_card_val();
679 660 // We must complete this write before we do any of the reads below.
680 661 OrderAccess::storeload();
681 662 }
682 663
683 664 // Cache the boundaries of the memory region in some const locals
684 665 HeapWord* const start = mr.start();
685 666 HeapWord* const end = mr.end();
686 667
687 668 // We used to use "block_start_careful" here. But we're actually happy
688 669 // to update the BOT while we do this...
689 670 HeapWord* cur = block_start(start);
690 671 assert(cur <= start, "Postcondition");
691 672
692 673 oop obj;
693 674
694 675 HeapWord* next = cur;
695 676 while (next <= start) {
696 677 cur = next;
697 678 obj = oop(cur);
698 679 if (obj->klass_or_null() == NULL) {
699 680 // Ran into an unparseable point.
700 681 return cur;
701 682 }
702 683 // Otherwise...
703 684 next = (cur + obj->size());
704 685 }
705 686
706 687 // If we finish the above loop...We have a parseable object that
707 688 // begins on or before the start of the memory region, and ends
708 689 // inside or spans the entire region.
709 690
710 691 assert(obj == oop(cur), "sanity");
711 692 assert(cur <= start &&
712 693 obj->klass_or_null() != NULL &&
713 694 (cur + obj->size()) > start,
714 695 "Loop postcondition");
715 696
716 697 if (!g1h->is_obj_dead(obj)) {
717 698 obj->oop_iterate(cl, mr);
718 699 }
719 700
720 701 while (cur < end) {
721 702 obj = oop(cur);
722 703 if (obj->klass_or_null() == NULL) {
723 704 // Ran into an unparseable point.
724 705 return cur;
725 706 };
726 707
727 708 // Otherwise:
728 709 next = (cur + obj->size());
729 710
730 711 if (!g1h->is_obj_dead(obj)) {
731 712 if (next < end || !obj->is_objArray()) {
732 713 // This object either does not span the MemRegion
733 714 // boundary, or if it does it's not an array.
734 715 // Apply closure to whole object.
735 716 obj->oop_iterate(cl);
736 717 } else {
737 718 // This obj is an array that spans the boundary.
738 719 // Stop at the boundary.
739 720 obj->oop_iterate(cl, mr);
740 721 }
741 722 }
742 723 cur = next;
743 724 }
744 725 return NULL;
745 726 }
746 727
747 728 void HeapRegion::print() const { print_on(gclog_or_tty); }
748 729 void HeapRegion::print_on(outputStream* st) const {
749 730 if (isHumongous()) {
750 731 if (startsHumongous())
751 732 st->print(" HS");
752 733 else
753 734 st->print(" HC");
754 735 } else {
755 736 st->print(" ");
756 737 }
757 738 if (in_collection_set())
758 739 st->print(" CS");
759 740 else
760 741 st->print(" ");
761 742 if (is_young())
762 743 st->print(is_survivor() ? " SU" : " Y ");
763 744 else
764 745 st->print(" ");
765 746 if (is_empty())
766 747 st->print(" F");
767 748 else
768 749 st->print(" ");
769 750 st->print(" TS %5d", _gc_time_stamp);
770 751 st->print(" PTAMS "PTR_FORMAT" NTAMS "PTR_FORMAT,
771 752 prev_top_at_mark_start(), next_top_at_mark_start());
772 753 G1OffsetTableContigSpace::print_on(st);
773 754 }
774 755
775 756 void HeapRegion::verify() const {
776 757 bool dummy = false;
777 758 verify(VerifyOption_G1UsePrevMarking, /* failures */ &dummy);
778 759 }
779 760
780 761 // This really ought to be commoned up into OffsetTableContigSpace somehow.
781 762 // We would need a mechanism to make that code skip dead objects.
782 763
783 764 void HeapRegion::verify(VerifyOption vo,
784 765 bool* failures) const {
785 766 G1CollectedHeap* g1 = G1CollectedHeap::heap();
786 767 *failures = false;
787 768 HeapWord* p = bottom();
788 769 HeapWord* prev_p = NULL;
789 770 VerifyLiveClosure vl_cl(g1, vo);
790 771 bool is_humongous = isHumongous();
791 772 bool do_bot_verify = !is_young();
792 773 size_t object_num = 0;
793 774 while (p < top()) {
794 775 oop obj = oop(p);
795 776 size_t obj_size = obj->size();
796 777 object_num += 1;
797 778
798 779 if (is_humongous != g1->isHumongous(obj_size)) {
799 780 gclog_or_tty->print_cr("obj "PTR_FORMAT" is of %shumongous size ("
800 781 SIZE_FORMAT" words) in a %shumongous region",
801 782 p, g1->isHumongous(obj_size) ? "" : "non-",
802 783 obj_size, is_humongous ? "" : "non-");
803 784 *failures = true;
804 785 return;
805 786 }
806 787
807 788 // If it returns false, verify_for_object() will output the
808 789 // appropriate messasge.
809 790 if (do_bot_verify && !_offsets.verify_for_object(p, obj_size)) {
810 791 *failures = true;
811 792 return;
812 793 }
813 794
814 795 if (!g1->is_obj_dead_cond(obj, this, vo)) {
815 796 if (obj->is_oop()) {
816 797 klassOop klass = obj->klass();
817 798 if (!klass->is_perm()) {
818 799 gclog_or_tty->print_cr("klass "PTR_FORMAT" of object "PTR_FORMAT" "
819 800 "not in perm", klass, obj);
820 801 *failures = true;
821 802 return;
822 803 } else if (!klass->is_klass()) {
823 804 gclog_or_tty->print_cr("klass "PTR_FORMAT" of object "PTR_FORMAT" "
824 805 "not a klass", klass, obj);
825 806 *failures = true;
826 807 return;
827 808 } else {
828 809 vl_cl.set_containing_obj(obj);
829 810 obj->oop_iterate(&vl_cl);
830 811 if (vl_cl.failures()) {
831 812 *failures = true;
832 813 }
833 814 if (G1MaxVerifyFailures >= 0 &&
834 815 vl_cl.n_failures() >= G1MaxVerifyFailures) {
835 816 return;
836 817 }
837 818 }
838 819 } else {
839 820 gclog_or_tty->print_cr(PTR_FORMAT" no an oop", obj);
840 821 *failures = true;
841 822 return;
842 823 }
843 824 }
844 825 prev_p = p;
845 826 p += obj_size;
846 827 }
847 828
848 829 if (p != top()) {
849 830 gclog_or_tty->print_cr("end of last object "PTR_FORMAT" "
850 831 "does not match top "PTR_FORMAT, p, top());
851 832 *failures = true;
852 833 return;
853 834 }
854 835
855 836 HeapWord* the_end = end();
856 837 assert(p == top(), "it should still hold");
857 838 // Do some extra BOT consistency checking for addresses in the
858 839 // range [top, end). BOT look-ups in this range should yield
859 840 // top. No point in doing that if top == end (there's nothing there).
860 841 if (p < the_end) {
861 842 // Look up top
862 843 HeapWord* addr_1 = p;
863 844 HeapWord* b_start_1 = _offsets.block_start_const(addr_1);
864 845 if (b_start_1 != p) {
865 846 gclog_or_tty->print_cr("BOT look up for top: "PTR_FORMAT" "
866 847 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
867 848 addr_1, b_start_1, p);
868 849 *failures = true;
869 850 return;
870 851 }
871 852
872 853 // Look up top + 1
873 854 HeapWord* addr_2 = p + 1;
874 855 if (addr_2 < the_end) {
875 856 HeapWord* b_start_2 = _offsets.block_start_const(addr_2);
876 857 if (b_start_2 != p) {
877 858 gclog_or_tty->print_cr("BOT look up for top + 1: "PTR_FORMAT" "
878 859 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
879 860 addr_2, b_start_2, p);
880 861 *failures = true;
881 862 return;
882 863 }
883 864 }
884 865
885 866 // Look up an address between top and end
886 867 size_t diff = pointer_delta(the_end, p) / 2;
887 868 HeapWord* addr_3 = p + diff;
888 869 if (addr_3 < the_end) {
889 870 HeapWord* b_start_3 = _offsets.block_start_const(addr_3);
890 871 if (b_start_3 != p) {
891 872 gclog_or_tty->print_cr("BOT look up for top + diff: "PTR_FORMAT" "
892 873 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
893 874 addr_3, b_start_3, p);
894 875 *failures = true;
895 876 return;
896 877 }
897 878 }
898 879
899 880 // Loook up end - 1
900 881 HeapWord* addr_4 = the_end - 1;
901 882 HeapWord* b_start_4 = _offsets.block_start_const(addr_4);
902 883 if (b_start_4 != p) {
903 884 gclog_or_tty->print_cr("BOT look up for end - 1: "PTR_FORMAT" "
904 885 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
905 886 addr_4, b_start_4, p);
906 887 *failures = true;
907 888 return;
908 889 }
909 890 }
910 891
911 892 if (is_humongous && object_num > 1) {
912 893 gclog_or_tty->print_cr("region ["PTR_FORMAT","PTR_FORMAT"] is humongous "
913 894 "but has "SIZE_FORMAT", objects",
914 895 bottom(), end(), object_num);
915 896 *failures = true;
916 897 return;
917 898 }
918 899 }
919 900
920 901 // G1OffsetTableContigSpace code; copied from space.cpp. Hope this can go
921 902 // away eventually.
922 903
923 904 void G1OffsetTableContigSpace::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
924 905 // false ==> we'll do the clearing if there's clearing to be done.
925 906 ContiguousSpace::initialize(mr, false, mangle_space);
926 907 _offsets.zero_bottom_entry();
927 908 _offsets.initialize_threshold();
928 909 if (clear_space) clear(mangle_space);
929 910 }
930 911
931 912 void G1OffsetTableContigSpace::clear(bool mangle_space) {
932 913 ContiguousSpace::clear(mangle_space);
933 914 _offsets.zero_bottom_entry();
934 915 _offsets.initialize_threshold();
935 916 }
936 917
937 918 void G1OffsetTableContigSpace::set_bottom(HeapWord* new_bottom) {
938 919 Space::set_bottom(new_bottom);
939 920 _offsets.set_bottom(new_bottom);
940 921 }
941 922
942 923 void G1OffsetTableContigSpace::set_end(HeapWord* new_end) {
943 924 Space::set_end(new_end);
944 925 _offsets.resize(new_end - bottom());
945 926 }
946 927
947 928 void G1OffsetTableContigSpace::print() const {
948 929 print_short();
949 930 gclog_or_tty->print_cr(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ", "
950 931 INTPTR_FORMAT ", " INTPTR_FORMAT ")",
951 932 bottom(), top(), _offsets.threshold(), end());
952 933 }
953 934
954 935 HeapWord* G1OffsetTableContigSpace::initialize_threshold() {
955 936 return _offsets.initialize_threshold();
956 937 }
957 938
958 939 HeapWord* G1OffsetTableContigSpace::cross_threshold(HeapWord* start,
959 940 HeapWord* end) {
960 941 _offsets.alloc_block(start, end);
961 942 return _offsets.threshold();
962 943 }
963 944
964 945 HeapWord* G1OffsetTableContigSpace::saved_mark_word() const {
965 946 G1CollectedHeap* g1h = G1CollectedHeap::heap();
966 947 assert( _gc_time_stamp <= g1h->get_gc_time_stamp(), "invariant" );
967 948 if (_gc_time_stamp < g1h->get_gc_time_stamp())
968 949 return top();
969 950 else
970 951 return ContiguousSpace::saved_mark_word();
971 952 }
972 953
973 954 void G1OffsetTableContigSpace::set_saved_mark() {
974 955 G1CollectedHeap* g1h = G1CollectedHeap::heap();
975 956 unsigned curr_gc_time_stamp = g1h->get_gc_time_stamp();
976 957
977 958 if (_gc_time_stamp < curr_gc_time_stamp) {
978 959 // The order of these is important, as another thread might be
979 960 // about to start scanning this region. If it does so after
980 961 // set_saved_mark and before _gc_time_stamp = ..., then the latter
981 962 // will be false, and it will pick up top() as the high water mark
982 963 // of region. If it does so after _gc_time_stamp = ..., then it
983 964 // will pick up the right saved_mark_word() as the high water mark
984 965 // of the region. Either way, the behaviour will be correct.
985 966 ContiguousSpace::set_saved_mark();
986 967 OrderAccess::storestore();
987 968 _gc_time_stamp = curr_gc_time_stamp;
988 969 // No need to do another barrier to flush the writes above. If
989 970 // this is called in parallel with other threads trying to
990 971 // allocate into the region, the caller should call this while
991 972 // holding a lock and when the lock is released the writes will be
992 973 // flushed.
993 974 }
994 975 }
995 976
996 977 G1OffsetTableContigSpace::
997 978 G1OffsetTableContigSpace(G1BlockOffsetSharedArray* sharedOffsetArray,
998 979 MemRegion mr, bool is_zeroed) :
999 980 _offsets(sharedOffsetArray, mr),
1000 981 _par_alloc_lock(Mutex::leaf, "OffsetTableContigSpace par alloc lock", true),
1001 982 _gc_time_stamp(0)
1002 983 {
1003 984 _offsets.set_space(this);
1004 985 initialize(mr, !is_zeroed, SpaceDecorator::Mangle);
1005 986 }
↓ open down ↓ |
452 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX