mirror of
https://github.com/chrislusf/seaweedfs
synced 2024-09-12 12:00:45 +02:00
* 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
260 lines
5.7 KiB
Go
260 lines
5.7 KiB
Go
package filer
|
|
|
|
import (
|
|
"math"
|
|
"sync"
|
|
)
|
|
|
|
type IntervalValue interface {
|
|
SetStartStop(start, stop int64)
|
|
Clone() IntervalValue
|
|
}
|
|
|
|
type Interval[T IntervalValue] struct {
|
|
StartOffset int64
|
|
StopOffset int64
|
|
TsNs int64
|
|
Value T
|
|
Prev *Interval[T]
|
|
Next *Interval[T]
|
|
}
|
|
|
|
func (interval *Interval[T]) Size() int64 {
|
|
return interval.StopOffset - interval.StartOffset
|
|
}
|
|
|
|
// IntervalList mark written intervals within one page chunk
|
|
type IntervalList[T IntervalValue] struct {
|
|
head *Interval[T]
|
|
tail *Interval[T]
|
|
Lock sync.Mutex
|
|
}
|
|
|
|
func NewIntervalList[T IntervalValue]() *IntervalList[T] {
|
|
list := &IntervalList[T]{
|
|
head: &Interval[T]{
|
|
StartOffset: -1,
|
|
StopOffset: -1,
|
|
},
|
|
tail: &Interval[T]{
|
|
StartOffset: math.MaxInt64,
|
|
StopOffset: math.MaxInt64,
|
|
},
|
|
}
|
|
return list
|
|
}
|
|
|
|
func (list *IntervalList[T]) Front() (interval *Interval[T]) {
|
|
return list.head.Next
|
|
}
|
|
|
|
func (list *IntervalList[T]) AppendInterval(interval *Interval[T]) {
|
|
list.Lock.Lock()
|
|
defer list.Lock.Unlock()
|
|
|
|
if list.head.Next == nil {
|
|
list.head.Next = interval
|
|
}
|
|
interval.Prev = list.tail.Prev
|
|
if list.tail.Prev != nil {
|
|
list.tail.Prev.Next = interval
|
|
}
|
|
list.tail.Prev = interval
|
|
}
|
|
|
|
func (list *IntervalList[T]) Overlay(startOffset, stopOffset, tsNs int64, value T) {
|
|
if startOffset >= stopOffset {
|
|
return
|
|
}
|
|
interval := &Interval[T]{
|
|
StartOffset: startOffset,
|
|
StopOffset: stopOffset,
|
|
TsNs: tsNs,
|
|
Value: value,
|
|
}
|
|
|
|
list.Lock.Lock()
|
|
defer list.Lock.Unlock()
|
|
|
|
list.overlayInterval(interval)
|
|
}
|
|
|
|
func (list *IntervalList[T]) InsertInterval(startOffset, stopOffset, tsNs int64, value T) {
|
|
interval := &Interval[T]{
|
|
StartOffset: startOffset,
|
|
StopOffset: stopOffset,
|
|
TsNs: tsNs,
|
|
Value: value,
|
|
}
|
|
|
|
list.Lock.Lock()
|
|
defer list.Lock.Unlock()
|
|
|
|
value.SetStartStop(startOffset, stopOffset)
|
|
list.insertInterval(interval)
|
|
}
|
|
|
|
func (list *IntervalList[T]) insertInterval(interval *Interval[T]) {
|
|
prev := list.head
|
|
next := prev.Next
|
|
|
|
for interval.StartOffset < interval.StopOffset {
|
|
if next == nil {
|
|
// add to the end
|
|
list.insertBetween(prev, interval, list.tail)
|
|
break
|
|
}
|
|
|
|
// interval is ahead of the next
|
|
if interval.StopOffset <= next.StartOffset {
|
|
list.insertBetween(prev, interval, next)
|
|
break
|
|
}
|
|
|
|
// interval is after the next
|
|
if next.StopOffset <= interval.StartOffset {
|
|
prev = next
|
|
next = next.Next
|
|
continue
|
|
}
|
|
|
|
// intersecting next and interval
|
|
if interval.TsNs >= next.TsNs {
|
|
// interval is newer
|
|
if next.StartOffset < interval.StartOffset {
|
|
// left side of next is ahead of interval
|
|
t := &Interval[T]{
|
|
StartOffset: next.StartOffset,
|
|
StopOffset: interval.StartOffset,
|
|
TsNs: next.TsNs,
|
|
Value: next.Value.Clone().(T),
|
|
}
|
|
t.Value.SetStartStop(t.StartOffset, t.StopOffset)
|
|
list.insertBetween(prev, t, interval)
|
|
next.StartOffset = interval.StartOffset
|
|
next.Value.SetStartStop(next.StartOffset, next.StopOffset)
|
|
prev = t
|
|
}
|
|
if interval.StopOffset < next.StopOffset {
|
|
// right side of next is after interval
|
|
next.StartOffset = interval.StopOffset
|
|
next.Value.SetStartStop(next.StartOffset, next.StopOffset)
|
|
list.insertBetween(prev, interval, next)
|
|
break
|
|
} else {
|
|
// next is covered
|
|
prev.Next = interval
|
|
next = next.Next
|
|
}
|
|
} else {
|
|
// next is newer
|
|
if interval.StartOffset < next.StartOffset {
|
|
// left side of interval is ahead of next
|
|
t := &Interval[T]{
|
|
StartOffset: interval.StartOffset,
|
|
StopOffset: next.StartOffset,
|
|
TsNs: interval.TsNs,
|
|
Value: interval.Value.Clone().(T),
|
|
}
|
|
t.Value.SetStartStop(t.StartOffset, t.StopOffset)
|
|
list.insertBetween(prev, t, next)
|
|
interval.StartOffset = next.StartOffset
|
|
interval.Value.SetStartStop(interval.StartOffset, interval.StopOffset)
|
|
}
|
|
if next.StopOffset < interval.StopOffset {
|
|
// right side of interval is after next
|
|
interval.StartOffset = next.StopOffset
|
|
interval.Value.SetStartStop(interval.StartOffset, interval.StopOffset)
|
|
} else {
|
|
// interval is covered
|
|
break
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
func (list *IntervalList[T]) insertBetween(a, interval, b *Interval[T]) {
|
|
a.Next = interval
|
|
b.Prev = interval
|
|
if a != list.head {
|
|
interval.Prev = a
|
|
}
|
|
if b != list.tail {
|
|
interval.Next = b
|
|
}
|
|
}
|
|
|
|
func (list *IntervalList[T]) overlayInterval(interval *Interval[T]) {
|
|
|
|
//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 != nil && p.Next.StartOffset < interval.StartOffset {
|
|
t := &Interval[T]{
|
|
StartOffset: p.Next.StartOffset,
|
|
StopOffset: interval.StartOffset,
|
|
TsNs: p.Next.TsNs,
|
|
Value: p.Next.Value,
|
|
}
|
|
p.Next = t
|
|
if p != list.head {
|
|
t.Prev = p
|
|
}
|
|
t.Next = interval
|
|
interval.Prev = t
|
|
} else {
|
|
p.Next = interval
|
|
if p != list.head {
|
|
interval.Prev = p
|
|
}
|
|
}
|
|
|
|
// right side
|
|
// interval ends before p.Prev
|
|
if q.Prev != nil && interval.StopOffset < q.Prev.StopOffset {
|
|
t := &Interval[T]{
|
|
StartOffset: interval.StopOffset,
|
|
StopOffset: q.Prev.StopOffset,
|
|
TsNs: q.Prev.TsNs,
|
|
Value: q.Prev.Value,
|
|
}
|
|
q.Prev = t
|
|
if q != list.tail {
|
|
t.Next = q
|
|
}
|
|
interval.Next = t
|
|
t.Prev = interval
|
|
} else {
|
|
q.Prev = interval
|
|
if q != list.tail {
|
|
interval.Next = q
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
func (list *IntervalList[T]) Len() int {
|
|
list.Lock.Lock()
|
|
defer list.Lock.Unlock()
|
|
|
|
var count int
|
|
for t := list.head; t != nil; t = t.Next {
|
|
count++
|
|
}
|
|
return count - 1
|
|
}
|