@@ -78,8 +78,8 @@ type BufferList struct {
78
78
79
79
type FileBuffer struct {
80
80
queueId uint64
81
- offset uint64
82
- length uint64
81
+ offset uint64
82
+ length uint64
83
83
// Chunk state: 1 = clean. 2 = dirty. 3 = part flushed, but not finalized
84
84
// 4 = flushed, not finalized, but removed from memory
85
85
state BufferState
@@ -194,15 +194,15 @@ func (l *BufferList) EvictFromMemory(buf *FileBuffer) (allocated int64, deleted
194
194
prev .onDisk == buf .onDisk {
195
195
l .unqueue (buf )
196
196
l .unqueue (prev )
197
- l .at .Delete (prev .offset + prev .length )
197
+ l .at .Delete (prev .offset + prev .length )
198
198
buf .length += prev .length
199
199
buf .offset = prev .offset
200
200
l .queue (buf )
201
201
deleted = true
202
202
}
203
203
} else if buf .state == BUF_CLEAN {
204
204
l .unqueue (buf )
205
- l .at .Delete (buf .offset + buf .length )
205
+ l .at .Delete (buf .offset + buf .length )
206
206
deleted = true
207
207
} else if buf .state == BUF_FLUSHED_FULL {
208
208
// A flushed buffer can be removed at a cost of finalizing multipart upload
@@ -220,7 +220,7 @@ func (l *BufferList) EvictFromMemory(buf *FileBuffer) (allocated int64, deleted
220
220
})
221
221
if prev != nil && prev .offset + prev .length == buf .offset && prev .state == buf .state {
222
222
l .unqueue (prev )
223
- l .at .Delete (prev .offset + prev .length )
223
+ l .at .Delete (prev .offset + prev .length )
224
224
buf .length += prev .length
225
225
buf .offset = prev .offset
226
226
deleted = true
@@ -259,7 +259,7 @@ func (l *BufferList) unqueue(b *FileBuffer) {
259
259
}
260
260
if b .state == BUF_DIRTY {
261
261
sp := l .helpers .PartNum (b .offset )
262
- ep := l .helpers .PartNum (b .offset + b .length - 1 )
262
+ ep := l .helpers .PartNum (b .offset + b .length - 1 )
263
263
for i := sp ; i < ep + 1 ; i ++ {
264
264
p := l .dirtyParts [i ]
265
265
if p == nil || p .refcnt == 0 {
@@ -303,7 +303,7 @@ func (l *BufferList) queue(b *FileBuffer) {
303
303
l .dirtyParts = make (map [uint64 ]* dirtyPart )
304
304
}
305
305
sp := l .helpers .PartNum (b .offset )
306
- ep := l .helpers .PartNum (b .offset + b .length - 1 )
306
+ ep := l .helpers .PartNum (b .offset + b .length - 1 )
307
307
for i := sp ; i <= ep ; i ++ {
308
308
l .referenceDirtyPart (i )
309
309
}
@@ -324,8 +324,8 @@ func (l *BufferList) requeueSplit(left *FileBuffer) {
324
324
l .dirtyParts = make (map [uint64 ]* dirtyPart )
325
325
}
326
326
// most refcounts don't change - except if splitting not at part boundary
327
- lbound := l .helpers .PartNum (left .offset + left .length - 1 )
328
- rbound := l .helpers .PartNum (left .offset + left .length )
327
+ lbound := l .helpers .PartNum (left .offset + left .length - 1 )
328
+ rbound := l .helpers .PartNum (left .offset + left .length )
329
329
if lbound == rbound {
330
330
l .referenceDirtyPart (lbound )
331
331
}
@@ -377,7 +377,7 @@ func (l *BufferList) delete(b *FileBuffer) (allocated int64) {
377
377
b .ptr = nil
378
378
b .data = nil
379
379
}
380
- l .at .Delete (b .offset + b .length )
380
+ l .at .Delete (b .offset + b .length )
381
381
l .unqueue (b )
382
382
return
383
383
}
@@ -801,14 +801,14 @@ func mergeRA(rr []Range, readAhead uint64, readMerge uint64) []Range {
801
801
rr [prev ].End = rr [i ].End
802
802
} else {
803
803
prev ++
804
- sz := rr [i ].End - rr [i ].Start
804
+ sz := rr [i ].End - rr [i ].Start
805
805
if sz < readAhead {
806
806
sz = readAhead
807
807
}
808
- rr [prev ] = Range {Start : rr [i ].Start , End : rr [i ].Start + sz }
808
+ rr [prev ] = Range {Start : rr [i ].Start , End : rr [i ].Start + sz }
809
809
}
810
810
}
811
- return rr [0 : prev + 1 ]
811
+ return rr [0 : prev + 1 ]
812
812
}
813
813
814
814
func splitRA (rr []Range , maxPart uint64 ) []Range {
@@ -821,7 +821,7 @@ func splitRA(rr []Range, maxPart uint64) []Range {
821
821
split = true
822
822
}
823
823
for off := rr [i ].Start ; off < rr [i ].End ; off += maxPart {
824
- res = append (res , Range {Start : off , End : off + maxPart })
824
+ res = append (res , Range {Start : off , End : off + maxPart })
825
825
}
826
826
res [len (res )- 1 ].End = rr [i ].End
827
827
} else if split {
0 commit comments