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
|
// 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 "config.h"
#include <string>
#include "webkit/glue/glue_serialize.h"
#include "testing/gtest/include/gtest/gtest.h"
#include "base/pickle.h"
#pragma warning(push, 0)
#include "CString.h"
#include "FormData.h"
#include "HistoryItem.h"
#include "PlatformString.h"
#include "ResourceRequest.h"
#pragma warning(pop)
using namespace std;
using namespace WebCore;
using namespace webkit_glue;
// These exist only to support the gTest assertion macros, and
// shouldn't be used in normal program code.
static std::ostream& operator<<(std::ostream& out, const String& str)
{
return out << str.latin1().data();
}
static std::ostream& operator<<(std::ostream& out, const FormDataElement& e)
{
return out << e.m_type << ": " <<
e.m_data.size() <<
" <" << string(e.m_data.data() ? e.m_data.data() : "", e.m_data.size()) << "> " <<
e.m_filename;
}
template<typename T>
static std::ostream& operator<<(std::ostream& out, const Vector<T>& v)
{
for (size_t i = 0; i < v.size(); ++i)
out << "[" << v[i] << "] ";
return out;
}
static std::ostream& operator<<(std::ostream& out, const FormData& data)
{
return out << data.elements();
}
static std::ostream& operator<<(std::ostream& out, const IntPoint& pt)
{
return out << "(" << pt.x() << "," << pt.y() << ")";
}
namespace {
class GlueSerializeTest : public testing::Test {
public:
// Makes a FormData with some random data.
FormData* MakeFormData() {
FormData* form_data = new FormData();
char d1[] = "first data block";
form_data->appendData(d1, sizeof(d1)-1);
form_data->appendFile("file.txt");
char d2[] = "data the second";
form_data->appendData(d2, sizeof(d2)-1);
return form_data;
}
// Constructs a HistoryItem with some random data and an optional child.
PassRefPtr<HistoryItem> MakeHistoryItem(bool with_form_data, bool pregnant) {
RefPtr<HistoryItem> item = new HistoryItem();
item->setURLString("urlString");
item->setOriginalURLString("originalURLString");
item->setTarget("target");
item->setParent("parent");
item->setTitle("title");
item->setAlternateTitle("alternateTitle");
item->setLastVisitedTime(13.37);
item->setScrollPoint(IntPoint(42, -42));
item->setIsTargetItem(true);
item->setVisitCount(42*42);
item->setRSSFeedReferrer("rssFeedReferrer");
Vector<String> document_state;
document_state.append("state1");
document_state.append("state2");
document_state.append("state AWESOME");
item->setDocumentState(document_state);
// Form Data
ResourceRequest dummy_request; // only way to initialize HistoryItem
if (with_form_data) {
FormData* form_data = MakeFormData();
dummy_request.setHTTPBody(form_data);
dummy_request.setHTTPContentType("formContentType");
dummy_request.setHTTPReferrer("formReferrer");
dummy_request.setHTTPMethod("POST");
}
item->setFormInfoFromRequest(dummy_request);
// Children
if (pregnant)
item->addChildItem(MakeHistoryItem(false, false));
return item;
}
// Checks that a == b.
void HistoryItemExpectEqual(HistoryItem* a, HistoryItem* b) {
EXPECT_EQ(a->urlString(), b->urlString());
EXPECT_EQ(a->originalURLString(), b->originalURLString());
EXPECT_EQ(a->target(), b->target());
EXPECT_EQ(a->parent(), b->parent());
EXPECT_EQ(a->title(), b->title());
EXPECT_EQ(a->alternateTitle(), b->alternateTitle());
EXPECT_EQ(a->lastVisitedTime(), b->lastVisitedTime());
EXPECT_EQ(a->scrollPoint(), b->scrollPoint());
EXPECT_EQ(a->isTargetItem(), b->isTargetItem());
EXPECT_EQ(a->visitCount(), b->visitCount());
EXPECT_EQ(a->rssFeedReferrer(), b->rssFeedReferrer());
EXPECT_EQ(a->documentState(), b->documentState());
// Form Data
EXPECT_EQ(a->formData() != NULL, b->formData() != NULL);
if (a->formData() && b->formData())
EXPECT_EQ(*a->formData(), *b->formData());
EXPECT_EQ(a->formReferrer(), b->formReferrer());
EXPECT_EQ(a->formContentType(), b->formContentType());
// Children
EXPECT_EQ(a->children().size(), b->children().size());
for (size_t i = 0, c = a->children().size(); i < c; ++i) {
HistoryItemExpectEqual(a->children().at(i).get(),
b->children().at(i).get());
}
}
};
// Test old versions of serialized data to ensure that newer versions of code
// can still read history items written by previous versions.
TEST_F(GlueSerializeTest, BackwardsCompatibleTest) {
RefPtr<HistoryItem> item = MakeHistoryItem(false, false);
// Make sure version 3 (current version) can read versions 1 and 2.
for (int i = 1; i <= 2; i++) {
string serialized_item;
HistoryItemToVersionedString(item.get(), i, &serialized_item);
RefPtr<HistoryItem> deserialized_item = HistoryItemFromString(serialized_item);
ASSERT_FALSE(item == NULL);
ASSERT_FALSE(deserialized_item == NULL);
HistoryItemExpectEqual(item.get(), deserialized_item.get());
}
}
// Makes sure that a HistoryItem remains intact after being serialized and
// deserialized.
TEST_F(GlueSerializeTest, HistoryItemSerializeTest) {
RefPtr<HistoryItem> item = MakeHistoryItem(true, true);
string serialized_item;
HistoryItemToString(item, &serialized_item);
RefPtr<HistoryItem> deserialized_item = HistoryItemFromString(serialized_item);
ASSERT_FALSE(item == NULL);
ASSERT_FALSE(deserialized_item == NULL);
HistoryItemExpectEqual(item.get(), deserialized_item.get());
}
} // namespace
|
