annotate src/share/vm/gc_implementation/g1/heapRegion.cpp @ 4192:a2f7274eb6ef

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