Justin Harms
45ae234694
- Updated caching logic to support size-based promotion filtering, ensuring that not all files may be promoted based on size constraints. - Implemented adaptive caching strategies with a new AdaptiveCacheManager to analyze access patterns and adjust caching strategies dynamically. - Introduced predictive caching features with a PredictiveCacheManager to prefetch content based on access patterns. - Added a CacheWarmer to preload popular content into the cache, improving access times for frequently requested files. - Refactored memory management with a DynamicCacheManager to adjust cache sizes based on system memory usage. - Enhanced VFS interface and file metadata handling to support new features and improve performance. - Updated tests to validate new caching behaviors and ensure reliability of the caching system.
88 lines
2.4 KiB
Go
88 lines
2.4 KiB
Go
// vfs/types/types.go
|
|
package types
|
|
|
|
import (
|
|
"os"
|
|
"time"
|
|
)
|
|
|
|
// FileInfo contains metadata about a cached file
|
|
type FileInfo struct {
|
|
Key string `json:"key"`
|
|
Size int64 `json:"size"`
|
|
ATime time.Time `json:"atime"` // Last access time
|
|
CTime time.Time `json:"ctime"` // Creation time
|
|
AccessCount int `json:"access_count"`
|
|
}
|
|
|
|
// NewFileInfo creates a new FileInfo with the given key and current timestamp
|
|
func NewFileInfo(key string, size int64) *FileInfo {
|
|
now := time.Now()
|
|
return &FileInfo{
|
|
Key: key,
|
|
Size: size,
|
|
ATime: now,
|
|
CTime: now,
|
|
AccessCount: 1,
|
|
}
|
|
}
|
|
|
|
// NewFileInfoFromOS creates a FileInfo from os.FileInfo
|
|
func NewFileInfoFromOS(info os.FileInfo, key string) *FileInfo {
|
|
return &FileInfo{
|
|
Key: key,
|
|
Size: info.Size(),
|
|
ATime: time.Now(), // We don't have access time from os.FileInfo
|
|
CTime: info.ModTime(),
|
|
AccessCount: 1,
|
|
}
|
|
}
|
|
|
|
// UpdateAccess updates the access time and increments the access count
|
|
func (fi *FileInfo) UpdateAccess() {
|
|
fi.ATime = time.Now()
|
|
fi.AccessCount++
|
|
}
|
|
|
|
// BatchedTimeUpdate provides a way to batch time updates for better performance
|
|
type BatchedTimeUpdate struct {
|
|
currentTime time.Time
|
|
lastUpdate time.Time
|
|
updateInterval time.Duration
|
|
}
|
|
|
|
// NewBatchedTimeUpdate creates a new batched time updater
|
|
func NewBatchedTimeUpdate(interval time.Duration) *BatchedTimeUpdate {
|
|
now := time.Now()
|
|
return &BatchedTimeUpdate{
|
|
currentTime: now,
|
|
lastUpdate: now,
|
|
updateInterval: interval,
|
|
}
|
|
}
|
|
|
|
// GetTime returns the current cached time, updating it if necessary
|
|
func (btu *BatchedTimeUpdate) GetTime() time.Time {
|
|
now := time.Now()
|
|
if now.Sub(btu.lastUpdate) >= btu.updateInterval {
|
|
btu.currentTime = now
|
|
btu.lastUpdate = now
|
|
}
|
|
return btu.currentTime
|
|
}
|
|
|
|
// UpdateAccessBatched updates the access time using batched time updates
|
|
func (fi *FileInfo) UpdateAccessBatched(btu *BatchedTimeUpdate) {
|
|
fi.ATime = btu.GetTime()
|
|
fi.AccessCount++
|
|
}
|
|
|
|
// GetTimeDecayedScore calculates a score based on access time and frequency
|
|
// More recent and frequent accesses get higher scores
|
|
func (fi *FileInfo) GetTimeDecayedScore() float64 {
|
|
timeSinceAccess := time.Since(fi.ATime).Hours()
|
|
decayFactor := 1.0 / (1.0 + timeSinceAccess/24.0) // Decay over days
|
|
frequencyBonus := float64(fi.AccessCount) * 0.1
|
|
return decayFactor + frequencyBonus
|
|
}
|