annotate src/share/vm/gc_implementation/g1/heapRegion.cpp @ 1992:f95d63e2154a

6989984: Use standard include model for Hospot Summary: Replaced MakeDeps and the includeDB files with more standardized solutions. Reviewed-by: coleenp, kvn, kamg
author stefank
date Tue, 23 Nov 2010 13:22:55 -0800
parents 72a161e62cc4
children 2250ee17e258
rev   line source
ysr@345 1 /*
trims@1563 2 * Copyright (c) 2001, 2010, 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@1911 389 void HeapRegion::set_startsHumongous(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@1911 393
tonyp@358 394 _humongous_type = StartsHumongous;
ysr@345 395 _humongous_start_region = this;
tonyp@1911 396
tonyp@1911 397 set_end(new_end);
tonyp@1911 398 _offsets.set_for_starts_humongous(new_end);
tonyp@1911 399 }
tonyp@1911 400
tonyp@1911 401 void HeapRegion::set_continuesHumongous(HeapRegion* start) {
tonyp@1911 402 assert(end() == _orig_end,
tonyp@1911 403 "Should be normal before the humongous object allocation");
tonyp@1911 404 assert(top() == bottom(), "should be empty");
tonyp@1911 405 assert(start->startsHumongous(), "pre-condition");
tonyp@1911 406
tonyp@1911 407 _humongous_type = ContinuesHumongous;
tonyp@1911 408 _humongous_start_region = start;
ysr@345 409 }
ysr@345 410
ysr@345 411 bool HeapRegion::claimHeapRegion(jint claimValue) {
ysr@345 412 jint current = _claimed;
ysr@345 413 if (current != claimValue) {
ysr@345 414 jint res = Atomic::cmpxchg(claimValue, &_claimed, current);
ysr@345 415 if (res == current) {
ysr@345 416 return true;
ysr@345 417 }
ysr@345 418 }
ysr@345 419 return false;
ysr@345 420 }
ysr@345 421
ysr@345 422 HeapWord* HeapRegion::next_block_start_careful(HeapWord* addr) {
ysr@345 423 HeapWord* low = addr;
ysr@345 424 HeapWord* high = end();
ysr@345 425 while (low < high) {
ysr@345 426 size_t diff = pointer_delta(high, low);
ysr@345 427 // Must add one below to bias toward the high amount. Otherwise, if
ysr@345 428 // "high" were at the desired value, and "low" were one less, we
ysr@345 429 // would not converge on "high". This is not symmetric, because
ysr@345 430 // we set "high" to a block start, which might be the right one,
ysr@345 431 // which we don't do for "low".
ysr@345 432 HeapWord* middle = low + (diff+1)/2;
ysr@345 433 if (middle == high) return high;
ysr@345 434 HeapWord* mid_bs = block_start_careful(middle);
ysr@345 435 if (mid_bs < addr) {
ysr@345 436 low = middle;
ysr@345 437 } else {
ysr@345 438 high = mid_bs;
ysr@345 439 }
ysr@345 440 }
ysr@345 441 assert(low == high && low >= addr, "Didn't work.");
ysr@345 442 return low;
ysr@345 443 }
ysr@345 444
ysr@345 445 void HeapRegion::set_next_on_unclean_list(HeapRegion* r) {
ysr@345 446 assert(r == NULL || r->is_on_unclean_list(), "Malformed unclean list.");
ysr@345 447 _next_in_special_set = r;
ysr@345 448 }
ysr@345 449
ysr@345 450 void HeapRegion::set_on_unclean_list(bool b) {
ysr@345 451 _is_on_unclean_list = b;
ysr@345 452 }
ysr@345 453
tonyp@359 454 void HeapRegion::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
tonyp@359 455 G1OffsetTableContigSpace::initialize(mr, false, mangle_space);
ysr@345 456 hr_clear(false/*par*/, clear_space);
ysr@345 457 }
ysr@345 458 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
ysr@345 459 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
ysr@345 460 #endif // _MSC_VER
ysr@345 461
ysr@345 462
ysr@345 463 HeapRegion::
ysr@345 464 HeapRegion(G1BlockOffsetSharedArray* sharedOffsetArray,
ysr@345 465 MemRegion mr, bool is_zeroed)
ysr@345 466 : G1OffsetTableContigSpace(sharedOffsetArray, mr, is_zeroed),
ysr@345 467 _next_fk(HeapRegionDCTOC::NoFilterKind),
ysr@345 468 _hrs_index(-1),
tonyp@358 469 _humongous_type(NotHumongous), _humongous_start_region(NULL),
ysr@345 470 _in_collection_set(false), _is_gc_alloc_region(false),
ysr@345 471 _is_on_free_list(false), _is_on_unclean_list(false),
ysr@345 472 _next_in_special_set(NULL), _orig_end(NULL),
tonyp@358 473 _claimed(InitialClaimValue), _evacuation_failed(false),
ysr@345 474 _prev_marked_bytes(0), _next_marked_bytes(0), _sort_index(-1),
ysr@345 475 _young_type(NotYoung), _next_young_region(NULL),
apetrusenko@844 476 _next_dirty_cards_region(NULL),
ysr@345 477 _young_index_in_cset(-1), _surv_rate_group(NULL), _age_index(-1),
johnc@1483 478 _rem_set(NULL), _zfs(NotZeroFilled),
johnc@1483 479 _recorded_rs_length(0), _predicted_elapsed_time_ms(0),
johnc@1483 480 _predicted_bytes_to_copy(0)
ysr@345 481 {
ysr@345 482 _orig_end = mr.end();
ysr@345 483 // Note that initialize() will set the start of the unmarked area of the
ysr@345 484 // region.
tonyp@359 485 this->initialize(mr, !is_zeroed, SpaceDecorator::Mangle);
tonyp@359 486 set_top(bottom());
tonyp@359 487 set_saved_mark();
ysr@345 488
ysr@345 489 _rem_set = new HeapRegionRemSet(sharedOffsetArray, this);
ysr@345 490
ysr@345 491 assert(HeapRegionRemSet::num_par_rem_sets() > 0, "Invariant.");
ysr@345 492 // In case the region is allocated during a pause, note the top.
ysr@345 493 // We haven't done any counting on a brand new region.
ysr@345 494 _top_at_conc_mark_count = bottom();
ysr@345 495 }
ysr@345 496
ysr@345 497 class NextCompactionHeapRegionClosure: public HeapRegionClosure {
ysr@345 498 const HeapRegion* _target;
ysr@345 499 bool _target_seen;
ysr@345 500 HeapRegion* _last;
ysr@345 501 CompactibleSpace* _res;
ysr@345 502 public:
ysr@345 503 NextCompactionHeapRegionClosure(const HeapRegion* target) :
ysr@345 504 _target(target), _target_seen(false), _res(NULL) {}
ysr@345 505 bool doHeapRegion(HeapRegion* cur) {
ysr@345 506 if (_target_seen) {
ysr@345 507 if (!cur->isHumongous()) {
ysr@345 508 _res = cur;
ysr@345 509 return true;
ysr@345 510 }
ysr@345 511 } else if (cur == _target) {
ysr@345 512 _target_seen = true;
ysr@345 513 }
ysr@345 514 return false;
ysr@345 515 }
ysr@345 516 CompactibleSpace* result() { return _res; }
ysr@345 517 };
ysr@345 518
ysr@345 519 CompactibleSpace* HeapRegion::next_compaction_space() const {
ysr@345 520 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 521 // cast away const-ness
ysr@345 522 HeapRegion* r = (HeapRegion*) this;
ysr@345 523 NextCompactionHeapRegionClosure blk(r);
ysr@345 524 g1h->heap_region_iterate_from(r, &blk);
ysr@345 525 return blk.result();
ysr@345 526 }
ysr@345 527
ysr@345 528 void HeapRegion::save_marks() {
ysr@345 529 set_saved_mark();
ysr@345 530 }
ysr@345 531
ysr@345 532 void HeapRegion::oops_in_mr_iterate(MemRegion mr, OopClosure* cl) {
ysr@345 533 HeapWord* p = mr.start();
ysr@345 534 HeapWord* e = mr.end();
ysr@345 535 oop obj;
ysr@345 536 while (p < e) {
ysr@345 537 obj = oop(p);
ysr@345 538 p += obj->oop_iterate(cl);
ysr@345 539 }
ysr@345 540 assert(p == e, "bad memregion: doesn't end on obj boundary");
ysr@345 541 }
ysr@345 542
ysr@345 543 #define HeapRegion_OOP_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \
ysr@345 544 void HeapRegion::oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl) { \
ysr@345 545 ContiguousSpace::oop_since_save_marks_iterate##nv_suffix(cl); \
ysr@345 546 }
ysr@345 547 SPECIALIZED_SINCE_SAVE_MARKS_CLOSURES(HeapRegion_OOP_SINCE_SAVE_MARKS_DEFN)
ysr@345 548
ysr@345 549
ysr@345 550 void HeapRegion::oop_before_save_marks_iterate(OopClosure* cl) {
ysr@345 551 oops_in_mr_iterate(MemRegion(bottom(), saved_mark_word()), cl);
ysr@345 552 }
ysr@345 553
ysr@345 554 #ifdef DEBUG
ysr@345 555 HeapWord* HeapRegion::allocate(size_t size) {
ysr@345 556 jint state = zero_fill_state();
ysr@345 557 assert(!G1CollectedHeap::heap()->allocs_are_zero_filled() ||
ysr@345 558 zero_fill_is_allocated(),
ysr@345 559 "When ZF is on, only alloc in ZF'd regions");
ysr@345 560 return G1OffsetTableContigSpace::allocate(size);
ysr@345 561 }
ysr@345 562 #endif
ysr@345 563
ysr@345 564 void HeapRegion::set_zero_fill_state_work(ZeroFillState zfs) {
ysr@345 565 assert(ZF_mon->owned_by_self() ||
ysr@345 566 Universe::heap()->is_gc_active(),
ysr@345 567 "Must hold the lock or be a full GC to modify.");
apetrusenko@1556 568 #ifdef ASSERT
apetrusenko@1556 569 if (top() != bottom() && zfs != Allocated) {
apetrusenko@1556 570 ResourceMark rm;
apetrusenko@1556 571 stringStream region_str;
apetrusenko@1556 572 print_on(&region_str);
apetrusenko@1556 573 assert(top() == bottom() || zfs == Allocated,
apetrusenko@1556 574 err_msg("Region must be empty, or we must be setting it to allocated. "
apetrusenko@1556 575 "_zfs=%d, zfs=%d, region: %s", _zfs, zfs, region_str.as_string()));
apetrusenko@1556 576 }
apetrusenko@1556 577 #endif
ysr@345 578 _zfs = zfs;
ysr@345 579 }
ysr@345 580
ysr@345 581 void HeapRegion::set_zero_fill_complete() {
ysr@345 582 set_zero_fill_state_work(ZeroFilled);
ysr@345 583 if (ZF_mon->owned_by_self()) {
ysr@345 584 ZF_mon->notify_all();
ysr@345 585 }
ysr@345 586 }
ysr@345 587
ysr@345 588
ysr@345 589 void HeapRegion::ensure_zero_filled() {
ysr@345 590 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag);
ysr@345 591 ensure_zero_filled_locked();
ysr@345 592 }
ysr@345 593
ysr@345 594 void HeapRegion::ensure_zero_filled_locked() {
ysr@345 595 assert(ZF_mon->owned_by_self(), "Precondition");
ysr@345 596 bool should_ignore_zf = SafepointSynchronize::is_at_safepoint();
ysr@345 597 assert(should_ignore_zf || Heap_lock->is_locked(),
ysr@345 598 "Either we're in a GC or we're allocating a region.");
ysr@345 599 switch (zero_fill_state()) {
ysr@345 600 case HeapRegion::NotZeroFilled:
ysr@345 601 set_zero_fill_in_progress(Thread::current());
ysr@345 602 {
ysr@345 603 ZF_mon->unlock();
ysr@345 604 Copy::fill_to_words(bottom(), capacity()/HeapWordSize);
ysr@345 605 ZF_mon->lock_without_safepoint_check();
ysr@345 606 }
ysr@345 607 // A trap.
ysr@345 608 guarantee(zero_fill_state() == HeapRegion::ZeroFilling
ysr@345 609 && zero_filler() == Thread::current(),
ysr@345 610 "AHA! Tell Dave D if you see this...");
ysr@345 611 set_zero_fill_complete();
ysr@345 612 // gclog_or_tty->print_cr("Did sync ZF.");
ysr@345 613 ConcurrentZFThread::note_sync_zfs();
ysr@345 614 break;
ysr@345 615 case HeapRegion::ZeroFilling:
ysr@345 616 if (should_ignore_zf) {
ysr@345 617 // We can "break" the lock and take over the work.
ysr@345 618 Copy::fill_to_words(bottom(), capacity()/HeapWordSize);
ysr@345 619 set_zero_fill_complete();
ysr@345 620 ConcurrentZFThread::note_sync_zfs();
ysr@345 621 break;
ysr@345 622 } else {
ysr@345 623 ConcurrentZFThread::wait_for_ZF_completed(this);
ysr@345 624 }
ysr@345 625 case HeapRegion::ZeroFilled:
ysr@345 626 // Nothing to do.
ysr@345 627 break;
ysr@345 628 case HeapRegion::Allocated:
ysr@345 629 guarantee(false, "Should not call on allocated regions.");
ysr@345 630 }
ysr@345 631 assert(zero_fill_state() == HeapRegion::ZeroFilled, "Post");
ysr@345 632 }
ysr@345 633
ysr@345 634 HeapWord*
ysr@345 635 HeapRegion::object_iterate_mem_careful(MemRegion mr,
ysr@345 636 ObjectClosure* cl) {
ysr@345 637 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 638 // We used to use "block_start_careful" here. But we're actually happy
ysr@345 639 // to update the BOT while we do this...
ysr@345 640 HeapWord* cur = block_start(mr.start());
ysr@345 641 mr = mr.intersection(used_region());
ysr@345 642 if (mr.is_empty()) return NULL;
ysr@345 643 // Otherwise, find the obj that extends onto mr.start().
ysr@345 644
ysr@345 645 assert(cur <= mr.start()
ysr@896 646 && (oop(cur)->klass_or_null() == NULL ||
ysr@345 647 cur + oop(cur)->size() > mr.start()),
ysr@345 648 "postcondition of block_start");
ysr@345 649 oop obj;
ysr@345 650 while (cur < mr.end()) {
ysr@345 651 obj = oop(cur);
ysr@896 652 if (obj->klass_or_null() == NULL) {
ysr@345 653 // Ran into an unparseable point.
ysr@345 654 return cur;
ysr@345 655 } else if (!g1h->is_obj_dead(obj)) {
ysr@345 656 cl->do_object(obj);
ysr@345 657 }
ysr@345 658 if (cl->abort()) return cur;
ysr@345 659 // The check above must occur before the operation below, since an
ysr@345 660 // abort might invalidate the "size" operation.
ysr@345 661 cur += obj->size();
ysr@345 662 }
ysr@345 663 return NULL;
ysr@345 664 }
ysr@345 665
ysr@345 666 HeapWord*
ysr@345 667 HeapRegion::
ysr@345 668 oops_on_card_seq_iterate_careful(MemRegion mr,
johnc@1685 669 FilterOutOfRegionClosure* cl,
johnc@1685 670 bool filter_young) {
ysr@345 671 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 672
ysr@345 673 // If we're within a stop-world GC, then we might look at a card in a
ysr@345 674 // GC alloc region that extends onto a GC LAB, which may not be
ysr@345 675 // parseable. Stop such at the "saved_mark" of the region.
ysr@345 676 if (G1CollectedHeap::heap()->is_gc_active()) {
ysr@345 677 mr = mr.intersection(used_region_at_save_marks());
ysr@345 678 } else {
ysr@345 679 mr = mr.intersection(used_region());
ysr@345 680 }
ysr@345 681 if (mr.is_empty()) return NULL;
ysr@345 682 // Otherwise, find the obj that extends onto mr.start().
ysr@345 683
johnc@1685 684 // The intersection of the incoming mr (for the card) and the
johnc@1685 685 // allocated part of the region is non-empty. This implies that
johnc@1685 686 // we have actually allocated into this region. The code in
johnc@1685 687 // G1CollectedHeap.cpp that allocates a new region sets the
johnc@1685 688 // is_young tag on the region before allocating. Thus we
johnc@1685 689 // safely know if this region is young.
johnc@1685 690 if (is_young() && filter_young) {
johnc@1685 691 return NULL;
johnc@1685 692 }
johnc@1685 693
johnc@1727 694 assert(!is_young(), "check value of filter_young");
johnc@1727 695
ysr@345 696 // We used to use "block_start_careful" here. But we're actually happy
ysr@345 697 // to update the BOT while we do this...
ysr@345 698 HeapWord* cur = block_start(mr.start());
ysr@345 699 assert(cur <= mr.start(), "Postcondition");
ysr@345 700
ysr@345 701 while (cur <= mr.start()) {
ysr@896 702 if (oop(cur)->klass_or_null() == NULL) {
ysr@345 703 // Ran into an unparseable point.
ysr@345 704 return cur;
ysr@345 705 }
ysr@345 706 // Otherwise...
ysr@345 707 int sz = oop(cur)->size();
ysr@345 708 if (cur + sz > mr.start()) break;
ysr@345 709 // Otherwise, go on.
ysr@345 710 cur = cur + sz;
ysr@345 711 }
ysr@345 712 oop obj;
ysr@345 713 obj = oop(cur);
ysr@345 714 // If we finish this loop...
ysr@345 715 assert(cur <= mr.start()
ysr@896 716 && obj->klass_or_null() != NULL
ysr@345 717 && cur + obj->size() > mr.start(),
ysr@345 718 "Loop postcondition");
ysr@345 719 if (!g1h->is_obj_dead(obj)) {
ysr@345 720 obj->oop_iterate(cl, mr);
ysr@345 721 }
ysr@345 722
ysr@345 723 HeapWord* next;
ysr@345 724 while (cur < mr.end()) {
ysr@345 725 obj = oop(cur);
ysr@896 726 if (obj->klass_or_null() == NULL) {
ysr@345 727 // Ran into an unparseable point.
ysr@345 728 return cur;
ysr@345 729 };
ysr@345 730 // Otherwise:
ysr@345 731 next = (cur + obj->size());
ysr@345 732 if (!g1h->is_obj_dead(obj)) {
ysr@345 733 if (next < mr.end()) {
ysr@345 734 obj->oop_iterate(cl);
ysr@345 735 } else {
ysr@345 736 // this obj spans the boundary. If it's an array, stop at the
ysr@345 737 // boundary.
ysr@345 738 if (obj->is_objArray()) {
ysr@345 739 obj->oop_iterate(cl, mr);
ysr@345 740 } else {
ysr@345 741 obj->oop_iterate(cl);
ysr@345 742 }
ysr@345 743 }
ysr@345 744 }
ysr@345 745 cur = next;
ysr@345 746 }
ysr@345 747 return NULL;
ysr@345 748 }
ysr@345 749
ysr@345 750 void HeapRegion::print() const { print_on(gclog_or_tty); }
ysr@345 751 void HeapRegion::print_on(outputStream* st) const {
ysr@345 752 if (isHumongous()) {
ysr@345 753 if (startsHumongous())
ysr@345 754 st->print(" HS");
ysr@345 755 else
ysr@345 756 st->print(" HC");
ysr@345 757 } else {
ysr@345 758 st->print(" ");
ysr@345 759 }
ysr@345 760 if (in_collection_set())
ysr@345 761 st->print(" CS");
ysr@345 762 else if (is_gc_alloc_region())
ysr@345 763 st->print(" A ");
ysr@345 764 else
ysr@345 765 st->print(" ");
ysr@345 766 if (is_young())
johnc@1483 767 st->print(is_survivor() ? " SU" : " Y ");
ysr@345 768 else
ysr@345 769 st->print(" ");
ysr@345 770 if (is_empty())
ysr@345 771 st->print(" F");
ysr@345 772 else
ysr@345 773 st->print(" ");
tonyp@1079 774 st->print(" %5d", _gc_time_stamp);
tonyp@1477 775 st->print(" PTAMS "PTR_FORMAT" NTAMS "PTR_FORMAT,
tonyp@1477 776 prev_top_at_mark_start(), next_top_at_mark_start());
ysr@345 777 G1OffsetTableContigSpace::print_on(st);
ysr@345 778 }
ysr@345 779
tonyp@860 780 void HeapRegion::verify(bool allow_dirty) const {
tonyp@1079 781 bool dummy = false;
tonyp@1079 782 verify(allow_dirty, /* use_prev_marking */ true, /* failures */ &dummy);
tonyp@860 783 }
tonyp@860 784
ysr@345 785 #define OBJ_SAMPLE_INTERVAL 0
ysr@345 786 #define BLOCK_SAMPLE_INTERVAL 100
ysr@345 787
ysr@345 788 // This really ought to be commoned up into OffsetTableContigSpace somehow.
ysr@345 789 // We would need a mechanism to make that code skip dead objects.
ysr@345 790
tonyp@1079 791 void HeapRegion::verify(bool allow_dirty,
tonyp@1079 792 bool use_prev_marking,
tonyp@1079 793 bool* failures) const {
ysr@345 794 G1CollectedHeap* g1 = G1CollectedHeap::heap();
tonyp@1079 795 *failures = false;
ysr@345 796 HeapWord* p = bottom();
ysr@345 797 HeapWord* prev_p = NULL;
ysr@345 798 int objs = 0;
ysr@345 799 int blocks = 0;
tonyp@860 800 VerifyLiveClosure vl_cl(g1, use_prev_marking);
tonyp@1740 801 bool is_humongous = isHumongous();
tonyp@1740 802 size_t object_num = 0;
ysr@345 803 while (p < top()) {
ysr@345 804 size_t size = oop(p)->size();
tonyp@1740 805 if (is_humongous != g1->isHumongous(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@1740 808 p, g1->isHumongous(size) ? "" : "non-",
tonyp@1740 809 size, is_humongous ? "" : "non-");
tonyp@1740 810 *failures = true;
tonyp@1740 811 }
tonyp@1740 812 object_num += 1;
ysr@345 813 if (blocks == BLOCK_SAMPLE_INTERVAL) {
tonyp@1079 814 HeapWord* res = block_start_const(p + (size/2));
tonyp@1079 815 if (p != res) {
tonyp@1079 816 gclog_or_tty->print_cr("offset computation 1 for "PTR_FORMAT" and "
tonyp@1079 817 SIZE_FORMAT" returned "PTR_FORMAT,
tonyp@1079 818 p, size, res);
tonyp@1079 819 *failures = true;
tonyp@1079 820 return;
tonyp@1079 821 }
ysr@345 822 blocks = 0;
ysr@345 823 } else {
ysr@345 824 blocks++;
ysr@345 825 }
ysr@345 826 if (objs == OBJ_SAMPLE_INTERVAL) {
ysr@345 827 oop obj = oop(p);
tonyp@860 828 if (!g1->is_obj_dead_cond(obj, this, use_prev_marking)) {
tonyp@1079 829 if (obj->is_oop()) {
tonyp@1079 830 klassOop klass = obj->klass();
tonyp@1079 831 if (!klass->is_perm()) {
tonyp@1079 832 gclog_or_tty->print_cr("klass "PTR_FORMAT" of object "PTR_FORMAT" "
tonyp@1079 833 "not in perm", klass, obj);
tonyp@1079 834 *failures = true;
tonyp@1079 835 return;
tonyp@1079 836 } else if (!klass->is_klass()) {
tonyp@1079 837 gclog_or_tty->print_cr("klass "PTR_FORMAT" of object "PTR_FORMAT" "
tonyp@1079 838 "not a klass", klass, obj);
tonyp@1079 839 *failures = true;
tonyp@1079 840 return;
tonyp@1079 841 } else {
tonyp@1079 842 vl_cl.set_containing_obj(obj);
tonyp@1079 843 obj->oop_iterate(&vl_cl);
tonyp@1079 844 if (vl_cl.failures()) {
tonyp@1079 845 *failures = true;
tonyp@1079 846 }
tonyp@1079 847 if (G1MaxVerifyFailures >= 0 &&
tonyp@1079 848 vl_cl.n_failures() >= G1MaxVerifyFailures) {
tonyp@1079 849 return;
tonyp@1079 850 }
tonyp@1079 851 }
tonyp@1079 852 } else {
tonyp@1079 853 gclog_or_tty->print_cr(PTR_FORMAT" no an oop", obj);
tonyp@1079 854 *failures = true;
tonyp@1079 855 return;
tonyp@1079 856 }
ysr@345 857 }
ysr@345 858 objs = 0;
ysr@345 859 } else {
ysr@345 860 objs++;
ysr@345 861 }
ysr@345 862 prev_p = p;
ysr@345 863 p += size;
ysr@345 864 }
ysr@345 865 HeapWord* rend = end();
ysr@345 866 HeapWord* rtop = top();
ysr@345 867 if (rtop < rend) {
tonyp@1079 868 HeapWord* res = block_start_const(rtop + (rend - rtop) / 2);
tonyp@1079 869 if (res != rtop) {
tonyp@1079 870 gclog_or_tty->print_cr("offset computation 2 for "PTR_FORMAT" and "
tonyp@1079 871 PTR_FORMAT" returned "PTR_FORMAT,
tonyp@1079 872 rtop, rend, res);
tonyp@1079 873 *failures = true;
tonyp@1079 874 return;
tonyp@1079 875 }
ysr@345 876 }
tonyp@1079 877
tonyp@1740 878 if (is_humongous && object_num > 1) {
tonyp@1740 879 gclog_or_tty->print_cr("region ["PTR_FORMAT","PTR_FORMAT"] is humongous "
tonyp@1740 880 "but has "SIZE_FORMAT", objects",
tonyp@1740 881 bottom(), end(), object_num);
tonyp@1740 882 *failures = true;
tonyp@1740 883 }
tonyp@1740 884
tonyp@1079 885 if (p != top()) {
tonyp@1079 886 gclog_or_tty->print_cr("end of last object "PTR_FORMAT" "
tonyp@1079 887 "does not match top "PTR_FORMAT, p, top());
tonyp@1079 888 *failures = true;
tonyp@1079 889 return;
ysr@345 890 }
ysr@345 891 }
ysr@345 892
ysr@345 893 // G1OffsetTableContigSpace code; copied from space.cpp. Hope this can go
ysr@345 894 // away eventually.
ysr@345 895
tonyp@359 896 void G1OffsetTableContigSpace::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
ysr@345 897 // false ==> we'll do the clearing if there's clearing to be done.
tonyp@359 898 ContiguousSpace::initialize(mr, false, mangle_space);
ysr@345 899 _offsets.zero_bottom_entry();
ysr@345 900 _offsets.initialize_threshold();
tonyp@359 901 if (clear_space) clear(mangle_space);
ysr@345 902 }
ysr@345 903
tonyp@359 904 void G1OffsetTableContigSpace::clear(bool mangle_space) {
tonyp@359 905 ContiguousSpace::clear(mangle_space);
ysr@345 906 _offsets.zero_bottom_entry();
ysr@345 907 _offsets.initialize_threshold();
ysr@345 908 }
ysr@345 909
ysr@345 910 void G1OffsetTableContigSpace::set_bottom(HeapWord* new_bottom) {
ysr@345 911 Space::set_bottom(new_bottom);
ysr@345 912 _offsets.set_bottom(new_bottom);
ysr@345 913 }
ysr@345 914
ysr@345 915 void G1OffsetTableContigSpace::set_end(HeapWord* new_end) {
ysr@345 916 Space::set_end(new_end);
ysr@345 917 _offsets.resize(new_end - bottom());
ysr@345 918 }
ysr@345 919
ysr@345 920 void G1OffsetTableContigSpace::print() const {
ysr@345 921 print_short();
ysr@345 922 gclog_or_tty->print_cr(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ", "
ysr@345 923 INTPTR_FORMAT ", " INTPTR_FORMAT ")",
ysr@345 924 bottom(), top(), _offsets.threshold(), end());
ysr@345 925 }
ysr@345 926
ysr@345 927 HeapWord* G1OffsetTableContigSpace::initialize_threshold() {
ysr@345 928 return _offsets.initialize_threshold();
ysr@345 929 }
ysr@345 930
ysr@345 931 HeapWord* G1OffsetTableContigSpace::cross_threshold(HeapWord* start,
ysr@345 932 HeapWord* end) {
ysr@345 933 _offsets.alloc_block(start, end);
ysr@345 934 return _offsets.threshold();
ysr@345 935 }
ysr@345 936
ysr@345 937 HeapWord* G1OffsetTableContigSpace::saved_mark_word() const {
ysr@345 938 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 939 assert( _gc_time_stamp <= g1h->get_gc_time_stamp(), "invariant" );
ysr@345 940 if (_gc_time_stamp < g1h->get_gc_time_stamp())
ysr@345 941 return top();
ysr@345 942 else
ysr@345 943 return ContiguousSpace::saved_mark_word();
ysr@345 944 }
ysr@345 945
ysr@345 946 void G1OffsetTableContigSpace::set_saved_mark() {
ysr@345 947 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 948 unsigned curr_gc_time_stamp = g1h->get_gc_time_stamp();
ysr@345 949
ysr@345 950 if (_gc_time_stamp < curr_gc_time_stamp) {
ysr@345 951 // The order of these is important, as another thread might be
ysr@345 952 // about to start scanning this region. If it does so after
ysr@345 953 // set_saved_mark and before _gc_time_stamp = ..., then the latter
ysr@345 954 // will be false, and it will pick up top() as the high water mark
ysr@345 955 // of region. If it does so after _gc_time_stamp = ..., then it
ysr@345 956 // will pick up the right saved_mark_word() as the high water mark
ysr@345 957 // of the region. Either way, the behaviour will be correct.
ysr@345 958 ContiguousSpace::set_saved_mark();
ysr@896 959 OrderAccess::storestore();
iveresov@356 960 _gc_time_stamp = curr_gc_time_stamp;
ysr@896 961 // The following fence is to force a flush of the writes above, but
ysr@896 962 // is strictly not needed because when an allocating worker thread
ysr@896 963 // calls set_saved_mark() it does so under the ParGCRareEvent_lock;
ysr@896 964 // when the lock is released, the write will be flushed.
ysr@896 965 // OrderAccess::fence();
ysr@345 966 }
ysr@345 967 }
ysr@345 968
ysr@345 969 G1OffsetTableContigSpace::
ysr@345 970 G1OffsetTableContigSpace(G1BlockOffsetSharedArray* sharedOffsetArray,
ysr@345 971 MemRegion mr, bool is_zeroed) :
ysr@345 972 _offsets(sharedOffsetArray, mr),
ysr@345 973 _par_alloc_lock(Mutex::leaf, "OffsetTableContigSpace par alloc lock", true),
ysr@345 974 _gc_time_stamp(0)
ysr@345 975 {
ysr@345 976 _offsets.set_space(this);
tonyp@359 977 initialize(mr, !is_zeroed, SpaceDecorator::Mangle);
ysr@345 978 }
ysr@345 979
ysr@345 980 size_t RegionList::length() {
ysr@345 981 size_t len = 0;
ysr@345 982 HeapRegion* cur = hd();
ysr@345 983 DEBUG_ONLY(HeapRegion* last = NULL);
ysr@345 984 while (cur != NULL) {
ysr@345 985 len++;
ysr@345 986 DEBUG_ONLY(last = cur);
ysr@345 987 cur = get_next(cur);
ysr@345 988 }
ysr@345 989 assert(last == tl(), "Invariant");
ysr@345 990 return len;
ysr@345 991 }
ysr@345 992
ysr@345 993 void RegionList::insert_before_head(HeapRegion* r) {
ysr@345 994 assert(well_formed(), "Inv");
ysr@345 995 set_next(r, hd());
ysr@345 996 _hd = r;
ysr@345 997 _sz++;
ysr@345 998 if (tl() == NULL) _tl = r;
ysr@345 999 assert(well_formed(), "Inv");
ysr@345 1000 }
ysr@345 1001
ysr@345 1002 void RegionList::prepend_list(RegionList* new_list) {
ysr@345 1003 assert(well_formed(), "Precondition");
ysr@345 1004 assert(new_list->well_formed(), "Precondition");
ysr@345 1005 HeapRegion* new_tl = new_list->tl();
ysr@345 1006 if (new_tl != NULL) {
ysr@345 1007 set_next(new_tl, hd());
ysr@345 1008 _hd = new_list->hd();
ysr@345 1009 _sz += new_list->sz();
ysr@345 1010 if (tl() == NULL) _tl = new_list->tl();
ysr@345 1011 } else {
ysr@345 1012 assert(new_list->hd() == NULL && new_list->sz() == 0, "Inv");
ysr@345 1013 }
ysr@345 1014 assert(well_formed(), "Inv");
ysr@345 1015 }
ysr@345 1016
ysr@345 1017 void RegionList::delete_after(HeapRegion* r) {
ysr@345 1018 assert(well_formed(), "Precondition");
ysr@345 1019 HeapRegion* next = get_next(r);
ysr@345 1020 assert(r != NULL, "Precondition");
ysr@345 1021 HeapRegion* next_tl = get_next(next);
ysr@345 1022 set_next(r, next_tl);
ysr@345 1023 dec_sz();
ysr@345 1024 if (next == tl()) {
ysr@345 1025 assert(next_tl == NULL, "Inv");
ysr@345 1026 _tl = r;
ysr@345 1027 }
ysr@345 1028 assert(well_formed(), "Inv");
ysr@345 1029 }
ysr@345 1030
ysr@345 1031 HeapRegion* RegionList::pop() {
ysr@345 1032 assert(well_formed(), "Inv");
ysr@345 1033 HeapRegion* res = hd();
ysr@345 1034 if (res != NULL) {
ysr@345 1035 _hd = get_next(res);
ysr@345 1036 _sz--;
ysr@345 1037 set_next(res, NULL);
ysr@345 1038 if (sz() == 0) _tl = NULL;
ysr@345 1039 }
ysr@345 1040 assert(well_formed(), "Inv");
ysr@345 1041 return res;
ysr@345 1042 }