HORIZON HASKELLDocslts/ghc-9.10.xc74966e2026-09-27Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · c74966e · 2026-09-27

Moduleconcurrent-extra-0.7.0.12Haskell98

Control.Concurrent.ReadWriteLock

Multiple-reader, single-writer locks. Used to protect shared resources which may be concurrently read, but only sequentially written.

All functions are exception safe. Throwing asynchronous exceptions will not compromise the internal state of an RWLock. This means it is perfectly safe to kill a thread that is blocking on, for example, acquireRead.

See also Java's version: http://java.sun.com/javase/7/docs/api/java/util/concurrent/locks/ReadWriteLock.html

This module is designed to be imported qualified. We suggest importing it like:

import           Control.Concurrent.ReadWriteLock        ( RWLock )
import qualified Control.Concurrent.ReadWriteLock as RWL ( ... )
  • 1 type
  • 15 values
datadata RWLock
#

Multiple-reader, single-writer lock. Is in one of three states:

  • "Free": Read or write access can be acquired without blocking.

  • "Read": One or more threads have acquired read access. Blocks write access.

  • "Write": A single thread has acquired write access. Blocks other threads from acquiring both read and write access.

Instances1Eq
  • Eq RWLockDefined in concurrent-extra-0.7.0.12 · Control.Concurrent.ReadWriteLock

Creating Read-Write Locks

3 declarations
valuenew :: IO RWLock
#

Create a new RWLock in the "free" state; either read or write access can be acquired without blocking.

Read access

0 declarations

Blocking

valueacquireRead :: RWLock -> IO ()
#

Acquire the read lock.

Blocks if another thread has acquired write access. If acquireRead terminates without throwing an exception the state of the RWLock will be "read".

Implementation note: Throws an exception when more than (maxBound :: Int) simultaneous threads acquire the read lock. But that is unlikely.

valuereleaseRead :: RWLock -> IO ()
#

Release the read lock.

If the calling thread was the last one to relinquish read access the state will revert to "free".

It is an error to release read access to an RWLock which is not in the "read" state.

valuewithRead :: RWLock -> IO a -> IO a
#

A convenience function wich first acquires read access and then performs the computation. When the computation terminates, whether normally or by raising an exception, the read lock is released.

valuewaitRead :: RWLock -> IO ()
#
  • When the state is "write", waitRead blocks until a call to releaseWrite in another thread changes the state to "free".

  • When the state is "free" or "read" waitRead returns immediately.

waitRead does not alter the state of the lock.

Note that waitRead is just a convenience function defined as:

waitRead l = mask_ $ acquireRead l >> releaseRead l

Non-blocking

valuetryWithRead :: RWLock -> IO a -> IO (Maybe a)
#

A non-blocking withRead. First tries to acquire the lock. If that fails, Nothing is returned. If it succeeds, the computation is performed. When the computation terminates, whether normally or by raising an exception, the lock is released and Just the result of the computation is returned.

Write access

0 declarations

Blocking

valueacquireWrite :: RWLock -> IO ()
#

Acquire the write lock.

Blocks if another thread has acquired either read or write access. If acquireWrite terminates without throwing an exception the state of the RWLock will be "write".

valuereleaseWrite :: RWLock -> IO ()
#

Release the write lock.

If releaseWrite terminates without throwing an exception the state will be "free".

It is an error to release write access to an RWLock which is not in the "write" state.

valuewithWrite :: RWLock -> IO a -> IO a
#

A convenience function wich first acquires write access and then performs the computation. When the computation terminates, whether normally or by raising an exception, the write lock is released.

valuewaitWrite :: RWLock -> IO ()
#
  • When the state is "write" or "read" waitWrite blocks until a call to releaseWrite or releaseRead in another thread changes the state to "free".

  • When the state is "free" waitWrite returns immediately.

waitWrite does not alter the state of the lock.

Note that waitWrite is just a convenience function defined as:

waitWrite l = mask_ $ acquireWrite l >> releaseWrite l

Non-blocking

valuetryWithWrite :: RWLock -> IO a -> IO (Maybe a)
#

A non-blocking withWrite. First tries to acquire the lock. If that fails, Nothing is returned. If it succeeds, the computation is performed. When the computation terminates, whether normally or by raising an exception, the lock is released and Just the result of the computation is returned.