Test.DejaFu.Conc

Deterministic traced execution of concurrent computations.

This works by executing the computation on a single thread, calling out to the supplied scheduler after each step to determine which thread runs next.

The ConcT monad transformer

data ConcT r n a

Since: 0.6.0.0

Instances

MonadTrans (ConcT r)

Methods

lift :: Monad m => m a -> ConcT r m a

MonadRef (CRef r) (ConcT r n)

Methods

newRef :: a -> ConcT r n (CRef r a)

readRef :: CRef r a -> ConcT r n a

writeRef :: CRef r a -> a -> ConcT r n ()

modifyRef :: CRef r a -> (a -> a) -> ConcT r n ()

modifyRef' :: CRef r a -> (a -> a) -> ConcT r n ()

MonadAtomicRef (CRef r) (ConcT r n)

Methods

atomicModifyRef :: CRef r a -> (a -> (a, b)) -> ConcT r n b

atomicModifyRef' :: CRef r a -> (a -> (a, b)) -> ConcT r n b

Monad (ConcT r n)

Methods

(>>=) :: ConcT r n a -> (a -> ConcT r n b) -> ConcT r n b

(>>) :: ConcT r n a -> ConcT r n b -> ConcT r n b

return :: a -> ConcT r n a

fail :: String -> ConcT r n a

Functor (ConcT r n)

Methods

fmap :: (a -> b) -> ConcT r n a -> ConcT r n b

(<$) :: a -> ConcT r n b -> ConcT r n a

MonadFail (ConcT r n)

Since: 0.9.1.0

Methods

fail :: String -> ConcT r n a

Applicative (ConcT r n)

Methods

pure :: a -> ConcT r n a

(<*>) :: ConcT r n (a -> b) -> ConcT r n a -> ConcT r n b

liftA2 :: (a -> b -> c) -> ConcT r n a -> ConcT r n b -> ConcT r n c

(*>) :: ConcT r n a -> ConcT r n b -> ConcT r n b

(<*) :: ConcT r n a -> ConcT r n b -> ConcT r n a

MonadIO n => MonadIO (ConcT r n)

Since: 1.0.0.0

Methods

liftIO :: IO a -> ConcT r n a

Monad n => MonadConc (ConcT r n)

Associated Types

type STM (ConcT r n :: * -> *) :: * -> *

type MVar (ConcT r n :: * -> *) :: * -> *

type CRef (ConcT r n :: * -> *) :: * -> *

type Ticket (ConcT r n :: * -> *) :: * -> *

type ThreadId (ConcT r n :: * -> *) :: *

Methods

fork :: ConcT r n () -> ConcT r n (ThreadId (ConcT r n))

forkWithUnmask :: ((forall a. ConcT r n a -> ConcT r n a) -> ConcT r n ()) -> ConcT r n (ThreadId (ConcT r n))

forkWithUnmaskN :: String -> ((forall a. ConcT r n a -> ConcT r n a) -> ConcT r n ()) -> ConcT r n (ThreadId (ConcT r n))

forkOn :: Int -> ConcT r n () -> ConcT r n (ThreadId (ConcT r n))

forkOnWithUnmask :: Int -> ((forall a. ConcT r n a -> ConcT r n a) -> ConcT r n ()) -> ConcT r n (ThreadId (ConcT r n))

forkOnWithUnmaskN :: String -> Int -> ((forall a. ConcT r n a -> ConcT r n a) -> ConcT r n ()) -> ConcT r n (ThreadId (ConcT r n))

forkOS :: ConcT r n () -> ConcT r n (ThreadId (ConcT r n))

forkOSN :: String -> ConcT r n () -> ConcT r n (ThreadId (ConcT r n))

isCurrentThreadBound :: ConcT r n Bool

getNumCapabilities :: ConcT r n Int

setNumCapabilities :: Int -> ConcT r n ()

myThreadId :: ConcT r n (ThreadId (ConcT r n))

