-
Notifications
You must be signed in to change notification settings - Fork 42
/
storage.go
272 lines (229 loc) · 5.4 KB
/
storage.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
package mem
import (
"encoding/binary"
"fmt"
"io"
"os"
"path/filepath"
"time"
"github.com/deepfabric/beehive/util"
)
// Storage memory storage
type Storage struct {
kv *util.KVTree
}
// NewStorage returns a mem data storage
func NewStorage() *Storage {
return &Storage{
kv: util.NewKVTree(),
}
}
// Set put the key, value pair to the storage
func (s *Storage) Set(key []byte, value []byte) error {
return s.SetWithTTL(key, value, 0)
}
// SetWithTTL put the key, value pair to the storage with a ttl in seconds
func (s *Storage) SetWithTTL(key []byte, value []byte, ttl int32) error {
s.kv.Put(key, value)
if ttl > 0 {
after := time.Second * time.Duration(ttl)
util.DefaultTimeoutWheel().Schedule(after, func(arg interface{}) {
s.Delete(arg.([]byte))
}, key)
}
return nil
}
// BatchSet batch set
func (s *Storage) BatchSet(pairs ...[]byte) error {
if len(pairs)%2 != 0 {
return fmt.Errorf("invalid args len: %d", len(pairs))
}
for i := 0; i < len(pairs)/2; i++ {
s.Set(pairs[2*i], pairs[2*i+1])
}
return nil
}
// Get returns the value of the key
func (s *Storage) Get(key []byte) ([]byte, error) {
v := s.kv.Get(key)
return v, nil
}
// MGet returns multi values
func (s *Storage) MGet(keys ...[]byte) ([][]byte, error) {
var values [][]byte
for _, key := range keys {
values = append(values, s.kv.Get(key))
}
return values, nil
}
// Delete remove the key from the storage
func (s *Storage) Delete(key []byte) error {
s.kv.Delete(key)
return nil
}
// BatchDelete batch delete
func (s *Storage) BatchDelete(keys ...[]byte) error {
for _, key := range keys {
s.kv.Delete(key)
}
return nil
}
// RangeDelete remove data in [start,end)
func (s *Storage) RangeDelete(start, end []byte) error {
s.kv.RangeDelete(start, end)
return nil
}
// Scan scans the key-value paire in [start, end), and perform with a handler function, if the function
// returns false, the scan will be terminated, if the `pooledKey` is true, raftstore will call `Free` when
// scan completed.
func (s *Storage) Scan(start, end []byte, handler func(key, value []byte) (bool, error), pooledKey bool) error {
return s.kv.Scan(start, end, handler)
}
// Free free the pooled bytes
func (s *Storage) Free(pooled []byte) {
}
// SplitCheck Find a key from [start, end), so that the sum of bytes of the value of [start, key) <=size,
// returns the current bytes in [start,end), and the founded key
func (s *Storage) SplitCheck(start []byte, end []byte, size uint64) (uint64, []byte, error) {
total := uint64(0)
found := false
var splitKey []byte
s.kv.Scan(start, end, func(key, value []byte) (bool, error) {
total += uint64(len(key) + len(value))
if !found && total >= size {
found = true
splitKey = key
}
return true, nil
})
return total, splitKey, nil
}
// Seek returns the first key-value that >= key
func (s *Storage) Seek(key []byte) ([]byte, []byte, error) {
k, v := s.kv.Seek(key)
return k, v, nil
}
// Write write the data in batch
func (s *Storage) Write(wb *util.WriteBatch, sync bool) error {
if len(wb.Ops) == 0 {
return nil
}
for idx, op := range wb.Ops {
switch op {
case util.OpDelete:
s.Delete(wb.Keys[idx])
case util.OpSet:
s.SetWithTTL(wb.Keys[idx], wb.Values[idx], wb.TTLs[idx])
}
}
return nil
}
// CreateSnapshot create a snapshot file under the giving path
func (s *Storage) CreateSnapshot(path string, start, end []byte) error {
err := os.MkdirAll(path, os.ModeDir)
if err != nil {
return err
}
f, err := os.Create(filepath.Join(path, "db.data"))
if err != nil {
return err
}
defer f.Close()
err = writeBytes(f, start)
if err != nil {
return err
}
err = writeBytes(f, end)
if err != nil {
return err
}
return s.kv.Scan(start, end, func(key, value []byte) (bool, error) {
err := writeBytes(f, key)
if err != nil {
return false, err
}
err = writeBytes(f, value)
if err != nil {
return false, err
}
return true, nil
})
}
// ApplySnapshot apply a snapshort file from giving path
func (s *Storage) ApplySnapshot(path string) error {
f, err := os.Open(filepath.Join(path, "db.data"))
if err != nil {
return err
}
defer f.Close()
start, err := readBytes(f)
if err != nil {
return err
}
if len(start) == 0 {
return fmt.Errorf("error format, missing start field")
}
end, err := readBytes(f)
if err != nil {
return err
}
if len(end) == 0 {
return fmt.Errorf("error format, missing end field")
}
s.kv.RangeDelete(start, end)
for {
key, err := readBytes(f)
if err != nil {
return err
}
if len(key) == 0 {
break
}
value, err := readBytes(f)
if err != nil {
return err
}
if len(value) == 0 {
return fmt.Errorf("error format, missing value field")
}
s.kv.Put(key, value)
}
return nil
}
// Close close the storage
func (s *Storage) Close() error {
return nil
}
func writeBytes(f *os.File, data []byte) error {
size := make([]byte, 4)
binary.BigEndian.PutUint32(size, uint32(len(data)))
_, err := f.Write(size)
if err != nil {
return err
}
_, err = f.Write(data)
if err != nil {
return err
}
return nil
}
func readBytes(f *os.File) ([]byte, error) {
size := make([]byte, 4)
n, err := f.Read(size)
if n == 0 && err == io.EOF {
return nil, nil
}
total := int(binary.BigEndian.Uint32(size))
written := 0
data := make([]byte, total, total)
for {
n, err = f.Read(data[written:])
if err != nil && err != io.EOF {
return nil, err
}
written += n
if written == total {
return data, nil
}
}
}