Subzero: Dump register numbers as signed quantities.

src/IceRegAlloc.cpp

 //===- subzero/src/IceRegAlloc.cpp - Linear-scan implementation -----------===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 ///
 /// \file
 /// \brief Implements the LinearScan class, which performs the linear-scan
 /// register allocation after liveness analysis has been performed.
 ///
 //===----------------------------------------------------------------------===//
 
 #include "IceRegAlloc.h"
 
 #include "IceBitVector.h"
 #include "IceCfg.h"
 #include "IceCfgNode.h"
 #include "IceInst.h"
 #include "IceInstVarIter.h"
 #include "IceOperand.h"
 #include "IceTargetLowering.h"
 
+#include "llvm/Support/Format.h"
+
 namespace Ice {
 
 namespace {
 
 // Returns true if Var has any definitions within Item's live range.
 // TODO(stichnot): Consider trimming the Definitions list similar to how the
 // live ranges are trimmed, since all the overlapsDefs() tests are whether some
 // variable's definitions overlap Cur, and trimming is with respect Cur.start.
 // Initial tests show no measurable performance difference, so we'll keep the
 // code simple for now.
@@ skipping 27 matching lines @@
   for (size_t i = 0; i < Defs.size(); ++i) {
     Str << "," << Defs[i]->getNumber();
   }
   Str << "\n";
 }
 
 void dumpLiveRange(const Variable *Var, const Cfg *Func) {
   if (!BuildDefs::dump())
     return;
   Ostream &Str = Func->getContext()->getStrDump();
-  char buf[30];
-  snprintf(buf, llvm::array_lengthof(buf), "%2u",
-           unsigned(Var->getRegNumTmp()));
-  Str << "R=" << buf << "  V=";
+  Str << "R=";
+  if (Var->hasRegTmp()) {
+    Str << llvm::format("%2d", Var->getRegNumTmp());
+  } else {
+    Str << "NA";
+  }
+  Str << "  V=";
   Var->dump(Func);
   Str << "  Range=" << Var->getLiveRange();
 }
 
 int32_t findMinWeightIndex(
     const SmallBitVector &RegMask,
     const llvm::SmallVector<RegWeight, LinearScan::REGS_SIZE> &Weights) {
   int MinWeightIndex = -1;
   for (RegNumT i : RegNumBVIter(RegMask)) {
     if (MinWeightIndex < 0 || Weights[i] < Weights[MinWeightIndex])
@@ skipping 922 matching lines @@
     Str << "\n";
   }
   Str << "++++++ Inactive:\n";
   for (const Variable *Item : Inactive) {
     dumpLiveRange(Item, Func);
     Str << "\n";
   }
 }
 
 } // end of namespace Ice