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.

74 lines
1.8 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
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 mount
  2. import (
  3. "syscall"
  4. "github.com/hanwen/go-fuse/v2/fuse"
  5. "github.com/seaweedfs/seaweedfs/weed/filer"
  6. "github.com/seaweedfs/seaweedfs/weed/glog"
  7. )
  8. // These are non-POSIX extensions
  9. const (
  10. SEEK_DATA uint32 = 3 // seek to next data after the offset
  11. SEEK_HOLE uint32 = 4 // seek to next hole after the offset
  12. ENXIO = fuse.Status(syscall.ENXIO)
  13. )
  14. // Lseek finds next data or hole segments after the specified offset
  15. // See https://man7.org/linux/man-pages/man2/lseek.2.html
  16. func (wfs *WFS) Lseek(cancel <-chan struct{}, in *fuse.LseekIn, out *fuse.LseekOut) fuse.Status {
  17. // not a documented feature
  18. if in.Padding != 0 {
  19. return fuse.EINVAL
  20. }
  21. if in.Whence != SEEK_DATA && in.Whence != SEEK_HOLE {
  22. return fuse.EINVAL
  23. }
  24. // file must exist
  25. fh := wfs.GetHandle(FileHandleId(in.Fh))
  26. if fh == nil {
  27. return fuse.EBADF
  28. }
  29. // lock the file until the proper offset was calculated
  30. fh.Lock()
  31. defer fh.Unlock()
  32. fh.entryLock.Lock()
  33. defer fh.entryLock.Unlock()
  34. fileSize := int64(filer.FileSize(fh.GetEntry()))
  35. offset := max(int64(in.Offset), 0)
  36. glog.V(4).Infof(
  37. "Lseek %s fh %d in [%d,%d], whence %d",
  38. fh.FullPath(), fh.fh, offset, fileSize, in.Whence,
  39. )
  40. // can neither seek beyond file nor seek to a hole at the end of the file with SEEK_DATA
  41. if offset > fileSize {
  42. return ENXIO
  43. } else if in.Whence == SEEK_DATA && offset == fileSize {
  44. return ENXIO
  45. }
  46. // search chunks for the offset
  47. found, offset := fh.entryChunkGroup.SearchChunks(offset, fileSize, in.Whence)
  48. if found {
  49. out.Offset = uint64(offset)
  50. return fuse.OK
  51. }
  52. // in case we found no exact matches, we return the recommended fallbacks, that is:
  53. // original offset for SEEK_DATA or end of file for an implicit hole
  54. if in.Whence == SEEK_DATA {
  55. out.Offset = in.Offset
  56. } else {
  57. out.Offset = uint64(fileSize)
  58. }
  59. return fuse.OK
  60. }