Added a promotion queue unit test that test promotion queue memory corruption

src/heap.h

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef V8_HEAP_H_
 #define V8_HEAP_H_
 
 #include <cmath>
 
 #include "src/allocation.h"
@@ skipping 407 matching lines @@
     ASSERT(GetHeadPage() == Page::FromAllocationTop(limit));
     limit_ = reinterpret_cast<intptr_t*>(limit);
 
     if (limit_ <= rear_) {
       return;
     }
 
     RelocateQueueHead();
   }
 
+  bool IsBelowPromotionQueue(Address address) {

[titzer, 2014/07/01 11:58:20]

Can you split the condition up into multiple branches and add some comments as
to what each case means? (for future adventurers)

[Hannes Payer (out of office), 2014/07/01 16:08:12]

Done.

+    return (GetHeadPage() != Page::FromAddress(address) ||
+           NewSpacePage::IsAtStart(reinterpret_cast<Address>(rear_)) ||
+           reinterpret_cast<intptr_t*>(address) <= rear_);
+  }
+
   bool is_empty() {
     return (front_ == rear_) &&
         (emergency_stack_ == NULL || emergency_stack_->length() == 0);
   }
 
   inline void insert(HeapObject* target, int size);
 
   void remove(HeapObject** target, int* size) {
     ASSERT(!is_empty());
     if (front_ == rear_) {
@@ skipping 2327 matching lines @@
   DisallowHeapAllocation no_allocation;  // i.e. no gc allowed.
 
  private:
   DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer);
 };
 #endif  // DEBUG
 
 } }  // namespace v8::internal
 
 #endif  // V8_HEAP_H_