@@ -9,125 +9,65 @@
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 #-}
28−-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
29−-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
30−module Reflex.Spider.Internal (module Reflex.Spider.Internal) where
21+module Reflex.Spider.Internal (Spider, SpiderEnv (..), Global, SpiderHost, runSpiderHost, SpiderEventHandle (..), showSubscriberType, showEventType, ComputeM (..), MergeSubscribedParent (..), HasSpiderEnv (..), newSpiderEnv, SpiderPullM (..), SpiderPushM (..), ReadPhase (..)) where
3122
32−#if MIN_VERSION_base(4,10,0)
33−import Control.Applicative (liftA2)
34−#endif
23+import Control.Applicative
3524import Control.Concurrent
3625import Control.Exception
37−import Control.Monad hiding (forM, forM_, mapM, mapM_)
26+import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
3827import Control.Monad.Exception
39−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
28+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
4029import Control.Monad.Primitive
41−import Control.Monad.Reader.Class
42−import Control.Monad.IO.Class
43−import Control.Monad.ReaderIO
30+import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
4431import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
46−import qualified Control.Monad.Fail as MonadFail
32+import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
4733import Data.Align
4834import Data.Coerce
49−import Data.Dependent.Map (DMap)
35+import Data.Dependent.Map (DMap, DSum (..))
5036import 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
5437import Data.Foldable hiding (concat, elem, sequence_)
55−import Data.Functor.Constant
56−import Data.Functor.Misc
57−import Data.Functor.Product
38+import Data.Function
39+import Data.Functor.Compose
5840import Data.GADT.Compare
5941import Data.IntMap.Strict (IntMap)
6042import qualified Data.IntMap.Strict as IntMap
6143import Data.IORef
62−import Data.Kind (Type)
63−import Data.Maybe hiding (mapMaybe)
44+import Data.List hiding (foldl')
45+import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
46+import qualified Data.List.NonEmpty as NonEmpty
47+import Data.Maybe
6448import Data.Monoid (mempty, (<>))
65−import Data.Proxy
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.Tree (Forest, Tree (..), drawForest)
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−
87−#ifdef DEBUG_CYCLES
88−import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89−#endif
90−
91−import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
92−import qualified Data.List.NonEmpty as NonEmpty
93−import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
95−
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
97−import qualified Data.FastWeakBag as FastWeakBag
98−
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)
61+import Data.WeakBag (WeakBag, WeakBagTicket)
10462import qualified Data.WeakBag as WeakBag
105−import qualified Reflex.Class
10663import 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
118−
119−-- TODO stdout might not be the best channel for debug output
120−debugStrLn :: String -> IO ()
121−debugStrLn = putStrLn
64+import qualified Reflex.Host.Class as R
12265
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"
66+-- Note: must come last to silence warnings due to AMP on GHC < 7.10
67+import Prelude hiding (any, concat, mapM, mapM_, sequence)
12968
130−#endif
69+type SubscriberList a = WeakBag (Subscriber a)
70+type SubscriberListTicket a = WeakBagTicket (Subscriber a)
13171
13272debugPropagate :: Bool
13373
@@ -136,65 +76,52 @@ debugInvalidateHeight :: Bool
13676debugInvalidate :: Bool
13777
13878#ifdef DEBUG
79+
13980#define DEBUG_NODEIDS
14081
141−#ifdef DEBUG_TRACE_PROPAGATION
14282debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
14683
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
15084debugInvalidateHeight = False
151−#endif
15285
153−#ifdef DEBUG_TRACE_INVALIDATION
15486debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
15887
15988class HasNodeId a where
16089 getNodeId :: a -> Int
16190
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
91+instance HasNodeId (Hold p a) where
16992 getNodeId = holdNodeId
17093
171−instance HasNodeId (SwitchSubscribed x a) where
94+instance HasNodeId (PushSubscribed a b) where
95+ getNodeId = pushSubscribedNodeId
96+
97+instance HasNodeId (SwitchSubscribed a) where
17298 getNodeId = switchSubscribedNodeId
17399
174−instance HasNodeId (FanSubscribed x v a) where
100+instance HasNodeId (MergeSubscribed a) where
101+ getNodeId = mergeSubscribedNodeId
102+
103+instance HasNodeId (FanSubscribed a) where
175104 getNodeId = fanSubscribedNodeId
176105
177−instance HasNodeId (CoincidenceSubscribed x a) where
106+instance HasNodeId (CoincidenceSubscribed a) where
178107 getNodeId = coincidenceSubscribedNodeId
179108
180−instance HasNodeId (RootSubscribed x a) where
109+instance HasNodeId (RootSubscribed a) where
181110 getNodeId = rootSubscribedNodeId
182111
183−instance HasNodeId (Pull x a) where
112+instance HasNodeId (Pull a) where
184113 getNodeId = pullNodeId
185114
186115{-# INLINE showNodeId #-}
187116showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
192−
117+showNodeId = ("#"<>) . show . getNodeId
193118
194119#else
195120
196121debugPropagate = False
122+
197123debugInvalidateHeight = False
124+
198125debugInvalidate = False
199126
200127-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -202,10 +129,6 @@ debugInvalidate = False
202129showNodeId :: a -> String
203130showNodeId _ = ""
204131
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209132#endif
210133
211134#ifdef DEBUG_NODEIDS
@@ -215,637 +138,41 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
215138
216139newNodeId :: IO Int
217140newNodeId = 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− }
230−
231−unsubscribe :: EventSubscription x -> IO ()
232−unsubscribe (EventSubscription u _) = u
233141
234−--------------------------------------------------------------------------------
235−-- Event
236−--------------------------------------------------------------------------------
237−
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
142+{-# NOINLINE unsafeNodeId #-}
143+unsafeNodeId :: a -> Int
144+unsafeNodeId a = unsafePerformIO $ do
145+ touch a
146+ newNodeId
307147#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−
412−
413−subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
414−subscribe e s = fst <$> subscribeAndRead e s
415−
416−{-# 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)
418−wrap tag getSpecificSubscribed sub = do
419− (sln, subd, occ) <- getSpecificSubscribed sub
420− let es = tag subd
421− return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
422−
423−eventRoot :: (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Event x a
424−eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
425−
426−subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427−subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428−
429−eventNever :: Event x a
430−eventNever = Event $ const subscribeAndReadNever
431−
432−eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
433−eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
434−
435−eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
436−eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
437−
438−eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
439−eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
440−
441−eventHold :: Hold x p -> Event x p
442−eventHold !h = Event $ subscribeHoldEvent h
443−
444−eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
445−eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
446−
447−{-# INLINE subscribeCoincidenceInner #-}
448−subscribeCoincidenceInner :: HasSpiderTimeline x => Event x a -> Height -> CoincidenceSubscribed x a -> EventM x (Maybe a, Height, EventSubscribed x)
449−subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
450− subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
451− (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
452− innerHeight <- liftIO $ getEventSubscribedHeight innerSubd
453− let height = max innerHeight outerHeight
454− defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
455− return (innerOcc, height, innerSubd)
456−
457−--------------------------------------------------------------------------------
458−-- Subscriber
459−--------------------------------------------------------------------------------
460−
461−data Subscriber x a = Subscriber
462− { subscriberPropagate :: !(a -> EventM x ())
463− , subscriberInvalidateHeight :: !(Height -> IO ())
464− , subscriberRecalculateHeight :: !(Height -> IO ())
465− }
466−
467−newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
468−newSubscriberHold h = return $ Subscriber
469− { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
470− , subscriberInvalidateHeight = \_ -> return ()
471− , subscriberRecalculateHeight = \_ -> return ()
472− }
473−
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
476− { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
477− subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
478− tracePropagate (Proxy :: Proxy x) $ show (DMap.size subs) <> " keys subscribed, " <> show (DMap.size a) <> " keys firing"
479− liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
480− scheduleClear $ fanSubscribedOccurrence subscribed
481− let f _ (Pair v subsubs) = do
482− propagate v $ _fanSubscribedChildren_list subsubs
483− return $ Constant ()
484− _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
485− return ()
486− , subscriberInvalidateHeight = \old -> do
487− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
489− , subscriberRecalculateHeight = \new -> do
490− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
492− }
493−
494−newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495−newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
496− { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
497− liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
498− scheduleClear $ switchSubscribedOccurrence subscribed
499− propagate a $ switchSubscribedSubscribers subscribed
500− , subscriberInvalidateHeight = \_ -> do
501− oldHeight <- readIORef $ switchSubscribedHeight subscribed
502− when (oldHeight /= invalidHeight) $ do
503− writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505− , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506− }
507−
508−newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
509−newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
510− { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
511− outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
512− tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
513− (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−
517− liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518− scheduleClear $ coincidenceSubscribedInnerParent subscribed
519− case occ of
520− Nothing ->
521− when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522− writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525− Just o -> do -- Since it's already firing, no need to adjust height
526− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527− scheduleClear $ coincidenceSubscribedOccurrence subscribed
528− propagate o $ coincidenceSubscribedSubscribers subscribed
529− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
531− }
532−
533−newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
534−newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoincidenceInner" <> showNodeId subscribed) $ Subscriber
535− { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
536− occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
537− case occ of
538− Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
539− Nothing -> do
540− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
541− scheduleClear $ coincidenceSubscribedOccurrence subscribed
542− propagate a $ coincidenceSubscribedSubscribers subscribed
543− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
545− }
546−
547−invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
548−invalidateSubscriberHeight = flip subscriberInvalidateHeight
549−
550−recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551−recalculateSubscriberHeight = flip subscriberRecalculateHeight
552−
553−-- | 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) $
563− -- 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
564− --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
566−
567−--------------------------------------------------------------------------------
568−-- EventSubscribed
569−--------------------------------------------------------------------------------
570−
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
580− { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581− , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
582−#ifdef DEBUG_CYCLES
583− , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
584− , eventSubscribedHasOwnHeightRef :: !Bool
585− , eventSubscribedWhoCreated :: !(IO [String])
586−#endif
587− }
588−
589−eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x
590−eventSubscribedRoot !r = EventSubscribed
591− { eventSubscribedHeightRef = zeroRef
592− , eventSubscribedRetained = toAny r
593−#ifdef DEBUG_CYCLES
594− , eventSubscribedGetParents = return []
595− , eventSubscribedHasOwnHeightRef = False
596− , eventSubscribedWhoCreated = return ["root"]
597−#endif
598− }
599−
600−eventSubscribedNever :: EventSubscribed x
601−eventSubscribedNever = EventSubscribed
602− { eventSubscribedHeightRef = zeroRef
603− , eventSubscribedRetained = toAny ()
604−#ifdef DEBUG_CYCLES
605− , eventSubscribedGetParents = return []
606− , eventSubscribedHasOwnHeightRef = False
607− , eventSubscribedWhoCreated = return ["never"]
608−#endif
609− }
610−eventSubscribedNow :: EventSubscribed x
611−eventSubscribedNow = EventSubscribed
612− { eventSubscribedHeightRef = zeroRef
613− , eventSubscribedRetained = toAny ()
614−#ifdef DEBUG_CYCLES
615− , eventSubscribedGetParents = return []
616− , eventSubscribedHasOwnHeightRef = False
617− , eventSubscribedWhoCreated = return ["now"]
618−#endif
619− }
620−
621−eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
622−eventSubscribedFan !subscribed = EventSubscribed
623− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624− , eventSubscribedRetained = toAny subscribed
625−#ifdef DEBUG_CYCLES
626− , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
627− , eventSubscribedHasOwnHeightRef = False
628− , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
629−#endif
630− }
631−
632−eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x
633−eventSubscribedSwitch !subscribed = EventSubscribed
634− { eventSubscribedHeightRef = switchSubscribedHeight subscribed
635− , eventSubscribedRetained = toAny subscribed
636−#ifdef DEBUG_CYCLES
637− , eventSubscribedGetParents = do
638− s <- readIORef $ switchSubscribedCurrentParent subscribed
639− return [_eventSubscription_subscribed s]
640− , eventSubscribedHasOwnHeightRef = True
641− , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
642−#endif
643− }
644−
645−eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x
646−eventSubscribedCoincidence !subscribed = EventSubscribed
647− { eventSubscribedHeightRef = coincidenceSubscribedHeight subscribed
648− , eventSubscribedRetained = toAny subscribed
649−#ifdef DEBUG_CYCLES
650− , eventSubscribedGetParents = do
651− innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
652− let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653− innerParents = maybeToList $ innerSubscription
654− return $ outerParent : innerParents
655− , eventSubscribedHasOwnHeightRef = True
656− , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
657−#endif
658− }
659−
660−getEventSubscribedHeight :: EventSubscribed x -> IO Height
661−getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
662−
663−#ifdef DEBUG_CYCLES
664−whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
665−whoCreatedEventSubscribed = eventSubscribedWhoCreated
666−
667−walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
668−walkInvalidHeightParents s0 = do
669− subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
670− h <- liftIO $ readIORef $ eventSubscribedHeightRef s
671− when (h == invalidHeight) $ do
672− when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
673− modify (s :)
674− mapM_ loop =<< liftIO (eventSubscribedGetParents s)
675− forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
676− return subscribers
677−#endif
678−
679−{-# INLINE subscribeHoldEvent #-}
680−subscribeHoldEvent :: Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
681−subscribeHoldEvent = subscribeAndRead . holdEvent
682−
683−--------------------------------------------------------------------------------
684−-- Behavior
685−--------------------------------------------------------------------------------
686−
687−newtype Behavior x a = Behavior { readBehaviorTracked :: BehaviorM x a }
688−
689−behaviorHold :: Hold x p -> Behavior x (PatchTarget p)
690−behaviorHold !h = Behavior $ readHoldTracked h
691−
692−behaviorHoldIdentity :: Hold x (Identity a) -> Behavior x a
693−behaviorHoldIdentity = behaviorHold
694−
695−behaviorConst :: a -> Behavior x a
696−behaviorConst !a = Behavior $ return a
697−
698−behaviorPull :: Pull x a -> Behavior x a
699−behaviorPull !p = Behavior $ do
700− val <- liftIO $ readIORef $ pullValue p
701− case val of
702− Just subscribed -> do
703− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
704− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
705− liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
706− return $ pullSubscribedValue subscribed
707− Nothing -> do
708− i <- liftIO $ newInvalidatorPull p
709− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
710− parentsRef <- liftIO $ newIORef []
711− holdInits <- askBehaviorHoldInits
712− a <- liftIO $ runReaderIO (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
713− invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
714− parents <- liftIO $ readIORef parentsRef
715− let subscribed = PullSubscribed
716− { pullSubscribedValue = a
717− , pullSubscribedInvalidators = invsRef
718− , pullSubscribedOwnInvalidator = i
719− , pullSubscribedParents = parents
720− }
721− liftIO $ writeIORef (pullValue p) $ Just subscribed
722− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
723− return a
724−
725−behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
726−behaviorDyn !d = Behavior $ readHoldTracked =<< getDynHold d
727−
728−{-# INLINE readHoldTracked #-}
729−readHoldTracked :: Hold x p -> BehaviorM x (PatchTarget p)
730−readHoldTracked h = do
731− result <- liftIO $ readIORef $ holdValue h
732− 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
735− return result
736−
737−{-# INLINABLE readBehaviorUntracked #-}
738−readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
739−readBehaviorUntracked b = do
740− holdInits <- getDeferralQueue
741− liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
742−
743−--------------------------------------------------------------------------------
744−-- Dynamic
745−--------------------------------------------------------------------------------
746−
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`?
752− }
753−
754−deriving instance (HasSpiderTimeline x) => Functor (Dynamic x target)
755−
756−
757−
758−
759−dynamicHold :: Hold x p -> DynamicS x p
760−dynamicHold !h = Dynamic
761− { dynamicCurrent = behaviorHold h
762− , dynamicUpdated = eventHold h
763− }
764−
765−dynamicHoldIdentity :: Hold x (Identity a) -> DynamicS x (Identity a)
766−dynamicHoldIdentity = dynamicHold
767−
768−dynamicConst :: PatchTarget p -> DynamicS x p
769−dynamicConst !a = Dynamic
770− { dynamicCurrent = behaviorConst a
771− , dynamicUpdated = eventNever
772− }
773−
774−dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> DynamicS x p
775−dynamicDyn !d = Dynamic
776− { dynamicCurrent = behaviorDyn d
777− , dynamicUpdated = eventDyn d
778− }
779−
780−dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> DynamicS x (Identity a)
781−dynamicDynIdentity = dynamicDyn
782−
783−--------------------------------------------------------------------------------
784−-- Combinators
785−--------------------------------------------------------------------------------
786148
149+--TODO: Figure out why certain things are not 'representational', then make them representational so we can use coerce
787150--type role Hold representational
788−data Hold x p
789− = Hold { holdValue :: !(IORef (PatchTarget p))
790− , holdInvalidators :: !(IORef [Weak (Invalidator x)])
791− , 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
151+data Hold p a
152+ = Hold { holdValue :: !(IORef a)
153+ , holdInvalidators :: !(IORef [Weak Invalidator])
154+ , holdParent :: !(IORef (Either (Event (p a)) (EventSubscription (p a)))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
793155#ifdef DEBUG_NODEIDS
794156 , holdNodeId :: Int
795157#endif
796158 }
797159
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−
829160data EventEnv x
830− = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
831− , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
832− , eventEnvDynInits :: !(IORef [SomeDynInit x])
833− , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
834− , 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])
161+ = EventEnv { eventEnvSpiderEnv :: !(SpiderEnv x)
162+ , eventEnvAssignments :: !(IORef [SomeAssignment]) -- Needed for Subscribe
163+ , eventEnvHoldInits :: !(IORef [SomeHoldInit]) -- Needed for Subscribe
164+ , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate])
165+ , eventEnvMergeInits :: !(IORef [SomeMergeInit]) -- Needed for Subscribe
166+ , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
167+ , eventEnvRootClears :: !(IORef [SomeRootClear])
838168 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
839− , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
840− , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
169+ , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence]) -- Needed for Subscribe
170+ , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge]))
841171 }
842172
843173{-# 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))
174+runEventM :: EventM x a -> EventEnv x -> IO a
175+runEventM = runReaderT . unEventM
849176
850177class MonadIO m => Defer a m where
851178 getDeferralQueue :: m (IORef [a])
@@ -856,98 +183,90 @@ defer a = do
856183 q <- getDeferralQueue
857184 liftIO $ modifyIORef' q (a:)
858185
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
186+instance Defer SomeAssignment (EventM x) where
864187 {-# INLINE getDeferralQueue #-}
865− getDeferralQueue = asksEventEnv eventEnvHoldInits
188+ getDeferralQueue = EventM $ asks eventEnvAssignments
866189
867−instance HasSpiderTimeline x => Defer (SomeDynInit x) (EventM x) where
190+instance Defer SomeHoldInit (EventM x) where
868191 {-# INLINE getDeferralQueue #-}
869− getDeferralQueue = asksEventEnv eventEnvDynInits
192+ getDeferralQueue = EventM $ asks eventEnvHoldInits
870193
871−instance Defer (SomeHoldInit x) (BehaviorM x) where
194+instance Defer SomeHoldInit BehaviorM where
872195 {-# INLINE getDeferralQueue #-}
873196 getDeferralQueue = BehaviorM $ asks snd
874197
875−instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
198+instance Defer SomeMergeUpdate (EventM x) where
876199 {-# INLINE getDeferralQueue #-}
877− getDeferralQueue = asksEventEnv eventEnvMergeUpdates
200+ getDeferralQueue = EventM $ asks eventEnvMergeUpdates
878201
879−instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
202+instance Defer SomeMergeInit (EventM x) where
880203 {-# INLINE getDeferralQueue #-}
881− getDeferralQueue = asksEventEnv eventEnvMergeInits
204+ getDeferralQueue = EventM $ asks eventEnvMergeInits
882205
883−class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
206+class HasCurrentHeight m where
884207 getCurrentHeight :: m Height
885− scheduleMerge :: Height -> EventM x () -> m ()
208+ scheduleMerge :: Height -> MergeSubscribed a -> m ()
886209
887−instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
210+instance HasCurrentHeight (EventM x) where
888211 {-# INLINE getCurrentHeight #-}
889− getCurrentHeight = do
890− heightRef <- asksEventEnv eventEnvCurrentHeight
212+ getCurrentHeight = EventM $ do
213+ heightRef <- asks eventEnvCurrentHeight
891214 liftIO $ readIORef heightRef
892215 {-# INLINE scheduleMerge #-}
893− scheduleMerge height subscribed = do
894− delayedRef <- asksEventEnv eventEnvDelayedMerges
895− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
216+ scheduleMerge height subscribed = EventM $ do
217+ delayedRef <- asks eventEnvDelayedMerges
218+ liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
219+
220+class HasSpiderEnv x m | m -> x where
221+ askSpiderEnv :: m (SpiderEnv x)
896222
897−class HasSpiderTimeline x where
898− -- | Retrieve the current SpiderTimelineEnv
899− spiderTimeline :: SpiderTimelineEnv x
223+instance HasSpiderEnv x (EventM x) where
224+ {-# INLINE askSpiderEnv #-}
225+ askSpiderEnv = EventM $ asks eventEnvSpiderEnv
900226
901−instance HasSpiderTimeline Global where
902− spiderTimeline = globalSpiderTimelineEnv
227+instance HasSpiderEnv x (SpiderHost x) where
228+ {-# INLINE askSpiderEnv #-}
229+ askSpiderEnv = SpiderHost ask
903230
904−putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
905−putCurrentHeight h = do
906− heightRef <- asksEventEnv eventEnvCurrentHeight
231+putCurrentHeight :: Height -> EventM x ()
232+putCurrentHeight h = EventM $ do
233+ heightRef <- asks eventEnvCurrentHeight
907234 liftIO $ writeIORef heightRef $! h
908235
909−instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
236+instance Defer SomeClear (EventM x) where
910237 {-# INLINE getDeferralQueue #-}
911− getDeferralQueue = asksEventEnv eventEnvClears
238+ getDeferralQueue = EventM $ asks eventEnvClears
912239
913240{-# INLINE scheduleClear #-}
914−scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
915−scheduleClear r = defer $ Some $ Clear r
916−
917−instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
918− {-# 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
241+scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
242+scheduleClear r = defer $ SomeClear r
924243
925−instance HasSpiderTimeline x => Defer (Some RootClear) (EventM x) where
244+instance Defer SomeRootClear (EventM x) where
926245 {-# INLINE getDeferralQueue #-}
927− getDeferralQueue = asksEventEnv eventEnvRootClears
246+ getDeferralQueue = EventM $ asks eventEnvRootClears
928247
929248{-# INLINE scheduleRootClear #-}
930−scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
931−scheduleRootClear r = defer $ Some $ RootClear r
249+scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
250+scheduleRootClear r = defer $ SomeRootClear r
932251
933−instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
252+instance Defer SomeResetCoincidence (EventM x) where
934253 {-# INLINE getDeferralQueue #-}
935− getDeferralQueue = asksEventEnv eventEnvResetCoincidences
254+ getDeferralQueue = EventM $ asks eventEnvResetCoincidences
936255
937256-- 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)
257+{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> EventM x (Hold p a) #-}
258+{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> ComputeM (Hold p a) #-}
259+hold :: (R.Patch p, Defer SomeHoldInit m) => a -> Event (p a) -> m (Hold p a)
940260hold v0 e = do
941261 valRef <- liftIO $ newIORef v0
942262 invsRef <- liftIO $ newIORef []
943− parentRef <- liftIO $ newIORef Nothing
263+ parentRef <- liftIO $ newIORef $ Left e
944264#ifdef DEBUG_NODEIDS
945265 nodeId <- liftIO newNodeId
946266#endif
947267 let h = Hold
948268 { holdValue = valRef
949269 , holdInvalidators = invsRef
950− , holdEvent = e
951270 , holdParent = parentRef
952271#ifdef DEBUG_NODEIDS
953272 , holdNodeId = nodeId
@@ -956,115 +275,155 @@ hold v0 e = do
956275 defer $ SomeHoldInit h
957276 return h
958277
278+{-
279+mkWeakIORefKey :: IORef a -> b -> IO () -> IO (Weak b)
280+mkWeakIORefKey r@(IORef (STRef r#)) b (IO f) = IO $ \s ->
281+ case mkWeak# r# b f s of (# s1, w #) -> (# s1, Weak w #)
282+-}
283+
959284{-# INLINE getHoldEventSubscription #-}
960−getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
285+getHoldEventSubscription :: forall m p a x. (Defer SomeAssignment m, Defer SomeHoldInit m, Defer SomeClear m, R.Patch p, HasCurrentHeight m, Defer SomeMergeInit m, Defer SomeResetCoincidence m, HasSpiderEnv x m) => Hold p a -> m (EventSubscription (p a))
961286getHoldEventSubscription h = do
962287 ep <- liftIO $ readIORef $ holdParent h
963288 case ep of
964− Just subd -> return subd
965− Nothing -> do
966− let e = holdEvent h
289+ Right subd -> return subd
290+ Left e -> do
967291 subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
968− (subscription@(EventSubscription _ _), occ) <- subscribeAndRead e =<< liftIO (newSubscriberHold h)
292+ {-
293+ spiderEnv <- askSpiderEnv
294+ weakSubscriptionRef <- liftIO $ mkWeakIORef subscriptionRef $ return ()
295+ wh <- liftIO $ mkWeakIORefKey (holdValue h) h $ do
296+ msr <- deRefWeak weakSubscriptionRef
297+ forM_ msr $ \sr -> do
298+ subscription <- readIORef sr
299+ atomicModifyIORef (_spiderEnv_toUnsubscribe spiderEnv) $ \x -> (SomeEventSubscription subscription : x, ())
300+-- return ()
301+ {-
302+ -- What can we do? 1) Detect GCs at the SpiderEnv level, then go over the tree
303+ 2) Have a finalizer on every SubscriberListNode that only runs if its parent is still alive, and does a normal unsubscribe if so; this would seem to double the number of weakRefs we use, but perhaps not the weakDepth, so maybe it's OK; we will probably need to move the regular call to unsubscribe into the finalizer and then use finalize instead of that call; we can have a strong reference to the SubscriberListNode, which means we just need a single weak reference to each EventSubscribed, which we can reuse in all of the finalizers that need to (potentially) unsubscribe from it
304+-}
305+ -}
306+ subscription@(EventSubscription _ subd) <- subscribe e =<< liftIO (newSubscriberHold h)
969307 liftIO $ writeIORef subscriptionRef $! subscription
308+ occ <- liftIO $ readEventSubscribed subd
970309 case occ of
971310 Nothing -> return ()
972311 Just o -> do
973312 old <- liftIO $ readIORef $ holdValue h
974− case apply o old of
313+ case R.apply o old of
975314 Nothing -> return ()
976315 Just new -> do
977316 -- Need to evaluate these so that we don't retain the Hold itself
978317 v <- liftIO $ evaluate $ holdValue h
979318 i <- liftIO $ evaluate $ holdInvalidators h
980319 defer $ SomeAssignment v i new
981− liftIO $ writeIORef (holdParent h) $ Just subscription
320+ liftIO $ writeIORef (holdParent h) $ Right subscription
982321 return subscription
983322
984−type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
323+type BehaviorEnv = (Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]), IORef [SomeHoldInit])
985324
325+--type role BehaviorM representational
986326-- BehaviorM can sample behaviors
987−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988− deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
327+newtype BehaviorM a = BehaviorM { unBehaviorM :: ReaderT BehaviorEnv IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
989328
990−instance Monad (BehaviorM x) where
329+instance Monad BehaviorM where
991330 {-# INLINE (>>=) #-}
992331 BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
993332 {-# INLINE (>>) #-}
994333 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995334 {-# INLINE return #-}
996335 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998336 {-# INLINE fail #-}
999337 fail s = BehaviorM $ fail s
1000−#endif
1001338
1002−data BehaviorSubscribed x a
1003− = forall p. BehaviorSubscribedHold (Hold x p)
1004− | BehaviorSubscribedPull (PullSubscribed x a)
339+data BehaviorSubscribed a
340+ = forall p. BehaviorSubscribedHold (Hold p a)
341+ | BehaviorSubscribedPull (PullSubscribed a)
1005342
1006−newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
343+data SomeBehaviorSubscribed = forall a. SomeBehaviorSubscribed (BehaviorSubscribed a)
1007344
1008345--type role PullSubscribed representational
1009−data PullSubscribed x a
346+data PullSubscribed a
1010347 = PullSubscribed { pullSubscribedValue :: !a
1011− , pullSubscribedInvalidators :: !(IORef [Weak (Invalidator x)])
1012− , pullSubscribedOwnInvalidator :: !(Invalidator x)
1013− , pullSubscribedParents :: ![SomeBehaviorSubscribed x] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
348+ , pullSubscribedInvalidators :: !(IORef [Weak Invalidator])
349+ , pullSubscribedOwnInvalidator :: !Invalidator
350+ , pullSubscribedParents :: ![SomeBehaviorSubscribed] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
1014351 }
1015352
1016353--type role Pull representational
1017−data Pull x a
1018− = Pull { pullValue :: !(IORef (Maybe (PullSubscribed x a)))
1019− , pullCompute :: !(BehaviorM x a)
354+data Pull a
355+ = Pull { pullValue :: !(IORef (Maybe (PullSubscribed a)))
356+ , pullCompute :: !(BehaviorM a)
1020357#ifdef DEBUG_NODEIDS
1021358 , pullNodeId :: Int
1022359#endif
1023360 }
1024361
1025−data Invalidator x
1026− = forall a. InvalidatorPull (Pull x a)
1027− | forall a. InvalidatorSwitch (SwitchSubscribed x a)
362+data Invalidator
363+ = forall a. InvalidatorPull (Pull a)
364+ | forall a. InvalidatorSwitch (SwitchSubscribed a)
1028365
1029−data RootSubscribed x a = forall k. GCompare k => RootSubscribed
366+data RootSubscribed a = forall k. GCompare k => RootSubscribed
1030367 { rootSubscribedKey :: !(k a)
1031− , rootSubscribedCachedSubscribed :: !(IORef (DMap k (RootSubscribed x))) -- From the original Root
1032− , rootSubscribedSubscribers :: !(WeakBag (Subscriber x a))
368+ , rootSubscribedCachedSubscribed :: !(IORef (DMap k RootSubscribed)) -- From the original Root
369+ , rootSubscribedSubscribers :: !(SubscriberList a)
1033370 , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
1034371 , rootSubscribedUninit :: IO ()
1035− , rootSubscribedWeakSelf :: !(IORef (Weak (RootSubscribed x a))) --TODO: Can we make this a lazy non-IORef and then force it manually to avoid an indirection each time we use it?
372+ , rootSubscribedWeakSelf :: !(IORef (Weak (RootSubscribed a))) --TODO: Can we make this a lazy non-IORef and then force it manually to avoid an indirection each time we use it?
1036373#ifdef DEBUG_NODEIDS
1037374 , rootSubscribedNodeId :: Int
1038375#endif
1039376 }
1040377
1041−data Root x k
378+data Root (k :: * -> *)
1042379 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
1043− , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
1044− , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
380+ , rootSubscribed :: !(IORef (DMap k RootSubscribed))
381+ , rootInit :: !(forall a. k a -> RootTrigger a -> IO (IO ()))
1045382 }
1046383
1047−data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
384+data SomeHoldInit = forall p a. R.Patch p => SomeHoldInit !(Hold p a)
1048385
1049−data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
386+data SomeMergeUpdate = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap (DMap k Event)) (MergeSubscribed k)
1050387
1051−data SomeMergeUpdate x = SomeMergeUpdate
1052− { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
1053− , _someMergeUpdate_invalidateHeight :: !(IO ())
1054− , _someMergeUpdate_recalculateHeight :: !(IO ())
1055− }
388+data SomeMergeInit = forall k. GCompare k => SomeMergeInit !(MergeSubscribed k) !(Event (R.PatchDMap (DMap k Event)))
1056389
1057−newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
390+data SomeEventSubscription = forall a. SomeEventSubscription (EventSubscription a)
1058391
1059392-- 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)
393+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
394+
395+data PushSubscribed a b
396+ = PushSubscribed { pushSubscribedCachedSubscribed :: !(IORef (Maybe (PushSubscribed a b)))
397+ , 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)
398+ , pushSubscribedHeight :: !(IORef Height)
399+ , pushSubscribedSubscribers :: !(SubscriberList b)
400+ , pushSubscribedSelf :: !(Subscriber a) -- Hold this in memory to ensure our WeakReferences don't die --TODO: Probably unneeded now
401+ , pushSubscribedWeakSelf :: !(IORef (Weak (PushSubscribed a b)))
402+ , pushSubscribedParent :: !(EventSubscription a)
403+#ifdef DEBUG_NODEIDS
404+ , pushSubscribedNodeId :: Int
405+#endif
406+ }
1061407
1062−newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
408+newtype ComputeM a = ComputeM { unComputeM :: ReaderT (IORef [SomeHoldInit]) IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1063409
1064−data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
1065− { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
1066− , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
1067− }
410+instance Defer SomeHoldInit ComputeM where
411+ getDeferralQueue = ComputeM ask
412+
413+{-# SPECIALIZE runComputeM :: ComputeM a -> EventM x a #-}
414+runComputeM :: Defer SomeHoldInit m => ComputeM a -> m a
415+runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
416+
417+data Push a b
418+ = Push { pushCompute :: !(a -> ComputeM (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?)
419+ , pushParent :: !(Event a)
420+ , pushSubscribed :: !(IORef (Maybe (PushSubscribed a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
421+ }
422+
423+data MergeSubscribedParent k a
424+ = MergeSubscribedParent { mergeSubscribedParentSubscription :: !(EventSubscription a)
425+ , mergeSubscribedParentSubscriber :: !(Subscriber a)
426+ }
1068427
1069428data HeightBag = HeightBag
1070429 { _heightBag_size :: {-# UNPACK #-} !Int
@@ -1082,8 +441,7 @@ heightBagFromList :: [Height] -> HeightBag
1082441heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
1083442
1084443heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
444+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1087445
1088446heightBagRemove :: Height -> HeightBag -> HeightBag
1089447heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +450,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
1092450 0 -> IntMap.delete h c
1093451 _ -> IntMap.insert h (pred old) c
1094452
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−
1102453heightBagMax :: HeightBag -> Height
1103454heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
1104455 Just ((h, _), _) -> Height h
@@ -1116,183 +467,364 @@ heightBagVerify b@(HeightBag s c) = if
1116467heightBagVerify = id
1117468#endif
1118469
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)))
470+data MergeSubscribed k
471+ = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed k))) -- From the original merge
472+ , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
473+ , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
474+ , mergeSubscribedHeight :: !(IORef Height)
475+ , mergeSubscribedHeightBag :: !(IORef HeightBag)
476+ , mergeSubscribedSubscribers :: !(SubscriberList (DMap k Identity))
477+ , mergeSubscribedChange :: !(IORef (Subscriber (R.PatchDMap (DMap k Event)), EventSubscribed (R.PatchDMap (DMap k Event))))
478+ , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent k)))
479+ , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed k)))
480+#ifdef DEBUG_NODEIDS
481+ , mergeSubscribedNodeId :: Int
482+#endif
483+ }
484+
485+--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
486+data Merge k
487+ = Merge { mergeParents :: !(Dynamic R.PatchDMap (DMap k Event))
488+ , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed k)))
489+ }
490+
491+data FanSubscribedChildren k a = FanSubscribedChildren
492+ { _fanSubscribedChildren_list :: !(SubscriberList a)
493+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed k)
494+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed k)))
1123495 }
1124496
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)
497+data FanSubscribed k
498+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed k)))
499+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren k))) -- This DMap should never be empty
500+ , fanSubscribedParent :: !(EventSubscription (DMap k Identity))
1130501#ifdef DEBUG_NODEIDS
1131502 , fanSubscribedNodeId :: Int
1132503#endif
1133504 }
1134505
1135−data Fan x k v
1136− = Fan { fanParent :: !(Event x (DMap k v))
1137− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
506+data Fan k
507+ = Fan { fanParent :: !(Event (DMap k Identity))
508+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed k)))
1138509 }
1139510
1140−data SwitchSubscribed x a
1141− = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
511+data SwitchSubscribed a
512+ = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1142513 , switchSubscribedOccurrence :: !(IORef (Maybe a))
1143514 , switchSubscribedHeight :: !(IORef Height)
1144− , switchSubscribedSubscribers :: !(WeakBag (Subscriber x a))
1145− , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !(Invalidator x)
1146− , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak (Invalidator x)))
1147− , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed x])
1148− , switchSubscribedParent :: !(Behavior x (Event x a))
1149− , switchSubscribedCurrentParent :: !(IORef (EventSubscription x))
1150− , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed x a)))
515+ , switchSubscribedSubscribers :: !(SubscriberList a)
516+ , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !Invalidator
517+ , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak Invalidator))
518+ , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed])
519+ , switchSubscribedParent :: !(Behavior (Event a))
520+ , switchSubscribedCurrentParent :: !(IORef (EventSubscription a))
521+ , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed a)))
1151522#ifdef DEBUG_NODEIDS
1152523 , switchSubscribedNodeId :: Int
1153524#endif
1154525 }
1155526
1156−data Switch x a
1157− = Switch { switchParent :: !(Behavior x (Event x a))
1158− , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
527+data Switch a
528+ = Switch { switchParent :: !(Behavior (Event a))
529+ , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1159530 }
1160531
1161−#ifdef USE_TEMPLATE_HASKELL
1162532{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1163−#endif
1164−data CoincidenceSubscribed x a
1165− = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
533+data CoincidenceSubscribed a
534+ = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1166535 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
1167− , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
536+ , coincidenceSubscribedSubscribers :: !(SubscriberList a)
1168537 , coincidenceSubscribedHeight :: !(IORef Height)
1169− , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber x (Event x a))
1170− , coincidenceSubscribedOuterParent :: !(EventSubscription x)
1171− , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x)))
1172− , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed x a)))
538+ , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber (Event a))
539+ , coincidenceSubscribedOuterParent :: !(EventSubscription (Event a))
540+ , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed a)))
541+ , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed a)))
1173542#ifdef DEBUG_NODEIDS
1174543 , coincidenceSubscribedNodeId :: Int
1175544#endif
1176545 }
1177546
1178−data Coincidence x a
1179− = Coincidence { coincidenceParent :: !(Event x (Event x a))
1180− , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
547+data Coincidence a
548+ = Coincidence { coincidenceParent :: !(Event (Event a))
549+ , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1181550 }
1182551
1183−{-# NOINLINE newInvalidatorSwitch #-}
1184−newInvalidatorSwitch :: SwitchSubscribed x a -> IO (Invalidator x)
1185−newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
552+data Subscriber a
553+ = forall b. SubscriberPush (a -> ComputeM (Maybe b)) (PushSubscribed a b) --TODO: Why does this have the pushCompute in it?
554+ | forall k. GCompare k => SubscriberMerge !(k a) (MergeSubscribed k) --TODO: Can we inline the GCompare?
555+ | forall k. (a ~ R.PatchDMap (DMap k Event), GCompare k) => SubscriberMergeChange (MergeSubscribed k)
556+ | forall k. (GCompare k, a ~ DMap k Identity) => SubscriberFan (FanSubscribed k)
557+ | forall p b. (a ~ p b, R.Patch p) => SubscriberHold !(Hold p b)
558+ | forall b. (a ~ Identity b) => SubscriberHoldIdentity !(Hold Identity b)
559+ | SubscriberSwitch (SwitchSubscribed a)
560+ | forall b. a ~ Event b => SubscriberCoincidenceOuter (CoincidenceSubscribed b)
561+ | SubscriberCoincidenceInner (CoincidenceSubscribed a)
562+ | SubscriberHandle
563+
564+showSubscriberType :: Subscriber a -> String
565+showSubscriberType = \case
566+ SubscriberPush _ _ -> "SubscriberPush"
567+ SubscriberMerge _ _ -> "SubscriberMerge"
568+ SubscriberFan _ -> "SubscriberFan"
569+ SubscriberMergeChange _ -> "SubscriberMergeChange"
570+ SubscriberHold _ -> "SubscriberHold"
571+ SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
572+ SubscriberSwitch _ -> "SubscriberSwitch"
573+ SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
574+ SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
575+ SubscriberHandle -> "SubscriberHandle"
576+
577+data Event a
578+ = forall k. GCompare k => EventRoot !(k a) !(Root k)
579+ | EventNever
580+ | forall b. EventPush !(Push b a)
581+ | forall k. (GCompare k, a ~ DMap k Identity) => EventMerge !(Merge k)
582+ | forall k. GCompare k => EventFan !(k a) !(Fan k)
583+ | EventSwitch !(Switch a)
584+ | EventCoincidence !(Coincidence a)
585+ | forall p b. (a ~ p b, R.Patch p) => EventHold !(Hold p b)
586+ | forall p b. (a ~ p b, R.Patch p) => EventDyn !(Dyn p b)
587+ | forall b. (a ~ Identity b) => EventHoldIdentity !(Hold Identity b)
588+ | forall b. (a ~ Identity b) => EventDynIdentity !(Dyn Identity b)
589+
590+showEventType :: Event a -> String
591+showEventType = \case
592+ EventRoot _ _ -> "EventRoot"
593+ EventNever -> "EventNever"
594+ EventPush _ -> "EventPush"
595+ EventMerge _ -> "EventMerge"
596+ EventFan _ _ -> "EventFan"
597+ EventSwitch _ -> "EventSwitch"
598+ EventCoincidence _ -> "EventCoincidence"
599+ EventHold _ -> "EventHold"
600+ EventDyn _ -> "EventDyn"
601+ EventHoldIdentity _ -> "EventHoldIdentity"
602+ EventDynIdentity _ -> "EventDynIdentity"
603+
604+data EventSubscription a = EventSubscription
605+ { _eventSubscription_ticket :: !(Maybe (SubscriberListTicket a))
606+ , _eventSubscription_subscribed :: !(EventSubscribed a)
607+ }
1186608
1187−{-# NOINLINE newInvalidatorPull #-}
1188−newInvalidatorPull :: Pull x a -> IO (Invalidator x)
1189−newInvalidatorPull p = return $! InvalidatorPull p
609+data EventSubscribed a
610+ = EventSubscribedRoot {-# NOUNPACK #-} (RootSubscribed a)
611+ | EventSubscribedNever
612+ | forall b. EventSubscribedPush !(PushSubscribed b a)
613+ | forall k. (GCompare k, a ~ DMap k Identity) => EventSubscribedMerge !(MergeSubscribed k)
614+ | forall k. GCompare k => EventSubscribedFan !(k a) !(FanSubscribed k)
615+ | EventSubscribedSwitch !(SwitchSubscribed a)
616+ | EventSubscribedCoincidence !(CoincidenceSubscribed a)
617+
618+unsubscribe :: EventSubscription a -> IO ()
619+unsubscribe (EventSubscription msln _) = forM_ msln $ \sln -> WeakBag.remove sln
620+
621+-- These function are constructor functions that are marked NOINLINE so they are
622+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
623+-- so any weak references that are attached to the constructors will have their
624+-- finalizer run. Using the opaque constructor, does not see the
625+-- constructor application, so it behaves like an IORef and cannot be fused away.
626+--
627+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
628+-- the weak pointer to it in some cases.
1190629
1191−instance HasSpiderTimeline x => Filterable (Event x) where
1192− mapMaybe f = push $ return . f
630+--TODO: I think all of these noinlines are now unnecessary
631+{-# NOINLINE newSubscriberPush #-}
632+newSubscriberPush :: (a -> ComputeM (Maybe b)) -> PushSubscribed a b -> IO (Subscriber a)
633+newSubscriberPush compute subd = return $! SubscriberPush compute subd
1193634
1194−instance HasSpiderTimeline x => Align (Event x) where
1195− 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]
635+{-# RULES
636+ "newSubscriberHold/Identity" forall h. newSubscriberHold h = newSubscriberHoldIdentity h
637+ #-}
638+{-# NOINLINE newSubscriberHold #-}
639+newSubscriberHold :: R.Patch p => Hold p a -> IO (Subscriber (p a))
640+newSubscriberHold h = return $! SubscriberHold h
1201641
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
642+{-# NOINLINE newSubscriberHoldIdentity #-}
643+newSubscriberHoldIdentity :: Hold Identity a -> IO (Subscriber (Identity a))
644+newSubscriberHoldIdentity h = return $! SubscriberHoldIdentity h
645+
646+{-# NOINLINE newSubscriberMerge #-}
647+newSubscriberMerge :: GCompare k => k a -> MergeSubscribed k -> IO (Subscriber a)
648+newSubscriberMerge k subd = return $! SubscriberMerge k subd
1208649
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)
650+{-# NOINLINE newSubscriberMergeChange #-}
651+newSubscriberMergeChange :: GCompare k => MergeSubscribed k -> IO (Subscriber (R.PatchDMap (DMap k Event)))
652+newSubscriberMergeChange subd = return $! SubscriberMergeChange subd
653+
654+{-# NOINLINE newSubscriberFan #-}
655+newSubscriberFan :: GCompare k => FanSubscribed k -> IO (Subscriber (DMap k Identity))
656+newSubscriberFan subd = return $! SubscriberFan subd
657+
658+{-# NOINLINE newSubscriberSwitch #-}
659+newSubscriberSwitch :: SwitchSubscribed a -> IO (Subscriber a)
660+newSubscriberSwitch subd = return $! SubscriberSwitch subd
661+
662+{-# NOINLINE newSubscriberCoincidenceOuter #-}
663+newSubscriberCoincidenceOuter :: CoincidenceSubscribed b -> IO (Subscriber (Event b))
664+newSubscriberCoincidenceOuter subd = return $! SubscriberCoincidenceOuter subd
665+
666+{-# NOINLINE newSubscriberCoincidenceInner #-}
667+newSubscriberCoincidenceInner :: CoincidenceSubscribed a -> IO (Subscriber a)
668+newSubscriberCoincidenceInner subd = return $! SubscriberCoincidenceInner subd
669+
670+{-# NOINLINE newInvalidatorSwitch #-}
671+newInvalidatorSwitch :: SwitchSubscribed a -> IO Invalidator
672+newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
1212673
1213−newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
674+{-# NOINLINE newInvalidatorPull #-}
675+newInvalidatorPull :: Pull a -> IO Invalidator
676+newInvalidatorPull p = return $! InvalidatorPull p
1214677
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)
678+data Dynamic p a
679+ = DynamicHold !(Hold p a)
680+ | p ~ Identity => DynamicHoldIdentity !(Hold Identity a)
681+ | DynamicConst !a
682+ | DynamicDyn !(Dyn p a)
683+ | p ~ Identity => DynamicDynIdentity !(Dyn Identity a)
684+
685+{-# INLINE current #-}
686+current :: R.Patch p => Dynamic p a -> Behavior a
687+current = \case
688+ DynamicHold h -> BehaviorHold h
689+ DynamicHoldIdentity h -> BehaviorHoldIdentity h
690+ DynamicConst a -> BehaviorConst a
691+ DynamicDyn d -> BehaviorDyn d
692+ DynamicDynIdentity d -> BehaviorDynIdentity d
693+
694+--TODO: If you only need updated, not current, can we avoid actually constructing the Hold?
695+{-# INLINE updated #-}
696+updated :: R.Patch p => Dynamic p a -> Event (p a)
697+updated = \case
698+ DynamicHold h -> EventHold h
699+ DynamicHoldIdentity h -> EventHoldIdentity h
700+ DynamicConst _ -> EventNever
701+ DynamicDyn d -> EventDyn d
702+ DynamicDynIdentity d -> EventDynIdentity d
703+
704+newMapDyn :: (a -> b) -> Dynamic Identity a -> Dynamic Identity b
705+newMapDyn f d = DynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ current d) (Identity . f . runIdentity <$> updated d)
706+
707+instance Functor (Dynamic Identity) where
708+ fmap = newMapDyn
709+
710+instance Applicative (Dynamic Identity) where
711+ pure = DynamicConst
712+ (<*>) = zipDynWith ($)
713+ _ *> b = b
714+ a <* _ = a
715+
716+instance R.FunctorMaybe Event where
717+ fmapMaybe f = push $ return . f
718+
719+instance Align Event where
720+ nil = EventNever
721+ align ea eb = R.fmapMaybe R.dmapToThese $ merge $ DynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
1217722
1218723--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)
724+zipDynWith :: (a -> b -> c) -> Dynamic Identity a -> Dynamic Identity b -> Dynamic Identity c
1220725zipDynWith f da db =
1221− let eab = align (dynamicUpdated da) (dynamicUpdated db)
726+ let eab = align (updated da) (updated db)
1222727 ec = flip push eab $ \o -> do
1223728 (a, b) <- case o of
1224729 This (Identity a) -> do
1225− b <- readBehaviorUntracked $ dynamicCurrent db
730+ b <- readBehaviorUntracked $ current db
1226731 return (a, b)
1227732 That (Identity b) -> do
1228− a <- readBehaviorUntracked $ dynamicCurrent da
733+ a <- readBehaviorUntracked $ current da
1229734 return (a, b)
1230735 These (Identity a) (Identity b) -> return (a, b)
1231736 return $ Just $ Identity $ f a b
1232− in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
737+ in DynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (current da) <*> readBehaviorUntracked (current db)) ec
738+
739+instance Monad (Dynamic Identity) where
740+ {-# INLINE return #-}
741+ return = pure
742+ {-# INLINE (>>=) #-}
743+ x >>= f = DynamicDynIdentity $ newJoinDyn $ newMapDyn f x --TODO: (>>), fail
744+ {-# INLINE (>>) #-}
745+ _ >> y = y
746+ {-# INLINE fail #-}
747+ fail _ = error "Dynamic does not support 'fail'"
1233748
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
749+newtype Dyn p a = Dyn { unDyn :: IORef (Either (BehaviorM a, Event (p a)) (Hold p a)) }
1240750
1241−unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1242−unsafeBuildDynamic readV0 v' =
1243− Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
751+unsafeDyn :: BehaviorM a -> Event (p a) -> Dyn p a
752+unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
753+ where x = (readV0, v')
754+
755+newJoinDyn :: Dynamic Identity (Dynamic Identity a) -> Dyn Identity a
756+newJoinDyn d =
757+ let readV0 = readBehaviorTracked . current =<< readBehaviorTracked (current d)
758+ eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . current . runIdentity) $ updated d
759+ eInner = switch $ updated <$> current d
760+ eBoth = coincidence $ updated . runIdentity <$> updated d
761+ v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
762+ in unsafeDyn readV0 v'
763+
764+--type role Behavior representational
765+data Behavior a
766+ = forall p. BehaviorHold !(Hold p a)
767+ | BehaviorHoldIdentity !(Hold Identity a)
768+ | BehaviorConst !a
769+ | BehaviorPull !(Pull a)
770+ | BehaviorDynIdentity !(Dyn Identity a)
771+ | forall p. R.Patch p => BehaviorDyn !(Dyn p a)
1244772
1245773-- ResultM can read behaviors and events
1246774type ResultM = EventM
1247775
1248−instance HasSpiderTimeline x => Functor (Event x) where
776+{-# NOINLINE unsafeNewIORef #-}
777+unsafeNewIORef :: a -> b -> IORef b
778+unsafeNewIORef _ b = unsafePerformIO $ newIORef b
779+
780+instance Functor Event where
1249781 fmap f = push $ return . Just . f
1250782
1251−instance Functor (Behavior x) where
783+instance Functor Behavior where
1252784 fmap f = pull . fmap f . readBehaviorTracked
1253785
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)
786+{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
787+push :: forall a b. (a -> ComputeM (Maybe b)) -> Event a -> Event b
788+push f e = EventPush $ Push
789+ { pushCompute = f
790+ , pushParent = e
791+ , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
792+ }
793+-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
1257794
1258−{-# INLINABLE pull #-}
1259−pull :: BehaviorM x a -> Behavior x a
1260−pull a = unsafePerformIO $ do
1261− ref <- newIORef Nothing
795+{-# NOINLINE pull #-}
796+pull :: BehaviorM a -> Behavior a
797+pull a = BehaviorPull $ Pull
798+ { pullCompute = a
799+ , pullValue = unsafeNewIORef a Nothing
1262800#ifdef DEBUG_NODEIDS
1263− nid <- newNodeId
801+ , pullNodeId = unsafeNodeId a
1264802#endif
1265− pure $ behaviorPull $ Pull
1266− { pullCompute = a
1267− , pullValue = ref
1268−#ifdef DEBUG_NODEIDS
1269− , pullNodeId = nid
1270−#endif
1271− }
803+ }
1272804
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− }
805+{-# NOINLINE switch #-}
806+switch :: Behavior (Event a) -> Event a
807+switch a = EventSwitch $ Switch
808+ { switchParent = a
809+ , switchSubscribed = unsafeNewIORef a Nothing
810+ }
1281811
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− }
812+coincidence :: Event (Event a) -> Event a
813+coincidence a = EventCoincidence $ Coincidence
814+ { coincidenceParent = a
815+ , coincidenceSubscribed = unsafeNewIORef a Nothing
816+ }
817+
818+propagateAndUpdateSubscribersRef :: SubscriberList a -> a -> EventM x ()
819+propagateAndUpdateSubscribersRef subscribersRef a = do
820+ propagate a subscribersRef
1289821
1290822-- 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
823+run :: [DSum RootTrigger Identity] -> ResultM x b -> SpiderHost x b
1292824run 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
825+ tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
826+ spiderEnv <- SpiderHost ask
827+ result <- SpiderHost $ lift $ withMVar (_spiderEnv_lock spiderEnv) $ \_ -> flip runReaderT spiderEnv $ unSpiderHost $ runFrame $ do
1296828 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
1297829 occBefore <- liftIO $ do
1298830 occBefore <- readIORef occRef
@@ -1303,40 +835,43 @@ run roots after = do
1303835 return $ Just r
1304836 else return Nothing
1305837 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
1306− propagate a subscribersRef
1307− delayedRef <- asksEventEnv eventEnvDelayedMerges
838+ propagateAndUpdateSubscribersRef subscribersRef a
839+ delayedRef <- EventM $ asks eventEnvDelayedMerges
1308840 let go = do
1309841 delayed <- liftIO $ readIORef delayedRef
1310842 case IntMap.minViewWithKey delayed of
1311843 Nothing -> return ()
1312844 Just ((currentHeight, cur), future) -> do
1313− tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
845+ tracePropagate $ "Running height " ++ show currentHeight
1314846 putCurrentHeight $ Height currentHeight
1315847 liftIO $ writeIORef delayedRef $! future
1316− sequence_ cur
848+ forM_ cur $ \d -> case d of
849+ DelayedMerge subscribed -> do
850+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
851+ case height `compare` Height currentHeight of
852+ LT -> error "Somehow a merge's height has been decreased after it was scheduled"
853+ GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
854+ EQ -> do
855+ m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
856+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! DMap.empty
857+ --TODO: Assert that m is not empty
858+ liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $ Just m
859+ scheduleClear $ mergeSubscribedOccurrence subscribed
860+ propagateAndUpdateSubscribersRef (mergeSubscribedSubscribers subscribed) m
1317861 go
1318862 go
1319863 putCurrentHeight maxBound
1320864 after
1321− tracePropagate (Proxy :: Proxy x) "Done running an event frame"
865+ tracePropagate "Done running an event frame"
1322866 return result
1323867
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))
868+data SomeClear = forall a. SomeClear (IORef (Maybe a))
1334869
1335−newtype IntClear a = IntClear (IORef (IntMap a))
870+data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1336871
1337−newtype RootClear k = RootClear (IORef (DMap k Identity))
872+data SomeAssignment = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak Invalidator]) a
1338873
1339−data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
874+data DelayedMerge = forall k. DelayedMerge (MergeSubscribed k)
1340875
1341876debugFinalize :: Bool
1342877debugFinalize = False
@@ -1346,110 +881,79 @@ mkWeakPtrWithDebug x debugNote = do
1346881 x' <- evaluate x
1347882 mkWeakPtr x' $
1348883 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
884+ then Just $ putStrLn $ "finalizing: " ++ debugNote
1350885 else Nothing
1351886
1352887type WeakList a = [Weak a]
1353888
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−
1381889{-# 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
890+#ifdef DEBUG
891+withIncreasedDepth :: CanTrace x m => m a -> m a
892+withIncreasedDepth a = do
893+ spiderEnv <- askSpiderEnv
894+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) succ
1385895 result <- a
1386− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
896+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) pred
1387897 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−
1412898#else
899+withIncreasedDepth :: m a -> m a
900+withIncreasedDepth = id
901+#endif
1413902
1414−{-# INLINE withIncreasedDepth #-}
1415−withIncreasedDepth :: proxy x -> m a -> m a
1416−withIncreasedDepth _ = id
903+type CanTrace x m = (HasSpiderEnv x m, MonadIO m)
1417904
1418905{-# INLINE tracePropagate #-}
1419−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420−tracePropagate _ _ = return ()
906+tracePropagate :: (CanTrace x m) => String -> m ()
907+tracePropagate = traceWhen debugPropagate
908+
909+{-# INLINE traceSubscribe #-}
910+traceSubscribe :: String -> IO ()
911+traceSubscribe = when debugSubscribe . liftIO . putStrLn
1421912
1422913{-# INLINE traceInvalidate #-}
1423914traceInvalidate :: String -> IO ()
1424−traceInvalidate _ = return ()
1425−
1426−{-# INLINE traceInvalidateHeight #-}
1427−traceInvalidateHeight :: String -> IO ()
1428−traceInvalidateHeight _ = return ()
915+traceInvalidate = when debugInvalidate . liftIO . putStrLn
1429916
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
1437−
1438−
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 ()
917+{-# INLINE traceWhen #-}
918+traceWhen :: (CanTrace x m) => Bool -> String -> m ()
919+traceWhen b message = traceMWhen b $ return message
1447920
921+{-# INLINE traceMWhen #-}
922+traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
923+traceMWhen b getMessage = when b $ do
924+ message <- getMessage
925+#ifdef DEBUG
926+ spiderEnv <- askSpiderEnv
927+ d <- liftIO $ readIORef $ _spiderEnv_depth spiderEnv
928+#else
929+ let d = 0
1448930#endif
931+ liftIO $ putStrLn $ replicate d ' ' <> message
1449932
1450933whoCreatedIORef :: IORef a -> IO [String]
1451934whoCreatedIORef (IORef a) = whoCreated $! a
1452935
936+whoCreatedEventSubscribed :: EventSubscribed a -> IO [String]
937+whoCreatedEventSubscribed = \case
938+ EventSubscribedRoot _ -> return ["root"]
939+ EventSubscribedNever -> return ["never"]
940+ EventSubscribedPush subscribed -> whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
941+ EventSubscribedFan _ subscribed -> whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
942+ EventSubscribedMerge subscribed -> whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
943+ EventSubscribedSwitch subscribed -> whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
944+ EventSubscribedCoincidence subscribed -> whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
945+
946+walkInvalidHeightParents :: EventSubscribed a -> IO [Some EventSubscribed]
947+walkInvalidHeightParents s0 = do
948+ subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
949+ h <- liftIO $ readIORef $ eventSubscribedHeightRef s
950+ when (h == invalidHeight) $ do
951+ when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
952+ modify (Some.This s :)
953+ mapM_ loop =<< liftIO (eventSubscribedGetParents s)
954+ forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
955+ return subscribers
956+
1453957groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
1454958groupByHead = \case
1455959 [] -> []
@@ -1460,278 +964,553 @@ groupByHead = \case
1460964 | otherwise -> (x, xs :| []) : l
1461965
1462966listsToForest :: 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−
1495−#endif
967+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1496968
969+-- | Propagate everything at the current height
970+propagate :: a -> SubscriberList a -> EventM x ()
971+propagate a subscribers = withIncreasedDepth $ do
972+ -- 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
973+ --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
974+ WeakBag.traverse subscribers $ \s -> case s of
975+ SubscriberPush compute subscribed -> {-# SCC "traversePush" #-} do
976+ tracePropagate $ "SubscriberPush" <> showNodeId subscribed
977+ occ <- runComputeM $ compute a
978+ case occ of
979+ Nothing -> return () -- No need to write a Nothing back into the Ref
980+ Just o -> do
981+ liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
982+ scheduleClear $ pushSubscribedOccurrence subscribed
983+ propagate o $ pushSubscribedSubscribers subscribed
984+ SubscriberMerge k subscribed -> {-# SCC "traverseMerge" #-} do
985+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
986+ oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
987+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
988+ tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
989+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
990+ when (DMap.null oldM) $ do -- Only schedule the firing once
991+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
992+ --TODO: assertions about height
993+ currentHeight <- getCurrentHeight
994+ when (height <= currentHeight) $ do
995+ myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
996+ if height /= invalidHeight
997+ then error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
998+ else liftIO $ do
999+ nodesInvolvedInCycle <- walkInvalidHeightParents $ EventSubscribedMerge subscribed
1000+ stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
1001+ error $ "Causality loop found:\n" <> drawForest (listsToForest stacks)
1002+ scheduleMerge height subscribed
1003+ SubscriberMergeChange subscribed -> {-# SCC "traverseMergeChange" #-} do
1004+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
1005+ defer $ SomeMergeUpdate a subscribed
1006+ SubscriberFan subscribed -> {-# SCC "traverseFan" #-} do
1007+ subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
1008+ tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
1009+ --TODO: We need a better DMap intersection; here, we are assuming that the number of firing keys is small and the number of subscribers is large
1010+ forM_ (DMap.toList a) $ \(k :=> Identity v) -> {-# SCC "SubscriberFan" #-} case DMap.lookup k subs of
1011+ Nothing -> do
1012+ tracePropagate "No subscriber for key"
1013+ return ()
1014+ Just subsubs -> do
1015+ propagate v $ _fanSubscribedChildren_list subsubs
1016+ return ()
1017+ SubscriberHold h -> {-# SCC "traverseHold" #-} propagateSubscriberHold h a
1018+ SubscriberHoldIdentity h -> {-# SCC "traverseHoldIdentity" #-} propagateSubscriberHold h a
1019+ SubscriberSwitch subscribed -> {-# SCC "traverseSwitch" #-} do
1020+ tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
1021+ liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
1022+ scheduleClear $ switchSubscribedOccurrence subscribed
1023+ propagate a $ switchSubscribedSubscribers subscribed
1024+ SubscriberCoincidenceOuter subscribed -> {-# SCC "traverseCoincidenceOuter" #-} do
1025+ tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
1026+ outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
1027+ tracePropagate $ " outerHeight = " <> show outerHeight
1028+ (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
1029+ tracePropagate $ " isJust occ = " <> show (isJust occ)
1030+ tracePropagate $ " innerHeight = " <> show innerHeight
1031+ liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
1032+ scheduleClear $ coincidenceSubscribedInnerParent subscribed
1033+ case occ of
1034+ Nothing -> do
1035+ when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
1036+ writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
1037+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
1038+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
1039+ Just o -> do -- Since it's already firing, no need to adjust height
1040+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
1041+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
1042+ propagate o $ coincidenceSubscribedSubscribers subscribed
1043+ SubscriberCoincidenceInner subscribed -> {-# SCC "traverseCoincidenceInner" #-} do
1044+ tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
1045+ occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
1046+ case occ of
1047+ Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
1048+ Nothing -> do
1049+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
1050+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
1051+ propagate a $ coincidenceSubscribedSubscribers subscribed
1052+ SubscriberHandle -> {-# SCC "traverseHandle" #-} tracePropagate "SubscriberHandle"
14971053
14981054{-# INLINE propagateSubscriberHold #-}
1499−propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
1055+propagateSubscriberHold :: R.Patch p => Hold p a -> p a -> EventM x ()
15001056propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1057+ {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
15021058 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031059 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504−
15051060 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1506− case {-# SCC "apply" #-} apply a v of
1061+ case {-# SCC "apply" #-} R.apply a v of
15071062 Nothing -> return ()
15081063 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510− tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1064+ {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
15111065 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121066 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
15131067 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
15141068
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
1069+data SomeResetCoincidence = forall a. SomeResetCoincidence !(EventSubscription a) !(Maybe (CoincidenceSubscribed a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1070+
1071+{-# INLINE subscribeCoincidenceInner #-}
1072+subscribeCoincidenceInner :: CanSubscribe x m => Event a -> Height -> CoincidenceSubscribed a -> m (Maybe a, Height, EventSubscribed a)
1073+subscribeCoincidenceInner o outerHeight subscribedUnsafe = do
1074+ subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
1075+ subscription@(EventSubscription _ innerSubd) <- subscribe o subInner
1076+ innerOcc <- liftIO $ readEventSubscribed innerSubd
1077+ innerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef innerSubd
1078+ let height = max innerHeight outerHeight
1079+ defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
1080+ return (innerOcc, height, innerSubd)
1081+
1082+{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> BehaviorM a #-}
1083+{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> EventM x a #-}
1084+readBehaviorUntracked :: Defer SomeHoldInit m => Behavior a -> m a
1085+readBehaviorUntracked b = do
1086+ holdInits <- getDeferralQueue
1087+ liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
1088+
1089+runBehaviorM :: BehaviorM a -> Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]) -> IORef [SomeHoldInit] -> IO a
1090+runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
1091+
1092+askInvalidator :: BehaviorM (Maybe (Weak Invalidator))
1093+askInvalidator = fmap fst . fst <$> BehaviorM ask
15161094
1517−runBehaviorM :: 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)
1095+askParentsRef :: BehaviorM (Maybe (IORef [SomeBehaviorSubscribed]))
1096+askParentsRef = fmap snd . fst <$> BehaviorM ask
15191097
1520−askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
1521−askInvalidator = do
1522− (!m, _) <- ask
1523− case m of
1524− Nothing -> return Nothing
1525− Just (!wi, _) -> return $ Just wi
1098+askBehaviorHoldInits :: BehaviorM (IORef [SomeHoldInit])
1099+askBehaviorHoldInits = snd <$> BehaviorM ask
15261100
1527−askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
1528−askParentsRef = do
1529− (!m, _) <- ask
1530− case m of
1531− Nothing -> return Nothing
1532− Just (_, !p) -> return $ Just p
1101+readBehaviorTracked :: Behavior a -> BehaviorM a
1102+readBehaviorTracked b = case b of
1103+ BehaviorHold h -> readHoldTracked h
1104+ BehaviorHoldIdentity h -> readHoldTracked h
1105+ BehaviorConst a -> return a
1106+ BehaviorPull p -> do
1107+ val <- liftIO $ readIORef $ pullValue p
1108+ case val of
1109+ Just subscribed -> do
1110+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1111+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
1112+ liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
1113+ return $ pullSubscribedValue subscribed
1114+ Nothing -> do
1115+ i <- liftIO $ newInvalidatorPull p
1116+ wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
1117+ parentsRef <- liftIO $ newIORef []
1118+ holdInits <- askBehaviorHoldInits
1119+ a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
1120+ invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
1121+ parents <- liftIO $ readIORef parentsRef
1122+ let subscribed = PullSubscribed
1123+ { pullSubscribedValue = a
1124+ , pullSubscribedInvalidators = invsRef
1125+ , pullSubscribedOwnInvalidator = i
1126+ , pullSubscribedParents = parents
1127+ }
1128+ liftIO $ writeIORef (pullValue p) $ Just subscribed
1129+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1130+ return a
1131+ BehaviorDyn d -> readHoldTracked =<< getDynHold d
1132+ BehaviorDynIdentity d -> readHoldTracked =<< getDynHold d
15331133
1534−askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1535−askBehaviorHoldInits = do
1536− (_, !his) <- ask
1537− return his
1134+{-# INLINE readHoldTracked #-}
1135+readHoldTracked :: Hold p a -> BehaviorM a
1136+readHoldTracked h = do
1137+ result <- liftIO $ readIORef $ holdValue h
1138+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
1139+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
1140+ return result
15381141
15391142{-# INLINE getDynHold #-}
1540−getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
1143+getDynHold :: (Defer SomeHoldInit m, R.Patch p) => Dyn p a -> m (Hold p a)
15411144getDynHold d = do
15421145 mh <- liftIO $ readIORef $ unDyn d
15431146 case mh of
1544− HoldDyn h -> return h
1545− UnsafeDyn (readV0, v') -> do
1147+ Right h -> return h
1148+ Left (readV0, v') -> do
15461149 holdInits <- getDeferralQueue
15471150 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
15541151 h <- hold v0 v'
1555− liftIO $ writeIORef (unDyn d) $ HoldDyn h
1152+ liftIO $ writeIORef (unDyn d) $ Right h
15561153 return h
15571154
1155+{-
1156+readEvent :: Event a -> ResultM (Maybe a)
1157+readEvent e = case e of
1158+ EventRoot k r -> liftIO . fmap (coerce . DMap.lookup k) . readIORef $ rootOccurrence r
1159+ EventNever -> return Nothing
1160+ EventPush p -> do
1161+ subscribed <- getPushSubscribed p
1162+ liftIO $ readPushSubscribed subscribed
1163+ EventMerge m -> do
1164+ subscribed <- getMergeSubscribed m
1165+ liftIO $ readMergeSubscribed subscribed
1166+ EventFan k f -> do
1167+ subscribed <- getFanSubscribed f
1168+ liftIO $ readFanSubscribed k subscribed
1169+ EventSwitch s -> do
1170+ subscribed <- getSwitchSubscribed s
1171+ liftIO $ readSwitchSubscribed subscribed
1172+ EventCoincidence c -> do
1173+ subscribed <- getCoincidenceSubscribed c
1174+ liftIO $ readCoincidenceSubscribed subscribed
1175+ EventHold h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1176+ EventDyn d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1177+ EventHoldIdentity h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1178+ EventDynIdentity d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1179+-}
1180+
1181+readEventSubscribed :: EventSubscribed a -> IO (Maybe a)
1182+readEventSubscribed = \case
1183+ EventSubscribedRoot rs -> readRootSubscribed rs
1184+ EventSubscribedNever -> return Nothing
1185+ EventSubscribedPush ps -> readPushSubscribed ps
1186+ EventSubscribedMerge ms -> readMergeSubscribed ms
1187+ EventSubscribedFan k fs -> readFanSubscribed k fs
1188+ EventSubscribedSwitch ss -> readSwitchSubscribed ss
1189+ EventSubscribedCoincidence cs -> readCoincidenceSubscribed cs
1190+
1191+readRootSubscribed :: RootSubscribed a -> IO (Maybe a)
1192+readRootSubscribed = rootSubscribedOccurrence
1193+
1194+readPushSubscribed :: PushSubscribed b a -> IO (Maybe a)
1195+readPushSubscribed subscribed = do
1196+ result <- readIORef $ pushSubscribedOccurrence subscribed -- Since ResultM is always called after the final height is reached, this will always be valid
1197+ touch $ pushSubscribedSelf subscribed
1198+ return result
1199+
1200+readMergeSubscribed :: MergeSubscribed k -> IO (Maybe (DMap k Identity))
1201+readMergeSubscribed subscribed = do
1202+ result <- readIORef $ mergeSubscribedOccurrence subscribed
1203+ touch $ mergeSubscribedParents subscribed
1204+ return result
1205+
1206+readFanSubscribed :: GCompare k => k a -> FanSubscribed k -> IO (Maybe a)
1207+readFanSubscribed k fs = do
1208+ parentOcc <- readEventSubscribed $ _eventSubscription_subscribed $ fanSubscribedParent fs
1209+ return $ coerce $ DMap.lookup k =<< parentOcc
1210+
1211+readSwitchSubscribed :: SwitchSubscribed a -> IO (Maybe a)
1212+readSwitchSubscribed subscribed = do
1213+ result <- readIORef $ switchSubscribedOccurrence subscribed
1214+ touch $ switchSubscribedOwnInvalidator subscribed
1215+ return result
1216+
1217+readCoincidenceSubscribed :: CoincidenceSubscribed a -> IO (Maybe a)
1218+readCoincidenceSubscribed subscribed = do
1219+ result <- readIORef $ coincidenceSubscribedOccurrence subscribed
1220+ touch $ coincidenceSubscribedOuter subscribed
1221+ --TODO: do we need to touch the inner subscriber?
1222+ return result
15581223
15591224-- Always refers to 0
15601225{-# NOINLINE zeroRef #-}
15611226zeroRef :: IORef Height
15621227zeroRef = unsafePerformIO $ newIORef zeroHeight
15631228
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)
1229+{-# SPECIALIZE subscribe :: Event a -> Subscriber a -> EventM x (EventSubscription a) #-}
1230+subscribe :: forall x m a. CanSubscribe x m => Event a -> Subscriber a -> m (EventSubscription a)
1231+subscribe e sub = case e of
1232+ EventRoot k r -> wrap EventSubscribedRoot $ liftIO . getRootSubscribed k r
1233+ EventNever -> return $ EventSubscription Nothing EventSubscribedNever
1234+ EventPush p -> wrap EventSubscribedPush $ getPushSubscribed p
1235+ EventFan k f -> wrap (EventSubscribedFan k) $ getFanSubscribed k f
1236+ EventMerge m -> wrap EventSubscribedMerge $ getMergeSubscribed m
1237+ EventSwitch s -> wrap EventSubscribedSwitch $ getSwitchSubscribed s
1238+ EventCoincidence c -> wrap EventSubscribedCoincidence $ getCoincidenceSubscribed c
1239+ EventHold h -> subscribeHoldEvent h sub
1240+ EventDyn j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1241+ EventHoldIdentity h -> subscribeHoldEvent h sub
1242+ EventDynIdentity j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1243+ where
1244+ wrap :: (t -> EventSubscribed a) -> (Subscriber a -> m (SubscriberListTicket a, t)) -> m (EventSubscription a)
1245+ wrap tag getSpecificSubscribed = do
1246+ (sln, subd) <- getSpecificSubscribed sub
1247+ return $ EventSubscription (Just sln) $ tag subd
1248+
1249+{-# INLINE subscribeHoldEvent #-}
1250+subscribeHoldEvent :: (CanSubscribe x m, R.Patch p) => Hold p a -> Subscriber (p a) -> m (EventSubscription (p a))
1251+subscribeHoldEvent h sub = do
1252+ EventSubscription _ subd <- getHoldEventSubscription h
1253+ sln <- liftIO $ subscribeEventSubscribed subd sub
1254+ return $ EventSubscription sln subd
1255+
1256+{-# INLINE debugSubscribe #-}
1257+debugSubscribe :: Bool
1258+debugSubscribe = False
1259+
1260+{-# INLINE subscribeEventSubscribed #-}
1261+subscribeEventSubscribed :: EventSubscribed a -> Subscriber a -> IO (Maybe (SubscriberListTicket a))
1262+subscribeEventSubscribed es sub = case es of
1263+ EventSubscribedRoot r -> do
1264+ traceSubscribe $ "subscribeEventSubscribed Root"
1265+ Just <$> subscribeRootSubscribed r sub
1266+ EventSubscribedNever -> do
1267+ traceSubscribe $ "subscribeEventSubscribed Never"
1268+ return Nothing
1269+ EventSubscribedPush subscribed -> do
1270+ traceSubscribe $ "subscribeEventSubscribed Push"
1271+ Just <$> subscribePushSubscribed subscribed sub
1272+ EventSubscribedFan k subscribed -> do
1273+ traceSubscribe $ "subscribeEventSubscribed Fan"
1274+ Just <$> subscribeFanSubscribed k subscribed sub
1275+ EventSubscribedMerge subscribed -> do
1276+ traceSubscribe $ "subscribeEventSubscribed Merge"
1277+ Just <$> subscribeMergeSubscribed subscribed sub
1278+ EventSubscribedSwitch subscribed -> do
1279+ traceSubscribe $ "subscribeEventSubscribed Switch"
1280+ Just <$> subscribeSwitchSubscribed subscribed sub
1281+ EventSubscribedCoincidence subscribed -> do
1282+ traceSubscribe $ "subscribeEventSubscribed Coincidence"
1283+ Just <$> subscribeCoincidenceSubscribed subscribed sub
1284+
1285+{-# INLINE eventSubscribedHeightRef #-}
1286+eventSubscribedHeightRef :: EventSubscribed a -> IORef Height
1287+eventSubscribedHeightRef = \case
1288+ EventSubscribedRoot _ -> zeroRef
1289+ EventSubscribedNever -> zeroRef
1290+ EventSubscribedPush subscribed -> pushSubscribedHeight subscribed
1291+ EventSubscribedFan _ subscribed -> eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
1292+ EventSubscribedMerge subscribed -> mergeSubscribedHeight subscribed
1293+ EventSubscribedSwitch subscribed -> switchSubscribedHeight subscribed
1294+ EventSubscribedCoincidence subscribed -> coincidenceSubscribedHeight subscribed
1295+
1296+{-# INLINE eventSubscribedHasOwnHeightRef #-}
1297+eventSubscribedHasOwnHeightRef :: EventSubscribed a -> Bool
1298+eventSubscribedHasOwnHeightRef = \case
1299+ EventSubscribedRoot _ -> False
1300+ EventSubscribedNever -> False
1301+ EventSubscribedPush _ -> False
1302+ EventSubscribedFan _ _ -> False
1303+ EventSubscribedMerge _ -> True
1304+ EventSubscribedSwitch _ -> True
1305+ EventSubscribedCoincidence _ -> True
1306+
1307+{-# INLINE eventSubscribedGetParents #-}
1308+eventSubscribedGetParents :: EventSubscribed a -> IO [Some EventSubscribed]
1309+eventSubscribedGetParents = \case
1310+ EventSubscribedRoot _ -> return []
1311+ EventSubscribedNever -> return []
1312+ EventSubscribedPush subscribed -> return [Some.This $ _eventSubscription_subscribed $ pushSubscribedParent subscribed]
1313+ EventSubscribedFan _ subscribed -> return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
1314+ EventSubscribedMerge subscribed -> do
1315+ ps <- readIORef $ mergeSubscribedParents subscribed
1316+ return $ R.ffor (DMap.toList ps) $ \(_ :=> v) -> Some.This $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription v
1317+ EventSubscribedSwitch subscribed -> do
1318+ s <- readIORef $ switchSubscribedCurrentParent subscribed
1319+ return [Some.This $ _eventSubscription_subscribed s]
1320+ EventSubscribedCoincidence subscribed -> do
1321+ innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
1322+ let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1323+ innerParents = maybeToList $ fmap Some.This innerSubscription
1324+ return $ outerParent : innerParents
1325+
1326+type CanSubscribe x m =
1327+ ( HasSpiderEnv x m
1328+ , HasCurrentHeight m
1329+ , Defer SomeHoldInit m, Defer SomeMergeInit m -- The things we need to lazily initialize state
1330+ , Defer SomeClear m -- Wiping out event firings
1331+ , Defer SomeAssignment m -- Updating state
1332+ , Defer SomeResetCoincidence m
1333+ )
1334+
1335+getRootSubscribed :: GCompare k => k a -> Root k -> Subscriber a -> IO (SubscriberListTicket a, RootSubscribed a)
15651336getRootSubscribed k r sub = do
15661337 mSubscribed <- readIORef $ rootSubscribed r
1567− let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
15681338 case DMap.lookup k mSubscribed of
15691339 Just subscribed -> {-# SCC "hitRoot" #-} do
15701340 sln <- subscribeRootSubscribed subscribed sub
1571− occ <- getOcc
1572− return (sln, subscribed, occ)
1341+ return (sln, subscribed)
15731342 Nothing -> {-# SCC "missRoot" #-} do
15741343 weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
15751344 let !cached = rootSubscribed r
15761345 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
15771346 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1578−
1579− tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580−
1347+ when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
15811348 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
15821349 writeIORef uninitRef $! uninit
1583−#ifdef DEBUG_NODEIDS
1584− nid <- newNodeId
1585−#endif
1586− let !subscribed = RootSubscribed
1350+ let subscribed = RootSubscribed
15871351 { rootSubscribedKey = k
15881352 , rootSubscribedCachedSubscribed = cached
1589− , rootSubscribedOccurrence = getOcc
1353+ , rootSubscribedOccurrence = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
15901354 , rootSubscribedSubscribers = subs
15911355 , rootSubscribedUninit = uninit
15921356 , rootSubscribedWeakSelf = weakSelf
15931357#ifdef DEBUG_NODEIDS
1594− , rootSubscribedNodeId = nid
1358+ , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
15951359#endif
15961360 }
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)
1361+ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
16081362 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
1609− occ <- getOcc
1610− return (sln, subscribed, occ)
1363+ return (sln, subscribed)
16111364
1612−#ifdef USE_TEMPLATE_HASKELL
16131365{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1614−#endif
1615−cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1616−cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
1366+cleanupRootSubscribed :: RootSubscribed a -> IO ()
1367+cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
16171368 rootSubscribedUninit self
16181369 modifyIORef' cached $ DMap.delete k
16191370
16201371{-# INLINE subscribeRootSubscribed #-}
1621−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1372+subscribeRootSubscribed :: RootSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
16221373subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
16231374
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))
1630−#ifdef DEBUG_NODEIDS
1631− , _fanInt_nodeId :: {-# UNPACK #-} !Int
1632−#endif
1633− }
1634−
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"
1375+-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1376+{-# SPECIALIZE getPushSubscribed :: Push a b -> Subscriber b -> EventM x (SubscriberListTicket b, PushSubscribed a b) #-}
1377+getPushSubscribed :: CanSubscribe x m => Push a b -> Subscriber b -> m (SubscriberListTicket b, PushSubscribed a b)
1378+getPushSubscribed p sub = do
1379+ mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1380+ case mSubscribed of
1381+ Just subscribed -> {-# SCC "hitPush" #-} do
1382+ sln <- liftIO $ subscribePushSubscribed subscribed sub
1383+ return (sln, subscribed)
1384+ Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1385+ subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1386+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1387+ s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
1388+ subscription@(EventSubscription _ subd) <- subscribe (pushParent p) s
1389+ parentOcc <- liftIO $ readEventSubscribed subd
1390+ occ <- runComputeM $ join <$> mapM (pushCompute p) parentOcc
1391+ occRef <- liftIO $ newIORef occ
1392+ when (isJust occ) $ scheduleClear occRef
1393+ weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1394+ let !cached = pushSubscribed p
1395+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1396+ let subscribed = PushSubscribed
1397+ { pushSubscribedCachedSubscribed = cached
1398+ , pushSubscribedOccurrence = occRef
1399+ , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1400+ , pushSubscribedSubscribers = subs
1401+ , pushSubscribedSelf = s
1402+ , pushSubscribedWeakSelf = weakSelf
1403+ , pushSubscribedParent = subscription
16401404#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1405+ , pushSubscribedNodeId = unsafeNodeId p
16421406#endif
1643− return $ FanInt
1644− { _fanInt_subscribers = subscribers
1645− , _fanInt_subscriptionRef = subscriptionRef
1646− , _fanInt_occRef = occRef
1407+ }
1408+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1409+ liftIO $ writeIORef subscribedRef $! subscribed
1410+ liftIO $ writeIORef (pushSubscribed p) $ Just subscribed
1411+ return (sln, subscribed)
1412+
1413+cleanupPushSubscribed :: PushSubscribed a b -> IO ()
1414+cleanupPushSubscribed self = do
1415+ unsubscribe $ pushSubscribedParent self
1416+ writeIORef (pushSubscribedCachedSubscribed self) $ Nothing
1417+
1418+{-# INLINE subscribePushSubscribed #-}
1419+subscribePushSubscribed :: PushSubscribed a b -> Subscriber b -> IO (SubscriberListTicket b)
1420+subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1421+
1422+{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge k -> Subscriber (DMap k Identity) -> EventM x (SubscriberListTicket (DMap k Identity), MergeSubscribed k) #-}
1423+getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge k -> Subscriber (DMap k Identity) -> m (SubscriberListTicket (DMap k Identity), MergeSubscribed k)
1424+getMergeSubscribed m sub = do
1425+ mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1426+ case mSubscribed of
1427+ Just subscribed -> {-# SCC "hitMerge" #-} do
1428+ sln <- liftIO $ subscribeMergeSubscribed subscribed sub
1429+ return (sln, subscribed)
1430+ Nothing -> {-# SCC "missMerge" #-} do
1431+ subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1432+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1433+ initialParents <- readBehaviorUntracked $ current $ mergeParents m
1434+ subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1435+ s <- liftIO $ newSubscriberMerge k subscribedUnsafe
1436+ subscription@(EventSubscription _ parentSubd) <- subscribe e s
1437+ parentOcc <- liftIO $ readEventSubscribed parentSubd
1438+ height <- liftIO $ readIORef $ eventSubscribedHeightRef parentSubd
1439+ return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription s)
1440+ let dm = DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1441+ heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1442+ myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1443+ myHeight = if invalidHeight `elem` heights
1444+ then invalidHeight
1445+ else succHeight $ heightBagMax myHeightBag
1446+ currentHeight <- getCurrentHeight
1447+ let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1448+ then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1449+ else (Nothing, dm)
1450+ unless (DMap.null accum) $ do
1451+ scheduleMerge myHeight subscribedUnsafe
1452+ occRef <- liftIO $ newIORef occ
1453+ when (isJust occ) $ scheduleClear occRef
1454+ accumRef <- liftIO $ newIORef accum
1455+ heightRef <- liftIO $ newIORef myHeight
1456+ heightMapRef <- liftIO $ newIORef myHeightBag
1457+ weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1458+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1459+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1460+ parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1461+ let !subscribed = MergeSubscribed
1462+ { mergeSubscribedCachedSubscribed = mergeSubscribed m
1463+ , mergeSubscribedOccurrence = occRef
1464+ , mergeSubscribedAccum = accumRef
1465+ , mergeSubscribedHeight = heightRef
1466+ , mergeSubscribedHeightBag = heightMapRef
1467+ , mergeSubscribedSubscribers = subs
1468+ , mergeSubscribedChange = changeSubdRef
1469+ , mergeSubscribedParents = parentsRef
1470+ , mergeSubscribedWeakSelf = weakSelf
16471471#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1472+ , mergeSubscribedNodeId = unsafeNodeId m
16491473#endif
1650− }
1651−
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− }
1704−
1705−
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))
1474+ }
1475+ defer $ SomeMergeInit subscribed $ updated $ mergeParents m
1476+ liftIO $ writeIORef subscribedRef $! subscribed
1477+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1478+ liftIO $ writeIORef (mergeSubscribed m) $ Just subscribed
1479+ return (sln, subscribed)
1480+
1481+cleanupMergeSubscribed :: MergeSubscribed k -> IO ()
1482+cleanupMergeSubscribed subscribed = do
1483+ parents <- readIORef $ mergeSubscribedParents subscribed
1484+ forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1485+ -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1486+ writeIORef (mergeSubscribedCachedSubscribed subscribed) $ Nothing -- Get rid of the cached subscribed
1487+
1488+{-# INLINE subscribeMergeSubscribed #-}
1489+subscribeMergeSubscribed :: MergeSubscribed k -> Subscriber (DMap k Identity) -> IO (SubscriberListTicket (DMap k Identity))
1490+subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
1491+
1492+{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan k -> Subscriber a -> EventM x (SubscriberListTicket a, FanSubscribed k) #-}
1493+getFanSubscribed :: (Defer SomeAssignment m, Defer SomeHoldInit m, Defer SomeMergeInit m, Defer SomeClear m, HasCurrentHeight m, Defer SomeResetCoincidence m, HasSpiderEnv x m, GCompare k) => k a -> Fan k -> Subscriber a -> m (SubscriberListTicket a, FanSubscribed k)
17081494getFanSubscribed k f sub = do
17091495 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
17101496 case mSubscribed of
1711− Just subscribed -> {-# SCC "hitFan" #-} liftIO $ do
1712− sln <- subscribeFanSubscribed k subscribed sub
1713− occ <- readIORef $ fanSubscribedOccurrence subscribed
1714− return (sln, subscribed, coerce $ DMap.lookup k =<< occ)
1497+ Just subscribed -> {-# SCC "hitFan" #-} do
1498+ sln <- liftIO $ subscribeFanSubscribed k subscribed sub
1499+ return (sln, subscribed)
17151500 Nothing -> {-# SCC "missFan" #-} do
17161501 subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
17171502 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
17181503 s <- liftIO $ newSubscriberFan subscribedUnsafe
1719− (subscription, parentOcc) <- subscribeAndRead (fanParent f) s
1504+ subscription <- subscribe (fanParent f) s
17201505 weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
17211506 (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
17221507 subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
1723− occRef <- liftIO $ newIORef parentOcc
1724− when (isJust parentOcc) $ scheduleClear occRef
1725−#ifdef DEBUG_NODEIDS
1726− nid <- liftIO newNodeId
1727−#endif
17281508 let subscribed = FanSubscribed
17291509 { fanSubscribedCachedSubscribed = fanSubscribed f
1730− , fanSubscribedOccurrence = occRef
17311510 , fanSubscribedParent = subscription
17321511 , fanSubscribedSubscribers = subscribersRef
17331512#ifdef DEBUG_NODEIDS
1734− , fanSubscribedNodeId = nid
1513+ , fanSubscribedNodeId = unsafeNodeId f
17351514#endif
17361515 }
17371516 let !self = (k, subscribed)
@@ -1739,9 +1518,9 @@ getFanSubscribed k f sub = do
17391518 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
17401519 liftIO $ writeIORef subscribedRef $! subscribed
17411520 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1742− return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
1521+ return (slnForSub, subscribed)
17431522
1744−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
1523+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed k) -> IO ()
17451524cleanupFanSubscribed (k, subscribed) = do
17461525 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17471526 let reducedSubscribers = DMap.delete k subscribers
@@ -1753,7 +1532,7 @@ cleanupFanSubscribed (k, subscribed) = do
17531532 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
17541533
17551534{-# INLINE subscribeFanSubscribed #-}
1756−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
1535+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed k -> Subscriber a -> IO (SubscriberListTicket a)
17571536subscribeFanSubscribed k subscribed sub = do
17581537 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17591538 case DMap.lookup k subscribers of
@@ -1761,19 +1540,18 @@ subscribeFanSubscribed k subscribed sub = do
17611540 let !self = (k, subscribed)
17621541 weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
17631542 (list, sln) <- WeakBag.singleton sub weakSelf cleanupFanSubscribed
1764− writeIORef (fanSubscribedSubscribers subscribed) $! DMap.insertWith (error "subscribeFanSubscribed: key that we just failed to find is present - should be impossible") k (FanSubscribedChildren list self weakSelf) subscribers
1543+ writeIORef (fanSubscribedSubscribers subscribed) $! DMap.insertWith (error "subscribeEventSubscribed: key that we just failed to find is present - should be impossible") k (FanSubscribedChildren list self weakSelf) subscribers
17651544 return sln
17661545 Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
17671546
1768−{-# INLINABLE getSwitchSubscribed #-}
1769−getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1547+{-# SPECIALIZE getSwitchSubscribed :: Switch a -> Subscriber a -> EventM x (SubscriberListTicket a, SwitchSubscribed a) #-}
1548+getSwitchSubscribed :: (Defer SomeHoldInit m, Defer SomeAssignment m, Defer SomeMergeInit m, Defer SomeClear m, Defer SomeResetCoincidence m, HasCurrentHeight m, HasSpiderEnv x m) => Switch a -> Subscriber a -> m (SubscriberListTicket a, SwitchSubscribed a)
17701549getSwitchSubscribed s sub = do
17711550 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
17721551 case mSubscribed of
1773− Just subscribed -> {-# SCC "hitSwitch" #-} liftIO $ do
1774− sln <- subscribeSwitchSubscribed subscribed sub
1775− occ <- readIORef $ switchSubscribedOccurrence subscribed
1776− return (sln, subscribed, occ)
1552+ Just subscribed -> {-# SCC "hitSwitch" #-} do
1553+ sln <- liftIO $ subscribeSwitchSubscribed subscribed sub
1554+ return (sln, subscribed)
17771555 Nothing -> {-# SCC "missSwitch" #-} do
17781556 subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
17791557 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
@@ -1784,16 +1562,14 @@ getSwitchSubscribed s sub = do
17841562 parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
17851563 holdInits <- getDeferralQueue
17861564 e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1787− (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead e mySub
1788− heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
1565+ subscription@(EventSubscription _ subd) <- subscribe e mySub
17891566 subscriptionRef <- liftIO $ newIORef subscription
1567+ parentOcc <- liftIO $ readEventSubscribed subd
17901568 occRef <- liftIO $ newIORef parentOcc
17911569 when (isJust parentOcc) $ scheduleClear occRef
1570+ heightRef <- liftIO $ newIORef =<< readIORef (eventSubscribedHeightRef subd)
17921571 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
17931572 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794−#ifdef DEBUG_NODEIDS
1795− nid <- liftIO newNodeId
1796−#endif
17971573 let !subscribed = SwitchSubscribed
17981574 { switchSubscribedCachedSubscribed = switchSubscribed s
17991575 , switchSubscribedOccurrence = occRef
@@ -1806,39 +1582,39 @@ getSwitchSubscribed s sub = do
18061582 , switchSubscribedCurrentParent = subscriptionRef
18071583 , switchSubscribedWeakSelf = weakSelf
18081584#ifdef DEBUG_NODEIDS
1809− , switchSubscribedNodeId = nid
1585+ , switchSubscribedNodeId = unsafeNodeId s
18101586#endif
18111587 }
18121588 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
18131589 liftIO $ writeIORef subscribedRef $! subscribed
18141590 liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1815− return (slnForSub, subscribed, parentOcc)
1591+ return (slnForSub, subscribed)
18161592
1817−cleanupSwitchSubscribed :: SwitchSubscribed x a -> IO ()
1593+cleanupSwitchSubscribed :: SwitchSubscribed a -> IO ()
18181594cleanupSwitchSubscribed subscribed = do
18191595 unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
18201596 finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
18211597 writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
18221598
18231599{-# INLINE subscribeSwitchSubscribed #-}
1824−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1600+subscribeSwitchSubscribed :: SwitchSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
18251601subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
18261602
1827−{-# INLINABLE getCoincidenceSubscribed #-}
1828−getCoincidenceSubscribed :: forall x a. HasSpiderTimeline x => Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
1603+{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence a -> Subscriber a -> EventM x (SubscriberListTicket a, CoincidenceSubscribed a) #-}
1604+getCoincidenceSubscribed :: forall x a m. (Defer SomeAssignment m, Defer SomeHoldInit m, Defer SomeMergeInit m, Defer SomeClear m, HasCurrentHeight m, Defer SomeResetCoincidence m, HasSpiderEnv x m) => Coincidence a -> Subscriber a -> m (SubscriberListTicket a, CoincidenceSubscribed a)
18291605getCoincidenceSubscribed c sub = do
18301606 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
18311607 case mSubscribed of
1832− Just subscribed -> {-# SCC "hitCoincidence" #-} liftIO $ do
1833− sln <- subscribeCoincidenceSubscribed subscribed sub
1834− occ <- readIORef $ coincidenceSubscribedOccurrence subscribed
1835− return (sln, subscribed, occ)
1608+ Just subscribed -> {-# SCC "hitCoincidence" #-} do
1609+ sln <- liftIO $ subscribeCoincidenceSubscribed subscribed sub
1610+ return (sln, subscribed)
18361611 Nothing -> {-# SCC "missCoincidence" #-} do
18371612 subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
18381613 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
18391614 subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1840− (outerSubscription@(EventSubscription _ outerSubd), outerOcc) <- subscribeAndRead (coincidenceParent c) subOuter
1841− outerHeight <- liftIO $ getEventSubscribedHeight outerSubd
1615+ outerSubscription@(EventSubscription _ outerSubd) <- subscribe (coincidenceParent c) subOuter
1616+ outerOcc <- liftIO $ readEventSubscribed outerSubd
1617+ outerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef outerSubd
18421618 (occ, height, mInnerSubd) <- case outerOcc of
18431619 Nothing -> return (Nothing, outerHeight, Nothing)
18441620 Just o -> do
@@ -1851,9 +1627,6 @@ getCoincidenceSubscribed c sub = do
18511627 scheduleClear innerSubdRef
18521628 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
18531629 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854−#ifdef DEBUG_NODEIDS
1855− nid <- liftIO newNodeId
1856−#endif
18571630 let subscribed = CoincidenceSubscribed
18581631 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
18591632 , coincidenceSubscribedOccurrence = occRef
@@ -1864,549 +1637,160 @@ getCoincidenceSubscribed c sub = do
18641637 , coincidenceSubscribedInnerParent = innerSubdRef
18651638 , coincidenceSubscribedWeakSelf = weakSelf
18661639#ifdef DEBUG_NODEIDS
1867− , coincidenceSubscribedNodeId = nid
1640+ , coincidenceSubscribedNodeId = unsafeNodeId c
18681641#endif
18691642 }
18701643 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
18711644 liftIO $ writeIORef subscribedRef $! subscribed
18721645 liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1873− return (slnForSub, subscribed, occ)
1646+ return (slnForSub, subscribed)
18741647
1875−cleanupCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO ()
1648+cleanupCoincidenceSubscribed :: CoincidenceSubscribed a -> IO ()
18761649cleanupCoincidenceSubscribed subscribed = do
18771650 unsubscribe $ coincidenceSubscribedOuterParent subscribed
18781651 writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
18791652
18801653{-# INLINE subscribeCoincidenceSubscribed #-}
1881−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1654+subscribeCoincidenceSubscribed :: CoincidenceSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
18821655subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
18831656
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))
2015− }
2016−
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
1657+{-# INLINE merge #-}
1658+merge :: GCompare k => Dynamic R.PatchDMap (DMap k Event) -> Event (DMap k Identity)
1659+merge m = EventMerge $ Merge
1660+ { mergeParents = m
1661+ , mergeSubscribed = unsafeNewIORef m Nothing
20951662 }
20961663
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)
1664+newtype EventSelector k = EventSelector { select :: forall a. k a -> Event a }
22801665
2281−newtype 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) }
2283−
2284−fanG :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k v) -> EventSelectorG x k v
2285−fanG e = unsafePerformIO $ do
2286− ref <- newIORef Nothing
1666+fan :: GCompare k => Event (DMap k Identity) -> EventSelector k
1667+fan e =
22871668 let f = Fan
22881669 { fanParent = e
2289− , fanSubscribed = ref
1670+ , fanSubscribed = unsafeNewIORef e Nothing
22901671 }
2291− pure $ EventSelectorG $ \k -> eventFan k f
1672+ in EventSelector $ \k -> EventFan k f
22921673
2293−runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
2294−runHoldInits holdInitRef dynInitRef mergeInitRef = do
1674+runHoldInits :: IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> EventM x ()
1675+runHoldInits holdInitRef mergeInitRef = do
22951676 holdInits <- liftIO $ readIORef holdInitRef
2296− dynInits <- liftIO $ readIORef dynInitRef
22971677 mergeInits <- liftIO $ readIORef mergeInitRef
2298− unless (null holdInits && null dynInits && null mergeInits) $ do
1678+ unless (null holdInits && null mergeInits) $ do
22991679 liftIO $ writeIORef holdInitRef []
2300− liftIO $ writeIORef dynInitRef []
23011680 liftIO $ writeIORef mergeInitRef []
23021681 mapM_ initHold holdInits
2303− mapM_ initDyn dynInits
2304− mapM_ unSomeMergeInit mergeInits
2305− runHoldInits holdInitRef dynInitRef mergeInitRef
1682+ mapM_ initMerge mergeInits
1683+ runHoldInits holdInitRef mergeInitRef
23061684
2307−initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
1685+initHold :: SomeHoldInit -> EventM x ()
23081686initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
23091687
2310−initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
2311−initDyn (SomeDynInit d) = void $ getDynHold d
1688+initMerge :: SomeMergeInit -> EventM x ()
1689+initMerge (SomeMergeInit subscribed changed) = do
1690+ changeSub <- liftIO $ newSubscriberMergeChange subscribed
1691+ EventSubscription _ changeSubd <- subscribe changed changeSub
1692+ change <- liftIO $ readEventSubscribed changeSubd
1693+ forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1694+ liftIO $ writeIORef (mergeSubscribedChange subscribed) (changeSub, changeSubd)
23121695
2313−newEventEnv :: IO (EventEnv x)
2314−newEventEnv = do
1696+-- | Run an event action outside of a frame
1697+runFrame :: EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1698+runFrame a = SpiderHost $ ask >>= \spiderEnv -> lift $ do
1699+ -- 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
1700+ pendingCleanups <- atomicModifyIORef (_spiderEnv_cleanups spiderEnv) $ \x -> ([], x)
1701+ {-# SCC "cleanups" #-} sequence_ pendingCleanups
23151702 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
23161703 holdInitRef <- newIORef []
2317− dynInitRef <- newIORef []
23181704 mergeUpdateRef <- newIORef []
23191705 mergeInitRef <- newIORef []
23201706 heightRef <- newIORef zeroHeight
23211707 toClearRef <- newIORef []
2322− toClearIntRef <- newIORef []
23231708 toClearRootRef <- newIORef []
23241709 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)
1710+ delayedRef <- liftIO $ newIORef IntMap.empty
1711+ let env = EventEnv spiderEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
23461712 let go = do
23471713 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
1714+ 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
23491715 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
1716+ result <- runEventM go env
1717+ toClear <- readIORef toClearRef
1718+ forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
1719+ toClearRoot <- readIORef toClearRootRef
1720+ forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1721+ toAssign <- readIORef toAssignRef
23581722 toReconnectRef <- newIORef []
2359− coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
1723+ coincidenceInfos <- readIORef coincidenceInfosRef
23601724 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
23611725 writeIORef vRef v
2362− traceInvalidate $ "Invalidating Hold"
1726+ when debugInvalidate $ putStrLn $ "Invalidating Hold"
23631727 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"
1728+ mergeUpdates <- readIORef mergeUpdateRef
1729+ writeIORef mergeUpdateRef []
1730+ let updateMerge :: SomeMergeUpdate -> IO [SomeEventSubscription]
1731+ updateMerge (SomeMergeUpdate (R.PatchDMap p :: R.PatchDMap (DMap k Event)) m) = do
1732+ oldParents <- readIORef $ mergeSubscribedParents m
1733+ let f (subscriptionsToKill, ps) (k :=> Compose me) = do
1734+ (mOldSubd, newPs) <- case me of
1735+ Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1736+ Just e -> do
1737+ s <- liftIO $ newSubscriberMerge k m
1738+ subscription@(EventSubscription _ subd) <- subscribe e s
1739+ let newParent = MergeSubscribedParent subscription s
1740+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
1741+ liftIO $ addMergeHeight newParentHeight m
1742+ return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1743+ forM_ mOldSubd $ \oldSubd -> do
1744+ oldHeight <- liftIO $ readIORef $ eventSubscribedHeightRef $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1745+ liftIO $ removeMergeHeight oldHeight m
1746+ return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1747+ (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
1748+ writeIORef (mergeSubscribedParents m) $! newParents
1749+ return subscriptionsToKill
1750+ when debugPropagate $ putStrLn "Updating merges"
1751+ mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
1752+ when debugPropagate $ putStrLn "Updating merges done"
23691753 toReconnect <- readIORef toReconnectRef
2370− clearEventEnv env
23711754 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23721755 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
23731756 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2374− traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1757+ when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
23751758 finalize wi
23761759 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
23771760 wi' <- mkWeakPtrWithDebug i "wi'"
23781761 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
23791762 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
1763+ writeIORef holdInitRef [] --TODO: Should we reuse this?
1764+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
1765+ 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
23831766 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
23841767 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
1768+ subscription <- runReaderT (unSpiderHost (runFrame ({-# SCC "subscribeSwitch" #-} subscribe e sub))) spiderEnv --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
23861769 {-
23871770 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1771+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23891772 EventRoot _ -> "EventRoot"
23901773 EventNever -> "EventNever"
23911774 _ -> "something else"
23921775 -}
23931776 writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
2394− return oldSubscription
2395− liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
2396− liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
1777+ return $ SomeEventSubscription oldSubscription
1778+ forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1779+ forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
23971780 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23981781 EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
2399− parentHeight <- getEventSubscribedHeight subd'
1782+ parentHeight <- readIORef $ eventSubscribedHeightRef subd'
24001783 myHeight <- readIORef $ switchSubscribedHeight subscribed
24011784 when (parentHeight /= myHeight) $ do
24021785 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
1786+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1787+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> do
1788+ 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
24051789 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24061790 unsubscribe subscription
24071791 mapM_ invalidateCoincidenceHeight mcs
24081792 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
2409− mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
1793+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> revalidateMergeHeight m
24101794 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
24111795 height <- calculateSwitchHeight subscribed
24121796 updateSwitchHeight height subscribed
@@ -2422,12 +1806,10 @@ zeroHeight = Height 0
24221806invalidHeight :: Height
24231807invalidHeight = Height (-1000)
24241808
2425−#ifdef DEBUG_CYCLES
24261809-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
24271810{-# INLINE invalidHeightBeingTraversed #-}
24281811invalidHeightBeingTraversed :: Height
24291812invalidHeightBeingTraversed = Height (-1001)
2430−#endif
24311813
24321814{-# INLINE succHeight #-}
24331815succHeight :: Height -> Height
@@ -2436,42 +1818,152 @@ succHeight h@(Height a) =
24361818 then invalidHeight
24371819 else Height $ succ a
24381820
2439−invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1821+invalidateSubscriberHeight :: Height -> Subscriber a -> IO ()
1822+invalidateSubscriberHeight old s = case s of
1823+ SubscriberPush _ subscribed -> do
1824+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1825+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ invalidateSubscriberHeight old
1826+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1827+ SubscriberMerge _ subscribed -> do
1828+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1829+ removeMergeHeight old subscribed
1830+ invalidateMergeHeight subscribed
1831+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1832+ SubscriberMergeChange _ -> return () -- Doesn't affect the height of the merge, because its changes are delayed
1833+ SubscriberFan subscribed -> do
1834+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1835+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1836+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
1837+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1838+ SubscriberHold _ -> return ()
1839+ SubscriberHoldIdentity _ -> return ()
1840+ SubscriberSwitch subscribed -> do
1841+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1842+ oldHeight <- readIORef $ switchSubscribedHeight subscribed
1843+ when (oldHeight /= invalidHeight) $ do
1844+ writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1845+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1846+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1847+ SubscriberCoincidenceOuter subscribed -> do
1848+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1849+ invalidateCoincidenceHeight subscribed
1850+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1851+ SubscriberCoincidenceInner subscribed -> do
1852+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1853+ invalidateCoincidenceHeight subscribed
1854+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1855+ SubscriberHandle -> return ()
1856+
1857+removeMergeHeight :: Height -> MergeSubscribed k -> IO ()
1858+removeMergeHeight oldParentHeight subscribed = do
1859+ when debugInvalidateHeight $ putStrLn $ "removeMergeHeight: " <> show oldParentHeight <> " Merge" <> showNodeId subscribed
1860+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1861+ let newHeights = heightBagRemove oldParentHeight oldHeights
1862+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1863+
1864+invalidateMergeHeight :: MergeSubscribed k -> IO ()
1865+invalidateMergeHeight subscribed = do
1866+ oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1867+ -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1868+ when (oldHeight /= invalidHeight) $ do
1869+ writeIORef (mergeSubscribedHeight subscribed) $! invalidHeight
1870+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1871+
1872+addMergeHeight :: Height -> MergeSubscribed k -> IO ()
1873+addMergeHeight newParentHeight subscribed = do
1874+ when debugInvalidateHeight $ putStrLn $ "addMergeHeight: " <> show newParentHeight <> " Merge" <> showNodeId subscribed
1875+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1876+ let newHeights = heightBagAdd newParentHeight oldHeights
1877+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1878+
1879+revalidateMergeHeight :: MergeSubscribed k -> IO ()
1880+revalidateMergeHeight subscribed = do
1881+ currentHeight <- readIORef $ mergeSubscribedHeight subscribed
1882+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1883+ heights <- readIORef $ mergeSubscribedHeightBag subscribed
1884+ parents <- readIORef $ mergeSubscribedParents subscribed
1885+ -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1886+ case heightBagSize heights `compare` DMap.size parents of
1887+ LT -> return ()
1888+ EQ -> do
1889+ let height = succHeight $ heightBagMax heights
1890+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1891+ writeIORef (mergeSubscribedHeight subscribed) $! height
1892+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1893+ GT -> error $ "revalidateMergeHeight: more heights than parents for Merge" <> showNodeId subscribed
1894+
1895+invalidateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
24401896invalidateCoincidenceHeight subscribed = do
24411897 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24421898 when (oldHeight /= invalidHeight) $ do
24431899 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
2445−
2446−updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
1900+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1901+
1902+recalculateSubscriberHeight :: Height -> Subscriber a -> IO ()
1903+recalculateSubscriberHeight new s = case s of
1904+ SubscriberPush _ subscribed -> do
1905+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1906+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1907+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1908+ SubscriberMerge _ subscribed -> do
1909+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1910+ addMergeHeight new subscribed
1911+ revalidateMergeHeight subscribed
1912+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1913+ SubscriberMergeChange _ -> return ()
1914+ SubscriberFan subscribed -> do
1915+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1916+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1917+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
1918+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1919+ SubscriberHold _ -> return ()
1920+ SubscriberHoldIdentity _ -> return ()
1921+ SubscriberSwitch subscribed -> do
1922+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1923+ updateSwitchHeight new subscribed
1924+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1925+ SubscriberCoincidenceOuter subscribed -> do
1926+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1927+ recalculateCoincidenceHeight subscribed
1928+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1929+ SubscriberCoincidenceInner subscribed -> do
1930+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1931+ recalculateCoincidenceHeight subscribed
1932+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1933+ SubscriberHandle -> return ()
1934+
1935+updateSwitchHeight :: Height -> SwitchSubscribed a -> IO ()
24471936updateSwitchHeight new subscribed = do
24481937 oldHeight <- readIORef $ switchSubscribedHeight subscribed
24491938 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24501939 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24511940 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1941+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24531942
2454−recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1943+recalculateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
24551944recalculateCoincidenceHeight subscribed = do
24561945 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24571946 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24581947 height <- calculateCoincidenceHeight subscribed
24591948 when (height /= invalidHeight) $ do
24601949 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1950+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1951+
1952+getEventSubscribedHeight :: EventSubscribed a -> IO Height
1953+getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
24621954
2463−calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
2464−calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
1955+calculateSwitchHeight :: SwitchSubscribed a -> IO Height
1956+calculateSwitchHeight subscribed = readIORef . eventSubscribedHeightRef . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
24651957
2466−calculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO Height
1958+calculateCoincidenceHeight :: CoincidenceSubscribed a -> IO Height
24671959calculateCoincidenceHeight subscribed = do
2468− outerHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
2469− innerHeight <- maybe (return zeroHeight) getEventSubscribedHeight =<< readIORef (coincidenceSubscribedInnerParent subscribed)
1960+ outerHeight <- readIORef $ eventSubscribedHeightRef $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1961+ innerHeight <- maybe (return zeroHeight) (readIORef . eventSubscribedHeightRef) =<< readIORef (coincidenceSubscribedInnerParent subscribed)
24701962 return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
24711963
2472−data SomeSwitchSubscribed x = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed x a)
1964+data SomeSwitchSubscribed = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed a)
24731965
2474−invalidate :: IORef [SomeSwitchSubscribed x] -> WeakList (Invalidator x) -> IO (WeakList (Invalidator x))
1966+invalidate :: IORef [SomeSwitchSubscribed] -> WeakList Invalidator -> IO (WeakList Invalidator)
24751967invalidate toReconnectRef wis = do
24761968 forM_ wis $ \wi -> do
24771969 mi <- deRefWeak wi
@@ -2497,329 +1989,166 @@ invalidate toReconnectRef wis = do
24971989-- Reflex integration
24981990--------------------------------------------------------------------------------
24991991
2500−-- | Designates the default, global Spider timeline
2501−data SpiderTimeline x
2502−type role SpiderTimeline nominal
2503−
2504−-- | The default, global Spider environment
2505−type Spider = SpiderTimeline Global
2506−
2507−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
2508− {-# INLINABLE sample #-}
2509− sample (SpiderBehavior b) = readBehaviorUntracked b
1992+type Spider = SpiderEnv Global
25101993
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
1994+data Global
25291995
2530−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531− {-# INLINABLE sample #-}
2532− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
1996+{-# NOINLINE globalSpiderEnv #-}
1997+globalSpiderEnv :: SpiderEnv Global
1998+globalSpiderEnv = unsafePerformIO unsafeNewSpiderEnv
25331999
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
2000+type role SpiderEnv nominal
2001+data SpiderEnv x = SpiderEnv
2002+ { _spiderEnv_toUnsubscribe :: !(IORef [SomeEventSubscription])
2003+ , _spiderEnv_lock :: !(MVar ())
2004+ , _spiderEnv_cleanups :: !(IORef [IO ()])
2005+#ifdef DEBUG
2006+ , _spiderEnv_depth :: !(IORef Int)
2007+#endif
2008+ }
25482009
2010+instance GEq SpiderEnv where
2011+ a `geq` b = if _spiderEnv_toUnsubscribe a == _spiderEnv_toUnsubscribe b
2012+ then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderEnv can't have two different 'x' arguments
2013+ else Nothing
25492014
2550−instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
2551− {-# INLINE return #-}
2552− return = pure
2553− {-# INLINE (>>=) #-}
2554− x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
2555− {-# INLINE (>>) #-}
2556− (>>) = (*>)
2557−#if !MIN_VERSION_base(4,13,0)
2558− {-# INLINE fail #-}
2559− fail _ = error "Dynamic does not support 'fail'"
2015+unsafeNewSpiderEnv :: forall x. IO (SpiderEnv x)
2016+unsafeNewSpiderEnv = do
2017+ toUnsubscribe <- newIORef []
2018+ lock <- newMVar ()
2019+ cleanups <- newIORef []
2020+#ifdef DEBUG
2021+ depthRef <- newIORef 0
25602022#endif
2561−
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 #-}
2579−
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)
2023+ return $ SpiderEnv
2024+ { _spiderEnv_toUnsubscribe = toUnsubscribe
2025+ , _spiderEnv_lock = lock
2026+ , _spiderEnv_cleanups = cleanups
2027+#ifdef DEBUG
2028+ , _spiderEnv_depth = depthRef
25842029#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
2030+ }
25882031
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
2032+newSpiderEnv :: IO (Some SpiderEnv)
2033+newSpiderEnv = Some.This <$> unsafeNewSpiderEnv
25912034
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
2035+newtype SpiderPullM x a = SpiderPullM { runSpiderPullM :: BehaviorM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
25942036
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
2037+newtype SpiderPushM x a = SpiderPushM { runSpiderPushM :: ComputeM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2038+
2039+instance R.Reflex (SpiderEnv x) where
2040+ newtype Behavior (SpiderEnv x) a = SpiderBehavior { unSpiderBehavior :: Behavior a }
2041+ newtype Event (SpiderEnv x) a = SpiderEvent { unSpiderEvent :: Event a }
2042+ newtype Dynamic (SpiderEnv x) a = SpiderDynamic { unSpiderDynamic :: Dynamic Identity a } deriving (Functor, Applicative, Monad)
2043+ newtype Incremental (SpiderEnv x) p a = SpiderIncremental { unSpiderIncremental :: Dynamic p a }
2044+ type PullM (SpiderEnv x) = SpiderPullM x
2045+ type PushM (SpiderEnv x) = SpiderPushM x
2046+ {-# INLINABLE never #-}
2047+ never = SpiderEvent EventNever
2048+ {-# INLINABLE constant #-}
2049+ constant = SpiderBehavior . BehaviorConst
2050+ {-# INLINABLE push #-}
2051+ push f = SpiderEvent . push (coerce f) . unSpiderEvent
2052+ {-# INLINABLE pull #-}
2053+ pull = SpiderBehavior . pull . coerce
2054+ {-# INLINABLE merge #-}
2055+ merge = SpiderEvent . merge . DynamicConst . (unsafeCoerce :: DMap k (R.Event (SpiderEnv x)) -> DMap k Event)
2056+ {-# INLINABLE fan #-}
2057+ fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
2058+ {-# INLINABLE switch #-}
2059+ switch = SpiderEvent . switch . (unsafeCoerce :: Behavior (R.Event (SpiderEnv x) a) -> Behavior (Event a)) . unSpiderBehavior
2060+ {-# INLINABLE coincidence #-}
2061+ coincidence = SpiderEvent . coincidence . (unsafeCoerce :: Event (R.Event (SpiderEnv x) a) -> Event (Event a)) . unSpiderEvent
2062+ {-# INLINABLE current #-}
2063+ current = SpiderBehavior . current . unSpiderDynamic
2064+ {-# INLINABLE updated #-}
2065+ updated = SpiderEvent . fmap runIdentity . updated . unSpiderDynamic
2066+ {-# INLINABLE unsafeBuildDynamic #-}
2067+ unsafeBuildDynamic readV0 v' = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (coerce readV0) $ addIdentity $ unSpiderEvent v'
2068+ {-# INLINABLE unsafeBuildIncremental #-}
2069+ unsafeBuildIncremental readV0 dv = SpiderIncremental $ DynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
2070+ {-# INLINABLE mergeIncremental #-}
2071+ mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic R.PatchDMap (DMap k (R.Event (SpiderEnv x))) -> Dynamic R.PatchDMap (DMap k Event)) . unSpiderIncremental
2072+ {-# INLINABLE currentIncremental #-}
2073+ currentIncremental = SpiderBehavior . current . unSpiderIncremental
2074+ {-# INLINABLE updatedIncremental #-}
2075+ updatedIncremental = SpiderEvent . updated . unSpiderIncremental
2076+ {-# INLINABLE incrementalToDynamic #-}
2077+ incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ current i) $ flip push (updated i) $ \p -> do
2078+ c <- readBehaviorUntracked $ current i
2079+ return $ Identity <$> R.apply p c --TODO: Avoid the redundant 'apply'
25972080
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
2081+instance R.MonadSample (SpiderEnv x) (EventM x) where
2082+ {-# INLINABLE sample #-}
2083+ sample (SpiderBehavior b) = readBehaviorUntracked b
26002084
2601−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
2085+instance R.MonadHold (SpiderEnv x) (EventM x) where
26022086 {-# INLINABLE hold #-}
2603− hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
2087+ hold = holdSpiderEventM
26042088 {-# INLINABLE holdDyn #-}
2605− holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
2089+ holdDyn = holdDynSpiderEventM
26062090 {-# 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
2091+ holdIncremental = holdIncrementalSpiderEventM
2092+
2093+holdSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Behavior (SpiderEnv x) a)
2094+holdSpiderEventM v0 e = fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2095+
2096+holdDynSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Dynamic (SpiderEnv x) a)
2097+holdDynSpiderEventM v0 e = fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2098+
2099+holdIncrementalSpiderEventM :: R.Patch p => a -> R.Event (SpiderEnv x) (p a) -> EventM x (R.Incremental (SpiderEnv x) p a)
2100+holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
26182101
2619−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2102+instance R.MonadHold (SpiderEnv x) (SpiderHost x) where
26202103 {-# INLINABLE hold #-}
2621− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2104+ hold v0 e = R.runHostFrame $ R.hold v0 e
26222105 {-# INLINABLE holdDyn #-}
2623− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2106+ holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
26242107 {-# 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
2108+ holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
2109+
2110+instance R.MonadSample (SpiderEnv x) (SpiderHost x) where
26352111 {-# INLINABLE sample #-}
26362112 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
26372113
2638−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2114+instance R.MonadSample (SpiderEnv x) (SpiderPullM x) where
2115+ {-# INLINABLE sample #-}
2116+ sample = coerce . readBehaviorTracked . unSpiderBehavior
2117+
2118+instance R.MonadSample (SpiderEnv x) (SpiderPushM x) where
26392119 {-# INLINABLE sample #-}
2640− sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
2120+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
26412121
2642−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2122+instance R.MonadHold (SpiderEnv x) (SpiderPushM x) where
26432123 {-# INLINABLE hold #-}
2644− hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
2124+ hold v0 e = R.current <$> R.holdDyn v0 e
26452125 {-# INLINABLE holdDyn #-}
2646− holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
2126+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity e
26472127 {-# 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
2128+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . DynamicHold <$> hold v0 e
26552129
2656−--------------------------------------------------------------------------------
2657−-- Deprecated items
2658−--------------------------------------------------------------------------------
2130+data RootTrigger a = forall k. GCompare k => RootTrigger (SubscriberList a, IORef (DMap k Identity), k a)
2131+newtype SpiderEventHandle a = SpiderEventHandle { unSpiderEventHandle :: EventSubscription a }
26592132
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
2133+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHostFrame x) where
26642134 {-# INLINABLE subscribeEvent #-}
26652135 subscribeEvent e = SpiderHostFrame $ do
2666− --TODO: Unsubscribe eventually (manually and/or with weak ref)
2667− val <- liftIO $ newIORef Nothing
2668− subscription <- subscribe (unSpiderEvent e) $ Subscriber
2669− { subscriberPropagate = \a -> do
2670− liftIO $ writeIORef val $ Just a
2671− scheduleClear val
2672− , subscriberInvalidateHeight = \_ -> return ()
2673− , subscriberRecalculateHeight = \_ -> return ()
2674− }
2675− return $ SpiderEventHandle
2676− { spiderEventHandleSubscription = subscription
2677− , spiderEventHandleValue = val
2678− }
2679−
2680−instance HasSpiderTimeline x => Reflex.Host.Class.ReflexHost (SpiderTimeline x) where
2681− type EventTrigger (SpiderTimeline x) = RootTrigger x
2682− type EventHandle (SpiderTimeline x) = SpiderEventHandle x
2683− type HostFrame (SpiderTimeline x) = SpiderHostFrame x
2684−
2685−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2686− {-# NOINLINE readEvent #-}
2687− readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
2688− result <- readIORef $ spiderEventHandleValue h
2689− touch h
2136+ subscription <- subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2137+ return $ SpiderEventHandle subscription
2138+
2139+instance R.ReflexHost (SpiderEnv x) where
2140+ type EventTrigger (SpiderEnv x) = RootTrigger
2141+ type EventHandle (SpiderEnv x) = SpiderEventHandle
2142+ type HostFrame (SpiderEnv x) = SpiderHostFrame x
2143+
2144+instance R.MonadReadEvent (SpiderEnv x) (ReadPhase x) where
2145+ {-# INLINABLE readEvent #-}
2146+ readEvent h = ReadPhase $ fmap (fmap return) $ liftIO $ do
2147+ let EventSubscription sln subscribed = unSpiderEventHandle h
2148+ result <- readEventSubscribed subscribed
2149+ touch sln
26902150 return result
26912151
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−
28232152instance MonadRef (EventM x) where
28242153 type Ref (EventM x) = Ref IO
28252154 {-# INLINABLE newRef #-}
@@ -2833,8 +2162,7 @@ instance MonadAtomicRef (EventM x) where
28332162 {-# INLINABLE atomicModifyRef #-}
28342163 atomicModifyRef r f = liftIO $ atomicModifyRef r f
28352164
2836−-- | 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)
2165+newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28382166
28392167instance Monad (SpiderHost x) where
28402168 {-# INLINABLE (>>=) #-}
@@ -2843,27 +2171,13 @@ instance Monad (SpiderHost x) where
28432171 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442172 {-# INLINABLE return #-}
28452173 return x = SpiderHost $ return x
2846−#if !MIN_VERSION_base(4,13,0)
2847− {-# INLINABLE fail #-}
2848− fail = MonadFail.fail
2849−#endif
2850−
2851−instance MonadFail (SpiderHost x) where
28522174 {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2175+ fail s = SpiderHost $ fail s
28542176
2855−-- | Run an action affecting the global Spider timeline; this will be guarded by
2856−-- a mutex for that timeline
28572177runSpiderHost :: SpiderHost Global a -> IO a
2858−runSpiderHost (SpiderHost a) = a
2178+runSpiderHost (SpiderHost a) = runReaderT a globalSpiderEnv
28592179
2860−-- | Run an action affecting a given Spider timeline; this will be guarded by a
2861−-- mutex for that timeline
2862−runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimelineEnv x -> IO a
2863−runSpiderHostForTimeline (SpiderHost a) _ = a
2864−
2865−newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866− deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2180+newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28672181
28682182instance Monad (SpiderHostFrame x) where
28692183 {-# INLINABLE (>>=) #-}
@@ -2872,21 +2186,30 @@ instance Monad (SpiderHostFrame x) where
28722186 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732187 {-# INLINABLE return #-}
28742188 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762189 {-# INLINABLE fail #-}
28772190 fail s = SpiderHostFrame $ fail s
2878−#endif
28792191
2880−instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2881− notReadyUntil _ = pure ()
2882− notReady = pure ()
2192+instance R.MonadSample (SpiderEnv x) (SpiderHostFrame x) where
2193+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2194+
2195+addIdentity :: Event a -> Event (Identity a)
2196+--addIdentity = fmap Identity
2197+addIdentity = unsafeCoerce
28832198
2884−newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2199+instance R.MonadHold (SpiderEnv x) (SpiderHostFrame x) where
2200+ {-# INLINABLE hold #-}
2201+ hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2202+ {-# INLINABLE holdDyn #-}
2203+ holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2204+ {-# INLINABLE holdIncremental #-}
2205+ holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2206+
2207+newEventWithTriggerIO :: forall a. (RootTrigger a -> IO (IO ())) -> IO (Event a)
28852208newEventWithTriggerIO f = do
28862209 es <- newFanEventWithTriggerIO $ \Refl -> f
28872210 return $ select es Refl
28882211
2889−newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2212+newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger a -> IO (IO ())) -> IO (EventSelector k)
28902213newFanEventWithTriggerIO f = do
28912214 occRef <- newIORef DMap.empty
28922215 subscribedRef <- newIORef DMap.empty
@@ -2895,9 +2218,47 @@ newFanEventWithTriggerIO f = do
28952218 , rootSubscribed = subscribedRef
28962219 , rootInit = f
28972220 }
2898− return $ EventSelector $ \k -> eventRoot k r
2221+ return $ EventSelector $ \k -> EventRoot k r
2222+
2223+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHost x) where
2224+ newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
2225+ newFanEventWithTrigger f = SpiderHost $ lift $ do
2226+ es <- newFanEventWithTriggerIO f
2227+ return $ R.EventSelector $ SpiderEvent . select es
2228+
2229+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHostFrame x) where
2230+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2231+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2232+ es <- newFanEventWithTriggerIO f
2233+ return $ R.EventSelector $ SpiderEvent . select es
2234+
2235+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHost x) where
2236+ {-# INLINABLE subscribeEvent #-}
2237+ subscribeEvent = subscribeEventSpiderHost
2238+
2239+subscribeEventSpiderHost :: R.Event (SpiderEnv x) a -> SpiderHost x (R.EventHandle (SpiderEnv x) a)
2240+subscribeEventSpiderHost e = do
2241+ subscription <- runFrame $ subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2242+ return $ SpiderEventHandle subscription
2243+
2244+newtype ReadPhase x a = ReadPhase { runReadPhase :: ResultM x a } deriving (Functor, Applicative, Monad, MonadFix)
2245+
2246+instance R.MonadSample (SpiderEnv x) (ReadPhase x) where
2247+ {-# INLINABLE sample #-}
2248+ sample = ReadPhase . R.sample
28992249
2900−newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
2250+instance R.MonadHold (SpiderEnv x) (ReadPhase x) where
2251+ {-# INLINABLE hold #-}
2252+ hold v0 e = ReadPhase $ R.hold v0 e
2253+ {-# INLINABLE holdDyn #-}
2254+ holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2255+ {-# INLINABLE holdIncremental #-}
2256+ holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2257+
2258+instance R.MonadReflexHost (SpiderEnv x) (SpiderHost x) where
2259+ type ReadPhase (SpiderHost x) = ReadPhase x
2260+ fireEventsAndRead es (ReadPhase a) = run es a
2261+ runHostFrame = runFrame . runSpiderHostFrame
29012262
29022263instance MonadRef (SpiderHost x) where
29032264 type Ref (SpiderHost x) = Ref IO
@@ -2916,15 +2277,3 @@ instance MonadRef (SpiderHostFrame x) where
29162277
29172278instance MonadAtomicRef (SpiderHostFrame x) where
29182279 atomicModifyRef r = SpiderHostFrame . atomicModifyRef r
2919−
2920−instance PrimMonad (SpiderHostFrame x) where
2921− type PrimState (SpiderHostFrame x) = PrimState IO
2922− primitive = SpiderHostFrame . EventM . primitive
2923−
2924−instance NotReady (SpiderTimeline x) (SpiderHost x) where
2925− notReadyUntil _ = return ()
2926− notReady = return ()
2927−
2928−instance HasSpiderTimeline x => NotReady (SpiderTimeline x) (PerformEventT (SpiderTimeline x) (SpiderHost x)) where
2929− notReadyUntil _ = return ()
2930− notReady = return ()