1 /* 2 * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "gc/g1/g1Allocator.inline.hpp" 27 #include "gc/g1/g1CollectedHeap.hpp" 28 #include "gc/g1/g1CollectedHeap.inline.hpp" 29 #include "gc/g1/g1ConcurrentMarkThread.hpp" 30 #include "gc/g1/g1HeapVerifier.hpp" 31 #include "gc/g1/g1Policy.hpp" 32 #include "gc/g1/g1RemSet.hpp" 33 #include "gc/g1/g1RootProcessor.hpp" 34 #include "gc/g1/heapRegion.hpp" 35 #include "gc/g1/heapRegion.inline.hpp" 36 #include "gc/g1/heapRegionRemSet.hpp" 37 #include "gc/g1/g1StringDedup.hpp" 38 #include "logging/log.hpp" 39 #include "logging/logStream.hpp" 40 #include "memory/iterator.inline.hpp" 41 #include "memory/resourceArea.hpp" 42 #include "oops/access.inline.hpp" 43 #include "oops/compressedOops.inline.hpp" 44 #include "oops/oop.inline.hpp" 45 #include "runtime/handles.inline.hpp" 46 47 int G1HeapVerifier::_enabled_verification_types = G1HeapVerifier::G1VerifyAll; 48 49 class VerifyRootsClosure: public OopClosure { 50 private: 51 G1CollectedHeap* _g1h; 52 VerifyOption _vo; 53 bool _failures; 54 public: 55 // _vo == UsePrevMarking -> use "prev" marking information, 56 // _vo == UseNextMarking -> use "next" marking information, 57 // _vo == UseFullMarking -> use "next" marking bitmap but no TAMS 58 VerifyRootsClosure(VerifyOption vo) : 59 _g1h(G1CollectedHeap::heap()), 60 _vo(vo), 61 _failures(false) { } 62 63 bool failures() { return _failures; } 64 65 template <class T> void do_oop_work(T* p) { 66 T heap_oop = RawAccess<>::oop_load(p); 67 if (!CompressedOops::is_null(heap_oop)) { 68 oop obj = CompressedOops::decode_not_null(heap_oop); 69 if (_g1h->is_obj_dead_cond(obj, _vo)) { 70 Log(gc, verify) log; 71 log.error("Root location " PTR_FORMAT " points to dead obj " PTR_FORMAT, p2i(p), p2i(obj)); 72 ResourceMark rm; 73 LogStream ls(log.error()); 74 obj->print_on(&ls); 75 _failures = true; 76 } 77 } 78 } 79 80 void do_oop(oop* p) { do_oop_work(p); } 81 void do_oop(narrowOop* p) { do_oop_work(p); } 82 }; 83 84 class G1VerifyCodeRootOopClosure: public OopClosure { 85 G1CollectedHeap* _g1h; 86 OopClosure* _root_cl; 87 nmethod* _nm; 88 VerifyOption _vo; 89 bool _failures; 90 91 template <class T> void do_oop_work(T* p) { 92 // First verify that this root is live 93 _root_cl->do_oop(p); 94 95 if (!G1VerifyHeapRegionCodeRoots) { 96 // We're not verifying the code roots attached to heap region. 97 return; 98 } 99 100 // Don't check the code roots during marking verification in a full GC 101 if (_vo == VerifyOption_G1UseFullMarking) { 102 return; 103 } 104 105 // Now verify that the current nmethod (which contains p) is 106 // in the code root list of the heap region containing the 107 // object referenced by p. 108 109 T heap_oop = RawAccess<>::oop_load(p); 110 if (!CompressedOops::is_null(heap_oop)) { 111 oop obj = CompressedOops::decode_not_null(heap_oop); 112 113 // Now fetch the region containing the object 114 HeapRegion* hr = _g1h->heap_region_containing(obj); 115 HeapRegionRemSet* hrrs = hr->rem_set(); 116 // Verify that the strong code root list for this region 117 // contains the nmethod 118 if (!hrrs->strong_code_roots_list_contains(_nm)) { 119 log_error(gc, verify)("Code root location " PTR_FORMAT " " 120 "from nmethod " PTR_FORMAT " not in strong " 121 "code roots for region [" PTR_FORMAT "," PTR_FORMAT ")", 122 p2i(p), p2i(_nm), p2i(hr->bottom()), p2i(hr->end())); 123 _failures = true; 124 } 125 } 126 } 127 128 public: 129 G1VerifyCodeRootOopClosure(G1CollectedHeap* g1h, OopClosure* root_cl, VerifyOption vo): 130 _g1h(g1h), _root_cl(root_cl), _vo(vo), _nm(NULL), _failures(false) {} 131 132 void do_oop(oop* p) { do_oop_work(p); } 133 void do_oop(narrowOop* p) { do_oop_work(p); } 134 135 void set_nmethod(nmethod* nm) { _nm = nm; } 136 bool failures() { return _failures; } 137 }; 138 139 class G1VerifyCodeRootBlobClosure: public CodeBlobClosure { 140 G1VerifyCodeRootOopClosure* _oop_cl; 141 142 public: 143 G1VerifyCodeRootBlobClosure(G1VerifyCodeRootOopClosure* oop_cl): 144 _oop_cl(oop_cl) {} 145 146 void do_code_blob(CodeBlob* cb) { 147 nmethod* nm = cb->as_nmethod_or_null(); 148 if (nm != NULL) { 149 _oop_cl->set_nmethod(nm); 150 nm->oops_do(_oop_cl); 151 } 152 } 153 }; 154 155 class YoungRefCounterClosure : public OopClosure { 156 G1CollectedHeap* _g1h; 157 int _count; 158 public: 159 YoungRefCounterClosure(G1CollectedHeap* g1h) : _g1h(g1h), _count(0) {} 160 void do_oop(oop* p) { if (_g1h->is_in_young(*p)) { _count++; } } 161 void do_oop(narrowOop* p) { ShouldNotReachHere(); } 162 163 int count() { return _count; } 164 void reset_count() { _count = 0; }; 165 }; 166 167 class VerifyCLDClosure: public CLDClosure { 168 YoungRefCounterClosure _young_ref_counter_closure; 169 OopClosure *_oop_closure; 170 public: 171 VerifyCLDClosure(G1CollectedHeap* g1h, OopClosure* cl) : _young_ref_counter_closure(g1h), _oop_closure(cl) {} 172 void do_cld(ClassLoaderData* cld) { 173 cld->oops_do(_oop_closure, false); 174 175 _young_ref_counter_closure.reset_count(); 176 cld->oops_do(&_young_ref_counter_closure, false); 177 if (_young_ref_counter_closure.count() > 0) { 178 guarantee(cld->has_modified_oops(), "CLD " PTR_FORMAT ", has young %d refs but is not dirty.", p2i(cld), _young_ref_counter_closure.count()); 179 } 180 } 181 }; 182 183 class VerifyLivenessOopClosure: public BasicOopIterateClosure { 184 G1CollectedHeap* _g1h; 185 VerifyOption _vo; 186 public: 187 VerifyLivenessOopClosure(G1CollectedHeap* g1h, VerifyOption vo): 188 _g1h(g1h), _vo(vo) 189 { } 190 void do_oop(narrowOop *p) { do_oop_work(p); } 191 void do_oop( oop *p) { do_oop_work(p); } 192 193 template <class T> void do_oop_work(T *p) { 194 oop obj = RawAccess<>::oop_load(p); 195 guarantee(obj == NULL || !_g1h->is_obj_dead_cond(obj, _vo), 196 "Dead object referenced by a not dead object"); 197 } 198 }; 199 200 class VerifyObjsInRegionClosure: public ObjectClosure { 201 private: 202 G1CollectedHeap* _g1h; 203 size_t _live_bytes; 204 HeapRegion *_hr; 205 VerifyOption _vo; 206 public: 207 // _vo == UsePrevMarking -> use "prev" marking information, 208 // _vo == UseNextMarking -> use "next" marking information, 209 // _vo == UseFullMarking -> use "next" marking bitmap but no TAMS. 210 VerifyObjsInRegionClosure(HeapRegion *hr, VerifyOption vo) 211 : _live_bytes(0), _hr(hr), _vo(vo) { 212 _g1h = G1CollectedHeap::heap(); 213 } 214 void do_object(oop o) { 215 VerifyLivenessOopClosure isLive(_g1h, _vo); 216 assert(o != NULL, "Huh?"); 217 if (!_g1h->is_obj_dead_cond(o, _vo)) { 218 // If the object is alive according to the full gc mark, 219 // then verify that the marking information agrees. 220 // Note we can't verify the contra-positive of the 221 // above: if the object is dead (according to the mark 222 // word), it may not be marked, or may have been marked 223 // but has since became dead, or may have been allocated 224 // since the last marking. 225 if (_vo == VerifyOption_G1UseFullMarking) { 226 guarantee(!_g1h->is_obj_dead(o), "Full GC marking and concurrent mark mismatch"); 227 } 228 229 o->oop_iterate(&isLive); 230 if (!_hr->obj_allocated_since_prev_marking(o)) { 231 size_t obj_size = o->size(); // Make sure we don't overflow 232 _live_bytes += (obj_size * HeapWordSize); 233 } 234 } 235 } 236 size_t live_bytes() { return _live_bytes; } 237 }; 238 239 class VerifyArchiveOopClosure: public BasicOopIterateClosure { 240 HeapRegion* _hr; 241 public: 242 VerifyArchiveOopClosure(HeapRegion *hr) 243 : _hr(hr) { } 244 void do_oop(narrowOop *p) { do_oop_work(p); } 245 void do_oop( oop *p) { do_oop_work(p); } 246 247 template <class T> void do_oop_work(T *p) { 248 oop obj = RawAccess<>::oop_load(p); 249 250 if (_hr->is_open_archive()) { 251 guarantee(obj == NULL || G1ArchiveAllocator::is_archive_object(obj), 252 "Archive object at " PTR_FORMAT " references a non-archive object at " PTR_FORMAT, 253 p2i(p), p2i(obj)); 254 } else { 255 assert(_hr->is_closed_archive(), "should be closed archive region"); 256 guarantee(obj == NULL || G1ArchiveAllocator::is_closed_archive_object(obj), 257 "Archive object at " PTR_FORMAT " references a non-archive object at " PTR_FORMAT, 258 p2i(p), p2i(obj)); 259 } 260 } 261 }; 262 263 class VerifyObjectInArchiveRegionClosure: public ObjectClosure { 264 HeapRegion* _hr; 265 public: 266 VerifyObjectInArchiveRegionClosure(HeapRegion *hr, bool verbose) 267 : _hr(hr) { } 268 // Verify that all object pointers are to archive regions. 269 void do_object(oop o) { 270 VerifyArchiveOopClosure checkOop(_hr); 271 assert(o != NULL, "Should not be here for NULL oops"); 272 o->oop_iterate(&checkOop); 273 } 274 }; 275 276 // Should be only used at CDS dump time 277 class VerifyArchivePointerRegionClosure: public HeapRegionClosure { 278 private: 279 G1CollectedHeap* _g1h; 280 public: 281 VerifyArchivePointerRegionClosure(G1CollectedHeap* g1h) { } 282 virtual bool do_heap_region(HeapRegion* r) { 283 if (r->is_archive()) { 284 VerifyObjectInArchiveRegionClosure verify_oop_pointers(r, false); 285 r->object_iterate(&verify_oop_pointers); 286 } 287 return false; 288 } 289 }; 290 291 void G1HeapVerifier::verify_archive_regions() { 292 G1CollectedHeap* g1h = G1CollectedHeap::heap(); 293 VerifyArchivePointerRegionClosure cl(NULL); 294 g1h->heap_region_iterate(&cl); 295 } 296 297 class VerifyRegionClosure: public HeapRegionClosure { 298 private: 299 bool _par; 300 VerifyOption _vo; 301 bool _failures; 302 public: 303 // _vo == UsePrevMarking -> use "prev" marking information, 304 // _vo == UseNextMarking -> use "next" marking information, 305 // _vo == UseFullMarking -> use "next" marking bitmap but no TAMS 306 VerifyRegionClosure(bool par, VerifyOption vo) 307 : _par(par), 308 _vo(vo), 309 _failures(false) {} 310 311 bool failures() { 312 return _failures; 313 } 314 315 bool do_heap_region(HeapRegion* r) { 316 guarantee(!r->is_young() || r->rem_set()->is_complete(), "Remembered set for Young region %u must be complete, is %s", r->hrm_index(), r->rem_set()->get_state_str()); 317 // Humongous and old regions regions might be of any state, so can't check here. 318 guarantee(!r->is_free() || !r->rem_set()->is_tracked(), "Remembered set for free region %u must be untracked, is %s", r->hrm_index(), r->rem_set()->get_state_str()); 319 // Verify that the continues humongous regions' remembered set state matches the 320 // one from the starts humongous region. 321 if (r->is_continues_humongous()) { 322 if (r->rem_set()->get_state_str() != r->humongous_start_region()->rem_set()->get_state_str()) { 323 log_error(gc, verify)("Remset states differ: Region %u (%s) remset %s with starts region %u (%s) remset %s", 324 r->hrm_index(), 325 r->get_short_type_str(), 326 r->rem_set()->get_state_str(), 327 r->humongous_start_region()->hrm_index(), 328 r->humongous_start_region()->get_short_type_str(), 329 r->humongous_start_region()->rem_set()->get_state_str()); 330 _failures = true; 331 } 332 } 333 // For archive regions, verify there are no heap pointers to 334 // non-pinned regions. For all others, verify liveness info. 335 if (r->is_closed_archive()) { 336 VerifyObjectInArchiveRegionClosure verify_oop_pointers(r, false); 337 r->object_iterate(&verify_oop_pointers); 338 return true; 339 } else if (r->is_open_archive()) { 340 VerifyObjsInRegionClosure verify_open_archive_oop(r, _vo); 341 r->object_iterate(&verify_open_archive_oop); 342 return true; 343 } else if (!r->is_continues_humongous()) { 344 bool failures = false; 345 r->verify(_vo, &failures); 346 if (failures) { 347 _failures = true; 348 } else if (!r->is_starts_humongous()) { 349 VerifyObjsInRegionClosure not_dead_yet_cl(r, _vo); 350 r->object_iterate(¬_dead_yet_cl); 351 if (_vo != VerifyOption_G1UseNextMarking) { 352 if (r->max_live_bytes() < not_dead_yet_cl.live_bytes()) { 353 log_error(gc, verify)("[" PTR_FORMAT "," PTR_FORMAT "] max_live_bytes " SIZE_FORMAT " < calculated " SIZE_FORMAT, 354 p2i(r->bottom()), p2i(r->end()), r->max_live_bytes(), not_dead_yet_cl.live_bytes()); 355 _failures = true; 356 } 357 } else { 358 // When vo == UseNextMarking we cannot currently do a sanity 359 // check on the live bytes as the calculation has not been 360 // finalized yet. 361 } 362 } 363 } 364 return false; // stop the region iteration if we hit a failure 365 } 366 }; 367 368 // This is the task used for parallel verification of the heap regions 369 370 class G1ParVerifyTask: public AbstractGangTask { 371 private: 372 G1CollectedHeap* _g1h; 373 VerifyOption _vo; 374 bool _failures; 375 HeapRegionClaimer _hrclaimer; 376 377 public: 378 // _vo == UsePrevMarking -> use "prev" marking information, 379 // _vo == UseNextMarking -> use "next" marking information, 380 // _vo == UseFullMarking -> use "next" marking bitmap but no TAMS 381 G1ParVerifyTask(G1CollectedHeap* g1h, VerifyOption vo) : 382 AbstractGangTask("Parallel verify task"), 383 _g1h(g1h), 384 _vo(vo), 385 _failures(false), 386 _hrclaimer(g1h->workers()->active_workers()) {} 387 388 bool failures() { 389 return _failures; 390 } 391 392 void work(uint worker_id) { 393 HandleMark hm; 394 VerifyRegionClosure blk(true, _vo); 395 _g1h->heap_region_par_iterate_from_worker_offset(&blk, &_hrclaimer, worker_id); 396 if (blk.failures()) { 397 _failures = true; 398 } 399 } 400 }; 401 402 void G1HeapVerifier::enable_verification_type(G1VerifyType type) { 403 // First enable will clear _enabled_verification_types. 404 if (_enabled_verification_types == G1VerifyAll) { 405 _enabled_verification_types = type; 406 } else { 407 _enabled_verification_types |= type; 408 } 409 } 410 411 bool G1HeapVerifier::should_verify(G1VerifyType type) { 412 return (_enabled_verification_types & type) == type; 413 } 414 415 void G1HeapVerifier::verify(VerifyOption vo) { 416 if (!SafepointSynchronize::is_at_safepoint()) { 417 log_info(gc, verify)("Skipping verification. Not at safepoint."); 418 } 419 420 assert(Thread::current()->is_VM_thread(), 421 "Expected to be executed serially by the VM thread at this point"); 422 423 log_debug(gc, verify)("Roots"); 424 VerifyRootsClosure rootsCl(vo); 425 VerifyCLDClosure cldCl(_g1h, &rootsCl); 426 427 // We apply the relevant closures to all the oops in the 428 // system dictionary, class loader data graph, the string table 429 // and the nmethods in the code cache. 430 G1VerifyCodeRootOopClosure codeRootsCl(_g1h, &rootsCl, vo); 431 G1VerifyCodeRootBlobClosure blobsCl(&codeRootsCl); 432 433 { 434 G1RootProcessor root_processor(_g1h, 1); 435 root_processor.process_all_roots(&rootsCl, 436 &cldCl, 437 &blobsCl); 438 } 439 440 bool failures = rootsCl.failures() || codeRootsCl.failures(); 441 442 if (!_g1h->g1_policy()->collector_state()->in_full_gc()) { 443 // If we're verifying during a full GC then the region sets 444 // will have been torn down at the start of the GC. Therefore 445 // verifying the region sets will fail. So we only verify 446 // the region sets when not in a full GC. 447 log_debug(gc, verify)("HeapRegionSets"); 448 verify_region_sets(); 449 } 450 451 log_debug(gc, verify)("HeapRegions"); 452 if (GCParallelVerificationEnabled && ParallelGCThreads > 1) { 453 454 G1ParVerifyTask task(_g1h, vo); 455 _g1h->workers()->run_task(&task); 456 if (task.failures()) { 457 failures = true; 458 } 459 460 } else { 461 VerifyRegionClosure blk(false, vo); 462 _g1h->heap_region_iterate(&blk); 463 if (blk.failures()) { 464 failures = true; 465 } 466 } 467 468 if (G1StringDedup::is_enabled()) { 469 log_debug(gc, verify)("StrDedup"); 470 G1StringDedup::verify(); 471 } 472 473 if (failures) { 474 log_error(gc, verify)("Heap after failed verification (kind %d):", vo); 475 // It helps to have the per-region information in the output to 476 // help us track down what went wrong. This is why we call 477 // print_extended_on() instead of print_on(). 478 Log(gc, verify) log; 479 ResourceMark rm; 480 LogStream ls(log.error()); 481 _g1h->print_extended_on(&ls); 482 } 483 guarantee(!failures, "there should not have been any failures"); 484 } 485 486 // Heap region set verification 487 488 class VerifyRegionListsClosure : public HeapRegionClosure { 489 private: 490 HeapRegionSet* _old_set; 491 HeapRegionSet* _humongous_set; 492 HeapRegionManager* _hrm; 493 494 public: 495 uint _old_count; 496 uint _humongous_count; 497 uint _free_count; 498 499 VerifyRegionListsClosure(HeapRegionSet* old_set, 500 HeapRegionSet* humongous_set, 501 HeapRegionManager* hrm) : 502 _old_set(old_set), _humongous_set(humongous_set), _hrm(hrm), 503 _old_count(), _humongous_count(), _free_count(){ } 504 505 bool do_heap_region(HeapRegion* hr) { 506 if (hr->is_young()) { 507 // TODO 508 } else if (hr->is_humongous()) { 509 assert(hr->containing_set() == _humongous_set, "Heap region %u is humongous but not in humongous set.", hr->hrm_index()); 510 _humongous_count++; 511 } else if (hr->is_empty()) { 512 assert(_hrm->is_free(hr), "Heap region %u is empty but not on the free list.", hr->hrm_index()); 513 _free_count++; 514 } else if (hr->is_old()) { 515 assert(hr->containing_set() == _old_set, "Heap region %u is old but not in the old set.", hr->hrm_index()); 516 _old_count++; 517 } else { 518 // There are no other valid region types. Check for one invalid 519 // one we can identify: pinned without old or humongous set. 520 assert(!hr->is_pinned(), "Heap region %u is pinned but not old (archive) or humongous.", hr->hrm_index()); 521 ShouldNotReachHere(); 522 } 523 return false; 524 } 525 526 void verify_counts(HeapRegionSet* old_set, HeapRegionSet* humongous_set, HeapRegionManager* free_list) { 527 guarantee(old_set->length() == _old_count, "Old set count mismatch. Expected %u, actual %u.", old_set->length(), _old_count); 528 guarantee(humongous_set->length() == _humongous_count, "Hum set count mismatch. Expected %u, actual %u.", humongous_set->length(), _humongous_count); 529 guarantee(free_list->num_free_regions() == _free_count, "Free list count mismatch. Expected %u, actual %u.", free_list->num_free_regions(), _free_count); 530 } 531 }; 532 533 void G1HeapVerifier::verify_region_sets() { 534 assert_heap_locked_or_at_safepoint(true /* should_be_vm_thread */); 535 536 // First, check the explicit lists. 537 _g1h->_hrm.verify(); 538 539 // Finally, make sure that the region accounting in the lists is 540 // consistent with what we see in the heap. 541 542 VerifyRegionListsClosure cl(&_g1h->_old_set, &_g1h->_humongous_set, &_g1h->_hrm); 543 _g1h->heap_region_iterate(&cl); 544 cl.verify_counts(&_g1h->_old_set, &_g1h->_humongous_set, &_g1h->_hrm); 545 } 546 547 void G1HeapVerifier::prepare_for_verify() { 548 if (SafepointSynchronize::is_at_safepoint() || ! UseTLAB) { 549 _g1h->ensure_parsability(false); 550 } 551 } 552 553 double G1HeapVerifier::verify(G1VerifyType type, VerifyOption vo, const char* msg) { 554 double verify_time_ms = 0.0; 555 556 if (should_verify(type) && _g1h->total_collections() >= VerifyGCStartAt) { 557 double verify_start = os::elapsedTime(); 558 HandleMark hm; // Discard invalid handles created during verification 559 prepare_for_verify(); 560 Universe::verify(vo, msg); 561 verify_time_ms = (os::elapsedTime() - verify_start) * 1000; 562 } 563 564 return verify_time_ms; 565 } 566 567 void G1HeapVerifier::verify_before_gc(G1VerifyType type) { 568 if (VerifyBeforeGC) { 569 double verify_time_ms = verify(type, VerifyOption_G1UsePrevMarking, "Before GC"); 570 _g1h->g1_policy()->phase_times()->record_verify_before_time_ms(verify_time_ms); 571 } 572 } 573 574 void G1HeapVerifier::verify_after_gc(G1VerifyType type) { 575 if (VerifyAfterGC) { 576 double verify_time_ms = verify(type, VerifyOption_G1UsePrevMarking, "After GC"); 577 _g1h->g1_policy()->phase_times()->record_verify_after_time_ms(verify_time_ms); 578 } 579 } 580 581 582 #ifndef PRODUCT 583 class G1VerifyCardTableCleanup: public HeapRegionClosure { 584 G1HeapVerifier* _verifier; 585 public: 586 G1VerifyCardTableCleanup(G1HeapVerifier* verifier) 587 : _verifier(verifier) { } 588 virtual bool do_heap_region(HeapRegion* r) { 589 if (r->is_survivor()) { 590 _verifier->verify_dirty_region(r); 591 } else { 592 _verifier->verify_not_dirty_region(r); 593 } 594 return false; 595 } 596 }; 597 598 void G1HeapVerifier::verify_card_table_cleanup() { 599 if (G1VerifyCTCleanup || VerifyAfterGC) { 600 G1VerifyCardTableCleanup cleanup_verifier(this); 601 _g1h->heap_region_iterate(&cleanup_verifier); 602 } 603 } 604 605 void G1HeapVerifier::verify_not_dirty_region(HeapRegion* hr) { 606 // All of the region should be clean. 607 G1CardTable* ct = _g1h->card_table(); 608 MemRegion mr(hr->bottom(), hr->end()); 609 ct->verify_not_dirty_region(mr); 610 } 611 612 void G1HeapVerifier::verify_dirty_region(HeapRegion* hr) { 613 // We cannot guarantee that [bottom(),end()] is dirty. Threads 614 // dirty allocated blocks as they allocate them. The thread that 615 // retires each region and replaces it with a new one will do a 616 // maximal allocation to fill in [pre_dummy_top(),end()] but will 617 // not dirty that area (one less thing to have to do while holding 618 // a lock). So we can only verify that [bottom(),pre_dummy_top()] 619 // is dirty. 620 G1CardTable* ct = _g1h->card_table(); 621 MemRegion mr(hr->bottom(), hr->pre_dummy_top()); 622 if (hr->is_young()) { 623 ct->verify_g1_young_region(mr); 624 } else { 625 ct->verify_dirty_region(mr); 626 } 627 } 628 629 class G1VerifyDirtyYoungListClosure : public HeapRegionClosure { 630 private: 631 G1HeapVerifier* _verifier; 632 public: 633 G1VerifyDirtyYoungListClosure(G1HeapVerifier* verifier) : HeapRegionClosure(), _verifier(verifier) { } 634 virtual bool do_heap_region(HeapRegion* r) { 635 _verifier->verify_dirty_region(r); 636 return false; 637 } 638 }; 639 640 void G1HeapVerifier::verify_dirty_young_regions() { 641 G1VerifyDirtyYoungListClosure cl(this); 642 _g1h->collection_set()->iterate(&cl); 643 } 644 645 bool G1HeapVerifier::verify_no_bits_over_tams(const char* bitmap_name, const G1CMBitMap* const bitmap, 646 HeapWord* tams, HeapWord* end) { 647 guarantee(tams <= end, 648 "tams: " PTR_FORMAT " end: " PTR_FORMAT, p2i(tams), p2i(end)); 649 HeapWord* result = bitmap->get_next_marked_addr(tams, end); 650 if (result < end) { 651 log_error(gc, verify)("## wrong marked address on %s bitmap: " PTR_FORMAT, bitmap_name, p2i(result)); 652 log_error(gc, verify)("## %s tams: " PTR_FORMAT " end: " PTR_FORMAT, bitmap_name, p2i(tams), p2i(end)); 653 return false; 654 } 655 return true; 656 } 657 658 bool G1HeapVerifier::verify_bitmaps(const char* caller, HeapRegion* hr) { 659 const G1CMBitMap* const prev_bitmap = _g1h->concurrent_mark()->prev_mark_bitmap(); 660 const G1CMBitMap* const next_bitmap = _g1h->concurrent_mark()->next_mark_bitmap(); 661 662 HeapWord* ptams = hr->prev_top_at_mark_start(); 663 HeapWord* ntams = hr->next_top_at_mark_start(); 664 HeapWord* end = hr->end(); 665 666 bool res_p = verify_no_bits_over_tams("prev", prev_bitmap, ptams, end); 667 668 bool res_n = true; 669 // We cannot verify the next bitmap while we are about to clear it. 670 if (!_g1h->collector_state()->clearing_next_bitmap()) { 671 res_n = verify_no_bits_over_tams("next", next_bitmap, ntams, end); 672 } 673 if (!res_p || !res_n) { 674 log_error(gc, verify)("#### Bitmap verification failed for " HR_FORMAT, HR_FORMAT_PARAMS(hr)); 675 log_error(gc, verify)("#### Caller: %s", caller); 676 return false; 677 } 678 return true; 679 } 680 681 void G1HeapVerifier::check_bitmaps(const char* caller, HeapRegion* hr) { 682 if (!G1VerifyBitmaps) { 683 return; 684 } 685 686 guarantee(verify_bitmaps(caller, hr), "bitmap verification"); 687 } 688 689 class G1VerifyBitmapClosure : public HeapRegionClosure { 690 private: 691 const char* _caller; 692 G1HeapVerifier* _verifier; 693 bool _failures; 694 695 public: 696 G1VerifyBitmapClosure(const char* caller, G1HeapVerifier* verifier) : 697 _caller(caller), _verifier(verifier), _failures(false) { } 698 699 bool failures() { return _failures; } 700 701 virtual bool do_heap_region(HeapRegion* hr) { 702 bool result = _verifier->verify_bitmaps(_caller, hr); 703 if (!result) { 704 _failures = true; 705 } 706 return false; 707 } 708 }; 709 710 void G1HeapVerifier::check_bitmaps(const char* caller) { 711 if (!G1VerifyBitmaps) { 712 return; 713 } 714 715 G1VerifyBitmapClosure cl(caller, this); 716 _g1h->heap_region_iterate(&cl); 717 guarantee(!cl.failures(), "bitmap verification"); 718 } 719 720 class G1CheckCSetFastTableClosure : public HeapRegionClosure { 721 private: 722 bool _failures; 723 public: 724 G1CheckCSetFastTableClosure() : HeapRegionClosure(), _failures(false) { } 725 726 virtual bool do_heap_region(HeapRegion* hr) { 727 uint i = hr->hrm_index(); 728 InCSetState cset_state = (InCSetState) G1CollectedHeap::heap()->_in_cset_fast_test.get_by_index(i); 729 if (hr->is_humongous()) { 730 if (hr->in_collection_set()) { 731 log_error(gc, verify)("## humongous region %u in CSet", i); 732 _failures = true; 733 return true; 734 } 735 if (cset_state.is_in_cset()) { 736 log_error(gc, verify)("## inconsistent cset state " CSETSTATE_FORMAT " for humongous region %u", cset_state.value(), i); 737 _failures = true; 738 return true; 739 } 740 if (hr->is_continues_humongous() && cset_state.is_humongous()) { 741 log_error(gc, verify)("## inconsistent cset state " CSETSTATE_FORMAT " for continues humongous region %u", cset_state.value(), i); 742 _failures = true; 743 return true; 744 } 745 } else { 746 if (cset_state.is_humongous()) { 747 log_error(gc, verify)("## inconsistent cset state " CSETSTATE_FORMAT " for non-humongous region %u", cset_state.value(), i); 748 _failures = true; 749 return true; 750 } 751 if (hr->in_collection_set() != cset_state.is_in_cset()) { 752 log_error(gc, verify)("## in CSet %d / cset state " CSETSTATE_FORMAT " inconsistency for region %u", 753 hr->in_collection_set(), cset_state.value(), i); 754 _failures = true; 755 return true; 756 } 757 if (cset_state.is_in_cset()) { 758 if (hr->is_young() != (cset_state.is_young())) { 759 log_error(gc, verify)("## is_young %d / cset state " CSETSTATE_FORMAT " inconsistency for region %u", 760 hr->is_young(), cset_state.value(), i); 761 _failures = true; 762 return true; 763 } 764 if (hr->is_old() != (cset_state.is_old())) { 765 log_error(gc, verify)("## is_old %d / cset state " CSETSTATE_FORMAT " inconsistency for region %u", 766 hr->is_old(), cset_state.value(), i); 767 _failures = true; 768 return true; 769 } 770 } 771 } 772 return false; 773 } 774 775 bool failures() const { return _failures; } 776 }; 777 778 bool G1HeapVerifier::check_cset_fast_test() { 779 G1CheckCSetFastTableClosure cl; 780 _g1h->_hrm.iterate(&cl); 781 return !cl.failures(); 782 } 783 #endif // PRODUCT