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
237
238
|
// Copyright 2008, 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.
#include <windows.h>
#include <string.h>
#include "base/basictypes.h"
#include "base/check_handler.h"
#include "base/logging.h"
#include "base/scoped_ptr.h"
#include "base/pickle.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace {
const int testint = 2093847192;
const std::string teststr("Hello world"); // note non-aligned string length
const std::wstring testwstr(L"Hello, world");
const char testdata[] = "AAA\0BBB\0";
const int testdatalen = arraysize(testdata) - 1;
const bool testbool1 = false;
const bool testbool2 = true;
// checks that the result
void VerifyResult(const Pickle& pickle) {
void* iter = NULL;
int outint;
EXPECT_TRUE(pickle.ReadInt(&iter, &outint));
EXPECT_EQ(testint, outint);
std::string outstr;
EXPECT_TRUE(pickle.ReadString(&iter, &outstr));
EXPECT_EQ(teststr, outstr);
std::wstring outwstr;
EXPECT_TRUE(pickle.ReadWString(&iter, &outwstr));
EXPECT_EQ(testwstr, outwstr);
bool outbool;
EXPECT_TRUE(pickle.ReadBool(&iter, &outbool));
EXPECT_EQ(testbool1, outbool);
EXPECT_TRUE(pickle.ReadBool(&iter, &outbool));
EXPECT_EQ(testbool2, outbool);
const char* outdata;
int outdatalen;
EXPECT_TRUE(pickle.ReadData(&iter, &outdata, &outdatalen));
EXPECT_EQ(testdatalen, outdatalen);
EXPECT_EQ(memcmp(testdata, outdata, outdatalen), 0);
EXPECT_TRUE(pickle.ReadData(&iter, &outdata, &outdatalen));
EXPECT_EQ(testdatalen, outdatalen);
EXPECT_EQ(memcmp(testdata, outdata, outdatalen), 0);
// reads past the end should fail
EXPECT_FALSE(pickle.ReadInt(&iter, &outint));
}
} // namespace
TEST(PickleTest, EncodeDecode) {
Pickle pickle;
EXPECT_TRUE(pickle.WriteInt(testint));
EXPECT_TRUE(pickle.WriteString(teststr));
EXPECT_TRUE(pickle.WriteWString(testwstr));
EXPECT_TRUE(pickle.WriteBool(testbool1));
EXPECT_TRUE(pickle.WriteBool(testbool2));
EXPECT_TRUE(pickle.WriteData(testdata, testdatalen));
char* dest = pickle.BeginWriteData(testdatalen);
EXPECT_TRUE(dest);
memcpy(dest, testdata, testdatalen);
VerifyResult(pickle);
// test copy constructor
Pickle pickle2(pickle);
VerifyResult(pickle2);
// test operator=
Pickle pickle3;
pickle3 = pickle;
VerifyResult(pickle3);
}
TEST(PickleTest, ZeroLenStr) {
Pickle pickle;
EXPECT_TRUE(pickle.WriteString(""));
void* iter = NULL;
std::string outstr;
EXPECT_TRUE(pickle.ReadString(&iter, &outstr));
EXPECT_EQ("", outstr);
}
TEST(PickleTest, ZeroLenWStr) {
Pickle pickle;
EXPECT_TRUE(pickle.WriteWString(L""));
void* iter = NULL;
std::string outstr;
EXPECT_TRUE(pickle.ReadString(&iter, &outstr));
EXPECT_EQ("", outstr);
}
TEST(PickleTest, BadLenStr) {
Pickle pickle;
EXPECT_TRUE(pickle.WriteInt(-2));
void* iter = NULL;
std::string outstr;
EXPECT_FALSE(pickle.ReadString(&iter, &outstr));
}
TEST(PickleTest, BadLenWStr) {
Pickle pickle;
EXPECT_TRUE(pickle.WriteInt(-1));
void* iter = NULL;
std::wstring woutstr;
EXPECT_FALSE(pickle.ReadWString(&iter, &woutstr));
}
TEST(PickleTest, FindNext) {
Pickle pickle;
EXPECT_TRUE(pickle.WriteInt(1));
EXPECT_TRUE(pickle.WriteString("Domo"));
const char* start = reinterpret_cast<const char*>(pickle.data());
const char* end = start + pickle.size();
EXPECT_TRUE(end == Pickle::FindNext(pickle.header_size_, start, end));
EXPECT_TRUE(NULL == Pickle::FindNext(pickle.header_size_, start, end - 1));
EXPECT_TRUE(end == Pickle::FindNext(pickle.header_size_, start, end + 1));
}
TEST(PickleTest, IteratorHasRoom) {
Pickle pickle;
EXPECT_TRUE(pickle.WriteInt(1));
EXPECT_TRUE(pickle.WriteInt(2));
const void* iter = 0;
EXPECT_FALSE(pickle.IteratorHasRoomFor(iter, 1));
iter = pickle.payload();
EXPECT_TRUE(pickle.IteratorHasRoomFor(iter, 0));
EXPECT_TRUE(pickle.IteratorHasRoomFor(iter, 1));
EXPECT_FALSE(pickle.IteratorHasRoomFor(iter, -1));
EXPECT_TRUE(pickle.IteratorHasRoomFor(iter, sizeof(int) * 2));
EXPECT_FALSE(pickle.IteratorHasRoomFor(iter, (sizeof(int) * 2) + 1));
}
TEST(PickleTest, Resize) {
int unit = Pickle::kPayloadUnit;
scoped_array<char> data(new char[unit]);
char* data_ptr = data.get();
for (int i = 0; i < unit; i++)
data_ptr[i] = 'G';
// construct a message that will be exactly the size of one payload unit,
// note that any data will have a 4-byte header indicating the size
const int payload_size_after_header = unit - sizeof(uint32);
Pickle pickle;
pickle.WriteData(data_ptr, payload_size_after_header - sizeof(uint32));
int cur_payload = payload_size_after_header;
EXPECT_EQ(pickle.capacity(), unit);
EXPECT_EQ(pickle.payload_size(), payload_size_after_header);
// fill out a full page (noting data header)
pickle.WriteData(data_ptr, unit - sizeof(uint32));
cur_payload += unit;
EXPECT_EQ(unit*2, pickle.capacity());
EXPECT_EQ(cur_payload, pickle.payload_size());
// one more byte should expand the capacity by one unit
pickle.WriteData(data_ptr, 1);
cur_payload += 5;
EXPECT_EQ(unit * 3, pickle.capacity());
EXPECT_EQ(cur_payload, pickle.payload_size());
}
TEST(PickleTest, HeaderPadding) {
struct CustomHeader : Pickle::Header {
int blah;
};
const uint32 kMagic = 0x12345678;
Pickle pickle(sizeof(CustomHeader));
pickle.WriteInt(kMagic);
// this should not overwrite the 'int' payload
pickle.headerT<CustomHeader>()->blah = 10;
void* iter = NULL;
int result;
ASSERT_TRUE(pickle.ReadInt(&iter, &result));
EXPECT_EQ(result, kMagic);
}
TEST(PickleTest, EqualsOperator) {
Pickle source;
source.WriteInt(1);
Pickle copy_refs_source_buffer(static_cast<const char*>(source.data()),
source.size());
Pickle copy;
copy = copy_refs_source_buffer;
ASSERT_EQ(source.size(), copy.size());
}
|
