epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 1 | |
| 2 | /* |
| 3 | * Copyright 2011 Google Inc. |
| 4 | * |
| 5 | * Use of this source code is governed by a BSD-style license that can be |
| 6 | * found in the LICENSE file. |
| 7 | */ |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 8 | #include "SkBenchmark.h" |
tomhudson@google.com | 25583a3 | 2011-06-06 17:55:11 +0000 | [diff] [blame] | 9 | #include "SkFloatBits.h" |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 10 | #include "SkRandom.h" |
reed@google.com | 63c5761 | 2012-05-15 14:14:04 +0000 | [diff] [blame] | 11 | #include "SkRect.h" |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 12 | #include "SkString.h" |
| 13 | |
| 14 | class ScalarBench : public SkBenchmark { |
| 15 | SkString fName; |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 16 | public: |
| 17 | ScalarBench(void* param, const char name[]) : INHERITED(param) { |
| 18 | fName.printf("scalar_%s", name); |
robertphillips@google.com | 433ce5e | 2012-09-17 10:49:30 +0000 | [diff] [blame] | 19 | fIsRendering = false; |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 20 | } |
| 21 | |
| 22 | virtual void performTest() = 0; |
| 23 | |
| 24 | protected: |
| 25 | virtual int mulLoopCount() const { return 1; } |
| 26 | |
reed@google.com | 357818c | 2012-06-13 12:30:35 +0000 | [diff] [blame] | 27 | virtual const char* onGetName() SK_OVERRIDE { |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 28 | return fName.c_str(); |
| 29 | } |
| 30 | |
| 31 | virtual void onDraw(SkCanvas* canvas) { |
mtklein@google.com | c289743 | 2013-09-10 19:23:38 +0000 | [diff] [blame] | 32 | for (int i = 0; i < this->getLoops(); i++) { |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 33 | this->performTest(); |
| 34 | } |
| 35 | } |
| 36 | |
| 37 | private: |
| 38 | typedef SkBenchmark INHERITED; |
| 39 | }; |
| 40 | |
| 41 | // we want to stop the compiler from eliminating code that it thinks is a no-op |
| 42 | // so we have a non-static global we increment, hoping that will convince the |
| 43 | // compiler to execute everything |
| 44 | int gScalarBench_NonStaticGlobal; |
| 45 | |
| 46 | #define always_do(pred) \ |
| 47 | do { \ |
| 48 | if (pred) { \ |
| 49 | ++gScalarBench_NonStaticGlobal; \ |
| 50 | } \ |
| 51 | } while (0) |
| 52 | |
| 53 | // having unknown values in our arrays can throw off the timing a lot, perhaps |
| 54 | // handling NaN values is a lot slower. Anyway, this guy is just meant to put |
| 55 | // reasonable values in our arrays. |
| 56 | template <typename T> void init9(T array[9]) { |
commit-bot@chromium.org | e0e7cfe | 2013-09-09 20:09:12 +0000 | [diff] [blame] | 57 | SkRandom rand; |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 58 | for (int i = 0; i < 9; i++) { |
| 59 | array[i] = rand.nextSScalar1(); |
| 60 | } |
| 61 | } |
| 62 | |
| 63 | class FloatComparisonBench : public ScalarBench { |
| 64 | public: |
| 65 | FloatComparisonBench(void* param) : INHERITED(param, "compare_float") { |
| 66 | init9(fArray); |
| 67 | } |
| 68 | protected: |
| 69 | virtual int mulLoopCount() const { return 4; } |
| 70 | virtual void performTest() { |
| 71 | always_do(fArray[6] != 0.0f || fArray[7] != 0.0f || fArray[8] != 1.0f); |
| 72 | always_do(fArray[2] != 0.0f || fArray[5] != 0.0f); |
| 73 | } |
| 74 | private: |
| 75 | float fArray[9]; |
| 76 | typedef ScalarBench INHERITED; |
| 77 | }; |
| 78 | |
| 79 | class ForcedIntComparisonBench : public ScalarBench { |
| 80 | public: |
| 81 | ForcedIntComparisonBench(void* param) |
reed@google.com | 357818c | 2012-06-13 12:30:35 +0000 | [diff] [blame] | 82 | : INHERITED(param, "compare_forced_int") { |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 83 | init9(fArray); |
| 84 | } |
| 85 | protected: |
| 86 | virtual int mulLoopCount() const { return 4; } |
| 87 | virtual void performTest() { |
| 88 | always_do(SkScalarAs2sCompliment(fArray[6]) | |
| 89 | SkScalarAs2sCompliment(fArray[7]) | |
| 90 | (SkScalarAs2sCompliment(fArray[8]) - kPersp1Int)); |
| 91 | always_do(SkScalarAs2sCompliment(fArray[2]) | |
| 92 | SkScalarAs2sCompliment(fArray[5])); |
| 93 | } |
| 94 | private: |
| 95 | static const int32_t kPersp1Int = 0x3f800000; |
tomhudson@google.com | 25583a3 | 2011-06-06 17:55:11 +0000 | [diff] [blame] | 96 | SkScalar fArray[9]; |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 97 | typedef ScalarBench INHERITED; |
| 98 | }; |
| 99 | |
reed@google.com | 357818c | 2012-06-13 12:30:35 +0000 | [diff] [blame] | 100 | class IsFiniteScalarBench : public ScalarBench { |
| 101 | public: |
| 102 | IsFiniteScalarBench(void* param) : INHERITED(param, "isfinite") { |
commit-bot@chromium.org | e0e7cfe | 2013-09-09 20:09:12 +0000 | [diff] [blame] | 103 | SkRandom rand; |
reed@google.com | 357818c | 2012-06-13 12:30:35 +0000 | [diff] [blame] | 104 | for (size_t i = 0; i < ARRAY_N; ++i) { |
| 105 | fArray[i] = rand.nextSScalar1(); |
| 106 | } |
| 107 | } |
| 108 | protected: |
| 109 | virtual int mulLoopCount() const { return 1; } |
| 110 | virtual void performTest() SK_OVERRIDE { |
| 111 | int sum = 0; |
| 112 | for (size_t i = 0; i < ARRAY_N; ++i) { |
| 113 | // We pass -fArray[i], so the compiler can't cheat and treat the |
| 114 | // value as an int (even though we tell it that it is a float) |
| 115 | sum += SkScalarIsFinite(-fArray[i]); |
| 116 | } |
| 117 | // we do this so the compiler won't optimize our loop away... |
| 118 | this->doSomething(fArray, sum); |
| 119 | } |
| 120 | |
| 121 | virtual void doSomething(SkScalar array[], int sum) {} |
| 122 | private: |
| 123 | enum { |
| 124 | ARRAY_N = 64 |
| 125 | }; |
| 126 | SkScalar fArray[ARRAY_N]; |
| 127 | |
| 128 | typedef ScalarBench INHERITED; |
| 129 | }; |
| 130 | |
reed@google.com | 63c5761 | 2012-05-15 14:14:04 +0000 | [diff] [blame] | 131 | /////////////////////////////////////////////////////////////////////////////// |
| 132 | |
| 133 | class RectBoundsBench : public SkBenchmark { |
| 134 | enum { |
| 135 | PTS = 100, |
reed@google.com | 63c5761 | 2012-05-15 14:14:04 +0000 | [diff] [blame] | 136 | }; |
| 137 | SkPoint fPts[PTS]; |
| 138 | |
| 139 | public: |
| 140 | RectBoundsBench(void* param) : INHERITED(param) { |
commit-bot@chromium.org | e0e7cfe | 2013-09-09 20:09:12 +0000 | [diff] [blame] | 141 | SkRandom rand; |
reed@google.com | 63c5761 | 2012-05-15 14:14:04 +0000 | [diff] [blame] | 142 | for (int i = 0; i < PTS; ++i) { |
| 143 | fPts[i].fX = rand.nextSScalar1(); |
| 144 | fPts[i].fY = rand.nextSScalar1(); |
| 145 | } |
robertphillips@google.com | 433ce5e | 2012-09-17 10:49:30 +0000 | [diff] [blame] | 146 | fIsRendering = false; |
reed@google.com | 63c5761 | 2012-05-15 14:14:04 +0000 | [diff] [blame] | 147 | } |
| 148 | |
| 149 | protected: |
| 150 | virtual const char* onGetName() SK_OVERRIDE { |
| 151 | return "rect_bounds"; |
| 152 | } |
| 153 | |
| 154 | virtual void onDraw(SkCanvas* canvas) SK_OVERRIDE { |
| 155 | SkRect r; |
mtklein@google.com | c289743 | 2013-09-10 19:23:38 +0000 | [diff] [blame] | 156 | for (int i = 0; i < this->getLoops(); ++i) { |
reed@google.com | 63c5761 | 2012-05-15 14:14:04 +0000 | [diff] [blame] | 157 | r.set(fPts, PTS); |
| 158 | } |
| 159 | } |
| 160 | |
| 161 | private: |
| 162 | typedef SkBenchmark INHERITED; |
| 163 | }; |
| 164 | |
| 165 | /////////////////////////////////////////////////////////////////////////////// |
| 166 | |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 167 | static SkBenchmark* S0(void* p) { return new FloatComparisonBench(p); } |
| 168 | static SkBenchmark* S1(void* p) { return new ForcedIntComparisonBench(p); } |
reed@google.com | 63c5761 | 2012-05-15 14:14:04 +0000 | [diff] [blame] | 169 | static SkBenchmark* S2(void* p) { return new RectBoundsBench(p); } |
reed@google.com | 357818c | 2012-06-13 12:30:35 +0000 | [diff] [blame] | 170 | static SkBenchmark* S3(void* p) { return new IsFiniteScalarBench(p); } |
tomhudson@google.com | f910b36 | 2011-06-06 15:16:31 +0000 | [diff] [blame] | 171 | |
| 172 | static BenchRegistry gReg0(S0); |
| 173 | static BenchRegistry gReg1(S1); |
reed@google.com | 63c5761 | 2012-05-15 14:14:04 +0000 | [diff] [blame] | 174 | static BenchRegistry gReg2(S2); |
reed@google.com | 357818c | 2012-06-13 12:30:35 +0000 | [diff] [blame] | 175 | static BenchRegistry gReg3(S3); |