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
|
// Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/fastos/fastos.h>
#include <vespa/log/log.h>
LOG_SETUP("wordstore_test");
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/searchlib/memoryindex/wordstore.h>
using namespace search::datastore;
namespace search {
namespace memoryindex {
class Test : public vespalib::TestApp {
private:
void requireThatWordsCanBeAddedAndRetrieved();
void requireThatAddWordTriggersChangeOfBuffer();
public:
int Main();
};
void
Test::requireThatWordsCanBeAddedAndRetrieved()
{
std::string w1 = "require";
std::string w2 = "that";
std::string w3 = "words";
WordStore ws;
EntryRef r1 = ws.addWord(w1);
EntryRef r2 = ws.addWord(w2);
EntryRef r3 = ws.addWord(w3);
uint32_t invp = WordStore::RefType::align(1); // Reserved as invalid
uint32_t w1s = w1.size() + 1;
uint32_t w1p = WordStore::RefType::pad(w1s);
uint32_t w2s = w2.size() + 1;
uint32_t w2p = WordStore::RefType::pad(w2s);
EXPECT_EQUAL(invp, WordStore::RefType(r1).offset());
EXPECT_EQUAL(invp + w1s + w1p, WordStore::RefType(r2).offset());
EXPECT_EQUAL(invp + w1s + w1p + w2s + w2p, WordStore::RefType(r3).offset());
EXPECT_EQUAL(0u, WordStore::RefType(r1).bufferId());
EXPECT_EQUAL(0u, WordStore::RefType(r2).bufferId());
EXPECT_EQUAL(0u, WordStore::RefType(r3).bufferId());
EXPECT_EQUAL(std::string("require"), ws.getWord(r1));
EXPECT_EQUAL(std::string("that"), ws.getWord(r2));
EXPECT_EQUAL(std::string("words"), ws.getWord(r3));
}
void
Test::requireThatAddWordTriggersChangeOfBuffer()
{
WordStore ws;
size_t word = 0;
uint32_t lastId = 0;
size_t lastWord = 0;
char wordStr[10];
size_t entrySize = WordStore::RefType::align(6 + 1);
size_t initBufferSpace = 1024u * WordStore::RefType::align(1);
size_t bufferSpace = initBufferSpace;
size_t bufferWords = (bufferSpace - WordStore::RefType::align(1)) /
entrySize;
size_t usedSpace = 0;
size_t sumBufferWords = 0;
for (;;++word) {
sprintf(wordStr, "%6zu", word);
// all words uses 12 bytes (include padding)
EntryRef r = ws.addWord(std::string(wordStr));
EXPECT_EQUAL(std::string(wordStr), ws.getWord(r));
uint32_t bufferId = WordStore::RefType(r).bufferId();
if (bufferId > lastId) {
LOG(info,
"Changed to bufferId %u after %zu words",
bufferId, word);
EXPECT_EQUAL(bufferWords, word - lastWord);
lastId = bufferId;
lastWord = word;
usedSpace += bufferWords * entrySize;
sumBufferWords += bufferWords;
bufferSpace = usedSpace + initBufferSpace;
bufferWords = bufferSpace / entrySize;
}
if (bufferId == 4) {
break;
}
}
// each buffer can have offsetSize / 12 words
EXPECT_EQUAL(sumBufferWords, word);
LOG(info, "Added %zu words in 4 buffers", word);
}
int
Test::Main()
{
TEST_INIT("wordstore_test");
requireThatWordsCanBeAddedAndRetrieved();
requireThatAddWordTriggersChangeOfBuffer();
TEST_DONE();
}
}
}
TEST_APPHOOK(search::memoryindex::Test);
|