yield :: ConcT r n ()

threadDelay :: Int -> ConcT r n ()

newEmptyMVar :: ConcT r n (MVar (ConcT r n) a)

newEmptyMVarN :: String -> ConcT r n (MVar (ConcT r n) a)

putMVar :: MVar (ConcT r n) a -> a -> ConcT r n ()

tryPutMVar :: MVar (ConcT r n) a -> a -> ConcT r n Bool

readMVar :: MVar (ConcT r n) a -> ConcT r n a

tryReadMVar :: MVar (ConcT r n) a -> ConcT r n (Maybe a)

takeMVar :: MVar (ConcT r n) a -> ConcT r n a

tryTakeMVar :: MVar (ConcT r n) a -> ConcT r n (Maybe a)

newCRef :: a -> ConcT r n (CRef (ConcT r n) a)

newCRefN :: String -> a -> ConcT r n (CRef (ConcT r n) a)

readCRef :: CRef (ConcT r n) a -> ConcT r n a

atomicModifyCRef :: CRef (ConcT r n) a -> (a -> (a, b)) -> ConcT r n b

writeCRef :: CRef (ConcT r n) a -> a -> ConcT r n ()

atomicWriteCRef :: CRef (ConcT r n) a -> a -> ConcT r n ()

readForCAS :: CRef (ConcT r n) a -> ConcT r n (Ticket (ConcT r n) a)

peekTicket' :: Proxy (* -> *) (ConcT r n) -> Ticket (ConcT r n) a -> a

casCRef :: CRef (ConcT r n) a -> Ticket (ConcT r n) a -> a -> ConcT r n (Bool, Ticket (ConcT r n) a)

modifyCRefCAS :: CRef (ConcT r n) a -> (a -> (a, b)) -> ConcT r n b

modifyCRefCAS_ :: CRef (ConcT r n) a -> (a -> a) -> ConcT r n ()

atomically :: STM (ConcT r n) a -> ConcT r n a

readTVarConc :: TVar (STM (ConcT r n)) a -> ConcT r n a

throwTo :: Exception e => ThreadId (ConcT r n) -> e -> ConcT r n ()

MonadThrow (ConcT r n)

Methods

throwM :: Exception e => e -> ConcT r n a

MonadCatch (ConcT r n)

Methods

catch :: Exception e => ConcT r n a -> (e -> ConcT r n a) -> ConcT r n a

MonadMask (ConcT r n)

Methods

mask :: ((forall a. ConcT r n a -> ConcT r n a) -> ConcT r n b) -> ConcT r n b

uninterruptibleMask :: ((forall a. ConcT r n a -> ConcT r n a) -> ConcT r n b) -> ConcT r n b

type ThreadId (ConcT r n)

type ThreadId (ConcT r n) = ThreadId

type Ticket (ConcT r n)

type Ticket (ConcT r n) = Ticket

type CRef (ConcT r n)

type CRef (ConcT r n) = CRef r

type MVar (ConcT r n)

type MVar (ConcT r n) = MVar r

type STM (ConcT r n)

type STM (ConcT r n) = S n r

type ConcIO = ConcT IORef IO

A MonadConc implementation using IO.

Since: 0.4.0.0

Executing computations

data Failure

An indication of how a concurrent computation failed.

The Eq, Ord, and NFData instances compare/evaluate the exception with show in the UncaughtException case.

Since: 1.1.0.0

Constructors

InternalError

Will be raised if the scheduler does something bad. This should never arise unless you write your own, faulty, scheduler! If it does, please file a bug report.

Abort

The scheduler chose to abort execution. This will be produced if, for example, all possible decisions exceed the specified bounds (there have been too many pre-emptions, the computation has executed for too long, or there have been too many yields).

Deadlock

Every thread is blocked, and the main thread is not blocked in an STM transaction.

STMDeadlock

Every thread is blocked, and the main thread is blocked in an STM transaction.

UncaughtException SomeException

