OLD | NEW |
1 | 1 |
2 /* | 2 /* |
3 * Copyright 2011 Google Inc. | 3 * Copyright 2011 Google Inc. |
4 * | 4 * |
5 * Use of this source code is governed by a BSD-style license that can be | 5 * Use of this source code is governed by a BSD-style license that can be |
6 * found in the LICENSE file. | 6 * found in the LICENSE file. |
7 */ | 7 */ |
8 #include "Benchmark.h" | 8 #include "Benchmark.h" |
9 #include "SkFloatBits.h" | 9 #include "SkFloatBits.h" |
10 #include "SkRandom.h" | 10 #include "SkRandom.h" |
11 #include "SkRect.h" | 11 #include "SkRect.h" |
12 #include "SkString.h" | 12 #include "SkString.h" |
13 | 13 |
14 class ScalarBench : public Benchmark { | 14 class ScalarBench : public Benchmark { |
15 SkString fName; | 15 SkString fName; |
16 public: | 16 public: |
17 ScalarBench(const char name[]) { | 17 ScalarBench(const char name[]) { |
18 fName.printf("scalar_%s", name); | 18 fName.printf("scalar_%s", name); |
19 } | 19 } |
20 | 20 |
21 bool isSuitableFor(Backend backend) SK_OVERRIDE { | 21 bool isSuitableFor(Backend backend) override { |
22 return backend == kNonRendering_Backend; | 22 return backend == kNonRendering_Backend; |
23 } | 23 } |
24 | 24 |
25 virtual void performTest() = 0; | 25 virtual void performTest() = 0; |
26 | 26 |
27 protected: | 27 protected: |
28 virtual int mulLoopCount() const { return 1; } | 28 virtual int mulLoopCount() const { return 1; } |
29 | 29 |
30 const char* onGetName() SK_OVERRIDE { | 30 const char* onGetName() override { |
31 return fName.c_str(); | 31 return fName.c_str(); |
32 } | 32 } |
33 | 33 |
34 void onDraw(const int loops, SkCanvas* canvas) SK_OVERRIDE { | 34 void onDraw(const int loops, SkCanvas* canvas) override { |
35 for (int i = 0; i < loops; i++) { | 35 for (int i = 0; i < loops; i++) { |
36 this->performTest(); | 36 this->performTest(); |
37 } | 37 } |
38 } | 38 } |
39 | 39 |
40 private: | 40 private: |
41 typedef Benchmark INHERITED; | 41 typedef Benchmark INHERITED; |
42 }; | 42 }; |
43 | 43 |
44 // having unknown values in our arrays can throw off the timing a lot, perhaps | 44 // having unknown values in our arrays can throw off the timing a lot, perhaps |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
94 | 94 |
95 class IsFiniteScalarBench : public ScalarBench { | 95 class IsFiniteScalarBench : public ScalarBench { |
96 public: | 96 public: |
97 IsFiniteScalarBench() : INHERITED("isfinite") { | 97 IsFiniteScalarBench() : INHERITED("isfinite") { |
98 SkRandom rand; | 98 SkRandom rand; |
99 for (size_t i = 0; i < ARRAY_N; ++i) { | 99 for (size_t i = 0; i < ARRAY_N; ++i) { |
100 fArray[i] = rand.nextSScalar1(); | 100 fArray[i] = rand.nextSScalar1(); |
101 } | 101 } |
102 } | 102 } |
103 protected: | 103 protected: |
104 int mulLoopCount() const SK_OVERRIDE { return 1; } | 104 int mulLoopCount() const override { return 1; } |
105 void performTest() SK_OVERRIDE { | 105 void performTest() override { |
106 int sum = 0; | 106 int sum = 0; |
107 for (size_t i = 0; i < ARRAY_N; ++i) { | 107 for (size_t i = 0; i < ARRAY_N; ++i) { |
108 // We pass -fArray[i], so the compiler can't cheat and treat the | 108 // We pass -fArray[i], so the compiler can't cheat and treat the |
109 // value as an int (even though we tell it that it is a float) | 109 // value as an int (even though we tell it that it is a float) |
110 sum += SkScalarIsFinite(-fArray[i]); | 110 sum += SkScalarIsFinite(-fArray[i]); |
111 } | 111 } |
112 // we do this so the compiler won't optimize our loop away... | 112 // we do this so the compiler won't optimize our loop away... |
113 this->doSomething(fArray, sum); | 113 this->doSomething(fArray, sum); |
114 } | 114 } |
115 | 115 |
(...skipping 17 matching lines...) Expand all Loading... |
133 | 133 |
134 public: | 134 public: |
135 RectBoundsBench() { | 135 RectBoundsBench() { |
136 SkRandom rand; | 136 SkRandom rand; |
137 for (int i = 0; i < PTS; ++i) { | 137 for (int i = 0; i < PTS; ++i) { |
138 fPts[i].fX = rand.nextSScalar1(); | 138 fPts[i].fX = rand.nextSScalar1(); |
139 fPts[i].fY = rand.nextSScalar1(); | 139 fPts[i].fY = rand.nextSScalar1(); |
140 } | 140 } |
141 } | 141 } |
142 | 142 |
143 bool isSuitableFor(Backend backend) SK_OVERRIDE { | 143 bool isSuitableFor(Backend backend) override { |
144 return backend == kNonRendering_Backend; | 144 return backend == kNonRendering_Backend; |
145 } | 145 } |
146 | 146 |
147 protected: | 147 protected: |
148 const char* onGetName() SK_OVERRIDE { | 148 const char* onGetName() override { |
149 return "rect_bounds"; | 149 return "rect_bounds"; |
150 } | 150 } |
151 | 151 |
152 void onDraw(const int loops, SkCanvas* canvas) SK_OVERRIDE { | 152 void onDraw(const int loops, SkCanvas* canvas) override { |
153 SkRect r; | 153 SkRect r; |
154 for (int i = 0; i < loops; ++i) { | 154 for (int i = 0; i < loops; ++i) { |
155 for (int i = 0; i < 1000; ++i) { | 155 for (int i = 0; i < 1000; ++i) { |
156 r.set(fPts, PTS); | 156 r.set(fPts, PTS); |
157 } | 157 } |
158 } | 158 } |
159 } | 159 } |
160 | 160 |
161 private: | 161 private: |
162 typedef Benchmark INHERITED; | 162 typedef Benchmark INHERITED; |
163 }; | 163 }; |
164 | 164 |
165 /////////////////////////////////////////////////////////////////////////////// | 165 /////////////////////////////////////////////////////////////////////////////// |
166 | 166 |
167 DEF_BENCH( return new FloatComparisonBench(); ) | 167 DEF_BENCH( return new FloatComparisonBench(); ) |
168 DEF_BENCH( return new ForcedIntComparisonBench(); ) | 168 DEF_BENCH( return new ForcedIntComparisonBench(); ) |
169 DEF_BENCH( return new RectBoundsBench(); ) | 169 DEF_BENCH( return new RectBoundsBench(); ) |
170 DEF_BENCH( return new IsFiniteScalarBench(); ) | 170 DEF_BENCH( return new IsFiniteScalarBench(); ) |
OLD | NEW |