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