2019-01-02 22:32:21 +01:00
|
|
|
package fusefrontend
|
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
|
|
|
"log"
|
|
|
|
"sync"
|
|
|
|
"syscall"
|
|
|
|
"time"
|
|
|
|
|
|
|
|
"github.com/rfjakob/gocryptfs/internal/nametransform"
|
|
|
|
"github.com/rfjakob/gocryptfs/internal/tlog"
|
|
|
|
)
|
|
|
|
|
2019-01-04 21:45:03 +01:00
|
|
|
const (
|
|
|
|
// Number of entries in the dirCache. Three entries work well for two
|
|
|
|
// (probably also three) parallel tar extracts (hit rate around 92%).
|
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?
|
2019-01-04 21:45:03 +01:00
|
|
|
dirCacheSize = 3
|
|
|
|
// Enable Lookup/Store/Clear debug messages
|
|
|
|
enableDebugMessages = false
|
|
|
|
// Enable hit rate statistics printing
|
2019-01-04 22:06:28 +01:00
|
|
|
enableStats = false
|
2019-01-04 21:45:03 +01:00
|
|
|
)
|
|
|
|
|
|
|
|
type dirCacheEntryStruct struct {
|
2019-01-02 22:32:21 +01:00
|
|
|
// relative plaintext path to the directory
|
|
|
|
dirRelPath string
|
|
|
|
// fd to the directory (opened with O_PATH!)
|
|
|
|
fd int
|
|
|
|
// content of gocryptfs.diriv in this directory
|
|
|
|
iv []byte
|
2019-01-04 21:45:03 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func (e *dirCacheEntryStruct) Clear() {
|
|
|
|
// An earlier clear may have already closed the fd, or the cache
|
|
|
|
// has never been filled (fd is 0 in that case).
|
2019-01-05 15:44:32 +01:00
|
|
|
// Note: package ensurefds012, imported from main, guarantees that dirCache
|
|
|
|
// can never get fds 0,1,2.
|
2019-01-04 21:45:03 +01:00
|
|
|
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.dirRelPath = ""
|
|
|
|
e.iv = nil
|
|
|
|
}
|
|
|
|
|
|
|
|
type dirCacheStruct struct {
|
|
|
|
sync.Mutex
|
|
|
|
// Cache entries
|
|
|
|
entries [dirCacheSize]dirCacheEntryStruct
|
|
|
|
// 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
|
2019-01-04 21:45:03 +01:00
|
|
|
// 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 *dirCacheStruct) Clear() {
|
|
|
|
d.Lock()
|
|
|
|
defer d.Unlock()
|
2019-01-04 21:45:03 +01:00
|
|
|
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 *dirCacheStruct) Store(dirRelPath string, fd int, iv []byte) {
|
2019-01-05 15:44:32 +01:00
|
|
|
// Note: package ensurefds012, imported from main, guarantees that dirCache
|
|
|
|
// can never get fds 0,1,2.
|
2019-01-02 22:32:21 +01:00
|
|
|
if fd <= 0 || len(iv) != nametransform.DirIVLen {
|
|
|
|
log.Panicf("Store sanity check failed: fd=%d len=%d", fd, len(iv))
|
|
|
|
}
|
|
|
|
d.Lock()
|
|
|
|
defer d.Unlock()
|
2019-01-04 21:45:03 +01:00
|
|
|
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
|
2019-01-04 21:45:03 +01:00
|
|
|
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("Store: %q %d %x\n", dirRelPath, fd2, iv)
|
2019-01-04 21:45:03 +01:00
|
|
|
e.fd = fd2
|
|
|
|
e.dirRelPath = dirRelPath
|
|
|
|
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()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-01-04 21:45:03 +01:00
|
|
|
// 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 *dirCacheStruct) Lookup(dirRelPath string) (fd int, iv []byte) {
|
|
|
|
d.Lock()
|
|
|
|
defer d.Unlock()
|
2019-01-04 21:45:03 +01:00
|
|
|
if enableStats {
|
|
|
|
d.lookups++
|
|
|
|
}
|
|
|
|
for i := range d.entries {
|
|
|
|
e := &d.entries[i]
|
|
|
|
if e.fd <= 0 {
|
|
|
|
// Cache slot is empty
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
if dirRelPath != e.dirRelPath {
|
|
|
|
// 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
|
2019-01-04 23:35:48 +01:00
|
|
|
break
|
2019-01-02 22:32:21 +01:00
|
|
|
}
|
2019-01-04 21:45:03 +01:00
|
|
|
if fd == 0 {
|
2019-01-02 22:32:21 +01:00
|
|
|
d.dbg("Lookup %q: miss\n", dirRelPath)
|
|
|
|
return -1, nil
|
|
|
|
}
|
2019-01-04 21:45:03 +01:00
|
|
|
if enableStats {
|
|
|
|
d.hits++
|
2019-01-02 22:32:21 +01:00
|
|
|
}
|
2019-01-04 21:45:03 +01:00
|
|
|
if fd <= 0 || len(iv) != nametransform.DirIVLen {
|
|
|
|
log.Panicf("Lookup sanity check failed: fd=%d len=%d", fd, len(iv))
|
2019-01-02 22:32:21 +01:00
|
|
|
}
|
2019-01-04 21:45:03 +01:00
|
|
|
d.dbg("Lookup %q: hit %d %x\n", dirRelPath, fd, iv)
|
|
|
|
return fd, iv
|
2019-01-02 22:32:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// expireThread is started on the first Lookup()
|
|
|
|
func (d *dirCacheStruct) expireThread() {
|
|
|
|
for {
|
|
|
|
time.Sleep(1 * time.Second)
|
|
|
|
d.Clear()
|
2019-01-04 21:45:03 +01:00
|
|
|
if enableStats {
|
|
|
|
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 *dirCacheStruct) dbg(format string, a ...interface{}) {
|
2019-01-04 21:45:03 +01:00
|
|
|
if enableDebugMessages {
|
2019-01-02 22:32:21 +01:00
|
|
|
fmt.Printf(format, a...)
|
|
|
|
}
|
|
|
|
}
|