-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathmq_test.go
More file actions
360 lines (311 loc) · 8.31 KB
/
Copy pathmq_test.go
File metadata and controls
360 lines (311 loc) · 8.31 KB
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
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
package mq
import (
"fmt"
"sync"
"testing"
"time"
)
func TestPopAll(t *testing.T) {
// Initialize the message queue
queue, err := NewMessageQueue("test_queue_popall.dat", 1024*1024, 0)
if err != nil {
t.Fatalf("failed to initialize message queue: %v", err)
}
defer queue.Close()
// Test with empty queue
msgs, err := queue.PopAll()
if err != nil {
t.Fatalf("failed to pop all messages: %v", err)
}
if len(msgs) != 0 {
t.Fatalf("expected 0 messages, got %d", len(msgs))
}
// Produce 50 messages
for i := range 50 {
buf := []byte("Message")
msg := &Message{Data: fmt.Appendf(buf, "%d", i)}
if err := queue.Push(msg); err != nil {
t.Fatalf("failed to push message: %v", err)
}
}
// Pop all messages at once
msgs, err = queue.PopAll()
if err != nil {
t.Fatalf("failed to pop all messages: %v", err)
}
if len(msgs) != 50 {
t.Fatalf("expected 50 messages, got %d", len(msgs))
}
// Verify message contents
for i, msg := range msgs {
if string(msg.Data) != fmt.Sprintf("Message%d", i) {
t.Fatalf("message order incorrect, expected: Message %d, got: %s", i, msg.Data)
}
}
// Verify that all messages were consumed
msgs, err = queue.PopAll()
if err != nil {
t.Fatalf("failed to pop all messages: %v", err)
}
if len(msgs) != 0 {
t.Fatalf("expected 0 messages after consuming all, got %d", len(msgs))
}
}
func TestConcurrentReadWrite(t *testing.T) {
// Initialize the message queue
queue, err := NewMessageQueue("test_queue_concurrent.dat", 1024*1024, 0)
if err != nil {
t.Fatalf("failed to initialize message queue: %v", err)
}
defer queue.Close()
// Number of messages to produce/consume
const messageCount = 1000
// Channel to signal completion
done := make(chan bool)
// Producer goroutine
go func() {
for i := range messageCount {
buf := []byte("Message")
msg := &Message{Data: fmt.Appendf(buf, "%d", i)}
if err := queue.Push(msg); err != nil {
t.Errorf("producer: failed to push message: %v", err)
return
}
// Small sleep to make concurrent issues more likely to show up
time.Sleep(time.Millisecond)
}
}()
// Consumer goroutine - using PopAll
go func() {
consumed := 0
for consumed < messageCount {
msgs, err := queue.PopAll()
if err != nil {
t.Errorf("consumer: failed to pop messages: %v", err)
return
}
consumed += len(msgs)
// Small sleep to make concurrent issues more likely to show up
time.Sleep(2 * time.Millisecond)
}
done <- true
}()
// Wait for consumer to finish
select {
case <-done:
// Success case
case <-time.After(10 * time.Second):
t.Fatal("test timed out")
}
}
func TestBasicPushAndPop(t *testing.T) {
queue, err := NewMessageQueue("test_queue_basic.dat", 1024*1024, 0)
if err != nil {
t.Fatalf("failed to create message queue: %v", err)
}
defer queue.Close()
msg1 := &Message{Data: []byte("Hello")}
msg2 := &Message{Data: []byte("World")}
// Write messages
err = queue.Push(msg1)
if err != nil {
t.Fatalf("failed to push message: %v", err)
}
err = queue.Push(msg2)
if err != nil {
t.Fatalf("failed to push message: %v", err)
}
// Read messages
poppedMsg1, err := queue.Pop()
if err != nil {
t.Fatalf("failed to pop message: %v", err)
}
if string(poppedMsg1.Data) != "Hello" {
t.Fatalf("expected 'Hello', got '%s'", string(poppedMsg1.Data))
}
poppedMsg2, err := queue.Pop()
if err != nil {
t.Fatalf("failed to pop message: %v", err)
}
if string(poppedMsg2.Data) != "World" {
t.Fatalf("expected 'World', got '%s'", string(poppedMsg2.Data))
}
}
func TestMessageOrder(t *testing.T) {
queue, err := NewMessageQueue("test_queue_order.dat", 1024*1024, 0)
if err != nil {
t.Fatalf("failed to create message queue: %v", err)
}
defer queue.Close()
messages := []string{"Msg1", "Msg2", "Msg3"}
// Write multiple messages
for _, msg := range messages {
err := queue.Push(&Message{Data: []byte(msg)})
if err != nil {
t.Fatalf("failed to push message: %v", err)
}
}
// Read and verify order
for _, expected := range messages {
msg, err := queue.Pop()
if err != nil {
t.Fatalf("failed to pop message: %v", err)
}
if string(msg.Data) != expected {
t.Fatalf("expected '%s', got '%s'", expected, string(msg.Data))
}
}
}
func TestFrequencyLimit(t *testing.T) {
queue, err := NewMessageQueue("test_queue_freq.dat", 1024*1024, 2) // Consume at most 2 messages per second
if err != nil {
t.Fatalf("failed to create message queue: %v", err)
}
defer queue.Close()
for range 5 {
err := queue.Push(&Message{Data: []byte("Message")})
if err != nil {
t.Fatalf("failed to push message: %v", err)
}
}
start := time.Now()
// Consume 5 messages
for range 5 {
_, err := queue.Pop()
if err != nil {
t.Fatalf("failed to pop message: %v", err)
}
}
elapsed := time.Since(start)
// Expect to consume 5 messages in about 2.5 seconds (since the rate is 2 messages per second)
if elapsed < 2*time.Second || elapsed > 3*time.Second {
t.Fatalf("expected consumption time around 2.5 seconds, got %v", elapsed)
}
}
func TestNoFrequencyLimit(t *testing.T) {
queue, err := NewMessageQueue("test_queue_no_freq.dat", 1024*1024, 0) // No frequency limit
if err != nil {
t.Fatalf("failed to create message queue: %v", err)
}
defer queue.Close()
for range 10 {
err := queue.Push(&Message{Data: []byte("Message")})
if err != nil {
t.Fatalf("failed to push message: %v", err)
}
}
start := time.Now()
// Consume 10 messages
for range 10 {
_, err := queue.Pop()
if err != nil {
t.Fatalf("failed to pop message: %v", err)
}
}
elapsed := time.Since(start)
// Since there is no frequency limit, the expected time is very short
if elapsed > 100*time.Millisecond {
t.Fatalf("expected fast consumption, but got %v", elapsed)
}
}
func TestMultiProducerConsumer(t *testing.T) {
queue, err := NewMessageQueue("test_queue_multi.dat", 1024*1024, 0)
if err != nil {
t.Fatalf("failed to create message queue: %v", err)
}
defer queue.Close()
totalMessages := 100
produced := 0
consumed := 0
var mu sync.Mutex
errCh := make(chan error, 10) // Channel for error transmission
// Multiple producers
producer := func() {
for range totalMessages / 2 {
err := queue.Push(&Message{Data: []byte("Message")})
if err != nil {
errCh <- err
return
}
mu.Lock()
produced++
mu.Unlock()
}
}
// Multiple consumers
consumer := func() {
for {
_, err := queue.Pop()
if err != nil {
errCh <- err
return
}
mu.Lock()
consumed++
mu.Unlock()
}
}
// Start 2 producers and 2 consumers
go producer()
go producer()
go consumer()
go consumer()
// Wait for a while to simulate the production and consumption process
time.Sleep(2 * time.Second)
// Check for errors
select {
case err := <-errCh:
if err != nil {
t.Fatalf("error occurred during test: %v", err)
}
default:
// If no errors, continue to check the production and consumption counts
}
if produced != totalMessages {
t.Fatalf("expected %d messages produced, but got %d", totalMessages, produced)
}
if consumed != totalMessages {
t.Fatalf("expected %d messages consumed, but got %d", totalMessages, consumed)
}
}
func TestDeleteConsumedMessages(t *testing.T) {
// Initialize the message queue
queue, err := NewMessageQueue("test_queue_delete_consumed.dat", 1024*1024, 0)
if err != nil {
t.Fatalf("failed to initialize message queue: %v", err)
}
defer queue.Close()
// Produce 50 messages
for i := range 50 {
buf := []byte("Message")
msg := &Message{Data: fmt.Appendf(buf, "%d", i)}
if err := queue.Push(msg); err != nil {
t.Fatalf("failed to push message: %v", err)
}
}
// Consume the first 30 messages
for i := range 30 {
msg, err := queue.Pop()
if err != nil {
t.Fatalf("failed to pop message: %v", err)
}
if string(msg.Data) != fmt.Sprintf("Message%d", i) {
t.Fatalf("message order incorrect, expected: %d, got: %s", i, msg.Data)
}
}
// Call DeleteConsumedMessages to delete the consumed 30 messages
err = queue.DeleteConsumedMessages()
if err != nil {
t.Fatalf("failed to delete consumed messages: %v", err)
}
// Verify that the remaining messages are correctly retained
for i := 30; i < 50; i++ {
msg, err := queue.Pop()
if err != nil {
t.Fatalf("failed to pop message: %v", err)
}
if string(msg.Data) != fmt.Sprintf("Message%d", i) {
t.Fatalf("message order incorrect, expected: %d, got: %s", i, msg.Data)
}
}
}