Implement a 2-pass heap verification algorithm.

runtime/vm/scavenger.h

Index: runtime/vm/scavenger.h
diff --git a/runtime/vm/scavenger.h b/runtime/vm/scavenger.h
index b9303d812855552a54b7617a463177b38f997744..bef85467272227bfe4fac9f351598ea07b9cc721 100644
--- a/runtime/vm/scavenger.h
+++ b/runtime/vm/scavenger.h
@@ -74,6 +74,11 @@ class Scavenger {
   void VisitObjects(ObjectVisitor* visitor) const;
   void VisitObjectPointers(ObjectPointerVisitor* visitor) const;
 
+  void StartEndAddress(uword* start, uword* end) const {

[Ivan Posva, 2012/06/29 22:20:41]

The more I read this name the more I am convinced that could be a better name,
alas I do not have a better solution at this time.

[cshapiro, 2012/07/10 21:48:17]

Yeah, I agree.  It's kind of wonky.  I am happy to rename this if we can think
of something better.

+    *start = to_->start();
+    *end = to_->end();
+  }
+
   // Returns true if the last scavenge had a promotion failure.
   bool HadPromotionFailure() {
     return had_promotion_failure_;