annotate src/share/vm/gc_implementation/g1/heapRegion.cpp @ 3335:b4ebad3520bb

7133038: G1: Some small profile based optimizations Summary: Some minor profile based optimizations. Reduce the number of branches and branch mispredicts by removing some virtual calls, through closure specalization, and refactoring some conditional statements. Reviewed-by: brutisso, tonyp
author johnc
date Thu, 26 Jan 2012 14:14:55 -0800
parents 2ace1c4ee8da
children a9647476d1a4
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),
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
tonyp@3218 97 template <class T>
tonyp@3218 98 void do_oop_work(T* p) {
ysr@345 99 assert(_containing_obj != NULL, "Precondition");
johnc@2767 100 assert(!_g1h->is_obj_dead_cond(_containing_obj, _vo),
tonyp@860 101 "Precondition");
ysr@896 102 T heap_oop = oopDesc::load_heap_oop(p);
ysr@896 103 if (!oopDesc::is_null(heap_oop)) {
ysr@896 104 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
ysr@345 105 bool failed = false;
tonyp@3218 106 if (!_g1h->is_in_closed_subset(obj) || _g1h->is_obj_dead_cond(obj, _vo)) {
tonyp@3218 107 MutexLockerEx x(ParGCRareEvent_lock,
tonyp@3218 108 Mutex::_no_safepoint_check_flag);
tonyp@3218 109
ysr@345 110 if (!_failures) {
ysr@345 111 gclog_or_tty->print_cr("");
ysr@345 112 gclog_or_tty->print_cr("----------");
ysr@345 113 }
ysr@345 114 if (!_g1h->is_in_closed_subset(obj)) {
tonyp@1477 115 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
ysr@345 116 gclog_or_tty->print_cr("Field "PTR_FORMAT
tonyp@1477 117 " of live obj "PTR_FORMAT" in region "
tonyp@1477 118 "["PTR_FORMAT", "PTR_FORMAT")",
tonyp@1477 119 p, (void*) _containing_obj,
tonyp@1477 120 from->bottom(), from->end());
tonyp@1477 121 print_object(gclog_or_tty, _containing_obj);
tonyp@1477 122 gclog_or_tty->print_cr("points to obj "PTR_FORMAT" not in the heap",
tonyp@1477 123 (void*) obj);
ysr@345 124 } else {
tonyp@1477 125 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
tonyp@1477 126 HeapRegion* to = _g1h->heap_region_containing((HeapWord*)obj);
ysr@345 127 gclog_or_tty->print_cr("Field "PTR_FORMAT
tonyp@1477 128 " of live obj "PTR_FORMAT" in region "
tonyp@1477 129 "["PTR_FORMAT", "PTR_FORMAT")",
tonyp@1477 130 p, (void*) _containing_obj,
tonyp@1477 131 from->bottom(), from->end());
tonyp@1477 132 print_object(gclog_or_tty, _containing_obj);
tonyp@1477 133 gclog_or_tty->print_cr("points to dead obj "PTR_FORMAT" in region "
tonyp@1477 134 "["PTR_FORMAT", "PTR_FORMAT")",
tonyp@1477 135 (void*) obj, to->bottom(), to->end());
tonyp@1477 136 print_object(gclog_or_tty, obj);
ysr@345 137 }
ysr@345 138 gclog_or_tty->print_cr("----------");
tonyp@3218 139 gclog_or_tty->flush();
ysr@345 140 _failures = true;
ysr@345 141 failed = true;
ysr@345 142 _n_failures++;
ysr@345 143 }
ysr@345 144
ysr@345 145 if (!_g1h->full_collection()) {
ysr@896 146 HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
ysr@896 147 HeapRegion* to = _g1h->heap_region_containing(obj);
ysr@345 148 if (from != NULL && to != NULL &&
ysr@345 149 from != to &&
ysr@345 150 !to->isHumongous()) {
ysr@345 151 jbyte cv_obj = *_bs->byte_for_const(_containing_obj);
ysr@345 152 jbyte cv_field = *_bs->byte_for_const(p);
ysr@345 153 const jbyte dirty = CardTableModRefBS::dirty_card_val();
ysr@345 154
ysr@345 155 bool is_bad = !(from->is_young()
ysr@345 156 || to->rem_set()->contains_reference(p)
ysr@345 157 || !G1HRRSFlushLogBuffersOnVerify && // buffers were not flushed
ysr@345 158 (_containing_obj->is_objArray() ?
ysr@345 159 cv_field == dirty
ysr@345 160 : cv_obj == dirty || cv_field == dirty));
ysr@345 161 if (is_bad) {
tonyp@3218 162 MutexLockerEx x(ParGCRareEvent_lock,
tonyp@3218 163 Mutex::_no_safepoint_check_flag);
tonyp@3218 164
ysr@345 165 if (!_failures) {
ysr@345 166 gclog_or_tty->print_cr("");
ysr@345 167 gclog_or_tty->print_cr("----------");
ysr@345 168 }
ysr@345 169 gclog_or_tty->print_cr("Missing rem set entry:");
tonyp@2761 170 gclog_or_tty->print_cr("Field "PTR_FORMAT" "
tonyp@2761 171 "of obj "PTR_FORMAT", "
tonyp@2761 172 "in region "HR_FORMAT,
tonyp@2761 173 p, (void*) _containing_obj,
tonyp@2761 174 HR_FORMAT_PARAMS(from));
ysr@345 175 _containing_obj->print_on(gclog_or_tty);
tonyp@2761 176 gclog_or_tty->print_cr("points to obj "PTR_FORMAT" "
tonyp@2761 177 "in region "HR_FORMAT,
tonyp@2761 178 (void*) obj,
tonyp@2761 179 HR_FORMAT_PARAMS(to));
ysr@345 180 obj->print_on(gclog_or_tty);
ysr@345 181 gclog_or_tty->print_cr("Obj head CTE = %d, field CTE = %d.",
ysr@345 182 cv_obj, cv_field);
ysr@345 183 gclog_or_tty->print_cr("----------");
tonyp@3218 184 gclog_or_tty->flush();
ysr@345 185 _failures = true;
ysr@345 186 if (!failed) _n_failures++;
ysr@345 187 }
ysr@345 188 }
ysr@345 189 }
ysr@345 190 }
ysr@345 191 }
ysr@345 192 };
ysr@345 193
ysr@345 194 template<class ClosureType>
ysr@345 195 HeapWord* walk_mem_region_loop(ClosureType* cl, G1CollectedHeap* g1h,
ysr@345 196 HeapRegion* hr,
ysr@345 197 HeapWord* cur, HeapWord* top) {
ysr@345 198 oop cur_oop = oop(cur);
ysr@345 199 int oop_size = cur_oop->size();
ysr@345 200 HeapWord* next_obj = cur + oop_size;
ysr@345 201 while (next_obj < top) {
ysr@345 202 // Keep filtering the remembered set.
ysr@345 203 if (!g1h->is_obj_dead(cur_oop, hr)) {
ysr@345 204 // Bottom lies entirely below top, so we can call the
ysr@345 205 // non-memRegion version of oop_iterate below.
ysr@345 206 cur_oop->oop_iterate(cl);
ysr@345 207 }
ysr@345 208 cur = next_obj;
ysr@345 209 cur_oop = oop(cur);
ysr@345 210 oop_size = cur_oop->size();
ysr@345 211 next_obj = cur + oop_size;
ysr@345 212 }
ysr@345 213 return cur;
ysr@345 214 }
ysr@345 215
ysr@345 216 void HeapRegionDCTOC::walk_mem_region_with_cl(MemRegion mr,
ysr@345 217 HeapWord* bottom,
ysr@345 218 HeapWord* top,
ysr@345 219 OopClosure* cl) {
ysr@345 220 G1CollectedHeap* g1h = _g1;
johnc@2970 221 int oop_size;
johnc@2970 222 OopClosure* cl2 = NULL;
ysr@345 223
johnc@2970 224 FilterIntoCSClosure intoCSFilt(this, g1h, cl);
ysr@345 225 FilterOutOfRegionClosure outOfRegionFilt(_hr, cl);
johnc@2967 226
ysr@345 227 switch (_fk) {
johnc@2970 228 case NoFilterKind: cl2 = cl; break;
ysr@345 229 case IntoCSFilterKind: cl2 = &intoCSFilt; break;
ysr@345 230 case OutOfRegionFilterKind: cl2 = &outOfRegionFilt; break;
johnc@2970 231 default: ShouldNotReachHere();
ysr@345 232 }
ysr@345 233
ysr@345 234 // Start filtering what we add to the remembered set. If the object is
ysr@345 235 // not considered dead, either because it is marked (in the mark bitmap)
ysr@345 236 // or it was allocated after marking finished, then we add it. Otherwise
ysr@345 237 // we can safely ignore the object.
ysr@345 238 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
ysr@345 239 oop_size = oop(bottom)->oop_iterate(cl2, mr);
ysr@345 240 } else {
ysr@345 241 oop_size = oop(bottom)->size();
ysr@345 242 }
ysr@345 243
ysr@345 244 bottom += oop_size;
ysr@345 245
ysr@345 246 if (bottom < top) {
ysr@345 247 // We replicate the loop below for several kinds of possible filters.
ysr@345 248 switch (_fk) {
ysr@345 249 case NoFilterKind:
ysr@345 250 bottom = walk_mem_region_loop(cl, g1h, _hr, bottom, top);
ysr@345 251 break;
johnc@2967 252
ysr@345 253 case IntoCSFilterKind: {
johnc@2970 254 FilterIntoCSClosure filt(this, g1h, cl);
ysr@345 255 bottom = walk_mem_region_loop(&filt, g1h, _hr, bottom, top);
ysr@345 256 break;
ysr@345 257 }
johnc@2967 258
ysr@345 259 case OutOfRegionFilterKind: {
ysr@345 260 FilterOutOfRegionClosure filt(_hr, cl);
ysr@345 261 bottom = walk_mem_region_loop(&filt, g1h, _hr, bottom, top);
ysr@345 262 break;
ysr@345 263 }
johnc@2967 264
ysr@345 265 default:
ysr@345 266 ShouldNotReachHere();
ysr@345 267 }
ysr@345 268
ysr@345 269 // Last object. Need to do dead-obj filtering here too.
ysr@345 270 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
ysr@345 271 oop(bottom)->oop_iterate(cl2, mr);
ysr@345 272 }
ysr@345 273 }
ysr@345 274 }
ysr@345 275
tonyp@996 276 // Minimum region size; we won't go lower than that.
tonyp@996 277 // We might want to decrease this in the future, to deal with small
tonyp@996 278 // heaps a bit more efficiently.
tonyp@996 279 #define MIN_REGION_SIZE ( 1024 * 1024 )
tonyp@996 280
tonyp@996 281 // Maximum region size; we don't go higher than that. There's a good
tonyp@996 282 // reason for having an upper bound. We don't want regions to get too
tonyp@996 283 // large, otherwise cleanup's effectiveness would decrease as there
tonyp@996 284 // will be fewer opportunities to find totally empty regions after
tonyp@996 285 // marking.
tonyp@996 286 #define MAX_REGION_SIZE ( 32 * 1024 * 1024 )
tonyp@996 287
tonyp@996 288 // The automatic region size calculation will try to have around this
tonyp@996 289 // many regions in the heap (based on the min heap size).
tonyp@996 290 #define TARGET_REGION_NUMBER 2048
tonyp@996 291
tonyp@996 292 void HeapRegion::setup_heap_region_size(uintx min_heap_size) {
tonyp@996 293 // region_size in bytes
tonyp@996 294 uintx region_size = G1HeapRegionSize;
tonyp@996 295 if (FLAG_IS_DEFAULT(G1HeapRegionSize)) {
tonyp@996 296 // We base the automatic calculation on the min heap size. This
tonyp@996 297 // can be problematic if the spread between min and max is quite
tonyp@996 298 // wide, imagine -Xms128m -Xmx32g. But, if we decided it based on
tonyp@996 299 // the max size, the region size might be way too large for the
tonyp@996 300 // min size. Either way, some users might have to set the region
tonyp@996 301 // size manually for some -Xms / -Xmx combos.
tonyp@996 302
tonyp@996 303 region_size = MAX2(min_heap_size / TARGET_REGION_NUMBER,
tonyp@996 304 (uintx) MIN_REGION_SIZE);
tonyp@996 305 }
tonyp@996 306
tonyp@996 307 int region_size_log = log2_long((jlong) region_size);
tonyp@996 308 // Recalculate the region size to make sure it's a power of
tonyp@996 309 // 2. This means that region_size is the largest power of 2 that's
tonyp@996 310 // <= what we've calculated so far.
prr@1496 311 region_size = ((uintx)1 << region_size_log);
tonyp@996 312
tonyp@996 313 // Now make sure that we don't go over or under our limits.
tonyp@996 314 if (region_size < MIN_REGION_SIZE) {
tonyp@996 315 region_size = MIN_REGION_SIZE;
tonyp@996 316 } else if (region_size > MAX_REGION_SIZE) {
tonyp@996 317 region_size = MAX_REGION_SIZE;
tonyp@996 318 }
tonyp@996 319
tonyp@996 320 // And recalculate the log.
tonyp@996 321 region_size_log = log2_long((jlong) region_size);
tonyp@996 322
tonyp@996 323 // Now, set up the globals.
tonyp@996 324 guarantee(LogOfHRGrainBytes == 0, "we should only set it once");
tonyp@996 325 LogOfHRGrainBytes = region_size_log;
tonyp@996 326
tonyp@996 327 guarantee(LogOfHRGrainWords == 0, "we should only set it once");
tonyp@996 328 LogOfHRGrainWords = LogOfHRGrainBytes - LogHeapWordSize;
tonyp@996 329
tonyp@996 330 guarantee(GrainBytes == 0, "we should only set it once");
tonyp@996 331 // The cast to int is safe, given that we've bounded region_size by
tonyp@996 332 // MIN_REGION_SIZE and MAX_REGION_SIZE.
johnc@3035 333 GrainBytes = (size_t)region_size;
tonyp@996 334
tonyp@996 335 guarantee(GrainWords == 0, "we should only set it once");
tonyp@996 336 GrainWords = GrainBytes >> LogHeapWordSize;
johnc@3035 337 guarantee((size_t)(1 << LogOfHRGrainWords) == GrainWords, "sanity");
tonyp@996 338
tonyp@996 339 guarantee(CardsPerRegion == 0, "we should only set it once");
tonyp@996 340 CardsPerRegion = GrainBytes >> CardTableModRefBS::card_shift;
tonyp@996 341 }
tonyp@996 342
ysr@345 343 void HeapRegion::reset_after_compaction() {
ysr@345 344 G1OffsetTableContigSpace::reset_after_compaction();
ysr@345 345 // After a compaction the mark bitmap is invalid, so we must
ysr@345 346 // treat all objects as being inside the unmarked area.
ysr@345 347 zero_marked_bytes();
ysr@345 348 init_top_at_mark_start();
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
tonyp@3280 578 void HeapRegion::note_self_forwarding_removal_start(bool during_initial_mark,
tonyp@3280 579 bool during_conc_mark) {
tonyp@3280 580 // We always recreate the prev marking info and we'll explicitly
tonyp@3280 581 // mark all objects we find to be self-forwarded on the prev
tonyp@3280 582 // bitmap. So all objects need to be below PTAMS.
tonyp@3280 583 _prev_top_at_mark_start = top();
tonyp@3280 584 _prev_marked_bytes = 0;
tonyp@3280 585
tonyp@3280 586 if (during_initial_mark) {
tonyp@3280 587 // During initial-mark, we'll also explicitly mark all objects
tonyp@3280 588 // we find to be self-forwarded on the next bitmap. So all
tonyp@3280 589 // objects need to be below NTAMS.
tonyp@3280 590 _next_top_at_mark_start = top();
tonyp@3280 591 set_top_at_conc_mark_count(bottom());
tonyp@3280 592 _next_marked_bytes = 0;
tonyp@3280 593 } else if (during_conc_mark) {
tonyp@3280 594 // During concurrent mark, all objects in the CSet (including
tonyp@3280 595 // the ones we find to be self-forwarded) are implicitly live.
tonyp@3280 596 // So all objects need to be above NTAMS.
tonyp@3280 597 _next_top_at_mark_start = bottom();
tonyp@3280 598 set_top_at_conc_mark_count(bottom());
tonyp@3280 599 _next_marked_bytes = 0;
tonyp@3280 600 }
tonyp@3280 601 }
tonyp@3280 602
tonyp@3280 603 void HeapRegion::note_self_forwarding_removal_end(bool during_initial_mark,
tonyp@3280 604 bool during_conc_mark,
tonyp@3280 605 size_t marked_bytes) {
tonyp@3280 606 assert(0 <= marked_bytes && marked_bytes <= used(),
tonyp@3280 607 err_msg("marked: "SIZE_FORMAT" used: "SIZE_FORMAT,
tonyp@3280 608 marked_bytes, used()));
tonyp@3280 609 _prev_marked_bytes = marked_bytes;
tonyp@3280 610 }
tonyp@3280 611
ysr@345 612 HeapWord*
ysr@345 613 HeapRegion::object_iterate_mem_careful(MemRegion mr,
ysr@345 614 ObjectClosure* cl) {
ysr@345 615 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 616 // We used to use "block_start_careful" here. But we're actually happy
ysr@345 617 // to update the BOT while we do this...
ysr@345 618 HeapWord* cur = block_start(mr.start());
ysr@345 619 mr = mr.intersection(used_region());
ysr@345 620 if (mr.is_empty()) return NULL;
ysr@345 621 // Otherwise, find the obj that extends onto mr.start().
ysr@345 622
ysr@345 623 assert(cur <= mr.start()
ysr@896 624 && (oop(cur)->klass_or_null() == NULL ||
ysr@345 625 cur + oop(cur)->size() > mr.start()),
ysr@345 626 "postcondition of block_start");
ysr@345 627 oop obj;
ysr@345 628 while (cur < mr.end()) {
ysr@345 629 obj = oop(cur);
ysr@896 630 if (obj->klass_or_null() == NULL) {
ysr@345 631 // Ran into an unparseable point.
ysr@345 632 return cur;
ysr@345 633 } else if (!g1h->is_obj_dead(obj)) {
ysr@345 634 cl->do_object(obj);
ysr@345 635 }
ysr@345 636 if (cl->abort()) return cur;
ysr@345 637 // The check above must occur before the operation below, since an
ysr@345 638 // abort might invalidate the "size" operation.
ysr@345 639 cur += obj->size();
ysr@345 640 }
ysr@345 641 return NULL;
ysr@345 642 }
ysr@345 643
ysr@345 644 HeapWord*
ysr@345 645 HeapRegion::
ysr@345 646 oops_on_card_seq_iterate_careful(MemRegion mr,
johnc@1685 647 FilterOutOfRegionClosure* cl,
tonyp@2558 648 bool filter_young,
tonyp@2558 649 jbyte* card_ptr) {
tonyp@2558 650 // Currently, we should only have to clean the card if filter_young
tonyp@2558 651 // is true and vice versa.
tonyp@2558 652 if (filter_young) {
tonyp@2558 653 assert(card_ptr != NULL, "pre-condition");
tonyp@2558 654 } else {
tonyp@2558 655 assert(card_ptr == NULL, "pre-condition");
tonyp@2558 656 }
ysr@345 657 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 658
ysr@345 659 // If we're within a stop-world GC, then we might look at a card in a
ysr@345 660 // GC alloc region that extends onto a GC LAB, which may not be
ysr@345 661 // parseable. Stop such at the "saved_mark" of the region.
johnc@3335 662 if (g1h->is_gc_active()) {
ysr@345 663 mr = mr.intersection(used_region_at_save_marks());
ysr@345 664 } else {
ysr@345 665 mr = mr.intersection(used_region());
ysr@345 666 }
ysr@345 667 if (mr.is_empty()) return NULL;
ysr@345 668 // Otherwise, find the obj that extends onto mr.start().
ysr@345 669
johnc@1685 670 // The intersection of the incoming mr (for the card) and the
johnc@1685 671 // allocated part of the region is non-empty. This implies that
johnc@1685 672 // we have actually allocated into this region. The code in
johnc@1685 673 // G1CollectedHeap.cpp that allocates a new region sets the
johnc@1685 674 // is_young tag on the region before allocating. Thus we
johnc@1685 675 // safely know if this region is young.
johnc@1685 676 if (is_young() && filter_young) {
johnc@1685 677 return NULL;
johnc@1685 678 }
johnc@1685 679
johnc@1727 680 assert(!is_young(), "check value of filter_young");
johnc@1727 681
tonyp@2558 682 // We can only clean the card here, after we make the decision that
tonyp@2558 683 // the card is not young. And we only clean the card if we have been
tonyp@2558 684 // asked to (i.e., card_ptr != NULL).
tonyp@2558 685 if (card_ptr != NULL) {
tonyp@2558 686 *card_ptr = CardTableModRefBS::clean_card_val();
tonyp@2558 687 // We must complete this write before we do any of the reads below.
tonyp@2558 688 OrderAccess::storeload();
tonyp@2558 689 }
tonyp@2558 690
johnc@3335 691 // Cache the boundaries of the memory region in some const locals
johnc@3335 692 HeapWord* const start = mr.start();
johnc@3335 693 HeapWord* const end = mr.end();
johnc@3335 694
ysr@345 695 // We used to use "block_start_careful" here. But we're actually happy
ysr@345 696 // to update the BOT while we do this...
johnc@3335 697 HeapWord* cur = block_start(start);
johnc@3335 698 assert(cur <= start, "Postcondition");
ysr@345 699
johnc@3335 700 oop obj;
johnc@3335 701
johnc@3335 702 HeapWord* next = cur;
johnc@3335 703 while (next <= start) {
johnc@3335 704 cur = next;
johnc@3335 705 obj = oop(cur);
johnc@3335 706 if (obj->klass_or_null() == NULL) {
ysr@345 707 // Ran into an unparseable point.
ysr@345 708 return cur;
ysr@345 709 }
ysr@345 710 // Otherwise...
johnc@3335 711 next = (cur + obj->size());
ysr@345 712 }
johnc@3335 713
johnc@3335 714 // If we finish the above loop...We have a parseable object that
johnc@3335 715 // begins on or before the start of the memory region, and ends
johnc@3335 716 // inside or spans the entire region.
johnc@3335 717
johnc@3335 718 assert(obj == oop(cur), "sanity");
johnc@3335 719 assert(cur <= start &&
johnc@3335 720 obj->klass_or_null() != NULL &&
johnc@3335 721 (cur + obj->size()) > start,
ysr@345 722 "Loop postcondition");
johnc@3335 723
ysr@345 724 if (!g1h->is_obj_dead(obj)) {
ysr@345 725 obj->oop_iterate(cl, mr);
ysr@345 726 }
ysr@345 727
johnc@3335 728 while (cur < end) {
ysr@345 729 obj = oop(cur);
ysr@896 730 if (obj->klass_or_null() == NULL) {
ysr@345 731 // Ran into an unparseable point.
ysr@345 732 return cur;
ysr@345 733 };
johnc@3335 734
ysr@345 735 // Otherwise:
ysr@345 736 next = (cur + obj->size());
johnc@3335 737
ysr@345 738 if (!g1h->is_obj_dead(obj)) {
johnc@3335 739 if (next < end || !obj->is_objArray()) {
johnc@3335 740 // This object either does not span the MemRegion
johnc@3335 741 // boundary, or if it does it's not an array.
johnc@3335 742 // Apply closure to whole object.
ysr@345 743 obj->oop_iterate(cl);
ysr@345 744 } else {
johnc@3335 745 // This obj is an array that spans the boundary.
johnc@3335 746 // Stop at the boundary.
johnc@3335 747 obj->oop_iterate(cl, mr);
ysr@345 748 }
ysr@345 749 }
ysr@345 750 cur = next;
ysr@345 751 }
ysr@345 752 return NULL;
ysr@345 753 }
ysr@345 754
ysr@345 755 void HeapRegion::print() const { print_on(gclog_or_tty); }
ysr@345 756 void HeapRegion::print_on(outputStream* st) const {
ysr@345 757 if (isHumongous()) {
ysr@345 758 if (startsHumongous())
ysr@345 759 st->print(" HS");
ysr@345 760 else
ysr@345 761 st->print(" HC");
ysr@345 762 } else {
ysr@345 763 st->print(" ");
ysr@345 764 }
ysr@345 765 if (in_collection_set())
ysr@345 766 st->print(" CS");
ysr@345 767 else
ysr@345 768 st->print(" ");
ysr@345 769 if (is_young())
johnc@1483 770 st->print(is_survivor() ? " SU" : " Y ");
ysr@345 771 else
ysr@345 772 st->print(" ");
ysr@345 773 if (is_empty())
ysr@345 774 st->print(" F");
ysr@345 775 else
ysr@345 776 st->print(" ");
tonyp@3124 777 st->print(" TS %5d", _gc_time_stamp);
tonyp@1477 778 st->print(" PTAMS "PTR_FORMAT" NTAMS "PTR_FORMAT,
tonyp@1477 779 prev_top_at_mark_start(), next_top_at_mark_start());
ysr@345 780 G1OffsetTableContigSpace::print_on(st);
ysr@345 781 }
ysr@345 782
tonyp@860 783 void HeapRegion::verify(bool allow_dirty) const {
tonyp@1079 784 bool dummy = false;
johnc@2767 785 verify(allow_dirty, VerifyOption_G1UsePrevMarking, /* failures */ &dummy);
tonyp@860 786 }
tonyp@860 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,
johnc@2767 792 VerifyOption vo,
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;
johnc@2767 798 VerifyLiveClosure vl_cl(g1, vo);
tonyp@1740 799 bool is_humongous = isHumongous();
tonyp@2146 800 bool do_bot_verify = !is_young();
tonyp@1740 801 size_t object_num = 0;
ysr@345 802 while (p < top()) {
tonyp@2146 803 oop obj = oop(p);
tonyp@2146 804 size_t obj_size = obj->size();
tonyp@2146 805 object_num += 1;
tonyp@2146 806
tonyp@2146 807 if (is_humongous != g1->isHumongous(obj_size)) {
tonyp@1740 808 gclog_or_tty->print_cr("obj "PTR_FORMAT" is of %shumongous size ("
tonyp@1740 809 SIZE_FORMAT" words) in a %shumongous region",
tonyp@2146 810 p, g1->isHumongous(obj_size) ? "" : "non-",
tonyp@2146 811 obj_size, is_humongous ? "" : "non-");
tonyp@1740 812 *failures = true;
tonyp@2146 813 return;
tonyp@1740 814 }
tonyp@2146 815
tonyp@2146 816 // If it returns false, verify_for_object() will output the
tonyp@2146 817 // appropriate messasge.
tonyp@2146 818 if (do_bot_verify && !_offsets.verify_for_object(p, obj_size)) {
tonyp@2146 819 *failures = true;
tonyp@2146 820 return;
tonyp@2146 821 }
tonyp@2146 822
johnc@2767 823 if (!g1->is_obj_dead_cond(obj, this, vo)) {
tonyp@2146 824 if (obj->is_oop()) {
tonyp@2146 825 klassOop klass = obj->klass();
tonyp@2146 826 if (!klass->is_perm()) {
tonyp@2146 827 gclog_or_tty->print_cr("klass "PTR_FORMAT" of object "PTR_FORMAT" "
tonyp@2146 828 "not in perm", klass, obj);
tonyp@2146 829 *failures = true;
tonyp@2146 830 return;
tonyp@2146 831 } else if (!klass->is_klass()) {
tonyp@2146 832 gclog_or_tty->print_cr("klass "PTR_FORMAT" of object "PTR_FORMAT" "
tonyp@2146 833 "not a klass", klass, obj);
tonyp@2146 834 *failures = true;
tonyp@2146 835 return;
tonyp@2146 836 } else {
tonyp@2146 837 vl_cl.set_containing_obj(obj);
tonyp@2146 838 obj->oop_iterate(&vl_cl);
tonyp@2146 839 if (vl_cl.failures()) {
tonyp@2146 840 *failures = true;
tonyp@2146 841 }
tonyp@2146 842 if (G1MaxVerifyFailures >= 0 &&
tonyp@2146 843 vl_cl.n_failures() >= G1MaxVerifyFailures) {
tonyp@2146 844 return;
tonyp@2146 845 }
tonyp@2146 846 }
tonyp@2146 847 } else {
tonyp@2146 848 gclog_or_tty->print_cr(PTR_FORMAT" no an oop", obj);
tonyp@1079 849 *failures = true;
tonyp@1079 850 return;
tonyp@1079 851 }
ysr@345 852 }
ysr@345 853 prev_p = p;
tonyp@2146 854 p += obj_size;
ysr@345 855 }
tonyp@2146 856
tonyp@2146 857 if (p != top()) {
tonyp@2146 858 gclog_or_tty->print_cr("end of last object "PTR_FORMAT" "
tonyp@2146 859 "does not match top "PTR_FORMAT, p, top());
tonyp@2146 860 *failures = true;
tonyp@2146 861 return;
tonyp@2146 862 }
tonyp@2146 863
tonyp@2146 864 HeapWord* the_end = end();
tonyp@2146 865 assert(p == top(), "it should still hold");
tonyp@2146 866 // Do some extra BOT consistency checking for addresses in the
tonyp@2146 867 // range [top, end). BOT look-ups in this range should yield
tonyp@2146 868 // top. No point in doing that if top == end (there's nothing there).
tonyp@2146 869 if (p < the_end) {
tonyp@2146 870 // Look up top
tonyp@2146 871 HeapWord* addr_1 = p;
tonyp@2146 872 HeapWord* b_start_1 = _offsets.block_start_const(addr_1);
tonyp@2146 873 if (b_start_1 != p) {
tonyp@2146 874 gclog_or_tty->print_cr("BOT look up for top: "PTR_FORMAT" "
tonyp@2146 875 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
tonyp@2146 876 addr_1, b_start_1, p);
tonyp@2146 877 *failures = true;
tonyp@2146 878 return;
tonyp@2146 879 }
tonyp@2146 880
tonyp@2146 881 // Look up top + 1
tonyp@2146 882 HeapWord* addr_2 = p + 1;
tonyp@2146 883 if (addr_2 < the_end) {
tonyp@2146 884 HeapWord* b_start_2 = _offsets.block_start_const(addr_2);
tonyp@2146 885 if (b_start_2 != p) {
tonyp@2146 886 gclog_or_tty->print_cr("BOT look up for top + 1: "PTR_FORMAT" "
tonyp@2146 887 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
tonyp@2146 888 addr_2, b_start_2, p);
tonyp@1079 889 *failures = true;
tonyp@1079 890 return;
tonyp@2146 891 }
tonyp@2146 892 }
tonyp@2146 893
tonyp@2146 894 // Look up an address between top and end
tonyp@2146 895 size_t diff = pointer_delta(the_end, p) / 2;
tonyp@2146 896 HeapWord* addr_3 = p + diff;
tonyp@2146 897 if (addr_3 < the_end) {
tonyp@2146 898 HeapWord* b_start_3 = _offsets.block_start_const(addr_3);
tonyp@2146 899 if (b_start_3 != p) {
tonyp@2146 900 gclog_or_tty->print_cr("BOT look up for top + diff: "PTR_FORMAT" "
tonyp@2146 901 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
tonyp@2146 902 addr_3, b_start_3, p);
tonyp@2146 903 *failures = true;
tonyp@2146 904 return;
tonyp@2146 905 }
tonyp@2146 906 }
tonyp@2146 907
tonyp@2146 908 // Loook up end - 1
tonyp@2146 909 HeapWord* addr_4 = the_end - 1;
tonyp@2146 910 HeapWord* b_start_4 = _offsets.block_start_const(addr_4);
tonyp@2146 911 if (b_start_4 != p) {
tonyp@2146 912 gclog_or_tty->print_cr("BOT look up for end - 1: "PTR_FORMAT" "
tonyp@2146 913 " yielded "PTR_FORMAT", expecting "PTR_FORMAT,
tonyp@2146 914 addr_4, b_start_4, p);
tonyp@2146 915 *failures = true;
tonyp@2146 916 return;
tonyp@1079 917 }
ysr@345 918 }
tonyp@1079 919
tonyp@1740 920 if (is_humongous && object_num > 1) {
tonyp@1740 921 gclog_or_tty->print_cr("region ["PTR_FORMAT","PTR_FORMAT"] is humongous "
tonyp@1740 922 "but has "SIZE_FORMAT", objects",
tonyp@1740 923 bottom(), end(), object_num);
tonyp@1740 924 *failures = true;
tonyp@1079 925 return;
ysr@345 926 }
ysr@345 927 }
ysr@345 928
ysr@345 929 // G1OffsetTableContigSpace code; copied from space.cpp. Hope this can go
ysr@345 930 // away eventually.
ysr@345 931
tonyp@359 932 void G1OffsetTableContigSpace::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
ysr@345 933 // false ==> we'll do the clearing if there's clearing to be done.
tonyp@359 934 ContiguousSpace::initialize(mr, false, mangle_space);
ysr@345 935 _offsets.zero_bottom_entry();
ysr@345 936 _offsets.initialize_threshold();
tonyp@359 937 if (clear_space) clear(mangle_space);
ysr@345 938 }
ysr@345 939
tonyp@359 940 void G1OffsetTableContigSpace::clear(bool mangle_space) {
tonyp@359 941 ContiguousSpace::clear(mangle_space);
ysr@345 942 _offsets.zero_bottom_entry();
ysr@345 943 _offsets.initialize_threshold();
ysr@345 944 }
ysr@345 945
ysr@345 946 void G1OffsetTableContigSpace::set_bottom(HeapWord* new_bottom) {
ysr@345 947 Space::set_bottom(new_bottom);
ysr@345 948 _offsets.set_bottom(new_bottom);
ysr@345 949 }
ysr@345 950
ysr@345 951 void G1OffsetTableContigSpace::set_end(HeapWord* new_end) {
ysr@345 952 Space::set_end(new_end);
ysr@345 953 _offsets.resize(new_end - bottom());
ysr@345 954 }
ysr@345 955
ysr@345 956 void G1OffsetTableContigSpace::print() const {
ysr@345 957 print_short();
ysr@345 958 gclog_or_tty->print_cr(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ", "
ysr@345 959 INTPTR_FORMAT ", " INTPTR_FORMAT ")",
ysr@345 960 bottom(), top(), _offsets.threshold(), end());
ysr@345 961 }
ysr@345 962
ysr@345 963 HeapWord* G1OffsetTableContigSpace::initialize_threshold() {
ysr@345 964 return _offsets.initialize_threshold();
ysr@345 965 }
ysr@345 966
ysr@345 967 HeapWord* G1OffsetTableContigSpace::cross_threshold(HeapWord* start,
ysr@345 968 HeapWord* end) {
ysr@345 969 _offsets.alloc_block(start, end);
ysr@345 970 return _offsets.threshold();
ysr@345 971 }
ysr@345 972
ysr@345 973 HeapWord* G1OffsetTableContigSpace::saved_mark_word() const {
ysr@345 974 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 975 assert( _gc_time_stamp <= g1h->get_gc_time_stamp(), "invariant" );
ysr@345 976 if (_gc_time_stamp < g1h->get_gc_time_stamp())
ysr@345 977 return top();
ysr@345 978 else
ysr@345 979 return ContiguousSpace::saved_mark_word();
ysr@345 980 }
ysr@345 981
ysr@345 982 void G1OffsetTableContigSpace::set_saved_mark() {
ysr@345 983 G1CollectedHeap* g1h = G1CollectedHeap::heap();
ysr@345 984 unsigned curr_gc_time_stamp = g1h->get_gc_time_stamp();
ysr@345 985
ysr@345 986 if (_gc_time_stamp < curr_gc_time_stamp) {
ysr@345 987 // The order of these is important, as another thread might be
ysr@345 988 // about to start scanning this region. If it does so after
ysr@345 989 // set_saved_mark and before _gc_time_stamp = ..., then the latter
ysr@345 990 // will be false, and it will pick up top() as the high water mark
ysr@345 991 // of region. If it does so after _gc_time_stamp = ..., then it
ysr@345 992 // will pick up the right saved_mark_word() as the high water mark
ysr@345 993 // of the region. Either way, the behaviour will be correct.
ysr@345 994 ContiguousSpace::set_saved_mark();
ysr@896 995 OrderAccess::storestore();
iveresov@356 996 _gc_time_stamp = curr_gc_time_stamp;
tonyp@2417 997 // No need to do another barrier to flush the writes above. If
tonyp@2417 998 // this is called in parallel with other threads trying to
tonyp@2417 999 // allocate into the region, the caller should call this while
tonyp@2417 1000 // holding a lock and when the lock is released the writes will be
tonyp@2417 1001 // flushed.
ysr@345 1002 }
ysr@345 1003 }
ysr@345 1004
ysr@345 1005 G1OffsetTableContigSpace::
ysr@345 1006 G1OffsetTableContigSpace(G1BlockOffsetSharedArray* sharedOffsetArray,
ysr@345 1007 MemRegion mr, bool is_zeroed) :
ysr@345 1008 _offsets(sharedOffsetArray, mr),
ysr@345 1009 _par_alloc_lock(Mutex::leaf, "OffsetTableContigSpace par alloc lock", true),
ysr@345 1010 _gc_time_stamp(0)
ysr@345 1011 {
ysr@345 1012 _offsets.set_space(this);
tonyp@359 1013 initialize(mr, !is_zeroed, SpaceDecorator::Mangle);
ysr@345 1014 }