An uncaught exception bubbled to the top of the computation.

IllegalSubconcurrency

Calls to subconcurrency were nested, or attempted when multiple threads existed.

IllegalDontCheck

A call to dontCheck was attempted after the first action of the initial thread.

Instances

Eq Failure

Methods

(==) :: Failure -> Failure -> Bool

(/=) :: Failure -> Failure -> Bool

Ord Failure

Methods

compare :: Failure -> Failure -> Ordering

(<) :: Failure -> Failure -> Bool

(<=) :: Failure -> Failure -> Bool

(>) :: Failure -> Failure -> Bool

(>=) :: Failure -> Failure -> Bool

max :: Failure -> Failure -> Failure

min :: Failure -> Failure -> Failure

Show Failure

Methods

showsPrec :: Int -> Failure -> ShowS

show :: Failure -> String

showList :: [Failure] -> ShowS

NFData Failure

Methods

rnf :: Failure -> ()

data MemType

The memory model to use for non-synchronised CRef operations.

Since: 0.4.0.0

Constructors

SequentialConsistency

The most intuitive model: a program behaves as a simple interleaving of the actions in different threads. When a CRef is written to, that write is immediately visible to all threads.

TotalStoreOrder

Each thread has a write buffer. A thread sees its writes immediately, but other threads will only see writes when they are committed, which may happen later. Writes are committed in the same order that they are created.

PartialStoreOrder

Each CRef has a write buffer. A thread sees its writes immediately, but other threads will only see writes when they are committed, which may happen later. Writes to different CRefs are not necessarily committed in the same order that they are created.

Instances

Bounded MemType

Methods

minBound :: MemType

maxBound :: MemType

Enum MemType

Methods

succ :: MemType -> MemType

pred :: MemType -> MemType

toEnum :: Int -> MemType

fromEnum :: MemType -> Int

enumFrom :: MemType -> [MemType]

enumFromThen :: MemType -> MemType -> [MemType]

enumFromTo :: MemType -> MemType -> [MemType]

enumFromThenTo :: MemType -> MemType -> MemType -> [MemType]

Eq MemType

Methods

(==) :: MemType -> MemType -> Bool

(/=) :: MemType -> MemType -> Bool

Ord MemType

Methods

compare :: MemType -> MemType -> Ordering

(<) :: MemType -> MemType -> Bool

(<=) :: MemType -> MemType -> Bool

(>) :: MemType -> MemType -> Bool

(>=) :: MemType -> MemType -> Bool

max :: MemType -> MemType -> MemType

min :: MemType -> MemType -> MemType

Read MemType

Methods

readsPrec :: Int -> ReadS MemType

readList :: ReadS [MemType]

readPrec :: ReadPrec MemType

readListPrec :: ReadPrec [MemType]

Show MemType

Methods

showsPrec :: Int -> MemType -> ShowS

show :: MemType -> String

showList :: [MemType] -> ShowS

NFData MemType

Since: 0.5.1.0

Methods

rnf :: MemType -> ()

runConcurrent :: (MonadConc n, MonadRef r n) => Scheduler s -> MemType -> s -> ConcT r n a -> n (Either Failure a, s, Trace)

Run a concurrent computation with a given Scheduler and initial state, returning a failure reason on error. Also returned is the final state of the scheduler, and an execution trace.

If the RTS supports bound threads (ghc -threaded when linking) then the main thread of the concurrent computation will be bound, and forkOS / forkOSN will work during execution. If not, then the main thread will not be found, and attempting to fork a bound thread will raise an error.

Warning: Blocking on the action of another thread in liftIO cannot be detected! So if you perform some potentially blocking action in a liftIO the entire collection of threads may deadlock! You should therefore keep IO blocks small, and only perform blocking operations with the supplied primitives, insofar as possible.

Note: In order to prevent computation from hanging, the runtime will assume that a deadlock situation has arisen if the scheduler attempts to (a) schedule a blocked thread, or (b) schedule a nonexistent thread. In either of those cases, the computation will be halted.

