|
| 1 | +package memiavl |
| 2 | + |
| 3 | +import ( |
| 4 | + "bytes" |
| 5 | + "encoding/binary" |
| 6 | + "math/rand" |
| 7 | + "sort" |
| 8 | + "testing" |
| 9 | + |
| 10 | + iavlcache "github.com/cosmos/iavl/cache" |
| 11 | + "github.com/stretchr/testify/require" |
| 12 | + "github.com/tidwall/btree" |
| 13 | +) |
| 14 | + |
| 15 | +func BenchmarkByteCompare(b *testing.B) { |
| 16 | + var x, y [32]byte |
| 17 | + for i := 0; i < b.N; i++ { |
| 18 | + _ = bytes.Compare(x[:], y[:]) |
| 19 | + } |
| 20 | +} |
| 21 | + |
| 22 | +func BenchmarkRandomGet(b *testing.B) { |
| 23 | + amount := 1000000 |
| 24 | + items := genRandItems(amount) |
| 25 | + targetKey := items[500].key |
| 26 | + targetValue := items[500].value |
| 27 | + targetItem := itemT{key: targetKey} |
| 28 | + |
| 29 | + tree := New(0) |
| 30 | + for _, item := range items { |
| 31 | + tree.set(item.key, item.value) |
| 32 | + } |
| 33 | + |
| 34 | + snapshotDir := b.TempDir() |
| 35 | + err := tree.WriteSnapshot(snapshotDir) |
| 36 | + require.NoError(b, err) |
| 37 | + snapshot, err := OpenSnapshot(snapshotDir) |
| 38 | + require.NoError(b, err) |
| 39 | + defer snapshot.Close() |
| 40 | + |
| 41 | + b.Run("memiavl", func(b *testing.B) { |
| 42 | + require.Equal(b, targetValue, tree.Get(targetKey)) |
| 43 | + |
| 44 | + b.ResetTimer() |
| 45 | + for i := 0; i < b.N; i++ { |
| 46 | + _ = tree.Get(targetKey) |
| 47 | + } |
| 48 | + }) |
| 49 | + b.Run("memiavl-disk", func(b *testing.B) { |
| 50 | + diskTree := NewFromSnapshot(snapshot, true, 0) |
| 51 | + require.Equal(b, targetValue, diskTree.Get(targetKey)) |
| 52 | + |
| 53 | + b.ResetTimer() |
| 54 | + for i := 0; i < b.N; i++ { |
| 55 | + _ = diskTree.Get(targetKey) |
| 56 | + } |
| 57 | + }) |
| 58 | + b.Run("memiavl-disk-cache-hit", func(b *testing.B) { |
| 59 | + diskTree := NewFromSnapshot(snapshot, true, 1) |
| 60 | + require.Equal(b, targetValue, diskTree.Get(targetKey)) |
| 61 | + |
| 62 | + b.ResetTimer() |
| 63 | + for i := 0; i < b.N; i++ { |
| 64 | + _ = diskTree.Get(targetKey) |
| 65 | + } |
| 66 | + }) |
| 67 | + b.Run("memiavl-disk-cache-miss", func(b *testing.B) { |
| 68 | + diskTree := NewFromSnapshot(snapshot, true, 0) |
| 69 | + // enforce an empty cache to emulate cache miss |
| 70 | + diskTree.cache = iavlcache.New(0) |
| 71 | + require.Equal(b, targetValue, diskTree.Get(targetKey)) |
| 72 | + |
| 73 | + b.ResetTimer() |
| 74 | + for i := 0; i < b.N; i++ { |
| 75 | + _ = diskTree.Get(targetKey) |
| 76 | + } |
| 77 | + }) |
| 78 | + b.Run("btree-degree-2", func(b *testing.B) { |
| 79 | + bt2 := btree.NewBTreeGOptions(lessG, btree.Options{ |
| 80 | + NoLocks: true, |
| 81 | + Degree: 2, |
| 82 | + }) |
| 83 | + for _, item := range items { |
| 84 | + bt2.Set(item) |
| 85 | + } |
| 86 | + v, _ := bt2.Get(targetItem) |
| 87 | + require.Equal(b, targetValue, v.value) |
| 88 | + |
| 89 | + b.ResetTimer() |
| 90 | + for i := 0; i < b.N; i++ { |
| 91 | + _, _ = bt2.Get(targetItem) |
| 92 | + } |
| 93 | + }) |
| 94 | + b.Run("btree-degree-32", func(b *testing.B) { |
| 95 | + bt32 := btree.NewBTreeGOptions(lessG, btree.Options{ |
| 96 | + NoLocks: true, |
| 97 | + Degree: 32, |
| 98 | + }) |
| 99 | + for _, item := range items { |
| 100 | + bt32.Set(item) |
| 101 | + } |
| 102 | + v, _ := bt32.Get(targetItem) |
| 103 | + require.Equal(b, targetValue, v.value) |
| 104 | + |
| 105 | + b.ResetTimer() |
| 106 | + for i := 0; i < b.N; i++ { |
| 107 | + _, _ = bt32.Get(targetItem) |
| 108 | + } |
| 109 | + }) |
| 110 | + b.Run("iavl-lru", func(b *testing.B) { |
| 111 | + cache := iavlcache.New(amount) |
| 112 | + for _, item := range items { |
| 113 | + cache.Add(NewIavlCacheNode(item.key, item.value)) |
| 114 | + } |
| 115 | + v := cache.Get(targetItem.key).(iavlCacheNode).value |
| 116 | + require.Equal(b, targetValue, v) |
| 117 | + |
| 118 | + b.ResetTimer() |
| 119 | + for i := 0; i < b.N; i++ { |
| 120 | + _ = cache.Get(targetKey).(iavlCacheNode).value |
| 121 | + } |
| 122 | + }) |
| 123 | + b.Run("go-map", func(b *testing.B) { |
| 124 | + m := make(map[string][]byte, amount) |
| 125 | + for _, item := range items { |
| 126 | + m[string(item.key)] = item.value |
| 127 | + } |
| 128 | + v := m[string(targetItem.key)] |
| 129 | + require.Equal(b, targetValue, v) |
| 130 | + |
| 131 | + b.ResetTimer() |
| 132 | + for i := 0; i < b.N; i++ { |
| 133 | + _ = m[string(targetKey)] |
| 134 | + } |
| 135 | + }) |
| 136 | + |
| 137 | + b.Run("binary-search", func(b *testing.B) { |
| 138 | + // the last benchmark sort the items in place |
| 139 | + sort.Slice(items, func(i, j int) bool { |
| 140 | + return bytes.Compare(items[i].key, items[j].key) < 0 |
| 141 | + }) |
| 142 | + cmp := func(i int) bool { return bytes.Compare(items[i].key, targetKey) != -1 } |
| 143 | + i := sort.Search(len(items), cmp) |
| 144 | + require.Equal(b, targetValue, items[i].value) |
| 145 | + |
| 146 | + b.ResetTimer() |
| 147 | + for i := 0; i < b.N; i++ { |
| 148 | + n := sort.Search(len(items), cmp) |
| 149 | + _ = items[n].value |
| 150 | + } |
| 151 | + }) |
| 152 | +} |
| 153 | + |
| 154 | +func BenchmarkRandomSet(b *testing.B) { |
| 155 | + items := genRandItems(1000000) |
| 156 | + b.ResetTimer() |
| 157 | + b.Run("memiavl", func(b *testing.B) { |
| 158 | + for i := 0; i < b.N; i++ { |
| 159 | + tree := New(0) |
| 160 | + for _, item := range items { |
| 161 | + tree.set(item.key, item.value) |
| 162 | + } |
| 163 | + } |
| 164 | + }) |
| 165 | + b.Run("tree2", func(b *testing.B) { |
| 166 | + for i := 0; i < b.N; i++ { |
| 167 | + bt := btree.NewBTreeGOptions(lessG, btree.Options{ |
| 168 | + NoLocks: true, |
| 169 | + Degree: 2, |
| 170 | + }) |
| 171 | + for _, item := range items { |
| 172 | + bt.Set(item) |
| 173 | + } |
| 174 | + } |
| 175 | + }) |
| 176 | + b.Run("tree32", func(b *testing.B) { |
| 177 | + for i := 0; i < b.N; i++ { |
| 178 | + bt := btree.NewBTreeGOptions(lessG, btree.Options{ |
| 179 | + NoLocks: true, |
| 180 | + Degree: 32, |
| 181 | + }) |
| 182 | + for _, item := range items { |
| 183 | + bt.Set(item) |
| 184 | + } |
| 185 | + } |
| 186 | + }) |
| 187 | +} |
| 188 | + |
| 189 | +type itemT struct { |
| 190 | + key, value []byte |
| 191 | +} |
| 192 | + |
| 193 | +func lessG(a, b itemT) bool { |
| 194 | + return bytes.Compare(a.key, b.key) == -1 |
| 195 | +} |
| 196 | + |
| 197 | +func int64ToItemT(n uint64) itemT { |
| 198 | + var key, value [8]byte |
| 199 | + binary.BigEndian.PutUint64(key[:], n) |
| 200 | + binary.LittleEndian.PutUint64(value[:], n) |
| 201 | + return itemT{ |
| 202 | + key: key[:], |
| 203 | + value: value[:], |
| 204 | + } |
| 205 | +} |
| 206 | + |
| 207 | +func genRandItems(n int) []itemT { |
| 208 | + r := rand.New(rand.NewSource(0)) |
| 209 | + items := make([]itemT, n) |
| 210 | + itemsM := make(map[uint64]bool) |
| 211 | + for i := 0; i < n; i++ { |
| 212 | + for { |
| 213 | + key := uint64(r.Int63n(10000000000000000)) |
| 214 | + if !itemsM[key] { |
| 215 | + itemsM[key] = true |
| 216 | + items[i] = int64ToItemT(key) |
| 217 | + break |
| 218 | + } |
| 219 | + } |
| 220 | + } |
| 221 | + return items |
| 222 | +} |
| 223 | + |
| 224 | +type iavlCacheNode struct { |
| 225 | + key []byte |
| 226 | + value []byte |
| 227 | +} |
| 228 | + |
| 229 | +func NewIavlCacheNode(key, value []byte) iavlCacheNode { |
| 230 | + return iavlCacheNode{key, value} |
| 231 | +} |
| 232 | + |
| 233 | +func (n iavlCacheNode) GetKey() []byte { |
| 234 | + return n.key |
| 235 | +} |
| 236 | + |
| 237 | +func (n iavlCacheNode) GetCacheKey() []byte { |
| 238 | + return n.key |
| 239 | +} |
0 commit comments