/
mapdb.go
221 lines (176 loc) · 5.87 KB
/
mapdb.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
// Package mapdb provides a map implementation of a key value store.
// It offers a lightweight drop-in replacement of hive.go/kvstore for tests or in simulations
// where more than one instance is required.
package mapdb
import (
"sync"
"github.com/loveandpeople/hive.go/byteutils"
"github.com/loveandpeople/hive.go/kvstore"
"github.com/loveandpeople/hive.go/types"
)
// mapDB is a simple implementation of KVStore using a map.
type mapDB struct {
m *syncedKVMap
realm []byte
accessCallback kvstore.AccessCallback
accessCallbackCommandsFilter kvstore.Command
}
// NewMapDB creates a kvstore.KVStore implementation purely based on a go map.
func NewMapDB() kvstore.KVStore {
return &mapDB{
m: &syncedKVMap{m: make(map[string][]byte)},
}
}
// AccessCallback configures the store to pass all requests to the KVStore to the given callback.
// This can for example be used for debugging and to examine what the KVStore is doing.
func (s *mapDB) AccessCallback(callback kvstore.AccessCallback, commandsFilter ...kvstore.Command) {
var accessCallbackCommandsFilter kvstore.Command
if len(commandsFilter) == 0 {
accessCallbackCommandsFilter = kvstore.AllCommands
} else {
for _, filterCommand := range commandsFilter {
accessCallbackCommandsFilter |= filterCommand
}
}
s.accessCallback = callback
s.accessCallbackCommandsFilter = accessCallbackCommandsFilter
}
func (s *mapDB) WithRealm(realm kvstore.Realm) kvstore.KVStore {
return &mapDB{
m: s.m, // use the same underlying map
realm: realm,
}
}
func (s *mapDB) Realm() kvstore.Realm {
return byteutils.ConcatBytes(s.realm)
}
// Shutdown marks the store as shutdown.
func (s *mapDB) Shutdown() {
if s.accessCallback != nil {
s.accessCallback(kvstore.ShutdownCommand)
}
}
func (s *mapDB) Iterate(prefix kvstore.KeyPrefix, consumerFunc kvstore.IteratorKeyValueConsumerFunc) error {
if s.accessCallback != nil && s.accessCallbackCommandsFilter.HasBits(kvstore.IterateCommand) {
s.accessCallback(kvstore.IterateCommand, prefix)
}
s.m.iterate(s.realm, prefix, consumerFunc)
return nil
}
func (s *mapDB) IterateKeys(prefix kvstore.KeyPrefix, consumerFunc kvstore.IteratorKeyConsumerFunc) error {
if s.accessCallback != nil && s.accessCallbackCommandsFilter.HasBits(kvstore.IterateKeysCommand) {
s.accessCallback(kvstore.IterateKeysCommand, prefix)
}
s.m.iterateKeys(s.realm, prefix, consumerFunc)
return nil
}
func (s *mapDB) Clear() error {
if s.accessCallback != nil && s.accessCallbackCommandsFilter.HasBits(kvstore.ClearCommand) {
s.accessCallback(kvstore.ClearCommand)
}
s.m.deletePrefix(s.realm)
return nil
}
func (s *mapDB) Get(key kvstore.Key) (kvstore.Value, error) {
if s.accessCallback != nil && s.accessCallbackCommandsFilter.HasBits(kvstore.GetCommand) {
s.accessCallback(kvstore.GetCommand, key)
}
value, contains := s.m.get(byteutils.ConcatBytes(s.realm, key))
if !contains {
return nil, kvstore.ErrKeyNotFound
}
return value, nil
}
func (s *mapDB) Set(key kvstore.Key, value kvstore.Value) error {
if s.accessCallback != nil && s.accessCallbackCommandsFilter.HasBits(kvstore.SetCommand) {
s.accessCallback(kvstore.SetCommand, key, value)
}
s.m.set(byteutils.ConcatBytes(s.realm, key), value)
return nil
}
func (s *mapDB) Has(key kvstore.Key) (bool, error) {
if s.accessCallback != nil && s.accessCallbackCommandsFilter.HasBits(kvstore.HasCommand) {
s.accessCallback(kvstore.HasCommand, key)
}
contains := s.m.has(byteutils.ConcatBytes(s.realm, key))
return contains, nil
}
func (s *mapDB) Delete(key kvstore.Key) error {
if s.accessCallback != nil && s.accessCallbackCommandsFilter.HasBits(kvstore.DeleteCommand) {
s.accessCallback(kvstore.DeleteCommand, key)
}
s.m.delete(byteutils.ConcatBytes(s.realm, key))
return nil
}
func (s *mapDB) DeletePrefix(prefix kvstore.KeyPrefix) error {
if s.accessCallback != nil && s.accessCallbackCommandsFilter.HasBits(kvstore.DeletePrefixCommand) {
s.accessCallback(kvstore.DeletePrefixCommand, prefix)
}
s.m.deletePrefix(byteutils.ConcatBytes(s.realm, prefix))
return nil
}
func (s *mapDB) Batched() kvstore.BatchedMutations {
return &batchedMutations{
kvStore: s,
setOperations: make(map[string]kvstore.Value),
deleteOperations: make(map[string]types.Empty),
}
}
type kvtuple struct {
key kvstore.Key
value kvstore.Value
}
// batchedMutations is a wrapper to do a batched update on a mapDB.
type batchedMutations struct {
sync.Mutex
kvStore *mapDB
setOperations map[string]kvstore.Value
deleteOperations map[string]types.Empty
sets []kvtuple
deletes []kvtuple
}
func (b *batchedMutations) Set(key kvstore.Key, value kvstore.Value) error {
if b.kvStore.accessCallback != nil && b.kvStore.accessCallbackCommandsFilter.HasBits(kvstore.SetCommand) {
b.kvStore.accessCallback(kvstore.SetCommand, key, value)
}
stringKey := byteutils.ConcatBytesToString(key)
b.Lock()
defer b.Unlock()
delete(b.deleteOperations, stringKey)
b.setOperations[stringKey] = value
return nil
}
func (b *batchedMutations) Delete(key kvstore.Key) error {
if b.kvStore.accessCallback != nil && b.kvStore.accessCallbackCommandsFilter.HasBits(kvstore.DeleteCommand) {
b.kvStore.accessCallback(kvstore.DeleteCommand, key)
}
stringKey := byteutils.ConcatBytesToString(key)
b.Lock()
defer b.Unlock()
delete(b.setOperations, stringKey)
b.deleteOperations[stringKey] = types.Void
return nil
}
func (b *batchedMutations) Cancel() {
b.Lock()
defer b.Unlock()
b.setOperations = make(map[string]kvstore.Value)
b.deleteOperations = make(map[string]types.Empty)
}
func (b *batchedMutations) Commit() error {
b.Lock()
defer b.Unlock()
for key, value := range b.setOperations {
err := b.kvStore.Set([]byte(key), value)
if err != nil {
return err
}
}
for key := range b.deleteOperations {
err := b.kvStore.Delete([]byte(key))
if err != nil {
return err
}
}
return nil
}