HomeSort by relevance Sort by last modified time
    Searched refs:SkBENCHLOOP (Results 1 - 25 of 55) sorted by null

1 2 3

  /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
ImageCacheBench.cpp 16 N = SkBENCHLOOP(1000),
MemoryBench.cpp 20 N = SkBENCHLOOP(1000)
PictureRecordBench.cpp 27 N = SkBENCHLOOP(25), // number of times to create the picture
76 M = SkBENCHLOOP(100), // number of elements in each dictionary
141 M = SkBENCHLOOP(15000), // number of unique paint objects
178 M = SkBENCHLOOP(50000), // number of draw iterations
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),
376 ARRAY = SkBENCHLOOP(1000),
377 LOOP = SkBENCHLOOP(5000),
438 ARRAY = SkBENCHLOOP(1000),
439 LOOP = SkBENCHLOOP(1000),
485 N = SkBENCHLOOP(1000)
    [all...]
DeferredCanvasBench.cpp 19 N = SkBENCHLOOP(25), // number of times to create the picture
79 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) };
DeferredSurfaceCopyBench.cpp 20 N = SkBENCHLOOP(5),
FSRectBench.cpp 57 N = SkBENCHLOOP(300)
ImageDecodeBench.cpp 62 for (int i = 0; i < SkBENCHLOOP(1000); ++i) {
LineBench.cpp 25 N = SkBENCHLOOP(10)
MatrixConvolutionBench.cpp 43 for (int i = 0; i < SkBENCHLOOP(3); i++) {
PathUtilsBench.cpp 44 enum { N = SkBENCHLOOP(20) };
PremulAndUnpremulAlphaOpsBench.cpp 49 static const int kLoopCount = SkBENCHLOOP(10);
RTreeBench.cpp 49 for (int i = 0; i < SkBENCHLOOP(100); ++i) {
100 for (int j = 0; j < SkBENCHLOOP(NUM_QUERY_RECTS); ++j) {
102 SkBENCHLOOP(NUM_QUERY_RECTS)), fBulkLoad);
109 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)
BitmapScaleBench.cpp 78 for (int i = 0; i < SkBENCHLOOP(fLoopCount); i++) {

Completed in 93 milliseconds

1 2 3