Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 /* | 1 /* |
|
epoger
2013/04/15 18:21:38
Toplevel comment: the reason for this change is: a
| |
| 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 #include "SkBenchmark.h" | 7 #include "SkBenchmark.h" |
| 8 #include "SkCanvas.h" | 8 #include "SkCanvas.h" |
| 9 #include "SkChecksum.h" | 9 #include "SkChecksum.h" |
| 10 #include "SkCityHash.h" | 10 #include "SkCityHash.h" |
| 11 #include "SkMD5.h" | 11 #include "SkMD5.h" |
| (...skipping 44 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 56 case kChecksum_ChecksumType: { | 56 case kChecksum_ChecksumType: { |
| 57 for (int i = 0; i < N; i++) { | 57 for (int i = 0; i < N; i++) { |
| 58 volatile uint32_t result = SkChecksum::Compute(fData, sizeof (fData)); | 58 volatile uint32_t result = SkChecksum::Compute(fData, sizeof (fData)); |
| 59 sk_ignore_unused_variable(result); | 59 sk_ignore_unused_variable(result); |
| 60 } | 60 } |
| 61 } break; | 61 } break; |
| 62 case kMD5_ChecksumType: { | 62 case kMD5_ChecksumType: { |
| 63 for (int i = 0; i < N; i++) { | 63 for (int i = 0; i < N; i++) { |
| 64 SkMD5 md5; | 64 SkMD5 md5; |
| 65 md5.update(reinterpret_cast<uint8_t*>(fData), sizeof(fData)) ; | 65 md5.update(reinterpret_cast<uint8_t*>(fData), sizeof(fData)) ; |
| 66 SkMD5::Digest digest; | 66 SkHashDigest digest; |
| 67 md5.finish(digest); | 67 md5.finish(digest); |
| 68 } | 68 } |
| 69 } break; | 69 } break; |
| 70 case kSHA1_ChecksumType: { | 70 case kSHA1_ChecksumType: { |
| 71 for (int i = 0; i < N; i++) { | 71 for (int i = 0; i < N; i++) { |
| 72 SkSHA1 sha1; | 72 SkSHA1 sha1; |
| 73 sha1.update(reinterpret_cast<uint8_t*>(fData), sizeof(fData) ); | 73 sha1.update(reinterpret_cast<uint8_t*>(fData), sizeof(fData) ); |
| 74 SkSHA1::Digest digest; | 74 SkHashDigest digest; |
| 75 sha1.finish(digest); | 75 sha1.finish(digest); |
| 76 } | 76 } |
| 77 } break; | 77 } break; |
| 78 case kCityHash32: { | 78 case kCityHash32: { |
| 79 for (int i = 0; i < N; i++) { | 79 for (int i = 0; i < N; i++) { |
| 80 volatile uint32_t result = SkCityHash::Compute32(reinterpret _cast<char*>(fData), sizeof(fData)); | 80 volatile uint32_t result = SkCityHash::Compute32(reinterpret _cast<char*>(fData), sizeof(fData)); |
| 81 sk_ignore_unused_variable(result); | 81 sk_ignore_unused_variable(result); |
| 82 } | 82 } |
| 83 } break; | 83 } break; |
| 84 case kCityHash64: { | 84 case kCityHash64: { |
| (...skipping 16 matching lines...) Expand all Loading... | |
| 101 static SkBenchmark* Fact1(void* p) { return new ComputeChecksumBench(p, kMD5_Che cksumType); } | 101 static SkBenchmark* Fact1(void* p) { return new ComputeChecksumBench(p, kMD5_Che cksumType); } |
| 102 static SkBenchmark* Fact2(void* p) { return new ComputeChecksumBench(p, kSHA1_Ch ecksumType); } | 102 static SkBenchmark* Fact2(void* p) { return new ComputeChecksumBench(p, kSHA1_Ch ecksumType); } |
| 103 static SkBenchmark* Fact3(void* p) { return new ComputeChecksumBench(p, kCityHas h32); } | 103 static SkBenchmark* Fact3(void* p) { return new ComputeChecksumBench(p, kCityHas h32); } |
| 104 static SkBenchmark* Fact4(void* p) { return new ComputeChecksumBench(p, kCityHas h64); } | 104 static SkBenchmark* Fact4(void* p) { return new ComputeChecksumBench(p, kCityHas h64); } |
| 105 | 105 |
| 106 static BenchRegistry gReg0(Fact0); | 106 static BenchRegistry gReg0(Fact0); |
| 107 static BenchRegistry gReg1(Fact1); | 107 static BenchRegistry gReg1(Fact1); |
| 108 static BenchRegistry gReg2(Fact2); | 108 static BenchRegistry gReg2(Fact2); |
| 109 static BenchRegistry gReg3(Fact3); | 109 static BenchRegistry gReg3(Fact3); |
| 110 static BenchRegistry gReg4(Fact4); | 110 static BenchRegistry gReg4(Fact4); |
| OLD | NEW |