-
Notifications
You must be signed in to change notification settings - Fork 263
/
bench_test.go
309 lines (270 loc) · 7.29 KB
/
bench_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
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
package benchmarks
import (
"fmt"
"math/rand"
"os"
"runtime"
"testing"
"github.com/stretchr/testify/require"
"github.com/cosmos/iavl"
db "github.com/tendermint/tm-db"
)
const historySize = 20
func randBytes(length int) []byte {
key := make([]byte, length)
// math.rand.Read always returns err=nil
// we do not need cryptographic randomness for this test:
//nolint:gosec
rand.Read(key)
return key
}
func prepareTree(b *testing.B, db db.DB, size, keyLen, dataLen int) (*iavl.MutableTree, [][]byte) {
t, err := iavl.NewMutableTreeWithOpts(db, size, nil)
require.NoError(b, err)
keys := make([][]byte, size)
for i := 0; i < size; i++ {
key := randBytes(keyLen)
t.Set(key, randBytes(dataLen))
keys[i] = key
}
commitTree(b, t)
runtime.GC()
return t, keys
}
// commit tree saves a new version and deletes old ones according to historySize
func commitTree(b *testing.B, t *iavl.MutableTree) {
t.Hash()
_, version, err := t.SaveVersion()
if err != nil {
b.Errorf("Can't save: %v", err)
}
if version > historySize {
err = t.DeleteVersion(version - historySize)
if err != nil {
b.Errorf("Can't delete: %v", err)
}
}
}
func runQueries(b *testing.B, t *iavl.MutableTree, keyLen int) {
for i := 0; i < b.N; i++ {
q := randBytes(keyLen)
t.Get(q)
}
}
func runKnownQueries(b *testing.B, t *iavl.MutableTree, keys [][]byte) {
l := int32(len(keys))
for i := 0; i < b.N; i++ {
q := keys[rand.Int31n(l)]
t.Get(q)
}
}
// func runInsert(b *testing.B, t *iavl.MutableTree, keyLen, dataLen, blockSize int) *iavl.MutableTree {
// for i := 1; i <= b.N; i++ {
// t.Set(randBytes(keyLen), randBytes(dataLen))
// if i%blockSize == 0 {
// t.Hash()
// t.SaveVersion()
// }
// }
// return t
// }
func runUpdate(b *testing.B, t *iavl.MutableTree, dataLen, blockSize int, keys [][]byte) *iavl.MutableTree {
l := int32(len(keys))
for i := 1; i <= b.N; i++ {
key := keys[rand.Int31n(l)]
t.Set(key, randBytes(dataLen))
if i%blockSize == 0 {
commitTree(b, t)
}
}
return t
}
// func runDelete(b *testing.B, t *iavl.MutableTree, blockSize int, keys [][]byte) *iavl.MutableTree {
// var key []byte
// l := int32(len(keys))
// for i := 1; i <= b.N; i++ {
// key = keys[rand.Int31n(l)]
// // key = randBytes(16)
// // TODO: test if removed, use more keys (from insert)
// t.Remove(key)
// if i%blockSize == 0 {
// commitTree(b, t)
// }
// }
// return t
// }
// runBlock measures time for an entire block, not just one tx
func runBlock(b *testing.B, t *iavl.MutableTree, keyLen, dataLen, blockSize int, keys [][]byte) *iavl.MutableTree {
l := int32(len(keys))
// XXX: This was adapted to work with VersionedTree but needs to be re-thought.
lastCommit := t
real := t
// check := t
for i := 0; i < b.N; i++ {
for j := 0; j < blockSize; j++ {
// 50% insert, 50% update
var key []byte
if i%2 == 0 {
key = keys[rand.Int31n(l)]
} else {
key = randBytes(keyLen)
}
data := randBytes(dataLen)
// perform query and write on check and then real
// check.Get(key)
// check.Set(key, data)
real.Get(key)
real.Set(key, data)
}
// at the end of a block, move it all along....
commitTree(b, real)
lastCommit = real
}
return lastCommit
}
func BenchmarkRandomBytes(b *testing.B) {
fmt.Printf("%s\n", iavl.GetVersionInfo())
benchmarks := []struct {
length int
}{
{4}, {16}, {32}, {100}, {1000},
}
for _, bench := range benchmarks {
bench := bench
name := fmt.Sprintf("random-%d", bench.length)
b.Run(name, func(b *testing.B) {
for i := 0; i < b.N; i++ {
randBytes(bench.length)
}
runtime.GC()
})
}
}
type benchmark struct {
dbType db.BackendType
initSize, blockSize int
keyLen, dataLen int
}
func BenchmarkMedium(b *testing.B) {
benchmarks := []benchmark{
{"memdb", 100000, 100, 16, 40},
{"goleveldb", 100000, 100, 16, 40},
// FIXME: this crashes on init! Either remove support, or make it work.
// {"cleveldb", 100000, 100, 16, 40},
}
runBenchmarks(b, benchmarks)
}
func BenchmarkSmall(b *testing.B) {
benchmarks := []benchmark{
{"memdb", 1000, 100, 4, 10},
{"goleveldb", 1000, 100, 4, 10},
// FIXME: this crashes on init! Either remove support, or make it work.
// {"cleveldb", 100000, 100, 16, 40},
}
runBenchmarks(b, benchmarks)
}
func BenchmarkLarge(b *testing.B) {
benchmarks := []benchmark{
{"memdb", 1000000, 100, 16, 40},
{"goleveldb", 1000000, 100, 16, 40},
// FIXME: this crashes on init! Either remove support, or make it work.
// {"cleveldb", 100000, 100, 16, 40},
}
runBenchmarks(b, benchmarks)
}
func BenchmarkLevelDBBatchSizes(b *testing.B) {
benchmarks := []benchmark{
{"goleveldb", 100000, 5, 16, 40},
{"goleveldb", 100000, 25, 16, 40},
{"goleveldb", 100000, 100, 16, 40},
{"goleveldb", 100000, 400, 16, 40},
{"goleveldb", 100000, 2000, 16, 40},
}
runBenchmarks(b, benchmarks)
}
// BenchmarkLevelDBLargeData is intended to push disk limits
// in the goleveldb, to make sure not everything is cached
func BenchmarkLevelDBLargeData(b *testing.B) {
benchmarks := []benchmark{
{"goleveldb", 50000, 100, 32, 100},
{"goleveldb", 50000, 100, 32, 1000},
{"goleveldb", 50000, 100, 32, 10000},
{"goleveldb", 50000, 100, 32, 100000},
}
runBenchmarks(b, benchmarks)
}
func runBenchmarks(b *testing.B, benchmarks []benchmark) {
fmt.Printf("%s\n", iavl.GetVersionInfo())
for _, bb := range benchmarks {
bb := bb
prefix := fmt.Sprintf("%s-%d-%d-%d-%d", bb.dbType,
bb.initSize, bb.blockSize, bb.keyLen, bb.dataLen)
// prepare a dir for the db and cleanup afterwards
dirName := fmt.Sprintf("./%s-db", prefix)
defer func() {
err := os.RemoveAll(dirName)
if err != nil {
b.Errorf("%+v\n", err)
}
}()
// note that "" leads to nil backing db!
var (
d db.DB
err error
)
if bb.dbType != "nodb" {
d, err = db.NewDB("test", bb.dbType, dirName)
require.NoError(b, err)
defer d.Close()
}
b.Run(prefix, func(sub *testing.B) {
runSuite(sub, d, bb.initSize, bb.blockSize, bb.keyLen, bb.dataLen)
})
}
}
// returns number of MB in use
func memUseMB() float64 {
var mem runtime.MemStats
runtime.ReadMemStats(&mem)
asize := mem.Alloc
mb := float64(asize) / 1000000
return mb
}
func runSuite(b *testing.B, d db.DB, initSize, blockSize, keyLen, dataLen int) {
// measure mem usage
runtime.GC()
init := memUseMB()
t, keys := prepareTree(b, d, initSize, keyLen, dataLen)
used := memUseMB() - init
fmt.Printf("Init Tree took %0.2f MB\n", used)
b.ResetTimer()
b.Run("query-miss", func(sub *testing.B) {
sub.ReportAllocs()
runQueries(sub, t, keyLen)
})
b.Run("query-hits", func(sub *testing.B) {
sub.ReportAllocs()
runKnownQueries(sub, t, keys)
})
b.Run("update", func(sub *testing.B) {
sub.ReportAllocs()
t = runUpdate(sub, t, dataLen, blockSize, keys)
})
b.Run("block", func(sub *testing.B) {
sub.ReportAllocs()
t = runBlock(sub, t, keyLen, dataLen, blockSize, keys)
})
// both of these edit size of the tree too much
// need to run with their own tree
// t = nil // for gc
// b.Run("insert", func(sub *testing.B) {
// it, _ := prepareTree(d, initSize, keyLen, dataLen)
// sub.ResetTimer()
// runInsert(sub, it, keyLen, dataLen, blockSize)
// })
// b.Run("delete", func(sub *testing.B) {
// dt, dkeys := prepareTree(d, initSize+sub.N, keyLen, dataLen)
// sub.ResetTimer()
// runDelete(sub, dt, blockSize, dkeys)
// })
}