mirror of
https://github.com/go-gitea/gitea
synced 2024-11-25 03:02:54 +01:00
1e4be0945b
To help #31813, but do not replace it, since this PR just introduces the new module but misses some work: - New option in settings. `#31813` has done it. - Use the locks in business logic. `#31813` has done it. So I think the most efficient way is to merge this PR first (if it's acceptable) and then finish #31813. ## Design principles ### Use spinlock even in memory implementation In actual use cases, users may cancel requests. `sync.Mutex` will block the goroutine until the lock is acquired even if the request is canceled. And the spinlock is more suitable for this scenario since it's possible to give up the lock acquisition. Although the spinlock consumes more CPU resources, I think it's acceptable in most cases. ### Do not expose the mutex to callers If we expose the mutex to callers, it's possible for callers to reuse the mutex, which causes more complexity. For example: ```go lock := GetLocker(key) lock.Lock() // ... // even if the lock is unlocked, we cannot GC the lock, // since the caller may still use it again. lock.Unlock() lock.Lock() // ... lock.Unlock() // callers have to GC the lock manually. RemoveLocker(key) ``` That's why https://github.com/go-gitea/gitea/pull/31813#discussion_r1721200549 In this PR, we only expose `ReleaseFunc` to callers. So callers just need to call `ReleaseFunc` to release the lock, and do not need to care about the lock's lifecycle. ```go _, release, err := locker.Lock(ctx, key) if err != nil { return err } // ... release() // if callers want to lock again, they have to re-acquire the lock. _, release, err := locker.Lock(ctx, key) // ... ``` In this way, it's also much easier for redis implementation to extend the mutex automatically, so that callers do not need to care about the lock's lifecycle. See also https://github.com/go-gitea/gitea/pull/31813#discussion_r1722659743 ### Use "release" instead of "unlock" For "unlock", it has the meaning of "unlock an acquired lock". So it's not acceptable to call "unlock" when failed to acquire the lock, or call "unlock" multiple times. It causes more complexity for callers to decide whether to call "unlock" or not. So we use "release" instead of "unlock" to make it clear. Whether the lock is acquired or not, callers can always call "release", and it's also safe to call "release" multiple times. But the code DO NOT expect callers to not call "release" after acquiring the lock. If callers forget to call "release", it will cause resource leak. That's why it's always safe to call "release" without extra checks: to avoid callers to forget to call it. ### Acquired locks could be lost Unlike `sync.Mutex` which will be locked forever once acquired until calling `Unlock`, in the new module, the acquired lock could be lost. For example, the caller has acquired the lock, and it holds the lock for a long time since auto-extending is working for redis. However, it lost the connection to the redis server, and it's impossible to extend the lock anymore. If the caller don't stop what it's doing, another instance which can connect to the redis server could acquire the lock, and do the same thing, which could cause data inconsistency. So the caller should know what happened, the solution is to return a new context which will be canceled if the lock is lost or released: ```go ctx, release, err := locker.Lock(ctx, key) if err != nil { return err } defer release() // ... DoSomething(ctx) // the lock is lost now, then ctx has been canceled. // Failed, since ctx has been canceled. DoSomethingElse(ctx) ``` ### Multiple ways to use the lock 1. Regular way ```go ctx, release, err := Lock(ctx, key) if err != nil { return err } defer release() // ... ``` 2. Early release ```go ctx, release, err := Lock(ctx, key) if err != nil { return err } defer release() // ... // release the lock earlier and reset the context back ctx = release() // continue to do something else // ... ``` 3. Functional way ```go if err := LockAndDo(ctx, key, func(ctx context.Context) error { // ... return nil }); err != nil { return err } ```
80 lines
1.7 KiB
Go
80 lines
1.7 KiB
Go
// Copyright 2024 The Gitea Authors. All rights reserved.
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package globallock
|
|
|
|
import (
|
|
"context"
|
|
"sync"
|
|
"time"
|
|
)
|
|
|
|
type memoryLocker struct {
|
|
locks sync.Map
|
|
}
|
|
|
|
var _ Locker = &memoryLocker{}
|
|
|
|
func NewMemoryLocker() Locker {
|
|
return &memoryLocker{}
|
|
}
|
|
|
|
func (l *memoryLocker) Lock(ctx context.Context, key string) (context.Context, ReleaseFunc, error) {
|
|
originalCtx := ctx
|
|
|
|
if l.tryLock(key) {
|
|
ctx, cancel := context.WithCancelCause(ctx)
|
|
releaseOnce := sync.Once{}
|
|
return ctx, func() context.Context {
|
|
releaseOnce.Do(func() {
|
|
l.locks.Delete(key)
|
|
cancel(ErrLockReleased)
|
|
})
|
|
return originalCtx
|
|
}, nil
|
|
}
|
|
|
|
ticker := time.NewTicker(time.Millisecond * 100)
|
|
defer ticker.Stop()
|
|
for {
|
|
select {
|
|
case <-ctx.Done():
|
|
return ctx, func() context.Context { return originalCtx }, ctx.Err()
|
|
case <-ticker.C:
|
|
if l.tryLock(key) {
|
|
ctx, cancel := context.WithCancelCause(ctx)
|
|
releaseOnce := sync.Once{}
|
|
return ctx, func() context.Context {
|
|
releaseOnce.Do(func() {
|
|
l.locks.Delete(key)
|
|
cancel(ErrLockReleased)
|
|
})
|
|
return originalCtx
|
|
}, nil
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
func (l *memoryLocker) TryLock(ctx context.Context, key string) (bool, context.Context, ReleaseFunc, error) {
|
|
originalCtx := ctx
|
|
|
|
if l.tryLock(key) {
|
|
ctx, cancel := context.WithCancelCause(ctx)
|
|
releaseOnce := sync.Once{}
|
|
return true, ctx, func() context.Context {
|
|
releaseOnce.Do(func() {
|
|
cancel(ErrLockReleased)
|
|
l.locks.Delete(key)
|
|
})
|
|
return originalCtx
|
|
}, nil
|
|
}
|
|
|
|
return false, ctx, func() context.Context { return originalCtx }, nil
|
|
}
|
|
|
|
func (l *memoryLocker) tryLock(key string) bool {
|
|
_, loaded := l.locks.LoadOrStore(key, struct{}{})
|
|
return !loaded
|
|
}
|