Subzero: Refactor x86 register definitions to use the alias mechanism.

src/IceTimerTree.cpp

 //===- subzero/src/IceTimerTree.cpp - Pass timer defs ---------------------===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 ///
 /// \file
@@ skipping 124 matching lines @@
     CurIndex = getChildIndex(CurIndex, Index);
   }
   assert(CurIndex); // shouldn't be the sentinel node
   return CurIndex;
 }
 
 // Pushes a new marker onto the timer stack.
 void TimerStack::push(TimerIdT ID) {
   if (!BuildDefs::dump())
     return;
-  const bool UpdateCounts = false;
+  constexpr bool UpdateCounts = false;
   update(UpdateCounts);
   StackTop = getChildIndex(StackTop, ID);
   assert(StackTop);
 }
 
 // Pops the top marker from the timer stack. Validates via assert() that the
 // expected marker is popped.
 void TimerStack::pop(TimerIdT ID) {
   if (!BuildDefs::dump())
     return;
-  const bool UpdateCounts = true;
+  constexpr bool UpdateCounts = true;
   update(UpdateCounts);
   assert(StackTop);
   assert(Nodes[StackTop].Parent < StackTop);
   // Verify that the expected ID is being popped.
   assert(Nodes[StackTop].Interior == ID);
   (void)ID;
   // Verify that the parent's child points to the current stack top.
   assert(Nodes[Nodes[StackTop].Parent].Children[ID] == StackTop);
   StackTop = Nodes[StackTop].Parent;
 }
@@ skipping 79 matching lines @@
     MaxVal /= 10;
   } while (MaxVal);
   snprintf(Buf, BufLen, "[%%%dlu] ", NumDigits);
 }
 
 } // end of anonymous namespace
 
 void TimerStack::dump(Ostream &Str, bool DumpCumulative) {
   if (!BuildDefs::dump())
     return;
-  const bool UpdateCounts = true;
+  constexpr bool UpdateCounts = true;
   update(UpdateCounts);
   double TotalTime = LastTimestamp - FirstTimestamp;
   assert(TotalTime);
   char FmtString[30], PrefixStr[30];
   if (DumpCumulative) {
     Str << Name << " - Cumulative times:\n";
     size_t MaxInternalCount = 0;
     for (TimerTreeNode &Node : Nodes)
       MaxInternalCount = std::max(MaxInternalCount, Node.UpdateCount);
     makePrintfFormatString(FmtString, llvm::array_lengthof(FmtString),
@@ skipping 34 matching lines @@
   dumpHelper(Str, FlatMap, TotalTime);
   Str << "Number of timer updates: " << StateChangeCount << "\n";
 }
 
 double TimerStack::timestamp() {
   // TODO: Implement in terms of std::chrono for C++11.
   return llvm::TimeRecord::getCurrentTime(false).getWallTime();
 }
 
 } // end of namespace Ice