Add experimental support for tracing the state of the VM heap to a file

src/heap.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 901 matching lines @@
   // string might stay non-flat even when not a failure is returned.
   //
   // Please note this function does not perform a garbage collection.
   MUST_USE_RESULT inline MaybeObject* PrepareForCompare(String* str);
 
   // Converts the given boolean condition to JavaScript boolean value.
   inline Object* ToBoolean(bool condition);
 
   // Code that should be run before and after each GC.  Includes some
   // reporting/verification activities when compiled with DEBUG set.
-  void GarbageCollectionPrologue();
+  void GarbageCollectionPrologue(GarbageCollector collector);
   void GarbageCollectionEpilogue();
 
   // Performs garbage collection operation.
   // Returns whether there is a chance that another major GC could
   // collect more garbage.
   bool CollectGarbage(AllocationSpace space, GarbageCollector collector);
 
   // Performs garbage collection operation.
   // Returns whether there is a chance that another major GC could
   // collect more garbage.
@@ skipping 515 matching lines @@
     return last_empty_page_was_given_back_to_the_os_;
   }
 
   void QueueMemoryChunkForFree(MemoryChunk* chunk);
   void FreeQueuedChunks();
 
   // Completely clear the Instanceof cache (to stop it keeping objects alive
   // around a GC).
   inline void CompletelyClearInstanceofCache();
 
+  // Heap visualizer support.
+  bool has_visualizer() { return visualizer_ != NULL; }
+  HeapVisualizer* visualizer() { return visualizer_; }
+  void set_visualizer(HeapVisualizer* that) {
+    visualizer_ = that;
+  }
+  void UpdateVisualizers(Page* page);
+  void UpdateVisualizer(HeapVisualizer* visualizer);
+  void VisualizeCrankshaft();  // Entering Crankshaft optimizer.
+  void VisualizeCrankshaftDone();  // Exiting Crankshaft optimizer.
+  void UpdateHeapVisualizer(HeapVisualizer* visualizer, NewSpace* space);
+  void UpdateHeapVisualizer(HeapVisualizer* visualizer, PagedSpace* space);
+  void UpdateHeapVisualizer(HeapVisualizer* visualizer,
+                            LargeObjectSpace* space);
+  void VisualizerTimeStamp(HeapVisualizer::ProfileState);
+
  private:
   Heap();
 
   // This can be calculated directly from a pointer to the heap; however, it is
   // more expedient to get at the isolate directly from within Heap methods.
   Isolate* isolate_;
 
   intptr_t code_range_size_;
   int reserved_semispace_size_;
   int max_semispace_size_;
   int initial_semispace_size_;
   intptr_t max_old_generation_size_;
   intptr_t max_executable_size_;
 
   // For keeping track of how much data has survived
   // scavenge since last new space expansion.
   int survived_since_last_expansion_;
 
   // For keeping track on when to flush RegExp code.
   int sweep_generation_;
 
   int always_allocate_scope_depth_;
   int linear_allocation_scope_depth_;
 
+  HeapVisualizer* visualizer_;
+
   // For keeping track of context disposals.
   int contexts_disposed_;
 
   int scan_on_scavenge_pages_;
 
 #if defined(V8_TARGET_ARCH_X64)
   static const int kMaxObjectSizeInNewSpace = 1024*KB;
 #else
   static const int kMaxObjectSizeInNewSpace = 512*KB;
 #endif
@@ skipping 1014 matching lines @@
 
   DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer);
 };
 #endif  // DEBUG || LIVE_OBJECT_LIST
 
 } }  // namespace v8::internal
 
 #undef HEAP
 
 #endif  // V8_HEAP_H_