-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathwal.go
More file actions
776 lines (657 loc) · 19.6 KB
/
wal.go
File metadata and controls
776 lines (657 loc) · 19.6 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
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
package wal
import (
"bufio"
"encoding/binary"
"errors"
"fmt"
"io"
"log"
"os"
"path/filepath"
"sort"
"strings"
"sync"
"time"
)
/*
WAL (Write-Ahead Log) Format:
Each segment file consists of a sequence of binary encoded entries.
+-------------------+-------------------+-------------------+----------------------+-------------------+
| CRC32 (4 bytes) | Size (8 bytes) | SeqID (8 bytes) | Payload (N bytes) | Size (8 bytes) |
+-------------------+-------------------+-------------------+----------------------+-------------------+
| Checksum of Data | Length of Payload | Monotonic ID | The actual data | Backward Pointer |
+-------------------+-------------------+-------------------+----------------------+-------------------+
- CRC (Cyclic Redundancy Check): Ensures data integrity.
- Size (Header): Enable fast forward reading.
- SeqID: Global Sequence ID
- Payload: The actual data.
- Size (Footer): Enable fast reverse reading (Startup Optimization).
*/
const (
// Size of various components in the WAL entry header
crcSize = 4
sizeSize = 8
seqIDSize = 8
headerSize = crcSize + sizeSize + seqIDSize
footerSize = sizeSize // New Footer
)
var (
ErrInvalidCRC = errors.New("wal: invalid crc, data corruption detected")
)
// WAL: Write-Ahead Log structure
type WAL struct {
mu sync.RWMutex // Ensures thread safety
dir string // Directory to store WAL files
bufferSize int // Size of the write buffer
segmentSize int64 // Max size of each segment file, soft limit not hard limit
segmentPrefix string // Prefix for segment file names
activeSegment *Segment // Current active segment for writing
segments []*Segment // List of closed segment files
syncStrategy SyncStrategy // Sync strategy
stopSync chan struct{} // Channel to stop background sync
wg sync.WaitGroup // WaitGroup for background sync
lastSeqID uint64 // Track the global sequence ID
bufPool sync.Pool
}
// Segment: Represents a physical file
type Segment struct {
idx uint64 // Number of the segment (0, 1, 2...)
path string // Path to the file
file *os.File // File descriptor (Active only)
writer *bufio.Writer // Buffered writer (Active only)
size int64 // Current size of the file
startID uint64 // The first SeqID in this segment
}
type segmentFile struct {
name string
idx uint64
}
// Open: Initialize and recover data
func Open(dir string, cfg *Config) (*WAL, error) {
// Ensure WAL directory exists
if err := os.MkdirAll(dir, PermMkdir); err != nil {
return nil, err
}
// Load default config values if not set
if cfg == nil {
cfg = &DefaultConfig
}
cfg.SetDefault()
// Initialize WAL structure
wal := WAL{
dir: dir,
bufferSize: cfg.BufferSize,
segmentSize: cfg.SegmentSize,
segmentPrefix: cfg.SegmentPrefix,
syncStrategy: cfg.SyncStrategy,
stopSync: make(chan struct{}),
bufPool: sync.Pool{
New: func() interface{} {
// Allocate buffer for Header + Payload + Footer
return make([]byte, 4*KB+headerSize+footerSize)
},
},
}
// Load existing segments from disk for recovery
if err := wal.loadSegments(); err != nil {
return nil, err
}
// Only run background sync if not SyncStrategyAlways
if wal.syncStrategy != SyncStrategyAlways {
wal.wg.Add(1)
go wal.backgroundSync(time.Duration(cfg.SyncInterval) * time.Millisecond)
}
return &wal, nil
}
// loadSegments: Load existing segments from disk during startup
func (w *WAL) loadSegments() error {
// List all files in the WAL directory
entries, err := os.ReadDir(w.dir)
if err != nil {
return err
}
// Parse the filename and index it into a temporary struct
var segFiles []segmentFile
for _, e := range entries {
if strings.HasPrefix(e.Name(), fmt.Sprintf("%s-", w.segmentPrefix)) &&
strings.HasSuffix(e.Name(), ".wal") {
// Parse ID from file name
var idx uint64
cleanName := strings.TrimPrefix(e.Name(), w.segmentPrefix+"-")
cleanName = strings.TrimSuffix(cleanName, ".wal")
// Scan integer number
if _, err := fmt.Sscanf(cleanName, "%d", &idx); err == nil {
segFiles = append(segFiles, segmentFile{name: e.Name(), idx: idx})
}
}
}
// Sort by Index (Integer Sort)
sort.Slice(segFiles, func(i, j int) bool {
return segFiles[i].idx < segFiles[j].idx
})
// If no segment files exist, create the first one
if len(segFiles) == 0 {
return w.createActiveSegment(0)
}
for i, fileObj := range segFiles {
path := filepath.Join(w.dir, fileObj.name)
f, err := os.OpenFile(path, os.O_RDWR|os.O_APPEND, PermFileOpen)
if err != nil {
return err
}
stat, err := f.Stat()
if err != nil {
return err
}
// Read the first block to get StartID
var startID uint64 = 0
if stat.Size() >= int64(headerSize) {
header := make([]byte, headerSize)
if _, err := f.ReadAt(header, 0); err == nil {
startID = binary.BigEndian.Uint64(header[crcSize+sizeSize : headerSize])
}
}
seg := &Segment{
idx: fileObj.idx,
path: path,
file: f,
size: stat.Size(),
startID: startID,
}
// If it's the last file, set as active
if i == len(segFiles)-1 {
// Seek to the end of the file
if _, err := f.Seek(0, io.SeekEnd); err != nil {
return err
}
seg.writer = bufio.NewWriterSize(f, w.bufferSize)
w.activeSegment = seg
// Important: Repair the last file if corrupted due to crash
if err := w.repairActiveSegment(); err != nil {
return err
}
} else {
// Close old segment files
f.Close()
w.segments = append(w.segments, seg)
}
}
// SPECIAL CASE: If active segment is empty (newly rotated before crash),
// we need to find lastSeqID from the previous closed segment.
if w.activeSegment.size == 0 && len(w.segments) > 0 {
lastClosedSeg := w.segments[len(w.segments)-1]
lastID, err := w.scanSegmentForLastID(lastClosedSeg.path)
if err != nil {
return fmt.Errorf("failed to recover SeqID from previous segment: %v", err)
}
w.lastSeqID = lastID
}
// Ensure active segment has correct StartID if it was empty/new
if w.activeSegment.startID == 0 {
w.activeSegment.startID = w.lastSeqID + 1
}
return nil
}
// scanSegmentForLastID reads a closed segment to find the highest SeqID.
// This is only called once at startup if the active segment is empty.
func (w *WAL) scanSegmentForLastID(path string) (uint64, error) {
f, err := os.Open(path)
if err != nil {
return 0, err
}
defer f.Close()
// 1. Reverse Check
stat, err := f.Stat()
if err != nil {
return 0, err
}
fileSize := stat.Size()
if fileSize >= int64(headerSize+footerSize) {
// Read last 8 bytes (Footer)
footer := make([]byte, footerSize)
if _, err := f.ReadAt(footer, fileSize-int64(footerSize)); err == nil {
lastPayloadSize := binary.BigEndian.Uint64(footer)
// Calculate the start of the last record
recordSize := int64(headerSize) + int64(lastPayloadSize) + int64(footerSize)
if fileSize >= recordSize {
// Read Header
header := make([]byte, headerSize)
if _, err := f.ReadAt(header, fileSize-recordSize); err == nil {
seqID := binary.BigEndian.Uint64(header[crcSize+sizeSize : headerSize])
// Ideally we should verify CRC here too, but for simplicity we assume closed segments are valid
return seqID, nil
}
}
}
}
// 2. Sequential Fallback
if _, err := f.Seek(0, io.SeekStart); err != nil {
return 0, err
}
reader := bufio.NewReader(f)
var lastID uint64
for {
header := make([]byte, headerSize)
if _, err := io.ReadFull(reader, header); err != nil {
if err == io.EOF {
break
}
return 0, err
}
size := binary.BigEndian.Uint64(header[crcSize : crcSize+sizeSize])
seqID := binary.BigEndian.Uint64(header[crcSize+sizeSize : headerSize])
lastID = seqID
// Skip payload AND footer
if _, err := reader.Discard(int(size) + footerSize); err != nil {
return 0, err
}
}
return lastID, nil
}
// repairActiveSegment: Repair the active segment file if corrupted using Reverse Scan.
func (w *WAL) repairActiveSegment() error {
f := w.activeSegment.file
stat, err := f.Stat()
if err != nil {
return err
}
fileSize := stat.Size()
if fileSize == 0 {
w.activeSegment.size = 0
w.lastSeqID = 0 // Will be fixed by loadSegments if previous segments exist
return nil
}
// 1. Reverse Recovery
if fileSize >= int64(headerSize+footerSize) {
// Read Footer (Last 8 bytes)
footer := make([]byte, footerSize)
if _, err := f.ReadAt(footer, fileSize-int64(footerSize)); err == nil {
payloadSize := binary.BigEndian.Uint64(footer)
totalRecordSize := int64(headerSize) + int64(payloadSize) + int64(footerSize)
if fileSize >= totalRecordSize {
// Jump back to the start of this record
offset := fileSize - totalRecordSize
// Read Header + Payload
data := make([]byte, headerSize+int64(payloadSize))
if _, err := f.ReadAt(data, offset); err == nil {
// Parse Header
readCrc := binary.BigEndian.Uint32(data[:crcSize])
size := binary.BigEndian.Uint64(data[crcSize : crcSize+sizeSize])
seqID := binary.BigEndian.Uint64(data[crcSize+sizeSize : headerSize])
if size == payloadSize {
// Verify CRC
verifyBuf := make([]byte, sizeSize+seqIDSize+int(payloadSize))
binary.BigEndian.PutUint64(verifyBuf[:sizeSize], size)
binary.BigEndian.PutUint64(verifyBuf[sizeSize:sizeSize+seqIDSize], seqID)
copy(verifyBuf[sizeSize+seqIDSize:], data[headerSize:])
if calculateCRC(verifyBuf) == readCrc {
// SUCCESS: The last record is valid.
// No truncation needed.
w.activeSegment.size = fileSize
w.activeSegment.writer = bufio.NewWriterSize(f, w.bufferSize)
w.lastSeqID = seqID
log.Printf("WAL: Startup optimized. Verified last record at offset %d (SeqID: %d)", offset, seqID)
return nil
}
}
}
}
}
}
// 2. Fallback: Sequential repair
log.Println("WAL: Fast startup failed or corruption detected. Falling back to sequential repair...")
if _, err := f.Seek(0, io.SeekStart); err != nil {
return err
}
reader := bufio.NewReader(f)
var validOffset int64 = 0
var maxSeqID uint64 = 0
for {
// Read Header
header := make([]byte, headerSize)
if _, err := io.ReadFull(reader, header); err != nil {
if err == io.EOF || err == io.ErrUnexpectedEOF {
break
}
return err
}
readCrc := binary.BigEndian.Uint32(header[:crcSize])
size := binary.BigEndian.Uint64(header[crcSize : crcSize+sizeSize])
seqID := binary.BigEndian.Uint64(header[crcSize+sizeSize : headerSize])
// Read Payload
payload := make([]byte, size)
if _, err := io.ReadFull(reader, payload); err != nil {
break
}
// Read Footer
footer := make([]byte, footerSize)
if _, err := io.ReadFull(reader, footer); err != nil {
break
}
footerSizeVal := binary.BigEndian.Uint64(footer)
// Basic integrity check: Footer size must match Header size
if footerSizeVal != size {
log.Println("⚠️ WAL: Corrupted record (Size mismatch between Header and Footer)")
break
}
// Verify CRC
verifyBuf := make([]byte, sizeSize+seqIDSize+len(payload))
binary.BigEndian.PutUint64(verifyBuf[:sizeSize], size)
binary.BigEndian.PutUint64(verifyBuf[sizeSize:sizeSize+seqIDSize], seqID)
copy(verifyBuf[sizeSize+seqIDSize:], payload)
if calculateCRC(verifyBuf) != readCrc {
log.Println("⚠️ WAL: Corrupted tail detected (CRC mismatch), truncating...")
break
}
validOffset += int64(headerSize + size + footerSize)
maxSeqID = seqID
}
// Truncate file to the last valid position
if err := f.Truncate(validOffset); err != nil {
return err
}
// Update the write state
if _, err := f.Seek(validOffset, io.SeekStart); err != nil {
return err
}
w.activeSegment.size = validOffset
w.activeSegment.writer = bufio.NewWriterSize(f, w.bufferSize)
w.lastSeqID = maxSeqID
return nil
}
// createActiveSegment: Create a new active segment
func (w *WAL) createActiveSegment(idx uint64) error {
// sync and close old segment if exists
if w.activeSegment != nil {
// Flush & Sync last time
if err := w.sync(); err != nil {
return err
}
// Close file descriptor file to free up resources.
if err := w.activeSegment.file.Close(); err != nil {
return err
}
// Put into storage list (only path and size are needed for Iterator later)
w.segments = append(w.segments, w.activeSegment)
}
fileName := fmt.Sprintf("%s-%04d.wal", w.segmentPrefix, idx)
path := filepath.Join(w.dir, fileName)
// Open file with 0600 permissions (read/write for owner only) -> Security
f, err := os.OpenFile(path, os.O_CREATE|os.O_RDWR|os.O_APPEND, PermFileOpen)
if err != nil {
return err
}
// Sync parent directory
if dir, err := os.Open(w.dir); err == nil {
dir.Sync()
dir.Close()
}
w.activeSegment = &Segment{
idx: idx,
path: path,
file: f,
writer: bufio.NewWriterSize(f, w.bufferSize),
size: 0,
startID: w.lastSeqID + 1,
}
return nil
}
// backgroundSync: Periodically sync data based on strategy
func (w *WAL) backgroundSync(interval time.Duration) {
defer w.wg.Done()
ticker := time.NewTicker(interval)
defer ticker.Stop()
for {
select {
case <-ticker.C:
switch w.syncStrategy {
case SyncStrategyBackground:
if err := w.Sync(); err != nil {
log.Printf("wal: background sync error: %v", err)
}
case SyncStrategyOSCache:
w.mu.Lock()
if w.activeSegment == nil || w.activeSegment.file == nil {
w.mu.Unlock()
continue
}
f := w.activeSegment.file
w.mu.Unlock()
err := f.Sync()
if err != nil && !errors.Is(err, os.ErrClosed) {
log.Printf("wal: background sync error: %v", err)
}
default:
// do nothing
}
case <-w.stopSync:
return
}
}
}
func (w *WAL) bufferWrite(payload []byte) error {
w.lastSeqID++
// Header + Payload + Footer
pktSize := int64(headerSize + len(payload) + footerSize)
payloadLen := uint64(len(payload))
currentSeqID := w.lastSeqID
var buf []byte
obj := w.bufPool.Get()
if b, ok := obj.([]byte); ok && int64(cap(b)) >= pktSize {
buf = b[:pktSize]
} else {
buf = make([]byte, pktSize)
}
// 1. Write Header: [CRC][Size][SeqID]
binary.BigEndian.PutUint64(buf[crcSize:crcSize+sizeSize], payloadLen)
binary.BigEndian.PutUint64(buf[crcSize+sizeSize:headerSize], currentSeqID)
// 2. Write Payload
copy(buf[headerSize:], payload)
// 3. Write Footer: [Size]
// Position = headerSize + len(payload)
binary.BigEndian.PutUint64(buf[headerSize+len(payload):], payloadLen)
// Calculate CRC (Header + Payload only, excluding Footer usually, but let's exclude footer from CRC for compatibility with header check)
// We calculate CRC over [Size][SeqID][Payload] just like before
// The buffer contains [CRC][Size][SeqID][Payload][Footer]
// CRC is stored at buf[0:4]. It covers buf[4 : headerSize+len(payload)]
checksum := calculateCRC(buf[crcSize : headerSize+len(payload)])
binary.BigEndian.PutUint32(buf[:crcSize], checksum)
if _, err := w.activeSegment.writer.Write(buf); err != nil {
return err
}
w.bufPool.Put(buf)
w.activeSegment.size += pktSize
return nil
}
func (w *WAL) runSyncStrategy() error {
switch w.syncStrategy {
case SyncStrategyAlways:
return w.sync()
case SyncStrategyOSCache:
return w.activeSegment.writer.Flush()
}
return nil
}
// Write: Append a new entry to the WAL
func (w *WAL) Write(payload []byte) error {
w.mu.Lock()
defer w.mu.Unlock()
pktSize := int64(headerSize + len(payload) + footerSize)
if w.activeSegment.size+pktSize > w.segmentSize {
if err := w.createActiveSegment(w.activeSegment.idx + 1); err != nil {
return err
}
}
if err := w.bufferWrite(payload); err != nil {
return err
}
return w.runSyncStrategy()
}
// WriteBatch writes a batch of entries to the WAL efficiently.
func (w *WAL) WriteBatch(payloads [][]byte) error {
w.mu.Lock()
defer w.mu.Unlock()
var batchSize int64
for _, p := range payloads {
batchSize += int64(headerSize + len(p) + footerSize)
}
if w.activeSegment.size+batchSize > w.segmentSize {
if err := w.createActiveSegment(w.activeSegment.idx + 1); err != nil {
return err
}
}
for _, payload := range payloads {
if err := w.bufferWrite(payload); err != nil {
return err
}
}
return w.runSyncStrategy()
}
// sync: Flush buffer and fsync to disk
func (w *WAL) sync() error {
if w.activeSegment == nil {
return nil
}
if err := w.activeSegment.writer.Flush(); err != nil {
return err
}
return w.activeSegment.file.Sync()
}
// Sync: Public method to sync data to disk
func (w *WAL) Sync() error {
w.mu.Lock()
defer w.mu.Unlock()
return w.sync()
}
// StopSync stops sync goroutine and WAITS for it to finish
func (w *WAL) StopSync() {
select {
case <-w.stopSync:
default:
if w.stopSync != nil {
close(w.stopSync)
}
}
w.wg.Wait()
}
// Close: Safely close the WAL
func (w *WAL) Close() error {
w.mu.Lock()
if err := w.sync(); err != nil {
w.mu.Unlock()
return err
}
w.mu.Unlock()
w.StopSync()
w.mu.Lock()
defer w.mu.Unlock()
return w.activeSegment.file.Close()
}
func (w *WAL) GetLastSegmentIdx() uint64 {
w.mu.RLock()
defer w.mu.RUnlock()
if w.activeSegment == nil {
return 0
}
return w.activeSegment.idx
}
// TruncateFront removes all closed segments that contain NO entries with ID >= minSeqID.
// Example:
// Seg1: Start=1. Seg2: Start=100. Seg3: Start=200.
// TruncateFront(150):
// Seg1 <= 150. Candidate.
// Seg2 <= 150. Better Candidate.
// Seg3 > 150. Stop.
// Result: Keep Seg2, Seg3. Delete Seg1.
func (w *WAL) TruncateFront(minSeqID uint64) error {
w.mu.Lock()
defer w.mu.Unlock()
var pivotIdx int = -1
for i, seg := range w.segments {
if seg.startID <= minSeqID {
pivotIdx = i
} else {
break
}
}
// Check if active segment covers minSeqID entirely (meaning all closed segments are old)
if w.activeSegment != nil && w.activeSegment.startID <= minSeqID {
pivotIdx = len(w.segments)
}
if pivotIdx == -1 {
return nil // All segments are newer than minSeqID (or list empty), nothing to delete
}
// Delete segments from index 0 to pivotIdx-1
// KEEP the pivotIdx because it contains logs that start before minSeqID but might end after it
var keptSegments []*Segment
for i, seg := range w.segments {
if i < pivotIdx {
if err := os.Remove(seg.path); err != nil && !os.IsNotExist(err) {
return err
}
} else {
keptSegments = append(keptSegments, seg)
}
}
w.segments = keptSegments
return nil
}
// Cleanup removes closed segments that are older than the specified TTL.
func (w *WAL) CleanupByTTL(ttl time.Duration) error {
w.mu.Lock()
defer w.mu.Unlock()
threshold := time.Now().Add(-ttl)
var keptSegments []*Segment
for _, seg := range w.segments {
info, err := os.Stat(seg.path)
if err != nil {
if os.IsNotExist(err) {
continue
}
keptSegments = append(keptSegments, seg)
continue
}
if info.ModTime().Before(threshold) {
if err := os.Remove(seg.path); err != nil {
if !os.IsNotExist(err) {
return err
}
}
} else {
keptSegments = append(keptSegments, seg)
}
}
w.segments = keptSegments
return nil
}
// CleanupBySize removes old segments if the total WAL size exceeds maxSizeBytes.
func (w *WAL) CleanupBySize(maxSizeBytes int64) error {
w.mu.Lock()
defer w.mu.Unlock()
var totalSize int64
for _, seg := range w.segments {
totalSize += seg.size
}
if w.activeSegment != nil {
totalSize += w.activeSegment.size
}
if totalSize <= maxSizeBytes {
return nil
}
var deleteCount int
for _, seg := range w.segments {
if totalSize > maxSizeBytes {
if err := os.Remove(seg.path); err != nil && !os.IsNotExist(err) {
return err
}
totalSize -= seg.size
deleteCount++
} else {
break
}
}
if deleteCount > 0 {
w.segments = w.segments[deleteCount:]
}
return nil
}