2023-09-22 01:24:34 +08:00
package util
import (
"fmt"
2023-09-22 02:04:12 +08:00
"github.com/seaweedfs/seaweedfs/weed/glog"
2023-09-22 01:24:34 +08:00
"sync"
"sync/atomic"
)
// LockTable is a table of locks that can be acquired.
// Locks are acquired in order of request.
type LockTable [ T comparable ] struct {
mu sync . Mutex
locks map [ T ] * LockEntry
lockIdSeq int64
}
type LockEntry struct {
2023-09-24 03:08:23 +08:00
mu sync . Mutex
waiters [ ] * ActiveLock // ordered waiters that are blocked by exclusive locks
activeSharedLockOwnerCount int32
activeExclusiveLockOwnerCount int32
cond * sync . Cond
2023-09-22 01:24:34 +08:00
}
type LockType int
const (
SharedLock LockType = iota
ExclusiveLock
)
type ActiveLock struct {
ID int64
isDeleted bool
intention string // for debugging
2023-09-24 03:08:23 +08:00
lockType LockType
2023-09-22 01:24:34 +08:00
}
func NewLockTable [ T comparable ] ( ) * LockTable [ T ] {
return & LockTable [ T ] {
locks : make ( map [ T ] * LockEntry ) ,
}
}
2023-09-24 03:08:23 +08:00
func ( lt * LockTable [ T ] ) NewActiveLock ( intention string , lockType LockType ) * ActiveLock {
2023-09-22 01:24:34 +08:00
id := atomic . AddInt64 ( & lt . lockIdSeq , 1 )
2023-09-24 03:08:23 +08:00
l := & ActiveLock { ID : id , intention : intention , lockType : lockType }
2023-09-22 01:24:34 +08:00
return l
}
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 . mu . Unlock ( )
2023-09-24 03:13:32 +08:00
lock = lt . NewActiveLock ( intention , lockType )
2023-09-22 01:24:34 +08:00
// If the lock is held exclusively, wait
entry . mu . Lock ( )
2023-09-24 03:28:02 +08:00
if len ( entry . waiters ) > 0 || lockType == ExclusiveLock || entry . activeExclusiveLockOwnerCount > 0 {
2023-09-22 14:51:32 +08:00
if glog . V ( 4 ) {
2023-09-24 03:08:23 +08:00
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 )
2023-09-22 14:51:32 +08:00
if len ( entry . waiters ) > 0 {
for _ , waiter := range entry . waiters {
fmt . Printf ( " %d" , waiter . ID )
}
fmt . Printf ( "\n" )
2023-09-22 01:24:34 +08:00
}
}
entry . waiters = append ( entry . waiters , lock )
if lockType == ExclusiveLock {
2023-09-24 03:08:23 +08:00
for ! lock . isDeleted && ( ( len ( entry . waiters ) > 0 && lock . ID != entry . waiters [ 0 ] . ID ) || entry . activeExclusiveLockOwnerCount > 0 || entry . activeSharedLockOwnerCount > 0 ) {
2023-09-22 01:24:34 +08:00
entry . cond . Wait ( )
}
} else {
2023-09-24 03:08:23 +08:00
for ! lock . isDeleted && ( len ( entry . waiters ) > 0 && lock . ID != entry . waiters [ 0 ] . ID ) || entry . activeExclusiveLockOwnerCount > 0 {
2023-09-22 01:24:34 +08:00
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
2023-09-22 14:51:32 +08:00
if glog . V ( 4 ) {
2023-09-24 03:08:23 +08:00
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 )
2023-09-22 14:51:32 +08:00
if len ( entry . waiters ) > 0 {
for _ , waiter := range entry . waiters {
fmt . Printf ( " %d" , waiter . ID )
}
fmt . Printf ( "\n" )
2023-09-22 01:24:34 +08:00
}
}
2023-09-24 03:08:23 +08:00
if lock . lockType == ExclusiveLock {
entry . activeExclusiveLockOwnerCount ++
} else {
entry . activeSharedLockOwnerCount ++
}
2023-09-22 01:24:34 +08:00
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
}
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 there are no waiters, release the lock
2023-09-24 03:43:00 +08:00
if len ( entry . waiters ) == 0 && entry . activeExclusiveLockOwnerCount <= 0 && entry . activeSharedLockOwnerCount <= 0 {
2023-09-22 01:24:34 +08:00
delete ( lt . locks , key )
}
2023-09-22 14:51:32 +08:00
if glog . V ( 4 ) {
2023-09-25 00:54:57 +08:00
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 )
2023-09-22 14:51:32 +08:00
if len ( entry . waiters ) > 0 {
for _ , waiter := range entry . waiters {
fmt . Printf ( " %d" , waiter . ID )
}
fmt . Printf ( "\n" )
2023-09-22 01:24:34 +08:00
}
}
2023-09-24 03:08:23 +08:00
if lock . lockType == ExclusiveLock {
entry . activeExclusiveLockOwnerCount --
} else {
entry . activeSharedLockOwnerCount --
}
2023-09-22 01:24:34 +08:00
// Notify the next waiter
entry . cond . Broadcast ( )
}
func main ( ) {
}