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