-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathwal.go
240 lines (190 loc) · 6.07 KB
/
wal.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
package gowal
import (
"bytes"
"encoding/gob"
"github.com/pkg/errors"
"github.com/vmihailenco/msgpack/v5"
"iter"
"os"
"path"
"sort"
"sync/atomic"
)
var ErrExists = errors.New("msg with such index already exists")
// Wal is a write-ahead log that stores key-value pairs.
//
// Wal is append-only log, so we can't delete records from it, but log is divided into segments, which are rotated (oldest deleted) when
// segments number threshold is reached.
//
// Index stored in memory and loaded from disk on Wal init.
type Wal struct {
// append-only log with proposed messages that node consumed
log *os.File
// file with checksum for current segment
checksum *os.File
// index that matches height of msg record with offset in file
index map[uint64]msg
tmpIndex map[uint64]msg
// gob encoder for proposed messages
enc *gob.Encoder
// buffer for proposed messages
buf *bytes.Buffer
// path to directory with logs
pathToLogsDir string
// name of the old segment
oldestSegName string
// offset of last record in file
lastOffset int64
lastIndex atomic.Uint64
// number of segments for log
segmentsNumber int
// prefix for segment files
prefix string
segmentsThreshold int
maxSegments int
isInSyncDiskMode bool
}
// Config represents the configuration for the WAL (Write-Ahead Log).
type Config struct {
// Dir is the directory where the log files will be stored.
Dir string
// Prefix is the prefix for the segment files.
Prefix string
// SegmentThreshold is the number of records after which a new segment is created.
SegmentThreshold int
// MaxSegments is the maximum number of segments allowed before the oldest segment is deleted.
MaxSegments int
// IsInSyncDiskMode indicates whether the log should be synced to disk after each write.
IsInSyncDiskMode bool
}
// NewWAL creates a new WAL with the given configuration.
func NewWAL(config Config) (*Wal, error) {
if err := os.MkdirAll(config.Dir, 0755); err != nil {
return nil, errors.Wrap(err, "failed to create log directory")
}
segmentsNumbers, err := findSegmentNumber(config.Dir, config.Prefix)
if err != nil {
return nil, errors.Wrap(err, "failed to find segment numbers")
}
// load segments into mem
fd, chk, lastOffset, index, err := segmentInfoAndIndex(segmentsNumbers, path.Join(config.Dir, config.Prefix))
if err != nil {
return nil, errors.Wrap(err, "failed to load log segments")
}
numberOfSegments := len(index) / config.SegmentThreshold
if numberOfSegments == 0 {
numberOfSegments = 1
}
var buf bytes.Buffer
enc := gob.NewEncoder(&buf)
w := &Wal{log: fd, index: index, checksum: chk, tmpIndex: make(map[uint64]msg),
buf: &buf, enc: enc, lastOffset: lastOffset, pathToLogsDir: config.Dir,
segmentsNumber: numberOfSegments, prefix: config.Prefix, segmentsThreshold: config.SegmentThreshold,
maxSegments: config.MaxSegments, isInSyncDiskMode: config.IsInSyncDiskMode}
lastIndex := uint64(0)
for v := range w.Iterator() {
if v.Idx > lastIndex {
lastIndex = v.Idx
}
}
w.lastIndex.Store(lastIndex)
return w, nil
}
// UnsafeRecover recovers the WAL from the given directory.
// It is unsafe because it removes all the segment and checksum files that are corrupted (checksums do not match).
// It returns the list of segment and checksum files that were removed.
func UnsafeRecover(dir, segmentPrefix string) ([]string, error) {
segmentsNumbers, err := findSegmentNumber(dir, segmentPrefix)
if err != nil {
return nil, errors.Wrap(err, "failed to find segment numbers")
}
return removeCorruptedSegments(segmentsNumbers, path.Join(dir, segmentPrefix))
}
// Get queries value at specific index in the log.
func (c *Wal) Get(index uint64) (string, []byte, bool) {
msg, ok := c.index[index]
if !ok {
return "", nil, false
}
return msg.Key, msg.Value, true
}
// CurrentIndex returns current index of the log.
func (c *Wal) CurrentIndex() uint64 {
return c.lastIndex.Load()
}
// Write writes key-value pair to the log.
func (c *Wal) Write(index uint64, key string, value []byte) error {
if _, exists := c.index[index]; exists {
return ErrExists // Предотвращаем дублирование индексов
}
if err := c.rotateIfNeeded(index, key, value); err != nil {
return err
}
data, err := msgpack.Marshal(msg{Key: key, Value: value, Idx: index})
if err != nil {
return errors.Wrap(err, "failed to encode msg")
}
if _, err := c.log.Write(data); err != nil {
return errors.Wrap(err, "failed to write msg to log")
}
if err := writeChecksum(c.log, c.checksum); err != nil {
return errors.Wrap(err, "failed to write checksum")
}
if c.isInSyncDiskMode {
if err := c.log.Sync(); err != nil {
return errors.Wrap(err, "failed to sync log")
}
if err := c.checksum.Sync(); err != nil {
return errors.Wrap(err, "failed to checksum")
}
}
c.lastOffset += int64(c.buf.Len())
c.lastIndex.Add(1)
c.buf.Reset()
c.index[index] = msg{Key: key, Value: value, Idx: index}
return nil
}
// Iterator returns push-based iterator for the WAL messages.
// Messages are returned from the oldest to the newest.
//
// Should be used like this:
//
// for msg := range wal.Iterator() {
// ...
func (c *Wal) Iterator() iter.Seq[msg] {
return func(yield func(msg) bool) {
msgIndexes := make([]uint64, 0, len(c.index))
for k := range c.index {
msgIndexes = append(msgIndexes, k)
}
sort.Slice(msgIndexes, func(i, j int) bool {
return msgIndexes[i] < msgIndexes[j]
})
for i := 0; i < len(msgIndexes); i++ {
if !yield(c.index[msgIndexes[i]]) {
break
}
}
}
}
// PullIterator returns pull-based iterator for the WAL messages.
// Messages are returned from the oldest to the newest.
//
// Should be used like this:
//
// next, stop := wal.PullIterator()
// defer stop()
// ...
func (c *Wal) PullIterator() (next func() (msg, bool), stop func()) {
return iter.Pull(c.Iterator())
}
// Close closes log and checksum files.
func (c *Wal) Close() error {
if err := c.log.Close(); err != nil {
return errors.Wrap(err, "failed to close log log file")
}
if err := c.checksum.Close(); err != nil {
return errors.Wrap(err, "failed to close checksum file")
}
return nil
}