Use sync.Pool to reduce GC pressure

The benchmarks show a reduction in allocs without significant
performance regression.

Signed-off-by: Cory Snider <csnider@mirantis.com>

Author: corhere

mutexmap.go

@@ -24,6 +24,8 @@ type lockCtr struct {
 	waiters atomic.Int32 // Number of callers waiting to acquire the lock
 }
 
+var lockCtrPool = sync.Pool{New: func() any { return new(lockCtr) }}
+
 // Lock locks a mutex with the given name.
 func (l *MutexMap[T]) Lock(key T) {
 	l.mu.Lock()
@@ -33,7 +35,7 @@ func (l *MutexMap[T]) Lock(key T) {
 
 	nameLock, exists := l.locks[key]
 	if !exists {
-		nameLock = &lockCtr{}
+		nameLock = lockCtrPool.Get().(*lockCtr)
 		l.locks[key] = nameLock
 	}
 
@@ -61,6 +63,7 @@ func (l *MutexMap[T]) Unlock(key T) {
 
 	if nameLock.waiters.Load() <= 0 {
 		delete(l.locks, key)
+		defer lockCtrPool.Put(nameLock)
 	}
 	nameLock.Unlock()
 }

rwmutexmap.go

@@ -20,6 +20,8 @@ type rwlockCtr struct {
 	waiters atomic.Int32 // Number of callers waiting to acquire the lock
 }
 
+var rwlockCtrPool = sync.Pool{New: func() any { return new(rwlockCtr) }}
+
 func (l *RWMutexMap[T]) doLock(key T, op func(*sync.RWMutex)) {
 	l.mu.Lock()
 	if l.locks == nil {
@@ -28,7 +30,7 @@ func (l *RWMutexMap[T]) doLock(key T, op func(*sync.RWMutex)) {
 
 	nameLock, exists := l.locks[key]
 	if !exists {
-		nameLock = &rwlockCtr{}
+		nameLock = rwlockCtrPool.Get().(*rwlockCtr)
 		l.locks[key] = nameLock
 	}
 
@@ -64,6 +66,7 @@ func (l *RWMutexMap[T]) doUnlock(key T, op func(*sync.RWMutex)) {
 
 	if nameLock.waiters.Load() <= 0 {
 		delete(l.locks, key)
+		defer rwlockCtrPool.Put(nameLock)
 	}
 	op(&nameLock.RWMutex)
 }