forked from iotaledger/hive.go
/
badger.go
358 lines (289 loc) · 8.79 KB
/
badger.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
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
package badger
import (
"sync"
"github.com/dgraph-io/badger/v2"
"github.com/pkg/errors"
"go.uber.org/atomic"
"github.com/finderAUT/hive.go/v3/byteutils"
"github.com/finderAUT/hive.go/v3/kvstore"
"github.com/finderAUT/hive.go/v3/kvstore/utils"
"github.com/finderAUT/hive.go/v3/types"
)
// badgerStore implements the KVStore interface around a BadgerDB instance.
type badgerStore struct {
instance *badger.DB
closed *atomic.Bool
dbPrefix []byte
}
// New creates a new KVStore with the underlying BadgerDB.
func New(db *badger.DB) kvstore.KVStore {
return &badgerStore{
instance: db,
closed: atomic.NewBool(false),
}
}
func (s *badgerStore) WithRealm(realm kvstore.Realm) (kvstore.KVStore, error) {
if s.closed.Load() {
return nil, kvstore.ErrStoreClosed
}
return &badgerStore{
instance: s.instance,
closed: s.closed,
dbPrefix: realm,
}, nil
}
func (s *badgerStore) Realm() []byte {
return s.dbPrefix
}
// builds a key usable for the badger instance using the realm and the given prefix.
func (s *badgerStore) buildKeyPrefix(prefix kvstore.KeyPrefix) kvstore.KeyPrefix {
return byteutils.ConcatBytes(s.dbPrefix, prefix)
}
// getIterFuncs returns the function pointers for the iteration based on the given settings.
func (s *badgerStore) getIterFuncs(it *badger.Iterator, keyPrefix []byte, iterDirection ...kvstore.IterDirection) (start func(), valid func() bool, move func(), err error) {
startFunc := it.Rewind
validFunc := it.Valid
moveFunc := it.Next
if len(keyPrefix) > 0 {
startFunc = func() {
it.Seek(keyPrefix)
}
validFunc = func() bool {
return it.ValidForPrefix(keyPrefix)
}
}
if kvstore.GetIterDirection(iterDirection...) == kvstore.IterDirectionBackward {
if len(keyPrefix) > 0 {
// we need to search the first item after the prefix
prefixUpperBound := utils.KeyPrefixUpperBound(keyPrefix)
if prefixUpperBound == nil {
return nil, nil, nil, errors.New("no upper bound for prefix")
}
startFunc = func() {
it.Seek(prefixUpperBound)
// if the upper bound exists (not part of the prefix set), we need to use the next entry
if !validFunc() {
moveFunc()
}
}
}
}
return startFunc, validFunc, moveFunc, nil
}
// Iterate iterates over all keys and values with the provided prefix. You can pass kvstore.EmptyPrefix to iterate over all keys and values.
// Optionally the direction for the iteration can be passed (default: IterDirectionForward).
func (s *badgerStore) Iterate(prefix kvstore.KeyPrefix, consumerFunc kvstore.IteratorKeyValueConsumerFunc, iterDirection ...kvstore.IterDirection) error {
if s.closed.Load() {
return kvstore.ErrStoreClosed
}
return s.instance.View(func(txn *badger.Txn) (err error) {
keyPrefix := s.buildKeyPrefix(prefix)
iteratorOptions := badger.DefaultIteratorOptions
iteratorOptions.Prefix = keyPrefix
iteratorOptions.PrefetchValues = true
iteratorOptions.Reverse = kvstore.GetIterDirection(iterDirection...) == kvstore.IterDirectionBackward
it := txn.NewIterator(iteratorOptions)
defer it.Close()
startFunc, validFunc, moveFunc, err := s.getIterFuncs(it, keyPrefix, iterDirection...)
if err != nil {
return err
}
for startFunc(); validFunc(); moveFunc() {
item := it.Item()
value, err := item.ValueCopy(nil)
if err != nil {
panic(err)
}
if !consumerFunc(item.KeyCopy(nil)[len(s.dbPrefix):], value) {
break
}
}
return nil
})
}
// IterateKeys iterates over all keys with the provided prefix. You can pass kvstore.EmptyPrefix to iterate over all keys.
// Optionally the direction for the iteration can be passed (default: IterDirectionForward).
func (s *badgerStore) IterateKeys(prefix kvstore.KeyPrefix, consumerFunc kvstore.IteratorKeyConsumerFunc, iterDirection ...kvstore.IterDirection) error {
if s.closed.Load() {
return kvstore.ErrStoreClosed
}
return s.instance.View(func(txn *badger.Txn) (err error) {
keyPrefix := s.buildKeyPrefix(prefix)
iteratorOptions := badger.DefaultIteratorOptions
iteratorOptions.Prefix = keyPrefix
iteratorOptions.PrefetchValues = false
iteratorOptions.Reverse = kvstore.GetIterDirection(iterDirection...) == kvstore.IterDirectionBackward
it := txn.NewIterator(iteratorOptions)
defer it.Close()
startFunc, validFunc, moveFunc, err := s.getIterFuncs(it, keyPrefix, iterDirection...)
if err != nil {
return err
}
for startFunc(); validFunc(); moveFunc() {
if !consumerFunc(it.Item().KeyCopy(nil)[len(s.dbPrefix):]) {
break
}
}
return nil
})
}
func (s *badgerStore) Clear() error {
if s.closed.Load() {
return kvstore.ErrStoreClosed
}
return s.DeletePrefix(kvstore.EmptyPrefix)
}
func (s *badgerStore) Get(key kvstore.Key) (kvstore.Value, error) {
if s.closed.Load() {
return nil, kvstore.ErrStoreClosed
}
var value []byte
err := s.instance.View(func(txn *badger.Txn) error {
item, err := txn.Get(byteutils.ConcatBytes(s.dbPrefix, key))
if err != nil {
return err
}
value, err = item.ValueCopy(nil)
return err
})
if err == badger.ErrKeyNotFound {
return nil, kvstore.ErrKeyNotFound
}
return value, nil
}
func (s *badgerStore) Set(key kvstore.Key, value kvstore.Value) error {
if s.closed.Load() {
return kvstore.ErrStoreClosed
}
return s.instance.Update(func(txn *badger.Txn) error {
return txn.Set(byteutils.ConcatBytes(s.dbPrefix, key), value)
})
}
func (s *badgerStore) Has(key kvstore.Key) (bool, error) {
if s.closed.Load() {
return false, kvstore.ErrStoreClosed
}
err := s.instance.View(func(txn *badger.Txn) error {
_, err := txn.Get(byteutils.ConcatBytes(s.dbPrefix, key))
return err
})
if err != nil {
if err == badger.ErrKeyNotFound {
return false, nil
}
return false, err
}
return true, nil
}
func (s *badgerStore) Delete(key kvstore.Key) error {
if s.closed.Load() {
return kvstore.ErrStoreClosed
}
err := s.instance.Update(func(txn *badger.Txn) error {
return txn.Delete(byteutils.ConcatBytes(s.dbPrefix, key))
})
if err != nil && err == badger.ErrKeyNotFound {
return kvstore.ErrKeyNotFound
}
return err
}
func (s *badgerStore) DeletePrefix(prefix kvstore.KeyPrefix) error {
if s.closed.Load() {
return kvstore.ErrStoreClosed
}
return s.instance.Update(func(txn *badger.Txn) (err error) {
iteratorOptions := badger.DefaultIteratorOptions
iteratorOptions.Prefix = s.buildKeyPrefix(prefix)
iteratorOptions.PrefetchValues = false
it := txn.NewIterator(iteratorOptions)
defer it.Close()
for it.Rewind(); it.Valid(); it.Next() {
key := it.Item().KeyCopy(nil)
if err := txn.Delete(key); err != nil {
panic(err)
}
}
return nil
})
}
func (s *badgerStore) Flush() error {
if s.closed.Load() {
return kvstore.ErrStoreClosed
}
return s.instance.Sync()
}
func (s *badgerStore) Close() error {
if s.closed.Swap(true) {
// was already closed
return kvstore.ErrStoreClosed
}
return s.instance.Close()
}
func (s *badgerStore) Batched() (kvstore.BatchedMutations, error) {
if s.closed.Load() {
return nil, kvstore.ErrStoreClosed
}
return &batchedMutations{
kvStore: s,
store: s.instance,
dbPrefix: s.dbPrefix,
setOperations: make(map[string]kvstore.Value),
deleteOperations: make(map[string]types.Empty),
closed: s.closed,
}, nil
}
// batchedMutations is a wrapper around a WriteBatch of a BadgerDB.
type batchedMutations struct {
kvStore *badgerStore
store *badger.DB
dbPrefix []byte
setOperations map[string]kvstore.Value
deleteOperations map[string]types.Empty
operationsMutex sync.Mutex
closed *atomic.Bool
}
func (b *batchedMutations) Set(key kvstore.Key, value kvstore.Value) error {
stringKey := byteutils.ConcatBytesToString(b.dbPrefix, key)
b.operationsMutex.Lock()
defer b.operationsMutex.Unlock()
delete(b.deleteOperations, stringKey)
b.setOperations[stringKey] = value
return nil
}
func (b *batchedMutations) Delete(key kvstore.Key) error {
stringKey := byteutils.ConcatBytesToString(b.dbPrefix, key)
b.operationsMutex.Lock()
defer b.operationsMutex.Unlock()
delete(b.setOperations, stringKey)
b.deleteOperations[stringKey] = types.Void
return nil
}
func (b *batchedMutations) Cancel() {
b.operationsMutex.Lock()
defer b.operationsMutex.Unlock()
b.setOperations = make(map[string]kvstore.Value)
b.deleteOperations = make(map[string]types.Empty)
}
func (b *batchedMutations) Commit() error {
if b.closed.Load() {
return kvstore.ErrStoreClosed
}
writeBatch := b.store.NewWriteBatch()
b.operationsMutex.Lock()
defer b.operationsMutex.Unlock()
for key, value := range b.setOperations {
err := writeBatch.Set([]byte(key), value)
if err != nil {
return err
}
}
for key := range b.deleteOperations {
err := writeBatch.Delete([]byte(key))
if err != nil {
return err
}
}
return writeBatch.Flush()
}
var _ kvstore.KVStore = &badgerStore{}
var _ kvstore.BatchedMutations = &batchedMutations{}