* chore: remove unreachable dead code across the codebase Remove ~50,000 lines of unreachable code identified by static analysis. Major removals: - weed/filer/redis_lua: entire unused Redis Lua filer store implementation - weed/wdclient/net2, resource_pool: unused connection/resource pool packages - weed/plugin/worker/lifecycle: unused lifecycle plugin worker - weed/s3api: unused S3 policy templates, presigned URL IAM, streaming copy, multipart IAM, key rotation, and various SSE helper functions - weed/mq/kafka: unused partition mapping, compression, schema, and protocol functions - weed/mq/offset: unused SQL storage and migration code - weed/worker: unused registry, task, and monitoring functions - weed/query: unused SQL engine, parquet scanner, and type functions - weed/shell: unused EC proportional rebalance functions - weed/storage/erasure_coding/distribution: unused distribution analysis functions - Individual unreachable functions removed from 150+ files across admin, credential, filer, iam, kms, mount, mq, operation, pb, s3api, server, shell, storage, topology, and util packages * fix(s3): reset shared memory store in IAM test to prevent flaky failure TestLoadIAMManagerFromConfig_EmptyConfigWithFallbackKey was flaky because the MemoryStore credential backend is a singleton registered via init(). Earlier tests that create anonymous identities pollute the shared store, causing LookupAnonymous() to unexpectedly return true. Fix by calling Reset() on the memory store before the test runs. * style: run gofmt on changed files * fix: restore KMS functions used by integration tests * fix(plugin): prevent panic on send to closed worker session channel The Plugin.sendToWorker method could panic with "send on closed channel" when a worker disconnected while a message was being sent. The race was between streamSession.close() closing the outgoing channel and sendToWorker writing to it concurrently. Add a done channel to streamSession that is closed before the outgoing channel, and check it in sendToWorker's select to safely detect closed sessions without panicking.
178 lines
4.8 KiB
Go
178 lines
4.8 KiB
Go
package util
|
|
|
|
import (
|
|
"fmt"
|
|
"sync"
|
|
"sync/atomic"
|
|
|
|
"github.com/seaweedfs/seaweedfs/weed/glog"
|
|
)
|
|
|
|
// LockTable is a table of locks that can be acquired.
|
|
// Locks are acquired in order of request.
|
|
type LockTable[T comparable] struct {
|
|
lockIdSeq int64
|
|
mu sync.Mutex
|
|
locks map[T]*LockEntry
|
|
locksInFlight map[T]int
|
|
}
|
|
|
|
type LockEntry struct {
|
|
mu sync.Mutex
|
|
waiters []*ActiveLock // ordered waiters that are blocked by exclusive locks
|
|
activeSharedLockOwnerCount int32
|
|
activeExclusiveLockOwnerCount int32
|
|
cond *sync.Cond
|
|
}
|
|
|
|
type LockType int
|
|
|
|
const (
|
|
SharedLock LockType = iota
|
|
ExclusiveLock
|
|
)
|
|
|
|
type ActiveLock struct {
|
|
ID int64
|
|
isDeleted bool
|
|
intention string // for debugging
|
|
lockType LockType
|
|
}
|
|
|
|
func NewLockTable[T comparable]() *LockTable[T] {
|
|
return &LockTable[T]{
|
|
locks: make(map[T]*LockEntry),
|
|
locksInFlight: make(map[T]int),
|
|
}
|
|
}
|
|
|
|
func (lt *LockTable[T]) NewActiveLock(intention string, lockType LockType) *ActiveLock {
|
|
id := atomic.AddInt64(<.lockIdSeq, 1)
|
|
l := &ActiveLock{ID: id, intention: intention, lockType: lockType}
|
|
return l
|
|
}
|
|
|
|
func isNotFirstWaiter(lock *ActiveLock, entry *LockEntry) bool {
|
|
return len(entry.waiters) > 0 && lock.ID != entry.waiters[0].ID
|
|
}
|
|
|
|
func shouldWaitForExclusiveLock(lock *ActiveLock, entry *LockEntry) bool {
|
|
return !lock.isDeleted && (isNotFirstWaiter(lock, entry) || entry.activeExclusiveLockOwnerCount > 0 || entry.activeSharedLockOwnerCount > 0)
|
|
}
|
|
|
|
func shouldWaitForSharedLock(lock *ActiveLock, entry *LockEntry) bool {
|
|
return !lock.isDeleted && (isNotFirstWaiter(lock, entry) || entry.activeExclusiveLockOwnerCount > 0)
|
|
}
|
|
|
|
func (lt *LockTable[T]) AcquireLock(intention string, key T, lockType LockType) (lock *ActiveLock) {
|
|
lt.mu.Lock()
|
|
// Get or create the lock entry for the key
|
|
entry, exists := lt.locks[key]
|
|
if !exists {
|
|
entry = &LockEntry{}
|
|
entry.cond = sync.NewCond(&entry.mu)
|
|
lt.locks[key] = entry
|
|
lt.locksInFlight[key] = 0
|
|
}
|
|
lt.locksInFlight[key]++
|
|
lt.mu.Unlock()
|
|
|
|
lock = lt.NewActiveLock(intention, lockType)
|
|
|
|
// If the lock is held exclusively, wait
|
|
entry.mu.Lock()
|
|
if len(entry.waiters) > 0 || lockType == ExclusiveLock || entry.activeExclusiveLockOwnerCount > 0 {
|
|
if glog.V(4) {
|
|
fmt.Printf("ActiveLock %d %s wait for %+v type=%v with waiters %d active r%d w%d.\n", lock.ID, lock.intention, key, lockType, len(entry.waiters), entry.activeSharedLockOwnerCount, entry.activeExclusiveLockOwnerCount)
|
|
if len(entry.waiters) > 0 {
|
|
for _, waiter := range entry.waiters {
|
|
fmt.Printf(" %d", waiter.ID)
|
|
}
|
|
fmt.Printf("\n")
|
|
}
|
|
}
|
|
entry.waiters = append(entry.waiters, lock)
|
|
if lockType == ExclusiveLock {
|
|
for shouldWaitForExclusiveLock(lock, entry) {
|
|
entry.cond.Wait()
|
|
}
|
|
} else {
|
|
for shouldWaitForSharedLock(lock, entry) {
|
|
entry.cond.Wait()
|
|
}
|
|
}
|
|
// Remove the transaction from the waiters list
|
|
if len(entry.waiters) > 0 && lock.ID == entry.waiters[0].ID {
|
|
entry.waiters = entry.waiters[1:]
|
|
entry.cond.Broadcast()
|
|
}
|
|
}
|
|
|
|
// Otherwise, grant the lock
|
|
if glog.V(4) {
|
|
fmt.Printf("ActiveLock %d %s locked %+v type=%v with waiters %d active r%d w%d.\n", lock.ID, lock.intention, key, lockType, len(entry.waiters), entry.activeSharedLockOwnerCount, entry.activeExclusiveLockOwnerCount)
|
|
if len(entry.waiters) > 0 {
|
|
for _, waiter := range entry.waiters {
|
|
fmt.Printf(" %d", waiter.ID)
|
|
}
|
|
fmt.Printf("\n")
|
|
}
|
|
}
|
|
if lock.lockType == ExclusiveLock {
|
|
entry.activeExclusiveLockOwnerCount++
|
|
} else {
|
|
entry.activeSharedLockOwnerCount++
|
|
}
|
|
entry.mu.Unlock()
|
|
|
|
return lock
|
|
}
|
|
|
|
func (lt *LockTable[T]) ReleaseLock(key T, lock *ActiveLock) {
|
|
lt.mu.Lock()
|
|
defer lt.mu.Unlock()
|
|
|
|
entry, exists := lt.locks[key]
|
|
if !exists {
|
|
return
|
|
}
|
|
|
|
lt.locksInFlight[key]--
|
|
entry.mu.Lock()
|
|
defer entry.mu.Unlock()
|
|
|
|
// Remove the transaction from the waiters list
|
|
for i, waiter := range entry.waiters {
|
|
if waiter == lock {
|
|
waiter.isDeleted = true
|
|
entry.waiters = append(entry.waiters[:i], entry.waiters[i+1:]...)
|
|
break
|
|
}
|
|
}
|
|
|
|
if lock.lockType == ExclusiveLock {
|
|
entry.activeExclusiveLockOwnerCount--
|
|
} else {
|
|
entry.activeSharedLockOwnerCount--
|
|
}
|
|
|
|
// If there are no waiters, release the lock
|
|
if len(entry.waiters) == 0 && lt.locksInFlight[key] <= 0 && entry.activeExclusiveLockOwnerCount <= 0 && entry.activeSharedLockOwnerCount <= 0 {
|
|
delete(lt.locks, key)
|
|
delete(lt.locksInFlight, key)
|
|
}
|
|
|
|
if glog.V(4) {
|
|
fmt.Printf("ActiveLock %d %s unlocked %+v type=%v with waiters %d active r%d w%d.\n", lock.ID, lock.intention, key, lock.lockType, len(entry.waiters), entry.activeSharedLockOwnerCount, entry.activeExclusiveLockOwnerCount)
|
|
if len(entry.waiters) > 0 {
|
|
for _, waiter := range entry.waiters {
|
|
fmt.Printf(" %d", waiter.ID)
|
|
}
|
|
fmt.Printf("\n")
|
|
}
|
|
}
|
|
|
|
// Notify the next waiter
|
|
entry.cond.Broadcast()
|
|
}
|