| Index: bench/GrMemoryPoolBench.cpp
|
| diff --git a/bench/GrMemoryPoolBench.cpp b/bench/GrMemoryPoolBench.cpp
|
| index f1872fc136889b098847c1fd838a24e1b7759203..9b60c3cc2c26ec98bc7b341ef525b25ad264d613 100644
|
| --- a/bench/GrMemoryPoolBench.cpp
|
| +++ b/bench/GrMemoryPoolBench.cpp
|
| @@ -50,9 +50,9 @@ protected:
|
| };
|
| A* objects[kMaxObjects];
|
|
|
| - // We delete if a random [-1, 1] fixed pt is < the thresh. Otherwise,
|
| + // We delete if a random number [-1, 1] is < the thresh. Otherwise,
|
| // we allocate. We start allocate-biased and ping-pong to delete-biased
|
| - SkFixed delThresh = -SK_FixedHalf;
|
| + SkScalar delThresh = -SK_ScalarHalf;
|
| const int kSwitchThreshPeriod = loops / (2 * kMaxObjects);
|
| int s = 0;
|
|
|
| @@ -62,7 +62,7 @@ protected:
|
| delThresh = -delThresh;
|
| s = 0;
|
| }
|
| - SkFixed del = r.nextSFixed1();
|
| + SkScalar del = r.nextSScalar1();
|
| if (count &&
|
| (kMaxObjects == count || del < delThresh)) {
|
| delete objects[count-1];
|
|
|