Subzero: Improve class definition hygiene.

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
 // cumulative execution time collection of call chains.
 //
 //===----------------------------------------------------------------------===//
 
 #ifndef SUBZERO_SRC_ICETIMERTREE_H
 #define SUBZERO_SRC_ICETIMERTREE_H
 
 #include "IceTimerTree.def"
 
 namespace Ice {
 
 class TimerStack {
+  TimerStack() = delete;
   TimerStack &operator=(const TimerStack &) = delete;
 
   // Timer tree index type.  A variable of this type is used to access
   // an interior, not-necessarily-leaf node of the tree.
   typedef std::vector<class TimerTreeNode>::size_type TTindex;
   // Representation of a path of leaf values leading to a particular
   // node.  The representation happens to be in "reverse" order,
   // i.e. from leaf/interior to root, for implementation efficiency.
   typedef llvm::SmallVector<TTindex, 8> PathType;
   // Representation of a mapping of leaf node indexes from one timer
@@ skipping 19 matching lines @@
     size_t UpdateCount;
   };
 
 public:
   enum TimerTag {
 #define X(tag) TT_##tag,
     TIMERTREE_TABLE
 #undef X
         TT__num
   };
-  TimerStack(const IceString &Name);
+  explicit TimerStack(const IceString &Name);
   TimerStack(const TimerStack &) = default;
   TimerIdT getTimerID(const IceString &Name);
   void mergeFrom(const TimerStack &Src);
   void setName(const IceString &NewName) { Name = NewName; }
   const IceString &getName() const { return Name; }
   void push(TimerIdT ID);
   void pop(TimerIdT ID);
   void reset();
   void dump(Ostream &Str, bool DumpCumulative);
 
@@ skipping 13 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