forked from rosedblabs/rosedb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdb.go
736 lines (662 loc) · 18.2 KB
/
db.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
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
package rosedb
import (
"encoding/binary"
"errors"
"github.com/flower-corp/rosedb/ds/art"
"github.com/flower-corp/rosedb/ds/zset"
"github.com/flower-corp/rosedb/flock"
"github.com/flower-corp/rosedb/logfile"
"github.com/flower-corp/rosedb/logger"
"github.com/flower-corp/rosedb/util"
"io"
"io/ioutil"
"math"
"os"
"os/signal"
"path/filepath"
"sort"
"strconv"
"strings"
"sync"
"sync/atomic"
"syscall"
"time"
)
var (
// ErrKeyNotFound key not found
ErrKeyNotFound = errors.New("key not found")
// ErrLogFileNotFound log file not found
ErrLogFileNotFound = errors.New("log file not found")
// ErrWrongNumberOfArgs doesn't match key-value pair numbers
ErrWrongNumberOfArgs = errors.New("wrong number of arguments")
// ErrIntegerOverflow overflows int64 limitations
ErrIntegerOverflow = errors.New("increment or decrement overflow")
// ErrWrongValueType value is not a number
ErrWrongValueType = errors.New("value is not an integer")
// ErrWrongIndex index is out of range
ErrWrongIndex = errors.New("index is out of range")
// ErrGCRunning log file gc is running
ErrGCRunning = errors.New("log file gc is running, retry later")
)
const (
logFileTypeNum = 5
encodeHeaderSize = 10
initialListSeq = math.MaxUint32 / 2
discardFilePath = "DISCARD"
lockFileName = "FLOCK"
)
type (
// RoseDB a db instance.
RoseDB struct {
activeLogFiles map[DataType]*logfile.LogFile
archivedLogFiles map[DataType]archivedFiles
fidMap map[DataType][]uint32 // only used at startup, never update even though log files changed.
discards map[DataType]*discard
opts Options
strIndex *strIndex // String indexes(adaptive-radix-tree).
listIndex *listIndex // List indexes.
hashIndex *hashIndex // Hash indexes.
setIndex *setIndex // Set indexes.
zsetIndex *zsetIndex // Sorted set indexes.
mu sync.RWMutex
fileLock *flock.FileLockGuard
closed uint32
gcState int32
}
archivedFiles map[uint32]*logfile.LogFile
valuePos struct {
fid uint32
offset int64
entrySize int
}
strIndex struct {
mu *sync.RWMutex
idxTree *art.AdaptiveRadixTree
}
indexNode struct {
value []byte
fid uint32
offset int64
entrySize int
expiredAt int64
}
listIndex struct {
mu *sync.RWMutex
trees map[string]*art.AdaptiveRadixTree
}
hashIndex struct {
mu *sync.RWMutex
trees map[string]*art.AdaptiveRadixTree
}
setIndex struct {
mu *sync.RWMutex
murhash *util.Murmur128
trees map[string]*art.AdaptiveRadixTree
}
zsetIndex struct {
mu *sync.RWMutex
indexes *zset.SortedSet
murhash *util.Murmur128
trees map[string]*art.AdaptiveRadixTree
}
)
func newStrsIndex() *strIndex {
return &strIndex{idxTree: art.NewART(), mu: new(sync.RWMutex)}
}
func newListIdx() *listIndex {
return &listIndex{trees: make(map[string]*art.AdaptiveRadixTree), mu: new(sync.RWMutex)}
}
func newHashIdx() *hashIndex {
return &hashIndex{trees: make(map[string]*art.AdaptiveRadixTree), mu: new(sync.RWMutex)}
}
func newSetIdx() *setIndex {
return &setIndex{
murhash: util.NewMurmur128(),
trees: make(map[string]*art.AdaptiveRadixTree),
mu: new(sync.RWMutex),
}
}
func newZSetIdx() *zsetIndex {
return &zsetIndex{
indexes: zset.New(),
murhash: util.NewMurmur128(),
trees: make(map[string]*art.AdaptiveRadixTree),
mu: new(sync.RWMutex),
}
}
// Open a rosedb instance. You must call Close after using it.
func Open(opts Options) (*RoseDB, error) {
// create the dir path if not exists.
if !util.PathExist(opts.DBPath) {
if err := os.MkdirAll(opts.DBPath, os.ModePerm); err != nil {
return nil, err
}
}
// acquire file lock to prevent multiple processes from accessing the same directory.
lockPath := filepath.Join(opts.DBPath, lockFileName)
lockGuard, err := flock.AcquireFileLock(lockPath, false)
if err != nil {
return nil, err
}
db := &RoseDB{
activeLogFiles: make(map[DataType]*logfile.LogFile),
archivedLogFiles: make(map[DataType]archivedFiles),
opts: opts,
fileLock: lockGuard,
strIndex: newStrsIndex(),
listIndex: newListIdx(),
hashIndex: newHashIdx(),
setIndex: newSetIdx(),
zsetIndex: newZSetIdx(),
}
// init discard file.
if err := db.initDiscard(); err != nil {
return nil, err
}
// load the log files from disk.
if err := db.loadLogFiles(); err != nil {
return nil, err
}
// load indexes from log files.
if err := db.loadIndexFromLogFiles(); err != nil {
return nil, err
}
// handle log files garbage collection.
go db.handleLogFileGC()
return db, nil
}
// Close db and save relative configs.
func (db *RoseDB) Close() error {
db.mu.Lock()
defer db.mu.Unlock()
if db.fileLock != nil {
_ = db.fileLock.Release()
}
// close and sync the active file.
for _, activeFile := range db.activeLogFiles {
_ = activeFile.Close()
}
// close the archived files.
for _, archived := range db.archivedLogFiles {
for _, file := range archived {
_ = file.Sync()
_ = file.Close()
}
}
// close discard channel.
for _, dis := range db.discards {
dis.closeChan()
}
atomic.StoreUint32(&db.closed, 1)
db.strIndex = nil
db.hashIndex = nil
db.listIndex = nil
db.zsetIndex = nil
db.setIndex = nil
return nil
}
// Sync persist the db files to stable storage.
func (db *RoseDB) Sync() error {
db.mu.Lock()
defer db.mu.Unlock()
// iterate and sync all the active files.
for _, activeFile := range db.activeLogFiles {
if err := activeFile.Sync(); err != nil {
return err
}
}
// sync discard file.
for _, dis := range db.discards {
if err := dis.sync(); err != nil {
return err
}
}
return nil
}
// Backup copies the db directory to the given path for backup.
// It will create the path if it does not exist.
func (db *RoseDB) Backup(path string) error {
// if log file gc is running, can not backuo the db.
if atomic.LoadInt32(&db.gcState) > 0 {
return ErrGCRunning
}
if err := db.Sync(); err != nil {
return err
}
if !util.PathExist(path) {
if err := os.MkdirAll(path, os.ModePerm); err != nil {
return err
}
}
db.mu.Lock()
defer db.mu.Unlock()
return util.CopyDir(db.opts.DBPath, path)
}
// RunLogFileGC run log file garbage collection manually.
func (db *RoseDB) RunLogFileGC(dataType DataType, fid int, gcRatio float64) error {
if atomic.LoadInt32(&db.gcState) > 0 {
return ErrGCRunning
}
return db.doRunGC(dataType, fid, gcRatio)
}
func (db *RoseDB) isClosed() bool {
return atomic.LoadUint32(&db.closed) == 1
}
func (db *RoseDB) getActiveLogFile(dataType DataType) *logfile.LogFile {
db.mu.RLock()
defer db.mu.RUnlock()
return db.activeLogFiles[dataType]
}
func (db *RoseDB) getArchivedLogFile(dataType DataType, fid uint32) *logfile.LogFile {
var lf *logfile.LogFile
db.mu.RLock()
defer db.mu.RUnlock()
if db.archivedLogFiles[dataType] != nil {
lf = db.archivedLogFiles[dataType][fid]
}
return lf
}
// write entry to log file.
func (db *RoseDB) writeLogEntry(ent *logfile.LogEntry, dataType DataType) (*valuePos, error) {
if err := db.initLogFile(dataType); err != nil {
return nil, err
}
activeLogFile := db.getActiveLogFile(dataType)
if activeLogFile == nil {
return nil, ErrLogFileNotFound
}
opts := db.opts
entBuf, esize := logfile.EncodeEntry(ent)
if activeLogFile.WriteAt+int64(esize) > opts.LogFileSizeThreshold {
if err := activeLogFile.Sync(); err != nil {
return nil, err
}
db.mu.Lock()
// save the old log file in archived files.
activeFileId := activeLogFile.Fid
if db.archivedLogFiles[dataType] == nil {
db.archivedLogFiles[dataType] = make(archivedFiles)
}
db.archivedLogFiles[dataType][activeFileId] = activeLogFile
// open a new log file.
ftype, iotype := logfile.FileType(dataType), logfile.IOType(opts.IoType)
lf, err := logfile.OpenLogFile(opts.DBPath, activeFileId+1, opts.LogFileSizeThreshold, ftype, iotype)
if err != nil {
db.mu.Unlock()
return nil, err
}
db.discards[dataType].setTotal(lf.Fid, uint32(opts.LogFileSizeThreshold))
db.activeLogFiles[dataType] = lf
activeLogFile = lf
db.mu.Unlock()
}
writeAt := atomic.LoadInt64(&activeLogFile.WriteAt)
// write entry and sync(if necessary)
if err := activeLogFile.Write(entBuf); err != nil {
return nil, err
}
if opts.Sync {
if err := activeLogFile.Sync(); err != nil {
return nil, err
}
}
return &valuePos{fid: activeLogFile.Fid, offset: writeAt}, nil
}
func (db *RoseDB) loadLogFiles() error {
db.mu.Lock()
defer db.mu.Unlock()
fileInfos, err := ioutil.ReadDir(db.opts.DBPath)
if err != nil {
return err
}
fidMap := make(map[DataType][]uint32)
for _, file := range fileInfos {
if strings.HasPrefix(file.Name(), logfile.FilePrefix) {
splitNames := strings.Split(file.Name(), ".")
fid, err := strconv.Atoi(splitNames[2])
if err != nil {
return err
}
typ := DataType(logfile.FileTypesMap[splitNames[1]])
fidMap[typ] = append(fidMap[typ], uint32(fid))
}
}
db.fidMap = fidMap
for dataType, fids := range fidMap {
if db.archivedLogFiles[dataType] == nil {
db.archivedLogFiles[dataType] = make(archivedFiles)
}
if len(fids) == 0 {
continue
}
// load log file in order.
sort.Slice(fids, func(i, j int) bool {
return fids[i] < fids[j]
})
opts := db.opts
for i, fid := range fids {
ftype, iotype := logfile.FileType(dataType), logfile.IOType(opts.IoType)
lf, err := logfile.OpenLogFile(opts.DBPath, fid, opts.LogFileSizeThreshold, ftype, iotype)
if err != nil {
return err
}
// latest one is active log file.
if i == len(fids)-1 {
db.activeLogFiles[dataType] = lf
} else {
db.archivedLogFiles[dataType][fid] = lf
}
}
}
return nil
}
func (db *RoseDB) initLogFile(dataType DataType) error {
db.mu.Lock()
defer db.mu.Unlock()
if db.activeLogFiles[dataType] != nil {
return nil
}
opts := db.opts
ftype, iotype := logfile.FileType(dataType), logfile.IOType(opts.IoType)
lf, err := logfile.OpenLogFile(opts.DBPath, logfile.InitialLogFileId, opts.LogFileSizeThreshold, ftype, iotype)
if err != nil {
return err
}
db.discards[dataType].setTotal(lf.Fid, uint32(opts.LogFileSizeThreshold))
db.activeLogFiles[dataType] = lf
return nil
}
func (db *RoseDB) initDiscard() error {
discardPath := filepath.Join(db.opts.DBPath, discardFilePath)
if !util.PathExist(discardPath) {
if err := os.MkdirAll(discardPath, os.ModePerm); err != nil {
return err
}
}
discards := make(map[DataType]*discard)
for i := String; i < logFileTypeNum; i++ {
name := logfile.FileNamesMap[logfile.FileType(i)] + discardFileName
dis, err := newDiscard(discardPath, name, db.opts.DiscardBufferSize)
if err != nil {
return err
}
discards[i] = dis
}
db.discards = discards
return nil
}
func (db *RoseDB) encodeKey(key, subKey []byte) []byte {
header := make([]byte, encodeHeaderSize)
var index int
index += binary.PutVarint(header[index:], int64(len(key)))
index += binary.PutVarint(header[index:], int64(len(subKey)))
length := len(key) + len(subKey)
if length > 0 {
buf := make([]byte, length+index)
copy(buf[:index], header[:index])
copy(buf[index:index+len(key)], key)
copy(buf[index+len(key):], subKey)
return buf
}
return header[:index]
}
func (db *RoseDB) decodeKey(key []byte) ([]byte, []byte) {
var index int
keySize, i := binary.Varint(key[index:])
index += i
_, i = binary.Varint(key[index:])
index += i
sep := index + int(keySize)
return key[index:sep], key[sep:]
}
func (db *RoseDB) sendDiscard(oldVal interface{}, updated bool, dataType DataType) {
if !updated || oldVal == nil {
return
}
node, _ := oldVal.(*indexNode)
if node == nil || node.entrySize <= 0 {
return
}
select {
case db.discards[dataType].valChan <- node:
default:
logger.Warn("send to discard chan fail")
}
}
func (db *RoseDB) handleLogFileGC() {
if db.opts.LogFileGCInterval <= 0 {
return
}
quitSig := make(chan os.Signal, 1)
signal.Notify(quitSig, syscall.SIGHUP, syscall.SIGINT, syscall.SIGTERM, syscall.SIGQUIT)
ticker := time.NewTicker(db.opts.LogFileGCInterval)
defer ticker.Stop()
for {
select {
case <-ticker.C:
if atomic.LoadInt32(&db.gcState) > 0 {
logger.Warn("log file gc is running, skip it")
break
}
for dType := String; dType < logFileTypeNum; dType++ {
go func(dataType DataType) {
err := db.doRunGC(dataType, -1, db.opts.LogFileGCRatio)
if err != nil {
logger.Errorf("log file gc err, dataType: [%v], err: [%v]", dataType, err)
}
}(dType)
}
case <-quitSig:
return
}
}
}
func (db *RoseDB) doRunGC(dataType DataType, specifiedFid int, gcRatio float64) error {
atomic.AddInt32(&db.gcState, 1)
defer atomic.AddInt32(&db.gcState, -1)
maybeRewriteStrs := func(fid uint32, offset int64, ent *logfile.LogEntry) error {
db.strIndex.mu.Lock()
defer db.strIndex.mu.Unlock()
indexVal := db.strIndex.idxTree.Get(ent.Key)
if indexVal == nil {
return nil
}
node, _ := indexVal.(*indexNode)
if node != nil && node.fid == fid && node.offset == offset {
// rewrite entry
valuePos, err := db.writeLogEntry(ent, String)
if err != nil {
return err
}
// update index
if err = db.updateIndexTree(db.strIndex.idxTree, ent, valuePos, false, String); err != nil {
return err
}
}
return nil
}
maybeRewriteList := func(fid uint32, offset int64, ent *logfile.LogEntry) error {
db.listIndex.mu.Lock()
defer db.listIndex.mu.Unlock()
var listKey = ent.Key
if ent.Type != logfile.TypeListMeta {
listKey, _ = db.decodeListKey(ent.Key)
}
if db.listIndex.trees[string(listKey)] == nil {
return nil
}
idxTree := db.listIndex.trees[string(listKey)]
indexVal := idxTree.Get(ent.Key)
if indexVal == nil {
return nil
}
node, _ := indexVal.(*indexNode)
if node != nil && node.fid == fid && node.offset == offset {
valuePos, err := db.writeLogEntry(ent, List)
if err != nil {
return err
}
if err = db.updateIndexTree(idxTree, ent, valuePos, false, List); err != nil {
return err
}
}
return nil
}
maybeRewriteHash := func(fid uint32, offset int64, ent *logfile.LogEntry) error {
db.hashIndex.mu.Lock()
defer db.hashIndex.mu.Unlock()
key, field := db.decodeKey(ent.Key)
if db.hashIndex.trees[string(key)] == nil {
return nil
}
idxTree := db.hashIndex.trees[string(key)]
indexVal := idxTree.Get(field)
if indexVal == nil {
return nil
}
node, _ := indexVal.(*indexNode)
if node != nil && node.fid == fid && node.offset == offset {
// rewrite entry
valuePos, err := db.writeLogEntry(ent, Hash)
if err != nil {
return err
}
// update index
entry := &logfile.LogEntry{Key: field, Value: ent.Value}
_, size := logfile.EncodeEntry(ent)
valuePos.entrySize = size
if err = db.updateIndexTree(idxTree, entry, valuePos, false, Hash); err != nil {
return err
}
}
return nil
}
maybeRewriteSets := func(fid uint32, offset int64, ent *logfile.LogEntry) error {
db.setIndex.mu.Lock()
defer db.setIndex.mu.Unlock()
if db.setIndex.trees[string(ent.Key)] == nil {
return nil
}
idxTree := db.setIndex.trees[string(ent.Key)]
if err := db.setIndex.murhash.Write(ent.Value); err != nil {
logger.Fatalf("fail to write murmur hash: %v", err)
}
sum := db.setIndex.murhash.EncodeSum128()
db.setIndex.murhash.Reset()
indexVal := idxTree.Get(sum)
if indexVal == nil {
return nil
}
node, _ := indexVal.(*indexNode)
if node != nil && node.fid == fid && node.offset == offset {
// rewrite entry
valuePos, err := db.writeLogEntry(ent, Set)
if err != nil {
return err
}
// update index
entry := &logfile.LogEntry{Key: sum, Value: ent.Value}
_, size := logfile.EncodeEntry(ent)
valuePos.entrySize = size
if err = db.updateIndexTree(idxTree, entry, valuePos, false, Set); err != nil {
return err
}
}
return nil
}
maybeRewriteZSet := func(fid uint32, offset int64, ent *logfile.LogEntry) error {
db.zsetIndex.mu.Lock()
defer db.zsetIndex.mu.Unlock()
key, _ := db.decodeKey(ent.Key)
if db.zsetIndex.trees[string(key)] == nil {
return nil
}
idxTree := db.zsetIndex.trees[string(key)]
if err := db.zsetIndex.murhash.Write(ent.Value); err != nil {
logger.Fatalf("fail to write murmur hash: %v", err)
}
sum := db.zsetIndex.murhash.EncodeSum128()
db.zsetIndex.murhash.Reset()
indexVal := idxTree.Get(sum)
if indexVal == nil {
return nil
}
node, _ := indexVal.(*indexNode)
if node != nil && node.fid == fid && node.offset == offset {
valuePos, err := db.writeLogEntry(ent, ZSet)
if err != nil {
return err
}
entry := &logfile.LogEntry{Key: sum, Value: ent.Value}
_, size := logfile.EncodeEntry(ent)
valuePos.entrySize = size
if err = db.updateIndexTree(idxTree, entry, valuePos, false, ZSet); err != nil {
return err
}
}
return nil
}
activeLogFile := db.getActiveLogFile(dataType)
if activeLogFile == nil {
return nil
}
if err := db.discards[dataType].sync(); err != nil {
return err
}
ccl, err := db.discards[dataType].getCCL(activeLogFile.Fid, gcRatio)
if err != nil {
return err
}
for _, fid := range ccl {
if specifiedFid >= 0 && uint32(specifiedFid) != fid {
continue
}
archivedFile := db.getArchivedLogFile(dataType, fid)
if archivedFile == nil {
continue
}
var offset int64
for {
ent, size, err := archivedFile.ReadLogEntry(offset)
if err != nil {
if err == io.EOF || err == logfile.ErrEndOfEntry {
break
}
return err
}
var off = offset
offset += size
if ent.Type == logfile.TypeDelete {
continue
}
ts := time.Now().Unix()
if ent.ExpiredAt != 0 && ent.ExpiredAt <= ts {
continue
}
var rewriteErr error
switch dataType {
case String:
rewriteErr = maybeRewriteStrs(archivedFile.Fid, off, ent)
case List:
rewriteErr = maybeRewriteList(archivedFile.Fid, off, ent)
case Hash:
rewriteErr = maybeRewriteHash(archivedFile.Fid, off, ent)
case Set:
rewriteErr = maybeRewriteSets(archivedFile.Fid, off, ent)
case ZSet:
rewriteErr = maybeRewriteZSet(archivedFile.Fid, off, ent)
}
if rewriteErr != nil {
return rewriteErr
}
}
// delete older log file.
db.mu.Lock()
delete(db.archivedLogFiles[dataType], fid)
_ = archivedFile.Delete()
db.mu.Unlock()
// clear discard state.
db.discards[dataType].clear(fid)
}
return nil
}