@@ -9,125 +9,68 @@
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 #-}
21+module Reflex.Spider.Internal (Spider, SpiderEnv (..), Global, SpiderHost, runSpiderHost, SpiderEventHandle (..), showSubscriberType, showEventType, ComputeM (..), MergeSubscribedParent (..), HasSpiderEnv (..), newSpiderEnv, SpiderPullM (..), SpiderPushM (..), ReadPhase (..)) where
2322
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
23+import Data.WeakBag (WeakBag, WeakBagTicket)
24+import qualified Data.WeakBag as WeakBag
25+import qualified Reflex.Class as R
26+import qualified Reflex.Host.Class as R
3127
32−#if MIN_VERSION_base(4,10,0)
33−import Control.Applicative (liftA2)
34−#endif
28+import Control.Applicative
3529import Control.Concurrent
3630import Control.Exception
37−import Control.Monad hiding (forM, forM_, mapM, mapM_)
31+import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
3832import Control.Monad.Exception
39−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
40−import Control.Monad.Primitive
41−import Control.Monad.Reader.Class
42−import Control.Monad.IO.Class
43−import Control.Monad.ReaderIO
33+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
34+import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
4435import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
46−import qualified Control.Monad.Fail as MonadFail
36+import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
4737import Data.Align
48−import Data.Coerce
49−import Data.Dependent.Map (DMap)
38+import Data.Dependent.Map (DMap, DSum (..))
5039import 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
54−import Data.Foldable hiding (concat, elem, sequence_)
55−import Data.Functor.Constant
56−import Data.Functor.Misc
57−import Data.Functor.Product
40+import Data.Foldable
41+import Data.Function
42+import Data.Functor.Compose
5843import Data.GADT.Compare
5944import Data.IntMap.Strict (IntMap)
6045import qualified Data.IntMap.Strict as IntMap
6146import Data.IORef
62−import Data.Kind (Type)
63−import Data.Maybe hiding (mapMaybe)
64−import Data.Monoid (mempty, (<>))
65−import Data.Proxy
47+import Data.List
48+import Data.Maybe
49+import Data.Monoid ((<>))
50+import Data.Some (Some)
51+import qualified Data.Some as Some
6652import Data.These
6753import Data.Traversable
68−import Data.Type.Equality ((:~:)(Refl))
69−import Data.Witherable (Filterable, mapMaybe)
70−import GHC.Exts hiding (toList)
54+import System.Mem.Weak
55+
56+import GHC.Base (IO (..))
7157import GHC.IORef (IORef (..))
7258import GHC.Stack
73−import Reflex.FastWeak
59+
60+import Control.Monad.Primitive
61+import Data.Coerce
7462import System.IO.Unsafe
75−import System.Mem.Weak
7663import Unsafe.Coerce
7764
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−
9165import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
9266import qualified Data.List.NonEmpty as NonEmpty
9367import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
9568
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
97−import qualified Data.FastWeakBag as FastWeakBag
69+-- Note: must come last to silence warnings due to AMP on GHC < 7.10
70+import Prelude hiding (any, concat, mapM, mapM_, sequence)
9871
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)
104−import qualified Data.WeakBag as WeakBag
105−import qualified Reflex.Class
106−import 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
122−
123−#ifdef DEBUG_TRACE_EVENTS
124−withStackOneLine :: (BS8.ByteString -> a) -> a
125−withStackOneLine expr = unsafePerformIO $ do
126− stack <- currentCallStack
127− return (expr . BS8.pack . unwords . dropInternal . reverse $ stack)
128− where dropInternal = filterStack "Reflex.Spider.Internal"
129−
130−#endif
72+type SubscriberList a = WeakBag (Subscriber a)
73+type SubscriberListTicket a = WeakBagTicket (Subscriber a)
13174
13275debugPropagate :: Bool
13376
@@ -136,65 +79,52 @@ debugInvalidateHeight :: Bool
13679debugInvalidate :: Bool
13780
13881#ifdef DEBUG
82+
13983#define DEBUG_NODEIDS
14084
141−#ifdef DEBUG_TRACE_PROPAGATION
14285debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
14686
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
15087debugInvalidateHeight = False
151−#endif
15288
153−#ifdef DEBUG_TRACE_INVALIDATION
15489debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
15890
15991class HasNodeId a where
16092 getNodeId :: a -> Int
16193
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
94+instance HasNodeId (Hold p a) where
16995 getNodeId = holdNodeId
17096
171−instance HasNodeId (SwitchSubscribed x a) where
97+instance HasNodeId (PushSubscribed a b) where
98+ getNodeId = pushSubscribedNodeId
99+
100+instance HasNodeId (SwitchSubscribed a) where
172101 getNodeId = switchSubscribedNodeId
173102
174−instance HasNodeId (FanSubscribed x v a) where
103+instance HasNodeId (MergeSubscribed a) where
104+ getNodeId = mergeSubscribedNodeId
105+
106+instance HasNodeId (FanSubscribed a) where
175107 getNodeId = fanSubscribedNodeId
176108
177−instance HasNodeId (CoincidenceSubscribed x a) where
109+instance HasNodeId (CoincidenceSubscribed a) where
178110 getNodeId = coincidenceSubscribedNodeId
179111
180−instance HasNodeId (RootSubscribed x a) where
112+instance HasNodeId (RootSubscribed a) where
181113 getNodeId = rootSubscribedNodeId
182114
183−instance HasNodeId (Pull x a) where
115+instance HasNodeId (Pull a) where
184116 getNodeId = pullNodeId
185117
186118{-# INLINE showNodeId #-}
187119showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
192−
120+showNodeId = ("#"<>) . show . getNodeId
193121
194122#else
195123
196124debugPropagate = False
125+
197126debugInvalidateHeight = False
127+
198128debugInvalidate = False
199129
200130-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -202,10 +132,6 @@ debugInvalidate = False
202132showNodeId :: a -> String
203133showNodeId _ = ""
204134
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209135#endif
210136
211137#ifdef DEBUG_NODEIDS
@@ -215,637 +141,41 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
215141
216142newNodeId :: IO Int
217143newNodeId = 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
233−
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
307−#endif
308− }
309−
310−nowSpiderEventM :: (HasSpiderTimeline x) => EventM x (R.Event (SpiderTimeline x) ())
311−nowSpiderEventM =
312− SpiderEvent <$> now
313−
314−now :: (MonadIO m, Defer (Some Clear) m, HasSpiderTimeline x
315− ) => m (Event x ())
316−now = do
317− nowOrNot <- liftIO $ newIORef $ Just ()
318− scheduleClear nowOrNot
319− return . Event $ \_ -> do
320− occ <- liftIO . readIORef $ nowOrNot
321− return ( EventSubscription (return ()) eventSubscribedNow
322− , occ
323− )
324−
325−-- | Construct an 'Event' whose value is guaranteed not to be recomputed
326−-- repeatedly
327−--
328−--TODO: Try a caching strategy where we subscribe directly to the parent when
329−--there's only one subscriber, and then build our own FastWeakBag only when a second
330−--subscriber joins
331−{-# NOINLINE [0] cacheEvent #-}
332−cacheEvent :: forall x a. HasSpiderTimeline x => Event x a -> Event x a
333−cacheEvent e =
334−#ifdef DEBUG_TRACE_EVENTS
335− withStackOneLine $ \callSite -> Event $
336−#else
337− Event $
338−#endif
339− unsafePerformIO $ do
340− mSubscribedRef :: IORef (FastWeak (CacheSubscribed x a))
341− <- newIORef emptyFastWeak
342− pure $ \sub -> {-# SCC "cacheEvent" #-} do
343−#ifdef DEBUG_TRACE_EVENTS
344− unless (BS8.null callSite) $ liftIO $ BS8.hPutStrLn stderr callSite
345−#endif
346− subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347− Just subscribedTicket -> return subscribedTicket
348− Nothing -> do
349−#ifdef DEBUG_NODEIDS
350− nodeId <- liftIO newNodeId
351−#endif
352− subscribers <- liftIO FastWeakBag.empty
353− occRef <- liftIO $ newIORef Nothing -- This should never be read prior to being set below
354−#ifdef DEBUG_NODEIDS
355− (parentSub, occ) <- subscribeAndRead e $ debugSubscriber' ("cacheEvent" <> showNodeId' nodeId) $ Subscriber
356−#else
357− (parentSub, occ) <- subscribeAndRead e $ Subscriber
358−#endif
359− { subscriberPropagate = \a -> do
360− liftIO $ writeIORef occRef (Just a)
361− scheduleClear occRef
362− propagateFast a subscribers
363− , subscriberInvalidateHeight = FastWeakBag.traverse_ subscribers . invalidateSubscriberHeight
364− , subscriberRecalculateHeight = FastWeakBag.traverse_ subscribers . recalculateSubscriberHeight
365− }
366− when (isJust occ) $ do
367− liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368− scheduleClear occRef
369− let !subscribed = CacheSubscribed
370− { _cacheSubscribed_subscribers = subscribers
371− , _cacheSubscribed_parent = parentSub
372− , _cacheSubscribed_occurrence = occRef
373−#ifdef DEBUG_NODEIDS
374− , _cacheSubscribed_nodeId = nodeId
375−#endif
376− }
377− subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378− liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379− return subscribedTicket
380− liftIO $ cacheSubscription sub mSubscribedRef subscribedTicket
381−
382−cacheSubscription :: Subscriber x a -> IORef (FastWeak (CacheSubscribed x a))
383− -> FastWeakTicket (CacheSubscribed x a) -> IO (EventSubscription x, Maybe a)
384−cacheSubscription sub mSubscribedRef subscribedTicket = do
385− subscribed <- getFastWeakTicketValue subscribedTicket
386− ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
387− occ <- readIORef $ _cacheSubscribed_occurrence subscribed
388−
389− let parentSub = _cacheSubscribed_parent subscribed
390− es = EventSubscription
391− { _eventSubscription_unsubscribe = do
392− FastWeakBag.remove ticket
393−
394− isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
395− when isEmpty $ do
396− writeIORef mSubscribedRef emptyFastWeak
397− unsubscribe parentSub
398− touch ticket
399− touch subscribedTicket
400− , _eventSubscription_subscribed = EventSubscribed
401− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub
402− , eventSubscribedRetained = toAny subscribedTicket
403−#ifdef DEBUG_CYCLES
404− , eventSubscribedGetParents = return [_eventSubscription_subscribed parentSub]
405− , eventSubscribedHasOwnHeightRef = False
406− , eventSubscribedWhoCreated = whoCreatedIORef mSubscribedRef
407−#endif
408− }
409− }
410− return (es, occ)
411−
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− }
473144
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
145+{-# NOINLINE unsafeNodeId #-}
146+unsafeNodeId :: a -> Int
147+unsafeNodeId a = unsafePerformIO $ do
148+ touch a
149+ newNodeId
629150#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−--------------------------------------------------------------------------------
786151
152+--TODO: Figure out why certain things are not 'representational', then make them representational so we can use coerce
787153--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
154+data Hold p a
155+ = Hold { holdValue :: !(IORef a)
156+ , holdInvalidators :: !(IORef [Weak Invalidator])
157+ , 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
793158#ifdef DEBUG_NODEIDS
794159 , holdNodeId :: Int
795160#endif
796161 }
797162
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−
829163data 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])
164+ = EventEnv { eventEnvSpiderEnv :: !(SpiderEnv x)
165+ , eventEnvAssignments :: !(IORef [SomeAssignment]) -- Needed for Subscribe
166+ , eventEnvHoldInits :: !(IORef [SomeHoldInit]) -- Needed for Subscribe
167+ , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate])
168+ , eventEnvMergeInits :: !(IORef [SomeMergeInit]) -- Needed for Subscribe
169+ , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
170+ , eventEnvRootClears :: !(IORef [SomeRootClear])
838171 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
839− , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
840− , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
172+ , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence]) -- Needed for Subscribe
173+ , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge]))
841174 }
842175
843176{-# 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))
177+runEventM :: EventM x a -> EventEnv x -> IO a
178+runEventM = runReaderT . unEventM
849179
850180class MonadIO m => Defer a m where
851181 getDeferralQueue :: m (IORef [a])
@@ -856,98 +186,90 @@ defer a = do
856186 q <- getDeferralQueue
857187 liftIO $ modifyIORef' q (a:)
858188
859−instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
189+instance Defer SomeAssignment (EventM x) where
860190 {-# INLINE getDeferralQueue #-}
861− getDeferralQueue = asksEventEnv eventEnvAssignments
191+ getDeferralQueue = EventM $ asks eventEnvAssignments
862192
863−instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
193+instance Defer SomeHoldInit (EventM x) where
864194 {-# INLINE getDeferralQueue #-}
865− getDeferralQueue = asksEventEnv eventEnvHoldInits
195+ getDeferralQueue = EventM $ asks eventEnvHoldInits
866196
867−instance HasSpiderTimeline x => Defer (SomeDynInit x) (EventM x) where
868− {-# INLINE getDeferralQueue #-}
869− getDeferralQueue = asksEventEnv eventEnvDynInits
870−
871−instance Defer (SomeHoldInit x) (BehaviorM x) where
197+instance Defer SomeHoldInit BehaviorM where
872198 {-# INLINE getDeferralQueue #-}
873199 getDeferralQueue = BehaviorM $ asks snd
874200
875−instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
201+instance Defer SomeMergeUpdate (EventM x) where
876202 {-# INLINE getDeferralQueue #-}
877− getDeferralQueue = asksEventEnv eventEnvMergeUpdates
203+ getDeferralQueue = EventM $ asks eventEnvMergeUpdates
878204
879−instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
205+instance Defer SomeMergeInit (EventM x) where
880206 {-# INLINE getDeferralQueue #-}
881− getDeferralQueue = asksEventEnv eventEnvMergeInits
207+ getDeferralQueue = EventM $ asks eventEnvMergeInits
882208
883−class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
209+class HasCurrentHeight m where
884210 getCurrentHeight :: m Height
885− scheduleMerge :: Height -> EventM x () -> m ()
211+ scheduleMerge :: Height -> MergeSubscribed a -> m ()
886212
887−instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
213+instance HasCurrentHeight (EventM x) where
888214 {-# INLINE getCurrentHeight #-}
889− getCurrentHeight = do
890− heightRef <- asksEventEnv eventEnvCurrentHeight
215+ getCurrentHeight = EventM $ do
216+ heightRef <- asks eventEnvCurrentHeight
891217 liftIO $ readIORef heightRef
892218 {-# INLINE scheduleMerge #-}
893− scheduleMerge height subscribed = do
894− delayedRef <- asksEventEnv eventEnvDelayedMerges
895− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
219+ scheduleMerge height subscribed = EventM $ do
220+ delayedRef <- asks eventEnvDelayedMerges
221+ liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
222+
223+class HasSpiderEnv x m | m -> x where
224+ askSpiderEnv :: m (SpiderEnv x)
896225
897−class HasSpiderTimeline x where
898− -- | Retrieve the current SpiderTimelineEnv
899− spiderTimeline :: SpiderTimelineEnv x
226+instance HasSpiderEnv x (EventM x) where
227+ {-# INLINE askSpiderEnv #-}
228+ askSpiderEnv = EventM $ asks eventEnvSpiderEnv
900229
901−instance HasSpiderTimeline Global where
902− spiderTimeline = globalSpiderTimelineEnv
230+instance HasSpiderEnv x (SpiderHost x) where
231+ {-# INLINE askSpiderEnv #-}
232+ askSpiderEnv = SpiderHost ask
903233
904−putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
905−putCurrentHeight h = do
906− heightRef <- asksEventEnv eventEnvCurrentHeight
234+putCurrentHeight :: Height -> EventM x ()
235+putCurrentHeight h = EventM $ do
236+ heightRef <- asks eventEnvCurrentHeight
907237 liftIO $ writeIORef heightRef $! h
908238
909−instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
239+instance Defer SomeClear (EventM x) where
910240 {-# INLINE getDeferralQueue #-}
911− getDeferralQueue = asksEventEnv eventEnvClears
241+ getDeferralQueue = EventM $ asks eventEnvClears
912242
913243{-# INLINE scheduleClear #-}
914−scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
915−scheduleClear r = defer $ Some $ Clear r
244+scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
245+scheduleClear r = defer $ SomeClear r
916246
917−instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
247+instance Defer SomeRootClear (EventM x) where
918248 {-# INLINE getDeferralQueue #-}
919− getDeferralQueue = asksEventEnv eventEnvIntClears
920−
921−{-# INLINE scheduleIntClear #-}
922−scheduleIntClear :: Defer (Some IntClear) m => IORef (IntMap a) -> m ()
923−scheduleIntClear r = defer $ Some $ IntClear r
924−
925−instance HasSpiderTimeline x => Defer (Some RootClear) (EventM x) where
926− {-# INLINE getDeferralQueue #-}
927− getDeferralQueue = asksEventEnv eventEnvRootClears
249+ getDeferralQueue = EventM $ asks eventEnvRootClears
928250
929251{-# INLINE scheduleRootClear #-}
930−scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
931−scheduleRootClear r = defer $ Some $ RootClear r
252+scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
253+scheduleRootClear r = defer $ SomeRootClear r
932254
933−instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
255+instance Defer SomeResetCoincidence (EventM x) where
934256 {-# INLINE getDeferralQueue #-}
935− getDeferralQueue = asksEventEnv eventEnvResetCoincidences
257+ getDeferralQueue = EventM $ asks eventEnvResetCoincidences
936258
937259-- 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)
260+{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> EventM x (Hold p a) #-}
261+{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> ComputeM (Hold p a) #-}
262+hold :: (R.Patch p, Defer SomeHoldInit m) => a -> Event (p a) -> m (Hold p a)
940263hold v0 e = do
941264 valRef <- liftIO $ newIORef v0
942265 invsRef <- liftIO $ newIORef []
943− parentRef <- liftIO $ newIORef Nothing
266+ parentRef <- liftIO $ newIORef $ Left e
944267#ifdef DEBUG_NODEIDS
945268 nodeId <- liftIO newNodeId
946269#endif
947270 let h = Hold
948271 { holdValue = valRef
949272 , holdInvalidators = invsRef
950− , holdEvent = e
951273 , holdParent = parentRef
952274#ifdef DEBUG_NODEIDS
953275 , holdNodeId = nodeId
@@ -956,115 +278,155 @@ hold v0 e = do
956278 defer $ SomeHoldInit h
957279 return h
958280
281+{-
282+mkWeakIORefKey :: IORef a -> b -> IO () -> IO (Weak b)
283+mkWeakIORefKey r@(IORef (STRef r#)) b (IO f) = IO $ \s ->
284+ case mkWeak# r# b f s of (# s1, w #) -> (# s1, Weak w #)
285+-}
286+
959287{-# INLINE getHoldEventSubscription #-}
960−getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
288+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))
961289getHoldEventSubscription h = do
962290 ep <- liftIO $ readIORef $ holdParent h
963291 case ep of
964− Just subd -> return subd
965− Nothing -> do
966− let e = holdEvent h
292+ Right subd -> return subd
293+ Left e -> do
967294 subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
968− (subscription@(EventSubscription _ _), occ) <- subscribeAndRead e =<< liftIO (newSubscriberHold h)
295+ {-
296+ spiderEnv <- askSpiderEnv
297+ weakSubscriptionRef <- liftIO $ mkWeakIORef subscriptionRef $ return ()
298+ wh <- liftIO $ mkWeakIORefKey (holdValue h) h $ do
299+ msr <- deRefWeak weakSubscriptionRef
300+ forM_ msr $ \sr -> do
301+ subscription <- readIORef sr
302+ atomicModifyIORef (_spiderEnv_toUnsubscribe spiderEnv) $ \x -> (SomeEventSubscription subscription : x, ())
303+-- return ()
304+ {-
305+ -- What can we do? 1) Detect GCs at the SpiderEnv level, then go over the tree
306+ 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
307+-}
308+ -}
309+ subscription@(EventSubscription _ subd) <- subscribe e =<< liftIO (newSubscriberHold h)
969310 liftIO $ writeIORef subscriptionRef $! subscription
311+ occ <- liftIO $ readEventSubscribed subd
970312 case occ of
971313 Nothing -> return ()
972314 Just o -> do
973315 old <- liftIO $ readIORef $ holdValue h
974− case apply o old of
316+ case R.apply o old of
975317 Nothing -> return ()
976318 Just new -> do
977319 -- Need to evaluate these so that we don't retain the Hold itself
978320 v <- liftIO $ evaluate $ holdValue h
979321 i <- liftIO $ evaluate $ holdInvalidators h
980322 defer $ SomeAssignment v i new
981− liftIO $ writeIORef (holdParent h) $ Just subscription
323+ liftIO $ writeIORef (holdParent h) $ Right subscription
982324 return subscription
983325
984−type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
326+type BehaviorEnv = (Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]), IORef [SomeHoldInit])
985327
328+--type role BehaviorM representational
986329-- BehaviorM can sample behaviors
987−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988− deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
330+newtype BehaviorM a = BehaviorM { unBehaviorM :: ReaderT BehaviorEnv IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
989331
990−instance Monad (BehaviorM x) where
332+instance Monad BehaviorM where
991333 {-# INLINE (>>=) #-}
992334 BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
993335 {-# INLINE (>>) #-}
994336 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995337 {-# INLINE return #-}
996338 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998339 {-# INLINE fail #-}
999340 fail s = BehaviorM $ fail s
1000−#endif
1001341
1002−data BehaviorSubscribed x a
1003− = forall p. BehaviorSubscribedHold (Hold x p)
1004− | BehaviorSubscribedPull (PullSubscribed x a)
342+data BehaviorSubscribed a
343+ = forall p. BehaviorSubscribedHold (Hold p a)
344+ | BehaviorSubscribedPull (PullSubscribed a)
1005345
1006−newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
346+data SomeBehaviorSubscribed = forall a. SomeBehaviorSubscribed (BehaviorSubscribed a)
1007347
1008348--type role PullSubscribed representational
1009−data PullSubscribed x a
349+data PullSubscribed a
1010350 = 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
351+ , pullSubscribedInvalidators :: !(IORef [Weak Invalidator])
352+ , pullSubscribedOwnInvalidator :: !Invalidator
353+ , pullSubscribedParents :: ![SomeBehaviorSubscribed] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
1014354 }
1015355
1016356--type role Pull representational
1017−data Pull x a
1018− = Pull { pullValue :: !(IORef (Maybe (PullSubscribed x a)))
1019− , pullCompute :: !(BehaviorM x a)
357+data Pull a
358+ = Pull { pullValue :: !(IORef (Maybe (PullSubscribed a)))
359+ , pullCompute :: !(BehaviorM a)
1020360#ifdef DEBUG_NODEIDS
1021361 , pullNodeId :: Int
1022362#endif
1023363 }
1024364
1025−data Invalidator x
1026− = forall a. InvalidatorPull (Pull x a)
1027− | forall a. InvalidatorSwitch (SwitchSubscribed x a)
365+data Invalidator
366+ = forall a. InvalidatorPull (Pull a)
367+ | forall a. InvalidatorSwitch (SwitchSubscribed a)
1028368
1029−data RootSubscribed x a = forall k. GCompare k => RootSubscribed
369+data RootSubscribed a = forall k. GCompare k => RootSubscribed
1030370 { rootSubscribedKey :: !(k a)
1031− , rootSubscribedCachedSubscribed :: !(IORef (DMap k (RootSubscribed x))) -- From the original Root
1032− , rootSubscribedSubscribers :: !(WeakBag (Subscriber x a))
371+ , rootSubscribedCachedSubscribed :: !(IORef (DMap k RootSubscribed)) -- From the original Root
372+ , rootSubscribedSubscribers :: !(SubscriberList a)
1033373 , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
1034374 , 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?
375+ , 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?
1036376#ifdef DEBUG_NODEIDS
1037377 , rootSubscribedNodeId :: Int
1038378#endif
1039379 }
1040380
1041−data Root x k
381+data Root (k :: * -> *)
1042382 = 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 ()))
383+ , rootSubscribed :: !(IORef (DMap k RootSubscribed))
384+ , rootInit :: !(forall a. k a -> RootTrigger a -> IO (IO ()))
1045385 }
1046386
1047−data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
387+data SomeHoldInit = forall p a. R.Patch p => SomeHoldInit !(Hold p a)
1048388
1049−data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
389+data SomeMergeUpdate = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap (DMap k Event)) (MergeSubscribed k)
1050390
1051−data SomeMergeUpdate x = SomeMergeUpdate
1052− { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
1053− , _someMergeUpdate_invalidateHeight :: !(IO ())
1054− , _someMergeUpdate_recalculateHeight :: !(IO ())
1055− }
391+data SomeMergeInit = forall k. GCompare k => SomeMergeInit !(MergeSubscribed k) !(Event (R.PatchDMap (DMap k Event)))
1056392
1057−newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
393+data SomeEventSubscription = forall a. SomeEventSubscription (EventSubscription a)
1058394
1059395-- 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)
396+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
397+
398+data PushSubscribed a b
399+ = PushSubscribed { pushSubscribedCachedSubscribed :: !(IORef (Maybe (PushSubscribed a b)))
400+ , 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)
401+ , pushSubscribedHeight :: !(IORef Height)
402+ , pushSubscribedSubscribers :: !(SubscriberList b)
403+ , pushSubscribedSelf :: !(Subscriber a) -- Hold this in memory to ensure our WeakReferences don't die --TODO: Probably unneeded now
404+ , pushSubscribedWeakSelf :: !(IORef (Weak (PushSubscribed a b)))
405+ , pushSubscribedParent :: !(EventSubscription a)
406+#ifdef DEBUG_NODEIDS
407+ , pushSubscribedNodeId :: Int
408+#endif
409+ }
1061410
1062−newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
411+newtype ComputeM a = ComputeM { unComputeM :: ReaderT (IORef [SomeHoldInit]) IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1063412
1064−data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
1065− { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
1066− , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
1067− }
413+instance Defer SomeHoldInit ComputeM where
414+ getDeferralQueue = ComputeM ask
415+
416+{-# SPECIALIZE runComputeM :: ComputeM a -> EventM x a #-}
417+runComputeM :: Defer SomeHoldInit m => ComputeM a -> m a
418+runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
419+
420+data Push a b
421+ = 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?)
422+ , pushParent :: !(Event a)
423+ , pushSubscribed :: !(IORef (Maybe (PushSubscribed a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
424+ }
425+
426+data MergeSubscribedParent k a
427+ = MergeSubscribedParent { mergeSubscribedParentSubscription :: !(EventSubscription a)
428+ , mergeSubscribedParentSubscriber :: !(Subscriber a)
429+ }
1068430
1069431data HeightBag = HeightBag
1070432 { _heightBag_size :: {-# UNPACK #-} !Int
@@ -1082,8 +444,7 @@ heightBagFromList :: [Height] -> HeightBag
1082444heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
1083445
1084446heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
447+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1087448
1088449heightBagRemove :: Height -> HeightBag -> HeightBag
1089450heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +453,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
1092453 0 -> IntMap.delete h c
1093454 _ -> IntMap.insert h (pred old) c
1094455
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−
1102456heightBagMax :: HeightBag -> Height
1103457heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
1104458 Just ((h, _), _) -> Height h
@@ -1116,183 +470,364 @@ heightBagVerify b@(HeightBag s c) = if
1116470heightBagVerify = id
1117471#endif
1118472
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)))
473+data MergeSubscribed k
474+ = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed k))) -- From the original merge
475+ , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
476+ , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
477+ , mergeSubscribedHeight :: !(IORef Height)
478+ , mergeSubscribedHeightBag :: !(IORef HeightBag)
479+ , mergeSubscribedSubscribers :: !(SubscriberList (DMap k Identity))
480+ , mergeSubscribedChange :: !(IORef (Subscriber (R.PatchDMap (DMap k Event)), EventSubscribed (R.PatchDMap (DMap k Event))))
481+ , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent k)))
482+ , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed k)))
483+#ifdef DEBUG_NODEIDS
484+ , mergeSubscribedNodeId :: Int
485+#endif
486+ }
487+
488+--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
489+data Merge k
490+ = Merge { mergeParents :: !(Dynamic R.PatchDMap (DMap k Event))
491+ , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed k)))
492+ }
493+
494+data FanSubscribedChildren k a = FanSubscribedChildren
495+ { _fanSubscribedChildren_list :: !(SubscriberList a)
496+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed k)
497+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed k)))
1123498 }
1124499
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)
500+data FanSubscribed k
501+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed k)))
502+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren k))) -- This DMap should never be empty
503+ , fanSubscribedParent :: !(EventSubscription (DMap k Identity))
1130504#ifdef DEBUG_NODEIDS
1131505 , fanSubscribedNodeId :: Int
1132506#endif
1133507 }
1134508
1135−data Fan x k v
1136− = Fan { fanParent :: !(Event x (DMap k v))
1137− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
509+data Fan k
510+ = Fan { fanParent :: !(Event (DMap k Identity))
511+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed k)))
1138512 }
1139513
1140−data SwitchSubscribed x a
1141− = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
514+data SwitchSubscribed a
515+ = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1142516 , switchSubscribedOccurrence :: !(IORef (Maybe a))
1143517 , 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)))
518+ , switchSubscribedSubscribers :: !(SubscriberList a)
519+ , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !Invalidator
520+ , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak Invalidator))
521+ , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed])
522+ , switchSubscribedParent :: !(Behavior (Event a))
523+ , switchSubscribedCurrentParent :: !(IORef (EventSubscription a))
524+ , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed a)))
1151525#ifdef DEBUG_NODEIDS
1152526 , switchSubscribedNodeId :: Int
1153527#endif
1154528 }
1155529
1156−data Switch x a
1157− = Switch { switchParent :: !(Behavior x (Event x a))
1158− , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
530+data Switch a
531+ = Switch { switchParent :: !(Behavior (Event a))
532+ , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1159533 }
1160534
1161−#ifdef USE_TEMPLATE_HASKELL
1162535{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1163−#endif
1164−data CoincidenceSubscribed x a
1165− = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
536+data CoincidenceSubscribed a
537+ = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1166538 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
1167− , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
539+ , coincidenceSubscribedSubscribers :: !(SubscriberList a)
1168540 , 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)))
541+ , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber (Event a))
542+ , coincidenceSubscribedOuterParent :: !(EventSubscription (Event a))
543+ , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed a)))
544+ , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed a)))
1173545#ifdef DEBUG_NODEIDS
1174546 , coincidenceSubscribedNodeId :: Int
1175547#endif
1176548 }
1177549
1178−data Coincidence x a
1179− = Coincidence { coincidenceParent :: !(Event x (Event x a))
1180− , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
550+data Coincidence a
551+ = Coincidence { coincidenceParent :: !(Event (Event a))
552+ , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1181553 }
1182554
1183−{-# NOINLINE newInvalidatorSwitch #-}
1184−newInvalidatorSwitch :: SwitchSubscribed x a -> IO (Invalidator x)
1185−newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
555+data Subscriber a
556+ = forall b. SubscriberPush (a -> ComputeM (Maybe b)) (PushSubscribed a b) --TODO: Why does this have the pushCompute in it?
557+ | forall k. GCompare k => SubscriberMerge !(k a) (MergeSubscribed k) --TODO: Can we inline the GCompare?
558+ | forall k. (a ~ R.PatchDMap (DMap k Event), GCompare k) => SubscriberMergeChange (MergeSubscribed k)
559+ | forall k. (GCompare k, a ~ DMap k Identity) => SubscriberFan (FanSubscribed k)
560+ | forall p b. (a ~ p b, R.Patch p) => SubscriberHold !(Hold p b)
561+ | forall b. (a ~ Identity b) => SubscriberHoldIdentity !(Hold Identity b)
562+ | SubscriberSwitch (SwitchSubscribed a)
563+ | forall b. a ~ Event b => SubscriberCoincidenceOuter (CoincidenceSubscribed b)
564+ | SubscriberCoincidenceInner (CoincidenceSubscribed a)
565+ | SubscriberHandle
566+
567+showSubscriberType :: Subscriber a -> String
568+showSubscriberType = \case
569+ SubscriberPush _ _ -> "SubscriberPush"
570+ SubscriberMerge _ _ -> "SubscriberMerge"
571+ SubscriberFan _ -> "SubscriberFan"
572+ SubscriberMergeChange _ -> "SubscriberMergeChange"
573+ SubscriberHold _ -> "SubscriberHold"
574+ SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
575+ SubscriberSwitch _ -> "SubscriberSwitch"
576+ SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
577+ SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
578+ SubscriberHandle -> "SubscriberHandle"
579+
580+data Event a
581+ = forall k. GCompare k => EventRoot !(k a) !(Root k)
582+ | EventNever
583+ | forall b. EventPush !(Push b a)
584+ | forall k. (GCompare k, a ~ DMap k Identity) => EventMerge !(Merge k)
585+ | forall k. GCompare k => EventFan !(k a) !(Fan k)
586+ | EventSwitch !(Switch a)
587+ | EventCoincidence !(Coincidence a)
588+ | forall p b. (a ~ p b, R.Patch p) => EventHold !(Hold p b)
589+ | forall p b. (a ~ p b, R.Patch p) => EventDyn !(Dyn p b)
590+ | forall b. (a ~ Identity b) => EventHoldIdentity !(Hold Identity b)
591+ | forall b. (a ~ Identity b) => EventDynIdentity !(Dyn Identity b)
592+
593+showEventType :: Event a -> String
594+showEventType = \case
595+ EventRoot _ _ -> "EventRoot"
596+ EventNever -> "EventNever"
597+ EventPush _ -> "EventPush"
598+ EventMerge _ -> "EventMerge"
599+ EventFan _ _ -> "EventFan"
600+ EventSwitch _ -> "EventSwitch"
601+ EventCoincidence _ -> "EventCoincidence"
602+ EventHold _ -> "EventHold"
603+ EventDyn _ -> "EventDyn"
604+ EventHoldIdentity _ -> "EventHoldIdentity"
605+ EventDynIdentity _ -> "EventDynIdentity"
606+
607+data EventSubscription a = EventSubscription
608+ { _eventSubscription_ticket :: !(Maybe (SubscriberListTicket a))
609+ , _eventSubscription_subscribed :: !(EventSubscribed a)
610+ }
1186611
1187−{-# NOINLINE newInvalidatorPull #-}
1188−newInvalidatorPull :: Pull x a -> IO (Invalidator x)
1189−newInvalidatorPull p = return $! InvalidatorPull p
612+data EventSubscribed a
613+ = EventSubscribedRoot {-# NOUNPACK #-} (RootSubscribed a)
614+ | EventSubscribedNever
615+ | forall b. EventSubscribedPush !(PushSubscribed b a)
616+ | forall k. (GCompare k, a ~ DMap k Identity) => EventSubscribedMerge !(MergeSubscribed k)
617+ | forall k. GCompare k => EventSubscribedFan !(k a) !(FanSubscribed k)
618+ | EventSubscribedSwitch !(SwitchSubscribed a)
619+ | EventSubscribedCoincidence !(CoincidenceSubscribed a)
620+
621+unsubscribe :: EventSubscription a -> IO ()
622+unsubscribe (EventSubscription msln _) = forM_ msln $ \sln -> WeakBag.remove sln
623+
624+-- These function are constructor functions that are marked NOINLINE so they are
625+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
626+-- so any weak references that are attached to the constructors will have their
627+-- finalizer run. Using the opaque constructor, does not see the
628+-- constructor application, so it behaves like an IORef and cannot be fused away.
629+--
630+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
631+-- the weak pointer to it in some cases.
1190632
1191−instance HasSpiderTimeline x => Filterable (Event x) where
1192− mapMaybe f = push $ return . f
633+--TODO: I think all of these noinlines are now unnecessary
634+{-# NOINLINE newSubscriberPush #-}
635+newSubscriberPush :: (a -> ComputeM (Maybe b)) -> PushSubscribed a b -> IO (Subscriber a)
636+newSubscriberPush compute subd = return $! SubscriberPush compute subd
1193637
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]
638+{-# RULES
639+ "newSubscriberHold/Identity" forall h. newSubscriberHold h = newSubscriberHoldIdentity h
640+ #-}
641+{-# NOINLINE newSubscriberHold #-}
642+newSubscriberHold :: R.Patch p => Hold p a -> IO (Subscriber (p a))
643+newSubscriberHold h = return $! SubscriberHold h
1201644
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
645+{-# NOINLINE newSubscriberHoldIdentity #-}
646+newSubscriberHoldIdentity :: Hold Identity a -> IO (Subscriber (Identity a))
647+newSubscriberHoldIdentity h = return $! SubscriberHoldIdentity h
648+
649+{-# NOINLINE newSubscriberMerge #-}
650+newSubscriberMerge :: GCompare k => k a -> MergeSubscribed k -> IO (Subscriber a)
651+newSubscriberMerge k subd = return $! SubscriberMerge k subd
652+
653+{-# NOINLINE newSubscriberMergeChange #-}
654+newSubscriberMergeChange :: GCompare k => MergeSubscribed k -> IO (Subscriber (R.PatchDMap (DMap k Event)))
655+newSubscriberMergeChange subd = return $! SubscriberMergeChange subd
656+
657+{-# NOINLINE newSubscriberFan #-}
658+newSubscriberFan :: GCompare k => FanSubscribed k -> IO (Subscriber (DMap k Identity))
659+newSubscriberFan subd = return $! SubscriberFan subd
1208660
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)
661+{-# NOINLINE newSubscriberSwitch #-}
662+newSubscriberSwitch :: SwitchSubscribed a -> IO (Subscriber a)
663+newSubscriberSwitch subd = return $! SubscriberSwitch subd
1212664
1213−newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
665+{-# NOINLINE newSubscriberCoincidenceOuter #-}
666+newSubscriberCoincidenceOuter :: CoincidenceSubscribed b -> IO (Subscriber (Event b))
667+newSubscriberCoincidenceOuter subd = return $! SubscriberCoincidenceOuter subd
1214668
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)
669+{-# NOINLINE newSubscriberCoincidenceInner #-}
670+newSubscriberCoincidenceInner :: CoincidenceSubscribed a -> IO (Subscriber a)
671+newSubscriberCoincidenceInner subd = return $! SubscriberCoincidenceInner subd
672+
673+{-# NOINLINE newInvalidatorSwitch #-}
674+newInvalidatorSwitch :: SwitchSubscribed a -> IO Invalidator
675+newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
676+
677+{-# NOINLINE newInvalidatorPull #-}
678+newInvalidatorPull :: Pull a -> IO Invalidator
679+newInvalidatorPull p = return $! InvalidatorPull p
680+
681+data Dynamic p a
682+ = DynamicHold !(Hold p a)
683+ | p ~ Identity => DynamicHoldIdentity !(Hold Identity a)
684+ | DynamicConst !a
685+ | DynamicDyn !(Dyn p a)
686+ | p ~ Identity => DynamicDynIdentity !(Dyn Identity a)
687+
688+{-# INLINE current #-}
689+current :: R.Patch p => Dynamic p a -> Behavior a
690+current = \case
691+ DynamicHold h -> BehaviorHold h
692+ DynamicHoldIdentity h -> BehaviorHoldIdentity h
693+ DynamicConst a -> BehaviorConst a
694+ DynamicDyn d -> BehaviorDyn d
695+ DynamicDynIdentity d -> BehaviorDynIdentity d
696+
697+--TODO: If you only need updated, not current, can we avoid actually constructing the Hold?
698+{-# INLINE updated #-}
699+updated :: R.Patch p => Dynamic p a -> Event (p a)
700+updated = \case
701+ DynamicHold h -> EventHold h
702+ DynamicHoldIdentity h -> EventHoldIdentity h
703+ DynamicConst _ -> EventNever
704+ DynamicDyn d -> EventDyn d
705+ DynamicDynIdentity d -> EventDynIdentity d
706+
707+newMapDyn :: (a -> b) -> Dynamic Identity a -> Dynamic Identity b
708+newMapDyn f d = DynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ current d) (Identity . f . runIdentity <$> updated d)
709+
710+instance Functor (Dynamic Identity) where
711+ fmap = newMapDyn
712+
713+instance Applicative (Dynamic Identity) where
714+ pure = DynamicConst
715+ (<*>) = zipDynWith ($)
716+ _ *> b = b
717+ a <* _ = a
718+
719+instance R.FunctorMaybe Event where
720+ fmapMaybe f = push $ return . f
721+
722+instance Align Event where
723+ nil = EventNever
724+ align ea eb = R.fmapMaybe R.dmapToThese $ merge $ DynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
1217725
1218726--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)
727+zipDynWith :: (a -> b -> c) -> Dynamic Identity a -> Dynamic Identity b -> Dynamic Identity c
1220728zipDynWith f da db =
1221− let eab = align (dynamicUpdated da) (dynamicUpdated db)
729+ let eab = align (updated da) (updated db)
1222730 ec = flip push eab $ \o -> do
1223731 (a, b) <- case o of
1224732 This (Identity a) -> do
1225− b <- readBehaviorUntracked $ dynamicCurrent db
733+ b <- readBehaviorUntracked $ current db
1226734 return (a, b)
1227735 That (Identity b) -> do
1228− a <- readBehaviorUntracked $ dynamicCurrent da
736+ a <- readBehaviorUntracked $ current da
1229737 return (a, b)
1230738 These (Identity a) (Identity b) -> return (a, b)
1231739 return $ Just $ Identity $ f a b
1232− in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
740+ in DynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (current da) <*> readBehaviorUntracked (current db)) ec
741+
742+instance Monad (Dynamic Identity) where
743+ {-# INLINE return #-}
744+ return = pure
745+ {-# INLINE (>>=) #-}
746+ x >>= f = DynamicDynIdentity $ newJoinDyn $ newMapDyn f x --TODO: (>>), fail
747+ {-# INLINE (>>) #-}
748+ _ >> y = y
749+ {-# INLINE fail #-}
750+ fail _ = error "Dynamic does not support 'fail'"
1233751
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
752+newtype Dyn p a = Dyn { unDyn :: IORef (Either (BehaviorM a, Event (p a)) (Hold p a)) }
1240753
1241−unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1242−unsafeBuildDynamic readV0 v' =
1243− Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
754+unsafeDyn :: BehaviorM a -> Event (p a) -> Dyn p a
755+unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
756+ where x = (readV0, v')
757+
758+newJoinDyn :: Dynamic Identity (Dynamic Identity a) -> Dyn Identity a
759+newJoinDyn d =
760+ let readV0 = readBehaviorTracked . current =<< readBehaviorTracked (current d)
761+ eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . current . runIdentity) $ updated d
762+ eInner = switch $ updated <$> current d
763+ eBoth = coincidence $ updated . runIdentity <$> updated d
764+ v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
765+ in unsafeDyn readV0 v'
766+
767+--type role Behavior representational
768+data Behavior a
769+ = forall p. BehaviorHold !(Hold p a)
770+ | BehaviorHoldIdentity !(Hold Identity a)
771+ | BehaviorConst !a
772+ | BehaviorPull !(Pull a)
773+ | BehaviorDynIdentity !(Dyn Identity a)
774+ | forall p. R.Patch p => BehaviorDyn !(Dyn p a)
1244775
1245776-- ResultM can read behaviors and events
1246777type ResultM = EventM
1247778
1248−instance HasSpiderTimeline x => Functor (Event x) where
779+{-# NOINLINE unsafeNewIORef #-}
780+unsafeNewIORef :: a -> b -> IORef b
781+unsafeNewIORef _ b = unsafePerformIO $ newIORef b
782+
783+instance Functor Event where
1249784 fmap f = push $ return . Just . f
1250785
1251−instance Functor (Behavior x) where
786+instance Functor Behavior where
1252787 fmap f = pull . fmap f . readBehaviorTracked
1253788
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)
789+{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
790+push :: forall a b. (a -> ComputeM (Maybe b)) -> Event a -> Event b
791+push f e = EventPush $ Push
792+ { pushCompute = f
793+ , pushParent = e
794+ , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
795+ }
796+-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
1257797
1258−{-# INLINABLE pull #-}
1259−pull :: BehaviorM x a -> Behavior x a
1260−pull a = unsafePerformIO $ do
1261− ref <- newIORef Nothing
1262−#ifdef DEBUG_NODEIDS
1263− nid <- newNodeId
1264−#endif
1265− pure $ behaviorPull $ Pull
1266− { pullCompute = a
1267− , pullValue = ref
798+{-# NOINLINE pull #-}
799+pull :: BehaviorM a -> Behavior a
800+pull a = BehaviorPull $ Pull
801+ { pullCompute = a
802+ , pullValue = unsafeNewIORef a Nothing
1268803#ifdef DEBUG_NODEIDS
1269− , pullNodeId = nid
804+ , pullNodeId = unsafeNodeId a
1270805#endif
1271− }
806+ }
1272807
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− }
808+{-# NOINLINE switch #-}
809+switch :: Behavior (Event a) -> Event a
810+switch a = EventSwitch $ Switch
811+ { switchParent = a
812+ , switchSubscribed = unsafeNewIORef a Nothing
813+ }
1281814
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− }
815+coincidence :: Event (Event a) -> Event a
816+coincidence a = EventCoincidence $ Coincidence
817+ { coincidenceParent = a
818+ , coincidenceSubscribed = unsafeNewIORef a Nothing
819+ }
820+
821+propagateAndUpdateSubscribersRef :: SubscriberList a -> a -> EventM x ()
822+propagateAndUpdateSubscribersRef subscribersRef a = do
823+ propagate a subscribersRef
1289824
1290825-- 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
826+run :: [DSum RootTrigger Identity] -> ResultM x b -> SpiderHost x b
1292827run 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
828+ tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
829+ spiderEnv <- SpiderHost ask
830+ result <- SpiderHost $ lift $ withMVar (_spiderEnv_lock spiderEnv) $ \_ -> flip runReaderT spiderEnv $ unSpiderHost $ runFrame $ do
1296831 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
1297832 occBefore <- liftIO $ do
1298833 occBefore <- readIORef occRef
@@ -1303,40 +838,43 @@ run roots after = do
1303838 return $ Just r
1304839 else return Nothing
1305840 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
1306− propagate a subscribersRef
1307− delayedRef <- asksEventEnv eventEnvDelayedMerges
841+ propagateAndUpdateSubscribersRef subscribersRef a
842+ delayedRef <- EventM $ asks eventEnvDelayedMerges
1308843 let go = do
1309844 delayed <- liftIO $ readIORef delayedRef
1310845 case IntMap.minViewWithKey delayed of
1311846 Nothing -> return ()
1312847 Just ((currentHeight, cur), future) -> do
1313− tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
848+ tracePropagate $ "Running height " ++ show currentHeight
1314849 putCurrentHeight $ Height currentHeight
1315850 liftIO $ writeIORef delayedRef $! future
1316− sequence_ cur
851+ forM_ cur $ \d -> case d of
852+ DelayedMerge subscribed -> do
853+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
854+ case height `compare` Height currentHeight of
855+ LT -> error "Somehow a merge's height has been decreased after it was scheduled"
856+ GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
857+ EQ -> do
858+ m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
859+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! DMap.empty
860+ --TODO: Assert that m is not empty
861+ liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $ Just m
862+ scheduleClear $ mergeSubscribedOccurrence subscribed
863+ propagateAndUpdateSubscribersRef (mergeSubscribedSubscribers subscribed) m
1317864 go
1318865 go
1319866 putCurrentHeight maxBound
1320867 after
1321− tracePropagate (Proxy :: Proxy x) "Done running an event frame"
868+ tracePropagate "Done running an event frame"
1322869 return result
1323870
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
871+data SomeClear = forall a. SomeClear (IORef (Maybe a))
1332872
1333−newtype Clear a = Clear (IORef (Maybe a))
873+data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1334874
1335−newtype IntClear a = IntClear (IORef (IntMap a))
875+data SomeAssignment = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak Invalidator]) a
1336876
1337−newtype RootClear k = RootClear (IORef (DMap k Identity))
1338−
1339−data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
877+data DelayedMerge = forall k. DelayedMerge (MergeSubscribed k)
1340878
1341879debugFinalize :: Bool
1342880debugFinalize = False
@@ -1346,110 +884,79 @@ mkWeakPtrWithDebug x debugNote = do
1346884 x' <- evaluate x
1347885 mkWeakPtr x' $
1348886 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
887+ then Just $ putStrLn $ "finalizing: " ++ debugNote
1350888 else Nothing
1351889
1352890type WeakList a = [Weak a]
1353891
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−
1381892{-# 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
893+#ifdef DEBUG
894+withIncreasedDepth :: CanTrace x m => m a -> m a
895+withIncreasedDepth a = do
896+ spiderEnv <- askSpiderEnv
897+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) succ
1385898 result <- a
1386− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
899+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) pred
1387900 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−
1412901#else
902+withIncreasedDepth :: m a -> m a
903+withIncreasedDepth = id
904+#endif
1413905
1414−{-# INLINE withIncreasedDepth #-}
1415−withIncreasedDepth :: proxy x -> m a -> m a
1416−withIncreasedDepth _ = id
906+type CanTrace x m = (HasSpiderEnv x m, MonadIO m)
1417907
1418908{-# INLINE tracePropagate #-}
1419−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420−tracePropagate _ _ = return ()
909+tracePropagate :: (CanTrace x m) => String -> m ()
910+tracePropagate = traceWhen debugPropagate
911+
912+{-# INLINE traceSubscribe #-}
913+traceSubscribe :: String -> IO ()
914+traceSubscribe = when debugSubscribe . liftIO . putStrLn
1421915
1422916{-# INLINE traceInvalidate #-}
1423917traceInvalidate :: String -> IO ()
1424−traceInvalidate _ = return ()
918+traceInvalidate = when debugInvalidate . liftIO . putStrLn
1425919
1426−{-# INLINE traceInvalidateHeight #-}
1427−traceInvalidateHeight :: String -> IO ()
1428−traceInvalidateHeight _ = return ()
1429−
1430−{-# INLINE debugSubscriber #-}
1431−debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
1432−debugSubscriber _ = return
1433−
1434−{-# INLINE debugSubscriber' #-}
1435−debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436−debugSubscriber' _ = id
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 ()
920+{-# INLINE traceWhen #-}
921+traceWhen :: (CanTrace x m) => Bool -> String -> m ()
922+traceWhen b message = traceMWhen b $ return message
1447923
924+{-# INLINE traceMWhen #-}
925+traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
926+traceMWhen b getMessage = when b $ do
927+ message <- getMessage
928+#ifdef DEBUG
929+ spiderEnv <- askSpiderEnv
930+ d <- liftIO $ readIORef $ _spiderEnv_depth spiderEnv
931+#else
932+ let d = 0
1448933#endif
934+ liftIO $ putStrLn $ replicate d ' ' <> message
1449935
1450936whoCreatedIORef :: IORef a -> IO [String]
1451937whoCreatedIORef (IORef a) = whoCreated $! a
1452938
939+whoCreatedEventSubscribed :: EventSubscribed a -> IO [String]
940+whoCreatedEventSubscribed = \case
941+ EventSubscribedRoot _ -> return ["root"]
942+ EventSubscribedNever -> return ["never"]
943+ EventSubscribedPush subscribed -> whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
944+ EventSubscribedFan _ subscribed -> whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
945+ EventSubscribedMerge subscribed -> whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
946+ EventSubscribedSwitch subscribed -> whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
947+ EventSubscribedCoincidence subscribed -> whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
948+
949+walkInvalidHeightParents :: EventSubscribed a -> IO [Some EventSubscribed]
950+walkInvalidHeightParents s0 = do
951+ subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
952+ h <- liftIO $ readIORef $ eventSubscribedHeightRef s
953+ when (h == invalidHeight) $ do
954+ when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
955+ modify (Some.This s :)
956+ mapM_ loop =<< liftIO (eventSubscribedGetParents s)
957+ forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
958+ return subscribers
959+
1453960groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
1454961groupByHead = \case
1455962 [] -> []
@@ -1460,278 +967,553 @@ groupByHead = \case
1460967 | otherwise -> (x, xs :| []) : l
1461968
1462969listsToForest :: 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
970+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1496971
972+-- | Propagate everything at the current height
973+propagate :: a -> SubscriberList a -> EventM x ()
974+propagate a subscribers = withIncreasedDepth $ do
975+ -- 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
976+ --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
977+ WeakBag.traverse subscribers $ \s -> case s of
978+ SubscriberPush compute subscribed -> {-# SCC "traversePush" #-} do
979+ tracePropagate $ "SubscriberPush" <> showNodeId subscribed
980+ occ <- runComputeM $ compute a
981+ case occ of
982+ Nothing -> return () -- No need to write a Nothing back into the Ref
983+ Just o -> do
984+ liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
985+ scheduleClear $ pushSubscribedOccurrence subscribed
986+ propagate o $ pushSubscribedSubscribers subscribed
987+ SubscriberMerge k subscribed -> {-# SCC "traverseMerge" #-} do
988+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
989+ oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
990+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
991+ tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
992+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
993+ when (DMap.null oldM) $ do -- Only schedule the firing once
994+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
995+ --TODO: assertions about height
996+ currentHeight <- getCurrentHeight
997+ when (height <= currentHeight) $ do
998+ myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
999+ if height /= invalidHeight
1000+ then error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1001+ else liftIO $ do
1002+ nodesInvolvedInCycle <- walkInvalidHeightParents $ EventSubscribedMerge subscribed
1003+ stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
1004+ error $ "Causality loop found:\n" <> drawForest (listsToForest stacks)
1005+ scheduleMerge height subscribed
1006+ SubscriberMergeChange subscribed -> {-# SCC "traverseMergeChange" #-} do
1007+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
1008+ defer $ SomeMergeUpdate a subscribed
1009+ SubscriberFan subscribed -> {-# SCC "traverseFan" #-} do
1010+ subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
1011+ tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
1012+ --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
1013+ forM_ (DMap.toList a) $ \(k :=> Identity v) -> {-# SCC "SubscriberFan" #-} case DMap.lookup k subs of
1014+ Nothing -> do
1015+ tracePropagate "No subscriber for key"
1016+ return ()
1017+ Just subsubs -> do
1018+ propagate v $ _fanSubscribedChildren_list subsubs
1019+ return ()
1020+ SubscriberHold h -> {-# SCC "traverseHold" #-} propagateSubscriberHold h a
1021+ SubscriberHoldIdentity h -> {-# SCC "traverseHoldIdentity" #-} propagateSubscriberHold h a
1022+ SubscriberSwitch subscribed -> {-# SCC "traverseSwitch" #-} do
1023+ tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
1024+ liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
1025+ scheduleClear $ switchSubscribedOccurrence subscribed
1026+ propagate a $ switchSubscribedSubscribers subscribed
1027+ SubscriberCoincidenceOuter subscribed -> {-# SCC "traverseCoincidenceOuter" #-} do
1028+ tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
1029+ outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
1030+ tracePropagate $ " outerHeight = " <> show outerHeight
1031+ (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
1032+ tracePropagate $ " isJust occ = " <> show (isJust occ)
1033+ tracePropagate $ " innerHeight = " <> show innerHeight
1034+ liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
1035+ scheduleClear $ coincidenceSubscribedInnerParent subscribed
1036+ case occ of
1037+ Nothing -> do
1038+ when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
1039+ writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
1040+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
1041+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
1042+ Just o -> do -- Since it's already firing, no need to adjust height
1043+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
1044+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
1045+ propagate o $ coincidenceSubscribedSubscribers subscribed
1046+ SubscriberCoincidenceInner subscribed -> {-# SCC "traverseCoincidenceInner" #-} do
1047+ tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
1048+ occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
1049+ case occ of
1050+ Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
1051+ Nothing -> do
1052+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
1053+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
1054+ propagate a $ coincidenceSubscribedSubscribers subscribed
1055+ SubscriberHandle -> {-# SCC "traverseHandle" #-} tracePropagate "SubscriberHandle"
14971056
14981057{-# INLINE propagateSubscriberHold #-}
1499−propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
1058+propagateSubscriberHold :: R.Patch p => Hold p a -> p a -> EventM x ()
15001059propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1060+ {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
15021061 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031062 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504−
15051063 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1506− case {-# SCC "apply" #-} apply a v of
1064+ case {-# SCC "apply" #-} R.apply a v of
15071065 Nothing -> return ()
15081066 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510− tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1067+ {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
15111068 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121069 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
15131070 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
15141071
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
1072+data SomeResetCoincidence = forall a. SomeResetCoincidence !(EventSubscription a) !(Maybe (CoincidenceSubscribed a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1073+
1074+{-# INLINE subscribeCoincidenceInner #-}
1075+subscribeCoincidenceInner :: CanSubscribe x m => Event a -> Height -> CoincidenceSubscribed a -> m (Maybe a, Height, EventSubscribed a)
1076+subscribeCoincidenceInner o outerHeight subscribedUnsafe = do
1077+ subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
1078+ subscription@(EventSubscription _ innerSubd) <- subscribe o subInner
1079+ innerOcc <- liftIO $ readEventSubscribed innerSubd
1080+ innerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef innerSubd
1081+ let height = max innerHeight outerHeight
1082+ defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
1083+ return (innerOcc, height, innerSubd)
1084+
1085+{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> BehaviorM a #-}
1086+{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> EventM x a #-}
1087+readBehaviorUntracked :: Defer SomeHoldInit m => Behavior a -> m a
1088+readBehaviorUntracked b = do
1089+ holdInits <- getDeferralQueue
1090+ liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
1091+
1092+runBehaviorM :: BehaviorM a -> Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]) -> IORef [SomeHoldInit] -> IO a
1093+runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
1094+
1095+askInvalidator :: BehaviorM (Maybe (Weak Invalidator))
1096+askInvalidator = fmap fst . fst <$> BehaviorM ask
15161097
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)
1098+askParentsRef :: BehaviorM (Maybe (IORef [SomeBehaviorSubscribed]))
1099+askParentsRef = fmap snd . fst <$> BehaviorM ask
15191100
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
1101+askBehaviorHoldInits :: BehaviorM (IORef [SomeHoldInit])
1102+askBehaviorHoldInits = snd <$> BehaviorM ask
15261103
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
1104+readBehaviorTracked :: Behavior a -> BehaviorM a
1105+readBehaviorTracked b = case b of
1106+ BehaviorHold h -> readHoldTracked h
1107+ BehaviorHoldIdentity h -> readHoldTracked h
1108+ BehaviorConst a -> return a
1109+ BehaviorPull p -> do
1110+ val <- liftIO $ readIORef $ pullValue p
1111+ case val of
1112+ Just subscribed -> do
1113+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1114+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
1115+ liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
1116+ return $ pullSubscribedValue subscribed
1117+ Nothing -> do
1118+ i <- liftIO $ newInvalidatorPull p
1119+ wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
1120+ parentsRef <- liftIO $ newIORef []
1121+ holdInits <- askBehaviorHoldInits
1122+ a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
1123+ invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
1124+ parents <- liftIO $ readIORef parentsRef
1125+ let subscribed = PullSubscribed
1126+ { pullSubscribedValue = a
1127+ , pullSubscribedInvalidators = invsRef
1128+ , pullSubscribedOwnInvalidator = i
1129+ , pullSubscribedParents = parents
1130+ }
1131+ liftIO $ writeIORef (pullValue p) $ Just subscribed
1132+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1133+ return a
1134+ BehaviorDyn d -> readHoldTracked =<< getDynHold d
1135+ BehaviorDynIdentity d -> readHoldTracked =<< getDynHold d
15331136
1534−askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1535−askBehaviorHoldInits = do
1536− (_, !his) <- ask
1537− return his
1137+{-# INLINE readHoldTracked #-}
1138+readHoldTracked :: Hold p a -> BehaviorM a
1139+readHoldTracked h = do
1140+ result <- liftIO $ readIORef $ holdValue h
1141+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
1142+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
1143+ return result
15381144
15391145{-# INLINE getDynHold #-}
1540−getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
1146+getDynHold :: (Defer SomeHoldInit m, R.Patch p) => Dyn p a -> m (Hold p a)
15411147getDynHold d = do
15421148 mh <- liftIO $ readIORef $ unDyn d
15431149 case mh of
1544− HoldDyn h -> return h
1545− UnsafeDyn (readV0, v') -> do
1150+ Right h -> return h
1151+ Left (readV0, v') -> do
15461152 holdInits <- getDeferralQueue
15471153 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
15541154 h <- hold v0 v'
1555− liftIO $ writeIORef (unDyn d) $ HoldDyn h
1155+ liftIO $ writeIORef (unDyn d) $ Right h
15561156 return h
15571157
1158+{-
1159+readEvent :: Event a -> ResultM (Maybe a)
1160+readEvent e = case e of
1161+ EventRoot k r -> liftIO . fmap (coerce . DMap.lookup k) . readIORef $ rootOccurrence r
1162+ EventNever -> return Nothing
1163+ EventPush p -> do
1164+ subscribed <- getPushSubscribed p
1165+ liftIO $ readPushSubscribed subscribed
1166+ EventMerge m -> do
1167+ subscribed <- getMergeSubscribed m
1168+ liftIO $ readMergeSubscribed subscribed
1169+ EventFan k f -> do
1170+ subscribed <- getFanSubscribed f
1171+ liftIO $ readFanSubscribed k subscribed
1172+ EventSwitch s -> do
1173+ subscribed <- getSwitchSubscribed s
1174+ liftIO $ readSwitchSubscribed subscribed
1175+ EventCoincidence c -> do
1176+ subscribed <- getCoincidenceSubscribed c
1177+ liftIO $ readCoincidenceSubscribed subscribed
1178+ EventHold h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1179+ EventDyn d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1180+ EventHoldIdentity h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1181+ EventDynIdentity d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1182+-}
1183+
1184+readEventSubscribed :: EventSubscribed a -> IO (Maybe a)
1185+readEventSubscribed = \case
1186+ EventSubscribedRoot rs -> readRootSubscribed rs
1187+ EventSubscribedNever -> return Nothing
1188+ EventSubscribedPush ps -> readPushSubscribed ps
1189+ EventSubscribedMerge ms -> readMergeSubscribed ms
1190+ EventSubscribedFan k fs -> readFanSubscribed k fs
1191+ EventSubscribedSwitch ss -> readSwitchSubscribed ss
1192+ EventSubscribedCoincidence cs -> readCoincidenceSubscribed cs
1193+
1194+readRootSubscribed :: RootSubscribed a -> IO (Maybe a)
1195+readRootSubscribed = rootSubscribedOccurrence
1196+
1197+readPushSubscribed :: PushSubscribed b a -> IO (Maybe a)
1198+readPushSubscribed subscribed = do
1199+ result <- readIORef $ pushSubscribedOccurrence subscribed -- Since ResultM is always called after the final height is reached, this will always be valid
1200+ touch $ pushSubscribedSelf subscribed
1201+ return result
1202+
1203+readMergeSubscribed :: MergeSubscribed k -> IO (Maybe (DMap k Identity))
1204+readMergeSubscribed subscribed = do
1205+ result <- readIORef $ mergeSubscribedOccurrence subscribed
1206+ touch $ mergeSubscribedParents subscribed
1207+ return result
1208+
1209+readFanSubscribed :: GCompare k => k a -> FanSubscribed k -> IO (Maybe a)
1210+readFanSubscribed k fs = do
1211+ parentOcc <- readEventSubscribed $ _eventSubscription_subscribed $ fanSubscribedParent fs
1212+ return $ coerce $ DMap.lookup k =<< parentOcc
1213+
1214+readSwitchSubscribed :: SwitchSubscribed a -> IO (Maybe a)
1215+readSwitchSubscribed subscribed = do
1216+ result <- readIORef $ switchSubscribedOccurrence subscribed
1217+ touch $ switchSubscribedOwnInvalidator subscribed
1218+ return result
1219+
1220+readCoincidenceSubscribed :: CoincidenceSubscribed a -> IO (Maybe a)
1221+readCoincidenceSubscribed subscribed = do
1222+ result <- readIORef $ coincidenceSubscribedOccurrence subscribed
1223+ touch $ coincidenceSubscribedOuter subscribed
1224+ --TODO: do we need to touch the inner subscriber?
1225+ return result
15581226
15591227-- Always refers to 0
15601228{-# NOINLINE zeroRef #-}
15611229zeroRef :: IORef Height
15621230zeroRef = unsafePerformIO $ newIORef zeroHeight
15631231
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)
1232+{-# SPECIALIZE subscribe :: Event a -> Subscriber a -> EventM x (EventSubscription a) #-}
1233+subscribe :: forall x m a. CanSubscribe x m => Event a -> Subscriber a -> m (EventSubscription a)
1234+subscribe e sub = case e of
1235+ EventRoot k r -> wrap EventSubscribedRoot $ liftIO . getRootSubscribed k r
1236+ EventNever -> return $ EventSubscription Nothing EventSubscribedNever
1237+ EventPush p -> wrap EventSubscribedPush $ getPushSubscribed p
1238+ EventFan k f -> wrap (EventSubscribedFan k) $ getFanSubscribed k f
1239+ EventMerge m -> wrap EventSubscribedMerge $ getMergeSubscribed m
1240+ EventSwitch s -> wrap EventSubscribedSwitch $ getSwitchSubscribed s
1241+ EventCoincidence c -> wrap EventSubscribedCoincidence $ getCoincidenceSubscribed c
1242+ EventHold h -> subscribeHoldEvent h sub
1243+ EventDyn j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1244+ EventHoldIdentity h -> subscribeHoldEvent h sub
1245+ EventDynIdentity j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1246+ where
1247+ wrap :: (t -> EventSubscribed a) -> (Subscriber a -> m (SubscriberListTicket a, t)) -> m (EventSubscription a)
1248+ wrap tag getSpecificSubscribed = do
1249+ (sln, subd) <- getSpecificSubscribed sub
1250+ return $ EventSubscription (Just sln) $ tag subd
1251+
1252+{-# INLINE subscribeHoldEvent #-}
1253+subscribeHoldEvent :: (CanSubscribe x m, R.Patch p) => Hold p a -> Subscriber (p a) -> m (EventSubscription (p a))
1254+subscribeHoldEvent h sub = do
1255+ EventSubscription _ subd <- getHoldEventSubscription h
1256+ sln <- liftIO $ subscribeEventSubscribed subd sub
1257+ return $ EventSubscription sln subd
1258+
1259+{-# INLINE debugSubscribe #-}
1260+debugSubscribe :: Bool
1261+debugSubscribe = False
1262+
1263+{-# INLINE subscribeEventSubscribed #-}
1264+subscribeEventSubscribed :: EventSubscribed a -> Subscriber a -> IO (Maybe (SubscriberListTicket a))
1265+subscribeEventSubscribed es sub = case es of
1266+ EventSubscribedRoot r -> do
1267+ traceSubscribe $ "subscribeEventSubscribed Root"
1268+ Just <$> subscribeRootSubscribed r sub
1269+ EventSubscribedNever -> do
1270+ traceSubscribe $ "subscribeEventSubscribed Never"
1271+ return Nothing
1272+ EventSubscribedPush subscribed -> do
1273+ traceSubscribe $ "subscribeEventSubscribed Push"
1274+ Just <$> subscribePushSubscribed subscribed sub
1275+ EventSubscribedFan k subscribed -> do
1276+ traceSubscribe $ "subscribeEventSubscribed Fan"
1277+ Just <$> subscribeFanSubscribed k subscribed sub
1278+ EventSubscribedMerge subscribed -> do
1279+ traceSubscribe $ "subscribeEventSubscribed Merge"
1280+ Just <$> subscribeMergeSubscribed subscribed sub
1281+ EventSubscribedSwitch subscribed -> do
1282+ traceSubscribe $ "subscribeEventSubscribed Switch"
1283+ Just <$> subscribeSwitchSubscribed subscribed sub
1284+ EventSubscribedCoincidence subscribed -> do
1285+ traceSubscribe $ "subscribeEventSubscribed Coincidence"
1286+ Just <$> subscribeCoincidenceSubscribed subscribed sub
1287+
1288+{-# INLINE eventSubscribedHeightRef #-}
1289+eventSubscribedHeightRef :: EventSubscribed a -> IORef Height
1290+eventSubscribedHeightRef = \case
1291+ EventSubscribedRoot _ -> zeroRef
1292+ EventSubscribedNever -> zeroRef
1293+ EventSubscribedPush subscribed -> pushSubscribedHeight subscribed
1294+ EventSubscribedFan _ subscribed -> eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
1295+ EventSubscribedMerge subscribed -> mergeSubscribedHeight subscribed
1296+ EventSubscribedSwitch subscribed -> switchSubscribedHeight subscribed
1297+ EventSubscribedCoincidence subscribed -> coincidenceSubscribedHeight subscribed
1298+
1299+{-# INLINE eventSubscribedHasOwnHeightRef #-}
1300+eventSubscribedHasOwnHeightRef :: EventSubscribed a -> Bool
1301+eventSubscribedHasOwnHeightRef = \case
1302+ EventSubscribedRoot _ -> False
1303+ EventSubscribedNever -> False
1304+ EventSubscribedPush _ -> False
1305+ EventSubscribedFan _ _ -> False
1306+ EventSubscribedMerge _ -> True
1307+ EventSubscribedSwitch _ -> True
1308+ EventSubscribedCoincidence _ -> True
1309+
1310+{-# INLINE eventSubscribedGetParents #-}
1311+eventSubscribedGetParents :: EventSubscribed a -> IO [Some EventSubscribed]
1312+eventSubscribedGetParents = \case
1313+ EventSubscribedRoot _ -> return []
1314+ EventSubscribedNever -> return []
1315+ EventSubscribedPush subscribed -> return [Some.This $ _eventSubscription_subscribed $ pushSubscribedParent subscribed]
1316+ EventSubscribedFan _ subscribed -> return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
1317+ EventSubscribedMerge subscribed -> do
1318+ ps <- readIORef $ mergeSubscribedParents subscribed
1319+ return $ R.ffor (DMap.toList ps) $ \(_ :=> v) -> Some.This $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription v
1320+ EventSubscribedSwitch subscribed -> do
1321+ s <- readIORef $ switchSubscribedCurrentParent subscribed
1322+ return [Some.This $ _eventSubscription_subscribed s]
1323+ EventSubscribedCoincidence subscribed -> do
1324+ innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
1325+ let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1326+ innerParents = maybeToList $ fmap Some.This innerSubscription
1327+ return $ outerParent : innerParents
1328+
1329+type CanSubscribe x m =
1330+ ( HasSpiderEnv x m
1331+ , HasCurrentHeight m
1332+ , Defer SomeHoldInit m, Defer SomeMergeInit m -- The things we need to lazily initialize state
1333+ , Defer SomeClear m -- Wiping out event firings
1334+ , Defer SomeAssignment m -- Updating state
1335+ , Defer SomeResetCoincidence m
1336+ )
1337+
1338+getRootSubscribed :: GCompare k => k a -> Root k -> Subscriber a -> IO (SubscriberListTicket a, RootSubscribed a)
15651339getRootSubscribed k r sub = do
15661340 mSubscribed <- readIORef $ rootSubscribed r
1567− let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
15681341 case DMap.lookup k mSubscribed of
15691342 Just subscribed -> {-# SCC "hitRoot" #-} do
15701343 sln <- subscribeRootSubscribed subscribed sub
1571− occ <- getOcc
1572− return (sln, subscribed, occ)
1344+ return (sln, subscribed)
15731345 Nothing -> {-# SCC "missRoot" #-} do
15741346 weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
15751347 let !cached = rootSubscribed r
15761348 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
15771349 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1578−
1579− tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580−
1350+ when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
15811351 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
15821352 writeIORef uninitRef $! uninit
1583−#ifdef DEBUG_NODEIDS
1584− nid <- newNodeId
1585−#endif
1586− let !subscribed = RootSubscribed
1353+ let subscribed = RootSubscribed
15871354 { rootSubscribedKey = k
15881355 , rootSubscribedCachedSubscribed = cached
1589− , rootSubscribedOccurrence = getOcc
1356+ , rootSubscribedOccurrence = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
15901357 , rootSubscribedSubscribers = subs
15911358 , rootSubscribedUninit = uninit
15921359 , rootSubscribedWeakSelf = weakSelf
15931360#ifdef DEBUG_NODEIDS
1594− , rootSubscribedNodeId = nid
1361+ , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
15951362#endif
15961363 }
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)
1364+ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
16081365 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)
1366+ return (sln, subscribed)
16111367
1612−#ifdef USE_TEMPLATE_HASKELL
16131368{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1614−#endif
1615−cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1616−cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
1369+cleanupRootSubscribed :: RootSubscribed a -> IO ()
1370+cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
16171371 rootSubscribedUninit self
16181372 modifyIORef' cached $ DMap.delete k
16191373
16201374{-# INLINE subscribeRootSubscribed #-}
1621−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1375+subscribeRootSubscribed :: RootSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
16221376subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
16231377
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"
1378+-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1379+{-# SPECIALIZE getPushSubscribed :: Push a b -> Subscriber b -> EventM x (SubscriberListTicket b, PushSubscribed a b) #-}
1380+getPushSubscribed :: CanSubscribe x m => Push a b -> Subscriber b -> m (SubscriberListTicket b, PushSubscribed a b)
1381+getPushSubscribed p sub = do
1382+ mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1383+ case mSubscribed of
1384+ Just subscribed -> {-# SCC "hitPush" #-} do
1385+ sln <- liftIO $ subscribePushSubscribed subscribed sub
1386+ return (sln, subscribed)
1387+ Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1388+ subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1389+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1390+ s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
1391+ subscription@(EventSubscription _ subd) <- subscribe (pushParent p) s
1392+ parentOcc <- liftIO $ readEventSubscribed subd
1393+ occ <- runComputeM $ join <$> mapM (pushCompute p) parentOcc
1394+ occRef <- liftIO $ newIORef occ
1395+ when (isJust occ) $ scheduleClear occRef
1396+ weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1397+ let !cached = pushSubscribed p
1398+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1399+ let subscribed = PushSubscribed
1400+ { pushSubscribedCachedSubscribed = cached
1401+ , pushSubscribedOccurrence = occRef
1402+ , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1403+ , pushSubscribedSubscribers = subs
1404+ , pushSubscribedSelf = s
1405+ , pushSubscribedWeakSelf = weakSelf
1406+ , pushSubscribedParent = subscription
16401407#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1408+ , pushSubscribedNodeId = unsafeNodeId p
16421409#endif
1643− return $ FanInt
1644− { _fanInt_subscribers = subscribers
1645− , _fanInt_subscriptionRef = subscriptionRef
1646− , _fanInt_occRef = occRef
1410+ }
1411+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1412+ liftIO $ writeIORef subscribedRef $! subscribed
1413+ liftIO $ writeIORef (pushSubscribed p) $ Just subscribed
1414+ return (sln, subscribed)
1415+
1416+cleanupPushSubscribed :: PushSubscribed a b -> IO ()
1417+cleanupPushSubscribed self = do
1418+ unsubscribe $ pushSubscribedParent self
1419+ writeIORef (pushSubscribedCachedSubscribed self) $ Nothing
1420+
1421+{-# INLINE subscribePushSubscribed #-}
1422+subscribePushSubscribed :: PushSubscribed a b -> Subscriber b -> IO (SubscriberListTicket b)
1423+subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1424+
1425+{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge k -> Subscriber (DMap k Identity) -> EventM x (SubscriberListTicket (DMap k Identity), MergeSubscribed k) #-}
1426+getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge k -> Subscriber (DMap k Identity) -> m (SubscriberListTicket (DMap k Identity), MergeSubscribed k)
1427+getMergeSubscribed m sub = do
1428+ mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1429+ case mSubscribed of
1430+ Just subscribed -> {-# SCC "hitMerge" #-} do
1431+ sln <- liftIO $ subscribeMergeSubscribed subscribed sub
1432+ return (sln, subscribed)
1433+ Nothing -> {-# SCC "missMerge" #-} do
1434+ subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1435+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1436+ initialParents <- readBehaviorUntracked $ current $ mergeParents m
1437+ subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1438+ s <- liftIO $ newSubscriberMerge k subscribedUnsafe
1439+ subscription@(EventSubscription _ parentSubd) <- subscribe e s
1440+ parentOcc <- liftIO $ readEventSubscribed parentSubd
1441+ height <- liftIO $ readIORef $ eventSubscribedHeightRef parentSubd
1442+ return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription s)
1443+ let dm = DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1444+ heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1445+ myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1446+ myHeight = if invalidHeight `elem` heights
1447+ then invalidHeight
1448+ else succHeight $ heightBagMax myHeightBag
1449+ currentHeight <- getCurrentHeight
1450+ let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1451+ then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1452+ else (Nothing, dm)
1453+ unless (DMap.null accum) $ do
1454+ scheduleMerge myHeight subscribedUnsafe
1455+ occRef <- liftIO $ newIORef occ
1456+ when (isJust occ) $ scheduleClear occRef
1457+ accumRef <- liftIO $ newIORef accum
1458+ heightRef <- liftIO $ newIORef myHeight
1459+ heightMapRef <- liftIO $ newIORef myHeightBag
1460+ weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1461+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1462+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1463+ parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1464+ let !subscribed = MergeSubscribed
1465+ { mergeSubscribedCachedSubscribed = mergeSubscribed m
1466+ , mergeSubscribedOccurrence = occRef
1467+ , mergeSubscribedAccum = accumRef
1468+ , mergeSubscribedHeight = heightRef
1469+ , mergeSubscribedHeightBag = heightMapRef
1470+ , mergeSubscribedSubscribers = subs
1471+ , mergeSubscribedChange = changeSubdRef
1472+ , mergeSubscribedParents = parentsRef
1473+ , mergeSubscribedWeakSelf = weakSelf
16471474#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1475+ , mergeSubscribedNodeId = unsafeNodeId m
16491476#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))
1477+ }
1478+ defer $ SomeMergeInit subscribed $ updated $ mergeParents m
1479+ liftIO $ writeIORef subscribedRef $! subscribed
1480+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1481+ liftIO $ writeIORef (mergeSubscribed m) $ Just subscribed
1482+ return (sln, subscribed)
1483+
1484+cleanupMergeSubscribed :: MergeSubscribed k -> IO ()
1485+cleanupMergeSubscribed subscribed = do
1486+ parents <- readIORef $ mergeSubscribedParents subscribed
1487+ forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1488+ -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1489+ writeIORef (mergeSubscribedCachedSubscribed subscribed) $ Nothing -- Get rid of the cached subscribed
1490+
1491+{-# INLINE subscribeMergeSubscribed #-}
1492+subscribeMergeSubscribed :: MergeSubscribed k -> Subscriber (DMap k Identity) -> IO (SubscriberListTicket (DMap k Identity))
1493+subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
1494+
1495+{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan k -> Subscriber a -> EventM x (SubscriberListTicket a, FanSubscribed k) #-}
1496+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)
17081497getFanSubscribed k f sub = do
17091498 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
17101499 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)
1500+ Just subscribed -> {-# SCC "hitFan" #-} do
1501+ sln <- liftIO $ subscribeFanSubscribed k subscribed sub
1502+ return (sln, subscribed)
17151503 Nothing -> {-# SCC "missFan" #-} do
17161504 subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
17171505 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
17181506 s <- liftIO $ newSubscriberFan subscribedUnsafe
1719− (subscription, parentOcc) <- subscribeAndRead (fanParent f) s
1507+ subscription <- subscribe (fanParent f) s
17201508 weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
17211509 (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
17221510 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
17281511 let subscribed = FanSubscribed
17291512 { fanSubscribedCachedSubscribed = fanSubscribed f
1730− , fanSubscribedOccurrence = occRef
17311513 , fanSubscribedParent = subscription
17321514 , fanSubscribedSubscribers = subscribersRef
17331515#ifdef DEBUG_NODEIDS
1734− , fanSubscribedNodeId = nid
1516+ , fanSubscribedNodeId = unsafeNodeId f
17351517#endif
17361518 }
17371519 let !self = (k, subscribed)
@@ -1739,9 +1521,9 @@ getFanSubscribed k f sub = do
17391521 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
17401522 liftIO $ writeIORef subscribedRef $! subscribed
17411523 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1742− return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
1524+ return (slnForSub, subscribed)
17431525
1744−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
1526+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed k) -> IO ()
17451527cleanupFanSubscribed (k, subscribed) = do
17461528 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17471529 let reducedSubscribers = DMap.delete k subscribers
@@ -1753,7 +1535,7 @@ cleanupFanSubscribed (k, subscribed) = do
17531535 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
17541536
17551537{-# INLINE subscribeFanSubscribed #-}
1756−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
1538+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed k -> Subscriber a -> IO (SubscriberListTicket a)
17571539subscribeFanSubscribed k subscribed sub = do
17581540 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17591541 case DMap.lookup k subscribers of
@@ -1761,19 +1543,18 @@ subscribeFanSubscribed k subscribed sub = do
17611543 let !self = (k, subscribed)
17621544 weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
17631545 (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
1546+ 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
17651547 return sln
17661548 Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
17671549
1768−{-# INLINABLE getSwitchSubscribed #-}
1769−getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1550+{-# SPECIALIZE getSwitchSubscribed :: Switch a -> Subscriber a -> EventM x (SubscriberListTicket a, SwitchSubscribed a) #-}
1551+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)
17701552getSwitchSubscribed s sub = do
17711553 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
17721554 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)
1555+ Just subscribed -> {-# SCC "hitSwitch" #-} do
1556+ sln <- liftIO $ subscribeSwitchSubscribed subscribed sub
1557+ return (sln, subscribed)
17771558 Nothing -> {-# SCC "missSwitch" #-} do
17781559 subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
17791560 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
@@ -1784,16 +1565,14 @@ getSwitchSubscribed s sub = do
17841565 parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
17851566 holdInits <- getDeferralQueue
17861567 e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1787− (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead e mySub
1788− heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
1568+ subscription@(EventSubscription _ subd) <- subscribe e mySub
17891569 subscriptionRef <- liftIO $ newIORef subscription
1570+ parentOcc <- liftIO $ readEventSubscribed subd
17901571 occRef <- liftIO $ newIORef parentOcc
17911572 when (isJust parentOcc) $ scheduleClear occRef
1573+ heightRef <- liftIO $ newIORef =<< readIORef (eventSubscribedHeightRef subd)
17921574 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
17931575 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794−#ifdef DEBUG_NODEIDS
1795− nid <- liftIO newNodeId
1796−#endif
17971576 let !subscribed = SwitchSubscribed
17981577 { switchSubscribedCachedSubscribed = switchSubscribed s
17991578 , switchSubscribedOccurrence = occRef
@@ -1806,39 +1585,39 @@ getSwitchSubscribed s sub = do
18061585 , switchSubscribedCurrentParent = subscriptionRef
18071586 , switchSubscribedWeakSelf = weakSelf
18081587#ifdef DEBUG_NODEIDS
1809− , switchSubscribedNodeId = nid
1588+ , switchSubscribedNodeId = unsafeNodeId s
18101589#endif
18111590 }
18121591 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
18131592 liftIO $ writeIORef subscribedRef $! subscribed
18141593 liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1815− return (slnForSub, subscribed, parentOcc)
1594+ return (slnForSub, subscribed)
18161595
1817−cleanupSwitchSubscribed :: SwitchSubscribed x a -> IO ()
1596+cleanupSwitchSubscribed :: SwitchSubscribed a -> IO ()
18181597cleanupSwitchSubscribed subscribed = do
18191598 unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
18201599 finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
18211600 writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
18221601
18231602{-# INLINE subscribeSwitchSubscribed #-}
1824−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1603+subscribeSwitchSubscribed :: SwitchSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
18251604subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
18261605
1827−{-# INLINABLE getCoincidenceSubscribed #-}
1828−getCoincidenceSubscribed :: forall x a. HasSpiderTimeline x => Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
1606+{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence a -> Subscriber a -> EventM x (SubscriberListTicket a, CoincidenceSubscribed a) #-}
1607+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)
18291608getCoincidenceSubscribed c sub = do
18301609 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
18311610 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)
1611+ Just subscribed -> {-# SCC "hitCoincidence" #-} do
1612+ sln <- liftIO $ subscribeCoincidenceSubscribed subscribed sub
1613+ return (sln, subscribed)
18361614 Nothing -> {-# SCC "missCoincidence" #-} do
18371615 subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
18381616 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
18391617 subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1840− (outerSubscription@(EventSubscription _ outerSubd), outerOcc) <- subscribeAndRead (coincidenceParent c) subOuter
1841− outerHeight <- liftIO $ getEventSubscribedHeight outerSubd
1618+ outerSubscription@(EventSubscription _ outerSubd) <- subscribe (coincidenceParent c) subOuter
1619+ outerOcc <- liftIO $ readEventSubscribed outerSubd
1620+ outerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef outerSubd
18421621 (occ, height, mInnerSubd) <- case outerOcc of
18431622 Nothing -> return (Nothing, outerHeight, Nothing)
18441623 Just o -> do
@@ -1851,9 +1630,6 @@ getCoincidenceSubscribed c sub = do
18511630 scheduleClear innerSubdRef
18521631 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
18531632 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854−#ifdef DEBUG_NODEIDS
1855− nid <- liftIO newNodeId
1856−#endif
18571633 let subscribed = CoincidenceSubscribed
18581634 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
18591635 , coincidenceSubscribedOccurrence = occRef
@@ -1864,549 +1640,160 @@ getCoincidenceSubscribed c sub = do
18641640 , coincidenceSubscribedInnerParent = innerSubdRef
18651641 , coincidenceSubscribedWeakSelf = weakSelf
18661642#ifdef DEBUG_NODEIDS
1867− , coincidenceSubscribedNodeId = nid
1643+ , coincidenceSubscribedNodeId = unsafeNodeId c
18681644#endif
18691645 }
18701646 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
18711647 liftIO $ writeIORef subscribedRef $! subscribed
18721648 liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1873− return (slnForSub, subscribed, occ)
1649+ return (slnForSub, subscribed)
18741650
1875−cleanupCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO ()
1651+cleanupCoincidenceSubscribed :: CoincidenceSubscribed a -> IO ()
18761652cleanupCoincidenceSubscribed subscribed = do
18771653 unsubscribe $ coincidenceSubscribedOuterParent subscribed
18781654 writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
18791655
18801656{-# INLINE subscribeCoincidenceSubscribed #-}
1881−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1657+subscribeCoincidenceSubscribed :: CoincidenceSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
18821658subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
18831659
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
1660+{-# INLINE merge #-}
1661+merge :: GCompare k => Dynamic R.PatchDMap (DMap k Event) -> Event (DMap k Identity)
1662+merge m = EventMerge $ Merge
1663+ { mergeParents = m
1664+ , mergeSubscribed = unsafeNewIORef m Nothing
20951665 }
20961666
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)
1667+newtype EventSelector k = EventSelector { select :: forall a. k a -> Event a }
22801668
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
1669+fan :: GCompare k => Event (DMap k Identity) -> EventSelector k
1670+fan e =
22871671 let f = Fan
22881672 { fanParent = e
2289− , fanSubscribed = ref
1673+ , fanSubscribed = unsafeNewIORef e Nothing
22901674 }
2291− pure $ EventSelectorG $ \k -> eventFan k f
1675+ in EventSelector $ \k -> EventFan k f
22921676
2293−runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
2294−runHoldInits holdInitRef dynInitRef mergeInitRef = do
1677+runHoldInits :: IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> EventM x ()
1678+runHoldInits holdInitRef mergeInitRef = do
22951679 holdInits <- liftIO $ readIORef holdInitRef
2296− dynInits <- liftIO $ readIORef dynInitRef
22971680 mergeInits <- liftIO $ readIORef mergeInitRef
2298− unless (null holdInits && null dynInits && null mergeInits) $ do
1681+ unless (null holdInits && null mergeInits) $ do
22991682 liftIO $ writeIORef holdInitRef []
2300− liftIO $ writeIORef dynInitRef []
23011683 liftIO $ writeIORef mergeInitRef []
23021684 mapM_ initHold holdInits
2303− mapM_ initDyn dynInits
2304− mapM_ unSomeMergeInit mergeInits
2305− runHoldInits holdInitRef dynInitRef mergeInitRef
1685+ mapM_ initMerge mergeInits
1686+ runHoldInits holdInitRef mergeInitRef
23061687
2307−initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
1688+initHold :: SomeHoldInit -> EventM x ()
23081689initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
23091690
2310−initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
2311−initDyn (SomeDynInit d) = void $ getDynHold d
1691+initMerge :: SomeMergeInit -> EventM x ()
1692+initMerge (SomeMergeInit subscribed changed) = do
1693+ changeSub <- liftIO $ newSubscriberMergeChange subscribed
1694+ EventSubscription _ changeSubd <- subscribe changed changeSub
1695+ change <- liftIO $ readEventSubscribed changeSubd
1696+ forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1697+ liftIO $ writeIORef (mergeSubscribedChange subscribed) (changeSub, changeSubd)
23121698
2313−newEventEnv :: IO (EventEnv x)
2314−newEventEnv = do
1699+-- | Run an event action outside of a frame
1700+runFrame :: EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1701+runFrame a = SpiderHost $ ask >>= \spiderEnv -> lift $ do
1702+ -- 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
1703+ pendingCleanups <- atomicModifyIORef (_spiderEnv_cleanups spiderEnv) $ \x -> ([], x)
1704+ {-# SCC "cleanups" #-} sequence_ pendingCleanups
23151705 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
23161706 holdInitRef <- newIORef []
2317− dynInitRef <- newIORef []
23181707 mergeUpdateRef <- newIORef []
23191708 mergeInitRef <- newIORef []
23201709 heightRef <- newIORef zeroHeight
23211710 toClearRef <- newIORef []
2322− toClearIntRef <- newIORef []
23231711 toClearRootRef <- newIORef []
23241712 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)
1713+ delayedRef <- liftIO $ newIORef IntMap.empty
1714+ let env = EventEnv spiderEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
23461715 let go = do
23471716 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
1717+ 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
23491718 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
1719+ result <- runEventM go env
1720+ toClear <- readIORef toClearRef
1721+ forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
1722+ toClearRoot <- readIORef toClearRootRef
1723+ forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1724+ toAssign <- readIORef toAssignRef
23581725 toReconnectRef <- newIORef []
2359− coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
1726+ coincidenceInfos <- readIORef coincidenceInfosRef
23601727 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
23611728 writeIORef vRef v
2362− traceInvalidate $ "Invalidating Hold"
1729+ when debugInvalidate $ putStrLn $ "Invalidating Hold"
23631730 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"
1731+ mergeUpdates <- readIORef mergeUpdateRef
1732+ writeIORef mergeUpdateRef []
1733+ let updateMerge :: SomeMergeUpdate -> IO [SomeEventSubscription]
1734+ updateMerge (SomeMergeUpdate (R.PatchDMap p :: R.PatchDMap (DMap k Event)) m) = do
1735+ oldParents <- readIORef $ mergeSubscribedParents m
1736+ let f (subscriptionsToKill, ps) (k :=> Compose me) = do
1737+ (mOldSubd, newPs) <- case me of
1738+ Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1739+ Just e -> do
1740+ s <- liftIO $ newSubscriberMerge k m
1741+ subscription@(EventSubscription _ subd) <- subscribe e s
1742+ let newParent = MergeSubscribedParent subscription s
1743+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
1744+ liftIO $ addMergeHeight newParentHeight m
1745+ return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1746+ forM_ mOldSubd $ \oldSubd -> do
1747+ oldHeight <- liftIO $ readIORef $ eventSubscribedHeightRef $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1748+ liftIO $ removeMergeHeight oldHeight m
1749+ return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1750+ (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
1751+ writeIORef (mergeSubscribedParents m) $! newParents
1752+ return subscriptionsToKill
1753+ when debugPropagate $ putStrLn "Updating merges"
1754+ mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
1755+ when debugPropagate $ putStrLn "Updating merges done"
23691756 toReconnect <- readIORef toReconnectRef
2370− clearEventEnv env
23711757 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23721758 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
23731759 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2374− traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1760+ when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
23751761 finalize wi
23761762 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
23771763 wi' <- mkWeakPtrWithDebug i "wi'"
23781764 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
23791765 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
1766+ writeIORef holdInitRef [] --TODO: Should we reuse this?
1767+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
1768+ 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
23831769 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
23841770 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
1771+ 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
23861772 {-
23871773 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1774+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23891775 EventRoot _ -> "EventRoot"
23901776 EventNever -> "EventNever"
23911777 _ -> "something else"
23921778 -}
23931779 writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
2394− return oldSubscription
2395− liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
2396− liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
1780+ return $ SomeEventSubscription oldSubscription
1781+ forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1782+ forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
23971783 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23981784 EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
2399− parentHeight <- getEventSubscribedHeight subd'
1785+ parentHeight <- readIORef $ eventSubscribedHeightRef subd'
24001786 myHeight <- readIORef $ switchSubscribedHeight subscribed
24011787 when (parentHeight /= myHeight) $ do
24021788 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
1789+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1790+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> do
1791+ 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
24051792 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24061793 unsubscribe subscription
24071794 mapM_ invalidateCoincidenceHeight mcs
24081795 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
2409− mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
1796+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> revalidateMergeHeight m
24101797 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
24111798 height <- calculateSwitchHeight subscribed
24121799 updateSwitchHeight height subscribed
@@ -2422,12 +1809,10 @@ zeroHeight = Height 0
24221809invalidHeight :: Height
24231810invalidHeight = Height (-1000)
24241811
2425−#ifdef DEBUG_CYCLES
24261812-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
24271813{-# INLINE invalidHeightBeingTraversed #-}
24281814invalidHeightBeingTraversed :: Height
24291815invalidHeightBeingTraversed = Height (-1001)
2430−#endif
24311816
24321817{-# INLINE succHeight #-}
24331818succHeight :: Height -> Height
@@ -2436,42 +1821,152 @@ succHeight h@(Height a) =
24361821 then invalidHeight
24371822 else Height $ succ a
24381823
2439−invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1824+invalidateSubscriberHeight :: Height -> Subscriber a -> IO ()
1825+invalidateSubscriberHeight old s = case s of
1826+ SubscriberPush _ subscribed -> do
1827+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1828+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ invalidateSubscriberHeight old
1829+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1830+ SubscriberMerge _ subscribed -> do
1831+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1832+ removeMergeHeight old subscribed
1833+ invalidateMergeHeight subscribed
1834+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1835+ SubscriberMergeChange _ -> return () -- Doesn't affect the height of the merge, because its changes are delayed
1836+ SubscriberFan subscribed -> do
1837+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1838+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1839+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
1840+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1841+ SubscriberHold _ -> return ()
1842+ SubscriberHoldIdentity _ -> return ()
1843+ SubscriberSwitch subscribed -> do
1844+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1845+ oldHeight <- readIORef $ switchSubscribedHeight subscribed
1846+ when (oldHeight /= invalidHeight) $ do
1847+ writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1848+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1849+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1850+ SubscriberCoincidenceOuter subscribed -> do
1851+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1852+ invalidateCoincidenceHeight subscribed
1853+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1854+ SubscriberCoincidenceInner subscribed -> do
1855+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1856+ invalidateCoincidenceHeight subscribed
1857+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1858+ SubscriberHandle -> return ()
1859+
1860+removeMergeHeight :: Height -> MergeSubscribed k -> IO ()
1861+removeMergeHeight oldParentHeight subscribed = do
1862+ when debugInvalidateHeight $ putStrLn $ "removeMergeHeight: " <> show oldParentHeight <> " Merge" <> showNodeId subscribed
1863+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1864+ let newHeights = heightBagRemove oldParentHeight oldHeights
1865+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1866+
1867+invalidateMergeHeight :: MergeSubscribed k -> IO ()
1868+invalidateMergeHeight subscribed = do
1869+ oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1870+ -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1871+ when (oldHeight /= invalidHeight) $ do
1872+ writeIORef (mergeSubscribedHeight subscribed) $! invalidHeight
1873+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1874+
1875+addMergeHeight :: Height -> MergeSubscribed k -> IO ()
1876+addMergeHeight newParentHeight subscribed = do
1877+ when debugInvalidateHeight $ putStrLn $ "addMergeHeight: " <> show newParentHeight <> " Merge" <> showNodeId subscribed
1878+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1879+ let newHeights = heightBagAdd newParentHeight oldHeights
1880+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1881+
1882+revalidateMergeHeight :: MergeSubscribed k -> IO ()
1883+revalidateMergeHeight subscribed = do
1884+ currentHeight <- readIORef $ mergeSubscribedHeight subscribed
1885+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1886+ heights <- readIORef $ mergeSubscribedHeightBag subscribed
1887+ parents <- readIORef $ mergeSubscribedParents subscribed
1888+ -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1889+ case heightBagSize heights `compare` DMap.size parents of
1890+ LT -> return ()
1891+ EQ -> do
1892+ let height = succHeight $ heightBagMax heights
1893+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1894+ writeIORef (mergeSubscribedHeight subscribed) $! height
1895+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1896+ GT -> error $ "revalidateMergeHeight: more heights than parents for Merge" <> showNodeId subscribed
1897+
1898+invalidateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
24401899invalidateCoincidenceHeight subscribed = do
24411900 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24421901 when (oldHeight /= invalidHeight) $ do
24431902 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
2445−
2446−updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
1903+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1904+
1905+recalculateSubscriberHeight :: Height -> Subscriber a -> IO ()
1906+recalculateSubscriberHeight new s = case s of
1907+ SubscriberPush _ subscribed -> do
1908+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1909+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1910+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1911+ SubscriberMerge _ subscribed -> do
1912+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1913+ addMergeHeight new subscribed
1914+ revalidateMergeHeight subscribed
1915+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1916+ SubscriberMergeChange _ -> return ()
1917+ SubscriberFan subscribed -> do
1918+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1919+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1920+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
1921+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1922+ SubscriberHold _ -> return ()
1923+ SubscriberHoldIdentity _ -> return ()
1924+ SubscriberSwitch subscribed -> do
1925+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1926+ updateSwitchHeight new subscribed
1927+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1928+ SubscriberCoincidenceOuter subscribed -> do
1929+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1930+ recalculateCoincidenceHeight subscribed
1931+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1932+ SubscriberCoincidenceInner subscribed -> do
1933+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1934+ recalculateCoincidenceHeight subscribed
1935+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1936+ SubscriberHandle -> return ()
1937+
1938+updateSwitchHeight :: Height -> SwitchSubscribed a -> IO ()
24471939updateSwitchHeight new subscribed = do
24481940 oldHeight <- readIORef $ switchSubscribedHeight subscribed
24491941 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24501942 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24511943 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1944+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24531945
2454−recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1946+recalculateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
24551947recalculateCoincidenceHeight subscribed = do
24561948 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24571949 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24581950 height <- calculateCoincidenceHeight subscribed
24591951 when (height /= invalidHeight) $ do
24601952 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1953+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1954+
1955+getEventSubscribedHeight :: EventSubscribed a -> IO Height
1956+getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
24621957
2463−calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
2464−calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
1958+calculateSwitchHeight :: SwitchSubscribed a -> IO Height
1959+calculateSwitchHeight subscribed = readIORef . eventSubscribedHeightRef . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
24651960
2466−calculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO Height
1961+calculateCoincidenceHeight :: CoincidenceSubscribed a -> IO Height
24671962calculateCoincidenceHeight subscribed = do
2468− outerHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
2469− innerHeight <- maybe (return zeroHeight) getEventSubscribedHeight =<< readIORef (coincidenceSubscribedInnerParent subscribed)
1963+ outerHeight <- readIORef $ eventSubscribedHeightRef $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1964+ innerHeight <- maybe (return zeroHeight) (readIORef . eventSubscribedHeightRef) =<< readIORef (coincidenceSubscribedInnerParent subscribed)
24701965 return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
24711966
2472−data SomeSwitchSubscribed x = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed x a)
1967+data SomeSwitchSubscribed = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed a)
24731968
2474−invalidate :: IORef [SomeSwitchSubscribed x] -> WeakList (Invalidator x) -> IO (WeakList (Invalidator x))
1969+invalidate :: IORef [SomeSwitchSubscribed] -> WeakList Invalidator -> IO (WeakList Invalidator)
24751970invalidate toReconnectRef wis = do
24761971 forM_ wis $ \wi -> do
24771972 mi <- deRefWeak wi
@@ -2497,329 +1992,166 @@ invalidate toReconnectRef wis = do
24971992-- Reflex integration
24981993--------------------------------------------------------------------------------
24991994
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
1995+type Spider = SpiderEnv Global
25101996
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
1997+data Global
25291998
2530−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531− {-# INLINABLE sample #-}
2532− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
1999+{-# NOINLINE globalSpiderEnv #-}
2000+globalSpiderEnv :: SpiderEnv Global
2001+globalSpiderEnv = unsafePerformIO unsafeNewSpiderEnv
25332002
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
2003+type role SpiderEnv nominal
2004+data SpiderEnv x = SpiderEnv
2005+ { _spiderEnv_toUnsubscribe :: !(IORef [SomeEventSubscription])
2006+ , _spiderEnv_lock :: !(MVar ())
2007+ , _spiderEnv_cleanups :: !(IORef [IO ()])
2008+#ifdef DEBUG
2009+ , _spiderEnv_depth :: !(IORef Int)
2010+#endif
2011+ }
25482012
2013+instance GEq SpiderEnv where
2014+ a `geq` b = if _spiderEnv_toUnsubscribe a == _spiderEnv_toUnsubscribe b
2015+ then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderEnv can't have two different 'x' arguments
2016+ else Nothing
25492017
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'"
2018+unsafeNewSpiderEnv :: forall x. IO (SpiderEnv x)
2019+unsafeNewSpiderEnv = do
2020+ toUnsubscribe <- newIORef []
2021+ lock <- newMVar ()
2022+ cleanups <- newIORef []
2023+#ifdef DEBUG
2024+ depthRef <- newIORef 0
25602025#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)
2026+ return $ SpiderEnv
2027+ { _spiderEnv_toUnsubscribe = toUnsubscribe
2028+ , _spiderEnv_lock = lock
2029+ , _spiderEnv_cleanups = cleanups
2030+#ifdef DEBUG
2031+ , _spiderEnv_depth = depthRef
25842032#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
2033+ }
25882034
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
2035+newSpiderEnv :: IO (Some SpiderEnv)
2036+newSpiderEnv = Some.This <$> unsafeNewSpiderEnv
25912037
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
2038+newtype SpiderPullM x a = SpiderPullM { runSpiderPullM :: BehaviorM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
25942039
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
2040+newtype SpiderPushM x a = SpiderPushM { runSpiderPushM :: ComputeM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2041+
2042+instance R.Reflex (SpiderEnv x) where
2043+ newtype Behavior (SpiderEnv x) a = SpiderBehavior { unSpiderBehavior :: Behavior a }
2044+ newtype Event (SpiderEnv x) a = SpiderEvent { unSpiderEvent :: Event a }
2045+ newtype Dynamic (SpiderEnv x) a = SpiderDynamic { unSpiderDynamic :: Dynamic Identity a } deriving (Functor, Applicative, Monad)
2046+ newtype Incremental (SpiderEnv x) p a = SpiderIncremental { unSpiderIncremental :: Dynamic p a }
2047+ type PullM (SpiderEnv x) = SpiderPullM x
2048+ type PushM (SpiderEnv x) = SpiderPushM x
2049+ {-# INLINABLE never #-}
2050+ never = SpiderEvent EventNever
2051+ {-# INLINABLE constant #-}
2052+ constant = SpiderBehavior . BehaviorConst
2053+ {-# INLINABLE push #-}
2054+ push f = SpiderEvent . push (coerce f) . unSpiderEvent
2055+ {-# INLINABLE pull #-}
2056+ pull = SpiderBehavior . pull . coerce
2057+ {-# INLINABLE merge #-}
2058+ merge = SpiderEvent . merge . DynamicConst . (unsafeCoerce :: DMap k (R.Event (SpiderEnv x)) -> DMap k Event)
2059+ {-# INLINABLE fan #-}
2060+ fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
2061+ {-# INLINABLE switch #-}
2062+ switch = SpiderEvent . switch . (unsafeCoerce :: Behavior (R.Event (SpiderEnv x) a) -> Behavior (Event a)) . unSpiderBehavior
2063+ {-# INLINABLE coincidence #-}
2064+ coincidence = SpiderEvent . coincidence . (unsafeCoerce :: Event (R.Event (SpiderEnv x) a) -> Event (Event a)) . unSpiderEvent
2065+ {-# INLINABLE current #-}
2066+ current = SpiderBehavior . current . unSpiderDynamic
2067+ {-# INLINABLE updated #-}
2068+ updated = SpiderEvent . fmap runIdentity . updated . unSpiderDynamic
2069+ {-# INLINABLE unsafeBuildDynamic #-}
2070+ unsafeBuildDynamic readV0 v' = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (coerce readV0) $ addIdentity $ unSpiderEvent v'
2071+ {-# INLINABLE unsafeBuildIncremental #-}
2072+ unsafeBuildIncremental readV0 dv = SpiderIncremental $ DynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
2073+ {-# INLINABLE mergeIncremental #-}
2074+ mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic R.PatchDMap (DMap k (R.Event (SpiderEnv x))) -> Dynamic R.PatchDMap (DMap k Event)) . unSpiderIncremental
2075+ {-# INLINABLE currentIncremental #-}
2076+ currentIncremental = SpiderBehavior . current . unSpiderIncremental
2077+ {-# INLINABLE updatedIncremental #-}
2078+ updatedIncremental = SpiderEvent . updated . unSpiderIncremental
2079+ {-# INLINABLE incrementalToDynamic #-}
2080+ incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ current i) $ flip push (updated i) $ \p -> do
2081+ c <- readBehaviorUntracked $ current i
2082+ return $ Identity <$> R.apply p c --TODO: Avoid the redundant 'apply'
25972083
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
2084+instance R.MonadSample (SpiderEnv x) (EventM x) where
2085+ {-# INLINABLE sample #-}
2086+ sample (SpiderBehavior b) = readBehaviorUntracked b
26002087
2601−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
2088+instance R.MonadHold (SpiderEnv x) (EventM x) where
26022089 {-# INLINABLE hold #-}
2603− hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
2090+ hold = holdSpiderEventM
26042091 {-# INLINABLE holdDyn #-}
2605− holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
2092+ holdDyn = holdDynSpiderEventM
26062093 {-# 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
2094+ holdIncremental = holdIncrementalSpiderEventM
2095+
2096+holdSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Behavior (SpiderEnv x) a)
2097+holdSpiderEventM v0 e = fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2098+
2099+holdDynSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Dynamic (SpiderEnv x) a)
2100+holdDynSpiderEventM v0 e = fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2101+
2102+holdIncrementalSpiderEventM :: R.Patch p => a -> R.Event (SpiderEnv x) (p a) -> EventM x (R.Incremental (SpiderEnv x) p a)
2103+holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
26182104
2619−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2105+instance R.MonadHold (SpiderEnv x) (SpiderHost x) where
26202106 {-# INLINABLE hold #-}
2621− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2107+ hold v0 e = R.runHostFrame $ R.hold v0 e
26222108 {-# INLINABLE holdDyn #-}
2623− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2109+ holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
26242110 {-# 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
2111+ holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
2112+
2113+instance R.MonadSample (SpiderEnv x) (SpiderHost x) where
26352114 {-# INLINABLE sample #-}
26362115 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
26372116
2638−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2117+instance R.MonadSample (SpiderEnv x) (SpiderPullM x) where
2118+ {-# INLINABLE sample #-}
2119+ sample = coerce . readBehaviorTracked . unSpiderBehavior
2120+
2121+instance R.MonadSample (SpiderEnv x) (SpiderPushM x) where
26392122 {-# INLINABLE sample #-}
2640− sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
2123+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
26412124
2642−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2125+instance R.MonadHold (SpiderEnv x) (SpiderPushM x) where
26432126 {-# INLINABLE hold #-}
2644− hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
2127+ hold v0 e = R.current <$> R.holdDyn v0 e
26452128 {-# INLINABLE holdDyn #-}
2646− holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
2129+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity e
26472130 {-# 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
2131+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . DynamicHold <$> hold v0 e
26552132
2656−--------------------------------------------------------------------------------
2657−-- Deprecated items
2658−--------------------------------------------------------------------------------
2133+data RootTrigger a = forall k. GCompare k => RootTrigger (SubscriberList a, IORef (DMap k Identity), k a)
2134+newtype SpiderEventHandle a = SpiderEventHandle { unSpiderEventHandle :: EventSubscription a }
26592135
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
2136+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHostFrame x) where
26642137 {-# INLINABLE subscribeEvent #-}
26652138 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
2139+ subscription <- subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2140+ return $ SpiderEventHandle subscription
2141+
2142+instance R.ReflexHost (SpiderEnv x) where
2143+ type EventTrigger (SpiderEnv x) = RootTrigger
2144+ type EventHandle (SpiderEnv x) = SpiderEventHandle
2145+ type HostFrame (SpiderEnv x) = SpiderHostFrame x
2146+
2147+instance R.MonadReadEvent (SpiderEnv x) (ReadPhase x) where
2148+ {-# INLINABLE readEvent #-}
2149+ readEvent h = ReadPhase $ fmap (fmap return) $ liftIO $ do
2150+ let EventSubscription sln subscribed = unSpiderEventHandle h
2151+ result <- readEventSubscribed subscribed
2152+ touch sln
26902153 return result
26912154
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−
28232155instance MonadRef (EventM x) where
28242156 type Ref (EventM x) = Ref IO
28252157 {-# INLINABLE newRef #-}
@@ -2833,8 +2165,7 @@ instance MonadAtomicRef (EventM x) where
28332165 {-# INLINABLE atomicModifyRef #-}
28342166 atomicModifyRef r f = liftIO $ atomicModifyRef r f
28352167
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)
2168+newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28382169
28392170instance Monad (SpiderHost x) where
28402171 {-# INLINABLE (>>=) #-}
@@ -2843,27 +2174,13 @@ instance Monad (SpiderHost x) where
28432174 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442175 {-# INLINABLE return #-}
28452176 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
28522177 {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2178+ fail s = SpiderHost $ fail s
28542179
2855−-- | Run an action affecting the global Spider timeline; this will be guarded by
2856−-- a mutex for that timeline
28572180runSpiderHost :: SpiderHost Global a -> IO a
2858−runSpiderHost (SpiderHost a) = a
2181+runSpiderHost (SpiderHost a) = runReaderT a globalSpiderEnv
28592182
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)
2183+newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28672184
28682185instance Monad (SpiderHostFrame x) where
28692186 {-# INLINABLE (>>=) #-}
@@ -2872,21 +2189,30 @@ instance Monad (SpiderHostFrame x) where
28722189 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732190 {-# INLINABLE return #-}
28742191 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762192 {-# INLINABLE fail #-}
28772193 fail s = SpiderHostFrame $ fail s
2878−#endif
28792194
2880−instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2881− notReadyUntil _ = pure ()
2882− notReady = pure ()
2195+instance R.MonadSample (SpiderEnv x) (SpiderHostFrame x) where
2196+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2197+
2198+addIdentity :: Event a -> Event (Identity a)
2199+--addIdentity = fmap Identity
2200+addIdentity = unsafeCoerce
28832201
2884−newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2202+instance R.MonadHold (SpiderEnv x) (SpiderHostFrame x) where
2203+ {-# INLINABLE hold #-}
2204+ hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2205+ {-# INLINABLE holdDyn #-}
2206+ holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2207+ {-# INLINABLE holdIncremental #-}
2208+ holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2209+
2210+newEventWithTriggerIO :: forall a. (RootTrigger a -> IO (IO ())) -> IO (Event a)
28852211newEventWithTriggerIO f = do
28862212 es <- newFanEventWithTriggerIO $ \Refl -> f
28872213 return $ select es Refl
28882214
2889−newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2215+newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger a -> IO (IO ())) -> IO (EventSelector k)
28902216newFanEventWithTriggerIO f = do
28912217 occRef <- newIORef DMap.empty
28922218 subscribedRef <- newIORef DMap.empty
@@ -2895,9 +2221,47 @@ newFanEventWithTriggerIO f = do
28952221 , rootSubscribed = subscribedRef
28962222 , rootInit = f
28972223 }
2898− return $ EventSelector $ \k -> eventRoot k r
2224+ return $ EventSelector $ \k -> EventRoot k r
2225+
2226+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHost x) where
2227+ newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
2228+ newFanEventWithTrigger f = SpiderHost $ lift $ do
2229+ es <- newFanEventWithTriggerIO f
2230+ return $ R.EventSelector $ SpiderEvent . select es
2231+
2232+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHostFrame x) where
2233+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2234+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2235+ es <- newFanEventWithTriggerIO f
2236+ return $ R.EventSelector $ SpiderEvent . select es
2237+
2238+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHost x) where
2239+ {-# INLINABLE subscribeEvent #-}
2240+ subscribeEvent = subscribeEventSpiderHost
2241+
2242+subscribeEventSpiderHost :: R.Event (SpiderEnv x) a -> SpiderHost x (R.EventHandle (SpiderEnv x) a)
2243+subscribeEventSpiderHost e = do
2244+ subscription <- runFrame $ subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2245+ return $ SpiderEventHandle subscription
2246+
2247+newtype ReadPhase x a = ReadPhase { runReadPhase :: ResultM x a } deriving (Functor, Applicative, Monad, MonadFix)
2248+
2249+instance R.MonadSample (SpiderEnv x) (ReadPhase x) where
2250+ {-# INLINABLE sample #-}
2251+ sample = ReadPhase . R.sample
28992252
2900−newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
2253+instance R.MonadHold (SpiderEnv x) (ReadPhase x) where
2254+ {-# INLINABLE hold #-}
2255+ hold v0 e = ReadPhase $ R.hold v0 e
2256+ {-# INLINABLE holdDyn #-}
2257+ holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2258+ {-# INLINABLE holdIncremental #-}
2259+ holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2260+
2261+instance R.MonadReflexHost (SpiderEnv x) (SpiderHost x) where
2262+ type ReadPhase (SpiderHost x) = ReadPhase x
2263+ fireEventsAndRead es (ReadPhase a) = run es a
2264+ runHostFrame = runFrame . runSpiderHostFrame
29012265
29022266instance MonadRef (SpiderHost x) where
29032267 type Ref (SpiderHost x) = Ref IO
@@ -2916,15 +2280,3 @@ instance MonadRef (SpiderHostFrame x) where
29162280
29172281instance MonadAtomicRef (SpiderHostFrame x) where
29182282 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 ()