annotate src/share/vm/gc_implementation/g1/heapRegion.cpp @ 2146:2250ee17e258

7007068: G1: refine the BOT during evac failure handling Summary: During evacuation failure handling we refine the BOT to reflect the location of all the objects in the regions we scan. The changeset includes some minor cleanup: a) non-product print_on() method on the G1 BOT class, b) added more complete BOT verification during heap / region verification, c) slight modification to the BOT set up for humongous regions to be more consistent with the BOT set up during evac failure handling, and d) removed a couple of unused methods. Reviewed-by: johnc, ysr
author tonyp
date Wed, 12 Jan 2011 13:06:00 -0500
parents f95d63e2154a
children 0fa27f37d4d4
rev   line source
ysr@345 1 /*
tonyp@2146 2 * Copyright (c) 2001, 2011, Oracle and/or its affiliates. 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 *
trims@1563 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1563 20 * or visit www.oracle.com if you need additional information or have any
trims@1563 21 * questions.
ysr@345 22 *
ysr@345 23 */
ysr@345 24
stefank@1992 25 #include "precompiled.hpp"
stefank@1992 26 #include "gc_implementation/g1/concurrentZFThread.hpp"
stefank@1992 27 #include "gc_implementation/g1/g1BlockOffsetTable.inline.hpp"
stefank@1992 28 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
stefank@1992 29 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
stefank@1992 30 #include "gc_implementation/g1/heapRegion.inline.hpp"
stefank@1992 31 #include "gc_implementation/g1/heapRegionRemSet.hpp"
stefank@1992 32 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
stefank@1992 33 #include "memory/genOopClosures.inline.hpp"
stefank@1992 34 #include "memory/iterator.hpp"
stefank@1992 35 #include "oops/oop.inline.hpp"
ysr@345 36
tonyp@996 37 int HeapRegion::LogOfHRGrainBytes = 0;
tonyp@996 38 int HeapRegion::LogOfHRGrainWords = 0;
tonyp@996 39 int HeapRegion::GrainBytes = 0;
tonyp@996 40 int HeapRegion::GrainWords = 0;
tonyp@996 41 int HeapRegion::CardsPerRegion = 0;
tonyp@996 42
ysr@345 43 HeapRegionDCTOC::HeapRegionDCTOC(G1CollectedHeap* g1,
ysr@345 44 HeapRegion* hr, OopClosure* cl,
ysr@345 45 CardTableModRefBS::PrecisionStyle precision,
ysr@345 46 FilterKind fk) :
ysr@345 47 ContiguousSpaceDCTOC(hr, cl, precision, NULL),
ysr@345 48 _hr(hr), _fk(fk), _g1(g1)
ysr@345 49 {}
ysr@345 50
ysr@345 51 FilterOutOfRegionClosure::FilterOutOfRegionClosure(HeapRegion* r,
ysr@345 52 OopClosure* oc) :
ysr@345 53 _r_bottom(r->bottom()), _r_end(r->end()),
ysr@345 54 _oc(oc), _out_of_region(0)
ysr@345 55 {}
ysr@345 56
ysr@345 57 class VerifyLiveClosure: public OopClosure {
tonyp@860 58 private:
ysr@345 59 G1CollectedHeap* _g1h;
ysr@345 60 CardTableModRefBS* _bs;
ysr@345 61 oop _containing_obj;
ysr@345 62 bool _failures;
ysr@345 63 int _n_failures;
tonyp@860 64 bool _use_prev_marking;
ysr@345 65 public:
tonyp@860 66 // use_prev_marking == true -> use "prev" marking information,
tonyp@860 67 // use_prev_marking == false -> use "next" marking information
tonyp@860 68 VerifyLiveClosure(G1CollectedHeap* g1h, bool use_prev_marking) :
ysr@345 69 _g1h(g1h), _bs(NULL), _containing_obj(NULL),
tonyp@860 70 _failures(false), _n_failures(0), _use_prev_marking(use_prev_marking)
ysr@345 71 {
ysr@345 72 BarrierSet* bs = _g1h->barrier_set();
ysr@345 73 if (bs->is_a(BarrierSet::CardTableModRef))
ysr@345 74 _bs = (CardTableModRefBS*)bs;
ysr@345 75 }
ysr@345 76
ysr@345 77 void set_containing_obj(oop obj) {
ysr@345 78 _containing_obj = obj;
ysr@345 79 }
ysr@345 80
ysr@345 81 bool failures() { return _failures; }
ysr@345 82 int n_failures() { return _n_failures; }
ysr@345 83
ysr@896 84 virtual void do_oop(narrowOop* p) { do_oop_work(p); }
ysr@896 85 virtual void do_oop( oop* p) { do_oop_work(p); }
ysr@345 86
tonyp@1477 87 void print_object(outputStream* out, oop obj) {
tonyp@1477 88 #ifdef PRODUCT
tonyp@1477 89 klassOop k = obj->klass();
tonyp@1477 90 const char* class_name = instanceKlass::cast(k)->external_name();
tonyp@1477 91 out->print_cr("class name %s", class_name);
tonyp@1477 92 #else // PRODUCT
tonyp@1477 93 obj->print_on(out);
tonyp@1477 94 #endif // PRODUCT
tonyp@1477 95 }
tonyp@1477 96
ysr@896 97 template <class T> void do_oop_work(T* p) {
ysr@345 98 assert(_containing_obj != NULL, "Precondition");
tonyp@860 99 assert(!_g1h->is_obj_dead_cond(_containing_obj, _use_prev_marking),
tonyp@860 100 "Precondition");
ysr@896 101 T heap_oop = oopDesc::load_heap_oop(p);
ysr@896 102 if (!oopDesc::is_null(heap_oop)) {
ysr@896 103 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
ysr@345 104 bool failed = false;
tonyp@860 105 if (!_g1h->is_in_closed_subset(obj) ||
tonyp@860 106 _g1h->is_obj_dead_cond(obj, _use_prev_marking)) {
ysr@345 107 if (!_failures) {
ysr@345 108 gclog_or_tty->print_cr("");
ysr@345 109 gclog_or_tty->print_cr("----------");
ysr@345 110 }
ysr@345 111 if (!_g1h->is_in_closed_subset(obj)) {
tonyp@1477 112 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
ysr@345 113 gclog_or_tty->print_cr("Field "PTR_FORMAT
tonyp@1477 114 " of live obj "PTR_FORMAT" in region "
tonyp@1477 115 "["PTR_FORMAT", "PTR_FORMAT")",
tonyp@1477 116 p, (void*) _containing_obj,
tonyp@1477 117 from->bottom(), from->end());
tonyp@1477 118 print_object(gclog_or_tty, _containing_obj);
tonyp@1477 119 gclog_or_tty->print_cr("points to obj "PTR_FORMAT" not in the heap",
tonyp@1477 120 (void*) obj);
ysr@345 121 } else {
tonyp@1477 122 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
tonyp@1477 123 HeapRegion* to = _g1h->heap_region_containing((HeapWord*)obj);
ysr@345 124 gclog_or_tty->print_cr("Field "PTR_FORMAT
tonyp@1477 125 " of live obj "PTR_FORMAT" in region "
tonyp@1477 126 "["PTR_FORMAT", "PTR_FORMAT")",
tonyp@1477 127 p, (void*) _containing_obj,
tonyp@1477 128 from->bottom(), from->end());
tonyp@1477 129 print_object(gclog_or_tty, _containing_obj);
tonyp@1477 130 gclog_or_tty->print_cr("points to dead obj "PTR_FORMAT" in region "
tonyp@1477 131 "["PTR_FORMAT", "PTR_FORMAT")",
tonyp@1477 132 (void*) obj, to->bottom(), to->end());
tonyp@1477 133 print_object(gclog_or_tty, obj);
ysr@345 134 }
ysr@345 135 gclog_or_tty->print_cr("----------");
ysr@345 136 _failures = true;
ysr@345 137 failed = true;
ysr@345 138 _n_failures++;
ysr@345 139 }
ysr@345 140
ysr@345 141 if (!_g1h->full_collection()) {
ysr@896 142 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
ysr@896 143 HeapRegion* to = _g1h->heap_region_containing(obj);
ysr@345 144 if (from != NULL && to != NULL &&
ysr@345 145 from != to &&
ysr@345 146 !to->isHumongous()) {
ysr@345 147 jbyte cv_obj = *_bs->byte_for_const(_containing_obj);
ysr@345 148 jbyte cv_field = *_bs->byte_for_const(p);
ysr@345 149 const jbyte dirty = CardTableModRefBS::dirty_card_val();
ysr@345 150
ysr@345 151 bool is_bad = !(from->is_young()
ysr@345 152 || to->rem_set()->contains_reference(p)
ysr@345 153 || !G1HRRSFlushLogBuffersOnVerify && // buffers were not flushed
ysr@345 154 (_containing_obj->is_objArray() ?
ysr@345 155 cv_field == dirty
ysr@345 156 : cv_obj == dirty || cv_field == dirty));
ysr@345 157 if (is_bad) {
ysr@345 158 if (!_failures) {
ysr@345 159 gclog_or_tty->print_cr("");
ysr@345 160 gclog_or_tty->print_cr("----------");
ysr@345 161 }
ysr@345 162 gclog_or_tty->print_cr("Missing rem set entry:");
ysr@345 163 gclog_or_tty->print_cr("Field "PTR_FORMAT
ysr@345 164 " of obj "PTR_FORMAT
ysr@345 165 ", in region %d ["PTR_FORMAT
ysr@345 166 ", "PTR_FORMAT"),",
ysr@345 167 p, (void*) _containing_obj,
ysr@345 168 from->hrs_index(),
ysr@345 169 from->bottom(),
ysr@345 170 from->end());
ysr@345 171 _containing_obj->print_on(gclog_or_tty);
ysr@345 172 gclog_or_tty->print_cr("points to obj "PTR_FORMAT
ysr@345 173 " in region %d ["PTR_FORMAT
ysr@345 174 ", "PTR_FORMAT").",
ysr@345 175 (void*) obj, to->hrs_index(),
ysr@345 176 to->bottom(), to->end());
ysr@345 177 obj->print_on(gclog_or_tty);
ysr@345 178 gclog_or_tty->print_cr("Obj head CTE = %d, field CTE = %d.",
ysr@345 179 cv_obj, cv_field);
ysr@345 180 gclog_or_tty->print_cr("----------");
ysr@345 181 _failures = true;
ysr@345 182 if (!failed) _n_failures++;
ysr@345 183 }
ysr@345 184 }
ysr@345 185 }
ysr@345 186 }
ysr@345 187 }
ysr@345 188 };
ysr@345 189
ysr@345 190 template<class ClosureType>
ysr@345 191 HeapWord* walk_mem_region_loop(ClosureType* cl, G1CollectedHeap* g1h,
ysr@345 192 HeapRegion* hr,
ysr@345 193 HeapWord* cur, HeapWord* top) {
ysr@345 194 oop cur_oop = oop(cur);
ysr@345 195 int oop_size = cur_oop->size();
ysr@345 196 HeapWord* next_obj = cur + oop_size;
ysr@345 197 while (next_obj < top) {
ysr@345 198 // Keep filtering the remembered set.
ysr@345 199 if (!g1h->is_obj_dead(cur_oop, hr)) {
ysr@345 200 // Bottom lies entirely below top, so we can call the
ysr@345 201 // non-memRegion version of oop_iterate below.
ysr@345 202 cur_oop->oop_iterate(cl);
ysr@345 203 }
ysr@345 204 cur = next_obj;
ysr@345 205 cur_oop = oop(cur);
ysr@345 206 oop_size = cur_oop->size();
ysr@345 207 next_obj = cur + oop_size;
ysr@345 208 }
ysr@345 209 return cur;
ysr@345 210 }
ysr@345 211
ysr@345 212 void HeapRegionDCTOC::walk_mem_region_with_cl(MemRegion mr,
ysr@345 213 HeapWord* bottom,
ysr@345 214 HeapWord* top,
ysr@345 215 OopClosure* cl) {
ysr@345 216 G1CollectedHeap* g1h = _g1;
ysr@345 217
ysr@345 218 int oop_size;
ysr@345 219
ysr@345 220 OopClosure* cl2 = cl;
ysr@345 221 FilterIntoCSClosure intoCSFilt(this, g1h, cl);
ysr@345 222 FilterOutOfRegionClosure outOfRegionFilt(_hr, cl);
ysr@345 223 switch (_fk) {
ysr@345 224 case IntoCSFilterKind: cl2 = &intoCSFilt; break;
ysr@345 225 case OutOfRegionFilterKind: cl2 = &outOfRegionFilt; break;
ysr@345 226 }
ysr@345 227
ysr@345 228 // Start filtering what we add to the remembered set. If the object is
ysr@345 229 // not considered dead, either because it is marked (in the mark bitmap)
ysr@345 230 // or it was allocated after marking finished, then we add it. Otherwise
ysr@345 231 // we can safely ignore the object.
ysr@345 232 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
ysr@345 233 oop_size = oop(bottom)->oop_iterate(cl2, mr);
ysr@345 234 } else {
ysr@345 235 oop_size = oop(bottom)->size();
ysr@345 236 }
ysr@345 237
ysr@345 238 bottom += oop_size;
ysr@345 239
ysr@345 240 if (bottom < top) {
ysr@345 241 // We replicate the loop below for several kinds of possible filters.
ysr@345 242 switch (_fk) {
ysr@345 243 case NoFilterKind:
ysr@345 244 bottom = walk_mem_region_loop(cl, g1h, _hr, bottom, top);
ysr@345 245 break;
ysr@345 246 case IntoCSFilterKind: {
ysr@345 247 FilterIntoCSClosure filt(this, g1h, cl);
ysr@345 248 bottom = walk_mem_region_loop(&filt, g1h, _hr, bottom, top);
ysr@345 249 break;
ysr@345 250 }
ysr@345 251 case OutOfRegionFilterKind: {
ysr@345 252 FilterOutOfRegionClosure filt(_hr, cl);
ysr@345 253 bottom = walk_mem_region_loop(&filt, g1h, _hr, bottom, top);
ysr@345 254 break;
ysr@345 255 }
ysr@345 256 default:
ysr@345 257 ShouldNotReachHere();
ysr@345 258 }
ysr@345 259
ysr@345 260 // Last object. Need to do dead-obj filtering here too.
ysr@345 261 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
ysr@345 262 oop(bottom)->oop_iterate(cl2, mr);
ysr@345 263 }
ysr@345 264 }
ysr@345 265 }
ysr@345 266
tonyp@996 267 // Minimum region size; we won't go lower than that.
tonyp@996 268 // We might want to decrease this in the future, to deal with small
tonyp@996 269 // heaps a bit more efficiently.
tonyp@996 270 #define MIN_REGION_SIZE ( 1024 * 1024 )
tonyp@996 271
tonyp@996 272 // Maximum region size; we don't go higher than that. There's a good
tonyp@996 273 // reason for having an upper bound. We don't want regions to get too
tonyp@996 274 // large, otherwise cleanup's effectiveness would decrease as there
tonyp@996 275 // will be fewer opportunities to find totally empty regions after
tonyp@996 276 // marking.
tonyp@996 277 #define MAX_REGION_SIZE ( 32 * 1024 * 1024 )
tonyp@996 278
tonyp@996 279 // The automatic region size calculation will try to have around this
tonyp@996 280 // many regions in the heap (based on the min heap size).
tonyp@996 281 #define TARGET_REGION_NUMBER 2048
tonyp@996 282
tonyp@996 283 void HeapRegion::setup_heap_region_size(uintx min_heap_size) {
tonyp@996 284 // region_size in bytes
tonyp@996 285 uintx region_size = G1HeapRegionSize;
tonyp@996 286 if (FLAG_IS_DEFAULT(G1HeapRegionSize)) {
tonyp@996 287 // We base the automatic calculation on the min heap size. This
tonyp@996 288 // can be problematic if the spread between min and max is quite
tonyp@996 289 // wide, imagine -Xms128m -Xmx32g. But, if we decided it based on
tonyp@996 290 // the max size, the region size might be way too large for the
tonyp@996 291 // min size. Either way, some users might have to set the region
tonyp@996 292 // size manually for some -Xms / -Xmx combos.
tonyp@996 293
tonyp@996 294 region_size = MAX2(min_heap_size / TARGET_REGION_NUMBER,
tonyp@996 295 (uintx) MIN_REGION_SIZE);
tonyp@996 296 }
tonyp@996 297
tonyp@996 298 int region_size_log = log2_long((jlong) region_size);
tonyp@996 299 // Recalculate the region size to make sure it's a power of
tonyp@996 300 // 2. This means that region_size is the largest power of 2 that's
tonyp@996 301 // <= what we've calculated so far.
prr@1496 302 region_size = ((uintx)1 << region_size_log);
tonyp@996 303
tonyp@996 304 // Now make sure that we don't go over or under our limits.
tonyp@996 305 if (region_size < MIN_REGION_SIZE) {
tonyp@996 306 region_size = MIN_REGION_SIZE;
tonyp@996 307 } else if (region_size > MAX_REGION_SIZE) {
tonyp@996 308 region_size = MAX_REGION_SIZE;
tonyp@996 309 }
tonyp@996 310
tonyp@996 311 // And recalculate the log.
tonyp@996 312 region_size_log = log2_long((jlong) region_size);
tonyp@996 313
tonyp@996 314 // Now, set up the globals.
tonyp@996 315 guarantee(LogOfHRGrainBytes == 0, "we should only set it once");
tonyp@996 316 LogOfHRGrainBytes = region_size_log;
tonyp@996 317
tonyp@996 318 guarantee(LogOfHRGrainWords == 0, "we should only set it once");
tonyp@996 319 LogOfHRGrainWords = LogOfHRGrainBytes - LogHeapWordSize;
tonyp@996 320
tonyp@996 321 guarantee(GrainBytes == 0, "we should only set it once");
tonyp@996 322 // The cast to int is safe, given that we've bounded region_size by
tonyp@996 323 // MIN_REGION_SIZE and MAX_REGION_SIZE.
tonyp@996 324 GrainBytes = (int) region_size;
tonyp@996 325
tonyp@996 326 guarantee(GrainWords == 0, "we should only set it once");
tonyp@996 327 GrainWords = GrainBytes >> LogHeapWordSize;
tonyp@996 328 guarantee(1 << LogOfHRGrainWords == GrainWords, "sanity");
tonyp@996 329
tonyp@996 330 guarantee(CardsPerRegion == 0, "we should only set it once");
tonyp@996 331 CardsPerRegion = GrainBytes >> CardTableModRefBS::card_shift;
tonyp@996 332 }
tonyp@996 333
ysr@345 334 void HeapRegion::reset_after_compaction() {
ysr@345 335 G1OffsetTableContigSpace::reset_after_compaction();
ysr@345 336 // After a compaction the mark bitmap is invalid, so we must
ysr@345 337 // treat all objects as being inside the unmarked area.
ysr@345 338 zero_marked_bytes();
ysr@345 339 init_top_at_mark_start();
ysr@345 340 }
ysr@345 341
ysr@345 342 DirtyCardToOopClosure*
ysr@345 343 HeapRegion::new_dcto_closure(OopClosure* cl,
ysr@345 344 CardTableModRefBS::PrecisionStyle precision,
ysr@345 345 HeapRegionDCTOC::FilterKind fk) {
ysr@345 346 return new HeapRegionDCTOC(G1CollectedHeap::heap(),
ysr@345 347 this, cl, precision, fk);
ysr@345 348 }
ysr@345 349
ysr@345 350 void HeapRegion::hr_clear(bool par, bool clear_space) {
tonyp@358 351 _humongous_type = NotHumongous;
ysr@345 352 _humongous_start_region = NULL;
ysr@345 353 _in_collection_set = false;
ysr@345 354 _is_gc_alloc_region = false;
ysr@345 355
ysr@345 356 // Age stuff (if parallel, this will be done separately, since it needs
ysr@345 357 // to be sequential).
ysr@345 358 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 359
ysr@345 360 set_young_index_in_cset(-1);
ysr@345 361 uninstall_surv_rate_group();
ysr@345 362 set_young_type(NotYoung);
ysr@345 363
ysr@345 364 // In case it had been the start of a humongous sequence, reset its end.
ysr@345 365 set_end(_orig_end);
ysr@345 366
ysr@345 367 if (!par) {
ysr@345 368 // If this is parallel, this will be done later.
ysr@345 369 HeapRegionRemSet* hrrs = rem_set();
ysr@345 370 if (hrrs != NULL) hrrs->clear();
tonyp@358 371 _claimed = InitialClaimValue;
ysr@345 372 }
ysr@345 373 zero_marked_bytes();
ysr@345 374 set_sort_index(-1);
ysr@345 375
ysr@345 376 _offsets.resize(HeapRegion::GrainWords);
ysr@345 377 init_top_at_mark_start();
tonyp@359 378 if (clear_space) clear(SpaceDecorator::Mangle);
ysr@345 379 }
ysr@345 380
ysr@345 381 // <PREDICTION>
ysr@345 382 void HeapRegion::calc_gc_efficiency() {
ysr@345 383 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 384 _gc_efficiency = (double) garbage_bytes() /
ysr@345 385 g1h->predict_region_elapsed_time_ms(this, false);
ysr@345 386 }
ysr@345 387 // </PREDICTION>
ysr@345 388
tonyp@2146 389 void HeapRegion::set_startsHumongous(HeapWord* new_top, HeapWord* new_end) {
tonyp@1911 390 assert(end() == _orig_end,
tonyp@1911 391 "Should be normal before the humongous object allocation");
tonyp@1911 392 assert(top() == bottom(), "should be empty");
tonyp@2146 393 assert(bottom() <= new_top && new_top <= new_end, "pre-condition");
tonyp@1911 394
tonyp@358 395 _humongous_type = StartsHumongous;
ysr@345 396 _humongous_start_region = this;
tonyp@1911 397
tonyp@1911 398 set_end(new_end);
tonyp@2146 399 _offsets.set_for_starts_humongous(new_top);
tonyp@1911 400 }
tonyp@1911 401
tonyp@2146 402 void HeapRegion::set_continuesHumongous(HeapRegion* first_hr) {
tonyp@1911 403 assert(end() == _orig_end,
tonyp@1911 404 "Should be normal before the humongous object allocation");
tonyp@1911 405 assert(top() == bottom(), "should be empty");
tonyp@2146 406 assert(first_hr->startsHumongous(), "pre-condition");
tonyp@1911 407
tonyp@1911 408 _humongous_type = ContinuesHumongous;
tonyp@2146 409 _humongous_start_region = first_hr;
ysr@345 410 }
ysr@345 411
ysr@345 412 bool HeapRegion::claimHeapRegion(jint claimValue) {
ysr@345 413 jint current = _claimed;
ysr@345 414 if (current != claimValue) {
ysr@345 415 jint res = Atomic::cmpxchg(claimValue, &_claimed, current);
ysr@345 416 if (res == current) {
ysr@345 417 return true;
ysr@345 418 }
ysr@345 419 }
ysr@345 420 return false;
ysr@345 421 }
ysr@345 422
ysr@345 423 HeapWord* HeapRegion::next_block_start_careful(HeapWord* addr) {
ysr@345 424 HeapWord* low = addr;
ysr@345 425 HeapWord* high = end();
ysr@345 426 while (low < high) {
ysr@345 427 size_t diff = pointer_delta(high, low);
ysr@345 428 // Must add one below to bias toward the high amount. Otherwise, if
ysr@345 429 // "high" were at the desired value, and "low" were one less, we
ysr@345 430 // would not converge on "high". This is not symmetric, because
ysr@345 431 // we set "high" to a block start, which might be the right one,
ysr@345 432 // which we don't do for "low".
ysr@345 433 HeapWord* middle = low + (diff+1)/2;
ysr@345 434 if (middle == high) return high;
ysr@345 435 HeapWord* mid_bs = block_start_careful(middle);
ysr@345 436 if (mid_bs < addr) {
ysr@345 437 low = middle;
ysr@345 438 } else {
ysr@345 439 high = mid_bs;
ysr@345 440 }
ysr@345 441 }
ysr@345 442 assert(low == high && low >= addr, "Didn't work.");
ysr@345 443 return low;
ysr@345 444 }
ysr@345 445
ysr@345 446 void HeapRegion::set_next_on_unclean_list(HeapRegion* r) {
ysr@345 447 assert(r == NULL || r->is_on_unclean_list(), "Malformed unclean list.");
ysr@345 448 _next_in_special_set = r;
ysr@345 449 }
ysr@345 450
ysr@345 451 void HeapRegion::set_on_unclean_list(bool b) {
ysr@345 452 _is_on_unclean_list = b;
ysr@345 453 }
ysr@345 454
tonyp@359 455 void HeapRegion::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
tonyp@359 456 G1OffsetTableContigSpace::initialize(mr, false, mangle_space);
ysr@345 457 hr_clear(false/*par*/, clear_space);
ysr@345 458 }
ysr@345 459 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
ysr@345 460 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
ysr@345 461 #endif // _MSC_VER
ysr@345 462
ysr@345 463
ysr@345 464 HeapRegion::
ysr@345 465 HeapRegion(G1BlockOffsetSharedArray* sharedOffsetArray,
ysr@345 466 MemRegion mr, bool is_zeroed)
ysr@345 467 : G1OffsetTableContigSpace(sharedOffsetArray, mr, is_zeroed),
ysr@345 468 _next_fk(HeapRegionDCTOC::NoFilterKind),
ysr@345 469 _hrs_index(-1),
tonyp@358 470 _humongous_type(NotHumongous), _humongous_start_region(NULL),
ysr@345 471 _in_collection_set(false), _is_gc_alloc_region(false),
ysr@345 472 _is_on_free_list(false), _is_on_unclean_list(false),
ysr@345 473 _next_in_special_set(NULL), _orig_end(NULL),
tonyp@358 474 _claimed(InitialClaimValue), _evacuation_failed(false),
ysr@345 475 _prev_marked_bytes(0), _next_marked_bytes(0), _sort_index(-1),
ysr@345 476 _young_type(NotYoung), _next_young_region(NULL),
apetrusenko@844 477 _next_dirty_cards_region(NULL),
ysr@345 478 _young_index_in_cset(-1), _surv_rate_group(NULL), _age_index(-1),
johnc@1483 479 _rem_set(NULL), _zfs(NotZeroFilled),
johnc@1483 480 _recorded_rs_length(0), _predicted_elapsed_time_ms(0),
johnc@1483 481 _predicted_bytes_to_copy(0)
ysr@345 482 {
ysr@345 483 _orig_end = mr.end();
ysr@345 484 // Note that initialize() will set the start of the unmarked area of the
ysr@345 485 // region.
tonyp@359 486 this->initialize(mr, !is_zeroed, SpaceDecorator::Mangle);
tonyp@359 487 set_top(bottom());
tonyp@359 488 set_saved_mark();
ysr@345 489
ysr@345 490 _rem_set = new HeapRegionRemSet(sharedOffsetArray, this);
ysr@345 491
ysr@345 492 assert(HeapRegionRemSet::num_par_rem_sets() > 0, "Invariant.");
ysr@345 493 // In case the region is allocated during a pause, note the top.
ysr@345 494 // We haven't done any counting on a brand new region.
ysr@345 495 _top_at_conc_mark_count = bottom();
ysr@345 496 }
ysr@345 497
ysr@345 498 class NextCompactionHeapRegionClosure: public HeapRegionClosure {
ysr@345 499 const HeapRegion* _target;
ysr@345 500 bool _target_seen;
ysr@345 501 HeapRegion* _last;
ysr@345 502 CompactibleSpace* _res;
ysr@345 503 public:
ysr@345 504 NextCompactionHeapRegionClosure(const HeapRegion* target) :
ysr@345 505 _target(target), _target_seen(false), _res(NULL) {}
ysr@345 506 bool doHeapRegion(HeapRegion* cur) {
ysr@345 507 if (_target_seen) {
ysr@345 508 if (!cur->isHumongous()) {
ysr@345 509 _res = cur;
ysr@345 510 return true;
ysr@345 511 }
ysr@345 512 } else if (cur == _target) {
ysr@345 513 _target_seen = true;
ysr@345 514 }
ysr@345 515 return false;
ysr@345 516 }
ysr@345 517 CompactibleSpace* result() { return _res; }
ysr@345 518 };
ysr@345 519
ysr@345 520 CompactibleSpace* HeapRegion::next_compaction_space() const {
ysr@345 521 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 522 // cast away const-ness
ysr@345 523 HeapRegion* r = (HeapRegion*) this;
ysr@345 524 NextCompactionHeapRegionClosure blk(r);
ysr@345 525 g1h->heap_region_iterate_from(r, &blk);
ysr@345 526 return blk.result();
ysr@345 527 }
ysr@345 528
ysr@345 529 void HeapRegion::save_marks() {
ysr@345 530 set_saved_mark();
ysr@345 531 }
ysr@345 532
ysr@345 533 void HeapRegion::oops_in_mr_iterate(MemRegion mr, OopClosure* cl) {
ysr@345 534 HeapWord* p = mr.start();
ysr@345 535 HeapWord* e = mr.end();
ysr@345 536 oop obj;
ysr@345 537 while (p < e) {
ysr@345 538 obj = oop(p);
ysr@345 539 p += obj->oop_iterate(cl);
ysr@345 540 }
ysr@345 541 assert(p == e, "bad memregion: doesn't end on obj boundary");
ysr@345 542 }
ysr@345 543
ysr@345 544 #define HeapRegion_OOP_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \
ysr@345 545 void HeapRegion::oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl) { \
ysr@345 546 ContiguousSpace::oop_since_save_marks_iterate##nv_suffix(cl); \
ysr@345 547 }
ysr@345 548 SPECIALIZED_SINCE_SAVE_MARKS_CLOSURES(HeapRegion_OOP_SINCE_SAVE_MARKS_DEFN)
ysr@345 549
ysr@345 550
ysr@345 551 void HeapRegion::oop_before_save_marks_iterate(OopClosure* cl) {
ysr@345 552 oops_in_mr_iterate(MemRegion(bottom(), saved_mark_word()), cl);
ysr@345 553 }
ysr@345 554
ysr@345 555 #ifdef DEBUG
ysr@345 556 HeapWord* HeapRegion::allocate(size_t size) {
ysr@345 557 jint state = zero_fill_state();
ysr@345 558 assert(!G1CollectedHeap::heap()->allocs_are_zero_filled() ||
ysr@345 559 zero_fill_is_allocated(),
ysr@345 560 "When ZF is on, only alloc in ZF'd regions");
ysr@345 561 return G1OffsetTableContigSpace::allocate(size);
ysr@345 562 }
ysr@345 563 #endif
ysr@345 564
ysr@345 565 void HeapRegion::set_zero_fill_state_work(ZeroFillState zfs) {
ysr@345 566 assert(ZF_mon->owned_by_self() ||
ysr@345 567 Universe::heap()->is_gc_active(),
ysr@345 568 "Must hold the lock or be a full GC to modify.");
apetrusenko@1556 569 #ifdef ASSERT
apetrusenko@1556 570 if (top() != bottom() && zfs != Allocated) {
apetrusenko@1556 571 ResourceMark rm;
apetrusenko@1556 572 stringStream region_str;
apetrusenko@1556 573 print_on(&region_str);
apetrusenko@1556 574 assert(top() == bottom() || zfs == Allocated,
apetrusenko@1556 575 err_msg("Region must be empty, or we must be setting it to allocated. "
apetrusenko@1556 576 "_zfs=%d, zfs=%d, region: %s", _zfs, zfs, region_str.as_string()));
apetrusenko@1556 577 }
apetrusenko@1556 578 #endif
ysr@345 579 _zfs = zfs;
ysr@345 580 }
ysr@345 581
ysr@345 582 void HeapRegion::set_zero_fill_complete() {
ysr@345 583 set_zero_fill_state_work(ZeroFilled);
ysr@345 584 if (ZF_mon->owned_by_self()) {
ysr@345 585 ZF_mon->notify_all();
ysr@345 586 }
ysr@345 587 }
ysr@345 588
ysr@345 589
ysr@345 590 void HeapRegion::ensure_zero_filled() {
ysr@345 591 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag);
ysr@345 592 ensure_zero_filled_locked();
ysr@345 593 }
ysr@345 594
ysr@345 595 void HeapRegion::ensure_zero_filled_locked() {
ysr@345 596 assert(ZF_mon->owned_by_self(), "Precondition");
ysr@345 597 bool should_ignore_zf = SafepointSynchronize::is_at_safepoint();
ysr@345 598 assert(should_ignore_zf || Heap_lock->is_locked(),
ysr@345 599 "Either we're in a GC or we're allocating a region.");
ysr@345 600 switch (zero_fill_state()) {
ysr@345 601 case HeapRegion::NotZeroFilled:
ysr@345 602 set_zero_fill_in_progress(Thread::current());
ysr@345 603 {
ysr@345 604 ZF_mon->unlock();
ysr@345 605 Copy::fill_to_words(bottom(), capacity()/HeapWordSize);
ysr@345 606 ZF_mon->lock_without_safepoint_check();
ysr@345 607 }
ysr@345 608 // A trap.
ysr@345 609 guarantee(zero_fill_state() == HeapRegion::ZeroFilling
ysr@345 610 && zero_filler() == Thread::current(),
ysr@345 611 "AHA! Tell Dave D if you see this...");
ysr@345 612 set_zero_fill_complete();
ysr@345 613 // gclog_or_tty->print_cr("Did sync ZF.");
ysr@345 614 ConcurrentZFThread::note_sync_zfs();
ysr@345 615 break;
ysr@345 616 case HeapRegion::ZeroFilling:
ysr@345 617 if (should_ignore_zf) {
ysr@345 618 // We can "break" the lock and take over the work.
ysr@345 619 Copy::fill_to_words(bottom(), capacity()/HeapWordSize);
ysr@345 620 set_zero_fill_complete();
ysr@345 621 ConcurrentZFThread::note_sync_zfs();
ysr@345 622 break;
ysr@345 623 } else {
ysr@345 624 ConcurrentZFThread::wait_for_ZF_completed(this);
ysr@345 625 }
ysr@345 626 case HeapRegion::ZeroFilled:
ysr@345 627 // Nothing to do.
ysr@345 628 break;
ysr@345 629 case HeapRegion::Allocated:
ysr@345 630 guarantee(false, "Should not call on allocated regions.");
ysr@345 631 }
ysr@345 632 assert(zero_fill_state() == HeapRegion::ZeroFilled, "Post");
ysr@345 633 }
ysr@345 634
ysr@345 635 HeapWord*
ysr@345 636 HeapRegion::object_iterate_mem_careful(MemRegion mr,
ysr@345 637 ObjectClosure* cl) {
ysr@345 638 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 639 // We used to use "block_start_careful" here. But we're actually happy
ysr@345 640 // to update the BOT while we do this...
ysr@345 641 HeapWord* cur = block_start(mr.start());
ysr@345 642 mr = mr.intersection(used_region());
ysr@345 643 if (mr.is_empty()) return NULL;
ysr@345 644 // Otherwise, find the obj that extends onto mr.start().
ysr@345 645
ysr@345 646 assert(cur <= mr.start()
ysr@896 647 && (oop(cur)->klass_or_null() == NULL ||
ysr@345 648 cur + oop(cur)->size() > mr.start()),
ysr@345 649 "postcondition of block_start");
ysr@345 650 oop obj;
ysr@345 651 while (cur < mr.end()) {
ysr@345 652 obj = oop(cur);
ysr@896 653 if (obj->klass_or_null() == NULL) {
ysr@345 654 // Ran into an unparseable point.
ysr@345 655 return cur;
ysr@345 656 } else if (!g1h->is_obj_dead(obj)) {
ysr@345 657 cl->do_object(obj);
ysr@345 658 }
ysr@345 659 if (cl->abort()) return cur;
ysr@345 660 // The check above must occur before the operation below, since an
ysr@345 661 // abort might invalidate the "size" operation.
ysr@345 662 cur += obj->size();
ysr@345 663 }
ysr@345 664 return NULL;
ysr@345 665 }
ysr@345 666
ysr@345 667 HeapWord*
ysr@345 668 HeapRegion::
ysr@345 669 oops_on_card_seq_iterate_careful(MemRegion mr,
johnc@1685 670 FilterOutOfRegionClosure* cl,
johnc@1685 671 bool filter_young) {
ysr@345 672 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 673
ysr@345 674 // If we're within a stop-world GC, then we might look at a card in a
ysr@345 675 // GC alloc region that extends onto a GC LAB, which may not be
ysr@345 676 // parseable. Stop such at the "saved_mark" of the region.
ysr@345 677 if (G1CollectedHeap::heap()->is_gc_active()) {
ysr@345 678 mr = mr.intersection(used_region_at_save_marks());
ysr@345 679 } else {
ysr@345 680 mr = mr.intersection(used_region());
ysr@345 681 }
ysr@345 682 if (mr.is_empty()) return NULL;
ysr@345 683 // Otherwise, find the obj that extends onto mr.start().
ysr@345 684
johnc@1685 685 // The intersection of the incoming mr (for the card) and the
johnc@1685 686 // allocated part of the region is non-empty. This implies that
johnc@1685 687 // we have actually allocated into this region. The code in
johnc@1685 688 // G1CollectedHeap.cpp that allocates a new region sets the
johnc@1685 689 // is_young tag on the region before allocating. Thus we
johnc@1685 690 // safely know if this region is young.
johnc@1685 691 if (is_young() && filter_young) {
johnc@1685 692 return NULL;
johnc@1685 693 }
johnc@1685 694
johnc@1727 695 assert(!is_young(), "check value of filter_young");
johnc@1727 696
ysr@345 697 // We used to use "block_start_careful" here. But we're actually happy
ysr@345 698 // to update the BOT while we do this...
ysr@345 699 HeapWord* cur = block_start(mr.start());
ysr@345 700 assert(cur <= mr.start(), "Postcondition");
ysr@345 701
ysr@345 702 while (cur <= mr.start()) {
ysr@896 703 if (oop(cur)->klass_or_null() == NULL) {
ysr@345 704 // Ran into an unparseable point.
ysr@345 705 return cur;
ysr@345 706 }
ysr@345 707 // Otherwise...
ysr@345 708 int sz = oop(cur)->size();
ysr@345 709 if (cur + sz > mr.start()) break;
ysr@345 710 // Otherwise, go on.
ysr@345 711 cur = cur + sz;
ysr@345 712 }
ysr@345 713 oop obj;
ysr@345 714 obj = oop(cur);
ysr@345 715 // If we finish this loop...
ysr@345 716 assert(cur <= mr.start()
ysr@896 717 && obj->klass_or_null() != NULL
ysr@345 718 && cur + obj->size() > mr.start(),
ysr@345 719 "Loop postcondition");
ysr@345 720 if (!g1h->is_obj_dead(obj)) {
ysr@345 721 obj->oop_iterate(cl, mr);
ysr@345 722 }
ysr@345 723
ysr@345 724 HeapWord* next;
ysr@345 725 while (cur < mr.end()) {
ysr@345 726 obj = oop(cur);
ysr@896 727 if (obj->klass_or_null() == NULL) {
ysr@345 728 // Ran into an unparseable point.
ysr@345 729 return cur;
ysr@345 730 };
ysr@345 731 // Otherwise:
ysr@345 732 next = (cur + obj->size());
ysr@345 733 if (!g1h->is_obj_dead(obj)) {
ysr@345 734 if (next < mr.end()) {
ysr@345 735 obj->oop_iterate(cl);
ysr@345 736 } else {
ysr@345 737 // this obj spans the boundary. If it's an array, stop at the
ysr@345 738 // boundary.
ysr@345 739 if (obj->is_objArray()) {
ysr@345 740 obj->oop_iterate(cl, mr);
ysr@345 741 } else {
ysr@345 742 obj->oop_iterate(cl);
ysr@345 743 }
ysr@345 744 }
ysr@345 745 }
ysr@345 746 cur = next;
ysr@345 747 }
ysr@345 748 return NULL;
ysr@345 749 }
ysr@345 750
ysr@345 751 void HeapRegion::print() const { print_on(gclog_or_tty); }
ysr@345 752 void HeapRegion::print_on(outputStream* st) const {
ysr@345 753 if (isHumongous()) {
ysr@345 754 if (startsHumongous())
ysr@345 755 st->print(" HS");
ysr@345 756 else
ysr@345 757 st->print(" HC");
ysr@345 758 } else {
ysr@345 759 st->print(" ");
ysr@345 760 }
ysr@345 761 if (in_collection_set())
ysr@345 762 st->print(" CS");
ysr@345 763 else if (is_gc_alloc_region())
ysr@345 764 st->print(" A ");
ysr@345 765 else
ysr@345 766 st->print(" ");
ysr@345 767 if (is_young())
johnc@1483 768 st->print(is_survivor() ? " SU" : " Y ");
ysr@345 769 else
ysr@345 770 st->print(" ");
ysr@345 771 if (is_empty())
ysr@345 772 st->print(" F");
ysr@345 773 else
ysr@345 774 st->print(" ");
tonyp@1079 775 st->print(" %5d", _gc_time_stamp);
tonyp@1477 776 st->print(" PTAMS "PTR_FORMAT" NTAMS "PTR_FORMAT,
tonyp@1477 777 prev_top_at_mark_start(), next_top_at_mark_start());
ysr@345 778 G1OffsetTableContigSpace::print_on(st);
ysr@345 779 }
ysr@345 780
tonyp@860 781 void HeapRegion::verify(bool allow_dirty) const {
tonyp@1079 782 bool dummy = false;
tonyp@1079 783 verify(allow_dirty, /* use_prev_marking */ true, /* failures */ &dummy);
tonyp@860 784 }
tonyp@860 785
ysr@345 786 // This really ought to be commoned up into OffsetTableContigSpace somehow.
ysr@345 787 // We would need a mechanism to make that code skip dead objects.
ysr@345 788
tonyp@1079 789 void HeapRegion::verify(bool allow_dirty,
tonyp@1079 790 bool use_prev_marking,
tonyp@1079 791 bool* failures) const {
ysr@345 792 G1CollectedHeap* g1 = G1CollectedHeap::heap();
tonyp@1079 793 *failures = false;
ysr@345 794 HeapWord* p = bottom();
ysr@345 795 HeapWord* prev_p = NULL;
tonyp@860 796 VerifyLiveClosure vl_cl(g1, use_prev_marking);
tonyp@1740 797 bool is_humongous = isHumongous();
tonyp@2146 798 bool do_bot_verify = !is_young();
tonyp@1740 799 size_t object_num = 0;
ysr@345 800 while (p < top()) {
tonyp@2146 801 oop obj = oop(p);
tonyp@2146 802 size_t obj_size = obj->size();
tonyp@2146 803 object_num += 1;
tonyp@2146 804
tonyp@2146 805 if (is_humongous != g1->isHumongous(obj_size)) {
tonyp@1740 806 gclog_or_tty->print_cr("obj "PTR_FORMAT" is of %shumongous size ("
tonyp@1740 807 SIZE_FORMAT" words) in a %shumongous region",
tonyp@2146 808 p, g1->isHumongous(obj_size) ? "" : "non-",
tonyp@2146 809 obj_size, is_humongous ? "" : "non-");
tonyp@1740 810 *failures = true;
tonyp@2146 811 return;
tonyp@1740 812 }
tonyp@2146 813
tonyp@2146 814 // If it returns false, verify_for_object() will output the
tonyp@2146 815 // appropriate messasge.
tonyp@2146 816 if (do_bot_verify && !_offsets.verify_for_object(p, obj_size)) {
tonyp@2146 817 *failures = true;
tonyp@2146 818 return;
tonyp@2146 819 }
tonyp@2146 820
tonyp@2146 821 if (!g1->is_obj_dead_cond(obj, this, use_prev_marking)) {
tonyp@2146 822 if (obj->is_oop()) {
tonyp@2146 823 klassOop klass = obj->klass();
tonyp@2146 824 if (!klass->is_perm()) {
tonyp@2146 825 gclog_or_tty->print_cr("klass "PTR_FORMAT" of object "PTR_FORMAT" "
tonyp@2146 826 "not in perm", klass, obj);
tonyp@2146 827 *failures = true;
tonyp@2146 828 return;
tonyp@2146 829 } else if (!klass->is_klass()) {
tonyp@2146 830 gclog_or_tty->print_cr("klass "PTR_FORMAT" of object "PTR_FORMAT" "
tonyp@2146 831 "not a klass", klass, obj);
tonyp@2146 832 *failures = true;
tonyp@2146 833 return;
tonyp@2146 834 } else {
tonyp@2146 835 vl_cl.set_containing_obj(obj);
tonyp@2146 836 obj->oop_iterate(&vl_cl);
tonyp@2146 837 if (vl_cl.failures()) {
tonyp@2146 838 *failures = true;
tonyp@2146 839 }
tonyp@2146 840 if (G1MaxVerifyFailures >= 0 &&
tonyp@2146 841 vl_cl.n_failures() >= G1MaxVerifyFailures) {
tonyp@2146 842 return;
tonyp@2146 843 }
tonyp@2146 844 }
tonyp@2146 845 } else {
tonyp@2146 846 gclog_or_tty->print_cr(PTR_FORMAT" no an oop", obj);
tonyp@1079 847 *failures = true;
tonyp@1079 848 return;
tonyp@1079 849 }
ysr@345 850 }
ysr@345 851 prev_p = p;
tonyp@2146 852 p += obj_size;
ysr@345 853 }
tonyp@2146 854
tonyp@2146 855 if (p != top()) {
tonyp@2146 856 gclog_or_tty->print_cr("end of last object "PTR_FORMAT" "
tonyp@2146 857 "does not match top "PTR_FORMAT, p, top());
tonyp@2146 858 *failures = true;
tonyp@2146 859 return;
tonyp@2146 860 }
tonyp@2146 861
tonyp@2146 862 HeapWord* the_end = end();
tonyp@2146 863 assert(p == top(), "it should still hold");
tonyp@2146 864 // Do some extra BOT consistency checking for addresses in the
tonyp@2146 865 // range [top, end). BOT look-ups in this range should yield
tonyp@2146 866 // top. No point in doing that if top == end (there's nothing there).
tonyp@2146 867 if (p < the_end) {
tonyp@2146 868 // Look up top
tonyp@2146 869 HeapWord* addr_1 = p;
tonyp@2146 870 HeapWord* b_start_1 = _offsets.block_start_const(addr_1);
tonyp@2146 871 if (b_start_1 != p) {
tonyp@2146 872 gclog_or_tty->print_cr("BOT look up for top: "PTR_FORMAT" "
tonyp@2146 873 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
tonyp@2146 874 addr_1, b_start_1, p);
tonyp@2146 875 *failures = true;
tonyp@2146 876 return;
tonyp@2146 877 }
tonyp@2146 878
tonyp@2146 879 // Look up top + 1
tonyp@2146 880 HeapWord* addr_2 = p + 1;
tonyp@2146 881 if (addr_2 < the_end) {
tonyp@2146 882 HeapWord* b_start_2 = _offsets.block_start_const(addr_2);
tonyp@2146 883 if (b_start_2 != p) {
tonyp@2146 884 gclog_or_tty->print_cr("BOT look up for top + 1: "PTR_FORMAT" "
tonyp@2146 885 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
tonyp@2146 886 addr_2, b_start_2, p);
tonyp@1079 887 *failures = true;
tonyp@1079 888 return;
tonyp@2146 889 }
tonyp@2146 890 }
tonyp@2146 891
tonyp@2146 892 // Look up an address between top and end
tonyp@2146 893 size_t diff = pointer_delta(the_end, p) / 2;
tonyp@2146 894 HeapWord* addr_3 = p + diff;
tonyp@2146 895 if (addr_3 < the_end) {
tonyp@2146 896 HeapWord* b_start_3 = _offsets.block_start_const(addr_3);
tonyp@2146 897 if (b_start_3 != p) {
tonyp@2146 898 gclog_or_tty->print_cr("BOT look up for top + diff: "PTR_FORMAT" "
tonyp@2146 899 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
tonyp@2146 900 addr_3, b_start_3, p);
tonyp@2146 901 *failures = true;
tonyp@2146 902 return;
tonyp@2146 903 }
tonyp@2146 904 }
tonyp@2146 905
tonyp@2146 906 // Loook up end - 1
tonyp@2146 907 HeapWord* addr_4 = the_end - 1;
tonyp@2146 908 HeapWord* b_start_4 = _offsets.block_start_const(addr_4);
tonyp@2146 909 if (b_start_4 != p) {
tonyp@2146 910 gclog_or_tty->print_cr("BOT look up for end - 1: "PTR_FORMAT" "
tonyp@2146 911 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
tonyp@2146 912 addr_4, b_start_4, p);
tonyp@2146 913 *failures = true;
tonyp@2146 914 return;
tonyp@1079 915 }
ysr@345 916 }
tonyp@1079 917
tonyp@1740 918 if (is_humongous && object_num > 1) {
tonyp@1740 919 gclog_or_tty->print_cr("region ["PTR_FORMAT","PTR_FORMAT"] is humongous "
tonyp@1740 920 "but has "SIZE_FORMAT", objects",
tonyp@1740 921 bottom(), end(), object_num);
tonyp@1740 922 *failures = true;
tonyp@1079 923 return;
ysr@345 924 }
ysr@345 925 }
ysr@345 926
ysr@345 927 // G1OffsetTableContigSpace code; copied from space.cpp. Hope this can go
ysr@345 928 // away eventually.
ysr@345 929
tonyp@359 930 void G1OffsetTableContigSpace::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
ysr@345 931 // false ==> we'll do the clearing if there's clearing to be done.
tonyp@359 932 ContiguousSpace::initialize(mr, false, mangle_space);
ysr@345 933 _offsets.zero_bottom_entry();
ysr@345 934 _offsets.initialize_threshold();
tonyp@359 935 if (clear_space) clear(mangle_space);
ysr@345 936 }
ysr@345 937
tonyp@359 938 void G1OffsetTableContigSpace::clear(bool mangle_space) {
tonyp@359 939 ContiguousSpace::clear(mangle_space);
ysr@345 940 _offsets.zero_bottom_entry();
ysr@345 941 _offsets.initialize_threshold();
ysr@345 942 }
ysr@345 943
ysr@345 944 void G1OffsetTableContigSpace::set_bottom(HeapWord* new_bottom) {
ysr@345 945 Space::set_bottom(new_bottom);
ysr@345 946 _offsets.set_bottom(new_bottom);
ysr@345 947 }
ysr@345 948
ysr@345 949 void G1OffsetTableContigSpace::set_end(HeapWord* new_end) {
ysr@345 950 Space::set_end(new_end);
ysr@345 951 _offsets.resize(new_end - bottom());
ysr@345 952 }
ysr@345 953
ysr@345 954 void G1OffsetTableContigSpace::print() const {
ysr@345 955 print_short();
ysr@345 956 gclog_or_tty->print_cr(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ", "
ysr@345 957 INTPTR_FORMAT ", " INTPTR_FORMAT ")",
ysr@345 958 bottom(), top(), _offsets.threshold(), end());
ysr@345 959 }
ysr@345 960
ysr@345 961 HeapWord* G1OffsetTableContigSpace::initialize_threshold() {
ysr@345 962 return _offsets.initialize_threshold();
ysr@345 963 }
ysr@345 964
ysr@345 965 HeapWord* G1OffsetTableContigSpace::cross_threshold(HeapWord* start,
ysr@345 966 HeapWord* end) {
ysr@345 967 _offsets.alloc_block(start, end);
ysr@345 968 return _offsets.threshold();
ysr@345 969 }
ysr@345 970
ysr@345 971 HeapWord* G1OffsetTableContigSpace::saved_mark_word() const {
ysr@345 972 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 973 assert( _gc_time_stamp <= g1h->get_gc_time_stamp(), "invariant" );
ysr@345 974 if (_gc_time_stamp < g1h->get_gc_time_stamp())
ysr@345 975 return top();
ysr@345 976 else
ysr@345 977 return ContiguousSpace::saved_mark_word();
ysr@345 978 }
ysr@345 979
ysr@345 980 void G1OffsetTableContigSpace::set_saved_mark() {
ysr@345 981 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 982 unsigned curr_gc_time_stamp = g1h->get_gc_time_stamp();
ysr@345 983
ysr@345 984 if (_gc_time_stamp < curr_gc_time_stamp) {
ysr@345 985 // The order of these is important, as another thread might be
ysr@345 986 // about to start scanning this region. If it does so after
ysr@345 987 // set_saved_mark and before _gc_time_stamp = ..., then the latter
ysr@345 988 // will be false, and it will pick up top() as the high water mark
ysr@345 989 // of region. If it does so after _gc_time_stamp = ..., then it
ysr@345 990 // will pick up the right saved_mark_word() as the high water mark
ysr@345 991 // of the region. Either way, the behaviour will be correct.
ysr@345 992 ContiguousSpace::set_saved_mark();
ysr@896 993 OrderAccess::storestore();
iveresov@356 994 _gc_time_stamp = curr_gc_time_stamp;
ysr@896 995 // The following fence is to force a flush of the writes above, but
ysr@896 996 // is strictly not needed because when an allocating worker thread
ysr@896 997 // calls set_saved_mark() it does so under the ParGCRareEvent_lock;
ysr@896 998 // when the lock is released, the write will be flushed.
ysr@896 999 // OrderAccess::fence();
ysr@345 1000 }
ysr@345 1001 }
ysr@345 1002
ysr@345 1003 G1OffsetTableContigSpace::
ysr@345 1004 G1OffsetTableContigSpace(G1BlockOffsetSharedArray* sharedOffsetArray,
ysr@345 1005 MemRegion mr, bool is_zeroed) :
ysr@345 1006 _offsets(sharedOffsetArray, mr),
ysr@345 1007 _par_alloc_lock(Mutex::leaf, "OffsetTableContigSpace par alloc lock", true),
ysr@345 1008 _gc_time_stamp(0)
ysr@345 1009 {
ysr@345 1010 _offsets.set_space(this);
tonyp@359 1011 initialize(mr, !is_zeroed, SpaceDecorator::Mangle);
ysr@345 1012 }
ysr@345 1013
ysr@345 1014 size_t RegionList::length() {
ysr@345 1015 size_t len = 0;
ysr@345 1016 HeapRegion* cur = hd();
ysr@345 1017 DEBUG_ONLY(HeapRegion* last = NULL);
ysr@345 1018 while (cur != NULL) {
ysr@345 1019 len++;
ysr@345 1020 DEBUG_ONLY(last = cur);
ysr@345 1021 cur = get_next(cur);
ysr@345 1022 }
ysr@345 1023 assert(last == tl(), "Invariant");
ysr@345 1024 return len;
ysr@345 1025 }
ysr@345 1026
ysr@345 1027 void RegionList::insert_before_head(HeapRegion* r) {
ysr@345 1028 assert(well_formed(), "Inv");
ysr@345 1029 set_next(r, hd());
ysr@345 1030 _hd = r;
ysr@345 1031 _sz++;
ysr@345 1032 if (tl() == NULL) _tl = r;
ysr@345 1033 assert(well_formed(), "Inv");
ysr@345 1034 }
ysr@345 1035
ysr@345 1036 void RegionList::prepend_list(RegionList* new_list) {
ysr@345 1037 assert(well_formed(), "Precondition");
ysr@345 1038 assert(new_list->well_formed(), "Precondition");
ysr@345 1039 HeapRegion* new_tl = new_list->tl();
ysr@345 1040 if (new_tl != NULL) {
ysr@345 1041 set_next(new_tl, hd());
ysr@345 1042 _hd = new_list->hd();
ysr@345 1043 _sz += new_list->sz();
ysr@345 1044 if (tl() == NULL) _tl = new_list->tl();
ysr@345 1045 } else {
ysr@345 1046 assert(new_list->hd() == NULL && new_list->sz() == 0, "Inv");
ysr@345 1047 }
ysr@345 1048 assert(well_formed(), "Inv");
ysr@345 1049 }
ysr@345 1050
ysr@345 1051 void RegionList::delete_after(HeapRegion* r) {
ysr@345 1052 assert(well_formed(), "Precondition");
ysr@345 1053 HeapRegion* next = get_next(r);
ysr@345 1054 assert(r != NULL, "Precondition");
ysr@345 1055 HeapRegion* next_tl = get_next(next);
ysr@345 1056 set_next(r, next_tl);
ysr@345 1057 dec_sz();
ysr@345 1058 if (next == tl()) {
ysr@345 1059 assert(next_tl == NULL, "Inv");
ysr@345 1060 _tl = r;
ysr@345 1061 }
ysr@345 1062 assert(well_formed(), "Inv");
ysr@345 1063 }
ysr@345 1064
ysr@345 1065 HeapRegion* RegionList::pop() {
ysr@345 1066 assert(well_formed(), "Inv");
ysr@345 1067 HeapRegion* res = hd();
ysr@345 1068 if (res != NULL) {
ysr@345 1069 _hd = get_next(res);
ysr@345 1070 _sz--;
ysr@345 1071 set_next(res, NULL);
ysr@345 1072 if (sz() == 0) _tl = NULL;
ysr@345 1073 }
ysr@345 1074 assert(well_formed(), "Inv");
ysr@345 1075 return res;
ysr@345 1076 }