Fix the thresholds so that the heap does not grow uncontrollably. This fixes

src/spaces.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 1416 matching lines @@
   static void ReportCodeStatistics();
   static void ResetCodeStatistics();
 #endif
 
   bool was_swept_conservatively() { return was_swept_conservatively_; }
   void set_was_swept_conservatively(bool b) { was_swept_conservatively_ = b; }
 
   void SetPagesToSweep(Page* first, Page* last) {
     first_unswept_page_ = first;
     last_unswept_page_ = last;
+    int unswept_pages = 0;
 
     Page* p = first;
     do {
       // The WAS_SWEPT_CONSERVATIVELY flag means that we can't iterate over the
       // page.  We have to set this flag on the pages to indicate this.
       p->SetFlag(MemoryChunk::WAS_SWEPT_CONSERVATIVELY);
       p = p->next_page();
+      unswept_pages++;
     } while (p != last);
+
+    if (FLAG_trace_gc_verbose) {
+      PrintF("Postponing sweep for %d pages\n", unswept_pages);
+    }
   }
 
   bool AdvanceSweeper(intptr_t bytes_to_sweep);
 
   bool IsSweepingComplete() {
     return !first_unswept_page_->is_valid();
   }
 
   Page* FirstPage() { return anchor_.next_page(); }
   Page* LastPage() { return anchor_.prev_page(); }
@@ skipping 1065 matching lines @@
   }
   // Must be small, since an iteration is used for lookup.
   static const int kMaxComments = 64;
 };
 #endif
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_H_