Since: 1.0.0.0

subconcurrency :: ConcT r n a -> ConcT r n (Either Failure a)

Run a concurrent computation and return its result.

This can only be called in the main thread, when no other threads exist. Calls to subconcurrency cannot be nested, or placed inside a call to dontCheck. Violating either of these conditions will result in the computation failing with IllegalSubconcurrency.

Since: 0.6.0.0

dontCheck

Arguments

:: Maybe Int

An optional length bound.

-> ConcT r n a

The action to execute.

-> ConcT r n a

Run an arbitrary action which gets some special treatment:

• For systematic testing, dontCheck is not dependent with anything, even if the action has dependencies.
• For pre-emption bounding, dontCheck counts for zero pre-emptions, even if the action performs pre-emptive context switches.
• For fair bounding, dontCheck counts for zero yields/delays, even if the action performs yields or delays.
• For length bounding, dontCheck counts for one step, even if the action has many.
• All SCT functions use runForDCSnapshot / runWithDCSnapshot to ensure that the action is only executed once, although you should be careful with IO (see note on snapshotting IO).

The action is executed atomically with a deterministic scheduler under sequential consistency. Any threads created inside the action continue to exist in the main computation.

This must be the first thing done in the main thread. Violating this condition will result in the computation failing with IllegalDontCheck.

If the action fails (deadlock, length bound exceeded, etc), the whole computation fails.

Since: 1.1.0.0

Snapshotting

Snapshotting IO: A snapshot captures entire state of your concurrent program: the state of every thread, the number of capabilities, the values of any CRefs, MVars, and TVars, and records any IO that you performed.

When restoring a snapshot this IO is replayed, in order. But the whole snapshotted computation is not. So the effects of the IO take place again, but any return values are ignored. For example, this program will not do what you want:

bad_snapshot = do
  r <- dontCheck Nothing $ do
    r <- liftIO (newIORef 0)
    liftIO (modifyIORef r (+1))
    pure r
  liftIO (readIORef r)

When the snapshot is taken, the value in the IORef will be 1. When the snapshot is restored for the first time, those IO actions will be run again, but their return values will be discarded. The value in the IORef will be 2. When the snapshot is restored for the second time, the value in the IORef will be 3. And so on.

To safely use IO in a snapshotted computation, the combined effect must be idempotent. You should either use actions which set the state to the final value directly, rather than modifying it (eg, using a combination of liftIO . readIORef and liftIO . writeIORef here), or reset the state to a known value. Both of these approaches will work:

good_snapshot1 = do
  r <- dontCheck Nothing $ do
    let modify r f = liftIO (readIORef r) >>= liftIO . writeIORef r . f
    r <- liftIO (newIORef 0)
    modify r (+1)
    pure r
  liftIO (readIORef r)

good_snapshot2 = do
  r <- dontCheck Nothing $ do
    r <- liftIO (newIORef 0)
    liftIO (writeIORef r 0)
    liftIO (modifyIORef r (+1))
    pure r
  liftIO (readIORef r)

data DCSnapshot r n a

A snapshot of the concurrency state immediately after dontCheck finishes.

Since: 1.1.0.0

runForDCSnapshot :: (MonadConc n, MonadRef r n) => ConcT r n a -> n (Maybe (Either Failure (DCSnapshot r n a), Trace))

Like runConcurrent, but terminates immediately after running the dontCheck action with a DCSnapshot which can be used in runWithDCSnapshot to avoid doing that work again.

If this program does not contain a legal use of dontCheck, then the result will be Nothing.

If you are using the SCT functions on an action which contains a dontCheck, snapshotting will be handled for you, without you needing to call this function yourself.

Since: 1.1.0.0

runWithDCSnapshot :: (MonadConc n, MonadRef r n) => Scheduler s -> MemType -> s -> DCSnapshot r n a -> n (Either Failure a, s, Trace)

