forked from ipfs/go-ds-badger
-
Notifications
You must be signed in to change notification settings - Fork 0
/
datastore.go
228 lines (184 loc) · 4.29 KB
/
datastore.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
package badger
import (
badger "github.com/dgraph-io/badger"
ds "github.com/ipfs/go-datastore"
dsq "github.com/ipfs/go-datastore/query"
goprocess "github.com/jbenet/goprocess"
)
type datastore struct {
DB *badger.DB
}
// Options are the badger datastore options, reexported here for convenience.
type Options badger.Options
var DefaultOptions Options = Options(badger.DefaultOptions)
// NewDatastore creates a new badger datastore.
//
// DO NOT set the Dir and/or ValuePath fields of opt, they will be set for you.
func NewDatastore(path string, options *Options) (*datastore, error) {
// Copy the options because we modify them.
var opt badger.Options
if options == nil {
opt = badger.DefaultOptions
} else {
opt = badger.Options(*options)
}
opt.Dir = path
opt.ValueDir = path
kv, err := badger.Open(opt)
if err != nil {
return nil, err
}
return &datastore{
DB: kv,
}, nil
}
func (d *datastore) Put(key ds.Key, value interface{}) error {
val, ok := value.([]byte)
if !ok {
return ds.ErrInvalidType
}
txn := d.DB.NewTransaction(true)
defer txn.Discard()
err := txn.Set(key.Bytes(), val, 0)
if err != nil {
return err
}
//TODO: Setting callback may potentially make this faster
return txn.Commit(nil)
}
func (d *datastore) Get(key ds.Key) (value interface{}, err error) {
txn := d.DB.NewTransaction(false)
defer txn.Discard()
item, err := txn.Get(key.Bytes())
if err == badger.ErrKeyNotFound {
err = ds.ErrNotFound
}
if err != nil {
return nil, err
}
val, err := item.Value()
if err != nil {
return nil, err
}
out := make([]byte, len(val))
copy(out, val)
return out, nil
}
func (d *datastore) Has(key ds.Key) (bool, error) {
txn := d.DB.NewTransaction(false)
defer txn.Discard()
_, err := txn.Get(key.Bytes())
if err == badger.ErrKeyNotFound {
return false, nil
}
if err != nil {
return false, err
}
return true, nil
}
func (d *datastore) Delete(key ds.Key) error {
txn := d.DB.NewTransaction(true)
defer txn.Discard()
err := txn.Delete(key.Bytes())
if err != nil {
return err
}
//TODO: callback may potentially make this faster
return txn.Commit(nil)
}
func (d *datastore) Query(q dsq.Query) (dsq.Results, error) {
return d.QueryNew(q)
}
func (d *datastore) QueryNew(q dsq.Query) (dsq.Results, error) {
prefix := []byte(q.Prefix)
opt := badger.DefaultIteratorOptions
opt.PrefetchValues = !q.KeysOnly
txn := d.DB.NewTransaction(false)
it := txn.NewIterator(opt)
it.Seek([]byte(q.Prefix))
if q.Offset > 0 {
for j := 0; j < q.Offset; j++ {
it.Next()
}
}
qrb := dsq.NewResultBuilder(q)
qrb.Process.Go(func(worker goprocess.Process) {
defer txn.Discard()
defer it.Close()
for sent := 0; it.ValidForPrefix(prefix); sent++ {
if qrb.Query.Limit > 0 && sent >= qrb.Query.Limit {
break
}
item := it.Item()
k := string(item.Key())
e := dsq.Entry{Key: k}
var result dsq.Result
if !q.KeysOnly {
b, err := item.Value()
if err != nil {
result = dsq.Result{Error: err}
} else {
bytes := make([]byte, len(b))
copy(bytes, b)
e.Value = bytes
result = dsq.Result{Entry: e}
}
} else {
result = dsq.Result{Entry: e}
}
select {
case qrb.Output <- result:
case <-worker.Closing(): // client told us to close early
return
}
it.Next()
}
return
})
go qrb.Process.CloseAfterChildren()
// Now, apply remaining things (filters, order)
qr := qrb.Results()
for _, f := range q.Filters {
qr = dsq.NaiveFilter(qr, f)
}
for _, o := range q.Orders {
qr = dsq.NaiveOrder(qr, o)
}
return qr, nil
}
func (d *datastore) Close() error {
return d.DB.Close()
}
func (d *datastore) IsThreadSafe() {}
type badgerBatch struct {
db *badger.DB
txn *badger.Txn
}
func (d *datastore) Batch() (ds.Batch, error) {
return &badgerBatch{
db: d.DB,
txn: d.DB.NewTransaction(true),
}, nil
}
func (b *badgerBatch) Put(key ds.Key, value interface{}) error {
val, ok := value.([]byte)
if !ok {
return ds.ErrInvalidType
}
err := b.txn.Set(key.Bytes(), val, 0)
if err != nil {
b.txn.Discard()
}
return err
}
func (b *badgerBatch) Delete(key ds.Key) error {
err := b.txn.Delete(key.Bytes())
if err != nil {
b.txn.Discard()
}
return err
}
func (b *badgerBatch) Commit() error {
//TODO: Setting callback may potentially make this faster
return b.txn.Commit(nil)
}