-
Notifications
You must be signed in to change notification settings - Fork 2
/
plru_test.go
157 lines (144 loc) · 2.71 KB
/
plru_test.go
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
package plru
import (
"math/rand"
"testing"
"time"
gen "github.com/pingcap/go-ycsb/pkg/generator"
)
func init() {
rand.Seed(time.Now().Unix())
}
func TestHas(t *testing.T) {
p := NewPolicy(128)
p.Hit(1)
p.Hit(64)
if p.Has(0) || !p.Has(1) || !p.Has(64) {
t.Fatal("Hit or Has not working")
}
}
func TestHit(t *testing.T) {
p := NewPolicy(129)
if p.Has(0) {
t.Fatal("Has not working")
}
p.Hit(0)
if !p.Has(0) {
t.Fatal("Hit not working")
}
p.Hit(120)
if !p.Has(120) {
t.Fatal("Hit not working")
}
}
func TestDel(t *testing.T) {
p := NewPolicy(64)
p.Hit(1)
p.Hit(2)
p.Del(1)
if p.Has(1) {
t.Fatal("Clear not working")
}
if !p.Has(2) {
t.Fatal("Clear other bit")
}
}
func TestEvict(t *testing.T) {
p := NewPolicy(128)
for i := 0; i < 128; i++ {
victim := p.Evict()
if p.Has(victim) {
t.Fatal("Evict returning used block")
}
p.Hit(p.Evict())
}
defer func() {
if r := recover(); r == nil {
t.Fatal("lookup should panic")
}
}()
lookup(3)
}
const (
benchPolicySize = 1e6
)
func benchAccess() (bits [benchPolicySize]uint64) {
z := gen.NewScrambledZipfian(0, benchPolicySize-1, gen.ZipfianConstant)
r := rand.New(rand.NewSource(time.Now().UnixNano()))
for i := 0; i < benchPolicySize; i++ {
bits[i] = uint64(z.Next(r))
}
return
}
func BenchmarkHas(b *testing.B) {
a := benchAccess()
b.Run("single", func(b *testing.B) {
b.SetBytes(1)
p := NewPolicy(benchPolicySize)
for n := 0; n < b.N; n++ {
p.Has(a[n%benchPolicySize])
}
})
b.Run("concurrent", func(b *testing.B) {
b.SetBytes(1)
p := NewPolicy(benchPolicySize)
b.RunParallel(func(pb *testing.PB) {
for n := 0; pb.Next(); n++ {
p.Has(a[n%benchPolicySize])
}
})
})
}
func BenchmarkHit(b *testing.B) {
b.Run("single", func(b *testing.B) {
b.SetBytes(1)
p := NewPolicy(benchPolicySize)
for n := 0; n < b.N; n++ {
p.Hit(1)
}
})
b.Run("concurrent", func(b *testing.B) {
b.SetBytes(1)
p := NewPolicy(benchPolicySize)
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
p.Hit(1)
}
})
})
}
func BenchmarkClear(b *testing.B) {
b.Run("single", func(b *testing.B) {
b.SetBytes(1)
p := NewPolicy(benchPolicySize)
for n := 0; n < b.N; n++ {
p.Del(1)
}
})
b.Run("concurrent", func(b *testing.B) {
b.SetBytes(1)
p := NewPolicy(benchPolicySize)
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
p.Del(1)
}
})
})
}
func BenchmarkEvict(b *testing.B) {
b.Run("single", func(b *testing.B) {
b.SetBytes(1)
p := NewPolicy(benchPolicySize)
for n := 0; n < b.N; n++ {
p.Evict()
}
})
b.Run("concurrent", func(b *testing.B) {
b.SetBytes(1)
p := NewPolicy(benchPolicySize)
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
p.Evict()
}
})
})
}