Like runConcurrent, but uses a DCSnapshot produced by runForDCSnapshot to skip the dontCheck work.

If you are using the SCT functions on an action which contains a dontCheck, snapshotting will be handled for you, without you needing to call this function yourself.

Since: 1.1.0.0

canDCSnapshot :: ConcT r n a -> Bool

Check if a DCSnapshot can be taken from this computation.

Since: 1.1.0.0

threadsFromDCSnapshot :: DCSnapshot r n a -> ([ThreadId], [ThreadId])

Get the threads which exist in a snapshot, partitioned into runnable and not runnable.

Since: 1.1.0.0

Execution traces

type Trace = [(Decision, [(ThreadId, Lookahead)], ThreadAction)]

One of the outputs of the runner is a Trace, which is a log of decisions made, all the alternative unblocked threads and what they would do, and the action a thread took in its step.

Since: 0.8.0.0

data Decision

Scheduling decisions are based on the state of the running program, and so we can capture some of that state in recording what specific decision we made.

Since: 0.5.0.0

Constructors

Start ThreadId

Start a new thread, because the last was blocked (or it's the start of computation).

Continue

Continue running the last thread for another step.

SwitchTo ThreadId

Pre-empt the running thread, and switch to another.

Instances

Eq Decision

Methods

(==) :: Decision -> Decision -> Bool

(/=) :: Decision -> Decision -> Bool

Show Decision

Methods

showsPrec :: Int -> Decision -> ShowS

show :: Decision -> String

showList :: [Decision] -> ShowS

NFData Decision

Since: 0.5.1.0

Methods

rnf :: Decision -> ()

newtype ThreadId

Every thread has a unique identitifer.

Since: 1.0.0.0

Constructors

ThreadId Id

Instances

Eq ThreadId

Methods

(==) :: ThreadId -> ThreadId -> Bool

(/=) :: ThreadId -> ThreadId -> Bool

Ord ThreadId

Methods

compare :: ThreadId -> ThreadId -> Ordering

(<) :: ThreadId -> ThreadId -> Bool

(<=) :: ThreadId -> ThreadId -> Bool

(>) :: ThreadId -> ThreadId -> Bool

(>=) :: ThreadId -> ThreadId -> Bool

max :: ThreadId -> ThreadId -> ThreadId

min :: ThreadId -> ThreadId -> ThreadId

Show ThreadId

Methods

showsPrec :: Int -> ThreadId -> ShowS

show :: ThreadId -> String

showList :: [ThreadId] -> ShowS

NFData ThreadId

Methods

rnf :: ThreadId -> ()

data ThreadAction

All the actions that a thread can perform.

Since: 1.1.0.0

Constructors

Fork ThreadId

Start a new thread.

ForkOS ThreadId

Start a new bound thread.

IsCurrentThreadBound Bool

Check if the current thread is bound.

MyThreadId

Get the ThreadId of the current thread.

GetNumCapabilities Int

Get the number of Haskell threads that can run simultaneously.

SetNumCapabilities Int

Set the number of Haskell threads that can run simultaneously.

Yield

Yield the current thread.

ThreadDelay Int

Yield/delay the current thread.

NewMVar MVarId

Create a new MVar.

PutMVar MVarId [ThreadId]

Put into a MVar, possibly waking up some threads.

BlockedPutMVar MVarId

Get blocked on a put.

TryPutMVar MVarId Bool [ThreadId]

Try to put into a MVar, possibly waking up some threads.

ReadMVar MVarId

Read from a MVar.

TryReadMVar MVarId Bool

Try to read from a MVar.

BlockedReadMVar MVarId

Get blocked on a read.

TakeMVar MVarId [ThreadId]

Take from a MVar, possibly waking up some threads.

BlockedTakeMVar MVarId

Get blocked on a take.

TryTakeMVar MVarId Bool [ThreadId]

Try to take from a MVar, possibly waking up some threads.

NewCRef CRefId

Create a new CRef.

ReadCRef CRefId

Read from a CRef.

ReadCRefCas CRefId

Read from a CRef for a future compare-and-swap.

ModCRef CRefId

Modify a CRef.

ModCRefCas CRefId

Modify a CRef using a compare-and-swap.

WriteCRef CRefId

Write to a CRef without synchronising.

CasCRef CRefId Bool

Attempt to to a CRef using a compare-and-swap, synchronising it.

CommitCRef ThreadId CRefId

Commit the last write to the given CRef by the given thread, so that all threads can see the updated value.

STM [TAction] [ThreadId]

An STM transaction was executed, possibly waking up some threads.

BlockedSTM [TAction]

Got blocked in an STM transaction.

Catching

Register a new exception handler

PopCatching

Pop the innermost exception handler from the stack.

Throw

Throw an exception.

ThrowTo ThreadId

Throw an exception to a thread.

BlockedThrowTo ThreadId

Get blocked on a throwTo.

Killed

Killed by an uncaught exception.

SetMasking Bool MaskingState

Set the masking state. If True, this is being used to set the masking state to the original state in the argument passed to a masked function.

ResetMasking Bool MaskingState

Return to an earlier masking state. If True, this is being used to return to the state of the masked block in the argument passed to a masked function.

LiftIO

Lift an IO action. Note that this can only happen with ConcIO.

Return

A return or pure action was executed.

Stop

Cease execution and terminate.

Subconcurrency

Start executing an action with subconcurrency.

StopSubconcurrency

Stop executing an action with subconcurrency.

DontCheck Trace

Execute an action with dontCheck.

Instances

Eq ThreadAction

Methods

(==) :: ThreadAction -> ThreadAction -> Bool

(/=) :: ThreadAction -> ThreadAction -> Bool

Show ThreadAction

Methods

showsPrec :: Int -> ThreadAction -> ShowS

show :: ThreadAction -> String

showList :: [ThreadAction] -> ShowS

NFData ThreadAction

Methods

rnf :: ThreadAction -> ()

data Lookahead

A one-step look-ahead at what a thread will do next.

Since: 1.1.0.0

Constructors

WillFork

Will start a new thread.

WillForkOS

Will start a new bound thread.

WillIsCurrentThreadBound

Will check if the current thread is bound.

WillMyThreadId

Will get the ThreadId.

WillGetNumCapabilities

Will get the number of Haskell threads that can run simultaneously.

WillSetNumCapabilities Int

Will set the number of Haskell threads that can run simultaneously.

WillYield

Will yield the current thread.

WillThreadDelay Int

Will yield/delay the current thread.

WillNewMVar

Will create a new MVar.

WillPutMVar MVarId

Will put into a MVar, possibly waking up some threads.

WillTryPutMVar MVarId

Will try to put into a MVar, possibly waking up some threads.

WillReadMVar MVarId

Will read from a MVar.

WillTryReadMVar MVarId

Will try to read from a MVar.

WillTakeMVar MVarId

Will take from a MVar, possibly waking up some threads.

WillTryTakeMVar MVarId

Will try to take from a MVar, possibly waking up some threads.

WillNewCRef

Will create a new CRef.

WillReadCRef CRefId

Will read from a CRef.

WillReadCRefCas CRefId

Will read from a CRef for a future compare-and-swap.

WillModCRef CRefId

Will modify a CRef.

WillModCRefCas CRefId

Will modify a CRef using a compare-and-swap.

WillWriteCRef CRefId

Will write to a CRef without synchronising.

WillCasCRef CRefId

Will attempt to to a CRef using a compare-and-swap, synchronising it.

WillCommitCRef ThreadId CRefId

Will commit the last write by the given thread to the CRef.

WillSTM

Will execute an STM transaction, possibly waking up some threads.

WillCatching

Will register a new exception handler

WillPopCatching

Will pop the innermost exception handler from the stack.

WillThrow

Will throw an exception.

WillThrowTo ThreadId

Will throw an exception to a thread.

WillSetMasking Bool MaskingState

Will set the masking state. If True, this is being used to set the masking state to the original state in the argument passed to a masked function.

WillResetMasking Bool MaskingState

Will return to an earlier masking state. If True, this is being used to return to the state of the masked block in the argument passed to a masked function.

WillLiftIO

Will lift an IO action. Note that this can only happen with ConcIO.

WillReturn

Will execute a return or pure action.

WillStop

Will cease execution and terminate.

WillSubconcurrency

Will execute an action with subconcurrency.

WillStopSubconcurrency

Will stop executing an extion with subconcurrency.

WillDontCheck

Will execute an action with dontCheck.

Instances

Eq Lookahead

Methods

(==) :: Lookahead -> Lookahead -> Bool

(/=) :: Lookahead -> Lookahead -> Bool

Show Lookahead

Methods

showsPrec :: Int -> Lookahead -> ShowS

show :: Lookahead -> String

showList :: [Lookahead] -> ShowS

NFData Lookahead

Methods

rnf :: Lookahead -> ()

data MVarId

Every MVar has a unique identifier.

Since: 1.0.0.0

Instances

Eq MVarId

Methods

(==) :: MVarId -> MVarId -> Bool

(/=) :: MVarId -> MVarId -> Bool

Ord MVarId

Methods

compare :: MVarId -> MVarId -> Ordering

(<) :: MVarId -> MVarId -> Bool

(<=) :: MVarId -> MVarId -> Bool

(>) :: MVarId -> MVarId -> Bool

(>=) :: MVarId -> MVarId -> Bool

max :: MVarId -> MVarId -> MVarId

min :: MVarId -> MVarId -> MVarId

Show MVarId

Methods

showsPrec :: Int -> MVarId -> ShowS

show :: MVarId -> String

showList :: [MVarId] -> ShowS

NFData MVarId

Methods

rnf :: MVarId -> ()

data CRefId

Every CRef has a unique identifier.

Since: 1.0.0.0

Instances

Eq CRefId

Methods

(==) :: CRefId -> CRefId -> Bool

(/=) :: CRefId -> CRefId -> Bool

Ord CRefId

Methods

compare :: CRefId -> CRefId -> Ordering

(<) :: CRefId -> CRefId -> Bool

(<=) :: CRefId -> CRefId -> Bool

(>) :: CRefId -> CRefId -> Bool

(>=) :: CRefId -> CRefId -> Bool

max :: CRefId -> CRefId -> CRefId

min :: CRefId -> CRefId -> CRefId

Show CRefId

Methods

showsPrec :: Int -> CRefId -> ShowS

show :: CRefId -> String

showList :: [CRefId] -> ShowS

NFData CRefId

Methods

rnf :: CRefId -> ()

data MaskingState :: *

Describes the behaviour of a thread when an asynchronous exception is received.

Constructors

Unmasked

asynchronous exceptions are unmasked (the normal state)

MaskedInterruptible

the state during mask: asynchronous exceptions are masked, but blocking operations may still be interrupted

MaskedUninterruptible

the state during uninterruptibleMask: asynchronous exceptions are masked, and blocking operations may not be interrupted

Instances

Eq MaskingState

Methods

(==) :: MaskingState -> MaskingState -> Bool

(/=) :: MaskingState -> MaskingState -> Bool

Show MaskingState

Methods

showsPrec :: Int -> MaskingState -> ShowS

show :: MaskingState -> String

showList :: [MaskingState] -> ShowS

showTrace :: Trace -> String

Pretty-print a trace, including a key of the thread IDs (not including thread 0). Each line of the key is indented by two spaces.

Since: 0.5.0.0

showFail :: Failure -> String

Pretty-print a failure

Since: 0.4.0.0

Scheduling

module Test.DejaFu.Schedule