annotate src/share/vm/gc_implementation/g1/heapRegion.cpp @ 358:0edda524b58c

6722565: G1: assert !r->is_on_unclean_list() fires Summary: Under certain circumstances, two cleanup threads can claim and process the same region. Reviewed-by: apetrusenko, ysr
author tonyp
date Wed, 06 Aug 2008 11:57:31 -0400
parents 9bb2c10ac07b
children 1ee8caae33af
rev   line source
ysr@345 1 /*
ysr@345 2 * Copyright 2001-2007 Sun Microsystems, Inc. All Rights Reserved.
ysr@345 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@345 4 *
ysr@345 5 * This code is free software; you can redistribute it and/or modify it
ysr@345 6 * under the terms of the GNU General Public License version 2 only, as
ysr@345 7 * published by the Free Software Foundation.
ysr@345 8 *
ysr@345 9 * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@345 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@345 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
ysr@345 12 * version 2 for more details (a copy is included in the LICENSE file that
ysr@345 13 * accompanied this code).
ysr@345 14 *
ysr@345 15 * You should have received a copy of the GNU General Public License version
ysr@345 16 * 2 along with this work; if not, write to the Free Software Foundation,
ysr@345 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@345 18 *
ysr@345 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
ysr@345 20 * CA 95054 USA or visit www.sun.com if you need additional information or
ysr@345 21 * have any questions.
ysr@345 22 *
ysr@345 23 */
ysr@345 24
ysr@345 25 #include "incls/_precompiled.incl"
ysr@345 26 #include "incls/_heapRegion.cpp.incl"
ysr@345 27
ysr@345 28 HeapRegionDCTOC::HeapRegionDCTOC(G1CollectedHeap* g1,
ysr@345 29 HeapRegion* hr, OopClosure* cl,
ysr@345 30 CardTableModRefBS::PrecisionStyle precision,
ysr@345 31 FilterKind fk) :
ysr@345 32 ContiguousSpaceDCTOC(hr, cl, precision, NULL),
ysr@345 33 _hr(hr), _fk(fk), _g1(g1)
ysr@345 34 {}
ysr@345 35
ysr@345 36 FilterOutOfRegionClosure::FilterOutOfRegionClosure(HeapRegion* r,
ysr@345 37 OopClosure* oc) :
ysr@345 38 _r_bottom(r->bottom()), _r_end(r->end()),
ysr@345 39 _oc(oc), _out_of_region(0)
ysr@345 40 {}
ysr@345 41
ysr@345 42 class VerifyLiveClosure: public OopClosure {
ysr@345 43 G1CollectedHeap* _g1h;
ysr@345 44 CardTableModRefBS* _bs;
ysr@345 45 oop _containing_obj;
ysr@345 46 bool _failures;
ysr@345 47 int _n_failures;
ysr@345 48 public:
ysr@345 49 VerifyLiveClosure(G1CollectedHeap* g1h) :
ysr@345 50 _g1h(g1h), _bs(NULL), _containing_obj(NULL),
ysr@345 51 _failures(false), _n_failures(0)
ysr@345 52 {
ysr@345 53 BarrierSet* bs = _g1h->barrier_set();
ysr@345 54 if (bs->is_a(BarrierSet::CardTableModRef))
ysr@345 55 _bs = (CardTableModRefBS*)bs;
ysr@345 56 }
ysr@345 57
ysr@345 58 void set_containing_obj(oop obj) {
ysr@345 59 _containing_obj = obj;
ysr@345 60 }
ysr@345 61
ysr@345 62 bool failures() { return _failures; }
ysr@345 63 int n_failures() { return _n_failures; }
ysr@345 64
ysr@345 65 virtual void do_oop(narrowOop* p) {
ysr@345 66 guarantee(false, "NYI");
ysr@345 67 }
ysr@345 68
ysr@345 69 void do_oop(oop* p) {
ysr@345 70 assert(_containing_obj != NULL, "Precondition");
ysr@345 71 assert(!_g1h->is_obj_dead(_containing_obj), "Precondition");
ysr@345 72 oop obj = *p;
ysr@345 73 if (obj != NULL) {
ysr@345 74 bool failed = false;
ysr@345 75 if (!_g1h->is_in_closed_subset(obj) || _g1h->is_obj_dead(obj)) {
ysr@345 76 if (!_failures) {
ysr@345 77 gclog_or_tty->print_cr("");
ysr@345 78 gclog_or_tty->print_cr("----------");
ysr@345 79 }
ysr@345 80 if (!_g1h->is_in_closed_subset(obj)) {
ysr@345 81 gclog_or_tty->print_cr("Field "PTR_FORMAT
ysr@345 82 " of live obj "PTR_FORMAT
ysr@345 83 " points to obj "PTR_FORMAT
ysr@345 84 " not in the heap.",
ysr@345 85 p, (void*) _containing_obj, (void*) obj);
ysr@345 86 } else {
ysr@345 87 gclog_or_tty->print_cr("Field "PTR_FORMAT
ysr@345 88 " of live obj "PTR_FORMAT
ysr@345 89 " points to dead obj "PTR_FORMAT".",
ysr@345 90 p, (void*) _containing_obj, (void*) obj);
ysr@345 91 }
ysr@345 92 gclog_or_tty->print_cr("Live obj:");
ysr@345 93 _containing_obj->print_on(gclog_or_tty);
ysr@345 94 gclog_or_tty->print_cr("Bad referent:");
ysr@345 95 obj->print_on(gclog_or_tty);
ysr@345 96 gclog_or_tty->print_cr("----------");
ysr@345 97 _failures = true;
ysr@345 98 failed = true;
ysr@345 99 _n_failures++;
ysr@345 100 }
ysr@345 101
ysr@345 102 if (!_g1h->full_collection()) {
ysr@345 103 HeapRegion* from = _g1h->heap_region_containing(p);
ysr@345 104 HeapRegion* to = _g1h->heap_region_containing(*p);
ysr@345 105 if (from != NULL && to != NULL &&
ysr@345 106 from != to &&
ysr@345 107 !to->popular() &&
ysr@345 108 !to->isHumongous()) {
ysr@345 109 jbyte cv_obj = *_bs->byte_for_const(_containing_obj);
ysr@345 110 jbyte cv_field = *_bs->byte_for_const(p);
ysr@345 111 const jbyte dirty = CardTableModRefBS::dirty_card_val();
ysr@345 112
ysr@345 113 bool is_bad = !(from->is_young()
ysr@345 114 || to->rem_set()->contains_reference(p)
ysr@345 115 || !G1HRRSFlushLogBuffersOnVerify && // buffers were not flushed
ysr@345 116 (_containing_obj->is_objArray() ?
ysr@345 117 cv_field == dirty
ysr@345 118 : cv_obj == dirty || cv_field == dirty));
ysr@345 119 if (is_bad) {
ysr@345 120 if (!_failures) {
ysr@345 121 gclog_or_tty->print_cr("");
ysr@345 122 gclog_or_tty->print_cr("----------");
ysr@345 123 }
ysr@345 124 gclog_or_tty->print_cr("Missing rem set entry:");
ysr@345 125 gclog_or_tty->print_cr("Field "PTR_FORMAT
ysr@345 126 " of obj "PTR_FORMAT
ysr@345 127 ", in region %d ["PTR_FORMAT
ysr@345 128 ", "PTR_FORMAT"),",
ysr@345 129 p, (void*) _containing_obj,
ysr@345 130 from->hrs_index(),
ysr@345 131 from->bottom(),
ysr@345 132 from->end());
ysr@345 133 _containing_obj->print_on(gclog_or_tty);
ysr@345 134 gclog_or_tty->print_cr("points to obj "PTR_FORMAT
ysr@345 135 " in region %d ["PTR_FORMAT
ysr@345 136 ", "PTR_FORMAT").",
ysr@345 137 (void*) obj, to->hrs_index(),
ysr@345 138 to->bottom(), to->end());
ysr@345 139 obj->print_on(gclog_or_tty);
ysr@345 140 gclog_or_tty->print_cr("Obj head CTE = %d, field CTE = %d.",
ysr@345 141 cv_obj, cv_field);
ysr@345 142 gclog_or_tty->print_cr("----------");
ysr@345 143 _failures = true;
ysr@345 144 if (!failed) _n_failures++;
ysr@345 145 }
ysr@345 146 }
ysr@345 147 }
ysr@345 148 }
ysr@345 149 }
ysr@345 150 };
ysr@345 151
ysr@345 152 template<class ClosureType>
ysr@345 153 HeapWord* walk_mem_region_loop(ClosureType* cl, G1CollectedHeap* g1h,
ysr@345 154 HeapRegion* hr,
ysr@345 155 HeapWord* cur, HeapWord* top) {
ysr@345 156 oop cur_oop = oop(cur);
ysr@345 157 int oop_size = cur_oop->size();
ysr@345 158 HeapWord* next_obj = cur + oop_size;
ysr@345 159 while (next_obj < top) {
ysr@345 160 // Keep filtering the remembered set.
ysr@345 161 if (!g1h->is_obj_dead(cur_oop, hr)) {
ysr@345 162 // Bottom lies entirely below top, so we can call the
ysr@345 163 // non-memRegion version of oop_iterate below.
ysr@345 164 #ifndef PRODUCT
ysr@345 165 if (G1VerifyMarkingInEvac) {
ysr@345 166 VerifyLiveClosure vl_cl(g1h);
ysr@345 167 cur_oop->oop_iterate(&vl_cl);
ysr@345 168 }
ysr@345 169 #endif
ysr@345 170 cur_oop->oop_iterate(cl);
ysr@345 171 }
ysr@345 172 cur = next_obj;
ysr@345 173 cur_oop = oop(cur);
ysr@345 174 oop_size = cur_oop->size();
ysr@345 175 next_obj = cur + oop_size;
ysr@345 176 }
ysr@345 177 return cur;
ysr@345 178 }
ysr@345 179
ysr@345 180 void HeapRegionDCTOC::walk_mem_region_with_cl(MemRegion mr,
ysr@345 181 HeapWord* bottom,
ysr@345 182 HeapWord* top,
ysr@345 183 OopClosure* cl) {
ysr@345 184 G1CollectedHeap* g1h = _g1;
ysr@345 185
ysr@345 186 int oop_size;
ysr@345 187
ysr@345 188 OopClosure* cl2 = cl;
ysr@345 189 FilterIntoCSClosure intoCSFilt(this, g1h, cl);
ysr@345 190 FilterOutOfRegionClosure outOfRegionFilt(_hr, cl);
ysr@345 191 switch (_fk) {
ysr@345 192 case IntoCSFilterKind: cl2 = &intoCSFilt; break;
ysr@345 193 case OutOfRegionFilterKind: cl2 = &outOfRegionFilt; break;
ysr@345 194 }
ysr@345 195
ysr@345 196 // Start filtering what we add to the remembered set. If the object is
ysr@345 197 // not considered dead, either because it is marked (in the mark bitmap)
ysr@345 198 // or it was allocated after marking finished, then we add it. Otherwise
ysr@345 199 // we can safely ignore the object.
ysr@345 200 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
ysr@345 201 #ifndef PRODUCT
ysr@345 202 if (G1VerifyMarkingInEvac) {
ysr@345 203 VerifyLiveClosure vl_cl(g1h);
ysr@345 204 oop(bottom)->oop_iterate(&vl_cl, mr);
ysr@345 205 }
ysr@345 206 #endif
ysr@345 207 oop_size = oop(bottom)->oop_iterate(cl2, mr);
ysr@345 208 } else {
ysr@345 209 oop_size = oop(bottom)->size();
ysr@345 210 }
ysr@345 211
ysr@345 212 bottom += oop_size;
ysr@345 213
ysr@345 214 if (bottom < top) {
ysr@345 215 // We replicate the loop below for several kinds of possible filters.
ysr@345 216 switch (_fk) {
ysr@345 217 case NoFilterKind:
ysr@345 218 bottom = walk_mem_region_loop(cl, g1h, _hr, bottom, top);
ysr@345 219 break;
ysr@345 220 case IntoCSFilterKind: {
ysr@345 221 FilterIntoCSClosure filt(this, g1h, cl);
ysr@345 222 bottom = walk_mem_region_loop(&filt, g1h, _hr, bottom, top);
ysr@345 223 break;
ysr@345 224 }
ysr@345 225 case OutOfRegionFilterKind: {
ysr@345 226 FilterOutOfRegionClosure filt(_hr, cl);
ysr@345 227 bottom = walk_mem_region_loop(&filt, g1h, _hr, bottom, top);
ysr@345 228 break;
ysr@345 229 }
ysr@345 230 default:
ysr@345 231 ShouldNotReachHere();
ysr@345 232 }
ysr@345 233
ysr@345 234 // Last object. Need to do dead-obj filtering here too.
ysr@345 235 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
ysr@345 236 #ifndef PRODUCT
ysr@345 237 if (G1VerifyMarkingInEvac) {
ysr@345 238 VerifyLiveClosure vl_cl(g1h);
ysr@345 239 oop(bottom)->oop_iterate(&vl_cl, mr);
ysr@345 240 }
ysr@345 241 #endif
ysr@345 242 oop(bottom)->oop_iterate(cl2, mr);
ysr@345 243 }
ysr@345 244 }
ysr@345 245 }
ysr@345 246
ysr@345 247 void HeapRegion::reset_after_compaction() {
ysr@345 248 G1OffsetTableContigSpace::reset_after_compaction();
ysr@345 249 // After a compaction the mark bitmap is invalid, so we must
ysr@345 250 // treat all objects as being inside the unmarked area.
ysr@345 251 zero_marked_bytes();
ysr@345 252 init_top_at_mark_start();
ysr@345 253 }
ysr@345 254
ysr@345 255
ysr@345 256
ysr@345 257 DirtyCardToOopClosure*
ysr@345 258 HeapRegion::new_dcto_closure(OopClosure* cl,
ysr@345 259 CardTableModRefBS::PrecisionStyle precision,
ysr@345 260 HeapRegionDCTOC::FilterKind fk) {
ysr@345 261 return new HeapRegionDCTOC(G1CollectedHeap::heap(),
ysr@345 262 this, cl, precision, fk);
ysr@345 263 }
ysr@345 264
ysr@345 265 void HeapRegion::hr_clear(bool par, bool clear_space) {
tonyp@358 266 _humongous_type = NotHumongous;
ysr@345 267 _humongous_start_region = NULL;
ysr@345 268 _in_collection_set = false;
ysr@345 269 _is_gc_alloc_region = false;
ysr@345 270
ysr@345 271 // Age stuff (if parallel, this will be done separately, since it needs
ysr@345 272 // to be sequential).
ysr@345 273 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 274
ysr@345 275 set_young_index_in_cset(-1);
ysr@345 276 uninstall_surv_rate_group();
ysr@345 277 set_young_type(NotYoung);
ysr@345 278
ysr@345 279 // In case it had been the start of a humongous sequence, reset its end.
ysr@345 280 set_end(_orig_end);
ysr@345 281
ysr@345 282 if (!par) {
ysr@345 283 // If this is parallel, this will be done later.
ysr@345 284 HeapRegionRemSet* hrrs = rem_set();
ysr@345 285 if (hrrs != NULL) hrrs->clear();
tonyp@358 286 _claimed = InitialClaimValue;
ysr@345 287 }
ysr@345 288 zero_marked_bytes();
ysr@345 289 set_sort_index(-1);
ysr@345 290 if ((uintptr_t)bottom() >= (uintptr_t)g1h->popular_object_boundary())
ysr@345 291 set_popular(false);
ysr@345 292
ysr@345 293 _offsets.resize(HeapRegion::GrainWords);
ysr@345 294 init_top_at_mark_start();
ysr@345 295 if (clear_space) clear();
ysr@345 296 }
ysr@345 297
ysr@345 298 // <PREDICTION>
ysr@345 299 void HeapRegion::calc_gc_efficiency() {
ysr@345 300 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 301 _gc_efficiency = (double) garbage_bytes() /
ysr@345 302 g1h->predict_region_elapsed_time_ms(this, false);
ysr@345 303 }
ysr@345 304 // </PREDICTION>
ysr@345 305
ysr@345 306 void HeapRegion::set_startsHumongous() {
tonyp@358 307 _humongous_type = StartsHumongous;
ysr@345 308 _humongous_start_region = this;
ysr@345 309 assert(end() == _orig_end, "Should be normal before alloc.");
ysr@345 310 }
ysr@345 311
ysr@345 312 bool HeapRegion::claimHeapRegion(jint claimValue) {
ysr@345 313 jint current = _claimed;
ysr@345 314 if (current != claimValue) {
ysr@345 315 jint res = Atomic::cmpxchg(claimValue, &_claimed, current);
ysr@345 316 if (res == current) {
ysr@345 317 return true;
ysr@345 318 }
ysr@345 319 }
ysr@345 320 return false;
ysr@345 321 }
ysr@345 322
ysr@345 323 HeapWord* HeapRegion::next_block_start_careful(HeapWord* addr) {
ysr@345 324 HeapWord* low = addr;
ysr@345 325 HeapWord* high = end();
ysr@345 326 while (low < high) {
ysr@345 327 size_t diff = pointer_delta(high, low);
ysr@345 328 // Must add one below to bias toward the high amount. Otherwise, if
ysr@345 329 // "high" were at the desired value, and "low" were one less, we
ysr@345 330 // would not converge on "high". This is not symmetric, because
ysr@345 331 // we set "high" to a block start, which might be the right one,
ysr@345 332 // which we don't do for "low".
ysr@345 333 HeapWord* middle = low + (diff+1)/2;
ysr@345 334 if (middle == high) return high;
ysr@345 335 HeapWord* mid_bs = block_start_careful(middle);
ysr@345 336 if (mid_bs < addr) {
ysr@345 337 low = middle;
ysr@345 338 } else {
ysr@345 339 high = mid_bs;
ysr@345 340 }
ysr@345 341 }
ysr@345 342 assert(low == high && low >= addr, "Didn't work.");
ysr@345 343 return low;
ysr@345 344 }
ysr@345 345
ysr@345 346 void HeapRegion::set_next_on_unclean_list(HeapRegion* r) {
ysr@345 347 assert(r == NULL || r->is_on_unclean_list(), "Malformed unclean list.");
ysr@345 348 _next_in_special_set = r;
ysr@345 349 }
ysr@345 350
ysr@345 351 void HeapRegion::set_on_unclean_list(bool b) {
ysr@345 352 _is_on_unclean_list = b;
ysr@345 353 }
ysr@345 354
ysr@345 355 void HeapRegion::initialize(MemRegion mr, bool clear_space) {
ysr@345 356 G1OffsetTableContigSpace::initialize(mr, false);
ysr@345 357 hr_clear(false/*par*/, clear_space);
ysr@345 358 }
ysr@345 359 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
ysr@345 360 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
ysr@345 361 #endif // _MSC_VER
ysr@345 362
ysr@345 363
ysr@345 364 HeapRegion::
ysr@345 365 HeapRegion(G1BlockOffsetSharedArray* sharedOffsetArray,
ysr@345 366 MemRegion mr, bool is_zeroed)
ysr@345 367 : G1OffsetTableContigSpace(sharedOffsetArray, mr, is_zeroed),
ysr@345 368 _next_fk(HeapRegionDCTOC::NoFilterKind),
ysr@345 369 _hrs_index(-1),
tonyp@358 370 _humongous_type(NotHumongous), _humongous_start_region(NULL),
ysr@345 371 _in_collection_set(false), _is_gc_alloc_region(false),
ysr@345 372 _is_on_free_list(false), _is_on_unclean_list(false),
ysr@345 373 _next_in_special_set(NULL), _orig_end(NULL),
tonyp@358 374 _claimed(InitialClaimValue), _evacuation_failed(false),
ysr@345 375 _prev_marked_bytes(0), _next_marked_bytes(0), _sort_index(-1),
ysr@345 376 _popularity(NotPopular),
ysr@345 377 _young_type(NotYoung), _next_young_region(NULL),
ysr@345 378 _young_index_in_cset(-1), _surv_rate_group(NULL), _age_index(-1),
ysr@345 379 _rem_set(NULL), _zfs(NotZeroFilled)
ysr@345 380 {
ysr@345 381 _orig_end = mr.end();
ysr@345 382 // Note that initialize() will set the start of the unmarked area of the
ysr@345 383 // region.
ysr@345 384 this->initialize(mr, !is_zeroed);
ysr@345 385
ysr@345 386 _rem_set = new HeapRegionRemSet(sharedOffsetArray, this);
ysr@345 387
ysr@345 388 assert(HeapRegionRemSet::num_par_rem_sets() > 0, "Invariant.");
ysr@345 389 // In case the region is allocated during a pause, note the top.
ysr@345 390 // We haven't done any counting on a brand new region.
ysr@345 391 _top_at_conc_mark_count = bottom();
ysr@345 392 }
ysr@345 393
ysr@345 394 class NextCompactionHeapRegionClosure: public HeapRegionClosure {
ysr@345 395 const HeapRegion* _target;
ysr@345 396 bool _target_seen;
ysr@345 397 HeapRegion* _last;
ysr@345 398 CompactibleSpace* _res;
ysr@345 399 public:
ysr@345 400 NextCompactionHeapRegionClosure(const HeapRegion* target) :
ysr@345 401 _target(target), _target_seen(false), _res(NULL) {}
ysr@345 402 bool doHeapRegion(HeapRegion* cur) {
ysr@345 403 if (_target_seen) {
ysr@345 404 if (!cur->isHumongous()) {
ysr@345 405 _res = cur;
ysr@345 406 return true;
ysr@345 407 }
ysr@345 408 } else if (cur == _target) {
ysr@345 409 _target_seen = true;
ysr@345 410 }
ysr@345 411 return false;
ysr@345 412 }
ysr@345 413 CompactibleSpace* result() { return _res; }
ysr@345 414 };
ysr@345 415
ysr@345 416 CompactibleSpace* HeapRegion::next_compaction_space() const {
ysr@345 417 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 418 // cast away const-ness
ysr@345 419 HeapRegion* r = (HeapRegion*) this;
ysr@345 420 NextCompactionHeapRegionClosure blk(r);
ysr@345 421 g1h->heap_region_iterate_from(r, &blk);
ysr@345 422 return blk.result();
ysr@345 423 }
ysr@345 424
ysr@345 425 void HeapRegion::set_continuesHumongous(HeapRegion* start) {
ysr@345 426 // The order is important here.
ysr@345 427 start->add_continuingHumongousRegion(this);
tonyp@358 428 _humongous_type = ContinuesHumongous;
ysr@345 429 _humongous_start_region = start;
ysr@345 430 }
ysr@345 431
ysr@345 432 void HeapRegion::add_continuingHumongousRegion(HeapRegion* cont) {
ysr@345 433 // Must join the blocks of the current H region seq with the block of the
ysr@345 434 // added region.
ysr@345 435 offsets()->join_blocks(bottom(), cont->bottom());
ysr@345 436 arrayOop obj = (arrayOop)(bottom());
ysr@345 437 obj->set_length((int) (obj->length() + cont->capacity()/jintSize));
ysr@345 438 set_end(cont->end());
ysr@345 439 set_top(cont->end());
ysr@345 440 }
ysr@345 441
ysr@345 442 void HeapRegion::save_marks() {
ysr@345 443 set_saved_mark();
ysr@345 444 }
ysr@345 445
ysr@345 446 void HeapRegion::oops_in_mr_iterate(MemRegion mr, OopClosure* cl) {
ysr@345 447 HeapWord* p = mr.start();
ysr@345 448 HeapWord* e = mr.end();
ysr@345 449 oop obj;
ysr@345 450 while (p < e) {
ysr@345 451 obj = oop(p);
ysr@345 452 p += obj->oop_iterate(cl);
ysr@345 453 }
ysr@345 454 assert(p == e, "bad memregion: doesn't end on obj boundary");
ysr@345 455 }
ysr@345 456
ysr@345 457 #define HeapRegion_OOP_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \
ysr@345 458 void HeapRegion::oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl) { \
ysr@345 459 ContiguousSpace::oop_since_save_marks_iterate##nv_suffix(cl); \
ysr@345 460 }
ysr@345 461 SPECIALIZED_SINCE_SAVE_MARKS_CLOSURES(HeapRegion_OOP_SINCE_SAVE_MARKS_DEFN)
ysr@345 462
ysr@345 463
ysr@345 464 void HeapRegion::oop_before_save_marks_iterate(OopClosure* cl) {
ysr@345 465 oops_in_mr_iterate(MemRegion(bottom(), saved_mark_word()), cl);
ysr@345 466 }
ysr@345 467
ysr@345 468 #ifdef DEBUG
ysr@345 469 HeapWord* HeapRegion::allocate(size_t size) {
ysr@345 470 jint state = zero_fill_state();
ysr@345 471 assert(!G1CollectedHeap::heap()->allocs_are_zero_filled() ||
ysr@345 472 zero_fill_is_allocated(),
ysr@345 473 "When ZF is on, only alloc in ZF'd regions");
ysr@345 474 return G1OffsetTableContigSpace::allocate(size);
ysr@345 475 }
ysr@345 476 #endif
ysr@345 477
ysr@345 478 void HeapRegion::set_zero_fill_state_work(ZeroFillState zfs) {
ysr@345 479 assert(top() == bottom() || zfs == Allocated,
ysr@345 480 "Region must be empty, or we must be setting it to allocated.");
ysr@345 481 assert(ZF_mon->owned_by_self() ||
ysr@345 482 Universe::heap()->is_gc_active(),
ysr@345 483 "Must hold the lock or be a full GC to modify.");
ysr@345 484 _zfs = zfs;
ysr@345 485 }
ysr@345 486
ysr@345 487 void HeapRegion::set_zero_fill_complete() {
ysr@345 488 set_zero_fill_state_work(ZeroFilled);
ysr@345 489 if (ZF_mon->owned_by_self()) {
ysr@345 490 ZF_mon->notify_all();
ysr@345 491 }
ysr@345 492 }
ysr@345 493
ysr@345 494
ysr@345 495 void HeapRegion::ensure_zero_filled() {
ysr@345 496 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag);
ysr@345 497 ensure_zero_filled_locked();
ysr@345 498 }
ysr@345 499
ysr@345 500 void HeapRegion::ensure_zero_filled_locked() {
ysr@345 501 assert(ZF_mon->owned_by_self(), "Precondition");
ysr@345 502 bool should_ignore_zf = SafepointSynchronize::is_at_safepoint();
ysr@345 503 assert(should_ignore_zf || Heap_lock->is_locked(),
ysr@345 504 "Either we're in a GC or we're allocating a region.");
ysr@345 505 switch (zero_fill_state()) {
ysr@345 506 case HeapRegion::NotZeroFilled:
ysr@345 507 set_zero_fill_in_progress(Thread::current());
ysr@345 508 {
ysr@345 509 ZF_mon->unlock();
ysr@345 510 Copy::fill_to_words(bottom(), capacity()/HeapWordSize);
ysr@345 511 ZF_mon->lock_without_safepoint_check();
ysr@345 512 }
ysr@345 513 // A trap.
ysr@345 514 guarantee(zero_fill_state() == HeapRegion::ZeroFilling
ysr@345 515 && zero_filler() == Thread::current(),
ysr@345 516 "AHA! Tell Dave D if you see this...");
ysr@345 517 set_zero_fill_complete();
ysr@345 518 // gclog_or_tty->print_cr("Did sync ZF.");
ysr@345 519 ConcurrentZFThread::note_sync_zfs();
ysr@345 520 break;
ysr@345 521 case HeapRegion::ZeroFilling:
ysr@345 522 if (should_ignore_zf) {
ysr@345 523 // We can "break" the lock and take over the work.
ysr@345 524 Copy::fill_to_words(bottom(), capacity()/HeapWordSize);
ysr@345 525 set_zero_fill_complete();
ysr@345 526 ConcurrentZFThread::note_sync_zfs();
ysr@345 527 break;
ysr@345 528 } else {
ysr@345 529 ConcurrentZFThread::wait_for_ZF_completed(this);
ysr@345 530 }
ysr@345 531 case HeapRegion::ZeroFilled:
ysr@345 532 // Nothing to do.
ysr@345 533 break;
ysr@345 534 case HeapRegion::Allocated:
ysr@345 535 guarantee(false, "Should not call on allocated regions.");
ysr@345 536 }
ysr@345 537 assert(zero_fill_state() == HeapRegion::ZeroFilled, "Post");
ysr@345 538 }
ysr@345 539
ysr@345 540 HeapWord*
ysr@345 541 HeapRegion::object_iterate_mem_careful(MemRegion mr,
ysr@345 542 ObjectClosure* cl) {
ysr@345 543 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 544 // We used to use "block_start_careful" here. But we're actually happy
ysr@345 545 // to update the BOT while we do this...
ysr@345 546 HeapWord* cur = block_start(mr.start());
ysr@345 547 mr = mr.intersection(used_region());
ysr@345 548 if (mr.is_empty()) return NULL;
ysr@345 549 // Otherwise, find the obj that extends onto mr.start().
ysr@345 550
ysr@345 551 assert(cur <= mr.start()
ysr@345 552 && (oop(cur)->klass() == NULL ||
ysr@345 553 cur + oop(cur)->size() > mr.start()),
ysr@345 554 "postcondition of block_start");
ysr@345 555 oop obj;
ysr@345 556 while (cur < mr.end()) {
ysr@345 557 obj = oop(cur);
ysr@345 558 if (obj->klass() == NULL) {
ysr@345 559 // Ran into an unparseable point.
ysr@345 560 return cur;
ysr@345 561 } else if (!g1h->is_obj_dead(obj)) {
ysr@345 562 cl->do_object(obj);
ysr@345 563 }
ysr@345 564 if (cl->abort()) return cur;
ysr@345 565 // The check above must occur before the operation below, since an
ysr@345 566 // abort might invalidate the "size" operation.
ysr@345 567 cur += obj->size();
ysr@345 568 }
ysr@345 569 return NULL;
ysr@345 570 }
ysr@345 571
ysr@345 572 HeapWord*
ysr@345 573 HeapRegion::
ysr@345 574 oops_on_card_seq_iterate_careful(MemRegion mr,
ysr@345 575 FilterOutOfRegionClosure* cl) {
ysr@345 576 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 577
ysr@345 578 // If we're within a stop-world GC, then we might look at a card in a
ysr@345 579 // GC alloc region that extends onto a GC LAB, which may not be
ysr@345 580 // parseable. Stop such at the "saved_mark" of the region.
ysr@345 581 if (G1CollectedHeap::heap()->is_gc_active()) {
ysr@345 582 mr = mr.intersection(used_region_at_save_marks());
ysr@345 583 } else {
ysr@345 584 mr = mr.intersection(used_region());
ysr@345 585 }
ysr@345 586 if (mr.is_empty()) return NULL;
ysr@345 587 // Otherwise, find the obj that extends onto mr.start().
ysr@345 588
ysr@345 589 // We used to use "block_start_careful" here. But we're actually happy
ysr@345 590 // to update the BOT while we do this...
ysr@345 591 HeapWord* cur = block_start(mr.start());
ysr@345 592 assert(cur <= mr.start(), "Postcondition");
ysr@345 593
ysr@345 594 while (cur <= mr.start()) {
ysr@345 595 if (oop(cur)->klass() == NULL) {
ysr@345 596 // Ran into an unparseable point.
ysr@345 597 return cur;
ysr@345 598 }
ysr@345 599 // Otherwise...
ysr@345 600 int sz = oop(cur)->size();
ysr@345 601 if (cur + sz > mr.start()) break;
ysr@345 602 // Otherwise, go on.
ysr@345 603 cur = cur + sz;
ysr@345 604 }
ysr@345 605 oop obj;
ysr@345 606 obj = oop(cur);
ysr@345 607 // If we finish this loop...
ysr@345 608 assert(cur <= mr.start()
ysr@345 609 && obj->klass() != NULL
ysr@345 610 && cur + obj->size() > mr.start(),
ysr@345 611 "Loop postcondition");
ysr@345 612 if (!g1h->is_obj_dead(obj)) {
ysr@345 613 obj->oop_iterate(cl, mr);
ysr@345 614 }
ysr@345 615
ysr@345 616 HeapWord* next;
ysr@345 617 while (cur < mr.end()) {
ysr@345 618 obj = oop(cur);
ysr@345 619 if (obj->klass() == NULL) {
ysr@345 620 // Ran into an unparseable point.
ysr@345 621 return cur;
ysr@345 622 };
ysr@345 623 // Otherwise:
ysr@345 624 next = (cur + obj->size());
ysr@345 625 if (!g1h->is_obj_dead(obj)) {
ysr@345 626 if (next < mr.end()) {
ysr@345 627 obj->oop_iterate(cl);
ysr@345 628 } else {
ysr@345 629 // this obj spans the boundary. If it's an array, stop at the
ysr@345 630 // boundary.
ysr@345 631 if (obj->is_objArray()) {
ysr@345 632 obj->oop_iterate(cl, mr);
ysr@345 633 } else {
ysr@345 634 obj->oop_iterate(cl);
ysr@345 635 }
ysr@345 636 }
ysr@345 637 }
ysr@345 638 cur = next;
ysr@345 639 }
ysr@345 640 return NULL;
ysr@345 641 }
ysr@345 642
ysr@345 643 void HeapRegion::print() const { print_on(gclog_or_tty); }
ysr@345 644 void HeapRegion::print_on(outputStream* st) const {
ysr@345 645 if (isHumongous()) {
ysr@345 646 if (startsHumongous())
ysr@345 647 st->print(" HS");
ysr@345 648 else
ysr@345 649 st->print(" HC");
ysr@345 650 } else {
ysr@345 651 st->print(" ");
ysr@345 652 }
ysr@345 653 if (in_collection_set())
ysr@345 654 st->print(" CS");
ysr@345 655 else if (is_gc_alloc_region())
ysr@345 656 st->print(" A ");
ysr@345 657 else
ysr@345 658 st->print(" ");
ysr@345 659 if (is_young())
ysr@345 660 st->print(is_scan_only() ? " SO" : (is_survivor() ? " SU" : " Y "));
ysr@345 661 else
ysr@345 662 st->print(" ");
ysr@345 663 if (is_empty())
ysr@345 664 st->print(" F");
ysr@345 665 else
ysr@345 666 st->print(" ");
ysr@345 667 st->print(" %d", _gc_time_stamp);
ysr@345 668 G1OffsetTableContigSpace::print_on(st);
ysr@345 669 }
ysr@345 670
ysr@345 671 #define OBJ_SAMPLE_INTERVAL 0
ysr@345 672 #define BLOCK_SAMPLE_INTERVAL 100
ysr@345 673
ysr@345 674 // This really ought to be commoned up into OffsetTableContigSpace somehow.
ysr@345 675 // We would need a mechanism to make that code skip dead objects.
ysr@345 676
ysr@345 677 void HeapRegion::verify(bool allow_dirty) const {
ysr@345 678 G1CollectedHeap* g1 = G1CollectedHeap::heap();
ysr@345 679 HeapWord* p = bottom();
ysr@345 680 HeapWord* prev_p = NULL;
ysr@345 681 int objs = 0;
ysr@345 682 int blocks = 0;
ysr@345 683 VerifyLiveClosure vl_cl(g1);
ysr@345 684 while (p < top()) {
ysr@345 685 size_t size = oop(p)->size();
ysr@345 686 if (blocks == BLOCK_SAMPLE_INTERVAL) {
ysr@345 687 guarantee(p == block_start_const(p + (size/2)),
ysr@345 688 "check offset computation");
ysr@345 689 blocks = 0;
ysr@345 690 } else {
ysr@345 691 blocks++;
ysr@345 692 }
ysr@345 693 if (objs == OBJ_SAMPLE_INTERVAL) {
ysr@345 694 oop obj = oop(p);
ysr@345 695 if (!g1->is_obj_dead(obj, this)) {
ysr@345 696 obj->verify();
ysr@345 697 vl_cl.set_containing_obj(obj);
ysr@345 698 obj->oop_iterate(&vl_cl);
ysr@345 699 if (G1MaxVerifyFailures >= 0
ysr@345 700 && vl_cl.n_failures() >= G1MaxVerifyFailures) break;
ysr@345 701 }
ysr@345 702 objs = 0;
ysr@345 703 } else {
ysr@345 704 objs++;
ysr@345 705 }
ysr@345 706 prev_p = p;
ysr@345 707 p += size;
ysr@345 708 }
ysr@345 709 HeapWord* rend = end();
ysr@345 710 HeapWord* rtop = top();
ysr@345 711 if (rtop < rend) {
ysr@345 712 guarantee(block_start_const(rtop + (rend - rtop) / 2) == rtop,
ysr@345 713 "check offset computation");
ysr@345 714 }
ysr@345 715 if (vl_cl.failures()) {
ysr@345 716 gclog_or_tty->print_cr("Heap:");
ysr@345 717 G1CollectedHeap::heap()->print();
ysr@345 718 gclog_or_tty->print_cr("");
ysr@345 719 }
ysr@345 720 if (G1VerifyConcMark &&
ysr@345 721 G1VerifyConcMarkPrintReachable &&
ysr@345 722 vl_cl.failures()) {
ysr@345 723 g1->concurrent_mark()->print_prev_bitmap_reachable();
ysr@345 724 }
ysr@345 725 guarantee(!vl_cl.failures(), "should not have had any failures");
ysr@345 726 guarantee(p == top(), "end of last object must match end of space");
ysr@345 727 }
ysr@345 728
ysr@345 729 // G1OffsetTableContigSpace code; copied from space.cpp. Hope this can go
ysr@345 730 // away eventually.
ysr@345 731
ysr@345 732 void G1OffsetTableContigSpace::initialize(MemRegion mr, bool clear_space) {
ysr@345 733 // false ==> we'll do the clearing if there's clearing to be done.
ysr@345 734 ContiguousSpace::initialize(mr, false);
ysr@345 735 _offsets.zero_bottom_entry();
ysr@345 736 _offsets.initialize_threshold();
ysr@345 737 if (clear_space) clear();
ysr@345 738 }
ysr@345 739
ysr@345 740 void G1OffsetTableContigSpace::clear() {
ysr@345 741 ContiguousSpace::clear();
ysr@345 742 _offsets.zero_bottom_entry();
ysr@345 743 _offsets.initialize_threshold();
ysr@345 744 }
ysr@345 745
ysr@345 746 void G1OffsetTableContigSpace::set_bottom(HeapWord* new_bottom) {
ysr@345 747 Space::set_bottom(new_bottom);
ysr@345 748 _offsets.set_bottom(new_bottom);
ysr@345 749 }
ysr@345 750
ysr@345 751 void G1OffsetTableContigSpace::set_end(HeapWord* new_end) {
ysr@345 752 Space::set_end(new_end);
ysr@345 753 _offsets.resize(new_end - bottom());
ysr@345 754 }
ysr@345 755
ysr@345 756 void G1OffsetTableContigSpace::print() const {
ysr@345 757 print_short();
ysr@345 758 gclog_or_tty->print_cr(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ", "
ysr@345 759 INTPTR_FORMAT ", " INTPTR_FORMAT ")",
ysr@345 760 bottom(), top(), _offsets.threshold(), end());
ysr@345 761 }
ysr@345 762
ysr@345 763 HeapWord* G1OffsetTableContigSpace::initialize_threshold() {
ysr@345 764 return _offsets.initialize_threshold();
ysr@345 765 }
ysr@345 766
ysr@345 767 HeapWord* G1OffsetTableContigSpace::cross_threshold(HeapWord* start,
ysr@345 768 HeapWord* end) {
ysr@345 769 _offsets.alloc_block(start, end);
ysr@345 770 return _offsets.threshold();
ysr@345 771 }
ysr@345 772
ysr@345 773 HeapWord* G1OffsetTableContigSpace::saved_mark_word() const {
ysr@345 774 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 775 assert( _gc_time_stamp <= g1h->get_gc_time_stamp(), "invariant" );
ysr@345 776 if (_gc_time_stamp < g1h->get_gc_time_stamp())
ysr@345 777 return top();
ysr@345 778 else
ysr@345 779 return ContiguousSpace::saved_mark_word();
ysr@345 780 }
ysr@345 781
ysr@345 782 void G1OffsetTableContigSpace::set_saved_mark() {
ysr@345 783 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 784 unsigned curr_gc_time_stamp = g1h->get_gc_time_stamp();
ysr@345 785
ysr@345 786 if (_gc_time_stamp < curr_gc_time_stamp) {
ysr@345 787 // The order of these is important, as another thread might be
ysr@345 788 // about to start scanning this region. If it does so after
ysr@345 789 // set_saved_mark and before _gc_time_stamp = ..., then the latter
ysr@345 790 // will be false, and it will pick up top() as the high water mark
ysr@345 791 // of region. If it does so after _gc_time_stamp = ..., then it
ysr@345 792 // will pick up the right saved_mark_word() as the high water mark
ysr@345 793 // of the region. Either way, the behaviour will be correct.
ysr@345 794 ContiguousSpace::set_saved_mark();
iveresov@356 795 _gc_time_stamp = curr_gc_time_stamp;
iveresov@356 796 OrderAccess::fence();
ysr@345 797 }
ysr@345 798 }
ysr@345 799
ysr@345 800 G1OffsetTableContigSpace::
ysr@345 801 G1OffsetTableContigSpace(G1BlockOffsetSharedArray* sharedOffsetArray,
ysr@345 802 MemRegion mr, bool is_zeroed) :
ysr@345 803 _offsets(sharedOffsetArray, mr),
ysr@345 804 _par_alloc_lock(Mutex::leaf, "OffsetTableContigSpace par alloc lock", true),
ysr@345 805 _gc_time_stamp(0)
ysr@345 806 {
ysr@345 807 _offsets.set_space(this);
ysr@345 808 initialize(mr, !is_zeroed);
ysr@345 809 }
ysr@345 810
ysr@345 811 size_t RegionList::length() {
ysr@345 812 size_t len = 0;
ysr@345 813 HeapRegion* cur = hd();
ysr@345 814 DEBUG_ONLY(HeapRegion* last = NULL);
ysr@345 815 while (cur != NULL) {
ysr@345 816 len++;
ysr@345 817 DEBUG_ONLY(last = cur);
ysr@345 818 cur = get_next(cur);
ysr@345 819 }
ysr@345 820 assert(last == tl(), "Invariant");
ysr@345 821 return len;
ysr@345 822 }
ysr@345 823
ysr@345 824 void RegionList::insert_before_head(HeapRegion* r) {
ysr@345 825 assert(well_formed(), "Inv");
ysr@345 826 set_next(r, hd());
ysr@345 827 _hd = r;
ysr@345 828 _sz++;
ysr@345 829 if (tl() == NULL) _tl = r;
ysr@345 830 assert(well_formed(), "Inv");
ysr@345 831 }
ysr@345 832
ysr@345 833 void RegionList::prepend_list(RegionList* new_list) {
ysr@345 834 assert(well_formed(), "Precondition");
ysr@345 835 assert(new_list->well_formed(), "Precondition");
ysr@345 836 HeapRegion* new_tl = new_list->tl();
ysr@345 837 if (new_tl != NULL) {
ysr@345 838 set_next(new_tl, hd());
ysr@345 839 _hd = new_list->hd();
ysr@345 840 _sz += new_list->sz();
ysr@345 841 if (tl() == NULL) _tl = new_list->tl();
ysr@345 842 } else {
ysr@345 843 assert(new_list->hd() == NULL && new_list->sz() == 0, "Inv");
ysr@345 844 }
ysr@345 845 assert(well_formed(), "Inv");
ysr@345 846 }
ysr@345 847
ysr@345 848 void RegionList::delete_after(HeapRegion* r) {
ysr@345 849 assert(well_formed(), "Precondition");
ysr@345 850 HeapRegion* next = get_next(r);
ysr@345 851 assert(r != NULL, "Precondition");
ysr@345 852 HeapRegion* next_tl = get_next(next);
ysr@345 853 set_next(r, next_tl);
ysr@345 854 dec_sz();
ysr@345 855 if (next == tl()) {
ysr@345 856 assert(next_tl == NULL, "Inv");
ysr@345 857 _tl = r;
ysr@345 858 }
ysr@345 859 assert(well_formed(), "Inv");
ysr@345 860 }
ysr@345 861
ysr@345 862 HeapRegion* RegionList::pop() {
ysr@345 863 assert(well_formed(), "Inv");
ysr@345 864 HeapRegion* res = hd();
ysr@345 865 if (res != NULL) {
ysr@345 866 _hd = get_next(res);
ysr@345 867 _sz--;
ysr@345 868 set_next(res, NULL);
ysr@345 869 if (sz() == 0) _tl = NULL;
ysr@345 870 }
ysr@345 871 assert(well_formed(), "Inv");
ysr@345 872 return res;
ysr@345 873 }