filehandle.go 2.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596
  1. package mount
  2. import (
  3. "github.com/chrislusf/seaweedfs/weed/filer"
  4. "github.com/chrislusf/seaweedfs/weed/glog"
  5. "github.com/chrislusf/seaweedfs/weed/pb/filer_pb"
  6. "github.com/chrislusf/seaweedfs/weed/util"
  7. "io"
  8. "sort"
  9. "sync"
  10. )
  11. type FileHandleId uint64
  12. type FileHandle struct {
  13. fh FileHandleId
  14. counter int64
  15. entry *filer_pb.Entry
  16. chunkAddLock sync.Mutex
  17. inode uint64
  18. wfs *WFS
  19. // cache file has been written to
  20. dirtyMetadata bool
  21. dirtyPages *PageWriter
  22. entryViewCache []filer.VisibleInterval
  23. reader io.ReaderAt
  24. contentType string
  25. handle uint64
  26. sync.Mutex
  27. isDeleted bool
  28. }
  29. func newFileHandle(wfs *WFS, handleId FileHandleId, inode uint64, entry *filer_pb.Entry) *FileHandle {
  30. fh := &FileHandle{
  31. fh: handleId,
  32. counter: 1,
  33. inode: inode,
  34. wfs: wfs,
  35. }
  36. // dirtyPages: newContinuousDirtyPages(file, writeOnly),
  37. fh.dirtyPages = newPageWriter(fh, wfs.option.ChunkSizeLimit)
  38. if entry != nil {
  39. entry.Attributes.FileSize = filer.FileSize(entry)
  40. }
  41. return fh
  42. }
  43. func (fh *FileHandle) FullPath() util.FullPath {
  44. fp, _ := fh.wfs.inodeToPath.GetPath(fh.inode)
  45. return fp
  46. }
  47. func (fh *FileHandle) addChunks(chunks []*filer_pb.FileChunk) {
  48. // find the earliest incoming chunk
  49. newChunks := chunks
  50. earliestChunk := newChunks[0]
  51. for i := 1; i < len(newChunks); i++ {
  52. if lessThan(earliestChunk, newChunks[i]) {
  53. earliestChunk = newChunks[i]
  54. }
  55. }
  56. if fh.entry == nil {
  57. return
  58. }
  59. // pick out-of-order chunks from existing chunks
  60. for _, chunk := range fh.entry.Chunks {
  61. if lessThan(earliestChunk, chunk) {
  62. chunks = append(chunks, chunk)
  63. }
  64. }
  65. // sort incoming chunks
  66. sort.Slice(chunks, func(i, j int) bool {
  67. return lessThan(chunks[i], chunks[j])
  68. })
  69. glog.V(4).Infof("%s existing %d chunks adds %d more", fh.FullPath(), len(fh.entry.Chunks), len(chunks))
  70. fh.chunkAddLock.Lock()
  71. fh.entry.Chunks = append(fh.entry.Chunks, newChunks...)
  72. fh.entryViewCache = nil
  73. fh.chunkAddLock.Unlock()
  74. }
  75. func lessThan(a, b *filer_pb.FileChunk) bool {
  76. if a.Mtime == b.Mtime {
  77. return a.Fid.FileKey < b.Fid.FileKey
  78. }
  79. return a.Mtime < b.Mtime
  80. }