@@ -1,133 +1,57 @@
1−{-# LANGUAGE BangPatterns #-}
2−{-# LANGUAGE CPP #-}
3−{-# LANGUAGE ConstraintKinds #-}
4−{-# LANGUAGE EmptyDataDecls #-}
5−{-# LANGUAGE ExistentialQuantification #-}
6−{-# LANGUAGE FlexibleContexts #-}
7−{-# LANGUAGE FlexibleInstances #-}
8−{-# LANGUAGE FunctionalDependencies #-}
9−{-# LANGUAGE GADTs #-}
10−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
11−{-# LANGUAGE LambdaCase #-}
12−{-# LANGUAGE RankNTypes #-}
13−{-# LANGUAGE RoleAnnotations #-}
14−{-# LANGUAGE ScopedTypeVariables #-}
15−{-# LANGUAGE TypeFamilies #-}
16−{-# LANGUAGE TypeOperators #-}
17−{-# LANGUAGE UndecidableInstances #-}
18−{-# LANGUAGE PolyKinds #-}
19−{-# LANGUAGE DeriveFunctor #-}
20−{-# LANGUAGE StandaloneDeriving #-}
21−{-# LANGUAGE InstanceSigs #-}
22−{-# LANGUAGE MultiWayIf #-}
23−
24−#ifdef USE_REFLEX_OPTIMIZER
25−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
26−#endif
27−{-# OPTIONS_GHC -Wunused-binds #-}
28−-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
29−-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
30−module Reflex.Spider.Internal (module Reflex.Spider.Internal) where
1+{-# LANGUAGE CPP, ExistentialQuantification, GADTs, ScopedTypeVariables, TypeFamilies, FlexibleInstances, MultiParamTypeClasses, GeneralizedNewtypeDeriving, RankNTypes, BangPatterns, UndecidableInstances, EmptyDataDecls, RecursiveDo, RoleAnnotations, LambdaCase, TypeOperators, FlexibleContexts, ConstraintKinds, MagicHash, UnboxedTuples, FunctionalDependencies, MultiWayIf #-}
2+module Reflex.Spider.Internal (Spider, SpiderEnv (..), Global, SpiderHost, runSpiderHost, SpiderEventHandle (..), showSubscriberType, showEventType, ComputeM (..), MergeSubscribedParent (..), HasSpiderEnv (..), newSpiderEnv, SpiderPullM (..), SpiderPushM (..), ReadPhase (..)) where
313
32−#if MIN_VERSION_base(4,10,0)
33−import Control.Applicative (liftA2)
34−#endif
35−import Control.Concurrent
36−import Control.Exception
37−import Control.Monad hiding (forM, forM_, mapM, mapM_)
38−import 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
44−import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
46−import qualified Control.Monad.Fail as MonadFail
47−import Data.Align
48−import Data.Coerce
49−import Data.Dependent.Map (DMap)
4+import qualified Reflex.Class as R
5+import qualified Reflex.Host.Class as R
6+import Data.WeakBag (WeakBag, WeakBagTicket)
7+import qualified Data.WeakBag as WeakBag
8+
9+import Data.List
10+import Data.IORef
11+import System.Mem.Weak
12+import Data.Foldable
13+import Data.Traversable
14+import Control.Monad hiding (mapM, mapM_, forM_, forM, sequence)
15+import Control.Monad.Identity hiding (mapM, mapM_, forM_, forM, sequence)
16+import Control.Monad.Reader hiding (mapM, mapM_, forM_, forM, sequence)
17+import Control.Monad.State hiding (mapM, mapM_, forM_, forM, sequence)
18+import Control.Applicative -- Unconditionally import, because otherwise it breaks on GHC 7.10.1RC2
19+import Data.Some (Some)
20+import qualified Data.Some as Some
21+import Data.Dependent.Map (DMap, DSum (..))
5022import 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
5823import Data.GADT.Compare
24+import Data.Maybe
5925import Data.IntMap.Strict (IntMap)
6026import qualified Data.IntMap.Strict as IntMap
61−import Data.IORef
62−import Data.Kind (Type)
63−import Data.Maybe hiding (mapMaybe)
64−import Data.Monoid (mempty, (<>))
65−import Data.Proxy
27+import Control.Monad.Ref
28+import Control.Monad.Exception
29+import Data.Monoid ((<>))
30+import Data.Functor.Compose
31+import Control.Exception
32+import Control.Concurrent
33+import Data.Function
6634import Data.These
67−import Data.Traversable
68−import Data.Type.Equality ((:~:)(Refl))
69−import Data.Witherable (Filterable, mapMaybe)
70−import GHC.Exts hiding (toList)
35+import Data.Align
36+
7137import GHC.IORef (IORef (..))
38+import GHC.Base (IO (..))
7239import GHC.Stack
73−import Reflex.FastWeak
40+
7441import System.IO.Unsafe
75−import System.Mem.Weak
7642import Unsafe.Coerce
43+import Data.Coerce
44+import Control.Monad.Primitive
7745
78−#ifdef MIN_VERSION_semialign
79−#if MIN_VERSION_these(0,8,0)
80−import Data.These.Combinators (justThese)
81−#endif
82−#if MIN_VERSION_semialign(1,1,0)
83−import Data.Zip (Zip (..))
84−#endif
85−#endif
86−
87−#ifdef DEBUG_CYCLES
88−import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89−#endif
90−
91−import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
9246import qualified Data.List.NonEmpty as NonEmpty
93−import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
95−
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
97−import qualified Data.FastWeakBag as FastWeakBag
98−
99−import Data.Reflection
100−import Data.Some (Some(Some))
101−import Data.Type.Coercion
102−import Data.Profunctor.Unsafe ((#.), (.#))
103−import Data.WeakBag (WeakBag, WeakBagTicket, _weakBag_children)
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
47+import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
48+import Data.Tree (Tree (..), Forest, drawForest)
12249
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"
50+-- Note: must come last to silence warnings due to AMP on GHC < 7.10
51+import Prelude hiding (mapM, mapM_, any, sequence, concat)
12952
130−#endif
53+type SubscriberList a = WeakBag (Subscriber a)
54+type SubscriberListTicket a = WeakBagTicket (Subscriber a)
13155
13256debugPropagate :: Bool
13357
@@ -136,65 +60,52 @@ debugInvalidateHeight :: Bool
13660debugInvalidate :: Bool
13761
13862#ifdef DEBUG
63+
13964#define DEBUG_NODEIDS
14065
141−#ifdef DEBUG_TRACE_PROPAGATION
14266debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
14667
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
15068debugInvalidateHeight = False
151−#endif
15269
153−#ifdef DEBUG_TRACE_INVALIDATION
15470debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
15871
15972class HasNodeId a where
16073 getNodeId :: a -> Int
16174
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
75+instance HasNodeId (Hold p a) where
16976 getNodeId = holdNodeId
17077
171−instance HasNodeId (SwitchSubscribed x a) where
78+instance HasNodeId (PushSubscribed a b) where
79+ getNodeId = pushSubscribedNodeId
80+
81+instance HasNodeId (SwitchSubscribed a) where
17282 getNodeId = switchSubscribedNodeId
17383
174−instance HasNodeId (FanSubscribed x v a) where
84+instance HasNodeId (MergeSubscribed a) where
85+ getNodeId = mergeSubscribedNodeId
86+
87+instance HasNodeId (FanSubscribed a) where
17588 getNodeId = fanSubscribedNodeId
17689
177−instance HasNodeId (CoincidenceSubscribed x a) where
90+instance HasNodeId (CoincidenceSubscribed a) where
17891 getNodeId = coincidenceSubscribedNodeId
17992
180−instance HasNodeId (RootSubscribed x a) where
93+instance HasNodeId (RootSubscribed a) where
18194 getNodeId = rootSubscribedNodeId
18295
183−instance HasNodeId (Pull x a) where
96+instance HasNodeId (Pull a) where
18497 getNodeId = pullNodeId
18598
18699{-# INLINE showNodeId #-}
187100showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
192−
101+showNodeId = ("#"<>) . show . getNodeId
193102
194103#else
195104
196105debugPropagate = False
106+
197107debugInvalidateHeight = False
108+
198109debugInvalidate = False
199110
200111-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -202,10 +113,6 @@ debugInvalidate = False
202113showNodeId :: a -> String
203114showNodeId _ = ""
204115
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209116#endif
210117
211118#ifdef DEBUG_NODEIDS
@@ -215,637 +122,41 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
215122
216123newNodeId :: IO Int
217124newNodeId = 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−--------------------------------------------------------------------------------
237125
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
126+{-# NOINLINE unsafeNodeId #-}
127+unsafeNodeId :: a -> Int
128+unsafeNodeId a = unsafePerformIO $ do
129+ touch a
130+ newNodeId
307131#endif
308− }
309−
310−nowSpiderEventM :: (HasSpiderTimeline x) => EventM x (R.Event (SpiderTimeline x) ())
311−nowSpiderEventM =
312− SpiderEvent <$> now
313−
314−now :: (MonadIO m, Defer (Some Clear) m, HasSpiderTimeline x
315− ) => m (Event x ())
316−now = do
317− nowOrNot <- liftIO $ newIORef $ Just ()
318− scheduleClear nowOrNot
319− return . Event $ \_ -> do
320− occ <- liftIO . readIORef $ nowOrNot
321− return ( EventSubscription (return ()) eventSubscribedNow
322− , occ
323− )
324−
325−-- | Construct an 'Event' whose value is guaranteed not to be recomputed
326−-- repeatedly
327−--
328−--TODO: Try a caching strategy where we subscribe directly to the parent when
329−--there's only one subscriber, and then build our own FastWeakBag only when a second
330−--subscriber joins
331−{-# NOINLINE [0] cacheEvent #-}
332−cacheEvent :: forall x a. HasSpiderTimeline x => Event x a -> Event x a
333−cacheEvent e =
334−#ifdef DEBUG_TRACE_EVENTS
335− withStackOneLine $ \callSite -> Event $
336−#else
337− Event $
338−#endif
339− unsafePerformIO $ do
340− mSubscribedRef :: IORef (FastWeak (CacheSubscribed x a))
341− <- newIORef emptyFastWeak
342− pure $ \sub -> {-# SCC "cacheEvent" #-} do
343−#ifdef DEBUG_TRACE_EVENTS
344− unless (BS8.null callSite) $ liftIO $ BS8.hPutStrLn stderr callSite
345−#endif
346− subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347− Just subscribedTicket -> return subscribedTicket
348− Nothing -> do
349−#ifdef DEBUG_NODEIDS
350− nodeId <- liftIO newNodeId
351−#endif
352− subscribers <- liftIO FastWeakBag.empty
353− occRef <- liftIO $ newIORef Nothing -- This should never be read prior to being set below
354−#ifdef DEBUG_NODEIDS
355− (parentSub, occ) <- subscribeAndRead e $ debugSubscriber' ("cacheEvent" <> showNodeId' nodeId) $ Subscriber
356−#else
357− (parentSub, occ) <- subscribeAndRead e $ Subscriber
358−#endif
359− { subscriberPropagate = \a -> do
360− liftIO $ writeIORef occRef (Just a)
361− scheduleClear occRef
362− propagateFast a subscribers
363− , subscriberInvalidateHeight = FastWeakBag.traverse_ subscribers . invalidateSubscriberHeight
364− , subscriberRecalculateHeight = FastWeakBag.traverse_ subscribers . recalculateSubscriberHeight
365− }
366− when (isJust occ) $ do
367− liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368− scheduleClear occRef
369− let !subscribed = CacheSubscribed
370− { _cacheSubscribed_subscribers = subscribers
371− , _cacheSubscribed_parent = parentSub
372− , _cacheSubscribed_occurrence = occRef
373−#ifdef DEBUG_NODEIDS
374− , _cacheSubscribed_nodeId = nodeId
375−#endif
376− }
377− subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378− liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379− return subscribedTicket
380− liftIO $ cacheSubscription sub mSubscribedRef subscribedTicket
381−
382−cacheSubscription :: Subscriber x a -> IORef (FastWeak (CacheSubscribed x a))
383− -> FastWeakTicket (CacheSubscribed x a) -> IO (EventSubscription x, Maybe a)
384−cacheSubscription sub mSubscribedRef subscribedTicket = do
385− subscribed <- getFastWeakTicketValue subscribedTicket
386− ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
387− occ <- readIORef $ _cacheSubscribed_occurrence subscribed
388−
389− let parentSub = _cacheSubscribed_parent subscribed
390− es = EventSubscription
391− { _eventSubscription_unsubscribe = do
392− FastWeakBag.remove ticket
393−
394− isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
395− when isEmpty $ do
396− writeIORef mSubscribedRef emptyFastWeak
397− unsubscribe parentSub
398− touch ticket
399− touch subscribedTicket
400− , _eventSubscription_subscribed = EventSubscribed
401− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub
402− , eventSubscribedRetained = toAny subscribedTicket
403−#ifdef DEBUG_CYCLES
404− , eventSubscribedGetParents = return [_eventSubscription_subscribed parentSub]
405− , eventSubscribedHasOwnHeightRef = False
406− , eventSubscribedWhoCreated = whoCreatedIORef mSubscribedRef
407−#endif
408− }
409− }
410− return (es, occ)
411−
412−
413−subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
414−subscribe e s = fst <$> subscribeAndRead e s
415−
416−{-# INLINE wrap #-}
417−wrap :: MonadIO m => (t -> EventSubscribed x) -> (Subscriber x a -> m (WeakBagTicket, t, Maybe a)) -> Subscriber x a -> m (EventSubscription x, Maybe a)
418−wrap tag getSpecificSubscribed sub = do
419− (sln, subd, occ) <- getSpecificSubscribed sub
420− let es = tag subd
421− return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
422−
423−eventRoot :: (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Event x a
424−eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
425−
426−subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427−subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428−
429−eventNever :: Event x a
430−eventNever = Event $ const subscribeAndReadNever
431−
432−eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
433−eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
434−
435−eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
436−eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
437−
438−eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
439−eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
440−
441−eventHold :: Hold x p -> Event x p
442−eventHold !h = Event $ subscribeHoldEvent h
443−
444−eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
445−eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
446−
447−{-# INLINE subscribeCoincidenceInner #-}
448−subscribeCoincidenceInner :: HasSpiderTimeline x => Event x a -> Height -> CoincidenceSubscribed x a -> EventM x (Maybe a, Height, EventSubscribed x)
449−subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
450− subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
451− (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
452− innerHeight <- liftIO $ getEventSubscribedHeight innerSubd
453− let height = max innerHeight outerHeight
454− defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
455− return (innerOcc, height, innerSubd)
456−
457−--------------------------------------------------------------------------------
458−-- Subscriber
459−--------------------------------------------------------------------------------
460−
461−data Subscriber x a = Subscriber
462− { subscriberPropagate :: !(a -> EventM x ())
463− , subscriberInvalidateHeight :: !(Height -> IO ())
464− , subscriberRecalculateHeight :: !(Height -> IO ())
465− }
466−
467−newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
468−newSubscriberHold h = return $ Subscriber
469− { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
470− , subscriberInvalidateHeight = \_ -> return ()
471− , subscriberRecalculateHeight = \_ -> return ()
472− }
473−
474−newSubscriberFan :: forall x k v. (HasSpiderTimeline x, GCompare k) => FanSubscribed x k v -> IO (Subscriber x (DMap k v))
475−newSubscriberFan subscribed = debugSubscriber ("SubscriberFan " <> showNodeId subscribed) $ Subscriber
476− { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
477− subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
478− tracePropagate (Proxy :: Proxy x) $ show (DMap.size subs) <> " keys subscribed, " <> show (DMap.size a) <> " keys firing"
479− liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
480− scheduleClear $ fanSubscribedOccurrence subscribed
481− let f _ (Pair v subsubs) = do
482− propagate v $ _fanSubscribedChildren_list subsubs
483− return $ Constant ()
484− _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
485− return ()
486− , subscriberInvalidateHeight = \old -> do
487− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
489− , subscriberRecalculateHeight = \new -> do
490− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
492− }
493−
494−newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495−newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
496− { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
497− liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
498− scheduleClear $ switchSubscribedOccurrence subscribed
499− propagate a $ switchSubscribedSubscribers subscribed
500− , subscriberInvalidateHeight = \_ -> do
501− oldHeight <- readIORef $ switchSubscribedHeight subscribed
502− when (oldHeight /= invalidHeight) $ do
503− writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505− , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506− }
507−
508−newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
509−newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
510− { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
511− outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
512− tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
513− (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
514− tracePropagate (Proxy :: Proxy x) $ " isJust occ = " <> show (isJust occ)
515− tracePropagate (Proxy :: Proxy x) $ " innerHeight = " <> show innerHeight
516−
517− liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518− scheduleClear $ coincidenceSubscribedInnerParent subscribed
519− case occ of
520− Nothing ->
521− when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522− writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525− Just o -> do -- Since it's already firing, no need to adjust height
526− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527− scheduleClear $ coincidenceSubscribedOccurrence subscribed
528− propagate o $ coincidenceSubscribedSubscribers subscribed
529− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
531− }
532−
533−newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
534−newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoincidenceInner" <> showNodeId subscribed) $ Subscriber
535− { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
536− occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
537− case occ of
538− Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
539− Nothing -> do
540− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
541− scheduleClear $ coincidenceSubscribedOccurrence subscribed
542− propagate a $ coincidenceSubscribedSubscribers subscribed
543− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
545− }
546−
547−invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
548−invalidateSubscriberHeight = flip subscriberInvalidateHeight
549−
550−recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551−recalculateSubscriberHeight = flip subscriberRecalculateHeight
552−
553−-- | Propagate everything at the current height
554−propagate :: forall x a. HasSpiderTimeline x => a -> WeakBag (Subscriber x a) -> EventM x ()
555−propagate a subscribers = withIncreasedDepth (Proxy::Proxy x) $
556− -- Note: in the following traversal, we do not visit nodes that are added to the list during our traversal; they are new events, which will necessarily have full information already, so there is no need to traverse them
557− --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
558− WeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
559−
560−-- | Propagate everything at the current height
561−propagateFast :: forall x a. HasSpiderTimeline x => a -> FastWeakBag (Subscriber x a) -> EventM x ()
562−propagateFast a subscribers = withIncreasedDepth (Proxy::Proxy x) $
563− -- Note: in the following traversal, we do not visit nodes that are added to the list during our traversal; they are new events, which will necessarily have full information already, so there is no need to traverse them
564− --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
565− FastWeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
566−
567−--------------------------------------------------------------------------------
568−-- EventSubscribed
569−--------------------------------------------------------------------------------
570−
571−toAny :: a -> Any
572−toAny = unsafeCoerce
573−
574−-- Why do we use Any here, instead of just giving eventSubscribedRetained an
575−-- existential type? Sadly, GHC does not currently know how to unbox types
576−-- with existentially quantified fields. So instead we just coerce values
577−-- to type Any on the way in. Since we never coerce them back, this is
578−-- perfectly safe.
579−data EventSubscribed x = EventSubscribed
580− { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581− , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
582−#ifdef DEBUG_CYCLES
583− , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
584− , eventSubscribedHasOwnHeightRef :: !Bool
585− , eventSubscribedWhoCreated :: !(IO [String])
586−#endif
587− }
588−
589−eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x
590−eventSubscribedRoot !r = EventSubscribed
591− { eventSubscribedHeightRef = zeroRef
592− , eventSubscribedRetained = toAny r
593−#ifdef DEBUG_CYCLES
594− , eventSubscribedGetParents = return []
595− , eventSubscribedHasOwnHeightRef = False
596− , eventSubscribedWhoCreated = return ["root"]
597−#endif
598− }
599−
600−eventSubscribedNever :: EventSubscribed x
601−eventSubscribedNever = EventSubscribed
602− { eventSubscribedHeightRef = zeroRef
603− , eventSubscribedRetained = toAny ()
604−#ifdef DEBUG_CYCLES
605− , eventSubscribedGetParents = return []
606− , eventSubscribedHasOwnHeightRef = False
607− , eventSubscribedWhoCreated = return ["never"]
608−#endif
609− }
610−eventSubscribedNow :: EventSubscribed x
611−eventSubscribedNow = EventSubscribed
612− { eventSubscribedHeightRef = zeroRef
613− , eventSubscribedRetained = toAny ()
614−#ifdef DEBUG_CYCLES
615− , eventSubscribedGetParents = return []
616− , eventSubscribedHasOwnHeightRef = False
617− , eventSubscribedWhoCreated = return ["now"]
618−#endif
619− }
620−
621−eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
622−eventSubscribedFan !subscribed = EventSubscribed
623− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624− , eventSubscribedRetained = toAny subscribed
625−#ifdef DEBUG_CYCLES
626− , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
627− , eventSubscribedHasOwnHeightRef = False
628− , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
629−#endif
630− }
631−
632−eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x
633−eventSubscribedSwitch !subscribed = EventSubscribed
634− { eventSubscribedHeightRef = switchSubscribedHeight subscribed
635− , eventSubscribedRetained = toAny subscribed
636−#ifdef DEBUG_CYCLES
637− , eventSubscribedGetParents = do
638− s <- readIORef $ switchSubscribedCurrentParent subscribed
639− return [_eventSubscription_subscribed s]
640− , eventSubscribedHasOwnHeightRef = True
641− , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
642−#endif
643− }
644−
645−eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x
646−eventSubscribedCoincidence !subscribed = EventSubscribed
647− { eventSubscribedHeightRef = coincidenceSubscribedHeight subscribed
648− , eventSubscribedRetained = toAny subscribed
649−#ifdef DEBUG_CYCLES
650− , eventSubscribedGetParents = do
651− innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
652− let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653− innerParents = maybeToList $ innerSubscription
654− return $ outerParent : innerParents
655− , eventSubscribedHasOwnHeightRef = True
656− , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
657−#endif
658− }
659−
660−getEventSubscribedHeight :: EventSubscribed x -> IO Height
661−getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
662−
663−#ifdef DEBUG_CYCLES
664−whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
665−whoCreatedEventSubscribed = eventSubscribedWhoCreated
666−
667−walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
668−walkInvalidHeightParents s0 = do
669− subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
670− h <- liftIO $ readIORef $ eventSubscribedHeightRef s
671− when (h == invalidHeight) $ do
672− when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
673− modify (s :)
674− mapM_ loop =<< liftIO (eventSubscribedGetParents s)
675− forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
676− return subscribers
677−#endif
678−
679−{-# INLINE subscribeHoldEvent #-}
680−subscribeHoldEvent :: Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
681−subscribeHoldEvent = subscribeAndRead . holdEvent
682−
683−--------------------------------------------------------------------------------
684−-- Behavior
685−--------------------------------------------------------------------------------
686−
687−newtype Behavior x a = Behavior { readBehaviorTracked :: BehaviorM x a }
688−
689−behaviorHold :: Hold x p -> Behavior x (PatchTarget p)
690−behaviorHold !h = Behavior $ readHoldTracked h
691−
692−behaviorHoldIdentity :: Hold x (Identity a) -> Behavior x a
693−behaviorHoldIdentity = behaviorHold
694−
695−behaviorConst :: a -> Behavior x a
696−behaviorConst !a = Behavior $ return a
697−
698−behaviorPull :: Pull x a -> Behavior x a
699−behaviorPull !p = Behavior $ do
700− val <- liftIO $ readIORef $ pullValue p
701− case val of
702− Just subscribed -> do
703− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
704− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
705− liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
706− return $ pullSubscribedValue subscribed
707− Nothing -> do
708− i <- liftIO $ newInvalidatorPull p
709− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
710− parentsRef <- liftIO $ newIORef []
711− holdInits <- askBehaviorHoldInits
712− a <- liftIO $ runReaderIO (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
713− invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
714− parents <- liftIO $ readIORef parentsRef
715− let subscribed = PullSubscribed
716− { pullSubscribedValue = a
717− , pullSubscribedInvalidators = invsRef
718− , pullSubscribedOwnInvalidator = i
719− , pullSubscribedParents = parents
720− }
721− liftIO $ writeIORef (pullValue p) $ Just subscribed
722− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
723− return a
724−
725−behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
726−behaviorDyn !d = Behavior $ readHoldTracked =<< getDynHold d
727−
728−{-# INLINE readHoldTracked #-}
729−readHoldTracked :: Hold x p -> BehaviorM x (PatchTarget p)
730−readHoldTracked h = do
731− result <- liftIO $ readIORef $ holdValue h
732− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
733− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedHold h)) :))
734− liftIO $ touch h -- Otherwise, if this gets inlined enough, the hold's parent reference may get collected
735− return result
736−
737−{-# INLINABLE readBehaviorUntracked #-}
738−readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
739−readBehaviorUntracked b = do
740− holdInits <- getDeferralQueue
741− liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
742−
743−--------------------------------------------------------------------------------
744−-- Dynamic
745−--------------------------------------------------------------------------------
746−
747−type DynamicS x p = Dynamic x (PatchTarget p) p
748−
749−data Dynamic x target p = Dynamic
750− { dynamicCurrent :: !(Behavior x target)
751− , dynamicUpdated :: Event x p -- This must be lazy; see the comment on holdEvent --TODO: Would this let us eliminate `Dyn`?
752− }
753−
754−deriving instance (HasSpiderTimeline x) => Functor (Dynamic x target)
755−
756−
757−
758−
759−dynamicHold :: Hold x p -> DynamicS x p
760−dynamicHold !h = Dynamic
761− { dynamicCurrent = behaviorHold h
762− , dynamicUpdated = eventHold h
763− }
764−
765−dynamicHoldIdentity :: Hold x (Identity a) -> DynamicS x (Identity a)
766−dynamicHoldIdentity = dynamicHold
767−
768−dynamicConst :: PatchTarget p -> DynamicS x p
769−dynamicConst !a = Dynamic
770− { dynamicCurrent = behaviorConst a
771− , dynamicUpdated = eventNever
772− }
773−
774−dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> DynamicS x p
775−dynamicDyn !d = Dynamic
776− { dynamicCurrent = behaviorDyn d
777− , dynamicUpdated = eventDyn d
778− }
779−
780−dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> DynamicS x (Identity a)
781−dynamicDynIdentity = dynamicDyn
782−
783−--------------------------------------------------------------------------------
784−-- Combinators
785−--------------------------------------------------------------------------------
786132
133+--TODO: Figure out why certain things are not 'representational', then make them representational so we can use coerce
787134--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
135+data Hold p a
136+ = Hold { holdValue :: !(IORef a)
137+ , holdInvalidators :: !(IORef [Weak Invalidator])
138+ , 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
793139#ifdef DEBUG_NODEIDS
794140 , holdNodeId :: Int
795141#endif
796142 }
797143
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−
829144data 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])
145+ = EventEnv { eventEnvSpiderEnv :: !(SpiderEnv x)
146+ , eventEnvAssignments :: !(IORef [SomeAssignment]) -- Needed for Subscribe
147+ , eventEnvHoldInits :: !(IORef [SomeHoldInit]) -- Needed for Subscribe
148+ , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate])
149+ , eventEnvMergeInits :: !(IORef [SomeMergeInit]) -- Needed for Subscribe
150+ , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
151+ , eventEnvRootClears :: !(IORef [SomeRootClear])
838152 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
839− , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
840− , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
153+ , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence]) -- Needed for Subscribe
154+ , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge]))
841155 }
842156
843157{-# 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))
158+runEventM :: EventM x a -> EventEnv x -> IO a
159+runEventM = runReaderT . unEventM
849160
850161class MonadIO m => Defer a m where
851162 getDeferralQueue :: m (IORef [a])
@@ -856,98 +167,90 @@ defer a = do
856167 q <- getDeferralQueue
857168 liftIO $ modifyIORef' q (a:)
858169
859−instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
170+instance Defer SomeAssignment (EventM x) where
860171 {-# INLINE getDeferralQueue #-}
861− getDeferralQueue = asksEventEnv eventEnvAssignments
172+ getDeferralQueue = EventM $ asks eventEnvAssignments
862173
863−instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
174+instance Defer SomeHoldInit (EventM x) where
864175 {-# INLINE getDeferralQueue #-}
865− getDeferralQueue = asksEventEnv eventEnvHoldInits
176+ getDeferralQueue = EventM $ asks eventEnvHoldInits
866177
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
178+instance Defer SomeHoldInit BehaviorM where
872179 {-# INLINE getDeferralQueue #-}
873180 getDeferralQueue = BehaviorM $ asks snd
874181
875−instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
182+instance Defer SomeMergeUpdate (EventM x) where
876183 {-# INLINE getDeferralQueue #-}
877− getDeferralQueue = asksEventEnv eventEnvMergeUpdates
184+ getDeferralQueue = EventM $ asks eventEnvMergeUpdates
878185
879−instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
186+instance Defer SomeMergeInit (EventM x) where
880187 {-# INLINE getDeferralQueue #-}
881− getDeferralQueue = asksEventEnv eventEnvMergeInits
188+ getDeferralQueue = EventM $ asks eventEnvMergeInits
882189
883−class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
190+class HasCurrentHeight m where
884191 getCurrentHeight :: m Height
885− scheduleMerge :: Height -> EventM x () -> m ()
192+ scheduleMerge :: Height -> MergeSubscribed a -> m ()
886193
887−instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
194+instance HasCurrentHeight (EventM x) where
888195 {-# INLINE getCurrentHeight #-}
889− getCurrentHeight = do
890− heightRef <- asksEventEnv eventEnvCurrentHeight
196+ getCurrentHeight = EventM $ do
197+ heightRef <- asks eventEnvCurrentHeight
891198 liftIO $ readIORef heightRef
892199 {-# INLINE scheduleMerge #-}
893− scheduleMerge height subscribed = do
894− delayedRef <- asksEventEnv eventEnvDelayedMerges
895− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
200+ scheduleMerge height subscribed = EventM $ do
201+ delayedRef <- asks eventEnvDelayedMerges
202+ liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
203+
204+class HasSpiderEnv x m | m -> x where
205+ askSpiderEnv :: m (SpiderEnv x)
896206
897−class HasSpiderTimeline x where
898− -- | Retrieve the current SpiderTimelineEnv
899− spiderTimeline :: SpiderTimelineEnv x
207+instance HasSpiderEnv x (EventM x) where
208+ {-# INLINE askSpiderEnv #-}
209+ askSpiderEnv = EventM $ asks eventEnvSpiderEnv
900210
901−instance HasSpiderTimeline Global where
902− spiderTimeline = globalSpiderTimelineEnv
211+instance HasSpiderEnv x (SpiderHost x) where
212+ {-# INLINE askSpiderEnv #-}
213+ askSpiderEnv = SpiderHost ask
903214
904−putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
905−putCurrentHeight h = do
906− heightRef <- asksEventEnv eventEnvCurrentHeight
215+putCurrentHeight :: Height -> EventM x ()
216+putCurrentHeight h = EventM $ do
217+ heightRef <- asks eventEnvCurrentHeight
907218 liftIO $ writeIORef heightRef $! h
908219
909−instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
220+instance Defer SomeClear (EventM x) where
910221 {-# INLINE getDeferralQueue #-}
911− getDeferralQueue = asksEventEnv eventEnvClears
222+ getDeferralQueue = EventM $ asks eventEnvClears
912223
913224{-# INLINE scheduleClear #-}
914−scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
915−scheduleClear r = defer $ Some $ Clear r
225+scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
226+scheduleClear r = defer $ SomeClear r
916227
917−instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
228+instance Defer SomeRootClear (EventM x) where
918229 {-# 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
230+ getDeferralQueue = EventM $ asks eventEnvRootClears
928231
929232{-# INLINE scheduleRootClear #-}
930−scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
931−scheduleRootClear r = defer $ Some $ RootClear r
233+scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
234+scheduleRootClear r = defer $ SomeRootClear r
932235
933−instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
236+instance Defer SomeResetCoincidence (EventM x) where
934237 {-# INLINE getDeferralQueue #-}
935− getDeferralQueue = asksEventEnv eventEnvResetCoincidences
238+ getDeferralQueue = EventM $ asks eventEnvResetCoincidences
936239
937240-- 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)
241+{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> EventM x (Hold p a) #-}
242+{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> ComputeM (Hold p a) #-}
243+hold :: (R.Patch p, Defer SomeHoldInit m) => a -> Event (p a) -> m (Hold p a)
940244hold v0 e = do
941245 valRef <- liftIO $ newIORef v0
942246 invsRef <- liftIO $ newIORef []
943− parentRef <- liftIO $ newIORef Nothing
247+ parentRef <- liftIO $ newIORef $ Left e
944248#ifdef DEBUG_NODEIDS
945249 nodeId <- liftIO newNodeId
946250#endif
947251 let h = Hold
948252 { holdValue = valRef
949253 , holdInvalidators = invsRef
950− , holdEvent = e
951254 , holdParent = parentRef
952255#ifdef DEBUG_NODEIDS
953256 , holdNodeId = nodeId
@@ -956,115 +259,155 @@ hold v0 e = do
956259 defer $ SomeHoldInit h
957260 return h
958261
262+{-
263+mkWeakIORefKey :: IORef a -> b -> IO () -> IO (Weak b)
264+mkWeakIORefKey r@(IORef (STRef r#)) b (IO f) = IO $ \s ->
265+ case mkWeak# r# b f s of (# s1, w #) -> (# s1, Weak w #)
266+-}
267+
959268{-# INLINE getHoldEventSubscription #-}
960−getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
269+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))
961270getHoldEventSubscription h = do
962271 ep <- liftIO $ readIORef $ holdParent h
963272 case ep of
964− Just subd -> return subd
965− Nothing -> do
966− let e = holdEvent h
273+ Right subd -> return subd
274+ Left e -> do
967275 subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
968− (subscription@(EventSubscription _ _), occ) <- subscribeAndRead e =<< liftIO (newSubscriberHold h)
276+ {-
277+ spiderEnv <- askSpiderEnv
278+ weakSubscriptionRef <- liftIO $ mkWeakIORef subscriptionRef $ return ()
279+ wh <- liftIO $ mkWeakIORefKey (holdValue h) h $ do
280+ msr <- deRefWeak weakSubscriptionRef
281+ forM_ msr $ \sr -> do
282+ subscription <- readIORef sr
283+ atomicModifyIORef (_spiderEnv_toUnsubscribe spiderEnv) $ \x -> (SomeEventSubscription subscription : x, ())
284+-- return ()
285+ {-
286+ -- What can we do? 1) Detect GCs at the SpiderEnv level, then go over the tree
287+ 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
288+-}
289+ -}
290+ subscription@(EventSubscription _ subd) <- subscribe e =<< liftIO (newSubscriberHold h)
969291 liftIO $ writeIORef subscriptionRef $! subscription
292+ occ <- liftIO $ readEventSubscribed subd
970293 case occ of
971294 Nothing -> return ()
972295 Just o -> do
973296 old <- liftIO $ readIORef $ holdValue h
974− case apply o old of
297+ case R.apply o old of
975298 Nothing -> return ()
976299 Just new -> do
977300 -- Need to evaluate these so that we don't retain the Hold itself
978301 v <- liftIO $ evaluate $ holdValue h
979302 i <- liftIO $ evaluate $ holdInvalidators h
980303 defer $ SomeAssignment v i new
981− liftIO $ writeIORef (holdParent h) $ Just subscription
304+ liftIO $ writeIORef (holdParent h) $! Right subscription
982305 return subscription
983306
984−type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
307+type BehaviorEnv = (Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]), IORef [SomeHoldInit])
985308
309+--type role BehaviorM representational
986310-- BehaviorM can sample behaviors
987−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988− deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
311+newtype BehaviorM a = BehaviorM { unBehaviorM :: ReaderT BehaviorEnv IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
989312
990−instance Monad (BehaviorM x) where
313+instance Monad BehaviorM where
991314 {-# INLINE (>>=) #-}
992315 BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
993316 {-# INLINE (>>) #-}
994317 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995318 {-# INLINE return #-}
996319 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998320 {-# INLINE fail #-}
999321 fail s = BehaviorM $ fail s
1000−#endif
1001322
1002−data BehaviorSubscribed x a
1003− = forall p. BehaviorSubscribedHold (Hold x p)
1004− | BehaviorSubscribedPull (PullSubscribed x a)
323+data BehaviorSubscribed a
324+ = forall p. BehaviorSubscribedHold (Hold p a)
325+ | BehaviorSubscribedPull (PullSubscribed a)
1005326
1006−newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
327+data SomeBehaviorSubscribed = forall a. SomeBehaviorSubscribed (BehaviorSubscribed a)
1007328
1008329--type role PullSubscribed representational
1009−data PullSubscribed x a
330+data PullSubscribed a
1010331 = 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
332+ , pullSubscribedInvalidators :: !(IORef [Weak Invalidator])
333+ , pullSubscribedOwnInvalidator :: !Invalidator
334+ , pullSubscribedParents :: ![SomeBehaviorSubscribed] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
1014335 }
1015336
1016337--type role Pull representational
1017−data Pull x a
1018− = Pull { pullValue :: !(IORef (Maybe (PullSubscribed x a)))
1019− , pullCompute :: !(BehaviorM x a)
338+data Pull a
339+ = Pull { pullValue :: !(IORef (Maybe (PullSubscribed a)))
340+ , pullCompute :: !(BehaviorM a)
1020341#ifdef DEBUG_NODEIDS
1021342 , pullNodeId :: Int
1022343#endif
1023344 }
1024345
1025−data Invalidator x
1026− = forall a. InvalidatorPull (Pull x a)
1027− | forall a. InvalidatorSwitch (SwitchSubscribed x a)
346+data Invalidator
347+ = forall a. InvalidatorPull (Pull a)
348+ | forall a. InvalidatorSwitch (SwitchSubscribed a)
1028349
1029−data RootSubscribed x a = forall k. GCompare k => RootSubscribed
350+data RootSubscribed a = forall k. GCompare k => RootSubscribed
1030351 { rootSubscribedKey :: !(k a)
1031− , rootSubscribedCachedSubscribed :: !(IORef (DMap k (RootSubscribed x))) -- From the original Root
1032− , rootSubscribedSubscribers :: !(WeakBag (Subscriber x a))
352+ , rootSubscribedCachedSubscribed :: !(IORef (DMap k RootSubscribed)) -- From the original Root
353+ , rootSubscribedSubscribers :: !(SubscriberList a)
1033354 , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
1034355 , 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?
356+ , 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?
1036357#ifdef DEBUG_NODEIDS
1037358 , rootSubscribedNodeId :: Int
1038359#endif
1039360 }
1040361
1041−data Root x k
362+data Root (k :: * -> *)
1042363 = 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 ()))
364+ , rootSubscribed :: !(IORef (DMap k RootSubscribed))
365+ , rootInit :: !(forall a. k a -> RootTrigger a -> IO (IO ()))
1045366 }
1046367
1047−data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
368+data SomeHoldInit = forall p a. R.Patch p => SomeHoldInit !(Hold p a)
1048369
1049−data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
370+data SomeMergeUpdate = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap (DMap k Event)) (MergeSubscribed k)
1050371
1051−data SomeMergeUpdate x = SomeMergeUpdate
1052− { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
1053− , _someMergeUpdate_invalidateHeight :: !(IO ())
1054− , _someMergeUpdate_recalculateHeight :: !(IO ())
1055− }
372+data SomeMergeInit = forall k. GCompare k => SomeMergeInit !(MergeSubscribed k) !(Event (R.PatchDMap (DMap k Event)))
1056373
1057−newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
374+data SomeEventSubscription = forall a. SomeEventSubscription (EventSubscription a)
1058375
1059376-- 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)
377+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
378+
379+data PushSubscribed a b
380+ = PushSubscribed { pushSubscribedCachedSubscribed :: !(IORef (Maybe (PushSubscribed a b)))
381+ , 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)
382+ , pushSubscribedHeight :: !(IORef Height)
383+ , pushSubscribedSubscribers :: !(SubscriberList b)
384+ , pushSubscribedSelf :: !(Subscriber a) -- Hold this in memory to ensure our WeakReferences don't die --TODO: Probably unneeded now
385+ , pushSubscribedWeakSelf :: !(IORef (Weak (PushSubscribed a b)))
386+ , pushSubscribedParent :: !(EventSubscription a)
387+#ifdef DEBUG_NODEIDS
388+ , pushSubscribedNodeId :: Int
389+#endif
390+ }
1061391
1062−newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
392+newtype ComputeM a = ComputeM { unComputeM :: ReaderT (IORef [SomeHoldInit]) IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1063393
1064−data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
1065− { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
1066− , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
1067− }
394+instance Defer SomeHoldInit ComputeM where
395+ getDeferralQueue = ComputeM ask
396+
397+{-# SPECIALIZE runComputeM :: ComputeM a -> EventM x a #-}
398+runComputeM :: Defer SomeHoldInit m => ComputeM a -> m a
399+runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
400+
401+data Push a b
402+ = 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?)
403+ , pushParent :: !(Event a)
404+ , pushSubscribed :: !(IORef (Maybe (PushSubscribed a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
405+ }
406+
407+data MergeSubscribedParent k a
408+ = MergeSubscribedParent { mergeSubscribedParentSubscription :: !(EventSubscription a)
409+ , mergeSubscribedParentSubscriber :: !(Subscriber a)
410+ }
1068411
1069412data HeightBag = HeightBag
1070413 { _heightBag_size :: {-# UNPACK #-} !Int
@@ -1082,8 +425,7 @@ heightBagFromList :: [Height] -> HeightBag
1082425heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
1083426
1084427heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
428+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1087429
1088430heightBagRemove :: Height -> HeightBag -> HeightBag
1089431heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +434,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
1092434 0 -> IntMap.delete h c
1093435 _ -> IntMap.insert h (pred old) c
1094436
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−
1102437heightBagMax :: HeightBag -> Height
1103438heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
1104439 Just ((h, _), _) -> Height h
@@ -1116,183 +451,362 @@ heightBagVerify b@(HeightBag s c) = if
1116451heightBagVerify = id
1117452#endif
1118453
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)))
454+data MergeSubscribed k
455+ = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed k))) -- From the original merge
456+ , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
457+ , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
458+ , mergeSubscribedHeight :: !(IORef Height)
459+ , mergeSubscribedHeightBag :: !(IORef HeightBag)
460+ , mergeSubscribedSubscribers :: !(SubscriberList (DMap k Identity))
461+ , mergeSubscribedChange :: !(IORef (Subscriber (R.PatchDMap (DMap k Event)), EventSubscribed (R.PatchDMap (DMap k Event))))
462+ , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent k)))
463+ , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed k)))
464+#ifdef DEBUG_NODEIDS
465+ , mergeSubscribedNodeId :: Int
466+#endif
467+ }
468+
469+--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
470+data Merge k
471+ = Merge { mergeParents :: !(Dynamic R.PatchDMap (DMap k Event))
472+ , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed k)))
473+ }
474+
475+data FanSubscribedChildren k a = FanSubscribedChildren
476+ { _fanSubscribedChildren_list :: !(SubscriberList a)
477+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed k)))
1123478 }
1124479
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)
480+data FanSubscribed k
481+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed k)))
482+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren k))) -- This DMap should never be empty
483+ , fanSubscribedParent :: !(EventSubscription (DMap k Identity))
1130484#ifdef DEBUG_NODEIDS
1131485 , fanSubscribedNodeId :: Int
1132486#endif
1133487 }
1134488
1135−data Fan x k v
1136− = Fan { fanParent :: !(Event x (DMap k v))
1137− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
489+data Fan k
490+ = Fan { fanParent :: !(Event (DMap k Identity))
491+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed k)))
1138492 }
1139493
1140−data SwitchSubscribed x a
1141− = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
494+data SwitchSubscribed a
495+ = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1142496 , switchSubscribedOccurrence :: !(IORef (Maybe a))
1143497 , 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)))
498+ , switchSubscribedSubscribers :: !(SubscriberList a)
499+ , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !Invalidator
500+ , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak Invalidator))
501+ , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed])
502+ , switchSubscribedParent :: !(Behavior (Event a))
503+ , switchSubscribedCurrentParent :: !(IORef (EventSubscription a))
504+ , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed a)))
1151505#ifdef DEBUG_NODEIDS
1152506 , switchSubscribedNodeId :: Int
1153507#endif
1154508 }
1155509
1156−data Switch x a
1157− = Switch { switchParent :: !(Behavior x (Event x a))
1158− , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
510+data Switch a
511+ = Switch { switchParent :: !(Behavior (Event a))
512+ , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1159513 }
1160514
1161−#ifdef USE_TEMPLATE_HASKELL
1162−{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1163−#endif
1164−data CoincidenceSubscribed x a
1165− = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
515+data CoincidenceSubscribed a
516+ = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1166517 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
1167− , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
518+ , coincidenceSubscribedSubscribers :: !(SubscriberList a)
1168519 , 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)))
520+ , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber (Event a))
521+ , coincidenceSubscribedOuterParent :: !(EventSubscription (Event a))
522+ , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed a)))
523+ , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed a)))
1173524#ifdef DEBUG_NODEIDS
1174525 , coincidenceSubscribedNodeId :: Int
1175526#endif
1176527 }
1177528
1178−data Coincidence x a
1179− = Coincidence { coincidenceParent :: !(Event x (Event x a))
1180− , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
529+data Coincidence a
530+ = Coincidence { coincidenceParent :: !(Event (Event a))
531+ , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1181532 }
1182533
1183−{-# NOINLINE newInvalidatorSwitch #-}
1184−newInvalidatorSwitch :: SwitchSubscribed x a -> IO (Invalidator x)
1185−newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
534+data Subscriber a
535+ = forall b. SubscriberPush (a -> ComputeM (Maybe b)) (PushSubscribed a b) --TODO: Why does this have the pushCompute in it?
536+ | forall k. GCompare k => SubscriberMerge !(k a) (MergeSubscribed k) --TODO: Can we inline the GCompare?
537+ | forall k. (a ~ R.PatchDMap (DMap k Event), GCompare k) => SubscriberMergeChange (MergeSubscribed k)
538+ | forall k. (GCompare k, a ~ DMap k Identity) => SubscriberFan (FanSubscribed k)
539+ | forall p b. (a ~ p b, R.Patch p) => SubscriberHold !(Hold p b)
540+ | forall b. (a ~ Identity b) => SubscriberHoldIdentity !(Hold Identity b)
541+ | SubscriberSwitch (SwitchSubscribed a)
542+ | forall b. a ~ Event b => SubscriberCoincidenceOuter (CoincidenceSubscribed b)
543+ | SubscriberCoincidenceInner (CoincidenceSubscribed a)
544+ | SubscriberHandle
545+
546+showSubscriberType :: Subscriber a -> String
547+showSubscriberType = \case
548+ SubscriberPush _ _ -> "SubscriberPush"
549+ SubscriberMerge _ _ -> "SubscriberMerge"
550+ SubscriberFan _ -> "SubscriberFan"
551+ SubscriberMergeChange _ -> "SubscriberMergeChange"
552+ SubscriberHold _ -> "SubscriberHold"
553+ SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
554+ SubscriberSwitch _ -> "SubscriberSwitch"
555+ SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
556+ SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
557+ SubscriberHandle -> "SubscriberHandle"
558+
559+data Event a
560+ = forall k. GCompare k => EventRoot !(k a) !(Root k)
561+ | EventNever
562+ | forall b. EventPush !(Push b a)
563+ | forall k. (GCompare k, a ~ DMap k Identity) => EventMerge !(Merge k)
564+ | forall k. GCompare k => EventFan !(k a) !(Fan k)
565+ | EventSwitch !(Switch a)
566+ | EventCoincidence !(Coincidence a)
567+ | forall p b. (a ~ p b, R.Patch p) => EventHold !(Hold p b)
568+ | forall p b. (a ~ p b, R.Patch p) => EventDyn !(Dyn p b)
569+ | forall b. (a ~ Identity b) => EventHoldIdentity !(Hold Identity b)
570+ | forall b. (a ~ Identity b) => EventDynIdentity !(Dyn Identity b)
571+
572+showEventType :: Event a -> String
573+showEventType = \case
574+ EventRoot _ _ -> "EventRoot"
575+ EventNever -> "EventNever"
576+ EventPush _ -> "EventPush"
577+ EventMerge _ -> "EventMerge"
578+ EventFan _ _ -> "EventFan"
579+ EventSwitch _ -> "EventSwitch"
580+ EventCoincidence _ -> "EventCoincidence"
581+ EventHold _ -> "EventHold"
582+ EventDyn _ -> "EventDyn"
583+ EventHoldIdentity _ -> "EventHoldIdentity"
584+ EventDynIdentity _ -> "EventDynIdentity"
585+
586+data EventSubscription a = EventSubscription
587+ { _eventSubscription_ticket :: !(Maybe (SubscriberListTicket a))
588+ , _eventSubscription_subscribed :: !(EventSubscribed a)
589+ }
1186590
1187−{-# NOINLINE newInvalidatorPull #-}
1188−newInvalidatorPull :: Pull x a -> IO (Invalidator x)
1189−newInvalidatorPull p = return $! InvalidatorPull p
591+data EventSubscribed a
592+ = EventSubscribedRoot {-# NOUNPACK #-} (RootSubscribed a)
593+ | EventSubscribedNever
594+ | forall b. EventSubscribedPush !(PushSubscribed b a)
595+ | forall k. (GCompare k, a ~ DMap k Identity) => EventSubscribedMerge !(MergeSubscribed k)
596+ | forall k. GCompare k => EventSubscribedFan !(k a) !(FanSubscribed k)
597+ | EventSubscribedSwitch !(SwitchSubscribed a)
598+ | EventSubscribedCoincidence !(CoincidenceSubscribed a)
599+
600+unsubscribe :: EventSubscription a -> IO ()
601+unsubscribe (EventSubscription msln _) = forM_ msln $ \sln -> WeakBag.remove sln
602+
603+-- These function are constructor functions that are marked NOINLINE so they are
604+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
605+-- so any weak references that are attached to the constructors will have their
606+-- finalizer run. Using the opaque constructor, does not see the
607+-- constructor application, so it behaves like an IORef and cannot be fused away.
608+--
609+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
610+-- the weak pointer to it in some cases.
1190611
1191−instance HasSpiderTimeline x => Filterable (Event x) where
1192− mapMaybe f = push $ return . f
612+--TODO: I think all of these noinlines are now unnecessary
613+{-# NOINLINE newSubscriberPush #-}
614+newSubscriberPush :: (a -> ComputeM (Maybe b)) -> PushSubscribed a b -> IO (Subscriber a)
615+newSubscriberPush compute subd = return $! SubscriberPush compute subd
1193616
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]
617+{-# RULES
618+ "newSubscriberHold/Identity" forall h. newSubscriberHold h = newSubscriberHoldIdentity h
619+ #-}
620+{-# NOINLINE newSubscriberHold #-}
621+newSubscriberHold :: R.Patch p => Hold p a -> IO (Subscriber (p a))
622+newSubscriberHold h = return $! SubscriberHold h
1201623
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
624+{-# NOINLINE newSubscriberHoldIdentity #-}
625+newSubscriberHoldIdentity :: Hold Identity a -> IO (Subscriber (Identity a))
626+newSubscriberHoldIdentity h = return $! SubscriberHoldIdentity h
627+
628+{-# NOINLINE newSubscriberMerge #-}
629+newSubscriberMerge :: GCompare k => k a -> MergeSubscribed k -> IO (Subscriber a)
630+newSubscriberMerge k subd = return $! SubscriberMerge k subd
631+
632+{-# NOINLINE newSubscriberMergeChange #-}
633+newSubscriberMergeChange :: GCompare k => MergeSubscribed k -> IO (Subscriber (R.PatchDMap (DMap k Event)))
634+newSubscriberMergeChange subd = return $! SubscriberMergeChange subd
635+
636+{-# NOINLINE newSubscriberFan #-}
637+newSubscriberFan :: GCompare k => FanSubscribed k -> IO (Subscriber (DMap k Identity))
638+newSubscriberFan subd = return $! SubscriberFan subd
639+
640+{-# NOINLINE newSubscriberSwitch #-}
641+newSubscriberSwitch :: SwitchSubscribed a -> IO (Subscriber a)
642+newSubscriberSwitch subd = return $! SubscriberSwitch subd
643+
644+{-# NOINLINE newSubscriberCoincidenceOuter #-}
645+newSubscriberCoincidenceOuter :: CoincidenceSubscribed b -> IO (Subscriber (Event b))
646+newSubscriberCoincidenceOuter subd = return $! SubscriberCoincidenceOuter subd
1208647
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)
648+{-# NOINLINE newSubscriberCoincidenceInner #-}
649+newSubscriberCoincidenceInner :: CoincidenceSubscribed a -> IO (Subscriber a)
650+newSubscriberCoincidenceInner subd = return $! SubscriberCoincidenceInner subd
1212651
1213−newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
652+{-# NOINLINE newInvalidatorSwitch #-}
653+newInvalidatorSwitch :: SwitchSubscribed a -> IO Invalidator
654+newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
1214655
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)
656+{-# NOINLINE newInvalidatorPull #-}
657+newInvalidatorPull :: Pull a -> IO Invalidator
658+newInvalidatorPull p = return $! InvalidatorPull p
659+
660+data Dynamic p a
661+ = DynamicHold !(Hold p a)
662+ | p ~ Identity => DynamicHoldIdentity !(Hold Identity a)
663+ | DynamicConst !a
664+ | DynamicDyn !(Dyn p a)
665+ | p ~ Identity => DynamicDynIdentity !(Dyn Identity a)
666+
667+{-# INLINE current #-}
668+current :: R.Patch p => Dynamic p a -> Behavior a
669+current = \case
670+ DynamicHold h -> BehaviorHold h
671+ DynamicHoldIdentity h -> BehaviorHoldIdentity h
672+ DynamicConst a -> BehaviorConst a
673+ DynamicDyn d -> BehaviorDyn d
674+ DynamicDynIdentity d -> BehaviorDynIdentity d
675+
676+--TODO: If you only need updated, not current, can we avoid actually constructing the Hold?
677+{-# INLINE updated #-}
678+updated :: R.Patch p => Dynamic p a -> Event (p a)
679+updated = \case
680+ DynamicHold h -> EventHold h
681+ DynamicHoldIdentity h -> EventHoldIdentity h
682+ DynamicConst _ -> EventNever
683+ DynamicDyn d -> EventDyn d
684+ DynamicDynIdentity d -> EventDynIdentity d
685+
686+newMapDyn :: (a -> b) -> Dynamic Identity a -> Dynamic Identity b
687+newMapDyn f d = DynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ current d) (fmap (Identity . f . runIdentity) $ updated d)
688+
689+instance Functor (Dynamic Identity) where
690+ fmap f d = newMapDyn f d
691+
692+instance Applicative (Dynamic Identity) where
693+ pure = DynamicConst
694+ (<*>) = zipDynWith ($)
695+ _ *> b = b
696+ a <* _ = a
697+
698+instance R.FunctorMaybe Event where
699+ fmapMaybe f = push $ return . f
700+
701+instance Align Event where
702+ nil = EventNever
703+ align ea eb = R.fmapMaybe R.dmapToThese $ merge $ DynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
1217704
1218705--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)
706+zipDynWith :: (a -> b -> c) -> Dynamic Identity a -> Dynamic Identity b -> Dynamic Identity c
1220707zipDynWith f da db =
1221− let eab = align (dynamicUpdated da) (dynamicUpdated db)
708+ let eab = align (updated da) (updated db)
1222709 ec = flip push eab $ \o -> do
1223710 (a, b) <- case o of
1224711 This (Identity a) -> do
1225− b <- readBehaviorUntracked $ dynamicCurrent db
712+ b <- readBehaviorUntracked $ current db
1226713 return (a, b)
1227714 That (Identity b) -> do
1228− a <- readBehaviorUntracked $ dynamicCurrent da
715+ a <- readBehaviorUntracked $ current da
1229716 return (a, b)
1230717 These (Identity a) (Identity b) -> return (a, b)
1231718 return $ Just $ Identity $ f a b
1232− in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
719+ in DynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (current da) <*> readBehaviorUntracked (current db)) ec
1233720
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
721+instance Monad (Dynamic Identity) where
722+ {-# INLINE return #-}
723+ return = pure
724+ {-# INLINE (>>=) #-}
725+ x >>= f = DynamicDynIdentity $ newJoinDyn $ newMapDyn f x --TODO: (>>), fail
726+ {-# INLINE (>>) #-}
727+ _ >> y = y
728+ {-# INLINE fail #-}
729+ fail _ = error "Dynamic does not support 'fail'"
1240730
1241−unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1242−unsafeBuildDynamic readV0 v' =
1243− Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
731+newtype Dyn p a = Dyn { unDyn :: IORef (Either (BehaviorM a, Event (p a)) (Hold p a)) }
732+
733+unsafeDyn :: BehaviorM a -> Event (p a) -> Dyn p a
734+unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
735+ where x = (readV0, v')
736+
737+newJoinDyn :: Dynamic Identity (Dynamic Identity a) -> Dyn Identity a
738+newJoinDyn d =
739+ let readV0 = readBehaviorTracked . current =<< readBehaviorTracked (current d)
740+ eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . current . runIdentity) $ updated d
741+ eInner = switch $ fmap updated $ current d
742+ eBoth = coincidence $ fmap (updated . runIdentity) $ updated d
743+ v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
744+ in unsafeDyn readV0 v'
745+
746+--type role Behavior representational
747+data Behavior a
748+ = forall p. BehaviorHold !(Hold p a)
749+ | BehaviorHoldIdentity !(Hold Identity a)
750+ | BehaviorConst !a
751+ | BehaviorPull !(Pull a)
752+ | BehaviorDynIdentity !(Dyn Identity a)
753+ | forall p. R.Patch p => BehaviorDyn !(Dyn p a)
1244754
1245755-- ResultM can read behaviors and events
1246756type ResultM = EventM
1247757
1248−instance HasSpiderTimeline x => Functor (Event x) where
758+{-# NOINLINE unsafeNewIORef #-}
759+unsafeNewIORef :: a -> b -> IORef b
760+unsafeNewIORef _ b = unsafePerformIO $ newIORef b
761+
762+instance Functor Event where
1249763 fmap f = push $ return . Just . f
1250764
1251−instance Functor (Behavior x) where
1252− fmap f = pull . fmap f . readBehaviorTracked
765+instance Functor Behavior where
766+ fmap f = pull . liftM f . readBehaviorTracked
1253767
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)
768+{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
769+push :: forall a b. (a -> ComputeM (Maybe b)) -> Event a -> Event b
770+push f e = EventPush $ Push
771+ { pushCompute = f
772+ , pushParent = e
773+ , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
774+ }
775+-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
1257776
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
777+{-# NOINLINE pull #-}
778+pull :: BehaviorM a -> Behavior a
779+pull a = BehaviorPull $ Pull
780+ { pullCompute = a
781+ , pullValue = unsafeNewIORef a Nothing
1268782#ifdef DEBUG_NODEIDS
1269− , pullNodeId = nid
783+ , pullNodeId = unsafeNodeId a
1270784#endif
1271− }
785+ }
1272786
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− }
787+{-# NOINLINE switch #-}
788+switch :: Behavior (Event a) -> Event a
789+switch a = EventSwitch $ Switch
790+ { switchParent = a
791+ , switchSubscribed = unsafeNewIORef a Nothing
792+ }
1281793
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− }
794+coincidence :: Event (Event a) -> Event a
795+coincidence a = EventCoincidence $ Coincidence
796+ { coincidenceParent = a
797+ , coincidenceSubscribed = unsafeNewIORef a Nothing
798+ }
799+
800+propagateAndUpdateSubscribersRef :: SubscriberList a -> a -> EventM x ()
801+propagateAndUpdateSubscribersRef subscribersRef a = do
802+ propagate a subscribersRef
1289803
1290804-- 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
805+run :: [DSum RootTrigger Identity] -> ResultM x b -> SpiderHost x b
1292806run 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
807+ tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
808+ spiderEnv <- SpiderHost ask
809+ result <- SpiderHost $ lift $ withMVar (_spiderEnv_lock spiderEnv) $ \_ -> flip runReaderT spiderEnv $ unSpiderHost $ runFrame $ do
1296810 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
1297811 occBefore <- liftIO $ do
1298812 occBefore <- readIORef occRef
@@ -1303,40 +817,43 @@ run roots after = do
1303817 return $ Just r
1304818 else return Nothing
1305819 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
1306− propagate a subscribersRef
1307− delayedRef <- asksEventEnv eventEnvDelayedMerges
820+ propagateAndUpdateSubscribersRef subscribersRef a
821+ delayedRef <- EventM $ asks eventEnvDelayedMerges
1308822 let go = do
1309823 delayed <- liftIO $ readIORef delayedRef
1310824 case IntMap.minViewWithKey delayed of
1311825 Nothing -> return ()
1312826 Just ((currentHeight, cur), future) -> do
1313− tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
827+ tracePropagate $ "Running height " ++ show currentHeight
1314828 putCurrentHeight $ Height currentHeight
1315829 liftIO $ writeIORef delayedRef $! future
1316− sequence_ cur
830+ forM_ cur $ \d -> case d of
831+ DelayedMerge subscribed -> do
832+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
833+ case height `compare` Height currentHeight of
834+ LT -> error "Somehow a merge's height has been decreased after it was scheduled"
835+ GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
836+ EQ -> do
837+ m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
838+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! DMap.empty
839+ --TODO: Assert that m is not empty
840+ liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $! Just m
841+ scheduleClear $ mergeSubscribedOccurrence subscribed
842+ propagateAndUpdateSubscribersRef (mergeSubscribedSubscribers subscribed) m
1317843 go
1318844 go
1319845 putCurrentHeight maxBound
1320846 after
1321− tracePropagate (Proxy :: Proxy x) "Done running an event frame"
847+ tracePropagate "Done running an event frame"
1322848 return result
1323849
1324−scheduleMerge' :: HasSpiderTimeline x => Height -> IORef Height -> EventM x () -> EventM x ()
1325−scheduleMerge' initialHeight heightRef a = scheduleMerge initialHeight $ do
1326− height <- liftIO $ readIORef heightRef
1327− currentHeight <- getCurrentHeight
1328− case height `compare` currentHeight of
1329− LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1330− GT -> scheduleMerge' height heightRef a -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1331− EQ -> a
1332−
1333−newtype Clear a = Clear (IORef (Maybe a))
850+data SomeClear = forall a. SomeClear (IORef (Maybe a))
1334851
1335−newtype IntClear a = IntClear (IORef (IntMap a))
852+data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1336853
1337−newtype RootClear k = RootClear (IORef (DMap k Identity))
854+data SomeAssignment = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak Invalidator]) a
1338855
1339−data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
856+data DelayedMerge = forall k. DelayedMerge (MergeSubscribed k)
1340857
1341858debugFinalize :: Bool
1342859debugFinalize = False
@@ -1346,110 +863,79 @@ mkWeakPtrWithDebug x debugNote = do
1346863 x' <- evaluate x
1347864 mkWeakPtr x' $
1348865 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
866+ then Just $ putStrLn $ "finalizing: " ++ debugNote
1350867 else Nothing
1351868
1352869type WeakList a = [Weak a]
1353870
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−
1381871{-# 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
872+#ifdef DEBUG
873+withIncreasedDepth :: CanTrace x m => m a -> m a
874+withIncreasedDepth a = do
875+ spiderEnv <- askSpiderEnv
876+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) succ
1385877 result <- a
1386− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
878+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) pred
1387879 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−
1412880#else
881+withIncreasedDepth :: m a -> m a
882+withIncreasedDepth = id
883+#endif
1413884
1414−{-# INLINE withIncreasedDepth #-}
1415−withIncreasedDepth :: proxy x -> m a -> m a
1416−withIncreasedDepth _ = id
885+type CanTrace x m = (HasSpiderEnv x m, MonadIO m)
1417886
1418887{-# INLINE tracePropagate #-}
1419−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420−tracePropagate _ _ = return ()
888+tracePropagate :: (CanTrace x m) => String -> m ()
889+tracePropagate = traceWhen debugPropagate
890+
891+{-# INLINE traceSubscribe #-}
892+traceSubscribe :: String -> IO ()
893+traceSubscribe = when debugSubscribe . liftIO . putStrLn
1421894
1422895{-# INLINE traceInvalidate #-}
1423896traceInvalidate :: String -> IO ()
1424−traceInvalidate _ = return ()
1425−
1426−{-# INLINE traceInvalidateHeight #-}
1427−traceInvalidateHeight :: String -> IO ()
1428−traceInvalidateHeight _ = return ()
1429−
1430−{-# INLINE debugSubscriber #-}
1431−debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
1432−debugSubscriber _ = return
1433−
1434−{-# INLINE debugSubscriber' #-}
1435−debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436−debugSubscriber' _ = id
1437−
1438−
1439−
1440−{-# INLINE trace #-}
1441−trace :: (CanTrace x m) => proxy x -> String -> m ()
1442−trace _ _ = return ()
897+traceInvalidate = when debugInvalidate . liftIO . putStrLn
1443898
1444−{-# INLINE traceM #-}
1445−traceM :: (CanTrace x m) => proxy x -> m String -> m ()
1446−traceM _ _ = return ()
899+{-# INLINE traceWhen #-}
900+traceWhen :: (CanTrace x m) => Bool -> String -> m ()
901+traceWhen b message = traceMWhen b $ return message
1447902
903+{-# INLINE traceMWhen #-}
904+traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
905+traceMWhen b getMessage = when b $ do
906+ message <- getMessage
907+#ifdef DEBUG
908+ spiderEnv <- askSpiderEnv
909+ d <- liftIO $ readIORef $ _spiderEnv_depth spiderEnv
910+#else
911+ let d = 0
1448912#endif
913+ liftIO $ putStrLn $ replicate d ' ' <> message
1449914
1450915whoCreatedIORef :: IORef a -> IO [String]
1451916whoCreatedIORef (IORef a) = whoCreated $! a
1452917
918+whoCreatedEventSubscribed :: EventSubscribed a -> IO [String]
919+whoCreatedEventSubscribed = \case
920+ EventSubscribedRoot _ -> return ["root"]
921+ EventSubscribedNever -> return ["never"]
922+ EventSubscribedPush subscribed -> whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
923+ EventSubscribedFan _ subscribed -> whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
924+ EventSubscribedMerge subscribed -> whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
925+ EventSubscribedSwitch subscribed -> whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
926+ EventSubscribedCoincidence subscribed -> whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
927+
928+walkInvalidHeightParents :: EventSubscribed a -> IO [Some EventSubscribed]
929+walkInvalidHeightParents s0 = do
930+ subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
931+ h <- liftIO $ readIORef $ eventSubscribedHeightRef s
932+ when (h == invalidHeight) $ do
933+ when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
934+ modify (Some.This s :)
935+ mapM_ loop =<< liftIO (eventSubscribedGetParents s)
936+ forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
937+ return subscribers
938+
1453939groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
1454940groupByHead = \case
1455941 [] -> []
@@ -1460,288 +946,560 @@ groupByHead = \case
1460946 | otherwise -> (x, xs :| []) : l
1461947
1462948listsToForest :: 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
949+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1496950
951+-- | Propagate everything at the current height
952+propagate :: a -> SubscriberList a -> EventM x ()
953+propagate a subscribers = withIncreasedDepth $ do
954+ -- 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
955+ --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
956+ WeakBag.traverse subscribers $ \s -> case s of
957+ SubscriberPush compute subscribed -> {-# SCC "traversePush" #-} do
958+ tracePropagate $ "SubscriberPush" <> showNodeId subscribed
959+ occ <- runComputeM $ compute a
960+ case occ of
961+ Nothing -> return () -- No need to write a Nothing back into the Ref
962+ Just o -> do
963+ liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
964+ scheduleClear $ pushSubscribedOccurrence subscribed
965+ propagate o $ pushSubscribedSubscribers subscribed
966+ SubscriberMerge k subscribed -> {-# SCC "traverseMerge" #-} do
967+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
968+ oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
969+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
970+ tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
971+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
972+ when (DMap.null oldM) $ do -- Only schedule the firing once
973+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
974+ --TODO: assertions about height
975+ currentHeight <- getCurrentHeight
976+ when (height <= currentHeight) $ do
977+ myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
978+ if height /= invalidHeight
979+ then error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
980+ else liftIO $ do
981+ nodesInvolvedInCycle <- walkInvalidHeightParents $ EventSubscribedMerge subscribed
982+ stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
983+ error $ "Causality loop found:\n" <> drawForest (listsToForest stacks)
984+ scheduleMerge height subscribed
985+ SubscriberMergeChange subscribed -> {-# SCC "traverseMergeChange" #-} do
986+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
987+ defer $ SomeMergeUpdate a subscribed
988+ SubscriberFan subscribed -> {-# SCC "traverseFan" #-} do
989+ subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
990+ tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
991+ --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
992+ forM_ (DMap.toList a) $ \(k :=> Identity v) -> {-# SCC "SubscriberFan" #-} case DMap.lookup k subs of
993+ Nothing -> do
994+ tracePropagate "No subscriber for key"
995+ return ()
996+ Just subsubs -> do
997+ propagate v $ _fanSubscribedChildren_list subsubs
998+ return ()
999+ SubscriberHold h -> {-# SCC "traverseHold" #-} propagateSubscriberHold h a
1000+ SubscriberHoldIdentity h -> {-# SCC "traverseHoldIdentity" #-} propagateSubscriberHold h a
1001+ SubscriberSwitch subscribed -> {-# SCC "traverseSwitch" #-} do
1002+ tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
1003+ liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $! Just a
1004+ scheduleClear $ switchSubscribedOccurrence subscribed
1005+ propagate a $ switchSubscribedSubscribers subscribed
1006+ SubscriberCoincidenceOuter subscribed -> {-# SCC "traverseCoincidenceOuter" #-} do
1007+ tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
1008+ outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
1009+ tracePropagate $ " outerHeight = " <> show outerHeight
1010+ (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
1011+ tracePropagate $ " isJust occ = " <> show (isJust occ)
1012+ tracePropagate $ " innerHeight = " <> show innerHeight
1013+ liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $! Just innerSubd
1014+ scheduleClear $ coincidenceSubscribedInnerParent subscribed
1015+ case occ of
1016+ Nothing -> do
1017+ when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
1018+ writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
1019+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
1020+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
1021+ Just o -> do -- Since it's already firing, no need to adjust height
1022+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
1023+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
1024+ propagate o $ coincidenceSubscribedSubscribers subscribed
1025+ SubscriberCoincidenceInner subscribed -> {-# SCC "traverseCoincidenceInner" #-} do
1026+ tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
1027+ occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
1028+ case occ of
1029+ Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
1030+ Nothing -> do
1031+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $! Just a
1032+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
1033+ propagate a $ coincidenceSubscribedSubscribers subscribed
1034+ SubscriberHandle -> {-# SCC "traverseHandle" #-} tracePropagate "SubscriberHandle"
14971035
14981036{-# INLINE propagateSubscriberHold #-}
1499−propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
1037+propagateSubscriberHold :: R.Patch p => Hold p a -> p a -> EventM x ()
15001038propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1039+ {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
15021040 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031041 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504−
15051042 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1506− case {-# SCC "apply" #-} apply a v of
1043+ case {-# SCC "apply" #-} R.apply a v of
15071044 Nothing -> return ()
15081045 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510− tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1046+ {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
15111047 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121048 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
15131049 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
15141050
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
1051+data SomeResetCoincidence = forall a. SomeResetCoincidence !(EventSubscription a) !(Maybe (CoincidenceSubscribed a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1052+
1053+{-# INLINE subscribeCoincidenceInner #-}
1054+subscribeCoincidenceInner :: CanSubscribe x m => Event a -> Height -> CoincidenceSubscribed a -> m (Maybe a, Height, EventSubscribed a)
1055+subscribeCoincidenceInner o outerHeight subscribedUnsafe = do
1056+ subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
1057+ subscription@(EventSubscription _ innerSubd) <- subscribe o subInner
1058+ innerOcc <- liftIO $ readEventSubscribed innerSubd
1059+ innerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef innerSubd
1060+ let height = max innerHeight outerHeight
1061+ defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
1062+ return (innerOcc, height, innerSubd)
1063+
1064+{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> BehaviorM a #-}
1065+{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> EventM x a #-}
1066+readBehaviorUntracked :: Defer SomeHoldInit m => Behavior a -> m a
1067+readBehaviorUntracked b = do
1068+ holdInits <- getDeferralQueue
1069+ liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
1070+
1071+runBehaviorM :: BehaviorM a -> Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]) -> IORef [SomeHoldInit] -> IO a
1072+runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
15161073
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)
1074+askInvalidator :: BehaviorM (Maybe (Weak Invalidator))
1075+askInvalidator = liftM (fmap fst . fst) $ BehaviorM ask
15191076
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
1077+askParentsRef :: BehaviorM (Maybe (IORef [SomeBehaviorSubscribed]))
1078+askParentsRef = liftM (fmap snd . fst) $ BehaviorM ask
15261079
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
1080+askBehaviorHoldInits :: BehaviorM (IORef [SomeHoldInit])
1081+askBehaviorHoldInits = liftM snd $ BehaviorM ask
1082+
1083+readBehaviorTracked :: Behavior a -> BehaviorM a
1084+readBehaviorTracked b = case b of
1085+ BehaviorHold h -> readHoldTracked h
1086+ BehaviorHoldIdentity h -> readHoldTracked h
1087+ BehaviorConst a -> return a
1088+ BehaviorPull p -> do
1089+ val <- liftIO $ readIORef $ pullValue p
1090+ case val of
1091+ Just subscribed -> do
1092+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1093+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
1094+ liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
1095+ return $ pullSubscribedValue subscribed
1096+ Nothing -> do
1097+ i <- liftIO $ newInvalidatorPull p
1098+ wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
1099+ parentsRef <- liftIO $ newIORef []
1100+ holdInits <- askBehaviorHoldInits
1101+ a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
1102+ invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
1103+ parents <- liftIO $ readIORef parentsRef
1104+ let subscribed = PullSubscribed
1105+ { pullSubscribedValue = a
1106+ , pullSubscribedInvalidators = invsRef
1107+ , pullSubscribedOwnInvalidator = i
1108+ , pullSubscribedParents = parents
1109+ }
1110+ liftIO $ writeIORef (pullValue p) $! Just subscribed
1111+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1112+ return a
1113+ BehaviorDyn d -> readHoldTracked =<< getDynHold d
1114+ BehaviorDynIdentity d -> readHoldTracked =<< getDynHold d
15331115
1534−askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1535−askBehaviorHoldInits = do
1536− (_, !his) <- ask
1537− return his
1116+{-# INLINE readHoldTracked #-}
1117+readHoldTracked :: Hold p a -> BehaviorM a
1118+readHoldTracked h = do
1119+ result <- liftIO $ readIORef $ holdValue h
1120+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
1121+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
1122+ return result
15381123
15391124{-# INLINE getDynHold #-}
1540−getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
1125+getDynHold :: (Defer SomeHoldInit m, R.Patch p) => Dyn p a -> m (Hold p a)
15411126getDynHold d = do
15421127 mh <- liftIO $ readIORef $ unDyn d
15431128 case mh of
1544− HoldDyn h -> return h
1545− UnsafeDyn (readV0, v') -> do
1129+ Right h -> return h
1130+ Left (readV0, v') -> do
15461131 holdInits <- getDeferralQueue
15471132 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
15541133 h <- hold v0 v'
1555− liftIO $ writeIORef (unDyn d) $ HoldDyn h
1134+ liftIO $ writeIORef (unDyn d) $! Right h
15561135 return h
15571136
1137+{-
1138+readEvent :: Event a -> ResultM (Maybe a)
1139+readEvent e = case e of
1140+ EventRoot k r -> liftIO . liftM (coerce . DMap.lookup k) . readIORef $ rootOccurrence r
1141+ EventNever -> return Nothing
1142+ EventPush p -> do
1143+ subscribed <- getPushSubscribed p
1144+ liftIO $ readPushSubscribed subscribed
1145+ EventMerge m -> do
1146+ subscribed <- getMergeSubscribed m
1147+ liftIO $ readMergeSubscribed subscribed
1148+ EventFan k f -> do
1149+ subscribed <- getFanSubscribed f
1150+ liftIO $ readFanSubscribed k subscribed
1151+ EventSwitch s -> do
1152+ subscribed <- getSwitchSubscribed s
1153+ liftIO $ readSwitchSubscribed subscribed
1154+ EventCoincidence c -> do
1155+ subscribed <- getCoincidenceSubscribed c
1156+ liftIO $ readCoincidenceSubscribed subscribed
1157+ EventHold h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1158+ EventDyn d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1159+ EventHoldIdentity h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1160+ EventDynIdentity d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1161+-}
1162+
1163+readEventSubscribed :: EventSubscribed a -> IO (Maybe a)
1164+readEventSubscribed = \case
1165+ EventSubscribedRoot rs -> readRootSubscribed rs
1166+ EventSubscribedNever -> return Nothing
1167+ EventSubscribedPush ps -> readPushSubscribed ps
1168+ EventSubscribedMerge ms -> readMergeSubscribed ms
1169+ EventSubscribedFan k fs -> readFanSubscribed k fs
1170+ EventSubscribedSwitch ss -> readSwitchSubscribed ss
1171+ EventSubscribedCoincidence cs -> readCoincidenceSubscribed cs
1172+
1173+readRootSubscribed :: RootSubscribed a -> IO (Maybe a)
1174+readRootSubscribed = rootSubscribedOccurrence
1175+
1176+readPushSubscribed :: PushSubscribed b a -> IO (Maybe a)
1177+readPushSubscribed subscribed = do
1178+ result <- readIORef $ pushSubscribedOccurrence subscribed -- Since ResultM is always called after the final height is reached, this will always be valid
1179+ touch $ pushSubscribedSelf subscribed
1180+ return result
1181+
1182+readMergeSubscribed :: MergeSubscribed k -> IO (Maybe (DMap k Identity))
1183+readMergeSubscribed subscribed = do
1184+ result <- readIORef $ mergeSubscribedOccurrence subscribed
1185+ touch $ mergeSubscribedParents subscribed
1186+ return result
1187+
1188+readFanSubscribed :: GCompare k => k a -> FanSubscribed k -> IO (Maybe a)
1189+readFanSubscribed k fs = do
1190+ parentOcc <- readEventSubscribed $ _eventSubscription_subscribed $ fanSubscribedParent fs
1191+ return $ coerce $ DMap.lookup k =<< parentOcc
1192+
1193+readSwitchSubscribed :: SwitchSubscribed a -> IO (Maybe a)
1194+readSwitchSubscribed subscribed = do
1195+ result <- readIORef $ switchSubscribedOccurrence subscribed
1196+ touch $ switchSubscribedOwnInvalidator subscribed
1197+ return result
1198+
1199+readCoincidenceSubscribed :: CoincidenceSubscribed a -> IO (Maybe a)
1200+readCoincidenceSubscribed subscribed = do
1201+ result <- readIORef $ coincidenceSubscribedOccurrence subscribed
1202+ touch $ coincidenceSubscribedOuter subscribed
1203+ --TODO: do we need to touch the inner subscriber?
1204+ return result
15581205
15591206-- Always refers to 0
15601207{-# NOINLINE zeroRef #-}
15611208zeroRef :: IORef Height
15621209zeroRef = unsafePerformIO $ newIORef zeroHeight
15631210
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)
1211+{-# SPECIALIZE subscribe :: Event a -> Subscriber a -> EventM x (EventSubscription a) #-}
1212+subscribe :: forall x m a. CanSubscribe x m => Event a -> Subscriber a -> m (EventSubscription a)
1213+subscribe e sub = case e of
1214+ EventRoot k r -> wrap EventSubscribedRoot $ liftIO . getRootSubscribed k r
1215+ EventNever -> return $ EventSubscription Nothing EventSubscribedNever
1216+ EventPush p -> wrap EventSubscribedPush $ getPushSubscribed p
1217+ EventFan k f -> wrap (EventSubscribedFan k) $ getFanSubscribed k f
1218+ EventMerge m -> wrap EventSubscribedMerge $ getMergeSubscribed m
1219+ EventSwitch s -> wrap EventSubscribedSwitch $ getSwitchSubscribed s
1220+ EventCoincidence c -> wrap EventSubscribedCoincidence $ getCoincidenceSubscribed c
1221+ EventHold h -> subscribeHoldEvent h sub
1222+ EventDyn j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1223+ EventHoldIdentity h -> subscribeHoldEvent h sub
1224+ EventDynIdentity j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1225+ where
1226+ wrap :: (t -> EventSubscribed a) -> (Subscriber a -> m (SubscriberListTicket a, t)) -> m (EventSubscription a)
1227+ wrap tag getSpecificSubscribed = do
1228+ (sln, subd) <- getSpecificSubscribed sub
1229+ return $ EventSubscription (Just sln) $ tag subd
1230+
1231+{-# INLINE subscribeHoldEvent #-}
1232+subscribeHoldEvent :: (CanSubscribe x m, R.Patch p) => Hold p a -> Subscriber (p a) -> m (EventSubscription (p a))
1233+subscribeHoldEvent h sub = do
1234+ EventSubscription _ subd <- getHoldEventSubscription h
1235+ sln <- liftIO $ subscribeEventSubscribed subd sub
1236+ return $ EventSubscription sln subd
1237+
1238+{-# INLINE debugSubscribe #-}
1239+debugSubscribe :: Bool
1240+debugSubscribe = False
1241+
1242+{-# INLINE subscribeEventSubscribed #-}
1243+subscribeEventSubscribed :: EventSubscribed a -> Subscriber a -> IO (Maybe (SubscriberListTicket a))
1244+subscribeEventSubscribed es sub = case es of
1245+ EventSubscribedRoot r -> do
1246+ traceSubscribe $ "subscribeEventSubscribed Root"
1247+ fmap Just $ subscribeRootSubscribed r sub
1248+ EventSubscribedNever -> do
1249+ traceSubscribe $ "subscribeEventSubscribed Never"
1250+ return Nothing
1251+ EventSubscribedPush subscribed -> do
1252+ traceSubscribe $ "subscribeEventSubscribed Push"
1253+ fmap Just $ subscribePushSubscribed subscribed sub
1254+ EventSubscribedFan k subscribed -> do
1255+ traceSubscribe $ "subscribeEventSubscribed Fan"
1256+ fmap Just $ subscribeFanSubscribed k subscribed sub
1257+ EventSubscribedMerge subscribed -> do
1258+ traceSubscribe $ "subscribeEventSubscribed Merge"
1259+ fmap Just $ subscribeMergeSubscribed subscribed sub
1260+ EventSubscribedSwitch subscribed -> do
1261+ traceSubscribe $ "subscribeEventSubscribed Switch"
1262+ fmap Just $ subscribeSwitchSubscribed subscribed sub
1263+ EventSubscribedCoincidence subscribed -> do
1264+ traceSubscribe $ "subscribeEventSubscribed Coincidence"
1265+ fmap Just $ subscribeCoincidenceSubscribed subscribed sub
1266+
1267+{-# INLINE eventSubscribedHeightRef #-}
1268+eventSubscribedHeightRef :: EventSubscribed a -> IORef Height
1269+eventSubscribedHeightRef = \case
1270+ EventSubscribedRoot _ -> zeroRef
1271+ EventSubscribedNever -> zeroRef
1272+ EventSubscribedPush subscribed -> pushSubscribedHeight subscribed
1273+ EventSubscribedFan _ subscribed -> eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
1274+ EventSubscribedMerge subscribed -> mergeSubscribedHeight subscribed
1275+ EventSubscribedSwitch subscribed -> switchSubscribedHeight subscribed
1276+ EventSubscribedCoincidence subscribed -> coincidenceSubscribedHeight subscribed
1277+
1278+{-# INLINE eventSubscribedHasOwnHeightRef #-}
1279+eventSubscribedHasOwnHeightRef :: EventSubscribed a -> Bool
1280+eventSubscribedHasOwnHeightRef = \case
1281+ EventSubscribedRoot _ -> False
1282+ EventSubscribedNever -> False
1283+ EventSubscribedPush _ -> False
1284+ EventSubscribedFan _ _ -> False
1285+ EventSubscribedMerge _ -> True
1286+ EventSubscribedSwitch _ -> True
1287+ EventSubscribedCoincidence _ -> True
1288+
1289+{-# INLINE eventSubscribedGetParents #-}
1290+eventSubscribedGetParents :: EventSubscribed a -> IO [Some EventSubscribed]
1291+eventSubscribedGetParents = \case
1292+ EventSubscribedRoot _ -> return []
1293+ EventSubscribedNever -> return []
1294+ EventSubscribedPush subscribed -> return [Some.This $ _eventSubscription_subscribed $ pushSubscribedParent subscribed]
1295+ EventSubscribedFan _ subscribed -> return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
1296+ EventSubscribedMerge subscribed -> do
1297+ ps <- readIORef $ mergeSubscribedParents subscribed
1298+ return $ fmap (\(_ :=> v) -> Some.This $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription v) $ DMap.toList ps
1299+ EventSubscribedSwitch subscribed -> do
1300+ s <- readIORef $ switchSubscribedCurrentParent subscribed
1301+ return [Some.This $ _eventSubscription_subscribed s]
1302+ EventSubscribedCoincidence subscribed -> do
1303+ innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
1304+ let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1305+ innerParents = maybeToList $ fmap Some.This innerSubscription
1306+ return $ outerParent : innerParents
1307+
1308+type CanSubscribe x m =
1309+ ( HasSpiderEnv x m
1310+ , HasCurrentHeight m
1311+ , Defer SomeHoldInit m, Defer SomeMergeInit m -- The things we need to lazily initialize state
1312+ , Defer SomeClear m -- Wiping out event firings
1313+ , Defer SomeAssignment m -- Updating state
1314+ , Defer SomeResetCoincidence m
1315+ )
1316+
1317+getRootSubscribed :: GCompare k => k a -> Root k -> Subscriber a -> IO (SubscriberListTicket a, RootSubscribed a)
15651318getRootSubscribed k r sub = do
15661319 mSubscribed <- readIORef $ rootSubscribed r
1567− let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
15681320 case DMap.lookup k mSubscribed of
15691321 Just subscribed -> {-# SCC "hitRoot" #-} do
15701322 sln <- subscribeRootSubscribed subscribed sub
1571− occ <- getOcc
1572− return (sln, subscribed, occ)
1323+ return (sln, subscribed)
15731324 Nothing -> {-# SCC "missRoot" #-} do
15741325 weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
15751326 let !cached = rootSubscribed r
15761327 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
15771328 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1578−
1579− tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580−
1329+ when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
15811330 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
15821331 writeIORef uninitRef $! uninit
1583−#ifdef DEBUG_NODEIDS
1584− nid <- newNodeId
1585−#endif
1586− let !subscribed = RootSubscribed
1332+ let subscribed = RootSubscribed
15871333 { rootSubscribedKey = k
15881334 , rootSubscribedCachedSubscribed = cached
1589− , rootSubscribedOccurrence = getOcc
1335+ , rootSubscribedOccurrence = liftM (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
15901336 , rootSubscribedSubscribers = subs
15911337 , rootSubscribedUninit = uninit
15921338 , rootSubscribedWeakSelf = weakSelf
15931339#ifdef DEBUG_NODEIDS
1594− , rootSubscribedNodeId = nid
1340+ , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
15951341#endif
15961342 }
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)
1343+ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
16081344 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)
1345+ return (sln, subscribed)
16111346
1612−#ifdef USE_TEMPLATE_HASKELL
1613−{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1614−#endif
1615−cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1616−cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
1347+cleanupRootSubscribed :: RootSubscribed a -> IO ()
1348+cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
16171349 rootSubscribedUninit self
16181350 modifyIORef' cached $ DMap.delete k
16191351
16201352{-# INLINE subscribeRootSubscribed #-}
1621−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1353+subscribeRootSubscribed :: RootSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
16221354subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
16231355
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"
1356+-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1357+{-# SPECIALIZE getPushSubscribed :: Push a b -> Subscriber b -> EventM x (SubscriberListTicket b, PushSubscribed a b) #-}
1358+getPushSubscribed :: CanSubscribe x m => Push a b -> Subscriber b -> m (SubscriberListTicket b, PushSubscribed a b)
1359+getPushSubscribed p sub = do
1360+ mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1361+ case mSubscribed of
1362+ Just subscribed -> {-# SCC "hitPush" #-} do
1363+ sln <- liftIO $ subscribePushSubscribed subscribed sub
1364+ return (sln, subscribed)
1365+ Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1366+ subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1367+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1368+ s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
1369+ subscription@(EventSubscription _ subd) <- subscribe (pushParent p) s
1370+ parentOcc <- liftIO $ readEventSubscribed subd
1371+ occ <- runComputeM $ liftM join $ mapM (pushCompute p) parentOcc
1372+ occRef <- liftIO $ newIORef occ
1373+ when (isJust occ) $ scheduleClear occRef
1374+ weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1375+ let !cached = pushSubscribed p
1376+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1377+ let subscribed = PushSubscribed
1378+ { pushSubscribedCachedSubscribed = cached
1379+ , pushSubscribedOccurrence = occRef
1380+ , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1381+ , pushSubscribedSubscribers = subs
1382+ , pushSubscribedSelf = s
1383+ , pushSubscribedWeakSelf = weakSelf
1384+ , pushSubscribedParent = subscription
16401385#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1386+ , pushSubscribedNodeId = unsafeNodeId p
16421387#endif
1643− return $ FanInt
1644− { _fanInt_subscribers = subscribers
1645− , _fanInt_subscriptionRef = subscriptionRef
1646− , _fanInt_occRef = occRef
1388+ }
1389+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1390+ liftIO $ writeIORef subscribedRef $! subscribed
1391+ liftIO $ writeIORef (pushSubscribed p) $! Just subscribed
1392+ return (sln, subscribed)
1393+
1394+cleanupPushSubscribed :: PushSubscribed a b -> IO ()
1395+cleanupPushSubscribed self = do
1396+ unsubscribe $ pushSubscribedParent self
1397+ writeIORef (pushSubscribedCachedSubscribed self) $! Nothing
1398+
1399+{-# INLINE subscribePushSubscribed #-}
1400+subscribePushSubscribed :: PushSubscribed a b -> Subscriber b -> IO (SubscriberListTicket b)
1401+subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1402+
1403+{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge k -> Subscriber (DMap k Identity) -> EventM x (SubscriberListTicket (DMap k Identity), MergeSubscribed k) #-}
1404+getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge k -> Subscriber (DMap k Identity) -> m (SubscriberListTicket (DMap k Identity), MergeSubscribed k)
1405+getMergeSubscribed m sub = do
1406+ mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1407+ case mSubscribed of
1408+ Just subscribed -> {-# SCC "hitMerge" #-} do
1409+ sln <- liftIO $ subscribeMergeSubscribed subscribed sub
1410+ return (sln, subscribed)
1411+ Nothing -> {-# SCC "missMerge" #-} do
1412+ subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1413+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1414+ initialParents <- readBehaviorUntracked $ current $ mergeParents m
1415+ subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1416+ s <- liftIO $ newSubscriberMerge k subscribedUnsafe
1417+ subscription@(EventSubscription _ parentSubd) <- subscribe e s
1418+ parentOcc <- liftIO $ readEventSubscribed parentSubd
1419+ height <- liftIO $ readIORef $ eventSubscribedHeightRef parentSubd
1420+ return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> (MergeSubscribedParent subscription s))
1421+ let dm = DMap.fromDistinctAscList $ catMaybes $ map (\(x, _, _) -> x) subscribers
1422+ heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1423+ myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1424+ myHeight = if any (== invalidHeight) heights
1425+ then invalidHeight
1426+ else succHeight $ heightBagMax myHeightBag
1427+ currentHeight <- getCurrentHeight
1428+ let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1429+ then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1430+ else (Nothing, dm)
1431+ when (not $ DMap.null accum) $ do
1432+ scheduleMerge myHeight subscribedUnsafe
1433+ occRef <- liftIO $ newIORef occ
1434+ when (isJust occ) $ scheduleClear occRef
1435+ accumRef <- liftIO $ newIORef accum
1436+ heightRef <- liftIO $ newIORef myHeight
1437+ heightMapRef <- liftIO $ newIORef myHeightBag
1438+ weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1439+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1440+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1441+ parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1442+ let !subscribed = MergeSubscribed
1443+ { mergeSubscribedCachedSubscribed = mergeSubscribed m
1444+ , mergeSubscribedOccurrence = occRef
1445+ , mergeSubscribedAccum = accumRef
1446+ , mergeSubscribedHeight = heightRef
1447+ , mergeSubscribedHeightBag = heightMapRef
1448+ , mergeSubscribedSubscribers = subs
1449+ , mergeSubscribedChange = changeSubdRef
1450+ , mergeSubscribedParents = parentsRef
1451+ , mergeSubscribedWeakSelf = weakSelf
16471452#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1649−#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
1453+ , mergeSubscribedNodeId = unsafeNodeId m
17021454#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))
1455+ }
1456+ defer $ SomeMergeInit subscribed $ updated $ mergeParents m
1457+ liftIO $ writeIORef subscribedRef $! subscribed
1458+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1459+ liftIO $ writeIORef (mergeSubscribed m) $! Just subscribed
1460+ return (sln, subscribed)
1461+
1462+cleanupMergeSubscribed :: MergeSubscribed k -> IO ()
1463+cleanupMergeSubscribed subscribed = do
1464+ parents <- readIORef $ mergeSubscribedParents subscribed
1465+ forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1466+ -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1467+ writeIORef (mergeSubscribedCachedSubscribed subscribed) $! Nothing -- Get rid of the cached subscribed
1468+
1469+{-# INLINE subscribeMergeSubscribed #-}
1470+subscribeMergeSubscribed :: MergeSubscribed k -> Subscriber (DMap k Identity) -> IO (SubscriberListTicket (DMap k Identity))
1471+subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
1472+
1473+{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan k -> Subscriber a -> EventM x (SubscriberListTicket a, FanSubscribed k) #-}
1474+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)
17081475getFanSubscribed k f sub = do
17091476 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
17101477 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)
1478+ Just subscribed -> {-# SCC "hitFan" #-} do
1479+ sln <- liftIO $ subscribeFanSubscribed k subscribed sub
1480+ return (sln, subscribed)
17151481 Nothing -> {-# SCC "missFan" #-} do
17161482 subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
17171483 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
17181484 s <- liftIO $ newSubscriberFan subscribedUnsafe
1719− (subscription, parentOcc) <- subscribeAndRead (fanParent f) s
1485+ subscription <- subscribe (fanParent f) s
17201486 weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
17211487 (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
1722− 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
1488+ subscribersRef <- liftIO $ newIORef $ DMap.singleton k $ FanSubscribedChildren subsForK weakSelf
17281489 let subscribed = FanSubscribed
17291490 { fanSubscribedCachedSubscribed = fanSubscribed f
1730− , fanSubscribedOccurrence = occRef
17311491 , fanSubscribedParent = subscription
17321492 , fanSubscribedSubscribers = subscribersRef
17331493#ifdef DEBUG_NODEIDS
1734− , fanSubscribedNodeId = nid
1494+ , fanSubscribedNodeId = unsafeNodeId f
17351495#endif
17361496 }
1737− let !self = (k, subscribed)
1738− liftIO $ writeIORef subscribersRef $! DMap.singleton k $ FanSubscribedChildren subsForK self weakSelf
1739− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
1497+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug (k, subscribed) "FanSubscribed"
17401498 liftIO $ writeIORef subscribedRef $! subscribed
1741− liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1742− return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
1499+ liftIO $ writeIORef (fanSubscribed f) $! Just subscribed
1500+ return (slnForSub, subscribed)
17431501
1744−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
1502+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed k) -> IO ()
17451503cleanupFanSubscribed (k, subscribed) = do
17461504 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17471505 let reducedSubscribers = DMap.delete k subscribers
@@ -1749,31 +1507,29 @@ cleanupFanSubscribed (k, subscribed) = do
17491507 then do
17501508 unsubscribe $ fanSubscribedParent subscribed
17511509 -- Not necessary in this case, because this whole FanSubscribed is dead: writeIORef (fanSubscribedSubscribers subscribed) reducedSubscribers
1752− writeIORef (fanSubscribedCachedSubscribed subscribed) Nothing
1510+ writeIORef (fanSubscribedCachedSubscribed subscribed) $! Nothing
17531511 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
17541512
17551513{-# INLINE subscribeFanSubscribed #-}
1756−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
1514+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed k -> Subscriber a -> IO (SubscriberListTicket a)
17571515subscribeFanSubscribed k subscribed sub = do
17581516 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17591517 case DMap.lookup k subscribers of
1760− Nothing -> {-# SCC "missSubscribeFanSubscribed" #-} do
1761− let !self = (k, subscribed)
1762− weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
1518+ Nothing -> do
1519+ weakSelf <- newIORef =<< mkWeakPtrWithDebug (k, subscribed) "FanSubscribed"
17631520 (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
1521+ writeIORef (fanSubscribedSubscribers subscribed) $! DMap.insertWith (error "subscribeEventSubscribed: key that we just failed to find is present - should be impossible") k (FanSubscribedChildren list weakSelf) subscribers
17651522 return sln
1766− Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
1523+ Just (FanSubscribedChildren list weakSelf) -> WeakBag.insert sub list weakSelf cleanupFanSubscribed
17671524
1768−{-# INLINABLE getSwitchSubscribed #-}
1769−getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1525+{-# SPECIALIZE getSwitchSubscribed :: Switch a -> Subscriber a -> EventM x (SubscriberListTicket a, SwitchSubscribed a) #-}
1526+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)
17701527getSwitchSubscribed s sub = do
17711528 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
17721529 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)
1530+ Just subscribed -> {-# SCC "hitSwitch" #-} do
1531+ sln <- liftIO $ subscribeSwitchSubscribed subscribed sub
1532+ return (sln, subscribed)
17771533 Nothing -> {-# SCC "missSwitch" #-} do
17781534 subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
17791535 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
@@ -1784,16 +1540,14 @@ getSwitchSubscribed s sub = do
17841540 parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
17851541 holdInits <- getDeferralQueue
17861542 e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1787− (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead e mySub
1788− heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
1543+ subscription@(EventSubscription _ subd) <- subscribe e mySub
17891544 subscriptionRef <- liftIO $ newIORef subscription
1545+ parentOcc <- liftIO $ readEventSubscribed subd
17901546 occRef <- liftIO $ newIORef parentOcc
17911547 when (isJust parentOcc) $ scheduleClear occRef
1548+ heightRef <- liftIO $ newIORef =<< readIORef (eventSubscribedHeightRef subd)
17921549 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
17931550 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794−#ifdef DEBUG_NODEIDS
1795− nid <- liftIO newNodeId
1796−#endif
17971551 let !subscribed = SwitchSubscribed
17981552 { switchSubscribedCachedSubscribed = switchSubscribed s
17991553 , switchSubscribedOccurrence = occRef
@@ -1806,39 +1560,39 @@ getSwitchSubscribed s sub = do
18061560 , switchSubscribedCurrentParent = subscriptionRef
18071561 , switchSubscribedWeakSelf = weakSelf
18081562#ifdef DEBUG_NODEIDS
1809− , switchSubscribedNodeId = nid
1563+ , switchSubscribedNodeId = unsafeNodeId s
18101564#endif
18111565 }
18121566 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
18131567 liftIO $ writeIORef subscribedRef $! subscribed
1814− liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1815− return (slnForSub, subscribed, parentOcc)
1568+ liftIO $ writeIORef (switchSubscribed s) $! Just subscribed
1569+ return (slnForSub, subscribed)
18161570
1817−cleanupSwitchSubscribed :: SwitchSubscribed x a -> IO ()
1571+cleanupSwitchSubscribed :: SwitchSubscribed a -> IO ()
18181572cleanupSwitchSubscribed subscribed = do
18191573 unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
18201574 finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
1821− writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
1575+ writeIORef (switchSubscribedCachedSubscribed subscribed) $! Nothing
18221576
18231577{-# INLINE subscribeSwitchSubscribed #-}
1824−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1578+subscribeSwitchSubscribed :: SwitchSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
18251579subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
18261580
1827−{-# INLINABLE getCoincidenceSubscribed #-}
1828−getCoincidenceSubscribed :: forall x a. HasSpiderTimeline x => Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
1581+{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence a -> Subscriber a -> EventM x (SubscriberListTicket a, CoincidenceSubscribed a) #-}
1582+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)
18291583getCoincidenceSubscribed c sub = do
18301584 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
18311585 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)
1586+ Just subscribed -> {-# SCC "hitCoincidence" #-} do
1587+ sln <- liftIO $ subscribeCoincidenceSubscribed subscribed sub
1588+ return (sln, subscribed)
18361589 Nothing -> {-# SCC "missCoincidence" #-} do
18371590 subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
18381591 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
18391592 subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1840− (outerSubscription@(EventSubscription _ outerSubd), outerOcc) <- subscribeAndRead (coincidenceParent c) subOuter
1841− outerHeight <- liftIO $ getEventSubscribedHeight outerSubd
1593+ outerSubscription@(EventSubscription _ outerSubd) <- subscribe (coincidenceParent c) subOuter
1594+ outerOcc <- liftIO $ readEventSubscribed outerSubd
1595+ outerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef outerSubd
18421596 (occ, height, mInnerSubd) <- case outerOcc of
18431597 Nothing -> return (Nothing, outerHeight, Nothing)
18441598 Just o -> do
@@ -1851,9 +1605,6 @@ getCoincidenceSubscribed c sub = do
18511605 scheduleClear innerSubdRef
18521606 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
18531607 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854−#ifdef DEBUG_NODEIDS
1855− nid <- liftIO newNodeId
1856−#endif
18571608 let subscribed = CoincidenceSubscribed
18581609 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
18591610 , coincidenceSubscribedOccurrence = occRef
@@ -1864,549 +1615,166 @@ getCoincidenceSubscribed c sub = do
18641615 , coincidenceSubscribedInnerParent = innerSubdRef
18651616 , coincidenceSubscribedWeakSelf = weakSelf
18661617#ifdef DEBUG_NODEIDS
1867− , coincidenceSubscribedNodeId = nid
1618+ , coincidenceSubscribedNodeId = unsafeNodeId c
18681619#endif
18691620 }
18701621 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
18711622 liftIO $ writeIORef subscribedRef $! subscribed
1872− liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1873− return (slnForSub, subscribed, occ)
1623+ liftIO $ writeIORef (coincidenceSubscribed c) $! Just subscribed
1624+ return (slnForSub, subscribed)
18741625
1875−cleanupCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO ()
1626+cleanupCoincidenceSubscribed :: CoincidenceSubscribed a -> IO ()
18761627cleanupCoincidenceSubscribed subscribed = do
18771628 unsubscribe $ coincidenceSubscribedOuterParent subscribed
1878− writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
1629+ writeIORef (coincidenceSubscribedCachedSubscribed subscribed) $! Nothing
18791630
18801631{-# INLINE subscribeCoincidenceSubscribed #-}
1881−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1632+subscribeCoincidenceSubscribed :: CoincidenceSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
18821633subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
18831634
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
1635+{-# INLINE merge #-}
1636+merge :: GCompare k => Dynamic R.PatchDMap (DMap k Event) -> Event (DMap k Identity)
1637+merge m = EventMerge $ Merge
1638+ { mergeParents = m
1639+ , mergeSubscribed = unsafeNewIORef m Nothing
20951640 }
20961641
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)
1642+newtype EventSelector k = EventSelector { select :: forall a. k a -> Event a }
22801643
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
1644+fan :: GCompare k => Event (DMap k Identity) -> EventSelector k
1645+fan e =
22871646 let f = Fan
22881647 { fanParent = e
2289− , fanSubscribed = ref
1648+ , fanSubscribed = unsafeNewIORef e Nothing
22901649 }
2291− pure $ EventSelectorG $ \k -> eventFan k f
1650+ in EventSelector $ \k -> EventFan k f
22921651
2293−runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
2294−runHoldInits holdInitRef dynInitRef mergeInitRef = do
1652+{- SPECIALIZE runHoldInits :: IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> EventM x () #-}
1653+--runHoldInits :: (CanSubscribe x m, Defer SomeMergeUpdate m) => IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> m ()
1654+runHoldInits :: IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> EventM x ()
1655+runHoldInits holdInitRef mergeInitRef = do
22951656 holdInits <- liftIO $ readIORef holdInitRef
2296− dynInits <- liftIO $ readIORef dynInitRef
22971657 mergeInits <- liftIO $ readIORef mergeInitRef
2298− unless (null holdInits && null dynInits && null mergeInits) $ do
2299− liftIO $ writeIORef holdInitRef []
2300− liftIO $ writeIORef dynInitRef []
2301− liftIO $ writeIORef mergeInitRef []
1658+ if null holdInits && null mergeInits then return () else do
1659+ liftIO $ writeIORef holdInitRef $! []
1660+ liftIO $ writeIORef mergeInitRef $! []
23021661 mapM_ initHold holdInits
2303− mapM_ initDyn dynInits
2304− mapM_ unSomeMergeInit mergeInits
2305− runHoldInits holdInitRef dynInitRef mergeInitRef
1662+ mapM_ initMerge mergeInits
1663+ runHoldInits holdInitRef mergeInitRef
23061664
2307−initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
1665+{- SPECIALIZE initHold :: SomeHoldInit -> EventM x () #-}
1666+--initHold :: CanSubscribe x m => SomeHoldInit -> m ()
1667+initHold :: SomeHoldInit -> EventM x ()
23081668initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
23091669
2310−initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
2311−initDyn (SomeDynInit d) = void $ getDynHold d
1670+{- SPECIALIZE initMerge :: SomeMergeInit -> EventM x () #-}
1671+--initMerge :: (CanSubscribe x m, Defer SomeMergeUpdate m) => SomeMergeInit -> m ()
1672+initMerge :: SomeMergeInit -> EventM x ()
1673+initMerge (SomeMergeInit subscribed changed) = do
1674+ changeSub <- liftIO $ newSubscriberMergeChange subscribed
1675+ EventSubscription _ changeSubd <- subscribe changed changeSub
1676+ change <- liftIO $ readEventSubscribed changeSubd
1677+ forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1678+ liftIO $ writeIORef (mergeSubscribedChange subscribed) $! (changeSub, changeSubd)
23121679
2313−newEventEnv :: IO (EventEnv x)
2314−newEventEnv = do
1680+-- | Run an event action outside of a frame
1681+runFrame :: EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1682+runFrame a = SpiderHost $ ask >>= \spiderEnv -> lift $ do
1683+ -- 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
1684+ pendingCleanups <- atomicModifyIORef (_spiderEnv_cleanups spiderEnv) $ \x -> ([], x)
1685+ {-# SCC "cleanups" #-} sequence_ pendingCleanups
23151686 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
23161687 holdInitRef <- newIORef []
2317− dynInitRef <- newIORef []
23181688 mergeUpdateRef <- newIORef []
23191689 mergeInitRef <- newIORef []
23201690 heightRef <- newIORef zeroHeight
23211691 toClearRef <- newIORef []
2322− toClearIntRef <- newIORef []
23231692 toClearRootRef <- newIORef []
23241693 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)
1694+ delayedRef <- liftIO $ newIORef IntMap.empty
1695+ let env = EventEnv spiderEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
23461696 let go = do
23471697 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
1698+ 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
23491699 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
1700+ result <- runEventM go env
1701+ toClear <- readIORef toClearRef
1702+ forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref $! Nothing
1703+ toClearRoot <- readIORef toClearRootRef
1704+ forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1705+ toAssign <- readIORef toAssignRef
23581706 toReconnectRef <- newIORef []
2359− coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
1707+ coincidenceInfos <- readIORef coincidenceInfosRef
23601708 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
23611709 writeIORef vRef v
2362− traceInvalidate $ "Invalidating Hold"
1710+ when debugInvalidate $ putStrLn $ "Invalidating Hold"
23631711 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"
1712+ mergeUpdates <- readIORef mergeUpdateRef
1713+ writeIORef mergeUpdateRef $! []
1714+ let updateMerge :: SomeMergeUpdate -> IO [SomeEventSubscription]
1715+ updateMerge (SomeMergeUpdate (R.PatchDMap p :: R.PatchDMap (DMap k Event)) m) = do
1716+ oldParents <- readIORef $ mergeSubscribedParents m
1717+ let f (subscriptionsToKill, ps) (k :=> Compose me) = do
1718+ (mOldSubd, newPs) <- case me of
1719+ Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1720+ Just e -> do
1721+ s <- liftIO $ newSubscriberMerge k m
1722+ subscription@(EventSubscription _ subd) <- subscribe e s
1723+ let newParent = MergeSubscribedParent subscription s
1724+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
1725+ liftIO $ addMergeHeight newParentHeight m
1726+ return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1727+ forM_ mOldSubd $ \oldSubd -> do
1728+ oldHeight <- liftIO $ readIORef $ eventSubscribedHeightRef $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1729+ liftIO $ removeMergeHeight oldHeight m
1730+ return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1731+ (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
1732+ writeIORef (mergeSubscribedParents m) $! newParents
1733+ return subscriptionsToKill
1734+ when debugPropagate $ putStrLn "Updating merges"
1735+ mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
1736+ when debugPropagate $ putStrLn "Updating merges done"
23691737 toReconnect <- readIORef toReconnectRef
2370− clearEventEnv env
23711738 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23721739 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
23731740 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2374− traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1741+ when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
23751742 finalize wi
23761743 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
23771744 wi' <- mkWeakPtrWithDebug i "wi'"
23781745 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
2379− 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
1746+ writeIORef (switchSubscribedBehaviorParents subscribed) $! []
1747+ writeIORef holdInitRef $! [] --TODO: Should we reuse this?
1748+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
1749+ 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
23831750 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
23841751 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
1752+ 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
23861753 {-
2387− stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1754+ stackTrace <- liftIO $ liftM renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
1755+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23891756 EventRoot _ -> "EventRoot"
23901757 EventNever -> "EventNever"
23911758 _ -> "something else"
23921759 -}
23931760 writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
2394− return oldSubscription
2395− liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
2396− liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
1761+ return $ SomeEventSubscription oldSubscription
1762+ forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1763+ forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
23971764 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23981765 EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
2399− parentHeight <- getEventSubscribedHeight subd'
1766+ parentHeight <- readIORef $ eventSubscribedHeightRef subd'
24001767 myHeight <- readIORef $ switchSubscribedHeight subscribed
24011768 when (parentHeight /= myHeight) $ do
24021769 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
1770+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1771+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> do
1772+ 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
24051773 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24061774 unsubscribe subscription
24071775 mapM_ invalidateCoincidenceHeight mcs
24081776 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
2409− mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
1777+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> revalidateMergeHeight m
24101778 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
24111779 height <- calculateSwitchHeight subscribed
24121780 updateSwitchHeight height subscribed
@@ -2422,12 +1790,10 @@ zeroHeight = Height 0
24221790invalidHeight :: Height
24231791invalidHeight = Height (-1000)
24241792
2425−#ifdef DEBUG_CYCLES
24261793-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
24271794{-# INLINE invalidHeightBeingTraversed #-}
24281795invalidHeightBeingTraversed :: Height
24291796invalidHeightBeingTraversed = Height (-1001)
2430−#endif
24311797
24321798{-# INLINE succHeight #-}
24331799succHeight :: Height -> Height
@@ -2436,42 +1802,152 @@ succHeight h@(Height a) =
24361802 then invalidHeight
24371803 else Height $ succ a
24381804
2439−invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1805+invalidateSubscriberHeight :: Height -> Subscriber a -> IO ()
1806+invalidateSubscriberHeight old s = case s of
1807+ SubscriberPush _ subscribed -> do
1808+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1809+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ invalidateSubscriberHeight old
1810+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1811+ SubscriberMerge _ subscribed -> do
1812+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1813+ removeMergeHeight old subscribed
1814+ invalidateMergeHeight subscribed
1815+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1816+ SubscriberMergeChange _ -> return () -- Doesn't affect the height of the merge, because its changes are delayed
1817+ SubscriberFan subscribed -> do
1818+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1819+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1820+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
1821+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1822+ SubscriberHold _ -> return ()
1823+ SubscriberHoldIdentity _ -> return ()
1824+ SubscriberSwitch subscribed -> do
1825+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1826+ oldHeight <- readIORef $ switchSubscribedHeight subscribed
1827+ when (oldHeight /= invalidHeight) $ do
1828+ writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1829+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1830+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1831+ SubscriberCoincidenceOuter subscribed -> do
1832+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1833+ invalidateCoincidenceHeight subscribed
1834+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1835+ SubscriberCoincidenceInner subscribed -> do
1836+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1837+ invalidateCoincidenceHeight subscribed
1838+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1839+ SubscriberHandle -> return ()
1840+
1841+removeMergeHeight :: Height -> MergeSubscribed k -> IO ()
1842+removeMergeHeight oldParentHeight subscribed = do
1843+ when debugInvalidateHeight $ putStrLn $ "removeMergeHeight: " <> show oldParentHeight <> " Merge" <> showNodeId subscribed
1844+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1845+ let newHeights = heightBagRemove oldParentHeight oldHeights
1846+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1847+
1848+invalidateMergeHeight :: MergeSubscribed k -> IO ()
1849+invalidateMergeHeight subscribed = do
1850+ oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1851+ -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1852+ when (oldHeight /= invalidHeight) $ do
1853+ writeIORef (mergeSubscribedHeight subscribed) $! invalidHeight
1854+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1855+
1856+addMergeHeight :: Height -> MergeSubscribed k -> IO ()
1857+addMergeHeight newParentHeight subscribed = do
1858+ when debugInvalidateHeight $ putStrLn $ "addMergeHeight: " <> show newParentHeight <> " Merge" <> showNodeId subscribed
1859+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1860+ let newHeights = heightBagAdd newParentHeight oldHeights
1861+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1862+
1863+revalidateMergeHeight :: MergeSubscribed k -> IO ()
1864+revalidateMergeHeight subscribed = do
1865+ currentHeight <- readIORef $ mergeSubscribedHeight subscribed
1866+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1867+ heights <- readIORef $ mergeSubscribedHeightBag subscribed
1868+ parents <- readIORef $ mergeSubscribedParents subscribed
1869+ -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1870+ case heightBagSize heights `compare` DMap.size parents of
1871+ LT -> return ()
1872+ EQ -> do
1873+ let height = succHeight $ heightBagMax heights
1874+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1875+ writeIORef (mergeSubscribedHeight subscribed) $! height
1876+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1877+ GT -> error $ "revalidateMergeHeight: more heights than parents for Merge" <> showNodeId subscribed
1878+
1879+invalidateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
24401880invalidateCoincidenceHeight subscribed = do
24411881 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24421882 when (oldHeight /= invalidHeight) $ do
24431883 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
2445−
2446−updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
1884+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1885+
1886+recalculateSubscriberHeight :: Height -> Subscriber a -> IO ()
1887+recalculateSubscriberHeight new s = case s of
1888+ SubscriberPush _ subscribed -> do
1889+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1890+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1891+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1892+ SubscriberMerge _ subscribed -> do
1893+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1894+ addMergeHeight new subscribed
1895+ revalidateMergeHeight subscribed
1896+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1897+ SubscriberMergeChange _ -> return ()
1898+ SubscriberFan subscribed -> do
1899+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1900+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1901+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
1902+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1903+ SubscriberHold _ -> return ()
1904+ SubscriberHoldIdentity _ -> return ()
1905+ SubscriberSwitch subscribed -> do
1906+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1907+ updateSwitchHeight new subscribed
1908+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1909+ SubscriberCoincidenceOuter subscribed -> do
1910+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1911+ recalculateCoincidenceHeight subscribed
1912+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1913+ SubscriberCoincidenceInner subscribed -> do
1914+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1915+ recalculateCoincidenceHeight subscribed
1916+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1917+ SubscriberHandle -> return ()
1918+
1919+updateSwitchHeight :: Height -> SwitchSubscribed a -> IO ()
24471920updateSwitchHeight new subscribed = do
24481921 oldHeight <- readIORef $ switchSubscribedHeight subscribed
24491922 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24501923 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24511924 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1925+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24531926
2454−recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1927+recalculateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
24551928recalculateCoincidenceHeight subscribed = do
24561929 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24571930 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24581931 height <- calculateCoincidenceHeight subscribed
24591932 when (height /= invalidHeight) $ do
24601933 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1934+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1935+
1936+getEventSubscribedHeight :: EventSubscribed a -> IO Height
1937+getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
24621938
2463−calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
2464−calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
1939+calculateSwitchHeight :: SwitchSubscribed a -> IO Height
1940+calculateSwitchHeight subscribed = readIORef . eventSubscribedHeightRef . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
24651941
2466−calculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO Height
1942+calculateCoincidenceHeight :: CoincidenceSubscribed a -> IO Height
24671943calculateCoincidenceHeight subscribed = do
2468− outerHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
2469− innerHeight <- maybe (return zeroHeight) getEventSubscribedHeight =<< readIORef (coincidenceSubscribedInnerParent subscribed)
1944+ outerHeight <- readIORef $ eventSubscribedHeightRef $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1945+ innerHeight <- maybe (return zeroHeight) (readIORef . eventSubscribedHeightRef) =<< readIORef (coincidenceSubscribedInnerParent subscribed)
24701946 return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
24711947
2472−data SomeSwitchSubscribed x = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed x a)
1948+data SomeSwitchSubscribed = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed a)
24731949
2474−invalidate :: IORef [SomeSwitchSubscribed x] -> WeakList (Invalidator x) -> IO (WeakList (Invalidator x))
1950+invalidate :: IORef [SomeSwitchSubscribed] -> WeakList Invalidator -> IO (WeakList Invalidator)
24751951invalidate toReconnectRef wis = do
24761952 forM_ wis $ \wi -> do
24771953 mi <- deRefWeak wi
@@ -2486,7 +1962,7 @@ invalidate toReconnectRef wis = do
24861962 traceInvalidate $ "invalidate: Pull" <> showNodeId p
24871963 mVal <- readIORef $ pullValue p
24881964 forM_ mVal $ \val -> do
2489− writeIORef (pullValue p) Nothing
1965+ writeIORef (pullValue p) $! Nothing
24901966 writeIORef (pullSubscribedInvalidators val) =<< evaluate =<< invalidate toReconnectRef =<< readIORef (pullSubscribedInvalidators val)
24911967 InvalidatorSwitch subscribed -> do
24921968 traceInvalidate $ "invalidate: Switch" <> showNodeId subscribed
@@ -2497,329 +1973,166 @@ invalidate toReconnectRef wis = do
24971973-- Reflex integration
24981974--------------------------------------------------------------------------------
24991975
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
1976+type Spider = SpiderEnv Global
25061977
2507−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
2508− {-# INLINABLE sample #-}
2509− sample (SpiderBehavior b) = readBehaviorUntracked b
2510−
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
1978+data Global
25291979
2530−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531− {-# INLINABLE sample #-}
2532− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
1980+{-# NOINLINE globalSpiderEnv #-}
1981+globalSpiderEnv :: SpiderEnv Global
1982+globalSpiderEnv = unsafePerformIO unsafeNewSpiderEnv
25331983
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
1984+type role SpiderEnv nominal
1985+data SpiderEnv x = SpiderEnv
1986+ { _spiderEnv_toUnsubscribe :: !(IORef [SomeEventSubscription])
1987+ , _spiderEnv_lock :: !(MVar ())
1988+ , _spiderEnv_cleanups :: !(IORef [IO ()])
1989+#ifdef DEBUG
1990+ , _spiderEnv_depth :: !(IORef Int)
1991+#endif
1992+ }
25481993
1994+instance GEq SpiderEnv where
1995+ a `geq` b = if _spiderEnv_toUnsubscribe a == _spiderEnv_toUnsubscribe b
1996+ then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderEnv can't have two different 'x' arguments
1997+ else Nothing
25491998
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'"
1999+unsafeNewSpiderEnv :: forall x. IO (SpiderEnv x)
2000+unsafeNewSpiderEnv = do
2001+ toUnsubscribe <- newIORef []
2002+ lock <- newMVar ()
2003+ cleanups <- newIORef []
2004+#ifdef DEBUG
2005+ depthRef <- newIORef 0
25602006#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)
2007+ return $ SpiderEnv
2008+ { _spiderEnv_toUnsubscribe = toUnsubscribe
2009+ , _spiderEnv_lock = lock
2010+ , _spiderEnv_cleanups = cleanups
2011+#ifdef DEBUG
2012+ , _spiderEnv_depth = depthRef
25842013#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
2014+ }
25882015
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
2016+newSpiderEnv :: IO (Some SpiderEnv)
2017+newSpiderEnv = Some.This <$> unsafeNewSpiderEnv
25912018
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
2019+newtype SpiderPullM x a = SpiderPullM { runSpiderPullM :: BehaviorM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
25942020
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
2021+newtype SpiderPushM x a = SpiderPushM { runSpiderPushM :: ComputeM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2022+
2023+instance R.Reflex (SpiderEnv x) where
2024+ newtype Behavior (SpiderEnv x) a = SpiderBehavior { unSpiderBehavior :: Behavior a }
2025+ newtype Event (SpiderEnv x) a = SpiderEvent { unSpiderEvent :: Event a }
2026+ newtype Dynamic (SpiderEnv x) a = SpiderDynamic { unSpiderDynamic :: Dynamic Identity a } deriving (Functor, Applicative, Monad)
2027+ newtype Incremental (SpiderEnv x) p a = SpiderIncremental { unSpiderIncremental :: Dynamic p a }
2028+ type PullM (SpiderEnv x) = SpiderPullM x
2029+ type PushM (SpiderEnv x) = SpiderPushM x
2030+ {-# INLINABLE never #-}
2031+ never = SpiderEvent EventNever
2032+ {-# INLINABLE constant #-}
2033+ constant = SpiderBehavior . BehaviorConst
2034+ {-# INLINABLE push #-}
2035+ push f = SpiderEvent . push (coerce f) . unSpiderEvent
2036+ {-# INLINABLE pull #-}
2037+ pull = SpiderBehavior . pull . coerce
2038+ {-# INLINABLE merge #-}
2039+ merge = SpiderEvent . merge . DynamicConst . (unsafeCoerce :: DMap k (R.Event (SpiderEnv x)) -> DMap k Event)
2040+ {-# INLINABLE fan #-}
2041+ fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
2042+ {-# INLINABLE switch #-}
2043+ switch = SpiderEvent . switch . (unsafeCoerce :: Behavior (R.Event (SpiderEnv x) a) -> Behavior (Event a)) . unSpiderBehavior
2044+ {-# INLINABLE coincidence #-}
2045+ coincidence = SpiderEvent . coincidence . (unsafeCoerce :: Event (R.Event (SpiderEnv x) a) -> Event (Event a)) . unSpiderEvent
2046+ {-# INLINABLE current #-}
2047+ current = SpiderBehavior . current . unSpiderDynamic
2048+ {-# INLINABLE updated #-}
2049+ updated = SpiderEvent . fmap runIdentity . updated . unSpiderDynamic
2050+ {-# INLINABLE unsafeBuildDynamic #-}
2051+ unsafeBuildDynamic readV0 v' = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (coerce readV0) $ addIdentity $ unSpiderEvent v'
2052+ {-# INLINABLE unsafeBuildIncremental #-}
2053+ unsafeBuildIncremental readV0 dv = SpiderIncremental $ DynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
2054+ {-# INLINABLE mergeIncremental #-}
2055+ mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic R.PatchDMap (DMap k (R.Event (SpiderEnv x))) -> Dynamic R.PatchDMap (DMap k Event)) . unSpiderIncremental
2056+ {-# INLINABLE currentIncremental #-}
2057+ currentIncremental = SpiderBehavior . current . unSpiderIncremental
2058+ {-# INLINABLE updatedIncremental #-}
2059+ updatedIncremental = SpiderEvent . updated . unSpiderIncremental
2060+ {-# INLINABLE incrementalToDynamic #-}
2061+ incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ current i) $ flip push (updated i) $ \p -> do
2062+ c <- readBehaviorUntracked $ current i
2063+ return $ fmap Identity $ R.apply p c --TODO: Avoid the redundant 'apply'
25972064
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
2065+instance R.MonadSample (SpiderEnv x) (EventM x) where
2066+ {-# INLINABLE sample #-}
2067+ sample (SpiderBehavior b) = readBehaviorUntracked b
26002068
2601−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
2069+instance R.MonadHold (SpiderEnv x) (EventM x) where
26022070 {-# INLINABLE hold #-}
2603− hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
2071+ hold = holdSpiderEventM
26042072 {-# INLINABLE holdDyn #-}
2605− holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
2073+ holdDyn = holdDynSpiderEventM
26062074 {-# 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
2075+ holdIncremental = holdIncrementalSpiderEventM
2076+
2077+holdSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Behavior (SpiderEnv x) a)
2078+holdSpiderEventM v0 e = liftM (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
26182079
2619−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2080+holdDynSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Dynamic (SpiderEnv x) a)
2081+holdDynSpiderEventM v0 e = liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2082+
2083+holdIncrementalSpiderEventM :: R.Patch p => a -> R.Event (SpiderEnv x) (p a) -> EventM x (R.Incremental (SpiderEnv x) p a)
2084+holdIncrementalSpiderEventM v0 e = liftM (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2085+
2086+instance R.MonadHold (SpiderEnv x) (SpiderHost x) where
26202087 {-# INLINABLE hold #-}
2621− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2088+ hold v0 e = R.runHostFrame $ R.hold v0 e
26222089 {-# INLINABLE holdDyn #-}
2623− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2090+ holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
26242091 {-# 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
2092+ holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
2093+
2094+instance R.MonadSample (SpiderEnv x) (SpiderHost x) where
26352095 {-# INLINABLE sample #-}
26362096 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
26372097
2638−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2098+instance R.MonadSample (SpiderEnv x) (SpiderPullM x) where
2099+ {-# INLINABLE sample #-}
2100+ sample = coerce . readBehaviorTracked . unSpiderBehavior
2101+
2102+instance R.MonadSample (SpiderEnv x) (SpiderPushM x) where
26392103 {-# INLINABLE sample #-}
2640− sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
2104+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
26412105
2642−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2106+instance R.MonadHold (SpiderEnv x) (SpiderPushM x) where
26432107 {-# INLINABLE hold #-}
2644− hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
2108+ hold v0 e = R.current <$> R.holdDyn v0 e
26452109 {-# INLINABLE holdDyn #-}
2646− holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
2110+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity e
26472111 {-# 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
2112+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ liftM (SpiderIncremental . DynamicHold) $ hold v0 e
26552113
2656−--------------------------------------------------------------------------------
2657−-- Deprecated items
2658−--------------------------------------------------------------------------------
2114+data RootTrigger a = forall k. GCompare k => RootTrigger (SubscriberList a, IORef (DMap k Identity), k a)
2115+newtype SpiderEventHandle a = SpiderEventHandle { unSpiderEventHandle :: EventSubscription a }
26592116
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
2117+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHostFrame x) where
26642118 {-# INLINABLE subscribeEvent #-}
26652119 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
2120+ subscription <- subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2121+ return $ SpiderEventHandle subscription
2122+
2123+instance R.ReflexHost (SpiderEnv x) where
2124+ type EventTrigger (SpiderEnv x) = RootTrigger
2125+ type EventHandle (SpiderEnv x) = SpiderEventHandle
2126+ type HostFrame (SpiderEnv x) = SpiderHostFrame x
2127+
2128+instance R.MonadReadEvent (SpiderEnv x) (ReadPhase x) where
2129+ {-# INLINABLE readEvent #-}
2130+ readEvent h = ReadPhase $ liftM (fmap return) $ liftIO $ do
2131+ let EventSubscription sln subscribed = unSpiderEventHandle h
2132+ result <- readEventSubscribed subscribed
2133+ touch sln
26902134 return result
26912135
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−
28232136instance MonadRef (EventM x) where
28242137 type Ref (EventM x) = Ref IO
28252138 {-# INLINABLE newRef #-}
@@ -2833,8 +2146,7 @@ instance MonadAtomicRef (EventM x) where
28332146 {-# INLINABLE atomicModifyRef #-}
28342147 atomicModifyRef r f = liftIO $ atomicModifyRef r f
28352148
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)
2149+newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28382150
28392151instance Monad (SpiderHost x) where
28402152 {-# INLINABLE (>>=) #-}
@@ -2843,27 +2155,13 @@ instance Monad (SpiderHost x) where
28432155 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442156 {-# INLINABLE return #-}
28452157 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
28522158 {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2159+ fail s = SpiderHost $ fail s
28542160
2855−-- | Run an action affecting the global Spider timeline; this will be guarded by
2856−-- a mutex for that timeline
28572161runSpiderHost :: SpiderHost Global a -> IO a
2858−runSpiderHost (SpiderHost a) = a
2859−
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
2162+runSpiderHost (SpiderHost a) = runReaderT a globalSpiderEnv
28642163
2865−newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866− deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2164+newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28672165
28682166instance Monad (SpiderHostFrame x) where
28692167 {-# INLINABLE (>>=) #-}
@@ -2872,21 +2170,30 @@ instance Monad (SpiderHostFrame x) where
28722170 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732171 {-# INLINABLE return #-}
28742172 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762173 {-# INLINABLE fail #-}
28772174 fail s = SpiderHostFrame $ fail s
2878−#endif
28792175
2880−instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2881− notReadyUntil _ = pure ()
2882− notReady = pure ()
2176+instance R.MonadSample (SpiderEnv x) (SpiderHostFrame x) where
2177+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2178+
2179+addIdentity :: Event a -> Event (Identity a)
2180+--addIdentity = fmap Identity
2181+addIdentity = unsafeCoerce
2182+
2183+instance R.MonadHold (SpiderEnv x) (SpiderHostFrame x) where
2184+ {-# INLINABLE hold #-}
2185+ hold v0 e = SpiderHostFrame $ liftM (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2186+ {-# INLINABLE holdDyn #-}
2187+ holdDyn v0 e = SpiderHostFrame $ liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2188+ {-# INLINABLE holdIncremental #-}
2189+ holdIncremental v0 e = SpiderHostFrame $ liftM (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
28832190
2884−newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2191+newEventWithTriggerIO :: forall a. (RootTrigger a -> IO (IO ())) -> IO (Event a)
28852192newEventWithTriggerIO f = do
28862193 es <- newFanEventWithTriggerIO $ \Refl -> f
28872194 return $ select es Refl
28882195
2889−newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2196+newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger a -> IO (IO ())) -> IO (EventSelector k)
28902197newFanEventWithTriggerIO f = do
28912198 occRef <- newIORef DMap.empty
28922199 subscribedRef <- newIORef DMap.empty
@@ -2895,9 +2202,47 @@ newFanEventWithTriggerIO f = do
28952202 , rootSubscribed = subscribedRef
28962203 , rootInit = f
28972204 }
2898− return $ EventSelector $ \k -> eventRoot k r
2205+ return $ EventSelector $ \k -> EventRoot k r
2206+
2207+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHost x) where
2208+ newEventWithTrigger = SpiderHost . lift . liftM SpiderEvent . newEventWithTriggerIO
2209+ newFanEventWithTrigger f = SpiderHost $ lift $ do
2210+ es <- newFanEventWithTriggerIO f
2211+ return $ R.EventSelector $ SpiderEvent . select es
2212+
2213+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHostFrame x) where
2214+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . liftM SpiderEvent . newEventWithTriggerIO
2215+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2216+ es <- newFanEventWithTriggerIO f
2217+ return $ R.EventSelector $ SpiderEvent . select es
2218+
2219+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHost x) where
2220+ {-# INLINABLE subscribeEvent #-}
2221+ subscribeEvent = subscribeEventSpiderHost
2222+
2223+subscribeEventSpiderHost :: R.Event (SpiderEnv x) a -> SpiderHost x (R.EventHandle (SpiderEnv x) a)
2224+subscribeEventSpiderHost e = do
2225+ subscription <- runFrame $ subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2226+ return $ SpiderEventHandle subscription
2227+
2228+newtype ReadPhase x a = ReadPhase { runReadPhase :: ResultM x a } deriving (Functor, Applicative, Monad, MonadFix)
2229+
2230+instance R.MonadSample (SpiderEnv x) (ReadPhase x) where
2231+ {-# INLINABLE sample #-}
2232+ sample = ReadPhase . R.sample
28992233
2900−newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
2234+instance R.MonadHold (SpiderEnv x) (ReadPhase x) where
2235+ {-# INLINABLE hold #-}
2236+ hold v0 e = ReadPhase $ R.hold v0 e
2237+ {-# INLINABLE holdDyn #-}
2238+ holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2239+ {-# INLINABLE holdIncremental #-}
2240+ holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2241+
2242+instance R.MonadReflexHost (SpiderEnv x) (SpiderHost x) where
2243+ type ReadPhase (SpiderHost x) = ReadPhase x
2244+ fireEventsAndRead es (ReadPhase a) = run es a
2245+ runHostFrame = runFrame . runSpiderHostFrame
29012246
29022247instance MonadRef (SpiderHost x) where
29032248 type Ref (SpiderHost x) = Ref IO
@@ -2916,15 +2261,3 @@ instance MonadRef (SpiderHostFrame x) where
29162261
29172262instance MonadAtomicRef (SpiderHostFrame x) where
29182263 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 ()