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
|
#include <gtest/gtest.h>
#include "Writer.hpp"
#include "BufferQueue.hpp"
#include "SegmentedStorage.hpp"
#include <chrono>
#include <thread>
#include <vector>
#include <filesystem>
class WriterIntegrationTest : public ::testing::Test
{
protected:
void SetUp() override
{
// Create a temporary directory for test log segments
testDir = "test_logs";
std::filesystem::create_directories(testDir);
logQueue = std::make_unique<BufferQueue>(1024, 4);
// Create a SegmentedStorage instance with reduced sizes for testing
storage = std::make_shared<SegmentedStorage>(
testDir,
"test_logsegment",
1024 * 1024 // Maximum segment size (1 MB for testing)
);
writer = std::make_unique<Writer>(*logQueue, storage);
}
void TearDown() override
{
if (writer)
{
writer->stop();
}
std::filesystem::remove_all(testDir);
}
std::unique_ptr<BufferQueue> logQueue;
std::unique_ptr<Writer> writer;
std::shared_ptr<SegmentedStorage> storage;
std::string testDir;
QueueItem createTestItem(int id)
{
QueueItem item;
item.entry = LogEntry(
LogEntry::ActionType::UPDATE,
"location" + std::to_string(id),
"controller" + std::to_string(id),
"processor" + std::to_string(id),
"subject" + std::to_string(id % 10));
return item;
}
};
// Test basic processing functionality
TEST_F(WriterIntegrationTest, BasicWriteOperation)
{
BufferQueue::ProducerToken producerToken = logQueue->createProducerToken();
const int NUM_ENTRIES = 500;
for (int i = 0; i < NUM_ENTRIES; ++i)
{
ASSERT_TRUE(logQueue->enqueueBlocking(createTestItem(i), producerToken, std::chrono::milliseconds(100)))
<< "Failed to enqueue entry " << i;
}
EXPECT_EQ(logQueue->size(), 500);
writer->start();
std::this_thread::sleep_for(std::chrono::milliseconds(100));
writer->stop();
EXPECT_EQ(logQueue->size(), 0) << "Not all entries were processed";
}
// Test concurrent writing and processing
TEST_F(WriterIntegrationTest, ConcurrentWriteAndProcess)
{
const int NUM_ENTRIES = 1000;
const int NUM_PRODUCERS = 4;
// Function to simulate producers adding log entries
auto producer = [this](int start, int count)
{
BufferQueue::ProducerToken producerToken = logQueue->createProducerToken();
for (int i = start; i < start + count; ++i)
{
// Introduce a small delay to simulate variability
std::this_thread::sleep_for(std::chrono::milliseconds(rand() % 10));
logQueue->enqueueBlocking(createTestItem(i), producerToken, std::chrono::milliseconds(500));
}
};
writer->start();
std::vector<std::thread> producerThreads;
for (int i = 0; i < NUM_PRODUCERS; ++i)
{
producerThreads.emplace_back(producer, i * (NUM_ENTRIES / NUM_PRODUCERS),
NUM_ENTRIES / NUM_PRODUCERS);
}
// Wait for all producer threads to finish
for (auto &t : producerThreads)
{
t.join();
}
// Allow some time for the writer to process the entries
std::this_thread::sleep_for(std::chrono::milliseconds(500));
writer->stop();
EXPECT_EQ(logQueue->size(), 0) << "Not all entries were processed";
}
|