OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:SkBENCHLOOP
(Results
1 - 25
of
40
) sorted by null
1
2
/external/skia/bench/
MutexBench.cpp
12
N =
SkBENCHLOOP
(80),
13
M =
SkBENCHLOOP
(200)
GrMemoryPoolBench.cpp
38
N =
SkBENCHLOOP
(1 * (1 << 20)),
94
N =
SkBENCHLOOP
(1 * (1 << 20)),
131
N =
SkBENCHLOOP
((1 << 8)),
132
M =
SkBENCHLOOP
(4 * (1 << 10)),
WriterBench.cpp
28
for (int i = 0; i <
SkBENCHLOOP
(800); i++) {
SkBenchmark.h
31
#define
SkBENCHLOOP
(n) 1
33
#define
SkBENCHLOOP
(n) n
MemoryBench.cpp
20
N =
SkBENCHLOOP
(1000)
PictureRecordBench.cpp
26
N =
SkBENCHLOOP
(25), // number of times to create the picture
75
M =
SkBENCHLOOP
(100), // number of elements in each dictionary
140
M =
SkBENCHLOOP
(15000), // number of unique paint objects
168
M =
SkBENCHLOOP
(50000), // number of draw iterations
DeferredCanvasBench.cpp
19
N =
SkBENCHLOOP
(25), // number of times to create the picture
78
M =
SkBENCHLOOP
(700), // number of individual draws in each loop
AAClipBench.cpp
27
N =
SkBENCHLOOP
(200),
99
static const int kNumDraws =
SkBENCHLOOP
(2);
192
N =
SkBENCHLOOP
(200),
255
N =
SkBENCHLOOP
(400),
ChromeBench.cpp
471
for (int j = 0; j <
SkBENCHLOOP
(gmailScrollingRectSpec[i*3]); j++) {
DecodeBench.cpp
21
enum { N =
SkBENCHLOOP
(10) };
LineBench.cpp
25
N =
SkBENCHLOOP
(10)
RTreeBench.cpp
49
for (int i = 0; i <
SkBENCHLOOP
(100); ++i) {
90
for (int j = 0; j <
SkBENCHLOOP
(NUM_QUERY_RECTS); ++j) {
92
SkBENCHLOOP
(NUM_QUERY_RECTS)), fBulkLoad);
106
for (int i = 0; i <
SkBENCHLOOP
(NUM_QUERIES); ++i) {
RegionContainBench.cpp
29
N =
SkBENCHLOOP
(20000)
TableBench.cpp
29
static const int kNumIterations =
SkBENCHLOOP
(10);
RefCntBench.cpp
14
N =
SkBENCHLOOP
(100000),
15
M =
SkBENCHLOOP
(2)
ScalarBench.cpp
33
int n =
SkBENCHLOOP
(N * this->mulLoopCount());
138
N =
SkBENCHLOOP
(10000)
MatrixConvolutionBench.cpp
45
for (int i = 0; i <
SkBENCHLOOP
(3); i++) {
PathIterBench.cpp
33
enum { N =
SkBENCHLOOP
(500) };
MathBench.cpp
49
int n =
SkBENCHLOOP
(kLoop * this->mulLoopCount());
250
N =
SkBENCHLOOP
(1000),
251
NN =
SkBENCHLOOP
(1000),
317
ARRAY =
SkBENCHLOOP
(1000),
318
LOOP =
SkBENCHLOOP
(1000),
MatrixBench.cpp
32
int n =
SkBENCHLOOP
(N * this->mulLoopCount());
274
for (i = 0; i <
SkBENCHLOOP
(fCount); i++) {
285
int count =
SkBENCHLOOP
(fCount);
311
for (i = 0; i <
SkBENCHLOOP
(fCount); i++) {
322
int count =
SkBENCHLOOP
(fCount);
BitmapRectBench.cpp
48
enum { N =
SkBENCHLOOP
(300) };
ChecksumBench.cpp
29
N =
SkBENCHLOOP
(100000),
DashBench.cpp
41
N =
SkBENCHLOOP
(100)
187
N =
SkBENCHLOOP
(400)
228
N =
SkBENCHLOOP
(200)
270
N =
SkBENCHLOOP
(480)
MorphologyBench.cpp
63
for (int i = 0; i <
SkBENCHLOOP
(3); i++) {
PathBench.cpp
33
enum { N =
SkBENCHLOOP
(1000) };
324
enum { N =
SkBENCHLOOP
(5000) };
363
enum { N =
SkBENCHLOOP
(30000) };
407
enum { N =
SkBENCHLOOP
(30000) };
464
enum { N =
SkBENCHLOOP
(40000) };
523
enum { N =
SkBENCHLOOP
(15000) };
630
N =
SkBENCHLOOP
(100)
693
N =
SkBENCHLOOP
(100)
852
N =
SkBENCHLOOP
(100000),
Completed in 1849 milliseconds
1
2