Set unswept free bytes for concurent sweeper.

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 1733 matching lines @@
 
   void IncrementUnsweptFreeBytes(int by) {
     unswept_free_bytes_ += by;
   }
 
   void IncreaseUnsweptFreeBytes(Page* p) {
     ASSERT(ShouldBeSweptLazily(p));
     unswept_free_bytes_ += (p->area_size() - p->LiveBytes());
   }
 
+  void DecreaseUnsweptFreeBytes(int by) {

[Michael Starzinger, 2013/02/28 13:09:52]

Let's rename this to DecrementUnsweptFreeBytes() which is in line with the other
names.

[Hannes Payer (out of office), 2013/02/28 14:42:34]

Done.

+    unswept_free_bytes_ -= by;
+  }
+
   void DecreaseUnsweptFreeBytes(Page* p) {
     ASSERT(ShouldBeSweptLazily(p));
     unswept_free_bytes_ -= (p->area_size() - p->LiveBytes());
   }
 
+  void ResetUnsweptFreeBytes() {
+    unswept_free_bytes_ = 0;
+  }
+
   bool AdvanceSweeper(intptr_t bytes_to_sweep);
 
   // When parallel sweeper threads are active this function waits
   // for them to complete, otherwise AdvanceSweeper with size_in_bytes
   // is called.
   bool EnsureSweeperProgress(intptr_t size_in_bytes);
 
   bool IsSweepingComplete() {
     return !first_unswept_page_->is_valid();
   }
@@ skipping 1051 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_