Make the marking stack into a deque

src/incremental-marking.h

 // Copyright 2011 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 49 matching lines @@
   inline bool IsMarking() { return state() == MARKING; }
 
   bool WorthActivating();
 
   void Start();
 
   void Stop();
 
   void PrepareForScavenge();
 
-  void UpdateMarkingStackAfterScavenge();
+  void UpdateMarkingDequeAfterScavenge();
 
   void Hurry();
 
   void Finalize();
 
   void MarkingComplete();
 
   // It's hard to know how much work the incremental marker should do to make
   // progress in the face of the mutator creating new work for it.  We start
   // of at a moderate rate of work and gradually increase the speed of the
@@ skipping 50 matching lines @@
   }
 
   // Grey markbits: 11
   static const char* kGreyBitPattern;
   static inline bool IsGrey(MarkBit mark_bit) {
     ASSERT(strcmp(kGreyBitPattern, "11") == 0);
     ASSERT(!IsImpossible(mark_bit));
     return mark_bit.Get() && mark_bit.Next().Get();
   }
 
-  inline void BlackToGreyAndPush(HeapObject* obj, MarkBit mark_bit);
+  inline void BlackToGreyAndUnshift(HeapObject* obj, MarkBit mark_bit);
 
   inline void WhiteToGreyAndPush(HeapObject* obj, MarkBit mark_bit);
 
   inline void WhiteToGrey(HeapObject* obj, MarkBit mark_bit);
 
   inline void MarkBlack(MarkBit mark_bit) {
     mark_bit.Set();
     mark_bit.Next().Clear();
     ASSERT(IsBlack(mark_bit));
   }
@@ skipping 40 matching lines @@
   void ResetStepCounters() {
     steps_count_ = 0;
     steps_took_ = 0;
     allocation_marking_factor_ = kInitialAllocationMarkingFactor;
   }
 
 
   Heap* heap_;
 
   State state_;
-  MarkingStack marking_stack_;
+  MarkingDeque marking_deque_;
 
   int steps_count_;
   double steps_took_;
   bool should_hurry_;
   intptr_t allocation_marking_factor_;
   intptr_t allocated_;
 };
 
 } }  // namespace v8::internal
 
 #endif  // V8_INCREMENTAL_MARKING_H_