blob: 175719d3cd238d119d6306e356aedb2ea9361bd7 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
/*
* Copyright 2010 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
// This is a GPU-backend specific test
#if SK_SUPPORT_GPU
#include "GrMurmur3HashKey.h"
#include "GrBinHashKey.h"
#include "Test.h"
struct AlignedKey {
uint32_t align;
char key[8];
};
template<typename KeyType> static void TestHash(skiatest::Reporter* reporter) {
AlignedKey a, b;
memcpy(&a.key, "abcdABCD", 8);
memcpy(&b.key, "abcdBBCD", 8);
const uint32_t* testStringA = reinterpret_cast<const uint32_t*>(&a.key);
const uint32_t* testStringB = reinterpret_cast<const uint32_t*>(&b.key);
KeyType keyA;
keyA.setKeyData(testStringA);
// test copy constructor and comparison
KeyType keyA2(keyA);
REPORTER_ASSERT(reporter, keyA == keyA2);
REPORTER_ASSERT(reporter, keyA.getHash() == keyA2.getHash());
// test re-init
keyA2.setKeyData(testStringA);
REPORTER_ASSERT(reporter, keyA == keyA2);
REPORTER_ASSERT(reporter, keyA.getHash() == keyA2.getHash());
// test sorting
KeyType keyB;
keyB.setKeyData(testStringB);
REPORTER_ASSERT(reporter, keyA.getHash() != keyB.getHash());
}
DEF_TEST(GrBinHashKey, reporter) {
enum {
kDataLenUsedForKey = 8
};
TestHash<GrBinHashKey<kDataLenUsedForKey> >(reporter);
TestHash<GrMurmur3HashKey<kDataLenUsedForKey> >(reporter);
}
#endif
|
