Initial commit
This commit is contained in:
111
keyedmutex_test.go
Normal file
111
keyedmutex_test.go
Normal file
@@ -0,0 +1,111 @@
|
||||
package keyedmutex
|
||||
|
||||
import (
|
||||
"sync"
|
||||
"testing"
|
||||
)
|
||||
|
||||
func TestLock_CleansUpMap(t *testing.T) {
|
||||
m := New[string]()
|
||||
m.Lock("a")
|
||||
m.Unlock("a")
|
||||
if len(m.byKey) != 0 {
|
||||
t.Fatalf("expected empty byKey, got %v", m.byKey)
|
||||
}
|
||||
}
|
||||
|
||||
func TestTryLock_SucceedsOnFreeKey(t *testing.T) {
|
||||
m := New[string]()
|
||||
if !m.TryLock("a") {
|
||||
t.Fatal("expected TryLock to succeed on free key")
|
||||
}
|
||||
m.Unlock("a")
|
||||
}
|
||||
|
||||
func TestTryLock_FailsOnLockedKey(t *testing.T) {
|
||||
m := New[string]()
|
||||
m.Lock("a")
|
||||
if m.TryLock("a") {
|
||||
t.Fatal("expected TryLock to fail on locked key")
|
||||
}
|
||||
m.Unlock("a")
|
||||
}
|
||||
|
||||
func TestTryLock_FailureDoesNotCorruptLock(t *testing.T) {
|
||||
// A failed TryLock must not call Unlock on the key's mutex.
|
||||
// The old bug did this unconditionally, so the Unlock below would
|
||||
// double-unlock and panic.
|
||||
m := New[string]()
|
||||
m.Lock("a")
|
||||
m.TryLock("a") // must return false and leave the lock intact
|
||||
m.Unlock("a") // must not panic
|
||||
}
|
||||
|
||||
func TestTryLock_FailureDecrementsCount(t *testing.T) {
|
||||
// A failed TryLock must undo its getLock increment so that the
|
||||
// original holder's Unlock cleans up the map entry.
|
||||
m := New[string]()
|
||||
m.Lock("a")
|
||||
m.TryLock("a") // fails; a leaked count would leave a stale map entry
|
||||
m.Unlock("a")
|
||||
if len(m.byKey) != 0 {
|
||||
t.Fatalf("expected empty byKey after unlock, got %v", m.byKey)
|
||||
}
|
||||
}
|
||||
|
||||
func TestMultipleKeys_AreIndependent(t *testing.T) {
|
||||
m := New[string]()
|
||||
m.Lock("a")
|
||||
if !m.TryLock("b") {
|
||||
t.Fatal("expected TryLock on different key to succeed while 'a' is locked")
|
||||
}
|
||||
m.Unlock("b")
|
||||
m.Unlock("a")
|
||||
}
|
||||
|
||||
func TestConcurrentLock_MutualExclusion(t *testing.T) {
|
||||
m := New[string]()
|
||||
const N = 100
|
||||
var wg sync.WaitGroup
|
||||
var shared int // intentionally non-atomic: race detector catches improper access
|
||||
|
||||
for range N {
|
||||
wg.Add(1)
|
||||
go func() {
|
||||
defer wg.Done()
|
||||
m.Lock("a")
|
||||
shared++
|
||||
m.Unlock("a")
|
||||
}()
|
||||
}
|
||||
|
||||
wg.Wait()
|
||||
|
||||
if shared != N {
|
||||
t.Fatalf("expected %d, got %d", N, shared)
|
||||
}
|
||||
if len(m.byKey) != 0 {
|
||||
t.Fatalf("expected empty byKey after all goroutines done, got %v", m.byKey)
|
||||
}
|
||||
}
|
||||
|
||||
func TestKeyedMutex_unlockUnlocked(t *testing.T) {
|
||||
defer func() {
|
||||
if r := recover(); r == nil {
|
||||
t.Fatal(r)
|
||||
}
|
||||
}()
|
||||
|
||||
m := New[string]()
|
||||
m.Unlock("aldkfj")
|
||||
}
|
||||
|
||||
func BenchmarkUncontendedMutex(b *testing.B) {
|
||||
m := New[string]()
|
||||
key := "xyz"
|
||||
|
||||
for b.Loop() {
|
||||
m.Lock(key)
|
||||
m.Unlock(key)
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user