-
Notifications
You must be signed in to change notification settings - Fork 0
/
db.go
336 lines (296 loc) · 6.74 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
package pathdb
import (
"bytes"
"compress/zlib"
"context"
"crypto/sha256"
"io"
"io/ioutil"
"reflect"
"regexp"
"strings"
"github.com/zeebo/errs"
"github.com/jtolio/jam/backends"
"github.com/jtolio/jam/blobs"
"github.com/jtolio/jam/manifest"
"github.com/jtolio/jam/pathdb/b"
"github.com/jtolio/jam/streams"
"github.com/jtolio/jam/utils"
)
const versionHeader = "jam-v0\n"
type DB struct {
backend backends.Backend
blobs *blobs.Store
changed bool
// TODO: don't expect the whole manifest to fit into RAM
tree *b.Tree
}
func Open(ctx context.Context, backend backends.Backend, blobStore *blobs.Store, stream io.Reader) (*DB, error) {
db := New(backend, blobStore)
return db, db.load(ctx, stream)
}
func New(backend backends.Backend, blobStore *blobs.Store) *DB {
return &DB{
backend: backend,
blobs: blobStore,
tree: b.TreeNew(strings.Compare),
}
}
func (db *DB) load(ctx context.Context, stream io.Reader) error {
v := make([]byte, len([]byte(versionHeader)))
_, err := io.ReadFull(stream, v)
if err != nil {
if err == io.EOF {
err = errs.Wrap(io.ErrUnexpectedEOF)
}
return err
}
if versionHeader != string(v) {
return errs.New("invalid manifest version")
}
r, err := zlib.NewReader(utils.NewUnframingReader(stream))
if err != nil {
return err
}
defer func() {
err = errs.Combine(err, r.Close())
}()
for {
var page manifest.Page
err := utils.UnmarshalSized(r, &page)
if err != nil {
if err == io.EOF {
break
}
return err
}
if branch := page.GetBranch(); branch != nil {
substream, err := streams.Open(ctx, db.backend, branch)
if err != nil {
return err
}
err = db.load(ctx, substream)
if err != nil {
return err
}
}
if entries := page.GetEntries(); entries != nil {
for _, entry := range entries.Entries {
contentHash := entry.Content.Hash
if len(contentHash) > 0 && len(contentHash) != sha256.Size {
if len(contentHash) != sha256.Size*2 {
return errs.New("unknown hash length")
}
// TODO: sadlol, remove after everything is migrated
entry.Content.Hash = contentHash[len(contentHash)-sha256.Size:]
}
db.tree.Set(string(entry.Path), entry.Content)
}
}
}
return nil
}
func (db *DB) Get(ctx context.Context, path string) (*manifest.Content, error) {
v, ok := db.tree.Get(path)
if !ok {
return nil, nil
}
return v, nil
}
func (db *DB) HasPrefix(ctx context.Context, prefix string) (exists bool, err error) {
it, _ := db.tree.Seek(prefix)
path, _, err := it.Next()
if err != nil {
if err == io.EOF {
return false, nil
}
return false, err
}
return strings.HasPrefix(path, prefix), nil
}
func (db *DB) List(ctx context.Context, prefix string, recursive bool,
cb func(ctx context.Context, path string, content *manifest.Content) error) error {
it, _ := db.tree.Seek(prefix)
for {
path, content, err := it.Next()
if err != nil {
if err == io.EOF {
break
}
return err
}
if !strings.HasPrefix(path, prefix) {
break
}
if !recursive {
if idx := strings.Index(path[len(prefix):], "/"); idx >= 0 {
path = path[:len(prefix)+idx]
err = cb(ctx, path, nil)
if err != nil {
return err
}
it, _ = db.tree.Seek(path + "0") // "0" is the next byte after "/"
continue
}
}
err = cb(ctx, path, content)
if err != nil {
return err
}
}
return nil
}
type PutState int
const (
PutStateNew PutState = 1
PutStateChanged PutState = 2
PutStateUnchanged PutState = 3
)
func (db *DB) Put(ctx context.Context, path string, content *manifest.Content) (state PutState, err error) {
state = PutStateNew
if v, ok := db.tree.Get(path); ok {
if reflect.DeepEqual(v, content) {
return PutStateUnchanged, nil
}
state = PutStateChanged
}
db.tree.Set(path, content)
db.changed = true
return state, nil
}
func (db *DB) Delete(ctx context.Context, path string) (removed bool, err error) {
if _, ok := db.tree.Get(path); !ok {
return false, nil
}
utils.L(ctx).Normalf("deleted path %q", path)
db.tree.Delete(path)
db.changed = true
return true, nil
}
// Rename renames paths using regexp.ReplaceAllString (replacement can have
// regexp expansions). See the docs for regexp.ReplaceAllString
func (db *DB) Rename(ctx context.Context, re *regexp.Regexp, replacement string) (renamed int, err error) {
type element struct {
path string
content *manifest.Content
}
var queue []element
it, err := db.tree.SeekFirst()
if err != nil {
if err == io.EOF {
return 0, nil
}
return 0, err
}
defer it.Close()
for {
path, content, err := it.Next()
if err != nil {
if err == io.EOF {
break
}
return 0, err
}
if re.MatchString(path) {
queue = append(queue, element{path: path, content: content})
}
}
for _, el := range queue {
db.tree.Delete(el.path)
}
for _, el := range queue {
db.tree.Set(re.ReplaceAllString(el.path, replacement), el.content)
}
if len(queue) > 0 {
db.changed = true
}
return len(queue), nil
}
func (db *DB) DeleteAll(ctx context.Context, matcher func(path string) (delete bool)) (removed int, err error) {
var queue []string
it, err := db.tree.SeekFirst()
if err != nil {
if err == io.EOF {
return 0, nil
}
return 0, err
}
defer it.Close()
for {
path, _, err := it.Next()
if err != nil {
if err == io.EOF {
break
}
return 0, err
}
if matcher(path) {
queue = append(queue, path)
}
}
for _, el := range queue {
db.tree.Delete(el)
}
if len(queue) > 0 {
db.changed = true
}
return len(queue), nil
}
func (db *DB) Changed() bool {
return db.changed
}
func (db *DB) SerializeTo(ctx context.Context, destinationPath string) error {
// TODO: don't just dump all of the entries into the root manifest page.
// TODO: even if the whole manifest is in RAM, don't double the RAM usage here
var entries manifest.EntrySet
it, err := db.tree.SeekFirst()
if err != nil {
if err != io.EOF {
return err
}
} else {
defer it.Close()
for {
path, content, err := it.Next()
if err != nil {
if err == io.EOF {
break
}
return err
}
entries.Entries = append(entries.Entries, &manifest.Entry{
Path: []byte(path),
Content: content,
})
}
}
var page manifest.Page
page.Descendents = &manifest.Page_Entries{
Entries: &entries,
}
data, err := utils.MarshalSized(&page)
if err != nil {
return err
}
var out bytes.Buffer
compressor := zlib.NewWriter(&out)
_, err = compressor.Write(data)
if err != nil {
return err
}
err = compressor.Close()
if err != nil {
return err
}
return db.backend.Put(ctx, destinationPath, ioutil.NopCloser(io.MultiReader(
bytes.NewReader([]byte(versionHeader)),
utils.NewFramingReader(&out))))
}
func (db *DB) Close() error {
tree := db.tree
db.tree = nil
if tree != nil {
tree.Close()
}
return nil
}