OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #include "Benchmark.h" | 8 #include "Benchmark.h" |
9 #include "SkCanvas.h" | 9 #include "SkCanvas.h" |
10 #include "SkChunkAlloc.h" | 10 #include "SkChunkAlloc.h" |
11 #include "SkPaint.h" | 11 #include "SkPaint.h" |
12 #include "SkRandom.h" | 12 #include "SkRandom.h" |
13 #include "SkString.h" | 13 #include "SkString.h" |
14 | 14 |
15 class ChunkAllocBench : public Benchmark { | 15 class ChunkAllocBench : public Benchmark { |
16 SkString fName; | 16 SkString fName; |
17 size_t fMinSize; | 17 size_t fMinSize; |
18 public: | 18 public: |
19 ChunkAllocBench(size_t minSize) { | 19 ChunkAllocBench(size_t minSize) { |
20 fMinSize = minSize; | 20 fMinSize = minSize; |
21 fName.printf("chunkalloc_" SK_SIZE_T_SPECIFIER, minSize); | 21 fName.printf("chunkalloc_" SK_SIZE_T_SPECIFIER, minSize); |
22 } | 22 } |
23 | 23 |
24 virtual bool isSuitableFor(Backend backend) SK_OVERRIDE { | 24 bool isSuitableFor(Backend backend) SK_OVERRIDE { |
25 return backend == kNonRendering_Backend; | 25 return backend == kNonRendering_Backend; |
26 } | 26 } |
27 | 27 |
28 protected: | 28 protected: |
29 virtual const char* onGetName() SK_OVERRIDE { | 29 const char* onGetName() SK_OVERRIDE { |
30 return fName.c_str(); | 30 return fName.c_str(); |
31 } | 31 } |
32 | 32 |
33 virtual void onDraw(const int loops, SkCanvas*) SK_OVERRIDE { | 33 void onDraw(const int loops, SkCanvas*) SK_OVERRIDE { |
34 size_t inc = fMinSize >> 4; | 34 size_t inc = fMinSize >> 4; |
35 SkASSERT(inc > 0); | 35 SkASSERT(inc > 0); |
36 size_t total = fMinSize * 64; | 36 size_t total = fMinSize * 64; |
37 | 37 |
38 SkChunkAlloc alloc(fMinSize); | 38 SkChunkAlloc alloc(fMinSize); |
39 | 39 |
40 for (int i = 0; i < loops; ++i) { | 40 for (int i = 0; i < loops; ++i) { |
41 size_t size = 0; | 41 size_t size = 0; |
42 int calls = 0; | 42 int calls = 0; |
43 while (size < total) { | 43 while (size < total) { |
44 alloc.allocThrow(inc); | 44 alloc.allocThrow(inc); |
45 size += inc; | 45 size += inc; |
46 calls += 1; | 46 calls += 1; |
47 } | 47 } |
48 alloc.reset(); | 48 alloc.reset(); |
49 } | 49 } |
50 } | 50 } |
51 | 51 |
52 private: | 52 private: |
53 typedef Benchmark INHERITED; | 53 typedef Benchmark INHERITED; |
54 }; | 54 }; |
55 | 55 |
56 DEF_BENCH( return new ChunkAllocBench(64); ) | 56 DEF_BENCH( return new ChunkAllocBench(64); ) |
57 DEF_BENCH( return new ChunkAllocBench(8*1024); ) | 57 DEF_BENCH( return new ChunkAllocBench(8*1024); ) |
58 | 58 |
OLD | NEW |