4This is an implementation of Cloud Haskell, as described in
5/Towards Haskell in the Cloud/ by Jeff Epstein, Andrew Black, and Simon
7<http://research.microsoft.com/en-us/um/people/simonpj/papers/parallel/>),
8although some of the details are different. The precise message passing
9semantics are based on /A unified semantics for future Erlang/ by Hans
10Svensson, Lars-Åke Fredlund and Clara Benac Earle.
12For a detailed description of the package and other reference materials,
13please see the distributed-process wiki page on github:
14<https://github.com/haskell-distributed/distributed-process/wiki>.
17module Control.Distributed.Process
25 , liftIO -- Reexported for convenience
40 -- * Unsafe messaging variants
45 -- * Advanced messaging
70 -- * Process management
79 , ProcessTerminationException(..)
80 , ProcessRegistrationException(..)
89 -- * Monitoring and linking
101 , MonitorRef -- opaque
102 , ProcessLinkException(..)
103 , NodeLinkException(..)
104 , PortLinkException(..)
105 , ProcessMonitorNotification(..)
106 , NodeMonitorNotification(..)
107 , PortMonitorNotification(..)
124 , registerRemoteAsync
125 , reregisterRemoteAsync
126 , unregisterRemoteAsync
131 -- * Exception handling
149 -- * Local versions of 'spawn'
158#if ! MIN_VERSION_base(4,6,0)
159import Prelude hiding (catch)
162import Control.Monad.IO.Class (liftIO)
163import Control.Applicative ((<$>))
164import Control.Monad.Reader (ask)
165import Control.Concurrent.MVar (newEmptyMVar, takeMVar, putMVar)
166import Control.Distributed.Static
172import Control.Distributed.Process.Internal.Types
177 , ProcessMonitorNotification(..)
178 , NodeMonitorNotification(..)
179 , PortMonitorNotification(..)
180 , ProcessLinkException(..)
181 , NodeLinkException(..)
182 , PortLinkException(..)
183 , ProcessRegistrationException(..)
192 , LocalProcess(processNode)
195import Control.Distributed.Process.Serializable (Serializable)
196import Control.Distributed.Process.Internal.Primitives
209 -- Advanced messaging
234 -- Process management
236 , ProcessTerminationException(..)
249 -- Monitoring and linking
269 , registerRemoteAsync
270 , reregisterRemoteAsync
271 , unregisterRemoteAsync
277 -- Exception handling
296import Control.Distributed.Process.Node (forkProcess)
297import Control.Distributed.Process.Internal.Spawn
298 ( -- Spawning Processes/Channels
306import Control.Exception (SomeException, throwIO)
310-- 1. 'send' never fails. If you want to know that the remote process received
311-- your message, you will need to send an explicit acknowledgement. If you
312-- want to know when the remote process failed, you will need to monitor
313-- that remote process.
315-- 2. 'send' may block (when the system TCP buffers are full, while we are
316-- trying to establish a connection to the remote endpoint, etc.) but its
317-- return does not imply that the remote process received the message (much
318-- less processed it). When 'send' targets a local process, it is dispatched
319-- via the node controller however, in which cases it will /not/ block. This
320-- isn't part of the semantics, so it should be ok. The ordering is maintained
321-- because the ctrlChannel still has FIFO semantics with regards interactions
322-- between two disparate forkIO threads.
324-- 3. Message delivery is reliable and ordered. That means that if process A
325-- sends messages m1, m2, m3 to process B, B will either arrive all three
326-- messages in order (m1, m2, m3) or a prefix thereof; messages will not be
327-- 'missing' (m1, m3) or reordered (m1, m3, m2)
329-- In order to guarantee (3), we stipulate that
331-- 3a. We do not garbage collect connections because Network.Transport provides
332-- ordering guarantees only *per connection*.
334-- 3b. Once a connection breaks, we have no way of knowing which messages
335-- arrived and which did not; hence, once a connection fails, we assume the
336-- remote process to be forever unreachable. Otherwise we might sent m1 and
337-- m2, get notified of the broken connection, reconnect, send m3, but only
340-- 3c. As a consequence of (3b) we should not reuse PIDs. If a process dies,
341-- we consider it forever unreachable. Hence, new processes should get new
342-- IDs or they too would be considered unreachable.
344-- Main reference for Cloud Haskell is
346-- [1] "Towards Haskell in the Cloud", Jeff Epstein, Andrew Black and Simon
348-- http://research.microsoft.com/en-us/um/people/simonpj/papers/parallel/remote.pdf
350-- The precise semantics for message passing is based on
352-- [2] "A Unified Semantics for Future Erlang", Hans Svensson, Lars-Ake Fredlund
353-- and Clara Benac Earle (not freely available online, unfortunately)
355-- Some pointers to related documentation about Erlang, for comparison and
358-- [3] "Programming Distributed Erlang Applications: Pitfalls and Recipes",
359-- Hans Svensson and Lars-Ake Fredlund
360-- http://man.lupaworld.com/content/develop/p37-svensson.pdf
361-- [4] The Erlang manual, sections "Message Sending" and "Send"
362-- http://www.erlang.org/doc/reference_manual/processes.html#id82409
363-- http://www.erlang.org/doc/reference_manual/expressions.html#send
364-- [5] Questions "Is the order of message reception guaranteed?" and
365-- "If I send a message, is it guaranteed to reach the receiver?" of
367-- http://www.erlang.org/faq/academic.html
368-- [6] "Delivery of Messages", post on erlang-questions
369-- http://erlang.org/pipermail/erlang-questions/2012-February/064767.html
371--------------------------------------------------------------------------------
372-- Local versions of spawn --
373--------------------------------------------------------------------------------
375-- | Spawn a process on the local node
376spawnLocal :: Process () -> Process ProcessId
378 node <- processNode <$> ask
379 liftIO $ forkProcess node proc
381-- | Create a new typed channel, spawn a process on the local node, passing it
382-- the receive port, and return the send port
383spawnChannelLocal :: Serializable a
384 => (ReceivePort a -> Process ())
385 -> Process (SendPort a)
386spawnChannelLocal proc = do
387 node <- processNode <$> ask
390 _ <- forkProcess node $ do
391 -- It is important that we allocate the new channel in the new process,
392 -- because otherwise it will be associated with the wrong process ID
393 (sport, rport) <- newChan
394 liftIO $ putMVar mvar sport
398-- | Local version of 'call'. Running a process in this way isolates it from
399-- messages sent to the caller process, and also allows silently dropping late
400-- or duplicate messages sent to the isolated process after it exits.
401-- Silently dropping messages may not always be the best approach.
403 Process a -- ^ Process to run
404 -> Process a -- ^ Value returned
406 mv <- liftIO newEmptyMVar
410 try proc >>= liftIO . putMVar mv
411 liftIO $ takeMVar mv >>=
412 either (throwIO :: SomeException -> IO a) return
keysesc to close
- j k
- move down, up
- enter
- open
- esc
- back, or up a level
- 1 2 3 4
- readme, files, commits, refs
- /
- filter
- y
- copy the clone command
- c
- compare the chosen commit with another (or shift-click both)
- ?
- show or hide this list