-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsst_table.go
420 lines (364 loc) · 10.4 KB
/
sst_table.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
package mitkv
import (
"encoding/json"
"fmt"
"os"
sll "github.com/emirpasic/gods/lists/singlylinkedlist"
"github.com/emirpasic/gods/maps/treemap"
avl "github.com/emirpasic/gods/trees/avltree"
)
// SSTTable ssttable
type SSTTable struct {
MetaInfo SSTTableMetaInfo
SparseIndex *avl.Tree
TableFile *os.File
FilePath string
}
// initFromIndex 从内存中的avlTree生成ssTable
func (sst *SSTTable) initFromIndex(index avl.Tree) {
tableFileStat, err := sst.TableFile.Stat()
if err != nil {
fmt.Errorf("get file stat err :%v\n", err)
}
sst.MetaInfo.DataStart = tableFileStat.Size()
// 如何实现有序的map
partData := treemap.NewWithStringComparator()
it := index.Iterator()
for it.Next() {
keyStr := Value2Str(it.Key())
valStruct := &Cmd{}
jsonbyte, temerr := json.Marshal(it.Value())
if temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
if temerr = json.Unmarshal(jsonbyte, valStruct); temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
partData.Put(keyStr, valStruct)
partSize := int(sst.MetaInfo.PartSize)
if partData.Size() >= partSize {
sst.writeDataPart(partData)
}
}
// 将遍历完剩余的数据继续写入文件
if partData.Size() > 0 {
sst.writeDataPart(partData)
}
// 重新获取下当前文件状态
tableFileStat, err = sst.TableFile.Stat()
if err != nil {
fmt.Errorf("get file stat err :%v\n", err)
}
dataPartLen := tableFileStat.Size() - sst.MetaInfo.DataStart
sst.MetaInfo.DataLen = dataPartLen
// 保存稀疏索引
indexBytes, err := sst.SparseIndex.ToJSON()
if err != nil {
fmt.Errorf("josn Marshal err %v\n", err)
}
sst.MetaInfo.IndexStart = tableFileStat.Size()
_, sstWriteErr := sst.TableFile.Write(indexBytes)
if sstWriteErr != nil {
fmt.Errorf("sst table write err%v\n", sstWriteErr)
}
sstSyncErr := sst.TableFile.Sync()
if sstSyncErr != nil {
fmt.Errorf("sync sst table file err %v\n", sstSyncErr)
}
sst.MetaInfo.IndexLen = int64(len(indexBytes))
fmt.Printf("SparseIndex is %v\n", sst.SparseIndex)
// 保存文件索引
sst.MetaInfo.writeToFile(sst.TableFile)
fmt.Printf("file_path = %v, mate_info = %v\n", sst.FilePath, sst.MetaInfo)
}
// restoreFromFile 应用突然宕机,在服务重启时,从文件中重新构建sstTable
func (sst *SSTTable) restoreFromFile() {
metaInfo, err := sst.MetaInfo.readFromFile(sst.TableFile)
if err != nil {
fmt.Errorf("meta readFromFile err %v\n", err)
return
}
fmt.Printf("restoreFromFile start ......\n")
indexBytes := make([]byte, int(metaInfo.IndexLen))
sst.TableFile.Seek(metaInfo.IndexStart, 0)
sst.TableFile.Read(indexBytes)
fmt.Printf("index ssttable data %v\n", string(indexBytes))
if err := sst.SparseIndex.FromJSON(indexBytes); err != nil {
fmt.Errorf("json Unmarshal err %v\n", err)
}
fmt.Printf("SparseIndex = %v\n", sst.SparseIndex)
sst.MetaInfo = metaInfo
}
func (sst *SSTTable) writeDataPart(partData *treemap.Map) {
partDataBytes, err := partData.ToJSON()
if err != nil {
fmt.Errorf("json Marshal err %v\n", err)
}
filestat, err := sst.TableFile.Stat()
if err != nil {
fmt.Errorf("get file stat err %v\n", err)
}
start := filestat.Size()
_, sstWriteErr := sst.TableFile.Write(partDataBytes)
if sstWriteErr != nil {
fmt.Errorf("sst table write file err%v\n", sstWriteErr)
}
syncSstErr := sst.TableFile.Sync()
if syncSstErr != nil {
fmt.Errorf("sync sst table file err %v\n", syncSstErr)
}
// 获取最小的key索引,用来做稀疏索引,
k, _ := partData.Min()
sst.SparseIndex.Put(k, Position{
Start: start,
Len: int64(len(partDataBytes)),
})
partData.Clear()
}
// Close close data
func (sst *SSTTable) Close() {
sst.TableFile.Close()
}
// query 从sstTable中查询数据,查询逻辑是 从内存中查找 -> 从最新的sstTable中查找 -> 从老的sstTable中查找
// 查询过程是从索引中获取到key对应的最上下限的position,
func (sst *SSTTable) query(key string) (cmd *Cmd, err error) {
list := sll.New()
lastSmallPos := &Position{}
fitstBigPos := &Position{}
// 从索引表中找到最后一个小于key的位置,以及第一个大于key的位置
// fmt.Printf("query SparseIndex %v\n", sst.SparseIndex)
for _, k := range sst.SparseIndex.Keys() {
keyStr := Value2Str(k)
if keyStr <= key {
tempPos, isFind := sst.SparseIndex.Get(k)
if isFind {
jsonbyte, temerr := json.Marshal(tempPos)
if temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
if temerr = json.Unmarshal(jsonbyte, lastSmallPos); temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
}
} else {
tempPos, isFind := sst.SparseIndex.Get(k)
if isFind {
jsonbyte, temerr := json.Marshal(tempPos)
if temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
if temerr = json.Unmarshal(jsonbyte, fitstBigPos); temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
}
break
}
}
if lastSmallPos.Start >= 0 && lastSmallPos.Len > 0 {
list.Add(lastSmallPos)
}
if fitstBigPos.Start >= 0 && fitstBigPos.Len > 0 {
list.Add(fitstBigPos)
}
if list.Size() == 0 {
return
}
fitstKeyPos := &Position{}
lastKeyPos := &Position{}
temFirstPos, isFind := list.Get(0)
if isFind {
// pos, ok := temFirstPos.(Position)
// if ok {
// fitstKeyPos = &pos
// }
jsonbyte, temerr := json.Marshal(temFirstPos)
if temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
if temerr = json.Unmarshal(jsonbyte, fitstKeyPos); temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
}
lastPos, isFind := list.Get(list.Size() - 1)
if isFind {
jsonbyte, temerr := json.Marshal(lastPos)
if temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
if temerr = json.Unmarshal(jsonbyte, lastKeyPos); temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
}
length := int64(0)
start := fitstKeyPos.Start
if fitstKeyPos.Start == lastKeyPos.Start && fitstKeyPos.Len == lastKeyPos.Len {
length = fitstKeyPos.Len
} else {
length = lastKeyPos.Start + lastKeyPos.Len - start
}
dataPartBytes := make([]byte, int(length))
checkErrFunc(sst.TableFile.Seek(start, 0))
checkErrFunc(sst.TableFile.Read(dataPartBytes))
var pStart int64 = 0
var pEnd int64 = 0
it := list.Iterator()
for it.Next() {
innerPos := Position{}
jsonbyte, temerr := json.Marshal(it.Value())
if temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
if temerr = json.Unmarshal(jsonbyte, &innerPos); temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
// TODO bug is herep
pEnd = pStart + innerPos.Len
partData := treemap.NewWithStringComparator()
if err := partData.FromJSON(dataPartBytes[pStart:pEnd]); err != nil {
fmt.Errorf("treemap from json err %v", err)
}
data, findKey := partData.Get(key)
if findKey {
res := &Cmd{}
jsonbyte, temerr = json.Marshal(data)
if temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
if temerr = json.Unmarshal(jsonbyte, res); temerr != nil {
fmt.Errorf("err %v\n", temerr)
}
return res, nil
}
pStart = pStart + innerPos.Len
}
return nil, err
}
// InitSstTable init
func InitSstTable(filePath string, partSize int) (sst *SSTTable, err error) {
sst = &SSTTable{}
sst.MetaInfo = SSTTableMetaInfo{}
sst.MetaInfo.PartSize = int64(partSize)
sst.FilePath = filePath
var file *os.File
fileInfo, err := os.Stat(filePath)
if err != nil && os.IsNotExist(err) {
file, err = os.OpenFile(
filePath,
os.O_APPEND|os.O_RDWR|os.O_CREATE,
0666,
)
if err != nil {
return nil, err
}
} else {
file, err = os.OpenFile(
filePath,
os.O_APPEND|os.O_RDWR,
0666,
)
if err != nil {
return nil, err
}
}
fmt.Printf("fileInfo = %v\n", fileInfo)
sst.TableFile = file
sst.SparseIndex = avl.NewWithStringComparator()
return sst, err
}
// CreateFromIndex create
func CreateFromIndex(filePath string, partSize int, index avl.Tree) (sst *SSTTable, err error) {
sst, err = InitSstTable(filePath, partSize)
if err != nil {
return sst, err
}
sst.initFromIndex(index)
return sst, err
}
// CreateFromFile create
func CreateFromFile(filePath string) (sst *SSTTable, err error) {
sst, err = InitSstTable(filePath, 0)
if err != nil {
return sst, err
}
sst.restoreFromFile()
return sst, err
}
// SSTTableMetaInfo sstTable的元数据
type SSTTableMetaInfo struct {
Version int64 // 版本号
DataStart int64 // 数据区开始
DataLen int64 // 数据区长度
IndexStart int64 // 索引区开始
IndexLen int64 // 索引区长度
PartSize int64 // 分段的大小
}
func (sstMeta *SSTTableMetaInfo) writeToFile(file *os.File) {
// file 是通过append的方式来打开或者创建的文件
checkErrFunc(file.Write(Int64ToBytes(sstMeta.Version)))
checkErrFunc(file.Write(Int64ToBytes(sstMeta.DataStart)))
checkErrFunc(file.Write(Int64ToBytes(sstMeta.DataLen)))
checkErrFunc(file.Write(Int64ToBytes(sstMeta.IndexStart)))
checkErrFunc(file.Write(Int64ToBytes(sstMeta.IndexLen)))
checkErrFunc(file.Write(Int64ToBytes(sstMeta.PartSize)))
syncFileErr := file.Sync()
if syncFileErr != nil {
fmt.Errorf("syncFileErr of write meta file %v\n", syncFileErr)
}
}
func checkErrFunc(index interface{}, err error) {
if err != nil {
fmt.Errorf("write file err,index=%v,err=%v\n", index, err)
}
}
func (sstMeta *SSTTableMetaInfo) readFromFile(file *os.File) (sstMetaRes SSTTableMetaInfo, err error) {
sstMetaRes = SSTTableMetaInfo{}
stat, err := file.Stat()
if err != nil {
fmt.Errorf("err = %v\n", err)
return sstMetaRes, err
}
checkErrFunc(file.Seek(stat.Size()-8, 0))
byteSlice := make([]byte, 8)
checkErrFunc(file.Read(byteSlice))
sstMetaRes.PartSize = BytesToInt64(byteSlice)
checkErrFunc(file.Seek(stat.Size()-16, 0))
byteSlice = make([]byte, 8)
checkErrFunc(file.Read(byteSlice))
sstMetaRes.IndexLen = BytesToInt64(byteSlice)
checkErrFunc(file.Seek(stat.Size()-24, 0))
byteSlice = make([]byte, 8)
checkErrFunc(file.Read(byteSlice))
sstMetaRes.IndexStart = BytesToInt64(byteSlice)
checkErrFunc(file.Seek(stat.Size()-32, 0))
byteSlice = make([]byte, 8)
checkErrFunc(file.Read(byteSlice))
sstMetaRes.DataLen = BytesToInt64(byteSlice)
checkErrFunc(file.Seek(stat.Size()-40, 0))
byteSlice = make([]byte, 8)
checkErrFunc(file.Read(byteSlice))
sstMetaRes.DataStart = BytesToInt64(byteSlice)
checkErrFunc(file.Seek(stat.Size()-48, 0))
byteSlice = make([]byte, 8)
checkErrFunc(file.Read(byteSlice))
sstMetaRes.Version = BytesToInt64(byteSlice)
return sstMetaRes, nil
}
const (
// SET set cmd
SET int = iota
// GET get cmd
GET
// DEL cmd
DEL
)
// Cmd cmd
type Cmd struct {
Key string
Val string
CmdType int
}
// Position position
type Position struct {
Start int64
Len int64
}