Subzero: Class definition cleanup.

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 13 matching lines @@
 // Timer tree index type
 typedef std::vector<TimerTreeNode>::size_type TTindex;
 
 // TimerTreeNode represents an interior or leaf node in the call tree.
 // It contains a list of children, a pointer to its parent, and the
 // timer ID for the node.  It also holds the cumulative time spent at
 // this node and below.  The children are always at a higher index in
 // the TimerTreeNode::Nodes array, and the parent is always at a lower
 // index.
 class TimerTreeNode {
+  // TimerTreeNode(const TimerTreeNode &) = delete;
+  TimerTreeNode &operator=(const TimerTreeNode &) = delete;
+
 public:
   TimerTreeNode() : Parent(0), Interior(0), Time(0), UpdateCount(0) {}
   std::vector<TTindex> Children; // indexed by TimerIdT
   TTindex Parent;
   TimerIdT Interior;
   double Time;
   size_t UpdateCount;
 };
 
 class TimerStack {
@@ skipping 27 matching lines @@
   std::vector<IceString> IDs;        // indexed by TimerIdT
   std::vector<TimerTreeNode> Nodes;  // indexed by TTindex
   std::vector<double> LeafTimes;     // indexed by TimerIdT
   std::vector<size_t> LeafCounts;    // indexed by TimerIdT
   TTindex StackTop;
 };
 
 } // end of namespace Ice
 
 #endif // SUBZERO_SRC_ICETIMERTREE_H