libgocryptfs/internal/fusefrontend/dircache.go

183 lines
4.3 KiB
Go
Raw Normal View History

2019-01-02 22:32:21 +01:00
package fusefrontend
import (
"fmt"
"log"
"sync"
"syscall"
"time"
"github.com/rfjakob/gocryptfs/v2/internal/tlog"
2019-01-02 22:32:21 +01:00
)
const (
// Number of entries in the dirCache.
// 20 entries work well for "git stat" on a small git repo on sshfs.
2019-01-05 02:10:03 +01:00
// Keep in sync with test_helpers.maxCacheFds !
// TODO: How to share this constant without causing an import cycle?
dirCacheSize = 20
// Enable Lookup/Store/Clear debug messages
enableDebugMessages = false
// Enable hit rate statistics printing
enableStats = false
)
type dirCacheEntry struct {
// pointer to the Node this entry belongs to
node *Node
2019-01-02 22:32:21 +01:00
// fd to the directory (opened with O_PATH!)
fd int
// content of gocryptfs.diriv in this directory
iv []byte
}
func (e *dirCacheEntry) Clear() {
// An earlier clear may have already closed the fd, or the cache
// has never been filled (fd is 0 in that case).
// Note: package ensurefds012, imported from main, guarantees that dirCache
// can never get fds 0,1,2.
if e.fd > 0 {
err := syscall.Close(e.fd)
if err != nil {
tlog.Warn.Printf("dirCache.Clear: Close failed: %v", err)
}
}
e.fd = -1
e.node = nil
e.iv = nil
}
type dirCache struct {
sync.Mutex
// Expected length of the stored IVs. Only used for sanity checks.
// Usually set to 16, but 0 in plaintextnames mode.
ivLen int
// Cache entries
entries [dirCacheSize]dirCacheEntry
// Where to store the next entry (index into entries)
nextIndex int
2019-01-05 02:10:03 +01:00
// On the first Lookup(), the expire thread is started, and this flag is set
2019-01-02 22:32:21 +01:00
// to true.
expireThreadRunning bool
// Hit rate stats. Evaluated and reset by the expire thread.
lookups uint64
hits uint64
2019-01-02 22:32:21 +01:00
}
// Clear clears the cache contents.
func (d *dirCache) Clear() {
d.dbg("Clear\n")
2019-01-02 22:32:21 +01:00
d.Lock()
defer d.Unlock()
for i := range d.entries {
d.entries[i].Clear()
2019-01-02 22:32:21 +01:00
}
}
// Store the entry in the cache. The passed "fd" will be Dup()ed, and the caller
// can close their copy at will.
func (d *dirCache) Store(node *Node, fd int, iv []byte) {
// Note: package ensurefds012, imported from main, guarantees that dirCache
// can never get fds 0,1,2.
if fd <= 0 || len(iv) != d.ivLen {
2019-01-02 22:32:21 +01:00
log.Panicf("Store sanity check failed: fd=%d len=%d", fd, len(iv))
}
d.Lock()
defer d.Unlock()
e := &d.entries[d.nextIndex]
// Round-robin works well enough
d.nextIndex = (d.nextIndex + 1) % dirCacheSize
2019-01-02 22:32:21 +01:00
// Close the old fd
e.Clear()
2019-01-02 22:32:21 +01:00
fd2, err := syscall.Dup(fd)
if err != nil {
tlog.Warn.Printf("dirCache.Store: Dup failed: %v", err)
return
}
d.dbg("dirCache.Store %p fd=%d iv=%x\n", node, fd2, iv)
e.fd = fd2
e.node = node
e.iv = iv
2019-01-02 22:32:21 +01:00
// expireThread is started on the first Lookup()
if !d.expireThreadRunning {
d.expireThreadRunning = true
go d.expireThread()
}
}
// Lookup checks if relPath is in the cache, and returns an (fd, iv) pair.
2019-01-02 22:32:21 +01:00
// It returns (-1, nil) if not found. The fd is internally Dup()ed and the
// caller must close it when done.
func (d *dirCache) Lookup(node *Node) (fd int, iv []byte) {
2019-01-02 22:32:21 +01:00
d.Lock()
defer d.Unlock()
if enableStats {
d.lookups++
}
var e *dirCacheEntry
for i := range d.entries {
e = &d.entries[i]
if e.fd <= 0 {
// Cache slot is empty
continue
}
if node != e.node {
// Not the right path
continue
}
var err error
fd, err = syscall.Dup(e.fd)
if err != nil {
tlog.Warn.Printf("dirCache.Lookup: Dup failed: %v", err)
return -1, nil
}
iv = e.iv
break
2019-01-02 22:32:21 +01:00
}
if fd == 0 {
d.dbg("dirCache.Lookup %p miss\n", node)
2019-01-02 22:32:21 +01:00
return -1, nil
}
if enableStats {
d.hits++
2019-01-02 22:32:21 +01:00
}
if fd <= 0 || len(iv) != d.ivLen {
log.Panicf("Lookup sanity check failed: fd=%d len=%d", fd, len(iv))
2019-01-02 22:32:21 +01:00
}
d.dbg("dirCache.Lookup %p hit fd=%d dup=%d iv=%x\n", node, e.fd, fd, iv)
return fd, iv
2019-01-02 22:32:21 +01:00
}
// expireThread is started on the first Lookup()
func (d *dirCache) expireThread() {
2019-01-02 22:32:21 +01:00
for {
time.Sleep(60 * time.Second)
2019-01-02 22:32:21 +01:00
d.Clear()
d.stats()
}
}
// stats prints hit rate statistics and resets the counters. No-op if
// enableStats == false.
func (d *dirCache) stats() {
if !enableStats {
return
}
d.Lock()
lookups := d.lookups
hits := d.hits
d.lookups = 0
d.hits = 0
d.Unlock()
if lookups > 0 {
fmt.Printf("dirCache: hits=%3d lookups=%3d, rate=%3d%%\n", hits, lookups, (hits*100)/lookups)
2019-01-02 22:32:21 +01:00
}
}
// dbg prints a debug message. Usually disabled.
func (d *dirCache) dbg(format string, a ...interface{}) {
if enableDebugMessages {
2019-01-02 22:32:21 +01:00
fmt.Printf(format, a...)
}
}