-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathlog.go
More file actions
618 lines (512 loc) · 13.7 KB
/
log.go
File metadata and controls
618 lines (512 loc) · 13.7 KB
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
package klevdb
import (
"errors"
"fmt"
"os"
"path/filepath"
"sync"
"time"
"github.com/gofrs/flock"
"github.com/klev-dev/klevdb/pkg/index"
"github.com/klev-dev/klevdb/pkg/message"
"github.com/klev-dev/klevdb/pkg/segment"
)
var (
errNoKeyIndex = fmt.Errorf("%w by key", ErrNoIndex)
errKeyNotFound = fmt.Errorf("key %w", message.ErrNotFound)
errNoTimeIndex = fmt.Errorf("%w by time", ErrNoIndex)
errTimeNotFound = fmt.Errorf("time %w", message.ErrNotFound)
errDeleteRelative = fmt.Errorf("%w: delete relative offsets", message.ErrInvalidOffset)
)
// Open opens or creates a [Log] based on a dir and set of options
func Open(dir string, opts Options) (result Log, err error) {
if opts.Rollover <= 0 {
opts.Rollover = 1024 * 1024
}
if opts.Version.NewSegmentsVersion == vUnknown {
opts.Version.NewSegmentsVersion = V2
}
if opts.CreateDirs {
if err := os.MkdirAll(dir, 0700); err != nil {
return nil, fmt.Errorf("open create dirs: %w", err)
}
}
lock := flock.New(filepath.Join(dir, ".lock"))
if opts.Readonly {
switch ok, err := lock.TryRLock(); {
case err != nil:
return nil, fmt.Errorf("open read lock: %w", err)
case !ok:
return nil, fmt.Errorf("open already writing locked")
}
} else {
switch ok, err := lock.TryLock(); {
case err != nil:
return nil, fmt.Errorf("open lock: %w", err)
case !ok:
return nil, fmt.Errorf("open already locked")
}
}
defer func() {
if err != nil {
if lerr := lock.Unlock(); lerr != nil {
err = fmt.Errorf("%w: open release lock: %w", err, lerr)
}
}
}()
params := index.Params{Times: opts.TimeIndex, Keys: opts.KeyIndex}
l := &log{
dir: dir,
opts: opts,
params: params,
lock: lock,
}
segments, err := segment.Find(dir, opts.AutoSync)
if err != nil {
return nil, fmt.Errorf("open find segments: %w", err)
}
switch {
case opts.Readonly && len(segments) == 0:
ix := newReaderIndex(nil, params.Keys, 0, true)
rdr := reopenReader(segment.New(dir, 0, opts.AutoSync), params, opts.Version.NewSegmentsVersion, ix)
l.readers = []*reader{rdr}
case opts.Readonly:
if opts.Check || opts.Recover {
head := segments[len(segments)-1]
if err := head.Check(params); err != nil {
return nil, fmt.Errorf("open check: %w", err)
}
}
for i, seg := range segments {
rdr := openReader(seg, params, opts.Version.NewSegmentsVersion, i == len(segments)-1)
l.readers = append(l.readers, rdr)
}
case len(segments) == 0:
w, err := openWriter(segment.New(dir, 0, opts.AutoSync), params, opts.Version.NewSegmentsVersion, 0)
if err != nil {
return nil, fmt.Errorf("open new writer: %w", err)
}
l.writer = w
l.readers = []*reader{w.reader}
default:
switch {
case opts.Recover:
head := segments[len(segments)-1]
if err := head.Recover(params); err != nil {
return nil, fmt.Errorf("open recover: %w", err)
}
case opts.Check:
head := segments[len(segments)-1]
if err := head.Check(params); err != nil {
return nil, fmt.Errorf("open check: %w", err)
}
}
if opts.Version.EagerVersionMigrate {
for _, seg := range segments {
if err := seg.Migrate(opts.Version.NewSegmentsVersion.messages, opts.Version.NewSegmentsVersion.index, params); err != nil {
return nil, fmt.Errorf("open migrate: %w", err)
}
}
}
head := segments[len(segments)-1]
for _, seg := range segments[:len(segments)-1] {
rdr := openReader(seg, params, opts.Version.NewSegmentsVersion, false)
l.readers = append(l.readers, rdr)
}
wrt, err := openWriter(head, params, opts.Version.NewSegmentsVersion, 0)
if err != nil {
return nil, fmt.Errorf("open writer: %w", err)
}
l.writer = wrt
l.readers = append(l.readers, wrt.reader)
}
return l, nil
}
type log struct {
dir string
opts Options
params index.Params
lock *flock.Flock
writer *writer
writerMu sync.Mutex
readers []*reader
readersMu sync.RWMutex
deleteMu sync.Mutex
}
func (l *log) Publish(msgs []message.Message) (int64, error) {
if l.opts.Readonly {
return OffsetInvalid, ErrReadonly
}
l.writerMu.Lock()
defer l.writerMu.Unlock()
if l.writer.NeedsRollover(l.opts.Rollover) {
oldWriter := l.writer
if err := oldWriter.Sync(); err != nil {
return OffsetInvalid, err
}
oldReader, nextOffset, nextTime := l.writer.ReopenReader()
newWriter, err := openWriter(segment.New(l.dir, nextOffset, l.opts.AutoSync), l.params, l.opts.Version.NewSegmentsVersion, nextTime)
if err != nil {
return OffsetInvalid, err
}
l.readersMu.Lock()
l.readers[len(l.readers)-1] = oldReader
l.writer = newWriter
l.readers = append(l.readers, newWriter.reader)
l.readersMu.Unlock()
if err := oldWriter.Close(); err != nil {
return OffsetInvalid, err
}
}
nextOffset, err := l.writer.Publish(msgs)
if err != nil {
return OffsetInvalid, err
}
if l.opts.AutoSync {
if err := l.writer.Sync(); err != nil {
return OffsetInvalid, err
}
}
return nextOffset, nil
}
func (l *log) NextOffset() (int64, error) {
if l.opts.Readonly {
l.readersMu.RLock()
defer l.readersMu.RUnlock()
rdr := l.readers[len(l.readers)-1]
return rdr.GetNextOffset()
}
l.writerMu.Lock()
defer l.writerMu.Unlock()
return l.writer.GetNextOffset()
}
func (l *log) Consume(offset int64, maxCount int64) (int64, []message.Message, error) {
l.readersMu.RLock()
defer l.readersMu.RUnlock()
rdr, segmentIndex := segment.Consume(l.readers, offset)
nextOffset, msgs, err := rdr.Consume(offset, maxCount)
if err == index.ErrOffsetAfterEnd && segmentIndex < len(l.readers)-1 {
// this is after the end, consume starting the next one
next := l.readers[segmentIndex+1]
return next.Consume(message.OffsetOldest, maxCount)
}
return nextOffset, msgs, err
}
func (l *log) ConsumeByKey(key []byte, offset int64, maxCount int64) (int64, []message.Message, error) {
if !l.opts.KeyIndex {
return OffsetInvalid, nil, errNoKeyIndex
}
hash := index.KeyHashEncoded(index.KeyHash(key))
l.readersMu.RLock()
defer l.readersMu.RUnlock()
rdr, segmentIndex := segment.Consume(l.readers, offset)
for {
nextOffset, msgs, err := rdr.ConsumeByKey(key, hash, offset, maxCount)
if err != nil {
return nextOffset, msgs, err
}
if len(msgs) > 0 {
return nextOffset, msgs, err
}
if segmentIndex >= len(l.readers)-1 {
return nextOffset, msgs, err
}
segmentIndex += 1
rdr = l.readers[segmentIndex]
offset = message.OffsetOldest
}
}
func (l *log) Get(offset int64) (message.Message, error) {
l.readersMu.RLock()
defer l.readersMu.RUnlock()
rdr, segmentIndex, err := segment.Get(l.readers, offset)
if err != nil {
return message.Invalid, err
}
msg, err := rdr.Get(offset)
if err == index.ErrOffsetAfterEnd && segmentIndex < len(l.readers)-1 {
return msg, index.ErrOffsetNotFound
}
return msg, err
}
func (l *log) GetByKey(key []byte) (message.Message, error) {
if !l.opts.KeyIndex {
return message.Invalid, errNoKeyIndex
}
hash := index.KeyHashEncoded(index.KeyHash(key))
tctx := time.Now().UnixMicro()
l.readersMu.RLock()
defer l.readersMu.RUnlock()
for i := len(l.readers) - 1; i >= 0; i-- {
rdr := l.readers[i]
switch msg, err := rdr.GetByKey(key, hash, tctx); err {
case nil:
return msg, nil
case index.ErrKeyNotFound:
// not in this segment, try the rest
default:
return message.Invalid, err
}
}
// not in any segment, so just return the error
return message.Invalid, errKeyNotFound
}
func (l *log) OffsetByKey(key []byte) (int64, error) {
msg, err := l.GetByKey(key)
if err != nil {
return OffsetInvalid, err
}
return msg.Offset, nil
}
func (l *log) GetByTime(start time.Time) (message.Message, error) {
if !l.opts.TimeIndex {
return message.Invalid, errNoTimeIndex
}
ts := start.UnixMicro()
tctx := time.Now().UnixMicro()
l.readersMu.RLock()
defer l.readersMu.RUnlock()
for i := len(l.readers) - 1; i >= 0; i-- {
rdr := l.readers[i]
switch msg, err := rdr.GetByTime(ts, tctx); err {
case nil:
return msg, nil
case index.ErrTimeBeforeStart:
// not in this segment, try the rest
if i == 0 {
return rdr.Get(message.OffsetOldest)
}
case index.ErrTimeAfterEnd:
// time is between end of this and begin next
if i < len(l.readers)-1 {
nextRdr := l.readers[i+1]
return nextRdr.Get(message.OffsetOldest)
}
return message.Invalid, errTimeNotFound
default:
return message.Invalid, err
}
}
return message.Invalid, errTimeNotFound
}
func (l *log) OffsetByTime(start time.Time) (int64, time.Time, error) {
msg, err := l.GetByTime(start)
if err != nil {
return OffsetInvalid, time.Time{}, err
}
return msg.Offset, msg.Time, nil
}
func (l *log) Delete(offsets map[int64]struct{}) (map[int64]struct{}, int64, error) {
if l.opts.Readonly {
return nil, 0, ErrReadonly
}
if len(offsets) == 0 {
return nil, 0, nil
}
l.deleteMu.Lock()
defer l.deleteMu.Unlock()
return l.delete(offsets)
}
func (l *log) delete(offsets map[int64]struct{}) (map[int64]struct{}, int64, error) {
rdr, err := l.findDeleteReader(offsets)
if err != nil {
return nil, 0, err
}
wasWriter := false
l.writerMu.Lock()
if l.writer.reader == rdr {
wasWriter = true
if err := l.writer.Sync(); err != nil {
l.writerMu.Unlock()
return nil, 0, err
}
}
l.writerMu.Unlock()
mversion := l.opts.Version.NewSegmentsVersion.messages
iversion := l.opts.Version.NewSegmentsVersion.index
if l.opts.Version.KeepRewriteVersion {
var detected message.Version
if wasWriter {
detected = l.writer.messages.Version()
} else {
mr, err := message.OpenReader(rdr.segment.Log, rdr.segment.Offset)
if err != nil {
return nil, 0, err
}
detected = mr.Version()
if err := mr.Close(); err != nil {
return nil, 0, err
}
}
switch detected {
case message.V1:
mversion, iversion = message.V1, index.V1
case message.V2:
mversion, iversion = message.V2, index.V2
}
}
rs, err := rdr.segment.Rewrite(offsets, l.params, mversion, iversion)
if err != nil {
return nil, 0, err
}
if len(rs.DeletedOffsets) == 0 {
// deleted nothing, just remove rewrite files
return nil, 0, rs.Remove()
}
// check if we are deleting in the writing segment
l.writerMu.Lock()
if l.writer.reader == rdr {
defer l.writerMu.Unlock()
l.readersMu.Lock()
defer l.readersMu.Unlock()
newWriter, newReader, err := l.writer.Delete(rs)
switch {
case err == errSegmentChanged:
return nil, 0, nil
case err != nil:
return nil, 0, err
}
l.writer = newWriter
if newReader == nil {
l.readers[len(l.readers)-1] = newWriter.reader
} else {
l.readers[len(l.readers)-1] = newReader
l.readers = append(l.readers, newWriter.reader)
}
return rs.DeletedOffsets, rs.DeletedSize, nil
}
l.writerMu.Unlock()
if wasWriter {
// A writing segment transformed into a reader, retry deleting
if err := rs.Remove(); err != nil {
return nil, 0, err
}
return l.delete(offsets)
}
// we are deleting in a reader segment
l.readersMu.Lock()
defer l.readersMu.Unlock()
newReader, err := rdr.Delete(rs)
if err != nil {
return nil, 0, err
}
var newReaders []*reader
for _, r := range l.readers {
if r.segment == rdr.segment {
if newReader != nil {
newReaders = append(newReaders, newReader)
}
} else {
newReaders = append(newReaders, r)
}
}
l.readers = newReaders
return rs.DeletedOffsets, rs.DeletedSize, nil
}
func (l *log) findDeleteReader(offsets map[int64]struct{}) (*reader, error) {
lowestOffset := message.MinOffset(offsets)
if lowestOffset < 0 {
return nil, errDeleteRelative
}
l.readersMu.RLock()
defer l.readersMu.RUnlock()
rdr, _, err := segment.Get(l.readers, lowestOffset)
return rdr, err
}
func (l *log) Size(m message.Message) int64 {
return message.Size(m, l.opts.Version.NewSegmentsVersion.messages) + l.params.Size()
}
func (l *log) Stat() (segment.Stats, error) {
l.readersMu.RLock()
defer l.readersMu.RUnlock()
if l.opts.Readonly && len(l.readers) == 1 {
segStats, err := l.readers[0].Stat()
if err != nil && errors.Is(err, os.ErrNotExist) {
return segment.Stats{}, nil
}
return segStats, err
}
stats := segment.Stats{}
for _, reader := range l.readers {
segStats, err := reader.Stat()
if err != nil {
return segment.Stats{}, err
}
stats.Segments += segStats.Segments
stats.Messages += segStats.Messages
stats.Size += segStats.Size
}
return stats, nil
}
func (l *log) Backup(dir string) error {
l.readersMu.RLock()
defer l.readersMu.RUnlock()
if l.opts.Readonly && len(l.readers) == 1 {
err := l.readers[0].Backup(dir)
if err != nil && errors.Is(err, os.ErrNotExist) {
return nil
}
return err
}
for _, reader := range l.readers {
if err := reader.Backup(dir); err != nil {
return err
}
}
return nil
}
func (l *log) Sync() (int64, error) {
if l.opts.Readonly {
l.readersMu.RLock()
defer l.readersMu.RUnlock()
rdr := l.readers[len(l.readers)-1]
return rdr.GetNextOffset()
}
l.writerMu.Lock()
defer l.writerMu.Unlock()
if err := l.writer.Sync(); err != nil {
return OffsetInvalid, err
}
return l.writer.GetNextOffset()
}
func (l *log) GC(unusedFor time.Duration) error {
l.readersMu.RLock()
defer l.readersMu.RUnlock()
for _, reader := range l.readers {
if err := reader.GC(unusedFor); err != nil {
return err
}
}
return nil
}
func (l *log) Close() error {
if l.opts.Readonly {
l.readersMu.Lock()
defer l.readersMu.Unlock()
for _, reader := range l.readers {
if err := reader.Close(); err != nil {
return err
}
}
} else {
l.writerMu.Lock()
defer l.writerMu.Unlock()
l.readersMu.Lock()
defer l.readersMu.Unlock()
if err := l.writer.Sync(); err != nil {
return err
}
if err := l.writer.Close(); err != nil {
return err
}
for _, reader := range l.readers[:len(l.readers)-1] {
if err := reader.Close(); err != nil {
return err
}
}
}
if err := l.lock.Unlock(); err != nil {
return fmt.Errorf("close unlock: %w", err)
}
return nil
}