You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

119 lines
3.3 KiB

more solid weed mount (#4089) * 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 985137ec472924e4815f258189f6ca9f2168a0a7. * 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
2 years ago
  1. package filer
  2. import (
  3. "github.com/seaweedfs/seaweedfs/weed/pb/filer_pb"
  4. "sync"
  5. )
  6. const SectionSize = 2 * 1024 * 1024 * 128 // 256MiB
  7. type SectionIndex int64
  8. type FileChunkSection struct {
  9. sectionIndex SectionIndex
  10. chunks []*filer_pb.FileChunk
  11. visibleIntervals *IntervalList[*VisibleInterval]
  12. chunkViews *IntervalList[*ChunkView]
  13. reader *ChunkReadAt
  14. lock sync.Mutex
  15. }
  16. func NewFileChunkSection(si SectionIndex) *FileChunkSection {
  17. return &FileChunkSection{
  18. sectionIndex: si,
  19. }
  20. }
  21. func (section *FileChunkSection) addChunk(chunk *filer_pb.FileChunk) error {
  22. section.lock.Lock()
  23. defer section.lock.Unlock()
  24. start, stop := max(int64(section.sectionIndex)*SectionSize, chunk.Offset), min(((int64(section.sectionIndex)+1)*SectionSize), chunk.Offset+int64(chunk.Size))
  25. section.chunks = append(section.chunks, chunk)
  26. if section.visibleIntervals != nil {
  27. MergeIntoVisibles(section.visibleIntervals, start, stop, chunk)
  28. }
  29. if section.visibleIntervals != nil {
  30. section.chunks, _ = SeparateGarbageChunks(section.visibleIntervals, section.chunks)
  31. }
  32. if section.chunkViews != nil {
  33. MergeIntoChunkViews(section.chunkViews, start, stop, chunk)
  34. }
  35. return nil
  36. }
  37. func (section *FileChunkSection) setupForRead(group *ChunkGroup, fileSize int64) {
  38. if section.visibleIntervals == nil {
  39. section.visibleIntervals = readResolvedChunks(section.chunks, int64(section.sectionIndex)*SectionSize, (int64(section.sectionIndex)+1)*SectionSize)
  40. section.chunks, _ = SeparateGarbageChunks(section.visibleIntervals, section.chunks)
  41. if section.reader != nil {
  42. _ = section.reader.Close()
  43. section.reader = nil
  44. }
  45. }
  46. if section.chunkViews == nil {
  47. section.chunkViews = ViewFromVisibleIntervals(section.visibleIntervals, int64(section.sectionIndex)*SectionSize, (int64(section.sectionIndex)+1)*SectionSize)
  48. }
  49. if section.reader == nil {
  50. section.reader = NewChunkReaderAtFromClient(group.lookupFn, section.chunkViews, group.chunkCache, min(int64(section.sectionIndex+1)*SectionSize, fileSize))
  51. }
  52. section.reader.fileSize = fileSize
  53. }
  54. func (section *FileChunkSection) readDataAt(group *ChunkGroup, fileSize int64, buff []byte, offset int64) (n int, tsNs int64, err error) {
  55. section.lock.Lock()
  56. defer section.lock.Unlock()
  57. section.setupForRead(group, fileSize)
  58. return section.reader.ReadAtWithTime(buff, offset)
  59. }
  60. func (section *FileChunkSection) DataStartOffset(group *ChunkGroup, offset int64, fileSize int64) int64 {
  61. section.lock.Lock()
  62. defer section.lock.Unlock()
  63. section.setupForRead(group, fileSize)
  64. for x := section.visibleIntervals.Front(); x != nil; x = x.Next {
  65. visible := x.Value
  66. if visible.stop <= offset {
  67. continue
  68. }
  69. if offset < visible.start {
  70. return offset
  71. }
  72. return offset
  73. }
  74. return -1
  75. }
  76. func (section *FileChunkSection) NextStopOffset(group *ChunkGroup, offset int64, fileSize int64) int64 {
  77. section.lock.Lock()
  78. defer section.lock.Unlock()
  79. section.setupForRead(group, fileSize)
  80. isAfterOffset := false
  81. for x := section.visibleIntervals.Front(); x != nil; x = x.Next {
  82. visible := x.Value
  83. if !isAfterOffset {
  84. if visible.stop <= offset {
  85. continue
  86. }
  87. isAfterOffset = true
  88. }
  89. if offset < visible.start {
  90. return offset
  91. }
  92. // now visible.start <= offset
  93. if offset < visible.stop {
  94. offset = visible.stop
  95. }
  96. }
  97. return offset
  98. }