-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlevel.go
436 lines (377 loc) · 9.79 KB
/
level.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
package db
import (
"fmt"
"io/ioutil"
"math"
"os"
"path/filepath"
"strconv"
"strings"
"sync"
"time"
"github.com/google/uuid"
)
// keyRange represents struct for range of keys
type keyRange struct {
startKey string
endKey string
}
type merge struct {
files []string
keyRange *keyRange
}
type compactReply struct {
files []string
err error
}
// level represents struct for level in lsm tree
type level struct {
level int
capacity int
size int
directory string
merging map[string]struct{}
mergeLock sync.RWMutex
manifest map[string]*keyRange
manifestSync map[string]*keyRange
manifestLock sync.RWMutex
blooms map[string]*bloom
bloomLock sync.RWMutex
compactReqChan chan []*merge
compactReplyChan chan []string
above *level
below *level
fm *fileManager
close chan struct{}
}
// newLevel creates a new level in the lsm tree
func newLevel(numLevel int, directory string, fm *fileManager) (*level, error) {
err := os.MkdirAll(filepath.Join(directory, "L"+strconv.Itoa(numLevel)), dirPerm)
if err != nil {
return nil, err
}
capacity := 0
if numLevel == 0 {
capacity = 2 * MemTableSize
} else {
capacity = int(math.Pow10(numLevel)) * multiplier
}
lvl := &level{
level: numLevel,
capacity: capacity,
size: 0,
directory: filepath.Join(directory, "L"+strconv.Itoa(numLevel)),
merging: make(map[string]struct{}),
manifest: make(map[string]*keyRange),
manifestSync: make(map[string]*keyRange),
blooms: make(map[string]*bloom),
compactReqChan: make(chan []*merge, 16),
compactReplyChan: make(chan []string, 16),
above: nil,
below: nil,
fm: fm,
close: make(chan struct{}),
}
go lvl.run()
err = lvl.Recoverlevel()
if err != nil {
return nil, err
}
return lvl, nil
}
func (level *level) Find(key string, ts uint64) (*Entry, error) {
filenames := level.FindSSTFile(key)
if len(filenames) == 0 {
return nil, newErrKeyNotFound()
}
if len(filenames) == 1 {
return level.fm.Find(filenames[0], key, ts)
}
replyChan := make(chan *Entry)
errChan := make(chan error)
replies := []*Entry{}
var wg sync.WaitGroup
var errs []error
wg.Add(len(filenames))
for _, filename := range filenames {
go func(filename string) {
entry, err := level.fm.Find(filename, key, ts)
if err != nil {
errChan <- err
} else {
replyChan <- entry
}
}(filename)
}
go func() {
for {
select {
case reply := <-replyChan:
replies = append(replies, reply)
wg.Done()
case err := <-errChan:
errs = append(errs, err)
wg.Done()
}
}
}()
wg.Wait()
for _, err := range errs {
switch err.(type) {
case *ErrKeyNotFound:
continue
case *os.PathError:
// If encounter race condition of non existent file, make sure to delete it from manifest
fmt.Println(key, err)
filename := strings.Fields(err.Error())[1]
filename = filename[:len(filename)-1]
err := level.DeleteSSTFiles([]string{filename})
if err != nil {
fmt.Println(err)
}
return level.Find(key, ts)
default:
return nil, err
}
}
if len(replies) > 0 {
var latestUpdate *Entry
for _, entry := range replies {
if latestUpdate == nil {
latestUpdate = entry
} else {
if entry.ts > latestUpdate.ts {
latestUpdate = entry
}
}
}
return latestUpdate, nil
}
return nil, newErrKeyNotFound()
}
func (level *level) getUniqueID() string {
level.manifestLock.RLock()
defer level.manifestLock.RUnlock()
id := uuid.New().String()[:8]
if _, ok := level.manifest[id]; !ok {
return id
}
return level.getUniqueID()
}
// Merge takes an empty or existing file at the current level and merges it with file(s) from the level above
func (level *level) Merge(files []string) ([]string, error) {
if len(files) == 1 {
file := files[0]
info, err := os.Stat(file)
if err != nil {
return nil, err
}
size := int(info.Size())
fileArr := strings.Split(file, "/")
oldFileID := strings.Split(fileArr[len(fileArr)-1], ".")[0]
newFileID := level.getUniqueID()
// Get key range and bloom filter
level.above.manifestLock.RLock()
level.above.bloomLock.RLock()
keyRange := level.above.manifest[oldFileID]
bloom := level.above.blooms[oldFileID]
level.above.manifestLock.RUnlock()
level.above.bloomLock.RUnlock()
level.NewSSTFile(newFileID, keyRange, bloom)
level.size += size
err = os.Rename(file, filepath.Join(level.directory, newFileID+".sst"))
if err != nil {
level.manifestLock.Lock()
delete(level.manifest, newFileID)
level.manifestLock.Unlock()
level.size -= size
return nil, err
}
// Delete old key range and bloom filter
level.above.manifestLock.Lock()
level.above.mergeLock.Lock()
level.above.bloomLock.Lock()
delete(level.above.manifest, oldFileID)
delete(level.above.blooms, oldFileID)
delete(level.above.merging, oldFileID)
level.above.manifestLock.Unlock()
level.above.mergeLock.Unlock()
level.above.bloomLock.Unlock()
return nil, nil
}
entries, err := level.mergeSort(files)
if err != nil {
return nil, err
}
err = level.writeMerge(entries)
if err != nil {
return nil, err
}
return files, nil
}
func (level *level) writeMerge(entries []*Entry) error {
dataBlocks, indexBlock, bloom, keyRange, err := writeEntries(entries)
if err != nil {
return err
}
keyRangeEntry := createkeyRangeEntry(keyRange)
header := createHeader(len(dataBlocks), len(indexBlock), len(bloom.bits), len(keyRangeEntry))
data := append(header, append(append(append(dataBlocks, indexBlock...), bloom.bits...), keyRangeEntry...)...)
fileID := level.getUniqueID()
filename := filepath.Join(level.directory, fileID+".sst")
err = level.fm.Write(filename, data)
if err != nil {
return err
}
level.NewSSTFile(fileID, keyRange, bloom)
level.size += len(data)
return nil
}
// Range gets all files at a specific level whose key range fall within the given range query.
// It then concurrently reads all files and returns the result to the given channel
func (level *level) Range(keyRange *keyRange, ts uint64) (entries []*Entry, err error) {
filenames := level.RangeSSTFiles(keyRange.startKey, keyRange.endKey)
replyChan := make(chan []*Entry)
errChan := make(chan error)
errs := make(map[string]int)
var wg sync.WaitGroup
wg.Add(len(filenames))
for _, filename := range filenames {
go func(filename string) {
entries, err := level.fm.Range(filename, keyRange, ts)
if err != nil {
errChan <- err
} else {
replyChan <- entries
}
}(filename)
}
go func() {
for {
select {
case reply := <-replyChan:
entries = append(entries, reply...)
wg.Done()
case err := <-errChan:
if _, ok := errs[err.Error()]; !ok {
errs[err.Error()] = 1
} else {
errs[err.Error()]++
}
wg.Done()
}
}
}()
wg.Wait()
if len(errs) > 0 {
return entries, fmt.Errorf("Errors during range query on level %d: %v", level.level, errs)
}
return entries, nil
}
// Recoverlevel reads all files at a level's directory and updates all necessary in-memory data for the level.
// In particular, it updates the level's total size, manifest, and bloom filters.
func (level *level) Recoverlevel() error {
entries, err := ioutil.ReadDir(level.directory)
if err != nil {
return err
}
filenames := make(map[string]string)
for _, fileInfo := range entries {
filename := fileInfo.Name()
fileID := strings.Split(filename, ".")[0]
filenames[fileID] = filepath.Join(level.directory, filename)
}
for fileID, filename := range filenames {
keyRange, bloom, size, err := recoverFile(filename)
if err != nil {
return err
}
level.NewSSTFile(fileID, keyRange, bloom)
level.size += size
}
return nil
}
// RecoverTS read data of every single sst file and returns max commit ts found
func (level *level) RecoverTS() (uint64, error) {
maxCommitTs := uint64(0)
level.manifestLock.RLock()
defer level.manifestLock.RUnlock()
for file := range level.manifest {
entries, err := level.fm.MMap(filepath.Join(level.directory, file+".sst"))
if err != nil {
return 0, err
}
for _, entry := range entries {
if entry.ts > maxCommitTs {
maxCommitTs = entry.ts
}
}
}
return maxCommitTs, nil
}
// Close closes all level's operations including merging, compacting, and adding SST files.
func (level *level) Close() {
level.close <- struct{}{}
}
func (level *level) run() {
exceedCapacity := time.NewTicker(1 * time.Second)
for {
select {
case compact := <-level.compactReqChan:
var merged bool
level.manifestLock.RLock()
level.mergeLock.Lock()
for fileID, keyRange := range level.manifest {
if _, ok := level.merging[fileID]; !ok {
merge := &merge{
files: []string{filepath.Join(level.directory, fileID+".sst")},
keyRange: keyRange,
}
merged, compact = mergeInterval(compact, merge)
if merged {
level.merging[fileID] = struct{}{}
}
}
}
level.manifestLock.RUnlock()
level.mergeLock.Unlock()
var wg sync.WaitGroup
for _, merge := range compact {
wg.Add(1)
go func(files []string) {
defer wg.Done()
removeFiles, err := level.Merge(files)
if err != nil {
fmt.Println(err)
} else {
aboveFiles := []string{}
belowFiles := []string{}
for _, file := range removeFiles {
if strings.Contains(file, "L"+strconv.Itoa(level.level)) {
belowFiles = append(belowFiles, file)
} else {
aboveFiles = append(aboveFiles, file)
}
}
level.above.compactReplyChan <- aboveFiles
level.compactReplyChan <- belowFiles
}
}(merge.files)
}
wg.Wait()
case files := <-level.compactReplyChan:
err := level.DeleteSSTFiles(files)
if err != nil {
fmt.Println(err)
}
case <-exceedCapacity.C:
if level.size > level.capacity && level.below != nil {
level.size = 0
compact := level.mergeManifest()
level.below.compactReqChan <- compact
}
case <-level.close:
return
}
}
}