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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
// Copyright (c) 2010, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// static_address_map_unittest.cc: Unit tests for StaticAddressMap.
//
// Author: Siyang Xie (lambxsy@google.com)
#include <climits>
#include <cstdlib>
#include <ctime>
#include <string>
#include <iostream>
#include <sstream>
#include "breakpad_googletest_includes.h"
#include "common/using_std_string.h"
#include "processor/address_map-inl.h"
#include "processor/static_address_map-inl.h"
#include "processor/simple_serializer-inl.h"
#include "map_serializers-inl.h"
typedef google_breakpad::StaticAddressMap<int, char> TestMap;
typedef google_breakpad::AddressMap<int, string> AddrMap;
class TestStaticAddressMap : public ::testing::Test {
protected:
void SetUp() {
for (int testcase = 0; testcase < kNumberTestCases; ++testcase) {
testdata[testcase] = new int[testsize[testcase]];
}
// Test data set0: NULL (empty map)
// Test data set1: single element.
testdata[1][0] = 10;
// Test data set2: six elements.
const int tempdata[] = {5, 10, 14, 15, 16, 20};
for (int i = 0; i < testsize[2]; ++i)
testdata[2][i] = tempdata[i];
// Test data set3:
srand(time(NULL));
for (int i = 0; i < testsize[3]; ++i)
testdata[3][i] = rand();
// Setup maps.
std::stringstream sstream;
for (int testcase = 0; testcase < kNumberTestCases; ++testcase) {
for (int data_item = 0; data_item < testsize[testcase]; ++data_item) {
sstream.clear();
sstream << "test " << testdata[testcase][data_item];
addr_map[testcase].Store(testdata[testcase][data_item], sstream.str());
}
map_data[testcase] = serializer.Serialize(addr_map[testcase], NULL);
test_map[testcase] = TestMap(map_data[testcase]);
}
}
void TearDown() {
for (int i = 0; i < kNumberTestCases; ++i) {
delete [] map_data[i];
delete [] testdata[i];
}
}
void CompareRetrieveResult(int testcase, int target) {
int address;
int address_test;
string entry;
string entry_test;
const char *entry_cstring = NULL;
bool found;
bool found_test;
found = addr_map[testcase].Retrieve(target, &entry, &address);
found_test =
test_map[testcase].Retrieve(target, entry_cstring, &address_test);
ASSERT_EQ(found, found_test);
if (found && found_test) {
ASSERT_EQ(address, address_test);
entry_test = entry_cstring;
ASSERT_EQ(entry, entry_test);
}
}
void RetrieveTester(int testcase) {
int target;
target = INT_MIN;
CompareRetrieveResult(testcase, target);
target = INT_MAX;
CompareRetrieveResult(testcase, target);
srand(time(0));
for (int data_item = 0; data_item < testsize[testcase]; ++data_item) {
// Retrive (aka, search) for target address and compare results from
// AddressMap and StaticAddressMap.
// First, assign the search target to be one of original testdata that is
// known to exist in the map.
target = testdata[testcase][data_item];
CompareRetrieveResult(testcase, target);
// Then, add +2 / -1 bias to target value, in order to test searching for
// a target address not stored in the map.
target -= 1;
CompareRetrieveResult(testcase, target);
target += 3;
CompareRetrieveResult(testcase, target);
// Repeatedly test searching for random target addresses.
target = rand();
CompareRetrieveResult(testcase, target);
}
}
// Test data sets:
static const int kNumberTestCases = 4;
static const int testsize[];
int *testdata[kNumberTestCases];
AddrMap addr_map[kNumberTestCases];
TestMap test_map[kNumberTestCases];
char *map_data[kNumberTestCases];
google_breakpad::AddressMapSerializer<int, string> serializer;
};
const int TestStaticAddressMap::testsize[] = {0, 1, 6, 1000};
TEST_F(TestStaticAddressMap, TestEmptyMap) {
int testcase = 0;
int target;
target = INT_MIN;
CompareRetrieveResult(testcase, target);
target = INT_MAX;
CompareRetrieveResult(testcase, target);
for (int data_item = 0; data_item < testsize[testcase]; ++data_item) {
target = testdata[testcase][data_item];
CompareRetrieveResult(testcase, target);
target -= 1;
CompareRetrieveResult(testcase, target);
target += 3;
CompareRetrieveResult(testcase, target);
target = rand();
CompareRetrieveResult(testcase, target);
}
}
TEST_F(TestStaticAddressMap, TestOneElementMap) {
int testcase = 1;
int target;
target = INT_MIN;
CompareRetrieveResult(testcase, target);
target = INT_MAX;
CompareRetrieveResult(testcase, target);
for (int data_item = 0; data_item < testsize[testcase]; ++data_item) {
target = testdata[testcase][data_item];
CompareRetrieveResult(testcase, target);
target -= 1;
CompareRetrieveResult(testcase, target);
target += 3;
CompareRetrieveResult(testcase, target);
target = rand();
CompareRetrieveResult(testcase, target);
}
}
TEST_F(TestStaticAddressMap, TestSixElementsMap) {
int testcase = 2;
int target;
target = INT_MIN;
CompareRetrieveResult(testcase, target);
target = INT_MAX;
CompareRetrieveResult(testcase, target);
for (int data_item = 0; data_item < testsize[testcase]; ++data_item) {
target = testdata[testcase][data_item];
CompareRetrieveResult(testcase, target);
target -= 1;
CompareRetrieveResult(testcase, target);
target += 3;
CompareRetrieveResult(testcase, target);
target = rand();
CompareRetrieveResult(testcase, target);
}
}
TEST_F(TestStaticAddressMap, Test1000RandomElementsMap) {
int testcase = 3;
int target;
target = INT_MIN;
CompareRetrieveResult(testcase, target);
target = INT_MAX;
CompareRetrieveResult(testcase, target);
for (int data_item = 0; data_item < testsize[testcase]; ++data_item) {
target = testdata[testcase][data_item];
CompareRetrieveResult(testcase, target);
target -= 1;
CompareRetrieveResult(testcase, target);
target += 3;
CompareRetrieveResult(testcase, target);
target = rand();
CompareRetrieveResult(testcase, target);
}
}
int main(int argc, char *argv[]) {
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}
|
