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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
// Unit tests for rawbuf.
#include <vespa/searchlib/util/rawbuf.h>
#include <vespa/vespalib/stllike/string.h>
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/fastos/file.h>
#include <vespa/log/log.h>
LOG_SETUP("rawbuf_test");
using vespalib::string;
using namespace search;
namespace {
string getString(const RawBuf &buf) {
return string(buf.GetDrainPos(), buf.GetUsedLen());
}
TEST("require that rawbuf can append text") {
RawBuf buf(10);
buf += "foo";
buf += "bar";
EXPECT_EQUAL("foobar", getString(buf));
}
TEST("require that rawbuf expands when appended beyond size") {
RawBuf buf(4);
buf += "foo";
EXPECT_EQUAL(1u, buf.GetFreeLen());
buf += "bar";
EXPECT_EQUAL(2u, buf.GetFreeLen());
EXPECT_EQUAL("foobar", getString(buf));
}
TEST("require that a rawbuf can be appended to another") {
RawBuf buf1(10);
RawBuf buf2(10);
buf1 += "foo";
buf2 += "bar";
buf1 += buf2;
EXPECT_EQUAL("foobar", getString(buf1));
}
TEST("require that rawbufs can be tested for equality") {
RawBuf buf1(10);
RawBuf buf2(10);
buf1 += "foo";
buf2 += "bar";
EXPECT_TRUE(buf1 == buf1);
EXPECT_FALSE(buf1 == buf2);
}
template <typename T>
void checkAddNum(void (RawBuf::*addNum)(T, size_t, char), size_t num,
size_t fieldw, char fill, const string &expected) {
RawBuf buf(10);
(buf.*addNum)(num, fieldw, fill);
EXPECT_EQUAL(expected, getString(buf));
}
TEST("require that rawbuf can add numbers in decimal") {
checkAddNum(&RawBuf::addNum, 0, 4, 'x', "xxx0");
checkAddNum(&RawBuf::addNum, 42, 4, '0', "0042");
checkAddNum(&RawBuf::addNum, 12345678901234, 4, '0', "12345678901234");
checkAddNum(&RawBuf::addNum, -1, 4, '0', "18446744073709551615");
checkAddNum(&RawBuf::addNum32, 0, 4, 'x', "xxx0");
checkAddNum(&RawBuf::addNum32, 42, 4, '0', "0042");
checkAddNum(&RawBuf::addNum32, 1234567890, 4, '0', "1234567890");
checkAddNum(&RawBuf::addNum32, -1, 0, '0', "-1");
checkAddNum(&RawBuf::addNum32, -1, 4, '0', "00-1");
checkAddNum(&RawBuf::addNum64, 0, 4, 'x', "xxx0");
checkAddNum(&RawBuf::addNum64, 42, 4, '0', "0042");
checkAddNum(&RawBuf::addNum64, 12345678901234, 4, '0', "12345678901234");
checkAddNum(&RawBuf::addNum64, -1, 0, '0', "-1");
checkAddNum(&RawBuf::addNum64, -1, 4, '0', "00-1");
}
TEST("require that rawbuf can add hitrank") {
RawBuf buf(10);
buf.addHitRank(HitRank(4.2));
EXPECT_EQUAL("4.2", getString(buf));
}
TEST("require that rawbuf can add signedhitrank") {
RawBuf buf(10);
buf.addHitRank(SignedHitRank(-4.213));
EXPECT_EQUAL("-4.213", getString(buf));
}
TEST("require that rawbuf can append data of known length") {
RawBuf buf(10);
const string data("foo bar baz qux quux");
buf.append(data.data(), data.size());
EXPECT_EQUAL(data, getString(buf));
}
TEST("require that rawbuf can be truncated shorter and longer") {
RawBuf buf(10);
buf += "foobarbaz";
buf.truncate(3);
buf += "qux";
buf.truncate(9);
EXPECT_EQUAL("fooquxbaz", getString(buf));
}
TEST("require that prealloc makes enough room") {
RawBuf buf(10);
buf += "foo";
EXPECT_EQUAL(7u, buf.GetFreeLen());
buf.preAlloc(100);
EXPECT_EQUAL("foo", getString(buf));
EXPECT_LESS_EQUAL(100u, buf.GetFreeLen());
}
TEST("require that compact discards drained data") {
RawBuf buf(10);
buf += "foobar";
buf.Drain(3);
buf.Compact();
buf.Fill(3);
EXPECT_EQUAL("barbar", getString(buf));
}
TEST("require that reusing a buffer that has grown 4x will alloc new buffer") {
RawBuf buf(10);
buf.preAlloc(100);
EXPECT_LESS_EQUAL(100u, buf.GetFreeLen());
buf.Reuse();
EXPECT_EQUAL(10u, buf.GetFreeLen());
}
TEST("require that various length and position information can be found.") {
RawBuf buf(30);
buf += "foo bar baz qux quux corge";
buf.Drain(7);
EXPECT_EQUAL(7u, buf.GetDrainLen());
EXPECT_EQUAL(19u, buf.GetUsedLen());
EXPECT_EQUAL(26u, buf.GetUsedAndDrainLen());
EXPECT_EQUAL(4u, buf.GetFreeLen());
}
TEST("require that rawbuf can 'putToInet' 16-bit numbers") {
RawBuf buf(1);
buf.Put16ToInet(0x1234);
EXPECT_EQUAL(2, buf.GetFillPos() - buf.GetDrainPos());
EXPECT_EQUAL(0x12, (int) buf.GetDrainPos()[0] & 0xff);
EXPECT_EQUAL(0x34, (int) buf.GetDrainPos()[1] & 0xff);
}
TEST("require that rawbuf can 'putToInet' 32-bit numbers") {
RawBuf buf(1);
buf.PutToInet(0x12345678);
EXPECT_EQUAL(4, buf.GetFillPos() - buf.GetDrainPos());
EXPECT_EQUAL(0x12, (int) buf.GetDrainPos()[0] & 0xff);
EXPECT_EQUAL(0x34, (int) buf.GetDrainPos()[1] & 0xff);
EXPECT_EQUAL(0x56, (int) buf.GetDrainPos()[2] & 0xff);
EXPECT_EQUAL(0x78, (int) buf.GetDrainPos()[3] & 0xff);
}
TEST("require that rawbuf can 'putToInet' 64-bit numbers") {
RawBuf buf(1);
buf.Put64ToInet(0x123456789abcdef0ULL);
EXPECT_EQUAL(8, buf.GetFillPos() - buf.GetDrainPos());
EXPECT_EQUAL(0x12, (int) buf.GetDrainPos()[0] & 0xff);
EXPECT_EQUAL(0x34, (int) buf.GetDrainPos()[1] & 0xff);
EXPECT_EQUAL(0x56, (int) buf.GetDrainPos()[2] & 0xff);
EXPECT_EQUAL(0x78, (int) buf.GetDrainPos()[3] & 0xff);
EXPECT_EQUAL(0x9a, (int) buf.GetDrainPos()[4] & 0xff);
EXPECT_EQUAL(0xbc, (int) buf.GetDrainPos()[5] & 0xff);
EXPECT_EQUAL(0xde, (int) buf.GetDrainPos()[6] & 0xff);
EXPECT_EQUAL(0xf0, (int) buf.GetDrainPos()[7] & 0xff);
}
} // namespace
TEST_MAIN() { TEST_RUN_ALL(); }
|
