mirror of
https://github.com/seaweedfs/seaweedfs.git
synced 2024-12-13 17:56:44 +08: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
91 lines
1.8 KiB
Go
91 lines
1.8 KiB
Go
package mount
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"github.com/seaweedfs/seaweedfs/weed/pb/filer_pb"
|
|
)
|
|
|
|
type FileHandleToInode struct {
|
|
sync.RWMutex
|
|
nextFh FileHandleId
|
|
inode2fh map[uint64]*FileHandle
|
|
fh2inode map[FileHandleId]uint64
|
|
}
|
|
|
|
func NewFileHandleToInode() *FileHandleToInode {
|
|
return &FileHandleToInode{
|
|
inode2fh: make(map[uint64]*FileHandle),
|
|
fh2inode: make(map[FileHandleId]uint64),
|
|
nextFh: 0,
|
|
}
|
|
}
|
|
|
|
func (i *FileHandleToInode) GetFileHandle(fh FileHandleId) *FileHandle {
|
|
i.RLock()
|
|
defer i.RUnlock()
|
|
inode, found := i.fh2inode[fh]
|
|
if found {
|
|
return i.inode2fh[inode]
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (i *FileHandleToInode) FindFileHandle(inode uint64) (fh *FileHandle, found bool) {
|
|
i.RLock()
|
|
defer i.RUnlock()
|
|
fh, found = i.inode2fh[inode]
|
|
return
|
|
}
|
|
|
|
func (i *FileHandleToInode) AcquireFileHandle(wfs *WFS, inode uint64, entry *filer_pb.Entry) *FileHandle {
|
|
i.Lock()
|
|
defer i.Unlock()
|
|
fh, found := i.inode2fh[inode]
|
|
if !found {
|
|
fh = newFileHandle(wfs, i.nextFh, inode, entry)
|
|
i.nextFh++
|
|
i.inode2fh[inode] = fh
|
|
i.fh2inode[fh.fh] = inode
|
|
} else {
|
|
fh.counter++
|
|
}
|
|
if fh.GetEntry() != entry {
|
|
fh.SetEntry(entry)
|
|
}
|
|
return fh
|
|
}
|
|
|
|
func (i *FileHandleToInode) ReleaseByInode(inode uint64) {
|
|
i.Lock()
|
|
defer i.Unlock()
|
|
fh, found := i.inode2fh[inode]
|
|
if found {
|
|
fh.counter--
|
|
if fh.counter <= 0 {
|
|
delete(i.inode2fh, inode)
|
|
delete(i.fh2inode, fh.fh)
|
|
fh.ReleaseHandle()
|
|
}
|
|
}
|
|
}
|
|
func (i *FileHandleToInode) ReleaseByHandle(fh FileHandleId) {
|
|
i.Lock()
|
|
defer i.Unlock()
|
|
inode, found := i.fh2inode[fh]
|
|
if found {
|
|
fhHandle, fhFound := i.inode2fh[inode]
|
|
if !fhFound {
|
|
delete(i.fh2inode, fh)
|
|
} else {
|
|
fhHandle.counter--
|
|
if fhHandle.counter <= 0 {
|
|
delete(i.inode2fh, inode)
|
|
delete(i.fh2inode, fhHandle.fh)
|
|
fhHandle.ReleaseHandle()
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|