mirror of
https://github.com/seaweedfs/seaweedfs.git
synced 2024-11-24 19:19:11 +08:00
d4566d4aaa
* compare chunks by timestamp
* fix slab clearing error
* fix test compilation
* move oldest chunk to sealed, instead of by fullness
* lock on fh.entryViewCache
* remove verbose logs
* revert slat clearing
* less logs
* less logs
* track write and read by timestamp
* remove useless logic
* add entry lock on file handle release
* use mem chunk only, swap file chunk has problems
* comment out code that maybe used later
* add debug mode to compare data read and write
* more efficient readResolvedChunks with linked list
* small optimization
* fix test compilation
* minor fix on writer
* add SeparateGarbageChunks
* group chunks into sections
* turn off debug mode
* fix tests
* fix tests
* tmp enable swap file chunk
* Revert "tmp enable swap file chunk"
This reverts commit 985137ec47
.
* simple refactoring
* simple refactoring
* do not re-use swap file chunk. Sealed chunks should not be re-used.
* comment out debugging facilities
* either mem chunk or swap file chunk is fine now
* remove orderedMutex as *semaphore.Weighted
not found impactful
* optimize size calculation for changing large files
* optimize performance to avoid going through the long list of chunks
* still problems with swap file chunk
* rename
* tiny optimization
* swap file chunk save only successfully read data
* fix
* enable both mem and swap file chunk
* resolve chunks with range
* rename
* fix chunk interval list
* also change file handle chunk group when adding chunks
* pick in-active chunk with time-decayed counter
* fix compilation
* avoid nil with empty fh.entry
* refactoring
* rename
* rename
* refactor visible intervals to *list.List
* refactor chunkViews to *list.List
* add IntervalList for generic interval list
* change visible interval to use IntervalList in generics
* cahnge chunkViews to *IntervalList[*ChunkView]
* use NewFileChunkSection to create
* rename variables
* refactor
* fix renaming leftover
* renaming
* renaming
* add insert interval
* interval list adds lock
* incrementally add chunks to readers
Fixes:
1. set start and stop offset for the value object
2. clone the value object
3. use pointer instead of copy-by-value when passing to interval.Value
4. use insert interval since adding chunk could be out of order
* fix tests compilation
* fix tests compilation
196 lines
5.0 KiB
Go
196 lines
5.0 KiB
Go
package filer
|
|
|
|
import (
|
|
"bytes"
|
|
"io"
|
|
"math"
|
|
"strconv"
|
|
"testing"
|
|
)
|
|
|
|
type mockChunkCache struct {
|
|
}
|
|
|
|
func (m *mockChunkCache) GetChunk(fileId string, minSize uint64) (data []byte) {
|
|
x, _ := strconv.Atoi(fileId)
|
|
data = make([]byte, minSize)
|
|
for i := 0; i < int(minSize); i++ {
|
|
data[i] = byte(x)
|
|
}
|
|
return data
|
|
}
|
|
|
|
func (m *mockChunkCache) ReadChunkAt(data []byte, fileId string, offset uint64) (n int, err error) {
|
|
x, _ := strconv.Atoi(fileId)
|
|
for i := 0; i < len(data); i++ {
|
|
data[i] = byte(x)
|
|
}
|
|
return len(data), nil
|
|
}
|
|
|
|
func (m *mockChunkCache) SetChunk(fileId string, data []byte) {
|
|
}
|
|
|
|
func TestReaderAt(t *testing.T) {
|
|
|
|
visibles := NewIntervalList[*VisibleInterval]()
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 1,
|
|
stop: 2,
|
|
fileId: "1",
|
|
chunkSize: 9,
|
|
})
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 3,
|
|
stop: 4,
|
|
fileId: "3",
|
|
chunkSize: 1,
|
|
})
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 5,
|
|
stop: 6,
|
|
fileId: "5",
|
|
chunkSize: 2,
|
|
})
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 7,
|
|
stop: 9,
|
|
fileId: "7",
|
|
chunkSize: 2,
|
|
})
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 9,
|
|
stop: 10,
|
|
fileId: "9",
|
|
chunkSize: 2,
|
|
})
|
|
|
|
readerAt := &ChunkReadAt{
|
|
chunkViews: ViewFromVisibleIntervals(visibles, 0, math.MaxInt64),
|
|
fileSize: 10,
|
|
readerCache: newReaderCache(3, &mockChunkCache{}, nil),
|
|
readerPattern: NewReaderPattern(),
|
|
}
|
|
|
|
testReadAt(t, readerAt, 0, 10, 10, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 0, 12, 12, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 2, 8, 8, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 3, 6, 6, nil, nil, nil)
|
|
|
|
}
|
|
|
|
func testReadAt(t *testing.T, readerAt *ChunkReadAt, offset int64, size int, expectedN int, expectedErr error, data, expectedData []byte) {
|
|
if data == nil {
|
|
data = make([]byte, size)
|
|
}
|
|
n, _, err := readerAt.doReadAt(data, offset)
|
|
|
|
if expectedN != n {
|
|
t.Errorf("unexpected read size: %d, expect: %d", n, expectedN)
|
|
}
|
|
if err != expectedErr {
|
|
t.Errorf("unexpected read error: %v, expect: %v", err, expectedErr)
|
|
}
|
|
if expectedData != nil && !bytes.Equal(data, expectedData) {
|
|
t.Errorf("unexpected read data: %v, expect: %v", data, expectedData)
|
|
}
|
|
}
|
|
|
|
func TestReaderAt0(t *testing.T) {
|
|
|
|
visibles := NewIntervalList[*VisibleInterval]()
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 2,
|
|
stop: 5,
|
|
fileId: "1",
|
|
chunkSize: 9,
|
|
})
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 7,
|
|
stop: 9,
|
|
fileId: "2",
|
|
chunkSize: 9,
|
|
})
|
|
|
|
readerAt := &ChunkReadAt{
|
|
chunkViews: ViewFromVisibleIntervals(visibles, 0, math.MaxInt64),
|
|
fileSize: 10,
|
|
readerCache: newReaderCache(3, &mockChunkCache{}, nil),
|
|
readerPattern: NewReaderPattern(),
|
|
}
|
|
|
|
testReadAt(t, readerAt, 0, 10, 10, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 3, 16, 7, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 3, 5, 5, nil, nil, nil)
|
|
|
|
testReadAt(t, readerAt, 11, 5, 5, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 10, 5, 5, io.EOF, nil, nil)
|
|
|
|
}
|
|
|
|
func TestReaderAt1(t *testing.T) {
|
|
|
|
visibles := NewIntervalList[*VisibleInterval]()
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 2,
|
|
stop: 5,
|
|
fileId: "1",
|
|
chunkSize: 9,
|
|
})
|
|
|
|
readerAt := &ChunkReadAt{
|
|
chunkViews: ViewFromVisibleIntervals(visibles, 0, math.MaxInt64),
|
|
fileSize: 20,
|
|
readerCache: newReaderCache(3, &mockChunkCache{}, nil),
|
|
readerPattern: NewReaderPattern(),
|
|
}
|
|
|
|
testReadAt(t, readerAt, 0, 20, 20, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 1, 7, 7, nil, nil, nil)
|
|
testReadAt(t, readerAt, 0, 1, 1, nil, nil, nil)
|
|
testReadAt(t, readerAt, 18, 4, 2, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 12, 4, 4, nil, nil, nil)
|
|
testReadAt(t, readerAt, 4, 20, 16, io.EOF, nil, nil)
|
|
testReadAt(t, readerAt, 4, 10, 10, nil, nil, nil)
|
|
testReadAt(t, readerAt, 1, 10, 10, nil, nil, nil)
|
|
|
|
}
|
|
|
|
func TestReaderAtGappedChunksDoNotLeak(t *testing.T) {
|
|
visibles := NewIntervalList[*VisibleInterval]()
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 2,
|
|
stop: 3,
|
|
fileId: "1",
|
|
chunkSize: 5,
|
|
})
|
|
addVisibleInterval(visibles, &VisibleInterval{
|
|
start: 7,
|
|
stop: 9,
|
|
fileId: "1",
|
|
chunkSize: 4,
|
|
})
|
|
|
|
readerAt := &ChunkReadAt{
|
|
chunkViews: ViewFromVisibleIntervals(visibles, 0, math.MaxInt64),
|
|
fileSize: 9,
|
|
readerCache: newReaderCache(3, &mockChunkCache{}, nil),
|
|
readerPattern: NewReaderPattern(),
|
|
}
|
|
|
|
testReadAt(t, readerAt, 0, 9, 9, io.EOF, []byte{2, 2, 2, 2, 2, 2, 2, 2, 2}, []byte{0, 0, 1, 0, 0, 0, 0, 1, 1})
|
|
testReadAt(t, readerAt, 1, 8, 8, io.EOF, []byte{2, 2, 2, 2, 2, 2, 2, 2}, []byte{0, 1, 0, 0, 0, 0, 1, 1})
|
|
}
|
|
|
|
func TestReaderAtSparseFileDoesNotLeak(t *testing.T) {
|
|
readerAt := &ChunkReadAt{
|
|
chunkViews: ViewFromVisibleIntervals(NewIntervalList[*VisibleInterval](), 0, math.MaxInt64),
|
|
fileSize: 3,
|
|
readerCache: newReaderCache(3, &mockChunkCache{}, nil),
|
|
readerPattern: NewReaderPattern(),
|
|
}
|
|
|
|
testReadAt(t, readerAt, 0, 3, 3, io.EOF, []byte{2, 2, 2}, []byte{0, 0, 0})
|
|
testReadAt(t, readerAt, 1, 2, 2, io.EOF, []byte{2, 2}, []byte{0, 0})
|
|
}
|