annotate src/share/vm/gc_implementation/g1/heapRegion.cpp @ 3035:65a8ff39a6da

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