Subzero: Add a few performance measurement tools.

src/IceTimerTree.h

 //===- subzero/src/IceTimerTree.h - Pass timer defs -------------*- C++ -*-===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 //
 // This file declares the TimerTree class, which allows flat and
@@ skipping 20 matching lines @@
 class TimerTreeNode {
 public:
   TimerTreeNode() : Parent(0), Interior(0), Time(0) {}
   std::vector<TTindex> Children; // indexed by TimerIdT
   TTindex Parent;
   TimerIdT Interior;
   double Time;
 };
 
 class TimerStack {
-  TimerStack(const TimerStack &) = delete;
+  // TimerStack(const TimerStack &) = delete;

[jvoung (off chromium), 2014/10/06 16:30:56]

Is this because of std::vector?

[Jim Stichnoth, 2014/10/06 21:29:57]

Yes, specifically the Timers.push_back() call.

   TimerStack &operator=(const TimerStack &) = delete;
 
 public:
-  TimerStack(const IceString &TopLevelName);
+  TimerStack();
   static TimerIdT getTimerID(const IceString &Name);
   void push(TimerIdT ID);
   void pop(TimerIdT ID);
-  void dump(Ostream &Str);
+  void dump(Ostream &Str, bool DumpCumulative);
 
 private:
   void update();
   static double timestamp();
   const double FirstTimestamp;
   double LastTimestamp;
   uint64_t StateChangeCount;
   static std::vector<IceString> IDs; // indexed by TimerIdT
   std::vector<TimerTreeNode> Nodes;  // indexed by TTindex
   std::vector<double> LeafTimes;     // indexed by TimerIdT
   TTindex StackTop;
 };
 
 } // end of namespace Ice
 
 #endif // SUBZERO_SRC_ICETIMERTREE_H