< prev index next >

src/share/vm/gc/g1/heapRegion.cpp

Print this page
rev 11265 : 8142749: HeapRegion::_predicted_bytes_to_copy is unused and can be removed
Reviewed-by: ?
Contributed-by: Vsevolod Tolstopyatov <qwwdfsad@gmail.com>


 275 
 276   assert(capacity() == HeapRegion::GrainBytes, "pre-condition");
 277   _humongous_start_region = NULL;
 278 }
 279 
 280 HeapRegion::HeapRegion(uint hrm_index,
 281                        G1BlockOffsetTable* bot,
 282                        MemRegion mr) :
 283     G1ContiguousSpace(bot),
 284     _hrm_index(hrm_index),
 285     _allocation_context(AllocationContext::system()),
 286     _humongous_start_region(NULL),
 287     _next_in_special_set(NULL),
 288     _evacuation_failed(false),
 289     _prev_marked_bytes(0), _next_marked_bytes(0), _gc_efficiency(0.0),
 290     _next(NULL), _prev(NULL),
 291 #ifdef ASSERT
 292     _containing_set(NULL),
 293 #endif // ASSERT
 294      _young_index_in_cset(-1), _surv_rate_group(NULL), _age_index(-1),
 295     _rem_set(NULL), _recorded_rs_length(0), _predicted_elapsed_time_ms(0),
 296     _predicted_bytes_to_copy(0)
 297 {
 298   _rem_set = new HeapRegionRemSet(bot, this);
 299 
 300   initialize(mr);
 301 }
 302 
 303 void HeapRegion::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
 304   assert(_rem_set->is_empty(), "Remembered set must be empty");
 305 
 306   G1ContiguousSpace::initialize(mr, clear_space, mangle_space);
 307 
 308   hr_clear(false /*par*/, false /*clear_space*/);
 309   set_top(bottom());
 310   record_timestamp();
 311 }
 312 
 313 void HeapRegion::report_region_type_change(G1HeapRegionTraceType::Type to) {
 314   HeapRegionTracer::send_region_type_change(_hrm_index,
 315                                             get_trace_type(),
 316                                             to,


 328   // We always recreate the prev marking info and we'll explicitly
 329   // mark all objects we find to be self-forwarded on the prev
 330   // bitmap. So all objects need to be below PTAMS.
 331   _prev_marked_bytes = 0;
 332 
 333   if (during_initial_mark) {
 334     // During initial-mark, we'll also explicitly mark all objects
 335     // we find to be self-forwarded on the next bitmap. So all
 336     // objects need to be below NTAMS.
 337     _next_top_at_mark_start = top();
 338     _next_marked_bytes = 0;
 339   } else if (during_conc_mark) {
 340     // During concurrent mark, all objects in the CSet (including
 341     // the ones we find to be self-forwarded) are implicitly live.
 342     // So all objects need to be above NTAMS.
 343     _next_top_at_mark_start = bottom();
 344     _next_marked_bytes = 0;
 345   }
 346 }
 347 
 348 void HeapRegion::note_self_forwarding_removal_end(bool during_initial_mark,
 349                                                   bool during_conc_mark,
 350                                                   size_t marked_bytes) {
 351   assert(marked_bytes <= used(),
 352          "marked: " SIZE_FORMAT " used: " SIZE_FORMAT, marked_bytes, used());
 353   _prev_top_at_mark_start = top();
 354   _prev_marked_bytes = marked_bytes;
 355 }
 356 
 357 HeapWord*
 358 HeapRegion::object_iterate_mem_careful(MemRegion mr,
 359                                                  ObjectClosure* cl) {
 360   G1CollectedHeap* g1h = G1CollectedHeap::heap();
 361   // We used to use "block_start_careful" here.  But we're actually happy
 362   // to update the BOT while we do this...
 363   HeapWord* cur = block_start(mr.start());
 364   mr = mr.intersection(used_region());
 365   if (mr.is_empty()) return NULL;
 366   // Otherwise, find the obj that extends onto mr.start().
 367 
 368   assert(cur <= mr.start()
 369          && (oop(cur)->klass_or_null() == NULL ||
 370              cur + oop(cur)->size() > mr.start()),
 371          "postcondition of block_start");
 372   oop obj;
 373   while (cur < mr.end()) {
 374     obj = oop(cur);
 375     if (obj->klass_or_null() == NULL) {
 376       // Ran into an unparseable point.
 377       return cur;
 378     } else if (!g1h->is_obj_dead(obj)) {
 379       cl->do_object(obj);
 380     }
 381     cur += block_size(cur);
 382   }
 383   return NULL;
 384 }
 385 
 386 HeapWord*
 387 HeapRegion::
 388 oops_on_card_seq_iterate_careful(MemRegion mr,
 389                                  FilterOutOfRegionClosure* cl,
 390                                  bool filter_young,
 391                                  jbyte* card_ptr) {
 392   // Currently, we should only have to clean the card if filter_young
 393   // is true and vice versa.
 394   if (filter_young) {
 395     assert(card_ptr != NULL, "pre-condition");
 396   } else {
 397     assert(card_ptr == NULL, "pre-condition");
 398   }
 399   G1CollectedHeap* g1h = G1CollectedHeap::heap();
 400 
 401   // If we're within a stop-world GC, then we might look at a card in a
 402   // GC alloc region that extends onto a GC LAB, which may not be
 403   // parseable.  Stop such at the "scan_top" of the region.
 404   if (g1h->is_gc_active()) {
 405     mr = mr.intersection(MemRegion(bottom(), scan_top()));
 406   } else {


 494 }
 495 
 496 void HeapRegion::add_strong_code_root_locked(nmethod* nm) {
 497   assert_locked_or_safepoint(CodeCache_lock);
 498   HeapRegionRemSet* hrrs = rem_set();
 499   hrrs->add_strong_code_root_locked(nm);
 500 }
 501 
 502 void HeapRegion::remove_strong_code_root(nmethod* nm) {
 503   HeapRegionRemSet* hrrs = rem_set();
 504   hrrs->remove_strong_code_root(nm);
 505 }
 506 
 507 void HeapRegion::strong_code_roots_do(CodeBlobClosure* blk) const {
 508   HeapRegionRemSet* hrrs = rem_set();
 509   hrrs->strong_code_roots_do(blk);
 510 }
 511 
 512 class VerifyStrongCodeRootOopClosure: public OopClosure {
 513   const HeapRegion* _hr;
 514   nmethod* _nm;
 515   bool _failures;
 516   bool _has_oops_in_region;
 517 
 518   template <class T> void do_oop_work(T* p) {
 519     T heap_oop = oopDesc::load_heap_oop(p);
 520     if (!oopDesc::is_null(heap_oop)) {
 521       oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
 522 
 523       // Note: not all the oops embedded in the nmethod are in the
 524       // current region. We only look at those which are.
 525       if (_hr->is_in(obj)) {
 526         // Object is in the region. Check that its less than top
 527         if (_hr->top() <= (HeapWord*)obj) {
 528           // Object is above top
 529           log_error(gc, verify)("Object " PTR_FORMAT " in region [" PTR_FORMAT ", " PTR_FORMAT ") is above top " PTR_FORMAT,
 530                                p2i(obj), p2i(_hr->bottom()), p2i(_hr->end()), p2i(_hr->top()));
 531           _failures = true;
 532           return;
 533         }
 534         // Nmethod has at least one oop in the current region
 535         _has_oops_in_region = true;
 536       }
 537     }
 538   }
 539 
 540 public:
 541   VerifyStrongCodeRootOopClosure(const HeapRegion* hr, nmethod* nm):
 542     _hr(hr), _failures(false), _has_oops_in_region(false) {}
 543 
 544   void do_oop(narrowOop* p) { do_oop_work(p); }
 545   void do_oop(oop* p)       { do_oop_work(p); }
 546 
 547   bool failures()           { return _failures; }
 548   bool has_oops_in_region() { return _has_oops_in_region; }
 549 };
 550 
 551 class VerifyStrongCodeRootCodeBlobClosure: public CodeBlobClosure {
 552   const HeapRegion* _hr;
 553   bool _failures;
 554 public:
 555   VerifyStrongCodeRootCodeBlobClosure(const HeapRegion* hr) :
 556     _hr(hr), _failures(false) {}
 557 
 558   void do_code_blob(CodeBlob* cb) {
 559     nmethod* nm = (cb == NULL) ? NULL : cb->as_nmethod_or_null();
 560     if (nm != NULL) {
 561       // Verify that the nemthod is live
 562       if (!nm->is_alive()) {
 563         log_error(gc, verify)("region [" PTR_FORMAT "," PTR_FORMAT "] has dead nmethod " PTR_FORMAT " in its strong code roots",
 564                               p2i(_hr->bottom()), p2i(_hr->end()), p2i(nm));
 565         _failures = true;
 566       } else {
 567         VerifyStrongCodeRootOopClosure oop_cl(_hr, nm);
 568         nm->oops_do(&oop_cl);
 569         if (!oop_cl.has_oops_in_region()) {
 570           log_error(gc, verify)("region [" PTR_FORMAT "," PTR_FORMAT "] has nmethod " PTR_FORMAT " in its strong code roots with no pointers into region",
 571                                 p2i(_hr->bottom()), p2i(_hr->end()), p2i(nm));
 572           _failures = true;
 573         } else if (oop_cl.failures()) {
 574           log_error(gc, verify)("region [" PTR_FORMAT "," PTR_FORMAT "] has other failures for nmethod " PTR_FORMAT,
 575                                 p2i(_hr->bottom()), p2i(_hr->end()), p2i(nm));
 576           _failures = true;
 577         }
 578       }
 579     }
 580   }
 581 
 582   bool failures()       { return _failures; }
 583 };
 584 
 585 void HeapRegion::verify_strong_code_roots(VerifyOption vo, bool* failures) const {
 586   if (!G1VerifyHeapRegionCodeRoots) {
 587     // We're not verifying code roots.


 739 class VerifyRemSetClosure : public G1VerificationClosure {
 740 public:
 741   VerifyRemSetClosure(G1CollectedHeap* g1h, VerifyOption vo) : G1VerificationClosure(g1h, vo) {}
 742   virtual void do_oop(narrowOop* p) { do_oop_work(p); }
 743   virtual void do_oop(oop* p) { do_oop_work(p); }
 744 
 745   template <class T>
 746   void do_oop_work(T* p) {
 747     assert(_containing_obj != NULL, "Precondition");
 748     assert(!_g1h->is_obj_dead_cond(_containing_obj, _vo),
 749       "Precondition");
 750     verify_remembered_set(p);
 751   }
 752 
 753   template <class T>
 754   void verify_remembered_set(T* p) {
 755     T heap_oop = oopDesc::load_heap_oop(p);
 756     Log(gc, verify) log;
 757     if (!oopDesc::is_null(heap_oop)) {
 758       oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
 759       bool failed = false;
 760       HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
 761       HeapRegion* to = _g1h->heap_region_containing(obj);
 762       if (from != NULL && to != NULL &&
 763         from != to &&
 764         !to->is_pinned()) {
 765         jbyte cv_obj = *_bs->byte_for_const(_containing_obj);
 766         jbyte cv_field = *_bs->byte_for_const(p);
 767         const jbyte dirty = CardTableModRefBS::dirty_card_val();
 768 
 769         bool is_bad = !(from->is_young()
 770           || to->rem_set()->contains_reference(p)
 771           || !G1HRRSFlushLogBuffersOnVerify && // buffers were not flushed
 772           (_containing_obj->is_objArray() ?
 773           cv_field == dirty
 774           : cv_obj == dirty || cv_field == dirty));
 775         if (is_bad) {
 776           MutexLockerEx x(ParGCRareEvent_lock,
 777             Mutex::_no_safepoint_check_flag);
 778 
 779           if (!_failures) {
 780             log.error("----------");
 781           }
 782           log.error("Missing rem set entry:");
 783           log.error("Field " PTR_FORMAT " of obj " PTR_FORMAT ", in region " HR_FORMAT,
 784             p2i(p), p2i(_containing_obj), HR_FORMAT_PARAMS(from));
 785           ResourceMark rm;
 786           _containing_obj->print_on(log.error_stream());
 787           log.error("points to obj " PTR_FORMAT " in region " HR_FORMAT, p2i(obj), HR_FORMAT_PARAMS(to));
 788           if (obj->is_oop()) {
 789             obj->print_on(log.error_stream());
 790           }
 791           log.error("Obj head CTE = %d, field CTE = %d.", cv_obj, cv_field);
 792           log.error("----------");
 793           _failures = true;
 794           if (!failed) _n_failures++;
 795         }
 796       }
 797     }
 798   }
 799 };
 800 
 801 // This really ought to be commoned up into OffsetTableContigSpace somehow.
 802 // We would need a mechanism to make that code skip dead objects.
 803 
 804 void HeapRegion::verify(VerifyOption vo,
 805                         bool* failures) const {
 806   G1CollectedHeap* g1 = G1CollectedHeap::heap();
 807   *failures = false;
 808   HeapWord* p = bottom();
 809   HeapWord* prev_p = NULL;
 810   VerifyLiveClosure vl_cl(g1, vo);
 811   VerifyRemSetClosure vr_cl(g1, vo);
 812   bool is_region_humongous = is_humongous();
 813   size_t object_num = 0;
 814   while (p < top()) {




 275 
 276   assert(capacity() == HeapRegion::GrainBytes, "pre-condition");
 277   _humongous_start_region = NULL;
 278 }
 279 
 280 HeapRegion::HeapRegion(uint hrm_index,
 281                        G1BlockOffsetTable* bot,
 282                        MemRegion mr) :
 283     G1ContiguousSpace(bot),
 284     _hrm_index(hrm_index),
 285     _allocation_context(AllocationContext::system()),
 286     _humongous_start_region(NULL),
 287     _next_in_special_set(NULL),
 288     _evacuation_failed(false),
 289     _prev_marked_bytes(0), _next_marked_bytes(0), _gc_efficiency(0.0),
 290     _next(NULL), _prev(NULL),
 291 #ifdef ASSERT
 292     _containing_set(NULL),
 293 #endif // ASSERT
 294      _young_index_in_cset(-1), _surv_rate_group(NULL), _age_index(-1),
 295     _rem_set(NULL), _recorded_rs_length(0), _predicted_elapsed_time_ms(0)

 296 {
 297   _rem_set = new HeapRegionRemSet(bot, this);
 298 
 299   initialize(mr);
 300 }
 301 
 302 void HeapRegion::initialize(MemRegion mr, bool clear_space, bool mangle_space) {
 303   assert(_rem_set->is_empty(), "Remembered set must be empty");
 304 
 305   G1ContiguousSpace::initialize(mr, clear_space, mangle_space);
 306 
 307   hr_clear(false /*par*/, false /*clear_space*/);
 308   set_top(bottom());
 309   record_timestamp();
 310 }
 311 
 312 void HeapRegion::report_region_type_change(G1HeapRegionTraceType::Type to) {
 313   HeapRegionTracer::send_region_type_change(_hrm_index,
 314                                             get_trace_type(),
 315                                             to,


 327   // We always recreate the prev marking info and we'll explicitly
 328   // mark all objects we find to be self-forwarded on the prev
 329   // bitmap. So all objects need to be below PTAMS.
 330   _prev_marked_bytes = 0;
 331 
 332   if (during_initial_mark) {
 333     // During initial-mark, we'll also explicitly mark all objects
 334     // we find to be self-forwarded on the next bitmap. So all
 335     // objects need to be below NTAMS.
 336     _next_top_at_mark_start = top();
 337     _next_marked_bytes = 0;
 338   } else if (during_conc_mark) {
 339     // During concurrent mark, all objects in the CSet (including
 340     // the ones we find to be self-forwarded) are implicitly live.
 341     // So all objects need to be above NTAMS.
 342     _next_top_at_mark_start = bottom();
 343     _next_marked_bytes = 0;
 344   }
 345 }
 346 
 347 void HeapRegion::note_self_forwarding_removal_end(size_t marked_bytes) {


 348   assert(marked_bytes <= used(),
 349          "marked: " SIZE_FORMAT " used: " SIZE_FORMAT, marked_bytes, used());
 350   _prev_top_at_mark_start = top();
 351   _prev_marked_bytes = marked_bytes;
 352 }
 353 
 354 HeapWord*





























 355 HeapRegion::
 356 oops_on_card_seq_iterate_careful(MemRegion mr,
 357                                  FilterOutOfRegionClosure* cl,
 358                                  bool filter_young,
 359                                  jbyte* card_ptr) {
 360   // Currently, we should only have to clean the card if filter_young
 361   // is true and vice versa.
 362   if (filter_young) {
 363     assert(card_ptr != NULL, "pre-condition");
 364   } else {
 365     assert(card_ptr == NULL, "pre-condition");
 366   }
 367   G1CollectedHeap* g1h = G1CollectedHeap::heap();
 368 
 369   // If we're within a stop-world GC, then we might look at a card in a
 370   // GC alloc region that extends onto a GC LAB, which may not be
 371   // parseable.  Stop such at the "scan_top" of the region.
 372   if (g1h->is_gc_active()) {
 373     mr = mr.intersection(MemRegion(bottom(), scan_top()));
 374   } else {


 462 }
 463 
 464 void HeapRegion::add_strong_code_root_locked(nmethod* nm) {
 465   assert_locked_or_safepoint(CodeCache_lock);
 466   HeapRegionRemSet* hrrs = rem_set();
 467   hrrs->add_strong_code_root_locked(nm);
 468 }
 469 
 470 void HeapRegion::remove_strong_code_root(nmethod* nm) {
 471   HeapRegionRemSet* hrrs = rem_set();
 472   hrrs->remove_strong_code_root(nm);
 473 }
 474 
 475 void HeapRegion::strong_code_roots_do(CodeBlobClosure* blk) const {
 476   HeapRegionRemSet* hrrs = rem_set();
 477   hrrs->strong_code_roots_do(blk);
 478 }
 479 
 480 class VerifyStrongCodeRootOopClosure: public OopClosure {
 481   const HeapRegion* _hr;

 482   bool _failures;
 483   bool _has_oops_in_region;
 484 
 485   template <class T> void do_oop_work(T* p) {
 486     T heap_oop = oopDesc::load_heap_oop(p);
 487     if (!oopDesc::is_null(heap_oop)) {
 488       oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
 489 
 490       // Note: not all the oops embedded in the nmethod are in the
 491       // current region. We only look at those which are.
 492       if (_hr->is_in(obj)) {
 493         // Object is in the region. Check that its less than top
 494         if (_hr->top() <= (HeapWord*)obj) {
 495           // Object is above top
 496           log_error(gc, verify)("Object " PTR_FORMAT " in region [" PTR_FORMAT ", " PTR_FORMAT ") is above top " PTR_FORMAT,
 497                                p2i(obj), p2i(_hr->bottom()), p2i(_hr->end()), p2i(_hr->top()));
 498           _failures = true;
 499           return;
 500         }
 501         // Nmethod has at least one oop in the current region
 502         _has_oops_in_region = true;
 503       }
 504     }
 505   }
 506 
 507 public:
 508   VerifyStrongCodeRootOopClosure(const HeapRegion* hr):
 509     _hr(hr), _failures(false), _has_oops_in_region(false) {}
 510 
 511   void do_oop(narrowOop* p) { do_oop_work(p); }
 512   void do_oop(oop* p)       { do_oop_work(p); }
 513 
 514   bool failures()           { return _failures; }
 515   bool has_oops_in_region() { return _has_oops_in_region; }
 516 };
 517 
 518 class VerifyStrongCodeRootCodeBlobClosure: public CodeBlobClosure {
 519   const HeapRegion* _hr;
 520   bool _failures;
 521 public:
 522   VerifyStrongCodeRootCodeBlobClosure(const HeapRegion* hr) :
 523     _hr(hr), _failures(false) {}
 524 
 525   void do_code_blob(CodeBlob* cb) {
 526     nmethod* nm = (cb == NULL) ? NULL : cb->as_nmethod_or_null();
 527     if (nm != NULL) {
 528       // Verify that the nemthod is live
 529       if (!nm->is_alive()) {
 530         log_error(gc, verify)("region [" PTR_FORMAT "," PTR_FORMAT "] has dead nmethod " PTR_FORMAT " in its strong code roots",
 531                               p2i(_hr->bottom()), p2i(_hr->end()), p2i(nm));
 532         _failures = true;
 533       } else {
 534         VerifyStrongCodeRootOopClosure oop_cl(_hr);
 535         nm->oops_do(&oop_cl);
 536         if (!oop_cl.has_oops_in_region()) {
 537           log_error(gc, verify)("region [" PTR_FORMAT "," PTR_FORMAT "] has nmethod " PTR_FORMAT " in its strong code roots with no pointers into region",
 538                                 p2i(_hr->bottom()), p2i(_hr->end()), p2i(nm));
 539           _failures = true;
 540         } else if (oop_cl.failures()) {
 541           log_error(gc, verify)("region [" PTR_FORMAT "," PTR_FORMAT "] has other failures for nmethod " PTR_FORMAT,
 542                                 p2i(_hr->bottom()), p2i(_hr->end()), p2i(nm));
 543           _failures = true;
 544         }
 545       }
 546     }
 547   }
 548 
 549   bool failures()       { return _failures; }
 550 };
 551 
 552 void HeapRegion::verify_strong_code_roots(VerifyOption vo, bool* failures) const {
 553   if (!G1VerifyHeapRegionCodeRoots) {
 554     // We're not verifying code roots.


 706 class VerifyRemSetClosure : public G1VerificationClosure {
 707 public:
 708   VerifyRemSetClosure(G1CollectedHeap* g1h, VerifyOption vo) : G1VerificationClosure(g1h, vo) {}
 709   virtual void do_oop(narrowOop* p) { do_oop_work(p); }
 710   virtual void do_oop(oop* p) { do_oop_work(p); }
 711 
 712   template <class T>
 713   void do_oop_work(T* p) {
 714     assert(_containing_obj != NULL, "Precondition");
 715     assert(!_g1h->is_obj_dead_cond(_containing_obj, _vo),
 716       "Precondition");
 717     verify_remembered_set(p);
 718   }
 719 
 720   template <class T>
 721   void verify_remembered_set(T* p) {
 722     T heap_oop = oopDesc::load_heap_oop(p);
 723     Log(gc, verify) log;
 724     if (!oopDesc::is_null(heap_oop)) {
 725       oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);

 726       HeapRegion* from = _g1h->heap_region_containing((HeapWord*)p);
 727       HeapRegion* to = _g1h->heap_region_containing(obj);
 728       if (from != NULL && to != NULL &&
 729         from != to &&
 730         !to->is_pinned()) {
 731         jbyte cv_obj = *_bs->byte_for_const(_containing_obj);
 732         jbyte cv_field = *_bs->byte_for_const(p);
 733         const jbyte dirty = CardTableModRefBS::dirty_card_val();
 734 
 735         bool is_bad = !(from->is_young()
 736           || to->rem_set()->contains_reference(p)
 737           || !G1HRRSFlushLogBuffersOnVerify && // buffers were not flushed
 738           (_containing_obj->is_objArray() ?
 739           cv_field == dirty
 740           : cv_obj == dirty || cv_field == dirty));
 741         if (is_bad) {
 742           MutexLockerEx x(ParGCRareEvent_lock,
 743             Mutex::_no_safepoint_check_flag);
 744 
 745           if (!_failures) {
 746             log.error("----------");
 747           }
 748           log.error("Missing rem set entry:");
 749           log.error("Field " PTR_FORMAT " of obj " PTR_FORMAT ", in region " HR_FORMAT,
 750             p2i(p), p2i(_containing_obj), HR_FORMAT_PARAMS(from));
 751           ResourceMark rm;
 752           _containing_obj->print_on(log.error_stream());
 753           log.error("points to obj " PTR_FORMAT " in region " HR_FORMAT, p2i(obj), HR_FORMAT_PARAMS(to));
 754           if (obj->is_oop()) {
 755             obj->print_on(log.error_stream());
 756           }
 757           log.error("Obj head CTE = %d, field CTE = %d.", cv_obj, cv_field);
 758           log.error("----------");
 759           _failures = true;
 760           _n_failures++;
 761         }
 762       }
 763     }
 764   }
 765 };
 766 
 767 // This really ought to be commoned up into OffsetTableContigSpace somehow.
 768 // We would need a mechanism to make that code skip dead objects.
 769 
 770 void HeapRegion::verify(VerifyOption vo,
 771                         bool* failures) const {
 772   G1CollectedHeap* g1 = G1CollectedHeap::heap();
 773   *failures = false;
 774   HeapWord* p = bottom();
 775   HeapWord* prev_p = NULL;
 776   VerifyLiveClosure vl_cl(g1, vo);
 777   VerifyRemSetClosure vr_cl(g1, vo);
 778   bool is_region_humongous = is_humongous();
 779   size_t object_num = 0;
 780   while (p < top()) {


< prev index next >