Compare commits

...

3 Commits

Author SHA1 Message Date
Xe Iaso
f2cde94b71 test(decaymap): fix tests
Signed-off-by: Xe Iaso <me@xeiaso.net>
2025-12-28 18:46:32 -05:00
Xe Iaso
f56c242167 fix(decaymap): scratch that, once every 15 minutes
Signed-off-by: Xe Iaso <me@xeiaso.net>
2025-12-28 18:31:38 -05:00
Xe Iaso
a75d9066fd fix(decaymap): serialize use of decaymap, make decaying happen once per minute
Signed-off-by: Xe Iaso <me@xeiaso.net>
2025-12-28 18:30:37 -05:00
5 changed files with 18 additions and 28 deletions

View File

@@ -19,7 +19,7 @@ type Impl[K comparable, V any] struct {
// stopCh stops the background cleanup worker. // stopCh stops the background cleanup worker.
stopCh chan struct{} stopCh chan struct{}
wg sync.WaitGroup wg sync.WaitGroup
lock sync.RWMutex lock sync.Mutex
} }
type decayMapEntry[V any] struct { type decayMapEntry[V any] struct {
@@ -64,26 +64,28 @@ func (m *Impl[K, V]) expire(key K) bool {
// Delete a value from the DecayMap by key. // Delete a value from the DecayMap by key.
// //
// This defers deletions to a background thread for performance reasons.
//
// If the value does not exist, return false. Return true after // If the value does not exist, return false. Return true after
// deletion. // deletion.
func (m *Impl[K, V]) Delete(key K) bool { func (m *Impl[K, V]) Delete(key K) bool {
// Use a single write lock to avoid RUnlock->Lock convoy. select {
m.lock.Lock() // Defer decay deletion to the background worker to avoid convoy.
defer m.lock.Unlock() case m.deleteCh <- deleteReq[K]{key: key, expiry: time.Now().Add(-1 * time.Second)}:
_, ok := m.data[key] return m.expire(key)
if ok { default:
delete(m.data, key) // Channel full: drop request; a future Cleanup() or Get will retry.
return true
} }
return ok
} }
// Get gets a value from the DecayMap by key. // Get gets a value from the DecayMap by key.
// //
// If a value has expired, forcibly delete it if it was not updated. // If a value has expired, forcibly delete it if it was not updated.
func (m *Impl[K, V]) Get(key K) (V, bool) { func (m *Impl[K, V]) Get(key K) (V, bool) {
m.lock.RLock() m.lock.Lock()
defer m.lock.Unlock()
value, ok := m.data[key] value, ok := m.data[key]
m.lock.RUnlock()
if !ok { if !ok {
return Zilch[V](), false return Zilch[V](), false
@@ -129,8 +131,8 @@ func (m *Impl[K, V]) Cleanup() {
// Len returns the number of entries in the DecayMap. // Len returns the number of entries in the DecayMap.
func (m *Impl[K, V]) Len() int { func (m *Impl[K, V]) Len() int {
m.lock.RLock() m.lock.Lock()
defer m.lock.RUnlock() defer m.lock.Unlock()
return len(m.data) return len(m.data)
} }
@@ -146,7 +148,7 @@ func (m *Impl[K, V]) Close() {
func (m *Impl[K, V]) cleanupWorker() { func (m *Impl[K, V]) cleanupWorker() {
defer m.wg.Done() defer m.wg.Done()
batch := make([]deleteReq[K], 0, 64) batch := make([]deleteReq[K], 0, 64)
ticker := time.NewTicker(10 * time.Millisecond) ticker := time.NewTicker(15 * time.Minute)
defer ticker.Stop() defer ticker.Stop()
flush := func() { flush := func() {

View File

@@ -30,15 +30,7 @@ func TestImpl(t *testing.T) {
t.Error("got value even though it was supposed to be expired") t.Error("got value even though it was supposed to be expired")
} }
// Deletion of expired entries after Get is deferred to a background worker. dm.Cleanup()
// Assert it eventually disappears from the map.
deadline := time.Now().Add(200 * time.Millisecond)
for time.Now().Before(deadline) {
if dm.Len() == 0 {
break
}
time.Sleep(5 * time.Millisecond)
}
if dm.Len() != 0 { if dm.Len() != 0 {
t.Fatalf("expected background cleanup to remove expired key; len=%d", dm.Len()) t.Fatalf("expected background cleanup to remove expired key; len=%d", dm.Len())
} }

View File

@@ -11,6 +11,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
## [Unreleased] ## [Unreleased]
- The memory store now decays values every 15 minutes instead of every 10 milliseconds.
- Add Polish locale ([#1292](https://github.com/TecharoHQ/anubis/pull/1309)) - Add Polish locale ([#1292](https://github.com/TecharoHQ/anubis/pull/1309))
<!-- This changes the project to: --> <!-- This changes the project to: -->

View File

@@ -27,7 +27,7 @@ type impl struct {
} }
func (i *impl) Delete(_ context.Context, key string) error { func (i *impl) Delete(_ context.Context, key string) error {
if !i.store.Delete(key) { if _, ok := i.store.Get(key); !ok {
return fmt.Errorf("%w: %q", store.ErrNotFound, key) return fmt.Errorf("%w: %q", store.ErrNotFound, key)
} }

View File

@@ -57,10 +57,6 @@ func Common(t *testing.T, f store.Factory, config json.RawMessage) {
t.Error("wanted test to not exist in store but it exists anyways") t.Error("wanted test to not exist in store but it exists anyways")
} }
if err := s.Delete(t.Context(), t.Name()); err == nil {
t.Errorf("key %q does not exist and Delete did not return non-nil", t.Name())
}
return nil return nil
}, },
}, },
@@ -83,7 +79,6 @@ func Common(t *testing.T, f store.Factory, config json.RawMessage) {
}, },
} { } {
t.Run(tt.name, func(t *testing.T) { t.Run(tt.name, func(t *testing.T) {
t.Parallel()
if err := tt.doer(t, s); !errors.Is(err, tt.err) { if err := tt.doer(t, s); !errors.Is(err, tt.err) {
t.Logf("want: %v", tt.err) t.Logf("want: %v", tt.err)
t.Logf("got: %v", err) t.Logf("got: %v", err)