blob: f532a83b36e0499f736fdf252462d41ef09430f3 (
plain)
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
|
/*
* Copyright 2014 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "Benchmark.h"
#include "SkCanvas.h"
#include "SkRandom.h"
#include "SkString.h"
#if SK_SUPPORT_GPU
#include "GrOrderedSet.h"
static const int NUM_ELEMENTS = 1000;
// Time how long it takes to build a set
class GrOrderedSetBuildBench : public Benchmark {
public:
GrOrderedSetBuildBench() {
fName.append("ordered_set_build");
}
bool isSuitableFor(Backend backend) override {
return kNonRendering_Backend == backend;
}
virtual ~GrOrderedSetBuildBench() {}
protected:
const char* onGetName() override {
return fName.c_str();
}
void onPreDraw() override {
SkRandom rand;
for (int j = 0; j < NUM_ELEMENTS; ++j) {
fData[j] = rand.nextU() % NUM_ELEMENTS;
}
}
void onDraw(const int loops, SkCanvas* canvas) override {
for (int i = 0; i < loops; ++i) {
GrOrderedSet<int> set;
for (int j = 0; j < NUM_ELEMENTS; ++j) {
set.insert(fData[j]);
}
set.reset();
}
}
private:
SkString fName;
int fData[NUM_ELEMENTS];
typedef Benchmark INHERITED;
};
// Time how long it takes to find elements in a set
class GrOrderedSetFindBench : public Benchmark {
public:
GrOrderedSetFindBench() {
fName.append("ordered_set_find");
}
bool isSuitableFor(Backend backend) override {
return kNonRendering_Backend == backend;
}
virtual ~GrOrderedSetFindBench() {}
protected:
const char* onGetName() override {
return fName.c_str();
}
void onPreDraw() override {
SkRandom rand;
for (int j = 0; j < NUM_ELEMENTS; ++j) {
fData[j] = rand.nextU() % 1500;
fSet.insert(rand.nextU() % NUM_ELEMENTS);
}
}
void onDraw(const int loops, SkCanvas* canvas) override {
for (int i = 0; i < loops; ++i) {
for (int j = 0; j < NUM_ELEMENTS; ++j) {
fSet.find(fData[j]);
}
}
}
private:
SkString fName;
int fData[NUM_ELEMENTS];
GrOrderedSet<int> fSet;
typedef Benchmark INHERITED;
};
// Time how long it takes to iterate over and remove all elements from set
class GrOrderedSetRemoveBench : public Benchmark {
public:
GrOrderedSetRemoveBench() {
fName.append("ordered_set_remove");
}
bool isSuitableFor(Backend backend) override {
return kNonRendering_Backend == backend;
}
virtual ~GrOrderedSetRemoveBench() {}
protected:
const char* onGetName() override {
return fName.c_str();
}
void onPreDraw() override {
SkRandom rand;
for (int j = 0; j < NUM_ELEMENTS; ++j) {
fSet.insert(rand.nextU() % NUM_ELEMENTS);
}
}
void onDraw(const int loops, SkCanvas* canvas) override {
typedef GrOrderedSet<int>::Iter SetIter;
for (int i = 0; i < loops; ++i) {
GrOrderedSet<int> testSet;
for (SetIter s = fSet.begin(); fSet.end() != s; ++s) {
testSet.insert(*s);
}
for (int j = 0; j < NUM_ELEMENTS; ++j) {
testSet.remove(testSet.find(j));
}
}
}
private:
SkString fName;
GrOrderedSet<int> fSet;
typedef Benchmark INHERITED;
};
///////////////////////////////////////////////////////////////////////////////
DEF_BENCH(return SkNEW_ARGS(GrOrderedSetBuildBench, ());)
DEF_BENCH(return SkNEW_ARGS(GrOrderedSetFindBench, ());)
DEF_BENCH(return SkNEW_ARGS(GrOrderedSetRemoveBench, ());)
#endif
|
