{-# LANGUAGE CPP #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE UnboxedTuples #-}
{-# LANGUAGE UnliftedFFITypes #-}
{-# LANGUAGE Unsafe #-}

{-# OPTIONS_HADDOCK not-home #-}

-----------------------------------------------------------------------------
-- |
-- Module      :  GHC.Conc.Sync
-- Copyright   :  (c) The University of Glasgow, 1994-2002
-- License     :  see libraries/base/LICENSE
--
-- Maintainer  :  cvs-ghc@haskell.org
-- Stability   :  internal
-- Portability :  non-portable (GHC extensions)
--
-- Basic concurrency stuff.
--
-----------------------------------------------------------------------------

-- No: #hide, because bits of this module are exposed by the stm package.
-- However, we don't want this module to be the home location for the
-- bits it exports, we'd rather have Control.Concurrent and the other
-- higher level modules be the home.  Hence:

-- #not-home
module GHC.Conc.Sync
        ( ThreadId(..)
        , showThreadId

        -- * Forking and suchlike
        , forkIO
        , forkIOWithUnmask
        , forkOn
        , forkOnWithUnmask
        , numCapabilities
        , getNumCapabilities
        , setNumCapabilities
        , getNumProcessors
        , numSparks
        , childHandler
        , myThreadId
        , killThread
        , throwTo
        , par
        , pseq
        , runSparks
        , yield
        , labelThread
        , mkWeakThreadId

        , ThreadStatus(..), BlockReason(..)
        , threadStatus
        , threadCapability

        , newStablePtrPrimMVar, PrimMVar

        -- * Allocation counter and quota
        , setAllocationCounter
        , getAllocationCounter
        , enableAllocationLimit
        , disableAllocationLimit

        -- * TVars
        , STM(..)
        , atomically
        , retry
        , orElse
        , throwSTM
        , catchSTM
        , TVar(..)
        , newTVar
        , newTVarIO
        , readTVar
        , readTVarIO
        , writeTVar
        , unsafeIOToSTM

        -- * Miscellaneous
        , withMVar
        , modifyMVar_

        , setUncaughtExceptionHandler
        , getUncaughtExceptionHandler

        , reportError, reportStackOverflow, reportHeapOverflow

        , sharedCAF
        ) where

import Foreign
import Foreign.C

import Data.Typeable
import Data.Maybe

import GHC.Base
import {-# SOURCE #-} GHC.IO.Handle ( hFlush )
import {-# SOURCE #-} GHC.IO.StdHandles ( stdout )
import GHC.Int
import GHC.IO
import GHC.IO.Encoding.UTF8
import GHC.IO.Exception
import GHC.Exception
import qualified GHC.Foreign
import GHC.IORef
import GHC.MVar
import GHC.Ptr
import GHC.Real         ( fromIntegral )
import GHC.Show         ( Show(..), showParen, showString )
import GHC.Stable       ( StablePtr(..) )
import GHC.Weak

import Unsafe.Coerce    ( unsafeCoerce# )

infixr 0 `par`, `pseq`

-----------------------------------------------------------------------------
-- 'ThreadId', 'par', and 'fork'
-----------------------------------------------------------------------------

data ThreadId = ThreadId ThreadId#
-- ToDo: data ThreadId = ThreadId (Weak ThreadId#)
-- But since ThreadId# is unlifted, the Weak type must use open
-- type variables.
{- ^
A 'ThreadId' is an abstract type representing a handle to a thread.
'ThreadId' is an instance of 'Eq', 'Ord' and 'Show', where
the 'Ord' instance implements an arbitrary total ordering over
'ThreadId's. The 'Show' instance lets you convert an arbitrary-valued
'ThreadId' to string form; showing a 'ThreadId' value is occasionally
useful when debugging or diagnosing the behaviour of a concurrent
program.

/Note/: in GHC, if you have a 'ThreadId', you essentially have
a pointer to the thread itself.  This means the thread itself can\'t be
garbage collected until you drop the 'ThreadId'.
This misfeature will hopefully be corrected at a later date.

-}

-- | @since 4.2.0.0
instance Show ThreadId where
   showsPrec :: Int -> ThreadId -> ShowS
showsPrec Int
d ThreadId
t = Bool -> ShowS -> ShowS
showParen (Int
d forall a. Ord a => a -> a -> Bool
>= Int
11) forall a b. (a -> b) -> a -> b
$
        String -> ShowS
showString String
"ThreadId " forall b c a. (b -> c) -> (a -> b) -> a -> c
.
        forall a. Show a => Int -> a -> ShowS
showsPrec Int
d (ThreadId# -> CInt
getThreadId (ThreadId -> ThreadId#
id2TSO ThreadId
t))

showThreadId :: ThreadId -> String
showThreadId :: ThreadId -> String
showThreadId = forall a. Show a => a -> String
show

foreign import ccall unsafe "rts_getThreadId" getThreadId :: ThreadId# -> CInt

id2TSO :: ThreadId -> ThreadId#
id2TSO :: ThreadId -> ThreadId#
id2TSO (ThreadId ThreadId#
t) = ThreadId#
t

foreign import ccall unsafe "eq_thread" eq_thread :: ThreadId# -> ThreadId# -> CBool

foreign import ccall unsafe "cmp_thread" cmp_thread :: ThreadId# -> ThreadId# -> CInt
-- Returns -1, 0, 1

-- | @since 4.2.0.0
instance Eq ThreadId where
  ThreadId ThreadId#
t1 == :: ThreadId -> ThreadId -> Bool
== ThreadId ThreadId#
t2 = ThreadId# -> ThreadId# -> CBool
eq_thread ThreadId#
t1 ThreadId#
t2 forall a. Eq a => a -> a -> Bool
/= CBool
0

-- | @since 4.2.0.0
instance Ord ThreadId where
  compare :: ThreadId -> ThreadId -> Ordering
compare (ThreadId ThreadId#
t1) (ThreadId ThreadId#
t2) = case ThreadId# -> ThreadId# -> CInt
cmp_thread ThreadId#
t1 ThreadId#
t2 of
    -1 -> Ordering
LT
    CInt
0  -> Ordering
EQ
    CInt
_  -> Ordering
GT

-- | Every thread has an allocation counter that tracks how much
-- memory has been allocated by the thread.  The counter is
-- initialized to zero, and 'setAllocationCounter' sets the current
-- value.  The allocation counter counts *down*, so in the absence of
-- a call to 'setAllocationCounter' its value is the negation of the
-- number of bytes of memory allocated by the thread.
--
-- There are two things that you can do with this counter:
--
-- * Use it as a simple profiling mechanism, with
--   'getAllocationCounter'.
--
-- * Use it as a resource limit.  See 'enableAllocationLimit'.
--
-- Allocation accounting is accurate only to about 4Kbytes.
--
-- @since 4.8.0.0
setAllocationCounter :: Int64 -> IO ()
setAllocationCounter :: Int64 -> IO ()
setAllocationCounter (I64# Int#
i) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s ->
  case Int# -> State# RealWorld -> State# RealWorld
setThreadAllocationCounter# Int#
i State# RealWorld
s of State# RealWorld
s' -> (# State# RealWorld
s', () #)

-- | Return the current value of the allocation counter for the
-- current thread.
--
-- @since 4.8.0.0
getAllocationCounter :: IO Int64
getAllocationCounter :: IO Int64
getAllocationCounter = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s ->
  case State# RealWorld -> (# State# RealWorld, Int# #)
getThreadAllocationCounter# State# RealWorld
s of (# State# RealWorld
s', Int#
ctr #) -> (# State# RealWorld
s', Int# -> Int64
I64# Int#
ctr #)

-- | Enables the allocation counter to be treated as a limit for the
-- current thread.  When the allocation limit is enabled, if the
-- allocation counter counts down below zero, the thread will be sent
-- the 'AllocationLimitExceeded' asynchronous exception.  When this
-- happens, the counter is reinitialised (by default
-- to 100K, but tunable with the @+RTS -xq@ option) so that it can handle
-- the exception and perform any necessary clean up.  If it exhausts
-- this additional allowance, another 'AllocationLimitExceeded' exception
-- is sent, and so forth.  Like other asynchronous exceptions, the
-- 'AllocationLimitExceeded' exception is deferred while the thread is inside
-- 'mask' or an exception handler in 'catch'.
--
-- Note that memory allocation is unrelated to /live memory/, also
-- known as /heap residency/.  A thread can allocate a large amount of
-- memory and retain anything between none and all of it.  It is
-- better to think of the allocation limit as a limit on
-- /CPU time/, rather than a limit on memory.
--
-- Compared to using timeouts, allocation limits don't count time
-- spent blocked or in foreign calls.
--
-- @since 4.8.0.0
enableAllocationLimit :: IO ()
enableAllocationLimit :: IO ()
enableAllocationLimit = do
  ThreadId ThreadId#
t <- IO ThreadId
myThreadId
  ThreadId# -> IO ()
rts_enableThreadAllocationLimit ThreadId#
t

-- | Disable allocation limit processing for the current thread.
--
-- @since 4.8.0.0
disableAllocationLimit :: IO ()
disableAllocationLimit :: IO ()
disableAllocationLimit = do
  ThreadId ThreadId#
t <- IO ThreadId
myThreadId
  ThreadId# -> IO ()
rts_disableThreadAllocationLimit ThreadId#
t

foreign import ccall unsafe "rts_enableThreadAllocationLimit"
  rts_enableThreadAllocationLimit :: ThreadId# -> IO ()

foreign import ccall unsafe "rts_disableThreadAllocationLimit"
  rts_disableThreadAllocationLimit :: ThreadId# -> IO ()

{- |
Creates a new thread to run the 'IO' computation passed as the
first argument, and returns the 'ThreadId' of the newly created
thread.

The new thread will be a lightweight, /unbound/ thread.  Foreign calls
made by this thread are not guaranteed to be made by any particular OS
thread; if you need foreign calls to be made by a particular OS
thread, then use 'Control.Concurrent.forkOS' instead.

The new thread inherits the /masked/ state of the parent (see
'Control.Exception.mask').

The newly created thread has an exception handler that discards the
exceptions 'BlockedIndefinitelyOnMVar', 'BlockedIndefinitelyOnSTM', and
'ThreadKilled', and passes all other exceptions to the uncaught
exception handler.
-}
forkIO :: IO () -> IO ThreadId
forkIO :: IO () -> IO ThreadId
forkIO IO ()
action = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \ State# RealWorld
s ->
   case (forall a.
a -> State# RealWorld -> (# State# RealWorld, ThreadId# #)
fork# IO ()
action_plus State# RealWorld
s) of (# State# RealWorld
s1, ThreadId#
tid #) -> (# State# RealWorld
s1, ThreadId# -> ThreadId
ThreadId ThreadId#
tid #)
 where
  -- We must use 'catch' rather than 'catchException' because the action
  -- could be bottom. #13330
  action_plus :: IO ()
action_plus = forall e a. Exception e => IO a -> (e -> IO a) -> IO a
catch IO ()
action SomeException -> IO ()
childHandler

-- | Like 'forkIO', but the child thread is passed a function that can
-- be used to unmask asynchronous exceptions.  This function is
-- typically used in the following way
--
-- >  ... mask_ $ forkIOWithUnmask $ \unmask ->
-- >                 catch (unmask ...) handler
--
-- so that the exception handler in the child thread is established
-- with asynchronous exceptions masked, meanwhile the main body of
-- the child thread is executed in the unmasked state.
--
-- Note that the unmask function passed to the child thread should
-- only be used in that thread; the behaviour is undefined if it is
-- invoked in a different thread.
--
-- @since 4.4.0.0
forkIOWithUnmask :: ((forall a . IO a -> IO a) -> IO ()) -> IO ThreadId
forkIOWithUnmask :: ((forall a. IO a -> IO a) -> IO ()) -> IO ThreadId
forkIOWithUnmask (forall a. IO a -> IO a) -> IO ()
io = IO () -> IO ThreadId
forkIO ((forall a. IO a -> IO a) -> IO ()
io forall a. IO a -> IO a
unsafeUnmask)

{- |
Like 'forkIO', but lets you specify on which capability the thread
should run.  Unlike a `forkIO` thread, a thread created by `forkOn`
will stay on the same capability for its entire lifetime (`forkIO`
threads can migrate between capabilities according to the scheduling
policy).  `forkOn` is useful for overriding the scheduling policy when
you know in advance how best to distribute the threads.

The `Int` argument specifies a /capability number/ (see
'getNumCapabilities').  Typically capabilities correspond to physical
processors, but the exact behaviour is implementation-dependent.  The
value passed to 'forkOn' is interpreted modulo the total number of
capabilities as returned by 'getNumCapabilities'.

GHC note: the number of capabilities is specified by the @+RTS -N@
option when the program is started.  Capabilities can be fixed to
actual processor cores with @+RTS -qa@ if the underlying operating
system supports that, although in practice this is usually unnecessary
(and may actually degrade performance in some cases - experimentation
is recommended).

@since 4.4.0.0
-}
forkOn :: Int -> IO () -> IO ThreadId
forkOn :: Int -> IO () -> IO ThreadId
forkOn (I# Int#
cpu) IO ()
action = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \ State# RealWorld
s ->
   case (forall a.
Int# -> a -> State# RealWorld -> (# State# RealWorld, ThreadId# #)
forkOn# Int#
cpu IO ()
action_plus State# RealWorld
s) of (# State# RealWorld
s1, ThreadId#
tid #) -> (# State# RealWorld
s1, ThreadId# -> ThreadId
ThreadId ThreadId#
tid #)
 where
  -- We must use 'catch' rather than 'catchException' because the action
  -- could be bottom. #13330
  action_plus :: IO ()
action_plus = forall e a. Exception e => IO a -> (e -> IO a) -> IO a
catch IO ()
action SomeException -> IO ()
childHandler

-- | Like 'forkIOWithUnmask', but the child thread is pinned to the
-- given CPU, as with 'forkOn'.
--
-- @since 4.4.0.0
forkOnWithUnmask :: Int -> ((forall a . IO a -> IO a) -> IO ()) -> IO ThreadId
forkOnWithUnmask :: Int -> ((forall a. IO a -> IO a) -> IO ()) -> IO ThreadId
forkOnWithUnmask Int
cpu (forall a. IO a -> IO a) -> IO ()
io = Int -> IO () -> IO ThreadId
forkOn Int
cpu ((forall a. IO a -> IO a) -> IO ()
io forall a. IO a -> IO a
unsafeUnmask)

-- | the value passed to the @+RTS -N@ flag.  This is the number of
-- Haskell threads that can run truly simultaneously at any given
-- time, and is typically set to the number of physical processor cores on
-- the machine.
--
-- Strictly speaking it is better to use 'getNumCapabilities', because
-- the number of capabilities might vary at runtime.
--
numCapabilities :: Int
numCapabilities :: Int
numCapabilities = forall a. IO a -> a
unsafePerformIO forall a b. (a -> b) -> a -> b
$ IO Int
getNumCapabilities

{- |
Returns the number of Haskell threads that can run truly
simultaneously (on separate physical processors) at any given time.  To change
this value, use 'setNumCapabilities'.

@since 4.4.0.0
-}
getNumCapabilities :: IO Int
getNumCapabilities :: IO Int
getNumCapabilities = do
   CInt
n <- forall a. Storable a => Ptr a -> IO a
peek Ptr CInt
enabled_capabilities
   forall (m :: * -> *) a. Monad m => a -> m a
return (forall a b. (Integral a, Num b) => a -> b
fromIntegral CInt
n)

{- |
Set the number of Haskell threads that can run truly simultaneously
(on separate physical processors) at any given time.  The number
passed to `forkOn` is interpreted modulo this value.  The initial
value is given by the @+RTS -N@ runtime flag.

This is also the number of threads that will participate in parallel
garbage collection.  It is strongly recommended that the number of
capabilities is not set larger than the number of physical processor
cores, and it may often be beneficial to leave one or more cores free
to avoid contention with other processes in the machine.

@since 4.5.0.0
-}
setNumCapabilities :: Int -> IO ()
setNumCapabilities :: Int -> IO ()
setNumCapabilities Int
i
  | Int
i forall a. Ord a => a -> a -> Bool
<= Int
0    = forall a. String -> IO a
failIO forall a b. (a -> b) -> a -> b
$ String
"setNumCapabilities: Capability count ("forall a. [a] -> [a] -> [a]
++forall a. Show a => a -> String
show Int
iforall a. [a] -> [a] -> [a]
++String
") must be positive"
  | Bool
otherwise = CUInt -> IO ()
c_setNumCapabilities (forall a b. (Integral a, Num b) => a -> b
fromIntegral Int
i)

foreign import ccall safe "setNumCapabilities"
  c_setNumCapabilities :: CUInt -> IO ()

-- | Returns the number of CPUs that the machine has
--
-- @since 4.5.0.0
getNumProcessors :: IO Int
getNumProcessors :: IO Int
getNumProcessors = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall a b. (Integral a, Num b) => a -> b
fromIntegral IO CUInt
c_getNumberOfProcessors

foreign import ccall unsafe "getNumberOfProcessors"
  c_getNumberOfProcessors :: IO CUInt

-- | Returns the number of sparks currently in the local spark pool
numSparks :: IO Int
numSparks :: IO Int
numSparks = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s -> case forall d. State# d -> (# State# d, Int# #)
numSparks# State# RealWorld
s of (# State# RealWorld
s', Int#
n #) -> (# State# RealWorld
s', Int# -> Int
I# Int#
n #)

foreign import ccall "&enabled_capabilities" enabled_capabilities :: Ptr CInt

childHandler :: SomeException -> IO ()
childHandler :: SomeException -> IO ()
childHandler SomeException
err = forall e a. Exception e => IO a -> (e -> IO a) -> IO a
catch (SomeException -> IO ()
real_handler SomeException
err) SomeException -> IO ()
childHandler
  -- We must use catch here rather than catchException. If the
  -- raised exception throws an (imprecise) exception, then real_handler err
  -- will do so as well. If we use catchException here, then we could miss
  -- that exception.

real_handler :: SomeException -> IO ()
real_handler :: SomeException -> IO ()
real_handler SomeException
se
  | Just BlockedIndefinitelyOnMVar
BlockedIndefinitelyOnMVar <- forall e. Exception e => SomeException -> Maybe e
fromException SomeException
se  =  forall (m :: * -> *) a. Monad m => a -> m a
return ()
  | Just BlockedIndefinitelyOnSTM
BlockedIndefinitelyOnSTM  <- forall e. Exception e => SomeException -> Maybe e
fromException SomeException
se  =  forall (m :: * -> *) a. Monad m => a -> m a
return ()
  | Just AsyncException
ThreadKilled              <- forall e. Exception e => SomeException -> Maybe e
fromException SomeException
se  =  forall (m :: * -> *) a. Monad m => a -> m a
return ()
  | Just AsyncException
StackOverflow             <- forall e. Exception e => SomeException -> Maybe e
fromException SomeException
se  =  IO ()
reportStackOverflow
  | Bool
otherwise                                           =  SomeException -> IO ()
reportError SomeException
se

{- | 'killThread' raises the 'ThreadKilled' exception in the given
thread (GHC only).

> killThread tid = throwTo tid ThreadKilled

-}
killThread :: ThreadId -> IO ()
killThread :: ThreadId -> IO ()
killThread ThreadId
tid = forall e. Exception e => ThreadId -> e -> IO ()
throwTo ThreadId
tid AsyncException
ThreadKilled

{- | 'throwTo' raises an arbitrary exception in the target thread (GHC only).

Exception delivery synchronizes between the source and target thread:
'throwTo' does not return until the exception has been raised in the
target thread. The calling thread can thus be certain that the target
thread has received the exception.  Exception delivery is also atomic
with respect to other exceptions. Atomicity is a useful property to have
when dealing with race conditions: e.g. if there are two threads that
can kill each other, it is guaranteed that only one of the threads
will get to kill the other.

Whatever work the target thread was doing when the exception was
raised is not lost: the computation is suspended until required by
another thread.

If the target thread is currently making a foreign call, then the
exception will not be raised (and hence 'throwTo' will not return)
until the call has completed.  This is the case regardless of whether
the call is inside a 'mask' or not.  However, in GHC a foreign call
can be annotated as @interruptible@, in which case a 'throwTo' will
cause the RTS to attempt to cause the call to return; see the GHC
documentation for more details.

Important note: the behaviour of 'throwTo' differs from that described in
the paper \"Asynchronous exceptions in Haskell\"
(<http://research.microsoft.com/~simonpj/Papers/asynch-exns.htm>).
In the paper, 'throwTo' is non-blocking; but the library implementation adopts
a more synchronous design in which 'throwTo' does not return until the exception
is received by the target thread.  The trade-off is discussed in Section 9 of the paper.
Like any blocking operation, 'throwTo' is therefore interruptible (see Section 5.3 of
the paper).  Unlike other interruptible operations, however, 'throwTo'
is /always/ interruptible, even if it does not actually block.

There is no guarantee that the exception will be delivered promptly,
although the runtime will endeavour to ensure that arbitrary
delays don't occur.  In GHC, an exception can only be raised when a
thread reaches a /safe point/, where a safe point is where memory
allocation occurs.  Some loops do not perform any memory allocation
inside the loop and therefore cannot be interrupted by a 'throwTo'.

If the target of 'throwTo' is the calling thread, then the behaviour
is the same as 'Control.Exception.throwIO', except that the exception
is thrown as an asynchronous exception.  This means that if there is
an enclosing pure computation, which would be the case if the current
IO operation is inside 'unsafePerformIO' or 'unsafeInterleaveIO', that
computation is not permanently replaced by the exception, but is
suspended as if it had received an asynchronous exception.

Note that if 'throwTo' is called with the current thread as the
target, the exception will be thrown even if the thread is currently
inside 'mask' or 'uninterruptibleMask'.
  -}
throwTo :: Exception e => ThreadId -> e -> IO ()
throwTo :: forall e. Exception e => ThreadId -> e -> IO ()
throwTo (ThreadId ThreadId#
tid) e
ex = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \ State# RealWorld
s ->
   case (forall a. ThreadId# -> a -> State# RealWorld -> State# RealWorld
killThread# ThreadId#
tid (forall e. Exception e => e -> SomeException
toException e
ex) State# RealWorld
s) of State# RealWorld
s1 -> (# State# RealWorld
s1, () #)

-- | Returns the 'ThreadId' of the calling thread (GHC only).
myThreadId :: IO ThreadId
myThreadId :: IO ThreadId
myThreadId = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s ->
   case (State# RealWorld -> (# State# RealWorld, ThreadId# #)
myThreadId# State# RealWorld
s) of (# State# RealWorld
s1, ThreadId#
tid #) -> (# State# RealWorld
s1, ThreadId# -> ThreadId
ThreadId ThreadId#
tid #)


-- | The 'yield' action allows (forces, in a co-operative multitasking
-- implementation) a context-switch to any other currently runnable
-- threads (if any), and is occasionally useful when implementing
-- concurrency abstractions.
yield :: IO ()
yield :: IO ()
yield = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s ->
   case (State# RealWorld -> State# RealWorld
yield# State# RealWorld
s) of State# RealWorld
s1 -> (# State# RealWorld
s1, () #)

{- | 'labelThread' stores a string as identifier for this thread. This
identifier will be used in the debugging output to make distinction of
different threads easier (otherwise you only have the thread state object\'s
address in the heap). It also emits an event to the RTS eventlog.

Other applications like the graphical Concurrent Haskell Debugger
(<http://www.informatik.uni-kiel.de/~fhu/chd/>) may choose to overload
'labelThread' for their purposes as well.
-}

labelThread :: ThreadId -> String -> IO ()
labelThread :: ThreadId -> String -> IO ()
labelThread (ThreadId ThreadId#
t) String
str =
    forall a. TextEncoding -> String -> (CString -> IO a) -> IO a
GHC.Foreign.withCString TextEncoding
utf8 String
str forall a b. (a -> b) -> a -> b
$ \(Ptr Addr#
p) ->
    forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \ State# RealWorld
s ->
     case ThreadId# -> Addr# -> State# RealWorld -> State# RealWorld
labelThread# ThreadId#
t Addr#
p State# RealWorld
s of State# RealWorld
s1 -> (# State# RealWorld
s1, () #)

--      Nota Bene: 'pseq' used to be 'seq'
--                 but 'seq' is now defined in GHC.Prim
--
-- "pseq" is defined a bit weirdly (see below)
--
-- The reason for the strange "lazy" call is that
-- it fools the compiler into thinking that pseq  and par are non-strict in
-- their second argument (even if it inlines pseq at the call site).
-- If it thinks pseq is strict in "y", then it often evaluates
-- "y" before "x", which is totally wrong.

{-# INLINE pseq  #-}
pseq :: a -> b -> b
pseq :: forall a b. a -> b -> b
pseq  a
x b
y = a
x seq :: forall a b. a -> b -> b
`seq` forall a. a -> a
lazy b
y

{-# INLINE par  #-}
par :: a -> b -> b
par :: forall a b. a -> b -> b
par  a
x b
y = case (forall a. a -> Int#
par# a
x) of { Int#
_ -> forall a. a -> a
lazy b
y }

-- | Internal function used by the RTS to run sparks.
runSparks :: IO ()
runSparks :: IO ()
runSparks = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall {d}. State# d -> (# State# d, () #)
loop
  where loop :: State# d -> (# State# d, () #)
loop State# d
s = case forall d a. State# d -> (# State# d, Int#, a #)
getSpark# State# d
s of
                   (# State# d
s', Int#
n, Any
p #) ->
                      if Int# -> Bool
isTrue# (Int#
n Int# -> Int# -> Int#
==# Int#
0#)
                      then (# State# d
s', () #)
                      else Any
p seq :: forall a b. a -> b -> b
`seq` State# d -> (# State# d, () #)
loop State# d
s'

data BlockReason
  = BlockedOnMVar
        -- ^blocked on 'MVar'
  {- possibly (see 'threadstatus' below):
  | BlockedOnMVarRead
        -- ^blocked on reading an empty 'MVar'
  -}
  | BlockedOnBlackHole
        -- ^blocked on a computation in progress by another thread
  | BlockedOnException
        -- ^blocked in 'throwTo'
  | BlockedOnSTM
        -- ^blocked in 'retry' in an STM transaction
  | BlockedOnForeignCall
        -- ^currently in a foreign call
  | BlockedOnOther
        -- ^blocked on some other resource.  Without @-threaded@,
        -- I\/O and 'Control.Concurrent.threadDelay' show up as
        -- 'BlockedOnOther', with @-threaded@ they show up as 'BlockedOnMVar'.
  deriving ( BlockReason -> BlockReason -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: BlockReason -> BlockReason -> Bool
$c/= :: BlockReason -> BlockReason -> Bool
== :: BlockReason -> BlockReason -> Bool
$c== :: BlockReason -> BlockReason -> Bool
Eq   -- ^ @since 4.3.0.0
           , Eq BlockReason
BlockReason -> BlockReason -> Bool
BlockReason -> BlockReason -> Ordering
BlockReason -> BlockReason -> BlockReason
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: BlockReason -> BlockReason -> BlockReason
$cmin :: BlockReason -> BlockReason -> BlockReason
max :: BlockReason -> BlockReason -> BlockReason
$cmax :: BlockReason -> BlockReason -> BlockReason
>= :: BlockReason -> BlockReason -> Bool
$c>= :: BlockReason -> BlockReason -> Bool
> :: BlockReason -> BlockReason -> Bool
$c> :: BlockReason -> BlockReason -> Bool
<= :: BlockReason -> BlockReason -> Bool
$c<= :: BlockReason -> BlockReason -> Bool
< :: BlockReason -> BlockReason -> Bool
$c< :: BlockReason -> BlockReason -> Bool
compare :: BlockReason -> BlockReason -> Ordering
$ccompare :: BlockReason -> BlockReason -> Ordering
Ord  -- ^ @since 4.3.0.0
           , Int -> BlockReason -> ShowS
[BlockReason] -> ShowS
BlockReason -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [BlockReason] -> ShowS
$cshowList :: [BlockReason] -> ShowS
show :: BlockReason -> String
$cshow :: BlockReason -> String
showsPrec :: Int -> BlockReason -> ShowS
$cshowsPrec :: Int -> BlockReason -> ShowS
Show -- ^ @since 4.3.0.0
           )

-- | The current status of a thread
data ThreadStatus
  = ThreadRunning
        -- ^the thread is currently runnable or running
  | ThreadFinished
        -- ^the thread has finished
  | ThreadBlocked  BlockReason
        -- ^the thread is blocked on some resource
  | ThreadDied
        -- ^the thread received an uncaught exception
  deriving ( ThreadStatus -> ThreadStatus -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: ThreadStatus -> ThreadStatus -> Bool
$c/= :: ThreadStatus -> ThreadStatus -> Bool
== :: ThreadStatus -> ThreadStatus -> Bool
$c== :: ThreadStatus -> ThreadStatus -> Bool
Eq   -- ^ @since 4.3.0.0
           , Eq ThreadStatus
ThreadStatus -> ThreadStatus -> Bool
ThreadStatus -> ThreadStatus -> Ordering
ThreadStatus -> ThreadStatus -> ThreadStatus
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: ThreadStatus -> ThreadStatus -> ThreadStatus
$cmin :: ThreadStatus -> ThreadStatus -> ThreadStatus
max :: ThreadStatus -> ThreadStatus -> ThreadStatus
$cmax :: ThreadStatus -> ThreadStatus -> ThreadStatus
>= :: ThreadStatus -> ThreadStatus -> Bool
$c>= :: ThreadStatus -> ThreadStatus -> Bool
> :: ThreadStatus -> ThreadStatus -> Bool
$c> :: ThreadStatus -> ThreadStatus -> Bool
<= :: ThreadStatus -> ThreadStatus -> Bool
$c<= :: ThreadStatus -> ThreadStatus -> Bool
< :: ThreadStatus -> ThreadStatus -> Bool
$c< :: ThreadStatus -> ThreadStatus -> Bool
compare :: ThreadStatus -> ThreadStatus -> Ordering
$ccompare :: ThreadStatus -> ThreadStatus -> Ordering
Ord  -- ^ @since 4.3.0.0
           , Int -> ThreadStatus -> ShowS
[ThreadStatus] -> ShowS
ThreadStatus -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ThreadStatus] -> ShowS
$cshowList :: [ThreadStatus] -> ShowS
show :: ThreadStatus -> String
$cshow :: ThreadStatus -> String
showsPrec :: Int -> ThreadStatus -> ShowS
$cshowsPrec :: Int -> ThreadStatus -> ShowS
Show -- ^ @since 4.3.0.0
           )

threadStatus :: ThreadId -> IO ThreadStatus
threadStatus :: ThreadId -> IO ThreadStatus
threadStatus (ThreadId ThreadId#
t) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s ->
   case ThreadId#
-> State# RealWorld -> (# State# RealWorld, Int#, Int#, Int# #)
threadStatus# ThreadId#
t State# RealWorld
s of
    (# State# RealWorld
s', Int#
stat, Int#
_cap, Int#
_locked #) -> (# State# RealWorld
s', forall {a}. (Eq a, Num a) => a -> ThreadStatus
mk_stat (Int# -> Int
I# Int#
stat) #)
   where
        -- NB. keep these in sync with includes/rts/Constants.h
     mk_stat :: a -> ThreadStatus
mk_stat a
0  = ThreadStatus
ThreadRunning
     mk_stat a
1  = BlockReason -> ThreadStatus
ThreadBlocked BlockReason
BlockedOnMVar
     mk_stat a
2  = BlockReason -> ThreadStatus
ThreadBlocked BlockReason
BlockedOnBlackHole
     mk_stat a
6  = BlockReason -> ThreadStatus
ThreadBlocked BlockReason
BlockedOnSTM
     mk_stat a
10 = BlockReason -> ThreadStatus
ThreadBlocked BlockReason
BlockedOnForeignCall
     mk_stat a
11 = BlockReason -> ThreadStatus
ThreadBlocked BlockReason
BlockedOnForeignCall
     mk_stat a
12 = BlockReason -> ThreadStatus
ThreadBlocked BlockReason
BlockedOnException
     mk_stat a
14 = BlockReason -> ThreadStatus
ThreadBlocked BlockReason
BlockedOnMVar -- possibly: BlockedOnMVarRead
     -- NB. these are hardcoded in rts/PrimOps.cmm
     mk_stat a
16 = ThreadStatus
ThreadFinished
     mk_stat a
17 = ThreadStatus
ThreadDied
     mk_stat a
_  = BlockReason -> ThreadStatus
ThreadBlocked BlockReason
BlockedOnOther

-- | Returns the number of the capability on which the thread is currently
-- running, and a boolean indicating whether the thread is locked to
-- that capability or not.  A thread is locked to a capability if it
-- was created with @forkOn@.
--
-- @since 4.4.0.0
threadCapability :: ThreadId -> IO (Int, Bool)
threadCapability :: ThreadId -> IO (Int, Bool)
threadCapability (ThreadId ThreadId#
t) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s ->
   case ThreadId#
-> State# RealWorld -> (# State# RealWorld, Int#, Int#, Int# #)
threadStatus# ThreadId#
t State# RealWorld
s of
     (# State# RealWorld
s', Int#
_, Int#
cap#, Int#
locked# #) -> (# State# RealWorld
s', (Int# -> Int
I# Int#
cap#, Int# -> Bool
isTrue# (Int#
locked# Int# -> Int# -> Int#
/=# Int#
0#)) #)

-- | Make a weak pointer to a 'ThreadId'.  It can be important to do
-- this if you want to hold a reference to a 'ThreadId' while still
-- allowing the thread to receive the @BlockedIndefinitely@ family of
-- exceptions (e.g. 'BlockedIndefinitelyOnMVar').  Holding a normal
-- 'ThreadId' reference will prevent the delivery of
-- @BlockedIndefinitely@ exceptions because the reference could be
-- used as the target of 'throwTo' at any time, which would unblock
-- the thread.
--
-- Holding a @Weak ThreadId@, on the other hand, will not prevent the
-- thread from receiving @BlockedIndefinitely@ exceptions.  It is
-- still possible to throw an exception to a @Weak ThreadId@, but the
-- caller must use @deRefWeak@ first to determine whether the thread
-- still exists.
--
-- @since 4.6.0.0
mkWeakThreadId :: ThreadId -> IO (Weak ThreadId)
mkWeakThreadId :: ThreadId -> IO (Weak ThreadId)
mkWeakThreadId t :: ThreadId
t@(ThreadId ThreadId#
t#) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s ->
   case mkWeakNoFinalizer# :: forall a b.
a -> b -> State# RealWorld -> (# State# RealWorld, Weak# b #)
mkWeakNoFinalizer# ThreadId#
t# ThreadId
t State# RealWorld
s of
      (# State# RealWorld
s1, Weak# ThreadId
w #) -> (# State# RealWorld
s1, forall v. Weak# v -> Weak v
Weak Weak# ThreadId
w #)


data PrimMVar

-- | Make a StablePtr that can be passed to the C function
-- @hs_try_putmvar()@.  The RTS wants a 'StablePtr' to the underlying
-- 'MVar#', but a 'StablePtr#' can only refer to lifted types, so we
-- have to cheat by coercing.
newStablePtrPrimMVar :: MVar () -> IO (StablePtr PrimMVar)
newStablePtrPrimMVar :: MVar () -> IO (StablePtr PrimMVar)
newStablePtrPrimMVar (MVar MVar# RealWorld ()
m) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s0 ->
  case forall a.
a -> State# RealWorld -> (# State# RealWorld, StablePtr# a #)
makeStablePtr# (forall a b. a -> b
unsafeCoerce# MVar# RealWorld ()
m :: PrimMVar) State# RealWorld
s0 of
    -- Coerce unlifted  m :: MVar# RealWorld ()
    --     to lifted    PrimMVar
    -- apparently because mkStablePtr is not levity-polymorphic
    (# State# RealWorld
s1, StablePtr# PrimMVar
sp #) -> (# State# RealWorld
s1, forall a. StablePtr# a -> StablePtr a
StablePtr StablePtr# PrimMVar
sp #)

-----------------------------------------------------------------------------
-- Transactional heap operations
-----------------------------------------------------------------------------

-- TVars are shared memory locations which support atomic memory
-- transactions.

-- |A monad supporting atomic memory transactions.
newtype STM a = STM (State# RealWorld -> (# State# RealWorld, a #))

unSTM :: STM a -> (State# RealWorld -> (# State# RealWorld, a #))
unSTM :: forall a. STM a -> State# RealWorld -> (# State# RealWorld, a #)
unSTM (STM State# RealWorld -> (# State# RealWorld, a #)
a) = State# RealWorld -> (# State# RealWorld, a #)
a

-- | @since 4.3.0.0
instance  Functor STM where
   fmap :: forall a b. (a -> b) -> STM a -> STM b
fmap a -> b
f STM a
x = STM a
x forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= (forall (f :: * -> *) a. Applicative f => a -> f a
pure forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> b
f)

-- | @since 4.8.0.0
instance Applicative STM where
  {-# INLINE pure #-}
  {-# INLINE (*>) #-}
  {-# INLINE liftA2 #-}
  pure :: forall a. a -> STM a
pure a
x = forall a. a -> STM a
returnSTM a
x
  <*> :: forall a b. STM (a -> b) -> STM a -> STM b
(<*>) = forall (m :: * -> *) a b. Monad m => m (a -> b) -> m a -> m b
ap
  liftA2 :: forall a b c. (a -> b -> c) -> STM a -> STM b -> STM c
liftA2 = forall (m :: * -> *) a1 a2 r.
Monad m =>
(a1 -> a2 -> r) -> m a1 -> m a2 -> m r
liftM2
  STM a
m *> :: forall a b. STM a -> STM b -> STM b
*> STM b
k = forall a b. STM a -> STM b -> STM b
thenSTM STM a
m STM b
k

-- | @since 4.3.0.0
instance  Monad STM  where
    {-# INLINE (>>=)  #-}
    STM a
m >>= :: forall a b. STM a -> (a -> STM b) -> STM b
>>= a -> STM b
k     = forall a b. STM a -> (a -> STM b) -> STM b
bindSTM STM a
m a -> STM b
k
    >> :: forall a b. STM a -> STM b -> STM b
(>>) = forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
(*>)

bindSTM :: STM a -> (a -> STM b) -> STM b
bindSTM :: forall a b. STM a -> (a -> STM b) -> STM b
bindSTM (STM State# RealWorld -> (# State# RealWorld, a #)
m) a -> STM b
k = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM ( \State# RealWorld
s ->
  case State# RealWorld -> (# State# RealWorld, a #)
m State# RealWorld
s of
    (# State# RealWorld
new_s, a
a #) -> forall a. STM a -> State# RealWorld -> (# State# RealWorld, a #)
unSTM (a -> STM b
k a
a) State# RealWorld
new_s
  )

thenSTM :: STM a -> STM b -> STM b
thenSTM :: forall a b. STM a -> STM b -> STM b
thenSTM (STM State# RealWorld -> (# State# RealWorld, a #)
m) STM b
k = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM ( \State# RealWorld
s ->
  case State# RealWorld -> (# State# RealWorld, a #)
m State# RealWorld
s of
    (# State# RealWorld
new_s, a
_ #) -> forall a. STM a -> State# RealWorld -> (# State# RealWorld, a #)
unSTM STM b
k State# RealWorld
new_s
  )

returnSTM :: a -> STM a
returnSTM :: forall a. a -> STM a
returnSTM a
x = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM (\State# RealWorld
s -> (# State# RealWorld
s, a
x #))

-- | @since 4.8.0.0
instance Alternative STM where
  empty :: forall a. STM a
empty = forall a. STM a
retry
  <|> :: forall a. STM a -> STM a -> STM a
(<|>) = forall a. STM a -> STM a -> STM a
orElse

-- | @since 4.3.0.0
instance MonadPlus STM

-- | Unsafely performs IO in the STM monad.  Beware: this is a highly
-- dangerous thing to do.
--
--   * The STM implementation will often run transactions multiple
--     times, so you need to be prepared for this if your IO has any
--     side effects.
--
--   * The STM implementation will abort transactions that are known to
--     be invalid and need to be restarted.  This may happen in the middle
--     of `unsafeIOToSTM`, so make sure you don't acquire any resources
--     that need releasing (exception handlers are ignored when aborting
--     the transaction).  That includes doing any IO using Handles, for
--     example.  Getting this wrong will probably lead to random deadlocks.
--
--   * The transaction may have seen an inconsistent view of memory when
--     the IO runs.  Invariants that you expect to be true throughout
--     your program may not be true inside a transaction, due to the
--     way transactions are implemented.  Normally this wouldn't be visible
--     to the programmer, but using `unsafeIOToSTM` can expose it.
--
unsafeIOToSTM :: IO a -> STM a
unsafeIOToSTM :: forall a. IO a -> STM a
unsafeIOToSTM (IO State# RealWorld -> (# State# RealWorld, a #)
m) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM State# RealWorld -> (# State# RealWorld, a #)
m

-- | Perform a series of STM actions atomically.
--
-- Using 'atomically' inside an 'unsafePerformIO' or 'unsafeInterleaveIO'
-- subverts some of guarantees that STM provides. It makes it possible to
-- run a transaction inside of another transaction, depending on when the
-- thunk is evaluated. If a nested transaction is attempted, an exception
-- is thrown by the runtime. It is possible to safely use 'atomically' inside
-- 'unsafePerformIO' or 'unsafeInterleaveIO', but the typechecker does not
-- rule out programs that may attempt nested transactions, meaning that
-- the programmer must take special care to prevent these.
--
-- However, there are functions for creating transactional variables that
-- can always be safely called in 'unsafePerformIO'. See: 'newTVarIO',
-- 'Control.Concurrent.STM.TChan.newTChanIO',
-- 'Control.Concurrent.STM.TChan.newBroadcastTChanIO',
-- 'Control.Concurrent.STM.TQueue.newTQueueIO',
-- 'Control.Concurrent.STM.TBQueue.newTBQueueIO', and
-- 'Control.Concurrent.STM.TMVar.newTMVarIO'.
--
-- Using 'unsafePerformIO' inside of 'atomically' is also dangerous but for
-- different reasons. See 'unsafeIOToSTM' for more on this.

atomically :: STM a -> IO a
atomically :: forall a. STM a -> IO a
atomically (STM State# RealWorld -> (# State# RealWorld, a #)
m) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO (\State# RealWorld
s -> (forall a.
(State# RealWorld -> (# State# RealWorld, a #))
-> State# RealWorld -> (# State# RealWorld, a #)
atomically# State# RealWorld -> (# State# RealWorld, a #)
m) State# RealWorld
s )

-- | Retry execution of the current memory transaction because it has seen
-- values in 'TVar's which mean that it should not continue (e.g. the 'TVar's
-- represent a shared buffer that is now empty).  The implementation may
-- block the thread until one of the 'TVar's that it has read from has been
-- updated. (GHC only)
retry :: STM a
retry :: forall a. STM a
retry = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s# -> forall a. State# RealWorld -> (# State# RealWorld, a #)
retry# State# RealWorld
s#

-- | Compose two alternative STM actions (GHC only).
--
-- If the first action completes without retrying then it forms the result of
-- the 'orElse'. Otherwise, if the first action retries, then the second action
-- is tried in its place. If both actions retry then the 'orElse' as a whole
-- retries.
orElse :: STM a -> STM a -> STM a
orElse :: forall a. STM a -> STM a -> STM a
orElse (STM State# RealWorld -> (# State# RealWorld, a #)
m) STM a
e = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s -> forall a.
(State# RealWorld -> (# State# RealWorld, a #))
-> (State# RealWorld -> (# State# RealWorld, a #))
-> State# RealWorld
-> (# State# RealWorld, a #)
catchRetry# State# RealWorld -> (# State# RealWorld, a #)
m (forall a. STM a -> State# RealWorld -> (# State# RealWorld, a #)
unSTM STM a
e) State# RealWorld
s

-- | A variant of 'throw' that can only be used within the 'STM' monad.
--
-- Throwing an exception in @STM@ aborts the transaction and propagates the
-- exception. If the exception is caught via 'catchSTM', only the changes
-- enclosed by the catch are rolled back; changes made outside of 'catchSTM'
-- persist.
--
-- If the exception is not caught inside of the 'STM', it is re-thrown by
-- 'atomically', and the entire 'STM' is rolled back.
--
-- Although 'throwSTM' has a type that is an instance of the type of 'throw', the
-- two functions are subtly different:
--
-- > throw e    `seq` x  ===> throw e
-- > throwSTM e `seq` x  ===> x
--
-- The first example will cause the exception @e@ to be raised,
-- whereas the second one won\'t.  In fact, 'throwSTM' will only cause
-- an exception to be raised when it is used within the 'STM' monad.
-- The 'throwSTM' variant should be used in preference to 'throw' to
-- raise an exception within the 'STM' monad because it guarantees
-- ordering with respect to other 'STM' operations, whereas 'throw'
-- does not.
throwSTM :: Exception e => e -> STM a
throwSTM :: forall e a. Exception e => e -> STM a
throwSTM e
e = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM forall a b. (a -> b) -> a -> b
$ forall a b. a -> State# RealWorld -> (# State# RealWorld, b #)
raiseIO# (forall e. Exception e => e -> SomeException
toException e
e)

-- | Exception handling within STM actions.
--
-- @'catchSTM' m f@ catches any exception thrown by @m@ using 'throwSTM',
-- using the function @f@ to handle the exception. If an exception is
-- thrown, any changes made by @m@ are rolled back, but changes prior to
-- @m@ persist.
catchSTM :: Exception e => STM a -> (e -> STM a) -> STM a
catchSTM :: forall e a. Exception e => STM a -> (e -> STM a) -> STM a
catchSTM (STM State# RealWorld -> (# State# RealWorld, a #)
m) e -> STM a
handler = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM forall a b. (a -> b) -> a -> b
$ forall a b.
(State# RealWorld -> (# State# RealWorld, a #))
-> (b -> State# RealWorld -> (# State# RealWorld, a #))
-> State# RealWorld
-> (# State# RealWorld, a #)
catchSTM# State# RealWorld -> (# State# RealWorld, a #)
m SomeException -> State# RealWorld -> (# State# RealWorld, a #)
handler'
    where
      handler' :: SomeException -> State# RealWorld -> (# State# RealWorld, a #)
handler' SomeException
e = case forall e. Exception e => SomeException -> Maybe e
fromException SomeException
e of
                     Just e
e' -> forall a. STM a -> State# RealWorld -> (# State# RealWorld, a #)
unSTM (e -> STM a
handler e
e')
                     Maybe e
Nothing -> forall a b. a -> State# RealWorld -> (# State# RealWorld, b #)
raiseIO# SomeException
e

-- |Shared memory locations that support atomic memory transactions.
data TVar a = TVar (TVar# RealWorld a)

-- | @since 4.8.0.0
instance Eq (TVar a) where
        (TVar TVar# RealWorld a
tvar1#) == :: TVar a -> TVar a -> Bool
== (TVar TVar# RealWorld a
tvar2#) = Int# -> Bool
isTrue# (forall d a. TVar# d a -> TVar# d a -> Int#
sameTVar# TVar# RealWorld a
tvar1# TVar# RealWorld a
tvar2#)

-- | Create a new 'TVar' holding a value supplied
newTVar :: a -> STM (TVar a)
newTVar :: forall a. a -> STM (TVar a)
newTVar a
val = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s1# ->
    case forall a d. a -> State# d -> (# State# d, TVar# d a #)
newTVar# a
val State# RealWorld
s1# of
         (# State# RealWorld
s2#, TVar# RealWorld a
tvar# #) -> (# State# RealWorld
s2#, forall a. TVar# RealWorld a -> TVar a
TVar TVar# RealWorld a
tvar# #)

-- | @IO@ version of 'newTVar'.  This is useful for creating top-level
-- 'TVar's using 'System.IO.Unsafe.unsafePerformIO', because using
-- 'atomically' inside 'System.IO.Unsafe.unsafePerformIO' isn't
-- possible.
newTVarIO :: a -> IO (TVar a)
newTVarIO :: forall a. a -> IO (TVar a)
newTVarIO a
val = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s1# ->
    case forall a d. a -> State# d -> (# State# d, TVar# d a #)
newTVar# a
val State# RealWorld
s1# of
         (# State# RealWorld
s2#, TVar# RealWorld a
tvar# #) -> (# State# RealWorld
s2#, forall a. TVar# RealWorld a -> TVar a
TVar TVar# RealWorld a
tvar# #)

-- | Return the current value stored in a 'TVar'.
-- This is equivalent to
--
-- >  readTVarIO = atomically . readTVar
--
-- but works much faster, because it doesn't perform a complete
-- transaction, it just reads the current value of the 'TVar'.
readTVarIO :: TVar a -> IO a
readTVarIO :: forall a. TVar a -> IO a
readTVarIO (TVar TVar# RealWorld a
tvar#) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> IO a
IO forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s# -> forall d a. TVar# d a -> State# d -> (# State# d, a #)
readTVarIO# TVar# RealWorld a
tvar# State# RealWorld
s#

-- |Return the current value stored in a 'TVar'.
readTVar :: TVar a -> STM a
readTVar :: forall a. TVar a -> STM a
readTVar (TVar TVar# RealWorld a
tvar#) = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s# -> forall d a. TVar# d a -> State# d -> (# State# d, a #)
readTVar# TVar# RealWorld a
tvar# State# RealWorld
s#

-- |Write the supplied value into a 'TVar'.
writeTVar :: TVar a -> a -> STM ()
writeTVar :: forall a. TVar a -> a -> STM ()
writeTVar (TVar TVar# RealWorld a
tvar#) a
val = forall a. (State# RealWorld -> (# State# RealWorld, a #)) -> STM a
STM forall a b. (a -> b) -> a -> b
$ \State# RealWorld
s1# ->
    case forall d a. TVar# d a -> a -> State# d -> State# d
writeTVar# TVar# RealWorld a
tvar# a
val State# RealWorld
s1# of
         State# RealWorld
s2# -> (# State# RealWorld
s2#, () #)

-----------------------------------------------------------------------------
-- MVar utilities
-----------------------------------------------------------------------------

-- | Provide an 'IO' action with the current value of an 'MVar'. The 'MVar'
-- will be empty for the duration that the action is running.
withMVar :: MVar a -> (a -> IO b) -> IO b
withMVar :: forall a b. MVar a -> (a -> IO b) -> IO b
withMVar MVar a
m a -> IO b
io =
  forall b. ((forall a. IO a -> IO a) -> IO b) -> IO b
mask forall a b. (a -> b) -> a -> b
$ \forall a. IO a -> IO a
restore -> do
    a
a <- forall a. MVar a -> IO a
takeMVar MVar a
m
    b
b <- forall a. IO a -> (forall e. Exception e => e -> IO a) -> IO a
catchAny (forall a. IO a -> IO a
restore (a -> IO b
io a
a))
            (\e
e -> do forall a. MVar a -> a -> IO ()
putMVar MVar a
m a
a; forall a e. Exception e => e -> a
throw e
e)
    forall a. MVar a -> a -> IO ()
putMVar MVar a
m a
a
    forall (m :: * -> *) a. Monad m => a -> m a
return b
b

-- | Modify the value of an 'MVar'.
modifyMVar_ :: MVar a -> (a -> IO a) -> IO ()
modifyMVar_ :: forall a. MVar a -> (a -> IO a) -> IO ()
modifyMVar_ MVar a
m a -> IO a
io =
  forall b. ((forall a. IO a -> IO a) -> IO b) -> IO b
mask forall a b. (a -> b) -> a -> b
$ \forall a. IO a -> IO a
restore -> do
    a
a <- forall a. MVar a -> IO a
takeMVar MVar a
m
    a
a' <- forall a. IO a -> (forall e. Exception e => e -> IO a) -> IO a
catchAny (forall a. IO a -> IO a
restore (a -> IO a
io a
a))
            (\e
e -> do forall a. MVar a -> a -> IO ()
putMVar MVar a
m a
a; forall a e. Exception e => e -> a
throw e
e)
    forall a. MVar a -> a -> IO ()
putMVar MVar a
m a
a'
    forall (m :: * -> *) a. Monad m => a -> m a
return ()

-----------------------------------------------------------------------------
-- Thread waiting
-----------------------------------------------------------------------------

-- Machinery needed to ensure that we only have one copy of certain
-- CAFs in this module even when the base package is present twice, as
-- it is when base is dynamically loaded into GHCi.  The RTS keeps
-- track of the single true value of the CAF, so even when the CAFs in
-- the dynamically-loaded base package are reverted, nothing bad
-- happens.
--
sharedCAF :: a -> (Ptr a -> IO (Ptr a)) -> IO a
sharedCAF :: forall a. a -> (Ptr a -> IO (Ptr a)) -> IO a
sharedCAF a
a Ptr a -> IO (Ptr a)
get_or_set =
   forall a. IO a -> IO a
mask_ forall a b. (a -> b) -> a -> b
$ do
     StablePtr a
stable_ref <- forall a. a -> IO (StablePtr a)
newStablePtr a
a
     let ref :: Ptr b
ref = forall a b. Ptr a -> Ptr b
castPtr (forall a. StablePtr a -> Ptr ()
castStablePtrToPtr StablePtr a
stable_ref)
     Ptr a
ref2 <- Ptr a -> IO (Ptr a)
get_or_set forall {b}. Ptr b
ref
     if forall {b}. Ptr b
refforall a. Eq a => a -> a -> Bool
==Ptr a
ref2
        then forall (m :: * -> *) a. Monad m => a -> m a
return a
a
        else do forall a. StablePtr a -> IO ()
freeStablePtr StablePtr a
stable_ref
                forall a. StablePtr a -> IO a
deRefStablePtr (forall a. Ptr () -> StablePtr a
castPtrToStablePtr (forall a b. Ptr a -> Ptr b
castPtr Ptr a
ref2))

reportStackOverflow :: IO ()
reportStackOverflow :: IO ()
reportStackOverflow = do
     ThreadId ThreadId#
tid <- IO ThreadId
myThreadId
     ThreadId# -> IO ()
c_reportStackOverflow ThreadId#
tid

reportError :: SomeException -> IO ()
reportError :: SomeException -> IO ()
reportError SomeException
ex = do
   SomeException -> IO ()
handler <- IO (SomeException -> IO ())
getUncaughtExceptionHandler
   SomeException -> IO ()
handler SomeException
ex

-- SUP: Are the hooks allowed to re-enter Haskell land?  If so, remove
-- the unsafe below.
foreign import ccall unsafe "reportStackOverflow"
        c_reportStackOverflow :: ThreadId# -> IO ()

foreign import ccall unsafe "reportHeapOverflow"
        reportHeapOverflow :: IO ()

{-# NOINLINE uncaughtExceptionHandler #-}
uncaughtExceptionHandler :: IORef (SomeException -> IO ())
uncaughtExceptionHandler :: IORef (SomeException -> IO ())
uncaughtExceptionHandler = forall a. IO a -> a
unsafePerformIO (forall a. a -> IO (IORef a)
newIORef SomeException -> IO ()
defaultHandler)
   where
      defaultHandler :: SomeException -> IO ()
      defaultHandler :: SomeException -> IO ()
defaultHandler se :: SomeException
se@(SomeException e
ex) = do
         (Handle -> IO ()
hFlush Handle
stdout) forall a. IO a -> (forall e. Exception e => e -> IO a) -> IO a
`catchAny` (\ e
_ -> forall (m :: * -> *) a. Monad m => a -> m a
return ())
         let msg :: String
msg = case forall a b. (Typeable a, Typeable b) => a -> Maybe b
cast e
ex of
               Just Deadlock
Deadlock -> String
"no threads to run:  infinite loop or deadlock?"
               Maybe Deadlock
_                  -> forall a. Show a => Int -> a -> ShowS
showsPrec Int
0 SomeException
se String
""
         forall a. String -> (CString -> IO a) -> IO a
withCString String
"%s" forall a b. (a -> b) -> a -> b
$ \CString
cfmt ->
          forall a. String -> (CString -> IO a) -> IO a
withCString String
msg forall a b. (a -> b) -> a -> b
$ \CString
cmsg ->
            CString -> CString -> IO ()
errorBelch CString
cfmt CString
cmsg

-- don't use errorBelch() directly, because we cannot call varargs functions
-- using the FFI.
foreign import ccall unsafe "HsBase.h errorBelch2"
   errorBelch :: CString -> CString -> IO ()

setUncaughtExceptionHandler :: (SomeException -> IO ()) -> IO ()
setUncaughtExceptionHandler :: (SomeException -> IO ()) -> IO ()
setUncaughtExceptionHandler = forall a. IORef a -> a -> IO ()
writeIORef IORef (SomeException -> IO ())
uncaughtExceptionHandler

getUncaughtExceptionHandler :: IO (SomeException -> IO ())
getUncaughtExceptionHandler :: IO (SomeException -> IO ())
getUncaughtExceptionHandler = forall a. IORef a -> IO a
readIORef IORef (SomeException -> IO ())
uncaughtExceptionHandler