Change old PRG to be SkLCGRandom; change new one to SkRandom

bench/GrMemoryPoolBench.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 // This tests a Gr class
 #if SK_SUPPORT_GPU
 
@@ skipping 29 matching lines @@
 public:
     GrMemoryPoolBenchStack(void* param) : INHERITED(param) {
         fIsRendering = false;
     }
 protected:
     virtual const char* onGetName() {
         return "grmemorypool_stack";
     }
 
     virtual void onDraw(SkCanvas*) {
-        SkMWCRandom r;
+        SkRandom r;
         enum {
             kMaxObjects = 4 * (1 << 10),
         };
         A* objects[kMaxObjects];
 
         // We delete if a random [-1, 1] fixed pt is < the thresh. Otherwise,
         // we allocate. We start allocate-biased and ping-pong to delete-biased
         SkFixed delThresh = -SK_FixedHalf;
         enum {
             kSwitchThreshPeriod = N / (2 * kMaxObjects),
@@ skipping 35 matching lines @@
 public:
     GrMemoryPoolBenchRandom(void* param) : INHERITED(param) {
         fIsRendering = false;
     }
 protected:
     virtual const char* onGetName() {
         return "grmemorypool_random";
     }
 
     virtual void onDraw(SkCanvas*) {
-        SkMWCRandom r;
+        SkRandom r;
         enum {
             kMaxObjects = 4 * (1 << 10),
         };
         SkAutoTDelete<A> objects[kMaxObjects];
 
         for (int i = 0; i < N; i++) {
             uint32_t idx = r.nextRangeU(0, kMaxObjects-1);
             if (NULL == objects[idx].get()) {
                 objects[idx].reset(new A);
             } else {
@@ skipping 17 matching lines @@
 public:
     GrMemoryPoolBenchQueue(void* param) : INHERITED(param) {
         fIsRendering = false;
     }
 protected:
     virtual const char* onGetName() {
         return "grmemorypool_queue";
     }
 
     virtual void onDraw(SkCanvas*) {
-        SkMWCRandom r;
+        SkRandom r;
         A* objects[M];
         for (int i = 0; i < N; i++) {
             uint32_t count = r.nextRangeU(0, M-1);
             for (uint32_t i = 0; i < count; i++) {
                 objects[i] = new A;
             }
             for (uint32_t i = 0; i < count; i++) {
                 delete objects[i];
             }
         }
     }
 
 private:
     typedef SkBenchmark INHERITED;
 };
 
 ///////////////////////////////////////////////////////////////////////////////
 
 static SkBenchmark* Fact1(void* p) { return new GrMemoryPoolBenchStack(p); }
 static SkBenchmark* Fact2(void* p) { return new GrMemoryPoolBenchRandom(p); }
 static SkBenchmark* Fact3(void* p) { return new GrMemoryPoolBenchQueue(p); }
 
 static BenchRegistry gReg01(Fact1);
 static BenchRegistry gReg02(Fact2);
 static BenchRegistry gReg03(Fact3);
 
 #endif