Subzero: Use C++11 member initializers where practical.

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 26 matching lines @@
   // 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 &operator=(const TimerTreeNode &) = delete;
 
   public:
-    TimerTreeNode() : Parent(0), Interior(0), Time(0), UpdateCount(0) {}
+    TimerTreeNode() = default;
     TimerTreeNode(const TimerTreeNode &) = default;
     std::vector<TTindex> Children; // indexed by TimerIdT
-    TTindex Parent;
-    TimerIdT Interior;
-    double Time;
-    size_t UpdateCount;
+    TTindex Parent = 0;
+    TimerIdT Interior = 0;
+    double Time = 0;
+    size_t UpdateCount = 0;
   };
 
 public:
   enum TimerTag {
 #define X(tag) TT_##tag,
     TIMERTREE_TABLE
 #undef X
         TT__num
   };
   explicit TimerStack(const IceString &Name);
@@ skipping 10 matching lines @@
 private:
   void update(bool UpdateCounts);
   static double timestamp();
   TranslationType translateIDsFrom(const TimerStack &Src);
   PathType getPath(TTindex Index, const TranslationType &Mapping) const;
   TTindex getChildIndex(TTindex Parent, TimerIdT ID);
   TTindex findPath(const PathType &Path);
   IceString Name;
   double FirstTimestamp;
   double LastTimestamp;
-  uint64_t StateChangeCount;
+  uint64_t StateChangeCount = 0;
   // IDsIndex maps a symbolic timer name to its integer ID.
   std::map<IceString, TimerIdT> IDsIndex;
   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;
+  TTindex StackTop = 0;
 };
 
 } // end of namespace Ice
 
 #endif // SUBZERO_SRC_ICETIMERTREE_H