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