forked from wal-g/wal-g
/
blob.go
306 lines (280 loc) · 7.09 KB
/
blob.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
package blob
import (
"bytes"
"encoding/json"
"fmt"
"io"
"sort"
"sync"
"time"
"github.com/wal-g/tracelog"
"github.com/T0n0T/wal-g/pkg/storages/storage"
)
const IndexFileName = "__blob_index.json"
const BgSaveInterval = 30 * time.Second
type Index struct {
sync.Mutex
folder storage.Folder
Size uint64 `json:"size"`
Blocks []*Block `json:"blocks"`
Compression string `json:"compression"`
Encryption string `json:"encryption"`
icache map[string]*Block // cache by id's
ocache []*Block // cache by offset, ordered, only committed
needSave bool
}
type Block struct {
ID string `json:"id"`
Offset uint64 `json:"of"`
UploadedSize uint64 `json:"us"`
UploadedRev uint `json:"ur"`
CommittedSize uint64 `json:"cs"`
CommittedRev uint `json:"cr"`
}
type Section struct {
Path string
Offset uint64
Limit uint64
BlockSize uint64
}
func NewIndex(f storage.Folder) *Index {
idx := &Index{
folder: f,
icache: make(map[string]*Block),
}
go idx.saver()
return idx
}
func (idx *Index) Load() error {
reader, err := idx.folder.ReadObject(IndexFileName)
if err != nil {
if _, ok := err.(storage.ObjectNotFoundError); ok {
return ErrNotFound
}
return err
}
defer reader.Close()
data, err := io.ReadAll(reader)
if err != nil {
return err
}
idx.Lock()
defer idx.Unlock()
err = json.Unmarshal(data, idx)
if err != nil {
return err
}
idx.buildCache()
return nil
}
func (idx *Index) buildCache() {
idx.ocache = make([]*Block, 0, len(idx.Blocks))
idx.icache = make(map[string]*Block, len(idx.Blocks))
for _, b := range idx.Blocks {
idx.icache[b.ID] = b
if b.CommittedRev > 0 {
idx.ocache = append(idx.ocache, b)
}
}
sort.Slice(idx.ocache, func(i, j int) bool {
return idx.ocache[i].Offset < idx.ocache[j].Offset
})
}
func (idx *Index) saver() {
for range time.NewTicker(BgSaveInterval).C {
idx.Lock()
needSave := idx.needSave
idx.needSave = false
idx.Unlock()
if needSave {
err := idx.Save()
tracelog.ErrorLogger.PrintOnError(err)
}
}
}
func (idx *Index) Save() error {
idx.Lock()
data, err := json.Marshal(idx)
idx.Unlock()
if err == nil {
err = idx.folder.PutObject(IndexFileName, bytes.NewBuffer(data))
}
return err
}
func (idx *Index) SaveDelayed() {
idx.Lock()
idx.needSave = true
idx.Unlock()
}
func (idx *Index) PutBlock(id string, size uint64) string {
idx.Lock()
defer idx.Unlock()
block, ok := idx.icache[id]
if !ok {
block = &Block{ID: id, UploadedRev: 1}
idx.Blocks = append(idx.Blocks, block)
idx.icache[id] = block
} else {
block.UploadedRev = block.CommittedRev + 1
}
block.UploadedSize = size
return fmt.Sprintf("%s.%d", block.ID, block.UploadedRev)
}
// nolint: funlen,gocyclo
func (idx *Index) PutBlockList(xblocklist *XBlockListIn) ([]string, error) {
idx.Lock()
defer idx.Unlock()
oldBlocks := idx.Blocks
newBlocks := make([]*Block, 0, len(xblocklist.Blocks))
garbage := make([]string, 0, len(xblocklist.Blocks))
size := uint64(0)
for _, xb := range xblocklist.Blocks {
block, ok := idx.icache[xb.ID]
if !ok {
return nil, fmt.Errorf("proxy: blocklist operation contains not-uploaded block ID: %s", xb.ID)
}
block.Offset = size
newBlocks = append(newBlocks, block)
switch xb.Mode {
case BlockCommitted:
if block.CommittedRev == 0 {
return nil, fmt.Errorf("proxy: blocklist operation block %s is not committed", xb.ID)
}
if block.UploadedRev != 0 {
block.UploadedRev = 0
block.UploadedSize = 0
garbage = append(garbage, fmt.Sprintf("%s.%d", xb.ID, block.UploadedRev))
}
case BlockUncommitted:
if block.UploadedRev == 0 {
return nil, fmt.Errorf("proxy: blocklist operation block %s is not committed", xb.ID)
}
if block.CommittedRev != 0 {
garbage = append(garbage, fmt.Sprintf("%s.%d", xb.ID, block.CommittedRev))
}
block.CommittedRev = block.UploadedRev
block.CommittedSize = block.UploadedSize
block.UploadedRev = 0
block.UploadedSize = 0
case BlockLatest:
if block.UploadedRev != 0 {
if block.CommittedRev != 0 {
garbage = append(garbage, fmt.Sprintf("%s.%d", xb.ID, block.CommittedRev))
}
block.CommittedRev = block.UploadedRev
block.CommittedSize = block.UploadedSize
block.UploadedRev = 0
block.UploadedSize = 0
}
default:
panic(fmt.Sprintf("unexpected block mode: %s", xb.Mode))
}
size += block.CommittedSize
}
idx.Size = size
idx.Blocks = newBlocks
idx.buildCache()
for _, block := range oldBlocks {
if _, ok := idx.icache[block.ID]; !ok {
if block.UploadedRev != 0 {
garbage = append(garbage, fmt.Sprintf("%s.%d", block.ID, block.UploadedRev))
}
if block.CommittedRev != 0 {
garbage = append(garbage, fmt.Sprintf("%s.%d", block.ID, block.CommittedRev))
}
}
}
return garbage, nil
}
func (idx *Index) GetBlockList(ltype string) *XBlockListOut {
idx.Lock()
defer idx.Unlock()
var bl XBlockListOut
if ltype == BlockCommitted || ltype == BlockAll {
for _, b := range idx.ocache {
bl.CommittedBlocks.Blocks = append(bl.CommittedBlocks.Blocks, XBlockOut{
Name: b.ID,
Size: b.CommittedSize,
})
}
}
if ltype == BlockUncommitted || ltype == BlockAll {
for _, b := range idx.Blocks {
if b.UploadedRev > 0 {
bl.UncommittedBlocks.Blocks = append(bl.UncommittedBlocks.Blocks, XBlockOut{
Name: b.ID,
Size: b.UploadedSize,
})
}
}
sort.Slice(bl.UncommittedBlocks.Blocks, func(i, j int) bool {
return bl.UncommittedBlocks.Blocks[i].Name < bl.UncommittedBlocks.Blocks[j].Name
})
}
return &bl
}
func (idx *Index) Clear() []string {
idx.Lock()
defer idx.Unlock()
var garbage []string
for _, block := range idx.Blocks {
if block.UploadedRev != 0 {
garbage = append(garbage, fmt.Sprintf("%s.%d", block.ID, block.UploadedRev))
}
if block.CommittedRev != 0 {
garbage = append(garbage, fmt.Sprintf("%s.%d", block.ID, block.CommittedRev))
}
}
idx.Blocks = []*Block{}
idx.buildCache()
return garbage
}
func (idx *Index) GetSections(rangeMin, rangeMax uint64) []Section {
idx.Lock()
defer idx.Unlock()
var sections []Section
// binary search section start
l := 0
r := len(idx.ocache) - 1
for r > l {
m := (r + l) / 2
block := idx.ocache[m]
if (block.Offset + block.CommittedSize - 1) < rangeMin {
l = m + 1
} else if block.Offset > rangeMin {
r = m - 1
} else {
l = m
break
}
}
// scan next blocks
for i := l; i < len(idx.ocache); i++ {
block := idx.ocache[i]
if block.Offset > rangeMax {
break
}
offset := uint64(0)
if rangeMin > block.Offset {
offset = rangeMin - block.Offset
}
limit := block.CommittedSize
if rangeMax < (block.Offset + block.CommittedSize - 1) {
limit = rangeMax - block.Offset + 1
}
limit -= offset
sections = append(sections, Section{
Path: fmt.Sprintf("%s.%d", block.ID, block.CommittedRev),
Offset: offset,
Limit: limit,
BlockSize: block.CommittedSize,
})
}
return sections
}
// nolint: unused
func (idx *Index) debugBlocks() {
for i, b := range idx.ocache {
tracelog.DebugLogger.Printf("BLK %05d %s\t %020d %08d", i, b.ID, b.Offset, b.CommittedSize)
}
}