mirror of
https://github.com/seaweedfs/seaweedfs.git
synced 2024-01-19 02:48:24 +00: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
127 lines
2.9 KiB
Go
127 lines
2.9 KiB
Go
package page_writer
|
|
|
|
import (
|
|
"math"
|
|
)
|
|
|
|
// ChunkWrittenInterval mark one written interval within one page chunk
|
|
type ChunkWrittenInterval struct {
|
|
StartOffset int64
|
|
stopOffset int64
|
|
TsNs int64
|
|
prev *ChunkWrittenInterval
|
|
next *ChunkWrittenInterval
|
|
}
|
|
|
|
func (interval *ChunkWrittenInterval) Size() int64 {
|
|
return interval.stopOffset - interval.StartOffset
|
|
}
|
|
|
|
func (interval *ChunkWrittenInterval) isComplete(chunkSize int64) bool {
|
|
return interval.stopOffset-interval.StartOffset == chunkSize
|
|
}
|
|
|
|
// ChunkWrittenIntervalList mark written intervals within one page chunk
|
|
type ChunkWrittenIntervalList struct {
|
|
head *ChunkWrittenInterval
|
|
tail *ChunkWrittenInterval
|
|
}
|
|
|
|
func newChunkWrittenIntervalList() *ChunkWrittenIntervalList {
|
|
list := &ChunkWrittenIntervalList{
|
|
head: &ChunkWrittenInterval{
|
|
StartOffset: -1,
|
|
stopOffset: -1,
|
|
},
|
|
tail: &ChunkWrittenInterval{
|
|
StartOffset: math.MaxInt64,
|
|
stopOffset: math.MaxInt64,
|
|
},
|
|
}
|
|
list.head.next = list.tail
|
|
list.tail.prev = list.head
|
|
return list
|
|
}
|
|
|
|
func (list *ChunkWrittenIntervalList) MarkWritten(startOffset, stopOffset, tsNs int64) {
|
|
if startOffset >= stopOffset {
|
|
return
|
|
}
|
|
interval := &ChunkWrittenInterval{
|
|
StartOffset: startOffset,
|
|
stopOffset: stopOffset,
|
|
TsNs: tsNs,
|
|
}
|
|
list.addInterval(interval)
|
|
}
|
|
|
|
func (list *ChunkWrittenIntervalList) IsComplete(chunkSize int64) bool {
|
|
return list.size() == 1 && list.head.next.isComplete(chunkSize)
|
|
}
|
|
func (list *ChunkWrittenIntervalList) WrittenSize() (writtenByteCount int64) {
|
|
for t := list.head; t != nil; t = t.next {
|
|
writtenByteCount += t.Size()
|
|
}
|
|
return
|
|
}
|
|
|
|
func (list *ChunkWrittenIntervalList) addInterval(interval *ChunkWrittenInterval) {
|
|
|
|
//t := list.head
|
|
//for ; t.next != nil; t = t.next {
|
|
// if t.TsNs > interval.TsNs {
|
|
// println("writes is out of order", t.TsNs-interval.TsNs, "ns")
|
|
// }
|
|
//}
|
|
|
|
p := list.head
|
|
for ; p.next != nil && p.next.stopOffset <= interval.StartOffset; p = p.next {
|
|
}
|
|
q := list.tail
|
|
for ; q.prev != nil && q.prev.StartOffset >= interval.stopOffset; q = q.prev {
|
|
}
|
|
|
|
// left side
|
|
// interval after p.next start
|
|
if p.next.StartOffset < interval.StartOffset {
|
|
t := &ChunkWrittenInterval{
|
|
StartOffset: p.next.StartOffset,
|
|
stopOffset: interval.StartOffset,
|
|
TsNs: p.next.TsNs,
|
|
}
|
|
p.next = t
|
|
t.prev = p
|
|
t.next = interval
|
|
interval.prev = t
|
|
} else {
|
|
p.next = interval
|
|
interval.prev = p
|
|
}
|
|
|
|
// right side
|
|
// interval ends before p.prev
|
|
if interval.stopOffset < q.prev.stopOffset {
|
|
t := &ChunkWrittenInterval{
|
|
StartOffset: interval.stopOffset,
|
|
stopOffset: q.prev.stopOffset,
|
|
TsNs: q.prev.TsNs,
|
|
}
|
|
q.prev = t
|
|
t.next = q
|
|
interval.next = t
|
|
t.prev = interval
|
|
} else {
|
|
q.prev = interval
|
|
interval.next = q
|
|
}
|
|
|
|
}
|
|
|
|
func (list *ChunkWrittenIntervalList) size() int {
|
|
var count int
|
|
for t := list.head; t != nil; t = t.next {
|
|
count++
|
|
}
|
|
return count - 2
|
|
}
|