ChecksumBench.cpp revision 7de18e5c7b4e4a8ad8910b1016688ded902f185b
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"
10#include "SkCityHash.h"
11#include "SkMD5.h"
12#include "SkRandom.h"
13#include "SkSHA1.h"
14#include "SkTemplates.h"
15
16enum ChecksumType {
17    kChecksum_ChecksumType,
18    kMD5_ChecksumType,
19    kSHA1_ChecksumType,
20    kCityHash32,
21    kCityHash64
22};
23
24class ComputeChecksumBench : public SkBenchmark {
25    enum {
26        U32COUNT  = 256,
27        SIZE      = U32COUNT * 4,
28        N         = SkBENCHLOOP(100000),
29    };
30    uint32_t    fData[U32COUNT];
31    ChecksumType fType;
32
33public:
34    ComputeChecksumBench(void* param, ChecksumType type) : INHERITED(param), fType(type) {
35        SkRandom rand;
36        for (int i = 0; i < U32COUNT; ++i) {
37            fData[i] = rand.nextU();
38        }
39        fIsRendering = false;
40    }
41
42protected:
43    virtual const char* onGetName() {
44        switch (fType) {
45            case kChecksum_ChecksumType: return "compute_checksum";
46            case kMD5_ChecksumType: return "compute_md5";
47            case kSHA1_ChecksumType: return "compute_sha1";
48            case kCityHash32: return "compute_cityhash32";
49            case kCityHash64: return "compute_cityhash64";
50            default: SK_CRASH(); return "";
51        }
52    }
53
54    virtual void onDraw(SkCanvas* canvas) {
55        switch (fType) {
56            case kChecksum_ChecksumType: {
57                for (int i = 0; i < N; i++) {
58                    volatile uint32_t result = SkChecksum::Compute(fData, sizeof(fData));
59                    sk_ignore_unused_variable(result);
60                }
61            } break;
62            case kMD5_ChecksumType: {
63                for (int i = 0; i < N; i++) {
64                    SkMD5 md5;
65                    md5.update(reinterpret_cast<uint8_t*>(fData), sizeof(fData));
66                    SkMD5::Digest digest;
67                    md5.finish(digest);
68                }
69            } break;
70            case kSHA1_ChecksumType: {
71                for (int i = 0; i < N; i++) {
72                    SkSHA1 sha1;
73                    sha1.update(reinterpret_cast<uint8_t*>(fData), sizeof(fData));
74                    SkSHA1::Digest digest;
75                    sha1.finish(digest);
76                }
77            } break;
78            case kCityHash32: {
79                for (int i = 0; i < N; i++) {
80                    volatile uint32_t result = SkCityHash::Compute32(reinterpret_cast<char*>(fData), sizeof(fData));
81                    sk_ignore_unused_variable(result);
82                }
83            } break;
84            case kCityHash64: {
85                for (int i = 0; i < N; i++) {
86                    volatile uint64_t result = SkCityHash::Compute64(reinterpret_cast<char*>(fData), sizeof(fData));
87                    sk_ignore_unused_variable(result);
88                }
89            } break;
90        }
91
92    }
93
94private:
95    typedef SkBenchmark INHERITED;
96};
97
98///////////////////////////////////////////////////////////////////////////////
99
100static SkBenchmark* Fact0(void* p) { return new ComputeChecksumBench(p, kChecksum_ChecksumType); }
101static SkBenchmark* Fact1(void* p) { return new ComputeChecksumBench(p, kMD5_ChecksumType); }
102static SkBenchmark* Fact2(void* p) { return new ComputeChecksumBench(p, kSHA1_ChecksumType); }
103static SkBenchmark* Fact3(void* p) { return new ComputeChecksumBench(p, kCityHash32); }
104static SkBenchmark* Fact4(void* p) { return new ComputeChecksumBench(p, kCityHash64); }
105
106static BenchRegistry gReg0(Fact0);
107static BenchRegistry gReg1(Fact1);
108static BenchRegistry gReg2(Fact2);
109static BenchRegistry gReg3(Fact3);
110static BenchRegistry gReg4(Fact4);
111