Go Mutex and RWMutex: Difference between revisions
m (Ovidiu moved page Go Mutex to Go Mutex and RWMutex without leaving a redirect) |
No edit summary |
||
| Line 6: | Line 6: | ||
=Overview= | =Overview= | ||
=Mutex= | |||
A <code>Mutex</code> is a [[Concurrent_(Parallel)_Programming#Mutual_Exclusion|mutual exclusion]] lock, implemented as a [[Concurrent_(Parallel)_Programming#Binary_Semaphore|binary semaphore]]. Only one goroutine can enter the critical section at a time. Not until the call to the <code>Unlock()</code> function issued can another goroutine enter the critical section. | A <code>Mutex</code> is a [[Concurrent_(Parallel)_Programming#Mutual_Exclusion|mutual exclusion]] lock, implemented as a [[Concurrent_(Parallel)_Programming#Binary_Semaphore|binary semaphore]]. Only one goroutine can enter the critical section at a time. Not until the call to the <code>Unlock()</code> function issued can another goroutine enter the critical section. | ||
| Line 22: | Line 23: | ||
</syntaxhighlight> | </syntaxhighlight> | ||
=Methods= | ==Methods== | ||
==<tt>Lock()</tt>== | ===<tt>Lock()</tt>=== | ||
The goroutine should call <code>Lock()</code> before it is about to use the shared data. If nobody called <code>Lock()</code> before, the call will proceed and the calling goroutine will acquire the lock. If somebody else has the lock, the call will block. Multiple threads may potentially block on the same lock. | The goroutine should call <code>Lock()</code> before it is about to use the shared data. If nobody called <code>Lock()</code> before, the call will proceed and the calling goroutine will acquire the lock. If somebody else has the lock, the call will block. Multiple threads may potentially block on the same lock. | ||
<code>Lock()</code> ensures that only one thread can be in the mutually exclusion region. | <code>Lock()</code> ensures that only one thread can be in the mutually exclusion region. | ||
==<tt>Unlock()</tt>== | ===<tt>Unlock()</tt>=== | ||
The goroutine that is done using the shared data should call <code>Unlock()</code>. If other threads are waiting on the lock, one of the threads will be unblocked and will be able to continue. | The goroutine that is done using the shared data should call <code>Unlock()</code>. If other threads are waiting on the lock, one of the threads will be unblocked and will be able to continue. | ||
| Line 35: | Line 36: | ||
fatal error: sync: unlock of unlocked mutex | fatal error: sync: unlock of unlocked mutex | ||
</font> | </font> | ||
=RWMutex= | |||
Revision as of 21:28, 26 September 2023
External
Internal
Overview
Mutex
A Mutex is a mutual exclusion lock, implemented as a binary semaphore. Only one goroutine can enter the critical section at a time. Not until the call to the Unlock() function issued can another goroutine enter the critical section.
The usage pattern follows, and the curly braces are not necessary, but can be used for clarity:
var mutex sync.Mutex
...
mutex.Lock()
// do something in a mutual exclusion mode
mutex.Unlock()
Methods
Lock()
The goroutine should call Lock() before it is about to use the shared data. If nobody called Lock() before, the call will proceed and the calling goroutine will acquire the lock. If somebody else has the lock, the call will block. Multiple threads may potentially block on the same lock.
Lock() ensures that only one thread can be in the mutually exclusion region.
Unlock()
The goroutine that is done using the shared data should call Unlock(). If other threads are waiting on the lock, one of the threads will be unblocked and will be able to continue.
A mutex that was not locked raises a panic on an attempt to unlock:
fatal error: sync: unlock of unlocked mutex