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
|
package clock //nolint:testpackage
import (
"sync"
"testing"
)
func keyValue(key int) int {
return key*1000003 + 7
}
func TestConcurrentStress(t *testing.T) {
t.Parallel()
const (
maxWeight = 512
keys = 400
workers = 8
rounds = 5000
)
cache := New(maxWeight, func(_ int, _ int) uint64 { return 1 })
var wg sync.WaitGroup
for worker := range workers {
wg.Go(func() {
for i := range rounds {
key := (worker*7 + i) % keys
switch i % 4 {
case 0, 1:
cache.Add(key, keyValue(key))
case 2:
if got, ok := cache.Get(key); ok && got != keyValue(key) {
t.Errorf("Get(%d) = %d, want %d", key, got, keyValue(key))
}
case 3:
if got, ok := cache.Peek(key); ok && got != keyValue(key) {
t.Errorf("Peek(%d) = %d, want %d", key, got, keyValue(key))
}
}
}
})
}
wg.Wait()
checkCache(t, cache)
if got := cache.Weight(); got > maxWeight {
t.Fatalf("weight %d exceeds max %d", got, maxWeight)
}
}
func TestReadDuringEviction(t *testing.T) {
t.Parallel()
const (
maxWeight = 8
hot = 64
writers = 2
readers = 6
rounds = 20000
)
cache := New(maxWeight, func(_ int, _ int) uint64 { return 1 })
var wg sync.WaitGroup
for range writers {
wg.Go(func() {
for i := range rounds {
key := i % hot
cache.Add(key, keyValue(key))
}
})
}
for range readers {
wg.Go(func() {
for i := range rounds {
key := i % hot
if got, ok := cache.Get(key); ok && got != keyValue(key) {
t.Errorf("Get(%d) = %d, want %d", key, got, keyValue(key))
}
if got, ok := cache.Peek(key); ok && got != keyValue(key) {
t.Errorf("Peek(%d) = %d, want %d", key, got, keyValue(key))
}
}
})
}
wg.Wait()
checkCache(t, cache)
if got := cache.Weight(); got > maxWeight {
t.Fatalf("weight %d exceeds max %d", got, maxWeight)
}
}
|
