@@ -9,125 +9,70 @@
99{-# LANGUAGE GADTs #-}
1010{-# LANGUAGE GeneralizedNewtypeDeriving #-}
1111{-# LANGUAGE LambdaCase #-}
12+{-# LANGUAGE MagicHash #-}
13+{-# LANGUAGE MultiParamTypeClasses #-}
14+{-# LANGUAGE MultiWayIf #-}
1215{-# LANGUAGE RankNTypes #-}
1316{-# LANGUAGE RoleAnnotations #-}
1417{-# LANGUAGE ScopedTypeVariables #-}
1518{-# LANGUAGE TypeFamilies #-}
1619{-# LANGUAGE TypeOperators #-}
1720{-# LANGUAGE UndecidableInstances #-}
18−{-# LANGUAGE PolyKinds #-}
19−{-# LANGUAGE DeriveFunctor #-}
20−{-# LANGUAGE StandaloneDeriving #-}
21−{-# LANGUAGE InstanceSigs #-}
22−{-# LANGUAGE MultiWayIf #-}
23−
24−#ifdef USE_REFLEX_OPTIMIZER
25−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
26−#endif
27−{-# OPTIONS_GHC -Wunused-binds #-}
2821-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
2922-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
30−module Reflex.Spider.Internal (module Reflex.Spider.Internal) where
23+module Reflex.Spider.Internal where
3124
32−#if MIN_VERSION_base(4,10,0)
33−import Control.Applicative (liftA2)
34−#endif
25+import Control.Applicative
3526import Control.Concurrent
3627import Control.Exception
37−import Control.Monad hiding (forM, forM_, mapM, mapM_)
28+import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
3829import Control.Monad.Exception
39−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
30+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
4031import Control.Monad.Primitive
41−import Control.Monad.Reader.Class
42−import Control.Monad.IO.Class
43−import Control.Monad.ReaderIO
32+import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
4433import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
46−import qualified Control.Monad.Fail as MonadFail
4734import Data.Align
4835import Data.Coerce
49−import Data.Dependent.Map (DMap)
36+import Data.Dependent.Map (DMap, DSum (..))
5037import qualified Data.Dependent.Map as DMap
51−import Data.Dependent.Sum (DSum (..))
52−import Data.FastMutableIntMap (FastMutableIntMap, PatchIntMap (..))
53−import qualified Data.FastMutableIntMap as FastMutableIntMap
5438import Data.Foldable hiding (concat, elem, sequence_)
39+import Data.Function
5540import Data.Functor.Constant
56−import Data.Functor.Misc
5741import Data.Functor.Product
5842import Data.GADT.Compare
5943import Data.IntMap.Strict (IntMap)
6044import qualified Data.IntMap.Strict as IntMap
6145import Data.IORef
62−import Data.Kind (Type)
63−import Data.Maybe hiding (mapMaybe)
64−import Data.Monoid (mempty, (<>))
65−import Data.Proxy
46+import Data.List hiding (foldl')
47+import Data.Maybe
48+import Data.Monoid ((<>))
49+import Data.Some (Some)
50+import qualified Data.Some as Some
6651import Data.These
6752import Data.Traversable
68−import Data.Type.Equality ((:~:)(Refl))
69−import Data.Witherable (Filterable, mapMaybe)
70−import GHC.Exts hiding (toList)
53+import Data.Type.Coercion
54+import Data.Word
7155import GHC.IORef (IORef (..))
7256import GHC.Stack
73−import Reflex.FastWeak
7457import System.IO.Unsafe
7558import System.Mem.Weak
7659import Unsafe.Coerce
7760
78−#ifdef MIN_VERSION_semialign
79−#if MIN_VERSION_these(0,8,0)
80−import Data.These.Combinators (justThese)
81−#endif
82−#if MIN_VERSION_semialign(1,1,0)
83−import Data.Zip (Zip (..))
84−#endif
85−#endif
86−
8761#ifdef DEBUG_CYCLES
8862import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89−#endif
90−
9163import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
9264import qualified Data.List.NonEmpty as NonEmpty
65+import Data.Monoid (mempty)
9366import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
95−
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
97−import qualified Data.FastWeakBag as FastWeakBag
67+#endif
9868
99−import Data.Reflection
100−import Data.Some (Some(Some))
101−import Data.Type.Coercion
102−import Data.Profunctor.Unsafe ((#.), (.#))
103−import Data.WeakBag (WeakBag, WeakBagTicket, _weakBag_children)
69+import Data.WeakBag (WeakBag, WeakBagTicket)
10470import qualified Data.WeakBag as WeakBag
105−import qualified Reflex.Class
10671import qualified Reflex.Class as R
107−import qualified Reflex.Host.Class
108−import Reflex.NotReady.Class
109−import Data.Patch
110−import qualified Data.Patch.DMapWithMove as PatchDMapWithMove
111−import Reflex.PerformEvent.Base (PerformEventT)
112−
113−#ifdef DEBUG_TRACE_EVENTS
114−import qualified Data.ByteString.Char8 as BS8
115−import System.IO (stderr)
116−import Data.List (isPrefixOf)
117−#endif
72+import qualified Reflex.Host.Class as R
11873
119−-- TODO stdout might not be the best channel for debug output
120−debugStrLn :: String -> IO ()
121−debugStrLn = putStrLn
122−
123−#ifdef DEBUG_TRACE_EVENTS
124−withStackOneLine :: (BS8.ByteString -> a) -> a
125−withStackOneLine expr = unsafePerformIO $ do
126− stack <- currentCallStack
127− return (expr . BS8.pack . unwords . dropInternal . reverse $ stack)
128− where dropInternal = filterStack "Reflex.Spider.Internal"
129−
130−#endif
74+-- Note: must come last to silence warnings due to AMP on GHC < 7.10
75+import Prelude hiding (any, concat, mapM, mapM_, sequence)
13176
13277debugPropagate :: Bool
13378
@@ -136,42 +81,31 @@ debugInvalidateHeight :: Bool
13681debugInvalidate :: Bool
13782
13883#ifdef DEBUG
84+
13985#define DEBUG_NODEIDS
14086
141−#ifdef DEBUG_TRACE_PROPAGATION
14287debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
14688
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
15089debugInvalidateHeight = False
151−#endif
15290
153−#ifdef DEBUG_TRACE_INVALIDATION
15491debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
15892
15993class HasNodeId a where
16094 getNodeId :: a -> Int
16195
162−instance HasNodeId (CacheSubscribed x a) where
163− getNodeId = _cacheSubscribed_nodeId
164−
165−instance HasNodeId (FanInt x a) where
166− getNodeId = _fanInt_nodeId
167−
168−instance HasNodeId (Hold x p) where
96+instance HasNodeId (Hold x p a) where
16997 getNodeId = holdNodeId
17098
99+instance HasNodeId (PushSubscribed x a b) where
100+ getNodeId = pushSubscribedNodeId
101+
171102instance HasNodeId (SwitchSubscribed x a) where
172103 getNodeId = switchSubscribedNodeId
173104
174−instance HasNodeId (FanSubscribed x v a) where
105+instance HasNodeId (MergeSubscribed x a) where
106+ getNodeId = mergeSubscribedNodeId
107+
108+instance HasNodeId (FanSubscribed x a) where
175109 getNodeId = fanSubscribedNodeId
176110
177111instance HasNodeId (CoincidenceSubscribed x a) where
@@ -185,16 +119,41 @@ instance HasNodeId (Pull x a) where
185119
186120{-# INLINE showNodeId #-}
187121showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
192−
122+showNodeId = ("#"<>) . show . getNodeId
123+
124+showSubscriberType :: Subscriber x a -> String
125+showSubscriberType = \case
126+ SubscriberPush _ _ -> "SubscriberPush"
127+ SubscriberMerge _ _ -> "SubscriberMerge"
128+ SubscriberFan _ -> "SubscriberFan"
129+ SubscriberMergeChange _ -> "SubscriberMergeChange"
130+ SubscriberHold _ -> "SubscriberHold"
131+ SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
132+ SubscriberSwitch _ -> "SubscriberSwitch"
133+ SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
134+ SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
135+ SubscriberHandle -> "SubscriberHandle"
136+
137+showEventType :: Event x a -> String
138+showEventType = \case
139+ EventRoot _ _ -> "EventRoot"
140+ EventNever -> "EventNever"
141+ EventPush _ -> "EventPush"
142+ EventMerge _ -> "EventMerge"
143+ EventFan _ _ -> "EventFan"
144+ EventSwitch _ -> "EventSwitch"
145+ EventCoincidence _ -> "EventCoincidence"
146+ EventHold _ -> "EventHold"
147+ EventDyn _ -> "EventDyn"
148+ EventHoldIdentity _ -> "EventHoldIdentity"
149+ EventDynIdentity _ -> "EventDynIdentity"
193150
194151#else
195152
196153debugPropagate = False
154+
197155debugInvalidateHeight = False
156+
198157debugInvalidate = False
199158
200159-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -202,10 +161,6 @@ debugInvalidate = False
202161showNodeId :: a -> String
203162showNodeId _ = ""
204163
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209164#endif
210165
211166#ifdef DEBUG_NODEIDS
@@ -215,237 +170,59 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
215170
216171newNodeId :: IO Int
217172newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
218−#endif
219−
220−--------------------------------------------------------------------------------
221−-- EventSubscription
222−--------------------------------------------------------------------------------
223−
224−--NB: Once you subscribe to an Event, you must always hold on the the WHOLE EventSubscription you get back
225−-- If you do not retain the subscription, you may be prematurely unsubscribed from the parent event.
226−data EventSubscription x = EventSubscription
227− { _eventSubscription_unsubscribe :: !(IO ())
228− , _eventSubscription_subscribed :: {-# UNPACK #-} !(EventSubscribed x)
229− }
230173
231−unsubscribe :: EventSubscription x -> IO ()
232−unsubscribe (EventSubscription u _) = u
174+{-# NOINLINE unsafeNodeId #-}
175+unsafeNodeId :: a -> Int
176+unsafeNodeId a = unsafePerformIO $ do
177+ touch a
178+ newNodeId
179+#endif
233180
234181--------------------------------------------------------------------------------
235182-- Event
236183--------------------------------------------------------------------------------
237184
238−newtype Event x a = Event { unEvent :: Subscriber x a -> EventM x (EventSubscription x, Maybe a) }
239−
240−{-# INLINE subscribeAndRead #-}
241−subscribeAndRead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
242−subscribeAndRead = unEvent
243−
244−{-# RULES
245−"cacheEvent/cacheEvent" forall e. cacheEvent (cacheEvent e) = cacheEvent e
246−"cacheEvent/pushCheap" forall f e. pushCheap f (cacheEvent e) = cacheEvent (pushCheap f e)
247−"hold/cacheEvent" forall f e. hold f (cacheEvent e) = hold f e
248− #-}
249−
250−-- | Construct an 'Event' equivalent to that constructed by 'push', but with no
251−-- caching; if the computation function is very cheap, this is (much) more
252−-- efficient than 'push'
253−{-# INLINE [1] pushCheap #-}
254−pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
255−pushCheap !f e = Event $ \sub -> do
256− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "push" $ sub
257− { subscriberPropagate = \a -> do
258− mb <- f a
259− mapM_ (subscriberPropagate sub) mb
260− }
261− occ' <- join <$> mapM f occ
262− return (subscription, occ')
263−
264−-- | A subscriber that never triggers other 'Event's
265−{-# INLINE terminalSubscriber #-}
266−terminalSubscriber :: (a -> EventM x ()) -> Subscriber x a
267−terminalSubscriber p = Subscriber
268− { subscriberPropagate = p
269− , subscriberInvalidateHeight = \_ -> return ()
270− , subscriberRecalculateHeight = \_ -> return ()
271− }
272−
273−-- | Subscribe to an Event only for the duration of one occurrence
274−{-# INLINE subscribeAndReadHead #-}
275−subscribeAndReadHead :: HasSpiderTimeline x => Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
276−subscribeAndReadHead e sub = do
277− subscriptionRef <- liftIO $ newIORef $ error "subscribeAndReadHead: not initialized"
278− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "head" $ sub
279− { subscriberPropagate = \a -> do
280− liftIO $ unsubscribe =<< readIORef subscriptionRef
281− subscriberPropagate sub a
282− }
283− liftIO $ case occ of
284− Nothing -> writeIORef subscriptionRef $! subscription
285− Just _ -> unsubscribe subscription
286− return (subscription, occ)
287−
288−--TODO: Make this lazy in its input event
289−headE :: (MonadIO m, Defer (SomeMergeInit x) m, HasSpiderTimeline x) => Event x a -> m (Event x a)
290−headE originalE = do
291− parent <- liftIO $ newIORef $ Just originalE
292− defer $ SomeMergeInit $ do --TODO: Rename SomeMergeInit appropriately
293− let clearParent = liftIO $ writeIORef parent Nothing
294− (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ const clearParent
295− when (isJust occ) clearParent
296− return $ Event $ \sub ->
297− liftIO (readIORef parent) >>= \case
298− Nothing -> subscribeAndReadNever
299− Just e -> subscribeAndReadHead e sub
300−
301−data CacheSubscribed x a
302− = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(FastWeakBag (Subscriber x a))
303− , _cacheSubscribed_parent :: {-# UNPACK #-} !(EventSubscription x)
304− , _cacheSubscribed_occurrence :: {-# UNPACK #-} !(IORef (Maybe a))
305−#ifdef DEBUG_NODEIDS
306− , _cacheSubscribed_nodeId :: {-# UNPACK #-} !Int
307−#endif
308− }
309−
310−nowSpiderEventM :: (HasSpiderTimeline x) => EventM x (R.Event (SpiderTimeline x) ())
311−nowSpiderEventM =
312− SpiderEvent <$> now
313−
314−now :: (MonadIO m, Defer (Some Clear) m, HasSpiderTimeline x
315− ) => m (Event x ())
316−now = do
317− nowOrNot <- liftIO $ newIORef $ Just ()
318− scheduleClear nowOrNot
319− return . Event $ \_ -> do
320− occ <- liftIO . readIORef $ nowOrNot
321− return ( EventSubscription (return ()) eventSubscribedNow
322− , occ
323− )
324−
325−-- | Construct an 'Event' whose value is guaranteed not to be recomputed
326−-- repeatedly
327−--
328−--TODO: Try a caching strategy where we subscribe directly to the parent when
329−--there's only one subscriber, and then build our own FastWeakBag only when a second
330−--subscriber joins
331−{-# NOINLINE [0] cacheEvent #-}
332−cacheEvent :: forall x a. HasSpiderTimeline x => Event x a -> Event x a
333−cacheEvent e =
334−#ifdef DEBUG_TRACE_EVENTS
335− withStackOneLine $ \callSite -> Event $
336−#else
337− Event $
338−#endif
339− unsafePerformIO $ do
340− mSubscribedRef :: IORef (FastWeak (CacheSubscribed x a))
341− <- newIORef emptyFastWeak
342− pure $ \sub -> {-# SCC "cacheEvent" #-} do
343−#ifdef DEBUG_TRACE_EVENTS
344− unless (BS8.null callSite) $ liftIO $ BS8.hPutStrLn stderr callSite
345−#endif
346− subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347− Just subscribedTicket -> return subscribedTicket
348− Nothing -> do
349−#ifdef DEBUG_NODEIDS
350− nodeId <- liftIO newNodeId
351−#endif
352− subscribers <- liftIO FastWeakBag.empty
353− occRef <- liftIO $ newIORef Nothing -- This should never be read prior to being set below
354−#ifdef DEBUG_NODEIDS
355− (parentSub, occ) <- subscribeAndRead e $ debugSubscriber' ("cacheEvent" <> showNodeId' nodeId) $ Subscriber
356−#else
357− (parentSub, occ) <- subscribeAndRead e $ Subscriber
358−#endif
359− { subscriberPropagate = \a -> do
360− liftIO $ writeIORef occRef (Just a)
361− scheduleClear occRef
362− propagateFast a subscribers
363− , subscriberInvalidateHeight = FastWeakBag.traverse_ subscribers . invalidateSubscriberHeight
364− , subscriberRecalculateHeight = FastWeakBag.traverse_ subscribers . recalculateSubscriberHeight
365− }
366− when (isJust occ) $ do
367− liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368− scheduleClear occRef
369− let !subscribed = CacheSubscribed
370− { _cacheSubscribed_subscribers = subscribers
371− , _cacheSubscribed_parent = parentSub
372− , _cacheSubscribed_occurrence = occRef
373−#ifdef DEBUG_NODEIDS
374− , _cacheSubscribed_nodeId = nodeId
375−#endif
376− }
377− subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378− liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379− return subscribedTicket
380− liftIO $ cacheSubscription sub mSubscribedRef subscribedTicket
381−
382−cacheSubscription :: Subscriber x a -> IORef (FastWeak (CacheSubscribed x a))
383− -> FastWeakTicket (CacheSubscribed x a) -> IO (EventSubscription x, Maybe a)
384−cacheSubscription sub mSubscribedRef subscribedTicket = do
385− subscribed <- getFastWeakTicketValue subscribedTicket
386− ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
387− occ <- readIORef $ _cacheSubscribed_occurrence subscribed
388−
389− let parentSub = _cacheSubscribed_parent subscribed
390− es = EventSubscription
391− { _eventSubscription_unsubscribe = do
392− FastWeakBag.remove ticket
393−
394− isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
395− when isEmpty $ do
396− writeIORef mSubscribedRef emptyFastWeak
397− unsubscribe parentSub
398− touch ticket
399− touch subscribedTicket
400− , _eventSubscription_subscribed = EventSubscribed
401− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub
402− , eventSubscribedRetained = toAny subscribedTicket
403−#ifdef DEBUG_CYCLES
404− , eventSubscribedGetParents = return [_eventSubscription_subscribed parentSub]
405− , eventSubscribedHasOwnHeightRef = False
406− , eventSubscribedWhoCreated = whoCreatedIORef mSubscribedRef
407−#endif
408− }
409− }
410− return (es, occ)
411−
185+newtype Event x a = Event { subscribeAndRead :: Subscriber x a -> EventM x (EventSubscription x a, Maybe a) }
412186
413−subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
187+subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x a)
414188subscribe e s = fst <$> subscribeAndRead e s
415189
416190{-# INLINE wrap #-}
417−wrap :: MonadIO m => (t -> EventSubscribed x) -> (Subscriber x a -> m (WeakBagTicket, t, Maybe a)) -> Subscriber x a -> m (EventSubscription x, Maybe a)
191+wrap :: MonadIO m => (t -> EventSubscribed x a) -> (Subscriber x a -> m (WeakBagTicket (Subscriber x a), t, Maybe a)) -> Subscriber x a -> m (EventSubscription x a, Maybe a)
418192wrap tag getSpecificSubscribed sub = do
419193 (sln, subd, occ) <- getSpecificSubscribed sub
420194 let es = tag subd
421− return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
195+ return (EventSubscription (Just sln) es, occ)
422196
423−eventRoot :: (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Event x a
197+eventRoot :: GCompare k => k a -> Root x k -> Event x a
424198eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
425199
426−subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427−subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428−
429200eventNever :: Event x a
430−eventNever = Event $ const subscribeAndReadNever
201+eventNever = Event $ \_ -> return (EventSubscription Nothing eventSubscribedNever, Nothing)
202+
203+eventPush :: Push x b a -> Event x a
204+eventPush !p = Event $ wrap eventSubscribedPush $ getPushSubscribed p
431205
432−eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
206+eventMerge :: (GCompare k, a ~ DMap k Identity) => Merge x k -> Event x a
207+eventMerge !m = Event $ wrap eventSubscribedMerge $ getMergeSubscribed m
208+
209+eventFan :: GCompare k => k a -> Fan x k -> Event x a
433210eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
434211
435−eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
212+eventSwitch :: Switch x a -> Event x a
436213eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
437214
438−eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
215+eventCoincidence :: Coincidence x a -> Event x a
439216eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
440217
441218eventHold :: Hold x p -> Event x p
442219eventHold !h = Event $ subscribeHoldEvent h
443220
444−eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
221+eventDyn :: R.Patch p => Dyn x p -> Event x p
445222eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
446223
447224{-# INLINE subscribeCoincidenceInner #-}
448−subscribeCoincidenceInner :: HasSpiderTimeline x => Event x a -> Height -> CoincidenceSubscribed x a -> EventM x (Maybe a, Height, EventSubscribed x)
225+subscribeCoincidenceInner :: CanSubscribe x m => Event x a -> Height -> CoincidenceSubscribed x a -> m (Maybe a, Height, EventSubscribed x a)
449226subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
450227 subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
451228 (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
@@ -464,75 +241,171 @@ data Subscriber x a = Subscriber
464241 , subscriberRecalculateHeight :: !(Height -> IO ())
465242 }
466243
467−newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
244+--TODO: Move this comment to WeakBag
245+-- These function are constructor functions that are marked NOINLINE so they are
246+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
247+-- so any weak references that are attached to the constructors will have their
248+-- finalizer run. Using the opaque constructor, does not see the
249+-- constructor application, so it behaves like an IORef and cannot be fused away.
250+--
251+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
252+-- the weak pointer to it in some cases.
253+
254+newSubscriberPush :: (a -> ComputeM x (Maybe b)) -> PushSubscribed x a b -> IO (Subscriber x a)
255+newSubscriberPush compute subscribed = return $ Subscriber
256+ { subscriberPropagate = \a -> {-# SCC "traversePush" #-} do
257+ tracePropagate $ "SubscriberPush" <> showNodeId subscribed
258+ occ <- runComputeM $ compute a
259+ case occ of
260+ Nothing -> return () -- No need to write a Nothing back into the Ref
261+ Just o -> do
262+ liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
263+ scheduleClear $ pushSubscribedOccurrence subscribed
264+ propagate o $ pushSubscribedSubscribers subscribed
265+ , subscriberInvalidateHeight = \old -> do
266+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
267+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ invalidateSubscriberHeight old
268+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
269+ , subscriberRecalculateHeight = \new -> do
270+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
271+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
272+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
273+ }
274+
275+newSubscriberHold :: R.Patch p => Hold x p -> IO (Subscriber x p)
468276newSubscriberHold h = return $ Subscriber
469277 { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
470278 , subscriberInvalidateHeight = \_ -> return ()
471279 , subscriberRecalculateHeight = \_ -> return ()
472280 }
473281
474−newSubscriberFan :: forall x k v. (HasSpiderTimeline x, GCompare k) => FanSubscribed x k v -> IO (Subscriber x (DMap k v))
475−newSubscriberFan subscribed = debugSubscriber ("SubscriberFan " <> showNodeId subscribed) $ Subscriber
282+newSubscriberMerge :: GCompare k => k a -> MergeSubscribed x k -> IO (Subscriber x a)
283+newSubscriberMerge k subscribed = return $ Subscriber
284+ { subscriberPropagate = \a -> {-# SCC "traverseMerge" #-} do
285+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
286+ oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
287+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
288+ tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
289+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
290+ when (DMap.null oldM) $ do -- Only schedule the firing once
291+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
292+ --TODO: assertions about height
293+ currentHeight <- getCurrentHeight
294+ when (height <= currentHeight) $ do
295+ if height /= invalidHeight
296+ then do
297+ myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
298+ error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
299+ else liftIO $ do
300+#ifdef DEBUG_CYCLES
301+ nodesInvolvedInCycle <- walkInvalidHeightParents $ eventSubscribedMerge subscribed
302+ stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
303+ let cycleInfo = ":\n" <> drawForest (listsToForest stacks)
304+#else
305+ let cycleInfo = ""
306+#endif
307+ error $ "Causality loop found" <> cycleInfo
308+ scheduleMerge height subscribed
309+ , subscriberInvalidateHeight = \old -> do
310+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
311+ removeMergeHeight old subscribed
312+ invalidateMergeHeight subscribed
313+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
314+ , subscriberRecalculateHeight = \new -> do
315+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
316+ addMergeHeight new subscribed
317+ revalidateMergeHeight subscribed
318+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
319+ }
320+
321+newSubscriberMergeChange :: GCompare k => MergeSubscribed x k -> IO (Subscriber x (R.PatchDMap k (Event x)))
322+newSubscriberMergeChange subscribed = return $ Subscriber
323+ { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
324+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
325+ defer $ SomeMergeUpdate a subscribed
326+ , subscriberInvalidateHeight = \_ -> return ()
327+ , subscriberRecalculateHeight = \_ -> return ()
328+ }
329+
330+newSubscriberFan :: GCompare k => FanSubscribed x k -> IO (Subscriber x (DMap k Identity))
331+newSubscriberFan subscribed = return $ Subscriber
476332 { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
477333 subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
478− tracePropagate (Proxy :: Proxy x) $ show (DMap.size subs) <> " keys subscribed, " <> show (DMap.size a) <> " keys firing"
334+ tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
479335 liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
480336 scheduleClear $ fanSubscribedOccurrence subscribed
481− let f _ (Pair v subsubs) = do
337+ let f _ (Pair (Identity v) subsubs) = do
482338 propagate v $ _fanSubscribedChildren_list subsubs
483339 return $ Constant ()
484340 _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
485341 return ()
486342 , subscriberInvalidateHeight = \old -> do
343+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
487344 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
345+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
346+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
489347 , subscriberRecalculateHeight = \new -> do
348+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
490349 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
350+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
351+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
492352 }
493353
494−newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495−newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
354+newSubscriberSwitch :: SwitchSubscribed x a -> IO (Subscriber x a)
355+newSubscriberSwitch subscribed = return $ Subscriber
496356 { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
357+ tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
497358 liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
498359 scheduleClear $ switchSubscribedOccurrence subscribed
499360 propagate a $ switchSubscribedSubscribers subscribed
500361 , subscriberInvalidateHeight = \_ -> do
362+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
501363 oldHeight <- readIORef $ switchSubscribedHeight subscribed
502364 when (oldHeight /= invalidHeight) $ do
503365 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505− , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506− }
366+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
367+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
368+ , subscriberRecalculateHeight = \new -> do
369+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
370+ updateSwitchHeight new subscribed
371+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
372+ }
507373
508−newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
509−newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
374+newSubscriberCoincidenceOuter :: CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
375+newSubscriberCoincidenceOuter subscribed = return $ Subscriber
510376 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
377+ tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
511378 outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
512− tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
379+ tracePropagate $ " outerHeight = " <> show outerHeight
513380 (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
514− tracePropagate (Proxy :: Proxy x) $ " isJust occ = " <> show (isJust occ)
515− tracePropagate (Proxy :: Proxy x) $ " innerHeight = " <> show innerHeight
516−
381+ tracePropagate $ " isJust occ = " <> show (isJust occ)
382+ tracePropagate $ " innerHeight = " <> show innerHeight
517383 liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518384 scheduleClear $ coincidenceSubscribedInnerParent subscribed
519385 case occ of
520− Nothing ->
386+ Nothing -> do
521387 when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522388 writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
389+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
390+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525391 Just o -> do -- Since it's already firing, no need to adjust height
526392 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527393 scheduleClear $ coincidenceSubscribedOccurrence subscribed
528394 propagate o $ coincidenceSubscribedSubscribers subscribed
529− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
395+ , subscriberInvalidateHeight = \_ -> do
396+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
397+ invalidateCoincidenceHeight subscribed
398+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
399+ , subscriberRecalculateHeight = \_ -> do
400+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
401+ recalculateCoincidenceHeight subscribed
402+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
531403 }
532404
533−newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
534−newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoincidenceInner" <> showNodeId subscribed) $ Subscriber
405+newSubscriberCoincidenceInner :: CoincidenceSubscribed x a -> IO (Subscriber x a)
406+newSubscriberCoincidenceInner subscribed = return $ Subscriber
535407 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
408+ tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
536409 occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
537410 case occ of
538411 Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
@@ -540,8 +413,14 @@ newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoinciden
540413 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
541414 scheduleClear $ coincidenceSubscribedOccurrence subscribed
542415 propagate a $ coincidenceSubscribedSubscribers subscribed
543− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
416+ , subscriberInvalidateHeight = \_ -> do
417+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
418+ invalidateCoincidenceHeight subscribed
419+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
420+ , subscriberRecalculateHeight = \_ -> do
421+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
422+ recalculateCoincidenceHeight subscribed
423+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
545424 }
546425
547426invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
@@ -551,45 +430,30 @@ recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551430recalculateSubscriberHeight = flip subscriberRecalculateHeight
552431
553432-- | Propagate everything at the current height
554−propagate :: forall x a. HasSpiderTimeline x => a -> WeakBag (Subscriber x a) -> EventM x ()
555−propagate a subscribers = withIncreasedDepth (Proxy::Proxy x) $
556− -- Note: in the following traversal, we do not visit nodes that are added to the list during our traversal; they are new events, which will necessarily have full information already, so there is no need to traverse them
557− --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
558− WeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
559−
560−-- | Propagate everything at the current height
561−propagateFast :: forall x a. HasSpiderTimeline x => a -> FastWeakBag (Subscriber x a) -> EventM x ()
562−propagateFast a subscribers = withIncreasedDepth (Proxy::Proxy x) $
433+propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
434+propagate a subscribers = withIncreasedDepth $ do
563435 -- Note: in the following traversal, we do not visit nodes that are added to the list during our traversal; they are new events, which will necessarily have full information already, so there is no need to traverse them
564436 --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
565− FastWeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
437+ WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
566438
567439--------------------------------------------------------------------------------
568440-- EventSubscribed
569441--------------------------------------------------------------------------------
570442
571−toAny :: a -> Any
572−toAny = unsafeCoerce
573−
574−-- Why do we use Any here, instead of just giving eventSubscribedRetained an
575−-- existential type? Sadly, GHC does not currently know how to unbox types
576−-- with existentially quantified fields. So instead we just coerce values
577−-- to type Any on the way in. Since we never coerce them back, this is
578−-- perfectly safe.
579−data EventSubscribed x = EventSubscribed
443+data EventSubscribed x a = forall b. EventSubscribed
580444 { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581− , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
445+ , eventSubscribedRetained :: {-# NOUNPACK #-} !b
582446#ifdef DEBUG_CYCLES
583− , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
447+ , eventSubscribedGetParents :: !(IO [Some (EventSubscribed x)]) -- For debugging loops
584448 , eventSubscribedHasOwnHeightRef :: !Bool
585449 , eventSubscribedWhoCreated :: !(IO [String])
586450#endif
587451 }
588452
589−eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x
453+eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x a
590454eventSubscribedRoot !r = EventSubscribed
591455 { eventSubscribedHeightRef = zeroRef
592− , eventSubscribedRetained = toAny r
456+ , eventSubscribedRetained = r
593457#ifdef DEBUG_CYCLES
594458 , eventSubscribedGetParents = return []
595459 , eventSubscribedHasOwnHeightRef = False
@@ -597,96 +461,122 @@ eventSubscribedRoot !r = EventSubscribed
597461#endif
598462 }
599463
600−eventSubscribedNever :: EventSubscribed x
464+eventSubscribedNever :: EventSubscribed x a
601465eventSubscribedNever = EventSubscribed
602466 { eventSubscribedHeightRef = zeroRef
603− , eventSubscribedRetained = toAny ()
467+ , eventSubscribedRetained = ()
604468#ifdef DEBUG_CYCLES
605469 , eventSubscribedGetParents = return []
606470 , eventSubscribedHasOwnHeightRef = False
607471 , eventSubscribedWhoCreated = return ["never"]
608472#endif
609473 }
610−eventSubscribedNow :: EventSubscribed x
611−eventSubscribedNow = EventSubscribed
612− { eventSubscribedHeightRef = zeroRef
613− , eventSubscribedRetained = toAny ()
474+
475+eventSubscribedPush :: PushSubscribed x b a -> EventSubscribed x a
476+eventSubscribedPush !subscribed = EventSubscribed
477+ { eventSubscribedHeightRef = pushSubscribedHeight subscribed
478+ , eventSubscribedRetained = subscribed
614479#ifdef DEBUG_CYCLES
615− , eventSubscribedGetParents = return []
480+ , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ pushSubscribedParent subscribed]
616481 , eventSubscribedHasOwnHeightRef = False
617− , eventSubscribedWhoCreated = return ["now"]
482+ , eventSubscribedWhoCreated = whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
483+#endif
484+ }
485+
486+eventSubscribedMerge :: MergeSubscribed x k -> EventSubscribed x a
487+eventSubscribedMerge !subscribed = EventSubscribed
488+ { eventSubscribedHeightRef = mergeSubscribedHeight subscribed
489+ , eventSubscribedRetained = subscribed
490+#ifdef DEBUG_CYCLES
491+ , eventSubscribedGetParents = do
492+ ps <- readIORef $ mergeSubscribedParents subscribed
493+ return $ R.ffor (DMap.toList ps) $ \(_ :=> v) -> Some.This $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription v
494+ , eventSubscribedHasOwnHeightRef = True
495+ , eventSubscribedWhoCreated = whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
618496#endif
619497 }
620498
621−eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
499+eventSubscribedFan :: FanSubscribed x k -> EventSubscribed x a
622500eventSubscribedFan !subscribed = EventSubscribed
623501 { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624− , eventSubscribedRetained = toAny subscribed
502+ , eventSubscribedRetained = subscribed
625503#ifdef DEBUG_CYCLES
626− , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
504+ , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
627505 , eventSubscribedHasOwnHeightRef = False
628506 , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
629507#endif
630508 }
631509
632−eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x
510+eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x a
633511eventSubscribedSwitch !subscribed = EventSubscribed
634512 { eventSubscribedHeightRef = switchSubscribedHeight subscribed
635− , eventSubscribedRetained = toAny subscribed
513+ , eventSubscribedRetained = subscribed
636514#ifdef DEBUG_CYCLES
637515 , eventSubscribedGetParents = do
638516 s <- readIORef $ switchSubscribedCurrentParent subscribed
639− return [_eventSubscription_subscribed s]
517+ return [Some.This $ _eventSubscription_subscribed s]
640518 , eventSubscribedHasOwnHeightRef = True
641519 , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
642520#endif
643521 }
644522
645−eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x
523+eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x a
646524eventSubscribedCoincidence !subscribed = EventSubscribed
647525 { eventSubscribedHeightRef = coincidenceSubscribedHeight subscribed
648− , eventSubscribedRetained = toAny subscribed
526+ , eventSubscribedRetained = subscribed
649527#ifdef DEBUG_CYCLES
650528 , eventSubscribedGetParents = do
651529 innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
652− let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653− innerParents = maybeToList $ innerSubscription
530+ let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
531+ innerParents = maybeToList $ fmap Some.This innerSubscription
654532 return $ outerParent : innerParents
655533 , eventSubscribedHasOwnHeightRef = True
656534 , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
657535#endif
658536 }
659537
660−getEventSubscribedHeight :: EventSubscribed x -> IO Height
538+getEventSubscribedHeight :: EventSubscribed x a -> IO Height
661539getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
662540
663541#ifdef DEBUG_CYCLES
664−whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
542+whoCreatedEventSubscribed :: EventSubscribed x a -> IO [String]
665543whoCreatedEventSubscribed = eventSubscribedWhoCreated
666544
667−walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
545+walkInvalidHeightParents :: EventSubscribed x a -> IO [Some (EventSubscribed x)]
668546walkInvalidHeightParents s0 = do
669− subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
547+ subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
670548 h <- liftIO $ readIORef $ eventSubscribedHeightRef s
671549 when (h == invalidHeight) $ do
672550 when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
673− modify (s :)
551+ modify (Some.This s :)
674552 mapM_ loop =<< liftIO (eventSubscribedGetParents s)
675− forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
553+ forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
676554 return subscribers
677555#endif
678556
679557{-# INLINE subscribeHoldEvent #-}
680−subscribeHoldEvent :: Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
558+subscribeHoldEvent :: CanSubscribe x m => Hold x p -> Subscriber x p -> m (EventSubscription x p, Maybe p)
681559subscribeHoldEvent = subscribeAndRead . holdEvent
682560
561+--------------------------------------------------------------------------------
562+-- EventSubscription
563+--------------------------------------------------------------------------------
564+
565+data EventSubscription x a = EventSubscription
566+ { _eventSubscription_ticket :: !(Maybe (WeakBagTicket (Subscriber x a)))
567+ , _eventSubscription_subscribed :: !(EventSubscribed x a)
568+ }
569+
570+unsubscribe :: EventSubscription x a -> IO ()
571+unsubscribe (EventSubscription msln _) = forM_ msln $ \sln -> WeakBag.remove sln
572+
683573--------------------------------------------------------------------------------
684574-- Behavior
685575--------------------------------------------------------------------------------
686576
687577newtype Behavior x a = Behavior { readBehaviorTracked :: BehaviorM x a }
688578
689−behaviorHold :: Hold x p -> Behavior x (PatchTarget p)
579+behaviorHold :: Hold x p -> Behavior x (R.PatchTarget p)
690580behaviorHold !h = Behavior $ readHoldTracked h
691581
692582behaviorHoldIdentity :: Hold x (Identity a) -> Behavior x a
@@ -700,7 +590,7 @@ behaviorPull !p = Behavior $ do
700590 val <- liftIO $ readIORef $ pullValue p
701591 case val of
702592 Just subscribed -> do
703− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
593+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
704594 askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
705595 liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
706596 return $ pullSubscribedValue subscribed
@@ -709,7 +599,7 @@ behaviorPull !p = Behavior $ do
709599 wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
710600 parentsRef <- liftIO $ newIORef []
711601 holdInits <- askBehaviorHoldInits
712− a <- liftIO $ runReaderIO (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
602+ a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
713603 invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
714604 parents <- liftIO $ readIORef parentsRef
715605 let subscribed = PullSubscribed
@@ -719,22 +609,22 @@ behaviorPull !p = Behavior $ do
719609 , pullSubscribedParents = parents
720610 }
721611 liftIO $ writeIORef (pullValue p) $ Just subscribed
722− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
612+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
723613 return a
724614
725−behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
615+behaviorDyn :: R.Patch p => Dyn x p -> Behavior x (R.PatchTarget p)
726616behaviorDyn !d = Behavior $ readHoldTracked =<< getDynHold d
727617
728618{-# INLINE readHoldTracked #-}
729−readHoldTracked :: Hold x p -> BehaviorM x (PatchTarget p)
619+readHoldTracked :: Hold x p -> BehaviorM x (R.PatchTarget p)
730620readHoldTracked h = do
731621 result <- liftIO $ readIORef $ holdValue h
732622 askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
733− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedHold h)) :))
734− liftIO $ touch h -- Otherwise, if this gets inlined enough, the hold's parent reference may get collected
623+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
735624 return result
736625
737−{-# INLINABLE readBehaviorUntracked #-}
626+{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> BehaviorM x a #-}
627+{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> EventM x a #-}
738628readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
739629readBehaviorUntracked b = do
740630 holdInits <- getDeferralQueue
@@ -744,108 +634,69 @@ readBehaviorUntracked b = do
744634-- Dynamic
745635--------------------------------------------------------------------------------
746636
747−type DynamicS x p = Dynamic x (PatchTarget p) p
748−
749−data Dynamic x target p = Dynamic
750− { dynamicCurrent :: !(Behavior x target)
751− , dynamicUpdated :: Event x p -- This must be lazy; see the comment on holdEvent --TODO: Would this let us eliminate `Dyn`?
637+data Dynamic x p = Dynamic
638+ { dynamicCurrent :: !(Behavior x (R.PatchTarget p))
639+ , dynamicUpdated :: !(Event x p)
752640 }
753641
754−deriving instance (HasSpiderTimeline x) => Functor (Dynamic x target)
755−
756−
757−
758−
759−dynamicHold :: Hold x p -> DynamicS x p
642+dynamicHold :: Hold x p -> Dynamic x p
760643dynamicHold !h = Dynamic
761644 { dynamicCurrent = behaviorHold h
762645 , dynamicUpdated = eventHold h
763646 }
764647
765−dynamicHoldIdentity :: Hold x (Identity a) -> DynamicS x (Identity a)
648+dynamicHoldIdentity :: Hold x (Identity a) -> Dynamic x (Identity a)
766649dynamicHoldIdentity = dynamicHold
767650
768−dynamicConst :: PatchTarget p -> DynamicS x p
651+dynamicConst :: R.PatchTarget p -> Dynamic x p
769652dynamicConst !a = Dynamic
770653 { dynamicCurrent = behaviorConst a
771654 , dynamicUpdated = eventNever
772655 }
773656
774−dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> DynamicS x p
657+dynamicDyn :: R.Patch p => Dyn x p -> Dynamic x p
775658dynamicDyn !d = Dynamic
776659 { dynamicCurrent = behaviorDyn d
777660 , dynamicUpdated = eventDyn d
778661 }
779662
780−dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> DynamicS x (Identity a)
663+dynamicDynIdentity :: Dyn x (Identity a) -> Dynamic x (Identity a)
781664dynamicDynIdentity = dynamicDyn
782665
783666--------------------------------------------------------------------------------
784667-- Combinators
785668--------------------------------------------------------------------------------
786669
670+--TODO: Figure out why certain things are not 'representational', then make them
671+--representational so we can use coerce
672+
787673--type role Hold representational
788674data Hold x p
789− = Hold { holdValue :: !(IORef (PatchTarget p))
675+ = Hold { holdValue :: !(IORef (R.PatchTarget p))
790676 , holdInvalidators :: !(IORef [Weak (Invalidator x)])
791677 , holdEvent :: Event x p -- This must be lazy, or holds cannot be defined before their input Events
792− , holdParent :: !(IORef (Maybe (EventSubscription x))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
678+ , holdParent :: !(IORef (Maybe (EventSubscription x p))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
793679#ifdef DEBUG_NODEIDS
794680 , holdNodeId :: Int
795681#endif
796682 }
797683
798−-- | A statically allocated 'SpiderTimeline'
799−data Global
800−
801−{-# NOINLINE globalSpiderTimelineEnv #-}
802−globalSpiderTimelineEnv :: SpiderTimelineEnv Global
803−globalSpiderTimelineEnv = unsafePerformIO unsafeNewSpiderTimelineEnv
804−
805−-- | Stores all global data relevant to a particular Spider timeline; only one
806−-- value should exist for each type @x@
807−newtype SpiderTimelineEnv x = STE {unSTE :: SpiderTimelineEnv' x}
808−-- We implement SpiderTimelineEnv with a newtype wrapper so
809−-- we can get the coercions we want safely.
810−type role SpiderTimelineEnv nominal
811−
812−data SpiderTimelineEnv' x = SpiderTimelineEnv
813− { _spiderTimeline_lock :: {-# UNPACK #-} !(MVar ())
814− , _spiderTimeline_eventEnv :: {-# UNPACK #-} !(EventEnv x)
815−#ifdef DEBUG
816− , _spiderTimeline_depth :: {-# UNPACK #-} !(IORef Int)
817−#endif
818− }
819−type role SpiderTimelineEnv' phantom
820−
821−instance Eq (SpiderTimelineEnv x) where
822− _ == _ = True -- Since only one exists of each type
823−
824−instance GEq SpiderTimelineEnv where
825− a `geq` b = if _spiderTimeline_lock (unSTE a) == _spiderTimeline_lock (unSTE b)
826− then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderTimelineEnv can't have two different 'x' arguments
827− else Nothing
828−
829684data EventEnv x
830− = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
685+ = EventEnv { eventEnvSpiderTimeline :: !(SpiderTimeline x)
686+ , eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
831687 , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
832− , eventEnvDynInits :: !(IORef [SomeDynInit x])
833688 , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
834689 , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
835− , eventEnvClears :: !(IORef [Some Clear]) -- Needed for Subscribe
836− , eventEnvIntClears :: !(IORef [Some IntClear])
837− , eventEnvRootClears :: !(IORef [Some RootClear])
690+ , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
691+ , eventEnvRootClears :: !(IORef [SomeRootClear])
838692 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
839693 , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
840− , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
694+ , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge x]))
841695 }
842696
843697{-# INLINE runEventM #-}
844−runEventM :: EventM x a -> IO a
845−runEventM = unEventM
846−
847−asksEventEnv :: forall x a. HasSpiderTimeline x => (EventEnv x -> a) -> EventM x a
848−asksEventEnv f = return $ f $ _spiderTimeline_eventEnv (unSTE (spiderTimeline :: SpiderTimelineEnv x))
698+runEventM :: EventM x a -> EventEnv x -> IO a
699+runEventM = runReaderT . unEventM
849700
850701class MonadIO m => Defer a m where
851702 getDeferralQueue :: m (IORef [a])
@@ -856,87 +707,81 @@ defer a = do
856707 q <- getDeferralQueue
857708 liftIO $ modifyIORef' q (a:)
858709
859−instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
860− {-# INLINE getDeferralQueue #-}
861− getDeferralQueue = asksEventEnv eventEnvAssignments
862−
863−instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
710+instance Defer (SomeAssignment x) (EventM x) where
864711 {-# INLINE getDeferralQueue #-}
865− getDeferralQueue = asksEventEnv eventEnvHoldInits
712+ getDeferralQueue = EventM $ asks eventEnvAssignments
866713
867−instance HasSpiderTimeline x => Defer (SomeDynInit x) (EventM x) where
714+instance Defer (SomeHoldInit x) (EventM x) where
868715 {-# INLINE getDeferralQueue #-}
869− getDeferralQueue = asksEventEnv eventEnvDynInits
716+ getDeferralQueue = EventM $ asks eventEnvHoldInits
870717
871718instance Defer (SomeHoldInit x) (BehaviorM x) where
872719 {-# INLINE getDeferralQueue #-}
873720 getDeferralQueue = BehaviorM $ asks snd
874721
875−instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
722+instance Defer (SomeMergeUpdate x) (EventM x) where
876723 {-# INLINE getDeferralQueue #-}
877− getDeferralQueue = asksEventEnv eventEnvMergeUpdates
724+ getDeferralQueue = EventM $ asks eventEnvMergeUpdates
878725
879−instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
726+instance Defer (SomeMergeInit x) (EventM x) where
880727 {-# INLINE getDeferralQueue #-}
881− getDeferralQueue = asksEventEnv eventEnvMergeInits
728+ getDeferralQueue = EventM $ asks eventEnvMergeInits
882729
883−class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
730+class HasCurrentHeight x m | m -> x where
884731 getCurrentHeight :: m Height
885− scheduleMerge :: Height -> EventM x () -> m ()
732+ scheduleMerge :: Height -> MergeSubscribed x a -> m ()
886733
887−instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
734+instance HasCurrentHeight x (EventM x) where
888735 {-# INLINE getCurrentHeight #-}
889− getCurrentHeight = do
890− heightRef <- asksEventEnv eventEnvCurrentHeight
736+ getCurrentHeight = EventM $ do
737+ heightRef <- asks eventEnvCurrentHeight
891738 liftIO $ readIORef heightRef
892739 {-# INLINE scheduleMerge #-}
893− scheduleMerge height subscribed = do
894− delayedRef <- asksEventEnv eventEnvDelayedMerges
895− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
740+ scheduleMerge height subscribed = EventM $ do
741+ delayedRef <- asks eventEnvDelayedMerges
742+ liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
743+
744+class HasSpiderTimeline x m | m -> x where
745+ -- | Retrieve the current SpiderTimeline
746+ askSpiderTimeline :: m (SpiderTimeline x)
896747
897−class HasSpiderTimeline x where
898− -- | Retrieve the current SpiderTimelineEnv
899− spiderTimeline :: SpiderTimelineEnv x
748+instance HasSpiderTimeline x (EventM x) where
749+ {-# INLINE askSpiderTimeline #-}
750+ askSpiderTimeline = EventM $ asks eventEnvSpiderTimeline
900751
901−instance HasSpiderTimeline Global where
902− spiderTimeline = globalSpiderTimelineEnv
752+instance HasSpiderTimeline x (SpiderHost x) where
753+ {-# INLINE askSpiderTimeline #-}
754+ askSpiderTimeline = SpiderHost ask
903755
904−putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
905−putCurrentHeight h = do
906− heightRef <- asksEventEnv eventEnvCurrentHeight
756+putCurrentHeight :: Height -> EventM x ()
757+putCurrentHeight h = EventM $ do
758+ heightRef <- asks eventEnvCurrentHeight
907759 liftIO $ writeIORef heightRef $! h
908760
909−instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
761+instance Defer SomeClear (EventM x) where
910762 {-# INLINE getDeferralQueue #-}
911− getDeferralQueue = asksEventEnv eventEnvClears
763+ getDeferralQueue = EventM $ asks eventEnvClears
912764
913765{-# INLINE scheduleClear #-}
914−scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
915−scheduleClear r = defer $ Some $ Clear r
766+scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
767+scheduleClear r = defer $ SomeClear r
916768
917−instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
769+instance Defer SomeRootClear (EventM x) where
918770 {-# INLINE getDeferralQueue #-}
919− getDeferralQueue = asksEventEnv eventEnvIntClears
920−
921−{-# INLINE scheduleIntClear #-}
922−scheduleIntClear :: Defer (Some IntClear) m => IORef (IntMap a) -> m ()
923−scheduleIntClear r = defer $ Some $ IntClear r
924−
925−instance HasSpiderTimeline x => Defer (Some RootClear) (EventM x) where
926− {-# INLINE getDeferralQueue #-}
927− getDeferralQueue = asksEventEnv eventEnvRootClears
771+ getDeferralQueue = EventM $ asks eventEnvRootClears
928772
929773{-# INLINE scheduleRootClear #-}
930−scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
931−scheduleRootClear r = defer $ Some $ RootClear r
774+scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
775+scheduleRootClear r = defer $ SomeRootClear r
932776
933−instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
777+instance Defer (SomeResetCoincidence x) (EventM x) where
934778 {-# INLINE getDeferralQueue #-}
935− getDeferralQueue = asksEventEnv eventEnvResetCoincidences
779+ getDeferralQueue = EventM $ asks eventEnvResetCoincidences
936780
937781-- Note: hold cannot examine its event until after the phase is over
938−{-# INLINE [1] hold #-}
939−hold :: (Patch p, Defer (SomeHoldInit x) m) => PatchTarget p -> Event x p -> m (Hold x p)
782+{-# SPECIALIZE hold :: R.Patch p => R.PatchTarget p -> Event x p -> EventM x (Hold x p) #-}
783+{-# SPECIALIZE hold :: R.Patch p => R.PatchTarget p -> Event x p -> ComputeM x (Hold x p) #-}
784+hold :: (R.Patch p, Defer (SomeHoldInit x) m) => R.PatchTarget p -> Event x p -> m (Hold x p)
940785hold v0 e = do
941786 valRef <- liftIO $ newIORef v0
942787 invsRef <- liftIO $ newIORef []
@@ -957,7 +802,7 @@ hold v0 e = do
957802 return h
958803
959804{-# INLINE getHoldEventSubscription #-}
960−getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
805+getHoldEventSubscription :: forall m p x. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer SomeClear m, R.Patch p, HasCurrentHeight x m, Defer (SomeMergeInit x) m, Defer (SomeResetCoincidence x) m, HasSpiderTimeline x m, m ~ EventM x) => Hold x p -> m (EventSubscription x p)
961806getHoldEventSubscription h = do
962807 ep <- liftIO $ readIORef $ holdParent h
963808 case ep of
@@ -971,7 +816,7 @@ getHoldEventSubscription h = do
971816 Nothing -> return ()
972817 Just o -> do
973818 old <- liftIO $ readIORef $ holdValue h
974− case apply o old of
819+ case R.apply o old of
975820 Nothing -> return ()
976821 Just new -> do
977822 -- Need to evaluate these so that we don't retain the Hold itself
@@ -983,9 +828,9 @@ getHoldEventSubscription h = do
983828
984829type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
985830
831+--type role BehaviorM representational
986832-- BehaviorM can sample behaviors
987−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988− deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
833+newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderT (BehaviorEnv x) IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
989834
990835instance Monad (BehaviorM x) where
991836 {-# INLINE (>>=) #-}
@@ -994,16 +839,14 @@ instance Monad (BehaviorM x) where
994839 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995840 {-# INLINE return #-}
996841 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998842 {-# INLINE fail #-}
999843 fail s = BehaviorM $ fail s
1000−#endif
1001844
1002845data BehaviorSubscribed x a
1003846 = forall p. BehaviorSubscribedHold (Hold x p)
1004847 | BehaviorSubscribedPull (PullSubscribed x a)
1005848
1006−newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
849+data SomeBehaviorSubscribed x = forall a. SomeBehaviorSubscribed (BehaviorSubscribed x a)
1007850
1008851--type role PullSubscribed representational
1009852data PullSubscribed x a
@@ -1038,33 +881,55 @@ data RootSubscribed x a = forall k. GCompare k => RootSubscribed
1038881#endif
1039882 }
1040883
1041−data Root x k
884+data Root x (k :: * -> *)
1042885 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
1043886 , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
1044887 , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
1045888 }
1046889
1047−data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
890+data SomeHoldInit x = forall p. R.Patch p => SomeHoldInit !(Hold x p)
1048891
1049−data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
892+data SomeMergeUpdate x = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap k (Event x)) (MergeSubscribed x k)
1050893
1051−data SomeMergeUpdate x = SomeMergeUpdate
1052− { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
1053− , _someMergeUpdate_invalidateHeight :: !(IO ())
1054− , _someMergeUpdate_recalculateHeight :: !(IO ())
1055− }
894+data SomeMergeInit x = forall k. GCompare k => SomeMergeInit !(MergeSubscribed x k) !(Event x (R.PatchDMap k (Event x)))
1056895
1057−newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
896+data SomeEventSubscription x = forall a. SomeEventSubscription (EventSubscription x a)
1058897
1059898-- EventM can do everything BehaviorM can, plus create holds
1060−newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
899+newtype EventM x (a :: *) = EventM { unEventM :: ReaderT (EventEnv x) IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException) -- The environment should be Nothing if we are not in a frame, and Just if we are - in which case it is a list of assignments to be done after the frame is over
900+
901+data PushSubscribed x a b
902+ = PushSubscribed { pushSubscribedCachedSubscribed :: !(IORef (Maybe (PushSubscribed x a b)))
903+ , pushSubscribedOccurrence :: !(IORef (Maybe b)) -- If the current height is less than our height, this should always be Nothing; during our height, this will get filled in at some point, always before our children are notified; after our height, this will be filled in with the correct value (Nothing if we are not firing, Just if we are)
904+ , pushSubscribedHeight :: !(IORef Height)
905+ , pushSubscribedSubscribers :: !(WeakBag (Subscriber x b))
906+ , pushSubscribedSelf :: !(Subscriber x a) -- Hold this in memory to ensure our WeakReferences don't die --TODO: Probably unneeded now
907+ , pushSubscribedWeakSelf :: !(IORef (Weak (PushSubscribed x a b)))
908+ , pushSubscribedParent :: !(EventSubscription x a)
909+#ifdef DEBUG_NODEIDS
910+ , pushSubscribedNodeId :: Int
911+#endif
912+ }
1061913
1062−newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
914+newtype ComputeM x a = ComputeM (ReaderT (IORef [SomeHoldInit x]) IO a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1063915
1064−data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
1065− { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
1066− , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
1067− }
916+instance Defer (SomeHoldInit x) (ComputeM x) where
917+ getDeferralQueue = ComputeM ask
918+
919+{-# SPECIALIZE runComputeM :: ComputeM x a -> EventM x a #-}
920+runComputeM :: Defer (SomeHoldInit x) m => ComputeM x a -> m a
921+runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
922+
923+data Push x a b
924+ = Push { pushCompute :: !(a -> ComputeM x (Maybe b)) -- Compute the current firing value; assumes that its parent has been computed --TODO: This only uses Defer SomeHoldInit EventM; perhaps only the hold init queue should be passed in (also, perhaps those hold inits can be accelerated - can there be a loop we would need to worry about?)
925+ , pushParent :: !(Event x a)
926+ , pushSubscribed :: !(IORef (Maybe (PushSubscribed x a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
927+ }
928+
929+data MergeSubscribedParent (x :: *) k a = MergeSubscribedParent !(EventSubscription x a) !(Subscriber x a)
930+
931+mergeSubscribedParentSubscription :: MergeSubscribedParent x k a -> EventSubscription x a
932+mergeSubscribedParentSubscription (MergeSubscribedParent es _) = es
1068933
1069934data HeightBag = HeightBag
1070935 { _heightBag_size :: {-# UNPACK #-} !Int
@@ -1082,8 +947,7 @@ heightBagFromList :: [Height] -> HeightBag
1082947heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
1083948
1084949heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
950+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1087951
1088952heightBagRemove :: Height -> HeightBag -> HeightBag
1089953heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +956,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
1092956 0 -> IntMap.delete h c
1093957 _ -> IntMap.insert h (pred old) c
1094958
1095−heightBagRemoveMaybe :: Height -> HeightBag -> Maybe HeightBag
1096−heightBagRemoveMaybe (Height h) b@(HeightBag s c) = heightBagVerify . removed <$> IntMap.lookup h c where
1097− removed old = HeightBag (pred s) $ case old of
1098− 0 -> IntMap.delete h c
1099− _ -> IntMap.insert h (pred old) c
1100−
1101−
1102959heightBagMax :: HeightBag -> Height
1103960heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
1104961 Just ((h, _), _) -> Height h
@@ -1116,25 +973,46 @@ heightBagVerify b@(HeightBag s c) = if
1116973heightBagVerify = id
1117974#endif
1118975
1119−data FanSubscribedChildren x k v a = FanSubscribedChildren
1120− { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x (v a)))
1121− , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k v)
1122− , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k v)))
976+data MergeSubscribed x k
977+ = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed x k))) -- From the original merge
978+ , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
979+ , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
980+ , mergeSubscribedHeight :: !(IORef Height)
981+ , mergeSubscribedHeightBag :: !(IORef HeightBag)
982+ , mergeSubscribedSubscribers :: !(WeakBag (Subscriber x (DMap k Identity)))
983+ , mergeSubscribedChange :: !(IORef (Subscriber x (R.PatchDMap k (Event x)), EventSubscribed x (R.PatchDMap k (Event x))))
984+ , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent x k)))
985+ , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed x k)))
986+#ifdef DEBUG_NODEIDS
987+ , mergeSubscribedNodeId :: Int
988+#endif
989+ }
990+
991+--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
992+data Merge x k
993+ = Merge { mergeParents :: !(Dynamic x (R.PatchDMap k (Event x)))
994+ , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed x k)))
995+ }
996+
997+data FanSubscribedChildren (x :: *) k a = FanSubscribedChildren
998+ { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x a))
999+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k)
1000+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k)))
11231001 }
11241002
1125−data FanSubscribed x k v
1126− = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
1127− , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k v)))
1128− , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k v))) -- This DMap should never be empty
1129− , fanSubscribedParent :: !(EventSubscription x)
1003+data FanSubscribed (x :: *) k
1004+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
1005+ , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
1006+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k))) -- This DMap should never be empty
1007+ , fanSubscribedParent :: !(EventSubscription x (DMap k Identity))
11301008#ifdef DEBUG_NODEIDS
11311009 , fanSubscribedNodeId :: Int
11321010#endif
11331011 }
11341012
1135−data Fan x k v
1136− = Fan { fanParent :: !(Event x (DMap k v))
1137− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
1013+data Fan x k
1014+ = Fan { fanParent :: !(Event x (DMap k Identity))
1015+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
11381016 }
11391017
11401018data SwitchSubscribed x a
@@ -1146,7 +1024,7 @@ data SwitchSubscribed x a
11461024 , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak (Invalidator x)))
11471025 , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed x])
11481026 , switchSubscribedParent :: !(Behavior x (Event x a))
1149− , switchSubscribedCurrentParent :: !(IORef (EventSubscription x))
1027+ , switchSubscribedCurrentParent :: !(IORef (EventSubscription x a))
11501028 , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed x a)))
11511029#ifdef DEBUG_NODEIDS
11521030 , switchSubscribedNodeId :: Int
@@ -1158,17 +1036,15 @@ data Switch x a
11581036 , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
11591037 }
11601038
1161−#ifdef USE_TEMPLATE_HASKELL
11621039{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1163−#endif
11641040data CoincidenceSubscribed x a
11651041 = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
11661042 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
11671043 , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
11681044 , coincidenceSubscribedHeight :: !(IORef Height)
11691045 , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber x (Event x a))
1170− , coincidenceSubscribedOuterParent :: !(EventSubscription x)
1171− , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x)))
1046+ , coincidenceSubscribedOuterParent :: !(EventSubscription x (Event x a))
1047+ , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x a)))
11721048 , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed x a)))
11731049#ifdef DEBUG_NODEIDS
11741050 , coincidenceSubscribedNodeId :: Int
@@ -1188,35 +1064,20 @@ newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
11881064newInvalidatorPull :: Pull x a -> IO (Invalidator x)
11891065newInvalidatorPull p = return $! InvalidatorPull p
11901066
1191−instance HasSpiderTimeline x => Filterable (Event x) where
1192− mapMaybe f = push $ return . f
1067+instance R.FunctorMaybe (Event x) where
1068+ fmapMaybe f = push $ return . f
11931069
1194−instance HasSpiderTimeline x => Align (Event x) where
1070+instance Align (Event x) where
11951071 nil = eventNever
1196−#if MIN_VERSION_these(0, 8, 0)
1197−instance HasSpiderTimeline x => Semialign (Event x) where
1198−#endif
1199− align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
1200− DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
1201−
1202−#ifdef MIN_VERSION_semialign
1203−#if MIN_VERSION_semialign(1,1,0)
1204−instance HasSpiderTimeline x => Zip (Event x) where
1205−#endif
1206− zip x y = mapMaybe justThese $ align x y
1207−#endif
1072+ align ea eb = R.fmapMaybe R.dmapToThese $ merge $ dynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
12081073
1209−data DynType x p = UnsafeDyn !(BehaviorM x (PatchTarget p), Event x p)
1210− | BuildDyn !(EventM x (PatchTarget p), Event x p)
1211− | HoldDyn !(Hold x p)
1074+newtype Dyn x p = Dyn { unDyn :: IORef (Either (BehaviorM x (R.PatchTarget p), Event x p) (Hold x p)) }
12121075
1213−newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
1214−
1215−newMapDyn :: HasSpiderTimeline x => (a -> b) -> DynamicS x (Identity a) -> DynamicS x (Identity b)
1216−newMapDyn f d = dynamicDynIdentity $ unsafeBuildDynamic (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
1076+newMapDyn :: (a -> b) -> Dynamic x (Identity a) -> Dynamic x (Identity b)
1077+newMapDyn f d = dynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
12171078
12181079--TODO: Avoid the duplication between this and R.zipDynWith
1219−zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> DynamicS x (Identity a) -> DynamicS x (Identity b) -> DynamicS x (Identity c)
1080+zipDynWith :: (a -> b -> c) -> Dynamic x (Identity a) -> Dynamic x (Identity b) -> Dynamic x (Identity c)
12201081zipDynWith f da db =
12211082 let eab = align (dynamicUpdated da) (dynamicUpdated db)
12221083 ec = flip push eab $ \o -> do
@@ -1229,70 +1090,72 @@ zipDynWith f da db =
12291090 return (a, b)
12301091 These (Identity a) (Identity b) -> return (a, b)
12311092 return $ Just $ Identity $ f a b
1232− in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
1093+ in dynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
12331094
1234−buildDynamic :: (Defer (SomeDynInit x) m, Patch p) => EventM x (PatchTarget p) -> Event x p -> m (Dyn x p)
1235−buildDynamic readV0 v' = do
1236− result <- liftIO $ newIORef $ BuildDyn (readV0, v')
1237− let !d = Dyn result
1238− defer $ SomeDynInit d
1239− return d
1095+unsafeDyn :: BehaviorM x (R.PatchTarget p) -> Event x p -> Dyn x p
1096+unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
1097+ where x = (readV0, v')
12401098
1241−unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1242−unsafeBuildDynamic readV0 v' =
1243− Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
1099+newJoinDyn :: Dynamic x (Identity (Dynamic x (Identity a))) -> Dyn x (Identity a)
1100+newJoinDyn d =
1101+ let readV0 = readBehaviorTracked . dynamicCurrent =<< readBehaviorTracked (dynamicCurrent d)
1102+ eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . dynamicCurrent . runIdentity) $ dynamicUpdated d
1103+ eInner = switch $ dynamicUpdated <$> dynamicCurrent d
1104+ eBoth = coincidence $ dynamicUpdated . runIdentity <$> dynamicUpdated d
1105+ v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
1106+ in unsafeDyn readV0 v'
12441107
12451108-- ResultM can read behaviors and events
12461109type ResultM = EventM
12471110
1248−instance HasSpiderTimeline x => Functor (Event x) where
1111+{-# NOINLINE unsafeNewIORef #-}
1112+unsafeNewIORef :: a -> b -> IORef b
1113+unsafeNewIORef _ b = unsafePerformIO $ newIORef b
1114+
1115+instance Functor (Event x) where
12491116 fmap f = push $ return . Just . f
12501117
12511118instance Functor (Behavior x) where
12521119 fmap f = pull . fmap f . readBehaviorTracked
12531120
1254−{-# INLINE push #-}
1255−push :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
1256−push f e = cacheEvent (pushCheap f e)
1121+{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
1122+push :: (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
1123+push f e = eventPush $ Push
1124+ { pushCompute = f
1125+ , pushParent = e
1126+ , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
1127+ }
1128+-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
12571129
1258−{-# INLINABLE pull #-}
1130+{-# NOINLINE pull #-}
12591131pull :: BehaviorM x a -> Behavior x a
1260−pull a = unsafePerformIO $ do
1261− ref <- newIORef Nothing
1262−#ifdef DEBUG_NODEIDS
1263− nid <- newNodeId
1264−#endif
1265− pure $ behaviorPull $ Pull
1266− { pullCompute = a
1267− , pullValue = ref
1132+pull a = behaviorPull $ Pull
1133+ { pullCompute = a
1134+ , pullValue = unsafeNewIORef a Nothing
12681135#ifdef DEBUG_NODEIDS
1269− , pullNodeId = nid
1136+ , pullNodeId = unsafeNodeId a
12701137#endif
1271− }
1138+ }
12721139
1273−{-# INLINABLE switch #-}
1274−switch :: HasSpiderTimeline x => Behavior x (Event x a) -> Event x a
1275−switch a = unsafePerformIO $ do
1276− ref <- newIORef Nothing
1277− pure $ eventSwitch $ Switch
1278− { switchParent = a
1279− , switchSubscribed = ref
1280− }
1140+{-# NOINLINE switch #-}
1141+switch :: Behavior x (Event x a) -> Event x a
1142+switch a = eventSwitch $ Switch
1143+ { switchParent = a
1144+ , switchSubscribed = unsafeNewIORef a Nothing
1145+ }
12811146
1282−coincidence :: HasSpiderTimeline x => Event x (Event x a) -> Event x a
1283−coincidence a = unsafePerformIO $ do
1284− ref <- newIORef Nothing
1285− pure $ eventCoincidence $ Coincidence
1286− { coincidenceParent = a
1287− , coincidenceSubscribed = ref
1288− }
1147+coincidence :: Event x (Event x a) -> Event x a
1148+coincidence a = eventCoincidence $ Coincidence
1149+ { coincidenceParent = a
1150+ , coincidenceSubscribed = unsafeNewIORef a Nothing
1151+ }
12891152
12901153-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
1291−run :: forall x b. HasSpiderTimeline x => [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
1154+run :: [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
12921155run roots after = do
1293− tracePropagate (Proxy :: Proxy x) $ "Running an event frame with " <> show (length roots) <> " events"
1294− let t = spiderTimeline :: SpiderTimelineEnv x
1295− result <- SpiderHost $ withMVar (_spiderTimeline_lock (unSTE t)) $ \_ -> unSpiderHost $ runFrame $ do
1156+ tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
1157+ spiderTimeline <- SpiderHost ask
1158+ result <- SpiderHost $ lift $ withMVar (_spiderTimeline_lock spiderTimeline) $ \_ -> flip runReaderT spiderTimeline $ unSpiderHost $ runFrame $ do
12961159 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
12971160 occBefore <- liftIO $ do
12981161 occBefore <- readIORef occRef
@@ -1304,40 +1167,43 @@ run roots after = do
13041167 else return Nothing
13051168 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
13061169 propagate a subscribersRef
1307− delayedRef <- asksEventEnv eventEnvDelayedMerges
1170+ delayedRef <- EventM $ asks eventEnvDelayedMerges
13081171 let go = do
13091172 delayed <- liftIO $ readIORef delayedRef
13101173 case IntMap.minViewWithKey delayed of
13111174 Nothing -> return ()
13121175 Just ((currentHeight, cur), future) -> do
1313− tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
1176+ tracePropagate $ "Running height " ++ show currentHeight
13141177 putCurrentHeight $ Height currentHeight
13151178 liftIO $ writeIORef delayedRef $! future
1316− sequence_ cur
1179+ forM_ cur $ \d -> case d of
1180+ DelayedMerge subscribed -> do
1181+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
1182+ case height `compare` Height currentHeight of
1183+ LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1184+ GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1185+ EQ -> do
1186+ m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
1187+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! DMap.empty
1188+ --TODO: Assert that m is not empty
1189+ liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $ Just m
1190+ scheduleClear $ mergeSubscribedOccurrence subscribed
1191+ propagate m $ mergeSubscribedSubscribers subscribed
13171192 go
13181193 go
13191194 putCurrentHeight maxBound
13201195 after
1321− tracePropagate (Proxy :: Proxy x) "Done running an event frame"
1196+ tracePropagate "Done running an event frame"
13221197 return result
13231198
1324−scheduleMerge' :: HasSpiderTimeline x => Height -> IORef Height -> EventM x () -> EventM x ()
1325−scheduleMerge' initialHeight heightRef a = scheduleMerge initialHeight $ do
1326− height <- liftIO $ readIORef heightRef
1327− currentHeight <- getCurrentHeight
1328− case height `compare` currentHeight of
1329− LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1330− GT -> scheduleMerge' height heightRef a -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1331− EQ -> a
1332−
1333−newtype Clear a = Clear (IORef (Maybe a))
1199+data SomeClear = forall a. SomeClear (IORef (Maybe a))
13341200
1335−newtype IntClear a = IntClear (IORef (IntMap a))
1336−
1337−newtype RootClear k = RootClear (IORef (DMap k Identity))
1201+data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
13381202
13391203data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
13401204
1205+data DelayedMerge x = forall k. DelayedMerge (MergeSubscribed x k)
1206+
13411207debugFinalize :: Bool
13421208debugFinalize = False
13431209
@@ -1346,110 +1212,55 @@ mkWeakPtrWithDebug x debugNote = do
13461212 x' <- evaluate x
13471213 mkWeakPtr x' $
13481214 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
1215+ then Just $ putStrLn $ "finalizing: " ++ debugNote
13501216 else Nothing
13511217
13521218type WeakList a = [Weak a]
13531219
1354−type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
1355−
1356−
1357−
1358−
1359−#ifdef DEBUG
1360−
1361−debugSubscriber :: forall x a. HasSpiderTimeline x => String -> Subscriber x a -> IO (Subscriber x a)
1362−debugSubscriber description = return . debugSubscriber' description
1363−
1364−debugSubscriber' :: forall x a. HasSpiderTimeline x => String -> Subscriber x a -> Subscriber x a
1365−debugSubscriber' description subscribed = Subscriber
1366− {
1367− subscriberPropagate = \m -> do
1368− tracePropagate (Proxy :: Proxy x) ("subscriberPropagate: " <> description)
1369− subscriberPropagate subscribed m
1370− , subscriberInvalidateHeight = \old -> do
1371− traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", old = " <> show (unHeight old)
1372− subscriberInvalidateHeight subscribed old
1373− traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", done"
1374− , subscriberRecalculateHeight = \new -> do
1375− traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", new = " <> show (unHeight new)
1376− subscriberRecalculateHeight subscribed new
1377− traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", done"
1378− }
1379−
1380−
13811220{-# INLINE withIncreasedDepth #-}
1382−withIncreasedDepth :: forall proxy x m a. CanTrace x m => proxy x -> m a -> m a
1383−withIncreasedDepth _ a = do
1384− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) succ
1221+#ifdef DEBUG
1222+withIncreasedDepth :: CanTrace x m => m a -> m a
1223+withIncreasedDepth a = do
1224+ spiderTimeline <- askSpiderTimeline
1225+ liftIO $ modifyIORef' (_spiderTimeline_depth spiderTimeline) succ
13851226 result <- a
1386− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
1227+ liftIO $ modifyIORef' (_spiderTimeline_depth spiderTimeline) pred
13871228 return result
1388−
1389−{-# INLINE tracePropagate #-}
1390−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1391−tracePropagate p = when debugPropagate . trace p
1392−
1393−{-# INLINE traceInvalidate #-}
1394−traceInvalidate :: String -> IO ()
1395−traceInvalidate = when debugInvalidate . liftIO . debugStrLn
1396−
1397−{-# INLINE traceInvalidateHeight #-}
1398−traceInvalidateHeight :: String -> IO ()
1399−traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
1400−
1401−{-# INLINE trace #-}
1402−trace :: (CanTrace x m) => proxy x -> String -> m ()
1403−trace p message = traceM p $ return message
1404−
1405−{-# INLINE traceM #-}
1406−traceM :: forall x proxy m. (CanTrace x m) => proxy x -> m String -> m ()
1407−traceM _ getMessage = do
1408− message <- getMessage
1409− d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1410− liftIO $ debugStrLn $ replicate d ' ' <> message
1411−
14121229#else
1230+withIncreasedDepth :: m a -> m a
1231+withIncreasedDepth = id
1232+#endif
14131233
1414−{-# INLINE withIncreasedDepth #-}
1415−withIncreasedDepth :: proxy x -> m a -> m a
1416−withIncreasedDepth _ = id
1234+type CanTrace x m = (HasSpiderTimeline x m, MonadIO m)
14171235
14181236{-# INLINE tracePropagate #-}
1419−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420−tracePropagate _ _ = return ()
1237+tracePropagate :: (CanTrace x m) => String -> m ()
1238+tracePropagate = traceWhen debugPropagate
14211239
14221240{-# INLINE traceInvalidate #-}
14231241traceInvalidate :: String -> IO ()
1424−traceInvalidate _ = return ()
1425−
1426−{-# INLINE traceInvalidateHeight #-}
1427−traceInvalidateHeight :: String -> IO ()
1428−traceInvalidateHeight _ = return ()
1429−
1430−{-# INLINE debugSubscriber #-}
1431−debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
1432−debugSubscriber _ = return
1433−
1434−{-# INLINE debugSubscriber' #-}
1435−debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436−debugSubscriber' _ = id
1242+traceInvalidate = when debugInvalidate . liftIO . putStrLn
14371243
1244+{-# INLINE traceWhen #-}
1245+traceWhen :: (CanTrace x m) => Bool -> String -> m ()
1246+traceWhen b message = traceMWhen b $ return message
14381247
1439−
1440−{-# INLINE trace #-}
1441−trace :: (CanTrace x m) => proxy x -> String -> m ()
1442−trace _ _ = return ()
1443−
1444−{-# INLINE traceM #-}
1445−traceM :: (CanTrace x m) => proxy x -> m String -> m ()
1446−traceM _ _ = return ()
1447−
1248+{-# INLINE traceMWhen #-}
1249+traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
1250+traceMWhen b getMessage = when b $ do
1251+ message <- getMessage
1252+#ifdef DEBUG
1253+ spiderTimeline <- askSpiderTimeline
1254+ d <- liftIO $ readIORef $ _spiderTimeline_depth spiderTimeline
1255+#else
1256+ let d = 0
14481257#endif
1258+ liftIO $ putStrLn $ replicate d ' ' <> message
14491259
14501260whoCreatedIORef :: IORef a -> IO [String]
14511261whoCreatedIORef (IORef a) = whoCreated $! a
14521262
1263+#ifdef DEBUG_CYCLES
14531264groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
14541265groupByHead = \case
14551266 [] -> []
@@ -1460,108 +1271,77 @@ groupByHead = \case
14601271 | otherwise -> (x, xs :| []) : l
14611272
14621273listsToForest :: Eq a => [[a]] -> Forest a
1463−listsToForest lists = buildForest <$> groupByHead (mapMaybe nonEmpty lists)
1464− where buildForest (a, lists') = Node a $ listsToForest $ toList lists'
1465−
1466−showStacks :: [[String]] -> String
1467−showStacks = drawForest . listsToForest . fmap (filterStack "Reflex.Spider.Internal")
1468−
1469−filterStack :: String -> [String] -> [String]
1470−#ifdef DEBUG_HIDE_INTERNALS
1471−filterStack prefix = filter (not . (prefix `isPrefixOf`))
1472−#else
1473−filterStack prefix = id
1474−#endif
1475−
1476−#ifdef DEBUG_CYCLES
1477−
1478−data EventLoopException = EventLoopException [[String]]
1479−instance Exception EventLoopException
1480−
1481−instance Show EventLoopException where
1482− show (EventLoopException stacks) = "causality loop detected:\n" <> if null stacks
1483− then "no location information, compile with profiling enabled for stack tree"
1484− else showStacks stacks
1485−
1486−#else
1487−
1488−data EventLoopException = EventLoopException
1489−instance Exception EventLoopException
1490−
1491−instance Show EventLoopException where
1492− show EventLoopException = "causality loop detected: \n" <>
1493− "compile reflex with flag 'debug-cycles' and compile with profiling enabled for stack tree"
1494−
1274+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
14951275#endif
14961276
1497−
14981277{-# INLINE propagateSubscriberHold #-}
1499−propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
1278+propagateSubscriberHold :: R.Patch p => Hold x p -> p -> EventM x ()
15001279propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1280+ {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
15021281 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031282 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504−
15051283 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1506− case {-# SCC "apply" #-} apply a v of
1284+ case {-# SCC "apply" #-} R.apply a v of
15071285 Nothing -> return ()
15081286 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510− tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1287+ {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
15111288 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121289 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
15131290 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
15141291
1515−data SomeResetCoincidence x = forall a. SomeResetCoincidence !(EventSubscription x) !(Maybe (CoincidenceSubscribed x a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1292+data SomeResetCoincidence x = forall a. SomeResetCoincidence !(EventSubscription x a) !(Maybe (CoincidenceSubscribed x a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
15161293
15171294runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1518−runBehaviorM a mwi holdInits = runReaderIO (unBehaviorM a) (mwi, holdInits)
1295+runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
15191296
15201297askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
15211298askInvalidator = do
1522− (!m, _) <- ask
1299+ (!m, _) <- BehaviorM ask
15231300 case m of
15241301 Nothing -> return Nothing
15251302 Just (!wi, _) -> return $ Just wi
15261303
15271304askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
15281305askParentsRef = do
1529− (!m, _) <- ask
1306+ (!m, _) <- BehaviorM ask
15301307 case m of
15311308 Nothing -> return Nothing
15321309 Just (_, !p) -> return $ Just p
15331310
15341311askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
15351312askBehaviorHoldInits = do
1536− (_, !his) <- ask
1313+ (_, !his) <- BehaviorM ask
15371314 return his
15381315
15391316{-# INLINE getDynHold #-}
1540−getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
1317+getDynHold :: (Defer (SomeHoldInit x) m, R.Patch p) => Dyn x p -> m (Hold x p)
15411318getDynHold d = do
15421319 mh <- liftIO $ readIORef $ unDyn d
15431320 case mh of
1544− HoldDyn h -> return h
1545− UnsafeDyn (readV0, v') -> do
1321+ Right h -> return h
1322+ Left (readV0, v') -> do
15461323 holdInits <- getDeferralQueue
15471324 v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1548− hold' v0 v'
1549− BuildDyn (readV0, v') -> do
1550− v0 <- liftIO $ runEventM readV0
1551− hold' v0 v'
1552− where
1553− hold' v0 v' = do
15541325 h <- hold v0 v'
1555− liftIO $ writeIORef (unDyn d) $ HoldDyn h
1326+ liftIO $ writeIORef (unDyn d) $ Right h
15561327 return h
15571328
1558−
15591329-- Always refers to 0
15601330{-# NOINLINE zeroRef #-}
15611331zeroRef :: IORef Height
15621332zeroRef = unsafePerformIO $ newIORef zeroHeight
15631333
1564−getRootSubscribed :: forall k x a. (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket, RootSubscribed x a, Maybe a)
1334+type CanSubscribe x m =
1335+ ( HasSpiderTimeline x m
1336+ , HasCurrentHeight x m
1337+ , Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m -- The things we need to lazily initialize state
1338+ , Defer SomeClear m -- Wiping out event firings
1339+ , Defer (SomeAssignment x) m -- Updating state
1340+ , Defer (SomeResetCoincidence x) m
1341+ , m ~ EventM x
1342+ )
1343+
1344+getRootSubscribed :: GCompare k => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a), RootSubscribed x a, Maybe a)
15651345getRootSubscribed k r sub = do
15661346 mSubscribed <- readIORef $ rootSubscribed r
15671347 let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
@@ -1575,15 +1355,10 @@ getRootSubscribed k r sub = do
15751355 let !cached = rootSubscribed r
15761356 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
15771357 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1578−
1579− tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580−
1358+ when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
15811359 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
15821360 writeIORef uninitRef $! uninit
1583−#ifdef DEBUG_NODEIDS
1584− nid <- newNodeId
1585−#endif
1586− let !subscribed = RootSubscribed
1361+ let subscribed = RootSubscribed
15871362 { rootSubscribedKey = k
15881363 , rootSubscribedCachedSubscribed = cached
15891364 , rootSubscribedOccurrence = getOcc
@@ -1591,120 +1366,143 @@ getRootSubscribed k r sub = do
15911366 , rootSubscribedUninit = uninit
15921367 , rootSubscribedWeakSelf = weakSelf
15931368#ifdef DEBUG_NODEIDS
1594− , rootSubscribedNodeId = nid
1369+ , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
15951370#endif
15961371 }
1597− -- If we die at the same moment that all our children die, they will
1598− -- try to clean us up but will fail because their Weak reference to us
1599− -- will also be dead. So, if we are dying, check if there are any
1600− -- children; since children don't bother cleaning themselves up if
1601− -- their parents are already dead, I don't think there's a race
1602− -- condition here. However, if there are any children, then we can
1603− -- infer that we need to clean ourselves up, so we do.
1604− finalCleanup = do
1605− cs <- readIORef $ _weakBag_children subs
1606− when (not $ IntMap.null cs) (cleanupRootSubscribed subscribed)
1607− writeIORef weakSelf =<< evaluate =<< mkWeakPtr subscribed (Just finalCleanup)
1372+ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
16081373 modifyIORef' (rootSubscribed r) $ DMap.insertWith (error $ "getRootSubscribed: duplicate key inserted into Root") k subscribed --TODO: I think we can just write back mSubscribed rather than re-reading it
16091374 occ <- getOcc
16101375 return (sln, subscribed, occ)
16111376
1612−#ifdef USE_TEMPLATE_HASKELL
16131377{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1614−#endif
16151378cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1616−cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
1379+cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
16171380 rootSubscribedUninit self
16181381 modifyIORef' cached $ DMap.delete k
16191382
16201383{-# INLINE subscribeRootSubscribed #-}
1621−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1384+subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
16221385subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
16231386
1624−newtype EventSelectorInt x a = EventSelectorInt { selectInt :: Int -> Event x a }
1625−
1626−data FanInt x a = FanInt
1627− { _fanInt_subscribers :: {-# UNPACK #-} !(FastMutableIntMap (FastWeakBag (Subscriber x a))) --TODO: Clean up the keys in here when their child weak bags get empty --TODO: Remove our own subscription when the subscribers list is completely empty
1628− , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
1629− , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
1387+-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1388+{-# SPECIALIZE getPushSubscribed :: Push x a b -> Subscriber x b -> EventM x (WeakBagTicket (Subscriber x b), PushSubscribed x a b, Maybe b) #-}
1389+getPushSubscribed :: CanSubscribe x m => Push x a b -> Subscriber x b -> m (WeakBagTicket (Subscriber x b), PushSubscribed x a b, Maybe b)
1390+getPushSubscribed p sub = do
1391+ mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1392+ case mSubscribed of
1393+ Just subscribed -> {-# SCC "hitPush" #-} liftIO $ do
1394+ sln <- subscribePushSubscribed subscribed sub
1395+ occ <- readIORef $ pushSubscribedOccurrence subscribed
1396+ return (sln, subscribed, occ)
1397+ Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1398+ subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1399+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1400+ s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
1401+ (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead (pushParent p) s
1402+ occ <- runComputeM $ join <$> mapM (pushCompute p) parentOcc
1403+ occRef <- liftIO $ newIORef occ
1404+ when (isJust occ) $ scheduleClear occRef
1405+ weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1406+ let !cached = pushSubscribed p
1407+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1408+ let subscribed = PushSubscribed
1409+ { pushSubscribedCachedSubscribed = cached
1410+ , pushSubscribedOccurrence = occRef
1411+ , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1412+ , pushSubscribedSubscribers = subs
1413+ , pushSubscribedSelf = s
1414+ , pushSubscribedWeakSelf = weakSelf
1415+ , pushSubscribedParent = subscription
16301416#ifdef DEBUG_NODEIDS
1631− , _fanInt_nodeId :: {-# UNPACK #-} !Int
1417+ , pushSubscribedNodeId = unsafeNodeId p
16321418#endif
1633− }
1419+ }
1420+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1421+ liftIO $ writeIORef subscribedRef $! subscribed
1422+ liftIO $ writeIORef (pushSubscribed p) $ Just subscribed
1423+ return (sln, subscribed, occ)
16341424
1635−newFanInt :: IO (FanInt x a)
1636−newFanInt = do
1637− subscribers <- FastMutableIntMap.newEmpty --TODO: Clean up the keys in here when their child weak bags get empty --TODO: Remove our own subscription when the subscribers list is completely empty
1638− subscriptionRef <- newIORef $ error "fanInt: no subscription"
1639− occRef <- newIORef $ error "fanInt: no occurrence"
1640−#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1642−#endif
1643− return $ FanInt
1644− { _fanInt_subscribers = subscribers
1645− , _fanInt_subscriptionRef = subscriptionRef
1646− , _fanInt_occRef = occRef
1425+cleanupPushSubscribed :: PushSubscribed x a b -> IO ()
1426+cleanupPushSubscribed self = do
1427+ unsubscribe $ pushSubscribedParent self
1428+ writeIORef (pushSubscribedCachedSubscribed self) $ Nothing
1429+
1430+{-# INLINE subscribePushSubscribed #-}
1431+subscribePushSubscribed :: PushSubscribed x a b -> Subscriber x b -> IO (WeakBagTicket (Subscriber x b))
1432+subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1433+
1434+{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge x k -> Subscriber x (DMap k Identity) -> EventM x (WeakBagTicket (Subscriber x (DMap k Identity)), MergeSubscribed x k, Maybe (DMap k Identity)) #-}
1435+getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge x k -> Subscriber x (DMap k Identity) -> m (WeakBagTicket (Subscriber x (DMap k Identity)), MergeSubscribed x k, Maybe (DMap k Identity))
1436+getMergeSubscribed m sub = do
1437+ mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1438+ case mSubscribed of
1439+ Just subscribed -> {-# SCC "hitMerge" #-} liftIO $ do
1440+ sln <- subscribeMergeSubscribed subscribed sub
1441+ occ <- readIORef $ mergeSubscribedOccurrence subscribed
1442+ return (sln, subscribed, occ)
1443+ Nothing -> {-# SCC "missMerge" #-} do
1444+ subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1445+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1446+ initialParents <- readBehaviorUntracked $ dynamicCurrent $ mergeParents m
1447+ subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent x k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1448+ s <- liftIO $ newSubscriberMerge k subscribedUnsafe
1449+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead e s
1450+ height <- liftIO $ getEventSubscribedHeight parentSubd
1451+ return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription s)
1452+ let dm = DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1453+ heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1454+ myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1455+ myHeight = if invalidHeight `elem` heights
1456+ then invalidHeight
1457+ else succHeight $ heightBagMax myHeightBag
1458+ currentHeight <- getCurrentHeight
1459+ let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1460+ then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1461+ else (Nothing, dm)
1462+ unless (DMap.null accum) $ do
1463+ scheduleMerge myHeight subscribedUnsafe
1464+ occRef <- liftIO $ newIORef occ
1465+ when (isJust occ) $ scheduleClear occRef
1466+ accumRef <- liftIO $ newIORef accum
1467+ heightRef <- liftIO $ newIORef myHeight
1468+ heightMapRef <- liftIO $ newIORef myHeightBag
1469+ weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1470+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1471+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1472+ parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1473+ let !subscribed = MergeSubscribed
1474+ { mergeSubscribedCachedSubscribed = mergeSubscribed m
1475+ , mergeSubscribedOccurrence = occRef
1476+ , mergeSubscribedAccum = accumRef
1477+ , mergeSubscribedHeight = heightRef
1478+ , mergeSubscribedHeightBag = heightMapRef
1479+ , mergeSubscribedSubscribers = subs
1480+ , mergeSubscribedChange = changeSubdRef
1481+ , mergeSubscribedParents = parentsRef
1482+ , mergeSubscribedWeakSelf = weakSelf
16471483#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1484+ , mergeSubscribedNodeId = unsafeNodeId m
16491485#endif
1650− }
1486+ }
1487+ defer $ SomeMergeInit subscribed $ dynamicUpdated $ mergeParents m
1488+ liftIO $ writeIORef subscribedRef $! subscribed
1489+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1490+ liftIO $ writeIORef (mergeSubscribed m) $ Just subscribed
1491+ return (sln, subscribed, occ)
16511492
1652−fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
1653−fanInt p = unsafePerformIO $ do
1654− self <- newFanInt
1655− pure $ EventSelectorInt $ \k -> Event $ \sub -> do
1656− isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
1657− when isEmpty $ do -- This is the first subscriber, so we need to subscribe to our input
1658− let desc = "fanInt" <> showNodeId self <> ", k = " <> show k
1659− (subscription, parentOcc) <- subscribeAndRead p $ debugSubscriber' desc $ Subscriber
1660− { subscriberPropagate = \m -> do
1661− liftIO $ writeIORef (_fanInt_occRef self) m
1662− scheduleIntClear $ _fanInt_occRef self
1663− FastMutableIntMap.forIntersectionWithImmutable_ (_fanInt_subscribers self) m $ \b v -> --TODO: Do we need to know that no subscribers are being added as we traverse?
1664− FastWeakBag.traverse_ b $ \s ->
1665− subscriberPropagate s v
1666− , subscriberInvalidateHeight = \old ->
1667− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1668− FastWeakBag.traverse_ b $ \s ->
1669− subscriberInvalidateHeight s old
1670− , subscriberRecalculateHeight = \new ->
1671− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1672− FastWeakBag.traverse_ b $ \s ->
1673− subscriberRecalculateHeight s new
1674− }
1675− liftIO $ do
1676− writeIORef (_fanInt_subscriptionRef self) subscription
1677− writeIORef (_fanInt_occRef self) $ fromMaybe IntMap.empty parentOcc
1678− scheduleIntClear $ _fanInt_occRef self
1679− liftIO $ do
1680− b <- FastMutableIntMap.lookup (_fanInt_subscribers self) k >>= \case
1681− Nothing -> do
1682− b <- FastWeakBag.empty
1683− FastMutableIntMap.insert (_fanInt_subscribers self) k b
1684− return b
1685− Just b -> return b
1686− ticket <- liftIO $ FastWeakBag.insert sub b
1687− currentOcc <- readIORef (_fanInt_occRef self)
1688−
1689− subscribed <- fanIntSubscribed ticket self
1690− return (EventSubscription (FastWeakBag.remove ticket) subscribed, IntMap.lookup k currentOcc)
1691−
1692−fanIntSubscribed :: FastWeakBagTicket k -> FanInt x a -> IO (EventSubscribed x)
1693−fanIntSubscribed ticket self = do
1694− subscribedParent <- _eventSubscription_subscribed <$> readIORef (_fanInt_subscriptionRef self)
1695− return $ EventSubscribed
1696− { eventSubscribedHeightRef = eventSubscribedHeightRef subscribedParent
1697− , eventSubscribedRetained = toAny (_fanInt_subscriptionRef self, ticket)
1698−#ifdef DEBUG_CYCLES
1699− , eventSubscribedGetParents = return [subscribedParent]
1700− , eventSubscribedHasOwnHeightRef = False
1701− , eventSubscribedWhoCreated = whoCreatedIORef $ _fanInt_subscriptionRef self
1702−#endif
1703− }
1493+cleanupMergeSubscribed :: MergeSubscribed x k -> IO ()
1494+cleanupMergeSubscribed subscribed = do
1495+ parents <- readIORef $ mergeSubscribedParents subscribed
1496+ forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1497+ -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1498+ writeIORef (mergeSubscribedCachedSubscribed subscribed) $ Nothing -- Get rid of the cached subscribed
17041499
1500+{-# INLINE subscribeMergeSubscribed #-}
1501+subscribeMergeSubscribed :: MergeSubscribed x k -> Subscriber x (DMap k Identity) -> IO (WeakBagTicket (Subscriber x (DMap k Identity)))
1502+subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
17051503
1706−{-# INLINABLE getFanSubscribed #-}
1707−getFanSubscribed :: (HasSpiderTimeline x, GCompare k) => k a -> Fan x k v -> Subscriber x (v a) -> EventM x (WeakBagTicket, FanSubscribed x k v, Maybe (v a))
1504+{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan x k -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), FanSubscribed x k, Maybe a) #-}
1505+getFanSubscribed :: (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderTimeline x m, m ~ EventM x, GCompare k) => k a -> Fan x k -> Subscriber x a -> m (WeakBagTicket (Subscriber x a), FanSubscribed x k, Maybe a)
17081506getFanSubscribed k f sub = do
17091507 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
17101508 case mSubscribed of
@@ -1722,16 +1520,13 @@ getFanSubscribed k f sub = do
17221520 subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
17231521 occRef <- liftIO $ newIORef parentOcc
17241522 when (isJust parentOcc) $ scheduleClear occRef
1725−#ifdef DEBUG_NODEIDS
1726− nid <- liftIO newNodeId
1727−#endif
17281523 let subscribed = FanSubscribed
17291524 { fanSubscribedCachedSubscribed = fanSubscribed f
17301525 , fanSubscribedOccurrence = occRef
17311526 , fanSubscribedParent = subscription
17321527 , fanSubscribedSubscribers = subscribersRef
17331528#ifdef DEBUG_NODEIDS
1734− , fanSubscribedNodeId = nid
1529+ , fanSubscribedNodeId = unsafeNodeId f
17351530#endif
17361531 }
17371532 let !self = (k, subscribed)
@@ -1741,7 +1536,7 @@ getFanSubscribed k f sub = do
17411536 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
17421537 return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
17431538
1744−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
1539+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k) -> IO ()
17451540cleanupFanSubscribed (k, subscribed) = do
17461541 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17471542 let reducedSubscribers = DMap.delete k subscribers
@@ -1753,7 +1548,7 @@ cleanupFanSubscribed (k, subscribed) = do
17531548 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
17541549
17551550{-# INLINE subscribeFanSubscribed #-}
1756−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
1551+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
17571552subscribeFanSubscribed k subscribed sub = do
17581553 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17591554 case DMap.lookup k subscribers of
@@ -1765,8 +1560,8 @@ subscribeFanSubscribed k subscribed sub = do
17651560 return sln
17661561 Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
17671562
1768−{-# INLINABLE getSwitchSubscribed #-}
1769−getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1563+{-# SPECIALIZE getSwitchSubscribed :: Switch x a -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), SwitchSubscribed x a, Maybe a) #-}
1564+getSwitchSubscribed :: (Defer (SomeHoldInit x) m, Defer (SomeAssignment x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, Defer (SomeResetCoincidence x) m, HasCurrentHeight x m, HasSpiderTimeline x m, m ~ EventM x) => Switch x a -> Subscriber x a -> m (WeakBagTicket (Subscriber x a), SwitchSubscribed x a, Maybe a)
17701565getSwitchSubscribed s sub = do
17711566 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
17721567 case mSubscribed of
@@ -1791,9 +1586,6 @@ getSwitchSubscribed s sub = do
17911586 when (isJust parentOcc) $ scheduleClear occRef
17921587 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
17931588 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794−#ifdef DEBUG_NODEIDS
1795− nid <- liftIO newNodeId
1796−#endif
17971589 let !subscribed = SwitchSubscribed
17981590 { switchSubscribedCachedSubscribed = switchSubscribed s
17991591 , switchSubscribedOccurrence = occRef
@@ -1806,7 +1598,7 @@ getSwitchSubscribed s sub = do
18061598 , switchSubscribedCurrentParent = subscriptionRef
18071599 , switchSubscribedWeakSelf = weakSelf
18081600#ifdef DEBUG_NODEIDS
1809− , switchSubscribedNodeId = nid
1601+ , switchSubscribedNodeId = unsafeNodeId s
18101602#endif
18111603 }
18121604 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
@@ -1821,11 +1613,11 @@ cleanupSwitchSubscribed subscribed = do
18211613 writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
18221614
18231615{-# INLINE subscribeSwitchSubscribed #-}
1824−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1616+subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
18251617subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
18261618
1827−{-# INLINABLE getCoincidenceSubscribed #-}
1828−getCoincidenceSubscribed :: forall x a. HasSpiderTimeline x => Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
1619+{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), CoincidenceSubscribed x a, Maybe a) #-}
1620+getCoincidenceSubscribed :: forall x a m. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderTimeline x m, m ~ EventM x) => Coincidence x a -> Subscriber x a -> m (WeakBagTicket (Subscriber x a), CoincidenceSubscribed x a, Maybe a)
18291621getCoincidenceSubscribed c sub = do
18301622 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
18311623 case mSubscribed of
@@ -1851,9 +1643,6 @@ getCoincidenceSubscribed c sub = do
18511643 scheduleClear innerSubdRef
18521644 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
18531645 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854−#ifdef DEBUG_NODEIDS
1855− nid <- liftIO newNodeId
1856−#endif
18571646 let subscribed = CoincidenceSubscribed
18581647 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
18591648 , coincidenceSubscribedOccurrence = occRef
@@ -1864,7 +1653,7 @@ getCoincidenceSubscribed c sub = do
18641653 , coincidenceSubscribedInnerParent = innerSubdRef
18651654 , coincidenceSubscribedWeakSelf = weakSelf
18661655#ifdef DEBUG_NODEIDS
1867− , coincidenceSubscribedNodeId = nid
1656+ , coincidenceSubscribedNodeId = unsafeNodeId c
18681657#endif
18691658 }
18701659 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
@@ -1878,535 +1667,145 @@ cleanupCoincidenceSubscribed subscribed = do
18781667 writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
18791668
18801669{-# INLINE subscribeCoincidenceSubscribed #-}
1881−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1670+subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
18821671subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
18831672
1884−{-# INLINE mergeG #-}
1885−mergeG :: forall k q x v. (HasSpiderTimeline x, GCompare k)
1886− => (forall a. q a -> Event x (v a))
1887− -> DynamicS x (PatchDMap k q) -> Event x (DMap k v)
1888−mergeG nt d = cacheEvent (mergeCheap nt d)
1889−
1890−{-# INLINE mergeWithMove #-}
1891−mergeWithMove :: forall k v q x. (HasSpiderTimeline x, GCompare k)
1892− => (forall a. q a -> Event x (v a))
1893− -> DynamicS x (PatchDMapWithMove k q) -> Event x (DMap k v)
1894−mergeWithMove nt d = cacheEvent (mergeCheapWithMove nt d)
1895−
1896−{-# INLINE [1] mergeCheap #-}
1897−mergeCheap
1898− :: forall k x q v. (HasSpiderTimeline x, GCompare k)
1899− => (forall a. q a -> Event x (v a))
1900− -> DynamicS x (PatchDMap k q)
1901− -> Event x (DMap k v)
1902−mergeCheap nt = mergeGCheap' unMergeSubscribedParent getInitialSubscribers updateMe destroy
1903− where
1904− updateMe :: MergeUpdateFunc k v x (PatchDMap k q) (MergeSubscribedParent x)
1905− updateMe subscriber heightBagRef oldParents (PatchDMap p) = do
1906− let f (subscriptionsToKill, ps) (k :=> ComposeMaybe me) = do
1907− (mOldSubd, newPs) <- case me of
1908− Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1909− Just e -> do
1910− let s = subscriber $ return k
1911− subscription@(EventSubscription _ subd) <- subscribe (nt e) s
1912− newParentHeight <- liftIO $ getEventSubscribedHeight subd
1913− let newParent = MergeSubscribedParent subscription
1914− liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
1915− return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1916− forM_ mOldSubd $ \oldSubd -> do
1917− oldHeight <- liftIO $ getEventSubscribedHeight $
1918− _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
1919−
1920− liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1921− return (maybeToList (unMergeSubscribedParent <$> mOldSubd) ++ subscriptionsToKill, newPs)
1922− foldM f ([], oldParents) $ DMap.toList p
1923−
1924− getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParent x)
1925− getInitialSubscribers initialParents subscriber = do
1926− subscribers <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1927− let s = subscriber $ return k
1928− (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead (nt e) s
1929− height <- liftIO $ getEventSubscribedHeight parentSubd
1930− return (fmap (k :=>) parentOcc, height, k :=> MergeSubscribedParent subscription)
1931− return ( DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1932− , fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1933− , DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1934− )
1935−
1936− destroy :: MergeDestroyFunc k (MergeSubscribedParent x)
1937− destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParent sub) -> unsubscribe sub
1938−
1939−{-# INLINE [1] mergeCheapWithMove #-}
1940−mergeCheapWithMove :: forall k x v q. (HasSpiderTimeline x, GCompare k)
1941− => (forall a. q a -> Event x (v a))
1942− -> DynamicS x (PatchDMapWithMove k q)
1943− -> Event x (DMap k v)
1944−mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription getInitialSubscribers updateMe destroy
1945− where
1946− updateMe :: MergeUpdateFunc k v x (PatchDMapWithMove k q) (MergeSubscribedParentWithMove x k)
1947− updateMe subscriber heightBagRef oldParents p = do
1948− -- Prepare new parents for insertion
1949− let subscribeParent :: forall a. k a -> Event x (v a) -> EventM x (MergeSubscribedParentWithMove x k a)
1950− subscribeParent k e = do
1951− keyRef <- liftIO $ newIORef k
1952− let s = subscriber $ liftIO $ readIORef keyRef
1953− subscription@(EventSubscription _ subd) <- subscribe e s
1954− liftIO $ do
1955− newParentHeight <- getEventSubscribedHeight subd
1956− modifyIORef' heightBagRef $ heightBagAdd newParentHeight
1957− return $ MergeSubscribedParentWithMove subscription keyRef
1958− p' <- PatchDMapWithMove.traversePatchDMapWithMoveWithKey (\k q -> subscribeParent k (nt q)) p
1959− -- Collect old parents for deletion and update the keys of moved parents
1960− let moveOrDelete :: forall a. k a -> PatchDMapWithMove.NodeInfo k q a -> MergeSubscribedParentWithMove x k a -> Constant (EventM x (Maybe (EventSubscription x))) a
1961− moveOrDelete _ ni parent = Constant $ case getComposeMaybe $ PatchDMapWithMove._nodeInfo_to ni of
1962− Nothing -> do
1963− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
1964− _mergeSubscribedParentWithMove_subscription parent
1965−
1966− liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1967− return $ Just $ _mergeSubscribedParentWithMove_subscription parent
1968− Just toKey -> do
1969− liftIO $ writeIORef (_mergeSubscribedParentWithMove_key parent) $! toKey
1970− return Nothing
1971− toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
1972− DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
1973−
1974− return (toDelete, applyAlways p' oldParents)
1975− getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParentWithMove x k)
1976− getInitialSubscribers initialParents subscriber = do
1977− subscribers <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1978− keyRef <- liftIO $ newIORef k
1979− let s = subscriber $ liftIO $ readIORef keyRef
1980− (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead (nt e) s
1981− height <- liftIO $ getEventSubscribedHeight parentSubd
1982− return (fmap (k :=>) parentOcc, height, k :=> MergeSubscribedParentWithMove subscription keyRef)
1983− return ( DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1984− , fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1985− , DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1986− )
1987−
1988− destroy :: MergeDestroyFunc k (MergeSubscribedParentWithMove x k)
1989− destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParentWithMove sub _) -> unsubscribe sub
1990−
1991−type MergeUpdateFunc k v x p s
1992− = (forall a. EventM x (k a) -> Subscriber x (v a))
1993− -> IORef HeightBag
1994− -> DMap k s
1995− -> p
1996− -> EventM x ([EventSubscription x], DMap k s)
1997−
1998−type MergeGetSubscription x s = forall a. s a -> EventSubscription x
1999−
2000−type MergeInitFunc k v q x s
2001− = DMap k q
2002− -> (forall a. EventM x (k a) -> Subscriber x (v a))
2003− -> EventM x (DMap k v, [Height], DMap k s)
2004−
2005−type MergeDestroyFunc k s
2006− = DMap k s
2007− -> IO ()
2008−
2009−data Merge x k v s = Merge
2010− { _merge_parentsRef :: {-# UNPACK #-} !(IORef (DMap k s))
2011− , _merge_heightBagRef :: {-# UNPACK #-} !(IORef HeightBag)
2012− , _merge_heightRef :: {-# UNPACK #-} !(IORef Height)
2013− , _merge_sub :: {-# UNPACK #-} !(Subscriber x (DMap k v))
2014− , _merge_accumRef :: {-# UNPACK #-} !(IORef (DMap k v))
1673+{-# INLINE merge #-}
1674+merge :: GCompare k => Dynamic x (R.PatchDMap k (Event x)) -> Event x (DMap k Identity)
1675+merge m = eventMerge $ Merge
1676+ { mergeParents = m
1677+ , mergeSubscribed = unsafeNewIORef m Nothing
20151678 }
20161679
2017−invalidateMergeHeight :: Merge x k v s -> IO ()
2018−invalidateMergeHeight m = invalidateMergeHeight' (_merge_heightRef m) (_merge_sub m)
2019−
2020−invalidateMergeHeight' :: IORef Height -> Subscriber x a -> IO ()
2021−invalidateMergeHeight' heightRef sub = do
2022− oldHeight <- readIORef heightRef
2023− -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
2024− when (oldHeight /= invalidHeight) $ do
2025− writeIORef heightRef $! invalidHeight
2026− subscriberInvalidateHeight sub oldHeight
2027−
2028−revalidateMergeHeight :: Merge x k v s -> IO ()
2029−revalidateMergeHeight m = do
2030− currentHeight <- readIORef $ _merge_heightRef m
2031−
2032− -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
2033− when (currentHeight == invalidHeight) $ do
2034− heights <- readIORef $ _merge_heightBagRef m
2035− parents <- readIORef $ _merge_parentsRef m
2036− -- When the number of heights in the bag reaches the number of parents, we should have a valid height
2037− case heightBagSize heights `compare` DMap.size parents of
2038− LT -> return ()
2039− EQ -> do
2040− let height = succHeight $ heightBagMax heights
2041− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
2042− writeIORef (_merge_heightRef m) $! height
2043− subscriberRecalculateHeight (_merge_sub m) height
2044− GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show (DMap.size parents) <> ") for Merge"
2045−
2046−scheduleMergeSelf :: HasSpiderTimeline x => Merge x k v s -> Height -> EventM x ()
2047−scheduleMergeSelf m height = scheduleMerge' height (_merge_heightRef m) $ do
2048− vals <- liftIO $ readIORef $ _merge_accumRef m
2049− -- Once we're done with this, we can clear it immediately, because if there's a cacheEvent in front of us,
2050− -- it'll handle subsequent subscribers, and if not, we won't get subsequent subscribers
2051− liftIO $ writeIORef (_merge_accumRef m) $! DMap.empty
2052− --TODO: Assert that m is not empty
2053− subscriberPropagate (_merge_sub m) vals
2054−
2055−checkCycle :: HasSpiderTimeline x => EventSubscribed x -> EventM x ()
2056−checkCycle subscribed = liftIO $ do
2057− height <- readIORef (eventSubscribedHeightRef subscribed)
2058−
2059− -- currentHeight <- getCurrentHeight
2060− -- when (height <= currentHeight) $ if height /= invalidHeight
2061− -- then do
2062− -- myStack <- liftIO $ whoCreatedIORef undefined --TODO
2063− -- error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
2064− -- else liftIO $
2065− when (height == invalidHeight) $
2066−#ifdef DEBUG_CYCLES
2067− do
2068− nodesInvolvedInCycle <- walkInvalidHeightParents subscribed
2069− stacks <- forM nodesInvolvedInCycle whoCreatedEventSubscribed
2070− throwIO (EventLoopException stacks)
2071−#else
2072− throwIO EventLoopException
2073−#endif
2074−
2075−
2076−mergeSubscriber :: forall x k v s a. (HasSpiderTimeline x, GCompare k) => EventSubscribed x -> Merge x k v s -> EventM x (k a) -> Subscriber x (v a)
2077−mergeSubscriber subscribed m getKey = Subscriber
2078− { subscriberPropagate = \a -> do
2079− oldM <- liftIO $ readIORef $ _merge_accumRef m
2080− k <- getKey
2081− let newM = DMap.insertWith (error "Same key fired multiple times for Merge") k a oldM
2082− tracePropagate (Proxy :: Proxy x) $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
2083− liftIO $ writeIORef (_merge_accumRef m) $! newM
2084− when (DMap.null oldM) $ do -- Only schedule the firing once
2085− height <- liftIO $ readIORef $ _merge_heightRef m
2086− checkCycle subscribed
2087−
2088− scheduleMergeSelf m height
2089− , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
2090− modifyIORef' (_merge_heightBagRef m) $ heightBagRemove old
2091− invalidateMergeHeight m
2092− , subscriberRecalculateHeight = \new -> do
2093− modifyIORef' (_merge_heightBagRef m) $ heightBagAdd new
2094− revalidateMergeHeight m
2095− }
2096−
2097−--TODO: Be able to run as much of this as possible promptly
2098−updateMerge :: (HasSpiderTimeline x, GCompare k) => EventSubscribed x -> Merge x k v s -> MergeUpdateFunc k v x p s -> p -> SomeMergeUpdate x
2099−updateMerge subscribed m updateFunc p = SomeMergeUpdate updateMe (invalidateMergeHeight m) (revalidateMergeHeight m)
2100− where updateMe = do
2101− oldParents <- liftIO $ readIORef $ _merge_parentsRef m
2102− (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber subscribed m) (_merge_heightBagRef m) oldParents p
2103− liftIO $ writeIORef (_merge_parentsRef m) $! newParents
2104− return subscriptionsToKill
2105−
2106−{-# INLINE mergeGCheap' #-}
2107−mergeGCheap' :: forall k v x p s q. (HasSpiderTimeline x, GCompare k, PatchTarget p ~ DMap k q)
2108− => MergeGetSubscription x s -> MergeInitFunc k v q x s -> MergeUpdateFunc k v x p s -> MergeDestroyFunc k s -> DynamicS x p -> Event x (DMap k v)
2109−mergeGCheap' getParent getInitialSubscribers updateFunc destroy d = Event $ \sub -> do
2110− initialParents <- readBehaviorUntracked $ dynamicCurrent d
2111− accumRef <- liftIO $ newIORef $ error "merge: accumRef not yet initialized"
2112− heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
2113− heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
2114− parentsRef :: IORef (DMap k s) <- liftIO $ newIORef $ error "merge: parentsRef not yet initialized"
2115− changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
2116−
2117− let subscribed = EventSubscribed
2118− { eventSubscribedHeightRef = heightRef
2119− , eventSubscribedRetained = toAny (parentsRef, changeSubdRef)
2120−#ifdef DEBUG_CYCLES
2121− , eventSubscribedGetParents = do
2122− let getParent' (_ :=> v) = _eventSubscription_subscribed (getParent v)
2123− fmap getParent' . DMap.toList <$> readIORef parentsRef
2124− , eventSubscribedHasOwnHeightRef = False
2125− , eventSubscribedWhoCreated = whoCreatedIORef heightRef
2126−#endif
2127− }
2128−
2129− m = Merge
2130− { _merge_parentsRef = parentsRef
2131− , _merge_heightBagRef = heightBagRef
2132− , _merge_heightRef = heightRef
2133− , _merge_sub = sub
2134− , _merge_accumRef = accumRef
2135− }
2136− (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber subscribed m
2137− let myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
2138− myHeight = if invalidHeight `elem` heights
2139− then invalidHeight
2140− else succHeight $ heightBagMax myHeightBag
2141− currentHeight <- getCurrentHeight
2142− let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
2143− then (if DMap.null dm then Nothing else Just dm, DMap.empty)
2144− else (Nothing, dm)
2145− unless (DMap.null accum) $ scheduleMergeSelf m myHeight
2146− liftIO $ writeIORef accumRef $! accum
2147− liftIO $ writeIORef heightRef $! myHeight
2148− liftIO $ writeIORef heightBagRef $! myHeightBag
2149− liftIO $ writeIORef parentsRef $! initialParentState
2150− defer $ SomeMergeInit $ do
2151− let changeSubscriber = Subscriber
2152− { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2153− tracePropagate (Proxy :: Proxy x) "SubscriberMerge/Change"
2154− defer $ updateMerge subscribed m updateFunc a
2155− , subscriberInvalidateHeight = \_ -> return ()
2156− , subscriberRecalculateHeight = \_ -> return ()
2157− }
2158− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2159− forM_ change $ \c -> defer $ updateMerge subscribed m updateFunc c
2160− -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
2161− -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
2162− -- its subscription.
2163− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2164− let unsubscribeAll = destroy =<< readIORef parentsRef
2165−
2166− return (EventSubscription unsubscribeAll subscribed, occ)
2167−
2168−
2169−mergeInt :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
2170−mergeInt = cacheEvent . mergeIntCheap
2171−
2172−{-# INLINABLE mergeIntCheap #-}
2173−mergeIntCheap :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
2174−mergeIntCheap d = Event $ \sub -> do
2175− initialParents <- readBehaviorUntracked $ dynamicCurrent d
2176− accum <- liftIO $ FastMutableIntMap.newEmpty
2177− heightRef <- liftIO $ newIORef zeroHeight
2178− heightBagRef <- liftIO $ newIORef heightBagEmpty
2179− parents <- liftIO $ FastMutableIntMap.newEmpty
2180− changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
2181− let subscribed = EventSubscribed
2182− { eventSubscribedHeightRef = heightRef
2183− , eventSubscribedRetained = toAny (parents, changeSubdRef)
2184−#ifdef DEBUG_CYCLES
2185− , eventSubscribedGetParents = fmap (_eventSubscription_subscribed . snd) <$> FastMutableIntMap.toList parents
2186− , eventSubscribedHasOwnHeightRef = False
2187− , eventSubscribedWhoCreated = whoCreatedIORef heightRef
2188−#endif
2189− }
2190− let scheduleSelf = do
2191− height <- liftIO $ readIORef $ heightRef
2192− scheduleMerge' height heightRef $ do
2193− vals <- liftIO $ FastMutableIntMap.getFrozenAndClear accum
2194− subscriberPropagate sub vals
2195− invalidateMyHeight = invalidateMergeHeight' heightRef sub
2196− recalculateMyHeight = do
2197− currentHeight <- readIORef heightRef
2198− when (currentHeight == invalidHeight) $ do --TODO: This will almost always be true; can we get rid of this check and just proceed to the next one always?
2199− heights <- readIORef heightBagRef
2200− numParents <- FastMutableIntMap.size parents
2201− case heightBagSize heights `compare` numParents of
2202− LT -> return ()
2203− EQ -> do
2204− let height = succHeight $ heightBagMax heights
2205− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
2206− writeIORef heightRef $! height
2207− subscriberRecalculateHeight sub height
2208− GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show numParents <> ") for Merge"
2209− mySubscriber k = Subscriber
2210− { subscriberPropagate = \a -> do
2211− checkCycle subscribed
2212−
2213− wasEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
2214− liftIO $ FastMutableIntMap.insert accum k a
2215− when wasEmpty scheduleSelf
2216− , subscriberInvalidateHeight = \old -> do
2217− modifyIORef' heightBagRef $ heightBagRemove old
2218− invalidateMyHeight
2219− , subscriberRecalculateHeight = \new -> do
2220− modifyIORef' heightBagRef $ heightBagAdd new
2221− recalculateMyHeight
2222− }
2223− forM_ (IntMap.toList initialParents) $ \(k, p) -> do
2224− (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead p $ mySubscriber k
2225− liftIO $ do
2226− forM_ parentOcc $ FastMutableIntMap.insert accum k
2227− FastMutableIntMap.insert parents k subscription
2228− height <- getEventSubscribedHeight parentSubd
2229− if height == invalidHeight
2230− then writeIORef heightRef invalidHeight
2231− else do
2232− modifyIORef' heightBagRef $ heightBagAdd height
2233− modifyIORef' heightRef $ \oldHeight ->
2234− if oldHeight == invalidHeight
2235− then invalidHeight
2236− else max (succHeight height) oldHeight
2237− myHeight <- liftIO $ readIORef heightRef
2238− currentHeight <- getCurrentHeight
2239− isEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
2240− occ <- if currentHeight >= myHeight -- If we should have fired by now
2241− then if isEmpty
2242− then return Nothing
2243− else liftIO $ Just <$> FastMutableIntMap.getFrozenAndClear accum
2244− else do when (not isEmpty) scheduleSelf -- We have things accumulated, but we shouldn't have fired them yet
2245− return Nothing
2246− defer $ SomeMergeInit $ do
2247− let updateMe a = SomeMergeUpdate u invalidateMyHeight recalculateMyHeight
2248− where
2249− u = do
2250− let f k newParent = do
2251− subscription@(EventSubscription _ subd) <- subscribe newParent $ mySubscriber k
2252− newParentHeight <- liftIO $ getEventSubscribedHeight subd
2253− liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
2254− return subscription
2255− newSubscriptions <- FastMutableIntMap.traverseIntMapPatchWithKey f a
2256− oldParents <- liftIO $ FastMutableIntMap.applyPatch parents newSubscriptions
2257− liftIO $ for_ oldParents $ \oldParent -> do
2258− oldParentHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed oldParent
2259−
2260− print ("updateMe", oldParentHeight)
2261− modifyIORef' heightBagRef $ heightBagRemove oldParentHeight
2262− return $ IntMap.elems oldParents
2263− let changeSubscriber = Subscriber
2264− { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2265− tracePropagate (Proxy :: Proxy x) $ "SubscriberMergeInt/Change"
2266− defer $ updateMe a
2267− , subscriberInvalidateHeight = \_ -> return ()
2268− , subscriberRecalculateHeight = \_ -> return ()
2269− }
2270− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2271− forM_ change $ \c -> defer $ updateMe c
2272− -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
2273− -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
2274− -- its subscription.
2275− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2276− let unsubscribeAll = traverse_ unsubscribe =<< FastMutableIntMap.getFrozenAndClear parents
2277−
2278−
2279− return (EventSubscription unsubscribeAll subscribed, occ)
2280−
22811680newtype EventSelector x k = EventSelector { select :: forall a. k a -> Event x a }
2282−newtype EventSelectorG x k v = EventSelectorG { selectG :: forall a. k a -> Event x (v a) }
22831681
2284−fanG :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k v) -> EventSelectorG x k v
2285−fanG e = unsafePerformIO $ do
2286− ref <- newIORef Nothing
1682+fan :: GCompare k => Event x (DMap k Identity) -> EventSelector x k
1683+fan e =
22871684 let f = Fan
22881685 { fanParent = e
2289− , fanSubscribed = ref
1686+ , fanSubscribed = unsafeNewIORef e Nothing
22901687 }
2291− pure $ EventSelectorG $ \k -> eventFan k f
1688+ in EventSelector $ \k -> eventFan k f
22921689
2293−runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
2294−runHoldInits holdInitRef dynInitRef mergeInitRef = do
1690+runHoldInits :: IORef [SomeHoldInit x] -> IORef [SomeMergeInit x] -> EventM x ()
1691+runHoldInits holdInitRef mergeInitRef = do
22951692 holdInits <- liftIO $ readIORef holdInitRef
2296− dynInits <- liftIO $ readIORef dynInitRef
22971693 mergeInits <- liftIO $ readIORef mergeInitRef
2298− unless (null holdInits && null dynInits && null mergeInits) $ do
1694+ unless (null holdInits && null mergeInits) $ do
22991695 liftIO $ writeIORef holdInitRef []
2300− liftIO $ writeIORef dynInitRef []
23011696 liftIO $ writeIORef mergeInitRef []
23021697 mapM_ initHold holdInits
2303− mapM_ initDyn dynInits
2304− mapM_ unSomeMergeInit mergeInits
2305− runHoldInits holdInitRef dynInitRef mergeInitRef
1698+ mapM_ initMerge mergeInits
1699+ runHoldInits holdInitRef mergeInitRef
23061700
2307−initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
1701+initHold :: SomeHoldInit x -> EventM x ()
23081702initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
23091703
2310−initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
2311−initDyn (SomeDynInit d) = void $ getDynHold d
1704+initMerge :: SomeMergeInit x -> EventM x ()
1705+initMerge (SomeMergeInit subscribed changed) = do
1706+ changeSub <- liftIO $ newSubscriberMergeChange subscribed
1707+ (EventSubscription _ changeSubd, change) <- subscribeAndRead changed changeSub
1708+ forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1709+ liftIO $ writeIORef (mergeSubscribedChange subscribed) (changeSub, changeSubd)
23121710
2313−newEventEnv :: IO (EventEnv x)
2314−newEventEnv = do
1711+-- | Run an event action outside of a frame
1712+runFrame :: forall x a. EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1713+runFrame a = SpiderHost $ ask >>= \spiderTimeline -> lift $ do
1714+ -- Clear out pending unsubscriptions; these will need to happen eventually anyway, and might cause us a lot of extra work during the frame, so get rid of them now
1715+ pendingCleanups <- atomicModifyIORef (_spiderTimeline_cleanups spiderTimeline) $ \x -> ([], x)
1716+ {-# SCC "cleanups" #-} sequence_ pendingCleanups
23151717 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
23161718 holdInitRef <- newIORef []
2317− dynInitRef <- newIORef []
23181719 mergeUpdateRef <- newIORef []
23191720 mergeInitRef <- newIORef []
23201721 heightRef <- newIORef zeroHeight
23211722 toClearRef <- newIORef []
2322− toClearIntRef <- newIORef []
23231723 toClearRootRef <- newIORef []
23241724 coincidenceInfosRef <- newIORef []
2325− delayedRef <- newIORef IntMap.empty
2326− return $ EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef
2327−
2328−clearEventEnv :: EventEnv x -> IO ()
2329−clearEventEnv (EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef) = do
2330− writeIORef toAssignRef []
2331− writeIORef holdInitRef []
2332− writeIORef dynInitRef []
2333− writeIORef mergeUpdateRef []
2334− writeIORef mergeInitRef []
2335− writeIORef heightRef zeroHeight
2336− writeIORef toClearRef []
2337− writeIORef toClearIntRef []
2338− writeIORef toClearRootRef []
2339− writeIORef coincidenceInfosRef []
2340− writeIORef delayedRef IntMap.empty
2341−
2342−-- | Run an event action outside of a frame
2343−runFrame :: forall x a. HasSpiderTimeline x => EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
2344−runFrame a = SpiderHost $ do
2345− let env = _spiderTimeline_eventEnv $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1725+ delayedRef <- liftIO $ newIORef IntMap.empty
1726+ let env = EventEnv spiderTimeline toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
23461727 let go = do
23471728 result <- a
2348− runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
1729+ runHoldInits holdInitRef mergeInitRef -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
23491730 return result
2350− result <- runEventM go
2351− toClear <- readIORef $ eventEnvClears env
2352− forM_ toClear $ \(Some (Clear ref)) -> {-# SCC "clear" #-} writeIORef ref Nothing
2353− toClearInt <- readIORef $ eventEnvIntClears env
2354− forM_ toClearInt $ \(Some (IntClear ref)) -> {-# SCC "intClear" #-} writeIORef ref $! IntMap.empty
2355− toClearRoot <- readIORef $ eventEnvRootClears env
2356− forM_ toClearRoot $ \(Some (RootClear ref)) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
2357− toAssign <- readIORef $ eventEnvAssignments env
1731+ result <- runEventM go env
1732+ toClear <- readIORef toClearRef
1733+ forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
1734+ toClearRoot <- readIORef toClearRootRef
1735+ forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1736+ toAssign <- readIORef toAssignRef
23581737 toReconnectRef <- newIORef []
2359− coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
1738+ coincidenceInfos <- readIORef coincidenceInfosRef
23601739 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
23611740 writeIORef vRef v
2362− traceInvalidate $ "Invalidating Hold"
1741+ when debugInvalidate $ putStrLn $ "Invalidating Hold"
23631742 writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
2364− mergeUpdates <- readIORef $ eventEnvMergeUpdates env
2365− writeIORef (eventEnvMergeUpdates env) []
2366− tracePropagate (Proxy::Proxy x) $ "Updating merges"
2367− mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
2368− tracePropagate (Proxy::Proxy x) $ "Updating merges done"
1743+ mergeUpdates <- readIORef mergeUpdateRef
1744+ writeIORef mergeUpdateRef []
1745+ let updateMerge :: SomeMergeUpdate x -> IO [SomeEventSubscription x]
1746+ updateMerge (SomeMergeUpdate (R.PatchDMap p :: R.PatchDMap k (Event x)) m) = do
1747+ oldParents <- readIORef $ mergeSubscribedParents m
1748+ let f (subscriptionsToKill, ps) (k :=> R.ComposeMaybe me) = do
1749+ (mOldSubd, newPs) <- case me of
1750+ Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1751+ Just e -> do
1752+ s <- liftIO $ newSubscriberMerge k m
1753+ subscription@(EventSubscription _ subd) <- subscribe e s
1754+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
1755+ let newParent = MergeSubscribedParent subscription s
1756+ liftIO $ addMergeHeight newParentHeight m
1757+ return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1758+ forM_ mOldSubd $ \oldSubd -> do
1759+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1760+ liftIO $ removeMergeHeight oldHeight m
1761+ return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1762+ (subscriptionsToKill, newParents) <- flip runEventM env $ foldM f ([], oldParents) $ DMap.toList p --TODO: I think this runEventM is OK, since no events are firing at this time, but it might not be
1763+ writeIORef (mergeSubscribedParents m) $! newParents
1764+ return subscriptionsToKill
1765+ when debugPropagate $ putStrLn "Updating merges"
1766+ mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
1767+ when debugPropagate $ putStrLn "Updating merges done"
23691768 toReconnect <- readIORef toReconnectRef
2370− clearEventEnv env
23711769 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23721770 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
23731771 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2374− traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1772+ when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
23751773 finalize wi
23761774 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
23771775 wi' <- mkWeakPtrWithDebug i "wi'"
23781776 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
23791777 writeIORef (switchSubscribedBehaviorParents subscribed) []
2380− writeIORef (eventEnvHoldInits env) [] --TODO: Should we reuse this?
2381− e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) $ eventEnvHoldInits env
2382− runEventM $ runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) --TODO: Is this actually OK? It seems like it should be, since we know that no events are firing at this point, but it still seems inelegant
1778+ writeIORef holdInitRef [] --TODO: Should we reuse this?
1779+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
1780+ runEventM (runHoldInits holdInitRef mergeInitRef) env --TODO: Is this actually OK? It seems like it should be, since we know that no events are firing at this point, but it still seems inelegant
23831781 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
23841782 sub <- newSubscriberSwitch subscribed
2385− subscription <- unSpiderHost $ runFrame $ {-# SCC "subscribeSwitch" #-} subscribe e sub --TODO: Assert that the event isn't firing --TODO: This should not loop because none of the events should be firing, but still, it is inefficient
1783+ subscription <- runReaderT (unSpiderHost (runFrame ({-# SCC "subscribeSwitch" #-} subscribe e sub))) spiderTimeline --TODO: Assert that the event isn't firing --TODO: This should not loop because none of the events should be firing, but still, it is inefficient
23861784 {-
23871785 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1786+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23891787 EventRoot _ -> "EventRoot"
23901788 EventNever -> "EventNever"
23911789 _ -> "something else"
23921790 -}
23931791 writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
2394− return oldSubscription
2395− liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
2396− liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
1792+ return $ SomeEventSubscription oldSubscription
1793+ forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1794+ forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
23971795 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23981796 EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
23991797 parentHeight <- getEventSubscribedHeight subd'
24001798 myHeight <- readIORef $ switchSubscribedHeight subscribed
24011799 when (parentHeight /= myHeight) $ do
24021800 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
2403− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
2404− mapM_ _someMergeUpdate_invalidateHeight mergeUpdates --TODO: In addition to when the patch is completely empty, we should also not run this if it has some Nothing values, but none of them have actually had any effect; potentially, we could even check for Just values with no effect (e.g. by comparing their IORefs and ignoring them if they are unchanged); actually, we could just check if the new height is different
1801+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1802+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> do
1803+ invalidateMergeHeight m --TODO: In addition to when the patch is completely empty, we should also not run this if it has some Nothing values, but none of them have actually had any effect; potentially, we could even check for Just values with no effect (e.g. by comparing their IORefs and ignoring them if they are unchanged); actually, we could just check if the new height is different
24051804 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24061805 unsubscribe subscription
24071806 mapM_ invalidateCoincidenceHeight mcs
24081807 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
2409− mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
1808+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> revalidateMergeHeight m
24101809 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
24111810 height <- calculateSwitchHeight subscribed
24121811 updateSwitchHeight height subscribed
@@ -2436,12 +1835,50 @@ succHeight h@(Height a) =
24361835 then invalidHeight
24371836 else Height $ succ a
24381837
1838+removeMergeHeight :: Height -> MergeSubscribed x k -> IO ()
1839+removeMergeHeight oldParentHeight subscribed = do
1840+ when debugInvalidateHeight $ putStrLn $ "removeMergeHeight: " <> show oldParentHeight <> " Merge" <> showNodeId subscribed
1841+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1842+ let newHeights = heightBagRemove oldParentHeight oldHeights
1843+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1844+
1845+invalidateMergeHeight :: MergeSubscribed x k -> IO ()
1846+invalidateMergeHeight subscribed = do
1847+ oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1848+ -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1849+ when (oldHeight /= invalidHeight) $ do
1850+ writeIORef (mergeSubscribedHeight subscribed) $! invalidHeight
1851+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1852+
1853+addMergeHeight :: Height -> MergeSubscribed x k -> IO ()
1854+addMergeHeight newParentHeight subscribed = do
1855+ when debugInvalidateHeight $ putStrLn $ "addMergeHeight: " <> show newParentHeight <> " Merge" <> showNodeId subscribed
1856+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1857+ let newHeights = heightBagAdd newParentHeight oldHeights
1858+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1859+
1860+revalidateMergeHeight :: MergeSubscribed x k -> IO ()
1861+revalidateMergeHeight subscribed = do
1862+ currentHeight <- readIORef $ mergeSubscribedHeight subscribed
1863+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1864+ heights <- readIORef $ mergeSubscribedHeightBag subscribed
1865+ parents <- readIORef $ mergeSubscribedParents subscribed
1866+ -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1867+ case heightBagSize heights `compare` DMap.size parents of
1868+ LT -> return ()
1869+ EQ -> do
1870+ let height = succHeight $ heightBagMax heights
1871+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1872+ writeIORef (mergeSubscribedHeight subscribed) $! height
1873+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1874+ GT -> error $ "revalidateMergeHeight: more heights than parents for Merge" <> showNodeId subscribed
1875+
24391876invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
24401877invalidateCoincidenceHeight subscribed = do
24411878 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24421879 when (oldHeight /= invalidHeight) $ do
24431880 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1881+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
24451882
24461883updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
24471884updateSwitchHeight new subscribed = do
@@ -2449,7 +1886,7 @@ updateSwitchHeight new subscribed = do
24491886 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24501887 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24511888 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1889+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24531890
24541891recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
24551892recalculateCoincidenceHeight subscribed = do
@@ -2458,7 +1895,7 @@ recalculateCoincidenceHeight subscribed = do
24581895 height <- calculateCoincidenceHeight subscribed
24591896 when (height /= invalidHeight) $ do
24601897 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1898+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
24621899
24631900calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
24641901calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
@@ -2497,170 +1934,183 @@ invalidate toReconnectRef wis = do
24971934-- Reflex integration
24981935--------------------------------------------------------------------------------
24991936
1937+-- | The default, global Spider environment
1938+type Spider = SpiderTimeline Global
1939+
25001940-- | Designates the default, global Spider timeline
2501−data SpiderTimeline x
1941+data Global
1942+
1943+{-# NOINLINE globalSpiderTimeline #-}
1944+globalSpiderTimeline :: SpiderTimeline Global
1945+globalSpiderTimeline = unsafePerformIO unsafeNewSpiderTimeline
1946+
1947+-- | Stores all global data relevant to a particular Spider timeline; only one
1948+-- value should exist for each type @x@
1949+data SpiderTimeline x = SpiderTimeline
1950+ { _spiderTimeline_toUnsubscribe :: !(IORef [SomeEventSubscription x])
1951+ , _spiderTimeline_lock :: !(MVar ())
1952+ , _spiderTimeline_cleanups :: !(IORef [IO ()])
1953+#ifdef DEBUG
1954+ , _spiderTimeline_depth :: !(IORef Int)
1955+#endif
1956+ }
25021957type role SpiderTimeline nominal
25031958
2504−-- | The default, global Spider environment
2505−type Spider = SpiderTimeline Global
1959+instance GEq SpiderTimeline where
1960+ a `geq` b = if _spiderTimeline_lock a == _spiderTimeline_lock b
1961+ then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderTimeline can't have two different 'x' arguments
1962+ else Nothing
25061963
2507−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
2508− {-# INLINABLE sample #-}
2509− sample (SpiderBehavior b) = readBehaviorUntracked b
1964+unsafeNewSpiderTimeline :: forall x. IO (SpiderTimeline x)
1965+unsafeNewSpiderTimeline = do
1966+ toUnsubscribe <- newIORef []
1967+ lock <- newMVar ()
1968+ cleanups <- newIORef []
1969+#ifdef DEBUG
1970+ depthRef <- newIORef 0
1971+#endif
1972+ return $ SpiderTimeline
1973+ { _spiderTimeline_toUnsubscribe = toUnsubscribe
1974+ , _spiderTimeline_lock = lock
1975+ , _spiderTimeline_cleanups = cleanups
1976+#ifdef DEBUG
1977+ , _spiderTimeline_depth = depthRef
1978+#endif
1979+ }
25101980
2511−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (EventM x) where
2512− {-# INLINABLE hold #-}
2513− hold = holdSpiderEventM
2514− {-# INLINABLE holdDyn #-}
2515− holdDyn = holdDynSpiderEventM
2516− {-# INLINABLE holdIncremental #-}
2517− holdIncremental = holdIncrementalSpiderEventM
2518− {-# INLINABLE buildDynamic #-}
2519− buildDynamic = buildDynamicSpiderEventM
2520− {-# INLINABLE headE #-}
2521− headE = R.slowHeadE
2522−-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
2523− {-# INLINABLE now #-}
2524− now = nowSpiderEventM
2525−
2526−instance Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
2527− {-# INLINABLE sample #-}
2528− sample = coerce . readBehaviorTracked . unSpiderBehavior
1981+-- | Create a new SpiderTimeline
1982+newSpiderTimeline :: IO (Some SpiderTimeline)
1983+newSpiderTimeline = withSpiderTimeline (pure . Some.This)
25291984
2530−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531− {-# INLINABLE sample #-}
2532− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
1985+-- | Pass a new timeline to the given function.
1986+withSpiderTimeline :: (forall x. SpiderTimeline x -> IO r) -> IO r
1987+withSpiderTimeline k = unsafeNewSpiderTimeline >>= k
25331988
2534−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderPushM x) where
2535− {-# INLINABLE hold #-}
2536− hold v0 e = Reflex.Class.current <$> Reflex.Class.holdDyn v0 e
2537− {-# INLINABLE holdDyn #-}
2538− holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce e
2539− {-# INLINABLE holdIncremental #-}
2540− holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . dynamicHold <$> Reflex.Spider.Internal.hold v0 e
2541− {-# INLINABLE buildDynamic #-}
2542− buildDynamic getV0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce e
2543− {-# INLINABLE headE #-}
2544− headE = R.slowHeadE
2545−-- headE (SpiderEvent e) = SpiderPushM $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2546− {-# INLINABLE now #-}
2547− now = SpiderPushM nowSpiderEventM
1989+newtype SpiderPullM x a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1990+
1991+newtype SpiderPushM x a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
25481992
1993+instance Functor (R.Dynamic (SpiderTimeline x)) where
1994+ fmap f = SpiderDynamic . newMapDyn f . unSpiderDynamic
25491995
2550−instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
1996+instance Applicative (R.Dynamic (SpiderTimeline x)) where
1997+ pure = SpiderDynamic . dynamicConst
1998+ SpiderDynamic a <*> SpiderDynamic b = SpiderDynamic $ zipDynWith ($) a b
1999+ _ *> b = b
2000+ a <* _ = a
2001+
2002+instance Monad (R.Dynamic (SpiderTimeline x)) where
25512003 {-# INLINE return #-}
25522004 return = pure
25532005 {-# INLINE (>>=) #-}
25542006 x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
25552007 {-# INLINE (>>) #-}
2556− (>>) = (*>)
2557−#if !MIN_VERSION_base(4,13,0)
2008+ _ >> y = y
25582009 {-# INLINE fail #-}
25592010 fail _ = error "Dynamic does not support 'fail'"
2560−#endif
25612011
2562−{-# INLINABLE newJoinDyn #-}
2563−newJoinDyn :: HasSpiderTimeline x => DynamicS x (Identity (DynamicS x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
2564−newJoinDyn d =
2565− let readV0 = readBehaviorTracked . dynamicCurrent =<< readBehaviorTracked (dynamicCurrent d)
2566− eOuter = Reflex.Spider.Internal.push (fmap (Just . Identity) . readBehaviorUntracked . dynamicCurrent . runIdentity) $ dynamicUpdated d
2567− eInner = Reflex.Spider.Internal.switch $ dynamicUpdated <$> dynamicCurrent d
2568− eBoth = Reflex.Spider.Internal.coincidence $ dynamicUpdated . runIdentity <$> dynamicUpdated d
2569− v' = unSpiderEvent $ Reflex.Class.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
2570− in Reflex.Spider.Internal.unsafeBuildDynamic readV0 v'
2571−
2572−instance HasSpiderTimeline x => Functor (Reflex.Class.Dynamic (SpiderTimeline x)) where
2573− fmap = mapDynamicSpider
2574− x <$ d = R.unsafeBuildDynamic (return x) $ x <$ R.updated d
2575−
2576−mapDynamicSpider :: HasSpiderTimeline x => (a -> b) -> Reflex.Class.Dynamic (SpiderTimeline x) a -> Reflex.Class.Dynamic (SpiderTimeline x) b
2577−mapDynamicSpider f = SpiderDynamic . newMapDyn f . unSpiderDynamic
2578−{-# INLINE [1] mapDynamicSpider #-}
2012+instance R.Reflex (SpiderTimeline x) where
2013+ newtype Behavior (SpiderTimeline x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
2014+ newtype Event (SpiderTimeline x) a = SpiderEvent { unSpiderEvent :: Event x a }
2015+ newtype Dynamic (SpiderTimeline x) a = SpiderDynamic { unSpiderDynamic :: Dynamic x (Identity a) } -- deriving (Functor, Applicative, Monad)
2016+ newtype Incremental (SpiderTimeline x) p = SpiderIncremental { unSpiderIncremental :: Dynamic x p }
2017+ type PullM (SpiderTimeline x) = SpiderPullM x
2018+ type PushM (SpiderTimeline x) = SpiderPushM x
2019+ {-# INLINABLE never #-}
2020+ never = SpiderEvent eventNever
2021+ {-# INLINABLE constant #-}
2022+ constant = SpiderBehavior . behaviorConst
2023+ {-# INLINABLE push #-}
2024+ push f = SpiderEvent . push (coerce f) . unSpiderEvent
2025+ {-# INLINABLE pull #-}
2026+ pull = SpiderBehavior . pull . coerce
2027+ {-# INLINABLE merge #-}
2028+ merge = SpiderEvent . merge . dynamicConst . (coerce :: DMap k (R.Event (SpiderTimeline x)) -> DMap k (Event x))
2029+ {-# INLINABLE fan #-}
2030+ fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
2031+ {-# INLINABLE switch #-}
2032+ switch = SpiderEvent . switch . (coerce :: Behavior x (R.Event (SpiderTimeline x) a) -> Behavior x (Event x a)) . unSpiderBehavior
2033+ {-# INLINABLE coincidence #-}
2034+ coincidence = SpiderEvent . coincidence . (coerce :: Event x (R.Event (SpiderTimeline x) a) -> Event x (Event x a)) . unSpiderEvent
2035+ {-# INLINABLE current #-}
2036+ current = SpiderBehavior . dynamicCurrent . unSpiderDynamic
2037+ {-# INLINABLE updated #-}
2038+ updated = SpiderEvent . fmap runIdentity . dynamicUpdated . unSpiderDynamic
2039+ {-# INLINABLE unsafeBuildDynamic #-}
2040+ unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ unsafeDyn (coerce readV0) $ coerce $ unSpiderEvent v'
2041+ {-# INLINABLE unsafeBuildIncremental #-}
2042+ unsafeBuildIncremental readV0 dv = SpiderIncremental $ dynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
2043+ {-# INLINABLE mergeIncremental #-}
2044+ mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic x (R.PatchDMap k (R.Event (SpiderTimeline x))) -> Dynamic x (R.PatchDMap k (Event x))) . unSpiderIncremental
2045+ {-# INLINABLE currentIncremental #-}
2046+ currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
2047+ {-# INLINABLE updatedIncremental #-}
2048+ updatedIncremental = SpiderEvent . dynamicUpdated . unSpiderIncremental
2049+ {-# INLINABLE incrementalToDynamic #-}
2050+ incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ dynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ dynamicCurrent i) $ flip push (dynamicUpdated i) $ \p -> do
2051+ c <- readBehaviorUntracked $ dynamicCurrent i
2052+ return $ Identity <$> R.apply p c --TODO: Avoid the redundant 'apply'
2053+ eventCoercion Coercion = Coercion
2054+ behaviorCoercion Coercion = Coercion
2055+ dynamicCoercion = unsafeCoerce --TODO: How can we avoid this unsafeCoerce? This is safe only because we know how Identity works as a Patch instance
25792056
2580−instance HasSpiderTimeline x => Applicative (Reflex.Class.Dynamic (SpiderTimeline x)) where
2581− pure = SpiderDynamic . dynamicConst
2582−#if MIN_VERSION_base(4,10,0)
2583− liftA2 f a b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith f (unSpiderDynamic a) (unSpiderDynamic b)
2584−#endif
2585− SpiderDynamic a <*> SpiderDynamic b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith ($) a b
2586− a *> b = R.unsafeBuildDynamic (R.sample $ R.current b) $ R.leftmost [R.updated b, R.tag (R.current b) $ R.updated a]
2587− (<*) = flip (*>) -- There are no effects, so order doesn't matter
2057+instance R.MonadSample (SpiderTimeline x) (EventM x) where
2058+ {-# INLINABLE sample #-}
2059+ sample (SpiderBehavior b) = readBehaviorUntracked b
25882060
2589−holdSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Behavior (SpiderTimeline x) a)
2590−holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2061+instance R.MonadHold (SpiderTimeline x) (EventM x) where
2062+ {-# INLINABLE hold #-}
2063+ hold = holdSpiderEventM
2064+ {-# INLINABLE holdDyn #-}
2065+ holdDyn = holdDynSpiderEventM
2066+ {-# INLINABLE holdIncremental #-}
2067+ holdIncremental = holdIncrementalSpiderEventM
25912068
2592−holdDynSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2593−holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2069+holdSpiderEventM :: a -> R.Event (SpiderTimeline x) a -> EventM x (R.Behavior (SpiderTimeline x) a)
2070+holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ hold v0 $ coerce $ unSpiderEvent e
25942071
2595−holdIncrementalSpiderEventM :: (HasSpiderTimeline x, Patch p) => PatchTarget p -> Reflex.Class.Event (SpiderTimeline x) p -> EventM x (Reflex.Class.Incremental (SpiderTimeline x) p)
2596−holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2072+holdDynSpiderEventM :: a -> R.Event (SpiderTimeline x) a -> EventM x (R.Dynamic (SpiderTimeline x) a)
2073+holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ hold v0 $ coerce $ unSpiderEvent e
25972074
2598−buildDynamicSpiderEventM :: HasSpiderTimeline x => SpiderPushM x a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2599−buildDynamicSpiderEventM getV0 e = fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
2075+holdIncrementalSpiderEventM :: R.Patch p => R.PatchTarget p -> R.Event (SpiderTimeline x) p -> EventM x (R.Incremental (SpiderTimeline x) p)
2076+holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ hold v0 $ unSpiderEvent e
26002077
2601−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
2078+instance R.MonadHold (SpiderTimeline x) (SpiderHost x) where
26022079 {-# INLINABLE hold #-}
2603− hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
2080+ hold v0 e = R.runHostFrame $ R.hold v0 e
26042081 {-# INLINABLE holdDyn #-}
2605− holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
2082+ holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
26062083 {-# INLINABLE holdIncremental #-}
2607− holdIncremental v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdIncremental v0 e
2608− {-# INLINABLE buildDynamic #-}
2609− buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
2610− {-# INLINABLE headE #-}
2611− headE e = runFrame . runSpiderHostFrame $ Reflex.Class.headE e
2612− {-# INLINABLE now #-}
2613− now = runFrame . runSpiderHostFrame $ Reflex.Class.now
2614−
2615−
2616−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
2617− sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2084+ holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
26182085
2619−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2620− {-# INLINABLE hold #-}
2621− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2622− {-# INLINABLE holdDyn #-}
2623− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2624− {-# INLINABLE holdIncremental #-}
2625− holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2626− {-# INLINABLE buildDynamic #-}
2627− buildDynamic getV0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
2628− {-# INLINABLE headE #-}
2629− headE = R.slowHeadE
2630−-- headE (SpiderEvent e) = SpiderHostFrame $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2631− {-# INLINABLE now #-}
2632− now = SpiderHostFrame Reflex.Class.now
2633−
2634−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
2086+instance R.MonadSample (SpiderTimeline x) (SpiderHost x) where
26352087 {-# INLINABLE sample #-}
26362088 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
26372089
2638−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2090+instance R.MonadSample (SpiderTimeline x) (SpiderPullM x) where
26392091 {-# INLINABLE sample #-}
2640− sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
2092+ sample = coerce . readBehaviorTracked . unSpiderBehavior
26412093
2642−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2094+instance R.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2095+ {-# INLINABLE sample #-}
2096+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2097+
2098+instance R.MonadHold (SpiderTimeline x) (SpiderPushM x) where
26432099 {-# INLINABLE hold #-}
2644− hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
2100+ hold v0 e = R.current <$> R.holdDyn v0 e
26452101 {-# INLINABLE holdDyn #-}
2646− holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
2102+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicHoldIdentity) $ hold v0 $ coerce e
26472103 {-# INLINABLE holdIncremental #-}
2648− holdIncremental v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdIncremental v0 e
2649− {-# INLINABLE buildDynamic #-}
2650− buildDynamic getV0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.buildDynamic getV0 e
2651− {-# INLINABLE headE #-}
2652− headE e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.headE e
2653− {-# INLINABLE now #-}
2654− now = Reflex.Spider.Internal.ReadPhase Reflex.Class.now
2104+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . dynamicHold <$> hold v0 e
26552105
2656−--------------------------------------------------------------------------------
2657−-- Deprecated items
2658−--------------------------------------------------------------------------------
2106+data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
26592107
2660−-- | 'SpiderEnv' is the old name for 'SpiderTimeline'
2661−{-# DEPRECATED SpiderEnv "Use 'SpiderTimelineEnv' instead" #-}
2662−type SpiderEnv = SpiderTimeline
2663−instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHostFrame x) where
2108+data SpiderEventHandle x a = SpiderEventHandle
2109+ { spiderEventHandleSubscription :: EventSubscription x a
2110+ , spiderEventHandleValue :: IORef (Maybe a)
2111+ }
2112+
2113+instance R.MonadSubscribeEvent (SpiderTimeline x) (SpiderHostFrame x) where
26642114 {-# INLINABLE subscribeEvent #-}
26652115 subscribeEvent e = SpiderHostFrame $ do
26662116 --TODO: Unsubscribe eventually (manually and/or with weak ref)
@@ -2677,149 +2127,18 @@ instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTim
26772127 , spiderEventHandleValue = val
26782128 }
26792129
2680−instance HasSpiderTimeline x => Reflex.Host.Class.ReflexHost (SpiderTimeline x) where
2130+instance R.ReflexHost (SpiderTimeline x) where
26812131 type EventTrigger (SpiderTimeline x) = RootTrigger x
26822132 type EventHandle (SpiderTimeline x) = SpiderEventHandle x
26832133 type HostFrame (SpiderTimeline x) = SpiderHostFrame x
26842134
2685−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2135+instance R.MonadReadEvent (SpiderTimeline x) (ReadPhase x) where
26862136 {-# NOINLINE readEvent #-}
2687− readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
2137+ readEvent h = ReadPhase $ fmap (fmap return) $ liftIO $ do
26882138 result <- readIORef $ spiderEventHandleValue h
26892139 touch h
26902140 return result
26912141
2692−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
2693− newEventWithTrigger = SpiderHost . fmap SpiderEvent . newEventWithTriggerIO
2694− newFanEventWithTrigger f = SpiderHost $ do
2695− es <- newFanEventWithTriggerIO f
2696− return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
2697−
2698−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
2699− newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2700− newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2701− es <- newFanEventWithTriggerIO f
2702− return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
2703−
2704−instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHost x) where
2705− {-# INLINABLE subscribeEvent #-}
2706− subscribeEvent = runFrame . runSpiderHostFrame . Reflex.Host.Class.subscribeEvent
2707−
2708−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexHost (SpiderTimeline x) (SpiderHost x) where
2709− type ReadPhase (SpiderHost x) = Reflex.Spider.Internal.ReadPhase x
2710− fireEventsAndRead es (Reflex.Spider.Internal.ReadPhase a) = run es a
2711− runHostFrame = runFrame . runSpiderHostFrame
2712−
2713−unsafeNewSpiderTimelineEnv :: forall x. IO (SpiderTimelineEnv x)
2714−unsafeNewSpiderTimelineEnv = do
2715− lock <- newMVar ()
2716− env <- newEventEnv
2717−#ifdef DEBUG
2718− depthRef <- newIORef 0
2719−#endif
2720− return $ STE $ SpiderTimelineEnv
2721− { _spiderTimeline_lock = lock
2722− , _spiderTimeline_eventEnv = env
2723−#ifdef DEBUG
2724− , _spiderTimeline_depth = depthRef
2725−#endif
2726− }
2727−
2728−-- | Create a new SpiderTimelineEnv
2729−newSpiderTimeline :: IO (Some SpiderTimelineEnv)
2730−newSpiderTimeline = withSpiderTimeline (pure . Some)
2731−
2732−data LocalSpiderTimeline (x :: Type) s
2733−
2734−instance Reifies s (SpiderTimelineEnv x) =>
2735− HasSpiderTimeline (LocalSpiderTimeline x s) where
2736− spiderTimeline = localSpiderTimeline Proxy $ reflect (Proxy :: Proxy s)
2737−
2738−localSpiderTimeline
2739− :: proxy s
2740− -> SpiderTimelineEnv x
2741− -> SpiderTimelineEnv (LocalSpiderTimeline x s)
2742−localSpiderTimeline _ = coerce
2743−
2744−-- | Pass a new timeline to the given function.
2745−withSpiderTimeline :: (forall x. HasSpiderTimeline x => SpiderTimelineEnv x -> IO r) -> IO r
2746−withSpiderTimeline k = do
2747− env <- unsafeNewSpiderTimelineEnv
2748− reify env $ \s -> k $ localSpiderTimeline s env
2749−
2750−newtype SpiderPullM (x :: Type) a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2751−
2752−type ComputeM = EventM
2753−
2754−newtype SpiderPushM (x :: Type) a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2755−
2756−instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
2757− {-# SPECIALIZE instance R.Reflex (SpiderTimeline Global) #-}
2758− newtype Behavior (SpiderTimeline x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
2759− newtype Event (SpiderTimeline x) a = SpiderEvent { unSpiderEvent :: Event x a }
2760− newtype Dynamic (SpiderTimeline x) a = SpiderDynamic { unSpiderDynamic :: DynamicS x (Identity a) } -- deriving (Functor, Applicative, Monad)
2761− newtype Incremental (SpiderTimeline x) p = SpiderIncremental { unSpiderIncremental :: DynamicS x p }
2762− type PullM (SpiderTimeline x) = SpiderPullM x
2763− type PushM (SpiderTimeline x) = SpiderPushM x
2764− {-# INLINABLE never #-}
2765− never = SpiderEvent eventNever
2766− {-# INLINABLE constant #-}
2767− constant = SpiderBehavior . behaviorConst
2768− {-# INLINE push #-}
2769− push f = SpiderEvent . push (coerce f) . unSpiderEvent
2770− {-# INLINE pushCheap #-}
2771− pushCheap f = SpiderEvent . pushCheap (coerce f) . unSpiderEvent
2772− {-# INLINABLE pull #-}
2773− pull = SpiderBehavior . pull . coerce
2774− {-# INLINABLE fanG #-}
2775− fanG e = R.EventSelectorG $ SpiderEvent . selectG (fanG (unSpiderEvent e))
2776− {-# INLINABLE mergeG #-}
2777− mergeG
2778− :: forall k2 (k :: k2 -> *) q (v :: k2 -> *). GCompare k
2779− => (forall a. q a -> R.Event (SpiderTimeline x) (v a))
2780− -> DMap k q
2781− -> R.Event (SpiderTimeline x) (DMap k v)
2782− mergeG nt = SpiderEvent . mergeG (unSpiderEvent #. nt) . dynamicConst
2783− {-# INLINABLE switch #-}
2784− switch = SpiderEvent . switch . (coerce :: Behavior x (R.Event (SpiderTimeline x) a) -> Behavior x (Event x a)) . unSpiderBehavior
2785− {-# INLINABLE coincidence #-}
2786− coincidence = SpiderEvent . coincidence . (coerce :: Event x (R.Event (SpiderTimeline x) a) -> Event x (Event x a)) . unSpiderEvent
2787− {-# INLINABLE current #-}
2788− current = SpiderBehavior . dynamicCurrent . unSpiderDynamic
2789− {-# INLINABLE updated #-}
2790− updated = SpiderEvent #. dynamicUpdated .# fmap coerce . unSpiderDynamic
2791− {-# INLINABLE unsafeBuildDynamic #-}
2792− unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ unsafeBuildDynamic (coerce readV0) $ coerce $ unSpiderEvent v'
2793− {-# INLINABLE unsafeBuildIncremental #-}
2794− unsafeBuildIncremental readV0 dv = SpiderIncremental $ dynamicDyn $ unsafeBuildDynamic (coerce readV0) $ unSpiderEvent dv
2795− {-# INLINABLE mergeIncrementalG #-}
2796− mergeIncrementalG nt = SpiderEvent #. mergeG (coerce #. nt) .# unSpiderIncremental
2797− {-# INLINABLE mergeIncrementalWithMoveG #-}
2798− mergeIncrementalWithMoveG nt = SpiderEvent #. mergeWithMove (coerce #. nt) .# unSpiderIncremental
2799− {-# INLINABLE currentIncremental #-}
2800− currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
2801− {-# INLINABLE updatedIncremental #-}
2802− updatedIncremental = SpiderEvent . dynamicUpdated . unSpiderIncremental
2803− {-# INLINABLE incrementalToDynamic #-}
2804− incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ dynamicDynIdentity $ unsafeBuildDynamic (readBehaviorUntracked $ dynamicCurrent i) $ flip push (dynamicUpdated i) $ \p -> do
2805− c <- readBehaviorUntracked $ dynamicCurrent i
2806− return $ Identity <$> apply p c --TODO: Avoid the redundant 'apply'
2807− eventCoercion Coercion = Coercion
2808− behaviorCoercion Coercion = Coercion
2809− dynamicCoercion Coercion = Coercion
2810− incrementalCoercion Coercion Coercion = Coercion
2811− {-# INLINABLE mergeIntIncremental #-}
2812− mergeIntIncremental = SpiderEvent . mergeInt . coerce
2813− {-# INLINABLE fanInt #-}
2814− fanInt e = R.EventSelectorInt $ SpiderEvent . selectInt (fanInt (unSpiderEvent e))
2815−
2816−data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
2817−
2818−data SpiderEventHandle x a = SpiderEventHandle
2819− { spiderEventHandleSubscription :: EventSubscription x
2820− , spiderEventHandleValue :: IORef (Maybe a)
2821− }
2822−
28232142instance MonadRef (EventM x) where
28242143 type Ref (EventM x) = Ref IO
28252144 {-# INLINABLE newRef #-}
@@ -2834,7 +2153,7 @@ instance MonadAtomicRef (EventM x) where
28342153 atomicModifyRef r f = liftIO $ atomicModifyRef r f
28352154
28362155-- | The monad for actions that manipulate a Spider timeline identified by @x@
2837−newtype SpiderHost (x :: Type) a = SpiderHost { unSpiderHost :: IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2156+newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderTimeline x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28382157
28392158instance Monad (SpiderHost x) where
28402159 {-# INLINABLE (>>=) #-}
@@ -2843,27 +2162,20 @@ instance Monad (SpiderHost x) where
28432162 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442163 {-# INLINABLE return #-}
28452164 return x = SpiderHost $ return x
2846−#if !MIN_VERSION_base(4,13,0)
28472165 {-# INLINABLE fail #-}
2848− fail = MonadFail.fail
2849−#endif
2850−
2851−instance MonadFail (SpiderHost x) where
2852− {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2166+ fail s = SpiderHost $ fail s
28542167
28552168-- | Run an action affecting the global Spider timeline; this will be guarded by
28562169-- a mutex for that timeline
28572170runSpiderHost :: SpiderHost Global a -> IO a
2858−runSpiderHost (SpiderHost a) = a
2171+runSpiderHost (SpiderHost a) = runReaderT a globalSpiderTimeline
28592172
28602173-- | Run an action affecting a given Spider timeline; this will be guarded by a
28612174-- mutex for that timeline
2862−runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimelineEnv x -> IO a
2863−runSpiderHostForTimeline (SpiderHost a) _ = a
2175+runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimeline x -> IO a
2176+runSpiderHostForTimeline (SpiderHost a) = runReaderT a
28642177
2865−newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866− deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2178+newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28672179
28682180instance Monad (SpiderHostFrame x) where
28692181 {-# INLINABLE (>>=) #-}
@@ -2872,21 +2184,26 @@ instance Monad (SpiderHostFrame x) where
28722184 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732185 {-# INLINABLE return #-}
28742186 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762187 {-# INLINABLE fail #-}
28772188 fail s = SpiderHostFrame $ fail s
2878−#endif
28792189
2880−instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2881− notReadyUntil _ = pure ()
2882− notReady = pure ()
2190+instance R.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
2191+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2192+
2193+instance R.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2194+ {-# INLINABLE hold #-}
2195+ hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ hold v0 $ coerce $ unSpiderEvent e
2196+ {-# INLINABLE holdDyn #-}
2197+ holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ hold v0 $ coerce $ unSpiderEvent e
2198+ {-# INLINABLE holdIncremental #-}
2199+ holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ hold v0 $ unSpiderEvent e
28832200
2884−newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2201+newEventWithTriggerIO :: (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
28852202newEventWithTriggerIO f = do
28862203 es <- newFanEventWithTriggerIO $ \Refl -> f
28872204 return $ select es Refl
28882205
2889−newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2206+newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
28902207newFanEventWithTriggerIO f = do
28912208 occRef <- newIORef DMap.empty
28922209 subscribedRef <- newIORef DMap.empty
@@ -2897,8 +2214,41 @@ newFanEventWithTriggerIO f = do
28972214 }
28982215 return $ EventSelector $ \k -> eventRoot k r
28992216
2217+instance R.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
2218+ newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
2219+ newFanEventWithTrigger f = SpiderHost $ lift $ do
2220+ es <- newFanEventWithTriggerIO f
2221+ return $ R.EventSelector $ SpiderEvent . select es
2222+
2223+instance R.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
2224+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2225+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2226+ es <- newFanEventWithTriggerIO f
2227+ return $ R.EventSelector $ SpiderEvent . select es
2228+
2229+instance R.MonadSubscribeEvent (SpiderTimeline x) (SpiderHost x) where
2230+ {-# INLINABLE subscribeEvent #-}
2231+ subscribeEvent = runFrame . runSpiderHostFrame . R.subscribeEvent
2232+
29002233newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
29012234
2235+instance R.MonadSample (SpiderTimeline x) (ReadPhase x) where
2236+ {-# INLINABLE sample #-}
2237+ sample = ReadPhase . R.sample
2238+
2239+instance R.MonadHold (SpiderTimeline x) (ReadPhase x) where
2240+ {-# INLINABLE hold #-}
2241+ hold v0 e = ReadPhase $ R.hold v0 e
2242+ {-# INLINABLE holdDyn #-}
2243+ holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2244+ {-# INLINABLE holdIncremental #-}
2245+ holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2246+
2247+instance R.MonadReflexHost (SpiderTimeline x) (SpiderHost x) where
2248+ type ReadPhase (SpiderHost x) = ReadPhase x
2249+ fireEventsAndRead es (ReadPhase a) = run es a
2250+ runHostFrame = runFrame . runSpiderHostFrame
2251+
29022252instance MonadRef (SpiderHost x) where
29032253 type Ref (SpiderHost x) = Ref IO
29042254 newRef = SpiderHost . newRef
@@ -2921,10 +2271,9 @@ instance PrimMonad (SpiderHostFrame x) where
29212271 type PrimState (SpiderHostFrame x) = PrimState IO
29222272 primitive = SpiderHostFrame . EventM . primitive
29232273
2924−instance NotReady (SpiderTimeline x) (SpiderHost x) where
2925− notReadyUntil _ = return ()
2926− notReady = return ()
2274+--------------------------------------------------------------------------------
2275+-- Deprecated items
2276+--------------------------------------------------------------------------------
29272277
2928−instance HasSpiderTimeline x => NotReady (SpiderTimeline x) (PerformEventT (SpiderTimeline x) (SpiderHost x)) where
2929− notReadyUntil _ = return ()
2930− notReady = return ()
2278+{-# DEPRECATED SpiderEnv "Use 'SpiderTimeline' instead" #-}
2279+type SpiderEnv = SpiderTimeline