Subzero: Use a "deterministic" random shuffle for register allocation.

src/IceTargetLoweringX8632.cpp

 //===- subzero/src/IceTargetLoweringX8632.cpp - x86-32 lowering -----------===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 //
 // This file implements the TargetLoweringX8632 class, which
@@ skipping 4603 matching lines @@
   }
   REGX8632_TABLE
 #undef X
 
   RandomNumberGeneratorWrapper RNG(Ctx->getRNG());
 
   // Shuffle the resulting equivalence classes.
   for (auto I : EquivalenceClasses) {
     const RegisterList &List = I.second;
     RegisterList Shuffled(List);
-    std::random_shuffle(Shuffled.begin(), Shuffled.end(), RNG);
+    RandomShuffle(Shuffled.begin(), Shuffled.end(), RNG);
     for (size_t SI = 0, SE = Shuffled.size(); SI < SE; ++SI) {
       Permutation[List[SI]] = Shuffled[SI];
       ++NumShuffled;
     }
   }
 
   assert(NumShuffled + NumPreserved == RegX8632::Reg_NUM);
 
   if (Func->isVerbose(IceV_Random)) {
     OstreamLocker L(Func->getContext());
@@ skipping 238 matching lines @@
   case FT_Asm:
   case FT_Iasm: {
     OstreamLocker L(Ctx);
     emitConstantPool<PoolTypeConverter<float>>(Ctx);
     emitConstantPool<PoolTypeConverter<double>>(Ctx);
   } break;
   }
 }
 
 } // end of namespace Ice