Change the structure of the scavenge collector's loop. Move...

src/spaces.h

 // Copyright 2006-2008 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 499 matching lines @@
 // Heap object iterator in new/old/map spaces.
 //
 // A HeapObjectIterator iterates objects from a given address to the
 // top of a space. The given address must be below the current
 // allocation pointer (space top). There are some caveats.
 //
 // (1) If the space top changes upward during iteration (because of
 //     allocating new objects), the iterator does not iterate objects
 //     above the original space top. The caller must create a new
 //     iterator starting from the old top in order to visit these new
-//     objects. Heap::Scavenge() is such an example.
+//     objects.
 //
 // (2) If new objects are allocated below the original allocation top
 //     (e.g., free-list allocation in paged spaces), the new objects
 //     may or may not be iterated depending on their position with
 //     respect to the current point of iteration.
 //
 // (3) The space top should not change downward during iteration,
 //     otherwise the iterator will return not-necessarily-valid
 //     objects.
 
@@ skipping 1197 matching lines @@
 
  private:
   LargeObjectChunk* current_;
   HeapObjectCallback size_func_;
 };
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_H_