junov@chromium.org | ef76060 | 2012-06-27 20:03:16 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2012 Google Inc. |
| 3 | * |
| 4 | * Use of this source code is governed by a BSD-style license that can be |
| 5 | * found in the LICENSE file. |
| 6 | */ |
| 7 | #include "SkBenchmark.h" |
| 8 | #include "SkCanvas.h" |
| 9 | #include "SkChecksum.h" |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 10 | #include "SkCityHash.h" |
| 11 | #include "SkMD5.h" |
reed@google.com | 142e1fe | 2012-07-09 17:44:44 +0000 | [diff] [blame] | 12 | #include "SkRandom.h" |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 13 | #include "SkSHA1.h" |
| 14 | |
| 15 | enum ChecksumType { |
| 16 | kChecksum_ChecksumType, |
| 17 | kMD5_ChecksumType, |
| 18 | kSHA1_ChecksumType, |
| 19 | kCityHash32, |
| 20 | kCityHash64 |
| 21 | }; |
junov@chromium.org | ef76060 | 2012-06-27 20:03:16 +0000 | [diff] [blame] | 22 | |
| 23 | class ComputeChecksumBench : public SkBenchmark { |
reed@google.com | fc8581b | 2012-07-09 17:40:48 +0000 | [diff] [blame] | 24 | enum { |
reed@google.com | 142e1fe | 2012-07-09 17:44:44 +0000 | [diff] [blame] | 25 | U32COUNT = 256, |
| 26 | SIZE = U32COUNT * 4, |
reed@google.com | fc8581b | 2012-07-09 17:40:48 +0000 | [diff] [blame] | 27 | N = SkBENCHLOOP(100000), |
| 28 | }; |
reed@google.com | 142e1fe | 2012-07-09 17:44:44 +0000 | [diff] [blame] | 29 | uint32_t fData[U32COUNT]; |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 30 | ChecksumType fType; |
reed@google.com | 142e1fe | 2012-07-09 17:44:44 +0000 | [diff] [blame] | 31 | |
| 32 | public: |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 33 | ComputeChecksumBench(void* param, ChecksumType type) : INHERITED(param), fType(type) { |
reed@google.com | 142e1fe | 2012-07-09 17:44:44 +0000 | [diff] [blame] | 34 | SkRandom rand; |
| 35 | for (int i = 0; i < U32COUNT; ++i) { |
| 36 | fData[i] = rand.nextU(); |
| 37 | } |
robertphillips@google.com | 433ce5e | 2012-09-17 10:49:30 +0000 | [diff] [blame] | 38 | fIsRendering = false; |
reed@google.com | 142e1fe | 2012-07-09 17:44:44 +0000 | [diff] [blame] | 39 | } |
| 40 | |
junov@chromium.org | ef76060 | 2012-06-27 20:03:16 +0000 | [diff] [blame] | 41 | protected: |
| 42 | virtual const char* onGetName() { |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 43 | switch (fType) { |
| 44 | case kChecksum_ChecksumType: return "compute_checksum"; |
| 45 | case kMD5_ChecksumType: return "compute_md5"; |
| 46 | case kSHA1_ChecksumType: return "compute_sha1"; |
| 47 | case kCityHash32: return "compute_cityhash32"; |
| 48 | case kCityHash64: return "compute_cityhash64"; |
| 49 | default: SK_CRASH(); return ""; |
| 50 | } |
junov@chromium.org | ef76060 | 2012-06-27 20:03:16 +0000 | [diff] [blame] | 51 | } |
| 52 | |
| 53 | virtual void onDraw(SkCanvas* canvas) { |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 54 | switch (fType) { |
| 55 | case kChecksum_ChecksumType: { |
| 56 | for (int i = 0; i < N; i++) { |
| 57 | volatile uint32_t result = SkChecksum::Compute(fData, sizeof(fData)); |
| 58 | } |
| 59 | } break; |
| 60 | case kMD5_ChecksumType: { |
| 61 | for (int i = 0; i < N; i++) { |
| 62 | SkMD5 md5; |
| 63 | md5.update(reinterpret_cast<uint8_t*>(fData), sizeof(fData)); |
| 64 | SkMD5::Digest digest; |
| 65 | md5.finish(digest); |
| 66 | } |
| 67 | } break; |
| 68 | case kSHA1_ChecksumType: { |
| 69 | for (int i = 0; i < N; i++) { |
| 70 | SkSHA1 sha1; |
| 71 | sha1.update(reinterpret_cast<uint8_t*>(fData), sizeof(fData)); |
| 72 | SkSHA1::Digest digest; |
| 73 | sha1.finish(digest); |
| 74 | } |
| 75 | } break; |
| 76 | case kCityHash32: { |
| 77 | for (int i = 0; i < N; i++) { |
| 78 | volatile uint32_t result = SkCityHash::Compute32(reinterpret_cast<char*>(fData), sizeof(fData)); |
| 79 | } |
| 80 | } break; |
| 81 | case kCityHash64: { |
| 82 | for (int i = 0; i < N; i++) { |
| 83 | volatile uint64_t result = SkCityHash::Compute64(reinterpret_cast<char*>(fData), sizeof(fData)); |
| 84 | } |
| 85 | } break; |
reed@google.com | 142e1fe | 2012-07-09 17:44:44 +0000 | [diff] [blame] | 86 | } |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 87 | |
junov@chromium.org | ef76060 | 2012-06-27 20:03:16 +0000 | [diff] [blame] | 88 | } |
| 89 | |
junov@chromium.org | ef76060 | 2012-06-27 20:03:16 +0000 | [diff] [blame] | 90 | private: |
| 91 | typedef SkBenchmark INHERITED; |
| 92 | }; |
| 93 | |
junov@chromium.org | ef76060 | 2012-06-27 20:03:16 +0000 | [diff] [blame] | 94 | /////////////////////////////////////////////////////////////////////////////// |
| 95 | |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 96 | static SkBenchmark* Fact0(void* p) { return new ComputeChecksumBench(p, kChecksum_ChecksumType); } |
| 97 | static SkBenchmark* Fact1(void* p) { return new ComputeChecksumBench(p, kMD5_ChecksumType); } |
| 98 | static SkBenchmark* Fact2(void* p) { return new ComputeChecksumBench(p, kSHA1_ChecksumType); } |
| 99 | static SkBenchmark* Fact3(void* p) { return new ComputeChecksumBench(p, kCityHash32); } |
| 100 | static SkBenchmark* Fact4(void* p) { return new ComputeChecksumBench(p, kCityHash64); } |
junov@chromium.org | ef76060 | 2012-06-27 20:03:16 +0000 | [diff] [blame] | 101 | |
| 102 | static BenchRegistry gReg0(Fact0); |
bungeman@google.com | cfcb1be | 2013-01-31 19:47:48 +0000 | [diff] [blame^] | 103 | static BenchRegistry gReg1(Fact1); |
| 104 | static BenchRegistry gReg2(Fact2); |
| 105 | static BenchRegistry gReg3(Fact3); |
| 106 | static BenchRegistry gReg4(Fact4); |