blob: 6327c3c580c1c55c5062d22ca2ba5c6a3b03b4fd [file] [log] [blame]
reed@google.comddc518b2011-08-29 17:49:23 +00001#include "SkBenchmark.h"
reed@google.come05cc8e2011-10-10 14:19:40 +00002#include "SkColorPriv.h"
reed@google.comddc518b2011-08-29 17:49:23 +00003#include "SkMatrix.h"
4#include "SkRandom.h"
5#include "SkString.h"
reed@google.com16078632011-12-06 18:56:37 +00006#include "SkPaint.h"
reed@google.comddc518b2011-08-29 17:49:23 +00007
reed@google.com7f192412012-05-30 12:26:52 +00008static float sk_fsel(float pred, float result_ge, float result_lt) {
9 return pred >= 0 ? result_ge : result_lt;
10}
11
12static float fast_floor(float x) {
reed@google.comf3a8d8e2012-05-30 14:08:57 +000013// float big = sk_fsel(x, 0x1.0p+23, -0x1.0p+23);
14 float big = sk_fsel(x, (float)(1 << 23), -(float)(1 << 23));
reed@google.com7f192412012-05-30 12:26:52 +000015 return (x + big) - big;
16}
17
reed@google.comddc518b2011-08-29 17:49:23 +000018class MathBench : public SkBenchmark {
19 enum {
20 kBuffer = 100,
reed@google.comddc518b2011-08-29 17:49:23 +000021 };
22 SkString fName;
23 float fSrc[kBuffer], fDst[kBuffer];
24public:
mtklein@google.com410e6e82013-09-13 19:52:27 +000025 MathBench(const char name[]) {
reed@google.comddc518b2011-08-29 17:49:23 +000026 fName.printf("math_%s", name);
27
commit-bot@chromium.orge0e7cfe2013-09-09 20:09:12 +000028 SkRandom rand;
reed@google.comddc518b2011-08-29 17:49:23 +000029 for (int i = 0; i < kBuffer; ++i) {
30 fSrc[i] = rand.nextSScalar1();
31 }
tomhudson@google.com9dc27132012-09-13 15:50:24 +000032
33 fIsRendering = false;
reed@google.comddc518b2011-08-29 17:49:23 +000034 }
35
rmistry@google.comfbfcd562012-08-23 18:09:54 +000036 virtual void performTest(float* SK_RESTRICT dst,
37 const float* SK_RESTRICT src,
robertphillips@google.com6853e802012-04-16 15:50:18 +000038 int count) = 0;
reed@google.comddc518b2011-08-29 17:49:23 +000039
40protected:
41 virtual int mulLoopCount() const { return 1; }
42
43 virtual const char* onGetName() {
44 return fName.c_str();
45 }
46
sugoi@google.com77472f02013-03-05 18:50:01 +000047 virtual void onDraw(SkCanvas*) {
mtklein@google.comc2897432013-09-10 19:23:38 +000048 int n = this->getLoops() * this->mulLoopCount();
reed@google.comddc518b2011-08-29 17:49:23 +000049 for (int i = 0; i < n; i++) {
50 this->performTest(fDst, fSrc, kBuffer);
51 }
52 }
53
54private:
55 typedef SkBenchmark INHERITED;
56};
57
reed@google.come05cc8e2011-10-10 14:19:40 +000058class MathBenchU32 : public MathBench {
59public:
mtklein@google.com410e6e82013-09-13 19:52:27 +000060 MathBenchU32(const char name[]) : INHERITED(name) {}
skia.committer@gmail.com81521132013-04-30 07:01:03 +000061
reed@google.come05cc8e2011-10-10 14:19:40 +000062protected:
rmistry@google.comfbfcd562012-08-23 18:09:54 +000063 virtual void performITest(uint32_t* SK_RESTRICT dst,
64 const uint32_t* SK_RESTRICT src,
robertphillips@google.com6853e802012-04-16 15:50:18 +000065 int count) = 0;
skia.committer@gmail.com81521132013-04-30 07:01:03 +000066
rmistry@google.comfbfcd562012-08-23 18:09:54 +000067 virtual void performTest(float* SK_RESTRICT dst,
reed@google.com0d7aac92013-04-29 13:55:11 +000068 const float* SK_RESTRICT src,
69 int count) SK_OVERRIDE {
reed@google.come05cc8e2011-10-10 14:19:40 +000070 uint32_t* d = SkTCast<uint32_t*>(dst);
71 const uint32_t* s = SkTCast<const uint32_t*>(src);
72 this->performITest(d, s, count);
73 }
74private:
75 typedef MathBench INHERITED;
76};
77
78///////////////////////////////////////////////////////////////////////////////
reed@google.comddc518b2011-08-29 17:49:23 +000079
80class NoOpMathBench : public MathBench {
81public:
mtklein@google.com410e6e82013-09-13 19:52:27 +000082 NoOpMathBench() : INHERITED("noOp") {}
reed@google.comddc518b2011-08-29 17:49:23 +000083protected:
rmistry@google.comfbfcd562012-08-23 18:09:54 +000084 virtual void performTest(float* SK_RESTRICT dst,
85 const float* SK_RESTRICT src,
robertphillips@google.com6853e802012-04-16 15:50:18 +000086 int count) {
reed@google.comddc518b2011-08-29 17:49:23 +000087 for (int i = 0; i < count; ++i) {
88 dst[i] = src[i] + 1;
89 }
90 }
91private:
92 typedef MathBench INHERITED;
93};
94
commit-bot@chromium.org11e5b972013-11-08 20:14:16 +000095class SkRSqrtMathBench : public MathBench {
96public:
97 SkRSqrtMathBench() : INHERITED("sk_float_rsqrt") {}
98protected:
99 virtual void performTest(float* SK_RESTRICT dst,
100 const float* SK_RESTRICT src,
101 int count) {
102 for (int i = 0; i < count; ++i) {
103 dst[i] = sk_float_rsqrt(src[i]);
104 }
105 }
106private:
107 typedef MathBench INHERITED;
108};
109
110
robertphillips@google.com36bb2702013-08-12 12:02:28 +0000111class SlowISqrtMathBench : public MathBench {
reed@google.comddc518b2011-08-29 17:49:23 +0000112public:
mtklein@google.com410e6e82013-09-13 19:52:27 +0000113 SlowISqrtMathBench() : INHERITED("slowIsqrt") {}
commit-bot@chromium.orgb3ecdc42013-08-12 08:37:51 +0000114protected:
robertphillips@google.com36bb2702013-08-12 12:02:28 +0000115 virtual void performTest(float* SK_RESTRICT dst,
116 const float* SK_RESTRICT src,
117 int count) {
118 for (int i = 0; i < count; ++i) {
119 dst[i] = 1.0f / sk_float_sqrt(src[i]);
commit-bot@chromium.orgb3ecdc42013-08-12 08:37:51 +0000120 }
commit-bot@chromium.orgb3ecdc42013-08-12 08:37:51 +0000121 }
reed@google.comddc518b2011-08-29 17:49:23 +0000122private:
robertphillips@google.com36bb2702013-08-12 12:02:28 +0000123 typedef MathBench INHERITED;
124};
125
126static inline float SkFastInvSqrt(float x) {
127 float xhalf = 0.5f*x;
128 int i = *SkTCast<int*>(&x);
129 i = 0x5f3759df - (i>>1);
130 x = *SkTCast<float*>(&i);
131 x = x*(1.5f-xhalf*x*x);
132// x = x*(1.5f-xhalf*x*x); // this line takes err from 10^-3 to 10^-6
133 return x;
134}
135
136class FastISqrtMathBench : public MathBench {
137public:
mtklein@google.com410e6e82013-09-13 19:52:27 +0000138 FastISqrtMathBench() : INHERITED("fastIsqrt") {}
robertphillips@google.com36bb2702013-08-12 12:02:28 +0000139protected:
140 virtual void performTest(float* SK_RESTRICT dst,
141 const float* SK_RESTRICT src,
142 int count) {
143 for (int i = 0; i < count; ++i) {
144 dst[i] = SkFastInvSqrt(src[i]);
145 }
146 }
147private:
148 typedef MathBench INHERITED;
reed@google.comddc518b2011-08-29 17:49:23 +0000149};
150
reed@google.come05cc8e2011-10-10 14:19:40 +0000151static inline uint32_t QMul64(uint32_t value, U8CPU alpha) {
152 SkASSERT((uint8_t)alpha == alpha);
153 const uint32_t mask = 0xFF00FF;
154
155 uint64_t tmp = value;
156 tmp = (tmp & mask) | ((tmp & ~mask) << 24);
157 tmp *= alpha;
caryclark@google.com19069a22012-06-06 12:11:45 +0000158 return (uint32_t) (((tmp >> 8) & mask) | ((tmp >> 32) & ~mask));
reed@google.come05cc8e2011-10-10 14:19:40 +0000159}
160
161class QMul64Bench : public MathBenchU32 {
162public:
mtklein@google.com410e6e82013-09-13 19:52:27 +0000163 QMul64Bench() : INHERITED("qmul64") {}
reed@google.come05cc8e2011-10-10 14:19:40 +0000164protected:
165 virtual void performITest(uint32_t* SK_RESTRICT dst,
166 const uint32_t* SK_RESTRICT src,
167 int count) SK_OVERRIDE {
168 for (int i = 0; i < count; ++i) {
169 dst[i] = QMul64(src[i], (uint8_t)i);
170 }
171 }
172private:
173 typedef MathBenchU32 INHERITED;
174};
175
176class QMul32Bench : public MathBenchU32 {
177public:
mtklein@google.com410e6e82013-09-13 19:52:27 +0000178 QMul32Bench() : INHERITED("qmul32") {}
reed@google.come05cc8e2011-10-10 14:19:40 +0000179protected:
180 virtual void performITest(uint32_t* SK_RESTRICT dst,
181 const uint32_t* SK_RESTRICT src,
182 int count) SK_OVERRIDE {
183 for (int i = 0; i < count; ++i) {
184 dst[i] = SkAlphaMulQ(src[i], (uint8_t)i);
185 }
186 }
187private:
188 typedef MathBenchU32 INHERITED;
189};
190
reed@google.comddc518b2011-08-29 17:49:23 +0000191///////////////////////////////////////////////////////////////////////////////
192
reed@google.com0be5eb72011-12-05 21:53:22 +0000193static bool isFinite_int(float x) {
194 uint32_t bits = SkFloat2Bits(x); // need unsigned for our shifts
195 int exponent = bits << 1 >> 24;
196 return exponent != 0xFF;
197}
198
199static bool isFinite_float(float x) {
robertphillips@google.com6853e802012-04-16 15:50:18 +0000200 return SkToBool(sk_float_isfinite(x));
reed@google.com0be5eb72011-12-05 21:53:22 +0000201}
202
203static bool isFinite_mulzero(float x) {
204 float y = x * 0;
205 return y == y;
206}
207
208static bool isfinite_and_int(const float data[4]) {
209 return isFinite_int(data[0]) && isFinite_int(data[1]) && isFinite_int(data[2]) && isFinite_int(data[3]);
210}
211
212static bool isfinite_and_float(const float data[4]) {
213 return isFinite_float(data[0]) && isFinite_float(data[1]) && isFinite_float(data[2]) && isFinite_float(data[3]);
214}
215
216static bool isfinite_and_mulzero(const float data[4]) {
217 return isFinite_mulzero(data[0]) && isFinite_mulzero(data[1]) && isFinite_mulzero(data[2]) && isFinite_mulzero(data[3]);
218}
219
220#define mulzeroadd(data) (data[0]*0 + data[1]*0 + data[2]*0 + data[3]*0)
221
222static bool isfinite_plus_int(const float data[4]) {
223 return isFinite_int(mulzeroadd(data));
224}
225
226static bool isfinite_plus_float(const float data[4]) {
reed@google.com5ae777d2011-12-06 20:18:05 +0000227 return !sk_float_isnan(mulzeroadd(data));
reed@google.com0be5eb72011-12-05 21:53:22 +0000228}
229
230static bool isfinite_plus_mulzero(const float data[4]) {
231 float x = mulzeroadd(data);
232 return x == x;
233}
234
235typedef bool (*IsFiniteProc)(const float[]);
236
237#define MAKEREC(name) { name, #name }
238
239static const struct {
240 IsFiniteProc fProc;
241 const char* fName;
242} gRec[] = {
243 MAKEREC(isfinite_and_int),
244 MAKEREC(isfinite_and_float),
245 MAKEREC(isfinite_and_mulzero),
246 MAKEREC(isfinite_plus_int),
247 MAKEREC(isfinite_plus_float),
248 MAKEREC(isfinite_plus_mulzero),
249};
250
251#undef MAKEREC
252
reed@google.com16078632011-12-06 18:56:37 +0000253static bool isFinite(const SkRect& r) {
254 // x * 0 will be NaN iff x is infinity or NaN.
255 // a + b will be NaN iff either a or b is NaN.
256 float value = r.fLeft * 0 + r.fTop * 0 + r.fRight * 0 + r.fBottom * 0;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000257
reed@google.com16078632011-12-06 18:56:37 +0000258 // value is either NaN or it is finite (zero).
259 // value==value will be true iff value is not NaN
260 return value == value;
261}
262
reed@google.com0be5eb72011-12-05 21:53:22 +0000263class IsFiniteBench : public SkBenchmark {
264 enum {
mtklein@google.comc2897432013-09-10 19:23:38 +0000265 N = 1000,
reed@google.com0be5eb72011-12-05 21:53:22 +0000266 };
267 float fData[N];
268public:
269
mtklein@google.com410e6e82013-09-13 19:52:27 +0000270 IsFiniteBench(int index) {
commit-bot@chromium.orge0e7cfe2013-09-09 20:09:12 +0000271 SkRandom rand;
reed@google.com0be5eb72011-12-05 21:53:22 +0000272
273 for (int i = 0; i < N; ++i) {
274 fData[i] = rand.nextSScalar1();
275 }
reed@google.com16078632011-12-06 18:56:37 +0000276
277 if (index < 0) {
278 fProc = NULL;
279 fName = "isfinite_rect";
280 } else {
281 fProc = gRec[index].fProc;
282 fName = gRec[index].fName;
283 }
tomhudson@google.com9dc27132012-09-13 15:50:24 +0000284 fIsRendering = false;
reed@google.com0be5eb72011-12-05 21:53:22 +0000285 }
286
287protected:
sugoi@google.com77472f02013-03-05 18:50:01 +0000288 virtual void onDraw(SkCanvas*) {
reed@google.com0be5eb72011-12-05 21:53:22 +0000289 IsFiniteProc proc = fProc;
290 const float* data = fData;
reed@google.com16078632011-12-06 18:56:37 +0000291 // do this so the compiler won't throw away the function call
292 int counter = 0;
reed@google.com0be5eb72011-12-05 21:53:22 +0000293
reed@google.com16078632011-12-06 18:56:37 +0000294 if (proc) {
mtklein@google.comc2897432013-09-10 19:23:38 +0000295 for (int j = 0; j < this->getLoops(); ++j) {
reed@google.com16078632011-12-06 18:56:37 +0000296 for (int i = 0; i < N - 4; ++i) {
297 counter += proc(&data[i]);
298 }
reed@google.com0be5eb72011-12-05 21:53:22 +0000299 }
reed@google.com16078632011-12-06 18:56:37 +0000300 } else {
mtklein@google.comc2897432013-09-10 19:23:38 +0000301 for (int j = 0; j < this->getLoops(); ++j) {
reed@google.com16078632011-12-06 18:56:37 +0000302 for (int i = 0; i < N - 4; ++i) {
303 const SkRect* r = reinterpret_cast<const SkRect*>(&data[i]);
caryclark@google.com19069a22012-06-06 12:11:45 +0000304 if (false) { // avoid bit rot, suppress warning
305 isFinite(*r);
306 }
reed@google.com16078632011-12-06 18:56:37 +0000307 counter += r->isFinite();
308 }
309 }
310 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000311
reed@google.com16078632011-12-06 18:56:37 +0000312 SkPaint paint;
313 if (paint.getAlpha() == 0) {
314 SkDebugf("%d\n", counter);
reed@google.com0be5eb72011-12-05 21:53:22 +0000315 }
316 }
317
318 virtual const char* onGetName() {
319 return fName;
320 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000321
reed@google.com0be5eb72011-12-05 21:53:22 +0000322private:
323 IsFiniteProc fProc;
324 const char* fName;
325
326 typedef SkBenchmark INHERITED;
327};
328
reed@google.com7f192412012-05-30 12:26:52 +0000329class FloorBench : public SkBenchmark {
330 enum {
mtklein@google.comc2897432013-09-10 19:23:38 +0000331 ARRAY = 1000,
reed@google.com7f192412012-05-30 12:26:52 +0000332 };
333 float fData[ARRAY];
334 bool fFast;
335public:
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000336
mtklein@google.com410e6e82013-09-13 19:52:27 +0000337 FloorBench(bool fast) : fFast(fast) {
commit-bot@chromium.orge0e7cfe2013-09-09 20:09:12 +0000338 SkRandom rand;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000339
reed@google.com7f192412012-05-30 12:26:52 +0000340 for (int i = 0; i < ARRAY; ++i) {
341 fData[i] = rand.nextSScalar1();
342 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000343
reed@google.com7f192412012-05-30 12:26:52 +0000344 if (fast) {
345 fName = "floor_fast";
346 } else {
347 fName = "floor_std";
348 }
tomhudson@google.com9dc27132012-09-13 15:50:24 +0000349 fIsRendering = false;
reed@google.com7f192412012-05-30 12:26:52 +0000350 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000351
reed@google.com7f192412012-05-30 12:26:52 +0000352 virtual void process(float) {}
353
354protected:
sugoi@google.com77472f02013-03-05 18:50:01 +0000355 virtual void onDraw(SkCanvas*) {
commit-bot@chromium.orge0e7cfe2013-09-09 20:09:12 +0000356 SkRandom rand;
reed@google.com7f192412012-05-30 12:26:52 +0000357 float accum = 0;
358 const float* data = fData;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000359
reed@google.com7f192412012-05-30 12:26:52 +0000360 if (fFast) {
mtklein@google.comc2897432013-09-10 19:23:38 +0000361 for (int j = 0; j < this->getLoops(); ++j) {
reed@google.com7f192412012-05-30 12:26:52 +0000362 for (int i = 0; i < ARRAY; ++i) {
363 accum += fast_floor(data[i]);
364 }
365 this->process(accum);
366 }
367 } else {
mtklein@google.comc2897432013-09-10 19:23:38 +0000368 for (int j = 0; j < this->getLoops(); ++j) {
reed@google.com7f192412012-05-30 12:26:52 +0000369 for (int i = 0; i < ARRAY; ++i) {
370 accum += sk_float_floor(data[i]);
371 }
372 this->process(accum);
373 }
374 }
375 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000376
reed@google.com7f192412012-05-30 12:26:52 +0000377 virtual const char* onGetName() {
378 return fName;
379 }
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000380
reed@google.com7f192412012-05-30 12:26:52 +0000381private:
382 const char* fName;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000383
reed@google.com7f192412012-05-30 12:26:52 +0000384 typedef SkBenchmark INHERITED;
385};
386
reed@google.com0d7aac92013-04-29 13:55:11 +0000387class CLZBench : public SkBenchmark {
388 enum {
mtklein@google.comc2897432013-09-10 19:23:38 +0000389 ARRAY = 1000,
reed@google.com0d7aac92013-04-29 13:55:11 +0000390 };
391 uint32_t fData[ARRAY];
392 bool fUsePortable;
393
skia.committer@gmail.com81521132013-04-30 07:01:03 +0000394public:
mtklein@google.com410e6e82013-09-13 19:52:27 +0000395 CLZBench(bool usePortable) : fUsePortable(usePortable) {
reed@google.com0d7aac92013-04-29 13:55:11 +0000396
commit-bot@chromium.orge0e7cfe2013-09-09 20:09:12 +0000397 SkRandom rand;
reed@google.com0d7aac92013-04-29 13:55:11 +0000398 for (int i = 0; i < ARRAY; ++i) {
399 fData[i] = rand.nextU();
400 }
skia.committer@gmail.com81521132013-04-30 07:01:03 +0000401
reed@google.com0d7aac92013-04-29 13:55:11 +0000402 if (fUsePortable) {
403 fName = "clz_portable";
404 } else {
405 fName = "clz_intrinsic";
406 }
407 fIsRendering = false;
408 }
skia.committer@gmail.com81521132013-04-30 07:01:03 +0000409
reed@google.com0d7aac92013-04-29 13:55:11 +0000410 // just so the compiler doesn't remove our loops
411 virtual void process(int) {}
skia.committer@gmail.com81521132013-04-30 07:01:03 +0000412
reed@google.com0d7aac92013-04-29 13:55:11 +0000413protected:
414 virtual void onDraw(SkCanvas*) {
415 int accum = 0;
skia.committer@gmail.com81521132013-04-30 07:01:03 +0000416
reed@google.com0d7aac92013-04-29 13:55:11 +0000417 if (fUsePortable) {
mtklein@google.comc2897432013-09-10 19:23:38 +0000418 for (int j = 0; j < this->getLoops(); ++j) {
reed@google.com0d7aac92013-04-29 13:55:11 +0000419 for (int i = 0; i < ARRAY; ++i) {
420 accum += SkCLZ_portable(fData[i]);
421 }
422 this->process(accum);
423 }
424 } else {
mtklein@google.comc2897432013-09-10 19:23:38 +0000425 for (int j = 0; j < this->getLoops(); ++j) {
reed@google.com0d7aac92013-04-29 13:55:11 +0000426 for (int i = 0; i < ARRAY; ++i) {
427 accum += SkCLZ(fData[i]);
428 }
429 this->process(accum);
430 }
431 }
432 }
skia.committer@gmail.com81521132013-04-30 07:01:03 +0000433
reed@google.com0d7aac92013-04-29 13:55:11 +0000434 virtual const char* onGetName() {
435 return fName;
436 }
skia.committer@gmail.com81521132013-04-30 07:01:03 +0000437
reed@google.com0d7aac92013-04-29 13:55:11 +0000438private:
439 const char* fName;
skia.committer@gmail.com81521132013-04-30 07:01:03 +0000440
reed@google.com0d7aac92013-04-29 13:55:11 +0000441 typedef SkBenchmark INHERITED;
442};
443
reed@google.com0be5eb72011-12-05 21:53:22 +0000444///////////////////////////////////////////////////////////////////////////////
445
reed@google.com0889f682013-05-03 12:56:39 +0000446class NormalizeBench : public SkBenchmark {
447 enum {
mtklein@google.comc2897432013-09-10 19:23:38 +0000448 ARRAY =1000,
reed@google.com0889f682013-05-03 12:56:39 +0000449 };
450 SkVector fVec[ARRAY];
skia.committer@gmail.comecc9d282013-05-04 07:01:15 +0000451
reed@google.com0889f682013-05-03 12:56:39 +0000452public:
mtklein@google.com410e6e82013-09-13 19:52:27 +0000453 NormalizeBench() {
commit-bot@chromium.orge0e7cfe2013-09-09 20:09:12 +0000454 SkRandom rand;
reed@google.com0889f682013-05-03 12:56:39 +0000455 for (int i = 0; i < ARRAY; ++i) {
456 fVec[i].set(rand.nextSScalar1(), rand.nextSScalar1());
457 }
skia.committer@gmail.comecc9d282013-05-04 07:01:15 +0000458
reed@google.com0889f682013-05-03 12:56:39 +0000459 fName = "point_normalize";
460 fIsRendering = false;
461 }
skia.committer@gmail.comecc9d282013-05-04 07:01:15 +0000462
reed@google.com0889f682013-05-03 12:56:39 +0000463 // just so the compiler doesn't remove our loops
464 virtual void process(int) {}
skia.committer@gmail.comecc9d282013-05-04 07:01:15 +0000465
reed@google.com0889f682013-05-03 12:56:39 +0000466protected:
467 virtual void onDraw(SkCanvas*) {
468 int accum = 0;
skia.committer@gmail.comecc9d282013-05-04 07:01:15 +0000469
mtklein@google.comc2897432013-09-10 19:23:38 +0000470 for (int j = 0; j < this->getLoops(); ++j) {
reed@google.com0889f682013-05-03 12:56:39 +0000471 for (int i = 0; i < ARRAY; ++i) {
472 accum += fVec[i].normalize();
473 }
474 this->process(accum);
475 }
476 }
skia.committer@gmail.comecc9d282013-05-04 07:01:15 +0000477
reed@google.com0889f682013-05-03 12:56:39 +0000478 virtual const char* onGetName() {
479 return fName;
480 }
skia.committer@gmail.comecc9d282013-05-04 07:01:15 +0000481
reed@google.com0889f682013-05-03 12:56:39 +0000482private:
483 const char* fName;
skia.committer@gmail.comecc9d282013-05-04 07:01:15 +0000484
reed@google.com0889f682013-05-03 12:56:39 +0000485 typedef SkBenchmark INHERITED;
486};
487
488///////////////////////////////////////////////////////////////////////////////
489
djsollen@google.com25a11e42013-07-18 19:11:30 +0000490class FixedMathBench : public SkBenchmark {
491 enum {
mtklein@google.comc2897432013-09-10 19:23:38 +0000492 N = 1000,
djsollen@google.com25a11e42013-07-18 19:11:30 +0000493 };
494 float fData[N];
495 SkFixed fResult[N];
496public:
497
mtklein@google.com410e6e82013-09-13 19:52:27 +0000498 FixedMathBench() {
commit-bot@chromium.orge0e7cfe2013-09-09 20:09:12 +0000499 SkRandom rand;
mtklein@google.comc2897432013-09-10 19:23:38 +0000500 for (int i = 0; i < this->getLoops(); ++i) {
501 fData[i%N] = rand.nextSScalar1();
djsollen@google.com25a11e42013-07-18 19:11:30 +0000502 }
503
504 fIsRendering = false;
505 }
506
507protected:
508 virtual void onDraw(SkCanvas*) {
mtklein@google.comc2897432013-09-10 19:23:38 +0000509 for (int j = 0; j < this->getLoops(); ++j) {
djsollen@google.com25a11e42013-07-18 19:11:30 +0000510 for (int i = 0; i < N - 4; ++i) {
511 fResult[i] = SkFloatToFixed(fData[i]);
512 }
513 }
514
515 SkPaint paint;
516 if (paint.getAlpha() == 0) {
517 SkDebugf("%d\n", fResult[0]);
518 }
519 }
520
521 virtual const char* onGetName() {
522 return "float_to_fixed";
523 }
524
525private:
526 typedef SkBenchmark INHERITED;
527};
528
529///////////////////////////////////////////////////////////////////////////////
530
commit-bot@chromium.org2c86fbb2013-09-26 19:22:54 +0000531template <typename T>
532class DivModBench : public SkBenchmark {
mtklein@google.com9cb51772013-09-27 13:39:14 +0000533 SkString fName;
commit-bot@chromium.org2c86fbb2013-09-26 19:22:54 +0000534public:
mtklein@google.com9cb51772013-09-27 13:39:14 +0000535 explicit DivModBench(const char* name) {
536 fName.printf("divmod_%s", name);
commit-bot@chromium.org2c86fbb2013-09-26 19:22:54 +0000537 fIsRendering = false;
538 }
539
540protected:
541 virtual const char* onGetName() {
mtklein@google.com9cb51772013-09-27 13:39:14 +0000542 return fName.c_str();
commit-bot@chromium.org2c86fbb2013-09-26 19:22:54 +0000543 }
544
545 virtual void onDraw(SkCanvas*) {
546 volatile T a = 0, b = 0;
547 T div = 0, mod = 0;
548 for (int i = 0; i < this->getLoops(); i++) {
549 if ((T)i == 0) continue; // Small T will wrap around.
550 SkTDivMod((T)(i+1), (T)i, &div, &mod);
551 a ^= div;
552 b ^= mod;
553 }
554 }
555};
556DEF_BENCH(return new DivModBench<uint8_t>("uint8_t"))
557DEF_BENCH(return new DivModBench<uint16_t>("uint16_t"))
558DEF_BENCH(return new DivModBench<uint32_t>("uint32_t"))
559DEF_BENCH(return new DivModBench<uint64_t>("uint64_t"))
560
561DEF_BENCH(return new DivModBench<int8_t>("int8_t"))
562DEF_BENCH(return new DivModBench<int16_t>("int16_t"))
563DEF_BENCH(return new DivModBench<int32_t>("int32_t"))
564DEF_BENCH(return new DivModBench<int64_t>("int64_t"))
565
566///////////////////////////////////////////////////////////////////////////////
567
mtklein@google.com410e6e82013-09-13 19:52:27 +0000568DEF_BENCH( return new NoOpMathBench(); )
commit-bot@chromium.org11e5b972013-11-08 20:14:16 +0000569DEF_BENCH( return new SkRSqrtMathBench(); )
mtklein@google.com410e6e82013-09-13 19:52:27 +0000570DEF_BENCH( return new SlowISqrtMathBench(); )
571DEF_BENCH( return new FastISqrtMathBench(); )
572DEF_BENCH( return new QMul64Bench(); )
573DEF_BENCH( return new QMul32Bench(); )
reed@google.comddc518b2011-08-29 17:49:23 +0000574
mtklein@google.com410e6e82013-09-13 19:52:27 +0000575DEF_BENCH( return new IsFiniteBench(-1); )
576DEF_BENCH( return new IsFiniteBench(0); )
577DEF_BENCH( return new IsFiniteBench(1); )
578DEF_BENCH( return new IsFiniteBench(2); )
579DEF_BENCH( return new IsFiniteBench(3); )
580DEF_BENCH( return new IsFiniteBench(4); )
581DEF_BENCH( return new IsFiniteBench(5); )
reed@google.com0be5eb72011-12-05 21:53:22 +0000582
mtklein@google.com410e6e82013-09-13 19:52:27 +0000583DEF_BENCH( return new FloorBench(false); )
584DEF_BENCH( return new FloorBench(true); )
reed@google.com7f192412012-05-30 12:26:52 +0000585
mtklein@google.com410e6e82013-09-13 19:52:27 +0000586DEF_BENCH( return new CLZBench(false); )
587DEF_BENCH( return new CLZBench(true); )
reed@google.com0889f682013-05-03 12:56:39 +0000588
mtklein@google.com410e6e82013-09-13 19:52:27 +0000589DEF_BENCH( return new NormalizeBench(); )
djsollen@google.com25a11e42013-07-18 19:11:30 +0000590
mtklein@google.com410e6e82013-09-13 19:52:27 +0000591DEF_BENCH( return new FixedMathBench(); )