mirror of
https://github.com/chrislusf/seaweedfs
synced 2024-05-21 10:52:16 +02: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
82 lines
2 KiB
Go
82 lines
2 KiB
Go
package page_writer
|
|
|
|
import (
|
|
"github.com/stretchr/testify/assert"
|
|
"testing"
|
|
)
|
|
|
|
func Test_PageChunkWrittenIntervalList(t *testing.T) {
|
|
list := newChunkWrittenIntervalList()
|
|
|
|
assert.Equal(t, 0, list.size(), "empty list")
|
|
|
|
list.MarkWritten(0, 5, 1)
|
|
assert.Equal(t, 1, list.size(), "one interval")
|
|
|
|
list.MarkWritten(0, 5, 2)
|
|
assert.Equal(t, 1, list.size(), "duplicated interval2")
|
|
|
|
list.MarkWritten(95, 100, 3)
|
|
assert.Equal(t, 2, list.size(), "two intervals")
|
|
|
|
list.MarkWritten(50, 60, 4)
|
|
assert.Equal(t, 3, list.size(), "three intervals")
|
|
|
|
list.MarkWritten(50, 55, 5)
|
|
assert.Equal(t, 4, list.size(), "three intervals merge")
|
|
|
|
list.MarkWritten(40, 50, 6)
|
|
assert.Equal(t, 5, list.size(), "three intervals grow forward")
|
|
|
|
list.MarkWritten(50, 65, 7)
|
|
assert.Equal(t, 4, list.size(), "three intervals grow backward")
|
|
|
|
list.MarkWritten(70, 80, 8)
|
|
assert.Equal(t, 5, list.size(), "four intervals")
|
|
|
|
list.MarkWritten(60, 70, 9)
|
|
assert.Equal(t, 6, list.size(), "three intervals merged")
|
|
|
|
list.MarkWritten(59, 71, 10)
|
|
assert.Equal(t, 6, list.size(), "covered three intervals")
|
|
|
|
list.MarkWritten(5, 59, 11)
|
|
assert.Equal(t, 5, list.size(), "covered two intervals")
|
|
|
|
list.MarkWritten(70, 99, 12)
|
|
assert.Equal(t, 5, list.size(), "covered one intervals")
|
|
|
|
}
|
|
|
|
type interval struct {
|
|
start int64
|
|
stop int64
|
|
expected bool
|
|
}
|
|
|
|
func Test_PageChunkWrittenIntervalList1(t *testing.T) {
|
|
list := newChunkWrittenIntervalList()
|
|
inputs := []interval{
|
|
{1, 5, true},
|
|
{2, 3, true},
|
|
}
|
|
for i, input := range inputs {
|
|
list.MarkWritten(input.start, input.stop, int64(i)+1)
|
|
actual := hasData(list, 0, 4)
|
|
if actual != input.expected {
|
|
t.Errorf("input [%d,%d) expected %v actual %v", input.start, input.stop, input.expected, actual)
|
|
}
|
|
}
|
|
}
|
|
|
|
func hasData(usage *ChunkWrittenIntervalList, chunkStartOffset, x int64) bool {
|
|
for t := usage.head.next; t != usage.tail; t = t.next {
|
|
logicStart := chunkStartOffset + t.StartOffset
|
|
logicStop := chunkStartOffset + t.stopOffset
|
|
if logicStart <= x && x < logicStop {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|