forked from Silverfish/proton-bridge
- GODT-1158: simple on-disk cache in store - GODT-1158: better member naming in event loop - GODT-1158: create on-disk cache during bridge setup - GODT-1158: better job options - GODT-1158: rename GetLiteral to GetRFC822 - GODT-1158: rename events -> currentEvents - GODT-1158: unlock cache per-user - GODT-1158: clean up cache after logout - GODT-1158: randomized encrypted cache passphrase - GODT-1158: Opt out of on-disk cache in settings - GODT-1158: free space in cache - GODT-1158: make tests compile - GODT-1158: optional compression - GODT-1158: cache custom location - GODT-1158: basic capacity checker - GODT-1158: cache free space config - GODT-1158: only unlock cache if pmapi client is unlocked as well - GODT-1158: simple background sync worker - GODT-1158: set size/bodystructure when caching message - GODT-1158: limit store db update blocking with semaphore - GODT-1158: dumb 10-semaphore - GODT-1158: properly handle delete; remove bad bodystructure handling - GODT-1158: hacky fix for caching after logout... baaaaad - GODT-1158: cache worker - GODT-1158: compute body structure lazily - GODT-1158: cache size in store - GODT-1158: notify cacher when adding to store - GODT-1158: 15 second store cache watcher - GODT-1158: enable cacher - GODT-1158: better cache worker starting/stopping - GODT-1158: limit cacher to less concurrency than disk cache - GODT-1158: message builder prio + pchan pkg - GODT-1158: fix pchan, use in message builder - GODT-1158: no sem in cacher (rely on message builder prio) - GODT-1158: raise priority of existing jobs when requested - GODT-1158: pending messages in on-disk cache - GODT-1158: WIP just a note about deleting messages from disk cache - GODT-1158: pending wait when trying to write - GODT-1158: pending.add to return bool - GODT-1225: Headers in bodystructure are stored as bytes. - GODT-1158: fixing header caching - GODT-1158: don't cache in background - GODT-1158: all concurrency set in settings - GODT-1158: worker pools inside message builder - GODT-1158: fix linter issues - GODT-1158: remove completed builds from builder - GODT-1158: remove builder pool - GODT-1158: cacher defer job done properly - GODT-1158: fix linter - GODT-1299: Continue with bodystructure build if deserialization failed - GODT-1324: Delete messages from the cache when they are deleted on the server - GODT-1158: refactor cache tests - GODT-1158: move builder to app/bridge - GODT-1306: Migrate cache on disk when location is changed (and delete when disabled)
105 lines
2.6 KiB
Go
105 lines
2.6 KiB
Go
// Copyright (c) 2021 Proton Technologies AG
|
|
//
|
|
// This file is part of ProtonMail Bridge.
|
|
//
|
|
// ProtonMail Bridge is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// ProtonMail Bridge is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with ProtonMail Bridge. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
package cache
|
|
|
|
import (
|
|
"errors"
|
|
"sync"
|
|
)
|
|
|
|
type inMemoryCache struct {
|
|
lock sync.RWMutex
|
|
data map[string]map[string][]byte
|
|
size, limit int
|
|
}
|
|
|
|
// NewInMemoryCache creates a new in memory cache which stores up to the given number of bytes of cached data.
|
|
// NOTE(GODT-1158): Make this threadsafe.
|
|
func NewInMemoryCache(limit int) Cache {
|
|
return &inMemoryCache{
|
|
data: make(map[string]map[string][]byte),
|
|
limit: limit,
|
|
}
|
|
}
|
|
|
|
func (c *inMemoryCache) Unlock(userID string, passphrase []byte) error {
|
|
c.data[userID] = make(map[string][]byte)
|
|
return nil
|
|
}
|
|
|
|
func (c *inMemoryCache) Delete(userID string) error {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
for _, message := range c.data[userID] {
|
|
c.size -= len(message)
|
|
}
|
|
|
|
delete(c.data, userID)
|
|
|
|
return nil
|
|
}
|
|
|
|
// Has returns whether the given message exists in the cache.
|
|
func (c *inMemoryCache) Has(userID, messageID string) bool {
|
|
if _, err := c.Get(userID, messageID); err != nil {
|
|
return false
|
|
}
|
|
|
|
return true
|
|
}
|
|
|
|
func (c *inMemoryCache) Get(userID, messageID string) ([]byte, error) {
|
|
c.lock.RLock()
|
|
defer c.lock.RUnlock()
|
|
|
|
literal, ok := c.data[userID][messageID]
|
|
if !ok {
|
|
return nil, errors.New("no such message in cache")
|
|
}
|
|
|
|
return literal, nil
|
|
}
|
|
|
|
// NOTE(GODT-1158): What to actually do when memory limit is reached? Replace something existing? Return error? Drop silently?
|
|
// NOTE(GODT-1158): Pull in cache-rotating feature from old IMAP cache.
|
|
func (c *inMemoryCache) Set(userID, messageID string, literal []byte) error {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
if c.size+len(literal) > c.limit {
|
|
return nil
|
|
}
|
|
|
|
c.size += len(literal)
|
|
c.data[userID][messageID] = literal
|
|
|
|
return nil
|
|
}
|
|
|
|
func (c *inMemoryCache) Rem(userID, messageID string) error {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
c.size -= len(c.data[userID][messageID])
|
|
|
|
delete(c.data[userID], messageID)
|
|
|
|
return nil
|
|
}
|