Files
upstream-corteza/server/pkg/rbac/user_cache.go
upstream-mirror 7e385fc126
Some checks failed
SonarQube / SonarQube (push) Failing after 5m28s
E2e test on main branch push / server and client test (map[name:admin port:8080]) (push) Failing after 3m33s
Server and lib tests / Library test (js) (push) Failing after 1m36s
Server and lib tests / Library test (vue) (push) Successful in 2m24s
Server and lib tests / Web client test (admin) (push) Successful in 2m52s
Server and lib tests / Web client test (compose) (push) Successful in 3m23s
Server and lib tests / Web client test (discovery) (push) Successful in 2m49s
Server and lib tests / Web client test (one) (push) Successful in 2m52s
Server and lib tests / Web client test (privacy) (push) Successful in 2m44s
Server and lib tests / Web client test (reporter) (push) Successful in 2m56s
Server and lib tests / Web client test (workflow) (push) Successful in 3m0s
Server and lib tests / Server tests (push) Failing after 4m55s
E2e test on main branch push / notify-failure (push) Failing after 9s
Server and lib tests / Send matrix testing notification (push) Successful in 2s
Mark stale issues and pull requests / stale (push) Successful in 40s
snapshot of https://github.com/cortezaproject/corteza.git (2024.9.x, 2026-09-18; blobs > 131072B omitted)
2026-09-18 01:22:23 +05:00

51 lines
1.2 KiB
Go

package rbac
import "sync"
const userCacheMaxSize = 1024
// userCache is a bounded, goroutine-safe cache of user property maps
// used by the RBAC user resolver to avoid repeated DB lookups per Check() call.
//
// When the cache reaches userCacheMaxSize entries, it is cleared before inserting
// the new entry. This simple eviction strategy avoids unbounded memory growth while
// keeping implementation complexity minimal.
type userCache struct {
mu sync.RWMutex
entries map[uint64]map[string]interface{}
}
func newUserCache() userCache {
return userCache{
entries: make(map[uint64]map[string]interface{}),
}
}
func (c *userCache) load(userID uint64) (map[string]interface{}, bool) {
c.mu.RLock()
defer c.mu.RUnlock()
v, ok := c.entries[userID]
return v, ok
}
func (c *userCache) store(userID uint64, data map[string]interface{}) {
c.mu.Lock()
defer c.mu.Unlock()
if len(c.entries) >= userCacheMaxSize {
c.entries = make(map[uint64]map[string]interface{})
}
c.entries[userID] = data
}
func (c *userCache) delete(userID uint64) {
c.mu.Lock()
defer c.mu.Unlock()
delete(c.entries, userID)
}
func (c *userCache) purge() {
c.mu.Lock()
defer c.mu.Unlock()
c.entries = make(map[uint64]map[string]interface{})
}