forked from alemic/qdo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
db_util.go
85 lines (74 loc) · 1.94 KB
/
db_util.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
// Copyright (c) 2012, Suryandaru Triandana <syndtr@gmail.com>
// All rights reserved.
//
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
package leveldb
import (
"github.com/borgenk/qdo/third_party/github.com/syndtr/goleveldb/leveldb/iterator"
"github.com/borgenk/qdo/third_party/github.com/syndtr/goleveldb/leveldb/opt"
"github.com/borgenk/qdo/third_party/github.com/syndtr/goleveldb/leveldb/storage"
)
// Reader is the interface that wraps basic Get and NewIterator methods.
// This interface implemented by both DB and Snapshot.
type Reader interface {
Get(key []byte, ro *opt.ReadOptions) (value []byte, err error)
NewIterator(ro *opt.ReadOptions) iterator.Iterator
}
// Range is a key range.
type Range struct {
// Start of the key range, include in the range.
Start []byte
// Limit of the key range, not include in the range.
Limit []byte
}
type Sizes []uint64
// Sum returns sum of the sizes.
func (p Sizes) Sum() (n uint64) {
for _, s := range p {
n += s
}
return n
}
// Remove unused files.
func (d *DB) cleanFiles() error {
s := d.s
v := s.version_NB()
tables := make(map[uint64]struct{})
for _, tt := range v.tables {
for _, t := range tt {
tables[t.file.Num()] = struct{}{}
}
}
ff, err := s.getFiles(storage.TypeAll)
if err != nil {
return err
}
var rem []storage.File
for _, f := range ff {
keep := true
switch f.Type() {
case storage.TypeManifest:
keep = f.Num() >= s.manifestFile.Num()
case storage.TypeJournal:
if d.frozenJournalFile != nil {
keep = f.Num() >= d.frozenJournalFile.Num()
} else {
keep = f.Num() >= d.journalFile.Num()
}
case storage.TypeTable:
_, keep = tables[f.Num()]
}
if !keep {
rem = append(rem, f)
}
}
s.logf("db@janitor F·%d G·%d", len(ff), len(rem))
for _, f := range rem {
s.logf("db@janitor removing %s-%d", f.Type(), f.Num())
if err := f.Remove(); err != nil {
return err
}
}
return nil
}