There can be only one (SkRandom)!

tests/StrokerTest.cpp

 #include "PathOpsCubicIntersectionTestData.h"
 #include "PathOpsQuadIntersectionTestData.h"
 #include "SkCommonFlags.h"
 #include "SkPaint.h"
 #include "SkPath.h"
 #include "SkRandom.h"
 #include "SkStrokerPriv.h"
 #include "SkTime.h"
 #include "Test.h"
 
@@ skipping 98 matching lines @@
         cubicSetTest(pointDegenerates, pointDegenerates_count);
         cubicSetTest(notPointDegenerates, notPointDegenerates_count);
         cubicSetTest(lines, lines_count);
         cubicSetTest(notLines, notLines_count);
         cubicSetTest(modEpsilonLines, modEpsilonLines_count);
         cubicSetTest(lessEpsilonLines, lessEpsilonLines_count);
         cubicSetTest(negEpsilonLines, negEpsilonLines_count);
         cubicPairSetTest(tests, tests_count);
 }
 
-static SkScalar unbounded(SkLCGRandom& r) {
+static SkScalar unbounded(SkRandom& r) {
     uint32_t val = r.nextU();
     return SkBits2Float(val);
 }
 
-static SkScalar unboundedPos(SkLCGRandom& r) {
+static SkScalar unboundedPos(SkRandom& r) {
     uint32_t val = r.nextU() & 0x7fffffff;
     return SkBits2Float(val);
 }
 
 DEF_TEST(QuadStrokerUnbounded, reporter) {
-    SkLCGRandom r;
+    SkRandom r;
     SkPaint p;
     p.setStyle(SkPaint::kStroke_Style);
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     int best = 0;
     sk_bzero(gMaxRecursion, sizeof(gMaxRecursion[0]) * 3);
 #endif
     SkMSec limit = SkTime::GetMSecs() + MS_TEST_DURATION;
     for (int i = 0; i < 1000000; ++i) {
         SkPath path, fill;
         path.moveTo(unbounded(r), unbounded(r));
@@ skipping 17 matching lines @@
         }
     }
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     if (FLAGS_veryVerbose) {
        SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
     }
 #endif
 }
 
 DEF_TEST(CubicStrokerUnbounded, reporter) {
-    SkLCGRandom r;
+    SkRandom r;
     SkPaint p;
     p.setStyle(SkPaint::kStroke_Style);
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     int bestTan = 0;
     int bestCubic = 0;
     sk_bzero(gMaxRecursion, sizeof(gMaxRecursion[0]) * 3);
 #endif
     SkMSec limit = SkTime::GetMSecs() + MS_TEST_DURATION;
     for (int i = 0; i < 1000000; ++i) {
         SkPath path, fill;
@@ skipping 20 matching lines @@
         }
     }
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     if (FLAGS_veryVerbose) {
         SkDebugf("\n%s max tan=%d cubic=%d\n", __FUNCTION__, bestTan, bestCubic);
     }
 #endif
 }
 
 DEF_TEST(QuadStrokerConstrained, reporter) {
-    SkLCGRandom r;
+    SkRandom r;
     SkPaint p;
     p.setStyle(SkPaint::kStroke_Style);
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     int best = 0;
     sk_bzero(gMaxRecursion, sizeof(gMaxRecursion[0]) * 3);
 #endif
     SkMSec limit = SkTime::GetMSecs() + MS_TEST_DURATION;
     for (int i = 0; i < 1000000; ++i) {
         SkPath path, fill;
         SkPoint quad[3];
@@ skipping 30 matching lines @@
         }
     }
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     if (FLAGS_veryVerbose) {
         SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
     }
 #endif
 }
 
 DEF_TEST(CubicStrokerConstrained, reporter) {
-    SkLCGRandom r;
+    SkRandom r;
     SkPaint p;
     p.setStyle(SkPaint::kStroke_Style);
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     int bestTan = 0;
     int bestCubic = 0;
     sk_bzero(gMaxRecursion, sizeof(gMaxRecursion[0]) * 3);
 #endif
     SkMSec limit = SkTime::GetMSecs() + MS_TEST_DURATION;
     for (int i = 0; i < 1000000; ++i) {
         SkPath path, fill;
@@ skipping 38 matching lines @@
         }
     }
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     if (FLAGS_veryVerbose) {
         SkDebugf("\n%s max tan=%d cubic=%d\n", __FUNCTION__, bestTan, bestCubic);
     }
 #endif
 }
 
 DEF_TEST(QuadStrokerRange, reporter) {
-    SkLCGRandom r;
+    SkRandom r;
     SkPaint p;
     p.setStyle(SkPaint::kStroke_Style);
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     int best = 0;
     sk_bzero(gMaxRecursion, sizeof(gMaxRecursion[0]) * 3);
 #endif
     SkMSec limit = SkTime::GetMSecs() + MS_TEST_DURATION;
     for (int i = 0; i < 1000000; ++i) {
         SkPath path, fill;
         SkPoint quad[3];
@@ skipping 24 matching lines @@
         }
     }
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     if (FLAGS_verbose) {
         SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
     }
 #endif
 }
 
 DEF_TEST(CubicStrokerRange, reporter) {
-    SkLCGRandom r;
+    SkRandom r;
     SkPaint p;
     p.setStyle(SkPaint::kStroke_Style);
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     int best[2] = { 0 };
     sk_bzero(gMaxRecursion, sizeof(gMaxRecursion[0]) * 3);
 #endif
     SkMSec limit = SkTime::GetMSecs() + MS_TEST_DURATION;
     for (int i = 0; i < 1000000; ++i) {
         SkPath path, fill;
         path.moveTo(r.nextRangeF(0, 500), r.nextRangeF(0, 500));
@@ skipping 68 matching lines @@
         path.dump();
         SkDebugf("fill:\n");
         fill.dump();
     }
 #if defined(SK_DEBUG) && QUAD_STROKE_APPROXIMATION
     if (FLAGS_veryVerbose) {
         SkDebugf("max tan=%d cubic=%d\n", gMaxRecursion[0], gMaxRecursion[1]);
     }
 #endif
 }